Versions in this module Expand all Collapse all v0 v0.0.2 Apr 25, 2026 v0.0.1 Apr 11, 2026 Changes in this version + func DiffOrderedMapsFunc[K comparable, V any](m1 *OrderedMap[K, V], m2 *OrderedMap[K, V], equalValues func(a, b V) bool, ...) + func DiffOrderedMaps[K comparable, V comparable](m1 *OrderedMap[K, V], m2 *OrderedMap[K, V], onAdded func(key K, value V), ...) + type MapEntry struct + Key K + Value V + type MultiMap struct + M map[K][]V + func GroupBy[K comparable, V comparable](items []V, groupId func(V) K) *MultiMap[K, V] + func NewMultiMapWithSizeHint[K comparable, V comparable](hint int) *MultiMap[K, V] + func (s *MultiMap[K, V]) Add(key K, value V) + func (s *MultiMap[K, V]) Clear() + func (s *MultiMap[K, V]) Get(key K) []V + func (s *MultiMap[K, V]) Has(key K) bool + func (s *MultiMap[K, V]) Keys() iter.Seq[K] + func (s *MultiMap[K, V]) Len() int + func (s *MultiMap[K, V]) Remove(key K, value V) + func (s *MultiMap[K, V]) RemoveAll(key K) + func (s *MultiMap[K, V]) Values() iter.Seq[[]V] + type OrderedMap struct + func NewOrderedMapFromList[K comparable, V any](items []MapEntry[K, V]) *OrderedMap[K, V] + func NewOrderedMapWithSizeHint[K comparable, V any](hint int) *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) (V, bool) + func (m *OrderedMap[K, V]) Entries() iter.Seq2[K, V] + func (m *OrderedMap[K, V]) EntryAt(index int) (K, V, bool) + func (m *OrderedMap[K, V]) Get(key K) (V, bool) + func (m *OrderedMap[K, V]) GetOrZero(key K) V + func (m *OrderedMap[K, V]) Has(key K) bool + func (m *OrderedMap[K, V]) Keys() iter.Seq[K] + func (m *OrderedMap[K, V]) MarshalJSONTo(enc *json.Encoder) error + func (m *OrderedMap[K, V]) Set(key K, value V) + func (m *OrderedMap[K, V]) Size() int + func (m *OrderedMap[K, V]) UnmarshalJSONFrom(dec *json.Decoder) error + func (m *OrderedMap[K, V]) Values() iter.Seq[V] + type OrderedSet struct + func NewOrderedSetWithSizeHint[T comparable](hint int) *OrderedSet[T] + func (s *OrderedSet[T]) Add(value T) + func (s *OrderedSet[T]) Clear() + func (s *OrderedSet[T]) Clone() *OrderedSet[T] + func (s *OrderedSet[T]) Delete(value T) bool + func (s *OrderedSet[T]) Has(value T) bool + func (s *OrderedSet[T]) Size() int + func (s *OrderedSet[T]) Values() iter.Seq[T] + type Set struct + M map[T]struct{} + func NewSetFromItems[T comparable](items ...T) *Set[T] + func NewSetWithSizeHint[T comparable](hint int) *Set[T] + func (s *Set[T]) Add(key T) + func (s *Set[T]) AddIfAbsent(key T) bool + func (s *Set[T]) Clear() + func (s *Set[T]) Clone() *Set[T] + func (s *Set[T]) Delete(key T) + func (s *Set[T]) Equals(other *Set[T]) bool + func (s *Set[T]) Has(key T) bool + func (s *Set[T]) Intersects(other *Set[T]) bool + func (s *Set[T]) IsSubsetOf(other *Set[T]) bool + func (s *Set[T]) Keys() map[T]struct{} + func (s *Set[T]) Len() int + func (s *Set[T]) Union(other *Set[T]) + func (s *Set[T]) UnionedWith(other *Set[T]) *Set[T] + type SyncMap struct + func (s *SyncMap[K, V]) Clear() + func (s *SyncMap[K, V]) Clone() *SyncMap[K, V] + func (s *SyncMap[K, V]) Delete(key K) + func (s *SyncMap[K, V]) Keys() iter.Seq[K] + func (s *SyncMap[K, V]) Load(key K) (value V, ok bool) + func (s *SyncMap[K, V]) LoadOrStore(key K, value V) (actual V, loaded bool) + func (s *SyncMap[K, V]) Range(f func(key K, value V) bool) + func (s *SyncMap[K, V]) Size() int + func (s *SyncMap[K, V]) Store(key K, value V) + func (s *SyncMap[K, V]) ToMap() map[K]V + type SyncSet struct + func (s *SyncSet[T]) Add(key T) + func (s *SyncSet[T]) AddIfAbsent(key T) bool + func (s *SyncSet[T]) Delete(key T) + func (s *SyncSet[T]) Has(key T) bool + func (s *SyncSet[T]) IsEmpty() bool + func (s *SyncSet[T]) Keys() iter.Seq[T] + func (s *SyncSet[T]) Range(fn func(key T) bool) + func (s *SyncSet[T]) Size() int + func (s *SyncSet[T]) ToSlice() []T
Go to main page