Versions in this module Expand all Collapse all v2 v2.0.4 Sep 30, 2022 Changes in this version + type ForwardIterator struct + func (i *ForwardIterator[Key, Value]) Next() + func (i *ForwardIterator[Key, Value]) Prev() + func (i ForwardIterator[Key, Value]) Key() Key + func (i ForwardIterator[Key, Value]) Valid() bool + func (i ForwardIterator[Key, Value]) Value() Value + type ReverseIterator struct + func (i *ReverseIterator[Key, Value]) Next() + func (i *ReverseIterator[Key, Value]) Prev() + func (i ReverseIterator[Key, Value]) Key() Key + func (i ReverseIterator[Key, Value]) Valid() bool + func (i ReverseIterator[Key, Value]) Value() Value + type TreeMap struct + func New() *TreeMap[Key, Value] + func NewWithKeyCompare(keyCompare func(a, b Key) bool) *TreeMap[Key, Value] + func (t *TreeMap[Key, Value]) Clear() + func (t *TreeMap[Key, Value]) Contains(id Key) bool + func (t *TreeMap[Key, Value]) Del(key Key) + func (t *TreeMap[Key, Value]) Get(id Key) (Value, bool) + func (t *TreeMap[Key, Value]) Iterator() ForwardIterator[Key, Value] + func (t *TreeMap[Key, Value]) Len() int + func (t *TreeMap[Key, Value]) LowerBound(key Key) ForwardIterator[Key, Value] + func (t *TreeMap[Key, Value]) Range(from, to Key) (ForwardIterator[Key, Value], ForwardIterator[Key, Value]) + func (t *TreeMap[Key, Value]) Reverse() ReverseIterator[Key, Value] + func (t *TreeMap[Key, Value]) Set(key Key, value Value) + func (t *TreeMap[Key, Value]) UpperBound(key Key) ForwardIterator[Key, Value]
Go to main page