-
Notifications
You must be signed in to change notification settings - Fork 5.9k
/
Copy pathkey_ranges_test.go
128 lines (113 loc) · 4.09 KB
/
key_ranges_test.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
// Copyright 2021 PingCAP, 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 copr
import (
"testing"
"github.com/pingcap/tidb/kv"
"github.com/stretchr/testify/require"
)
func TestCopRanges(t *testing.T) {
t.Parallel()
ranges := []kv.KeyRange{
{StartKey: []byte("a"), EndKey: []byte("b")},
{StartKey: []byte("c"), EndKey: []byte("d")},
{StartKey: []byte("e"), EndKey: []byte("f")},
}
checkEqual(t, &KeyRanges{mid: ranges}, ranges, true)
checkEqual(t, &KeyRanges{first: &ranges[0], mid: ranges[1:]}, ranges, true)
checkEqual(t, &KeyRanges{mid: ranges[:2], last: &ranges[2]}, ranges, true)
checkEqual(t, &KeyRanges{first: &ranges[0], mid: ranges[1:2], last: &ranges[2]}, ranges, true)
}
func TestCopRangeSplit(t *testing.T) {
t.Parallel()
first := &kv.KeyRange{StartKey: []byte("a"), EndKey: []byte("b")}
mid := []kv.KeyRange{
{StartKey: []byte("c"), EndKey: []byte("d")},
{StartKey: []byte("e"), EndKey: []byte("g")},
{StartKey: []byte("l"), EndKey: []byte("o")},
}
last := &kv.KeyRange{StartKey: []byte("q"), EndKey: []byte("t")}
const left = true
const right = false
// input range: [c-d) [e-g) [l-o)
ranges := &KeyRanges{mid: mid}
testSplit(t, ranges, right,
splitCase{"c", buildCopRanges("c", "d", "e", "g", "l", "o")},
splitCase{"d", buildCopRanges("e", "g", "l", "o")},
splitCase{"f", buildCopRanges("f", "g", "l", "o")},
)
// input range: [a-b) [c-d) [e-g) [l-o)
ranges = &KeyRanges{first: first, mid: mid}
testSplit(t, ranges, right,
splitCase{"a", buildCopRanges("a", "b", "c", "d", "e", "g", "l", "o")},
splitCase{"c", buildCopRanges("c", "d", "e", "g", "l", "o")},
splitCase{"m", buildCopRanges("m", "o")},
)
// input range: [a-b) [c-d) [e-g) [l-o) [q-t)
ranges = &KeyRanges{first: first, mid: mid, last: last}
testSplit(t, ranges, right,
splitCase{"f", buildCopRanges("f", "g", "l", "o", "q", "t")},
splitCase{"h", buildCopRanges("l", "o", "q", "t")},
splitCase{"r", buildCopRanges("r", "t")},
)
// input range: [c-d) [e-g) [l-o)
ranges = &KeyRanges{mid: mid}
testSplit(t, ranges, left,
splitCase{"m", buildCopRanges("c", "d", "e", "g", "l", "m")},
splitCase{"g", buildCopRanges("c", "d", "e", "g")},
splitCase{"g", buildCopRanges("c", "d", "e", "g")},
)
// input range: [a-b) [c-d) [e-g) [l-o)
ranges = &KeyRanges{first: first, mid: mid}
testSplit(t, ranges, left,
splitCase{"d", buildCopRanges("a", "b", "c", "d")},
splitCase{"d", buildCopRanges("a", "b", "c", "d")},
splitCase{"o", buildCopRanges("a", "b", "c", "d", "e", "g", "l", "o")},
)
// input range: [a-b) [c-d) [e-g) [l-o) [q-t)
ranges = &KeyRanges{first: first, mid: mid, last: last}
testSplit(t, ranges, left,
splitCase{"o", buildCopRanges("a", "b", "c", "d", "e", "g", "l", "o")},
splitCase{"p", buildCopRanges("a", "b", "c", "d", "e", "g", "l", "o")},
splitCase{"t", buildCopRanges("a", "b", "c", "d", "e", "g", "l", "o", "q", "t")},
)
}
func checkEqual(t *testing.T, copRanges *KeyRanges, ranges []kv.KeyRange, slice bool) {
require.Equal(t, copRanges.Len(), len(ranges))
for i := range ranges {
require.EqualValues(t, copRanges.At(i), ranges[i])
}
if slice {
for i := 0; i <= copRanges.Len(); i++ {
for j := i; j <= copRanges.Len(); j++ {
checkEqual(t, copRanges.Slice(i, j), ranges[i:j], false)
}
}
}
}
type splitCase struct {
key string
*KeyRanges
}
func testSplit(t *testing.T, ranges *KeyRanges, checkLeft bool, cases ...splitCase) {
for _, tt := range cases {
left, right := ranges.Split([]byte(tt.key))
expect := tt.KeyRanges
if checkLeft {
checkEqual(t, left, expect.mid, false)
} else {
checkEqual(t, right, expect.mid, false)
}
}
}