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
|
/* -*- 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_COLLECT_HXX
#define SC_COLLECT_HXX
#include "address.hxx"
#include <tools/string.hxx>
#ifndef INCLUDED_LIMITS_H
#include <limits.h>
#define INCLUDED_LIMITS_H
#endif
#include "scdllapi.h"
#define MAXCOLLECTIONSIZE 16384
#define MAXDELTA 1024
#define SCPOS_INVALID USHRT_MAX
#define SC_STRTYPE_VALUE 0
#define SC_STRTYPE_STANDARD 1
class ScDocument;
class SC_DLLPUBLIC ScDataObject
{
public:
ScDataObject() {}
virtual ~ScDataObject();
virtual ScDataObject* Clone() const = 0;
};
class SC_DLLPUBLIC ScCollection : public ScDataObject
{
protected:
sal_uInt16 nCount;
sal_uInt16 nLimit;
sal_uInt16 nDelta;
ScDataObject** pItems;
public:
ScCollection(sal_uInt16 nLim = 4, sal_uInt16 nDel = 4);
ScCollection(const ScCollection& rCollection);
virtual ~ScCollection();
virtual ScDataObject* Clone() const;
void AtFree(sal_uInt16 nIndex);
void Free(ScDataObject* pScDataObject);
void FreeAll();
sal_Bool AtInsert(sal_uInt16 nIndex, ScDataObject* pScDataObject);
virtual sal_Bool Insert(ScDataObject* pScDataObject);
ScDataObject* At(sal_uInt16 nIndex) const;
virtual sal_uInt16 IndexOf(ScDataObject* pScDataObject) const;
sal_uInt16 GetCount() const;
ScDataObject* operator[]( const sal_uInt16 nIndex) const {return At(nIndex);}
ScCollection& operator=( const ScCollection& rCol );
};
class SC_DLLPUBLIC ScSortedCollection : public ScCollection
{
private:
sal_Bool bDuplicates;
protected:
// for ScStrCollection load/store
void SetDups( sal_Bool bVal ) { bDuplicates = bVal; }
sal_Bool IsDups() const { return bDuplicates; }
public:
ScSortedCollection(sal_uInt16 nLim = 4, sal_uInt16 nDel = 4, sal_Bool bDup = false);
ScSortedCollection(const ScSortedCollection& rScSortedCollection) :
ScCollection(rScSortedCollection),
bDuplicates(rScSortedCollection.bDuplicates) {}
virtual sal_uInt16 IndexOf(ScDataObject* pScDataObject) const;
virtual short Compare(ScDataObject* pKey1, ScDataObject* pKey2) const = 0;
virtual sal_Bool IsEqual(ScDataObject* pKey1, ScDataObject* pKey2) const;
sal_Bool Search(ScDataObject* pScDataObject, sal_uInt16& rIndex) const;
virtual sal_Bool Insert(ScDataObject* pScDataObject);
virtual sal_Bool InsertPos(ScDataObject* pScDataObject, sal_uInt16& nIndex);
sal_Bool operator==(const ScSortedCollection& rCmp) const;
};
//------------------------------------------------------------------------
class StrData : public ScDataObject
{
friend class ScStrCollection;
String aStr;
public:
StrData(const String& rStr) : aStr(rStr) {}
StrData(const StrData& rData) : ScDataObject(), aStr(rData.aStr) {}
virtual ScDataObject* Clone() const;
const String& GetString() const { return aStr; }
// SetString only, if StrData is not in ScStrCollection! for example
// for Searcher
void SetString( const String& rNew ) { aStr = rNew; }
};
class SvStream;
class SC_DLLPUBLIC ScStrCollection : public ScSortedCollection
{
public:
ScStrCollection(sal_uInt16 nLim = 4, sal_uInt16 nDel = 4, sal_Bool bDup = false) :
ScSortedCollection ( nLim, nDel, bDup ) {}
ScStrCollection(const ScStrCollection& rScStrCollection) :
ScSortedCollection ( rScStrCollection ) {}
virtual ScDataObject* Clone() const;
StrData* operator[]( const sal_uInt16 nIndex) const {return (StrData*)At(nIndex);}
virtual short Compare(ScDataObject* pKey1, ScDataObject* pKey2) const;
};
//------------------------------------------------------------------------
// TypedScStrCollection: wie ScStrCollection, nur, dass Zahlen vor Strings
// sortiert werden
class TypedStrData : public ScDataObject
{
public:
TypedStrData( const String& rStr, double nVal = 0.0,
sal_uInt16 nType = SC_STRTYPE_STANDARD )
: aStrValue(rStr),
nValue(nVal),
nStrType(nType) {}
TypedStrData( const TypedStrData& rCpy )
: ScDataObject(),
aStrValue(rCpy.aStrValue),
nValue(rCpy.nValue),
nStrType(rCpy.nStrType) {}
virtual ScDataObject* Clone() const;
sal_Bool IsStrData() const { return nStrType != 0; }
const String& GetString() const { return aStrValue; }
double GetValue () const { return nValue; }
private:
friend class TypedScStrCollection;
String aStrValue;
double nValue;
sal_uInt16 nStrType; // 0 = Value
};
class SC_DLLPUBLIC TypedScStrCollection : public ScSortedCollection
{
private:
sal_Bool bCaseSensitive;
public:
TypedScStrCollection( sal_uInt16 nLim = 4, sal_uInt16 nDel = 4, sal_Bool bDup = false );
TypedScStrCollection( const TypedScStrCollection& rCpy )
: ScSortedCollection( rCpy ) { bCaseSensitive = rCpy.bCaseSensitive; }
~TypedScStrCollection();
virtual ScDataObject* Clone() const;
virtual short Compare( ScDataObject* pKey1, ScDataObject* pKey2 ) const;
TypedStrData* operator[]( const sal_uInt16 nIndex) const;
void SetCaseSensitive( sal_Bool bSet );
sal_Bool FindText( const String& rStart, String& rResult, sal_uInt16& rPos, sal_Bool bBack ) const;
sal_Bool GetExactMatch( String& rString ) const;
};
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
