pub struct CartesianSubDomain3 {
pub voxels: Vec<CartesianVoxel3>,
/* private fields */
}
Expand description
Subdomain of CartesianCuboid3New
The subdomain contains voxels
Fields§
§voxels: Vec<CartesianVoxel3>
All voxels contained in this subdomain
Trait Implementations§
Source§impl Clone for CartesianSubDomain3
impl Clone for CartesianSubDomain3
Source§fn clone(&self) -> CartesianSubDomain3
fn clone(&self) -> CartesianSubDomain3
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 moreSource§impl Debug for CartesianSubDomain3
impl Debug for CartesianSubDomain3
Source§impl<'de> Deserialize<'de> for CartesianSubDomain3
impl<'de> Deserialize<'de> for CartesianSubDomain3
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Source§impl<C, I: IntoIterator<Item = C>> Domain<C, CartesianSubDomain3, I> for CartesianCuboid3New
impl<C, I: IntoIterator<Item = C>> Domain<C, CartesianSubDomain3, I> for CartesianCuboid3New
Source§fn decompose(
self,
n_subdomains: NonZeroUsize,
cells: I,
) -> Result<DecomposedDomain<Self::SubDomainIndex, CartesianSubDomain3, C>, DecomposeError>
fn decompose( self, n_subdomains: NonZeroUsize, cells: I, ) -> Result<DecomposedDomain<Self::SubDomainIndex, CartesianSubDomain3, C>, DecomposeError>
Much more research must be done to effectively write this function. We should be using more sophisticated functionality based on common known facts for minimizing surface area and number of neighbors. For more information also see
Source§type SubDomainIndex = usize
type SubDomainIndex = usize
Subdomains can be identified by their unique SubDomainIndex.
The backend uses this property to construct a mapping (graph) between subdomains.
Source§type VoxelIndex = [i64; 3]
type VoxelIndex = [i64; 3]
Similarly to the SubDomainIndex, voxels can be accessed by
their unique index. The backend will use this information to construct a mapping
(graph) between voxels inside their respective subdomains.
Source§impl IntoPy<Py<PyAny>> for CartesianSubDomain3
impl IntoPy<Py<PyAny>> for CartesianSubDomain3
Source§impl<'py> IntoPyObject<'py> for CartesianSubDomain3
impl<'py> IntoPyObject<'py> for CartesianSubDomain3
Source§type Target = CartesianSubDomain3
type Target = CartesianSubDomain3
The Python output type
Source§type Output = Bound<'py, <CartesianSubDomain3 as IntoPyObject<'py>>::Target>
type Output = Bound<'py, <CartesianSubDomain3 as IntoPyObject<'py>>::Target>
The smart pointer type to use. Read more
Source§fn into_pyobject(
self,
py: Python<'py>,
) -> Result<<Self as IntoPyObject<'_>>::Output, <Self as IntoPyObject<'_>>::Error>
fn into_pyobject( self, py: Python<'py>, ) -> Result<<Self as IntoPyObject<'_>>::Output, <Self as IntoPyObject<'_>>::Error>
Performs the conversion.
Source§impl PyClass for CartesianSubDomain3
impl PyClass for CartesianSubDomain3
Source§impl PyClassImpl for CartesianSubDomain3
impl PyClassImpl for CartesianSubDomain3
Source§const IS_BASETYPE: bool = false
const IS_BASETYPE: bool = false
#[pyclass(subclass)]
Source§const IS_SUBCLASS: bool = false
const IS_SUBCLASS: bool = false
#[pyclass(extends=…)]
Source§const IS_MAPPING: bool = false
const IS_MAPPING: bool = false
#[pyclass(mapping)]
Source§const IS_SEQUENCE: bool = false
const IS_SEQUENCE: bool = false
#[pyclass(sequence)]
Source§type ThreadChecker = SendablePyClass<CartesianSubDomain3>
type ThreadChecker = SendablePyClass<CartesianSubDomain3>
This handles following two situations: Read more
Source§type PyClassMutability = <<PyAny as PyClassBaseType>::PyClassMutability as PyClassMutability>::MutableChild
type PyClassMutability = <<PyAny as PyClassBaseType>::PyClassMutability as PyClassMutability>::MutableChild
Immutable or mutable
Source§type BaseNativeType = PyAny
type BaseNativeType = PyAny
The closest native ancestor. This is
PyAny
by default, and when you declare
#[pyclass(extends=PyDict)]
, it’s PyDict
.fn items_iter() -> PyClassItemsIter
fn lazy_type_object() -> &'static LazyTypeObject<Self>
fn dict_offset() -> Option<isize>
fn weaklist_offset() -> Option<isize>
Source§impl<'a, 'py> PyFunctionArgument<'a, 'py, false> for &'a CartesianSubDomain3
impl<'a, 'py> PyFunctionArgument<'a, 'py, false> for &'a CartesianSubDomain3
Source§impl<'a, 'py> PyFunctionArgument<'a, 'py, false> for &'a mut CartesianSubDomain3
impl<'a, 'py> PyFunctionArgument<'a, 'py, false> for &'a mut CartesianSubDomain3
Source§impl PyTypeInfo for CartesianSubDomain3
impl PyTypeInfo for CartesianSubDomain3
Source§fn type_object_raw(py: Python<'_>) -> *mut PyTypeObject
fn type_object_raw(py: Python<'_>) -> *mut PyTypeObject
Returns the PyTypeObject instance for this type.
§fn type_object(py: Python<'_>) -> Bound<'_, PyType>
fn type_object(py: Python<'_>) -> Bound<'_, PyType>
Returns the safe abstraction over the type object.
§fn type_object_bound(py: Python<'_>) -> Bound<'_, PyType>
fn type_object_bound(py: Python<'_>) -> Bound<'_, PyType>
👎Deprecated since 0.23.0: renamed to
PyTypeInfo::type_object
Deprecated name for [
PyTypeInfo::type_object
].§fn is_type_of(object: &Bound<'_, PyAny>) -> bool
fn is_type_of(object: &Bound<'_, PyAny>) -> bool
Checks if
object
is an instance of this type or a subclass of this type.§fn is_type_of_bound(object: &Bound<'_, PyAny>) -> bool
fn is_type_of_bound(object: &Bound<'_, PyAny>) -> bool
👎Deprecated since 0.23.0: renamed to
PyTypeInfo::is_type_of
Deprecated name for [
PyTypeInfo::is_type_of
].§fn is_exact_type_of(object: &Bound<'_, PyAny>) -> bool
fn is_exact_type_of(object: &Bound<'_, PyAny>) -> bool
Checks if
object
is an instance of this type.§fn is_exact_type_of_bound(object: &Bound<'_, PyAny>) -> bool
fn is_exact_type_of_bound(object: &Bound<'_, PyAny>) -> bool
👎Deprecated since 0.23.0: renamed to
PyTypeInfo::is_exact_type_of
Deprecated name for [
PyTypeInfo::is_exact_type_of
].Source§impl Serialize for CartesianSubDomain3
impl Serialize for CartesianSubDomain3
Source§impl<C> SortCells<C> for CartesianSubDomain3
impl<C> SortCells<C> for CartesianSubDomain3
Source§type VoxelIndex = [i64; 3]
type VoxelIndex = [i64; 3]
An index which determines to which next smaller unit the cell should be assigned.
Source§fn get_voxel_index_of(
&self,
cell: &C,
) -> Result<Self::VoxelIndex, BoundaryError>
fn get_voxel_index_of( &self, cell: &C, ) -> Result<Self::VoxelIndex, BoundaryError>
If given a cell, we can sort this cell into the corresponding sub unit.
Source§impl SubDomain for CartesianSubDomain3
impl SubDomain for CartesianSubDomain3
Source§type VoxelIndex = [i64; 3]
type VoxelIndex = [i64; 3]
Individual Voxels inside each subdomain can be accessed by this index.
Source§fn get_neighbor_voxel_indices(
&self,
index: &Self::VoxelIndex,
) -> Vec<Self::VoxelIndex>
fn get_neighbor_voxel_indices( &self, index: &Self::VoxelIndex, ) -> Vec<Self::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.
Source§fn get_all_indices(&self) -> Vec<Self::VoxelIndex>
fn get_all_indices(&self) -> Vec<Self::VoxelIndex>
Get all voxel indices of this [SubDomain].
Source§impl SubDomainMechanics<Matrix<f64, Const<3>, Const<1>, ArrayStorage<f64, 3, 1>>, Matrix<f64, Const<3>, Const<1>, ArrayStorage<f64, 3, 1>>> for CartesianSubDomain3
impl SubDomainMechanics<Matrix<f64, Const<3>, Const<1>, ArrayStorage<f64, 3, 1>>, Matrix<f64, Const<3>, Const<1>, ArrayStorage<f64, 3, 1>>> for CartesianSubDomain3
Source§fn apply_boundary(
&self,
pos: &mut SVector<f64, 3>,
velocity: &mut SVector<f64, 3>,
) -> Result<(), BoundaryError>
fn apply_boundary( &self, pos: &mut SVector<f64, 3>, velocity: &mut SVector<f64, 3>, ) -> 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.
impl DerefToPyAny for CartesianSubDomain3
Auto Trait Implementations§
impl Freeze for CartesianSubDomain3
impl RefUnwindSafe for CartesianSubDomain3
impl Send for CartesianSubDomain3
impl Sync for CartesianSubDomain3
impl Unpin for CartesianSubDomain3
impl UnwindSafe for CartesianSubDomain3
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> FromPyObject<'_> for Twhere
T: PyClass + Clone,
impl<T> FromPyObject<'_> for Twhere
T: PyClass + Clone,
§fn extract_bound(obj: &Bound<'_, PyAny>) -> Result<T, PyErr>
fn extract_bound(obj: &Bound<'_, PyAny>) -> Result<T, PyErr>
§impl<'py, T> FromPyObjectBound<'_, 'py> for Twhere
T: FromPyObject<'py>,
impl<'py, T> FromPyObjectBound<'_, 'py> for Twhere
T: FromPyObject<'py>,
§fn from_py_object_bound(ob: Borrowed<'_, 'py, PyAny>) -> Result<T, PyErr>
fn from_py_object_bound(ob: Borrowed<'_, 'py, PyAny>) -> Result<T, PyErr>
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<'py, T> IntoPyObjectExt<'py> for Twhere
T: IntoPyObject<'py>,
impl<'py, T> IntoPyObjectExt<'py> for Twhere
T: IntoPyObject<'py>,
§fn into_bound_py_any(self, py: Python<'py>) -> Result<Bound<'py, PyAny>, PyErr>
fn into_bound_py_any(self, py: Python<'py>) -> Result<Bound<'py, PyAny>, PyErr>
Converts
self
into an owned Python object, dropping type information.§fn into_py_any(self, py: Python<'py>) -> Result<Py<PyAny>, PyErr>
fn into_py_any(self, py: Python<'py>) -> Result<Py<PyAny>, PyErr>
Converts
self
into an owned Python object, dropping type information and unbinding it
from the 'py
lifetime.§fn into_pyobject_or_pyerr(self, py: Python<'py>) -> Result<Self::Output, PyErr>
fn into_pyobject_or_pyerr(self, py: Python<'py>) -> Result<Self::Output, PyErr>
Converts
self
into a Python object. Read more§impl<T> PyErrArguments for T
impl<T> PyErrArguments for T
§impl<T> PyTypeCheck for Twhere
T: PyTypeInfo,
impl<T> PyTypeCheck for Twhere
T: PyTypeInfo,
§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.