Enum PartitionOrder 

pub enum PartitionOrder {
    Unchanged,
    SmallestFirst,
    LargestFirst,
    Random,
}

Iteration order for a resolved partition list — the optional trailing keyword of a spec ("fib:5 largest_first").

unchanged and random are a common-subset vocabulary shared conceptually with comprehension traversal orders (SRD 18c) — where a word exists in both places it means the same thing, while comprehensions additionally offer algorithm-specific strategies (sobol, halton, lhs, …) that do not apply to partition lists.

The size sorts are named for their axis: partition lists are positionally contiguous by construction, so an unqualified “ascending” would be ambiguous between ordinal position (always the generation order — an alias of unchanged) and size. smallest_first / largest_first key on cardinality, unambiguously (stable — ties keep generation order). The bare words ascending / descending are rejected at parse time with a diagnostic naming these. Random is a deterministic shuffle seeded from the spec text, so the same spec yields the same order on every run.

Variants

Unchanged

Generation order (left-to-right as resolved). The default.

SmallestFirst

Smallest cardinality first (stable).

LargestFirst

Largest cardinality first (stable).

Random

Deterministic shuffle, seeded from the spec text.

Trait Implementations

impl Clone for PartitionOrder

fn clone(&self) -> PartitionOrder

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for PartitionOrder

impl Debug for PartitionOrder

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

Formats the value using the given formatter.

impl Default for PartitionOrder

fn default() -> PartitionOrder

Returns the “default value” for a type.

impl Display for PartitionOrder

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

Formats the value using the given formatter.

impl Eq for PartitionOrder

impl PartialEq for PartitionOrder

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for PartitionOrder