dense

README

dense

Generic implementations of dense sets and maps

Documentation

Index

• type Map
  • func NewMap[K comparable, V any](size int) *Map[K, V]
  • func (m *Map[K, V]) Clear()
  • func (m *Map[K, V]) Contains(key K) bool
  • func (m *Map[K, V]) Delete(k K)
  • func (m *Map[K, V]) Each(f func(key K, val V))
  • func (m *Map[K, V]) EachRef(f func(key K, valRef *V))
  • func (m *Map[K, V]) Get(key K) (val V, hasval bool)
  • func (m *Map[K, V]) GetRef(key K) (val *V, hasval bool)
  • func (m *Map[K, V]) Insert(key K, val V)
  • func (m *Map[K, V]) Len() int
  • func (m *Map[K, V]) MustGet(key K) (out V)
  • func (m *Map[K, V]) MustGetRef(key K) (out *V)
• type Pair

Types

type Map

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

func NewMap

func NewMap[K comparable, V any](size int) *Map[K, V]

func (*Map[K, V]) Clear

func (m *Map[K, V]) Clear()

func (*Map[K, V]) Contains

func (m *Map[K, V]) Contains(key K) bool

func (*Map[K, V]) Delete

func (m *Map[K, V]) Delete(k K)

func (*Map[K, V]) Each

func (m *Map[K, V]) Each(f func(key K, val V))

func (*Map[K, V]) EachRef

func (m *Map[K, V]) EachRef(f func(key K, valRef *V))

func (*Map[K, V]) Get

func (m *Map[K, V]) Get(key K) (val V, hasval bool)

func (*Map[K, V]) GetRef

func (m *Map[K, V]) GetRef(key K) (val *V, hasval bool)

func (*Map[K, V]) Insert

func (m *Map[K, V]) Insert(key K, val V)

func (*Map[K, V]) Len

func (m *Map[K, V]) Len() int

func (*Map[K, V]) MustGet

func (m *Map[K, V]) MustGet(key K) (out V)

func (*Map[K, V]) MustGetRef

func (m *Map[K, V]) MustGetRef(key K) (out *V)

type Pair

type Pair[K, V any] struct {
	Key K
	Val V
}