-
Notifications
You must be signed in to change notification settings - Fork 351
/
scan.go
69 lines (61 loc) · 1.32 KB
/
scan.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
package kv
import (
"bytes"
"context"
)
type PrefixIterator struct {
Iterator EntriesIterator
Prefix []byte
PartitionKey []byte
completed bool
}
func (b *PrefixIterator) Next() bool {
if b.completed {
return false
}
if !b.Iterator.Next() {
b.completed = true
return false
}
entry := b.Iterator.Entry()
if !bytes.HasPrefix(entry.Key, b.Prefix) {
b.completed = true
return false
}
return true
}
func (b *PrefixIterator) SeekGE(key []byte) {
b.Iterator.SeekGE(key)
b.completed = false
}
func (b *PrefixIterator) Entry() *Entry {
if b.completed {
return nil
}
return b.Iterator.Entry()
}
func (b *PrefixIterator) Err() error {
return b.Iterator.Err()
}
func (b *PrefixIterator) Close() {
b.Iterator.Close()
}
// ScanPrefix returns an iterator on store that scan the set of keys that start with prefix
// after is the full key name for which to start the scan from
func ScanPrefix(ctx context.Context, store Store, partitionKey, prefix, after []byte) (EntriesIterator, error) {
start := prefix
if len(after) > 0 && string(after) > string(prefix) {
start = after
}
iter, err := store.Scan(ctx, partitionKey, ScanOptions{
KeyStart: start,
})
if err != nil {
return nil, err
}
return &PrefixIterator{
Iterator: iter,
Prefix: prefix,
PartitionKey: partitionKey,
}, nil
}