Lines Matching refs:nCount
79 ,nCount(0) in ONDXPage()
117 nCount = 0; in QueryDelete()
139 while (i < nCount && rKey > ((*this)[i]).GetKey()) in FindPos()
154 while (i < nCount && rKey > ((*this)[i]).GetKey()) in Find()
165 else if (i == nCount) in Find()
195 aSplitNode = (*this)[nCount-1]; in Insert()
204 --nCount; // (sonst bekomme ich u.U. Assertions und GPFs - 60593) in Insert()
210 while (++nPos < nCount && rNode.GetKey() > ((*this)[nPos]).GetKey()) ; in Insert()
212 --nCount; // (sonst bekomme ich u.U. Assertions und GPFs - 60593) in Insert()
219 nCount++; in Insert()
254 aInnerNode = (*this)[nCount - 1]; in Insert()
289 rIndex.m_nCurNode = nCount - 1; in Insert()
310 if (nCount) in Insert()
312 ++nCount; in Insert()
314 for (sal_uInt16 i = std::min((sal_uInt16)(nMaxCount-1), (sal_uInt16)(nCount-1)); nPos < i; --i) in Insert()
318 if (nCount < nMaxCount) in Insert()
319 nCount++; in Insert()
339 return Insert(nCount, rNode); in Append()
383 if (nNodePos == (nCount - 1)) in Delete()
398 if (HasParent() && nCount < (rIndex.GetMaxNodes() / 2)) in Delete()
475 for (sal_uInt16 i = (nCount - (nCount / 2)), j = 0 ; i < nCount; i++) in Split()
480 ONDXNode aLastNode = (*this)[nCount - 1]; in Split()
481 nCount = nCount - (nCount / 2); in Split()
482 aResultNode = (*this)[nCount - 1]; in Split()
490 for (sal_uInt16 i = (nCount + 1) / 2 + 1, j = 0 ; i < nCount; i++) in Split()
493 aResultNode = (*this)[(nCount + 1) / 2]; in Split()
494 nCount = (nCount + 1) / 2; in Split()
573 aParent->SearchAndReplace((*this)[nLastNode].GetKey(),(*this)[nCount-1].GetKey()); in Merge()
584 ONDXNode aReplaceNode = (*this)[nCount - 1]; in Merge()
585 while (nCount < nMaxNodes_2) in Merge()
591 aParent->SearchAndReplace(aReplaceNode.GetKey(),(*this)[nCount-1].GetKey()); in Merge()
596 ONDXNode aReplaceNode = (*this)[nCount - 1]; in Merge()
599 xPage->Insert(0,(*this)[nCount-1]); in Merge()
600 Remove(nCount-1); in Merge()
669 while (nCount < nMaxNodes_2) in Merge()
681 while (nCount < nMaxNodes_2) in Merge()
887 rPage.nCount = sal_uInt16(nValue); in operator >>()
890 for (sal_uInt16 i = 0; i < rPage.nCount; i++) in operator >>()
912 nValue = rPage.nCount; in operator <<()
916 for (; i < rPage.nCount; i++) in operator <<()
942 nPagePos, HasParent() ? aParent->GetPagePos() : 0 ,nCount, aChild.GetPagePos()); in PrintPage()
944 for (sal_uInt16 i = 0; i < nCount; i++) in PrintPage()
969 for (sal_uInt16 i = 0; i < nCount; i++) in PrintPage()
1033 DBG_ASSERT(nCount > nPos, "falscher Indexzugriff"); in operator []()
1040 DBG_ASSERT(nCount > nPos, "falscher Indexzugriff"); in operator []()
1046 DBG_ASSERT(nCount > nPos, "falscher Indexzugriff"); in Remove()
1048 for (sal_uInt16 i = nPos; i < (nCount-1); i++) in Remove()
1051 nCount--; in Remove()