/
bucket.h
96 lines (77 loc) · 2.03 KB
/
bucket.h
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
#ifndef _BUCKET_H_
#define _BUCKET_H_
#include "data.h"
#include "record.h"
namespace ST
{
class BucketBuf;
class OverflowBuf;
class Pager;
class PageBuf;
class BucketIter;
class Bucket;
class BucketIter
{
public:
friend class Bucket;
BucketIter();
BucketIter(const BucketIter &iter);
BucketIter &operator=(const BucketIter &iter);
~BucketIter();
void get_key(buffer &key);
void get_value(buffer &value);
//uint32_t get_hash32();
Record &record() { return m_riter; }
bool next();
private:
BucketIter(BucketBuf *iter);
void load_overflow();
void copy(const BucketIter &iter);
uint32_t m_pptr;
BucketBuf *m_biter;
Record m_riter;
OverflowBuf *m_xtra;
};
class Bucket
{
public:
enum
{
NOCLEAN = 1<<1,
KEEPOVERFLOW = 1<<2
};
enum
{
APPEND_OK = 0,
APPEND_OVERFLOW,
APPEND_CONFLICT
};
public:
Bucket();
Bucket(BucketBuf *head);
~Bucket();
void set_head(BucketBuf *head);
BucketBuf *get_head();
int append(uint32_t hash32, const buffer &key, const buffer &value,
bool dupok = true, int maxrec = 0)
{
return append(hash32, &key[0], key.size(), &value[0], value.size(),
dupok, maxrec);
}
int append(uint32_t hash32, const void *key, uint32_t ksize,
const void *value, uint32_t vsize, bool dupok = true,
int maxrec = 0);
void remove(BucketIter &iter, int cleanup = 0);
void compact();
void clear();
void copy_quick(BucketIter &ito, BucketIter &ifrom);
bool empty();
BucketIter iter();
private:
BucketBuf *m_head;
private:
Bucket(const Bucket &);
Bucket &operator=(const Bucket &);
};
}
#endif