Struct rin::blender::scene_data::idtree::NodeIdMut[][src]

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

Implementations

impl<'a, T> NodeIdMut<'a, T> where
    T: 'a, 
[src]

pub fn id(&self) -> NodeId[src]

pub fn append<N>(self, new_node: N) -> NodeIdMut<'a, T> where
    N: Into<NodeId>, 
[src]

pub fn append_new(self, new_data: T) -> NodeIdMut<'a, T>[src]

pub fn prepend<N>(self, new_node: N) -> NodeIdMut<'a, T> where
    N: Into<NodeId>, 
[src]

pub fn prepend_new(self, new_data: T) -> NodeIdMut<'a, T>[src]

pub fn insert_after<N>(self, new_node: N) -> NodeIdMut<'a, T> where
    N: Into<NodeId>, 
[src]

pub fn insert_after_new(self, new_data: T) -> NodeIdMut<'a, T>[src]

pub fn insert_before<N>(self, new_node: N) -> NodeIdMut<'a, T> where
    N: Into<NodeId>, 
[src]

pub fn insert_before_new(self, new_data: T) -> NodeIdMut<'a, T>[src]

pub fn ancestors(self) -> Ancestors<'a, T>

Notable traits for Ancestors<'a, T>

impl<'a, T> Iterator for Ancestors<'a, T> type Item = NodeId;
[src]

Return an iterator of references to this node and its ancestors.

Call .next().unwrap() once on the iterator to skip the node itself.

pub fn preceding_siblings(self) -> PrecedingSiblings<'a, T>

Notable traits for PrecedingSiblings<'a, T>

impl<'a, T> Iterator for PrecedingSiblings<'a, T> type Item = NodeId;
[src]

Return an iterator of references to this node and the siblings before it.

Call .next().unwrap() once on the iterator to skip the node itself.

pub fn following_siblings(self) -> FollowingSiblings<'a, T>

Notable traits for FollowingSiblings<'a, T>

impl<'a, T> Iterator for FollowingSiblings<'a, T> type Item = NodeId;
[src]

Return an iterator of references to this node and the siblings after it.

Call .next().unwrap() once on the iterator to skip the node itself.

pub fn children(self) -> Children<'a, T>

Notable traits for Children<'a, T>

impl<'a, T> Iterator for Children<'a, T> type Item = NodeId;
[src]

Return an iterator of references to this node’s children.

pub fn reverse_children(self) -> ReverseChildren<'a, T>

Notable traits for ReverseChildren<'a, T>

impl<'a, T> Iterator for ReverseChildren<'a, T> type Item = NodeId;
[src]

Return an iterator of references to this node’s children, in reverse order.

pub fn descendants(self) -> Descendants<'a, T>

Notable traits for Descendants<'a, T>

impl<'a, T> Iterator for Descendants<'a, T> type Item = NodeId;
[src]

Return an iterator of references to this node and its descendants, in tree order.

Parent nodes appear before the descendants. Call .next().unwrap() once on the iterator to skip the node itself.

pub fn traverse(self) -> Traverse<'a, T>

Notable traits for Traverse<'a, T>

impl<'a, T> Iterator for Traverse<'a, T> type Item = NodeEdge<NodeId>;
[src]

Return an iterator of references to this node and its descendants, in tree order.

pub fn reverse_traverse(self) -> ReverseTraverse<'a, T>

Notable traits for ReverseTraverse<'a, T>

impl<'a, T> Iterator for ReverseTraverse<'a, T> type Item = NodeEdge<NodeId>;
[src]

Return an iterator of references to this node and its descendants, in tree order.

Methods from Deref<Target = Node<T>>

pub fn id(&self) -> NodeId[src]

pub fn data(&self) -> &T[src]

pub fn data_mut(&mut self) -> &mut T[src]

pub fn parent(&self) -> Option<NodeId>[src]

Return the ID of the parent node, unless this node is the root of the tree.

pub fn first_child(&self) -> Option<NodeId>[src]

Return the ID of the first child of this node, unless it has no child.

pub fn last_child(&self) -> Option<NodeId>[src]

Return the ID of the last child of this node, unless it has no child.

pub fn previous_sibling(&self) -> Option<NodeId>[src]

Return the ID of the previous sibling of this node, unless it is a first child.

pub fn next_sibling(&self) -> Option<NodeId>[src]

Return the ID of the previous sibling of this node, unless it is a first child.

Trait Implementations

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

type Target = Node<T>

The resulting type after dereferencing.

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

impl<'a, T> From<NodeIdMut<'a, T>> for NodeId[src]

Auto Trait Implementations

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

impl<'a, T> Send for NodeIdMut<'a, T> where
    T: Send

impl<'a, T> Sync for NodeIdMut<'a, T> where
    T: Sync

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

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

Blanket Implementations

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

impl<T> Any for T where
    T: Any
[src]

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

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

impl<T> Downcast for T where
    T: Any
[src]

impl<T> DowncastSync for T where
    T: Any + Send + Sync
[src]

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

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

impl<V> IntoPnt<V> for V[src]

impl<V> IntoVec<V> for V[src]

impl<T> Pointable for T[src]

type Init = T

The type for initializers.

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

type Output = T

Should always be Self

impl<SS, SP> SupersetOf<SS> for SP where
    SS: SubsetOf<SP>, 
[src]

impl<SS, SP> SupersetOf<SS> for SP where
    SS: SubsetOf<SP>, 
[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.

impl<V, T> VZip<V> for T where
    V: MultiLane<T>, 
[src]