maps

Documentation

Index

• func Contains[K, V comparable, A ~map[K]V, B ~map[K]V](a A, b B) bool
• func DeepCopySets[T comparable](src map[string]sets.Set[T]) map[string]sets.Set[T]
• func FilterKeys[K comparable, V any, M ~map[K]V](m M, k []K) M
• func HaveConflict[K comparable, V comparable, S ~map[K]V](a, b S) error
• func Keys[K comparable, V any, M ~map[K]V](m M) []K
• func Merge[K comparable, V any, S ~map[K]V](a, b S, commonKeyValue func(a, b V) V) S
• func MergeKeepFirst[K comparable, V any, S ~map[K]V](a, b S) S
• func SortedKeys[K cmp.Ordered, V any, M ~map[K]V](m M) []K
• func Values[M ~map[K]V, K comparable, V any](m M) []V
• type SyncMap
  • func NewSyncMap[K comparable, V any](size int) *SyncMap[K, V]
  • func (dwc *SyncMap[K, V]) Add(k K, v V)
  • func (dwc *SyncMap[K, V]) Delete(k K)
  • func (dwc *SyncMap[K, V]) Get(k K) (V, bool)
  • func (dwc *SyncMap[K, V]) Len() int

Functions

func Contains

func Contains[K, V comparable, A ~map[K]V, B ~map[K]V](a A, b B) bool

Contains returns true if a contains all the keys in b with the same value

func DeepCopySets

func DeepCopySets[T comparable](src map[string]sets.Set[T]) map[string]sets.Set[T]

DeepCopySets create a deep copy of map[string]Set which would otherwise be referenced

func FilterKeys

func FilterKeys[K comparable, V any, M ~map[K]V](m M, k []K) M

FilterKeys returns a sub-map containing only keys from the given list

func HaveConflict

func HaveConflict[K comparable, V comparable, S ~map[K]V](a, b S) error

HaveConflict checks if a and b have the same key, but different value

func Keys

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

Keys returns a slice containing the m keys

func Merge

func Merge[K comparable, V any, S ~map[K]V](a, b S, commonKeyValue func(a, b V) V) S

Merge merges a and b while resolving the conflicts by calling commonKeyValue

func MergeKeepFirst

func MergeKeepFirst[K comparable, V any, S ~map[K]V](a, b S) S

MergeKeepFirst merges a and b keeping the values in a in case of conflict

func SortedKeys

func SortedKeys[K cmp.Ordered, V any, M ~map[K]V](m M) []K

SortedKeys returns a slice containing the sorted m keys

func Values

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

Values returns the values of the map m. The values will be in an indeterminate order.

Types

type SyncMap

type SyncMap[K comparable, V any] struct {
	// contains filtered or unexported fields
}

SyncMap - generic RWMutex protected map.

func NewSyncMap

func NewSyncMap[K comparable, V any](size int) *SyncMap[K, V]

func (*SyncMap[K, V]) Add

func (dwc *SyncMap[K, V]) Add(k K, v V)

func (*SyncMap[K, V]) Delete

func (dwc *SyncMap[K, V]) Delete(k K)

func (*SyncMap[K, V]) Get

func (dwc *SyncMap[K, V]) Get(k K) (V, bool)

func (*SyncMap[K, V]) Len

func (dwc *SyncMap[K, V]) Len() int