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
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
|
/*************************************************************************
*
* $RCSfile: dindexnode.hxx,v $
*
* $Revision: 1.1.1.1 $
*
* last change: $Author: hr $ $Date: 2000-09-18 16:14:26 $
*
* The Contents of this file are made available subject to the terms of
* either of the following licenses
*
* - GNU Lesser General Public License Version 2.1
* - Sun Industry Standards Source License Version 1.1
*
* Sun Microsystems Inc., October, 2000
*
* GNU Lesser General Public License Version 2.1
* =============================================
* Copyright 2000 by Sun Microsystems, Inc.
* 901 San Antonio Road, Palo Alto, CA 94303, USA
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 2.1, as published by the Free Software Foundation.
*
* This library 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 for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston,
* MA 02111-1307 USA
*
*
* Sun Industry Standards Source License Version 1.1
* =================================================
* The contents of this file are subject to the Sun Industry Standards
* Source License Version 1.1 (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.openoffice.org/license.html.
*
* Software provided under this License is provided on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,
* WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,
* MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.
* See the License for the specific provisions governing your rights and
* obligations concerning the Software.
*
* The Initial Developer of the Original Code is: Sun Microsystems, Inc.
*
* Copyright: 2000 by Sun Microsystems, Inc.
*
* All Rights Reserved.
*
* Contributor(s): _______________________________________
*
*
************************************************************************/
#ifndef _CONNECTIVITY_DBASE_INDEXNODE_HXX_
#define _CONNECTIVITY_DBASE_INDEXNODE_HXX_
#ifndef _CONNECTIVITY_FILE_FCODE_HXX_
#include "file/fcode.hxx"
#endif
#ifndef _CONNECTIVITY_FILE_TABLE_HXX_
#include "file/FTable.hxx"
#endif
#ifndef _CONNECTIVITY_DBASE_INDEXPAGE_HXX_
#include "dbase/DIndexPage.hxx"
#endif
#ifndef _CONNECTIVITY_FILE_VALUE_HXX_
#include "file/FValue.hxx"
#endif
namespace connectivity
{
namespace dbase
{
class ONDXNode;
class ODbaseIndex;
typedef file::OFileValue OFileValue_BASE;
//==================================================================
// Index Key
//==================================================================
typedef file::OOperand ONDXKey_BASE;
class ONDXKey : public ONDXKey_BASE
{
friend class ONDXNode;
UINT32 nRecord; /* Satzzeiger */
OFileValue_BASE xValue; /* Schluesselwert */
public:
ONDXKey():nRecord(0){}
inline ONDXKey(const OFileValue_BASE& rVal, sal_Int32 eType, UINT32 nRec)
: ONDXKey_BASE(eType)
, nRecord(nRec)
, xValue(rVal)
{}
ONDXKey(const rtl::OUString& aStr, UINT32 nRec = 0)
: ONDXKey_BASE(::com::sun::star::sdbc::DataType::VARCHAR)
,nRecord(nRec)
{
if (aStr.len())
xValue = aStr;
}
ONDXKey(double aVal, UINT32 nRec = 0)
: ONDXKey_BASE(::com::sun::star::sdbc::DataType::DOUBLE)
,nRecord(nRec)
,xValue(aVal)
{
}
ONDXKey(UINT32 nRec)
: nRecord(nRec){}
inline ONDXKey(const ONDXKey& rKey);
inline ONDXKey& operator= (const ONDXKey& rKey);
virtual void setValue(const ::com::sun::star::uno::Any& _rVal)
{
xValue = _rVal;
}
virtual ::com::sun::star::uno::Any getValue() const
{
return xValue;
}
UINT32 GetRecord() const {return nRecord;}
void ResetRecord() {nRecord = 0;}
BOOL operator == (const ONDXKey& rKey) const;
BOOL operator != (const ONDXKey& rKey) const;
BOOL operator < (const ONDXKey& rKey) const;
BOOL operator <= (const ONDXKey& rKey) const;
BOOL operator > (const ONDXKey& rKey) const;
BOOL operator >= (const ONDXKey& rKey) const;
BOOL Load (SvFileStream& rStream, BOOL bText);
BOOL Write(SvFileStream& rStream, BOOL bText);
static BOOL IsText(sal_Int32 eType);
private:
StringCompare Compare(const ONDXKey& rKey) const;
};
#define NODE_NOTFOUND 0xFFFF
class ONDXPagePtr;
//==================================================================
// Index Seite
//==================================================================
class ONDXPage //: public SvRefBase
{
friend class ODbaseIndex;
friend SvStream& operator << (SvStream &rStream, const ONDXPage&);
friend SvStream& operator >> (SvStream &rStream, ONDXPage&);
UINT32 nPagePos; // Position in der Indexdatei
BOOL bModified : 1;
USHORT nCount;
ONDXPagePtr *aParent, // VaterSeite
*aChild; // Zeiger auf rechte ChildPage
ODbaseIndex& rIndex;
ONDXNode* ppNodes; // array von Knoten
oslInterlockedCount m_refCount;
public:
void acquire()
{
osl_incrementInterlockedCount( &m_refCount );
}
void release();
// Knoten Operationen
USHORT Count() const {return nCount;}
BOOL Insert(ONDXNode& rNode, ULONG nRowsLeft = 0);
BOOL Insert(USHORT nIndex, ONDXNode& rNode);
BOOL Append(ONDXNode& rNode);
BOOL Delete(USHORT);
void Remove(USHORT);
void Release(BOOL bSave = TRUE);
void ReleaseFull(BOOL bSave = TRUE);
// Aufteilen und Zerlegen
ONDXNode Split(ONDXPage& rPage);
void Merge(USHORT nParentNodePos, ONDXPagePtr xPage);
// Zugriffsoperationen
ONDXNode& operator[] (USHORT nPos);
const ONDXNode& operator[] (USHORT nPos) const;
BOOL IsRoot() const;
BOOL IsLeaf() const;
BOOL IsModified() const;
BOOL HasParent();
BOOL HasChild() const;
BOOL IsFull() const;
UINT32 GetPagePos() const {return nPagePos;}
ONDXPagePtr& GetChild(ODbaseIndex* pIndex = 0);
// Parent braucht nicht nachgeladen zu werden
ONDXPagePtr GetParent();
ODbaseIndex& GetIndex() {return rIndex;}
const ODbaseIndex& GetIndex() const {return rIndex;}
// Setzen des Childs, ueber Referenz, um die PagePos zu erhalten
void SetChild(ONDXPagePtr aCh);
void SetParent(ONDXPagePtr aPa);
USHORT Search(const ONDXKey& rSearch);
USHORT Search(const ONDXPage* pPage);
void SearchAndReplace(const ONDXKey& rSearch, ONDXKey& rReplace);
protected:
ONDXPage(ODbaseIndex& rIndex, ULONG nPos, ONDXPage* = NULL);
~ONDXPage();
virtual void QueryDelete();
void SetModified(BOOL bMod) {bModified = bMod;}
void SetPagePos(UINT32 nPage) {nPagePos = nPage;}
BOOL Find(const ONDXKey&); // rek. Abstieg
USHORT FindPos(const ONDXKey& rKey) const;
#ifdef DEBUG
void PrintPage();
#endif
};
//==================================================================
// Index Seitenverweis
//==================================================================
// SV_DECL_REF(ONDXPage); // Basisklasse da weitere Informationen gehalten werden muessen
typedef vos::ORef<ONDXPage> ONDXPagePtr_BASE;
class ONDXPagePtr : public ONDXPagePtr_BASE //ONDXPageRef
{
friend SvStream& operator << (SvStream &rStream, const ONDXPagePtr&);
friend SvStream& operator >> (SvStream &rStream, ONDXPagePtr&);
UINT32 nPagePos; // Position in der Indexdatei
public:
ONDXPagePtr(UINT32 nPos = 0):nPagePos(nPos){}
ONDXPagePtr(const ONDXPagePtr& rRef);
ONDXPagePtr(ONDXPage* pRefPage);
ONDXPagePtr& operator=(const ONDXPagePtr& rRef);
ONDXPagePtr& operator=(ONDXPage* pPageRef);
UINT32 GetPagePos() const {return nPagePos;}
BOOL HasPage() const {return nPagePos != 0;}
sal_Bool Is() const { return isValid(); }
void Clear()
{
unbind();
}
};
SvStream& operator << (SvStream &rStream, const ONDXPagePtr&);
SvStream& operator >> (SvStream &rStream, ONDXPagePtr&);
inline BOOL ONDXPage::IsRoot() const {return !aParent->Is();}
inline BOOL ONDXPage::IsLeaf() const {return !aChild->HasPage();}
inline BOOL ONDXPage::IsModified() const {return bModified;}
inline BOOL ONDXPage::HasParent() {return aParent->Is();}
inline BOOL ONDXPage::HasChild() const {return aChild->HasPage();}
inline ONDXPagePtr ONDXPage::GetParent() {return *aParent;}
inline void ONDXPage::SetParent(ONDXPagePtr aPa = ONDXPagePtr())
{ *aParent = aPa;}
inline void ONDXPage::SetChild(ONDXPagePtr aCh = ONDXPagePtr())
{
*aChild = aCh;
if (aChild->Is())
(*aChild)->SetParent(this);
}
SvStream& operator >> (SvStream &rStream, ONDXPage& rPage);
SvStream& operator << (SvStream &rStream, const ONDXPage& rPage);
typedef ::std::vector<ONDXPage*> ONDXPageList;
//==================================================================
// Index Knoten
//==================================================================
class ONDXNode
{
friend class ONDXPage;
ONDXPagePtr aChild; /* naechster Seitenverweis */
ONDXKey aKey;
public:
ONDXNode(){}
ONDXNode(const ONDXKey& rKey,
ONDXPagePtr aPagePtr = ONDXPagePtr())
:aKey(rKey), aChild(aPagePtr) {}
// verweist der Knoten auf eine Seite
BOOL HasChild() const {return aChild.HasPage();}
// Ist ein Index angegeben, kann gegebenfalls die Seite nachgeladen werden
ONDXPagePtr& GetChild(ODbaseIndex* pIndex = NULL, ONDXPage* = NULL);
const ONDXKey& GetKey() const {return aKey;}
ONDXKey& GetKey() {return aKey;}
// Setzen des Childs, ueber Referenz, um die PagePos zu erhalten
void SetChild(ONDXPagePtr aCh = ONDXPagePtr(), ONDXPage* = NULL);
void SetKey(ONDXKey& rKey) {aKey = rKey;}
void Write(SvStream &rStream, const ONDXPage& rPage) const;
void Read(SvStream &rStream, ODbaseIndex&);
};
//==================================================================
// inline implementation
//==================================================================
// inline ONDXKey::ONDXKey(const OFileValue_BASE& rVal, sal_Int32 eType, UINT32 nRec)
// : ONDXKey_BASE(eType)
// , nRecord(nRec),xValue(rVal)
// {
// }
// inline ONDXKey::ONDXKey(const rtl::OUString& aStr, UINT32 nRec)
// : ONDXKey_BASE(::com::sun::star::sdbc::DataType::VARCHAR)
// ,nRecord(nRec)
// {
// if (aStr.len())
// xValue = aStr;
// }
// inline ONDXKey::ONDXKey(double aVal, UINT32 nRec)
// : ONDXKey_BASE(::com::sun::star::sdbc::DataType::DOUBLE)
// ,nRecord(nRec)
// ,xValue(aVal)
// {
// }
// inline ONDXKey::ONDXKey(UINT32 nRec)
// :nRecord(nRec)
// {
// }
inline ONDXKey::ONDXKey(const ONDXKey& rKey)
: ONDXKey_BASE(rKey.getDBType())
,nRecord(rKey.nRecord),xValue(rKey.xValue)
{
}
inline ONDXKey& ONDXKey::operator=(const ONDXKey& rKey)
{
xValue = rKey.xValue;
nRecord = rKey.nRecord;
m_eDBType = rKey.getDBType();
return *this;
}
inline BOOL ONDXKey::operator == (const ONDXKey& rKey) const
{
return Compare(rKey) == COMPARE_EQUAL;
}
inline BOOL ONDXKey::operator != (const ONDXKey& rKey) const
{
return !operator== (rKey);
}
inline BOOL ONDXKey::operator < (const ONDXKey& rKey) const
{
return Compare(rKey) == COMPARE_LESS;
}
inline BOOL ONDXKey::operator > (const ONDXKey& rKey) const
{
return Compare(rKey) == COMPARE_GREATER;
}
inline BOOL ONDXKey::operator <= (const ONDXKey& rKey) const
{
return !operator > (rKey);
}
inline BOOL ONDXKey::operator >= (const ONDXKey& rKey) const
{
return !operator< (rKey);
}
inline void ONDXNode::SetChild(ONDXPagePtr aCh, ONDXPage* pParent)
{
aChild = aCh;
if (aChild.Is())
aChild->SetParent(pParent);
}
}
}
#endif // _CONNECTIVITY_DBASE_INDEXNODE_HXX_
|
