Lines Matching refs:GetKey
139 while (i < nCount && rKey > ((*this)[i]).GetKey()) in FindPos()
154 while (i < nCount && rKey > ((*this)[i]).GetKey()) in Find()
173 bResult = rKey == ((*this)[i]).GetKey(); in Find()
196 if(rNode.GetKey() <= aSplitNode.GetKey()) in Insert()
210 while (++nPos < nCount && rNode.GetKey() > ((*this)[nPos]).GetKey()) ; in Insert()
262 aInnerNode.GetKey().ResetRecord(); in Insert()
294 sal_uInt16 nNodePos = FindPos(rNode.GetKey()); in Insert()
389 aParent->SearchAndReplace(aNode.GetKey(), in Delete()
390 (*this)[nNodePos-1].GetKey()); in Delete()
485 aParent->SearchAndReplace(aLastNode.GetKey(), in Split()
486 aResultNode.GetKey()); in Split()
504 aResultNode.GetKey().ResetRecord(); in Split()
521 …sal_Bool bRight = ((*xPage)[0].GetKey() > (*this)[0].GetKey()); // sal_True, wenn xPage die rec… in Merge()
573 aParent->SearchAndReplace((*this)[nLastNode].GetKey(),(*this)[nCount-1].GetKey()); in Merge()
591 aParent->SearchAndReplace(aReplaceNode.GetKey(),(*this)[nCount-1].GetKey()); in Merge()
603 aParent->SearchAndReplace(aReplaceNode.GetKey(),(*this)[Count()-1].GetKey()); in Merge()
659 …aParent->SearchAndReplace((*aParent)[nParentNodePos-1].GetKey(),(*aParent)[nParentNodePos].GetKey(… in Merge()
947 ONDXKey& rKey = rNode.GetKey(); in PrintPage()
991 if ((*this)[i].GetKey() == rSearch) in Search()
1025 (*pPage)[nPos].GetKey() = rReplace; in SearchAndReplace()