Struct Coiflet
pub struct Coiflet { /* private fields */ }Expand description
Coiflet wavelet family
Coiflets are a family of wavelets designed by Ingrid Daubechies at the request of Ronald Coifman. The wavelet function has 2N vanishing moments and the scaling function has 2N-1 vanishing moments. They are more symmetrical than Daubechies wavelets.
Implementations§
Trait Implementations§
§impl Wavelet for Coiflet
impl Wavelet for Coiflet
§fn vanishing_moments(&self) -> usize
fn vanishing_moments(&self) -> usize
Get the number of vanishing moments
§fn support_width(&self) -> usize
fn support_width(&self) -> usize
Get the support width (filter length)
§fn low_pass_decomposition(&self) -> &[f64]
fn low_pass_decomposition(&self) -> &[f64]
Get the low-pass decomposition filter coefficients
§fn high_pass_decomposition(&self) -> &[f64]
fn high_pass_decomposition(&self) -> &[f64]
Get the high-pass decomposition filter coefficients
§fn low_pass_reconstruction(&self) -> &[f64]
fn low_pass_reconstruction(&self) -> &[f64]
Get the low-pass reconstruction filter coefficients
§fn high_pass_reconstruction(&self) -> &[f64]
fn high_pass_reconstruction(&self) -> &[f64]
Get the high-pass reconstruction filter coefficients
§fn is_orthogonal(&self) -> bool
fn is_orthogonal(&self) -> bool
Check if the wavelet is orthogonal
§fn is_biorthogonal(&self) -> bool
fn is_biorthogonal(&self) -> bool
Check if the wavelet is biorthogonal
Auto Trait Implementations§
impl Freeze for Coiflet
impl RefUnwindSafe for Coiflet
impl Send for Coiflet
impl Sync for Coiflet
impl Unpin for Coiflet
impl UnwindSafe for Coiflet
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.