Struct BoundLennardJonesF32
pub struct BoundLennardJonesF32 {
pub epsilon: f32,
pub sigma: f32,
pub bound: f32,
pub cutoff: f32,
}
Expand description
Identical to BoundLennardJones but for f32
type.
Fields§
§epsilon: f32
Interaction strength $\epsilon$ of the potential.
sigma: f32
Overall size $\sigma$ of the object of the potential.
bound: f32
Numerical bound $\beta$ of the interaction strength.
cutoff: f32
Defines a cutoff $\zeta$ after which the potential will be fixed to exactly zero.
Trait Implementations§
§impl Clone for BoundLennardJonesF32
impl Clone for BoundLennardJonesF32
§fn clone(&self) -> BoundLennardJonesF32
fn clone(&self) -> BoundLennardJonesF32
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 Debug for BoundLennardJonesF32
impl Debug for BoundLennardJonesF32
§impl<'de> Deserialize<'de> for BoundLennardJonesF32
impl<'de> Deserialize<'de> for BoundLennardJonesF32
§fn deserialize<__D>(
__deserializer: __D,
) -> Result<BoundLennardJonesF32, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(
__deserializer: __D,
) -> Result<BoundLennardJonesF32, <__D as Deserializer<'de>>::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
§impl<const D: usize> Interaction<Matrix<f32, Const<D>, Const<1>, ArrayStorage<f32, D, 1>>, Matrix<f32, Const<D>, Const<1>, ArrayStorage<f32, D, 1>>, Matrix<f32, Const<D>, Const<1>, ArrayStorage<f32, D, 1>>> for BoundLennardJonesF32
impl<const D: usize> Interaction<Matrix<f32, Const<D>, Const<1>, ArrayStorage<f32, D, 1>>, Matrix<f32, Const<D>, Const<1>, ArrayStorage<f32, D, 1>>, Matrix<f32, Const<D>, Const<1>, ArrayStorage<f32, D, 1>>> for BoundLennardJonesF32
§fn calculate_force_between(
&self,
own_pos: &Matrix<f32, Const<D>, Const<1>, ArrayStorage<f32, D, 1>>,
_own_vel: &Matrix<f32, Const<D>, Const<1>, ArrayStorage<f32, D, 1>>,
ext_pos: &Matrix<f32, Const<D>, Const<1>, ArrayStorage<f32, D, 1>>,
_ext_vel: &Matrix<f32, Const<D>, Const<1>, ArrayStorage<f32, D, 1>>,
_ext_information: &(),
) -> Result<(Matrix<f32, Const<D>, Const<1>, ArrayStorage<f32, D, 1>>, Matrix<f32, Const<D>, Const<1>, ArrayStorage<f32, D, 1>>), CalcError>
fn calculate_force_between( &self, own_pos: &Matrix<f32, Const<D>, Const<1>, ArrayStorage<f32, D, 1>>, _own_vel: &Matrix<f32, Const<D>, Const<1>, ArrayStorage<f32, D, 1>>, ext_pos: &Matrix<f32, Const<D>, Const<1>, ArrayStorage<f32, D, 1>>, _ext_vel: &Matrix<f32, Const<D>, Const<1>, ArrayStorage<f32, D, 1>>, _ext_information: &(), ) -> Result<(Matrix<f32, Const<D>, Const<1>, ArrayStorage<f32, D, 1>>, Matrix<f32, Const<D>, Const<1>, ArrayStorage<f32, D, 1>>), CalcError>
Calculates the forces (velocity-derivative) on the corresponding external position given
external velocity.
By providing velocities, we can calculate terms that are related to friction.
The function returns two forces, one acting on the current agent and the other on the
external agent.
§fn get_interaction_information(&self)
fn get_interaction_information(&self)
Get additional information of cellular properties (ie. for cell-specific interactions).
For now, this can also be used to get the mass of the other cell-agent.
In the future, we will probably provide a custom function for this.
§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>
Checks if the other cell represented by position and information is a neighbor to the current one or not.
§fn react_to_neighbors(&mut self, neighbors: usize) -> Result<(), CalcError>
fn react_to_neighbors(&mut self, neighbors: usize) -> Result<(), CalcError>
Reacts to the results gathered by the Interaction::is_neighbor
method and changes the state of the cell.
§impl IntoPy<Py<PyAny>> for BoundLennardJonesF32
impl IntoPy<Py<PyAny>> for BoundLennardJonesF32
§impl PyClass for BoundLennardJonesF32
impl PyClass for BoundLennardJonesF32
§impl PyTypeInfo for BoundLennardJonesF32
impl PyTypeInfo for BoundLennardJonesF32
§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_bound(py: Python<'_>) -> Bound<'_, PyType>
fn type_object_bound(py: Python<'_>) -> Bound<'_, PyType>
Returns the safe abstraction over the type object.
§fn is_type_of_bound(object: &Bound<'_, PyAny>) -> bool
fn is_type_of_bound(object: &Bound<'_, PyAny>) -> bool
Checks if
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
Checks if
object
is an instance of this type.§impl Serialize for BoundLennardJonesF32
impl Serialize for BoundLennardJonesF32
§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 DerefToPyAny for BoundLennardJonesF32
Auto Trait Implementations§
impl Freeze for BoundLennardJonesF32
impl RefUnwindSafe for BoundLennardJonesF32
impl Send for BoundLennardJonesF32
impl Sync for BoundLennardJonesF32
impl Unpin for BoundLennardJonesF32
impl UnwindSafe for BoundLennardJonesF32
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>
§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<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.