Struct signal_processing::window::BlackmanHarris

source · 
pub struct BlackmanHarris;

Trait Implementations§

source§

impl<T, const N: usize> WindowGen<T, [T; N], ()> for BlackmanHarris
where T: Float + FloatConst,

§

type Output = [T; N]

source§

fn window_gen(&self, (): (), r: WindowRange) -> Self::Output

source§

impl<T> WindowGen<T, Vec<T>, usize> for BlackmanHarris
where T: Float + FloatConst,

§

type Output = Vec<T>

source§

fn window_gen(&self, n: usize, r: WindowRange) -> Self::Output

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> ListOrSingle<T> for T

§

type Length = usize

source§

const LENGTH: usize = 1usize

§

type Resized<const M: usize> = [T; M]

source§

fn length(&self) -> usize

source§

fn as_view_slice(&self) -> &[T]

source§

fn to_vec(&self) -> Vec<T>
where T: Clone,

source§

fn into_vec(self) -> Vec<T>
where T: Clone,

source§

impl<Some> Maybe<Some> for Some
where Some: ?Sized,

source§

fn into_option(self) -> Option<Some>

source§

fn as_option(&self) -> Option<&Some>

source§

fn as_option_mut(&mut self) -> Option<&mut Some>

source§

impl<T> MaybeAnd<T, ()> for T
where T: NotVoid + ?Sized,

§

type Output = ()

source§

impl<T> MaybeAnd<T, T> for T
where T: NotVoid + ?Sized,

§

type Output = T

source§

impl<T> MaybeNand<T, ()> for T
where T: NotVoid + ?Sized,

§

type Output = T

source§

impl<T> MaybeNand<T, T> for T
where T: NotVoid + ?Sized,

§

type Output = ()

source§

impl<T> MaybeNor<T, ()> for T
where T: NotVoid + ?Sized,

§

type Output = ()

source§

impl<T> MaybeNor<T, T> for T
where T: NotVoid + ?Sized,

§

type Output = ()

source§

impl<T> MaybeOr<T, ()> for T
where T: NotVoid + ?Sized,

§

type Output = T

source§

impl<T> MaybeOr<T, T> for T
where T: NotVoid + ?Sized,

§

type Output = T

source§

impl<T> MaybeXnor<T, ()> for T
where T: NotVoid + ?Sized,

§

type Output = ()

source§

impl<T> MaybeXnor<T, T> for T
where T: NotVoid + ?Sized,

§

type Output = T

source§

impl<T> MaybeXor<T, ()> for T
where T: NotVoid + ?Sized,

§

type Output = T

source§

impl<T> MaybeXor<T, T> for T
where T: NotVoid + ?Sized,

§

type Output = ()

source§

impl<T, E> ResultOrOk<T, E> for T

source§

fn into_result(self) -> Result<T, E>

source§

fn as_result(&self) -> Result<&T, &E>

source§

fn as_result_mut(&mut self) -> Result<&mut T, &mut E>

source§

impl<T> Same for T

§

type Output = T

Should always be Self
source§

impl<Some> StaticMaybe<Some> for Some
where Some: NotVoid + ?Sized,

source§

const IS_SOME: bool = true

source§

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

source§

fn maybe_from_fn<F>(func: F) -> Some
where F: FnOnce() -> Some,

source§

fn maybe_or_from_fn<M, O>( maybe: M, _or: O ) -> <Some as StaticMaybe<Some>>::MaybeOr<<M as FnOnce()>::Output, <O as FnOnce()>::Output>
where M: FnOnce(), O: FnOnce(),

source§

fn maybe_map<F>( self, map: F ) -> <Some as StaticMaybe<Some>>::Maybe<<F as FnOnce(Some)>::Output>
where F: FnOnce(Some), <F as FnOnce(Some)>::Output: StaticMaybe<<F as FnOnce(Some)>::Output>, <Some as StaticMaybe<Some>>::Maybe<<F as FnOnce(Some)>::Output>: Sized,

source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
source§

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

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

source§

fn vzip(self) -> V