Versions in this module Expand all Collapse all v0 v0.3.1 Mar 5, 2024 v0.3.0 Mar 5, 2024 v0.2.5 Jan 14, 2024 v0.2.4 Jan 14, 2024 v0.2.3 Jan 14, 2024 v0.2.2 Jan 14, 2024 v0.2.1 Jan 13, 2024 v0.2.0 Jan 1, 2024 v0.1.6 Dec 25, 2023 v0.1.5 Dec 25, 2023 v0.1.4 Dec 21, 2023 v0.1.3 Dec 18, 2023 v0.1.2 Dec 18, 2023 v0.1.1 Dec 18, 2023 v0.1.0 Dec 18, 2023 Changes in this version + func Equal[K, V comparable](m1, m2 *OrderedMap[K, V]) bool + type AccessOrderedMap struct + func NewAccessOrderedMap[K comparable, V any](capability int) *AccessOrderedMap[K, V] + func (m *AccessOrderedMap[K, V]) Get(key K) (val V, existed bool) + func (m *AccessOrderedMap[K, V]) Load(key K) (V, bool) + type BidiMap struct + func NewBidiMap[K, V comparable](capacity int) *BidiMap[K, V] + func (bm *BidiMap[K, V]) AddBidiMap(m *BidiMap[K, V]) + func (bm *BidiMap[K, V]) AddMap(m map[K]V) + func (bm *BidiMap[K, V]) Clear() + func (bm *BidiMap[K, V]) Clone() *BidiMap[K, V] + func (bm *BidiMap[K, V]) Put(key K, value V) + func (bm *BidiMap[K, V]) Remove(key K) + func (bm *BidiMap[K, V]) RemoveValue(value V) + func (bm BidiMap[K, V]) Equals(m *BidiMap[K, V]) bool + func (bm BidiMap[K, V]) Get(key K) (value V, found bool) + func (bm BidiMap[K, V]) GetKey(value V) (key K, found bool) + func (bm BidiMap[K, V]) Keys() []K + func (bm BidiMap[K, V]) Len() int + func (bm BidiMap[K, V]) Range(f func(key K, value V) bool) + func (bm BidiMap[K, V]) Values() []V + func (m *BidiMap[K, V]) MarshalJSON() ([]byte, error) + func (m *BidiMap[K, V]) UnmarshalJSON(data []byte) error + type Entry struct + Key K + Value V + func (e *Entry[K, V]) Next() *Entry[K, V] + func (e *Entry[K, V]) Prev() *Entry[K, V] + type OrderedMap struct + func NewOrderedMap[K comparable, V any](capability int) *OrderedMap[K, V] + func (m *OrderedMap[K, V]) AddEntries(entries ...*Entry[K, V]) + func (m *OrderedMap[K, V]) AddMap(am map[K]V) + func (m *OrderedMap[K, V]) AddOrderedMap(am OrderedMap[K, V]) + func (m *OrderedMap[K, V]) Clear() + func (m *OrderedMap[K, V]) Clone() *OrderedMap[K, V] + func (m *OrderedMap[K, V]) Delete(key K) (val V, existed bool) + func (m *OrderedMap[K, V]) ForEach(f func(key K, value V) bool) + func (m *OrderedMap[K, V]) Get(key K) (val V, existed bool) + func (m *OrderedMap[K, V]) Keys() []K + func (m *OrderedMap[K, V]) Len() int + func (m *OrderedMap[K, V]) Load(key K) (V, bool) + func (m *OrderedMap[K, V]) MarshalJSON() ([]byte, error) + func (m *OrderedMap[K, V]) Newest() *Entry[K, V] + func (m *OrderedMap[K, V]) Oldest() *Entry[K, V] + func (m *OrderedMap[K, V]) Range(f func(key K, value V) bool) + func (m *OrderedMap[K, V]) Set(key K, value V) (val V, existed bool) + func (m *OrderedMap[K, V]) Store(key K, value V) (V, bool) + func (m *OrderedMap[K, V]) UnmarshalJSON(data []byte) error + func (m *OrderedMap[K, V]) Values() []V