Struct heaparray::FatPtrArray

pub struct FatPtrArray<'a, E, L = ()> where
    Self: 'a,  { /* fields omitted */ }

Heap-allocated array, with array size stored with the pointer to the memory.

Examples

Creating an array:

use heaparray::*;
let len = 10;
let array = FatPtrArray::new(len, |idx| idx + 3);

Indexing works as you would expect:

array[3] = 2;
assert!(array[3] == 2);

Notably, you can take ownership of objects back from the container:

let mut array = FatPtrArray::new(10, |_| Vec::<u8>::new());
let replacement_object = Vec::new();
let owned_object = array.insert(0, replacement_object);

but you need to give the array a replacement object to fill its slot with.

Additionally, you can customize what information should be stored alongside the elements in the array using the FatPtrArray::new_labelled function:

struct MyLabel {
    pub even: usize,
    pub odd: usize,
}

let mut array = FatPtrArray::new_labelled(
    MyLabel { even: 0, odd: 0 },
    100,
    |label, index| {
        if index % 2 == 0 {
            label.even += 1;
            index
        } else {
            label.odd += 1;
            index
        }
    });

Methods

impl<'a, E> FatPtrArray<'a, E>

pub fn new<F>(len: usize, func: F) -> Self where
    F: FnMut(usize) -> E, 

Create a new array, with values initialized using a provided function.

impl<'a, E, L> FatPtrArray<'a, E, L>

pub fn new_labelled<F>(label: L, len: usize, func: F) -> Self where
    F: FnMut(&mut L, usize) -> E, 

Create a new array, with values initialized using a provided function, and label initialized to a provided value.

pub unsafe fn new_labelled_unsafe(label: L, len: usize) -> Self

Create a new array, without initializing the values in it.

pub unsafe fn unchecked_access(&'a self, idx: usize) -> &'a mut E

Unsafe access to an element at an index in the array.

impl<'a, E> FatPtrArray<'a, E> where
    E: Default, 

pub fn new_default(len: usize) -> Self

Get a new array, initialized to default values.

impl<'a, E, L> FatPtrArray<'a, E, L> where
    E: Default, 

pub fn new_default_labelled(label: L, len: usize) -> Self

Get a new array, initialized to default values.

Trait Implementations

impl<'a, E, L> LabelledArray<E, L> for FatPtrArray<'a, E, L>

fn get_label(&self) -> &L

Get a reference to the label of the array.

fn get_label_mut(&mut self) -> &mut L

Get a mutable reference to the label of the array.

impl<'a, E, L> Clone for FatPtrArray<'a, E, L> where
    L: Clone,
    E: Clone, 

fn clone(&self) -> Self

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<'a, E, L> Index<usize> for FatPtrArray<'a, E, L>

type Output = E

The returned type after indexing.

fn index(&self, idx: usize) -> &E

Performs the indexing (container[index]) operation.

impl<'a, E, L> IndexMut<usize> for FatPtrArray<'a, E, L>

fn index_mut(&mut self, idx: usize) -> &mut E

Performs the mutable indexing (container[index]) operation.

impl<'a, E, L> Container<(usize, E)> for FatPtrArray<'a, E, L>

fn add(&mut self, elem: (usize, E))

Add an element to the container.

fn len(&self) -> usize

Get the size of the container.

impl<'a, E, L> CopyMap<usize, E, (usize, E)> for FatPtrArray<'a, E, L>

fn get(&self, key: usize) -> Option<&E>

Get a value from this Map. Takes a key by reference and returns a reference to the corresponding data, or None if none exists.

fn get_mut(&mut self, key: usize) -> Option<&mut E>

Returns a mutable reference to an object stored in this container based on the key given, or None if the key does not exist.

fn insert(&mut self, key: usize, value: E) -> Option<E>

Adds a new item into this container with the associated key, and returns the previous value associated with that key, if it existed.

impl<'a, E, L> Array<E> for FatPtrArray<'a, E, L>