A javascript standard data structure library which benchmark against C++ STL.
Fast, low-allocation ports of List, Dictionary, HashSet, Stack, and Queue using ArrayPool and Span.
The Capsule Hash Trie Collections Library
Excalibur Hash is a high-speed hash map and hash set, ideal for performance-critical uses like video games
The go-set package provides generic Set implementations for Go, including HashSet for types with a Hash() function and TreeSet for orderable data
Xor filters - efficient probabilistic hashsets. Faster and smaller than bloom and cuckoo filters.
A TwinCAT library for creating and manipulating dynamic collections of data in TwinCAT. It provides multiple data structures such as ArrayList (a dynamic array), List (a doubly linked list that is opt...
Library providing fast hash based immutable map and set
Efficient Immutable/Persistent Collections for Java
TypeScript Collections Framework - a port of the Java Collections framework for use with Angular
Purely functional data structures in Java
Java data structures for primitive and/or Object items
Declarative macros for statically initializing collections with ease
Mutable and immutable persistent maps and sets as hash array mapped trie (HAMT) for FreePascal
A dictionary and a set that offer very fast read speed in expense of slow write speed. Ideal in situations where the collection is infrequently updated but is very often read from.
(Legacy) Extremely fast unordered map and set library for C++20