Struct ModuleGraph 

pub struct ModuleGraph { /* private fields */ }

Explicit file/plugin dependency graph over registered modules.

Keys are typically the watched file stem (agents/foo.toon → "foo") or the module URL; edges point from a module to the keys it declares in dependencies. Storage is a BTreeMap, so propagation order is deterministic across runs regardless of registration order.

Implementations

impl ModuleGraph

pub fn new() -> Self

pub fn with_reloader(reloader: Arc<dyn ModuleReload>) -> Self

Graph wired to a concrete apply seam.

pub fn set_reloader(&self, reloader: Arc<dyn ModuleReload>)

Swap the apply seam (e.g. install the production reloader after boot).

pub fn register_module( &self, key: impl Into<String>, dependencies: Vec<String>, plugin_name: impl Into<String>, )

Register (or replace) module key — the URL/file-stem identifier — with its declared dependencies and implementing plugin_name.

pub fn get(&self, key: &str) -> Option<ModuleEntry>

Snapshot of one module entry, if registered.

pub fn module_keys(&self) -> Vec<String>

All registered module keys, ascending.

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn depends_on(&self, key: &str) -> Vec<String>

Transitive dependents of key, INCLUDING key itself, in breadth-first propagation order.

The DFS carries a visited set, so cyclic declarations (A depends on B, B depends on A) terminate after visiting each module once while still propagating to everything reachable around the cycle.

pub fn change_many(&self, ctx: &Arc<Context>, keys: &[String]) -> ChangeOutcome

Transaction over one settled batch of changed keys.

Phase 1 (read-only) computes the transitive affected plugin set across ALL input keys — shared visited set, so a plugin reachable from several inputs appears exactly once. If no input key matches a registered module the transaction ends ChangeOutcome::Ignored before any mutation. Phase 2 applies the affected plugins sequentially; the first failure rolls that plugin back to its previous state and stops the batch, leaving earlier successes Active and reporting ChangeOutcome::RolledBack.

Trait Implementations

impl Default for ModuleGraph

fn default() -> Self

Returns the “default value” for a type.

impl Service for ModuleGraph

fn name(&self) -> &'static str

fn init(&self, _ctx: &Arc<Context>) -> ServiceInitFuture<'_>

fn check(&self) -> bool

Availability predicate for this service instance.