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
|
/* -*- 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.
*
************************************************************************/
#ifndef SC_COMPRESSEDARRAY_HXX
#define SC_COMPRESSEDARRAY_HXX
#include <cstddef>
#include <algorithm>
#include "scdllapi.h"
const size_t nScCompressedArrayDelta = 4;
/** Compressed array of row (or column) entries, e.g. heights, flags, ...
The array stores ranges of values such that consecutive values occupy only
one entry. Initially it consists of one DataEntry with an implied start
row/column of 0 and an end row/column of access type maximum value.
typename A := access type, e.g. SCROW or SCCOL, must be a POD.
typename D := data type, e.g. sal_uInt16 or sal_uInt8 or whatever, may also be a
struct or class.
D::operator==() and D::operator=() must be implemented. Force template
instantiation for a specific type in source/core/data/compressedarray.cxx
TODO: Currently the allocated memory never shrinks, must manually invoke
Resize() if needed.
*/
template< typename A, typename D > class ScCompressedArray
{
public:
struct DataEntry
{
A nEnd; // start is end of previous entry + 1
D aValue;
DataEntry() {} //! uninitialized
};
/** Construct with nMaxAccess=MAXROW, for example. */
ScCompressedArray( A nMaxAccess,
const D& rValue,
size_t nDelta = nScCompressedArrayDelta );
/** Construct from a plain array of D */
ScCompressedArray( A nMaxAccess,
const D* pDataArray, size_t nDataCount );
virtual ~ScCompressedArray();
void Resize( size_t nNewSize );
void Reset( const D& rValue );
void SetValue( A nPos, const D& rValue );
void SetValue( A nStart, A nEnd, const D& rValue );
const D& GetValue( A nPos ) const;
/** Get value for a row, and it's region end row */
const D& GetValue( A nPos, size_t& nIndex, A& nEnd ) const;
/** Get next value and it's region end row. If nIndex<nCount, nIndex is
incremented first. If the resulting nIndex>=nCount, the value of the
last entry is returned again. */
const D& GetNextValue( size_t& nIndex, A& nEnd ) const;
/** Insert rows before nStart and copy value for inserted rows from
nStart-1, return that value. */
const D& Insert( A nStart, size_t nCount );
void Remove( A nStart, size_t nCount );
/** Copy rArray.nStart+nSourceDy to this.nStart */
void CopyFrom( const ScCompressedArray& rArray,
A nStart, A nEnd, long nSourceDy = 0 );
// methods public for the coupled array sum methods
/** Obtain index into entries for nPos */
SC_DLLPUBLIC size_t Search( A nPos ) const;
protected:
size_t nCount;
size_t nLimit;
size_t nDelta;
DataEntry* pData;
A nMaxAccess;
};
template< typename A, typename D >
void ScCompressedArray<A,D>::Reset( const D& rValue )
{
// Create a temporary copy in case we got a reference passed that points to
// a part of the array to be reallocated.
D aTmpVal( rValue);
delete[] pData;
nCount = nLimit = 1;
pData = new DataEntry[1];
pData[0].aValue = aTmpVal;
pData[0].nEnd = nMaxAccess;
}
template< typename A, typename D >
void ScCompressedArray<A,D>::SetValue( A nPos, const D& rValue )
{
SetValue( nPos, nPos, rValue);
}
template< typename A, typename D >
const D& ScCompressedArray<A,D>::GetValue( A nPos ) const
{
size_t nIndex = Search( nPos);
return pData[nIndex].aValue;
}
template< typename A, typename D >
const D& ScCompressedArray<A,D>::GetValue( A nPos, size_t& nIndex, A& nEnd ) const
{
nIndex = Search( nPos);
nEnd = pData[nIndex].nEnd;
return pData[nIndex].aValue;
}
template< typename A, typename D >
const D& ScCompressedArray<A,D>::GetNextValue( size_t& nIndex, A& nEnd ) const
{
if (nIndex < nCount)
++nIndex;
size_t nEntry = (nIndex < nCount ? nIndex : nCount-1);
nEnd = pData[nEntry].nEnd;
return pData[nEntry].aValue;
}
// === ScBitMaskCompressedArray ==============================================
/** The data type represents bits, managable by bitwise operations.
*/
template< typename A, typename D > class ScBitMaskCompressedArray : public ScCompressedArray<A,D>
{
public:
ScBitMaskCompressedArray( A nMaxAccessP,
const D& rValue,
size_t nDeltaP = nScCompressedArrayDelta )
: ScCompressedArray<A,D>( nMaxAccessP, rValue, nDeltaP)
{}
ScBitMaskCompressedArray( A nMaxAccessP,
const D* pDataArray, size_t nDataCount )
: ScCompressedArray<A,D>( nMaxAccessP,
pDataArray, nDataCount)
{}
void AndValue( A nPos, const D& rValueToAnd );
void OrValue( A nPos, const D& rValueToOr );
void AndValue( A nStart, A nEnd, const D& rValueToAnd );
void OrValue( A nStart, A nEnd, const D& rValueToOr );
/** Copy values from rArray and bitwise AND them with rValueToAnd. */
void CopyFromAnded(
const ScBitMaskCompressedArray& rArray,
A nStart, A nEnd, const D& rValueToAnd,
long nSourceDy = 0 );
/** Return the first row where an entry meets the condition:
((aValue & rBitMask) == rMaskedCompare), searching between nStart and
nEnd. If no entry meets this condition, ::std::numeric_limits<A>::max()
is returned. */
SC_DLLPUBLIC A GetFirstForCondition( A nStart, A nEnd,
const D& rBitMask,
const D& rMaskedCompare ) const;
/** Return the last row where an entry meets the condition:
((aValue & rBitMask) != 0), start searching at nStart. If no entry
meets this condition, ::std::numeric_limits<A>::max() is returned. */
A GetLastAnyBitAccess( A nStart,
const D& rBitMask ) const;
};
template< typename A, typename D >
void ScBitMaskCompressedArray<A,D>::AndValue( A nPos, const D& rValueToAnd )
{
const D& rValue = this->GetValue( nPos);
if ((rValue & rValueToAnd) != rValue)
this->SetValue( nPos, rValue & rValueToAnd);
}
template< typename A, typename D >
void ScBitMaskCompressedArray<A,D>::OrValue( A nPos, const D& rValueToOr )
{
const D& rValue = this->GetValue( nPos);
if ((rValue | rValueToOr) != rValue)
this->SetValue( nPos, rValue | rValueToOr);
}
#endif // SC_COMPRESSEDARRAY_HXX
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
