Struct SteadyIncompressibleStokesCartesianModel2d
pub struct SteadyIncompressibleStokesCartesianModel2d { /* private fields */ }Description
Compatibility wrapper for the exact Cartesian steady-Stokes subset.
All method-neutral meaning lives in the internal
SteadyIncompressibleStokesModel2d.
This wrapper retains the established four-side inventory without making
Cartesian side classification part of geometry-backed realization.
Implementations§
§impl SteadyIncompressibleStokesCartesianModel2d
impl SteadyIncompressibleStokesCartesianModel2d
pub const fn velocity(&self) -> RawId
pub const fn velocity(&self) -> RawId
Canonical spatial-Cartesian velocity Field.
pub const fn pressure(&self) -> RawId
pub const fn pressure(&self) -> RawId
Canonical invariant pressure Field.
pub const fn force_potential(&self) -> RawId
pub const fn force_potential(&self) -> RawId
Canonical conservative-force potential Field.
pub const fn bounds(&self) -> &[[f64; 2]; 2]
pub const fn bounds(&self) -> &[[f64; 2]; 2]
Physical Cartesian bounds in coherent SI coordinates.
pub fn dynamic_viscosity(&self) -> f64
pub fn dynamic_viscosity(&self) -> f64
Positive constant dynamic viscosity in coherent SI units.
pub const fn dynamic_viscosity_expression(&self) -> &ScalarSpatialExpression
pub const fn dynamic_viscosity_expression(&self) -> &ScalarSpatialExpression
Immutable viscosity tape retaining revision-local Parameter identity.
pub const fn force_potential_expression(&self) -> &ScalarSpatialExpression
pub const fn force_potential_expression(&self) -> &ScalarSpatialExpression
Immutable conservative-force potential tape.
pub const fn force_potential_definition(&self) -> RawId
pub const fn force_potential_definition(&self) -> RawId
Exact scalar definition Relation for the conservative-force potential.
pub const fn momentum_relation(&self) -> RawId
pub const fn momentum_relation(&self) -> RawId
Exact momentum Relation.
pub const fn incompressibility_relation(&self) -> RawId
pub const fn incompressibility_relation(&self) -> RawId
Exact incompressibility Relation.
pub const fn boundary_inventory(&self) -> &CartesianBoundaryInventory<2>
pub const fn boundary_inventory(&self) -> &CartesianBoundaryInventory<2>
Complete package-neutral meaning of the four exact Cartesian sides.
pub fn normal_pressure(
&self,
axis: usize,
side: BoundarySide,
) -> Option<&SteadyStokesNormalPressure2d>
pub fn normal_pressure( &self, axis: usize, side: BoundarySide, ) -> Option<&SteadyStokesNormalPressure2d>
Parent-outward normal-pressure law on one exact Cartesian side.
Trait Implementations§
§impl Clone for SteadyIncompressibleStokesCartesianModel2d
impl Clone for SteadyIncompressibleStokesCartesianModel2d
§impl Debug for SteadyIncompressibleStokesCartesianModel2d
impl Debug for SteadyIncompressibleStokesCartesianModel2d
§impl PartialEq for SteadyIncompressibleStokesCartesianModel2d
impl PartialEq for SteadyIncompressibleStokesCartesianModel2d
§fn eq(&self, other: &SteadyIncompressibleStokesCartesianModel2d) -> bool
fn eq(&self, other: &SteadyIncompressibleStokesCartesianModel2d) -> bool
self and other values to be equal, and is used by ==.impl StructuralPartialEq for SteadyIncompressibleStokesCartesianModel2d
Auto Trait Implementations§
impl Freeze for SteadyIncompressibleStokesCartesianModel2d
impl RefUnwindSafe for SteadyIncompressibleStokesCartesianModel2d
impl Send for SteadyIncompressibleStokesCartesianModel2d
impl Sync for SteadyIncompressibleStokesCartesianModel2d
impl Unpin for SteadyIncompressibleStokesCartesianModel2d
impl UnsafeUnpin for SteadyIncompressibleStokesCartesianModel2d
impl UnwindSafe for SteadyIncompressibleStokesCartesianModel2d
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.