pub struct RsaConfig {
pub radius: f64,
pub domain: [f64; 3],
pub max_attempts: usize,
pub min_gap: f64,
}Expand description
Random sequential adsorption (RSA) packing configuration.
Fields§
§radius: f64Sphere radius.
domain: [f64; 3]Domain dimensions [lx, ly, lz].
max_attempts: usizeMaximum number of attempts before declaring jamming.
min_gap: f64Minimum gap between spheres (m). Usually 0.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for RsaConfig
impl RefUnwindSafe for RsaConfig
impl Send for RsaConfig
impl Sync for RsaConfig
impl Unpin for RsaConfig
impl UnsafeUnpin for RsaConfig
impl UnwindSafe for RsaConfig
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,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§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 moreSource§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).Source§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.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.