Expand description

static friendly data structures that don’t require dynamic memory allocation

The core principle behind heapless is that its data structures are backed by a static memory allocation. For example, you can think of heapless::Vec as an alternative version of std::Vec with fixed capacity and that can’t be re-allocated on the fly (e.g. via push).

All heapless data structures store their memory allocation inline and specify their capacity via their type parameter N. This means that you can instantiate a heapless data structure on the stack, in a static variable, or even in the heap.

use heapless::Vec; // fixed capacity `std::Vec`

// on the stack
let mut xs: Vec<u8, 8> = Vec::new(); // can hold up to 8 elements
assert_eq!(xs.pop(), Some(42));

// in a `static` variable
static mut XS: Vec<u8, 8> = Vec::new();

let xs = unsafe { &mut XS };

assert_eq!(xs.pop(), Some(42));

// in the heap (though kind of pointless because no reallocation)
let mut ys: Box<Vec<u8, 8>> = Box::new(Vec::new());
assert_eq!(ys.pop(), Some(42));

Because they have fixed capacity heapless data structures don’t implicitly reallocate. This means that operations like heapless::Vec.push are truly constant time rather than amortized constant time with potentially unbounded (depends on the allocator) worst case execution time (which is bad / unacceptable for hard real time applications).

heapless data structures don’t use a memory allocator which means no risk of an uncatchable Out Of Memory (OOM) condition while performing operations on them. It’s certainly possible to run out of capacity while growing heapless data structures, but the API lets you handle this possibility by returning a Result on operations that may exhaust the capacity of the data structure.

List of currently implemented data structures:

Optional Features

The heapless crate provides the following optional Cargo features:

Minimum Supported Rust Version (MSRV)

This crate is guaranteed to compile on stable Rust 1.51 and up with its default set of features. It might compile on older versions but that may change in any new patch release.


pub use binary_heap::BinaryHeap;
pub use pool::singleton::arc::Arc;


A priority queue implemented with a binary heap.

A fixed capacity Multiple-Producer Multiple-Consumer (MPMC) lock-free queue

A heap-less, interrupt-safe, lock-free memory pool (*)

A fixed sorted priority linked list, similar to BinaryHeap but with different properties on push, pop, etc. For example, the sorting of the list will never memcpy the underlying value, so having large objects in the list will not cause a performance hit.

Fixed capacity Single Producer Single Consumer (SPSC) queue


Instantiates a pool of Arc pointers as a global singleton

Instantiates a pool as a global singleton


A fixed capacity double-ended queue.

A “history buffer”, similar to a write-only ring buffer of fixed length.

Fixed capacity IndexMap

Fixed capacity IndexSet.

A fixed capacity map / dictionary that performs lookups via linear search

An occupied entry which can be manipulated

An iterator on the underlying buffer ordered from oldest data to newest

A fixed capacity String

A view into an empty slot in the underlying map

A fixed capacity Vec


A view into an entry in the map

Type Definitions

A heapless::IndexMap using the default FNV hasher

A heapless::IndexSet using the default FNV hasher. A list of all Methods and Traits available for FnvIndexSet can be found in the heapless::IndexSet documentation.