pub struct HaarWavelet;Expand description
Haar wavelet transform (single level and multi-level decomposition).
The Haar wavelet is the simplest orthogonal wavelet, based on piecewise constant functions.
Implementations§
Source§impl HaarWavelet
impl HaarWavelet
Sourcepub fn forward(signal: &[f64]) -> (Vec<f64>, Vec<f64>)
pub fn forward(signal: &[f64]) -> (Vec<f64>, Vec<f64>)
Compute one level of the forward Haar transform.
Returns (approx, detail) where each output has length signal.len() / 2.
The input length should be even; if odd the last sample is dropped.
Auto Trait Implementations§
impl Freeze for HaarWavelet
impl RefUnwindSafe for HaarWavelet
impl Send for HaarWavelet
impl Sync for HaarWavelet
impl Unpin for HaarWavelet
impl UnsafeUnpin for HaarWavelet
impl UnwindSafe for HaarWavelet
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<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.