Need help with hamt?
Click the “chat” button below for chat support from the developer who created it, or find similar developers for support.

About the developer

raviqqe
216 Stars 9 Forks The Unlicense 118 Commits 0 Opened issues

Description

Immutable and Memory-Efficient Maps and Sets in Go

Services available

!
?

Need anything else?

Contributors list

# 82,203
serverl...
string-...
Perl
Neovim
114 commits
# 146,090
tcl
Lua
Awesome...
Shell
1 commit

hamt

GitHub Action Codecov Go Report Card License

Immutable and Memory Efficient Maps and Sets in Go.

This package

hamt
provides immutable collection types of maps (associative arrays) and sets implemented as Hash-Array Mapped Tries (HAMTs). All operations of the collections, such as insert and delete, are immutable and create new ones keeping original ones unmodified.

Hash-Array Mapped Trie (HAMT) is a data structure popular as a map (a.k.a. associative array or dictionary) or set. Its immutable variant is adopted widely by functional programming languages like Scala and Clojure to implement immutable and memory-efficient associative arrays and sets.

Installation

go get github.com/raviqqe/hamt

Documentation

GoDoc

Technical notes

The implementation canonicalizes tree structures of HAMTs by eliminating intermediate nodes during delete operations as described in the CHAMP paper.

References

License

The Unlicense

We use cookies. If you continue to browse the site, you agree to the use of cookies. For more information on our use of cookies please see our Privacy Policy.