355 lines
11 KiB
Go
355 lines
11 KiB
Go
// Copyright (c) 2014 Couchbase, 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 upside_down
|
|
|
|
import (
|
|
"math"
|
|
"reflect"
|
|
"testing"
|
|
|
|
"github.com/golang/protobuf/proto"
|
|
)
|
|
|
|
func TestRows(t *testing.T) {
|
|
tests := []struct {
|
|
input UpsideDownCouchRow
|
|
outKey []byte
|
|
outVal []byte
|
|
}{
|
|
{
|
|
NewVersionRow(1),
|
|
[]byte{'v'},
|
|
[]byte{0x1},
|
|
},
|
|
{
|
|
NewFieldRow(0, "name"),
|
|
[]byte{'f', 0, 0},
|
|
[]byte{'n', 'a', 'm', 'e', ByteSeparator},
|
|
},
|
|
{
|
|
NewFieldRow(1, "desc"),
|
|
[]byte{'f', 1, 0},
|
|
[]byte{'d', 'e', 's', 'c', ByteSeparator},
|
|
},
|
|
{
|
|
NewFieldRow(513, "style"),
|
|
[]byte{'f', 1, 2},
|
|
[]byte{'s', 't', 'y', 'l', 'e', ByteSeparator},
|
|
},
|
|
{
|
|
NewDictionaryRow([]byte{'b', 'e', 'e', 'r'}, 0, 27),
|
|
[]byte{'d', 0, 0, 'b', 'e', 'e', 'r'},
|
|
[]byte{27},
|
|
},
|
|
{
|
|
NewTermFrequencyRow([]byte{'b', 'e', 'e', 'r'}, 0, "catz", 3, 3.14),
|
|
[]byte{'t', 0, 0, 'b', 'e', 'e', 'r', ByteSeparator, 'c', 'a', 't', 'z'},
|
|
[]byte{3, 195, 235, 163, 130, 4},
|
|
},
|
|
{
|
|
NewTermFrequencyRow([]byte{'b', 'e', 'e', 'r'}, 0, "budweiser", 3, 3.14),
|
|
[]byte{'t', 0, 0, 'b', 'e', 'e', 'r', ByteSeparator, 'b', 'u', 'd', 'w', 'e', 'i', 's', 'e', 'r'},
|
|
[]byte{3, 195, 235, 163, 130, 4},
|
|
},
|
|
{
|
|
NewTermFrequencyRowWithTermVectors([]byte{'b', 'e', 'e', 'r'}, 0, "budweiser", 3, 3.14, []*TermVector{&TermVector{field: 0, pos: 1, start: 3, end: 11}, &TermVector{field: 0, pos: 2, start: 23, end: 31}, &TermVector{field: 0, pos: 3, start: 43, end: 51}}),
|
|
[]byte{'t', 0, 0, 'b', 'e', 'e', 'r', ByteSeparator, 'b', 'u', 'd', 'w', 'e', 'i', 's', 'e', 'r'},
|
|
[]byte{3, 195, 235, 163, 130, 4, 0, 1, 3, 11, 0, 0, 2, 23, 31, 0, 0, 3, 43, 51, 0},
|
|
},
|
|
// test larger varints
|
|
{
|
|
NewTermFrequencyRowWithTermVectors([]byte{'b', 'e', 'e', 'r'}, 0, "budweiser", 25896, 3.14, []*TermVector{&TermVector{field: 255, pos: 1, start: 3, end: 11}, &TermVector{field: 0, pos: 2198, start: 23, end: 31}, &TermVector{field: 0, pos: 3, start: 43, end: 51}}),
|
|
[]byte{'t', 0, 0, 'b', 'e', 'e', 'r', ByteSeparator, 'b', 'u', 'd', 'w', 'e', 'i', 's', 'e', 'r'},
|
|
[]byte{168, 202, 1, 195, 235, 163, 130, 4, 255, 1, 1, 3, 11, 0, 0, 150, 17, 23, 31, 0, 0, 3, 43, 51, 0},
|
|
},
|
|
// test vectors with arrayPositions
|
|
{
|
|
NewTermFrequencyRowWithTermVectors([]byte{'b', 'e', 'e', 'r'}, 0, "budweiser", 25896, 3.14, []*TermVector{&TermVector{field: 255, pos: 1, start: 3, end: 11, arrayPositions: []uint64{0}}, &TermVector{field: 0, pos: 2198, start: 23, end: 31, arrayPositions: []uint64{1, 2}}, &TermVector{field: 0, pos: 3, start: 43, end: 51, arrayPositions: []uint64{3, 4, 5}}}),
|
|
[]byte{'t', 0, 0, 'b', 'e', 'e', 'r', ByteSeparator, 'b', 'u', 'd', 'w', 'e', 'i', 's', 'e', 'r'},
|
|
[]byte{168, 202, 1, 195, 235, 163, 130, 4, 255, 1, 1, 3, 11, 1, 0, 0, 150, 17, 23, 31, 2, 1, 2, 0, 3, 43, 51, 3, 3, 4, 5},
|
|
},
|
|
{
|
|
NewBackIndexRow("budweiser", []*BackIndexTermEntry{&BackIndexTermEntry{Term: proto.String("beer"), Field: proto.Uint32(0)}}, nil),
|
|
[]byte{'b', 'b', 'u', 'd', 'w', 'e', 'i', 's', 'e', 'r'},
|
|
[]byte{10, 8, 10, 4, 'b', 'e', 'e', 'r', 16, 0},
|
|
},
|
|
{
|
|
NewBackIndexRow("budweiser", []*BackIndexTermEntry{&BackIndexTermEntry{Term: proto.String("beer"), Field: proto.Uint32(0)}, &BackIndexTermEntry{Term: proto.String("beat"), Field: proto.Uint32(1)}}, nil),
|
|
[]byte{'b', 'b', 'u', 'd', 'w', 'e', 'i', 's', 'e', 'r'},
|
|
[]byte{10, 8, 10, 4, 'b', 'e', 'e', 'r', 16, 0, 10, 8, 10, 4, 'b', 'e', 'a', 't', 16, 1},
|
|
},
|
|
{
|
|
NewBackIndexRow("budweiser", []*BackIndexTermEntry{&BackIndexTermEntry{Term: proto.String("beer"), Field: proto.Uint32(0)}, &BackIndexTermEntry{Term: proto.String("beat"), Field: proto.Uint32(1)}}, []*BackIndexStoreEntry{&BackIndexStoreEntry{Field: proto.Uint32(3)}, &BackIndexStoreEntry{Field: proto.Uint32(4)}, &BackIndexStoreEntry{Field: proto.Uint32(5)}}),
|
|
[]byte{'b', 'b', 'u', 'd', 'w', 'e', 'i', 's', 'e', 'r'},
|
|
[]byte{10, 8, 10, 4, 'b', 'e', 'e', 'r', 16, 0, 10, 8, 10, 4, 'b', 'e', 'a', 't', 16, 1, 18, 2, 8, 3, 18, 2, 8, 4, 18, 2, 8, 5},
|
|
},
|
|
{
|
|
NewStoredRow("budweiser", 0, []uint64{}, byte('t'), []byte("an american beer")),
|
|
[]byte{'s', 'b', 'u', 'd', 'w', 'e', 'i', 's', 'e', 'r', ByteSeparator, 0, 0},
|
|
[]byte{'t', 'a', 'n', ' ', 'a', 'm', 'e', 'r', 'i', 'c', 'a', 'n', ' ', 'b', 'e', 'e', 'r'},
|
|
},
|
|
{
|
|
NewStoredRow("budweiser", 0, []uint64{2, 294, 3078}, byte('t'), []byte("an american beer")),
|
|
[]byte{'s', 'b', 'u', 'd', 'w', 'e', 'i', 's', 'e', 'r', ByteSeparator, 0, 0, 2, 166, 2, 134, 24},
|
|
[]byte{'t', 'a', 'n', ' ', 'a', 'm', 'e', 'r', 'i', 'c', 'a', 'n', ' ', 'b', 'e', 'e', 'r'},
|
|
},
|
|
{
|
|
NewInternalRow([]byte("mapping"), []byte(`{"mapping":"json content"}`)),
|
|
[]byte{'i', 'm', 'a', 'p', 'p', 'i', 'n', 'g'},
|
|
[]byte{'{', '"', 'm', 'a', 'p', 'p', 'i', 'n', 'g', '"', ':', '"', 'j', 's', 'o', 'n', ' ', 'c', 'o', 'n', 't', 'e', 'n', 't', '"', '}'},
|
|
},
|
|
}
|
|
|
|
// test going from struct to k/v bytes
|
|
for i, test := range tests {
|
|
rk := test.input.Key()
|
|
if !reflect.DeepEqual(rk, test.outKey) {
|
|
t.Errorf("Expected key to be %v got: %v", test.outKey, rk)
|
|
}
|
|
rv := test.input.Value()
|
|
if !reflect.DeepEqual(rv, test.outVal) {
|
|
t.Errorf("Expected value to be %v got: %v for %d", test.outVal, rv, i)
|
|
}
|
|
}
|
|
|
|
// now test going back from k/v bytes to struct
|
|
for i, test := range tests {
|
|
row, err := ParseFromKeyValue(test.outKey, test.outVal)
|
|
if err != nil {
|
|
t.Errorf("error parsking key/value: %v", err)
|
|
}
|
|
if !reflect.DeepEqual(row, test.input) {
|
|
t.Errorf("Expected: %#v got: %#v for %d", test.input, row, i)
|
|
}
|
|
}
|
|
|
|
}
|
|
|
|
func TestInvalidRows(t *testing.T) {
|
|
tests := []struct {
|
|
key []byte
|
|
val []byte
|
|
}{
|
|
// empty key
|
|
{
|
|
[]byte{},
|
|
[]byte{},
|
|
},
|
|
// no such type q
|
|
{
|
|
[]byte{'q'},
|
|
[]byte{},
|
|
},
|
|
// type v, invalid empty value
|
|
{
|
|
[]byte{'v'},
|
|
[]byte{},
|
|
},
|
|
// type f, invalid key
|
|
{
|
|
[]byte{'f'},
|
|
[]byte{},
|
|
},
|
|
// type f, valid key, invalid value
|
|
{
|
|
[]byte{'f', 0, 0},
|
|
[]byte{},
|
|
},
|
|
// type t, invalid key (missing field)
|
|
{
|
|
[]byte{'t'},
|
|
[]byte{},
|
|
},
|
|
// type t, invalid key (missing term)
|
|
{
|
|
[]byte{'t', 0, 0},
|
|
[]byte{},
|
|
},
|
|
// type t, invalid key (missing id)
|
|
{
|
|
[]byte{'t', 0, 0, 'b', 'e', 'e', 'r', ByteSeparator},
|
|
[]byte{},
|
|
},
|
|
// type t, invalid val (missing freq)
|
|
{
|
|
[]byte{'t', 0, 0, 'b', 'e', 'e', 'r', ByteSeparator, 'b', 'u', 'd', 'w', 'e', 'i', 's', 'e', 'r'},
|
|
[]byte{},
|
|
},
|
|
// type t, invalid val (missing norm)
|
|
{
|
|
[]byte{'t', 0, 0, 'b', 'e', 'e', 'r', ByteSeparator, 'b', 'u', 'd', 'w', 'e', 'i', 's', 'e', 'r'},
|
|
[]byte{3},
|
|
},
|
|
// type t, invalid val (half missing tv field, full missing is valid (no term vectors))
|
|
{
|
|
[]byte{'t', 0, 0, 'b', 'e', 'e', 'r', ByteSeparator, 'b', 'u', 'd', 'w', 'e', 'i', 's', 'e', 'r'},
|
|
[]byte{3, 25, 255},
|
|
},
|
|
// type t, invalid val (missing tv pos)
|
|
{
|
|
[]byte{'t', 0, 0, 'b', 'e', 'e', 'r', ByteSeparator, 'b', 'u', 'd', 'w', 'e', 'i', 's', 'e', 'r'},
|
|
[]byte{3, 25, 0},
|
|
},
|
|
// type t, invalid val (missing tv start)
|
|
{
|
|
[]byte{'t', 0, 0, 'b', 'e', 'e', 'r', ByteSeparator, 'b', 'u', 'd', 'w', 'e', 'i', 's', 'e', 'r'},
|
|
[]byte{3, 25, 0, 0},
|
|
},
|
|
// type t, invalid val (missing tv end)
|
|
{
|
|
[]byte{'t', 0, 0, 'b', 'e', 'e', 'r', ByteSeparator, 'b', 'u', 'd', 'w', 'e', 'i', 's', 'e', 'r'},
|
|
[]byte{3, 25, 0, 0, 0},
|
|
},
|
|
// type b, invalid key (missing id)
|
|
{
|
|
[]byte{'b'},
|
|
[]byte{'b', 'e', 'e', 'r', ByteSeparator, 0, 0},
|
|
},
|
|
// type b, invalid val (missing field)
|
|
{
|
|
[]byte{'b', 'b', 'u', 'd', 'w', 'e', 'i', 's', 'e', 'r'},
|
|
[]byte{'g', 'a', 'r', 'b', 'a', 'g', 'e'},
|
|
},
|
|
// type s, invalid key (missing id)
|
|
{
|
|
[]byte{'s'},
|
|
[]byte{'t', 'a', 'n', ' ', 'a', 'm', 'e', 'r', 'i', 'c', 'a', 'n', ' ', 'b', 'e', 'e', 'r'},
|
|
},
|
|
// type b, invalid val (missing field)
|
|
{
|
|
[]byte{'s', 'b', 'u', 'd', 'w', 'e', 'i', 's', 'e', 'r', ByteSeparator},
|
|
[]byte{'t', 'a', 'n', ' ', 'a', 'm', 'e', 'r', 'i', 'c', 'a', 'n', ' ', 'b', 'e', 'e', 'r'},
|
|
},
|
|
}
|
|
|
|
for _, test := range tests {
|
|
_, err := ParseFromKeyValue(test.key, test.val)
|
|
if err == nil {
|
|
t.Errorf("expected error, got nil")
|
|
}
|
|
}
|
|
}
|
|
|
|
func TestDictionaryRowValueBug197(t *testing.T) {
|
|
// this was the smallest value that would trigger a crash
|
|
dr := &DictionaryRow{
|
|
field: 0,
|
|
term: []byte("marty"),
|
|
count: 72057594037927936,
|
|
}
|
|
dr.Value()
|
|
// this is the maximum possible value
|
|
dr = &DictionaryRow{
|
|
field: 0,
|
|
term: []byte("marty"),
|
|
count: math.MaxUint64,
|
|
}
|
|
dr.Value()
|
|
// neither of these should panic
|
|
}
|
|
|
|
func BenchmarkTermFrequencyRowEncode(b *testing.B) {
|
|
for i := 0; i < b.N; i++ {
|
|
row := NewTermFrequencyRowWithTermVectors(
|
|
[]byte{'b', 'e', 'e', 'r'},
|
|
0,
|
|
"budweiser",
|
|
3,
|
|
3.14,
|
|
[]*TermVector{
|
|
&TermVector{
|
|
field: 0,
|
|
pos: 1,
|
|
start: 3,
|
|
end: 11,
|
|
},
|
|
&TermVector{
|
|
field: 0,
|
|
pos: 2,
|
|
start: 23,
|
|
end: 31,
|
|
},
|
|
&TermVector{
|
|
field: 0,
|
|
pos: 3,
|
|
start: 43,
|
|
end: 51,
|
|
},
|
|
})
|
|
|
|
row.Key()
|
|
row.Value()
|
|
}
|
|
}
|
|
|
|
func BenchmarkTermFrequencyRowDecode(b *testing.B) {
|
|
for i := 0; i < b.N; i++ {
|
|
k := []byte{'t', 0, 0, 'b', 'e', 'e', 'r', ByteSeparator, 'b', 'u', 'd', 'w', 'e', 'i', 's', 'e', 'r'}
|
|
v := []byte{3, 195, 235, 163, 130, 4, 0, 1, 3, 11, 0, 0, 2, 23, 31, 0, 0, 3, 43, 51, 0}
|
|
_, err := NewTermFrequencyRowKV(k, v)
|
|
if err != nil {
|
|
b.Fatal(err)
|
|
}
|
|
}
|
|
}
|
|
|
|
func BenchmarkBackIndexRowEncode(b *testing.B) {
|
|
field := uint32(1)
|
|
t1 := "term1"
|
|
for i := 0; i < b.N; i++ {
|
|
row := NewBackIndexRow("beername",
|
|
[]*BackIndexTermEntry{
|
|
&BackIndexTermEntry{
|
|
Term: &t1,
|
|
Field: &field,
|
|
},
|
|
},
|
|
[]*BackIndexStoreEntry{
|
|
&BackIndexStoreEntry{
|
|
Field: &field,
|
|
},
|
|
})
|
|
|
|
row.Key()
|
|
row.Value()
|
|
}
|
|
}
|
|
|
|
func BenchmarkBackIndexRowDecode(b *testing.B) {
|
|
for i := 0; i < b.N; i++ {
|
|
k := []byte{0x62, 0x62, 0x65, 0x65, 0x72, 0x6e, 0x61, 0x6d, 0x65}
|
|
v := []byte{0x0a, 0x09, 0x0a, 0x05, 0x74, 0x65, 0x72, 0x6d, 0x31, 0x10, 0x01, 0x12, 0x02, 0x08, 0x01}
|
|
_, err := NewBackIndexRowKV(k, v)
|
|
if err != nil {
|
|
b.Fatal(err)
|
|
}
|
|
}
|
|
}
|
|
|
|
func BenchmarkStoredRowEncode(b *testing.B) {
|
|
for i := 0; i < b.N; i++ {
|
|
row := NewStoredRow("budweiser", 0, []uint64{}, byte('t'), []byte("an american beer"))
|
|
|
|
row.Key()
|
|
row.Value()
|
|
}
|
|
}
|
|
|
|
func BenchmarkStoredRowDecode(b *testing.B) {
|
|
for i := 0; i < b.N; i++ {
|
|
k := []byte{'s', 'b', 'u', 'd', 'w', 'e', 'i', 's', 'e', 'r', ByteSeparator, 0, 0}
|
|
v := []byte{'t', 'a', 'n', ' ', 'a', 'm', 'e', 'r', 'i', 'c', 'a', 'n', ' ', 'b', 'e', 'e', 'r'}
|
|
_, err := NewStoredRowKV(k, v)
|
|
if err != nil {
|
|
b.Fatal(err)
|
|
}
|
|
}
|
|
}
|