pub struct MiePotential {
pub radius: f64,
pub strength: f64,
pub bound: f64,
pub cutoff: f64,
pub en: f64,
pub em: f64,
}
Expand description
Generalizeation of the BoundLennardJones potential.
\begin{align} U(r) &= C\epsilon\left[ \left(\frac{\sigma}{r}\right)^n - \left(\frac{\sigma}{r}\right)^m\right]\\ C &= \frac{n}{n-m}\left(\frac{n}{m}\right)^{\frac{n}{n-m}}\\ V(r) &= \min(U(r), \beta)\theta(r-\zeta) \end{align}
This struct comes in a 64bit version MiePotential and a 32bit variant MiePotentialF32.
§References
G. Mie, “Zur kinetischen Theorie der einatomigen Körper,” Annalen der Physik, vol. 316, no. 8. Wiley, pp. 657–697, Jan. 1903. doi: 10.1002/andp.19033160802.
Fields§
§radius: f64
Interaction strength $\epsilon$ of the potential.
strength: f64
Overall size $\sigma$ of the object of the potential.
bound: f64
Numerical bound $\beta$ of the interaction strength.
cutoff: f64
Defines a cutoff $\zeta$ after which the potential will be fixed to exactly zero.
en: f64
Exponent $n$ of the potential
em: f64
Exponent $m$ of the potential
Implementations§
Source§impl MiePotential
impl MiePotential
Sourcepub fn new(
radius: f64,
strength: f64,
bound: f64,
cutoff: f64,
en: f64,
em: f64,
) -> Self
Available on crate feature pyo3
only.
pub fn new( radius: f64, strength: f64, bound: f64, cutoff: f64, en: f64, em: f64, ) -> Self
pyo3
only.Constructs a new MiePotential
use cellular_raza_building_blocks::MiePotential;
let (radius, strength, bound, cutoff, en, em) = (1.0, 1.0, 1.0, 1.0, 1.0, 1.0);
let mie_potential = MiePotential::new(
radius,
strength,
bound,
cutoff,
en,
em,
);
Trait Implementations§
Source§impl Clone for MiePotential
impl Clone for MiePotential
Source§fn clone(&self) -> MiePotential
fn clone(&self) -> MiePotential
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moreSource§impl Debug for MiePotential
impl Debug for MiePotential
Source§impl<'de> Deserialize<'de> for MiePotential
impl<'de> Deserialize<'de> for MiePotential
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>,
Source§impl<const D: usize> Interaction<Matrix<f64, Const<D>, Const<1>, ArrayStorage<f64, D, 1>>, Matrix<f64, Const<D>, Const<1>, ArrayStorage<f64, D, 1>>, Matrix<f64, Const<D>, Const<1>, ArrayStorage<f64, D, 1>>, f64> for MiePotential
impl<const D: usize> Interaction<Matrix<f64, Const<D>, Const<1>, ArrayStorage<f64, D, 1>>, Matrix<f64, Const<D>, Const<1>, ArrayStorage<f64, D, 1>>, Matrix<f64, Const<D>, Const<1>, ArrayStorage<f64, D, 1>>, f64> for MiePotential
Source§fn calculate_force_between(
&self,
own_pos: &SVector<f64, D>,
_own_vel: &SVector<f64, D>,
ext_pos: &SVector<f64, D>,
_ext_vel: &SVector<f64, D>,
ext_radius: &f64,
) -> Result<(SVector<f64, D>, SVector<f64, D>), CalcError>
fn calculate_force_between( &self, own_pos: &SVector<f64, D>, _own_vel: &SVector<f64, D>, ext_pos: &SVector<f64, D>, _ext_vel: &SVector<f64, D>, ext_radius: &f64, ) -> Result<(SVector<f64, D>, SVector<f64, D>), CalcError>
Source§fn get_interaction_information(&self) -> f64
fn get_interaction_information(&self) -> f64
§fn is_neighbor(
&self,
own_pos: &Pos,
ext_pos: &Pos,
ext_inf: &Inf,
) -> Result<bool, CalcError>
fn is_neighbor( &self, own_pos: &Pos, ext_pos: &Pos, ext_inf: &Inf, ) -> Result<bool, CalcError>
§fn react_to_neighbors(&mut self, neighbors: usize) -> Result<(), CalcError>
fn react_to_neighbors(&mut self, neighbors: usize) -> Result<(), CalcError>
Source§impl IntoPy<Py<PyAny>> for MiePotential
impl IntoPy<Py<PyAny>> for MiePotential
Source§impl PartialEq for MiePotential
impl PartialEq for MiePotential
Source§impl PyClass for MiePotential
impl PyClass for MiePotential
Source§impl PyClassImpl for MiePotential
impl PyClassImpl for MiePotential
Source§const IS_BASETYPE: bool = false
const IS_BASETYPE: bool = false
Source§const IS_SUBCLASS: bool = false
const IS_SUBCLASS: bool = false
Source§const IS_MAPPING: bool = false
const IS_MAPPING: bool = false
Source§const IS_SEQUENCE: bool = false
const IS_SEQUENCE: bool = false
Source§type ThreadChecker = SendablePyClass<MiePotential>
type ThreadChecker = SendablePyClass<MiePotential>
Source§type PyClassMutability = <<PyAny as PyClassBaseType>::PyClassMutability as PyClassMutability>::MutableChild
type PyClassMutability = <<PyAny as PyClassBaseType>::PyClassMutability as PyClassMutability>::MutableChild
Source§type BaseNativeType = PyAny
type BaseNativeType = PyAny
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 PyClassNewTextSignature<MiePotential> for PyClassImplCollector<MiePotential>
impl PyClassNewTextSignature<MiePotential> for PyClassImplCollector<MiePotential>
fn new_text_signature(self) -> Option<&'static str>
Source§impl<'a, 'py> PyFunctionArgument<'a, 'py> for &'a MiePotential
impl<'a, 'py> PyFunctionArgument<'a, 'py> for &'a MiePotential
Source§impl<'a, 'py> PyFunctionArgument<'a, 'py> for &'a mut MiePotential
impl<'a, 'py> PyFunctionArgument<'a, 'py> for &'a mut MiePotential
Source§impl PyMethods<MiePotential> for PyClassImplCollector<MiePotential>
impl PyMethods<MiePotential> for PyClassImplCollector<MiePotential>
fn py_methods(self) -> &'static PyClassItems
Source§impl PyTypeInfo for MiePotential
impl PyTypeInfo for MiePotential
Source§fn type_object_raw(py: Python<'_>) -> *mut PyTypeObject
fn type_object_raw(py: Python<'_>) -> *mut PyTypeObject
§fn type_object_bound(py: Python<'_>) -> Bound<'_, PyType>
fn type_object_bound(py: Python<'_>) -> Bound<'_, PyType>
§fn is_type_of_bound(object: &Bound<'_, PyAny>) -> bool
fn is_type_of_bound(object: &Bound<'_, PyAny>) -> bool
object
is an instance of this type or a subclass of this type.§fn is_exact_type_of_bound(object: &Bound<'_, PyAny>) -> bool
fn is_exact_type_of_bound(object: &Bound<'_, PyAny>) -> bool
object
is an instance of this type.Source§impl Serialize for MiePotential
impl Serialize for MiePotential
impl DerefToPyAny for MiePotential
impl StructuralPartialEq for MiePotential
Auto Trait Implementations§
impl Freeze for MiePotential
impl RefUnwindSafe for MiePotential
impl Send for MiePotential
impl Sync for MiePotential
impl Unpin for MiePotential
impl UnwindSafe for MiePotential
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
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>
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>
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> 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>
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.