Struct LastGoodPolicies 

pub struct LastGoodPolicies {
    good: Mutex<HashMap<String, Good>>,
}

The operator source’s last-good-revision state. Empty and legitimate at startup – nothing has compiled yet, which is the “never compiled” state every id starts in, not an error.

Held by whoever repeatedly rebuilds the tree from a fresh view of the operator’s records, the same way that view itself is held – long-lived, across many crate::merge::build calls, never reconstructed per rebuild, or there would be nothing to fall back to.

Fields

good: Mutex<HashMap<String, Good>>

Implementations

impl LastGoodPolicies

pub fn new() -> Self

No id has a last-good revision yet.

pub(crate) fn get(&self, id: &str) -> Option<(Revision, ParsedPolicy)>

The last successfully-compiled ParsedPolicy for id, and the revision it was observed at, if this id has ever compiled.

pub(crate) fn record_success(&self, id: &str, policy: &ParsedPolicy)

Record that policy (at id) compiled successfully at its own revision – the new last-good, replacing whatever was stored before.

pub(crate) fn prune(&self, current: &HashMap<String, ParsedPolicy>)

Drop every id not present in current – a record the current view no longer holds at all (deleted, or never re-observed after a source outage recovered onto a view that no longer names it) has nothing left to fall back to, and keeping it here would let a stale policy affect a future id that happens to reuse the same at-uri. Called once per rebuild, after every id in current has had a chance to update its own entry via record_success.

Trait Implementations

impl Default for LastGoodPolicies

fn default() -> LastGoodPolicies

Returns the “default value” for a type.