mirror of
https://source.quilibrium.com/quilibrium/ceremonyclient.git
synced 2024-11-15 04:35:17 +00:00
240 lines
4.7 KiB
Go
240 lines
4.7 KiB
Go
package rangekey
|
|
|
|
import (
|
|
"testing"
|
|
|
|
"github.com/cockroachdb/pebble/internal/base"
|
|
"github.com/stretchr/testify/require"
|
|
)
|
|
|
|
func TestSetSuffixValues_RoundTrip(t *testing.T) {
|
|
testCases := [][]SuffixValue{
|
|
{
|
|
{Suffix: []byte{}, Value: []byte("world")},
|
|
},
|
|
{
|
|
{Suffix: []byte("foo"), Value: []byte("bar")},
|
|
},
|
|
{
|
|
{Suffix: []byte(""), Value: []byte("boop")},
|
|
{Suffix: []byte("foo"), Value: []byte("beep")},
|
|
{Suffix: []byte("bar"), Value: []byte("bop")},
|
|
{Suffix: []byte("bax"), Value: []byte("boink")},
|
|
{Suffix: []byte("zoop"), Value: []byte("zoink")},
|
|
},
|
|
}
|
|
|
|
var b []byte
|
|
for _, tc := range testCases {
|
|
// Encode.
|
|
l := encodedSetSuffixValuesLen(tc)
|
|
if l <= cap(b) {
|
|
b = b[:l]
|
|
} else {
|
|
b = make([]byte, l)
|
|
}
|
|
n := encodeSetSuffixValues(b, tc)
|
|
require.Equal(t, l, n)
|
|
|
|
// Decode.
|
|
var suffixValues []SuffixValue
|
|
for len(b) > 0 {
|
|
sv, rest, ok := decodeSuffixValue(b)
|
|
require.True(t, ok)
|
|
suffixValues = append(suffixValues, sv)
|
|
b = rest
|
|
}
|
|
require.Equal(t, tc, suffixValues)
|
|
}
|
|
}
|
|
|
|
func TestSetValue_Roundtrip(t *testing.T) {
|
|
testCases := []struct {
|
|
endKey []byte
|
|
suffixValues []SuffixValue
|
|
}{
|
|
{
|
|
endKey: []byte("hello"),
|
|
suffixValues: []SuffixValue{
|
|
{Suffix: []byte{}, Value: []byte("world")},
|
|
},
|
|
},
|
|
{
|
|
endKey: []byte("hello world"),
|
|
suffixValues: []SuffixValue{
|
|
{Suffix: []byte("foo"), Value: []byte("bar")},
|
|
},
|
|
},
|
|
{
|
|
endKey: []byte("hello world"),
|
|
suffixValues: []SuffixValue{
|
|
{Suffix: []byte(""), Value: []byte("boop")},
|
|
{Suffix: []byte("foo"), Value: []byte("beep")},
|
|
{Suffix: []byte("bar"), Value: []byte("bop")},
|
|
{Suffix: []byte("bax"), Value: []byte("boink")},
|
|
{Suffix: []byte("zoop"), Value: []byte("zoink")},
|
|
},
|
|
},
|
|
}
|
|
|
|
var b []byte
|
|
for _, tc := range testCases {
|
|
l := EncodedSetValueLen(tc.endKey, tc.suffixValues)
|
|
|
|
if l <= cap(b) {
|
|
b = b[:l]
|
|
} else {
|
|
b = make([]byte, l)
|
|
}
|
|
|
|
n := EncodeSetValue(b, tc.endKey, tc.suffixValues)
|
|
require.Equal(t, l, n)
|
|
|
|
var endKey, rest []byte
|
|
var ok bool
|
|
endKey, rest, ok = DecodeEndKey(base.InternalKeyKindRangeKeySet, b[:n])
|
|
require.True(t, ok)
|
|
|
|
var suffixValues []SuffixValue
|
|
for len(rest) > 0 {
|
|
var sv SuffixValue
|
|
var ok bool
|
|
sv, rest, ok = decodeSuffixValue(rest)
|
|
require.True(t, ok)
|
|
suffixValues = append(suffixValues, sv)
|
|
}
|
|
require.Equal(t, tc.endKey, endKey)
|
|
require.Equal(t, tc.suffixValues, suffixValues)
|
|
}
|
|
}
|
|
|
|
func TestUnsetSuffixes_RoundTrip(t *testing.T) {
|
|
type suffixes [][]byte
|
|
testCases := []suffixes{
|
|
{{}},
|
|
{[]byte("foo")},
|
|
{
|
|
{},
|
|
[]byte("foo"),
|
|
[]byte("bar"),
|
|
[]byte("bax"),
|
|
[]byte("zoop"),
|
|
},
|
|
}
|
|
|
|
var b []byte
|
|
for _, tc := range testCases {
|
|
// Encode.
|
|
l := encodedUnsetSuffixesLen(tc)
|
|
if l <= cap(b) {
|
|
b = b[:l]
|
|
} else {
|
|
b = make([]byte, l)
|
|
}
|
|
n := encodeUnsetSuffixes(b, tc)
|
|
require.Equal(t, l, n)
|
|
|
|
// Decode.
|
|
var ss suffixes
|
|
for len(b) > 0 {
|
|
s, rest, ok := decodeSuffix(b)
|
|
require.True(t, ok)
|
|
ss = append(ss, s)
|
|
b = rest
|
|
}
|
|
require.Equal(t, tc, ss)
|
|
}
|
|
}
|
|
|
|
func TestUnsetValue_Roundtrip(t *testing.T) {
|
|
testCases := []struct {
|
|
endKey []byte
|
|
suffixes [][]byte
|
|
}{
|
|
{
|
|
endKey: []byte("hello"),
|
|
suffixes: [][]byte{{}},
|
|
},
|
|
{
|
|
endKey: []byte("hello world"),
|
|
suffixes: [][]byte{[]byte("foo")},
|
|
},
|
|
{
|
|
endKey: []byte("hello world"),
|
|
suffixes: [][]byte{
|
|
{},
|
|
[]byte("foo"),
|
|
[]byte("bar"),
|
|
[]byte("bax"),
|
|
[]byte("zoop"),
|
|
},
|
|
},
|
|
}
|
|
|
|
var b []byte
|
|
for _, tc := range testCases {
|
|
l := EncodedUnsetValueLen(tc.endKey, tc.suffixes)
|
|
|
|
if l <= cap(b) {
|
|
b = b[:l]
|
|
} else {
|
|
b = make([]byte, l)
|
|
}
|
|
|
|
n := EncodeUnsetValue(b, tc.endKey, tc.suffixes)
|
|
require.Equal(t, l, n)
|
|
|
|
var ok bool
|
|
var endKey, rest []byte
|
|
endKey, rest, ok = DecodeEndKey(base.InternalKeyKindRangeKeyUnset, b[:n])
|
|
require.True(t, ok)
|
|
var suffixes [][]byte
|
|
for len(rest) > 0 {
|
|
var ok bool
|
|
var suffix []byte
|
|
suffix, rest, ok = decodeSuffix(rest)
|
|
require.True(t, ok)
|
|
suffixes = append(suffixes, suffix)
|
|
}
|
|
require.Equal(t, tc.endKey, endKey)
|
|
require.Equal(t, tc.suffixes, suffixes)
|
|
}
|
|
}
|
|
|
|
func TestIsRangeKey(t *testing.T) {
|
|
testCases := []struct {
|
|
kind base.InternalKeyKind
|
|
want bool
|
|
}{
|
|
{
|
|
kind: base.InternalKeyKindRangeKeyDelete,
|
|
want: true,
|
|
},
|
|
{
|
|
kind: base.InternalKeyKindRangeKeyUnset,
|
|
want: true,
|
|
},
|
|
{
|
|
kind: base.InternalKeyKindRangeKeyDelete,
|
|
want: true,
|
|
},
|
|
{
|
|
kind: base.InternalKeyKindDelete,
|
|
want: false,
|
|
},
|
|
{
|
|
kind: base.InternalKeyKindDeleteSized,
|
|
want: false,
|
|
},
|
|
{
|
|
kind: base.InternalKeyKindSet,
|
|
want: false,
|
|
},
|
|
}
|
|
for _, tc := range testCases {
|
|
t.Run("", func(t *testing.T) {
|
|
require.Equal(t, tc.want, IsRangeKey(tc.kind))
|
|
})
|
|
}
|
|
}
|