Struct bevy_rapier3d::prelude::JointSet [−][src]
pub struct JointSet { /* fields omitted */ }
Expand description
A set of joints that can be handled by a physics World
.
Implementations
impl JointSet
[src]
impl JointSet
[src]pub fn joint_graph(&self) -> &InteractionGraph<RigidBodyHandle, Joint>
[src]
pub fn joint_graph(&self) -> &InteractionGraph<RigidBodyHandle, Joint>
[src]Retrieve the joint graph where edges are joints and nodes are rigid body handles.
pub fn contains(&self, handle: JointHandle) -> bool
[src]
pub fn contains(&self, handle: JointHandle) -> bool
[src]Is the given joint handle valid?
pub fn get(&self, handle: JointHandle) -> Option<&Joint>
[src]
pub fn get(&self, handle: JointHandle) -> Option<&Joint>
[src]Gets the joint with the given handle.
pub fn get_mut(&mut self, handle: JointHandle) -> Option<&mut Joint>
[src]
pub fn get_mut(&mut self, handle: JointHandle) -> Option<&mut Joint>
[src]Gets a mutable reference to the joint with the given handle.
pub fn get_unknown_gen(&self, i: u32) -> Option<(&Joint, JointHandle)>
[src]
pub fn get_unknown_gen(&self, i: u32) -> Option<(&Joint, JointHandle)>
[src]Gets the joint with the given handle without a known generation.
This is useful when you know you want the joint at position i
but
don’t know what is its current generation number. Generation numbers are
used to protect from the ABA problem because the joint position i
are recycled between two insertion and a removal.
Using this is discouraged in favor of self.get(handle)
which does not
suffer form the ABA problem.
pub fn get_unknown_gen_mut(
&mut self,
i: u32
) -> Option<(&mut Joint, JointHandle)>
[src]
pub fn get_unknown_gen_mut(
&mut self,
i: u32
) -> Option<(&mut Joint, JointHandle)>
[src]Gets a mutable reference to the joint with the given handle without a known generation.
This is useful when you know you want the joint at position i
but
don’t know what is its current generation number. Generation numbers are
used to protect from the ABA problem because the joint position i
are recycled between two insertion and a removal.
Using this is discouraged in favor of self.get_mut(handle)
which does not
suffer form the ABA problem.
pub fn iter(&self) -> impl Iterator<Item = (JointHandle, &Joint)>
[src]
pub fn iter(&self) -> impl Iterator<Item = (JointHandle, &Joint)>
[src]Iterates through all the joint on this set.
pub fn iter_mut(&mut self) -> impl Iterator<Item = (JointHandle, &mut Joint)>
[src]
pub fn iter_mut(&mut self) -> impl Iterator<Item = (JointHandle, &mut Joint)>
[src]Iterates mutably through all the joint on this set.
pub fn insert<J>(
&mut self,
bodies: &mut impl ComponentSetMut<RigidBodyIds>,
body1: RigidBodyHandle,
body2: RigidBodyHandle,
joint_params: J
) -> JointHandle where
J: Into<JointParams>,
[src]
pub fn insert<J>(
&mut self,
bodies: &mut impl ComponentSetMut<RigidBodyIds>,
body1: RigidBodyHandle,
body2: RigidBodyHandle,
joint_params: J
) -> JointHandle where
J: Into<JointParams>,
[src]Inserts a new joint into this set and retrieve its handle.
pub fn remove<Bodies>(
&mut self,
handle: JointHandle,
islands: &mut IslandManager,
bodies: &mut Bodies,
wake_up: bool
) -> Option<Joint> where
Bodies: ComponentSetMut<RigidBodyActivation> + ComponentSet<RigidBodyType> + ComponentSetMut<RigidBodyIds>,
[src]
pub fn remove<Bodies>(
&mut self,
handle: JointHandle,
islands: &mut IslandManager,
bodies: &mut Bodies,
wake_up: bool
) -> Option<Joint> where
Bodies: ComponentSetMut<RigidBodyActivation> + ComponentSet<RigidBodyType> + ComponentSetMut<RigidBodyIds>,
[src]Removes a joint from this set.
If wake_up
is set to true
, then the bodies attached to this joint will be
automatically woken up.
Trait Implementations
Auto Trait Implementations
impl RefUnwindSafe for JointSet
impl Send for JointSet
impl Sync for JointSet
impl Unpin for JointSet
impl UnwindSafe for JointSet
Blanket Implementations
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]pub fn borrow_mut(&mut self) -> &mut T
[src]
pub fn borrow_mut(&mut self) -> &mut T
[src]Mutably borrows from an owned value. Read more
impl<T> Downcast for T where
T: Any,
impl<T> Downcast for T where
T: Any,
pub fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
pub fn into_any(self: Box<T, Global>) -> Box<dyn Any + 'static, Global>
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
. Read more
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
pub fn into_any_rc(self: Rc<T>) -> Rc<dyn Any + 'static>
Convert Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
. Read more
pub fn as_any(&self) -> &(dyn Any + 'static)
pub 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. Read more
pub fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
pub 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. Read more
impl<T> Instrument for T
[src]
impl<T> Instrument for T
[src]fn instrument(self, span: Span) -> Instrumented<Self>
[src]
fn instrument(self, span: Span) -> Instrumented<Self>
[src]Instruments this type with the provided Span
, returning an
Instrumented
wrapper. Read more
fn in_current_span(self) -> Instrumented<Self>
[src]
fn in_current_span(self) -> Instrumented<Self>
[src]impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Same<T> for T
impl<T> Same<T> for T
type Output = T
type Output = T
Should always be Self
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
pub fn to_subset(&self) -> Option<SS>
pub fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
pub fn is_in_subset(&self) -> bool
pub fn is_in_subset(&self) -> bool
Checks if self
is actually part of its subset T
(and can be converted to it).
pub fn to_subset_unchecked(&self) -> SS
pub fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
pub fn from_subset(element: &SS) -> SP
pub fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.
impl<T> ToOwned for T where
T: Clone,
[src]
impl<T> ToOwned for T where
T: Clone,
[src]type Owned = T
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn to_owned(&self) -> T
[src]Creates owned data from borrowed data, usually by cloning. Read more
pub fn clone_into(&self, target: &mut T)
[src]
pub fn clone_into(&self, target: &mut T)
[src]🔬 This is a nightly-only experimental API. (toowned_clone_into
)
recently added
Uses borrowed data to replace owned data, usually by cloning. Read more
impl<T> TypeData for T where
T: 'static + Send + Sync + Clone,
impl<T> TypeData for T where
T: 'static + Send + Sync + Clone,
pub fn clone_type_data(&self) -> Box<dyn TypeData + 'static, Global>
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
pub fn vzip(self) -> V
impl<T> Component for T where
T: 'static + Send + Sync,
T: 'static + Send + Sync,