Struct CoupledFieldwiseRealizationPlan
pub struct CoupledFieldwiseRealizationPlan { /* private fields */ }Description
Complete physics-neutral multi-Domain Field-wise realization selection.
Implementations§
§impl CoupledFieldwiseRealizationPlan
impl CoupledFieldwiseRealizationPlan
pub fn new(
spatial: CoupledFieldwiseSpatialDiscretization,
time_step: BackwardEulerStep,
scaling: SymmetricCongruenceScaling,
operator_properties: LinearOperatorProperties,
solver: SolverPlan,
target: Target,
schedule: ExecutionSchedule,
) -> Result<CoupledFieldwiseRealizationPlan, Diagnostic>
pub fn new( spatial: CoupledFieldwiseSpatialDiscretization, time_step: BackwardEulerStep, scaling: SymmetricCongruenceScaling, operator_properties: LinearOperatorProperties, solver: SolverPlan, target: Target, schedule: ExecutionSchedule, ) -> Result<CoupledFieldwiseRealizationPlan, Diagnostic>
Construct and cross-validate one complete multi-Domain selection.
§Errors
Returns EQ0807 unless the shared spatial family is the admitted
continuous-Galerkin/imported-simplex/Duffy family and congruence
scaling covers every Field and constraint multiplier exactly once.
pub const fn spatial(&self) -> &CoupledFieldwiseSpatialDiscretization
pub const fn spatial(&self) -> &CoupledFieldwiseSpatialDiscretization
Shared multi-Domain spatial selection.
pub const fn time_step(&self) -> BackwardEulerStep
pub const fn time_step(&self) -> BackwardEulerStep
Fixed Backward Euler step selection.
pub const fn scaling(&self) -> &SymmetricCongruenceScaling
pub const fn scaling(&self) -> &SymmetricCongruenceScaling
Explicit symmetric congruence scaling.
pub const fn operator_properties(&self) -> LinearOperatorProperties
pub const fn operator_properties(&self) -> LinearOperatorProperties
Mathematical property asserted for the complete operator.
pub const fn schedule(&self) -> ExecutionSchedule
pub const fn schedule(&self) -> ExecutionSchedule
Deployment schedule.
pub fn represented_physical_fields(
&self,
) -> Result<Vec<RepresentedPhysicalField>, Diagnostic>
pub fn represented_physical_fields( &self, ) -> Result<Vec<RepresentedPhysicalField>, Diagnostic>
Physical Semantic Fields represented by this plan, paired with their exact support Domains in canonical Field identity order.
Algebraic Field blocks and a represented-but-eliminated state are both physical observations. Constraint multipliers are numerical unknowns and are intentionally absent.
§Errors
Returns EQ0807 if the validated eliminated-state rate cannot be
associated with one exact Domain.
Trait Implementations§
§impl Clone for CoupledFieldwiseRealizationPlan
impl Clone for CoupledFieldwiseRealizationPlan
§impl Debug for CoupledFieldwiseRealizationPlan
impl Debug for CoupledFieldwiseRealizationPlan
§impl PartialEq for CoupledFieldwiseRealizationPlan
impl PartialEq for CoupledFieldwiseRealizationPlan
§fn eq(&self, other: &CoupledFieldwiseRealizationPlan) -> bool
fn eq(&self, other: &CoupledFieldwiseRealizationPlan) -> bool
self and other values to be equal, and is used by ==.impl StructuralPartialEq for CoupledFieldwiseRealizationPlan
Auto Trait Implementations§
impl Freeze for CoupledFieldwiseRealizationPlan
impl RefUnwindSafe for CoupledFieldwiseRealizationPlan
impl Send for CoupledFieldwiseRealizationPlan
impl Sync for CoupledFieldwiseRealizationPlan
impl Unpin for CoupledFieldwiseRealizationPlan
impl UnsafeUnpin for CoupledFieldwiseRealizationPlan
impl UnwindSafe for CoupledFieldwiseRealizationPlan
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.