hashmap

Documentation

Index

• type Map
  • func New[K comparable, V any](cap int) *Map[K, V]
  • func (m *Map[K, V]) Delete(h uint64, k K)
  • func (m *Map[K, V]) Get(h uint64, k K) (*V, bool)
  • func (m *Map[K, V]) Len() int
  • func (m *Map[K, V]) Set(h uint64, k K, v *V) bool

Types

type Map

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

Map is a robinhashmap implementation

func New

func New[K comparable, V any](cap int) *Map[K, V]

func (*Map[K, V]) Delete

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

func (*Map[K, V]) Get

func (m *Map[K, V]) Get(h uint64, k K) (*V, bool)

func (*Map[K, V]) Len

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

func (*Map[K, V]) Set

func (m *Map[K, V]) Set(h uint64, k K, v *V) bool

Set sets the value for the given key. return true if the key already exists.