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
|
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2008 by Sun Microsystems, Inc.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* $RCSfile: bucket.hxx,v $
* $Revision: 1.3.38.1 $
*
* 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.
*
************************************************************************/
#ifndef _B3D_BUCKET_HXX
#define _B3D_BUCKET_HXX
#include <svtools/svarray.hxx>
/*************************************************************************
|*
|* Bucket deklarator
|*
\************************************************************************/
#define BASE3D_DECL_BUCKET(TheClassName,TheExtension) \
SV_DECL_VARARR(TheClassName##TheExtension##MemArr, char*, 32, 32) \
class TheClassName##TheExtension { \
private: \
TheClassName##TheExtension##MemArr aMemArray; \
UINT32 nMask; \
UINT32 nCount; \
INT16 nFreeMemArray; \
INT16 nActMemArray; \
UINT16 nFreeEntry; \
UINT16 nShift; \
UINT16 nBlockShift; \
UINT16 nEntriesPerArray; \
UINT16 nSlotSize; \
UINT16 nNext; \
UINT16 nMemArray; \
public: \
TheClassName##TheExtension(UINT16 TheSize); \
/* Notwendiger Leer-Konstruktor, benutzt default-Groesse 8 */ \
TheClassName##TheExtension(); \
/* Zu verwendende Groesse der Speicherarrays setzen */ \
/* Bitte NUR verwenden, falls sich der Leerkonstruktor */ \
/* nicht vermeiden laesst! Nicht nachtraeglich anwenden! */ \
void InitializeSize(UINT16 TheSize); \
/* Destruktor */ \
~TheClassName##TheExtension(); \
/* Anhaengen und kopieren */ \
BOOL Append(TheClassName& rVec) \
{ if(CareForSpace()) return ImplAppend(rVec); return FALSE; } \
/* nur neuen Eintrag anhaengen, ohne ausfuellen */ \
BOOL Append() \
{ if(CareForSpace()) return ImplAppend(); return FALSE; } \
/* Letzten Eintrag entfernen */ \
BOOL Remove() { if(nCount) return ImplRemove(); return FALSE; } \
/* leeren und Speicher freigeben */ \
void Empty(); \
/* leeren aber Speicher behalten */ \
void Erase(); \
TheClassName& operator[] (UINT32 nPos); \
const TheClassName& operator[] (UINT32 nPos) const; \
UINT32 Count() const { return nCount; } \
UINT32 GetNumAllocated() const { return aMemArray.Count() * nEntriesPerArray; } \
void operator=(const TheClassName##TheExtension&); \
UINT16 GetBlockShift() const { return nBlockShift; } \
UINT16 GetSlotSize() const { return nSlotSize; } \
private: \
BOOL CareForSpace() \
{ if(nFreeEntry == nEntriesPerArray) \
return ImplCareForSpace(); return TRUE; } \
BOOL ImplCareForSpace(); \
/* Anhaengen und kopieren */ \
BOOL ImplAppend(TheClassName& rVec); \
/* nur neuen Eintrag anhaengen, ohne ausfuellen */ \
BOOL ImplAppend(); \
BOOL ImplRemove(); \
};
/*************************************************************************
|*
|* Bucket implementor
|*
\************************************************************************/
#define BASE3D_IMPL_BUCKET(TheClassName,TheExtension) \
SV_IMPL_VARARR(TheClassName##TheExtension##MemArr, char*) \
TheClassName##TheExtension::TheClassName##TheExtension(UINT16 TheSize) { \
InitializeSize(TheSize); \
} \
TheClassName##TheExtension::TheClassName##TheExtension() { \
InitializeSize(8); \
} \
void TheClassName##TheExtension::InitializeSize(UINT16 TheSize) { \
UINT16 nSiz; \
for(nShift=0,nSiz=1;nSiz<sizeof(TheClassName);nSiz<<=1,nShift++) ; \
nBlockShift = TheSize - nShift; \
nMask = (1L << nBlockShift)-1L; \
nSlotSize = 1<<nShift; \
nEntriesPerArray = (UINT16)((1L << TheSize) >> nShift); \
Empty(); \
} \
void TheClassName##TheExtension::operator=(const TheClassName##TheExtension& rObj) { \
Erase(); \
TheClassName##TheExtension& rSrc = (TheClassName##TheExtension&)rObj; \
for(UINT32 a=0;a<rSrc.Count();a++) \
Append(rSrc[a]); \
} \
void TheClassName##TheExtension::Empty() { \
for(UINT16 i=0;i<aMemArray.Count();i++) \
/*#90353#*/ delete [] aMemArray[i]; \
if(aMemArray.Count()) \
aMemArray.Remove(0, aMemArray.Count()); \
nFreeMemArray = 0; \
nActMemArray = -1; \
Erase(); \
} \
void TheClassName##TheExtension::Erase() { \
nFreeEntry = nEntriesPerArray; \
nCount = 0; \
nActMemArray = -1; \
} \
TheClassName##TheExtension::~TheClassName##TheExtension() { \
Empty(); \
} \
BOOL TheClassName##TheExtension::ImplAppend(TheClassName& rVec) { \
*((TheClassName*)(aMemArray[nActMemArray] + (nFreeEntry++ << nShift))) = rVec; \
nCount++; \
return TRUE; \
} \
BOOL TheClassName##TheExtension::ImplAppend() { \
nFreeEntry++; \
nCount++; \
return TRUE; \
} \
BOOL TheClassName##TheExtension::ImplRemove() { \
if(nFreeEntry == 1) { \
nFreeEntry = nEntriesPerArray + 1; \
if(nActMemArray == -1) \
return FALSE; \
nActMemArray--; \
} \
nFreeEntry--; \
nCount--; \
return TRUE; \
} \
BOOL TheClassName##TheExtension::ImplCareForSpace() { \
/* neues array bestimmem */ \
if(nActMemArray + 1 < nFreeMemArray) { \
/* ist scon allokiert, gehe auf naechstes */ \
nActMemArray++; \
} else { \
/* neues muss allokiert werden */ \
char* pNew = new char[nEntriesPerArray << nShift]; \
if(!pNew) \
return FALSE; \
aMemArray.Insert((const char*&) pNew, aMemArray.Count()); \
nActMemArray = nFreeMemArray++; \
} \
nFreeEntry = 0; \
return TRUE; \
} \
TheClassName& TheClassName##TheExtension::operator[] (UINT32 nPos) { \
if(nPos >= nCount) { \
DBG_ERROR("Access to Bucket out of range!"); \
return *((TheClassName*)aMemArray[0]); \
} \
return *((TheClassName*)(aMemArray[(UINT16)(nPos >> nBlockShift)] + ((nPos & nMask) << nShift))); \
} \
const TheClassName& TheClassName##TheExtension::operator[] (UINT32 nPos) const { \
if(nPos >= nCount) { \
DBG_ERROR("Access to Bucket out of range!"); \
return *((TheClassName*)aMemArray[0]); \
} \
return *((TheClassName*)(aMemArray[(UINT16)(nPos >> nBlockShift)] + ((nPos & nMask) << nShift))); \
}
#endif // _B3D_BUCKET_HXX
|
