pub struct Graph {
pub version: u32,
pub nodes: Vec<NodeInstance>,
pub edges: Vec<Edge>,
pub feedback: Vec<FeedbackEdge>,
pub invocation_inputs: Vec<PortRef>,
pub required_capabilities: Vec<Capability>,
pub required_proofs: Vec<String>,
pub policy: Vec<String>,
pub minimum_fidelity: u16,
pub session: Option<SessionContract>,
}Fields§
§version: u32§nodes: Vec<NodeInstance>§edges: Vec<Edge>§feedback: Vec<FeedbackEdge>Cross-invocation edges are explicit and never participate in same-call topological ordering.
invocation_inputs: Vec<PortRef>External values accepted by this graph invocation. Every entry names a concrete descriptor input port; declarations are canonicalized by the compiler and may not overlap an edge binding.
required_capabilities: Vec<Capability>§required_proofs: Vec<String>§policy: Vec<String>§minimum_fidelity: u16§session: Option<SessionContract>Trait Implementations§
Source§impl<'de> Deserialize<'de> for Graph
impl<'de> Deserialize<'de> for Graph
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
impl Eq for Graph
impl StructuralPartialEq for Graph
Auto Trait Implementations§
impl Freeze for Graph
impl RefUnwindSafe for Graph
impl Send for Graph
impl Sync for Graph
impl Unpin for Graph
impl UnsafeUnpin for Graph
impl UnwindSafe for Graph
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more