maps

Aug 3, 2025

Changes in this version

+ func All[K comparable, V any](m map[K]V, predicate func(key K, value V) bool) bool

+ func Any[K comparable, V any](m map[K]V, predicate func(key K, value V) bool) bool

+ func Count[K comparable, V any](m map[K]V, predicate func(key K, value V) bool) int

+ func Drop[K comparable, V any](m map[K]V, n int) map[K]V

+ func Each[K comparable, V any](m map[K]V, f func(key K, value V))

+ func Filter[K comparable, V any](m map[K]V, predicate func(key K, value V) bool) map[K]V

+ func Find[K comparable, V any](m map[K]V, predicate func(key K, value V) bool) (K, V, bool)

+ func GroupBy[K comparable, V any, G comparable](m map[K]V, keyFunc func(key K, value V) G) map[G][]V

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

+ func Keys[K comparable, V any](m map[K]V) []K

+ func Map[K comparable, V any, R any](m map[K]V, f func(key K, value V) R) map[K]R

+ func Max[K comparable, V any](m map[K]V, less func(a, b V) bool) (K, V, bool)

+ func Merge[K comparable, V any](maps ...map[K]V) map[K]V

+ func Min[K comparable, V any](m map[K]V, less func(a, b V) bool) (K, V, bool)

+ func Partition[K comparable, V any](m map[K]V, predicate func(key K, value V) bool) (map[K]V, map[K]V)

+ func Reduce[K comparable, V any, R any](m map[K]V, initial R, f func(acc R, key K, value V) R) R

+ func Take[K comparable, V any](m map[K]V, n int) map[K]V

+ func Values[K comparable, V any](m map[K]V) []V

+ type SyncMap struct

+ func (m *SyncMap[K, V]) Delete(key K)

+ func (m *SyncMap[K, V]) Load(key K) (value V, ok bool)

+ func (m *SyncMap[K, V]) LoadAndDelete(key K) (value V, loaded bool)

+ func (m *SyncMap[K, V]) LoadOrStore(key K, value V) (actual V, loaded bool)

+ func (m *SyncMap[K, V]) Range(f func(key K, value V) bool)

+ func (m *SyncMap[K, V]) Store(key K, value V)