Struct trees::linked::singly::onto_iter::Subnode[−][src]

pub struct Subnode<'a, T: 'a> { /* fields omitted */ }

Wrapper of Node for allowing modification of parent or sib links. Any Node that is the root of some Tree is impossible to be Subnode.

Implementations

impl<'a, T: 'a> Subnode<'a, T>[src]

pub fn insert_before(&mut self, sib: Tree<T>)[src]

Insert sib tree before self. The newly inserted node will not be iterated over by the currently running iterator.

Examples

use trees::linked::singly::tr;
let mut tree = tr(0) /tr(1)/tr(2);
for mut sub in tree.onto_iter() { sub.insert_before( tr(3) ); }
assert_eq!( tree.to_string(), "0( 3 1 3 2 )" );

pub fn insert_after(&mut self, sib: Tree<T>)[src]

Insert sib tree after self. The newly inserted node will not be iterated over by the currently running iterator.

Examples

use trees::linked::singly::tr;
let mut tree = tr(0) /tr(1)/tr(2);
for mut sub in tree.onto_iter() { sub.insert_after( tr(3) ); }
assert_eq!( tree.to_string(), "0( 1 3 2 3 )" );

pub fn depart(self) -> Tree<T>[src]

The subtree departs from its parent and becomes an indepent Tree.

Examples

use trees::linked::singly::{tr,fr};

let mut forest = -tr(1)-tr(2)-tr(3);
//for sub in forest.onto_iter() { sub.depart(); }
//forest.onto_iter().next().unwrap().depart();
//assert_eq!( forest, fr() );

Methods from Deref<Target = Node<T>>

pub fn is_leaf(&self) -> bool[src]

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

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

Examples

use trees::linked::singly::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>[src]

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

Examples

use trees::linked::singly::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(&self) -> Option<&Node<T>>[src]

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

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

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

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

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

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

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

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

Adds the tree as the first child.

Examples

use trees::linked::singly::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>)[src]

Add the tree as the last child

Examples

use trees::linked::singly::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>>[src]

Remove and return the first child

Examples

use trees::linked::singly::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 prepend(&mut self, forest: Forest<T>)[src]

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

Examples

use trees::linked::singly::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>)[src]

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

Examples

use trees::linked::singly::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>ⓘ

Notable traits for Iter<'a, T>

impl<'a, T: 'a> Iterator for Iter<'a, T> type Item = &'a Node<T>;
[src]

Provides a forward iterator over child Nodes

Examples

use trees::linked::singly::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 iter_mut<'a, 's: 'a>(&'s mut self) -> IterMut<'a, T>ⓘ

Notable traits for IterMut<'a, T>

impl<'a, T: 'a> Iterator for IterMut<'a, T> type Item = &'a mut Node<T>;
[src]

Provides a forward iterator over child Nodes with mutable references.

Examples

use trees::linked::singly::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 onto_iter<'a, 's: 'a>(&'s mut self) -> OntoIter<'a, T>ⓘ

Notable traits for OntoIter<'a, T>

impl<'a, T: 'a> Iterator for OntoIter<'a, T> type Item = Subnode<'a, T>;
[src]

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>>>[src]

Provides a forward iterator in a breadth-first manner

Examples

use trees::{bfs,Size};
use trees::linked::singly::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: 0 }},
    bfs::Visit{ data: &1, size: Size{ degree: 2, node_cnt: 0 }},
    bfs::Visit{ data: &4, size: Size{ degree: 2, node_cnt: 0 }},
    bfs::Visit{ data: &2, size: Size{ degree: 0, node_cnt: 0 }},
    bfs::Visit{ data: &3, size: Size{ degree: 0, node_cnt: 0 }},
    bfs::Visit{ data: &5, size: Size{ degree: 0, node_cnt: 0 }},
    bfs::Visit{ data: &6, size: Size{ degree: 0, node_cnt: 0 }},
]);

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

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

Examples

use trees::{bfs,Size};
use trees::linked::singly::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: 0 }},
    bfs::Visit{ data: &mut 1, size: Size{ degree: 2, node_cnt: 0 }},
    bfs::Visit{ data: &mut 4, size: Size{ degree: 2, node_cnt: 0 }},
    bfs::Visit{ data: &mut 2, size: Size{ degree: 0, node_cnt: 0 }},
    bfs::Visit{ data: &mut 3, size: Size{ degree: 0, node_cnt: 0 }},
    bfs::Visit{ data: &mut 5, size: Size{ degree: 0, node_cnt: 0 }},
    bfs::Visit{ data: &mut 6, size: Size{ degree: 0, node_cnt: 0 }},
]);

Trait Implementations

impl<'a, T: 'a> Deref for Subnode<'a, T>[src]

type Target = Node<T>

The resulting type after dereferencing.

impl<'a, T: 'a> DerefMut for Subnode<'a, T>[src]

Auto Trait Implementations

impl<'a, T> RefUnwindSafe for Subnode<'a, T> where
    T: RefUnwindSafe, 

impl<'a, T> !Send for Subnode<'a, T>

impl<'a, T> !Sync for Subnode<'a, T>

impl<'a, T> Unpin for Subnode<'a, T>

impl<'a, T> !UnwindSafe for Subnode<'a, T>

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized, [src]

impl<T> Borrow<T> for T where
    T: ?Sized, [src]

impl<T> BorrowMut<T> for T where
    T: ?Sized, [src]

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, [src]

impl<T, U> TryFrom<U> for T where
    U: Into<T>, [src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, [src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.