Showing 36 of 262 projects
A high-performance, memory-efficient Go implementation of Adaptive Radix Trees with zero-allocation searches and ordered iteration.
A pure PHP implementation of the MessagePack serialization format, supporting streaming unpacking, custom types, and extensions.
A lightweight, header-only C++20 graph library designed as a simpler alternative to the Boost Graph Library.
A TypeScript library providing persistent immutable collections and functional programming constructs like Option, Either, and Future.
A functional programming library for JavaScript/Node.js focused on string processing, regular expressions, and linear algebra.
A high-performance SIMD-vectorized bitmap index implementation in Go for dense small-to-medium collections.
A pure Swift implementation of a generic priority queue data structure using a binary heap.
A lightweight Julia toolkit for working with time series data, providing efficient data structures and operations.
A reusable Erlang library of state-based convergent replicated data types (CRDTs) with QuickCheck testing.
A Go package offering thread-safe generic implementations of BlockingQueue, PriorityQueue, CircularQueue, and Linked Queue.
A Haxe library providing parametrized, cross-platform data structures optimized for game development.
A Rust library for creating directed hypergraphs where hyperedges can connect any number of vertices.
A C++20 implementation of TimSort, a stable O(n log n) sorting algorithm optimized for partially-sorted data.
A Java Map implementation with the lowest memory usage and no rehash latency spikes, using extendible hashing.
A Go package providing synchronization primitives and asynchronous computation utilities beyond the standard library.
A high-performance Go library implementing a skip list with O(log n) operations and benchmark-proven speed.
Immutable Dart collections using the builder pattern for safe, comparable, and hashable data structures.
A Rust implementation of k-dimensional trees for fast geospatial indexing and nearest neighbor lookups.
A Rust library providing fast linear time and space suffix arrays with full Unicode support.
A suite of high-performance, persistent immutable data structures for modern JavaScript and TypeScript applications.
A GC-less, fast, generic LRU hashmap library for Go with optional locking, sharding, eviction, and expiration.
A Clojure library providing ordered sets and maps that maintain insertion order of elements.
A syntactic utilities package for Common Lisp that radically simplifies REPL-driven development and large system programming.
A safe, fallible, embedded-friendly ordered set and map implementation using a scapegoat tree, validated against Rust's BTreeSet/BTreeMap.
A collection of foundation classes and utilities for Delphi developers, used across Grijjy repositories.
A C++ implementation of open addressing hash table algorithms for efficient key-value storage.
An Erlang state monad with deterministic conflict resolution for eventually consistent systems like Riak.
A Swift collection that maintains unique elements in insertion order with fast lookup performance.
A comprehensive, modular graph library for OCaml providing multiple graph implementations and algorithms.
A pattern matching library for Go inspired by Python's Pampy, supporting structs, slices, maps, regex, and custom matchers.
A C++17 static reflection framework for parsing configuration files (XML, JSON, YAML) into native data structures.
An infinite bit-array implementation in JavaScript with high performance and unique features like remembering leading ones on inversion.
A comprehensive Go utility library providing collection manipulation, struct scanning, time utilities, and service routing.
A Rust priority queue with efficient priority change operations, implemented using IndexMap and a heap of indexes.
A collection of reusable Erlang components that extend the standard library for production applications.
An Elixir library extending the standard library with high-performance persistent vectors, ordered maps, and optimized Enum functions.
Open-Awesome is built by the community, for the community. Submit a project, suggest an awesome list, or help improve the catalog on GitHub.