Struct uell::Uell

pub struct Uell<'b, T> { /* fields omitted */ }

An unrolled exponential linked list.

An append-only container, that can be useful in case reallocating memory can be inefficient.

It is backed by a bumpalo allocator where reallocating memory means wasting memory, as bumpalo cannot reuse freed memory.

Implementations

impl<'b, T: Copy + Default> Uell<'b, T>

pub fn new_in(bump: &'b Bump) -> Uell<'_, T>

Constructs a new, empty Uell<'bump, T>.

The unrolled exponential linked list will not allocate until elements are pushed onto it.

pub fn from_iter_in<I>(iter: I, bump: &'b Bump) -> Uell<'_, T> where
    I: IntoIterator<Item = T>, 

Construct a new Uell<'bump, T> from the given iterator’s items.

pub fn len(&self) -> usize

Returns the number of elements in the linked list, also referred to as its ‘length’.

pub fn is_empty(&self) -> bool

Returns true if the linked list contains no elements.

pub fn push(&mut self, elem: T)

Appends an element to the back of the collection.

Trait Implementations

impl<'b, T> Drop for Uell<'b, T>

fn drop(&mut self)

Executes the destructor for this type.

impl<'b, T: 'b + Copy> IntoIterator for Uell<'b, T>

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<'b, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.