Enum SortKey 

#[non_exhaustive]
pub enum SortKey {
    Crap,
    Coverage,
    Complexity,
    Path,
}

Ordering key for the View pipeline’s sort phase.

All sorts are stable (sort_by, not sort_unstable_by) so input order is preserved on tied keys. NaN-bearing keys (CRAP value, coverage percent) sort last under their respective orientation — non-NaN winners take the descending positions.

File-level interpretation under --group-by file:

Variant	File-level meaning
Crap	average_crap descending
Coverage	average_coverage ascending
Complexity	max_complexity descending
Path	file_path ascending

#[non_exhaustive] reserves namespace for future keys (e.g., risk-bucket, function-name) without forcing match-arm churn downstream.

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

Crap

CRAP score descending (matches the legacy table reporter’s order).

Coverage

Coverage ascending (low-coverage shown first — investigator’s interest).

Complexity

Complexity descending.

Path

Alphabetical by file_path, then CRAP descending within file.

Implementations

impl SortKey

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

Canonical wire string — see GroupKey::as_wire_str.

Trait Implementations

impl Clone for SortKey

fn clone(&self) -> SortKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SortKey

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

Formats the value using the given formatter.

impl Default for SortKey

fn default() -> SortKey

Returns the “default value” for a type.

impl From<SortKey> for SortKeyArg

Reverse mapping for saved view presets (issue #80) — preset stores domain SortKey, but FilterArgs.sort_by is the clap-side wrapper.

SortKey is #[non_exhaustive] for cross-crate consumers, but post-S4 (#136) the cli module lives in the same crate as the domain SortKey definition, so the compiler treats the match as exhaustive without a wildcard arm. New domain variants must still land with a paired CLI variant in the same PR — clippy’s missing-pattern error is now the loud failure point (the formerly-required wildcard arm triggered unreachable_patterns post-relocation).

fn from(key: SortKey) -> Self

Converts to this type from the input type.

impl From<SortKeyArg> for SortKey

fn from(arg: SortKeyArg) -> Self

Converts to this type from the input type.

impl PartialEq for SortKey

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

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Copy for SortKey

impl Eq for SortKey

impl StructuralPartialEq for SortKey