-
Notifications
You must be signed in to change notification settings - Fork 348
/
iterator.go
71 lines (62 loc) · 1.34 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
package local
import (
"time"
"github.com/dgraph-io/badger/v3"
"github.com/treeverse/lakefs/pkg/kv"
"github.com/treeverse/lakefs/pkg/logging"
)
type EntriesIterator struct {
start []byte
partitionKey []byte
primed bool
entry *kv.Entry
err error
iter *badger.Iterator
txn *badger.Txn
logger logging.Logger
}
func (e *EntriesIterator) Next() bool {
if e.err != nil {
return false
}
start := time.Now()
switch {
case !e.primed && e.iter.Valid():
e.primed = true
case !e.primed:
e.primed = true
e.iter.Seek(e.start)
default:
e.iter.Next()
}
if !e.iter.Valid() {
e.logger.Trace("no next values")
return false
}
item := e.iter.Item()
value, err := item.ValueCopy(nil)
if err != nil {
e.logger.WithError(err).Trace("error reading value")
e.err = err
return false
}
key := item.KeyCopy(nil)
e.entry = &kv.Entry{
PartitionKey: e.partitionKey,
Key: key[len(partitionRange(e.partitionKey)):],
Value: value,
}
e.logger.WithField("next_key", string(key)).WithField("took", time.Since(start)).Trace("read next value")
return true
}
func (e *EntriesIterator) Entry() *kv.Entry {
return e.entry
}
func (e *EntriesIterator) Err() error {
return e.err
}
func (e *EntriesIterator) Close() {
e.iter.Close()
e.txn.Discard()
e.err = kv.ErrClosedEntries
}