Struct rin::blender::scene_data::idtree::NodeId [−][src]
pub struct NodeId { /* fields omitted */ }
A node identifier within a particular Arena
.
Implementations
impl NodeId
[src]
impl NodeId
[src]pub fn ancestors<T>(self, arena: &Arena<T>) -> Ancestors<'_, 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<T>(self, arena: &Arena<T>) -> PrecedingSiblings<'_, T>ⓘNotable traits for PrecedingSiblings<'a, T>
impl<'a, T> Iterator for PrecedingSiblings<'a, T> type Item = NodeId;
[src]
Notable traits for PrecedingSiblings<'a, T>
impl<'a, T> Iterator for PrecedingSiblings<'a, T> type Item = NodeId;
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<T>(self, arena: &Arena<T>) -> FollowingSiblings<'_, T>ⓘNotable traits for FollowingSiblings<'a, T>
impl<'a, T> Iterator for FollowingSiblings<'a, T> type Item = NodeId;
[src]
Notable traits for FollowingSiblings<'a, T>
impl<'a, T> Iterator for FollowingSiblings<'a, T> type Item = NodeId;
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<T>(self, arena: &Arena<T>) -> Children<'_, T>ⓘ
[src]
Return an iterator of references to this node’s children.
pub fn reverse_children<T>(self, arena: &Arena<T>) -> ReverseChildren<'_, T>ⓘNotable traits for ReverseChildren<'a, T>
impl<'a, T> Iterator for ReverseChildren<'a, T> type Item = NodeId;
[src]
Notable traits for ReverseChildren<'a, T>
impl<'a, T> Iterator for ReverseChildren<'a, T> type Item = NodeId;
Return an iterator of references to this node’s children, in reverse order.
pub fn descendants<T>(self, arena: &Arena<T>) -> Descendants<'_, T>ⓘNotable traits for Descendants<'a, T>
impl<'a, T> Iterator for Descendants<'a, T> type Item = NodeId;
[src]
Notable traits for Descendants<'a, T>
impl<'a, T> Iterator for Descendants<'a, T> type Item = NodeId;
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<T>(self, arena: &Arena<T>) -> Traverse<'_, T>ⓘ
[src]
Return an iterator of references to this node and its descendants, in tree order.
pub fn reverse_traverse<T>(self, arena: &Arena<T>) -> ReverseTraverse<'_, T>ⓘNotable traits for ReverseTraverse<'a, T>
impl<'a, T> Iterator for ReverseTraverse<'a, T> type Item = NodeEdge<NodeId>;
[src]
Notable traits for ReverseTraverse<'a, T>
impl<'a, T> Iterator for ReverseTraverse<'a, T> type Item = NodeEdge<NodeId>;
Return an iterator of references to this node and its descendants, in tree order.
pub fn detach<T>(self, arena: &mut Arena<T>) -> NodeIdMut<'_, T>
[src]
Detach a node from its parent and siblings. Children are not affected.
pub fn append<T>(
self,
new_child: NodeId,
arena: &mut Arena<T>
) -> NodeIdMut<'_, T>
[src]
self,
new_child: NodeId,
arena: &mut Arena<T>
) -> NodeIdMut<'_, T>
Append a new child to this node, after existing children.
pub fn append_new<T>(
self,
new_data: T,
arena: &mut Arena<T>
) -> NodeIdMut<'_, T>
[src]
self,
new_data: T,
arena: &mut Arena<T>
) -> NodeIdMut<'_, T>
pub fn prepend<T>(
self,
new_child: NodeId,
arena: &mut Arena<T>
) -> NodeIdMut<'_, T>
[src]
self,
new_child: NodeId,
arena: &mut Arena<T>
) -> NodeIdMut<'_, T>
Prepend a new child to this node, before existing children.
pub fn prepend_new<T>(
self,
new_data: T,
arena: &mut Arena<T>
) -> NodeIdMut<'_, T>
[src]
self,
new_data: T,
arena: &mut Arena<T>
) -> NodeIdMut<'_, T>
pub fn insert_after<T>(
self,
new_sibling: NodeId,
arena: &mut Arena<T>
) -> NodeIdMut<'_, T>
[src]
self,
new_sibling: NodeId,
arena: &mut Arena<T>
) -> NodeIdMut<'_, T>
Insert a new sibling after this node.
pub fn insert_after_new<T>(
self,
new_data: T,
arena: &mut Arena<T>
) -> NodeIdMut<'_, T>
[src]
self,
new_data: T,
arena: &mut Arena<T>
) -> NodeIdMut<'_, T>
pub fn insert_before<T>(
self,
new_sibling: NodeId,
arena: &mut Arena<T>
) -> NodeIdMut<'_, T>
[src]
self,
new_sibling: NodeId,
arena: &mut Arena<T>
) -> NodeIdMut<'_, T>
Insert a new sibling before this node.
pub fn insert_before_new<T>(
self,
new_data: T,
arena: &mut Arena<T>
) -> NodeIdMut<'_, T>
[src]
self,
new_data: T,
arena: &mut Arena<T>
) -> NodeIdMut<'_, T>
Trait Implementations
impl<'de> Deserialize<'de> for NodeId
[src]
impl<'de> Deserialize<'de> for NodeId
[src]pub fn deserialize<__D>(
__deserializer: __D
) -> Result<NodeId, <__D as Deserializer<'de>>::Error> where
__D: Deserializer<'de>,
[src]
__deserializer: __D
) -> Result<NodeId, <__D as Deserializer<'de>>::Error> where
__D: Deserializer<'de>,
impl Serialize for NodeId
[src]
impl Serialize for NodeId
[src]pub fn serialize<__S>(
&self,
__serializer: __S
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error> where
__S: Serializer,
[src]
&self,
__serializer: __S
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error> where
__S: Serializer,
impl Copy for NodeId
[src]
impl Eq for NodeId
[src]
impl StructuralEq for NodeId
[src]
impl StructuralPartialEq for NodeId
[src]
Auto Trait Implementations
impl RefUnwindSafe for NodeId
impl Send for NodeId
impl Sync for NodeId
impl Unpin for NodeId
impl UnwindSafe for NodeId
Blanket Implementations
impl<T> DowncastSync for T where
T: Any + Send + Sync,
[src]
impl<T> DowncastSync for T where
T: Any + Send + Sync,
[src]impl<Q, K> Equivalent<K> for Q where
K: Borrow<Q> + ?Sized,
Q: Eq + ?Sized,
[src]
impl<Q, K> Equivalent<K> for Q where
K: Borrow<Q> + ?Sized,
Q: Eq + ?Sized,
[src]pub fn equivalent(&self, key: &K) -> bool
[src]
impl<T> Serialize for T where
T: Serialize + ?Sized,
[src]
impl<T> Serialize for T where
T: Serialize + ?Sized,
[src]pub fn erased_serialize(
&self,
serializer: &mut dyn Serializer
) -> Result<Ok, Error>
[src]
&self,
serializer: &mut dyn Serializer
) -> Result<Ok, Error>
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
[src]
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
[src]pub fn to_subset(&self) -> Option<SS>
[src]
pub fn is_in_subset(&self) -> bool
[src]
pub fn to_subset_unchecked(&self) -> SS
[src]
pub fn from_subset(element: &SS) -> SP
[src]
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
[src]
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
[src]pub fn to_subset(&self) -> Option<SS>
[src]
pub fn is_in_subset(&self) -> bool
[src]
pub fn to_subset_unchecked(&self) -> SS
[src]
pub fn from_subset(element: &SS) -> SP
[src]
impl<T> DeserializeOwned for T where
T: for<'de> Deserialize<'de>,
[src]
T: for<'de> Deserialize<'de>,
impl<T> Slottable for T where
T: Copy,
[src]
T: Copy,