Struct oxygengine_physics_2d::prelude::ncollide2d::pipeline::broad_phase::BroadPhaseProxyHandle
source · pub struct BroadPhaseProxyHandle(pub usize);
Tuple Fields§
§0: usize
Implementations§
source§impl BroadPhaseProxyHandle
impl BroadPhaseProxyHandle
pub fn invalid() -> BroadPhaseProxyHandle
pub fn is_invalid(&self) -> bool
pub fn uid(&self) -> usize
Trait Implementations§
source§impl<'a, 'b, N, BV, T> BestFirstVisitor<N, BroadPhaseProxyHandle, BV> for RayIntersectionCostFnVisitor<'a, 'b, N, T, BV>where
N: RealField + Copy,
BV: BoundingVolume<N> + RayCast<N> + PointQuery<N> + Any + Send + Sync + Clone,
T: Any + Send + Sync + Clone,
impl<'a, 'b, N, BV, T> BestFirstVisitor<N, BroadPhaseProxyHandle, BV> for RayIntersectionCostFnVisitor<'a, 'b, N, T, BV>where N: RealField + Copy, BV: BoundingVolume<N> + RayCast<N> + PointQuery<N> + Any + Send + Sync + Clone, T: Any + Send + Sync + Clone,
§type Result = (T, RayIntersection<N>)
type Result = (T, RayIntersection<N>)
The result of a best-first traversal.
source§fn visit(
&mut self,
best_cost_so_far: N,
bv: &BV,
data: Option<&BroadPhaseProxyHandle>
) -> BestFirstVisitStatus<N, <RayIntersectionCostFnVisitor<'a, 'b, N, T, BV> as BestFirstVisitor<N, BroadPhaseProxyHandle, BV>>::Result>
fn visit( &mut self, best_cost_so_far: N, bv: &BV, data: Option<&BroadPhaseProxyHandle> ) -> BestFirstVisitStatus<N, <RayIntersectionCostFnVisitor<'a, 'b, N, T, BV> as BestFirstVisitor<N, BroadPhaseProxyHandle, BV>>::Result>
Compute the next action to be taken by the best-first-search after visiting a node containing the given bounding volume.
source§impl Clone for BroadPhaseProxyHandle
impl Clone for BroadPhaseProxyHandle
source§fn clone(&self) -> BroadPhaseProxyHandle
fn clone(&self) -> BroadPhaseProxyHandle
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moresource§impl Debug for BroadPhaseProxyHandle
impl Debug for BroadPhaseProxyHandle
source§impl Hash for BroadPhaseProxyHandle
impl Hash for BroadPhaseProxyHandle
source§impl Ord for BroadPhaseProxyHandle
impl Ord for BroadPhaseProxyHandle
source§fn cmp(&self, other: &BroadPhaseProxyHandle) -> Ordering
fn cmp(&self, other: &BroadPhaseProxyHandle) -> Ordering
1.21.0 · source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere Self: Sized,
Compares and returns the maximum of two values. Read more
source§impl PartialEq<BroadPhaseProxyHandle> for BroadPhaseProxyHandle
impl PartialEq<BroadPhaseProxyHandle> for BroadPhaseProxyHandle
source§fn eq(&self, other: &BroadPhaseProxyHandle) -> bool
fn eq(&self, other: &BroadPhaseProxyHandle) -> bool
This method tests for
self
and other
values to be equal, and is used
by ==
.source§impl PartialOrd<BroadPhaseProxyHandle> for BroadPhaseProxyHandle
impl PartialOrd<BroadPhaseProxyHandle> for BroadPhaseProxyHandle
source§fn partial_cmp(&self, other: &BroadPhaseProxyHandle) -> Option<Ordering>
fn partial_cmp(&self, other: &BroadPhaseProxyHandle) -> Option<Ordering>
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self
and other
) and is used by the <=
operator. Read moreimpl Copy for BroadPhaseProxyHandle
impl Eq for BroadPhaseProxyHandle
impl StructuralEq for BroadPhaseProxyHandle
impl StructuralPartialEq for BroadPhaseProxyHandle
Auto Trait Implementations§
impl RefUnwindSafe for BroadPhaseProxyHandle
impl Send for BroadPhaseProxyHandle
impl Sync for BroadPhaseProxyHandle
impl Unpin for BroadPhaseProxyHandle
impl UnwindSafe for BroadPhaseProxyHandle
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, Global>) -> Box<dyn Any, Global>
fn into_any(self: Box<T, Global>) -> Box<dyn Any, 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
.§fn into_any_rc(self: Rc<T, Global>) -> Rc<dyn Any, Global>
fn into_any_rc(self: Rc<T, Global>) -> Rc<dyn Any, Global>
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<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
source§impl<Q, K> Equivalent<K> for Qwhere
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Qwhere Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,
source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.§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.