Struct TreeNode

pub struct TreeNode<T> { /* private fields */ }

Implementations

impl<T> TreeNode<T>

pub fn new(val: T) -> Self

pub fn with_arity(val: T, arity: Arity) -> Self

pub fn with_children<N>(val: T, children: Vec<N>) -> Self

where N: Into<TreeNode<T>>,

pub fn is_leaf(&self) -> bool

pub fn add_child(&mut self, child: impl Into<TreeNode<T>>)

pub fn attach(self, other: impl Into<TreeNode<T>>) -> Self

pub fn children(&self) -> Option<&Vec<TreeNode<T>>>

pub fn children_mut(&mut self) -> Option<&mut Vec<TreeNode<T>>>

pub fn size(&self) -> usize

pub fn height(&self) -> usize

pub fn swap_subtrees( &mut self, other: &mut TreeNode<T>, self_idx: usize, other_idx: usize, )

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

Trait Implementations

impl<T> AsMut<TreeNode<T>> for Tree<T>

fn as_mut(&mut self) -> &mut TreeNode<T>

Converts this type into a mutable reference of the (usually inferred) input type.

impl<T> AsRef<TreeNode<T>> for Tree<T>

fn as_ref(&self) -> &TreeNode<T>

Converts this type into a shared reference of the (usually inferred) input type.

impl<T: Clone> Clone for TreeNode<T>

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T, V> Eval<[V], V> for TreeNode<T>

where T: Eval<[V], V>, V: Clone,

Implements the Reduce trait for TreeNode<T> where T is Eval<[V], V>. This is where the real work is done. It recursively evaluates the TreeNode and its children until it reaches a leaf node, at which point it applies the T’s eval fn to the input.

Because a Tree has only a single root node, this can only be used to return a single value. We assume here that each leaf can eval the incoming input - this is a safe and the only real logical assumption we can make.

fn eval(&self, input: &[V]) -> V

impl<T: Clone + Default> Factory<NodeType, TreeNode<T>> for NodeStore<T>

fn new_instance(&self, input: NodeType) -> TreeNode<T>

impl<T> Gene for TreeNode<T>

where T: Clone + PartialEq + Default,

type Allele = T

fn allele(&self) -> &Self::Allele

Get the allele of the Gene. This is the value that the Gene represents or “expresses”.

fn new_instance(&self) -> Self

Create a new instance of the Gene.

fn with_allele(&self, allele: &Self::Allele) -> Self

Create a new Gene with the given allele.

impl<T> Into<Tree<T>> for TreeNode<T>

fn into(self) -> Tree<T>

Converts this type into the (usually inferred) input type.

impl<T> Into<TreeNode<Op<T>>> for Op<T>

fn into(self) -> TreeNode<Op<T>>

Converts this type into the (usually inferred) input type.

impl Into<TreeNode<String>> for String

fn into(self) -> TreeNode<String>

Converts this type into the (usually inferred) input type.

impl Into<TreeNode<bool>> for bool

fn into(self) -> TreeNode<bool>

Converts this type into the (usually inferred) input type.

impl Into<TreeNode<char>> for char

fn into(self) -> TreeNode<char>

Converts this type into the (usually inferred) input type.

impl Into<TreeNode<f64>> for f64

fn into(self) -> TreeNode<f64>

Converts this type into the (usually inferred) input type.

impl Into<TreeNode<i32>> for i32

fn into(self) -> TreeNode<i32>

Converts this type into the (usually inferred) input type.

impl Into<TreeNode<usize>> for usize

fn into(self) -> TreeNode<usize>

Converts this type into the (usually inferred) input type.

impl<T> Node for TreeNode<T>

type Value = T

fn value(&self) -> &Self::Value

fn node_type(&self) -> NodeType

fn arity(&self) -> Arity

impl<T: PartialEq> PartialEq for TreeNode<T>

fn eq(&self, other: &TreeNode<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> TreeIterator<T> for TreeNode<T>

Implement the TreeIterator trait for TreeNode

This allows for traversal of a single node and its children in pre-order, post-order, and breadth-first order.

fn iter_pre_order(&self) -> PreOrderIterator<'_, T>

fn iter_post_order(&self) -> PostOrderIterator<'_, T>

fn iter_breadth_first(&self) -> TreeBreadthFirstIterator<'_, T>

impl<T> Valid for TreeNode<T>

fn is_valid(&self) -> bool

impl<T> StructuralPartialEq for TreeNode<T>