[][src]Enum ndarray_einsum_beta::OptimizationMethod

pub enum OptimizationMethod {
    Naive,
    Reverse,
    Greedy,
    Optimal,
    Branch,
}

Strategy for optimizing the contraction. The only currently supported options are "Naive" and "Reverse".

TODO: Figure out whether this should be done with traits

Variants

Naive

Contracts each pair of tensors in the order given in the input and uses the intermediate result as the LHS of the next contraction.

Reverse

Contracts each pair of tensors in the reverse of the order given in the input and uses the intermediate result as the LHS of the next contraction. Only implemented to help test that this is actually functioning properly.

Greedy

(Not yet supported) Something like this

Optimal

(Not yet supported) Something like this

Branch

(Not yet supported) Something like this

Trait Implementations

impl Debug for OptimizationMethod[src]

Auto Trait Implementations

Blanket Implementations

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, 
[src]

impl<T, U> TryFrom<U> for T where
    U: Into<T>, 
[src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, 
[src]

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

The type returned in the event of a conversion error.

impl<T> BorrowMut<T> for T where
    T: ?Sized
[src]

impl<T> Borrow<T> for T where
    T: ?Sized
[src]

impl<T> Any for T where
    T: 'static + ?Sized
[src]