pub struct WaveLabel {
pub l: i32,
pub m: i32,
pub pol: u8,
}Expand description
The integer labels of one vector wave.
Each Family reads some of the fields:
| Family | Reads |
|---|---|
HarmonicX, HarmonicY, HarmonicZ | l, m |
Spherical | l, m, pol |
Cylindrical | m, pol |
Plane | pol |
Every evaluation accepts 0 <= l <= 128, |m| <= 128 and pol 0 or 1, whatever the
family. Every harmonic and spherical wave with |m| > l is zero. At l = 0 the
spherical waves and the X and Y harmonics are zero, and the Z harmonic is i Y_00.
Fields§
§l: i32Degree.
m: i32Order.
pol: u8Polarization index: M/N (0/1), or negative/positive helicity.
Trait Implementations§
impl Copy for WaveLabel
impl Eq for WaveLabel
impl StructuralPartialEq for WaveLabel
Auto Trait Implementations§
impl Freeze for WaveLabel
impl RefUnwindSafe for WaveLabel
impl Send for WaveLabel
impl Sync for WaveLabel
impl Unpin for WaveLabel
impl UnwindSafe for WaveLabel
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<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 more§impl<T> Pointable for T
impl<T> Pointable for T
§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.