pub struct EffectGraphRecord { /* private fields */ }Expand description
Canonical v1 dependency graph over opaque exact operation sequence identities.
Nodes refer to operations owned by a future complete plan. This record contains no effects, targets, request codecs, current authority or completion receipts. Parent-before-child and lifecycle order must be explicitly qualified by an integration.
Implementations§
Source§impl EffectGraphRecord
impl EffectGraphRecord
Sourcepub fn new(nodes: Vec<EffectNodeRecord>) -> Result<Self, EffectGraphError>
pub fn new(nodes: Vec<EffectNodeRecord>) -> Result<Self, EffectGraphError>
Validate bounded, unique, closed acyclic dependencies without IO.
§Errors
Rejects empty/excessive graphs, repeated identities, missing edges and cycles.
Sourcepub fn nodes(&self) -> &[EffectNodeRecord]
pub fn nodes(&self) -> &[EffectNodeRecord]
Read immutable nodes in ascending operation sequence order.
Sourcepub fn node(&self, sequence: u64) -> Result<&EffectNodeRecord, EffectGraphError>
pub fn node(&self, sequence: u64) -> Result<&EffectNodeRecord, EffectGraphError>
Resolve an exact operation identity without treating its numeric value as an order.
§Errors
Rejects operation identities absent from the original graph.
Sourcepub fn ordered_nodes(
&self,
) -> impl ExactSizeIterator<Item = &EffectNodeRecord> + DoubleEndedIterator + '_
pub fn ordered_nodes( &self, ) -> impl ExactSizeIterator<Item = &EffectNodeRecord> + DoubleEndedIterator + '_
Project deterministic topological order; smallest currently ready sequence wins ties.
This order grants no effect authorization, target identity or fresh safety evidence.
Sourcepub fn digest(&self) -> ArtifactChecksumRecord
pub fn digest(&self) -> ArtifactChecksumRecord
Hash canonical explicit identities/edges using the documented v1 binary encoding.