Enum Strategy 

#[non_exhaustive]
pub enum Strategy {
    Auto,
    Optimal,
    Greedy,
    Explicit(Vec<Vec<usize>>),
}

Selects how a contraction path is built.

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

Auto

Searches all contraction trees for up to eight operands and uses a greedy search above that limit.

Optimal

Searches all contraction trees without the eight-operand cutoff.

Expressions above eight operands currently use the greedy search to keep planning time bounded.

Greedy

Repeatedly contracts the pair with the lowest greedy score.

Explicit(Vec<Vec<usize>>)

Uses caller-supplied current-list indices.

Each step removes its operands and appends its intermediate.

Trait Implementations

impl Clone for Strategy

fn clone(&self) -> Strategy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Strategy

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

Formats the value using the given formatter.

impl Default for Strategy

fn default() -> Strategy

Returns the “default value” for a type.

impl Eq for Strategy

impl PartialEq for Strategy

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Strategy