package hash // "container/hash"

import "iter"

// Map[K, V, H] is a mapping from keys of type K to values of type V,
// using key-equivalence relation H.
type Map[K, V any, H maphash.Hasher[K]] struct { ... }

// NewMap returns a new mapping.
type NewMap[K, V any, H maphash.Hasher[K]]() *Map[K, V, K]

// All returns an iterator over the key/value entries of the map in undefined order.
func (m *Map[K, V]) All() iter.Seq2[K, V]

// At returns the map entry for the given key. It returns zero if the entry is not present.
func (m *Map[K, V]) At(key K) V

// Delete removes th//e entry with the given key, if any. It returns true if the entry was found.
func (m *Map[K, V]) Delete(key K) bool

// Keys returns an iterator over the map keys in unspecified order.
func (m *Map[K, V]) Keys() iter.Seq[K]

// Values returns an iterator over the map values in unspecified order.
func (m *Map[K, V]) Values() iter.Seq[V]

// Len returns the number of map entries.
func (m *Map[K, V]) Len() int

// Set updates the map entry for key to value, and returns the previous entry, if any.
func (m *Map[K, V]) Set(key K, value V) (prev V)

// String returns a string representation of the map's entries in unspecified order.
// Values are printed as if by fmt.Sprint.
func (m *Map[K, V]) String() string