Struct GateInput 

pub struct GateInput<'a, E: AsRef<str> + Ord> {
    pub all: &'a [String],
    pub inferred: &'a HashMap<String, BTreeSet<E>>,
    pub calls: &'a HashMap<String, BTreeSet<String>>,
    pub hosts: &'a HashMap<String, BTreeSet<String>>,
    pub cmds: &'a HashMap<String, BTreeSet<String>>,
    pub paths: &'a HashMap<String, BTreeSet<String>>,
    pub tables: &'a HashMap<String, BTreeSet<String>>,
    pub surface_incomplete: &'a HashMap<String, BTreeSet<E>>,
    pub reason_classes: &'a HashMap<String, BTreeSet<String>>,
    pub net_classes: &'a HashMap<String, Vec<String>>,
}

⟨0.24⟩ THE GATE’S INPUT — one signature per function, every field already TRANSITIVE.

E is the effect-name representation: &'static str on the scan route (the classifier’s interned vocabulary) and String on the report route (the wire’s names, taken VERBATIM — a report naming an effect this build’s vocabulary does not list must still trip a pure rule, so the names are never filtered through a known-effect allowlist on the way in).

Fields

all: &'a [String]

Every function the gate ranges over, in the caller’s order.

inferred: &'a HashMap<String, BTreeSet<E>>

Per fn, the TRANSITIVE effect set — the model’s S, with candor’s Unknown marker carried as a member (this engine’s encoding of D ≠ ∅).

calls: &'a HashMap<String, BTreeSet<String>>

The call graph AS-EFF-009 walks.

hosts: &'a HashMap<String, BTreeSet<String>>

Per fn, the TRANSITIVE literal surface AS-EFF-008 certifies against.

cmds: &'a HashMap<String, BTreeSet<String>>

paths: &'a HashMap<String, BTreeSet<String>>

tables: &'a HashMap<String, BTreeSet<String>>

surface_incomplete: &'a HashMap<String, BTreeSet<E>>

Per fn, the effects whose literal surface is structurally INCOMPLETE — the AS-EFF-008 fail-closed marker, without which a benign visible literal masks an invisible forbidden endpoint.

reason_classes: &'a HashMap<String, BTreeSet<String>>

Per fn, the TRANSITIVE reason-class tokens — the model’s D (§6.2 ⟨0.19⟩). The Unknown EFFECT propagates along the call graph, so its REASON must too: else deny E Unknown[reflect] at a caller inheriting Unknown from a reflect-caused callee sees no class and does NOT fire.

net_classes: &'a HashMap<String, Vec<String>>

Per Net-bearing fn, its ⟨0.20⟩ destination classes, ALREADY derived — by net_classes_of on the scan route, read verbatim from the report’s netClass on the report route. Absent ⇒ empty.