Struct signal_processing::windows::BlackmanHarris
source · pub struct BlackmanHarris;
Trait Implementations§
source§impl<T, const N: usize> WindowGen<T, [T; N], ()> for BlackmanHarriswhere
T: Float + FloatConst,
impl<T, const N: usize> WindowGen<T, [T; N], ()> for BlackmanHarriswhere
T: Float + FloatConst,
type Output = [T; N]
fn window_gen(&self, (): (), r: WindowRange) -> Self::Output
source§impl<T> WindowGen<T, Vec<T>, usize> for BlackmanHarriswhere
T: Float + FloatConst,
impl<T> WindowGen<T, Vec<T>, usize> for BlackmanHarriswhere
T: Float + FloatConst,
type Output = Vec<T>
fn window_gen(&self, n: usize, r: WindowRange) -> Self::Output
Auto Trait Implementations§
impl Freeze for BlackmanHarris
impl NotPolynomial for BlackmanHarris
impl NotRange for BlackmanHarris
impl NotVoid for BlackmanHarris
impl RefUnwindSafe for BlackmanHarris
impl Send for BlackmanHarris
impl Sync for BlackmanHarris
impl Unpin for BlackmanHarris
impl UnwindSafe for BlackmanHarris
Blanket Implementations§
source§impl<T, X, XX, N> BSplineEval<T, X, N> for XX
impl<T, X, XX, N> BSplineEval<T, X, N> for XX
fn bspline_eval<TT, C, CC>(
self,
numtaps: N,
knots: TT,
control_points: CC,
degree: usize
) -> (<X as ContainerOrSingle<T>>::Mapped<<C as ContainerOrSingle<T>>::Mapped<T>>, X)where
TT: List<T>,
C: ListOrSingle<T> + Clone,
<C as ContainerOrSingle<T>>::Mapped<T>: OwnedListOrSingle<T, Length = usize>,
CC: List<C>,
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, C, X, XX, N> CSpline1dEval<T, X, N, C> for XXwhere
T: Float + AddAssign,
XX: IntoList<T, X, N>,
X: ListOrSingle<T>,
<X as ContainerOrSingle<T>>::Mapped<T>: OwnedListOrSingle<T>,
N: Maybe<usize>,
C: List<T>,
impl<T, C, X, XX, N> CSpline1dEval<T, X, N, C> for XXwhere
T: Float + AddAssign,
XX: IntoList<T, X, N>,
X: ListOrSingle<T>,
<X as ContainerOrSingle<T>>::Mapped<T>: OwnedListOrSingle<T>,
N: Maybe<usize>,
C: List<T>,
fn cspline_1d_eval( self, numtaps: N, c: C ) -> (<X as ContainerOrSingle<T>>::Mapped<T>, X)
source§impl<T, L, R, N> Chirp<T, L, N> for R
impl<T, L, R, N> Chirp<T, L, N> for R
fn chirp( self, n: N, frequencies: Range<T>, times: Range<T>, curve: ChirpCurve, phase: T ) -> (<L as ContainerOrSingle<T>>::Mapped<T>, L)
source§impl<T> ContainerOrSingle<T> for T
impl<T> ContainerOrSingle<T> for T
type Index = ()
type Mapped<M> = M
fn map_to_owned<'a, F>( &'a self, map: F ) -> <T as ContainerOrSingle<T>>::Mapped<<F as FnOnce(&'a T)>::Output>
fn map_into_owned<F>( self, map: F ) -> <T as ContainerOrSingle<T>>::Mapped<<F as FnOnce(T)>::Output>
fn try_map_to_owned<'a, F, O, E>( &'a self, map: F ) -> Result<<T as ContainerOrSingle<T>>::Mapped<O>, E>
fn try_map_into_owned<F, O, E>( self, map: F ) -> Result<<T as ContainerOrSingle<T>>::Mapped<O>, E>
fn index_get(&self, _: <T as ContainerOrSingle<T>>::Index) -> Option<&T>
source§impl<T, L, R, N> GMonoPuls<T, L, N> for R
impl<T, L, R, N> GMonoPuls<T, L, N> for R
fn gmonopuls(self, n: N, fc: T) -> (<L as ContainerOrSingle<T>>::Mapped<T>, L)
source§impl<T, L, R, N> GausPuls<T, L, N> for R
impl<T, L, R, N> GausPuls<T, L, N> for R
fn gauspuls( self, n: N, fc: T, bw: T ) -> (<L as ContainerOrSingle<T>>::Mapped<T>, <L as ContainerOrSingle<T>>::Mapped<T>, <L as ContainerOrSingle<T>>::Mapped<T>, L)
source§impl<T, L, R, N> GaussSpline<T, L, N> for R
impl<T, L, R, N> GaussSpline<T, L, N> for R
fn gauss_spline( self, n: N, order: usize ) -> (<L as ContainerOrSingle<T>>::Mapped<T>, L)
source§impl<T, L, R, N> HaarWavF<T, L, N> for R
impl<T, L, R, N> HaarWavF<T, L, N> for R
fn haarwavf(self, n: N) -> (<L as ContainerOrSingle<T>>::Mapped<T>, L)
source§impl<T> ListOrSingle<T> for T
impl<T> ListOrSingle<T> for T
source§impl<T> ListsOrSingle<T> for T
impl<T> ListsOrSingle<T> for T
source§impl<T> MatrixOrSingle<T> for T
impl<T> MatrixOrSingle<T> for T
source§impl<T, L, R, N> Mexihat<T, L, N> for R
impl<T, L, R, N> Mexihat<T, L, N> for R
fn mexihat(self, n: N) -> (<L as ContainerOrSingle<T>>::Mapped<T>, L)
source§impl<T, L, R, N> Meyeraux<T, L, N> for R
impl<T, L, R, N> Meyeraux<T, L, N> for R
fn meyeraux(self, n: N) -> (<L as ContainerOrSingle<T>>::Mapped<T>, L)
source§impl<T, L, R, N> Morlet<T, L, N> for R
impl<T, L, R, N> Morlet<T, L, N> for R
fn morlet(self, n: N) -> (<L as ContainerOrSingle<T>>::Mapped<T>, L)
source§impl<T> OwnedListOrSingle<T> for T
impl<T> OwnedListOrSingle<T> for T
fn from_len_fn<F>( _: <<T as ListOrSingle<T>>::Length as StaticMaybe<usize>>::Opposite, f: F ) -> T
fn as_mut_slice(&mut self) -> &mut [T]
source§impl<T, L, RR, N> PulseTrain<T, L, N> for RR
impl<T, L, RR, N> PulseTrain<T, L, N> for RR
fn pulse_train<D, G, GG, P, R, O>(
self,
n: N,
train: D,
pulse: P,
fold: R
) -> (<D as ContainerOrSingle<(T, GG)>>::Mapped<<L as ContainerOrSingle<T>>::Mapped<O>>, <L as ContainerOrSingle<T>>::Mapped<O>, L)where
D: ListOrSingle<(T, GG)>,
GG: StaticMaybe<G, MaybeOr<G, T> = G> + Clone,
G: Clone,
<D as ContainerOrSingle<(T, GG)>>::Mapped<<L as ContainerOrSingle<T>>::Mapped<O>>: ListOrSingle<<L as ContainerOrSingle<T>>::Mapped<O>>,
<L as ContainerOrSingle<T>>::Mapped<O>: ListOrSingle<O>,
P: FnMut(T),
R: Fn(O, O) -> O,
O: Zero + Clone,
<P as FnOnce(T)>::Output: Clone + Mul<G, Output = O>,
source§impl<T, C, X, XX, N> QSpline1dEval<T, X, N, C> for XXwhere
T: Float + AddAssign,
XX: IntoList<T, X, N>,
X: ListOrSingle<T>,
<X as ContainerOrSingle<T>>::Mapped<T>: OwnedListOrSingle<T>,
N: Maybe<usize>,
C: List<T>,
impl<T, C, X, XX, N> QSpline1dEval<T, X, N, C> for XXwhere
T: Float + AddAssign,
XX: IntoList<T, X, N>,
X: ListOrSingle<T>,
<X as ContainerOrSingle<T>>::Mapped<T>: OwnedListOrSingle<T>,
N: Maybe<usize>,
C: List<T>,
fn qspline_1d_eval( self, numtaps: N, c: C ) -> (<X as ContainerOrSingle<T>>::Mapped<T>, X)
source§impl<T, L, R, N> RectPuls<T, L, N> for R
impl<T, L, R, N> RectPuls<T, L, N> for R
fn rectpuls( self, n: N, bandwidth: T ) -> (<L as ContainerOrSingle<T>>::Mapped<T>, L)
source§impl<T, E> ResultOrOk<T, E> for T
impl<T, E> ResultOrOk<T, E> for T
source§impl<T, L, R, N> SigmoidTrain<T, L, N> for Rwhere
T: Float + FloatConst,
L: ListOrSingle<T>,
R: IntoList<T, L, N>,
N: Maybe<usize>,
<L as ContainerOrSingle<T>>::Mapped<T>: ListOrSingle<T>,
impl<T, L, R, N> SigmoidTrain<T, L, N> for Rwhere
T: Float + FloatConst,
L: ListOrSingle<T>,
R: IntoList<T, L, N>,
N: Maybe<usize>,
<L as ContainerOrSingle<T>>::Mapped<T>: ListOrSingle<T>,
fn sigmoid_train<TR>(
self,
n: N,
train: TR
) -> (<TR as ContainerOrSingle<(Range<T>, T, T)>>::Mapped<<L as ContainerOrSingle<T>>::Mapped<T>>, <L as ContainerOrSingle<T>>::Mapped<T>, L)where
TR: ListOrSingle<(Range<T>, T, T)>,
<TR as ContainerOrSingle<(Range<T>, T, T)>>::Mapped<<L as ContainerOrSingle<T>>::Mapped<T>>: ListOrSingle<<L as ContainerOrSingle<T>>::Mapped<T>>,
source§impl<Some> StaticMaybe<Some> for Some
impl<Some> StaticMaybe<Some> for Some
const IS_SOME: bool = true
const IS_NONE: bool = false
type None = ()
type Some = Some
type Opposite = ()
type Maybe<M: StaticMaybe<M> + ?Sized> = <M as StaticMaybe<M>>::Some
type MaybeOr<M: ?Sized, O: ?Sized> = M
fn maybe_from_fn<F>(func: F) -> Somewhere
F: FnOnce() -> Some,
fn maybe_or_from_fn<M, O>( maybe: M, _or: O ) -> <Some as StaticMaybe<Some>>::MaybeOr<<M as FnOnce()>::Output, <O as FnOnce()>::Output>
fn maybe_map<F>( self, map: F ) -> <Some as StaticMaybe<Some>>::Maybe<<F as FnOnce(Some)>::Output>
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.