Struct CartesianSubDomainRods
pub struct CartesianSubDomainRods<F, const D: usize> {
pub subdomain: CartesianSubDomain<F, D>,
}
Expand description
The corresponding SubDomain of the CartesianCuboidRods domain.
Fields§
§subdomain: CartesianSubDomain<F, D>
Base subdomain as created by the CartesianCuboid domain.
Trait Implementations§
§impl<F, const D: usize> Clone for CartesianSubDomainRods<F, D>where
F: Clone,
impl<F, const D: usize> Clone for CartesianSubDomainRods<F, D>where
F: Clone,
§fn clone(&self) -> CartesianSubDomainRods<F, D>
fn clone(&self) -> CartesianSubDomainRods<F, D>
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<'de, F, const D: usize> Deserialize<'de> for CartesianSubDomainRods<F, D>where
F: Scalar + for<'a> Deserialize<'a>,
impl<'de, F, const D: usize> Deserialize<'de> for CartesianSubDomainRods<F, D>where
F: Scalar + for<'a> Deserialize<'a>,
§fn deserialize<De>(
deserializer: De,
) -> Result<CartesianSubDomainRods<F, D>, <De as Deserializer<'de>>::Error>where
De: Deserializer<'de>,
fn deserialize<De>(
deserializer: De,
) -> Result<CartesianSubDomainRods<F, D>, <De as Deserializer<'de>>::Error>where
De: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
§impl<F, const D: usize> DomainCreateSubDomains<CartesianSubDomainRods<F, D>> for CartesianCuboidRods<F, D>
impl<F, const D: usize> DomainCreateSubDomains<CartesianSubDomainRods<F, D>> for CartesianCuboidRods<F, D>
§type SubDomainIndex = usize
type SubDomainIndex = usize
This should always be identical to Domain::SubDomainIndex.
§type VoxelIndex = [usize; D]
type VoxelIndex = [usize; D]
This should always be identical to Domain::VoxelIndex.
§fn create_subdomains(
&self,
n_subdomains: NonZero<usize>,
) -> Result<impl IntoIterator<Item = (<CartesianCuboidRods<F, D> as DomainCreateSubDomains<CartesianSubDomainRods<F, D>>>::SubDomainIndex, CartesianSubDomainRods<F, D>, Vec<<CartesianCuboidRods<F, D> as DomainCreateSubDomains<CartesianSubDomainRods<F, D>>>::VoxelIndex>)>, DecomposeError>
fn create_subdomains( &self, n_subdomains: NonZero<usize>, ) -> Result<impl IntoIterator<Item = (<CartesianCuboidRods<F, D> as DomainCreateSubDomains<CartesianSubDomainRods<F, D>>>::SubDomainIndex, CartesianSubDomainRods<F, D>, Vec<<CartesianCuboidRods<F, D> as DomainCreateSubDomains<CartesianSubDomainRods<F, D>>>::VoxelIndex>)>, DecomposeError>
Generates at most
n_subdomains
. This function can also return a lower amount of
subdomains but never less than 1.§impl<F, const D: usize> From<__CartesianSubDomainRodsSerde<F, D>> for CartesianSubDomainRods<F, D>
impl<F, const D: usize> From<__CartesianSubDomainRodsSerde<F, D>> for CartesianSubDomainRods<F, D>
§fn from(s: __CartesianSubDomainRodsSerde<F, D>) -> CartesianSubDomainRods<F, D>
fn from(s: __CartesianSubDomainRodsSerde<F, D>) -> CartesianSubDomainRods<F, D>
Converts to this type from the input type.
§impl<F, const D: usize> Serialize for CartesianSubDomainRods<F, D>
impl<F, const D: usize> Serialize for CartesianSubDomainRods<F, D>
§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<C, F, const D: usize> SortCells<C> for CartesianSubDomainRods<F, D>where
C: Position<Matrix<F, Dyn, Const<D>, VecStorage<F, Dyn, Const<D>>>>,
F: 'static + Field + Clone + Debug + FromPrimitive + ToPrimitive + Float + Copy,
impl<C, F, const D: usize> SortCells<C> for CartesianSubDomainRods<F, D>where
C: Position<Matrix<F, Dyn, Const<D>, VecStorage<F, Dyn, Const<D>>>>,
F: 'static + Field + Clone + Debug + FromPrimitive + ToPrimitive + Float + Copy,
§type VoxelIndex = [usize; D]
type VoxelIndex = [usize; D]
An index which determines to which next smaller unit the cell should be assigned.
§fn get_voxel_index_of(
&self,
cell: &C,
) -> Result<<CartesianSubDomainRods<F, D> as SortCells<C>>::VoxelIndex, BoundaryError>
fn get_voxel_index_of( &self, cell: &C, ) -> Result<<CartesianSubDomainRods<F, D> as SortCells<C>>::VoxelIndex, BoundaryError>
If given a cell, we can sort this cell into the corresponding sub unit.
§impl<F, const D: usize> SubDomain for CartesianSubDomainRods<F, D>
impl<F, const D: usize> SubDomain for CartesianSubDomainRods<F, D>
§type VoxelIndex = <CartesianSubDomain<F, D> as SubDomain>::VoxelIndex
type VoxelIndex = <CartesianSubDomain<F, D> as SubDomain>::VoxelIndex
Individual Voxels inside each subdomain can be accessed by this index.
§fn get_neighbor_voxel_indices(
&self,
voxel_index: &<CartesianSubDomainRods<F, D> as SubDomain>::VoxelIndex,
) -> Vec<<CartesianSubDomainRods<F, D> as SubDomain>::VoxelIndex>
fn get_neighbor_voxel_indices( &self, voxel_index: &<CartesianSubDomainRods<F, D> as SubDomain>::VoxelIndex, ) -> Vec<<CartesianSubDomainRods<F, D> as SubDomain>::VoxelIndex>
Obtains the neighbor voxels of the specified voxel index. This function behaves similarly
to SortCells::get_voxel_index_of in that it also has to return
indices which are in other SubDomains.
§fn get_all_indices(
&self,
) -> Vec<<CartesianSubDomainRods<F, D> as SubDomain>::VoxelIndex>
fn get_all_indices( &self, ) -> Vec<<CartesianSubDomainRods<F, D> as SubDomain>::VoxelIndex>
Get all voxel indices of this SubDomain.
§impl<F, const D: usize> SubDomainMechanics<Matrix<F, Dyn, Const<D>, VecStorage<F, Dyn, Const<D>>>, Matrix<F, Dyn, Const<D>, VecStorage<F, Dyn, Const<D>>>> for CartesianSubDomainRods<F, D>where
F: RealField + Float,
impl<F, const D: usize> SubDomainMechanics<Matrix<F, Dyn, Const<D>, VecStorage<F, Dyn, Const<D>>>, Matrix<F, Dyn, Const<D>, VecStorage<F, Dyn, Const<D>>>> for CartesianSubDomainRods<F, D>where
F: RealField + Float,
§fn apply_boundary(
&self,
pos: &mut Matrix<F, Dyn, Const<D>, VecStorage<F, Dyn, Const<D>>>,
vel: &mut Matrix<F, Dyn, Const<D>, VecStorage<F, Dyn, Const<D>>>,
) -> Result<(), BoundaryError>
fn apply_boundary( &self, pos: &mut Matrix<F, Dyn, Const<D>, VecStorage<F, Dyn, Const<D>>>, vel: &mut Matrix<F, Dyn, Const<D>, VecStorage<F, Dyn, Const<D>>>, ) -> Result<(), BoundaryError>
If the subdomain has boundary conditions, this function will enforce them onto the cells.
For the future, we plan to replace this function to additionally obtain information
about the previous and current location of the cell.
Auto Trait Implementations§
impl<F, const D: usize> Freeze for CartesianSubDomainRods<F, D>where
F: Freeze,
impl<F, const D: usize> RefUnwindSafe for CartesianSubDomainRods<F, D>where
F: RefUnwindSafe,
impl<F, const D: usize> Send for CartesianSubDomainRods<F, D>where
F: Send,
impl<F, const D: usize> Sync for CartesianSubDomainRods<F, D>where
F: Sync,
impl<F, const D: usize> Unpin for CartesianSubDomainRods<F, D>where
F: Unpin,
impl<F, const D: usize> UnwindSafe for CartesianSubDomainRods<F, D>where
F: UnwindSafe,
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.