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
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#include <bf_tools/impcont.hxx>
#include <bf_tools/unqidx.hxx>
#include <bf_tools/unqid.hxx>
namespace binfilter
{
/*************************************************************************
|*
|* UniqueIndex::UniqueIndex()
|*
*************************************************************************/
UniqueIndex::UniqueIndex( sal_uIntPtr _nStartIndex,
sal_uIntPtr _nInitSize, sal_uIntPtr _nReSize ) :
Container( _nInitSize )
{
nReSize = _nReSize;
nStartIndex = _nStartIndex;
nUniqIndex = 0;
nCount = 0;
}
/*************************************************************************
|*
|* UniqueIndex::UniqueIndex()
|*
*************************************************************************/
UniqueIndex::UniqueIndex( const UniqueIndex& rIdx ) :
Container( rIdx )
{
nReSize = rIdx.nReSize;
nStartIndex = rIdx.nStartIndex;
nUniqIndex = rIdx.nUniqIndex;
nCount = rIdx.nCount;
}
/*************************************************************************
|*
|* UniqueIndex::Insert()
|*
*************************************************************************/
sal_uIntPtr UniqueIndex::Insert( void* p )
{
// NULL-Pointer ist nicht erlaubt
if ( !p )
return UNIQUEINDEX_ENTRY_NOTFOUND;
// Ist Array voll, dann expandieren
if ( nCount == Container::GetSize() )
SetSize( nCount + nReSize );
// Damit UniqIndex nicht ueberlaeuft, wenn Items geloescht wurden
nUniqIndex = nUniqIndex % Container::GetSize();
// Leeren Eintrag suchen
while ( Container::ImpGetObject( nUniqIndex ) != NULL )
nUniqIndex = (nUniqIndex+1) % Container::GetSize();
// Object im Array speichern
Container::Replace( p, nUniqIndex );
// Anzahl der Eintraege erhoehen und Index zurueckgeben
nCount++;
nUniqIndex++;
return ( nUniqIndex + nStartIndex - 1 );
}
/*************************************************************************
|*
|* UniqueIndex::Remove()
|*
*************************************************************************/
void* UniqueIndex::Remove( sal_uIntPtr nIndex )
{
// Ist Index zulaessig
if ( (nIndex >= nStartIndex) &&
(nIndex < (Container::GetSize()+nStartIndex)) )
{
// Index-Eintrag als leeren Eintrag setzen und Anzahl der
// gespeicherten Indexe erniedriegen, wenn Eintrag belegt war
void* p = Container::Replace( NULL, nIndex-nStartIndex );
if ( p )
nCount--;
return p;
}
else
return NULL;
}
/*************************************************************************
|*
|* UniqueIndex::GetCurIndex()
|*
*************************************************************************/
sal_uIntPtr UniqueIndex::GetCurIndex() const
{
sal_uIntPtr nPos = Container::GetCurPos();
// Ist der Current-Index nicht belegt, dann gibt es keinen Current-Index
if ( !Container::ImpGetObject( nPos ) )
return UNIQUEINDEX_ENTRY_NOTFOUND;
else
return nPos+nStartIndex;
}
/*************************************************************************
|*
|* UniqueIndex::IsIndexValid()
|*
*************************************************************************/
sal_Bool UniqueIndex::IsIndexValid( sal_uIntPtr nIndex ) const
{
// Ist Index zulaessig
if ( (nIndex >= nStartIndex) &&
(nIndex < (Container::GetSize()+nStartIndex)) )
{
// Index ist nur zulaessig, wenn Eintrag auch belegt ist
if ( Container::ImpGetObject( nIndex-nStartIndex ) )
return sal_True;
else
return sal_False;
}
else
return sal_False;
}
/*************************************************************************
|*
|* UniqueIndex::Seek()
|*
*************************************************************************/
void* UniqueIndex::Seek( sal_uIntPtr nIndex )
{
// Index-Eintrag als aktuellen setzten, wenn er gueltig ist
if ( IsIndexValid( nIndex ) )
return Container::Seek( nIndex-nStartIndex );
else
return NULL;
}
/*************************************************************************
|*
|* UniqueIndex::First()
|*
*************************************************************************/
void* UniqueIndex::First()
{
void* p = Container::First();
while ( !p && (Container::GetCurPos() < (Container::GetSize()-1)) )
p = Container::Next();
return p;
}
/*************************************************************************
|*
|* UniqueIndex::Last()
|*
*************************************************************************/
void* UniqueIndex::Last()
{
void* p = Container::Last();
while ( !p && Container::GetCurPos() )
p = Container::Prev();
return p;
}
/*************************************************************************
|*
|* UniqueIndex::Next()
|*
*************************************************************************/
void* UniqueIndex::Next()
{
void* p = NULL;
while ( !p && (Container::GetCurPos() < (Container::GetSize()-1)) )
p = Container::Next();
return p;
}
/*************************************************************************
|*
|* UniqueIndex::Prev()
|*
*************************************************************************/
void* UniqueIndex::Prev()
{
void* p = NULL;
while ( !p && Container::GetCurPos() )
p = Container::Prev();
return p;
}
/*************************************************************************
|*
|* UniqueIndex::operator =()
|*
*************************************************************************/
UniqueIndex& UniqueIndex::operator =( const UniqueIndex& rIdx )
{
// Neue Werte zuweisen
Container::operator =( rIdx );
nReSize = rIdx.nReSize;
nStartIndex = rIdx.nStartIndex;
nUniqIndex = rIdx.nUniqIndex;
nCount = rIdx.nCount;
return *this;
}
/*************************************************************************
|*
|* UniqueIndex::operator ==()
|*
*************************************************************************/
sal_Bool UniqueIndex::operator ==( const UniqueIndex& rIdx ) const
{
// Neue Werte zuweisen
if ( (nStartIndex == rIdx.nStartIndex) &&
(nCount == rIdx.nCount) &&
(Container::operator ==( rIdx )) )
return sal_True;
else
return sal_False;
}
/*************************************************************************
|*
|* UniqueIdContainer::UniqueIdContainer ()
|*
*************************************************************************/
UniqueIdContainer::UniqueIdContainer( const UniqueIdContainer& rObj )
: UniqueIndex( rObj )
, nCollectCount( rObj.nCollectCount )
{
sal_uIntPtr nCur = GetCurIndex();
ImpUniqueId * pEle = (ImpUniqueId *)First();
while( pEle )
{
pEle->nRefCount++;
pEle = (ImpUniqueId *)Next();
}
Seek( nCur );
}
/*************************************************************************
|*
|* UniqueIdContainer::operator = ()
|*
*************************************************************************/
UniqueIdContainer& UniqueIdContainer::operator = ( const UniqueIdContainer & rObj )
{
UniqueIndex::operator = ( rObj );
nCollectCount = rObj.nCollectCount;
sal_uIntPtr nCur = GetCurIndex();
ImpUniqueId * pEle = (ImpUniqueId *)First();
while( pEle )
{
pEle->nRefCount++;
pEle = (ImpUniqueId *)Next();
}
Seek( nCur );
return *this;
}
/*************************************************************************
|*
|* UniqueIdContainer::Clear()
|*
*************************************************************************/
void UniqueIdContainer::Clear( sal_Bool bAll )
{
sal_uInt16 nFree = bAll ? 0xFFFF : 1;
ImpUniqueId* pId = (ImpUniqueId*)Last();
sal_Bool bLast = sal_True;
while ( pId )
{
if ( pId->nRefCount <= nFree )
{
((ImpUniqueId *)Remove( pId->nId ))->Release();
if( bLast )
pId = (ImpUniqueId *)Last();
else
pId = (ImpUniqueId *)Prev();
}
else
{
pId = (ImpUniqueId *)Prev();
bLast = sal_False;
}
}
}
/*************************************************************************
|*
|* UniqueIdContainer::CreateId()
|*
*************************************************************************/
UniqueItemId UniqueIdContainer::CreateId()
{
if( nCollectCount > 50 )
{ // aufraeumen
Clear( sal_False );
nCollectCount = 0;
}
nCollectCount++;
ImpUniqueId * pId = new ImpUniqueId;
pId->nRefCount = 1;
pId->nId = Insert( pId );
return UniqueItemId( pId );
}
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
