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

Xor filters - efficient probabilistic hashsets. Faster and smaller than bloom and cuckoo filters.

The go-set package provides generic Set implementations for Go, including HashSet for types with a Hash() function and TreeSet for orderable data

Library providing fast hash based immutable map and set

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 optimized for sequential access and mutation), Set, Map, Queue, Stack and more. Examples are in the project.

RiteLinked - LinkedHashMap & LinkedHashSet in Rust

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

Rust implementation of the DCSO Bloom filter

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

(Legacy) Extremely fast unordered map and set library for C++20

Comparison of Hashing Algorithms - Double Hashing, Robin Hood Hashing Cuckoo Hashing with Java's inbuilt HashMap/ HastSet over million of add(), contains() and remove() operations.