Struct AuxStorageMechanics
pub struct AuxStorageMechanics<Pos, Vel, For, const N: usize> { /* private fields */ }
Available on crate feature
chili
only.Expand description
Stores intermediate information about the mechanics of a cell.
Trait Implementations§
§impl<Pos, Vel, For, const N: usize> Clone for AuxStorageMechanics<Pos, Vel, For, N>
impl<Pos, Vel, For, const N: usize> Clone for AuxStorageMechanics<Pos, Vel, For, N>
§fn clone(&self) -> AuxStorageMechanics<Pos, Vel, For, N>
fn clone(&self) -> AuxStorageMechanics<Pos, Vel, For, N>
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 more§impl<Pos, Vel, For, const N: usize> Default for AuxStorageMechanics<Pos, Vel, For, N>where
For: Zero,
impl<Pos, Vel, For, const N: usize> Default for AuxStorageMechanics<Pos, Vel, For, N>where
For: Zero,
§fn default() -> AuxStorageMechanics<Pos, Vel, For, N>
fn default() -> AuxStorageMechanics<Pos, Vel, For, N>
Returns the “default value” for a type. Read more
§impl<Pos, Vel, For, const N: usize> DefaultFrom<For> for AuxStorageMechanics<Pos, Vel, For, N>where
For: Clone,
impl<Pos, Vel, For, const N: usize> DefaultFrom<For> for AuxStorageMechanics<Pos, Vel, For, N>where
For: Clone,
§fn default_from(value: &For) -> AuxStorageMechanics<Pos, Vel, For, N>
fn default_from(value: &For) -> AuxStorageMechanics<Pos, Vel, For, N>
Constructs the Type in question from a given value. This is typically a zero value.
If it can be constructed from the num::Zero trait, this method is not required and
cellular_raza
will determine the initial zero-value correctly.
For other types (ie. dynamically-sized ones) additional entries may be necessary.§impl<'de, Pos, Vel, For, const N: usize> Deserialize<'de> for AuxStorageMechanics<Pos, Vel, For, N>
impl<'de, Pos, Vel, For, const N: usize> Deserialize<'de> for AuxStorageMechanics<Pos, Vel, For, N>
§fn deserialize<__D>(
__deserializer: __D,
) -> Result<AuxStorageMechanics<Pos, Vel, For, N>, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(
__deserializer: __D,
) -> Result<AuxStorageMechanics<Pos, Vel, For, N>, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
§impl<Pos, Vel, For, const N: usize> Serialize for AuxStorageMechanics<Pos, Vel, For, N>
impl<Pos, Vel, For, const N: usize> Serialize for AuxStorageMechanics<Pos, Vel, For, N>
§fn serialize<__S>(
&self,
__serializer: __S,
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
fn serialize<__S>(
&self,
__serializer: __S,
) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>where
__S: Serializer,
Serialize this value into the given Serde serializer. Read more
§impl<Pos, Vel, For, const N: usize> UpdateMechanics<Pos, Vel, For, N> for AuxStorageMechanics<Pos, Vel, For, N>
impl<Pos, Vel, For, const N: usize> UpdateMechanics<Pos, Vel, For, N> for AuxStorageMechanics<Pos, Vel, For, N>
§fn previous_positions<'a>(&'a self) -> RingBufferIterRef<'a, Pos, N> ⓘ
fn previous_positions<'a>(&'a self) -> RingBufferIterRef<'a, Pos, N> ⓘ
Get all previous positions. This number maybe smaller than the maximum number of stored
positions but never exceeds it.
§fn previous_velocities<'a>(&'a self) -> RingBufferIterRef<'a, Vel, N> ⓘ
fn previous_velocities<'a>(&'a self) -> RingBufferIterRef<'a, Vel, N> ⓘ
Get all previous velocities. This number may be smaller than the maximum number of stored
velocities but never exceeds it.
§fn n_previous_values(&self) -> usize
fn n_previous_values(&self) -> usize
Get the number of previous values currently stored Read more
§fn set_last_position(&mut self, pos: Pos)
fn set_last_position(&mut self, pos: Pos)
Stores the last position of the cell. May overwrite old results depending on
how many old results are being stored.
§fn set_last_velocity(&mut self, vel: Vel)
fn set_last_velocity(&mut self, vel: Vel)
Stores the last velocity of the cell. Overwrites old results when stored amount
exceeds number of maximum stored values.
§fn get_current_force_and_reset(&mut self) -> For
fn get_current_force_and_reset(&mut self) -> For
Obtain current force on cell
Auto Trait Implementations§
impl<Pos, Vel, For, const N: usize> Freeze for AuxStorageMechanics<Pos, Vel, For, N>
impl<Pos, Vel, For, const N: usize> RefUnwindSafe for AuxStorageMechanics<Pos, Vel, For, N>
impl<Pos, Vel, For, const N: usize> Send for AuxStorageMechanics<Pos, Vel, For, N>
impl<Pos, Vel, For, const N: usize> Sync for AuxStorageMechanics<Pos, Vel, For, N>
impl<Pos, Vel, For, const N: usize> Unpin for AuxStorageMechanics<Pos, Vel, For, N>
impl<Pos, Vel, For, const N: usize> UnwindSafe for AuxStorageMechanics<Pos, Vel, For, N>
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,
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
§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 more§impl<T> Pointable for T
impl<T> Pointable for T
§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.