Struct rin::ecs::NodeRefMut[][src]

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

Implementations

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

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

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

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

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

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

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

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

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

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

pub fn ancestors(self) -> Ancestors<'a, T>[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>[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>[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>[src]

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

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

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

pub fn descendants(self) -> Descendants<'a, T>[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 ancestors_ref(self) -> AncestorsRef<'a, T>[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_ref(self) -> PrecedingSiblingsRef<'a, T>[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_ref(self) -> FollowingSiblingsRef<'a, T>[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_ref(self) -> ChildrenRef<'a, T>[src]

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

pub fn reverse_children_ref(self) -> ReverseChildrenRef<'a, T>[src]

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

pub fn descendants_ref(self) -> DescendantsRef<'a, T>[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 descendants_mut(self) -> DescendantsMut<'a, T>[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>[src]

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

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

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

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

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

Trait Implementations

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

type Target = Node<T>

The resulting type after dereferencing.

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

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

Auto Trait Implementations

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

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

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

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

impl<'a, T> !UnwindSafe for NodeRefMut<'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]