Lines Matching refs:Left
75 if( Left() ) in EnumNodes()
76 Left()->EnumNodes( aLink ); in EnumNodes()
98 while( pList->Left() ) in ChangeDLListBTree()
99 pList = pList->Left(); in ChangeDLListBTree()
110 if( NULL != (pTmp = pMiddle->Left()) ) // rechten Zeiger auf Null in ChangeDLListBTree()
144 if( Left() ){ in ChangeBTreeDLList()
145 pLL_RN = pList = Left()->ChangeBTreeDLList(); in ChangeBTreeDLList()
169 if( pParent->Left() in Remove()
170 && (EQUAL == pRemove->Compare( pParent->Left() ) ) ){ in Remove()
171 pParent->pLeft = pRemove->Left(); in Remove()
178 if( pRemove->Left() ) in Remove()
179 pParent->Insert( pRemove->Left() ); in Remove()
185 if( Left() ) in Remove()
186 Right()->Insert( Left() ); in Remove()
189 pRoot = Left(); in Remove()
241 if( Left() ){ in SearchParent()
242 if( ((NameNode *)Left())->Compare( pSearch ) == EQUAL ) in SearchParent()
244 return ((NameNode *)Left())->SearchParent( pSearch ); in SearchParent()
273 if( Left() ) in Search()
274 return ((NameNode *)Left())->Search( pSearch ); in Search()
293 if( Left() ) in Search()
294 return ((NameNode *)Left())->Search( pSearch ); in Search()
325 if( Left() ) in Insert()
326 bRet = ((NameNode *)Left())->Insert( pTN, pnDepth ); in Insert()
360 if( Left() ) in Insert()
361 pLeft = ChangeDLListBTree( Left()->ChangeBTreeDLList() ); in Insert()
380 NameNode * pTmpLeft = (NameNode *)Left(); in OrderTree()
391 NameNode * pTmpLeft = (NameNode *)pOrderNode->Left(); in SubOrderTree()