maps

package

Go to main page

Versions in this module

v0

v0.16.1

Oct 5, 2024

v0.16.0

Oct 3, 2024

Changes in this version

type Map

+ func NewFromSeq[K comparable, V any](seq iter.Seq2[K, V]) *Map[K, V]

type Ordered

+ func NewOrderedFromSeq[K cmp.Ordered, V any](seq iter.Seq2[K, V]) *Ordered[K, V]

type OrderedByComparator

+ func NewOrderedByComparatorFromSeq[K, V any, C constraints.Comparator[K]](seq iter.Seq2[K, V]) *OrderedByComparator[K, V, C]

type OrderedByKey

+ func NewOrderedByKeyFromSeq[K constraints.Ordered[K], V any](seq iter.Seq2[K, V]) *OrderedByKey[K, V]

type Proto

+ func NewProtoFromSeq[K proto.Message, V any](seq iter.Seq2[K, V]) *Proto[K, V]

v0.15.1

Oct 2, 2024

v0.15.0

Oct 2, 2024

Changes in this version

+ type Map struct

+ func New[K comparable, V any](pairs ...Pair[K, V]) *Map[K, V]

+ func (m *Map[K, V]) All() iter.Seq2[K, V]

+ func (m *Map[K, V]) Clear()

+ func (m *Map[K, V]) Clone() *Map[K, V]

+ func (m *Map[K, V]) Get(k K) V

+ func (m *Map[K, V]) Has(keys ...K) bool

+ func (m *Map[K, V]) Keys() iter.Seq[K]

+ func (m *Map[K, V]) Len() int

+ func (m *Map[K, V]) Merge(x *Map[K, V]) *Map[K, V]

+ func (m *Map[K, V]) Project(transform func(K, V) (K, V, bool)) *Map[K, V]

+ func (m *Map[K, V]) Remove(keys ...K)

+ func (m *Map[K, V]) Select(pred func(K, V) bool) *Map[K, V]

+ func (m *Map[K, V]) Set(k K, v V)

+ func (m *Map[K, V]) TryGet(k K) (V, bool)

+ func (m *Map[K, V]) Values() iter.Seq[V]

+ type Ordered struct

+ func NewOrdered[K cmp.Ordered, V any](pairs ...Pair[K, V]) *Ordered[K, V]

+ func (m *Ordered[K, V]) All() iter.Seq2[K, V]

+ func (m *Ordered[K, V]) Clear()

+ func (m *Ordered[K, V]) Clone() *Ordered[K, V]

+ func (m *Ordered[K, V]) Get(k K) V

+ func (m *Ordered[K, V]) Has(keys ...K) bool

+ func (m *Ordered[K, V]) Keys() iter.Seq[K]

+ func (m *Ordered[K, V]) Len() int

+ func (m *Ordered[K, V]) Merge(x *Ordered[K, V]) *Ordered[K, V]

+ func (m *Ordered[K, V]) Project(transform func(K, V) (K, V, bool)) *Ordered[K, V]

+ func (m *Ordered[K, V]) Remove(keys ...K)

+ func (m *Ordered[K, V]) Reverse() iter.Seq2[K, V]

+ func (m *Ordered[K, V]) ReverseKeys() iter.Seq[K]

+ func (m *Ordered[K, V]) ReverseValues() iter.Seq[V]

+ func (m *Ordered[K, V]) Select(pred func(K, V) bool) *Ordered[K, V]

+ func (m *Ordered[K, V]) Set(k K, v V)

+ func (m *Ordered[K, V]) TryGet(k K) (V, bool)

+ func (m *Ordered[K, V]) Values() iter.Seq[V]

+ type OrderedByComparator struct

+ Comparator C

+ func NewOrderedByComparator[K, V any, C constraints.Comparator[K]](cmp C, pairs ...Pair[K, V]) *OrderedByComparator[K, V, C]

+ func (m *OrderedByComparator[K, V, C]) All() iter.Seq2[K, V]

+ func (m *OrderedByComparator[K, V, C]) Clear()

+ func (m *OrderedByComparator[K, V, C]) Clone() *OrderedByComparator[K, V, C]

+ func (m *OrderedByComparator[K, V, C]) Get(k K) V

