forked from spirit-labs/tektite
-
Notifications
You must be signed in to change notification settings - Fork 0
/
iters.go
153 lines (137 loc) · 3.34 KB
/
iters.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
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
143
144
145
146
147
148
149
150
151
152
153
package sst
import (
"bytes"
"github.com/spirit-labs/tektite/asl/encoding"
"github.com/spirit-labs/tektite/common"
"github.com/spirit-labs/tektite/iteration"
log "github.com/spirit-labs/tektite/logger"
)
func (s *SSTable) NewIterator(keyStart []byte, keyEnd []byte) (iteration.Iterator, error) {
offset := s.findOffset(keyStart)
si := &SSTableIterator{
ss: s,
nextOffset: offset,
keyEnd: keyEnd,
}
return si, nil
}
type SSTableIterator struct {
ss *SSTable
nextOffset int
valid bool
currkV common.KV
keyEnd []byte
}
func (si *SSTableIterator) Next() (bool, common.KV, error) {
if si.nextOffset == -1 {
si.valid = false
si.currkV = common.KV{}
return false, common.KV{}, nil
}
indexOffset := int(si.ss.indexOffset)
var kl, vl uint32
kl, si.nextOffset = encoding.ReadUint32FromBufferLE(si.ss.data, si.nextOffset)
k := si.ss.data[si.nextOffset : si.nextOffset+int(kl)]
if si.keyEnd != nil && bytes.Compare(k, si.keyEnd) >= 0 {
// End of range
si.nextOffset = -1
si.valid = false
si.currkV = common.KV{}
return false, common.KV{}, nil
} else {
si.currkV.Key = k
si.nextOffset += int(kl)
vl, si.nextOffset = encoding.ReadUint32FromBufferLE(si.ss.data, si.nextOffset)
if vl == 0 {
si.currkV.Value = nil
} else {
si.currkV.Value = si.ss.data[si.nextOffset : si.nextOffset+int(vl)]
}
si.nextOffset += int(vl)
if si.nextOffset >= indexOffset { // Start of index data marks end of entries data
// Reached end of SSTable
si.nextOffset = -1
}
si.valid = true
return true, si.currkV, nil
}
}
func (si *SSTableIterator) Current() common.KV {
return si.currkV
}
func (si *SSTableIterator) Close() {
}
type tableGetter interface {
GetSSTable(tableID SSTableID) (*SSTable, error)
}
type LazySSTableIterator struct {
tableID SSTableID
tableCache tableGetter
keyStart []byte
keyEnd []byte
iter iteration.Iterator
}
func NewLazySSTableIterator(
tableID SSTableID, tableCache tableGetter,
keyStart []byte, keyEnd []byte,
) (iteration.Iterator, error) {
it := &LazySSTableIterator{
tableID: tableID,
tableCache: tableCache,
keyStart: keyStart,
keyEnd: keyEnd,
}
return it, nil
}
func (l *LazySSTableIterator) Next() (bool, common.KV, error) {
iter, err := l.getIter()
if err != nil {
return false, common.KV{}, err
}
return iter.Next()
}
func (l *LazySSTableIterator) Current() common.KV {
if l.iter == nil {
return common.KV{}
}
return l.iter.Current()
}
func (l *LazySSTableIterator) Close() {
if l.iter != nil {
l.iter.Close()
}
}
//goland:noinspection GoUnusedFunction
func dumpSST(id SSTableID, sst *SSTable) {
sstIter, err := sst.NewIterator(nil, nil)
if err != nil {
panic(err)
}
log.Debugf("==============Dumping sstable: %v", id)
for {
valid, current, err := sstIter.Next()
if err != nil {
panic(err)
}
if !valid {
break
}
log.Debugf("key: %v (%s) value: %v (%s)", current.Key, string(current.Key),
current.Value, string(current.Value))
}
log.Debugf("==============End Dumping sstable: %v", id)
}
func (l *LazySSTableIterator) getIter() (iteration.Iterator, error) {
if l.iter == nil {
ssTable, err := l.tableCache.GetSSTable(l.tableID)
if err != nil {
return nil, err
}
iter, err := ssTable.NewIterator(l.keyStart, l.keyEnd)
if err != nil {
return nil, err
}
l.iter = iter
}
return l.iter, nil
}