Enum Sort 

pub enum Sort {
    Key,
    Label,
}

Row ordering (§4.2). An explicit total order is required either way, because a node’s children live in a HashMap — without one the grid reshuffles between openings of the same prefix, which is a worse discoverability surface than no popup at all.

Variants

Key

Collate by key: digits, lowercase, uppercase, punctuation, special keys, then modifier-bearing chords.

Label

Collate by label, with the key collation as the tiebreak.

Implementations

impl Sort

pub fn parse(s: &str) -> Option<Self>

Parse the which-key.sort option value ("key" / "label", exact). An unknown value returns None; the caller logs it and falls back to Sort::Key — log-and-skip, never panic (§8).

Trait Implementations

impl Clone for Sort

fn clone(&self) -> Sort

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Sort

impl Debug for Sort

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

Formats the value using the given formatter.

impl Default for Sort

fn default() -> Sort

Returns the “default value” for a type.

impl Eq for Sort

impl PartialEq for Sort

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Sort