pub enum OptimizationMethod {
Naive,
Reverse,
Greedy,
Optimal,
Branch,
}
Expand description
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§
Auto Trait Implementations§
impl Freeze for OptimizationMethod
impl RefUnwindSafe for OptimizationMethod
impl Send for OptimizationMethod
impl Sync for OptimizationMethod
impl Unpin for OptimizationMethod
impl UnwindSafe for OptimizationMethod
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