Struct BTreeSlice 

pub struct BTreeSlice<'a, A>(/* private fields */);

View of a slice as a balanced binary tree.

Each node is labelled with a slice. Leaves contain single elements.

The tree is right-associative: &[a b c] becomes &[a] (&[b] &[c]).

The tree is empty if the slice is empty.

Implementations

impl<'a, A> BTreeSlice<'a, A>

pub fn from_slice(slice: &'a [A]) -> Self

View the slice as a balanced binary tree.

impl<A: Clone> BTreeSlice<'_, A>

pub fn fold<F>(self, f: F) -> Option<A>

where F: Fn(A, A) -> A,

Fold the tree in post order, using the binary function f.

Returns None if the tree is empty.

See

Opposite of Unfolder::unfold.

Trait Implementations

impl<'a, A: Clone> Clone for BTreeSlice<'a, A>

fn clone(&self) -> BTreeSlice<'a, A>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a, A: Copy> Copy for BTreeSlice<'a, A>

impl<'a, A: Debug> Debug for BTreeSlice<'a, A>

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

Formats the value using the given formatter.

impl<'a, A: Eq> Eq for BTreeSlice<'a, A>

impl<'a, A: Hash> Hash for BTreeSlice<'a, A>

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<'a, A: PartialEq> PartialEq for BTreeSlice<'a, A>

fn eq(&self, other: &BTreeSlice<'a, A>) -> 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<'a, A: PartialEq> StructuralPartialEq for BTreeSlice<'a, A>

impl<A: Clone> TreeLike for BTreeSlice<'_, A>

fn as_node(&self) -> Tree<Self>

Interpret the node as an abstract node.

fn n_children(&self) -> usize

Accessor for the number of children this node has.

fn nth_child(&self, n: usize) -> Option<Self>

Accessor for the nth child of the node, if a child with that index exists.

fn pre_order_iter(self) -> PreOrderIter<Self>

Obtains an iterator of all the nodes rooted at the node, in pre-order.

fn verbose_pre_order_iter(self) -> VerbosePreOrderIter<Self>

Obtains a verbose iterator of all the nodes rooted at the DAG, in pre-order.

fn post_order_iter(self) -> PostOrderIter<Self>

Obtains an iterator of all the nodes rooted at the DAG, in post order.