Lines Matching refs:sal_uInt16
123 ArrElem& operator[](sal_uInt16 nP) const { return *(pData+nP); }\
125 void Insert( const nm * pI, sal_uInt16 nP,\
126 sal_uInt16 nS = 0, sal_uInt16 nE = USHRT_MAX )\
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,\
141 sal_uInt16 nS = 0, sal_uInt16 nE = USHRT_MAX );
144 ArrElem& nm::operator[](sal_uInt16 nP) const\
149 void nm::Insert( const nm *pI, sal_uInt16 nP, sal_uInt16 nStt, sal_uInt16 nE)\
155 Insert( (const ArrElem*)pI->pData+nStt, (sal_uInt16)nE-nStt, nP );\
166 sal_uInt16 nFree;\
167 sal_uInt16 nA;\
172 nm( sal_uInt16= IS, sal_uInt8= GS );\
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 );\
183 sal_uInt16 Count() const { return nA; }\
190 void ForEach( sal_uInt16 nS, sal_uInt16 nE, \
196 void _ForEach( sal_uInt16 nStt, sal_uInt16 nE, \
217 nm::nm( sal_uInt16 nInit, sal_uInt8 )\
231 sal_uInt16 nL = ((n < USHRT_MAX) ? sal_uInt16(n) : USHRT_MAX);\
240 void nm::Insert( const AERef aE, sal_uInt16 nP )\
251 void nm::Insert( const AE* pE, sal_uInt16 nL, sal_uInt16 nP )\
263 void nm::Replace( const AERef aE, sal_uInt16 nP )\
269 void nm::Replace( const AE *pE, sal_uInt16 nL, sal_uInt16 nP )\
283 sal_uInt16 nTmpLen = nA + nFree - nP; \
292 void nm::Remove( sal_uInt16 nP, sal_uInt16 nL )\
304 void nm::_ForEach( sal_uInt16 nStt, sal_uInt16 nE, \
320 sal_uInt16 GetPos( const AERef aE ) const;\
331 nm( sal_uInt16 nIni=IS, sal_uInt8 nG=GS )\
333 void Insert( const nm *pI, sal_uInt16 nP, \
334 sal_uInt16 nS = 0, sal_uInt16 nE = USHRT_MAX ) {\
337 void Insert( const AERef aE, sal_uInt16 nP ) {\
340 void Insert( const AE *pE, sal_uInt16 nL, sal_uInt16 nP ) {\
343 void Replace( const AERef aE, sal_uInt16 nP ) {\
346 void Replace( const AE *pE, sal_uInt16 nL, sal_uInt16 nP ) {\
349 void Remove( sal_uInt16 nP, sal_uInt16 nL = 1) {\
359 void ForEach( sal_uInt16 nS, sal_uInt16 nE, \
364 AE operator[]( sal_uInt16 nP )const { \
366 AE GetObject(sal_uInt16 nP) const { \
369 sal_uInt16 GetPos( const AERef aE ) const { \
372 void DeleteAndDestroy( sal_uInt16 nP, sal_uInt16 nL=1 );\
389 nm( sal_uInt16 nIni=IS, sal_uInt8 nG=GS )\
392 void Insert( const nm *pI, sal_uInt16 nP, \
393 sal_uInt16 nS = 0, sal_uInt16 nE = USHRT_MAX ) {\
396 void Insert( const AERef aE, sal_uInt16 nP ) {\
399 void Insert( const AE *pE, sal_uInt16 nL, sal_uInt16 nP ) {\
402 void Replace( const AERef aE, sal_uInt16 nP ) {\
405 void Replace( const AE *pE, sal_uInt16 nL, sal_uInt16 nP ) {\
408 void Remove( sal_uInt16 nP, sal_uInt16 nL = 1) {\
418 void ForEach( sal_uInt16 nS, sal_uInt16 nE, \
423 AE operator[]( sal_uInt16 nP )const { \
425 AE GetObject( sal_uInt16 nP )const { \
428 sal_uInt16 GetPos( const AERef aE ) const { \
431 void DeleteAndDestroy( sal_uInt16 nP, sal_uInt16 nL=1 );\
444 void nm::DeleteAndDestroy( sal_uInt16 nP, sal_uInt16 nL )\
448 for( sal_uInt16 n=nP; n < nP + nL; n++ ) \
473 nm(sal_uInt16 nSize = IS, sal_uInt8 nG = GS)\
475 void Insert( const nm *pI, sal_uInt16 nS=0, sal_uInt16 nE=USHRT_MAX );\
477 sal_Bool Insert( const AE& aE, sal_uInt16& rP );\
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 );\
481 sal_uInt16 Count() const { return nm##_SAR::Count(); }\
487 sal_Bool nm::Seek_Entry( const AE aE, sal_uInt16* pP ) const\
489 sal_uInt16 nO = nm##_SAR::Count(),\
520 sal_Bool nm::Seek_Entry( const AE aE, sal_uInt16* pP ) const\
522 sal_uInt16 nO = nm##_SAR::Count(),\
552 sal_Bool nm::Seek_Entry( const AE & aE, sal_uInt16* pP ) const\
554 sal_uInt16 nO = nm##_SAR::Count(),\
584 void nm::Insert( const nm * pI, sal_uInt16 nS, sal_uInt16 nE )\
588 sal_uInt16 nP;\
604 sal_uInt16 nP;\
611 sal_Bool nm::Insert( const AE & aE, sal_uInt16& rP )\
619 void nm::Insert( const AE* pE, sal_uInt16 nL)\
621 sal_uInt16 nP;\
622 for( sal_uInt16 n = 0; n < nL; ++n )\
626 void nm::Remove( sal_uInt16 nP, sal_uInt16 nL )\
632 void nm::Remove( const AE &aE, sal_uInt16 nL )\
634 sal_uInt16 nP;\
645 sal_uInt16 GetPos( AE& aE ) const { \
648 void Remove( AE& aE, sal_uInt16 nL = 1 ) { \
655 sal_uInt16 GetPos( const AE& aE ) const { \
664 AE operator[](sal_uInt16 nP) const {\
667 AE GetObject(sal_uInt16 nP) const {\
670 sal_Bool Seek_Entry( const AE aE, sal_uInt16* pP = 0 ) const;\
675 void ForEach( sal_uInt16 nS, sal_uInt16 nE, \
680 void DeleteAndDestroy( sal_uInt16 nP, sal_uInt16 nL=1 ); \
716 const AE& operator[](sal_uInt16 nP) const {\
719 const AE& GetObject(sal_uInt16 nP) const {\
722 sal_Bool Seek_Entry( const AE & aE, sal_uInt16* pP = 0 ) const;\
727 void ForEach( sal_uInt16 nS, sal_uInt16 nE, \
745 void nm::DeleteAndDestroy( sal_uInt16 nP, sal_uInt16 nL ) { \
748 for( sal_uInt16 n=nP; n < nP + nL; n++ ) \
757 void nm::DeleteAndDestroy( sal_uInt16 nP, sal_uInt16 nL ) { \
760 for( sal_uInt16 n=nP; n < nP + nL; n++ ) \