Why Go
- Case Studies
  
  Common problems companies solve with Go
- Use Cases
  
  Stories about how and why companies use Go
- Security
  
  How Go can help keep you secure by default
Learn
Docs
- Effective Go
  
  Tips for writing clear, performant, and idiomatic Go code
- Go User Manual
  
  A complete introduction to building software with Go
- Standard library
  
  Reference documentation for Go's standard library
- Release Notes
  
  Learn what's new in each Go release
Packages
Community
- Recorded Talks
  
  Videos from prior events
- Meetups
  
  Meet other local Go developers
- Conferences
  
  Learn and network with Go developers from around the world
- Go blog
  
  The Go project's official blog.
- Go project
  
  Get help and stay informed from Go
- Get connected

maps

package

Go to main page

Versions in this module

v0

v0.6.0

Jan 3, 2024

Changes in this version

+ func KeySlice[K comparable, V any, M ~map[K]V](m M) []K

+ func Retain[K comparable, V any, M ~map[K]V](m M, f func(K, V) bool)

+ func ValueSlice[K comparable, V any, M ~map[K]V](m M) []V

type MapEntry

+ func EntrySlice[K comparable, V any, M ~map[K]V](m M) []MapEntry[K, V]

v0.5.0

Dec 2, 2023

Changes in this version

+ func Collect[K comparable, V any](s iter.Seq[MapEntry[K, V]]) map[K]V

+ func FilterMap[K comparable, V any, M ~map[K]V, X comparable, Y any, N ~map[X]Y](m M, f func(K, V) (X, Y, bool)) N

+ func Filter[K comparable, V any, M ~map[K]V](m M, f func(K, V) bool) M

+ func ForEach[K comparable, V any, M ~map[K]V](m M, f func(K, V))

+ func Invert[K comparable, V comparable, M1 ~map[K]V, M2 ~map[V]K](m M1) M2

+ func MapKey[K, X comparable, V any, M ~map[K]V](m M, f func(K) X) map[X]V

+ func MapValue[K comparable, V, X any, M ~map[K]V](m M, f func(V) X) map[K]X

+ func Map[K, X comparable, V, Y any, M ~map[K]V](m M, f func(K, V) (X, Y)) map[X]Y

+ func MergeFunc[K comparable, V any, M ~map[K]V](ms iter.Seq[M], onConflict func(V, V) V) M

+ func MergeKeep[K comparable, V any, M ~map[K]V](ms iter.Seq[M]) M

+ func MergeOverwrite[K comparable, V any, M ~map[K]V](ms iter.Seq[M]) M

v0.4.2

Aug 14, 2023

v0.4.1

Aug 14, 2023

Changes in this version

+ func DeleteBy(x map[K]V, f func(K, V) bool)

type MapEntry

+ func (e MapEntry[K, V]) Key() K

+ func (e MapEntry[K, V]) Value() V

v0.4.0

Jul 6, 2023

Changes in this version

+ func Clone(m M) M

+ func Equal(lhs M1, rhs M2) bool

+ func EqualBy(lhs M1, rhs M2, equal func(V1, V2) bool) bool

+ func Keys(m M) []K

+ func Values(m M) []V

+ type MapEntry struct

+ func Entries(m M) []MapEntry[K, V]

v0.3.0

Mar 26, 2023

v0.2.1

Jul 19, 2022

Changes in this version

type DefaultHashMap

+ func (m DefaultHashMap[K, V]) Clone() DefaultHashMap[K, V]

+ func (m DefaultHashMap[K, V]) Contains(key K) bool

+ func (m DefaultHashMap[K, V]) ContainsAll(keys []K) bool

+ func (m DefaultHashMap[K, V]) Size() int

v0.2.0

Jun 12, 2022

Changes in this version

+ type DefaultHashMap struct

+ func NewDefaultHashMap(factory func(K) V) *DefaultHashMap[K, V]

+ func (m *DefaultHashMap[K, V]) Del(key K)

+ func (m *DefaultHashMap[K, V]) Get(key K) V

+ func (m *DefaultHashMap[K, V]) Has(key K) bool

+ func (m *DefaultHashMap[K, V]) Range(f func(K, V))

+ func (m *DefaultHashMap[K, V]) Set(key K, val V)