Lines Matching refs:nL
179 void Insert( const AE *pE, sal_uInt16 nL, sal_uInt16 nP );\
180 void Remove( sal_uInt16 nP, sal_uInt16 nL = 1 );\
182 void Replace( const AE *pE, sal_uInt16 nL, sal_uInt16 nP );\
231 sal_uInt16 nL = ((n < USHRT_MAX) ? sal_uInt16(n) : USHRT_MAX);\
232 AE* pE = (AE*)(rtl_reallocateMemory (pData, sizeof(AE) * nL));\
233 if ((pE != 0) || (nL == 0))\
236 nFree = nL - nA;\
251 void nm::Insert( const AE* pE, sal_uInt16 nL, sal_uInt16 nP )\
253 DBG_ASSERT(nP<=nA && ((long)nA+nL)<USHRT_MAX,"Ins n");\
254 if (nFree < nL)\
255 _resize (nA + ((nA > nL) ? nA : nL));\
257 memmove( pData+nP+nL, pData+nP, (nA-nP) * sizeof( AE ));\
259 memcpy( pData+nP, pE, nL * sizeof( AE ));\
260 nA = nA + nL; nFree = nFree - nL;\
269 void nm::Replace( const AE *pE, sal_uInt16 nL, sal_uInt16 nP )\
273 if( nP + nL < nA )\
274 memcpy( pData + nP, pE, nL * sizeof( AE ));\
275 else if( nP + nL < nA + nFree )\
277 memcpy( pData + nP, pE, nL * sizeof( AE ));\
278 nP = nP + (nL - nA); \
287 Insert( pE + nTmpLen, nL - nTmpLen, nA );\
292 void nm::Remove( sal_uInt16 nP, sal_uInt16 nL )\
294 if( !nL )\
296 DBG_ASSERT( nP < nA && nP + nL <= nA,"Del");\
298 memmove( pData+nP, pData+nP+nL, (nA-nP-nL) * sizeof( AE ));\
299 nA = nA - nL; nFree = nFree + nL;\
340 void Insert( const AE *pE, sal_uInt16 nL, sal_uInt16 nP ) {\
341 Base::Insert( (const VoidPtr*)pE, nL, nP );\
346 void Replace( const AE *pE, sal_uInt16 nL, sal_uInt16 nP ) {\
347 Base::Replace( (const VoidPtr*)pE, nL, nP );\
349 void Remove( sal_uInt16 nP, sal_uInt16 nL = 1) {\
350 Base::Remove(nP,nL);\
372 void DeleteAndDestroy( sal_uInt16 nP, sal_uInt16 nL=1 );\
399 void Insert( const AE *pE, sal_uInt16 nL, sal_uInt16 nP ) {\
400 Base::Insert( (const VoidPtr *)pE, nL, nP );\
405 void Replace( const AE *pE, sal_uInt16 nL, sal_uInt16 nP ) {\
406 Base::Replace( (const VoidPtr*)pE, nL, nP );\
408 void Remove( sal_uInt16 nP, sal_uInt16 nL = 1) {\
409 Base::Remove(nP,nL);\
431 void DeleteAndDestroy( sal_uInt16 nP, sal_uInt16 nL=1 );\
444 void nm::DeleteAndDestroy( sal_uInt16 nP, sal_uInt16 nL )\
446 if( nL ) {\
447 DBG_ASSERT( nP < nA && nP + nL <= nA,"Del");\
448 for( sal_uInt16 n=nP; n < nP + nL; n++ ) \
450 Base::Remove( nP, nL ); \
478 void Insert( const AE *pE, sal_uInt16 nL );\
479 void Remove( sal_uInt16 nP, sal_uInt16 nL = 1 );\
480 void Remove( const AE& aE, sal_uInt16 nL = 1 );\
619 void nm::Insert( const AE* pE, sal_uInt16 nL)\
622 for( sal_uInt16 n = 0; n < nL; ++n )\
626 void nm::Remove( sal_uInt16 nP, sal_uInt16 nL )\
628 if( nL )\
629 nm##_SAR::Remove( nP, nL);\
632 void nm::Remove( const AE &aE, sal_uInt16 nL )\
635 if( nL && Seek_Entry( aE, &nP ) ) \
636 nm##_SAR::Remove( nP, nL);\
648 void Remove( AE& aE, sal_uInt16 nL = 1 ) { \
649 Remove( (const AE&) aE, nL );\
680 void DeleteAndDestroy( sal_uInt16 nP, sal_uInt16 nL=1 ); \
745 void nm::DeleteAndDestroy( sal_uInt16 nP, sal_uInt16 nL ) { \
746 if( nL ) {\
747 DBG_ASSERT( nP < nA && nP + nL <= nA, "ERR_VAR_DEL" );\
748 for( sal_uInt16 n=nP; n < nP + nL; n++ ) \
750 SvPtrarr::Remove( nP, nL ); \
757 void nm::DeleteAndDestroy( sal_uInt16 nP, sal_uInt16 nL ) { \
758 if( nL ) {\
759 DBG_ASSERT( nP < nA && nP + nL <= nA, "ERR_VAR_DEL" );\
760 for( sal_uInt16 n=nP; n < nP + nL; n++ ) \
762 SvPtrarr::Remove( nP, nL ); \