Enum ListTree 

pub enum ListTree<T> {
    Empty,
    Leaf(T),
    Node(Rc<ListNode<T>>),
}

Variants

Empty

Leaf(T)

Node(Rc<ListNode<T>>)

Implementations

impl<T: Clone> ListTree<T>

pub fn empty() -> Self

pub fn singleton(value: T) -> Self

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn view(&self) -> ListView<T>

pub fn index(&self, index: usize) -> Option<T>

pub fn index_range(&self, start: usize, end: usize) -> Option<Self>

pub fn splice(&self, start: usize, end: usize, insert: Self) -> Option<Self>

pub fn split_at(&self, index: usize) -> Option<(Self, Self)>

pub fn concat(left: Self, right: Self) -> Self

pub fn black_height(&self) -> usize

pub fn is_red_black_well_formed(&self) -> bool

pub fn from_items(items: impl IntoIterator<Item = T>) -> Self

pub fn to_vec(&self) -> Vec<T>

Trait Implementations

impl<T: Clone> Clone for ListTree<T>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for ListTree<T>

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

Formats the value using the given formatter.

impl<T: PartialEq> PartialEq for ListTree<T>

fn eq(&self, other: &ListTree<T>) -> 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<T: Eq> Eq for ListTree<T>

impl<T> StructuralPartialEq for ListTree<T>