A hash array-mapped trie implementation in C
- Updated
- C
#
hash-array-mapped-trie
Here are 8 public repositories matching this topic...
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.
javascript map set list typescript immutable dictionary deep nested-structures javascript-library batching data-structures immutablejs typescript-definitions red-black-tree es2015-modules hash-array-mapped-trie sorted-set sorted-map
- Updated
- TypeScript
Purely functional data structures in Java
java immutable stack queue data-structures hashmap multiset persistent-data-structure hashset hamt immutable-datastructures hash-array-mapped-trie okasaki purely-functional-data-structures purelyfunctionaldatastructures
- Updated
- Java
Hash Array Mapped Trie as defined in Phil Bagwell (2001). Ideal Hash Tries
- Updated
- Zig
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)
- Updated
- Rust
Efficient immutable hash map implementation written in go.
- Updated
- Go
PHP immutable persistent data structures library
- Updated
- PHP
Improve this page
Add a description, image, and links to the hash-array-mapped-trie topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the hash-array-mapped-trie topic, visit your repo's landing page and select "manage topics."