Lines Matching refs:nP
123 ArrElem& operator[](sal_uInt16 nP) const { return *(pData+nP); }\
125 void Insert( const nm * pI, sal_uInt16 nP,\
131 Insert( (const ArrElem*)pI->pData+nS, (sal_uInt16)nE-nS, nP );\
139 ArrElem& operator[](sal_uInt16 nP) const;\
140 void Insert( const nm *pI, sal_uInt16 nP,\
144 ArrElem& nm::operator[](sal_uInt16 nP) const\
146 DBG_ASSERT( pData && nP < nA,"Op[]");\
147 return *(pData+nP);\
149 void nm::Insert( const nm *pI, sal_uInt16 nP, sal_uInt16 nStt, sal_uInt16 nE)\
151 DBG_ASSERT(nP<=nA,"Ins,Ar[Start.End]");\
155 Insert( (const ArrElem*)pI->pData+nStt, (sal_uInt16)nE-nStt, nP );\
176 AERef GetObject(sal_uInt16 nP) const { return (*this)[nP]; } \
178 void Insert( const AERef aE, sal_uInt16 nP );\
179 void Insert( const AE *pE, sal_uInt16 nL, sal_uInt16 nP );\
180 void Remove( sal_uInt16 nP, sal_uInt16 nL = 1 );\
181 void Replace( const AERef aE, sal_uInt16 nP );\
182 void Replace( const AE *pE, sal_uInt16 nL, sal_uInt16 nP );\
240 void nm::Insert( const AERef aE, sal_uInt16 nP )\
242 DBG_ASSERT(nP <= nA && nA < USHRT_MAX, "Ins 1");\
245 if( pData && nP < nA )\
246 memmove( pData+nP+1, pData+nP, (nA-nP) * sizeof( AE ));\
247 *(pData+nP) = (AE&)aE;\
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");\
256 if( pData && nP < nA )\
257 memmove( pData+nP+nL, pData+nP, (nA-nP) * sizeof( AE ));\
259 memcpy( pData+nP, pE, nL * sizeof( AE ));\
263 void nm::Replace( const AERef aE, sal_uInt16 nP )\
265 if( nP < nA )\
266 *(pData+nP) = (AE&)aE;\
269 void nm::Replace( const AE *pE, sal_uInt16 nL, sal_uInt16 nP )\
271 if( pE && nP < nA )\
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); \
279 nFree = nP;\
283 sal_uInt16 nTmpLen = nA + nFree - nP; \
284 memcpy( pData + nP, pE, nTmpLen * sizeof( AE ));\
292 void nm::Remove( sal_uInt16 nP, sal_uInt16 nL )\
296 DBG_ASSERT( nP < nA && nP + nL <= nA,"Del");\
297 if( pData && nP+1 < nA )\
298 memmove( pData+nP, pData+nP+nL, (nA-nP-nL) * sizeof( AE ));\
333 void Insert( const nm *pI, sal_uInt16 nP, \
335 Base::Insert((const Base*)pI, nP, nS, nE);\
337 void Insert( const AERef aE, sal_uInt16 nP ) {\
338 Base::Insert( (const VPRef )aE, nP );\
340 void Insert( const AE *pE, sal_uInt16 nL, sal_uInt16 nP ) {\
341 Base::Insert( (const VoidPtr*)pE, nL, nP );\
343 void Replace( const AERef aE, sal_uInt16 nP ) {\
344 Base::Replace( (const VPRef)aE, 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);\
364 AE operator[]( sal_uInt16 nP )const { \
365 return (AE)Base::operator[](nP); }\
366 AE GetObject(sal_uInt16 nP) const { \
367 return (AE)Base::GetObject(nP); }\
372 void DeleteAndDestroy( sal_uInt16 nP, sal_uInt16 nL=1 );\
392 void Insert( const nm *pI, sal_uInt16 nP, \
394 Base::Insert((const Base*)pI, nP, nS, nE);\
396 void Insert( const AERef aE, sal_uInt16 nP ) {\
397 Base::Insert((const VPRef)aE, nP );\
399 void Insert( const AE *pE, sal_uInt16 nL, sal_uInt16 nP ) {\
400 Base::Insert( (const VoidPtr *)pE, nL, nP );\
402 void Replace( const AERef aE, sal_uInt16 nP ) {\
403 Base::Replace( (const VPRef)aE, 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);\
423 AE operator[]( sal_uInt16 nP )const { \
424 return (AE)Base::operator[](nP); }\
425 AE GetObject( sal_uInt16 nP )const { \
426 return (AE)Base::GetObject(nP); }\
431 void DeleteAndDestroy( sal_uInt16 nP, sal_uInt16 nL=1 );\
444 void nm::DeleteAndDestroy( sal_uInt16 nP, sal_uInt16 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 ); \
479 void Remove( sal_uInt16 nP, sal_uInt16 nL = 1 );\
588 sal_uInt16 nP;\
592 if( ! Seek_Entry( *(pIArr+nS), &nP) )\
593 nm##_SAR::Insert( *(pIArr+nS), nP );\
594 if( ++nP >= Count() )\
596 nm##_SAR::Insert( pI, nP, nS+1, nE );\
604 sal_uInt16 nP;\
606 bExist = Seek_Entry( aE, &nP );\
608 nm##_SAR::Insert( aE, nP );\
621 sal_uInt16 nP;\
623 if( ! Seek_Entry( *(pE+n), &nP ))\
624 nm##_SAR::Insert( *(pE+n), nP );\
626 void nm::Remove( sal_uInt16 nP, sal_uInt16 nL )\
629 nm##_SAR::Remove( nP, nL);\
634 sal_uInt16 nP;\
635 if( nL && Seek_Entry( aE, &nP ) ) \
636 nm##_SAR::Remove( nP, nL);\
664 AE operator[](sal_uInt16 nP) const {\
665 return nm##_SAR::operator[]( nP );\
667 AE GetObject(sal_uInt16 nP) const {\
668 return nm##_SAR::GetObject( nP );\
680 void DeleteAndDestroy( sal_uInt16 nP, sal_uInt16 nL=1 ); \
716 const AE& operator[](sal_uInt16 nP) const {\
717 return nm##_SAR::operator[]( nP );\
719 const AE& GetObject(sal_uInt16 nP) const {\
720 return nm##_SAR::GetObject( nP );\
745 void nm::DeleteAndDestroy( sal_uInt16 nP, sal_uInt16 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 ) { \
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 ); \