Struct trees::linked::fully::tree::Tree

[+] Show declaration

pub struct Tree<T> { /* fields omitted */ }

[−] Expand description

A non-nullable tree

Implementations

impl<T> Tree<T>[−]

pub fn new(data: T) -> Self[−]

Creates a Tree with given data on heap.

pub fn root(&self) -> &Node<T>

pub fn root_mut(&mut self) -> &mut Node<T>

pub fn abandon(&mut self) -> Forest<T>[−]

Removes and returns the given Tree’s children.

Examples

use trees::linked::fully::tr;
let mut tree = tr(0) /tr(1)/tr(2);
assert_eq!( tree.abandon().to_string(), "( 1 2 )" );
assert_eq!( tree, tr(0) );

pub fn into_bfs(self) -> BfsTree<Splitted<IntoIter<T>>>[−]

Provides a forward iterator with owned data in a breadth-first manner

Examples

use trees::{bfs,Size};
use trees::linked::fully::tr;

let tree = tr(0) /( tr(1)/tr(2)/tr(3) ) /( tr(4)/tr(5)/tr(6) );
let visits = tree.into_bfs().iter.collect::<Vec<_>>();
assert_eq!( visits, vec![
    bfs::Visit{ data: 0, size: Size{ degree: 2, node_cnt: 7 }},
    bfs::Visit{ data: 1, size: Size{ degree: 2, node_cnt: 3 }},
    bfs::Visit{ data: 4, size: Size{ degree: 2, node_cnt: 3 }},
    bfs::Visit{ data: 2, size: Size{ degree: 0, node_cnt: 1 }},
    bfs::Visit{ data: 3, size: Size{ degree: 0, node_cnt: 1 }},
    bfs::Visit{ data: 5, size: Size{ degree: 0, node_cnt: 1 }},
    bfs::Visit{ data: 6, size: Size{ degree: 0, node_cnt: 1 }},
]);

Methods from Deref<Target = Node<T>>

pub fn is_leaf(&self) -> bool

pub fn degree(&self) -> usize[−]

Returns the number of subtrees in Forest.

Examples

use trees::linked::fully::tr;
let tree = tr(0) /( tr(1)/tr(2)/tr(3) ) /( tr(4)/tr(5)/tr(6) );
assert_eq!( tree.degree(), 2 );

pub fn node_count(&self) -> usize[−]

Returns the number of all subnodes in Forest.

Examples

use trees::linked::fully::tr;
let tree = tr(0) /( tr(1)/tr(2)/tr(3) ) /( tr(4)/tr(5)/tr(6) );
assert_eq!( tree.node_count(), 7 );

pub fn first(&self) -> Option<&Node<T>>[−]

Returns the first child of the forest, or None if it is empty.

pub fn forest(&self) -> &Forest<T>[−]

Returns the given Tree’s children as a borrowed Forest.

Examples

use trees::linked::fully::tr;
let mut tree = tr(0) /tr(1)/tr(2);
assert_eq!( tree.forest().to_string(), "( 1 2 )" );

pub fn forest_mut(&mut self) -> &mut Forest<T>[−]

Returns the given Tree’s children as a mutable borrowed Forest.

Examples

use trees::linked::fully::tr;
let mut tree = tr(0) /tr(1)/tr(2);
for child in tree.forest_mut().iter_mut() { child.data *= 10; }
assert_eq!( tree.to_string(), "0( 10 20 )" );

pub fn first_mut(&mut self) -> Option<&mut Node<T>>[−]

Returns a mutable pointer to the first child of the forest, or None if it is empty.

pub fn last(&self) -> Option<&Node<T>>[−]

Returns the last child of the forest, or None if it is empty.

pub fn last_mut(&mut self) -> Option<&mut Node<T>>[−]

Returns a mutable pointer to the last child of the forest, or None if it is empty.

pub fn parent(&self) -> Option<&Node<T>>[−]

Returns the parent node of this node, or None if it is a root node.

pub fn push_front(&mut self, tree: Tree<T>)[−]

Adds the tree as the first child.

Examples

use trees::linked::fully::tr;
let mut tree = tr(0);
tree.push_front( tr(1) );
assert_eq!( tree.to_string(), "0( 1 )" );
tree.push_front( tr(2) );
assert_eq!( tree.to_string(), "0( 2 1 )" );

