gagen 0.5.0 → 0.5.1

package/esm/job.js

@@ -9,7 +9,7 @@ var __classPrivateFieldGet = (this && this.__classPrivateFieldGet) || function (
     if (typeof state === "function" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError("Cannot read private member from an object whose class did not declare it");
     return kind === "m" ? f : kind === "a" ? f.call(receiver) : f ? f.value : state.get(receiver);
 };
-var _Job_instances, _Job_id, _Job_config, _Job_leafItems, _Job_outputDefs, _Job_cachedGraph, _Job_cachedLeafSteps, _Job_buildGraph;
+var _Job_instances, _Job_id, _Job_config, _Job_leafItems, _Job_outputDefs, _Job_cachedGraph, _Job_cachedLeafSteps, _Job_cachedMembership, _Job_buildGraph, _Job_resolveUnits;
 import { Condition, ExpressionValue, isAlwaysFalse, isAlwaysTrue, } from "./expression.js";
 import { Matrix } from "./matrix.js";
 import { normalizeStepLike, serializeConditionLike, serializeConfigValues, Step, StepRef, toCondition, unwrapSteps, } from "./step.js";
@@ -59,27 +59,61 @@ function combineAndConditions(a, b) {
     return a ?? b;
 }
 /**
- * Returns a step's config.if as a ConditionLike suitable for passing down
- * to dependencies, or undefined if it references step outputs (which would
- * create circular condition dependencies).
+ * Returns a condition suitable for passing down to dependencies, or undefined
+ * if it references step outputs (which would create circular condition
+ * dependencies — a dependency cannot be gated on an output produced by a step
+ * that runs after it).
  */
-function propagatableConfigIf(step) {
-    const configIf = step.config.if;
-    if (configIf == null)
+function propagatableCondition(condition) {
+    if (condition == null)
         return undefined;
-    if (configIf instanceof Condition) {
-        for (const source of configIf.sources) {
+    if (condition instanceof Condition) {
+        for (const source of condition.sources) {
             if (source instanceof Step)
                 return undefined;
         }
     }
-    if (configIf instanceof ExpressionValue) {
-        for (const source of configIf.allSources) {
+    if (condition instanceof ExpressionValue) {
+        for (const source of condition.allSources) {
             if (source instanceof Step)
                 return undefined;
         }
     }
-    return configIf;
+    return condition;
+}
+/** Returns a step's config.if if it is safe to propagate to dependencies. */
+function propagatableConfigIf(step) {
+    return propagatableCondition(step.config.if);
+}
+function recordMember(membership, group, step) {
+    const c = step.config;
+    if (c.background || c.wait != null || c.waitAll || c.cancel != null) {
+        // a parallel block already runs each member as a background step with an
+        // implicit wait-all, so background/wait/wait-all/cancel members make no sense
+        throw new Error("A parallel group member cannot be a background, wait, wait-all, or " +
+            "cancel step.");
+    }
+    if (membership.memberToGroup.has(step))
+        return;
+    membership.memberToGroup.set(step, group);
+    let members = membership.groupMembers.get(group);
+    if (!members) {
+        members = [];
+        membership.groupMembers.set(group, members);
+    }
+    members.push(step);
+}
+/**
+ * Rejects a composite step used directly as a parallel group member. Members
+ * run concurrently with no ordering, so a member cannot itself be a nested
+ * parallel group or a sequential group of steps.
+ */
+function throwInvalidParallelMember(composite) {
+    if (composite.kind === "parallel") {
+        throw new Error("Parallel groups cannot be nested.");
+    }
+    throw new Error("A parallel group member cannot itself be a group of steps — " +
+        "each member must be a single step.");
 }
 /**
  * Recursively flattens a StepLike tree into a flat graph of Steps with
@@ -93,22 +127,28 @@ function propagatableConfigIf(step) {
  * collected in `deferredAfterDeps` and resolved later, so that comesAfter
  * only adds ordering edges for steps already present in the graph.
  */
-function flattenStepLike(rawItem, graph, isLeaf, leafSteps, deferredAfterDeps, contextCondition) {
+function flattenStepLike(rawItem, graph, isLeaf, leafSteps, deferredAfterDeps, membership, contextCondition, parallelGroup) {
     const item = normalizeStepLike(rawItem);
     if (item instanceof StepRef) {
         const step = item.step;
         // AND this StepRef's condition with the parent context
         const newContext = combineAndConditions(contextCondition, item.condition);
         if (step.children.length > 0) {
-            // StepRef wrapping composite step: recurse with combined context
+            // StepRef wrapping composite step: recurse with combined context.
+            // a parallel composite makes its children concurrent members.
+            if (parallelGroup != null)
+                throwInvalidParallelMember(step);
+            const childGroup = step.kind === "parallel" ? step : parallelGroup;
             const contributed = [];
             for (const child of step.children) {
-                contributed.push(...flattenStepLike(child, graph, isLeaf, leafSteps, deferredAfterDeps, newContext));
+                contributed.push(...flattenStepLike(child, graph, isLeaf, leafSteps, deferredAfterDeps, membership, newContext, childGroup));
             }
-            // compute aggregate dep context: newContext AND (OR of children's
+            // compute aggregate dep context: context AND (OR of children's
             // config.ifs). If any child is unconditional, or the OR is a tautology,
-            // just use newContext.
-            let compositeDepsCtx = newContext;
+            // just use the context. The context is filtered so an output-referencing
+            // condition doesn't propagate to dependencies (circular dependency).
+            const depBaseCtx = propagatableCondition(newContext);
+            let compositeDepsCtx = depBaseCtx;
             if (item.dependencies.length > 0) {
                 const childIfs = [];
                 let allConditional = true;
@@ -123,13 +163,14 @@ function flattenStepLike(rawItem, graph, isLeaf, leafSteps, deferredAfterDeps, c
                 if (allConditional && childIfs.length > 0) {
                     const orCond = simplifyOrConditions(childIfs.map((c) => toCondition(c)));
                     if (orCond != null) {
-                        compositeDepsCtx = combineAndConditions(newContext, orCond);
+                        compositeDepsCtx = combineAndConditions(depBaseCtx, orCond);
                     }
                 }
             }
-            // apply deps once with aggregate context, add to all children's dep sets
+            // apply deps once with aggregate context, add to all children's dep sets.
+            // deps are not group members — they are hoisted to run before the group.
             for (const dep of item.dependencies) {
-                const depSteps = flattenStepLike(dep, graph, false, [], deferredAfterDeps, compositeDepsCtx);
+                const depSteps = flattenStepLike(dep, graph, false, [], deferredAfterDeps, membership, compositeDepsCtx);
                 for (const s of contributed) {
                     const entry = graph.get(s);
                     for (const ds of depSteps)
@@ -147,11 +188,15 @@ function flattenStepLike(rawItem, graph, isLeaf, leafSteps, deferredAfterDeps, c
         const entry = ensureEntry(graph, step);
         if (isLeaf)
             leafSteps.push(step);
+        if (parallelGroup)
+            recordMember(membership, parallelGroup, step);
         applyContextCondition(entry, newContext);
-        // include step's config.if in the dep context
-        const depContext = combineAndConditions(newContext, propagatableConfigIf(step));
+        // include step's config.if in the dep context. both the context and the
+        // config.if are filtered so output-referencing conditions don't propagate
+        // to dependencies (which would create a circular condition dependency).
+        const depContext = combineAndConditions(propagatableCondition(newContext), propagatableConfigIf(step));
         for (const dep of item.dependencies) {
-            flattenDep(dep, entry.deps, graph, deferredAfterDeps, depContext);
+            flattenDep(dep, entry.deps, graph, deferredAfterDeps, membership, depContext);
         }
         for (const dep of item.afterDependencies) {
             deferredAfterDeps.push({ step, target: dep });
@@ -160,10 +205,14 @@ function flattenStepLike(rawItem, graph, isLeaf, leafSteps, deferredAfterDeps, c
     }
     // Step (leaf or composite)
     if (item.children.length > 0) {
-        // composite step: recurse into children with same context
+        // composite step: recurse into children with same context.
+        // a parallel composite makes its children concurrent members.
+        if (parallelGroup != null)
+            throwInvalidParallelMember(item);
+        const childGroup = item.kind === "parallel" ? item : parallelGroup;
         const contributed = [];
         for (const child of item.children) {
-            contributed.push(...flattenStepLike(child, graph, isLeaf, leafSteps, deferredAfterDeps, contextCondition));
+            contributed.push(...flattenStepLike(child, graph, isLeaf, leafSteps, deferredAfterDeps, membership, contextCondition, childGroup));
         }
         return contributed;
     }
@@ -171,12 +220,14 @@ function flattenStepLike(rawItem, graph, isLeaf, leafSteps, deferredAfterDeps, c
     const entry = ensureEntry(graph, item);
     if (isLeaf)
         leafSteps.push(item);
+    if (parallelGroup)
+        recordMember(membership, parallelGroup, item);
     applyContextCondition(entry, contextCondition);
     return [item];
 }
 /** Flattens a dependency target into the graph and adds it to a dep set. */
-function flattenDep(dep, targetSet, graph, deferredAfterDeps, contextCondition) {
-    const steps = flattenStepLike(dep, graph, false, [], deferredAfterDeps, contextCondition);
+function flattenDep(dep, targetSet, graph, deferredAfterDeps, membership, contextCondition) {
+    const steps = flattenStepLike(dep, graph, false, [], deferredAfterDeps, membership, contextCondition);
     for (const s of steps) {
         targetSet.add(s);
     }
@@ -225,6 +276,7 @@ export class Job {
         // cached graph — built lazily
         _Job_cachedGraph.set(this, void 0);
         _Job_cachedLeafSteps.set(this, void 0);
+        _Job_cachedMembership.set(this, void 0);
         __classPrivateFieldSet(this, _Job_id, id, "f");
         __classPrivateFieldSet(this, _Job_config, config, "f");
         if (init?.steps) {
@@ -245,29 +297,8 @@ export class Job {
     }
     resolveSteps() {
         const { graph, leafSteps } = __classPrivateFieldGet(this, _Job_instances, "m", _Job_buildGraph).call(this);
-        const allSteps = new Set(graph.keys());
-        // compute priority: each step gets the minimum leaf index of any
-        // leaf step that transitively depends on it (directly or via
-        // condition sources). This makes the topo sort respect steps order.
-        const priority = new Map();
-        const assignPriority = (s, p) => {
-            const current = priority.get(s);
-            if (current !== undefined && current <= p)
-                return;
-            priority.set(s, p);
-            const entry = graph.get(s);
-            if (!entry)
-                return;
-            for (const dep of entry.deps) {
-                if (allSteps.has(dep)) {
-                    assignPriority(dep, p);
-                }
-            }
-        };
-        for (let i = 0; i < leafSteps.length; i++) {
-            assignPriority(leafSteps[i], i);
-        }
-        return topoSort(allSteps, priority, graph);
+        const priority = computePriorities(graph, leafSteps);
+        return topoSort(new Set(graph.keys()), priority, graph);
     }
     inferNeeds(stepOwners) {
         const config = __classPrivateFieldGet(this, _Job_config, "f");
@@ -438,26 +469,49 @@ export class Job {
         }
         // steps
         const { graph } = __classPrivateFieldGet(this, _Job_instances, "m", _Job_buildGraph).call(this);
-        const resolvedSteps = this.resolveSteps();
-        const effectiveConditions = computeEffectiveConditions(resolvedSteps, graph);
-        result.steps = resolvedSteps
-            .filter((s) => {
+        const units = __classPrivateFieldGet(this, _Job_instances, "m", _Job_resolveUnits).call(this);
+        const effectiveConditions = computeEffectiveConditions(units.flatMap((u) => u.steps), graph);
+        const isVisible = (s) => {
             const cond = effectiveConditions.get(s);
             return cond == null || !isAlwaysFalse(cond);
-        })
-            .map((s) => s.toYaml(effectiveConditions.get(s)));
+        };
+        const serialize = (s) => s.toYaml(effectiveConditions.get(s));
+        const steps = [];
+        for (const unit of units) {
+            const visible = unit.steps.filter(isVisible);
+            if (visible.length === 0)
+                continue;
+            // a parallel block only makes sense with more than one step; collapse a
+            // single remaining step back to a normal sequential step
+            if (unit.parallel && visible.length > 1) {
+                steps.push({ parallel: visible.map(serialize) });
+            }
+            else {
+                for (const s of visible)
+                    steps.push(serialize(s));
+            }
+        }
+        result.steps = steps;
         return result;
     }
 }
-_Job_id = new WeakMap(), _Job_config = new WeakMap(), _Job_leafItems = new WeakMap(), _Job_outputDefs = new WeakMap(), _Job_cachedGraph = new WeakMap(), _Job_cachedLeafSteps = new WeakMap(), _Job_instances = new WeakSet(), _Job_buildGraph = function _Job_buildGraph() {
-    if (__classPrivateFieldGet(this, _Job_cachedGraph, "f") && __classPrivateFieldGet(this, _Job_cachedLeafSteps, "f")) {
-        return { graph: __classPrivateFieldGet(this, _Job_cachedGraph, "f"), leafSteps: __classPrivateFieldGet(this, _Job_cachedLeafSteps, "f") };
+_Job_id = new WeakMap(), _Job_config = new WeakMap(), _Job_leafItems = new WeakMap(), _Job_outputDefs = new WeakMap(), _Job_cachedGraph = new WeakMap(), _Job_cachedLeafSteps = new WeakMap(), _Job_cachedMembership = new WeakMap(), _Job_instances = new WeakSet(), _Job_buildGraph = function _Job_buildGraph() {
+    if (__classPrivateFieldGet(this, _Job_cachedGraph, "f") && __classPrivateFieldGet(this, _Job_cachedLeafSteps, "f") && __classPrivateFieldGet(this, _Job_cachedMembership, "f")) {
+        return {
+            graph: __classPrivateFieldGet(this, _Job_cachedGraph, "f"),
+            leafSteps: __classPrivateFieldGet(this, _Job_cachedLeafSteps, "f"),
+            membership: __classPrivateFieldGet(this, _Job_cachedMembership, "f"),
+        };
     }
     const graph = new Map();
     const leafSteps = [];
     const deferredAfterDeps = [];
+    const membership = {
+        memberToGroup: new Map(),
+        groupMembers: new Map(),
+    };
     for (const item of __classPrivateFieldGet(this, _Job_leafItems, "f")) {
-        flattenStepLike(item, graph, true, leafSteps, deferredAfterDeps);
+        flattenStepLike(item, graph, true, leafSteps, deferredAfterDeps, membership);
     }
     addConditionSourceDeps(graph);
     // resolve deferred after-deps: only add ordering edges for steps
@@ -471,7 +525,65 @@ _Job_id = new WeakMap(), _Job_config = new WeakMap(), _Job_leafItems = new WeakM
     }
     __classPrivateFieldSet(this, _Job_cachedGraph, graph, "f");
     __classPrivateFieldSet(this, _Job_cachedLeafSteps, leafSteps, "f");
-    return { graph, leafSteps };
+    __classPrivateFieldSet(this, _Job_cachedMembership, membership, "f");
+    return { graph, leafSteps, membership };
+}, _Job_resolveUnits = function _Job_resolveUnits() {
+    const { graph, leafSteps, membership } = __classPrivateFieldGet(this, _Job_instances, "m", _Job_buildGraph).call(this);
+    const { memberToGroup, groupMembers } = membership;
+    const priority = computePriorities(graph, leafSteps);
+    // representative node of a step: its parallel group, or the step itself
+    const repOf = (s) => memberToGroup.get(s) ?? s;
+    // build a contracted graph with one node per group + each free step
+    const nodes = new Set();
+    for (const s of graph.keys())
+        nodes.add(repOf(s));
+    const contracted = new Map();
+    for (const node of nodes) {
+        contracted.set(node, {
+            deps: new Set(),
+            afterDeps: new Set(),
+            contexts: [],
+        });
+    }
+    for (const [s, entry] of graph) {
+        const from = repOf(s);
+        const cEntry = contracted.get(from);
+        for (const dep of entry.deps) {
+            const to = repOf(dep);
+            if (to === from) {
+                if (s !== dep) {
+                    throw new Error(`Steps in a parallel group cannot depend on each other: ${stepLabel(dep)} → ${stepLabel(s)}`);
+                }
+                continue;
+            }
+            cEntry.deps.add(to);
+        }
+        for (const dep of entry.afterDeps) {
+            const to = repOf(dep);
+            if (to === from) {
+                if (s !== dep) {
+                    throw new Error(`Steps in a parallel group cannot be ordered after each other: ${stepLabel(dep)} → ${stepLabel(s)}`);
+                }
+                continue;
+            }
+            cEntry.afterDeps.add(to);
+        }
+    }
+    // contracted priority = best (minimum) priority among the node's members
+    const contractedPriority = new Map();
+    for (const [s, p] of priority) {
+        const node = repOf(s);
+        const current = contractedPriority.get(node);
+        if (current === undefined || p < current) {
+            contractedPriority.set(node, p);
+        }
+    }
+    return topoSort(nodes, contractedPriority, contracted).map((node) => {
+        const members = groupMembers.get(node);
+        return members
+            ? { parallel: true, steps: members }
+            : { parallel: false, steps: [node] };
+    });
 };
 // --- effective conditions ---
 /**
@@ -751,6 +863,33 @@ function extractCommonFactors(terms) {
     return result;
 }
 // --- topological sort ---
+/**
+ * Computes step priorities: each step gets the minimum leaf index of any leaf
+ * step that transitively depends on it (directly or via condition sources).
+ * This makes the topological sort respect the declared `steps` order.
+ */
+function computePriorities(graph, leafSteps) {
+    const allSteps = new Set(graph.keys());
+    const priority = new Map();
+    const assignPriority = (s, p) => {
+        const current = priority.get(s);
+        if (current !== undefined && current <= p)
+            return;
+        priority.set(s, p);
+        const entry = graph.get(s);
+        if (!entry)
+            return;
+        for (const dep of entry.deps) {
+            if (allSteps.has(dep)) {
+                assignPriority(dep, p);
+            }
+        }
+    };
+    for (let i = 0; i < leafSteps.length; i++) {
+        assignPriority(leafSteps[i], i);
+    }
+    return priority;
+}
 function topoSort(steps, priority, graph) {
     // build in-degree map (only counting unique predecessors within our set)
     const inDegree = new Map();

package/esm/mod.d.ts

@@ -1,6 +1,6 @@
 import "./_dnt.polyfills.js";
 export { Step, step, StepRef } from "./step.js";
-export type { ConditionLike, ConfigValue, StepBuilder, StepConfig, StepFunction, StepLike, } from "./step.js";
+export type { CompositeKind, ConditionLike, ConfigValue, StepBuilder, StepConfig, StepFunction, StepLike, } from "./step.js";
 export { Job, job } from "./job.js";
 export type { JobConfig, JobDef, ReusableJobConfig, ReusableJobDef, RunsOn, ServiceContainer, StepsJobConfig, StepsJobDef, } from "./job.js";
 export { isLinting, Workflow, workflow } from "./workflow.js";

package/esm/mod.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"mod.d.ts","sourceRoot":"","sources":["../src/mod.ts"],"names":[],"mappings":"AAAA,OAAO,qBAAqB,CAAC;AAC7B,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAChD,YAAY,EACV,aAAa,EACb,WAAW,EACX,WAAW,EACX,UAAU,EACV,YAAY,EACZ,QAAQ,GACT,MAAM,WAAW,CAAC;AACnB,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,MAAM,UAAU,CAAC;AACpC,YAAY,EACV,SAAS,EACT,MAAM,EACN,iBAAiB,EACjB,cAAc,EACd,MAAM,EACN,gBAAgB,EAChB,cAAc,EACd,WAAW,GACZ,MAAM,UAAU,CAAC;AAClB,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAC9D,YAAY,EACV,iBAAiB,EACjB,kBAAkB,EAClB,kBAAkB,EAClB,mBAAmB,EACnB,cAAc,EACd,gBAAgB,GACjB,MAAM,eAAe,CAAC;AACvB,OAAO,EACL,MAAM,EACN,SAAS,EACT,UAAU,EACV,aAAa,EACb,aAAa,EACb,IAAI,EACJ,eAAe,EACf,QAAQ,EACR,SAAS,EACT,IAAI,EACJ,OAAO,EACP,WAAW,EACX,MAAM,GACP,MAAM,iBAAiB,CAAC;AACzB,YAAY,EACV,YAAY,EACZ,UAAU,EACV,gBAAgB,EAChB,OAAO,EACP,MAAM,EACN,YAAY,GACb,MAAM,iBAAiB,CAAC;AACzB,OAAO,EACL,qBAAqB,EACrB,gBAAgB,EAChB,cAAc,EACd,oBAAoB,EACpB,UAAU,EACV,eAAe,GAChB,MAAM,UAAU,CAAC;AAClB,YAAY,EAAE,QAAQ,EAAE,WAAW,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AACrE,OAAO,EAAE,YAAY,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AACnD,YAAY,EACV,eAAe,EACf,WAAW,EACX,eAAe,GAChB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AACnD,YAAY,EACV,eAAe,EACf,cAAc,EACd,YAAY,GACb,MAAM,eAAe,CAAC;AAIvB,OAAO,EAAE,QAAQ,IAAI,SAAS,EAAE,MAAM,eAAe,CAAC;AACtD,OAAO,EAAE,QAAQ,IAAI,SAAS,EAAE,MAAM,eAAe,CAAC;AAEtD,0CAA0C;AAC1C,eAAO,MAAM,cAAc,EAAE,OAAO,SAAqB,CAAC;AAC1D,0CAA0C;AAC1C,eAAO,MAAM,cAAc,EAAE,OAAO,SAAqB,CAAC"}
+{"version":3,"file":"mod.d.ts","sourceRoot":"","sources":["../src/mod.ts"],"names":[],"mappings":"AAAA,OAAO,qBAAqB,CAAC;AAC7B,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAChD,YAAY,EACV,aAAa,EACb,aAAa,EACb,WAAW,EACX,WAAW,EACX,UAAU,EACV,YAAY,EACZ,QAAQ,GACT,MAAM,WAAW,CAAC;AACnB,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,MAAM,UAAU,CAAC;AACpC,YAAY,EACV,SAAS,EACT,MAAM,EACN,iBAAiB,EACjB,cAAc,EACd,MAAM,EACN,gBAAgB,EAChB,cAAc,EACd,WAAW,GACZ,MAAM,UAAU,CAAC;AAClB,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAC9D,YAAY,EACV,iBAAiB,EACjB,kBAAkB,EAClB,kBAAkB,EAClB,mBAAmB,EACnB,cAAc,EACd,gBAAgB,GACjB,MAAM,eAAe,CAAC;AACvB,OAAO,EACL,MAAM,EACN,SAAS,EACT,UAAU,EACV,aAAa,EACb,aAAa,EACb,IAAI,EACJ,eAAe,EACf,QAAQ,EACR,SAAS,EACT,IAAI,EACJ,OAAO,EACP,WAAW,EACX,MAAM,GACP,MAAM,iBAAiB,CAAC;AACzB,YAAY,EACV,YAAY,EACZ,UAAU,EACV,gBAAgB,EAChB,OAAO,EACP,MAAM,EACN,YAAY,GACb,MAAM,iBAAiB,CAAC;AACzB,OAAO,EACL,qBAAqB,EACrB,gBAAgB,EAChB,cAAc,EACd,oBAAoB,EACpB,UAAU,EACV,eAAe,GAChB,MAAM,UAAU,CAAC;AAClB,YAAY,EAAE,QAAQ,EAAE,WAAW,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AACrE,OAAO,EAAE,YAAY,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AACnD,YAAY,EACV,eAAe,EACf,WAAW,EACX,eAAe,GAChB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AACnD,YAAY,EACV,eAAe,EACf,cAAc,EACd,YAAY,GACb,MAAM,eAAe,CAAC;AAIvB,OAAO,EAAE,QAAQ,IAAI,SAAS,EAAE,MAAM,eAAe,CAAC;AACtD,OAAO,EAAE,QAAQ,IAAI,SAAS,EAAE,MAAM,eAAe,CAAC;AAEtD,0CAA0C;AAC1C,eAAO,MAAM,cAAc,EAAE,OAAO,SAAqB,CAAC;AAC1D,0CAA0C;AAC1C,eAAO,MAAM,cAAc,EAAE,OAAO,SAAqB,CAAC"}

package/esm/pin.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"pin.d.ts","sourceRoot":"","sources":["../src/pin.ts"],"names":[],"mappings":"AAEA,MAAM,WAAW,QAAQ;IACvB,0DAA0D;IAC1D,QAAQ,EAAE,MAAM,CAAC;IACjB,+BAA+B;IAC/B,IAAI,EAAE,MAAM,CAAC;CACd;AAID,wBAAgB,YAAY,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAEjD;AAED,wBAAgB,eAAe,CAC7B,IAAI,EAAE,MAAM,GACX;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAA;CAAE,GAAG,SAAS,CAcxE;AAED,wBAAgB,UAAU,CACxB,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,MAAM,EACZ,GAAG,EAAE,MAAM,GACV,MAAM,CA2BR;AAED,MAAM,MAAM,WAAW,GAAG,CACxB,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,MAAM,EACZ,GAAG,EAAE,MAAM,KACR,MAAM,CAAC;AAEZ;;;GAGG;AACH,wBAAgB,cAAc,CAC5B,OAAO,EAAE,MAAM,EACf,OAAO,GAAE,WAAwB,EACjC,KAAK,CAAC,EAAE,SAAS,QAAQ,EAAE,GAC1B;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,QAAQ,EAAE,CAAA;CAAE,CA+DvC;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,MAAM,GAAG,QAAQ,EAAE,CAqB5D;AAED;;;;;GAKG;AACH,wBAAgB,qBAAqB,CACnC,YAAY,EAAE,SAAS,MAAM,EAAE,GAC9B;IACD,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC9B,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;CAClC,CA2BA;AAED,MAAM,WAAW,aAAa;IAC5B,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;CACZ;AAED;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAClC,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,GACpC;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,aAAa,EAAE,CAAA;CAAE,CAY/C;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAC7B,GAAG,EAAE,OAAO,EACZ,IAAI,EAAE,QAAQ,EAAE,GACf,OAAO,CA8CT"}
+{"version":3,"file":"pin.d.ts","sourceRoot":"","sources":["../src/pin.ts"],"names":[],"mappings":"AAEA,MAAM,WAAW,QAAQ;IACvB,0DAA0D;IAC1D,QAAQ,EAAE,MAAM,CAAC;IACjB,+BAA+B;IAC/B,IAAI,EAAE,MAAM,CAAC;CACd;AAID,wBAAgB,YAAY,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAEjD;AAED,wBAAgB,eAAe,CAC7B,IAAI,EAAE,MAAM,GACX;IAAE,KAAK,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAC;IAAC,GAAG,EAAE,MAAM,CAAA;CAAE,GAAG,SAAS,CAcxE;AAED,wBAAgB,UAAU,CACxB,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,MAAM,EACZ,GAAG,EAAE,MAAM,GACV,MAAM,CA2BR;AAED,MAAM,MAAM,WAAW,GAAG,CACxB,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,MAAM,EACZ,GAAG,EAAE,MAAM,KACR,MAAM,CAAC;AAEZ;;;GAGG;AACH,wBAAgB,cAAc,CAC5B,OAAO,EAAE,MAAM,EACf,OAAO,GAAE,WAAwB,EACjC,KAAK,CAAC,EAAE,SAAS,QAAQ,EAAE,GAC1B;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,QAAQ,EAAE,CAAA;CAAE,CA+DvC;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,MAAM,GAAG,QAAQ,EAAE,CAqB5D;AAED;;;;;GAKG;AACH,wBAAgB,qBAAqB,CACnC,YAAY,EAAE,SAAS,MAAM,EAAE,GAC9B;IACD,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC9B,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;CAClC,CA2BA;AAED,MAAM,WAAW,aAAa;IAC5B,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;CACZ;AAED;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAClC,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,GACpC;IAAE,OAAO,EAAE,MAAM,CAAC;IAAC,OAAO,EAAE,aAAa,EAAE,CAAA;CAAE,CAY/C;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAC7B,GAAG,EAAE,OAAO,EACZ,IAAI,EAAE,QAAQ,EAAE,GACf,OAAO,CAsCT"}

package/esm/pin.js

@@ -200,19 +200,28 @@ export function unpinParsedYaml(obj, pins) {
                 hashToOriginal.has(jobObj.uses)) {
                 jobObj.uses = hashToOriginal.get(jobObj.uses);
             }
-            // steps
+            // steps (including steps nested inside parallel: blocks)
             if (Array.isArray(jobObj.steps)) {
                 for (const s of jobObj.steps) {
-                    if (typeof s === "object" && s !== null) {
-                        const stepObj = s;
-                        if (typeof stepObj.uses === "string" &&
-                            hashToOriginal.has(stepObj.uses)) {
-                            stepObj.uses = hashToOriginal.get(stepObj.uses);
-                        }
-                    }
+                    unpinStep(s, hashToOriginal);
                 }
             }
         }
     }
     return obj;
 }
+/** Reverts a pinned hash on a single step, recursing into `parallel:` blocks. */
+function unpinStep(step, hashToOriginal) {
+    if (typeof step !== "object" || step === null)
+        return;
+    const stepObj = step;
+    if (typeof stepObj.uses === "string" &&
+        hashToOriginal.has(stepObj.uses)) {
+        stepObj.uses = hashToOriginal.get(stepObj.uses);
+    }
+    if (Array.isArray(stepObj.parallel)) {
+        for (const child of stepObj.parallel) {
+            unpinStep(child, hashToOriginal);
+        }
+    }
+}

package/esm/step.d.ts

@@ -14,9 +14,32 @@ export interface StepConfig<O extends string = never> {
     readonly continueOnError?: boolean | string;
     readonly timeoutMinutes?: number;
     readonly outputs?: readonly O[];
+    /** Runs the step asynchronously so the job continues without waiting for it. */
+    readonly background?: boolean;
+    /**
+     * Makes this a `wait` step that blocks until the referenced background
+     * step(s) finish. Prefer `step.waitFor(...)`, which also wires up ordering.
+     */
+    readonly wait?: StepLike | readonly StepLike[];
+    /**
+     * Makes this a `wait-all` step that blocks until all active background steps
+     * finish. Prefer `step.waitForAll()`.
+     */
+    readonly waitAll?: boolean;
+    /**
+     * Makes this a `cancel` step that terminates the referenced background step.
+     * Prefer `step.cancel(...)`, which also wires up ordering.
+     */
+    readonly cancel?: StepLike;
 }
 export declare function resetStepCounter(): void;
 export type StepLike = Step<string> | StepRef<string> | StepConfig;
+/**
+ * How a composite step's children relate to each other. "sequential" children
+ * run one after another (the default); "parallel" children run concurrently and
+ * serialize to a GitHub Actions `parallel:` block.
+ */
+export type CompositeKind = "sequential" | "parallel";
 export declare class Step<O extends string = never> implements ExpressionSource {
     #private;
     readonly config: StepConfig<O>;
@@ -26,8 +49,10 @@ export declare class Step<O extends string = never> implements ExpressionSource
     readonly _crossJobDeps: readonly Step<string>[];
     readonly children: readonly StepLike[];
     constructor(config: StepConfig<O>, crossJobDeps?: Step<string>[]);
-    constructor(children: readonly StepLike[]);
+    constructor(children: readonly StepLike[], kind?: CompositeKind);
     get id(): string;
+    /** Whether this composite's children run sequentially or in parallel. */
+    get kind(): CompositeKind;
     dependsOn(...deps: StepLike[]): StepRef<O>;
     comesAfter(...deps: StepLike[]): StepRef<O>;
     if(condition: ConditionLike): StepRef<O>;
@@ -38,12 +63,34 @@ export interface StepBuilder {
     if(condition: ConditionLike): StepBuilder;
     dependsOn(...deps: StepLike[]): StepBuilder;
     comesAfter(...deps: StepLike[]): StepBuilder;
+    /** Builds a parallel group from the args, carrying this builder's deps/condition. */
+    parallel(...args: (StepConfig | Step<string> | StepRef<string>)[]): StepRef<string>;
 }
 export interface StepFunction {
     <const O extends string = never>(...args: (StepConfig<O> | Step<string> | StepRef<string>)[]): Step<O>;
     if(condition: ConditionLike): StepBuilder;
     dependsOn(...deps: StepLike[]): StepBuilder;
     comesAfter(...deps: StepLike[]): StepBuilder;
+    /**
+     * Groups steps into a parallel block. The steps run concurrently and
+     * serialize to a GitHub Actions `parallel:` block. Shared dependencies
+     * (pulled in via `dependsOn`) are hoisted to run before the block.
+     */
+    parallel(...args: (StepConfig | Step<string> | StepRef<string>)[]): Step<string>;
+    /**
+     * Creates a `wait` step that blocks until the given background step(s)
+     * finish. The referenced steps are ordered before this one and must each be
+     * a background step with an explicit `id`.
+     */
+    waitFor(...steps: (Step<string> | StepRef<string>)[]): StepRef<string>;
+    /** Creates a `wait-all` step that blocks until all background steps finish. */
+    waitForAll(): Step<string>;
+    /**
+     * Creates a `cancel` step that terminates the given background step. The
+     * referenced step is ordered before this one and must be a background step
+     * with an explicit `id`.
+     */
+    cancel(target: Step<string> | StepRef<string>): StepRef<string>;
 }
 export declare const step: StepFunction;
 export declare class StepRef<O extends string = never> {

package/esm/step.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"step.d.ts","sourceRoot":"","sources":["../src/step.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,SAAS,EACT,KAAK,gBAAgB,EACrB,eAAe,EAIhB,MAAM,iBAAiB,CAAC;AAEzB,MAAM,MAAM,aAAa,GAAG,SAAS,GAAG,eAAe,GAAG,MAAM,CAAC;AACjE,MAAM,MAAM,WAAW,GAAG,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,eAAe,CAAC;AAEtE,MAAM,WAAW,UAAU,CAAC,CAAC,SAAS,MAAM,GAAG,KAAK;IAClD,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAAC;IACjC,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC;IACtD,QAAQ,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC;IACrD,QAAQ,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC;IAC5B,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,gBAAgB,CAAC,EAAE,MAAM,CAAC;IACnC,QAAQ,CAAC,eAAe,CAAC,EAAE,OAAO,GAAG,MAAM,CAAC;IAC5C,QAAQ,CAAC,cAAc,CAAC,EAAE,MAAM,CAAC;IACjC,QAAQ,CAAC,OAAO,CAAC,EAAE,SAAS,CAAC,EAAE,CAAC;CACjC;AAKD,wBAAgB,gBAAgB,IAAI,IAAI,CAEvC;AAED,MAAM,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,GAAG,UAAU,CAAC;AAEnE,qBAAa,IAAI,CAAC,CAAC,SAAS,MAAM,GAAG,KAAK,CAAE,YAAW,gBAAgB;;IAErE,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC;IAC/B,QAAQ,CAAC,OAAO,EAAE;SAAG,CAAC,IAAI,CAAC,GAAG,eAAe;KAAE,CAAC;IAEhD,QAAQ,CAAC,aAAa,EAAE,SAAS,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;IAChD,QAAQ,CAAC,QAAQ,EAAE,SAAS,QAAQ,EAAE,CAAC;gBAE3B,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE;gBACpD,QAAQ,EAAE,SAAS,QAAQ,EAAE;IA4CzC,IAAI,EAAE,IAAI,MAAM,CAEf;IAED,SAAS,CAAC,GAAG,IAAI,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC;IAI1C,UAAU,CAAC,GAAG,IAAI,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC;IAI3C,EAAE,CAAC,SAAS,EAAE,aAAa,GAAG,OAAO,CAAC,CAAC,CAAC;IAIxC,MAAM,CAAC,WAAW,CAAC,EAAE,SAAS,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;CAqDzD;AAID,MAAM,WAAW,WAAW;IAC1B,CAAC,KAAK,CAAC,CAAC,SAAS,MAAM,GAAG,KAAK,EAC7B,GAAG,IAAI,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,GAC1D,OAAO,CAAC,CAAC,CAAC,CAAC;IACd,EAAE,CAAC,SAAS,EAAE,aAAa,GAAG,WAAW,CAAC;IAC1C,SAAS,CAAC,GAAG,IAAI,EAAE,QAAQ,EAAE,GAAG,WAAW,CAAC;IAC5C,UAAU,CAAC,GAAG,IAAI,EAAE,QAAQ,EAAE,GAAG,WAAW,CAAC;CAC9C;AAoFD,MAAM,WAAW,YAAY;IAC3B,CAAC,KAAK,CAAC,CAAC,SAAS,MAAM,GAAG,KAAK,EAC7B,GAAG,IAAI,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,GAC1D,IAAI,CAAC,CAAC,CAAC,CAAC;IACX,EAAE,CAAC,SAAS,EAAE,aAAa,GAAG,WAAW,CAAC;IAC1C,SAAS,CAAC,GAAG,IAAI,EAAE,QAAQ,EAAE,GAAG,WAAW,CAAC;IAC5C,UAAU,CAAC,GAAG,IAAI,EAAE,QAAQ,EAAE,GAAG,WAAW,CAAC;CAC9C;AAED,eAAO,MAAM,IAAI,EAAE,YAUlB,CAAC;AAIF,qBAAa,OAAO,CAAC,CAAC,SAAS,MAAM,GAAG,KAAK;IAC3C,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IACvB,QAAQ,CAAC,SAAS,CAAC,EAAE,aAAa,CAAC;IACnC,QAAQ,CAAC,YAAY,EAAE,SAAS,QAAQ,EAAE,CAAC;IAC3C,QAAQ,CAAC,iBAAiB,EAAE,SAAS,QAAQ,EAAE,CAAC;gBAG9C,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,EACb,IAAI,CAAC,EAAE;QACL,SAAS,CAAC,EAAE,aAAa,CAAC;QAC1B,YAAY,CAAC,EAAE,SAAS,QAAQ,EAAE,CAAC;QACnC,iBAAiB,CAAC,EAAE,SAAS,QAAQ,EAAE,CAAC;KACzC;IAQH,IAAI,EAAE,IAAI,MAAM,CAEf;IAED,IAAI,MAAM,IAAI,UAAU,CAAC,CAAC,CAAC,CAE1B;IAED,IAAI,OAAO,IAAI;SAAG,CAAC,IAAI,CAAC,GAAG,eAAe;KAAE,CAE3C;IAED,SAAS,CAAC,GAAG,IAAI,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC;IAQ1C,UAAU,CAAC,GAAG,IAAI,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC;IAQ3C,EAAE,CAAC,SAAS,EAAE,aAAa,GAAG,OAAO,CAAC,CAAC,CAAC;CAOzC;AAID,wBAAgB,sBAAsB,CAAC,CAAC,EAAE,aAAa,GAAG,MAAM,CAQ/D;AAED,wBAAgB,WAAW,CAAC,CAAC,EAAE,aAAa,GAAG,SAAS,CAMvD;AAED,wBAAgB,qBAAqB,CACnC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,GAClC,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,CAAC,CAM3C;AAID,+EAA+E;AAC/E,wBAAgB,iBAAiB,CAC/B,IAAI,EAAE,QAAQ,GACb,IAAI,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAGhC;AAED,sEAAsE;AACtE,wBAAgB,UAAU,CAAC,IAAI,EAAE,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,CAGvD;AAED,uFAAuF;AACvF,wBAAgB,WAAW,CAAC,IAAI,EAAE,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAM1D"}
+{"version":3,"file":"step.d.ts","sourceRoot":"","sources":["../src/step.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,SAAS,EACT,KAAK,gBAAgB,EACrB,eAAe,EAIhB,MAAM,iBAAiB,CAAC;AAEzB,MAAM,MAAM,aAAa,GAAG,SAAS,GAAG,eAAe,GAAG,MAAM,CAAC;AACjE,MAAM,MAAM,WAAW,GAAG,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,eAAe,CAAC;AAEtE,MAAM,WAAW,UAAU,CAAC,CAAC,SAAS,MAAM,GAAG,KAAK;IAClD,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAAC;IACjC,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC;IACtD,QAAQ,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC;IACrD,QAAQ,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC;IAC5B,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,gBAAgB,CAAC,EAAE,MAAM,CAAC;IACnC,QAAQ,CAAC,eAAe,CAAC,EAAE,OAAO,GAAG,MAAM,CAAC;IAC5C,QAAQ,CAAC,cAAc,CAAC,EAAE,MAAM,CAAC;IACjC,QAAQ,CAAC,OAAO,CAAC,EAAE,SAAS,CAAC,EAAE,CAAC;IAChC,gFAAgF;IAChF,QAAQ,CAAC,UAAU,CAAC,EAAE,OAAO,CAAC;IAC9B;;;OAGG;IACH,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,GAAG,SAAS,QAAQ,EAAE,CAAC;IAC/C;;;OAGG;IACH,QAAQ,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC;IAC3B;;;OAGG;IACH,QAAQ,CAAC,MAAM,CAAC,EAAE,QAAQ,CAAC;CAC5B;AAKD,wBAAgB,gBAAgB,IAAI,IAAI,CAEvC;AAED,MAAM,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,GAAG,UAAU,CAAC;AAEnE;;;;GAIG;AACH,MAAM,MAAM,aAAa,GAAG,YAAY,GAAG,UAAU,CAAC;AAEtD,qBAAa,IAAI,CAAC,CAAC,SAAS,MAAM,GAAG,KAAK,CAAE,YAAW,gBAAgB;;IAGrE,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC;IAC/B,QAAQ,CAAC,OAAO,EAAE;SAAG,CAAC,IAAI,CAAC,GAAG,eAAe;KAAE,CAAC;IAEhD,QAAQ,CAAC,aAAa,EAAE,SAAS,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;IAChD,QAAQ,CAAC,QAAQ,EAAE,SAAS,QAAQ,EAAE,CAAC;gBAE3B,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE;gBACpD,QAAQ,EAAE,SAAS,QAAQ,EAAE,EAAE,IAAI,CAAC,EAAE,aAAa;IAgD/D,IAAI,EAAE,IAAI,MAAM,CAEf;IAED,yEAAyE;IACzE,IAAI,IAAI,IAAI,aAAa,CAExB;IAED,SAAS,CAAC,GAAG,IAAI,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC;IAI1C,UAAU,CAAC,GAAG,IAAI,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC;IAI3C,EAAE,CAAC,SAAS,EAAE,aAAa,GAAG,OAAO,CAAC,CAAC,CAAC;IAIxC,MAAM,CAAC,WAAW,CAAC,EAAE,SAAS,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;CAyEzD;AAID,MAAM,WAAW,WAAW;IAC1B,CAAC,KAAK,CAAC,CAAC,SAAS,MAAM,GAAG,KAAK,EAC7B,GAAG,IAAI,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,GAC1D,OAAO,CAAC,CAAC,CAAC,CAAC;IACd,EAAE,CAAC,SAAS,EAAE,aAAa,GAAG,WAAW,CAAC;IAC1C,SAAS,CAAC,GAAG,IAAI,EAAE,QAAQ,EAAE,GAAG,WAAW,CAAC;IAC5C,UAAU,CAAC,GAAG,IAAI,EAAE,QAAQ,EAAE,GAAG,WAAW,CAAC;IAC7C,qFAAqF;IACrF,QAAQ,CACN,GAAG,IAAI,EAAE,CAAC,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,GACvD,OAAO,CAAC,MAAM,CAAC,CAAC;CACpB;AA4FD,MAAM,WAAW,YAAY;IAC3B,CAAC,KAAK,CAAC,CAAC,SAAS,MAAM,GAAG,KAAK,EAC7B,GAAG,IAAI,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,GAC1D,IAAI,CAAC,CAAC,CAAC,CAAC;IACX,EAAE,CAAC,SAAS,EAAE,aAAa,GAAG,WAAW,CAAC;IAC1C,SAAS,CAAC,GAAG,IAAI,EAAE,QAAQ,EAAE,GAAG,WAAW,CAAC;IAC5C,UAAU,CAAC,GAAG,IAAI,EAAE,QAAQ,EAAE,GAAG,WAAW,CAAC;IAC7C;;;;OAIG;IACH,QAAQ,CACN,GAAG,IAAI,EAAE,CAAC,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,GACvD,IAAI,CAAC,MAAM,CAAC,CAAC;IAChB;;;;OAIG;IACH,OAAO,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IACvE,+EAA+E;IAC/E,UAAU,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC;IAC3B;;;;OAIG;IACH,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;CACjE;AAED,eAAO,MAAM,IAAI,EAAE,YAiBlB,CAAC;AAwDF,qBAAa,OAAO,CAAC,CAAC,SAAS,MAAM,GAAG,KAAK;IAC3C,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IACvB,QAAQ,CAAC,SAAS,CAAC,EAAE,aAAa,CAAC;IACnC,QAAQ,CAAC,YAAY,EAAE,SAAS,QAAQ,EAAE,CAAC;IAC3C,QAAQ,CAAC,iBAAiB,EAAE,SAAS,QAAQ,EAAE,CAAC;gBAG9C,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,EACb,IAAI,CAAC,EAAE;QACL,SAAS,CAAC,EAAE,aAAa,CAAC;QAC1B,YAAY,CAAC,EAAE,SAAS,QAAQ,EAAE,CAAC;QACnC,iBAAiB,CAAC,EAAE,SAAS,QAAQ,EAAE,CAAC;KACzC;IAQH,IAAI,EAAE,IAAI,MAAM,CAEf;IAED,IAAI,MAAM,IAAI,UAAU,CAAC,CAAC,CAAC,CAE1B;IAED,IAAI,OAAO,IAAI;SAAG,CAAC,IAAI,CAAC,GAAG,eAAe;KAAE,CAE3C;IAED,SAAS,CAAC,GAAG,IAAI,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC;IAQ1C,UAAU,CAAC,GAAG,IAAI,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC;IAQ3C,EAAE,CAAC,SAAS,EAAE,aAAa,GAAG,OAAO,CAAC,CAAC,CAAC;CAOzC;AA4CD,wBAAgB,sBAAsB,CAAC,CAAC,EAAE,aAAa,GAAG,MAAM,CAQ/D;AAED,wBAAgB,WAAW,CAAC,CAAC,EAAE,aAAa,GAAG,SAAS,CAMvD;AAED,wBAAgB,qBAAqB,CACnC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,GAClC,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,CAAC,CAM3C;AAID,+EAA+E;AAC/E,wBAAgB,iBAAiB,CAC/B,IAAI,EAAE,QAAQ,GACb,IAAI,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAGhC;AAED,sEAAsE;AACtE,wBAAgB,UAAU,CAAC,IAAI,EAAE,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,CAGvD;AAED,uFAAuF;AACvF,wBAAgB,WAAW,CAAC,IAAI,EAAE,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,EAAE,CAM1D"}