Documentation
¶
Index ¶
- type HashMap
- func (m *HashMap[K, V]) Clear()
- func (m HashMap[K, V]) ContainsKey(key K) bool
- func (m HashMap[K, V]) ContainsValue(val V) bool
- func (m HashMap[K, V]) Count() int
- func (m HashMap[K, V]) Empty() bool
- func (m HashMap[K, V]) ForEach(f func(key K, val V))
- func (m HashMap[K, V]) Get(key K) (val V, ok bool)
- func (m *HashMap[K, V]) Put(key K, val V)
- func (m *HashMap[K, V]) Remove(key K)
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type HashMap ¶
type HashMap[K comparable, V comparable] struct { // contains filtered or unexported fields }
HashMap is the main hash map type.
func (HashMap[K, V]) ContainsKey ¶
ContainsKey returns true if the passed key is present, false if not.
func (HashMap[K, V]) ContainsValue ¶
ContainsValue returns true if the passed value is present, false if not.
func (HashMap[K, V]) ForEach ¶
func (m HashMap[K, V]) ForEach(f func(key K, val V))
ForEach iterates over the dataset within the hash map, calling the passed function for each value.
Click to show internal directories.
Click to hide internal directories.