pub fn push_back(&mut self, tree: Tree<T>)[−]

Add the tree as the last child

Examples

use trees::linked::fully::tr;
let mut tree = tr(0);
tree.push_back( tr(1) );
assert_eq!( tree.to_string(), "0( 1 )" );
tree.push_back( tr(2) );
assert_eq!( tree.to_string(), "0( 1 2 )" );

pub fn pop_front(&mut self) -> Option<Tree<T>>[−]

Remove and return the first child

Examples

use trees::linked::fully::tr;
let mut tree = tr(0) /tr(1)/tr(2);
assert_eq!( tree.pop_front(), Some( tr(1) ));
assert_eq!( tree.to_string(), "0( 2 )" );
assert_eq!( tree.pop_front(), Some( tr(2) ));
assert_eq!( tree.to_string(), "0" );

pub fn pop_back(&mut self) -> Option<Tree<T>>[−]

Remove and return the last child

Examples

use trees::linked::fully::tr;
let mut tree = tr(0) /tr(1)/tr(2);
assert_eq!( tree.pop_back(), Some( tr(2) ));
assert_eq!( tree.to_string(), "0( 1 )" );
assert_eq!( tree.pop_back(), Some( tr(1) ));
assert_eq!( tree.to_string(), "0" );

pub fn prepend(&mut self, forest: Forest<T>)[−]

Add all the forest’s trees at front of children list

Examples

use trees::linked::fully::tr;
let mut tree = tr(0);
tree.prepend( -tr(1)-tr(2) );
assert_eq!( tree.to_string(), "0( 1 2 )" );
tree.prepend( -tr(3)-tr(4) );
assert_eq!( tree.to_string(), "0( 3 4 1 2 )" );

pub fn append(&mut self, forest: Forest<T>)[−]

Add all the forest’s trees at back of children list

Examples

use trees::linked::fully::tr;
let mut tree = tr(0);
tree.append( -tr(1)-tr(2) );
assert_eq!( tree.to_string(), "0( 1 2 )" );
tree.append( -tr(3)-tr(4) );
assert_eq!( tree.to_string(), "0( 1 2 3 4 )" );

pub fn iter<'a, 's: 'a>(&'s self) -> Iter<'a, T>[−]

Provides a forward iterator over child Nodes

Examples

use trees::linked::fully::tr;

let tree = tr(0);
assert_eq!( tree.iter().next(), None );

let tree = tr(0) /tr(1)/tr(2);
let mut iter = tree.iter();
assert_eq!( iter.next(), Some( tr(1).root() ));
assert_eq!( iter.next(), Some( tr(2).root() ));
assert_eq!( iter.next(), None );
assert_eq!( iter.next(), None );

pub fn children<'a, 's: 'a>(&'s self) -> Iter<'a, T>

👎 Deprecated since 0.2.0:

please use iter instead

pub fn iter_mut<'a, 's: 'a>(&'s mut self) -> IterMut<'a, T>[−]

Provides a forward iterator over child Nodes with mutable references.

Examples

use trees::linked::fully::tr;

let mut tree = tr(0);
assert_eq!( tree.iter_mut().next(), None );

let mut tree = tr(0) /tr(1)/tr(2);
for child in tree.iter_mut() { child.data *= 10; }
assert_eq!( tree.to_string(), "0( 10 20 )" );

pub fn children_mut<'a, 's: 'a>(&'s mut self) -> IterMut<'a, T>

👎 Deprecated since 0.2.0:

please use iter_mut instead

pub fn onto_iter<'a, 's: 'a>(&'s mut self) -> OntoIter<'a, T>[−]

Provide an iterator over Node’s Subnodes for insert/remove at any position. See Subnode’s document for more.

pub fn bfs(&self) -> BfsTree<Splitted<Iter<'_, T>>>[−]

Provides a forward iterator in a breadth-first manner

Examples

use trees::{bfs,Size};
use trees::linked::fully::tr;

