Enum PersistentList 

pub enum PersistentList {
    Empty,
    Cons {
        head: Value,
        tail: Arc<PersistentList>,
        count: usize,
    },
}

An immutable singly-linked list. Structural sharing via Arc-backed tails.

Clojure’s PersistentList is the primary seq type; it supports O(1) cons, first, and rest. count is cached on each node so it is also O(1).

Variants

Empty

Cons

Fields

head: Value

tail: Arc<PersistentList>

count: usize

Implementations

impl PersistentList

pub fn empty() -> Self

The canonical empty list.

pub fn cons(head: Value, tail: Arc<PersistentList>) -> Self

Prepend head to tail. O(1).

pub fn count(&self) -> usize

Number of elements. O(1).

pub fn is_empty(&self) -> bool

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

First element, or None if empty.

pub fn rest(&self) -> Arc<PersistentList>

The rest of the list after the first element. Returns an empty list if called on an empty or single-element list.

pub fn iter(&self) -> ListIter<'_>

Iterate over elements from head to tail.

Trait Implementations

impl Clone for PersistentList

fn clone(&self) -> PersistentList

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PersistentList

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

Formats the value using the given formatter.

impl FromIterator<Value> for PersistentList

fn from_iter<I: IntoIterator<Item = Value>>(iter: I) -> Self

Creates a value from an iterator.

impl PartialEq for PersistentList

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Trace for PersistentList

fn trace(&self, visitor: &mut MarkVisitor)