pub struct StructureView<'a> {
pub positions: &'a [[f64; 3]],
pub numbers: &'a [AtomicNumber],
pub cell: Cell,
pub pbc: Pbc,
}Fields§
§positions: &'a [[f64; 3]]§numbers: &'a [AtomicNumber]§cell: Cell§pbc: PbcImplementations§
Auto Trait Implementations§
impl<'a> Freeze for StructureView<'a>
impl<'a> RefUnwindSafe for StructureView<'a>
impl<'a> Send for StructureView<'a>
impl<'a> Sync for StructureView<'a>
impl<'a> Unpin for StructureView<'a>
impl<'a> UnwindSafe for StructureView<'a>
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
§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.