Enum IterationOrder

pub enum IterationOrder {
    Arbitrary,
    Ordered,
}

Order of parallel iteration, which might be:

• in the order of the input as in regular sequential iterators, or
• arbitrary.

This is important for certain computations:

• collect will return exactly the same result of its sequential counterpart when Ordered is used. However, the elements might (but not necessarily) be in arbitrary order when Arbitrary is used.
• first returns the first element of the iterator when Ordered, might return any element when Arbitrary.
• find returns the first element satisfying the predicate when Ordered, might return any element satisfying the predicate when Arbitrary (sometimes this method is called find_any).

Variants

Arbitrary

The iteration is allowed to be in arbitrary order when it might improve performance, but not necessarily.

Ordered

Default ordering.

The iteration will be in an order consistent with the input of the collection, and hence, the outputs will always be equivalent to the sequential counterpart.

Trait Implementations

impl Clone for IterationOrder

fn clone(&self) -> IterationOrder

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for IterationOrder

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

Formats the value using the given formatter.

impl Default for IterationOrder

fn default() -> IterationOrder

Returns the “default value” for a type.

impl PartialEq for IterationOrder

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for IterationOrder

impl Eq for IterationOrder

impl StructuralPartialEq for IterationOrder