Struct let_engine::prelude::Node
source · pub struct Node<T> {
pub object: T,
pub parent: Option<Weak<Mutex<Node<Box<dyn GameObject>>>>>,
pub rigid_body_parent: RigidBodyParent,
pub children: Vec<Arc<Mutex<Node<T>>>>,
}Expand description
Node structure for the layer.
Fields§
§object: T§parent: Option<Weak<Mutex<Node<Box<dyn GameObject>>>>>§rigid_body_parent: RigidBodyParent§children: Vec<Arc<Mutex<Node<T>>>>Implementations§
source§impl Node<Box<dyn GameObject>>
impl Node<Box<dyn GameObject>>
sourcepub fn update_children_position(&mut self, parent_pos: Transform)
pub fn update_children_position(&mut self, parent_pos: Transform)
Iterates to the last child to update all public position held by the Node.
sourcepub fn remove_child(&mut self, object: &NObject)
pub fn remove_child(&mut self, object: &NObject)
Searches for the given object to be removed from the list of children.
sourcepub fn remove_children(
&mut self,
objects: &mut HashMap<usize, NObject>,
rigid_bodies: &mut HashMap<usize, NObject>
)
pub fn remove_children( &mut self, objects: &mut HashMap<usize, NObject>, rigid_bodies: &mut HashMap<usize, NObject> )
Removes all children and their children from the layer.
sourcepub fn end_transform(&self) -> Transform
pub fn end_transform(&self) -> Transform
Returns the public transform of this objects.
Auto Trait Implementations§
impl<T> !RefUnwindSafe for Node<T>
impl<T> Send for Node<T>where T: Send,
impl<T> Sync for Node<T>where T: Send + Sync,
impl<T> Unpin for Node<T>where T: Unpin,
impl<T> !UnwindSafe for Node<T>
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere T: Any,
§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Convert
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can
then be further downcast into Box<ConcreteType> where ConcreteType implements Trait.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Convert
Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be
further downcast into Rc<ConcreteType> where ConcreteType implements Trait.§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.