1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2000, 2010 Oracle and/or its affiliates.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
#include <sfx2/minarray.hxx>
// -----------------------------------------------------------------------
SfxPtrArr::SfxPtrArr( sal_uInt8 nInitSize, sal_uInt8 nGrowSize ):
nUsed( 0 ),
nGrow( nGrowSize ? nGrowSize : 1 ),
nUnused( nInitSize )
{
sal_uInt16 nMSCBug = nInitSize;
if ( nMSCBug > 0 )
pData = new void*[nMSCBug];
else
pData = 0;
}
// -----------------------------------------------------------------------
SfxPtrArr::SfxPtrArr( const SfxPtrArr& rOrig )
{
nUsed = rOrig.nUsed;
nGrow = rOrig.nGrow;
nUnused = rOrig.nUnused;
if ( rOrig.pData != 0 )
{
pData = new void*[nUsed+nUnused];
memcpy( pData, rOrig.pData, nUsed*sizeof(void*) );
}
else
pData = 0;
}
// -----------------------------------------------------------------------
SfxPtrArr::~SfxPtrArr()
{
delete [] pData;
}
// -----------------------------------------------------------------------
SfxPtrArr& SfxPtrArr::operator=( const SfxPtrArr& rOrig )
{
delete [] pData;
nUsed = rOrig.nUsed;
nGrow = rOrig.nGrow;
nUnused = rOrig.nUnused;
if ( rOrig.pData != 0 )
{
pData = new void*[nUsed+nUnused];
memcpy( pData, rOrig.pData, nUsed*sizeof(void*) );
}
else
pData = 0;
return *this;
}
// -----------------------------------------------------------------------
void SfxPtrArr::Append( void* aElem )
{
DBG_ASSERT( sal::static_int_cast< unsigned >(nUsed+1) < ( USHRT_MAX / sizeof(void*) ), "array too large" );
// Does the Array need to be copied?
if ( nUnused == 0 )
{
sal_uInt16 nNewSize = (nUsed == 1) ? (nGrow==1 ? 2 : nGrow) : nUsed+nGrow;
void** pNewData = new void*[nNewSize];
if ( pData )
{
DBG_ASSERT( nUsed <= nNewSize, "" );
memmove( pNewData, pData, sizeof(void*)*nUsed );
delete [] pData;
}
nUnused = sal::static_int_cast< sal_uInt8 >(nNewSize-nUsed);
pData = pNewData;
}
// now write at the back in the open space
pData[nUsed] = aElem;
++nUsed;
--nUnused;
}
// -----------------------------------------------------------------------
sal_uInt16 SfxPtrArr::Remove( sal_uInt16 nPos, sal_uInt16 nLen )
{
// Adjust nLen, thus to avoid deleting beyond the end
nLen = Min( (sal_uInt16)(nUsed-nPos), nLen );
// simple problems require simple solutions!
if ( nLen == 0 )
return 0;
// Maybe no one will remain
if ( (nUsed-nLen) == 0 )
{
delete [] pData;
pData = 0;
nUsed = 0;
nUnused = 0;
return nLen;
}
// Determine whether the array has physically shrunk...
if ( (nUnused+nLen) >= nGrow )
{
// reduce (rounded up) to the next Grow-border
sal_uInt16 nNewUsed = nUsed-nLen;
sal_uInt16 nNewSize = ((nNewUsed+nGrow-1)/nGrow) * nGrow;
DBG_ASSERT( nNewUsed <= nNewSize && nNewUsed+nGrow > nNewSize,
"shrink size computation failed" );
void** pNewData = new void*[nNewSize];
if ( nPos > 0 )
{
DBG_ASSERT( nPos <= nNewSize, "" );
memmove( pNewData, pData, sizeof(void*)*nPos );
}
if ( nNewUsed != nPos )
memmove( pNewData+nPos, pData+nPos+nLen,
sizeof(void*)*(nNewUsed-nPos) );
delete [] pData;
pData = pNewData;
nUsed = nNewUsed;
nUnused = sal::static_int_cast< sal_uInt8 >(nNewSize - nNewUsed);
return nLen;
}
// in all other cases, only push together
if ( nUsed-nPos-nLen > 0 )
memmove( pData+nPos, pData+nPos+nLen, (nUsed-nPos-nLen)*sizeof(void*) );
nUsed = nUsed - nLen;
nUnused = sal::static_int_cast< sal_uInt8 >(nUnused + nLen);
return nLen;
}
// -----------------------------------------------------------------------
sal_Bool SfxPtrArr::Remove( void* aElem )
{
// simple tasks ...
if ( nUsed == 0 )
return sal_False;
// backwards, since most of the last is first removed
void* *pIter = pData + nUsed - 1;
for ( sal_uInt16 n = 0; n < nUsed; ++n, --pIter )
if ( *pIter == aElem )
{
Remove(nUsed-n-1, 1);
return sal_True;
}
return sal_False;
}
// -----------------------------------------------------------------------
sal_Bool SfxPtrArr::Contains( const void* rItem ) const
{
if ( !nUsed )
return sal_False;
for ( sal_uInt16 n = 0; n < nUsed; ++n )
{
void* p = GetObject(n);
if ( p == rItem )
return sal_True;
}
return sal_False;
}
// -----------------------------------------------------------------------
void SfxPtrArr::Insert( sal_uInt16 nPos, void* rElem )
{
DBG_ASSERT( sal::static_int_cast< unsigned >(nUsed+1) < ( USHRT_MAX / sizeof(void*) ), "array too large" );
// Does the Array have to be copied?
if ( nUnused == 0 )
{
// increase (rounded up ) to the next Grow-border
sal_uInt16 nNewSize = nUsed+nGrow;
void** pNewData = new void*[nNewSize];
if ( pData )
{
DBG_ASSERT( nUsed < nNewSize, "" );
memmove( pNewData, pData, sizeof(void*)*nUsed );
delete [] pData;
}
nUnused = sal::static_int_cast< sal_uInt8 >(nNewSize-nUsed);
pData = pNewData;
}
// Now move the rear part
if ( nPos < nUsed )
memmove( pData+nPos+1, pData+nPos, (nUsed-nPos)*sizeof(void*) );
// Now write into the free space.
memmove( pData+nPos, &rElem, sizeof(void*) );
nUsed += 1;
nUnused -= 1;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
