Enum GammaStrategy
#[non_exhaustive]pub enum GammaStrategy {
Auto,
Fixed(f64),
}Expand description
How to choose the Meyer transition-width parameter γ.
γ must satisfy Gilles 2013 Eq. 8 — γ < min_n (ω_{n+1} − ω_n) / (ω_{n+1} + ω_n) with virtual end-points ω_0 = 0, ω_{N+1} = π — so
that adjacent Meyer transitions do not overlap. The resolved value is
stored in EWTResult::gamma.
Variants (Non-exhaustive)§
This enum is marked as non-exhaustive
Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.
Auto
Use γ = AUTO_GAMMA_SAFETY · γ_max. The safety factor sits just
below γ_max so the transitions touch but do not overlap.
Fixed(f64)
Pin γ to a caller-supplied value. Must satisfy 0 < γ < γ_max;
otherwise ewt returns WaveletError::InvalidParameter.
Trait Implementations§
§impl Clone for GammaStrategy
impl Clone for GammaStrategy
§fn clone(&self) -> GammaStrategy
fn clone(&self) -> GammaStrategy
Returns a duplicate of the value. Read more
1.0.0§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read more§impl Debug for GammaStrategy
impl Debug for GammaStrategy
impl Copy for GammaStrategy
Auto Trait Implementations§
impl Freeze for GammaStrategy
impl RefUnwindSafe for GammaStrategy
impl Send for GammaStrategy
impl Sync for GammaStrategy
impl Unpin for GammaStrategy
impl UnwindSafe for GammaStrategy
Blanket Implementations§
§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§unsafe fn clone_to_uninit(&self, dest: *mut u8)
unsafe fn clone_to_uninit(&self, dest: *mut u8)
🔬This is a nightly-only experimental API. (
clone_to_uninit)§impl<T> IntoEither for T
impl<T> IntoEither for T
§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 more§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.