Struct SeqMap 

pub struct SeqMap<V> { /* private fields */ }

Insertion-order-preserving String-keyed map with a mutable get-or-insert-default accessor. Same shape as graph::OrderedMap, kept as a separate small type here because that one exposes no get_mut/entry-style API. Public for the same reason as SeqSet – appears in [ImpactWalkResult::visited].

Implementations

impl<V> SeqMap<V>

pub fn new() -> Self

Creates an empty insertion-ordered map.

pub fn contains_key(&self, key: &str) -> bool

Returns whether key is present.

pub fn insert(&mut self, key: String, value: V)

Inserts or replaces the value for key while preserving key order.

pub fn iter(&self) -> impl Iterator<Item = (&String, &V)>

Iterates over entries in insertion order.

Examples found in repository

examples/extension_impact.rs (line 86)

fn truth(index: &query::GraphIndex<'_>, seed: &str) -> Result<Value, String> {
    let query::SeedResolution::Resolved { ids, .. } = query::resolve_impact_seed(index, seed)
    else {
        return Err(format!("oracle seed is not uniquely resolved: {seed}"));
    };
    // Oracle truncation would turn valid predictions beyond a brake into false positives.
    let walk = query::impact_walk(index, &ids, query::DEFAULT_HOPS, true, 0, 0);
    Ok(json!({"rows": walk.visited.iter()
        .filter(|(_, row)| row.via_count > 0 || row.ambiguous_count > 0)
        .map(|(file, row)| json!({"file": file, "hop": row.hop, "heuristic": false}))
        .collect::<Vec<_>>() }))
}

pub fn keys(&self) -> impl Iterator<Item = &String>

Iterates over keys in insertion order.

Trait Implementations

impl<V: Clone> Clone for SeqMap<V>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<V: Debug> Debug for SeqMap<V>

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

Formats the value using the given formatter.