Enum RankAgreement 

pub enum RankAgreement {
    High,
    Medium,
    Low,
    Insufficient,
}

Categorical confidence label for a returned top-K ranking.

Derived from the softmax-entropy and the within-query median adjacent margin. The mapping is intentionally coarse: the three- bucket view is what downstream consumers (Gap 01 suggest_hop, UI badges) actually use. The richer four-label string form from the solution design (confident / likely / tie / flat) is preserved in RankAgreement::as_fine_label for telemetry.

Variants

High

The top-1 lead is unusually large relative to the rest of the ranking and entropy is low. Downstream: do not suggest a hop. Fine label: confident.

Medium

The top-1 lead beats the within-query median margin but does not meet the stricter entropy floor. Fine label: likely.

Low

Top-K is near-tied or flat. Downstream: Gap 01 suggest_hop should fire (subject to its graph-size gate). Fine labels: tie (top is near-tied with runners-up) and flat (entire distribution is near-uniform).

Insufficient

K < K_MIN_SHAPE_GATE: sample too small to label meaningfully. Consumers should treat this as “no signal”.

Implementations

impl RankAgreement

pub const fn as_fine_label(self) -> &'static str

Stable fine-grained label for telemetry (confident / likely / tie / flat / insufficient_k). The coarse three-bucket RankAgreement variant is what programmatic consumers should match on; this string is for dashboards and logs.

Trait Implementations

impl Clone for RankAgreement

fn clone(&self) -> RankAgreement

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for RankAgreement

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for RankAgreement

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Hash for RankAgreement

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for RankAgreement

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

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 RankAgreement

impl Eq for RankAgreement

impl StructuralPartialEq for RankAgreement