standard

Aug 31, 2022

Changes in this version

type Map

+ func (m *Map[K, V]) Range(f func(key K, value V) bool)

Aug 31, 2022

Changes in this version

+ type Map struct

+ func NewMap() Map[K, V]

+ func (m *Map[K, V]) Clear()

+ func (m *Map[K, V]) Erase(key K)

+ func (m *Map[K, V]) Find(key K) (any, bool)

+ func (m *Map[K, V]) Insert(key K, value V)

+ func (m *Map[K, V]) Size() int

Aug 29, 2022

Changes in this version

+ var ErrSize = errors.New("maxSize can't be less than minSize")

+ type HashFunc func(data []byte) uint32

+ type Hashing struct

+ func NewHashing(replicas int, fn HashFunc) *Hashing

+ func (h *Hashing) Add(keys ...string)

+ func (h *Hashing) Del(keys ...string)

+ func (h *Hashing) Get(key string) string

+ type Pool struct

+ func NewBufferStore(minSize, maxSize int) (*Pool, error)

+ func (p *Pool) Get(size int) *[]byte

+ func (p *Pool) Put(b *[]byte)

+ type Queue struct

+ func NewQueue() *Queue[T]

+ func (q *Queue[T]) Pop() any

+ func (q *Queue[T]) Push(v T)

+ func (q *Queue[T]) Size() uint

+ type RingBuffer struct

+ func NewRingBuf(size int) *RingBuffer[T]

+ func (r *RingBuffer[T]) IsFull() bool

+ func (r *RingBuffer[T]) Pop() T

+ func (r *RingBuffer[T]) Push(data T) bool

+ func (r *RingBuffer[T]) Size() int

+ type Set struct

+ func NewSet() *Set[T]

+ func (s *Set[T]) Clear()

+ func (s *Set[T]) Empty() bool

+ func (s *Set[T]) Erase(key T)

+ func (s *Set[T]) Has(key T) bool

+ func (s *Set[T]) Insert(key T)

+ func (s *Set[T]) List() []T

+ func (s *Set[T]) Size() int