3 releases

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

#650 in Memory management

Download history 3340/week @ 2024-10-09 5603/week @ 2024-10-16 7380/week @ 2024-10-23 8856/week @ 2024-10-30 8138/week @ 2024-11-06 9942/week @ 2024-11-13 9295/week @ 2024-11-20 9568/week @ 2024-11-27 9070/week @ 2024-12-04 9456/week @ 2024-12-11 6993/week @ 2024-12-18 4262/week @ 2024-12-25 5605/week @ 2025-01-01 8048/week @ 2025-01-08 8292/week @ 2025-01-15 8963/week @ 2025-01-22

31,450 downloads per month
Used in 33 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