Searched refs:NameNode (Results 1 – 4 of 4) sorted by relevance
164 NameNode * NameNode::Remove( NameNode * pRemove ){ in Remove()165 NameNode * pRoot = this; in Remove()166 NameNode * pParent = SearchParent( pRemove ); in Remove()207 COMPARE NameNode::Compare( const NameNode * pCompare ) const{ in Compare()216 COMPARE NameNode::Compare( const void * pCompare ) const{ in Compare()234 NameNode* NameNode::SearchParent( const NameNode * pSearch ) const{ in SearchParent()242 if( ((NameNode *)Left())->Compare( pSearch ) == EQUAL ) in SearchParent()243 return (NameNode *)this; in SearchParent()244 return ((NameNode *)Left())->SearchParent( pSearch ); in SearchParent()249 if( ((NameNode *)Right())->Compare( pSearch ) == EQUAL ) in SearchParent()[all …]
56 class NameNode : public BiNode class58 void SubOrderTree( NameNode * pOrderNode );62 NameNode* Search( const void * pCmp ) const;65 NameNode* Left() const { return (NameNode *)pLeft ; }; in Left()66 NameNode* Right() const{ return (NameNode *)pRight ; }; in Right()67 NameNode* Search( const NameNode * pName ) const;69 sal_Bool Insert( NameNode * pTN, sal_uInt32 * nDepth );70 sal_Bool Insert( NameNode* pTN );71 virtual COMPARE Compare( const NameNode * ) const;73 NameNode* SearchParent( const NameNode * ) const;[all …]
52 using NameNode::Search;55 using NameNode::Insert;81 using NameNode::Search;84 using NameNode::Insert;
37 using NameNode::Search;