Versions in this module Expand all Collapse all v0 v0.1.1 Jan 9, 2024 v0.1.0 Aug 28, 2023 Changes in this version + type CompareFunc func(a, b T) int + type IterFunc func(a T) bool + type LLRBMap struct + func NewMap() *LLRBMap[K, V] + func (m *LLRBMap[K, V]) Clear() + func (m *LLRBMap[K, V]) Delete(key K) (V, bool) + func (m *LLRBMap[K, V]) Get(key K) (V, bool) + func (m *LLRBMap[K, V]) Has(key K) bool + func (m *LLRBMap[K, V]) Len() int + func (m *LLRBMap[K, V]) Range(iter func(key K, value V) bool) + func (m *LLRBMap[K, V]) Set(key K, value V) (V, bool) + type LLRBSet struct + func NewSet() *LLRBSet[T] + func (s *LLRBSet[T]) Clear() + func (s *LLRBSet[T]) Delete(item T) (exist bool) + func (s *LLRBSet[T]) Has(item T) bool + func (s *LLRBSet[T]) Insert(item T) (exist bool) + func (s *LLRBSet[T]) Len() int + func (s *LLRBSet[T]) Range(iter IterFunc[T]) + type LLRBTree struct + func New(compare CompareFunc[T]) *LLRBTree[T] + func NewOrdered() *LLRBTree[T] + func (t *LLRBTree[T]) Ascend(iter IterFunc[T]) + func (t *LLRBTree[T]) AscendGreaterOrEqual(pivot T, iter IterFunc[T]) + func (t *LLRBTree[T]) AscendLessThan(pivot T, iter IterFunc[T]) + func (t *LLRBTree[T]) AscendRange(greaterOrEqual, lessThan T, iter IterFunc[T]) + func (t *LLRBTree[T]) Clear() + func (t *LLRBTree[T]) Delete(item T) (deleted T, ok bool) + func (t *LLRBTree[T]) DeleteMax() (deleted T, ok bool) + func (t *LLRBTree[T]) DeleteMin() (deleted T, ok bool) + func (t *LLRBTree[T]) Descend(iter IterFunc[T]) + func (t *LLRBTree[T]) DescendGreaterThan(pivot T, iter IterFunc[T]) + func (t *LLRBTree[T]) DescendLessOrEqual(pivot T, iter IterFunc[T]) + func (t *LLRBTree[T]) DescendRange(lessOrEqual, greaterThan T, iter IterFunc[T]) + func (t *LLRBTree[T]) Get(item T) (T, bool) + func (t *LLRBTree[T]) Has(item T) bool + func (t *LLRBTree[T]) Len() int + func (t *LLRBTree[T]) ReplaceOrInsert(item T) (prev T, exist bool)
Go to main page