svarray.cxx (40df464e) svarray.cxx (c1e8cc3a)
1/**************************************************************
2 *
3 * Licensed to the Apache Software Foundation (ASF) under one
4 * or more contributor license agreements. See the NOTICE file
5 * distributed with this work for additional information
6 * regarding copyright ownership. The ASF licenses this file
7 * to you under the Apache License, Version 2.0 (the
8 * "License"); you may not use this file except in compliance

--- 85 unchanged lines hidden (view full) ---

94 DBG_ASSERT( nP < nA && nP + nL <= nA, "ERR_VAR_DEL" );
95 for( sal_uInt16 n=nP; n < nP + nL; n++ )
96 delete *((StringPtr*)pData+n);
97 SvPtrarr::Remove( nP, nL );
98 }
99}
100sal_Bool SvStringsISort::Seek_Entry( const StringPtr aE, sal_uInt16* pP ) const
101{
1/**************************************************************
2 *
3 * Licensed to the Apache Software Foundation (ASF) under one
4 * or more contributor license agreements. See the NOTICE file
5 * distributed with this work for additional information
6 * regarding copyright ownership. The ASF licenses this file
7 * to you under the Apache License, Version 2.0 (the
8 * "License"); you may not use this file except in compliance

--- 85 unchanged lines hidden (view full) ---

94 DBG_ASSERT( nP < nA && nP + nL <= nA, "ERR_VAR_DEL" );
95 for( sal_uInt16 n=nP; n < nP + nL; n++ )
96 delete *((StringPtr*)pData+n);
97 SvPtrarr::Remove( nP, nL );
98 }
99}
100sal_Bool SvStringsISort::Seek_Entry( const StringPtr aE, sal_uInt16* pP ) const
101{
102 register sal_uInt16 nO = SvStringsISort_SAR::Count(),
102 sal_uInt16 nO = SvStringsISort_SAR::Count(),
103 nM,
104 nU = 0;
105 if( nO > 0 )
106 {
107 nO--;
108 while( nU <= nO )
109 {
110 nM = nU + ( nO - nU ) / 2;

--- 30 unchanged lines hidden (view full) ---

141 DBG_ASSERT( nP < nA && nP + nL <= nA, "ERR_VAR_DEL" );
142 for( sal_uInt16 n=nP; n < nP + nL; n++ )
143 delete *((StringPtr*)pData+n);
144 SvPtrarr::Remove( nP, nL );
145 }
146}
147sal_Bool SvStringsISortDtor::Seek_Entry( const StringPtr aE, sal_uInt16* pP ) const
148{
103 nM,
104 nU = 0;
105 if( nO > 0 )
106 {
107 nO--;
108 while( nU <= nO )
109 {
110 nM = nU + ( nO - nU ) / 2;

--- 30 unchanged lines hidden (view full) ---

141 DBG_ASSERT( nP < nA && nP + nL <= nA, "ERR_VAR_DEL" );
142 for( sal_uInt16 n=nP; n < nP + nL; n++ )
143 delete *((StringPtr*)pData+n);
144 SvPtrarr::Remove( nP, nL );
145 }
146}
147sal_Bool SvStringsISortDtor::Seek_Entry( const StringPtr aE, sal_uInt16* pP ) const
148{
149 register sal_uInt16 nO = SvStringsISortDtor_SAR::Count(),
149 sal_uInt16 nO = SvStringsISortDtor_SAR::Count(),
150 nM,
151 nU = 0;
152 if( nO > 0 )
153 {
154 nO--;
155 while( nU <= nO )
156 {
157 nM = nU + ( nO - nU ) / 2;

--- 19 unchanged lines hidden (view full) ---

177 return sal_False;
178}
179
180// ---------------- Ushorts -------------------------------------
181
182/* SortArray fuer UShorts */
183sal_Bool SvUShortsSort::Seek_Entry( const sal_uInt16 aE, sal_uInt16* pP ) const
184{
150 nM,
151 nU = 0;
152 if( nO > 0 )
153 {
154 nO--;
155 while( nU <= nO )
156 {
157 nM = nU + ( nO - nU ) / 2;

--- 19 unchanged lines hidden (view full) ---

177 return sal_False;
178}
179
180// ---------------- Ushorts -------------------------------------
181
182/* SortArray fuer UShorts */
183sal_Bool SvUShortsSort::Seek_Entry( const sal_uInt16 aE, sal_uInt16* pP ) const
184{
185 register sal_uInt16 nO = SvUShorts::Count(),
185 sal_uInt16 nO = SvUShorts::Count(),
186 nM,
187 nU = 0;
188 if( nO > 0 )
189 {
190 nO--;
191 while( nU <= nO )
192 {
193 nM = nU + ( nO - nU ) / 2;

--- 86 unchanged lines hidden (view full) ---

280 DBG_ASSERT( nP < nA && nP + nL <= nA, "ERR_VAR_DEL" );
281 for( sal_uInt16 n=nP; n < nP + nL; n++ )
282 delete *((ByteStringPtr*)pData+n);
283 SvPtrarr::Remove( nP, nL );
284 }
285}
286sal_Bool SvByteStringsISort::Seek_Entry( const ByteStringPtr aE, sal_uInt16* pP ) const
287{
186 nM,
187 nU = 0;
188 if( nO > 0 )
189 {
190 nO--;
191 while( nU <= nO )
192 {
193 nM = nU + ( nO - nU ) / 2;

--- 86 unchanged lines hidden (view full) ---

280 DBG_ASSERT( nP < nA && nP + nL <= nA, "ERR_VAR_DEL" );
281 for( sal_uInt16 n=nP; n < nP + nL; n++ )
282 delete *((ByteStringPtr*)pData+n);
283 SvPtrarr::Remove( nP, nL );
284 }
285}
286sal_Bool SvByteStringsISort::Seek_Entry( const ByteStringPtr aE, sal_uInt16* pP ) const
287{
288 register sal_uInt16 nO = SvByteStringsISort_SAR::Count(),
288 sal_uInt16 nO = SvByteStringsISort_SAR::Count(),
289 nM,
290 nU = 0;
291 if( nO > 0 )
292 {
293 nO--;
294 while( nU <= nO )
295 {
296 nM = nU + ( nO - nU ) / 2;

--- 29 unchanged lines hidden (view full) ---

326 DBG_ASSERT( nP < nA && nP + nL <= nA, "ERR_VAR_DEL" );
327 for( sal_uInt16 n=nP; n < nP + nL; n++ )
328 delete *((ByteStringPtr*)pData+n);
329 SvPtrarr::Remove( nP, nL );
330 }
331}
332sal_Bool SvByteStringsISortDtor::Seek_Entry( const ByteStringPtr aE, sal_uInt16* pP ) const
333{
289 nM,
290 nU = 0;
291 if( nO > 0 )
292 {
293 nO--;
294 while( nU <= nO )
295 {
296 nM = nU + ( nO - nU ) / 2;

--- 29 unchanged lines hidden (view full) ---

326 DBG_ASSERT( nP < nA && nP + nL <= nA, "ERR_VAR_DEL" );
327 for( sal_uInt16 n=nP; n < nP + nL; n++ )
328 delete *((ByteStringPtr*)pData+n);
329 SvPtrarr::Remove( nP, nL );
330 }
331}
332sal_Bool SvByteStringsISortDtor::Seek_Entry( const ByteStringPtr aE, sal_uInt16* pP ) const
333{
334 register sal_uInt16 nO = SvByteStringsISortDtor_SAR::Count(),
334 sal_uInt16 nO = SvByteStringsISortDtor_SAR::Count(),
335 nM,
336 nU = 0;
337 if( nO > 0 )
338 {
339 nO--;
340 while( nU <= nO )
341 {
342 nM = nU + ( nO - nU ) / 2;

--- 22 unchanged lines hidden --- 		335 nM,
336 nU = 0;
337 if( nO > 0 )
338 {
339 nO--;
340 while( nU <= nO )
341 {
342 nM = nU + ( nO - nU ) / 2;

--- 22 unchanged lines hidden ---