Struct evco::gp::tree::BoxTree

pub struct BoxTree<T>(_)
 where
    T: Tree;

Box Wrapper for implementations of Tree.

Methods

impl<T> BoxTree<T> where
    T: Tree, 

fn inner(self) -> T

Extract the internal Tree.

fn count_nodes(&mut self) -> usize

Count the number of nodes below this node in the tree.

fn get(&mut self, target_index: usize) -> Option<T>

Get a clone of a particular value.

fn map<F>(&mut self, f: F) where
    F: FnMut(&mut T, usize, usize), 

Traverse the tree with the ability to mutate nodes in-place.

The callback receives a mutable pointer to the current node, the 0-based current iteration count, and the 0-based current depth in the tree.

fn map_while<F>(&mut self, f: F) where
    F: FnMut(&mut T, usize, usize) -> bool, 

Traverse the tree until the function returns false.

The callback receives a mutable pointer to the current node, the 0-based current iteration count, and the 0-based current depth in the tree.

The callback returns a bool. If false the loop terminates.

fn fold<F, V>(&mut self, value: V, f: F) -> V where
    F: FnMut(V, &mut T, usize, usize) -> V, 

Traverse the tree building up a return value, with the ability to mutate nodes in-place.

The callback receives the value being built up, a mutable pointer to the current node, the 0-based current iteration count, and the 0-based current depth in the tree.

fn fold_while<F, V>(&mut self, value: V, f: F) -> V where
    F: FnMut(V, &mut T, usize, usize) -> (bool, V), 

Traverse the tree building up a return value, with the ability to mutate nodes in-place.

The callback receives the value being built up, a mutable pointer to the current node, the 0-based current iteration count, and the 0-based current depth in the tree.

The callback returns a pair of (bool, fold_value). If false the loop terminates.

Trait Implementations

impl<T: Clone> Clone for BoxTree<T> where
    T: Tree, 

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: PartialEq> PartialEq for BoxTree<T> where
    T: Tree, 

fn eq(&self, __arg_0: &BoxTree<T>) -> bool

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

fn ne(&self, __arg_0: &BoxTree<T>) -> bool

This method tests for !=.

impl<T: Eq> Eq for BoxTree<T> where
    T: Tree, 

impl<T> Debug for BoxTree<T> where
    T: Tree, 

Make BoxTree invisible in Debug output. At the cost of a little invisibility this makes Trees far more readable.

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

Formats the value using the given formatter.

impl<T> Display for BoxTree<T> where
    T: Tree + Display, 

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

Formats the value using the given formatter.

impl<T> Deref for BoxTree<T> where
    T: Tree, 

type Target = T

The resulting type after dereferencing

fn deref(&self) -> &T

The method called to dereference a value

impl<T> DerefMut for BoxTree<T> where
    T: Tree, 

fn deref_mut(&mut self) -> &mut T

The method called to mutably dereference a value

impl<T> From<T> for BoxTree<T> where
    T: Tree, 

fn from(tree: T) -> BoxTree<T>

Performs the conversion.