+ func (m *OrderedByComparator[K, V, C]) Has(keys ...K) bool

+ func (m *OrderedByComparator[K, V, C]) Keys() iter.Seq[K]

+ func (m *OrderedByComparator[K, V, C]) Len() int

+ func (m *OrderedByComparator[K, V, C]) Merge(x *OrderedByComparator[K, V, C]) *OrderedByComparator[K, V, C]

+ func (m *OrderedByComparator[K, V, C]) Project(transform func(K, V) (K, V, bool)) *OrderedByComparator[K, V, C]

+ func (m *OrderedByComparator[K, V, C]) Remove(keys ...K)

+ func (m *OrderedByComparator[K, V, C]) Reverse() iter.Seq2[K, V]

+ func (m *OrderedByComparator[K, V, C]) ReverseKeys() iter.Seq[K]

+ func (m *OrderedByComparator[K, V, C]) ReverseValues() iter.Seq[V]

+ func (m *OrderedByComparator[K, V, C]) Select(pred func(K, V) bool) *OrderedByComparator[K, V, C]

+ func (m *OrderedByComparator[K, V, C]) Set(k K, v V)

+ func (m *OrderedByComparator[K, V, C]) TryGet(k K) (V, bool)

+ func (m *OrderedByComparator[K, V, C]) Values() iter.Seq[V]

+ type OrderedByKey struct

+ func NewOrderedByKey[K constraints.Ordered[K], V any](pairs ...Pair[K, V]) *OrderedByKey[K, V]

+ func (m *OrderedByKey[K, V]) All() iter.Seq2[K, V]

+ func (m *OrderedByKey[K, V]) Clear()

+ func (m *OrderedByKey[K, V]) Clone() *OrderedByKey[K, V]

+ func (m *OrderedByKey[K, V]) Get(k K) V

+ func (m *OrderedByKey[K, V]) Has(keys ...K) bool

+ func (m *OrderedByKey[K, V]) Keys() iter.Seq[K]

+ func (m *OrderedByKey[K, V]) Len() int

+ func (m *OrderedByKey[K, V]) Merge(x *OrderedByKey[K, V]) *OrderedByKey[K, V]

+ func (m *OrderedByKey[K, V]) Project(transform func(K, V) (K, V, bool)) *OrderedByKey[K, V]

+ func (m *OrderedByKey[K, V]) Remove(keys ...K)

+ func (m *OrderedByKey[K, V]) Reverse() iter.Seq2[K, V]

+ func (m *OrderedByKey[K, V]) ReverseKeys() iter.Seq[K]

+ func (m *OrderedByKey[K, V]) ReverseValues() iter.Seq[V]

+ func (m *OrderedByKey[K, V]) Select(pred func(K, V) bool) *OrderedByKey[K, V]

+ func (m *OrderedByKey[K, V]) Set(k K, v V)

+ func (m *OrderedByKey[K, V]) TryGet(k K) (V, bool)

+ func (m *OrderedByKey[K, V]) Values() iter.Seq[V]

+ type Pair struct

+ Key K

+ Value V

+ type Proto struct

+ func NewProto[K proto.Message, V any](pairs ...Pair[K, V]) *Proto[K, V]

+ func (m *Proto[K, V]) All() iter.Seq2[K, V]

+ func (m *Proto[K, V]) Clear()

+ func (m *Proto[K, V]) Clone() *Proto[K, V]

+ func (m *Proto[K, V]) Get(k K) V

+ func (m *Proto[K, V]) Has(keys ...K) bool

+ func (m *Proto[K, V]) Keys() iter.Seq[K]

+ func (m *Proto[K, V]) Len() int

+ func (m *Proto[K, V]) Merge(x *Proto[K, V]) *Proto[K, V]

+ func (m *Proto[K, V]) Project(transform func(K, V) (K, V, bool)) *Proto[K, V]

+ func (m *Proto[K, V]) Remove(keys ...K)

+ func (m *Proto[K, V]) Select(pred func(K, V) bool) *Proto[K, V]

+ func (m *Proto[K, V]) Set(k K, v V)

+ func (m *Proto[K, V]) TryGet(k K) (V, bool)

+ func (m *Proto[K, V]) Values() iter.Seq[V]

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL