Struct MemLabelling 

pub struct MemLabelling {
    pub labels: BTreeMap<String, Label>,
    pub attackers: BTreeMap<String, Vec<String>>,
    pub cross_mem_edges_excluded: usize,
}

One mem’s grounded labelling — the least fixpoint over the pinned graph (non-stub entities of the mem; attack-set edges whose endpoints are both non-stub nodes of the mem). Deterministic: BTreeMaps keyed by id string.

Fields

labels: BTreeMap<String, Label>

Label per non-stub entity id of the mem.

attackers: BTreeMap<String, Vec<String>>

Direct in-mem attackers per entity id, sorted.

cross_mem_edges_excluded: usize

Attack-set edges incident to this mem’s nodes whose other endpoint lives in another mem — excluded from the computation and counted, never guessed.

Implementations

impl MemLabelling

pub fn accepted_attackers_of(&self, id: &str) -> Vec<String>

The accepted direct attackers of id — the evidence a defeated label always carries.

pub fn undecided_attackers_of(&self, id: &str) -> Vec<String>

The undecided direct attackers of id — the open attacker set that keeps an undecided label open.

Trait Implementations

impl Clone for MemLabelling

fn clone(&self) -> MemLabelling

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for MemLabelling

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

Formats the value using the given formatter.