pub struct LookupInfo {
pub entries: usize,
pub keys: usize,
pub key_norm: String,
pub langs: Vec<String>,
pub fields: Vec<String>,
pub policy: Option<String>,
}Expand description
Parameters of a kind = "lookup" record (SkillRecord.lookup, spec
§9.5.2): entries cards, each with one text slot per language of
langs (slot entry · L + lang), reached through keys normalised,
hashed keys. The table itself is the four tensors of lookup_leaf;
a lookup record has no overrides, no experts, no layers and the
transparent lookup_state_effect — it never touches the network.
Fields§
§entries: usizeE ≥ 1 cards.
keys: usizeK ≥ 1 keys; several keys may name one entry (synonyms, languages).
key_norm: StringKEY_NORM — how a key is normalised before it is hashed.
langs: Vec<String>L ≥ 1 languages in slot order, unique, e.g. ["ru", "en"].
fields: Vec<String>Names of the fields the cards carry (informational; unique).
policy: Option<String>How a request reaches the record (lookup_policy):
router_and_key — the φ router sends the request, the key is then
looked up in it (also when the field is absent); key_first — a
STRONG key in the message (≥ 2 words: an exact or stem n-gram, a
Latin binomial) sends the request to the record even when the
router picked the backbone, a one-word key still needs the router.
Additive: files written before 26.09.2026 carry no field.
Implementations§
Source§impl LookupInfo
impl LookupInfo
Sourcepub fn policy_label(&self) -> &str
pub fn policy_label(&self) -> &str
The declared policy, lookup_policy::DEFAULT when absent.