blob: d12cfe9f05d014892a73db855603537b027ccec0 (
plain)
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
|
/*************************************************************************
*
* 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: Block.hxx,v $
* $Revision: 1.4 $
*
* 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 _XMLSEARCH_DB_BLOCK_HXX_
#define _XMLSEARCH_DB_BLOCK_HXX_
#include <rtl/ustring.hxx>
#include <excep/XmlSearchExceptions.hxx>
namespace xmlsearch {
namespace util {
class RandomAccessStream;
}
namespace db {
class DBEnv;
class Block // refcounted class
{
public:
Block( const DBEnv* );
virtual ~Block();
sal_Int32 getInteger( sal_Int32 i ) const throw( xmlsearch::excep::IllegalIndexException );
void trueLeaf() { isLeaf_ = true; }
void falseLeaf() { isLeaf_ = false; }
bool isLeaf() const { return isLeaf_; }
void setFree( sal_Int32 free ) { free_ = free; }
sal_Int32 getFree() const { return free_; }
void setNum( sal_Int32 num ) { num_ = num; }
sal_Int32 getNum() const { return num_; }
void read( util::RandomAccessStream* in );
const sal_Int8* getData() const { return data_; }
protected:
const DBEnv* dbenv_; // not owner
private:
bool isLeaf_;
sal_Int32 free_;
sal_Int32 num_;
sal_Int32 dataL_;
sal_Int8* data_;
// methods
Block( const Block& );
Block& operator=( const Block& );
}; // end class Block
}
}
inline sal_Int32 getInteger_( const sal_Int8* v )
{
return (((((( v[0]&0xFF ) << 8 )
| v[1]&0xFF ) << 8 )
| v[2]&0xFF ) << 8 )
| v[3]&0xFF;
}
inline void setInteger_( sal_Int8* v,sal_Int32 value )
{
v[0] = sal_Int8((value >> 24) & 0xFF);
v[1] = sal_Int8((value >> 16) & 0xFF);
v[2] = sal_Int8((value >> 8) & 0xFF);
v[3] = sal_Int8( value & 0xFF );
}
#endif
|