let tree = tr(0) /( tr(1)/tr(2)/tr(3) ) /( tr(4)/tr(5)/tr(6) );
let visits = tree.root().bfs().iter.collect::<Vec<_>>();
assert_eq!( visits, vec![
    bfs::Visit{ data: &0, size: Size{ degree: 2, node_cnt: 7 }},
    bfs::Visit{ data: &1, size: Size{ degree: 2, node_cnt: 3 }},
    bfs::Visit{ data: &4, size: Size{ degree: 2, node_cnt: 3 }},
    bfs::Visit{ data: &2, size: Size{ degree: 0, node_cnt: 1 }},
    bfs::Visit{ data: &3, size: Size{ degree: 0, node_cnt: 1 }},
    bfs::Visit{ data: &5, size: Size{ degree: 0, node_cnt: 1 }},
    bfs::Visit{ data: &6, size: Size{ degree: 0, node_cnt: 1 }},
]);

pub fn bfs_mut(&mut self) -> BfsTree<Splitted<IterMut<'_, T>>>[−]

Provides a forward iterator with mutable references in a breadth-first manner

Examples

use trees::{bfs,Size};
use trees::linked::fully::tr;

let mut tree = tr(0) /( tr(1)/tr(2)/tr(3) ) /( tr(4)/tr(5)/tr(6) );
let visits = tree.root_mut().bfs_mut().iter.collect::<Vec<_>>();
assert_eq!( visits, vec![
    bfs::Visit{ data: &mut 0, size: Size{ degree: 2, node_cnt: 7 }},
    bfs::Visit{ data: &mut 1, size: Size{ degree: 2, node_cnt: 3 }},
    bfs::Visit{ data: &mut 4, size: Size{ degree: 2, node_cnt: 3 }},
    bfs::Visit{ data: &mut 2, size: Size{ degree: 0, node_cnt: 1 }},
    bfs::Visit{ data: &mut 3, size: Size{ degree: 0, node_cnt: 1 }},
    bfs::Visit{ data: &mut 5, size: Size{ degree: 0, node_cnt: 1 }},
    bfs::Visit{ data: &mut 6, size: Size{ degree: 0, node_cnt: 1 }},
]);

Trait Implementations

impl<T> Borrow<Forest<T>> for Tree<T>[+]

[+] Show hidden undocumented items

fn borrow(&self) -> &Forest<T>[−]

Immutably borrows from an owned value.

impl<T> Borrow<Node<T>> for Tree<T>[+]

[+] Show hidden undocumented items

fn borrow(&self) -> &Node<T>[−]

Immutably borrows from an owned value.

impl<T> BorrowMut<Forest<T>> for Tree<T>[+]

[+] Show hidden undocumented items

fn borrow_mut(&mut self) -> &mut Forest<T>[−]

Mutably borrows from an owned value.

impl<T> BorrowMut<Node<T>> for Tree<T>[+]

[+] Show hidden undocumented items

fn borrow_mut(&mut self) -> &mut Node<T>[−]

Mutably borrows from an owned value.

impl<T: Clone> Clone for Tree<T>[+]

[+] Show hidden undocumented items

fn clone(&self) -> Self[−]

Returns a copy of the value.

pub fn clone_from(&mut self, source: &Self)[−]

Performs copy-assignment from source.

impl<T: Debug> Debug for Tree<T>[+]

[+] Show hidden undocumented items

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

Formats the value using the given formatter.

impl<T> Deref for Tree<T>[+]

[+] Show hidden undocumented items

type Target = Node<T>

The resulting type after dereferencing.

fn deref(&self) -> &Node<T>[−]

Dereferences the value.

impl<T> DerefMut for Tree<T>[+]

[+] Show hidden undocumented items

fn deref_mut(&mut self) -> &mut Node<T>[−]

Mutably dereferences the value.

impl<T: Display> Display for Tree<T>[+]

[+] Show hidden undocumented items

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

Formats the value using the given formatter.

impl<'a, T: Clone> Div<&'a Forest<T>> for Tree<T>[+]

[+] Show hidden undocumented items

type Output = Tree<T>

The resulting type after applying the / operator.

