Struct Excluded 

pub struct Excluded {
    pub uri: String,
    pub kind: Option<String>,
    pub tier: Tier,
    pub reason: ExclusionReason,
    pub detail: String,
    pub cost_tokens: u64,
    pub relevance: f64,
}

One thing the compiler reached and did not give. Excluded is not the same as absent: an under-filled context is debugged from this list, not by guessing.

cost_tokens is why this type exists in the shape it does. A budget that reported only that it dropped things would leave a caller guessing at a new ceiling; one that reports what each omission would have cost turns “raise the budget” into arithmetic. detail carries the same in words, so the row is legible without the reader doing that arithmetic themselves.

The ordering puts the tier first as an explicit rank, because the tier is the precedence the budget spent in; inside a tier a reader is looking for a reason, and the identifier ends the key so the list is total and the same tree always prints it the same way.

use majordomus_cli::devcontext::{Excluded, ExclusionReason, Tier};
use majordomus_cli::order::canonical;
use serde_json::json;

let row = |uri: &str, tier: &str, reason: &str, cost: u64| -> Excluded {
    serde_json::from_value(json!({
        "uri": uri, "tier": tier, "reason": reason,
        "detail": "as measured", "cost_tokens": cost, "relevance": 0.4,
    })).unwrap()
};

let mut excluded = vec![
    row("majordomus://knowledge/b", "history", "budget", 900),
    row("majordomus://adr/0001", "decision", "superseded", 300),
    row("majordomus://knowledge/a", "history", "budget", 1_200),
];
canonical(&mut excluded);

// the tier ranks first, so the decision tier precedes history whatever the reason says
assert_eq!(excluded[0].tier, Tier::Decision);
assert_eq!(excluded[0].reason, ExclusionReason::Superseded);
// then the reason, then the identifier — which makes the order total
let rest: Vec<&str> = excluded[1..].iter().map(|e| e.uri.as_str()).collect();
assert_eq!(rest, ["majordomus://knowledge/a", "majordomus://knowledge/b"]);

// and the row a caller acts on says what it would have cost to keep
let biggest = excluded.iter().max_by_key(|e| e.cost_tokens).unwrap();
assert_eq!(biggest.cost_tokens, 1_200);

Fields

uri: String

The canonical identifier, or the name the layer used when nothing resolves.

kind: Option<String>

Its kind, when it resolved to something.

tier: Tier

The tier it would have been spent from.

reason: ExclusionReason

Why it is not in the answer.

detail: String

The same, in words.

cost_tokens: u64

What it would have cost, so that a reader can decide whether to raise the budget.

relevance: f64

What its relevance was.

Trait Implementations

impl Clone for Excluded

fn clone(&self) -> Excluded

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Excluded

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Excluded

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl JsonSchema for Excluded

fn schema_name() -> Cow<'static, str>

The name of the generated JSON Schema.

fn schema_id() -> Cow<'static, str>

Returns a string that uniquely identifies the schema produced by this type.

fn json_schema(generator: &mut SchemaGenerator) -> Schema

Generates a JSON Schema for this type.

fn inline_schema() -> bool

Whether JSON Schemas generated for this type should be included directly in parent schemas, rather than being re-used where possible using the $ref keyword.

impl Ordered for Excluded

The tier is the precedence the budget spends in, so it is the explicit rank; inside a tier a reader looks for a reason, and the identifier ends the key so the list is total.

fn order_key(&self) -> OrderKey<'_>

The four parts this item is ordered by. Borrowed from the item: building a key allocates nothing, so sorting a large collection costs the comparisons and no more.

impl PartialEq for Excluded

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

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for Excluded