pub struct Document {
pub types: BTreeMap<String, Type>,
pub workflows: Vec<Workflow>,
}Fields§
§types: BTreeMap<String, Type>§workflows: Vec<Workflow>Implementations§
Source§impl Document
impl Document
Source§impl Document
impl Document
Sourcepub fn flatten(&self, workflow: &str) -> Result<Workflow, String>
pub fn flatten(&self, workflow: &str) -> Result<Workflow, String>
The graph a pass walks: every call replaced by its callee’s nodes,
prefixed with the call site. The runtime then holds one flat graph, one
set of caps and one frontier, and workflow-level recursion cannot
arise because there is nothing left to recurse through (W2).
Deterministic, so the edge indexes a move is keyed by are the same on every pass over one revision.
Trait Implementations§
impl StructuralPartialEq for Document
Auto Trait Implementations§
impl Freeze for Document
impl RefUnwindSafe for Document
impl Send for Document
impl Sync for Document
impl Unpin for Document
impl UnsafeUnpin for Document
impl UnwindSafe for Document
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