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
|
/* Copyright (C) 2003 MySQL AB
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; version 2 of the License.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA */
#ifndef NDB_ROPE_HPP
#define NDB_ROPE_HPP
#include "DataBuffer.hpp"
typedef DataBuffer<7> RopeBase;
typedef DataBuffer<7>::DataBufferPool RopePool;
struct RopeHandle {
RopeHandle() { m_hash = 0; }
Uint32 m_hash;
RopeBase::Head m_head;
Uint32 hashValue() const { return m_hash; }
};
class ConstRope : private RopeBase {
public:
ConstRope(RopePool& thePool, const RopeHandle& handle)
: RopeBase(thePool), src(handle)
{
this->head = src.m_head;
}
~ConstRope(){
}
size_t size() const;
bool empty() const;
void copy(char* buf) const;
int compare(const char * s) const { return compare(s, strlen(s) + 1); }
int compare(const char *, size_t len) const;
private:
const RopeHandle & src;
};
class Rope : private RopeBase {
public:
Rope(RopePool& thePool, RopeHandle& handle)
: RopeBase(thePool), src(handle)
{
this->head = src.m_head;
m_hash = src.m_hash;
}
~Rope(){
src.m_head = this->head;
src.m_hash = m_hash;
}
size_t size() const;
bool empty() const;
void copy(char* buf) const;
int compare(const char * s) const { return compare(s, strlen(s) + 1); }
int compare(const char *, size_t len) const;
bool assign(const char * s) { return assign(s, strlen(s) + 1);}
bool assign(const char * s, size_t l) { return assign(s, l, hash(s, l));}
bool assign(const char *, size_t len, Uint32 hash);
void erase();
static Uint32 hash(const char * str, Uint32 len);
private:
Uint32 m_hash;
RopeHandle & src;
};
inline
size_t
Rope::size() const {
return head.used;
}
inline
bool
Rope::empty() const {
return head.used == 0;
}
inline
size_t
ConstRope::size() const {
return head.used;
}
inline
bool
ConstRope::empty() const {
return head.used == 0;
}
#endif
|