Lines Matching refs:rIndex
81 ,rIndex(rInd) in ONDXPage()
84 sal_uInt16 nT = rIndex.getHeader().db_maxkeys; in ONDXPage()
99 if (IsModified() && rIndex.m_pFileStream) in QueryDelete()
100 (*rIndex.m_pFileStream) << *this; in QueryDelete()
103 if (rIndex.UseCollector()) in QueryDelete()
108 for (sal_uInt16 i = 0; i < rIndex.getHeader().db_maxkeys;i++) in QueryDelete()
119 rIndex.Collect(this); in QueryDelete()
129 aChild = rIndex.CreatePage(aChild.GetPagePos(),this,aChild.HasPage()); in GetChild()
162 ONDXPagePtr aPage = (i==0) ? GetChild(&rIndex) : ((*this)[i-1]).GetChild(&rIndex, this); in Find()
167 rIndex.m_aCurLeaf = this; in Find()
168 rIndex.m_nCurNode = i - 1; in Find()
174 rIndex.m_aCurLeaf = this; in Find()
175 rIndex.m_nCurNode = bResult ? i : i - 1; in Find()
200 if (IsLeaf() && this == &rIndex.m_aCurLeaf) in Insert()
205 bResult = Insert(rIndex.m_nCurNode + 1, rNode); in Insert()
227 sal_uInt32 nNewPagePos = rIndex.GetPageCount(); in Insert()
234 ONDXPagePtr aNewRoot = rIndex.CreatePage(nNewPagePos + 1); in Insert()
237 rIndex.m_aRoot = aNewRoot; in Insert()
238 rIndex.SetRootPos(nNewPagePos + 1); in Insert()
239 rIndex.SetPageCount(++nNewPageCount); in Insert()
243 ONDXPagePtr aNewPage = rIndex.CreatePage(nNewPagePos,aParent); in Insert()
244 rIndex.SetPageCount(nNewPageCount); in Insert()
250 if (!IsLeaf() || nRowsLeft < (sal_uInt32)(rIndex.GetMaxNodes() / 2)) in Insert()
261 if (rIndex.isUnique()) in Insert()
273 rIndex.m_aCurLeaf = aNewPage; in Insert()
274 rIndex.m_nCurNode = rIndex.m_aCurLeaf->Count() - 1; in Insert()
289 rIndex.m_nCurNode = nCount - 1; in Insert()
296 rIndex.m_nCurNode = nNodePos; in Insert()
306 sal_uInt16 nMaxCount = rIndex.getHeader().db_maxkeys; in Insert()
351 for (sal_uInt16 i = 0; i < rIndex.getHeader().db_maxkeys;i++) in Release()
398 if (HasParent() && nCount < (rIndex.GetMaxNodes() / 2)) in Delete()
408 Merge(nParentNodePos,aParent->GetChild(&rIndex)); in Delete()
410 Merge(nParentNodePos,(*aParent)[nParentNodePos-1].GetChild(&rIndex,aParent)); in Delete()
416 Merge(nParentNodePos + 1,((*aParent)[nParentNodePos + 1].GetChild(&rIndex,aParent))); in Delete()
453 rIndex.SetRootPos(nPagePos); in Delete()
503 if (rIndex.isUnique()) in Split()
517 sal_uInt16 nMaxNodes = rIndex.GetMaxNodes(), in Merge()
568 rIndex.SetRootPos(nPagePos); in Merge()
569 rIndex.m_aRoot = this; in Merge()
651 rIndex.SetRootPos(nPagePos); in Merge()
652 rIndex.m_aRoot = this; in Merge()
701 void ONDXNode::Read(SvStream &rStream, ODbaseIndex& rIndex) in Read() argument
705 if (rIndex.getHeader().db_keytype) in Read()
714 sal_uInt16 nLen = rIndex.getHeader().db_keylen; in Read()
723 …aKey = ONDXKey(::rtl::OUString(aBuf.GetBuffer(),aBuf.Len(),rIndex.m_pTable->getConnection()->getTe… in Read()
736 const ODbaseIndex& rIndex = rPage.GetIndex(); in Write() local
737 if (!rIndex.isUnique() || rPage.IsLeaf()) in Write()
742 if (rIndex.getHeader().db_keytype) // double in Write()
746 memset(aNodeData.aData,0,rIndex.getHeader().db_keylen); in Write()
747 rStream.Write((sal_uInt8*)aNodeData.aData,rIndex.getHeader().db_keylen); in Write()
754 memset(aNodeData.aData,0x20,rIndex.getHeader().db_keylen); in Write()
758 ByteString aText(sValue.getStr(), rIndex.m_pTable->getConnection()->getTextEncoding()); in Write()
759 strncpy(aNodeData.aData,aText.GetBuffer(),std::min(rIndex.getHeader().db_keylen, aText.Len())); in Write()
761 rStream.Write((sal_uInt8*)aNodeData.aData,rIndex.getHeader().db_keylen); in Write()
920 if(i < rPage.rIndex.getHeader().db_maxkeys) in operator <<()
949 rNode.GetChild(&rIndex, this); in PrintPage()
955 else if (rIndex.getHeader().db_keytype) in PrintPage()
961 …Record(), (const char* )ByteString(rKey.getValue().getString().getStr(), rIndex.m_pTable->getConne… in PrintPage()
968 GetChild(&rIndex)->PrintPage(); in PrintPage()
972 rNode.GetChild(&rIndex,this)->PrintPage(); in PrintPage()
982 return Count() == rIndex.getHeader().db_maxkeys; in IsFull()