Struct static_linkedlist::StaticLinkedList

pub struct StaticLinkedList<'buf, T> where
    T: Clear,  { /* fields omitted */ }

A singly-linked list for elements of type T backed by a static array.

Methods

impl<'buf, T> StaticLinkedList<'buf, T> where     T: Clear,

pub fn size(&self) -> usize

Returns the number of elements stored in the list.

pub fn free_space(&self) -> usize

Returns the remaining space in this list's backing array (in units of T).

pub fn append(&mut self, data: T) -> Result<(), Error>

Appends T to the end of the list.

pub fn prepend(&mut self, data: T) -> Result<&mut Self, Error>

Prepends T to the list's head.

pub fn head(&self) -> Option<&T>

Returns a reference to the first element in the list.

pub fn tail(&self) -> Option<&T>

Returns a reference to the last element in the list.

pub fn at(&self, index: usize) -> Result<&T, Error>

Returns a reference to the list element at 'index'.

pub fn remove_head(&mut self) -> Result<&mut Self, Error>

Removes the first element from the list.

pub fn remove_all_satisfying(     &mut self,     predicate: fn(_: &T) -> bool ) -> Result<&mut Self, Error>

Removes all elements e from the list where predicate(e) == true.

Trait Implementations

impl<'buf, T> Drop for StaticLinkedList<'buf, T> where     T: Clear,

Ensures that the memory occupied by the list is returned to its backing array when it goes out of scope.

fn drop(&mut self)

Executes the destructor for this type.

impl<'l, 'buf, T> IntoIterator for &'l StaticLinkedList<'buf, T> where     T: Clear,

type Item = &'l T

The type of the elements being iterated over.

type IntoIter = StaticLinkedListIterator<'l, T>

Which kind of iterator are we turning this into?

Important traits for StaticLinkedListIterator<'a, T>

impl<'a, T> Iterator for StaticLinkedListIterator<'a, T> where
    T: Clear,  type Item = &'a T;

fn into_iter(self) -> StaticLinkedListIterator<'l, T>

Creates an iterator from a value.