Why Go
- Case Studies
  
  Common problems companies solve with Go
- Use Cases
  
  Stories about how and why companies use Go
- Security Policy
  
  How Go can help keep you secure by default
Learn
Docs
- Effective Go
  
  Tips for writing clear, performant, and idiomatic Go code
- Go User Manual
  
  A complete introduction to building software with Go
- Standard library
  
  Reference documentation for Go's standard library
- Release Notes
  
  Learn what's new in each Go release
Packages
Community
- Recorded Talks
  
  Videos from prior events
- Meetups
  
  Meet other local Go developers
- Conferences
  
  Learn and network with Go developers from around the world
- Go blog
  
  The Go project's official blog.
- Go project
  
  Get help and stay informed from Go
- Get connected

hashmaps

package module

Go to main page

Versions in this module

v0

v0.4.2

Jul 1, 2023

Changes in this version

+ const DefaultMaxLoad

type Hopscotch

+ func (m *Hopscotch[K, V]) MaxLoad(lf float32) error

v0.4.1

Jun 29, 2023

v0.4.0

Jun 27, 2023

Changes in this version

+ type Hopscotch struct

+ func NewHopscotch() *Hopscotch[K, V]

+ func NewHopscotchWithHasher(hasher HashFn[K]) *Hopscotch[K, V]

+ func (m *Hopscotch[K, V]) Clear()

+ func (m *Hopscotch[K, V]) Copy() *Hopscotch[K, V]

+ func (m *Hopscotch[K, V]) Each(fn func(key K, val V) bool)

+ func (m *Hopscotch[K, V]) Get(key K) (V, bool)

+ func (m *Hopscotch[K, V]) Load() float32

+ func (m *Hopscotch[K, V]) Put(key K, val V) bool

+ func (m *Hopscotch[K, V]) Remove(key K) bool

+ func (m *Hopscotch[K, V]) Reserve(n uintptr)

+ func (m *Hopscotch[K, V]) Size() int

v0.3.1

Jun 10, 2023

v0.3.0

Jun 10, 2023

Changes in this version

+ type Flat struct

+ func NewFlat() *Flat[K, V]

+ func NewFlatWithHasher(empty K, hasher HashFn[K]) *Flat[K, V]

+ func (m *Flat[K, V]) Clear()

+ func (m *Flat[K, V]) Copy() *Flat[K, V]

+ func (m *Flat[K, V]) Each(fn func(key K, val V) bool)

+ func (m *Flat[K, V]) Get(key K) (V, bool)

+ func (m *Flat[K, V]) Load() float32

+ func (m *Flat[K, V]) Put(key K, val V) bool

+ func (m *Flat[K, V]) Remove(key K) bool

+ func (m *Flat[K, V]) Reserve(n uintptr)

+ func (m *Flat[K, V]) Size() int

v0.2.1

Jun 9, 2023

v0.2.0

Jun 9, 2023

Changes in this version

+ var ErrOutOfRange = errors.New("out of range")

+ type Unordered struct

+ func NewUnordered() *Unordered[K, V]

+ func NewUnorderedWithHasher(hasher HashFn[K]) *Unordered[K, V]

+ func (m *Unordered[K, V]) Clear()

+ func (m *Unordered[K, V]) Each(fn func(key K, val V) bool)

+ func (m *Unordered[K, V]) Get(key K) (V, bool)

+ func (m *Unordered[K, V]) Insert(key K) (*V, bool)

+ func (m *Unordered[K, V]) Load() float32

+ func (m *Unordered[K, V]) Lookup(key K) *V

+ func (m *Unordered[K, V]) Put(key K, val V) bool

+ func (m *Unordered[K, V]) Remove(key K) bool

+ func (m *Unordered[K, V]) Reserve(n uintptr)

+ func (m *Unordered[K, V]) Size() int

v0.1.1

Jun 6, 2023

v0.1.0

Jun 4, 2023

Changes in this version

+ func Log2(value uint64) uint64

+ func Max(a, b T) T

+ func Min(a, b T) T

+ func NextPowerOf2(i uint64) uint64

+ type HashFn func(t T) uintptr

+ func GetHasher() HashFn[Key]

+ type IHashMap struct

+ Clear func()

+ Each func(fn func(key K, val V) bool)

+ Get func(key K) (V, bool)

+ Load func() float32

+ Put func(key K, val V) bool

+ Remove func(key K) bool

+ Reserve func(n uintptr)

+ Size func() int

+ type Ordered interface

+ type RobinHood struct

+ func NewRobinHood() *RobinHood[K, V]

+ func NewRobinHoodWithHasher(hasher HashFn[K]) *RobinHood[K, V]

+ func (m *RobinHood[K, V]) Clear()

+ func (m *RobinHood[K, V]) Copy() *RobinHood[K, V]

+ func (m *RobinHood[K, V]) Each(fn func(key K, val V) bool)

+ func (m *RobinHood[K, V]) Get(key K) (V, bool)

+ func (m *RobinHood[K, V]) Load() float32

+ func (m *RobinHood[K, V]) MaxLoad(lf float32) error

+ func (m *RobinHood[K, V]) Put(key K, val V) bool

+ func (m *RobinHood[K, V]) Remove(key K) bool

+ func (m *RobinHood[K, V]) Reserve(n uintptr)

+ func (m *RobinHood[K, V]) Size() int