Struct BoundedWorkGraph 

pub struct BoundedWorkGraph { /* private fields */ }

Bounded, acyclic work graph with enforced fan-out and budget constraints.

Implementations

impl BoundedWorkGraph

pub fn validate_invariants(&self) -> Result<(), WorkGraphError>

Validate every persisted structural and accounting invariant before use.

pub fn root_agent_for(&self, node_id: &str) -> Result<&str, WorkGraphError>

pub fn stop( &mut self, node_id: &str, reason: StopReason, ) -> Result<Vec<String>, WorkGraphError>

Stop a node and all its descendants (cascade).

pub fn stop_unlaunched( &mut self, node_id: &str, reason: StopReason, ) -> Result<Vec<String>, WorkGraphError>

Stop a node whose start was refused before the host received a launch: no child process exists, so its paths are free at once.

pub fn consume_budget( &mut self, node_id: &str, tokens: u64, cost_micros: u64, ) -> Result<bool, WorkGraphError>

Record token consumption on a node.

pub fn consume_tokens( &mut self, node_id: &str, tokens: u64, ) -> Result<(), WorkGraphError>

Records token consumption for a node and updates its chain budget.

pub fn chain_budget_for(&self, node_id: &str) -> Option<&ChainBudget>

Returns the chain budget for a given node’s chain.

pub fn over_budget_chains(&self, threshold_pct: f64) -> Vec<&ChainBudget>

Returns all chains at or above their utilization threshold.

pub fn enforce_stop_conditions(&mut self) -> Vec<(String, StopReason)>

Check all nodes for stop conditions and cascade.

pub fn get_node(&self, node_id: &str) -> Option<&WorkNode>

pub fn begin_delivery_attempt( &mut self, node_id: &str, fence: &str, attempt: u8, ) -> Result<(), WorkGraphError>

Advance only the current running incarnation; retries revoke the prior attempt’s delivery authority without changing the node claim fence.

pub fn contains_agent(&self, agent_id: &str) -> bool

pub fn children_of(&self, node_id: &str) -> &[String]

pub fn has_live_path_conflict( &self, requested: &[String], now_epoch_ms: u64, except_node_id: Option<&str>, ) -> bool

A started incarnation holds its paths while it runs and, once stopped, until its window ends: LeanCTX cannot observe the host’s child exit, so a stopped child keeps write exclusivity for the time it was granted.

pub fn active_count(&self) -> usize

pub fn total_count(&self) -> usize

impl BoundedWorkGraph

pub fn new(max_fan_out: usize, max_depth: u16) -> BoundedWorkGraph

pub fn with_local_concurrency( self, max_local_concurrency: usize, ) -> BoundedWorkGraph

pub fn with_graph_id( self, graph_id: &str, ) -> Result<BoundedWorkGraph, WorkGraphError>

pub fn bind_graph_id(&mut self, graph_id: &str) -> Result<(), WorkGraphError>

pub fn graph_id(&self) -> &str

pub fn observation(&self) -> Value

Compact, deterministic observation for controllers. Payloads, capability references and execution fences remain in the authorized detail API.

pub fn observe_if_changed(&self, if_revision: Option<&str>) -> Value

Return only a stable revision when the caller already has this state. Revision is a cache validator, never an authorization or execution token.

pub fn add_root( &mut self, node_id: String, agent_id: String, capsule_ref: String, budget: WorkNodeBudget, ) -> Result<&WorkNode, WorkGraphError>

Add a root node (no parent).

pub fn delegate( &mut self, parent_node_id: &str, child_node_id: String, child_agent_id: String, capsule_ref: String, child_budget: WorkNodeBudget, ) -> Result<&WorkNode, WorkGraphError>

Delegate work to a child node. Validates budget inheritance and fan-out.

pub fn queue_child( &mut self, parent_node_id: &str, child_node_id: String, child_agent_id: String, capsule_ref: String, child_budget: WorkNodeBudget, ) -> Result<&WorkNode, WorkGraphError>

Queue child work without consuming a local execution slot.

pub fn claim_and_activate( &mut self, node_id: &str, ) -> Result<&WorkNode, WorkGraphError>

Atomically claim pending local work and activate it when a slot is free.

pub fn claim_and_activate_until( &mut self, node_id: &str, lease_expires_epoch_ms: Option<u64>, ) -> Result<&WorkNode, WorkGraphError>

pub fn claim_or_resume_active_until( &mut self, node_id: &str, lease_expires_epoch_ms: u64, ) -> Result<&WorkNode, WorkGraphError>

Claim pending work or renew the same owner’s already-issued execution fence.

pub fn recover_expired_execution( &mut self, node_id: &str, now_epoch_ms: u64, ) -> Result<Vec<String>, WorkGraphError>

pub fn set_path_claims( &mut self, node_id: &str, path_claims: Vec<String>, ) -> Result<(), WorkGraphError>

Bind deterministic project-relative path leases before a queued node is claimed.

pub fn configure_root_context( &mut self, node_id: &str, task_ref: &str, policy_ref: &str, expected_outcome_ref: &str, ) -> Result<(), WorkGraphError>

pub fn configure_child_context( &mut self, node_id: &str, task_ref: &str, expected_outcome_ref: &str, ) -> Result<(), WorkGraphError>

pub fn allocate_child_budget( &mut self, parent_id: &str, child_id: &str, fraction: f64, ) -> Result<WorkNodeBudget, WorkGraphError>

Allocates budget for a child node using cascade rules.

The returned budget is reserved for child_id until it is passed to Self::delegate, so chain allocation is not counted twice.

pub fn complete( &mut self, node_id: &str, outcome_ref: String, ) -> Result<(), WorkGraphError>

Mark a node as completed with an outcome reference.

pub fn record_child_receipt( &mut self, receipt: ChildExecutionReceipt, ) -> Result<(), WorkGraphError>

Validate and record a terminal receipt for active child execution.

pub fn evaluate_child_outcome( &self, node_id: &str, ) -> Result<ChildOutcome, WorkGraphError>

Return the validated terminal outcome for a child node.

pub fn mark_accepted_path( &mut self, node_ids: &[String], ) -> Result<(), WorkGraphError>

Mark accepted result nodes. Every marked node must have an accepted terminal receipt; partial results cannot establish acceptance. Ancestors are included deterministically.

pub fn is_on_accepted_path(&self, node_id: &str) -> bool

pub fn fuse_accepted_results(&self) -> Result<FusedResults, WorkGraphError>

Fuse accepted claims in stable key/value/node order. Conflicting keys are excluded from accepted output and represented explicitly.

pub fn attribution(&self) -> Result<WorkAttribution, WorkGraphError>

pub fn team_value_report(&self) -> Result<TeamValueReport, WorkGraphError>

Trait Implementations

impl Clone for BoundedWorkGraph

fn clone(&self) -> BoundedWorkGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BoundedWorkGraph

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

Formats the value using the given formatter.

impl Default for BoundedWorkGraph

fn default() -> BoundedWorkGraph

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for BoundedWorkGraph

fn deserialize<__D>( __deserializer: __D, ) -> Result<BoundedWorkGraph, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for BoundedWorkGraph

fn serialize<__S>( &self, __serializer: __S, ) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.