Enum SortStrategy 

pub enum SortStrategy {
    ScoreThenIndexAsc,
    ScoreThenIndexDesc,
    IndexAsc,
    IndexDesc,
    Unsorted,
}

Variants

ScoreThenIndexAsc

Sort by descending score, then ascending haystack index

ScoreThenIndexDesc

Sort by descending score, then descending haystack index

IndexAsc

Sort by ascending haystack index, preserving input order

IndexDesc

Sort by descending haystack index, reversing input order

Unsorted

No ordering guarantee: the cheapest strategy, for callers that re-sort the matches themselves. Sequential matching yields input order; parallel matching yields the per-thread runs concatenated instead of merged.

Implementations

impl SortStrategy

pub fn reverse(self) -> Self

pub fn is_reversed(self) -> bool

Whether the sort strategy matches index (asc) (normal order) or index (desc) (reverse order).

When this is true, the sort strategy may still sort by score (desc) first, see SortStrategy::is_by_score.

pub fn is_by_score(self) -> bool

Whether the sort strategy matches by score (desc) first

Trait Implementations

impl Clone for SortStrategy

fn clone(&self) -> SortStrategy

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for SortStrategy

impl Debug for SortStrategy

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

Formats the value using the given formatter.

impl Default for SortStrategy

fn default() -> SortStrategy

Returns the “default value” for a type.

impl Eq for SortStrategy

impl PartialEq for SortStrategy

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for SortStrategy