Versions in this module Expand all Collapse all v0 v0.1.11 Oct 3, 2023 v0.1.10 Oct 2, 2023 Changes in this version + const LowerThresholdMode + const UpperThresholdMode + type Element struct + func (e *Element[K, V]) Key() K + func (e *Element[K, V]) Value() V + type Iterator struct + func NewIterator(iterator *thresholdmap.Iterator) *Iterator[K, V] + func (i *Iterator[K, V]) Next() *Element[K, V] + func (i *Iterator[K, V]) Prev() *Element[K, V] + type Mode bool + type ThresholdMap struct + func New(mode Mode) *ThresholdMap[K, V] + func (t *ThresholdMap[K, V]) Ceiling(key K) (floorKey K, floorValue V, exists bool) + func (t *ThresholdMap[K, V]) Decode(b []byte) (bytesRead int, err error) + func (t *ThresholdMap[K, V]) Delete(key K) (element *Element[K, V], success bool) + func (t *ThresholdMap[K, V]) DeleteElement(element *Element[K, V]) + func (t *ThresholdMap[K, V]) Floor(key K) (floorKey K, floorValue V, exists bool) + func (t *ThresholdMap[K, V]) ForEach(iterator func(node *Element[K, V]) bool) + func (t *ThresholdMap[K, V]) Get(key K) (value V, exists bool) + func (t *ThresholdMap[K, V]) GetElement(key K) *Element[K, V] + func (t *ThresholdMap[K, V]) Iterator(optionalStartingNode ...*Element[K, V]) *Iterator[K, V] + func (t *ThresholdMap[K, V]) Keys() []K + func (t *ThresholdMap[K, V]) MaxElement() *Element[K, V] + func (t *ThresholdMap[K, V]) MinElement() *Element[K, V] + func (t *ThresholdMap[K, V]) Set(key K, value V) + func (t *ThresholdMap[K, V]) Values() []V + func (t ThresholdMap[K, V]) Encode() ([]byte, error)