pub enum BondOrder {
Single,
Double,
Triple,
Aromatic,
}Expand description
Bond multiplicity definitions used when describing topology edges.
Distinguishes classical single, double, triple, and aromatic delocalized interactions so that exported formats and force-field derivations can preserve chemical intent.
Variants§
Single
Classical single bond.
Double
Double bond with two shared electron pairs.
Triple
Triple bond with three shared electron pairs.
Aromatic
Aromatic bond representing delocalized pi systems.
Implementations§
Source§impl BondOrder
impl BondOrder
Sourcepub fn value(&self) -> f64
pub fn value(&self) -> f64
Converts the bond order to a numeric multiplicity.
The returned value feeds file writers and geometry algorithms that require floating-point weights while still preserving the qualitative order.
§Returns
The multiplicity expressed as an f64 (1.0, 2.0, 3.0, or 1.5 for aromatic).
Trait Implementations§
Source§impl<'de> Deserialize<'de> for BondOrder
impl<'de> Deserialize<'de> for BondOrder
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
impl Copy for BondOrder
impl Eq for BondOrder
impl StructuralPartialEq for BondOrder
Auto Trait Implementations§
impl Freeze for BondOrder
impl RefUnwindSafe for BondOrder
impl Send for BondOrder
impl Sync for BondOrder
impl Unpin for BondOrder
impl UnwindSafe for BondOrder
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.