Lines Matching refs:nP
90 void SvStringsISort::DeleteAndDestroy( sal_uInt16 nP, sal_uInt16 nL ) in SV_IMPL_VARARR()
94 DBG_ASSERT( nP < nA && nP + nL <= nA, "ERR_VAR_DEL" ); in SV_IMPL_VARARR()
95 for( sal_uInt16 n=nP; n < nP + nL; n++ ) in SV_IMPL_VARARR()
97 SvPtrarr::Remove( nP, nL ); in SV_IMPL_VARARR()
137 void SvStringsISortDtor::DeleteAndDestroy( sal_uInt16 nP, sal_uInt16 nL ) in _SV_IMPL_SORTAR_ALG()
141 DBG_ASSERT( nP < nA && nP + nL <= nA, "ERR_VAR_DEL" ); in _SV_IMPL_SORTAR_ALG()
142 for( sal_uInt16 n=nP; n < nP + nL; n++ ) in _SV_IMPL_SORTAR_ALG()
144 SvPtrarr::Remove( nP, nL ); in _SV_IMPL_SORTAR_ALG()
218 sal_uInt16 nP; in Insert() local
222 if( ! Seek_Entry( *(pIArr+nS), &nP) ) in Insert()
223 SvUShorts::Insert( *(pIArr+nS), nP ); in Insert()
224 if( ++nP >= Count() ) in Insert()
226 SvUShorts::Insert( pI, nP, nS+1, nE ); in Insert()
234 sal_uInt16 nP; in Insert() local
235 sal_Bool bExist = Seek_Entry( aE, &nP ); in Insert()
237 SvUShorts::Insert( aE, nP ); in Insert()
251 sal_uInt16 nP; in Insert() local
253 if( ! Seek_Entry( *(pE+n), &nP )) in Insert()
254 SvUShorts::Insert( *(pE+n), nP ); in Insert()
258 void SvUShortsSort::RemoveAt( const sal_uInt16 nP, sal_uInt16 nL ) in RemoveAt() argument
261 SvUShorts::Remove( nP, nL); in RemoveAt()
267 sal_uInt16 nP; in Remove() local
268 if( nL && Seek_Entry( aE, &nP ) ) in Remove()
269 SvUShorts::Remove( nP, nL); in Remove()
276 void SvByteStringsISort::DeleteAndDestroy( sal_uInt16 nP, sal_uInt16 nL ) in _SV_IMPL_SORTAR_ALG()
280 DBG_ASSERT( nP < nA && nP + nL <= nA, "ERR_VAR_DEL" ); in _SV_IMPL_SORTAR_ALG()
281 for( sal_uInt16 n=nP; n < nP + nL; n++ ) in _SV_IMPL_SORTAR_ALG()
283 SvPtrarr::Remove( nP, nL ); in _SV_IMPL_SORTAR_ALG()
322 void SvByteStringsISortDtor::DeleteAndDestroy( sal_uInt16 nP, sal_uInt16 nL ) in _SV_IMPL_SORTAR_ALG()
326 DBG_ASSERT( nP < nA && nP + nL <= nA, "ERR_VAR_DEL" ); in _SV_IMPL_SORTAR_ALG()
327 for( sal_uInt16 n=nP; n < nP + nL; n++ ) in _SV_IMPL_SORTAR_ALG()
329 SvPtrarr::Remove( nP, nL ); in _SV_IMPL_SORTAR_ALG()