Data Structures
Showing 36 of 377 projects
A Redis-compatible in-memory data store re-implemented in Rust for cross-platform use and multi-core performance.
A Rust library providing fully persistent data structures with structural sharing.
A Rust procedural macro for creating newtypes with built-in sanitization and validation guarantees.
A high-performance Python graph library implemented in Rust for general-purpose graph algorithms.
A high-performance Java collection engine enabling SQL-like queries with indexes for microsecond latencies.
A curated collection of projects, libraries, and resources for visualizing algorithms and computational concepts.
A robust and multipurpose Graph object for JavaScript and TypeScript, supporting various graph types with a unified interface.
A fast immutable list data structure for JavaScript with a comprehensive functional API and seamless Ramda integration.
A fast and memory-efficient C++ hashmap implementation using robin hood hashing as a drop-in replacement for std::unordered_map/set.
A very fast static spatial index for 2D points and rectangles in JavaScript, using a packed Hilbert R-tree algorithm.
The bidirectional mapping library for Python.
A curated collection of LeetCode algorithm solutions implemented in Swift 5, designed for technical interview preparation.
A C++ header-only library providing fast hash map and hash set implementations using robin hood hashing with open addressing.
A Go library implementing memory-efficient bitsets for mapping non-negative integers to boolean values.
A high-performance, columnar, in-memory storage engine with bitmap indexing and zero-allocation queries, written in Go.
A fast, densely stored C++17+ hashmap and hashset using robin-hood backward shift deletion, offering near-drop-in replacements for std::unordered_map/set.
A Rust library providing purely functional data structures and a comprehensive glossary of functional programming concepts.
A Java 8 library providing persistent data structures, functional control types, and higher-kinded abstractions for building functional applications.
A Swift library providing fast sorted collections (Map, List, SortedSet, SortedBag) using in-memory B-trees with copy-on-write semantics.
A fast, memory-efficient hash map implementation for C++ with minimal memory overhead during resizing.
A C++17 library providing efficient STL-like data structures (vector, unordered_map, etc.) for GPU programming with CUDA, OpenMP, and HIP backends.
A complete, fully tested and documented data structure library written in pure JavaScript.
A functional, persistent, off-heap sorted key-value data structure for scalable databases with snapshot and fork capabilities.
A comprehensive data structures and algorithms library for Go, inspired by C++ STL with goroutine-safe implementations.
Immutable in-memory R-tree and R*-tree implementations in Java with a reactive API for spatial indexing.
A comprehensive guide to help developers prepare for technical interviews, covering computer science, JavaScript, design patterns, and behavioral strategies.
A Python package that visualizes data structures, references, and mutability to aid debugging and teaching.
An improved HyperLogLog implementation with LogLog-Beta bias correction, sparse representation, and flexible precision for cardinality estimation.
A collection of Kotlin coding challenges with solutions and tests to practice algorithms and data structures.
High-performance Java collections for primitive types with open internals and custom API design.
A Java library providing high-performance mutable and immutable data structures with functional semantics, efficient batch operations, and custom equality.
A Rust implementation of the Roaring bitmap data structure for compressed bitsets.
A family of extremely fast, high-quality, platform-independent hash functions optimized for different performance profiles.
A curated collection of resources for learning and practicing algorithms, data structures, and competitive programming.
A graph library for Clojure providing immutable graph data structures and algorithms.
A learned index structure enabling fast lookups, range searches, and updates on billions of items with minimal space usage.
Related Tags
Found a gem we're missing?
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.