Postmodern immutable and persistent data structures for C++ — value semantics at scale

A high-performance immutable mapping type for Python.

Data structure and algorithm library for go, designed to provide functions similar to C++ STL

Immutable and Memory-Efficient Maps and Sets in Go

Library providing fast hash based immutable map and set

Hash Array Mapped Trie (HAMT) implemented in Go (1.18+ generics)

Persistent HashMap for TypeScript

Purely functional data structures in Java

Mutable and immutable persistent maps and sets as hash array mapped trie (HAMT) for FreePascal

Modular full-text search engine in Go with pluggable indexes, filters, and customizable text processing pipelines. You can instantly index your docs (trie, n-grams, HAMT), apply probabilistic filters, and experimenting with search performance via interactive CUI.

HAMT implementation whose sub-trees can be shared over threads

Hash Array Mapped Trie as defined in Phil Bagwell (2001). Ideal Hash Tries

Providing fast at scale HashMap, LinkedHashMap, and Higher Order Functions to any iterable, such as Array, Map or Set. Tested, and Benchmarked, Issues & PRs welcomed.

persistent data structures in common lisp "pers-i-DAH-strick-el"

Draft specification for bit popcount in JavaScript.

Haskell implementations of associative containers (maps / dictionaries) which retire elements in least recently used (LRU) order when growing past a specified limit

Returns native JavaScript types (Array/Object/Map/Set). Immutability faster than mutation. Dual mode: immutable + mutable patterns. 100% library compatible.

Immutable Persistent Map for Go

Go implementation of CHAMP (Compressed Hash-Array Mapped Prefix-tree), an efficient immutable map data structure

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)