pub struct SpinState { /* private fields */ }Expand description
A validated spin state with spin and projection stored as doubled quantum numbers.
Implementations§
Source§impl SpinState
impl SpinState
Sourcepub fn new(spin: AngularMomentum, projection: Projection) -> LadduResult<Self>
pub fn new(spin: AngularMomentum, projection: Projection) -> LadduResult<Self>
Construct a spin state after validating projection bounds and parity.
Sourcepub const fn spin(self) -> AngularMomentum
pub const fn spin(self) -> AngularMomentum
Return the spin quantum number.
Sourcepub const fn projection(self) -> Projection
pub const fn projection(self) -> Projection
Return the spin projection quantum number.
Sourcepub fn allowed_projections(spin: AngularMomentum) -> Vec<Self>
pub fn allowed_projections(spin: AngularMomentum) -> Vec<Self>
Enumerate all allowed projections for spin.
Trait Implementations§
Source§impl<'de> Deserialize<'de> for SpinState
impl<'de> Deserialize<'de> for SpinState
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 SpinState
impl Eq for SpinState
impl StructuralPartialEq for SpinState
Auto Trait Implementations§
impl Freeze for SpinState
impl RefUnwindSafe for SpinState
impl Send for SpinState
impl Sync for SpinState
impl Unpin for SpinState
impl UnsafeUnpin for SpinState
impl UnwindSafe for SpinState
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<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> Serialize for T
impl<T> Serialize for T
fn erased_serialize(&self, serializer: &mut dyn Serializer) -> Result<(), Error>
fn do_erased_serialize( &self, serializer: &mut dyn Serializer, ) -> Result<(), ErrorImpl>
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.