Open-source alternatives to Robin Hood Hashing

C++ small containers

A family of header-only, very fast and memory-friendly hashmap and btree containers.

HashMap JavaScript class for Node.js and the browser. The keys can be anything and won't be stringified

A complete, fully tested and documented data structure library written in pure JavaScript.

A bounded multi-producer multi-consumer concurrent queue written in C++11

ClojureScript's persistent data structures and supporting API from the comfort of vanilla JavaScript

BitMagic Library

a header-only, constexpr alternative to gperf for C++14 users

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

Go package implementing bitsets

Go package implementing Bloom filters, used by many important systems

This project is a set theory library for Go that provides a data structure for storing unique elements of any comparable type using generics. It serves as a tool for managing unique collections and performing mathematical operations such as intersections and differences. The library provides synchronized collections to prevent data races during concurrent read and write operations. It also supports converting unique collections to and from JSON arrays for data persistence and network transmission. The implementation covers membership testing, collection cloning, and size calculation. It incl

This is a persistent data structure library for JavaScript that provides collections which prevent the direct mutation of objects and arrays. It serves as an immutable state management tool and functional programming utility, ensuring that data remains unchanged after creation to simplify change detection and state tracking. The library enables the maintenance of application state by producing new versions of data structures during updates. It focuses on efficient data comparison by checking actual content instead of memory references and supports a functional programming workflow to prevent

Tries in C++

🏅State-of-the-art learned data structure that enables fast lookup, predecessor, range searches and updates in arrays of billions of items using orders of magnitude less space than traditional indexes

Simple Binary Encoding (SBE) - High Performance Message Codec

C++11/20 library that provides staticvector, smallvector, staticmap, smallmap, flatmap, staticflatmap, smallflatmap, staticunorderedmap, smallunordered_map, etc.

Wire is a cross-platform code generator and implementation of gRPC and Protocol Buffers. It transforms schema definitions into type-safe native language bindings for Kotlin, Swift, and Java to ensure consistent data exchange and communication between distributed systems. The project provides specialized tools for protocol buffer schema management, including the ability to prune unused types and filter fields by version to reduce final binary sizes. It also handles namespace management and allows for the creation of custom schema handlers to execute user-defined logic during the compilation ph

This is a collection of classical algorithms and data structures implemented as a header-only C++ library. It provides a suite of tools for general algorithm implementation, including data structure management, graph theory analysis, and string processing. The library is distinguished by its specialized toolkits for cryptographic hashing and encoding, featuring implementations of MD5, SHA-1, and Base64. It also includes advanced capabilities for high-performance string processing via suffix trees and arrays, as well as computational number theory for primality testing and arbitrary-precision

Swift μ-framework for efficient array diffs and datasource adapters.

QSP is enhanced Erlang query string parser, that supports nested arrays, hashes and returns maps. Requires Erlang 17.0 and better. Extracted from Plug.

Erlang with SQL, inspired by yesql.

Levenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix.

DynaVar is a project, written wholly in C++, whose main objective is to create a user-defined data structure capable of storing all primitive data-types.