Crates.io | heap-array |
lib.rs | heap-array |
version | 0.1.9 |
source | src |
created_at | 2023-08-14 22:01:08.967564 |
updated_at | 2024-07-07 23:22:47.166405 |
description | An Implementation of a variable length array, with its main benefit over `Vec` is taking up less space |
homepage | |
repository | https://github.com/NightMare-Vortex/heap-array |
max_upload_size | |
id | 944519 |
size | 78,116 |
An Implementation of a variable length array, with its main benefit over Vec
is taking up less space
as HeapArray
is represented as (pointer, len) while Vec is a (pointer, len, capacity)
and is meant as a replacement for Box<[T]>
nice to have: compatible with serde
use heap_array::{heap_array, HeapArray};
fn main() {
let arr = heap_array![1, 2, 5, 8];
assert_eq!(arr[0], 1);
assert_eq!(arr[1], 2);
assert_eq!(arr[2], 5);
assert_eq!(arr[3], 8);
assert_eq!(arr.len(), 4);
let arr = HeapArray::from_fn(10, |i| i);
assert_eq!(*arr, [0, 1, 2, 3, 4, 5, 6, 7, 8, 9])
}