Enum SearchSort 

pub enum SearchSort {
    Relevance,
}

Ordering applied to the discovery result set.

Relevance is the only sort (issue #290). Verified against live OpenAlex: every non-relevance sort (cited_by_count, fwci, publication_date) over OpenAlex’s loose full-text match floats high-scoring off-topic papers to the top — they override the one signal that enforces topicality. “Important / recent / high-quality” is therefore expressed as filters (min_fwci / min_percentile / from_year), which narrow the candidate set without discarding relevance ordering. (Non-relevance sorting is only safe over an already-topically-constrained set — not free-text search.)

Variants

Relevance

OpenAlex relevance_score:desc — best textual match to query first. Only meaningful because a search term is always present.

Implementations

impl SearchSort

pub fn as_openalex(self) -> &'static str

The OpenAlex sort= parameter value for this ordering.

Trait Implementations

impl Clone for SearchSort

fn clone(&self) -> SearchSort

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for SearchSort

impl Debug for SearchSort

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

Formats the value using the given formatter.

impl Default for SearchSort

fn default() -> SearchSort

Returns the “default value” for a type.

impl Eq for SearchSort

impl PartialEq for SearchSort

fn eq(&self, other: &SearchSort) -> 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 StructuralPartialEq for SearchSort