Struct fplist::PersistentList

pub struct PersistentList<T> { /* fields omitted */ }

An immutable singly-linked list.

Methods

impl<T> PersistentList<T>

pub const fn new() -> Self

Create a new empty list. Does not allocate.

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

Retrieve the current element.

Returns None in an empty list.

pub fn rest(&self) -> Self

Retrieve the next list in line.

Decreases the length by one unless it's the empty list.

Important traits for ListIter<'a, T>

impl<'a, T> Iterator for ListIter<'a, T> type Item = &'a T;

pub fn iter(&self) -> ListIter<T>

Provide an iterator to all of the elements in the list.

pub const fn len(&self) -> usize

Retrieve how many elements there are in total.

O(1)

pub const fn is_empty(&self) -> bool

Is the list empty?

pub fn take(&mut self) -> Self

Return an owned instance of this list, leaving an empty one in its place.

impl<T: Clone> PersistentList<T>

pub fn pop(self) -> Option<(T, Self)>

Split the list to its current element and the next succeeding list.

This will attempt to take ownership of the element, but if there are other existing references to it, its clone will be returned.

pub fn pfirst(self) -> Option<T>

Similar to first but tries to take ownership of the element if possible, otherwise clones it.

pub fn append(self, r: PersistentList<T>) -> PersistentList<T>

Merge this list's elements with another, creating a new list with all the elements combined.

Note: All of the elements from this list will have their ownership taken, or be cloned into the new list depending on the number of references to said elements.

The mergee list's elements will NOT be cloned; their memory will be shared in the new list!

impl<T: PartialEq, U> PersistentList<(T, U)>

pub fn assoq(&self, key: &T) -> Option<&U>

Find the value belonging to the provided key in this Association List.

Trait Implementations

impl<T> Default for PersistentList<T>

fn default() -> Self

Returns the "default value" for a type.

impl<T> Clone for PersistentList<T>

fn clone(&self) -> Self

Make a new copy of the list.

O(1)

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

Performs copy-assignment from source.

impl<T> Drop for PersistentList<T>

fn drop(&mut self)

Executes the destructor for this type.

impl<T: Clone> Extend<T> for PersistentList<T>

fn extend<It: IntoIterator<Item = T>>(&mut self, iter: It)

Extends a collection with the contents of an iterator.

impl<T: PartialEq> PartialEq<PersistentList<T>> for PersistentList<T>

fn eq(&self, other: &Self) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Self) -> bool

This method tests for !=.

impl<T: Clone> IntoIterator for PersistentList<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = OwnedListIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, T> IntoIterator for &'a PersistentList<T>

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = ListIter<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: Debug> Debug for PersistentList<T>

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<T: Display> Display for PersistentList<T>

fn fmt(&self, f: &mut Formatter) -> Result

Formats this list to a parenthesis representation.

A list of 1->2->3->() would result in the repr.: (1 2 3)

impl<T> FromIterator<T> for PersistentList<T>

fn from_iter<I: IntoIterator<Item = T>>(it: I) -> Self

Creates a value from an iterator.