Crates.io | copy_arena |
lib.rs | copy_arena |
version | 0.1.1 |
source | src |
created_at | 2015-08-08 20:33:10.911263 |
updated_at | 2015-12-11 23:58:10.571132 |
description | Arena allocator for types implementing Copy |
homepage | |
repository | https://github.com/PeterReid/copy_arena |
max_upload_size | |
id | 2793 |
size | 13,241 |
This Rust module provides a memory allocation Arena for types that implement Copy.
Basic usage is as follows:
extern crate copy_arena;
use copy_arena::Arena;
let mut arena = Arena::new();
let mut allocator = arena.allocator();
let a: &mut i32 = allocator.alloc(5);
let b: &mut f64 = allocator.alloc_default();
let c: &mut [u8] = allocator.alloc_slice(b"some text");
let b: &mut [usize] = allocator.alloc_slice_fn(10, |idx| idx + 1);
let e: &mut [u32] = allocator.alloc_slice_default(10);
This could be used for building a tree structure without heap allocations for each node:
use copy_arena::{Arena, Allocator};
#[derive(Copy, Clone)]
struct Tree<'a> {
left: Option<&'a Tree<'a>>,
right: Option<&'a Tree<'a>>,
content: u32
}
fn build_little_tree<'a>(allocator: &mut Allocator<'a>) -> &'a Tree<'a> {
let left = allocator.alloc(Tree { left: None, right: None, content: 8 });
let right = allocator.alloc(Tree { left: None, right: None, content: 16 });
let parent = allocator.alloc(Tree { left: Some(left), right: Some(right), content: 13 });
parent
}
#[test]
fn make_tree() {
let mut arena = Arena::new();
let mut allocator = arena.allocator();
let root = build_little_tree(&mut allocator);
assert_eq!(root.content, 13);
assert_eq!(root.left.unwrap().content, 8);
assert_eq!(root.right.unwrap().content, 16);
}
This differs from the (unstable) Arena in Rust's standard library in a couple of ways:
This Arena only supports Copy
-able objects -- no destructors are
executed.
This Arena does not use dynamic borrow checking, saving two RefCells and an Rc before getting to the underlying data to allocate from but leading to a slightly less convenient API.