pub struct AmberAngle {
pub i: usize,
pub j: usize,
pub k_idx: usize,
pub k: f64,
pub theta0: f64,
}Expand description
A valence angle entry.
Fields§
§i: usizeZero-based index of the first atom.
j: usizeZero-based index of the central atom.
k_idx: usizeIndex into the angle parameter array.
k: f64Force constant (kcal mol⁻¹ rad⁻²).
theta0: f64Equilibrium angle (radians).
Auto Trait Implementations§
impl Freeze for AmberAngle
impl RefUnwindSafe for AmberAngle
impl Send for AmberAngle
impl Sync for AmberAngle
impl Unpin for AmberAngle
impl UnsafeUnpin for AmberAngle
impl UnwindSafe for AmberAngle
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<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.