Lines Matching refs:nUsed
35 nUsed( 0 ), in SfxPtrArr()
53 nUsed = rOrig.nUsed; in SfxPtrArr()
59 pData = new void*[nUsed+nUnused]; in SfxPtrArr()
60 memcpy( pData, rOrig.pData, nUsed*sizeof(void*) ); in SfxPtrArr()
82 nUsed = rOrig.nUsed; in operator =()
88 pData = new void*[nUsed+nUnused]; in operator =()
89 memcpy( pData, rOrig.pData, nUsed*sizeof(void*) ); in operator =()
101 …DBG_ASSERT( sal::static_int_cast< unsigned >(nUsed+1) < ( USHRT_MAX / sizeof(void*) ), "array too … in Append()
105 sal_uInt16 nNewSize = (nUsed == 1) ? (nGrow==1 ? 2 : nGrow) : nUsed+nGrow; in Append()
109 DBG_ASSERT( nUsed <= nNewSize, "" ); in Append()
110 memmove( pNewData, pData, sizeof(void*)*nUsed ); in Append()
113 nUnused = sal::static_int_cast< sal_uInt8 >(nNewSize-nUsed); in Append()
118 pData[nUsed] = aElem; in Append()
119 ++nUsed; in Append()
129 nLen = Min( (sal_uInt16)(nUsed-nPos), nLen ); in Remove()
136 if ( (nUsed-nLen) == 0 ) in Remove()
140 nUsed = 0; in Remove()
149 sal_uInt16 nNewUsed = nUsed-nLen; in Remove()
164 nUsed = nNewUsed; in Remove()
170 if ( nUsed-nPos-nLen > 0 ) in Remove()
171 memmove( pData+nPos, pData+nPos+nLen, (nUsed-nPos-nLen)*sizeof(void*) ); in Remove()
172 nUsed = nUsed - nLen; in Remove()
183 if ( nUsed == 0 ) in Remove()
187 void* *pIter = pData + nUsed - 1; in Remove()
188 for ( sal_uInt16 n = 0; n < nUsed; ++n, --pIter ) in Remove()
191 Remove(nUsed-n-1, 1); in Remove()
203 if ( nUsed == 0 ) in Replace()
207 void* *pIter = pData + nUsed - 1; in Replace()
208 for ( sal_uInt16 n = 0; n < nUsed; ++n, --pIter ) in Replace()
211 pData[nUsed-n-1] = aNewElem; in Replace()
222 if ( !nUsed ) in Contains()
225 for ( sal_uInt16 n = 0; n < nUsed; ++n ) in Contains()
240 …DBG_ASSERT( sal::static_int_cast< unsigned >(nUsed+1) < ( USHRT_MAX / sizeof(void*) ), "array too … in Insert()
245 sal_uInt16 nNewSize = nUsed+nGrow; in Insert()
250 DBG_ASSERT( nUsed < nNewSize, "" ); in Insert()
251 memmove( pNewData, pData, sizeof(void*)*nUsed ); in Insert()
254 nUnused = sal::static_int_cast< sal_uInt8 >(nNewSize-nUsed); in Insert()
259 if ( nPos < nUsed ) in Insert()
260 memmove( pData+nPos+1, pData+nPos, (nUsed-nPos)*sizeof(void*) ); in Insert()
264 nUsed += 1; in Insert()
271 nUsed( 0 ), in ByteArr()
289 nUsed = rOrig.nUsed; in ByteArr()
295 pData = new char[nUsed+nUnused]; in ByteArr()
296 memcpy( pData, rOrig.pData, nUsed*sizeof(char) ); in ByteArr()
318 nUsed = rOrig.nUsed; in operator =()
324 pData = new char[nUsed+nUnused]; in operator =()
325 memcpy( pData, rOrig.pData, nUsed*sizeof(char) ); in operator =()
340 sal_uInt16 nNewSize = (nUsed == 1) ? (nGrow==1 ? 2 : nGrow) : nUsed+nGrow; in Append()
344 DBG_ASSERT( nUsed <= nNewSize, "" ); in Append()
345 memmove( pNewData, pData, sizeof(char)*nUsed ); in Append()
348 nUnused = sal::static_int_cast< sal_uInt8 >(nNewSize-nUsed); in Append()
353 pData[nUsed] = aElem; in Append()
354 ++nUsed; in Append()
364 nLen = Min( (sal_uInt16)(nUsed-nPos), nLen ); in Remove()
371 if ( (nUsed-nLen) == 0 ) in Remove()
375 nUsed = 0; in Remove()
384 sal_uInt16 nNewUsed = nUsed-nLen; in Remove()
399 nUsed = nNewUsed; in Remove()
405 if ( nUsed-nPos-nLen > 0 ) in Remove()
406 memmove( pData+nPos, pData+nPos+nLen, (nUsed-nPos-nLen)*sizeof(char) ); in Remove()
407 nUsed = nUsed - nLen; in Remove()
418 if ( nUsed == 0 ) in Remove()
422 char *pIter = pData + nUsed - 1; in Remove()
423 for ( sal_uInt16 n = 0; n < nUsed; ++n, --pIter ) in Remove()
426 Remove(nUsed-n-1, 1); in Remove()
437 if ( !nUsed ) in Contains()
440 for ( sal_uInt16 n = 0; n < nUsed; ++n ) in Contains()
459 sal_uInt16 nNewSize = nUsed+nGrow; in Insert()
464 DBG_ASSERT( nUsed < nNewSize, "" ); in Insert()
465 memmove( pNewData, pData, sizeof(char)*nUsed ); in Insert()
468 nUnused = sal::static_int_cast< sal_uInt8 >(nNewSize-nUsed); in Insert()
473 if ( nPos < nUsed ) in Insert()
474 memmove( pData+nPos+1, pData+nPos, (nUsed-nPos)*sizeof(char) ); in Insert()
478 nUsed += 1; in Insert()
487 DBG_ASSERT( nPos < nUsed, "" ); in operator []()
496 DBG_ASSERT( nPos < nUsed, "" ); in operator []()
503 nUsed( 0 ), in WordArr()
521 nUsed = rOrig.nUsed; in WordArr()
527 pData = new short[nUsed+nUnused]; in WordArr()
528 memcpy( pData, rOrig.pData, nUsed*sizeof(short) ); in WordArr()
550 nUsed = rOrig.nUsed; in operator =()
556 pData = new short[nUsed+nUnused]; in operator =()
557 memcpy( pData, rOrig.pData, nUsed*sizeof(short) ); in operator =()
572 sal_uInt16 nNewSize = (nUsed == 1) ? (nGrow==1 ? 2 : nGrow) : nUsed+nGrow; in Append()
576 DBG_ASSERT( nUsed <= nNewSize, " " ); in Append()
577 memmove( pNewData, pData, sizeof(short)*nUsed ); in Append()
580 nUnused = sal::static_int_cast< sal_uInt8 >(nNewSize-nUsed); in Append()
585 pData[nUsed] = aElem; in Append()
586 ++nUsed; in Append()
596 nLen = Min( (sal_uInt16)(nUsed-nPos), nLen ); in Remove()
603 if ( (nUsed-nLen) == 0 ) in Remove()
607 nUsed = 0; in Remove()
616 sal_uInt16 nNewUsed = nUsed-nLen; in Remove()
631 nUsed = nNewUsed; in Remove()
637 if ( nUsed-nPos-nLen > 0 ) in Remove()
638 memmove( pData+nPos, pData+nPos+nLen, (nUsed-nPos-nLen)*sizeof(short) ); in Remove()
639 nUsed = nUsed - nLen; in Remove()
650 if ( nUsed == 0 ) in Remove()
654 short *pIter = pData + nUsed - 1; in Remove()
655 for ( sal_uInt16 n = 0; n < nUsed; ++n, --pIter ) in Remove()
658 Remove(nUsed-n-1, 1); in Remove()
669 if ( !nUsed ) in Contains()
672 for ( sal_uInt16 n = 0; n < nUsed; ++n ) in Contains()
691 sal_uInt16 nNewSize = nUsed+nGrow; in Insert()
696 DBG_ASSERT( nUsed < nNewSize, "" ); in Insert()
697 memmove( pNewData, pData, sizeof(short)*nUsed ); in Insert()
700 nUnused = sal::static_int_cast< sal_uInt8 >(nNewSize-nUsed); in Insert()
705 if ( nPos < nUsed ) in Insert()
706 memmove( pData+nPos+1, pData+nPos, (nUsed-nPos)*sizeof(short) ); in Insert()
710 nUsed += 1; in Insert()
719 DBG_ASSERT( nPos < nUsed, "" ); in operator []()
728 DBG_ASSERT( nPos < nUsed, "" ); in operator []()