diff options
| author | Timothy Pearson <kb9vqf@pearsoncomputing.net> | 2011-12-19 12:00:33 -0600 | 
|---|---|---|
| committer | Slávek Banko <slavek.banko@axis.cz> | 2012-06-23 19:35:16 +0200 | 
| commit | ec049c7c32d50faf317b13d5c844a19978881fc3 (patch) | |
| tree | ca9b445d4cba887b9161fddd3ba714e1d7b5060b /lib/antlr/src | |
| parent | 1c082a5ba751ddd4edd36bb0061462f9a999f88d (diff) | |
| download | tdevelop-ec049c7c32d50faf317b13d5c844a19978881fc3.tar.gz tdevelop-ec049c7c32d50faf317b13d5c844a19978881fc3.zip | |
Remove additional unneeded tq method conversions
(cherry picked from commit 7e66d7c3611d907ea28b140281b472bb1c406be6)
Diffstat (limited to 'lib/antlr/src')
| -rw-r--r-- | lib/antlr/src/ASTFactory.cpp | 10 | ||||
| -rw-r--r-- | lib/antlr/src/BaseAST.cpp | 12 | 
2 files changed, 11 insertions, 11 deletions
| diff --git a/lib/antlr/src/ASTFactory.cpp b/lib/antlr/src/ASTFactory.cpp index a255ca10..98ce6b7a 100644 --- a/lib/antlr/src/ASTFactory.cpp +++ b/lib/antlr/src/ASTFactory.cpp @@ -217,7 +217,7 @@ RefAST ASTFactory::dupList(RefAST t)  RefAST ASTFactory::dupTree(RefAST t)  {  	RefAST result = dup(t);		// make copy of root -	// copy all tqchildren of root. +	// copy all children of root.  	if( t )  		result->setFirstChild( dupList(t->getFirstChild()) );  	return result; @@ -225,7 +225,7 @@ RefAST ASTFactory::dupTree(RefAST t)  /** Make a tree from a list of nodes.  The first element in the   * array is the root.  If the root is null, then the tree is - * a simple list not a tree.  Handles null tqchildren nodes correctly. + * a simple list not a tree.  Handles null children nodes correctly.   * For example, make(a, b, null, c) yields tree (a b c).  make(null,a,b)   * yields tree (nil a b).   */ @@ -240,7 +240,7 @@ RefAST ASTFactory::make(ANTLR_USE_NAMESPACE(std)vector<RefAST>& nodes)  	if( root )  		root->setFirstChild(RefAST(nullASTptr));	// don't leave any old pointers set -	// link in tqchildren; +	// link in children;  	for( unsigned int i = 1; i < nodes.size(); i++ )  	{  		if ( nodes[i] == 0 )		// ignore null nodes @@ -336,7 +336,7 @@ void ASTFactory::loadChildren( ANTLR_USE_NAMESPACE(std)istream& infile,  {  	char ch; -	for(;;)			// for all tqchildren of this node.... +	for(;;)			// for all children of this node....  	{  		eatwhite(infile); @@ -438,7 +438,7 @@ RefAST ASTFactory::LoadAST( ANTLR_USE_NAMESPACE(std)istream& infile )  	infile.get(ch);  	// now if we have a '/' here it's a single node. If it's a '>' we get -	// a tree with tqchildren +	// a tree with children  	if( ch == '/' )  	{ diff --git a/lib/antlr/src/BaseAST.cpp b/lib/antlr/src/BaseAST.cpp index 17d8de68..f10f1e16 100644 --- a/lib/antlr/src/BaseAST.cpp +++ b/lib/antlr/src/BaseAST.cpp @@ -47,7 +47,7 @@ void BaseAST::doWorkForFindAll(  				(!partialMatch && sibling->equalsTree(target)) ) {  			v.push_back(sibling);  		} -		// regardless of match or not, check any tqchildren for matches +		// regardless of match or not, check any children for matches  		if ( sibling->getFirstChild() ) {  			RefBaseAST(sibling->getFirstChild())->doWorkForFindAll(v, target, partialMatch);  		} @@ -70,7 +70,7 @@ bool BaseAST::equalsList(RefAST t) const  		// as a quick optimization, check roots first.  		if (!sibling->equals(t))  			return false; -		// if roots match, do full list match test on tqchildren. +		// if roots match, do full list match test on children.  		if (sibling->getFirstChild()) {  			if (!sibling->getFirstChild()->equalsList(t->getFirstChild()))  				return false; @@ -103,7 +103,7 @@ bool BaseAST::equalsListPartial(RefAST sub) const  		// as a quick optimization, check roots first.  		if (!sibling->equals(sub))  			return false; -		// if roots match, do partial list match test on tqchildren. +		// if roots match, do partial list match test on children.  		if (sibling->getFirstChild())  			if (!sibling->getFirstChild()->equalsListPartial(sub->getFirstChild()))  				return false; @@ -125,7 +125,7 @@ bool BaseAST::equalsTree(RefAST t) const  	// check roots first  	if (!equals(t))  		return false; -	// if roots match, do full list match test on tqchildren. +	// if roots match, do full list match test on children.  	if (getFirstChild()) {  		if (!getFirstChild()->equalsList(t->getFirstChild()))  			return false; @@ -149,7 +149,7 @@ bool BaseAST::equalsTreePartial(RefAST sub) const  	// check roots first  	if (!equals(sub))  		return false; -	// if roots match, do full list partial match test on tqchildren. +	// if roots match, do full list partial match test on children.  	if (getFirstChild())  		if (!getFirstChild()->equalsListPartial(sub->getFirstChild()))  			return false; @@ -256,7 +256,7 @@ void BaseAST::toStream( ANTLR_USE_NAMESPACE(std)ostream& out ) const  		if( need_close_tag )  		{ -			// got tqchildren so write them... +			// got children so write them...  			if( node->getFirstChild() != 0 )  				node->getFirstChild()->toStream( out ); | 
