Enum TransformationNode
pub enum TransformationNode {
BackwardEulerDerivative {
relation: Id<Relation>,
state: FieldRepresentationId,
duration: DynQuantity,
},
EnergySkewConvection {
relation: Id<Relation>,
velocity: FieldRepresentationId,
},
CellCenteredConvection {
relation: Id<Relation>,
state: FieldRepresentationId,
scheme: CellCenteredConvectionScheme,
},
OrthogonalTwoPointDiffusion {
relation: Id<Relation>,
state: FieldRepresentationId,
},
ImplicitCenteredMomentumConvection {
relation: Id<Relation>,
velocity: FieldRepresentationId,
},
CartesianCentralNewtonianTraction {
relation: Id<Relation>,
velocity: FieldRepresentationId,
pressure: FieldRepresentationId,
},
MomentumWeightedLinearExactCoupling {
momentum_relation: Id<Relation>,
incompressibility_relation: Id<Relation>,
velocity: FieldRepresentationId,
pressure: FieldRepresentationId,
positive_diagonal: PositiveMomentumDiagonal,
transient_history: TransientFaceFluxHistory,
},
GclCompatibleAlePullback {
relation: Id<Relation>,
velocity: FieldRepresentationId,
geometry: GeometryActionId,
},
BackwardEulerElimination {
relation: Id<Relation>,
state: FieldRepresentationId,
rate: FieldRepresentationId,
duration: DynQuantity,
state_scale: PositivePhysicalScale,
},
ConformingTraceQuotient {
connection: Id<Connection>,
endpoints: [FieldRepresentationId; 2],
},
}Description
Portable numerical transformation selected over exact semantic identities.
Variants§
BackwardEulerDerivative
Replace one exact Relation derivative by a backward difference.
Fields
state: FieldRepresentationIdDifferential Field representation.
duration: DynQuantityPositive physical step duration.
EnergySkewConvection
Use the energy-skew weak form for one conservative convective term.
Fields
velocity: FieldRepresentationIdVelocity Field used in both convective slots.
CellCenteredConvection
Apply one exact cell-centered convection reconstruction in time and space.
Fields
state: FieldRepresentationIdCell-centered transported Field representation.
scheme: CellCenteredConvectionSchemeExact endpoint or previous-state reconstruction policy.
OrthogonalTwoPointDiffusion
Use orthogonal two-point diffusive fluxes on cell-centered faces.
Fields
state: FieldRepresentationIdCell-centered transported Field representation.
ImplicitCenteredMomentumConvection
Use the unique collocated face flux for implicit centered momentum convection.
Fields
velocity: FieldRepresentationIdCell-centered velocity representation.
CartesianCentralNewtonianTraction
Apply centered Cartesian Newtonian velocity–pressure face traction.
Fields
velocity: FieldRepresentationIdCell-centered velocity representation.
pressure: FieldRepresentationIdCell-centered pressure representation.
MomentumWeightedLinearExactCoupling
Share one linearly exact momentum-weighted face flux between equations.
Fields
velocity: FieldRepresentationIdCell-centered velocity representation.
pressure: FieldRepresentationIdCell-centered pressure representation.
positive_diagonal: PositiveMomentumDiagonalExact positive momentum scale used by face interpolation.
transient_history: TransientFaceFluxHistoryExact previous-time face-flux closure.
GclCompatibleAlePullback
Pull back one conservative fluid action through a sealed moving geometry.
Relative energy-skew convection and the endpoint differential GCL correction are one transformation and cannot be selected separately.
Fields
velocity: FieldRepresentationIdPhysical fluid velocity represented on the moving Domain.
geometry: GeometryActionIdSole source of current maps and mesh kinematics.
BackwardEulerElimination
Eliminate one state in favour of its exact rate by backward Euler.
Fields
state: FieldRepresentationIdRepresented state omitted from the algebraic unknowns.
rate: FieldRepresentationIdAlgebraic rate retained in the system.
duration: DynQuantityPositive physical step duration.
state_scale: PositivePhysicalScaleCharacteristic physical scale for state reconstruction.
ConformingTraceQuotient
Identify two exact conforming traces through one Semantic Connection.
Fields
connection: Id<Connection>Exact conserving Connection selected by the lowerer.
endpoints: [FieldRepresentationId; 2]Canonically ordered cross-Domain Field representations.
Trait Implementations§
§impl Clone for TransformationNode
impl Clone for TransformationNode
§impl Debug for TransformationNode
impl Debug for TransformationNode
§impl PartialEq for TransformationNode
impl PartialEq for TransformationNode
§fn eq(&self, other: &TransformationNode) -> bool
fn eq(&self, other: &TransformationNode) -> bool
self and other values to be equal, and is used by ==.impl Copy for TransformationNode
impl StructuralPartialEq for TransformationNode
Auto Trait Implementations§
impl Freeze for TransformationNode
impl RefUnwindSafe for TransformationNode
impl Send for TransformationNode
impl Sync for TransformationNode
impl Unpin for TransformationNode
impl UnsafeUnpin for TransformationNode
impl UnwindSafe for TransformationNode
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.