#alloc

no-std without-alloc

Replacements for Box, Rc, Vec, .. without alloc

3 releases

0.2.2 Oct 21, 2022
0.2.1 Jan 19, 2020
0.2.0 Jan 17, 2020

#211 in Memory management

Download history 972/week @ 2023-11-04 933/week @ 2023-11-11 952/week @ 2023-11-18 901/week @ 2023-11-25 759/week @ 2023-12-02 1200/week @ 2023-12-09 1345/week @ 2023-12-16 820/week @ 2023-12-23 978/week @ 2023-12-30 1402/week @ 2024-01-06 1577/week @ 2024-01-13 1478/week @ 2024-01-20 1611/week @ 2024-01-27 1287/week @ 2024-02-03 1314/week @ 2024-02-10 1463/week @ 2024-02-17

5,923 downloads per month
Used in 32 crates (4 directly)

MIT license

155KB
2K SLoC

without-alloc

Crates.io Status Docs.rs Status License CI Status

Dynamic data structures that do not require a global allocator.

Usage

This allows creating dynamic and recursive data structures without dynamic allocations. The example below makes use of the static-alloc crate to build a list with static lifetime based on dynamic data. As local memory pools for fixed capacity FixedVec:

use static_alloc::Bump;
use without_alloc::{FixedVec, alloc::LocalAllocLeakExt};

let mut pool: Bump<[usize; 16]> = Bump::uninit();
// Allocate a vector with capacity of 16 from the slab.
let mut vector = pool.fixed_vec(16).unwrap();

let mut num = 0;
// Push mutable ref, not `'static`, `Copy` nor `Clone`!
vector.push(&mut num);
*vector[0] = 42;

drop(vector);
assert_eq!(num, 42);

This might be handy if you want to chain boot another kernel and pass it a linked list describing the platform.

use static_alloc::Bump;
use without_alloc::{Box, alloc::LocalAllocLeakExt};

enum List {
    Nil,
    Cons(u8, Box<'static, List>),
}

static SLAB: Bump<[u8; 1024]> = Bump::uninit();

let base = SLAB.boxed(List::Nil).unwrap();
let one = SLAB.boxed(List::Cons(0, base)).unwrap();
let two = SLAB.boxed(List::Cons(1, one)).unwrap();

Dependencies