Lines Matching refs:pLongArr
144 SvLongs *pLongArr; member in SvxBoundArgs
196 : pLongArr( pLong ), pTextRanger( pRanger ), in SvxBoundArgs()
217 pLongArr->Remove( 0, pLongArr->Count() ); in SvxBoundArgs()
290 sal_uInt16 nCount = pLongArr->Count(); in NoteRange()
292 while( nIdx < nCount && (*pLongArr)[ nIdx ] < nMin ) in NoteRange()
296 if( nIdx == nCount || ( !bOdd && nMax < (*pLongArr)[ nIdx ] ) ) in NoteRange()
298 pLongArr->Insert( nMin, nIdx ); in NoteRange()
299 pLongArr->Insert( nMax, nIdx + 1 ); in NoteRange()
310 (*pLongArr)[ nIdx ] = nMin; in NoteRange()
311 while( nMaxIdx < nCount && (*pLongArr)[ nMaxIdx ] < nMax ) in NoteRange()
321 (*pLongArr)[ nMaxIdx-- ] = nMax; in NoteRange()
327 (*pLongArr).Remove( nIdx + 1, nDiff ); in NoteRange()
449 DBG_ASSERT( pLongArr->Count() == 0, "I said: Simple!" ); in Calc()
460 pLongArr->Insert( nTmpMin, 0 ); in Calc()
461 pLongArr->Insert( nTmpMax, 1 ); in Calc()
467 pLongArr->Insert( nMin, 0 ); in Calc()
468 pLongArr->Insert( nMax, 1 ); in Calc()
493 pLongArr->Remove( nLongIdx, next ); in Add()
508 DBG_ASSERT( aBoolArr.size()*2 == pLongArr->Count(), in Add()
512 if( 0 != ( nCount = pLongArr->Count() ) ) in Add()
516 pLongArr->Remove( 0, 1 ); in Add()
517 pLongArr->Remove( pLongArr->Count() - 1, 1 ); in Add()
525 if( pTextRanger->IsSimple() && pLongArr->Count() > 2 ) in Add()
526 pLongArr->Remove( 1, pLongArr->Count() - 2 ); in Add()
536 SvLongs *pOld = pLongArr; in Concat()
537 pLongArr = new SvLongs( 2, 8 ); in Concat()
541 sal_uInt16 nCount = pLongArr->Count(); in Concat()
551 pOld->Insert( pLongArr, nIdx, i, USHRT_MAX ); in Concat()
554 long nLeft = (*pLongArr)[ i++ ]; in Concat()
555 long nRight = (*pLongArr)[ i++ ]; in Concat()
562 pOld->Insert( pLongArr, nOldCount, i - 2, USHRT_MAX ); in Concat()
571 pOld->Insert( pLongArr, nRightPos, i - 2, i ); in Concat()
606 delete pLongArr; in Concat()