Lines Matching refs:p
46 StgAvlNode* p = this; in Find() local
47 while( p ) in Find()
49 short nRes = p->Compare( pFind ); in Find()
51 return p; in Find()
52 else p = ( nRes < 0 ) ? p->pLeft : p->pRight; in Find()
224 StgAvlNode* StgAvlNode::Rem( StgAvlNode** p, StgAvlNode* pDel, sal_Bool bPtrs ) in Rem() argument
226 if( p && *p && pDel ) in Rem()
228 StgAvlNode* pCur = *p; in Rem()
235 *p = pCur->pLeft; pCur->pLeft = NULL; in Rem()
239 *p = pCur->pRight; pCur->pRight = NULL; in Rem()
259 *p = l; in Rem()
395 StgAvlIterator::StgAvlIterator( StgAvlNode* p ) in StgAvlIterator() argument
397 pRoot = p; in StgAvlIterator()
399 if( p ) in StgAvlIterator()
400 p->StgEnum( nCount ); in StgAvlIterator()
405 StgAvlNode* p = pRoot; in Find() local
406 while( p ) in Find()
408 if( n == p->nId ) in Find()
410 else p = ( n < p->nId ) ? p->pLeft : p->pRight; in Find()
412 return p; in Find()