Struct rapier2d::geometry::NarrowPhase
source · [−]pub struct NarrowPhase { /* private fields */ }
Expand description
The narrow-phase responsible for computing precise contact information between colliders.
Implementations
pub fn with_query_dispatcher<D>(d: D) -> Self where
D: 'static + PersistentQueryDispatcher<ContactManifoldData, ContactData>,
pub fn with_query_dispatcher<D>(d: D) -> Self where
D: 'static + PersistentQueryDispatcher<ContactManifoldData, ContactData>,
Creates a new empty narrow-phase with a custom query dispatcher.
pub fn query_dispatcher(
&self
) -> &dyn PersistentQueryDispatcher<ContactManifoldData, ContactData>
pub fn query_dispatcher(
&self
) -> &dyn PersistentQueryDispatcher<ContactManifoldData, ContactData>
The query dispatcher used by this narrow-phase to select the right collision-detection algorithms depending of the shape types.
The contact graph containing all contact pairs and their contact information.
The intersection graph containing all intersection pairs and their intersection information.
All the contacts involving the given collider.
It is strongly recommended to use the NarrowPhase::contacts_with
method instead. This
method can be used if the generation number of the collider handle isn’t known.
pub fn contacts_with<'a>(
&self,
collider: ColliderHandle
) -> impl Iterator<Item = &ContactPair>
pub fn contacts_with<'a>(
&self,
collider: ColliderHandle
) -> impl Iterator<Item = &ContactPair>
All the contacts involving the given collider.
pub fn intersections_with_unknown_gen(
&self,
collider: u32
) -> impl Iterator<Item = (ColliderHandle, ColliderHandle, bool)> + '_
pub fn intersections_with_unknown_gen(
&self,
collider: u32
) -> impl Iterator<Item = (ColliderHandle, ColliderHandle, bool)> + '_
All the intersections involving the given collider.
It is strongly recommended to use the NarrowPhase::intersections_with
method instead.
This method can be used if the generation number of the collider handle isn’t known.
pub fn intersections_with(
&self,
collider: ColliderHandle
) -> impl Iterator<Item = (ColliderHandle, ColliderHandle, bool)> + '_
pub fn intersections_with(
&self,
collider: ColliderHandle
) -> impl Iterator<Item = (ColliderHandle, ColliderHandle, bool)> + '_
All the intersections involving the given collider.
pub fn contact_pair_unknown_gen(
&self,
collider1: u32,
collider2: u32
) -> Option<&ContactPair>
pub fn contact_pair_unknown_gen(
&self,
collider1: u32,
collider2: u32
) -> Option<&ContactPair>
The contact pair involving two specific colliders.
It is strongly recommended to use the NarrowPhase::contact_pair
method instead. This
method can be used if the generation number of the collider handle isn’t known.
If this returns None
, there is no contact between the two colliders.
If this returns Some
, then there may be a contact between the two colliders. Check the
result [ContactPair::has_any_active_collider
] method to see if there is an actual contact.
pub fn contact_pair(
&self,
collider1: ColliderHandle,
collider2: ColliderHandle
) -> Option<&ContactPair>
pub fn contact_pair(
&self,
collider1: ColliderHandle,
collider2: ColliderHandle
) -> Option<&ContactPair>
The contact pair involving two specific colliders.
If this returns None
, there is no contact between the two colliders.
If this returns Some
, then there may be a contact between the two colliders. Check the
result [ContactPair::has_any_active_collider
] method to see if there is an actual contact.
The intersection pair involving two specific colliders.
It is strongly recommended to use the NarrowPhase::intersection_pair
method instead. This
method can be used if the generation number of the collider handle isn’t known.
If this returns None
or Some(false)
, then there is no intersection between the two colliders.
If this returns Some(true)
, then there may be an intersection between the two colliders.
pub fn intersection_pair(
&self,
collider1: ColliderHandle,
collider2: ColliderHandle
) -> Option<bool>
pub fn intersection_pair(
&self,
collider1: ColliderHandle,
collider2: ColliderHandle
) -> Option<bool>
The intersection pair involving two specific colliders.
If this returns None
or Some(false)
, then there is no intersection between the two colliders.
If this returns Some(true)
, then there may be an intersection between the two colliders.
All the contact pairs maintained by this narrow-phase.
pub fn intersection_pairs(
&self
) -> impl Iterator<Item = (ColliderHandle, ColliderHandle, bool)> + '_
pub fn intersection_pairs(
&self
) -> impl Iterator<Item = (ColliderHandle, ColliderHandle, bool)> + '_
All the intersection pairs maintained by this narrow-phase.
pub fn handle_user_changes<Bodies, Colliders>(
&mut self,
islands: Option<&mut IslandManager>,
modified_colliders: &[ColliderHandle],
removed_colliders: &[ColliderHandle],
colliders: &mut Colliders,
bodies: &mut Bodies,
events: &dyn EventHandler
) where
Bodies: ComponentSetMut<RigidBodyActivation> + ComponentSet<RigidBodyType> + ComponentSetMut<RigidBodyIds>,
Colliders: ComponentSet<ColliderChanges> + ComponentSet<ColliderType> + ComponentSet<ColliderFlags> + ComponentSetOption<ColliderParent>,
pub fn handle_user_changes<Bodies, Colliders>(
&mut self,
islands: Option<&mut IslandManager>,
modified_colliders: &[ColliderHandle],
removed_colliders: &[ColliderHandle],
colliders: &mut Colliders,
bodies: &mut Bodies,
events: &dyn EventHandler
) where
Bodies: ComponentSetMut<RigidBodyActivation> + ComponentSet<RigidBodyType> + ComponentSetMut<RigidBodyIds>,
Colliders: ComponentSet<ColliderChanges> + ComponentSet<ColliderType> + ComponentSet<ColliderFlags> + ComponentSetOption<ColliderParent>,
Maintain the narrow-phase internal state by taking collider removal into account.
Trait Implementations
Auto Trait Implementations
impl !RefUnwindSafe for NarrowPhase
impl Send for NarrowPhase
impl Sync for NarrowPhase
impl Unpin for NarrowPhase
impl !UnwindSafe for NarrowPhase
Blanket Implementations
Mutably borrows from an owned value. Read more
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
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
Convert &Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s. Read more
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
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
Checks if self
is actually part of its subset T
(and can be converted to it).
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
The inclusion map: converts self
to the equivalent element of its superset.