pub enum ConvForwardAlgo {
    Auto,
    GEMM,
    ImplicitGEMM,
    ImplicitPrecompiledGEMM,
    FFT,
    FFTTiling,
    Direct,
    Winograd,
    WinogradNonFused,
}
Expand description

Different algorithms to compute the convolution forward algorithm.

Variants§

§

Auto

Attempt to automatically find the best algorithm of all the other available ones.

§

GEMM

Compute the convolution as explicit matrix product.

Needs a significant memory workspace.

§

ImplicitGEMM

Compute the convolution as matrix product without forming the matrix that holds the input data.

Does not need any memory workspace.

§

ImplicitPrecompiledGEMM

Similar to ImplicitGEMM but needs some workspace to precompile the implicit indices.

§

FFT

Compute the convolution as Fast-Fourier Transform.

Needs a significant memory workspace.

§

FFTTiling

Compute the convolution as Fast-Fourier Transform with 32x32 tiles.

Needs a significant memory workspace.

§

Direct

Compute the convolution without implicit or explicit matrix-multiplication. Do not try to use this.

Listed in cuDNN docs but cuDNN does not provide a implementation.

§

Winograd

Winograd Transform

§

WinogradNonFused

Winograd Transform Non-Fused

Implementations§

source§

impl ConvForwardAlgo

source

pub fn is_auto(&self) -> bool

Check if algorithim should be chosen automatically.

Trait Implementations§

source§

impl Clone for ConvForwardAlgo

source§

fn clone(&self) -> ConvForwardAlgo

Returns a copy of the value. Read more
1.0.0 · source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
source§

impl Debug for ConvForwardAlgo

source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
source§

impl PartialEq for ConvForwardAlgo

source§

fn eq(&self, other: &ConvForwardAlgo) -> bool

This method tests for self and other values to be equal, and is used by ==.
1.0.0 · source§

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.
source§

impl Copy for ConvForwardAlgo

source§

impl Eq for ConvForwardAlgo

source§

impl StructuralPartialEq for ConvForwardAlgo

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> ToOwned for T
where T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
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.
§

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

§

fn vzip(self) -> V