Lines Matching refs:NameNode
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()
250 return (NameNode *)this; in SearchParent()
251 return ((NameNode *)Right())->SearchParent( pSearch ); in SearchParent()
254 return( (NameNode *)NULL ); in SearchParent()
266 NameNode* NameNode::Search( const NameNode * pSearch ) const{ in Search()
274 return ((NameNode *)Left())->Search( pSearch ); in Search()
278 return ((NameNode *)Right())->Search( pSearch ); in Search()
281 return( (NameNode *)this ); in Search()
286 NameNode* NameNode::Search( const void * pSearch ) const{ in Search()
294 return ((NameNode *)Left())->Search( pSearch ); in Search()
298 return ((NameNode *)Right())->Search( pSearch ); in Search()
301 return( (NameNode *)this ); in Search()
315 sal_Bool NameNode::Insert( NameNode * pTN, sal_uInt32* pnDepth ){ in Insert()
326 bRet = ((NameNode *)Left())->Insert( pTN, pnDepth ); in Insert()
332 bRet = ((NameNode *)Right())->Insert( pTN, pnDepth ); in Insert()
350 sal_Bool NameNode::Insert( NameNode * pTN ){ in Insert()
379 void NameNode::OrderTree(){ in OrderTree()
380 NameNode * pTmpLeft = (NameNode *)Left(); in OrderTree()
381 NameNode * pTmpRight = (NameNode *)Right(); in OrderTree()
389 void NameNode::SubOrderTree( NameNode * pOrderNode ){ in SubOrderTree()
391 NameNode * pTmpLeft = (NameNode *)pOrderNode->Left(); in SubOrderTree()
392 NameNode * pTmpRight = (NameNode *)pOrderNode->Right(); in SubOrderTree()
412 NameNode * pName;
413 DECL_LINK( CallBackFunc, NameNode * );
416 sal_Bool IsOrder( const NameNode * pRoot ) in IsOrder()
424 IMPL_LINK_INLINE_START( OrderCtrl, CallBackFunc, NameNode *, pNext ) in IMPL_LINK_INLINE_START() argument
431 IMPL_LINK_INLINE_END( OrderCtrl, CallBackFunc, NameNode *, pNext ) in IMPL_LINK_INLINE_END() argument
433 sal_Bool NameNode::IsOrderTree() const{ in IMPL_LINK_INLINE_END()
450 return( (IdNode *)NameNode::Search( (const void *)&nTypeName ) ); in Search()
462 COMPARE IdNode::Compare( const NameNode * pSearch ) const in Compare()
507 return (StringNode *)NameNode::Search( (const void *)pSearch ); in Search()
519 COMPARE StringNode::Compare( const NameNode * pSearch ) const in Compare()