herald.go/db/db_stack/db_stack.go

99 lines
1.8 KiB
Go
Raw Normal View History

package db_stack
2022-04-11 03:40:29 +02:00
// The db_stack package contains the implementation of a generic slice backed stack
// used for tracking various states in the hub, i.e. headers and txcounts
import (
"sync"
2022-04-11 03:40:29 +02:00
"github.com/lbryio/hub/internal"
)
type SliceBackedStack struct {
slice []interface{}
len uint32
mut sync.RWMutex
}
func NewSliceBackedStack(size int) *SliceBackedStack {
return &SliceBackedStack{
slice: make([]interface{}, size),
len: 0,
mut: sync.RWMutex{},
}
}
func (s *SliceBackedStack) Push(v interface{}) {
s.mut.Lock()
defer s.mut.Unlock()
if s.len == uint32(len(s.slice)) {
s.slice = append(s.slice, v)
} else {
s.slice[s.len] = v
}
s.len++
}
func (s *SliceBackedStack) Pop() interface{} {
s.mut.Lock()
defer s.mut.Unlock()
if s.len == 0 {
return nil
}
s.len--
return s.slice[s.len]
}
func (s *SliceBackedStack) Get(i uint32) interface{} {
s.mut.RLock()
defer s.mut.RUnlock()
if i >= s.len {
return nil
}
return s.slice[i]
}
func (s *SliceBackedStack) GetTip() interface{} {
s.mut.RLock()
defer s.mut.RUnlock()
if s.len == 0 {
return nil
}
return s.slice[s.len-1]
}
func (s *SliceBackedStack) Len() uint32 {
s.mut.RLock()
defer s.mut.RUnlock()
return s.len
}
func (s *SliceBackedStack) Cap() int {
s.mut.RLock()
defer s.mut.RUnlock()
return cap(s.slice)
}
2022-02-28 22:09:54 +01:00
func (s *SliceBackedStack) GetSlice() []interface{} {
// This is not thread safe so I won't bother with locking
return s.slice
}
// This function is dangerous because it assumes underlying types
2022-04-11 03:40:29 +02:00
func (s *SliceBackedStack) TxCountsBisectRight(txNum, rootTxNum uint32) (uint32, uint32) {
s.mut.RLock()
defer s.mut.RUnlock()
txCounts := s.slice[:s.Len()]
2022-04-11 03:40:29 +02:00
height := internal.BisectRight(txCounts, txNum)
createdHeight := internal.BisectRight(txCounts, rootTxNum)
return height, createdHeight
}