Lines Matching refs:nLen
61 void Insert( sal_uInt16 nPos, const T& rElems, sal_uInt16 nLen );\
65 sal_uInt16 Remove( sal_uInt16 nPos, sal_uInt16 nLen );\
194 sal_uInt16 ARR::Remove( sal_uInt16 nPos, sal_uInt16 nLen ) \
196 DBG_ASSERT( (nPos+nLen) < (nUsed+1), "" ); \
197 DBG_ASSERT( nLen > 0, "" ); \
199 nLen = Min( (sal_uInt16)(nUsed-nPos), (sal_uInt16)nLen ); \
201 if ( nLen == 0 ) \
204 for ( sal_uInt16 n = nPos; n < (nPos+nLen); ++n ) \
207 if ( (nUsed-nLen) == 0 ) \
213 return nLen; \
216 if ( (nUnused+nLen) >= nGrow ) \
218 sal_uInt16 nNewUsed = nUsed-nLen; \
228 memcpy(pNewData+nPos, pData+nPos+nLen, (nNewUsed-nPos) * sizeof(T) ); \
233 return nLen; \
237 if ( nUsed-nPos-nLen > 0 ) \
239 memmove(pData+nPos, pData+nPos+nLen, (nUsed-nPos-nLen) * sizeof(T));\
241 nUsed = nUsed - nLen; \
242 nUnused = sal::static_int_cast< sal_uInt8 >(nUnused + nLen); \
243 return nLen; \
274 void ARR::Insert( sal_uInt16 nPos, const T& rElems, sal_uInt16 nLen ) \
283 for ( nNewSize = nUsed+nGrow; nNewSize < (nUsed + nLen); ++nNewSize ) \
302 memmove(pData+nPos+nLen-1, pData+nPos-1, sizeof(T) * (nUsed-nPos)); \
305 memmove(pData+nPos, &rElems, sizeof(T) * nLen); \
306 nUsed = nUsed + nLen; \
307 nUnused = sal::static_int_cast< sal_uInt8 >(nUnused - nLen); \
331 sal_uInt16 Remove( sal_uInt16 nPos, sal_uInt16 nLen );
382 void Remove( sal_uInt16 nPos, sal_uInt16 nLen = 1 ) {\
383 SfxPtrArr::Remove( nPos, nLen ); \
412 sal_uInt16 Remove( sal_uInt16 nPos, sal_uInt16 nLen );
447 void Remove( sal_uInt16 nPos, sal_uInt16 nLen = 1 ) {\
448 ByteArr::Remove( nPos, nLen ); \
477 sal_uInt16 Remove( sal_uInt16 nPos, sal_uInt16 nLen );
512 void Remove( sal_uInt16 nPos, sal_uInt16 nLen = 1 ) {\
513 WordArr::Remove( nPos, nLen ); \