A hash array-mapped trie implementation in C
High-performance immutable data structures for modern JavaScript and TypeScript applications. Functional interfaces, deep/composite operations API, mixed mutability API, TypeScript definitions, ES2015 module exports.
Purely functional data structures in Java
Hash Array Mapped Trie as defined in Phil Bagwell (2001). Ideal Hash Tries
Idris Hash Array Mapped Trie
A Hash Array Mapped Trie (HAMT) is a High-Performance Data Structure used to Implement Associative Arrays (Maps or Sets). It Combines the Speed of a Hash Table with the Structural Advantages of a Trie (Prefix Tree)
PHP immutable persistent data structures library
Efficient immutable hash map implementation written in go.
Add a description, image, and links to the hash-array-mapped-trie topic page so that developers can more easily learn about it.
To associate your repository with the hash-array-mapped-trie topic, visit your repo's landing page and select "manage topics."