forked from nutsdb/nutsdb
-
Notifications
You must be signed in to change notification settings - Fork 0
/
iterator.go
77 lines (64 loc) · 1.63 KB
/
iterator.go
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
// Copyright 2023 The nutsdb Author. All rights reserved.
//
// Licensed under the Apache License, Version 2.0 (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.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package nutsdb
import (
"github.com/tidwall/btree"
)
type Iterator struct {
tx *Tx
options IteratorOptions
iter btree.IterG[*Item]
}
type IteratorOptions struct {
Reverse bool
}
func NewIterator(tx *Tx, bucket string, options IteratorOptions) *Iterator {
iterator := &Iterator{
tx: tx,
options: options,
iter: tx.db.BTreeIdx[bucket].btree.Iter(),
}
if options.Reverse {
iterator.iter.Last()
} else {
iterator.iter.First()
}
return iterator
}
func (it *Iterator) Rewind() bool {
if it.options.Reverse {
return it.iter.Last()
} else {
return it.iter.First()
}
}
func (it *Iterator) Seek(key []byte) bool {
return it.iter.Seek(&Item{key: key})
}
func (it *Iterator) Next() bool {
if it.options.Reverse {
return it.iter.Prev()
} else {
return it.iter.Next()
}
}
func (it *Iterator) Valid() bool {
return it.iter.Item() != nil
}
func (it *Iterator) Key() []byte {
return it.iter.Item().key
}
func (it *Iterator) Value() ([]byte, error) {
return it.tx.db.getValueByRecord(it.iter.Item().r)
}