storage

Mar 18, 2024

Changes in this version

type SafeMap

+ func (s *SafeMap[K, V]) Clear()

+ func (s *SafeMap[K, V]) ClearAndResize(newSize int)

Feb 15, 2024

Changes in this version

+ func TranslateToMapOf[K comparable, V any, D any](s *SafeMap[K, V], translator func(V) D) map[K]D

type SafeMap

+ func (s *SafeMap[K, V]) CopyToMap() map[K]V

+ func (s *SafeMap[K, V]) GetOrAdd(key K, val V) (value V)

Jan 23, 2024

Changes in this version

type SafeMap

+ func (s *SafeMap[K, V]) Has(key K) bool

Jan 22, 2024

Changes in this version

+ func WithSweepFrequency(frequency time.Duration) fifoInitializationOption

type FifoMapCache

+ func (f *FifoMapCache[K, V]) Capacity() int

+ func (f *FifoMapCache[K, V]) Sweep()

+ type OrderedBTree struct

+ func NewOrderedBTree[K cmp.Ordered, V any]() *OrderedBTree[K, V]

+ func (t *OrderedBTree[K, V]) Ascend(iter func(key K, value *V) bool)

+ func (t *OrderedBTree[K, V]) AscendGreaterOrEqual(pivot K, iter func(key K, value *V) bool)

+ func (t *OrderedBTree[K, V]) AscendLessThan(pivot K, iter func(key K, value *V) bool)

+ func (t *OrderedBTree[K, V]) AscendRange(greaterThanEqual, lessThan K, iter func(key K, value *V) bool)

+ func (t *OrderedBTree[K, V]) Clone() *OrderedBTree[K, V]

+ func (t *OrderedBTree[K, V]) Delete(key K) (value *V, ok bool)

+ func (t *OrderedBTree[K, V]) DeleteMax() (key K, value *V)

+ func (t *OrderedBTree[K, V]) DeleteMin() (key K, value *V)

+ func (t *OrderedBTree[K, V]) Descend(iter func(key K, value *V) bool)

+ func (t *OrderedBTree[K, V]) DescendGreaterThan(pivot K, iter func(key K, value *V) bool)

+ func (t *OrderedBTree[K, V]) DescendLessOrEqual(pivot K, iter func(key K, value *V) bool)

+ func (t *OrderedBTree[K, V]) DescendRange(greaterThan, lessThanEqual K, iter func(key K, value *V) bool)

+ func (t *OrderedBTree[K, V]) Get(key K) (value *V, ok bool)

+ func (t *OrderedBTree[K, V]) Has(key K) bool

+ func (t *OrderedBTree[K, V]) Len() int

+ func (t *OrderedBTree[K, V]) Max() (key K, value *V)

+ func (t *OrderedBTree[K, V]) Min() (key K, value *V)

+ func (t *OrderedBTree[K, V]) Set(key K, value *V)

Jan 14, 2024

Changes in this version

type FifoMapCache

+ func (f *FifoMapCache[K, V]) Resize(capacity int)

Jan 9, 2024

Changes in this version

type FifoMapCache

+ func (f *FifoMapCache[K, V]) Clear()

+ func (f *FifoMapCache[K, V]) Keys() []K

+ func (f *FifoMapCache[K, V]) Values() []V

type GenericStack

+ func (s *GenericStack[T]) Values() []T

type SafeMap

+ func (s *SafeMap[K, V]) Keys() []K

+ func (s *SafeMap[K, V]) Values() []V

Dec 14, 2023

Changes in this version

+ func WithBalancedPartitions(nRoot float64, minimumPartitions int) fifoInitializationOption

+ type FifoMapCache struct

+ func NewFifoMapCache[K comparable, V any](ctx context.Context, capacity int, options ...fifoInitializationOption) *FifoMapCache[K, V]

+ func (f *FifoMapCache[K, V]) Contains(key K) bool

+ func (f *FifoMapCache[K, V]) Delete(key K)

+ func (f *FifoMapCache[K, V]) Get(key K) (value V)

+ func (f *FifoMapCache[K, V]) Len() int

+ func (f *FifoMapCache[K, V]) Set(key K, value V)

+ type GenericStack struct

+ func NewGenericStack[T any](initialSize int) *GenericStack[T]

+ func (s *GenericStack[T]) Len() int

+ func (s *GenericStack[T]) Peek(id uint64) (value T, err error)

+ func (s *GenericStack[T]) Pop() T

+ func (s *GenericStack[T]) Push(value T) (id uint64)

+ type SafeMap struct

+ func NewSafeMap[K comparable, V any](initialCapacity int) *SafeMap[K, V]

+ func (s *SafeMap[K, V]) Contains(key K) bool

+ func (s *SafeMap[K, V]) Delete(key K)

+ func (s *SafeMap[K, V]) Get(key K) (value V)

+ func (s *SafeMap[K, V]) Len() int

+ func (s *SafeMap[K, V]) Set(key K, value V)