mirror of
https://gitlab.com/pulsechaincom/erigon-pulse.git
synced 2025-01-01 00:31:21 +00:00
db7322ef87
* dirty working equal dictionaries * slow but working decompression * much cleaner implementation with LRU words in dictionary with configurable condensity * fixed comment * removed tabs in comment line to fix lint Co-authored-by: alex.sharov <AskAlexSharov@gmail.com>
100 lines
2.1 KiB
Go
100 lines
2.1 KiB
Go
/*
|
|
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 compress
|
|
|
|
import (
|
|
"fmt"
|
|
"os"
|
|
"testing"
|
|
|
|
"github.com/stretchr/testify/require"
|
|
)
|
|
|
|
func BenchmarkDecompressNext(b *testing.B) {
|
|
t := new(testing.T)
|
|
d := prepareDict(t)
|
|
defer d.Close()
|
|
g := d.MakeGetter()
|
|
for i := 0; i < b.N; i++ {
|
|
_, _ = g.Next(nil)
|
|
if !g.HasNext() {
|
|
g.Reset(0)
|
|
}
|
|
}
|
|
}
|
|
|
|
func BenchmarkDecompressSkip(b *testing.B) {
|
|
t := new(testing.T)
|
|
d := prepareDict(t)
|
|
defer d.Close()
|
|
g := d.MakeGetter()
|
|
|
|
for i := 0; i < b.N; i++ {
|
|
_ = g.Skip()
|
|
if !g.HasNext() {
|
|
g.Reset(0)
|
|
}
|
|
}
|
|
}
|
|
|
|
func BenchmarkDecompressMatch(b *testing.B) {
|
|
t := new(testing.T)
|
|
d := prepareDict(t)
|
|
defer d.Close()
|
|
g := d.MakeGetter()
|
|
for i := 0; i < b.N; i++ {
|
|
_, _ = g.Match([]byte("longlongword"))
|
|
}
|
|
}
|
|
|
|
func BenchmarkDecompressMatchPrefix(b *testing.B) {
|
|
t := new(testing.T)
|
|
d := prepareDict(t)
|
|
defer d.Close()
|
|
g := d.MakeGetter()
|
|
|
|
for i := 0; i < b.N; i++ {
|
|
_ = g.MatchPrefix([]byte("longlongword"))
|
|
}
|
|
}
|
|
|
|
func BenchmarkDecompressTorrent(t *testing.B) {
|
|
t.Skip()
|
|
|
|
// fpath := "/mnt/data/chains/mainnet/snapshots/v1-014000-014500-transactions.seg"
|
|
fpath := "./v1-006000-006500-transactions.seg"
|
|
st, err := os.Stat(fpath)
|
|
require.NoError(t, err)
|
|
fmt.Printf("file: %v, size: %d\n", st.Name(), st.Size())
|
|
|
|
condensePatternTableBitThreshold = 6
|
|
fmt.Printf("bit threshold: %d\n", condensePatternTableBitThreshold)
|
|
|
|
d, err := NewDecompressor(fpath)
|
|
require.NoError(t, err)
|
|
defer d.Close()
|
|
|
|
getter := d.MakeGetter()
|
|
|
|
for i := 0; i < t.N && getter.HasNext(); i++ {
|
|
_, sz := getter.Next(nil)
|
|
if sz == 0 {
|
|
t.Fatal("sz == 0")
|
|
}
|
|
}
|
|
}
|