3 releases

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

#244 in Memory management

Download history 782/week @ 2023-11-23 644/week @ 2023-11-30 877/week @ 2023-12-07 1274/week @ 2023-12-14 898/week @ 2023-12-21 690/week @ 2023-12-28 1083/week @ 2024-01-04 1309/week @ 2024-01-11 1350/week @ 2024-01-18 1606/week @ 2024-01-25 998/week @ 2024-02-01 1273/week @ 2024-02-08 1528/week @ 2024-02-15 1612/week @ 2024-02-22 1698/week @ 2024-02-29 1197/week @ 2024-03-07

6,253 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