Struct trees::linked::singly::tree::Tree [−][src]
A non-nullable tree
Implementations
impl<T> Tree<T>
[src]
pub fn new(data: T) -> Self
[src]
Creates a Tree
with given data on heap.
pub fn root(&self) -> &Node<T>
[src]
pub fn root_mut(&mut self) -> &mut Node<T>
[src]
pub fn abandon(&mut self) -> Forest<T>
[src]
Removes and returns the given Tree
’s children.
Examples
use trees::linked::singly::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>>>
[src]
Provides a forward iterator with owned data 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.into_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 }}, ]);
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>ⓘ
[src]
Provides a forward iterator over child Node
s
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>ⓘ
[src]
Provides a forward iterator over child Node
s 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>ⓘ
[src]
Provide an iterator over Node
’s Subnode
s 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<T> Borrow<Forest<T>> for Tree<T>
[src]
impl<T> Borrow<Node<T>> for Tree<T>
[src]
impl<T> BorrowMut<Forest<T>> for Tree<T>
[src]
fn borrow_mut(&mut self) -> &mut Forest<T>
[src]
impl<T> BorrowMut<Node<T>> for Tree<T>
[src]
fn borrow_mut(&mut self) -> &mut Node<T>
[src]
impl<T: Clone> Clone for Tree<T>
[src]
fn clone(&self) -> Self
[src]
pub fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl<T: Debug> Debug for Tree<T>
[src]
impl<T> Deref for Tree<T>
[src]
impl<T> DerefMut for Tree<T>
[src]
impl<T: Display> Display for Tree<T>
[src]
impl<'a, T: Clone> Div<&'a Forest<T>> for Tree<T>
[src]
type Output = Tree<T>
The resulting type after applying the /
operator.
fn div(self, rhs: &'a Forest<T>) -> Tree<T>
[src]
impl<'a, T: Clone> Div<&'a Forest<T>> for &'a Tree<T>
[src]
type Output = Tree<T>
The resulting type after applying the /
operator.
fn div(self, rhs: &'a Forest<T>) -> Tree<T>
[src]
impl<'a, T: Clone> Div<&'a Tree<T>> for Tree<T>
[src]
type Output = Tree<T>
The resulting type after applying the /
operator.
fn div(self, rhs: &'a Tree<T>) -> Tree<T>
[src]
impl<'a, T: Clone> Div<&'a Tree<T>> for &'a Tree<T>
[src]
type Output = Tree<T>
The resulting type after applying the /
operator.
fn div(self, rhs: Self) -> Tree<T>
[src]
impl<T> Div<()> for Tree<T>
[src]
type Output = Tree<T>
The resulting type after applying the /
operator.
fn div(self, _rhs: ()) -> Tree<T>
[src]
impl<'a, T: Clone> Div<()> for &'a Tree<T>
[src]
type Output = Tree<T>
The resulting type after applying the /
operator.
fn div(self, _rhs: ()) -> Tree<T>
[src]
impl<T> Div<Forest<T>> for Tree<T>
[src]
type Output = Tree<T>
The resulting type after applying the /
operator.
fn div(self, rhs: Forest<T>) -> Tree<T>
[src]
impl<'a, T: Clone> Div<Forest<T>> for &'a Tree<T>
[src]
type Output = Tree<T>
The resulting type after applying the /
operator.
fn div(self, rhs: Forest<T>) -> Tree<T>
[src]
impl<T> Div<Tree<T>> for Tree<T>
[src]
type Output = Tree<T>
The resulting type after applying the /
operator.
fn div(self, rhs: Tree<T>) -> Tree<T>
[src]
impl<'a, T: Clone> Div<Tree<T>> for &'a Tree<T>
[src]
type Output = Tree<T>
The resulting type after applying the /
operator.
fn div(self, rhs: Tree<T>) -> Tree<T>
[src]
impl<T> Drop for Tree<T>
[src]
impl<T: Eq> Eq for Tree<T>
[src]
impl<T> Extend<Tree<T>> for Forest<T>
[src]
fn extend<I: IntoIterator<Item = Tree<T>>>(&mut self, iter: I)
[src]
pub fn extend_one(&mut self, item: A)
[src]
pub fn extend_reserve(&mut self, additional: usize)
[src]
impl<T> Extend<Tree<T>> for Node<T>
[src]
fn extend<I: IntoIterator<Item = Tree<T>>>(&mut self, iter: I)
[src]
pub fn extend_one(&mut self, item: A)
[src]
pub fn extend_reserve(&mut self, additional: usize)
[src]
impl<T> From<Tree<T>> for TreeWalk<T>
[src]
impl<T> FromIterator<Tree<T>> for Forest<T>
[src]
fn from_iter<I: IntoIterator<Item = Tree<T>>>(iter: I) -> Self
[src]
impl<T: Hash> Hash for Tree<T>
[src]
fn hash<H: Hasher>(&self, state: &mut H)
[src]
pub fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
impl<T> Into<Tree<T>> for TreeWalk<T>
[src]
impl<T> IntoIterator for Tree<T>
[src]
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>ⓘ
[src]
impl<T> Neg for Tree<T>
[src]
type Output = Forest<T>
The resulting type after applying the -
operator.
fn neg(self) -> Forest<T>
[src]
impl<'a, T: Clone> Neg for &'a Tree<T>
[src]
type Output = Forest<T>
The resulting type after applying the -
operator.
fn neg(self) -> Forest<T>
[src]
impl<T: Ord> Ord for Tree<T>
[src]
fn cmp(&self, other: &Self) -> Ordering
[src]
#[must_use]pub fn max(self, other: Self) -> Self
1.21.0[src]
#[must_use]pub fn min(self, other: Self) -> Self
1.21.0[src]
#[must_use]pub fn clamp(self, min: Self, max: Self) -> Self
1.50.0[src]
impl<T: PartialEq> PartialEq<Tree<T>> for Tree<T>
[src]
impl<T: PartialOrd> PartialOrd<Tree<T>> for Tree<T>
[src]
fn partial_cmp(&self, other: &Self) -> Option<Ordering>
[src]
#[must_use]pub fn lt(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]pub fn le(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]pub fn gt(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]pub fn ge(&self, other: &Rhs) -> bool
1.0.0[src]
impl<T: Send> Send for Tree<T>
[src]
impl<T> Split for Tree<T>
[src]
impl<'a, T: Clone> Sub<&'a Tree<T>> for Tree<T>
[src]
type Output = Forest<T>
The resulting type after applying the -
operator.
fn sub(self, rhs: &'a Tree<T>) -> Forest<T>
[src]
impl<'a, T: Clone> Sub<&'a Tree<T>> for &'a Tree<T>
[src]
type Output = Forest<T>
The resulting type after applying the -
operator.
fn sub(self, rhs: Self) -> Forest<T>
[src]
impl<'a, T: Clone> Sub<&'a Tree<T>> for Forest<T>
[src]
type Output = Forest<T>
The resulting type after applying the -
operator.
fn sub(self, rhs: &'a Tree<T>) -> Self
[src]
impl<'a, 'b, T: Clone> Sub<&'b Tree<T>> for &'a Forest<T>
[src]
type Output = Forest<T>
The resulting type after applying the -
operator.
fn sub(self, rhs: &'b Tree<T>) -> Forest<T>
[src]
impl<T> Sub<Tree<T>> for Tree<T>
[src]
type Output = Forest<T>
The resulting type after applying the -
operator.
fn sub(self, rhs: Self) -> Forest<T>
[src]
impl<'a, T: Clone> Sub<Tree<T>> for &'a Tree<T>
[src]
type Output = Forest<T>
The resulting type after applying the -
operator.
fn sub(self, rhs: Tree<T>) -> Forest<T>
[src]
impl<T> Sub<Tree<T>> for Forest<T>
[src]
type Output = Forest<T>
The resulting type after applying the -
operator.
fn sub(self, rhs: Tree<T>) -> Self
[src]
impl<'a, T: Clone> Sub<Tree<T>> for &'a Forest<T>
[src]
type Output = Forest<T>
The resulting type after applying the -
operator.
fn sub(self, rhs: Tree<T>) -> Forest<T>
[src]
impl<T: Sync> Sync for Tree<T>
[src]
Auto Trait Implementations
impl<T> RefUnwindSafe for Tree<T> where
T: RefUnwindSafe,
T: RefUnwindSafe,
impl<T> Unpin for Tree<T>
impl<T> UnwindSafe for Tree<T> where
T: RefUnwindSafe + UnwindSafe,
T: RefUnwindSafe + UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
pub fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn clone_into(&self, target: &mut T)
[src]
impl<T> ToString for T where
T: Display + ?Sized,
[src]
T: Display + ?Sized,
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
pub fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,