fn div(self, rhs: &'a Forest<T>) -> Tree<T>[−]

Performs the / operation.

impl<'a, T: Clone> Div<&'a Forest<T>> for &'a Tree<T>[+]

[+] Show hidden undocumented items

type Output = Tree<T>

The resulting type after applying the / operator.

fn div(self, rhs: &'a Forest<T>) -> Tree<T>[−]

Performs the / operation.

impl<'a, T: Clone> Div<&'a Tree<T>> for Tree<T>[+]

[+] Show hidden undocumented items

type Output = Tree<T>

The resulting type after applying the / operator.

fn div(self, rhs: &'a Tree<T>) -> Tree<T>[−]

Performs the / operation.

impl<'a, T: Clone> Div<&'a Tree<T>> for &'a Tree<T>[+]

[+] Show hidden undocumented items

type Output = Tree<T>

The resulting type after applying the / operator.

fn div(self, rhs: Self) -> Tree<T>[−]

Performs the / operation.

impl<T> Div<()> for Tree<T>[+]

[+] Show hidden undocumented items

type Output = Tree<T>

The resulting type after applying the / operator.

fn div(self, _rhs: ()) -> Tree<T>[−]

Performs the / operation.

impl<'a, T: Clone> Div<()> for &'a Tree<T>[+]

[+] Show hidden undocumented items

type Output = Tree<T>

The resulting type after applying the / operator.

fn div(self, _rhs: ()) -> Tree<T>[−]

Performs the / operation.

impl<T> Div<Forest<T>> for Tree<T>[+]

[+] Show hidden undocumented items

type Output = Tree<T>

The resulting type after applying the / operator.

fn div(self, rhs: Forest<T>) -> Tree<T>[−]

Performs the / operation.

impl<'a, T: Clone> Div<Forest<T>> for &'a Tree<T>[+]

[+] Show hidden undocumented items

type Output = Tree<T>

The resulting type after applying the / operator.

fn div(self, rhs: Forest<T>) -> Tree<T>[−]

Performs the / operation.

impl<T> Div<Tree<T>> for Tree<T>[+]

[+] Show hidden undocumented items

type Output = Tree<T>

The resulting type after applying the / operator.

fn div(self, rhs: Tree<T>) -> Tree<T>[−]

Performs the / operation.

impl<'a, T: Clone> Div<Tree<T>> for &'a Tree<T>[+]

[+] Show hidden undocumented items

type Output = Tree<T>

The resulting type after applying the / operator.

fn div(self, rhs: Tree<T>) -> Tree<T>[−]

Performs the / operation.

impl<T> Drop for Tree<T>[+]

[+] Show hidden undocumented items

fn drop(&mut self)[−]

Executes the destructor for this type.

impl<T: Eq> Eq for Tree<T>

impl<T> Extend<Tree<T>> for Forest<T>[+]

[+] Show hidden undocumented items

fn extend<I: IntoIterator<Item = Tree<T>>>(&mut self, iter: I)[−]

Extends a collection with the contents of an iterator.

pub fn extend_one(&mut self, item: A)[−]

🔬 This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

pub fn extend_reserve(&mut self, additional: usize)[−]

🔬 This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<T> Extend<Tree<T>> for Node<T>[+]

[+] Show hidden undocumented items

fn extend<I: IntoIterator<Item = Tree<T>>>(&mut self, iter: I)[−]

Extends a collection with the contents of an iterator.

pub fn extend_one(&mut self, item: A)[−]

🔬 This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

pub fn extend_reserve(&mut self, additional: usize)[−]

🔬 This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<T> From<Tree<T>> for TreeWalk<T>[+]

[+] Show hidden undocumented items

fn from(tree: Tree<T>) -> Self[−]

Performs the conversion.

impl<T> FromIterator<Tree<T>> for Forest<T>[+]

[+] Show hidden undocumented items

fn from_iter<I: IntoIterator<Item = Tree<T>>>(iter: I) -> Self[−]

Creates a value from an iterator.

impl<T: Hash> Hash for Tree<T>[+]

[+] Show hidden undocumented items

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

Feeds this value into the given Hasher.

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

Feeds a slice of this type into the given Hasher.

impl<T> Into<Tree<T>> for TreeWalk<T>[+]

[+] Show hidden undocumented items

fn into(self) -> Tree<T>[−]

Performs the conversion.

impl<T> IntoIterator for Tree<T>[+]

[+] Show hidden undocumented items

type Item = Tree<T>

The type of the elements being iterated over.

type IntoIter = IntoIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> IntoIter<T>[−]

Creates an iterator from a value.

impl<T> Neg for Tree<T>[+]

[+] Show hidden undocumented items

type Output = Forest<T>

The resulting type after applying the - operator.

fn neg(self) -> Forest<T>[−]

Performs the unary - operation.

impl<'a, T: Clone> Neg for &'a Tree<T>[+]

[+] Show hidden undocumented items

type Output = Forest<T>

The resulting type after applying the - operator.

fn neg(self) -> Forest<T>[−]

Performs the unary - operation.

impl<T: Ord> Ord for Tree<T>[+]

[+] Show hidden undocumented items

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

This method returns an Ordering between self and other.

[+] Expand attributes

#[must_use]pub fn max(self, other: Self) -> Self[−]

Compares and returns the maximum of two values.

[+] Expand attributes

#[must_use]pub fn min(self, other: Self) -> Self[−]

Compares and returns the minimum of two values.

[+] Expand attributes

#[must_use]pub fn clamp(self, min: Self, max: Self) -> Self[−]

Restrict a value to a certain interval.

impl<T: PartialEq> PartialEq<Tree<T>> for Tree<T>[+]

[+] Show hidden undocumented items

fn eq(&self, other: &Self) -> bool[−]

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

fn ne(&self, other: &Self) -> bool[−]

This method tests for !=.

impl<T: PartialOrd> PartialOrd<Tree<T>> for Tree<T>[+]

[+] Show hidden undocumented items

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

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

[+] Expand attributes

#[must_use]pub fn lt(&self, other: &Rhs) -> bool[−]

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

[+] Expand attributes

#[must_use]pub fn le(&self, other: &Rhs) -> bool[−]

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

[+] Expand attributes

#[must_use]pub fn gt(&self, other: &Rhs) -> bool[−]

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

[+] Expand attributes

#[must_use]pub 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: Send> Send for Tree<T>

impl<T> Split for Tree<T>[+]

[+] Show hidden undocumented items

type Item = T

type Iter = IntoIter<T>

fn split(self) -> (T, IntoIter<T>, u32)

impl<'a, T: Clone> Sub<&'a Tree<T>> for Tree<T>[+]

[+] Show hidden undocumented items

type Output = Forest<T>

The resulting type after applying the - operator.

fn sub(self, rhs: &'a Tree<T>) -> Forest<T>[−]

Performs the - operation.

impl<'a, T: Clone> Sub<&'a Tree<T>> for &'a Tree<T>[+]

[+] Show hidden undocumented items

type Output = Forest<T>

The resulting type after applying the - operator.

fn sub(self, rhs: Self) -> Forest<T>[−]

Performs the - operation.

impl<'a, T: Clone> Sub<&'a Tree<T>> for Forest<T>[+]

[+] Show hidden undocumented items

type Output = Forest<T>

The resulting type after applying the - operator.

fn sub(self, rhs: &'a Tree<T>) -> Self[−]

Performs the - operation.

impl<'a, 'b, T: Clone> Sub<&'b Tree<T>> for &'a Forest<T>[+]

[+] Show hidden undocumented items

type Output = Forest<T>

The resulting type after applying the - operator.

fn sub(self, rhs: &'b Tree<T>) -> Forest<T>[−]

Performs the - operation.

impl<T> Sub<Tree<T>> for Tree<T>[+]

[+] Show hidden undocumented items

type Output = Forest<T>

The resulting type after applying the - operator.

fn sub(self, rhs: Self) -> Forest<T>[−]

Performs the - operation.

impl<'a, T: Clone> Sub<Tree<T>> for &'a Tree<T>[+]

[+] Show hidden undocumented items

type Output = Forest<T>

The resulting type after applying the - operator.

fn sub(self, rhs: Tree<T>) -> Forest<T>[−]

Performs the - operation.

impl<T> Sub<Tree<T>> for Forest<T>[+]

[+] Show hidden undocumented items

type Output = Forest<T>

The resulting type after applying the - operator.

fn sub(self, rhs: Tree<T>) -> Self[−]

Performs the - operation.

impl<'a, T: Clone> Sub<Tree<T>> for &'a Forest<T>[+]

[+] Show hidden undocumented items

type Output = Forest<T>

The resulting type after applying the - operator.

fn sub(self, rhs: Tree<T>) -> Forest<T>[−]

Performs the - operation.

impl<T: Sync> Sync for Tree<T>