Lines Matching refs:p
39 #define CHECKIDX( p, n, i, c ) argument
43 #define CHECKIDX( p, n, i, c ) CheckIdx( p, n, i, c ); argument
94 BlockInfo* p = ppInf[ cur ]; in Move() local
95 ElementPtr pElem = p->pData[ from - p->nStart ]; in Move()
113 BlockInfo* p = *pp; in ForEach() local
114 sal_uInt16 nElem = sal_uInt16( nStart - p->nStart ); in ForEach()
115 ElementPtr* pElem = p->pData + nElem; in ForEach()
116 nElem = p->nElem - nElem; in ForEach()
126 p = *++pp; in ForEach()
127 pElem = p->pData; in ForEach()
128 nElem = p->nElem; in ForEach()
141 BlockInfo* p = ppInf[ cur ]; in operator []() local
143 return p->pData[ idx - p->nStart ]; in operator []()
163 BlockInfo* p = ppInf[ nCur ]; in Index2Block() local
164 if( p->nStart <= pos && p->nEnd >= pos ) in Index2Block()
172 p = ppInf[ nCur+1 ]; in Index2Block()
173 if( p->nStart <= pos && p->nEnd >= pos ) in Index2Block()
177 else if( pos < p->nStart && nCur > 0 ) in Index2Block()
179 p = ppInf[ nCur-1 ]; in Index2Block()
180 if( p->nStart <= pos && p->nEnd >= pos ) in Index2Block()
191 p = ppInf[ cur ]; in Index2Block()
192 if( p->nStart <= pos && p->nEnd >= pos ) in Index2Block()
194 if( p->nStart > pos ) in Index2Block()
210 BlockInfo* p; in UpdIndex() local
213 p = *++pp; in UpdIndex()
214 p->nStart = idx; in UpdIndex()
215 idx += p->nElem; in UpdIndex()
216 p->nEnd = idx - 1; in UpdIndex()
241 BlockInfo* p = new BlockInfo; in InsBlock() local
242 ppInf[ pos ] = p; in InsBlock()
245 p->nStart = p->nEnd = ppInf[ pos-1 ]->nEnd + 1; in InsBlock()
247 p->nStart = p->nEnd = 0; in InsBlock()
248 p->nEnd--; // keine Elemente in InsBlock()
249 p->nElem = 0; in InsBlock()
250 p->pData = new ElementPtr [ MAXENTRY ]; in InsBlock()
251 p->pBigArr = this; in InsBlock()
252 return p; in InsBlock()
275 BlockInfo* p; in Insert() local
279 p = InsBlock( cur = 0 ); in Insert()
284 p = ppInf[ cur ]; in Insert()
285 if( p->nElem == MAXENTRY ) in Insert()
287 p = InsBlock( ++cur ); in Insert()
293 p = ppInf[ cur ]; in Insert()
295 if( p->nElem == MAXENTRY ) in Insert()
336 ElementPtr pLast = p->pData[ MAXENTRY-1 ]; in Insert()
344 p->nEnd--; in Insert()
345 p->nElem--; in Insert()
348 pos -= p->nStart; in Insert()
350 if( pos != p->nElem ) in Insert()
352 int nCount = p->nElem - sal_uInt16(pos); in Insert()
353 ElementPtr *pFrom = p->pData + p->nElem, in Insert()
360 ((ElementPtr&)rElem)->pBlock = p; in Insert()
361 p->pData[ pos ] = rElem; in Insert()
362 p->nEnd++; in Insert()
363 p->nElem++; in Insert()
379 BlockInfo* p = ppInf[ cur ]; in Remove() local
380 pos -= p->nStart; in Remove()
384 sal_uInt16 nel = p->nElem - sal_uInt16(pos); in Remove()
388 if( ( pos + nel ) < sal_uLong(p->nElem) ) in Remove()
390 ElementPtr *pTo = p->pData + pos, in Remove()
392 int nCount = p->nElem - nel - sal_uInt16(pos); in Remove()
400 p->nEnd -= nel; in Remove()
401 p->nElem = p->nElem - nel; in Remove()
402 if( !p->nElem ) in Remove()
405 delete[] p->pData; in Remove()
413 p = ppInf[ ++cur ]; in Remove()
432 p = ppInf[ 0 ]; in Remove()
433 p->nStart = 0; in Remove()
434 p->nEnd = p->nElem-1; in Remove()
462 BlockInfo* p = ppInf[ cur ]; in Replace() local
464 ((ElementPtr&)rElem)->nOffset = sal_uInt16(idx - p->nStart); in Replace()
465 ((ElementPtr&)rElem)->pBlock = p; in Replace()
466 p->pData[ idx - p->nStart ] = rElem; in Replace()
481 BlockInfo* p; in Compress() local
492 p = *pp++; in Compress()
493 sal_uInt16 n = p->nElem; in Compress()
513 ElementPtr* pFrom = p->pData; in Compress()
523 p->nElem = p->nElem - n; in Compress()
526 if( !p->nElem ) in Compress()
529 delete[] p->pData; in Compress()
530 delete p, p = 0; in Compress()
535 pElem = p->pData, pFrom = pElem + n; in Compress()
536 int nCount = p->nElem; in Compress()
546 if( p ) // die Blockinfo wurde nicht geloescht in Compress()
548 *qq++ = p; // dann setze sie an die richtige neue Position in Compress()
551 if( !nLast && p->nElem < MAXENTRY ) in Compress()
553 pLast = p; in Compress()
554 nLast = MAXENTRY - p->nElem; in Compress()
564 p = ppInf[ 0 ]; in Compress()
565 p->nEnd = p->nElem - 1; in Compress()