Versions in this module Expand all Collapse all v1 v1.0.0 Dec 20, 2025 Changes in this version + type Element struct + Value T + func (e *Element[T]) NextItem() *Element[T] + func (e *Element[T]) PrevItem() *Element[T] + type InitOption func(config *initConfig[K, V]) + func WithCapacity[K comparable, V any](capacity int) InitOption[K, V] + func WithDisableHTMLEscape[K comparable, V any]() InitOption[K, V] + func WithInitialData[K comparable, V any](initialData ...Pair[K, V]) InitOption[K, V] + type KeyNotFoundError struct + MissingKey K + func (e *KeyNotFoundError[K]) Error() string + type List struct + func NewList[T any]() *List[T] + func (l *List[T]) Append(other *List[T]) + func (l *List[T]) First() *Element[T] + func (l *List[T]) Init() *List[T] + func (l *List[T]) InsertAfter(v T, mark *Element[T]) *Element[T] + func (l *List[T]) InsertBefore(v T, mark *Element[T]) *Element[T] + func (l *List[T]) Last() *Element[T] + func (l *List[T]) Len() int + func (l *List[T]) MoveAfter(e, mark *Element[T]) + func (l *List[T]) MoveBefore(e, mark *Element[T]) + func (l *List[T]) MoveToBack(e *Element[T]) + func (l *List[T]) MoveToFront(e *Element[T]) + func (l *List[T]) Pop(e *Element[T]) T + func (l *List[T]) Push(v T) *Element[T] + func (l *List[T]) PushFrontList(other *List[T]) + func (l *List[T]) Shift(v T) *Element[T] + type OrderedMap struct + func From[K comparable, V any](i iter.Seq2[K, V]) *OrderedMap[K, V] + func New[K comparable, V any](options ...any) *OrderedMap[K, V] + func (om *OrderedMap[K, V]) AddPairs(pairs ...Pair[K, V]) + func (om *OrderedMap[K, V]) Delete(key K) (val V, present bool) + func (om *OrderedMap[K, V]) Filter(predicate func(K, V) bool) + func (om *OrderedMap[K, V]) FromNewest() iter.Seq2[K, V] + func (om *OrderedMap[K, V]) FromOldest() iter.Seq2[K, V] + func (om *OrderedMap[K, V]) Get(key K) (val V, present bool) + func (om *OrderedMap[K, V]) GetAndMoveToBack(key K) (val V, err error) + func (om *OrderedMap[K, V]) GetAndMoveToFront(key K) (val V, err error) + func (om *OrderedMap[K, V]) GetPair(key K) *Pair[K, V] + func (om *OrderedMap[K, V]) KeysFromNewest() iter.Seq[K] + func (om *OrderedMap[K, V]) KeysFromOldest() iter.Seq[K] + func (om *OrderedMap[K, V]) Len() int + func (om *OrderedMap[K, V]) Load(key K) (V, bool) + func (om *OrderedMap[K, V]) MarshalJSON() ([]byte, error) + func (om *OrderedMap[K, V]) MarshalYAML() (any, error) + func (om *OrderedMap[K, V]) MoveAfter(key, markKey K) error + func (om *OrderedMap[K, V]) MoveBefore(key, markKey K) error + func (om *OrderedMap[K, V]) MoveToBack(key K) error + func (om *OrderedMap[K, V]) MoveToFront(key K) error + func (om *OrderedMap[K, V]) Newest() *Pair[K, V] + func (om *OrderedMap[K, V]) Oldest() *Pair[K, V] + func (om *OrderedMap[K, V]) Set(key K, value V) (val V, present bool) + func (om *OrderedMap[K, V]) Store(key K, value V) (V, bool) + func (om *OrderedMap[K, V]) UnmarshalJSON(data []byte) error + func (om *OrderedMap[K, V]) UnmarshalYAML(value *yaml.Node) error + func (om *OrderedMap[K, V]) Value(key K) (val V) + func (om *OrderedMap[K, V]) ValuesFromNewest() iter.Seq[V] + func (om *OrderedMap[K, V]) ValuesFromOldest() iter.Seq[V] + type Pair struct + Key K + Value V + func (p *Pair[K, V]) Next() *Pair[K, V] + func (p *Pair[K, V]) Prev() *Pair[K, V]
Go to main page