pub struct InstanceRef<'a, T>(/* private fields */)
where
T: Component;Expand description
A QueryData item which represents a reference to an Instance<T> and its associated Component.
This is analogous to a (Instance<T>, &T) query.
§Usage
If a Kind is also a component, it is often convenient to access the instance and component data together.
This type is designed to make these queries more ergonomic.
You may use this type as either a Query parameter, or access it from an EntityRef.
§Example
#[derive(Component)]
struct Apple {
freshness: f32,
}
impl Apple {
fn is_fresh(&self) -> bool {
self.freshness >= 0.5
}
}
// Query Access:
fn fresh_apples(query: Query<InstanceRef<Apple>>) -> Vec<Instance<Apple>> {
query.iter()
.filter_map(|apple| apple.is_fresh().then_some(apple.instance()))
.collect()
}
// Entity Access:
fn fresh_apples_world<'a>(world: &'a World) -> Vec<InstanceRef<'a, Apple>> {
world.try_query::<EntityRef>()
.unwrap()
.iter(&world)
.filter_map(|entity| InstanceRef::from_entity(entity))
.collect()
}
Implementations§
Source§impl<'a, T> InstanceRef<'a, T>where
T: Component,
impl<'a, T> InstanceRef<'a, T>where
T: Component,
Sourcepub fn from_entity(entity: EntityRef<'a>) -> Option<InstanceRef<'a, T>>
pub fn from_entity(entity: EntityRef<'a>) -> Option<InstanceRef<'a, T>>
Creates a new InstanceRef<T> from an EntityRef if it contains a given Component of type T.
Sourcepub unsafe fn from_entity_unchecked(entity: EntityRef<'a>) -> InstanceRef<'a, T>
pub unsafe fn from_entity_unchecked(entity: EntityRef<'a>) -> InstanceRef<'a, T>
Creates a new InstanceRef<T> from EntityRef without any validation.
§Safety
Assumes entity is a valid instance of kind T.
Trait Implementations§
Source§impl<T> AsRef<T> for InstanceRef<'_, T>where
T: Component,
impl<T> AsRef<T> for InstanceRef<'_, T>where
T: Component,
Source§impl<T> Clone for InstanceRef<'_, T>where
T: Component,
impl<T> Clone for InstanceRef<'_, T>where
T: Component,
Source§fn clone(&self) -> InstanceRef<'_, T>
fn clone(&self) -> InstanceRef<'_, T>
Returns a duplicate 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<T> ContainsInstance<T> for InstanceRef<'_, T>where
T: Component,
impl<T> ContainsInstance<T> for InstanceRef<'_, T>where
T: Component,
Source§impl<T> Deref for InstanceRef<'_, T>where
T: Component,
impl<T> Deref for InstanceRef<'_, T>where
T: Component,
Source§impl<T> From<&InstanceRef<'_, T>> for Instance<T>where
T: Component,
impl<T> From<&InstanceRef<'_, T>> for Instance<T>where
T: Component,
Source§fn from(item: &InstanceRef<'_, T>) -> Instance<T>
fn from(item: &InstanceRef<'_, T>) -> Instance<T>
Converts to this type from the input type.
Source§impl<T> From<InstanceRef<'_, T>> for Instance<T>where
T: Component,
impl<T> From<InstanceRef<'_, T>> for Instance<T>where
T: Component,
Source§fn from(item: InstanceRef<'_, T>) -> Instance<T>
fn from(item: InstanceRef<'_, T>) -> Instance<T>
Converts to this type from the input type.
Source§impl<T> PartialEq for InstanceRef<'_, T>where
T: Component,
impl<T> PartialEq for InstanceRef<'_, T>where
T: Component,
Source§impl<T> QueryData for InstanceRef<'_, T>where
T: Component,
impl<T> QueryData for InstanceRef<'_, T>where
T: Component,
Source§const IS_READ_ONLY: bool = true
const IS_READ_ONLY: bool = true
True if this query is read-only and may not perform mutable access.
Source§const IS_ARCHETYPAL: bool = <&'static T as QueryData>::IS_ARCHETYPAL
const IS_ARCHETYPAL: bool = <&'static T as QueryData>::IS_ARCHETYPAL
Returns true if (and only if) this query data relies strictly on archetypes to limit which
entities are accessed by the Query. Read more
Source§type ReadOnly = InstanceRef<'_, T>
type ReadOnly = InstanceRef<'_, T>
The read-only variant of this
QueryData, which satisfies the ReadOnlyQueryData trait.Source§type Item<'w, 's> = InstanceRef<'w, T>
type Item<'w, 's> = InstanceRef<'w, T>
The item returned by this
WorldQuery
This will be the data retrieved by the query,
and is visible to the end user when calling e.g. Query<Self>::get.Source§fn shrink<'wlong, 'wshort, 's>(
item: <InstanceRef<'_, T> as QueryData>::Item<'wlong, 's>,
) -> <InstanceRef<'_, T> as QueryData>::Item<'wshort, 's>where
'wlong: 'wshort,
fn shrink<'wlong, 'wshort, 's>(
item: <InstanceRef<'_, T> as QueryData>::Item<'wlong, 's>,
) -> <InstanceRef<'_, T> as QueryData>::Item<'wshort, 's>where
'wlong: 'wshort,
This function manually implements subtyping for the query items.
Source§unsafe fn fetch<'w, 's>(
state: &'s <InstanceRef<'_, T> as WorldQuery>::State,
fetch: &mut <InstanceRef<'_, T> as WorldQuery>::Fetch<'w>,
entity: Entity,
table_row: TableRow,
) -> Option<<InstanceRef<'_, T> as QueryData>::Item<'w, 's>>
unsafe fn fetch<'w, 's>( state: &'s <InstanceRef<'_, T> as WorldQuery>::State, fetch: &mut <InstanceRef<'_, T> as WorldQuery>::Fetch<'w>, entity: Entity, table_row: TableRow, ) -> Option<<InstanceRef<'_, T> as QueryData>::Item<'w, 's>>
Fetch
Self::Item for either the given entity in the current Table,
or for the given entity in the current Archetype. This must always be called after
WorldQuery::set_table with a table_row in the range of the current Table or after
WorldQuery::set_archetype with an entity in the current archetype.
Accesses components registered in WorldQuery::update_component_access. Read moreSource§fn iter_access(
state: &<InstanceRef<'_, T> as WorldQuery>::State,
) -> impl Iterator<Item = EcsAccessType<'_>>
fn iter_access( state: &<InstanceRef<'_, T> as WorldQuery>::State, ) -> impl Iterator<Item = EcsAccessType<'_>>
Returns an iterator over the access needed by
QueryData::fetch. Access conflicts are usually
checked in WorldQuery::update_component_access, but in certain cases this method can be useful to implement
a way of checking for access conflicts in a non-allocating way.Source§fn provide_extra_access(
_state: &mut Self::State,
_access: &mut Access,
_available_access: &Access,
)
fn provide_extra_access( _state: &mut Self::State, _access: &mut Access, _available_access: &Access, )
Offers additional access above what we requested in
update_component_access.
Implementations may add additional access that is a subset of available_access
and does not conflict with anything in access,
and must update access to include that access. Read moreSource§impl<T> WorldQuery for InstanceRef<'_, T>where
T: Component,
impl<T> WorldQuery for InstanceRef<'_, T>where
T: Component,
Source§const IS_DENSE: bool = <(Instance<T>, &T) as WorldQuery>::IS_DENSE
const IS_DENSE: bool = <(Instance<T>, &T) as WorldQuery>::IS_DENSE
Returns true if (and only if) every table of every archetype matched by this fetch contains
all of the matched components. Read more
Source§type Fetch<'w> = <(Instance<T>, &'static T) as WorldQuery>::Fetch<'w>
type Fetch<'w> = <(Instance<T>, &'static T) as WorldQuery>::Fetch<'w>
Per archetype/table state retrieved by this
WorldQuery to compute Self::Item for each entity.Source§type State = <(Instance<T>, &'static T) as WorldQuery>::State
type State = <(Instance<T>, &'static T) as WorldQuery>::State
State used to construct a
Self::Fetch. This will be cached inside QueryState,
so it is best to move as much data / computation here as possible to reduce the cost of
constructing Self::Fetch.Source§fn shrink_fetch<'wlong, 'wshort>(
fetch: <InstanceRef<'_, T> as WorldQuery>::Fetch<'wlong>,
) -> <InstanceRef<'_, T> as WorldQuery>::Fetch<'wshort>where
'wlong: 'wshort,
fn shrink_fetch<'wlong, 'wshort>(
fetch: <InstanceRef<'_, T> as WorldQuery>::Fetch<'wlong>,
) -> <InstanceRef<'_, T> as WorldQuery>::Fetch<'wshort>where
'wlong: 'wshort,
This function manually implements subtyping for the query fetches.
Source§unsafe fn init_fetch<'w>(
world: UnsafeWorldCell<'w>,
state: &<InstanceRef<'_, T> as WorldQuery>::State,
last_run: Tick,
this_run: Tick,
) -> <InstanceRef<'_, T> as WorldQuery>::Fetch<'w>
unsafe fn init_fetch<'w>( world: UnsafeWorldCell<'w>, state: &<InstanceRef<'_, T> as WorldQuery>::State, last_run: Tick, this_run: Tick, ) -> <InstanceRef<'_, T> as WorldQuery>::Fetch<'w>
Creates a new instance of
Self::Fetch,
by combining data from the World with the cached Self::State.
Readonly accesses resources registered in WorldQuery::update_component_access. Read moreSource§unsafe fn set_archetype<'w>(
fetch: &mut <InstanceRef<'_, T> as WorldQuery>::Fetch<'w>,
state: &<InstanceRef<'_, T> as WorldQuery>::State,
archetype: &'w Archetype,
table: &'w Table,
)
unsafe fn set_archetype<'w>( fetch: &mut <InstanceRef<'_, T> as WorldQuery>::Fetch<'w>, state: &<InstanceRef<'_, T> as WorldQuery>::State, archetype: &'w Archetype, table: &'w Table, )
Adjusts internal state to account for the next
Archetype. This will always be called on
archetypes that match this WorldQuery. Read moreSource§unsafe fn set_table<'w>(
fetch: &mut <InstanceRef<'_, T> as WorldQuery>::Fetch<'w>,
state: &<InstanceRef<'_, T> as WorldQuery>::State,
table: &'w Table,
)
unsafe fn set_table<'w>( fetch: &mut <InstanceRef<'_, T> as WorldQuery>::Fetch<'w>, state: &<InstanceRef<'_, T> as WorldQuery>::State, table: &'w Table, )
Adjusts internal state to account for the next
Table. This will always be called on tables
that match this WorldQuery. Read moreSource§fn update_component_access(
state: &<InstanceRef<'_, T> as WorldQuery>::State,
access: &mut FilteredAccess,
)
fn update_component_access( state: &<InstanceRef<'_, T> as WorldQuery>::State, access: &mut FilteredAccess, )
Source§fn init_state(world: &mut World) -> <InstanceRef<'_, T> as WorldQuery>::State
fn init_state(world: &mut World) -> <InstanceRef<'_, T> as WorldQuery>::State
Creates and initializes a
State for this WorldQuery type.Source§fn get_state(
components: &Components,
) -> Option<<InstanceRef<'_, T> as WorldQuery>::State>
fn get_state( components: &Components, ) -> Option<<InstanceRef<'_, T> as WorldQuery>::State>
Source§fn matches_component_set(
state: &<InstanceRef<'_, T> as WorldQuery>::State,
set_contains_id: &impl Fn(ComponentId) -> bool,
) -> bool
fn matches_component_set( state: &<InstanceRef<'_, T> as WorldQuery>::State, set_contains_id: &impl Fn(ComponentId) -> bool, ) -> bool
impl<T> Copy for InstanceRef<'_, T>where
T: Component,
impl<T> Eq for InstanceRef<'_, T>where
T: Component,
impl<T> ReadOnlyQueryData for InstanceRef<'_, T>where
T: Component,
Auto Trait Implementations§
impl<'a, T> Freeze for InstanceRef<'a, T>
impl<'a, T> RefUnwindSafe for InstanceRef<'a, T>where
T: RefUnwindSafe,
impl<'a, T> Send for InstanceRef<'a, T>
impl<'a, T> Sync for InstanceRef<'a, T>
impl<'a, T> Unpin for InstanceRef<'a, T>where
T: Unpin,
impl<'a, T> UnwindSafe for InstanceRef<'a, T>where
T: RefUnwindSafe + UnwindSafe,
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<T, C, D> Curve<T> for D
impl<T, C, D> Curve<T> for D
Source§fn sample_unchecked(&self, t: f32) -> T
fn sample_unchecked(&self, t: f32) -> T
Sample a point on this curve at the parameter value
t, extracting the associated value.
This is the unchecked version of sampling, which should only be used if the sample time t
is already known to lie within the curve’s domain. Read moreSource§fn sample(&self, t: f32) -> Option<T>
fn sample(&self, t: f32) -> Option<T>
Sample a point on this curve at the parameter value
t, returning None if the point is
outside of the curve’s domain.Source§fn sample_clamped(&self, t: f32) -> T
fn sample_clamped(&self, t: f32) -> T
Sample a point on this curve at the parameter value
t, clamping t to lie inside the
domain of the curve.Source§impl<C, T> CurveExt<T> for Cwhere
C: Curve<T>,
impl<C, T> CurveExt<T> for Cwhere
C: Curve<T>,
Source§fn sample_iter(
&self,
iter: impl IntoIterator<Item = f32>,
) -> impl Iterator<Item = Option<T>>
fn sample_iter( &self, iter: impl IntoIterator<Item = f32>, ) -> impl Iterator<Item = Option<T>>
Sample a collection of
n >= 0 points on this curve at the parameter values t_n,
returning None if the point is outside of the curve’s domain. Read moreSource§fn sample_iter_unchecked(
&self,
iter: impl IntoIterator<Item = f32>,
) -> impl Iterator<Item = T>
fn sample_iter_unchecked( &self, iter: impl IntoIterator<Item = f32>, ) -> impl Iterator<Item = T>
Sample a collection of
n >= 0 points on this curve at the parameter values t_n,
extracting the associated values. This is the unchecked version of sampling, which should
only be used if the sample times t_n are already known to lie within the curve’s domain. Read moreSource§fn sample_iter_clamped(
&self,
iter: impl IntoIterator<Item = f32>,
) -> impl Iterator<Item = T>
fn sample_iter_clamped( &self, iter: impl IntoIterator<Item = f32>, ) -> impl Iterator<Item = T>
Sample a collection of
n >= 0 points on this curve at the parameter values t_n,
clamping t_n to lie inside the domain of the curve. Read moreSource§fn map<S, F>(self, f: F) -> MapCurve<T, S, Self, F>where
F: Fn(T) -> S,
fn map<S, F>(self, f: F) -> MapCurve<T, S, Self, F>where
F: Fn(T) -> S,
Create a new curve by mapping the values of this curve via a function
f; i.e., if the
sample at time t for this curve is x, the value at time t on the new curve will be
f(x).Source§fn reparametrize<F>(self, domain: Interval, f: F) -> ReparamCurve<T, Self, F>
fn reparametrize<F>(self, domain: Interval, f: F) -> ReparamCurve<T, Self, F>
Create a new
Curve whose parameter space is related to the parameter space of this curve
by f. For each time t, the sample from the new curve at time t is the sample from
this curve at time f(t). The given domain will be the domain of the new curve. The
function f is expected to take domain into self.domain(). Read moreSource§fn reparametrize_linear(
self,
domain: Interval,
) -> Result<LinearReparamCurve<T, Self>, LinearReparamError>
fn reparametrize_linear( self, domain: Interval, ) -> Result<LinearReparamCurve<T, Self>, LinearReparamError>
Source§fn reparametrize_by_curve<C>(self, other: C) -> CurveReparamCurve<T, Self, C>
fn reparametrize_by_curve<C>(self, other: C) -> CurveReparamCurve<T, Self, C>
Source§fn graph(self) -> GraphCurve<T, Self>
fn graph(self) -> GraphCurve<T, Self>
Source§fn zip<S, C>(
self,
other: C,
) -> Result<ZipCurve<T, S, Self, C>, InvalidIntervalError>where
C: Curve<S>,
fn zip<S, C>(
self,
other: C,
) -> Result<ZipCurve<T, S, Self, C>, InvalidIntervalError>where
C: Curve<S>,
Source§fn chain<C>(self, other: C) -> Result<ChainCurve<T, Self, C>, ChainError>where
C: Curve<T>,
fn chain<C>(self, other: C) -> Result<ChainCurve<T, Self, C>, ChainError>where
C: Curve<T>,
Source§fn reverse(self) -> Result<ReverseCurve<T, Self>, ReverseError>
fn reverse(self) -> Result<ReverseCurve<T, Self>, ReverseError>
Source§fn repeat(self, count: usize) -> Result<RepeatCurve<T, Self>, RepeatError>
fn repeat(self, count: usize) -> Result<RepeatCurve<T, Self>, RepeatError>
Source§fn forever(self) -> Result<ForeverCurve<T, Self>, RepeatError>
fn forever(self) -> Result<ForeverCurve<T, Self>, RepeatError>
Source§fn ping_pong(self) -> Result<PingPongCurve<T, Self>, PingPongError>
fn ping_pong(self) -> Result<PingPongCurve<T, Self>, PingPongError>
Source§fn chain_continue<C>(
self,
other: C,
) -> Result<ContinuationCurve<T, Self, C>, ChainError>where
T: VectorSpace,
C: Curve<T>,
fn chain_continue<C>(
self,
other: C,
) -> Result<ContinuationCurve<T, Self, C>, ChainError>where
T: VectorSpace,
C: Curve<T>,
Source§fn samples(
&self,
samples: usize,
) -> Result<impl Iterator<Item = T>, ResamplingError>
fn samples( &self, samples: usize, ) -> Result<impl Iterator<Item = T>, ResamplingError>
Extract an iterator over evenly-spaced samples from this curve. Read more
Source§impl<C, T> CurveResampleExt<T> for C
impl<C, T> CurveResampleExt<T> for C
Source§fn resample<I>(
&self,
segments: usize,
interpolation: I,
) -> Result<SampleCurve<T, I>, ResamplingError>
fn resample<I>( &self, segments: usize, interpolation: I, ) -> Result<SampleCurve<T, I>, ResamplingError>
Resample this
Curve to produce a new one that is defined by interpolation over equally
spaced sample values, using the provided interpolation to interpolate between adjacent samples.
The curve is interpolated on segments segments between samples. For example, if segments is 1,
only the start and end points of the curve are used as samples; if segments is 2, a sample at
the midpoint is taken as well, and so on. Read moreSource§fn resample_auto(
&self,
segments: usize,
) -> Result<SampleAutoCurve<T>, ResamplingError>where
T: StableInterpolate,
fn resample_auto(
&self,
segments: usize,
) -> Result<SampleAutoCurve<T>, ResamplingError>where
T: StableInterpolate,
Resample this
Curve to produce a new one that is defined by interpolation over equally
spaced sample values, using automatic interpolation to interpolate between adjacent samples.
The curve is interpolated on segments segments between samples. For example, if segments is 1,
only the start and end points of the curve are used as samples; if segments is 2, a sample at
the midpoint is taken as well, and so on. Read moreSource§fn resample_uneven<I>(
&self,
sample_times: impl IntoIterator<Item = f32>,
interpolation: I,
) -> Result<UnevenSampleCurve<T, I>, ResamplingError>
fn resample_uneven<I>( &self, sample_times: impl IntoIterator<Item = f32>, interpolation: I, ) -> Result<UnevenSampleCurve<T, I>, ResamplingError>
Source§fn resample_uneven_auto(
&self,
sample_times: impl IntoIterator<Item = f32>,
) -> Result<UnevenSampleAutoCurve<T>, ResamplingError>where
T: StableInterpolate,
fn resample_uneven_auto(
&self,
sample_times: impl IntoIterator<Item = f32>,
) -> Result<UnevenSampleAutoCurve<T>, ResamplingError>where
T: StableInterpolate,
Resample this
Curve to produce a new one that is defined by automatic interpolation over
samples taken at the given set of times. The given sample_times are expected to contain at least
two valid times within the curve’s domain interval. Read moreSource§impl<T, C> CurveWithDerivative<T> for Cwhere
T: HasTangent,
C: SampleDerivative<T>,
impl<T, C> CurveWithDerivative<T> for Cwhere
T: HasTangent,
C: SampleDerivative<T>,
Source§fn with_derivative(self) -> SampleDerivativeWrapper<C>
fn with_derivative(self) -> SampleDerivativeWrapper<C>
This curve, but with its first derivative included in sampling. Read more
Source§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
Source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Converts
Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>, which can then be
downcast into Box<dyn ConcreteType> where ConcreteType implements Trait.Source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Converts
Rc<Trait> (where Trait: Downcast) to Rc<Any>, which can then be further
downcast into Rc<ConcreteType> where ConcreteType implements Trait.Source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Converts
&Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &Any’s vtable from &Trait’s.Source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Converts
&mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot
generate &mut Any’s vtable from &mut Trait’s.Source§impl<T> DowncastSend for T
impl<T> DowncastSend for T
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.Source§impl<T, W> HasTypeWitness<W> for Twhere
W: MakeTypeWitness<Arg = T>,
T: ?Sized,
impl<T, W> HasTypeWitness<W> for Twhere
W: MakeTypeWitness<Arg = T>,
T: ?Sized,
Source§impl<T> Identity for Twhere
T: ?Sized,
impl<T> Identity for Twhere
T: ?Sized,
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
Source§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> IntoResult<T> for T
impl<T> IntoResult<T> for T
Source§fn into_result(self) -> Result<T, RunSystemError>
fn into_result(self) -> Result<T, RunSystemError>
Converts this type into the system output type.
Source§impl<T, C, D> SampleDerivative<T> for D
impl<T, C, D> SampleDerivative<T> for D
Source§fn sample_with_derivative_unchecked(&self, t: f32) -> WithDerivative<T>
fn sample_with_derivative_unchecked(&self, t: f32) -> WithDerivative<T>
Sample this curve at the parameter value
t, extracting the associated value
in addition to its derivative. This is the unchecked version of sampling, which
should only be used if the sample time t is already known to lie within the
curve’s domain. Read moreSource§fn sample_with_derivative(&self, t: f32) -> Option<WithDerivative<T>>
fn sample_with_derivative(&self, t: f32) -> Option<WithDerivative<T>>
Sample this curve’s value and derivative at the parameter value
t, returning
None if the point is outside of the curve’s domain.Source§fn sample_with_derivative_clamped(&self, t: f32) -> WithDerivative<T>
fn sample_with_derivative_clamped(&self, t: f32) -> WithDerivative<T>
Sample this curve’s value and derivative at the parameter value
t, clamping t
to lie inside the domain of the curve.Source§impl<T> TypeData for T
impl<T> TypeData for T
Source§fn clone_type_data(&self) -> Box<dyn TypeData>
fn clone_type_data(&self) -> Box<dyn TypeData>
Creates a type-erased clone of this value.