pub enum SpinNormalization {
AngularMomentum,
Pauli,
PauliCartesian,
}Expand description
Normalization of local spin operators.
The distinction matters for spin one-half because two common interfaces
assign different meanings to the ladder symbols. PauliCartesian keeps
the conventional unit-amplitude sigma-plus/minus operators, while Pauli
scales every non-identity spin symbol by two relative to angular-momentum
operators.
Variants§
AngularMomentum
Conventional angular-momentum operators Sx, Sy, Sz, and S±.
Pauli
Scale every non-identity spin-half action by two.
PauliCartesian
Scale Cartesian spin-half actions as Pauli matrices but retain unit ladder actions.
Trait Implementations§
Source§impl Clone for SpinNormalization
impl Clone for SpinNormalization
Source§fn clone(&self) -> SpinNormalization
fn clone(&self) -> SpinNormalization
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for SpinNormalization
impl Debug for SpinNormalization
Source§impl Default for SpinNormalization
impl Default for SpinNormalization
Source§fn default() -> SpinNormalization
fn default() -> SpinNormalization
Returns the “default value” for a type. Read more
Source§impl PartialEq for SpinNormalization
impl PartialEq for SpinNormalization
Source§fn eq(&self, other: &SpinNormalization) -> bool
fn eq(&self, other: &SpinNormalization) -> bool
Tests for
self and other values to be equal, and is used by ==.impl Copy for SpinNormalization
impl Eq for SpinNormalization
impl StructuralPartialEq for SpinNormalization
Auto Trait Implementations§
impl Freeze for SpinNormalization
impl RefUnwindSafe for SpinNormalization
impl Send for SpinNormalization
impl Sync for SpinNormalization
impl Unpin for SpinNormalization
impl UnsafeUnpin for SpinNormalization
impl UnwindSafe for SpinNormalization
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,
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.§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.