Struct FixedTopologyGeometryAction
pub struct FixedTopologyGeometryAction<const D: usize> { /* private fields */ }Description
Sealed consecutive action over one immutable dimension-typed simplex topology.
Vertex velocities and all cell-local metric data are derived from the two states and the positive duration. There is intentionally no constructor parameter for connectivity, velocity, velocity divergence, or a GCL term.
Implementations§
§impl<const D: usize> FixedTopologyGeometryAction<D>
impl<const D: usize> FixedTopologyGeometryAction<D>
pub fn new(
reference: &SimplicialMesh,
previous: &FixedTopologyGeometryState<D>,
current: &FixedTopologyGeometryState<D>,
time_step: f64,
) -> Result<FixedTopologyGeometryAction<D>, Diagnostic>
pub fn new( reference: &SimplicialMesh, previous: &FixedTopologyGeometryState<D>, current: &FixedTopologyGeometryState<D>, time_step: f64, ) -> Result<FixedTopologyGeometryAction<D>, Diagnostic>
Derive one endpoint action from consecutive accepted coordinate states.
The linear path is checked analytically. Cell determinants are quadratic in 2D and cubic in 3D, so every interior stationary point is included rather than trusting the two accepted endpoints.
§Errors
Returns EQ0803 for an invalid duration, stale state, failed endpoint
metric identity, or a degenerate/inverting geometry path.
pub const fn previous(&self) -> &FixedTopologyGeometryState<D>
pub const fn previous(&self) -> &FixedTopologyGeometryState<D>
Previous accepted absolute-coordinate state.
pub const fn current(&self) -> &FixedTopologyGeometryState<D>
pub const fn current(&self) -> &FixedTopologyGeometryState<D>
Current accepted absolute-coordinate state.
pub const fn current_mesh(&self) -> &SimplicialMesh
pub const fn current_mesh(&self) -> &SimplicialMesh
Current mesh reconstructed solely from immutable reference topology.
pub const fn time_step(&self) -> f64
pub const fn time_step(&self) -> f64
Positive interval between the consecutive states.
pub fn vertex_velocities(&self) -> &[Vec<f64>]
pub fn vertex_velocities(&self) -> &[Vec<f64>]
Derived vertex velocities in immutable reference order.
pub fn cell(&self, cell: usize) -> Option<&FixedTopologyCellGeometryAction<D>>
pub fn cell(&self, cell: usize) -> Option<&FixedTopologyCellGeometryAction<D>>
Derived action for one valid cell index.
pub fn cells(&self) -> &[FixedTopologyCellGeometryAction<D>]
pub fn cells(&self) -> &[FixedTopologyCellGeometryAction<D>]
All derived cell actions in immutable reference-cell order.
pub const fn minimum_path_signed_measure_scale(&self) -> f64
pub const fn minimum_path_signed_measure_scale(&self) -> f64
Minimum signed Jacobian over every cell and the entire linear path.
Trait Implementations§
§impl<const D: usize> Clone for FixedTopologyGeometryAction<D>
impl<const D: usize> Clone for FixedTopologyGeometryAction<D>
§impl<const D: usize> Debug for FixedTopologyGeometryAction<D>
impl<const D: usize> Debug for FixedTopologyGeometryAction<D>
§impl<const D: usize> PartialEq for FixedTopologyGeometryAction<D>
impl<const D: usize> PartialEq for FixedTopologyGeometryAction<D>
§fn eq(&self, other: &FixedTopologyGeometryAction<D>) -> bool
fn eq(&self, other: &FixedTopologyGeometryAction<D>) -> bool
self and other values to be equal, and is used by ==.impl<const D: usize> StructuralPartialEq for FixedTopologyGeometryAction<D>
Auto Trait Implementations§
impl<const D: usize> Freeze for FixedTopologyGeometryAction<D>
impl<const D: usize> RefUnwindSafe for FixedTopologyGeometryAction<D>
impl<const D: usize> Send for FixedTopologyGeometryAction<D>
impl<const D: usize> Sync for FixedTopologyGeometryAction<D>
impl<const D: usize> Unpin for FixedTopologyGeometryAction<D>
impl<const D: usize> UnsafeUnpin for FixedTopologyGeometryAction<D>
impl<const D: usize> UnwindSafe for FixedTopologyGeometryAction<D>
Blanket Implementations§
Source§impl<T> Any for Twhere
T: 'static + ?Sized,
impl<T> Any for Twhere
T: 'static + ?Sized,
§impl<Src, Scheme> ApproxFrom<Src, Scheme> for Srcwhere
Scheme: ApproxScheme,
impl<Src, Scheme> ApproxFrom<Src, Scheme> for Srcwhere
Scheme: ApproxScheme,
§fn approx_from(src: Src) -> Result<Src, <Src as ApproxFrom<Src, Scheme>>::Err>
fn approx_from(src: Src) -> Result<Src, <Src as ApproxFrom<Src, Scheme>>::Err>
§impl<Dst, Src, Scheme> ApproxInto<Dst, Scheme> for Srcwhere
Dst: ApproxFrom<Src, Scheme>,
Scheme: ApproxScheme,
impl<Dst, Src, Scheme> ApproxInto<Dst, Scheme> for Srcwhere
Dst: ApproxFrom<Src, Scheme>,
Scheme: ApproxScheme,
§type Err = <Dst as ApproxFrom<Src, Scheme>>::Err
type Err = <Dst as ApproxFrom<Src, Scheme>>::Err
§fn approx_into(self) -> Result<Dst, <Src as ApproxInto<Dst, Scheme>>::Err>
fn approx_into(self) -> Result<Dst, <Src as ApproxInto<Dst, Scheme>>::Err>
Source§impl<T> Borrow<T> for Twhere
T: ?Sized,
impl<T> Borrow<T> for Twhere
T: ?Sized,
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<T, Dst> ConvAsUtil<Dst> for T
impl<T, Dst> ConvAsUtil<Dst> for T
§fn approx(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
fn approx(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
§impl<T> ConvUtil for T
impl<T> ConvUtil for T
§fn approx_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
fn approx_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst>,
§fn approx_as_by<Dst, Scheme>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst, Scheme>,
Scheme: ApproxScheme,
fn approx_as_by<Dst, Scheme>(self) -> Result<Dst, Self::Err>where
Self: Sized + ApproxInto<Dst, Scheme>,
Scheme: ApproxScheme,
§fn into_as<Dst>(self) -> Dstwhere
Self: Sized + Into<Dst>,
fn into_as<Dst>(self) -> Dstwhere
Self: Sized + Into<Dst>,
§fn try_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + TryInto<Dst>,
fn try_as<Dst>(self) -> Result<Dst, Self::Err>where
Self: Sized + TryInto<Dst>,
§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
fn rand<T>(&self, rng: &mut (impl Rng + ?Sized)) -> Twhere
Self: Distribution<T>,
Source§impl<T> From<T> for T
impl<T> From<T> for T
Source§impl<T, U> Into<U> for Twhere
U: From<T>,
impl<T, U> Into<U> for Twhere
U: From<T>,
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>
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>where
F: FnOnce(&Self) -> bool,
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>where
F: FnOnce(&Self) -> bool,
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
Source§impl<T> Same for T
impl<T> Same 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>
self from the equivalent element of its
superset. Read more§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
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
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
self to the equivalent element of its superset.