pub struct BasisSet {
pub name: String,
pub elements: HashMap<String, ElementBasis>,
}Expand description
A named basis set (e.g., “STO-3G”, “6-31G*”, “cc-pVDZ”).
Fields§
§name: StringName of the basis set.
elements: HashMap<String, ElementBasis>Per-element basis data.
Implementations§
Source§impl BasisSet
impl BasisSet
Sourcepub fn add_element(&mut self, basis: ElementBasis)
pub fn add_element(&mut self, basis: ElementBasis)
Add an element basis.
Sourcepub fn total_basis_functions(&self, atom_symbols: &[&str]) -> usize
pub fn total_basis_functions(&self, atom_symbols: &[&str]) -> usize
Total number of basis functions for a molecule described by atom_symbols.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for BasisSet
impl RefUnwindSafe for BasisSet
impl Send for BasisSet
impl Sync for BasisSet
impl Unpin for BasisSet
impl UnsafeUnpin for BasisSet
impl UnwindSafe for BasisSet
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.