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
|
/****************************************************************************
**
** Copyright (C) 2012 Nokia Corporation and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/
**
** This file is part of the QtAddOn.JsonDb module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** GNU Lesser General Public License Usage
** This file may be used under the terms of the GNU Lesser General Public
** License version 2.1 as published by the Free Software Foundation and
** appearing in the file LICENSE.LGPL included in the packaging of this
** file. Please review the following information to ensure the GNU Lesser
** General Public License version 2.1 requirements will be met:
** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain additional
** rights. These rights are described in the Nokia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU General
** Public License version 3.0 as published by the Free Software Foundation
** and appearing in the file LICENSE.GPL included in the packaging of this
** file. Please review the following information to ensure the GNU General
** Public License version 3.0 requirements will be met:
** http://www.gnu.org/copyleft/gpl.html.
**
** Other Usage
** Alternatively, this file may be used in accordance with the terms and
** conditions contained in a signed written agreement between you and Nokia.
**
**
**
**
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#ifndef HBTREECURSOR_H
#define HBTREECURSOR_H
#include <QByteArray>
#include <QStack>
class HBtree;
class HBtreeTransaction;
class HBtreeCursor
{
public:
enum RangePolicy
{
EqualOrGreater,
EqualOrLess
};
HBtreeCursor();
explicit HBtreeCursor(HBtreeTransaction * transaction);
explicit HBtreeCursor(HBtree *btree, bool commited = false);
~HBtreeCursor();
QByteArray key() const { return key_; }
QByteArray value() const { return value_; }
bool current(QByteArray *pKey, QByteArray *pValue);
bool last();
bool first();
bool next();
bool previous();
bool seek(const QByteArray &key);
bool seekRange(const QByteArray &key, RangePolicy policy = EqualOrGreater);
HBtreeCursor(const HBtreeCursor &other);
HBtreeCursor &operator = (const HBtreeCursor &other);
private:
enum Op {
First,
Last,
Previous,
Next,
ExactMatch,
FuzzyMatch
};
friend class HBtree;
friend class HBtreePrivate;
QByteArray key_;
QByteArray value_;
HBtreeTransaction *transaction_;
HBtree *btree_;
quint32 lastLeaf_;
bool valid_;
bool doOp(Op op, const QByteArray &key = QByteArray());
};
#endif // HBTREECURSOR_H
|
