Lines Matching refs:sal_uInt16
84 sal_uInt16 nT = rIndex.getHeader().db_maxkeys; in ONDXPage()
108 for (sal_uInt16 i = 0; i < rIndex.getHeader().db_maxkeys;i++) in QueryDelete()
135 sal_uInt16 ONDXPage::FindPos(const ONDXKey& rKey) const in FindPos()
138 sal_uInt16 i = 0; in FindPos()
153 sal_uInt16 i = 0; in Find()
209 sal_uInt16 nPos = NODE_NOTFOUND; in Insert()
294 sal_uInt16 nNodePos = FindPos(rNode.GetKey()); in Insert()
304 sal_Bool ONDXPage::Insert(sal_uInt16 nPos, ONDXNode& rNode) in Insert()
306 sal_uInt16 nMaxCount = rIndex.getHeader().db_maxkeys; in Insert()
314 for (sal_uInt16 i = std::min((sal_uInt16)(nMaxCount-1), (sal_uInt16)(nCount-1)); nPos < i; --i) in Insert()
351 for (sal_uInt16 i = 0; i < rIndex.getHeader().db_maxkeys;i++) in Release()
370 sal_uInt16 nParentPos = aTempParent->Search(this); in ReleaseFull()
378 sal_Bool ONDXPage::Delete(sal_uInt16 nNodePos) in Delete()
401 sal_uInt16 nParentNodePos = aParent->Search(this); in Delete()
475 for (sal_uInt16 i = (nCount - (nCount / 2)), j = 0 ; i < nCount; i++) in Split()
490 for (sal_uInt16 i = (nCount + 1) / 2 + 1, j = 0 ; i < nCount; i++) in Split()
510 void ONDXPage::Merge(sal_uInt16 nParentNodePos, ONDXPagePtr xPage) in Merge()
517 sal_uInt16 nMaxNodes = rIndex.GetMaxNodes(), in Merge()
522 sal_uInt16 nNewCount = (*xPage).Count() + Count(); in Merge()
529 sal_uInt16 nLastNode = bRight ? Count() - 1 : xPage->Count() - 1; in Merge()
619 for (sal_uInt16 i = 0 ; i < xPage->Count(); i++) in Merge()
714 sal_uInt16 nLen = rIndex.getHeader().db_keylen; in Read()
887 rPage.nCount = sal_uInt16(nValue); in operator >>()
890 for (sal_uInt16 i = 0; i < rPage.nCount; i++) in operator >>()
915 sal_uInt16 i = 0; in operator <<()
923 sal_uInt16 nBufferSize = rStream.GetBufferSize(); in operator <<()
944 for (sal_uInt16 i = 0; i < nCount; i++) in PrintPage()
969 for (sal_uInt16 i = 0; i < nCount; i++) in PrintPage()
986 sal_uInt16 ONDXPage::Search(const ONDXKey& rSearch) in Search()
989 sal_uInt16 i = NODE_NOTFOUND; in Search()
998 sal_uInt16 ONDXPage::Search(const ONDXPage* pPage) in Search()
1000 sal_uInt16 i = NODE_NOTFOUND; in Search()
1017 sal_uInt16 nPos = NODE_NOTFOUND; in SearchAndReplace()
1031 ONDXNode& ONDXPage::operator[] (sal_uInt16 nPos) in operator []()
1038 const ONDXNode& ONDXPage::operator[] (sal_uInt16 nPos) const in operator []()
1044 void ONDXPage::Remove(sal_uInt16 nPos) in Remove()
1048 for (sal_uInt16 i = nPos; i < (nCount-1); i++) in Remove()