Lines Matching refs:nCount
66 sal_uInt32 nCount(rPolyPolygon.count()); in TextRanger() local
67 mpPolyPolygon = new PolyPolygon( (sal_uInt16)nCount ); in TextRanger()
69 for(sal_uInt32 i(0L); i < nCount; i++) in TextRanger()
78 nCount = pLinePolyPolygon->count(); in TextRanger()
81 for(sal_uInt32 i(0L); i < nCount; i++) in TextRanger()
290 sal_uInt16 nCount = pLongArr->Count(); in NoteRange() local
291 DBG_ASSERT( nCount == 2 * aBoolArr.size(), "NoteRange: Incompatible Sizes" ); in NoteRange()
292 while( nIdx < nCount && (*pLongArr)[ nIdx ] < nMin ) in NoteRange()
296 if( nIdx == nCount || ( !bOdd && nMax < (*pLongArr)[ nIdx ] ) ) in NoteRange()
311 while( nMaxIdx < nCount && (*pLongArr)[ nMaxIdx ] < nMax ) in NoteRange()
341 sal_uInt16 nCount; in Calc() local
346 nCount = rPol.GetSize(); in Calc()
347 if( nCount ) in Calc()
350 SetClosed( IsConcat() || ( rNull == rPol[ nCount - 1 ] ) ); in Calc()
387 if( nCount > 1 ) in Calc()
393 if( nIdx == nCount ) in Calc()
432 if( ++nIdx == nCount && !IsClosed() ) in Calc()
479 size_t nCount = aBoolArr.size(); in Add() local
480 if( nCount && ( !bInner || !pTextRanger->IsSimple() ) ) in Add()
485 for( size_t nBoolIdx = 1; nBoolIdx < nCount; ++nBoolIdx ) in Add()
490 while( nBoolIdx < nCount && !aBoolArr[ nBoolIdx++ ] && in Add()
491 (!bInner || nBoolIdx < nCount ) ) in Add()
496 nCount = nCount - next; in Add()
505 bDelete = nBoolIdx < nCount && aBoolArr[ nBoolIdx ]; in Add()
512 if( 0 != ( nCount = pLongArr->Count() ) ) in Add()
541 sal_uInt16 nCount = pLongArr->Count(); in Concat() local
545 while( i < nCount ) in Concat()