Lines Matching refs:i
108 for (sal_uInt16 i = 0; i < rIndex.getHeader().db_maxkeys;i++) in QueryDelete() local
110 if (ppNodes[i].GetChild().Is()) in QueryDelete()
111 ppNodes[i].GetChild()->Release(sal_False); in QueryDelete()
113 ppNodes[i] = ONDXNode(); in QueryDelete()
138 sal_uInt16 i = 0; in FindPos() local
139 while (i < nCount && rKey > ((*this)[i]).GetKey()) in FindPos()
140 i++; in FindPos()
142 return i; in FindPos()
153 sal_uInt16 i = 0; in Find() local
154 while (i < nCount && rKey > ((*this)[i]).GetKey()) in Find()
155 i++; in Find()
162 ONDXPagePtr aPage = (i==0) ? GetChild(&rIndex) : ((*this)[i-1]).GetChild(&rIndex, this); in Find()
165 else if (i == nCount) in Find()
168 rIndex.m_nCurNode = i - 1; in Find()
173 bResult = rKey == ((*this)[i]).GetKey(); in Find()
175 rIndex.m_nCurNode = bResult ? i : i - 1; in Find()
314 for (sal_uInt16 i = std::min((sal_uInt16)(nMaxCount-1), (sal_uInt16)(nCount-1)); nPos < i; --i) in Insert() local
315 (*this)[i] = (*this)[i-1]; in Insert()
351 for (sal_uInt16 i = 0; i < rIndex.getHeader().db_maxkeys;i++) in Release() local
353 if (ppNodes[i].GetChild()) in Release()
354 ppNodes[i].GetChild()->Release(bSave); in Release()
356 ppNodes[i].GetChild().Clear(); in Release()
475 for (sal_uInt16 i = (nCount - (nCount / 2)), j = 0 ; i < nCount; i++) in Split() local
476 rPage.Insert(j++,(*this)[i]); in Split()
490 for (sal_uInt16 i = (nCount + 1) / 2 + 1, j = 0 ; i < nCount; i++) in Split() local
491 rPage.Insert(j++,(*this)[i]); in Split()
619 for (sal_uInt16 i = 0 ; i < xPage->Count(); i++) in Merge() local
620 Append((*xPage)[i]); in Merge()
890 for (sal_uInt16 i = 0; i < rPage.nCount; i++) in operator >>() local
891 rPage[i].Read(rStream, rPage.GetIndex()); in operator >>()
915 sal_uInt16 i = 0; in operator <<() local
916 for (; i < rPage.nCount; i++) in operator <<()
917 rPage[i].Write(rStream, rPage); in operator <<()
920 if(i < rPage.rIndex.getHeader().db_maxkeys) in operator <<()
944 for (sal_uInt16 i = 0; i < nCount; i++) in PrintPage() local
946 ONDXNode rNode = (*this)[i]; in PrintPage()
969 for (sal_uInt16 i = 0; i < nCount; i++) in PrintPage() local
971 ONDXNode rNode = (*this)[i]; in PrintPage()
989 sal_uInt16 i = NODE_NOTFOUND; in Search() local
990 while (++i < Count()) in Search()
991 if ((*this)[i].GetKey() == rSearch) in Search()
994 return (i < Count()) ? i : NODE_NOTFOUND; in Search()
1000 sal_uInt16 i = NODE_NOTFOUND; in Search() local
1001 while (++i < Count()) in Search()
1002 if (((*this)[i]).GetChild() == pPage) in Search()
1007 return (i < Count()) ? i : NODE_NOTFOUND; in Search()
1048 for (sal_uInt16 i = nPos; i < (nCount-1); i++) in Remove() local
1049 (*this)[i] = (*this)[i+1]; in Remove()