Lines Matching refs:Right
78 if( Right() ) in EnumNodes()
79 Right()->EnumNodes( aLink ); in EnumNodes()
101 for( nEle = 0; pTmp->Right(); nEle++ ) in ChangeDLListBTree()
102 pTmp = pTmp->Right(); in ChangeDLListBTree()
106 pMiddle = pMiddle->Right(); in ChangeDLListBTree()
114 if( NULL != (pRightNode = pMiddle->Right()) ) in ChangeDLListBTree()
138 if( Right() ){ in ChangeBTreeDLList()
139 pList = Right()->ChangeBTreeDLList(); in ChangeBTreeDLList()
146 while( pLL_RN->Right() ) in ChangeBTreeDLList()
147 pLL_RN = pLL_RN->Right(); in ChangeBTreeDLList()
172 if( pRemove->Right() ) in Remove()
173 pParent->Insert( pRemove->Right() ); in Remove()
175 else if( pParent->Right() in Remove()
176 && (EQUAL == pRemove->Compare( pParent->Right() ) ) ){ in Remove()
177 pParent->pRight = pRemove->Right(); in Remove()
183 if( Right() ){ in Remove()
184 pRoot = Right(); in Remove()
186 Right()->Insert( Left() ); in Remove()
248 if( Right() ){ in SearchParent()
249 if( ((NameNode *)Right())->Compare( pSearch ) == EQUAL ) in SearchParent()
251 return ((NameNode *)Right())->SearchParent( pSearch ); in SearchParent()
277 if( Right() ) in Search()
278 return ((NameNode *)Right())->Search( pSearch ); in Search()
297 if( Right() ) in Search()
298 return ((NameNode *)Right())->Search( pSearch ); in Search()
331 if( Right() ) in Insert()
332 bRet = ((NameNode *)Right())->Insert( pTN, pnDepth ); in Insert()
362 if( Right() ) in Insert()
363 pRight = ChangeDLListBTree( Right()->ChangeBTreeDLList() ); in Insert()
381 NameNode * pTmpRight = (NameNode *)Right(); in OrderTree()
392 NameNode * pTmpRight = (NameNode *)pOrderNode->Right(); in SubOrderTree()