pub struct CWT<W: ContinuousWavelet> { /* private fields */ }Expand description
Continuous Wavelet Transform
Implementations§
Source§impl<W: ContinuousWavelet> CWT<W>
impl<W: ContinuousWavelet> CWT<W>
Sourcepub fn new(wavelet: W, scales: Vec<f64>) -> Self
pub fn new(wavelet: W, scales: Vec<f64>) -> Self
Create a new CWT with given wavelet and scales
Sourcepub fn with_sampling_period(self, period: f64) -> Self
pub fn with_sampling_period(self, period: f64) -> Self
Set the sampling period
Sourcepub fn with_log_scales(
wavelet: W,
n_scales: usize,
min_scale: f64,
max_scale: f64,
) -> Self
pub fn with_log_scales( wavelet: W, n_scales: usize, min_scale: f64, max_scale: f64, ) -> Self
Create scales using logarithmic spacing
Sourcepub fn transform(
&self,
signal: &ArrayView1<'_, f64>,
) -> Result<Array2<Complex<f64>>>
pub fn transform( &self, signal: &ArrayView1<'_, f64>, ) -> Result<Array2<Complex<f64>>>
Compute CWT using direct convolution
Sourcepub fn transform_fft(
&self,
signal: &ArrayView1<'_, f64>,
) -> Result<Array2<Complex<f64>>>
pub fn transform_fft( &self, signal: &ArrayView1<'_, f64>, ) -> Result<Array2<Complex<f64>>>
Compute CWT using FFT (more efficient for longer signals)
Sourcepub fn scalogram(&self, signal: &ArrayView1<'_, f64>) -> Result<Array2<f64>>
pub fn scalogram(&self, signal: &ArrayView1<'_, f64>) -> Result<Array2<f64>>
Compute the scalogram (magnitude of CWT coefficients)
Sourcepub fn frequencies(&self) -> Vec<f64>
pub fn frequencies(&self) -> Vec<f64>
Get the frequencies corresponding to scales
Trait Implementations§
Auto Trait Implementations§
impl<W> Freeze for CWT<W>where
W: Freeze,
impl<W> RefUnwindSafe for CWT<W>where
W: RefUnwindSafe,
impl<W> Send for CWT<W>
impl<W> Sync for CWT<W>
impl<W> Unpin for CWT<W>where
W: Unpin,
impl<W> UnsafeUnpin for CWT<W>where
W: UnsafeUnpin,
impl<W> UnwindSafe for CWT<W>where
W: UnwindSafe,
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 moreSource§impl<T> Pointable for T
impl<T> Pointable for T
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.