forked from etcd-io/etcd
-
Notifications
You must be signed in to change notification settings - Fork 0
/
range.go
108 lines (92 loc) · 3.08 KB
/
range.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
// Copyright 2016 CoreOS, Inc.
//
// 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 recipe
import (
"github.com/coreos/etcd/Godeps/_workspace/src/golang.org/x/net/context"
"github.com/coreos/etcd/clientv3"
pb "github.com/coreos/etcd/etcdserver/etcdserverpb"
)
type Range struct {
kv pb.KVClient
key []byte
rev int64
keyEnd []byte
}
func NewRange(client *clientv3.Client, key string) *Range {
return NewRangeRev(client, key, 0)
}
func NewRangeRev(client *clientv3.Client, key string, rev int64) *Range {
return &Range{client.KV, []byte(key), rev, prefixEnd(key)}
}
// Prefix performs a RangeRequest to get keys matching <key>*
func (r *Range) Prefix() (*pb.RangeResponse, error) {
return r.kv.Range(
context.TODO(),
&pb.RangeRequest{
Key: prefixNext(string(r.key)),
RangeEnd: r.keyEnd,
Revision: r.rev})
}
// OpenInterval gets the keys in the set <key>* - <key>
func (r *Range) OpenInterval() (*pb.RangeResponse, error) {
return r.kv.Range(
context.TODO(),
&pb.RangeRequest{Key: r.key, RangeEnd: r.keyEnd, Revision: r.rev})
}
func (r *Range) FirstKey() (*pb.RangeResponse, error) {
return r.topTarget(pb.RangeRequest_ASCEND, pb.RangeRequest_KEY)
}
func (r *Range) LastKey() (*pb.RangeResponse, error) {
return r.topTarget(pb.RangeRequest_DESCEND, pb.RangeRequest_KEY)
}
func (r *Range) FirstRev() (*pb.RangeResponse, error) {
return r.topTarget(pb.RangeRequest_ASCEND, pb.RangeRequest_MOD)
}
func (r *Range) LastRev() (*pb.RangeResponse, error) {
return r.topTarget(pb.RangeRequest_DESCEND, pb.RangeRequest_MOD)
}
func (r *Range) FirstCreate() (*pb.RangeResponse, error) {
return r.topTarget(pb.RangeRequest_ASCEND, pb.RangeRequest_MOD)
}
func (r *Range) LastCreate() (*pb.RangeResponse, error) {
return r.topTarget(pb.RangeRequest_DESCEND, pb.RangeRequest_MOD)
}
// topTarget gets the first key for a given sort order and target
func (r *Range) topTarget(order pb.RangeRequest_SortOrder, target pb.RangeRequest_SortTarget) (*pb.RangeResponse, error) {
return r.kv.Range(
context.TODO(),
&pb.RangeRequest{
Key: r.key,
RangeEnd: r.keyEnd,
Limit: 1,
Revision: r.rev,
SortOrder: order,
SortTarget: target})
}
// prefixNext returns the first key possibly matched by <prefix>* - <prefix>
func prefixNext(prefix string) []byte {
return append([]byte(prefix), 0)
}
// prefixEnd returns the last key possibly matched by <prefix>*
func prefixEnd(prefix string) []byte {
keyEnd := []byte(prefix)
for i := len(keyEnd) - 1; i >= 0; i-- {
if keyEnd[i] < 0xff {
keyEnd[i] = keyEnd[i] + 1
keyEnd = keyEnd[:i+1]
break
}
}
return keyEnd
}