2 repository-uri
Collections with a strictly defined maximum number of elements to ensure predictable memory footprints.
Distinct from Fixed-Capacity Caches: None of the candidates cover general-purpose fixed-capacity sets/dictionaries for memory optimization.
Explore 2 awesome GitHub repositories matching data & databases · Fixed-Capacity Containers. Refine with filters or upvote what's useful.
This library provides a collection of specialized data structures for the Swift language that extend the standard library with advanced container types. It includes implementations for double-ended queues using ring-buffers, priority queues based on min-max heaps, and memory-efficient bit-set and bit-array storage for boolean values. The project features ordered collections that maintain elements in sorted order via B-tree implementations, as well as persistent sets and dictionaries that use compressed prefix trees to share data between mutated copies. It also provides specialized containers
Provides arrays, sets, and dictionaries with strictly defined maximum capacities.
Heapless is an embedded Rust data structure library that provides statically allocated, fixed-capacity collections for memory-constrained systems. It implements a zero-allocation runtime model where all collection elements are stored inline within their own value structure, completely removing the need for operating system interaction, global allocators, or runtime heap allocation. Capacity is specified at compile time through generic type parameters, ensuring every collection has a fixed upper bound known before execution. The library implements core language traits to provide standard coll
Enforces strict bounds checking and stack-based allocation for memory-safe embedded application buffers.