Lines Matching refs:m_pData
58 m_pData[i] = t; in OStoreBTreeNodeData()
73 if (t.m_aKey == m_pData[m].m_aKey) in find()
75 if (t.m_aKey < m_pData[m].m_aKey) in find()
82 if ((k < capacityCount()) && (t.m_aKey < m_pData[k].m_aKey)) in find()
98 memmove (&(m_pData[i + 1]), &(m_pData[i]), (n - i) * sizeof(T)); in insert()
101 m_pData[i] = t; in insert()
115 memmove (&(m_pData[i]), &(m_pData[i + 1]), (n - i - 1) * sizeof(T)); in remove()
118 m_pData[n - 1] = T(); in remove()
133 memcpy (&(m_pData[n]), &(rPageR.m_pData[0]), m * sizeof(T));
145 memcpy (&(m_pData[0]), &(rPageL.m_pData[h]), h * sizeof(T)); in split()
158 m_pData[i] = t; in truncate()
227 xPage->insert (nIndexL + 1, T(xPageR->m_pData[0].m_aKey, aLink)); in split()
249 T const aEntryL (rPage.m_pData[nIndexL]); in remove()
286 eErrCode = rBIOS.loadObjectAt (aNodeR, rPage.m_pData[nIndexR].m_aLink.location()); in remove()
300 rPage.m_pData[nIndexL].m_aKey = xPageL->m_pData[0].m_aKey; in remove()
307 if (!(rEntryL.compare (rPage.m_pData[nIndexL]) == T::COMPARE_EQUAL)) in remove()
311 rEntryL = rPage.m_pData[nIndexL]; in remove()
394 rxPageL->m_pData[0] = xPage->m_pData[0]; in change()
395 rxPageL->m_pData[0].m_aLink = xPage->location(); in change()
446 sal_uInt32 const nAddr = rPage.m_pData[i].m_aLink.location(); in find_lookup()
466 T::CompareResult eResult = entry.compare(rPage.m_pData[rIndex]); in find_lookup()
529 sal_uInt32 const nAddr = rPage.m_pData[i].m_aLink.location(); in find_insert()
566 T::CompareResult result = entry.compare (rPage.m_pData[rIndex]); in find_insert()