rocksdb (#29)
* Initial rocksdb commit
Basic reading from rocksdb works
* Try github action thing
* try local dockerfile
* asdf
* qwer
* asdf
* Try adding test db with git-lfs
* update action
* cleanup
* Don't hardcode stop on read
* Progress of reading rocksdb
* fixes and arg test
* asdf
* Fix rocksdb iterator and tests
* update script
* asdf
* Better iterator. Need to implement a lot of keys next, and tests, maybe
tests needed.
* asdf
* asdf
* asdf
* Implementation, testing, and cleanup.
Implemented more prefixes. Figured out a good test that should work for
all prefixes. Removed binary databases so we can just store human
readable csv files.
* more tests, prefixes and small refactor
* Another prefix
* EffectiveAmount
* ActiveAmount
* ActivatedClaimAndSupport
* PendingActivation
* ClaimTakeover
* ClaimExpiration
* SupportToClaim
* ClaimToSupport
* Fix bug with variable length keys
* ChannelToClaim
* ClaimToChannel
* ClaimShortID
* TXOToClaim
* ClaimToTXO
* BlockHeader
* BlockHash
* Undo
* HashXHistory
* Tx and big refactor
* rest the the keys
* Refactor and starting to add resolve
* asdf
* Refactor tests and add column families
* changes
* more work on implementing resolve
* code cleanup, function tests
* small code refactoring
* start building pieces of the test data set for full resolve.
* Export constant, add test
* another test
* TestGetTxHash
* more tests
* more tests
* More tests
* Refactor db functions into three files
* added slice backed stack, need to fix tests
* fix some issues with test suite
* some cleanup and adding arguments and db load / refresh to server command
* fix some bugs, start using logrus for leveled logging, upgrade to go 1.17, run go mod tidy
* logrus, protobuf updates, resolve grpc endpoint
* don't run integration test with unit tests
* signal handling and cleanup functions
* signal handling code files
* Unit tests for db stack
* reorganize bisect function so we lock it properly
* fix txcounts loading
* cleanup some logic around iterators and fix a bug where I was running two detect changes threads
* add some metrics
* cleanup
* blocking and filtering implemented
* add params for blocking and filtering channels and streams
* updates and fixes for integration tests
* use newer version of lbry.go when possible
* Add height endpoint and move string functions internal
* remove gitattributes, unused
* some cleanup
* more cleanup / refactor. almost ready for another review
* More cleanup
* use chainhash.Hash types from lbcd where appropriate
* update github action to go-1.17.8
* update go version needed
* trying to fix these builds
* cleanup
* trying to fix memory leak
* fix memory leak (iterator never finished so cleanup didn't run)
* changes per code review
* remove lbry.go v2
* rename sort.go search.go
* fix test
2022-04-29 17:04:01 +02:00
|
|
|
package stack_test
|
|
|
|
|
|
|
|
import (
|
|
|
|
"testing"
|
|
|
|
"time"
|
|
|
|
|
2022-08-09 13:43:01 +02:00
|
|
|
"github.com/lbryio/herald.go/db/stack"
|
rocksdb (#29)
* Initial rocksdb commit
Basic reading from rocksdb works
* Try github action thing
* try local dockerfile
* asdf
* qwer
* asdf
* Try adding test db with git-lfs
* update action
* cleanup
* Don't hardcode stop on read
* Progress of reading rocksdb
* fixes and arg test
* asdf
* Fix rocksdb iterator and tests
* update script
* asdf
* Better iterator. Need to implement a lot of keys next, and tests, maybe
tests needed.
* asdf
* asdf
* asdf
* Implementation, testing, and cleanup.
Implemented more prefixes. Figured out a good test that should work for
all prefixes. Removed binary databases so we can just store human
readable csv files.
* more tests, prefixes and small refactor
* Another prefix
* EffectiveAmount
* ActiveAmount
* ActivatedClaimAndSupport
* PendingActivation
* ClaimTakeover
* ClaimExpiration
* SupportToClaim
* ClaimToSupport
* Fix bug with variable length keys
* ChannelToClaim
* ClaimToChannel
* ClaimShortID
* TXOToClaim
* ClaimToTXO
* BlockHeader
* BlockHash
* Undo
* HashXHistory
* Tx and big refactor
* rest the the keys
* Refactor and starting to add resolve
* asdf
* Refactor tests and add column families
* changes
* more work on implementing resolve
* code cleanup, function tests
* small code refactoring
* start building pieces of the test data set for full resolve.
* Export constant, add test
* another test
* TestGetTxHash
* more tests
* more tests
* More tests
* Refactor db functions into three files
* added slice backed stack, need to fix tests
* fix some issues with test suite
* some cleanup and adding arguments and db load / refresh to server command
* fix some bugs, start using logrus for leveled logging, upgrade to go 1.17, run go mod tidy
* logrus, protobuf updates, resolve grpc endpoint
* don't run integration test with unit tests
* signal handling and cleanup functions
* signal handling code files
* Unit tests for db stack
* reorganize bisect function so we lock it properly
* fix txcounts loading
* cleanup some logic around iterators and fix a bug where I was running two detect changes threads
* add some metrics
* cleanup
* blocking and filtering implemented
* add params for blocking and filtering channels and streams
* updates and fixes for integration tests
* use newer version of lbry.go when possible
* Add height endpoint and move string functions internal
* remove gitattributes, unused
* some cleanup
* more cleanup / refactor. almost ready for another review
* More cleanup
* use chainhash.Hash types from lbcd where appropriate
* update github action to go-1.17.8
* update go version needed
* trying to fix these builds
* cleanup
* trying to fix memory leak
* fix memory leak (iterator never finished so cleanup didn't run)
* changes per code review
* remove lbry.go v2
* rename sort.go search.go
* fix test
2022-04-29 17:04:01 +02:00
|
|
|
)
|
|
|
|
|
|
|
|
func TestPush(t *testing.T) {
|
|
|
|
var want uint32 = 3
|
|
|
|
|
|
|
|
stack := stack.NewSliceBacked(10)
|
|
|
|
|
|
|
|
stack.Push(0)
|
|
|
|
stack.Push(1)
|
|
|
|
stack.Push(2)
|
|
|
|
|
|
|
|
if got := stack.Len(); got != want {
|
|
|
|
t.Errorf("got %v, want %v", got, want)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func TestPushPop(t *testing.T) {
|
|
|
|
stack := stack.NewSliceBacked(10)
|
|
|
|
|
|
|
|
for i := 0; i < 5; i++ {
|
|
|
|
stack.Push(i)
|
|
|
|
}
|
|
|
|
for i := 0; i < 5; i++ {
|
|
|
|
wantLen := 5 - i
|
|
|
|
|
|
|
|
if got := stack.Len(); int(got) != wantLen {
|
|
|
|
t.Errorf("got %v, want %v", got, wantLen)
|
|
|
|
}
|
|
|
|
|
|
|
|
if got := stack.Pop(); got != 5-i-1 {
|
|
|
|
t.Errorf("got %v, want %v", got, 5-i-1)
|
|
|
|
}
|
|
|
|
|
|
|
|
wantLen -= 1
|
|
|
|
|
|
|
|
if got := stack.Len(); int(got) != wantLen {
|
|
|
|
t.Errorf("got %v, want %v", got, wantLen)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func doPushes(stack *stack.SliceBacked, numPushes int) {
|
|
|
|
for i := 0; i < numPushes; i++ {
|
|
|
|
stack.Push(i)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func doPops(stack *stack.SliceBacked, numPops int) {
|
|
|
|
for i := 0; i < numPops; i++ {
|
|
|
|
stack.Pop()
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func TestMultiThreaded(t *testing.T) {
|
|
|
|
stack := stack.NewSliceBacked(100000)
|
|
|
|
|
|
|
|
go doPushes(stack, 100000)
|
|
|
|
go doPushes(stack, 100000)
|
|
|
|
go doPushes(stack, 100000)
|
|
|
|
|
|
|
|
time.Sleep(time.Second)
|
|
|
|
|
|
|
|
if stack.Len() != 300000 {
|
|
|
|
t.Errorf("got %v, want %v", stack.Len(), 300000)
|
|
|
|
}
|
|
|
|
|
|
|
|
go doPops(stack, 100000)
|
|
|
|
go doPops(stack, 100000)
|
|
|
|
go doPops(stack, 100000)
|
|
|
|
|
|
|
|
time.Sleep(time.Second)
|
|
|
|
|
|
|
|
if stack.Len() != 0 {
|
|
|
|
t.Errorf("got %v, want %v", stack.Len(), 0)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func TestGet(t *testing.T) {
|
|
|
|
stack := stack.NewSliceBacked(10)
|
|
|
|
|
|
|
|
for i := 0; i < 5; i++ {
|
|
|
|
stack.Push(i)
|
|
|
|
}
|
|
|
|
|
|
|
|
if got := stack.GetTip(); got != 4 {
|
|
|
|
t.Errorf("got %v, want %v", got, 4)
|
|
|
|
}
|
|
|
|
|
|
|
|
for i := 0; i < 5; i++ {
|
|
|
|
if got := stack.Get(uint32(i)); got != i {
|
|
|
|
t.Errorf("got %v, want %v", got, i)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
slice := stack.GetSlice()
|
|
|
|
|
|
|
|
if len(slice) != 10 {
|
|
|
|
t.Errorf("got %v, want %v", len(slice), 10)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func TestLenCap(t *testing.T) {
|
|
|
|
stack := stack.NewSliceBacked(10)
|
|
|
|
|
|
|
|
if got := stack.Len(); got != 0 {
|
|
|
|
t.Errorf("got %v, want %v", got, 0)
|
|
|
|
}
|
|
|
|
|
|
|
|
if got := stack.Cap(); got != 10 {
|
|
|
|
t.Errorf("got %v, want %v", got, 10)
|
|
|
|
}
|
|
|
|
}
|