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
|
/*************************************************************************
*
* 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: bcaslot.hxx,v $
* $Revision: 1.8 $
*
* 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 SC_BCASLOT_HXX
#define SC_BCASLOT_HXX
#include <set>
#include <hash_set>
#include <functional>
#include <svtools/broadcast.hxx>
#include <svtools/svarray.hxx>
#include "global.hxx"
#include "brdcst.hxx"
/**
Used in a Unique Associative Container.
*/
class ScBroadcastArea
{
private:
ScBroadcastArea* pUpdateChainNext;
SvtBroadcaster aBroadcaster;
ScRange aRange;
ULONG nRefCount;
BOOL bInUpdateChain;
public:
ScBroadcastArea( const ScRange& rRange )
: pUpdateChainNext( NULL ), aRange( rRange ),
nRefCount( 0 ), bInUpdateChain( FALSE ) {}
inline SvtBroadcaster& GetBroadcaster() { return aBroadcaster; }
inline const SvtBroadcaster& GetBroadcaster() const { return aBroadcaster; }
inline void UpdateRange( const ScRange& rNewRange )
{ aRange = rNewRange; }
inline const ScRange& GetRange() const { return aRange; }
inline const ScAddress& GetStart() const { return aRange.aStart; }
inline const ScAddress& GetEnd() const { return aRange.aEnd; }
inline void IncRef() { ++nRefCount; }
inline ULONG DecRef() { return nRefCount ? --nRefCount : 0; }
inline ULONG GetRef() { return nRefCount; }
inline ScBroadcastArea* GetUpdateChainNext() const { return pUpdateChainNext; }
inline void SetUpdateChainNext( ScBroadcastArea* p ) { pUpdateChainNext = p; }
inline BOOL IsInUpdateChain() const { return bInUpdateChain; }
inline void SetInUpdateChain( BOOL b ) { bInUpdateChain = b; }
/** Equalness of this or range. */
inline bool operator==( const ScBroadcastArea & rArea ) const;
};
inline bool ScBroadcastArea::operator==( const ScBroadcastArea & rArea ) const
{
return aRange == rArea.aRange;
}
//=============================================================================
struct ScBroadcastAreaHash
{
size_t operator()( const ScBroadcastArea* p ) const
{
return p->GetRange().hashArea();
}
};
struct ScBroadcastAreaEqual
{
bool operator()( const ScBroadcastArea* p1, const ScBroadcastArea* p2) const
{
return *p1 == *p2;
}
};
typedef ::std::hash_set< ScBroadcastArea*, ScBroadcastAreaHash, ScBroadcastAreaEqual > ScBroadcastAreas;
//=============================================================================
struct ScBroadcastAreaBulkHash
{
size_t operator()( const ScBroadcastArea* p ) const
{
return reinterpret_cast<size_t>(p);
}
};
struct ScBroadcastAreaBulkEqual
{
bool operator()( const ScBroadcastArea* p1, const ScBroadcastArea* p2) const
{
return p1 == p2;
}
};
typedef ::std::hash_set< const ScBroadcastArea*, ScBroadcastAreaBulkHash,
ScBroadcastAreaBulkEqual > ScBroadcastAreasBulk;
//=============================================================================
class ScBroadcastAreaSlotMachine;
/// Collection of BroadcastAreas
class ScBroadcastAreaSlot
{
private:
ScBroadcastAreas aBroadcastAreaTbl;
mutable ScBroadcastArea aTmpSeekBroadcastArea; // for FindBroadcastArea()
ScDocument* pDoc;
ScBroadcastAreaSlotMachine* pBASM;
ScBroadcastAreas::iterator FindBroadcastArea( const ScRange& rRange ) const;
/**
More hypothetical (memory would probably be doomed anyway) check
whether there would be an overflow when adding an area, setting the
proper state if so.
@return TRUE if a HardRecalcState is effective and area is not to be
added.
*/
bool CheckHardRecalcStateCondition() const;
public:
ScBroadcastAreaSlot( ScDocument* pDoc,
ScBroadcastAreaSlotMachine* pBASM );
~ScBroadcastAreaSlot();
const ScBroadcastAreas& GetBroadcastAreas() const
{ return aBroadcastAreaTbl; }
/**
Only here new ScBroadcastArea objects are created, prevention of dupes.
@param rpArea
If NULL, a new ScBroadcastArea is created and assigned ton the
reference if a matching area wasn't found. If a matching area was
found, that is assigned. In any case, the SvtListener is added to
the broadcaster.
If not NULL then no listeners are startet, only the area is
inserted and the reference count incremented. Effectively the same
as InsertListeningArea(), so use that instead.
@return
TRUE if rpArea passed was NULL and ScBroadcastArea is newly
created.
*/
bool StartListeningArea( const ScRange& rRange,
SvtListener* pListener,
ScBroadcastArea*& rpArea );
/**
Insert a ScBroadcastArea obtained via StartListeningArea() to
subsequent slots.
*/
void InsertListeningArea( ScBroadcastArea* pArea );
void EndListeningArea( const ScRange& rRange,
SvtListener* pListener,
ScBroadcastArea*& rpArea );
BOOL AreaBroadcast( const ScHint& rHint ) const;
/// @return TRUE if at least one broadcast occurred.
BOOL AreaBroadcastInRange( const ScRange& rRange,
const ScHint& rHint ) const;
void DelBroadcastAreasInRange( const ScRange& rRange );
void UpdateRemove( UpdateRefMode eUpdateRefMode,
const ScRange& rRange,
SCsCOL nDx, SCsROW nDy, SCsTAB nDz );
void UpdateRemoveArea( ScBroadcastArea* pArea );
void UpdateInsert( ScBroadcastArea* pArea );
};
/**
BroadcastAreaSlots and their management, once per document.
*/
class ScBroadcastAreaSlotMachine
{
private:
/**
Slot offset arrangement of columns and rows, once per sheet.
+---+---+
| 0 | 3 |
+---+---+
| 1 | 4 |
+---+---+
| 2 | 5 |
+---+---+
*/
/* TODO: When going for 1M rows this will definitely need some change, or
* with lots of referred sheets even the reservation of NULL pointers would
* be a memory hog. */
class TableSlots
{
public:
TableSlots();
~TableSlots();
inline ScBroadcastAreaSlot** getSlots() { return ppSlots; }
/**
Obtain slot pointer, no check on validity! It is assumed that
all calls are made with the result of ComputeSlotOfsset()
*/
inline ScBroadcastAreaSlot* getAreaSlot( SCSIZE nOff ) { return *(ppSlots + nOff); }
private:
ScBroadcastAreaSlot** ppSlots;
// prevent usage
TableSlots( const TableSlots& );
TableSlots& operator=( const TableSlots& );
};
typedef ::std::map< SCTAB, TableSlots* > TableSlotsMap;
private:
ScBroadcastAreasBulk aBulkBroadcastAreas;
TableSlotsMap aTableSlotsMap;
SvtBroadcaster *pBCAlways; // for the RC_ALWAYS special range
ScDocument *pDoc;
ScBroadcastArea *pUpdateChain;
ScBroadcastArea *pEOUpdateChain;
ULONG nInBulkBroadcast;
inline SCSIZE ComputeSlotOffset( const ScAddress& rAddress ) const;
void ComputeAreaPoints( const ScRange& rRange,
SCSIZE& nStart, SCSIZE& nEnd,
SCSIZE& nRowBreak ) const;
public:
ScBroadcastAreaSlotMachine( ScDocument* pDoc );
~ScBroadcastAreaSlotMachine();
void StartListeningArea( const ScRange& rRange,
SvtListener* pListener );
void EndListeningArea( const ScRange& rRange,
SvtListener* pListener );
BOOL AreaBroadcast( const ScHint& rHint ) const;
// return: at least one broadcast occurred
BOOL AreaBroadcastInRange( const ScRange& rRange, const ScHint& rHint ) const;
void DelBroadcastAreasInRange( const ScRange& rRange );
void UpdateBroadcastAreas( UpdateRefMode eUpdateRefMode,
const ScRange& rRange,
SCsCOL nDx, SCsROW nDy, SCsTAB nDz );
void EnterBulkBroadcast();
void LeaveBulkBroadcast();
bool InsertBulkArea( const ScBroadcastArea* p );
/// @return: how many removed
size_t RemoveBulkArea( const ScBroadcastArea* p );
inline ScBroadcastArea* GetUpdateChain() const { return pUpdateChain; }
inline void SetUpdateChain( ScBroadcastArea* p ) { pUpdateChain = p; }
inline ScBroadcastArea* GetEOUpdateChain() const { return pEOUpdateChain; }
inline void SetEOUpdateChain( ScBroadcastArea* p ) { pEOUpdateChain = p; }
inline bool IsInBulkBroadcast() const { return nInBulkBroadcast > 0; }
};
class ScBulkBroadcast
{
ScBroadcastAreaSlotMachine* pBASM;
public:
explicit ScBulkBroadcast( ScBroadcastAreaSlotMachine* p ) : pBASM(p)
{
if (pBASM)
pBASM->EnterBulkBroadcast();
}
~ScBulkBroadcast()
{
if (pBASM)
pBASM->LeaveBulkBroadcast();
}
void LeaveBulkBroadcast()
{
if (pBASM)
{
pBASM->LeaveBulkBroadcast();
pBASM = NULL;
}
}
};
#endif
|