Golang Hash Maps

This package collects several hash map implementations:

• Unordered Hash Map, a classic hash table with separate chaining in a single linked list per bucket to handle collisions.
• Robin Hood Hash Map, an open addressing hash table with robin hood hashing and back shifting.
• Hopscotch Hash Map, an open addressing hash table with worst case constant runtime for lookup and delete operations.
• Flat Hash Map, an open addressing hash table with linear probing.

Getting Started

go get -u github.com/EinfachAndy/hashmaps

Robin Hood Hash Map

The example code can be try out here.

package main

import (
	"fmt"

	"github.com/EinfachAndy/hashmaps"
)

func main() {
	m := hashmaps.NewRobinHood[int, int]()

	// insert some elements
	m.Put(2, 2)
	isNew := m.Put(1, 5)
	if !isNew {
		panic("broken")
	}

	// lookup a key
	val, found := m.Get(1)
	if !found || val != 5 {
		panic("broken")
	}

	// iterate the map
	m.Each(func(key int, val int) bool {
		fmt.Println(key, "->", val)
		return false
	})

	// Print some metrics
	fmt.Println("Size:", m.Size(), "load:", m.Load())

	// remove keys
	wasIn := m.Remove(1)
	if !wasIn {
		panic("broken")
	}
}

Benchmarks

The benchmarks are implemented and maintained here.

Contributing

If you would like to contribute a new feature or maps, please let me know first what you would like to add (via email or issue tracker).