erigon-pulse/recsplit/eliasfano32/elias_fano_fuzz_test.go
ledgerwatch 77eb94b53e
Elias fano search and merge (#357)
* Elias fano search and merge

* Add first cut of search

* Iterator and test

* Changes in aggregator

* Elias fano bitmap

* Fix uncompress decompress

* Print

* Print

* No print

* Print

* Print

* Print

* Change to AppendBytes

* Print

* Fix NextUncompressed

* Remove print

* Fix history search

* Fix in history search

* More tracing

* More tracing

* Fix

* Print

* Print key

* More print

* Print

* No deletion for history records

* Remove print

* Fix

* Fix

* Fix test

* Fix lint

Co-authored-by: Alex Sharp <alexsharp@Alexs-MacBook-Pro.local>
Co-authored-by: Alexey Sharp <alexeysharp@Alexeys-iMac.local>
2022-03-13 22:46:17 +00:00

128 lines
3.8 KiB
Go

//go:build gofuzzbeta
// +build gofuzzbeta
/*
Copyright 2021 Erigon contributors
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 eliasfano32
import (
"testing"
)
// gotip test -trimpath -v -fuzz=FuzzSingleEliasFano ./recsplit/eliasfano32
// gotip test -trimpath -v -fuzz=FuzzDoubleEliasFano ./recsplit/eliasfano32
func FuzzSingleEliasFano(f *testing.F) {
f.Fuzz(func(t *testing.T, in []byte) {
if len(in)%2 == 1 {
t.Skip()
}
if len(in) == 0 {
t.Skip()
}
for len(in) < int(2*superQ) { // make input large enough to trigger supreQ jump logic
in = append(in, in...)
}
// Treat each byte of the sequence as difference between previous value and the next
count := len(in)
keys := make([]uint64, count+1)
for i, b := range in {
keys[i+1] = keys[i] + uint64(b)
}
ef := NewEliasFano(uint64(count+1), keys[count])
for _, c := range keys {
ef.AddOffset(c)
}
ef.Build()
// Try to read from ef
for i := 0; i < count; i++ {
if ef.Get(uint64(i)) != keys[i] {
t.Fatalf("i %d: got %d, expected %d", i, ef.Get(uint64(i)), keys[i])
}
}
})
}
func FuzzDoubleEliasFano(f *testing.F) {
f.Fuzz(func(t *testing.T, in []byte) {
if len(in)%2 == 1 {
t.Skip()
}
if len(in) == 0 {
t.Skip()
}
for len(in) < int(2*superQ) { // make input large enough to trigger supreQ jump logic
in = append(in, in...)
}
var ef DoubleEliasFano
// Treat each byte of the sequence as difference between previous value and the next
numBuckets := len(in) / 2
cumKeys := make([]uint64, numBuckets+1)
position := make([]uint64, numBuckets+1)
for i, b := range in[:numBuckets] {
cumKeys[i+1] = cumKeys[i] + uint64(b)
}
for i, b := range in[numBuckets:] {
position[i+1] = position[i] + uint64(b)
}
ef1 := NewEliasFano(uint64(numBuckets+1), cumKeys[numBuckets])
for _, c := range cumKeys {
ef1.AddOffset(c)
}
ef1.Build()
ef2 := NewEliasFano(uint64(numBuckets+1), position[numBuckets])
for _, p := range position {
ef2.AddOffset(p)
}
ef2.Build()
ef.Build(cumKeys, position)
// Try to read from ef
for bucket := 0; bucket < numBuckets; bucket++ {
cumKey, bitPos := ef.Get2(uint64(bucket))
if cumKey != cumKeys[bucket] {
t.Fatalf("bucket %d: cumKey from EF = %d, expected %d", bucket, cumKey, cumKeys[bucket])
}
if bitPos != position[bucket] {
t.Fatalf("bucket %d: position from EF = %d, expected %d", bucket, bitPos, position[bucket])
}
cumKey = ef1.Get(uint64(bucket))
if cumKey != cumKeys[bucket] {
t.Fatalf("bucket %d: cumKey from EF1 = %d, expected %d", bucket, cumKey, cumKeys[bucket])
}
bitPos = ef2.Get(uint64(bucket))
if bitPos != position[bucket] {
t.Fatalf("bucket %d: position from EF2 = %d, expected %d", bucket, bitPos, position[bucket])
}
}
for bucket := 0; bucket < numBuckets; bucket++ {
cumKey, cumKeysNext, bitPos := ef.Get3(uint64(bucket))
if cumKey != cumKeys[bucket] {
t.Fatalf("bucket %d: cumKey from EF = %d, expected %d", bucket, cumKey, cumKeys[bucket])
}
if bitPos != position[bucket] {
t.Fatalf("bucket %d: position from EF = %d, expected %d", bucket, bitPos, position[bucket])
}
if cumKeysNext != cumKeys[bucket+1] {
t.Fatalf("bucket %d: cumKeysNext from EF = %d, expected %d", bucket, cumKeysNext, cumKeys[bucket+1])
}
}
})
}