Struct bevy_rapier3d::prelude::QueryPipelineColliderComponentsSet [−][src]
pub struct QueryPipelineColliderComponentsSet<'a, 'b, 'c>(pub &'c QueryPipelineColliderComponentsQuery<'a, 'b>);
Trait Implementations
impl<'a, 'b, 'c> ComponentSet<ColliderFlags> for QueryPipelineColliderComponentsSet<'a, 'b, 'c>
[src]
impl<'a, 'b, 'c> ComponentSet<ColliderFlags> for QueryPipelineColliderComponentsSet<'a, 'b, 'c>
[src]impl<'a, 'b, 'c> ComponentSet<ColliderPosition> for QueryPipelineColliderComponentsSet<'a, 'b, 'c>
[src]
impl<'a, 'b, 'c> ComponentSet<ColliderPosition> for QueryPipelineColliderComponentsSet<'a, 'b, 'c>
[src]impl<'a, 'b, 'c> ComponentSet<SharedShape> for QueryPipelineColliderComponentsSet<'a, 'b, 'c>
[src]
impl<'a, 'b, 'c> ComponentSet<SharedShape> for QueryPipelineColliderComponentsSet<'a, 'b, 'c>
[src]impl<'a, 'b, 'c> ComponentSetOption<ColliderFlags> for QueryPipelineColliderComponentsSet<'a, 'b, 'c>
[src]
impl<'a, 'b, 'c> ComponentSetOption<ColliderFlags> for QueryPipelineColliderComponentsSet<'a, 'b, 'c>
[src]fn get(&self, handle: Index) -> Option<&ColliderFlags>
[src]
fn get(&self, handle: Index) -> Option<&ColliderFlags>
[src]Get the element associated to the given handle
, if there is one.
impl<'a, 'b, 'c> ComponentSetOption<ColliderPosition> for QueryPipelineColliderComponentsSet<'a, 'b, 'c>
[src]
impl<'a, 'b, 'c> ComponentSetOption<ColliderPosition> for QueryPipelineColliderComponentsSet<'a, 'b, 'c>
[src]fn get(&self, handle: Index) -> Option<&ColliderPosition>
[src]
fn get(&self, handle: Index) -> Option<&ColliderPosition>
[src]Get the element associated to the given handle
, if there is one.
impl<'a, 'b, 'c> ComponentSetOption<SharedShape> for QueryPipelineColliderComponentsSet<'a, 'b, 'c>
[src]
impl<'a, 'b, 'c> ComponentSetOption<SharedShape> for QueryPipelineColliderComponentsSet<'a, 'b, 'c>
[src]fn get(&self, handle: Index) -> Option<&ColliderShape>
[src]
fn get(&self, handle: Index) -> Option<&ColliderShape>
[src]Get the element associated to the given handle
, if there is one.
Auto Trait Implementations
impl<'a, 'b, 'c> !RefUnwindSafe for QueryPipelineColliderComponentsSet<'a, 'b, 'c>
impl<'a, 'b, 'c> Send for QueryPipelineColliderComponentsSet<'a, 'b, 'c>
impl<'a, 'b, 'c> Sync for QueryPipelineColliderComponentsSet<'a, 'b, 'c>
impl<'a, 'b, 'c> Unpin for QueryPipelineColliderComponentsSet<'a, 'b, 'c> where
'a: 'c,
'b: 'c,
'a: 'c,
'b: 'c,
impl<'a, 'b, 'c> !UnwindSafe for QueryPipelineColliderComponentsSet<'a, 'b, 'c>
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<'a, T, A, B, C, D, E, F> BundleSet<'a, (&'a A, &'a B, &'a C, &'a D, &'a E, &'a F)> for T where
T: ComponentSet<A> + ComponentSet<B> + ComponentSet<C> + ComponentSet<D> + ComponentSet<E> + ComponentSet<F>,
[src]
impl<'a, T, A, B, C, D, E, F> BundleSet<'a, (&'a A, &'a B, &'a C, &'a D, &'a E, &'a F)> for T where
T: ComponentSet<A> + ComponentSet<B> + ComponentSet<C> + ComponentSet<D> + ComponentSet<E> + ComponentSet<F>,
[src]impl<'a, T, A, B, C, D, E> BundleSet<'a, (&'a A, &'a B, &'a C, &'a D, &'a E)> for T where
T: ComponentSet<A> + ComponentSet<B> + ComponentSet<C> + ComponentSet<D> + ComponentSet<E>,
[src]
impl<'a, T, A, B, C, D, E> BundleSet<'a, (&'a A, &'a B, &'a C, &'a D, &'a E)> for T where
T: ComponentSet<A> + ComponentSet<B> + ComponentSet<C> + ComponentSet<D> + ComponentSet<E>,
[src]impl<'a, T, A, B, C, D> BundleSet<'a, (&'a A, &'a B, &'a C, &'a D)> for T where
T: ComponentSet<A> + ComponentSet<B> + ComponentSet<C> + ComponentSet<D>,
[src]
impl<'a, T, A, B, C, D> BundleSet<'a, (&'a A, &'a B, &'a C, &'a D)> for T where
T: ComponentSet<A> + ComponentSet<B> + ComponentSet<C> + ComponentSet<D>,
[src]impl<'a, T, A, B, C> BundleSet<'a, (&'a A, &'a B, &'a C)> for T where
T: ComponentSet<A> + ComponentSet<B> + ComponentSet<C>,
[src]
impl<'a, T, A, B, C> BundleSet<'a, (&'a A, &'a B, &'a C)> for T where
T: ComponentSet<A> + ComponentSet<B> + ComponentSet<C>,
[src]impl<'a, T, A, B> BundleSet<'a, (&'a A, &'a B)> for T where
T: ComponentSet<A> + ComponentSet<B>,
[src]
impl<'a, T, A, B> BundleSet<'a, (&'a A, &'a B)> for T where
T: ComponentSet<A> + ComponentSet<B>,
[src]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<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,