rust-embedded/heapless
Heapless
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 collection behavior, allowing drop-in compatibility with standard library types while maintaining strict safety guarantees and bounds checking for bare-metal microcontrollers and safety-critical software engineering.
Features
- Fixed-Capacity Buffers - Stores data in statically sized buffers without requiring dynamic memory allocation for memory-constrained systems.
- Fixed-Capacity Containers - Enforces strict bounds checking and stack-based allocation for memory-safe embedded application buffers.
- Inline Value Structures - Stores all collection elements inline within their own value structure, completely removing the need for runtime heap allocation.
- Capacity Bounds - Ensures every collection has a fixed upper bound known at compilation time through generic parameters.
- Embedded Data Structure Libraries - Provides statically allocated, heapless data structures designed for memory-constrained embedded systems.
- Standard Library Compatibility Traits - Implements core language traits to provide standard collection behavior for drop-in standard library compatibility.
- Embedded Systems Development - Targets software development for microcontrollers and hardware devices with strict memory limits where heap allocation is unavailable.
- Safety Engineering - Develops reliable code that eliminates common memory management errors by enforcing strict compile-time bounds and static sizing.
- Zero-Allocation Runtime Models - Operates without operating system interaction or global allocators, making data structures safe for bare-metal microcontrollers.
- Zero-Allocation Data Processing - Avoids dynamic memory allocation entirely to prevent fragmentation and latency spikes in high-performance application code.
- Generator-Based Iterators - Traverses sequences and manipulates data using standard iterator patterns that evaluate lazily without intermediate allocations.
