pub struct GjkResult {
pub intersecting: bool,
pub distance: Real,
pub closest_a: [Real; 3],
pub closest_b: [Real; 3],
}Expand description
Result of a GJK query.
Fields§
§intersecting: boolWhether the shapes intersect (minimum distance is 0).
distance: RealClosest distance between the shapes (0 if intersecting).
closest_a: [Real; 3]Closest point on shape A (only valid when not intersecting).
closest_b: [Real; 3]Closest point on shape B (only valid when not intersecting).
Trait Implementations§
Auto Trait Implementations§
impl Freeze for GjkResult
impl RefUnwindSafe for GjkResult
impl Send for GjkResult
impl Sync for GjkResult
impl Unpin for GjkResult
impl UnsafeUnpin for GjkResult
impl UnwindSafe for GjkResult
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§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 moreSource§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).Source§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.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.