Enum im_ternary_tree::TernaryTreeList

pub enum TernaryTreeList<T> {
    Empty,
    Tree(TernaryTree<T>),
}

wraps TerarnaryTreeList with support for empty

Variants

Empty

Tree(TernaryTree<T>)

Implementations

impl<T> TernaryTreeList<T>

where T: Clone + Display + Eq + PartialEq + Debug + Ord + PartialOrd + Hash,

pub fn is_empty(&self) -> bool

pub fn len(&self) -> usize

pub fn format_inline(&self) -> String

turn into a representation in triples, _ for holes

pub fn format_debug(&self) -> String

items in debug display

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

get element in list by reference PERF: recursive function is slower than iterative loop with Cell in bench(using usize), however, Calcit is heavy in cloning(reference though… according real practice), so here we still choose ref_get for speed in Calcit project.

pub fn find_index(&self, f: Arc<dyn Fn(&T) -> bool>) -> Option<i64>

find position of matched element in list(if exists)

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

find position of element

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

index of element from end, return 0 if found at last

pub fn eq_shape(&self, ys: &Self) -> bool

recursively check structure

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

unchecked get reference of element

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

unchecked get via go down the branch with a mutable loop this function is SLOWER compared to ref_get, not used by default

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

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

pub fn assoc(&self, idx: usize, item: T) -> Result<Self, String>

pub fn dissoc(&self, idx: usize) -> Result<Self, String>

pub fn rest(&self) -> Result<Self, String>

ternary tree operation of rest

pub fn butlast(&self) -> Result<Self, String>

pub fn insert(&self, idx: usize, item: T, after: bool) -> Result<Self, String>

pub fn assoc_before(&self, idx: usize, item: T) -> Result<Self, String>

pub fn assoc_after(&self, idx: usize, item: T) -> Result<Self, String>

pub fn force_inplace_balancing(&mut self) -> Result<(), String>

pub fn unshift(&self, item: T) -> Self

pub fn prepend(&self, item: T) -> Self

pub fn push(&self, item: T) -> Self

pub fn append(&self, item: T) -> Self

insert_after last element, this not optimzed for performance

pub fn push_right(&self, item: T) -> Self

optimized for amortized O(1) performance at best cases

pub fn push_left(&self, item: T) -> Self

optimized for amortized O(1) performance at best cases

pub fn drop_left(&self) -> Self

pub fn drop_left_shallow(&self) -> Self

optimized for amortized O(1) at best cases, but copies a lot

pub fn drop_right(&self) -> Self

pub fn split(self, idx: usize) -> (Self, Self)

split into 2 lists, either could be Empty notice if index is too large, (Self, Empty) is returned, not providing index out of bound error

pub fn drop_right_shallow(&self) -> Self

optimized for amortized O(1) at best cases, but copies a lot

pub fn concat(raw: &[TernaryTreeList<T>]) -> Self

pub fn check_structure(&self) -> Result<(), String>

pub fn slice(&self, start_idx: usize, end_idx: usize) -> Result<Self, String>

pub fn skip(&self, idx: usize) -> Result<Self, String>

pub fn take(&self, idx: usize) -> Result<Self, String>

pub fn reverse(&self) -> Self

pub fn map<V>(&self, f: Arc<dyn Fn(&T) -> V>) -> TernaryTreeList<V>

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

pub fn traverse(&self, f: &mut dyn FnMut(&T))

traverse all elements in list, use referenced value

pub fn traverse_result<S>( &self, f: &mut dyn FnMut(&T) -> Result<(), S> ) -> Result<(), S>

traverse elements in list, use referenced value, returns Ok when all elements are traversed

pub fn iter(&self) -> TernaryTreeListRefIntoIterator<'_, T>

Trait Implementations

impl<T: Clone> Clone for TernaryTreeList<T>

fn clone(&self) -> TernaryTreeList<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for TernaryTreeList<T>

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

Formats the value using the given formatter.

impl<T> Display for TernaryTreeList<T>

where T: Clone + Display + Eq + PartialEq + Debug + Ord + PartialOrd + Hash,

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

Formats the value using the given formatter.

impl<T, const N: usize> From<&[T; N]> for TernaryTreeList<T>

where T: Clone + Display + Eq + PartialEq + Debug + Ord + PartialOrd + Hash,

fn from(xs: &[T; N]) -> Self

Converts to this type from the input type.

impl<T> From<&Vec<T>> for TernaryTreeList<T>

where T: Clone + Display + Eq + PartialEq + Debug + Ord + PartialOrd + Hash,

fn from(xs: &Vec<T>) -> Self

Converts to this type from the input type.

impl<T> From<Vec<T>> for TernaryTreeList<T>

where T: Clone + Display + Eq + PartialEq + Debug + Ord + PartialOrd + Hash,

fn from(xs: Vec<T>) -> Self

Converts to this type from the input type.

impl<T> Hash for TernaryTreeList<T>

where T: Clone + Display + Eq + PartialEq + Debug + Ord + PartialOrd + Hash,

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T> Index<usize> for TernaryTreeList<T>

where T: Clone + Display + Eq + PartialEq + Debug + Ord + PartialOrd + Hash,

type Output = T

The returned type after indexing.

fn index<'b>(&self, idx: usize) -> &Self::Output

Performs the indexing (container[index]) operation.

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

where T: Clone + Display + Eq + PartialEq + Debug + Ord + PartialOrd + Hash,

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = TernaryTreeListRefIntoIterator<'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> Ord for TernaryTreeList<T>

where T: Clone + Display + Eq + PartialEq + Debug + Ord + PartialOrd + Hash,

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized + PartialOrd,

Restrict a value to a certain interval.

impl<T: Clone + Display + Eq + PartialEq + Debug + Ord + PartialOrd + Hash> PartialEq for TernaryTreeList<T>

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

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

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

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

impl<T> PartialOrd for TernaryTreeList<T>

where T: Clone + Display + Eq + PartialEq + Debug + Ord + PartialOrd + Hash,

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

This method tests less than (for self and other) and is used by the < operator.

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

This method tests less than or equal to (for self and other) and is used by the <= operator.

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

This method tests greater than (for self and other) and is used by the > operator.

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

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<T> Eq for TernaryTreeList<T>

where T: Clone + Display + Eq + PartialEq + Debug + Ord + PartialOrd + Hash,