[−][src]Struct oxymcts::Tree
Vec-backed ID-tree.
Always contains at least a root node.
Implementations
impl<T> Tree<T>
[src]
pub fn new(root: T) -> Tree<T>
[src]
Creates a tree with a root node.
pub fn with_capacity(root: T, capacity: usize) -> Tree<T>
[src]
Creates a tree with a root node and the specified capacity.
pub fn get(&self, id: NodeId) -> Option<NodeRef<'_, T>>
[src]
Returns a reference to the specified node.
pub fn get_mut(&mut self, id: NodeId) -> Option<NodeMut<'_, T>>
[src]
Returns a mutator of the specified node.
pub unsafe fn get_unchecked(&self, id: NodeId) -> NodeRef<'_, T>
[src]
Returns a reference to the specified node.
pub unsafe fn get_unchecked_mut(&mut self, id: NodeId) -> NodeMut<'_, T>
[src]
Returns a mutator of the specified node.
pub fn root(&self) -> NodeRef<'_, T>
[src]
Returns a reference to the root node.
pub fn root_mut(&mut self) -> NodeMut<'_, T>
[src]
Returns a mutator of the root node.
pub fn orphan(&mut self, value: T) -> NodeMut<'_, T>
[src]
Creates an orphan node.
impl<T> Tree<T>
[src]
pub fn values(&self) -> Values<'_, T>ⓘ
[src]
Returns an iterator over values in insert order.
pub fn values_mut(&mut self) -> ValuesMut<'_, T>ⓘ
[src]
Returns a mutable iterator over values in insert order.
pub fn nodes(&self) -> Nodes<'_, T>ⓘ
[src]
Returns an iterator over nodes in insert order.
Trait Implementations
impl<T> Clone for Tree<T> where
T: Clone,
[src]
T: Clone,
impl<T> Debug for Tree<T> where
T: Debug,
[src]
T: Debug,
impl<T> Eq for Tree<T> where
T: Eq,
[src]
T: Eq,
impl<T> Hash for Tree<T> where
T: Hash,
[src]
T: Hash,
fn hash<__H>(&self, state: &mut __H) where
__H: Hasher,
[src]
__H: Hasher,
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
impl<T> IntoIterator for Tree<T>
[src]
type Item = 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) -> <Tree<T> as IntoIterator>::IntoIter
[src]
impl<T> PartialEq<Tree<T>> for Tree<T> where
T: PartialEq<T>,
[src]
T: PartialEq<T>,
Auto Trait Implementations
impl<T> RefUnwindSafe for Tree<T> where
T: RefUnwindSafe,
T: RefUnwindSafe,
impl<T> Send for Tree<T> where
T: Send,
T: Send,
impl<T> Sync for Tree<T> where
T: Sync,
T: Sync,
impl<T> Unpin for Tree<T> where
T: Unpin,
T: Unpin,
impl<T> UnwindSafe for Tree<T> where
T: UnwindSafe,
T: 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,
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<I> IntoIterator for I where
I: Iterator,
[src]
I: Iterator,
type Item = <I as Iterator>::Item
The type of the elements being iterated over.
type IntoIter = I
Which kind of iterator are we turning this into?
fn into_iter(self) -> I
[src]
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
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.
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>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
V: MultiLane<T>,