-
Notifications
You must be signed in to change notification settings - Fork 344
Expand file tree
/
Copy pathiterator.go
More file actions
142 lines (119 loc) · 2.98 KB
/
iterator.go
File metadata and controls
142 lines (119 loc) · 2.98 KB
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
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
// 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/nutsdb/nutsdb/internal/core"
"github.com/tidwall/btree"
)
type Iterator struct {
tx *Tx
options IteratorOptions
iter btree.IterG[*core.Item[core.Record]]
// Cached current item to avoid repeated iter.Item() calls
currentItem *core.Item[core.Record]
// Track validity state to avoid unnecessary checks
valid bool
}
type IteratorOptions struct {
Reverse bool
}
// Returns a new iterator.
// The Release method must be called when finished with the iterator.
func NewIterator(tx *Tx, bucket string, options IteratorOptions) *Iterator {
b, err := tx.db.bucketMgr.GetBucket(DataStructureBTree, bucket)
if err != nil {
return nil
}
iterator := &Iterator{
tx: tx,
options: options,
iter: tx.db.Index.BTree.GetWithDefault(b.Id).Iter(),
}
// Initialize position and cache the first item
if options.Reverse {
iterator.valid = iterator.iter.Last()
} else {
iterator.valid = iterator.iter.First()
}
if iterator.valid {
iterator.currentItem = iterator.iter.Item()
}
return iterator
}
func (it *Iterator) Rewind() bool {
if it.options.Reverse {
it.valid = it.iter.Last()
} else {
it.valid = it.iter.First()
}
if it.valid {
it.currentItem = it.iter.Item()
} else {
it.currentItem = nil
}
return it.valid
}
func (it *Iterator) Seek(key []byte) bool {
it.valid = it.iter.Seek(&core.Item[core.Record]{Key: key})
if it.valid {
it.currentItem = it.iter.Item()
} else {
it.currentItem = nil
}
return it.valid
}
func (it *Iterator) Next() bool {
if !it.valid {
return false
}
if it.options.Reverse {
it.valid = it.iter.Prev()
} else {
it.valid = it.iter.Next()
}
if it.valid {
it.currentItem = it.iter.Item()
} else {
it.currentItem = nil
}
return it.valid
}
func (it *Iterator) Valid() bool {
return it.valid
}
func (it *Iterator) Key() []byte {
if !it.valid {
return nil
}
return it.currentItem.Key
}
func (it *Iterator) Value() ([]byte, error) {
if !it.valid {
return nil, ErrKeyNotFound
}
return it.tx.db.getValueByRecord(it.currentItem.Record)
}
// Item returns the current item (key + record) if valid
// This is useful for advanced use cases that need direct access to the record
func (it *Iterator) Item() *core.Item[core.Record] {
if !it.valid {
return nil
}
return it.currentItem
}
func (it *Iterator) Release() {
it.iter.Release()
it.currentItem = nil
it.valid = false
}