gagen 0.4.0 → 0.5.1

package/esm/deps/jsr.io/@std/yaml/1.1.1/_type.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"_type.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/yaml/1.1.1/_type.ts"],"names":[],"mappings":"AAMA;;GAEG;AACH,MAAM,MAAM,QAAQ,GAAG,UAAU,GAAG,QAAQ,GAAG,SAAS,CAAC;AACzD;;GAEG;AACH,MAAM,MAAM,YAAY,GACpB,WAAW,GACX,WAAW,GACX,WAAW,GACX,SAAS,GACT,QAAQ,GACR,OAAO,GACP,aAAa,CAAC;AAElB;;GAEG;AACH,MAAM,MAAM,WAAW,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,YAAY,KAAK,MAAM,CAAC;AAEvE;;GAEG;AAEH,MAAM,WAAW,IAAI,CAAC,CAAC,SAAS,QAAQ,EAAE,CAAC,GAAG,GAAG;IAC/C,+BAA+B;IAC/B,GAAG,EAAE,MAAM,CAAC;IACZ,mBAAmB;IACnB,IAAI,EAAE,CAAC,CAAC;IACR,uCAAuC;IACvC,SAAS,CAAC,EAAE,CAAC,IAAI,EAAE,OAAO,KAAK,IAAI,IAAI,CAAC,CAAC;IACzC,oDAAoD;IACpD,SAAS,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5D,oDAAoD;IACpD,YAAY,CAAC,EAAE,YAAY,CAAC;IAC5B,gFAAgF;IAEhF,OAAO,EAAE,CAAC,IAAI,EAAE,GAAG,KAAK,OAAO,CAAC;IAChC,4DAA4D;IAE5D,SAAS,EAAE,CAAC,IAAI,EAAE,GAAG,KAAK,CAAC,CAAC;CAC7B"}

package/esm/deps/jsr.io/@std/yaml/1.1.1/_utils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"_utils.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/yaml/1.1.1/_utils.ts"],"names":[],"mappings":"AAKA,wBAAgB,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAEzE;AAED,wBAAgB,cAAc,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO,CAEjD;AAED,wBAAgB,aAAa,CAAC,MAAM,EAAE,OAAO,GAAG,MAAM,IAAI,MAAM,CAE/D"}

package/esm/deps/jsr.io/@std/yaml/{1.0.12 → 1.1.1}/parse.d.ts

@@ -16,10 +16,10 @@ export interface ParseOptions {
      */
     allowDuplicateKeys?: boolean;
     /**
-     * If defined, a function to call on warning messages taking an
-     * {@linkcode Error} as its only argument.
+     * If defined, a function to call on warning messages taking a
+     * {@linkcode SyntaxError} as its only argument.
      */
-    onWarning?(error: Error): void;
+    onWarning?(error: SyntaxError): void;
 }
 /**
  * Parse and return a YAML string as a parsed YAML document object.
@@ -39,7 +39,8 @@ export interface ParseOptions {
  * assertEquals(data, { id: 1, name: "Alice" });
  * ```
  *
- * @throws {SyntaxError} Throws error on invalid YAML.
+ * @throws {SyntaxError} Throws if the YAML is invalid or contains more than
+ * one document.
  * @param content YAML string to parse.
  * @param options Parsing options.
  * @returns Parsed document.
@@ -68,9 +69,10 @@ export declare function parse(content: string, options?: ParseOptions): unknown;
  * assertEquals(data, [ { id: 1, name: "Alice" }, { id: 2, name: "Bob" }, { id: 3, name: "Eve" }]);
  * ```
  *
+ * @throws {SyntaxError} Throws if the YAML is invalid.
  * @param content YAML string to parse.
  * @param options Parsing options.
  * @returns Array of parsed documents.
  */
-export declare function parseAll(content: string, options?: ParseOptions): unknown;
+export declare function parseAll(content: string, options?: ParseOptions): unknown[];
 //# sourceMappingURL=parse.d.ts.map

package/esm/deps/jsr.io/@std/yaml/1.1.1/parse.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"parse.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/yaml/1.1.1/parse.ts"],"names":[],"mappings":"AAQA,OAAO,EAAc,KAAK,UAAU,EAAE,MAAM,cAAc,CAAC;AAE3D,YAAY,EAAE,UAAU,EAAE,CAAC;AAE3B,qCAAqC;AACrC,MAAM,WAAW,YAAY;IAC3B;;;;OAIG;IACH,MAAM,CAAC,EAAE,UAAU,CAAC;IACpB;;;;;OAKG;IACH,kBAAkB,CAAC,EAAE,OAAO,CAAC;IAC7B;;;OAGG;IACH,SAAS,CAAC,CAAC,KAAK,EAAE,WAAW,GAAG,IAAI,CAAC;CACtC;AAgBD;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,wBAAgB,KAAK,CACnB,OAAO,EAAE,MAAM,EACf,OAAO,GAAE,YAAiB,GACzB,OAAO,CAcT;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,wBAAgB,QAAQ,CACtB,OAAO,EAAE,MAAM,EACf,OAAO,GAAE,YAAiB,GACzB,OAAO,EAAE,CAOX"}

package/esm/deps/jsr.io/@std/yaml/{1.0.12 → 1.1.1}/parse.js

@@ -36,7 +36,8 @@ function sanitizeInput(input) {
  * assertEquals(data, { id: 1, name: "Alice" });
  * ```
  *
- * @throws {SyntaxError} Throws error on invalid YAML.
+ * @throws {SyntaxError} Throws if the YAML is invalid or contains more than
+ * one document.
  * @param content YAML string to parse.
  * @param options Parsing options.
  * @returns Parsed document.
@@ -77,6 +78,7 @@ export function parse(content, options = {}) {
  * assertEquals(data, [ { id: 1, name: "Alice" }, { id: 2, name: "Bob" }, { id: 3, name: "Eve" }]);
  * ```
  *
+ * @throws {SyntaxError} Throws if the YAML is invalid.
  * @param content YAML string to parse.
  * @param options Parsing options.
  * @returns Array of parsed documents.

package/esm/deps/jsr.io/@std/yaml/{1.0.12 → 1.1.1}/stringify.d.ts

@@ -46,7 +46,7 @@ export type StringifyOptions = {
      *
      * @default {false}
      */
-    sortKeys?: boolean | ((a: string, b: string) => number);
+    sortKeys?: boolean | ((a: string, b: string, depth: number) => number);
     /**
      * Set max line width.
      *

package/esm/deps/jsr.io/@std/yaml/1.1.1/stringify.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"stringify.d.ts","sourceRoot":"","sources":["../../../../../../src/deps/jsr.io/@std/yaml/1.1.1/stringify.ts"],"names":[],"mappings":"AAOA,OAAO,EAAc,KAAK,UAAU,EAAE,MAAM,cAAc,CAAC;AAC3D,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAE/C,YAAY,EAAE,UAAU,EAAE,YAAY,EAAE,CAAC;AAEzC,yCAAyC;AACzC,MAAM,MAAM,gBAAgB,GAAG;IAC7B;;;;OAIG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB;;;;OAIG;IACH,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB;;;;;OAKG;IACH,WAAW,CAAC,EAAE,OAAO,CAAC;IACtB;;;;;OAKG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,mEAAmE;IACnE,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;IACtC;;;;OAIG;IACH,MAAM,CAAC,EAAE,UAAU,CAAC;IACpB;;;;;;;;OAQG;IACH,QAAQ,CAAC,EAAE,OAAO,GAAG,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,KAAK,MAAM,CAAC,CAAC;IACvE;;;;OAIG;IACH,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB;;;;OAIG;IACH,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB;;;;;;OAMG;IACH,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB;;;;;;;OAOG;IACH,YAAY,CAAC,EAAE,OAAO,CAAC;CACxB,CAAC;AAEF;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,SAAS,CACvB,IAAI,EAAE,OAAO,EACb,OAAO,GAAE,gBAAqB,GAC7B,MAAM,CAMR"}

package/esm/job.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"job.d.ts","sourceRoot":"","sources":["../src/job.ts"],"names":[],"mappings":"AAAA,OAAO,EAEL,KAAK,gBAAgB,EACrB,eAAe,EAGhB,MAAM,iBAAiB,CAAC;AAEzB,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AACpD,OAAO,EACL,KAAK,aAAa,EAClB,KAAK,WAAW,EAIhB,IAAI,EACJ,KAAK,QAAQ,EAId,MAAM,WAAW,CAAC;AAEnB,UAAU,eAAe;IACvB,IAAI,CAAC,EAAE,MAAM,GAAG,eAAe,CAAC;IAChC,KAAK,CAAC,EAAE,GAAG,EAAE,CAAC;IACd,EAAE,CAAC,EAAE,aAAa,CAAC;IACnB,WAAW,CAAC,EAAE,WAAW,CAAC;IAC1B,WAAW,CAAC,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,gBAAgB,CAAC,EAAE,OAAO,GAAG,MAAM,CAAA;KAAE,CAAC;IACrE,eAAe,CAAC,EAAE,OAAO,GAAG,MAAM,CAAC;CACpC;AAED,MAAM,WAAW,gBAAgB;IAC/B,KAAK,EAAE,MAAM,CAAC;IACd,WAAW,CAAC,EAAE;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,GAAG,eAAe,CAAA;KAAE,CAAC;IACvE,GAAG,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IAClC,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,EAAE,CAAC;IACnB,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,MAAM,MAAM,GACd,MAAM,GACN,eAAe,GACf,SAAS,MAAM,EAAE,GACjB;IAAE,KAAK,CAAC,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,MAAM,GAAG,SAAS,MAAM,EAAE,CAAA;CAAE,CAAC;AAE5D,MAAM,WAAW,cAAe,SAAQ,eAAe;IACrD,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,CAAC,EAAE;QACT,MAAM,CAAC,EAAE,OAAO,CAAC;QACjB,QAAQ,CAAC,EAAE,OAAO,GAAG,aAAa,CAAC;QACnC,WAAW,CAAC,EAAE,MAAM,CAAC;KACtB,CAAC;IACF,GAAG,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IAClC,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,EAAE;QAAE,GAAG,CAAC,EAAE;YAAE,KAAK,CAAC,EAAE,MAAM,CAAC;YAAC,gBAAgB,CAAC,EAAE,MAAM,CAAA;SAAE,CAAA;KAAE,CAAC;IACnE,WAAW,CAAC,EACR;QAAE,IAAI,EAAE,MAAM,GAAG,eAAe,CAAC;QAAC,GAAG,CAAC,EAAE,MAAM,CAAA;KAAE,GAChD,MAAM,GACN,eAAe,CAAC;IACpB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;IAC5C,SAAS,CAAC,EAAE,gBAAgB,GAAG,MAAM,CAAC;CACvC;AAED,MAAM,WAAW,iBAAkB,SAAQ,eAAe;IACxD,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IACnC,OAAO,CAAC,EAAE,SAAS,GAAG,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;CACnD;AAED,MAAM,MAAM,SAAS,GAAG,cAAc,GAAG,iBAAiB,CAAC;AAE3D,MAAM,WAAW,WAAY,SAAQ,cAAc;IACjD,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,QAAQ,GAAG,QAAQ,EAAE,CAAC;IAC7B,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;CAC3C;AAED,MAAM,WAAW,cAAe,SAAQ,iBAAiB;IACvD,EAAE,CAAC,EAAE,MAAM,CAAC;CACb;AAED,MAAM,MAAM,MAAM,GAAG,WAAW,GAAG,cAAc,CAAC;AAsRlD,qBAAa,GAAI,YAAW,gBAAgB;;IAK1C,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC,CAAM;gBAO/D,EAAE,EAAE,MAAM,EACV,MAAM,EAAE,SAAS,EACjB,IAAI,CAAC,EAAE;QACL,KAAK,CAAC,EAAE,QAAQ,EAAE,CAAC;QACnB,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;KAC3C;IAuBH,IAAI,EAAE,IAAI,MAAM,CAEf;IAkCD,YAAY,IAAI,IAAI,CAAC,MAAM,CAAC,EAAE;IA2B9B,UAAU,CAAC,UAAU,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,GAAG,EAAE;IAgDxD,MAAM,CAAC,UAAU,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;CAoKvE;AA6kBD,wBAAgB,WAAW,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAKjD;AAED,wBAAgB,YAAY,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAQhD;AAID,wBAAgB,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,GAAG,CAUnD"}
+{"version":3,"file":"job.d.ts","sourceRoot":"","sources":["../src/job.ts"],"names":[],"mappings":"AAAA,OAAO,EAEL,KAAK,gBAAgB,EACrB,eAAe,EAGhB,MAAM,iBAAiB,CAAC;AAEzB,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AACpD,OAAO,EACL,KAAK,aAAa,EAClB,KAAK,WAAW,EAIhB,IAAI,EACJ,KAAK,QAAQ,EAId,MAAM,WAAW,CAAC;AAEnB,UAAU,eAAe;IACvB,IAAI,CAAC,EAAE,MAAM,GAAG,eAAe,CAAC;IAChC,KAAK,CAAC,EAAE,GAAG,EAAE,CAAC;IACd,EAAE,CAAC,EAAE,aAAa,CAAC;IACnB,WAAW,CAAC,EAAE,WAAW,CAAC;IAC1B,WAAW,CAAC,EAAE;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,gBAAgB,CAAC,EAAE,OAAO,GAAG,MAAM,CAAA;KAAE,CAAC;IACrE,eAAe,CAAC,EAAE,OAAO,GAAG,MAAM,CAAC;CACpC;AAED,MAAM,WAAW,gBAAgB;IAC/B,KAAK,EAAE,MAAM,CAAC;IACd,WAAW,CAAC,EAAE;QAAE,QAAQ,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,GAAG,eAAe,CAAA;KAAE,CAAC;IACvE,GAAG,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IAClC,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;IACjB,OAAO,CAAC,EAAE,MAAM,EAAE,CAAC;IACnB,OAAO,CAAC,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,MAAM,MAAM,GACd,MAAM,GACN,eAAe,GACf,SAAS,MAAM,EAAE,GACjB;IAAE,KAAK,CAAC,EAAE,MAAM,CAAC;IAAC,MAAM,CAAC,EAAE,MAAM,GAAG,SAAS,MAAM,EAAE,CAAA;CAAE,CAAC;AAE5D,MAAM,WAAW,cAAe,SAAQ,eAAe;IACrD,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,CAAC,EAAE;QACT,MAAM,CAAC,EAAE,OAAO,CAAC;QACjB,QAAQ,CAAC,EAAE,OAAO,GAAG,aAAa,CAAC;QACnC,WAAW,CAAC,EAAE,MAAM,CAAC;KACtB,CAAC;IACF,GAAG,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IAClC,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,EAAE;QAAE,GAAG,CAAC,EAAE;YAAE,KAAK,CAAC,EAAE,MAAM,CAAC;YAAC,gBAAgB,CAAC,EAAE,MAAM,CAAA;SAAE,CAAA;KAAE,CAAC;IACnE,WAAW,CAAC,EACR;QAAE,IAAI,EAAE,MAAM,GAAG,eAAe,CAAC;QAAC,GAAG,CAAC,EAAE,MAAM,CAAA;KAAE,GAChD,MAAM,GACN,eAAe,CAAC;IACpB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;IAC5C,SAAS,CAAC,EAAE,gBAAgB,GAAG,MAAM,CAAC;CACvC;AAED,MAAM,WAAW,iBAAkB,SAAQ,eAAe;IACxD,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;IACnC,OAAO,CAAC,EAAE,SAAS,GAAG,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;CACnD;AAED,MAAM,MAAM,SAAS,GAAG,cAAc,GAAG,iBAAiB,CAAC;AAE3D,MAAM,WAAW,WAAY,SAAQ,cAAc;IACjD,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,KAAK,EAAE,QAAQ,GAAG,QAAQ,EAAE,CAAC;IAC7B,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;CAC3C;AAED,MAAM,WAAW,cAAe,SAAQ,iBAAiB;IACvD,EAAE,CAAC,EAAE,MAAM,CAAC;CACb;AAED,MAAM,MAAM,MAAM,GAAG,WAAW,GAAG,cAAc,CAAC;AAsXlD,qBAAa,GAAI,YAAW,gBAAgB;;IAK1C,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC,CAAM;gBAQ/D,EAAE,EAAE,MAAM,EACV,MAAM,EAAE,SAAS,EACjB,IAAI,CAAC,EAAE;QACL,KAAK,CAAC,EAAE,QAAQ,EAAE,CAAC;QACnB,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;KAC3C;IAuBH,IAAI,EAAE,IAAI,MAAM,CAEf;IAmDD,YAAY,IAAI,IAAI,CAAC,MAAM,CAAC,EAAE;IAmF9B,UAAU,CAAC,UAAU,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,GAAG,EAAE;IAgDxD,MAAM,CAAC,UAAU,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;CAiLvE;AA0mBD,wBAAgB,WAAW,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAKjD;AAED,wBAAgB,YAAY,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM,CAQhD;AAID,wBAAgB,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,GAAG,CAUnD"}

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,14 +1,14 @@
 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";
 export type { WorkflowCallInput, WorkflowCallOutput, WorkflowCallSecret, WorkflowCallTrigger, WorkflowConfig, WorkflowTriggers, } from "./workflow.js";
 export { concat, Condition, conditions, defineExprObj, ElseIfBuilder, expr, ExpressionValue, fromJSON, hashFiles, join, literal, ThenBuilder, toJSON, } from "./expression.js";
 export type { ComparisonOp, ConcatPart, ExpressionSource, ExprMap, ExprOf, TernaryValue, } from "./expression.js";
-export { formatPinComments, parsePinComments, pinYamlContent, resolveRef, unpinParsedYaml, } from "./pin.js";
-export type { PinEntry, RefResolver } from "./pin.js";
+export { collectActionVersions, parsePinComments, pinYamlContent, pullVersionsInSource, resolveRef, unpinParsedYaml, } from "./pin.js";
+export type { PinEntry, RefResolver, VersionChange } from "./pin.js";
 export { defineMatrix, Matrix } from "./matrix.js";
 export type { PermissionLevel, Permissions, PermissionScope, } from "./permissions.js";
 export { Artifact, artifact } from "./artifact.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,iBAAiB,EACjB,gBAAgB,EAChB,cAAc,EACd,UAAU,EACV,eAAe,GAChB,MAAM,UAAU,CAAC;AAClB,YAAY,EAAE,QAAQ,EAAE,WAAW,EAAE,MAAM,UAAU,CAAC;AACtD,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/mod.js

@@ -3,7 +3,7 @@ export { Step, step, StepRef } from "./step.js";
 export { Job, job } from "./job.js";
 export { isLinting, Workflow, workflow } from "./workflow.js";
 export { concat, Condition, conditions, defineExprObj, ElseIfBuilder, expr, ExpressionValue, fromJSON, hashFiles, join, literal, ThenBuilder, toJSON, } from "./expression.js";
-export { formatPinComments, parsePinComments, pinYamlContent, resolveRef, unpinParsedYaml, } from "./pin.js";
+export { collectActionVersions, parsePinComments, pinYamlContent, pullVersionsInSource, resolveRef, unpinParsedYaml, } from "./pin.js";
 export { defineMatrix, Matrix } from "./matrix.js";
 export { Artifact, artifact } from "./artifact.js";
 // deprecated re-exports

package/esm/pin.d.ts

@@ -13,15 +13,45 @@ export declare function parseActionUses(uses: string): {
 } | undefined;
 export declare function resolveRef(owner: string, repo: string, ref: string): string;
 export type RefResolver = (owner: string, repo: string, ref: string) => string;
-/** Resolves non-SHA refs in YAML content to commit hashes. */
+/**
+ * Resolves non-SHA refs in YAML content to commit hashes, writing the
+ * original ref as an inline comment after the pinned `uses:` value.
+ */
 export declare function pinYamlContent(yamlStr: string, resolve?: RefResolver, cache?: readonly PinEntry[]): {
     content: string;
     pins: PinEntry[];
 };
-/** Formats pin entries as comments to append to the file. */
-export declare function formatPinComments(pins: PinEntry[]): string;
-/** Extracts pin entries from file content. */
+/**
+ * Extracts pin entries from file content. Reads the current inline format
+ * (`uses: owner/repo@HASH # ref`) and, for backwards compatibility, the
+ * legacy footer format (`# gagen:pin owner/repo@ref = HASH`).
+ */
 export declare function parsePinComments(content: string): PinEntry[];
+/**
+ * Collects the pinned version for each action across a set of generated
+ * YAML files. If an action appears in multiple files with different
+ * versions, it is returned as a conflict instead — conflicts must be
+ * resolved manually since there is no single correct target version.
+ */
+export declare function collectActionVersions(yamlContents: readonly string[]): {
+    versions: Map<string, string>;
+    conflicts: Map<string, string[]>;
+};
+export interface VersionChange {
+    action: string;
+    from: string;
+    to: string;
+}
+/**
+ * Rewrites literal `"owner/repo@<ref>"` (or single-quoted) strings in
+ * source code to use the target version from the given map. Only matches
+ * literals with a single owner/repo[/path]@ref shape; variables, template
+ * substitutions, and non-string forms are left alone.
+ */
+export declare function pullVersionsInSource(source: string, versions: ReadonlyMap<string, string>): {
+    content: string;
+    changes: VersionChange[];
+};
 /**
  * Replaces pinned hashes in a parsed YAML object with their original
  * tag/branch refs using the provided pin mapping.

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,8DAA8D;AAC9D,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,CAkDvC;AAED,6DAA6D;AAC7D,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,QAAQ,EAAE,GAAG,MAAM,CAO1D;AAED,8CAA8C;AAC9C,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,MAAM,GAAG,QAAQ,EAAE,CAQ5D;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"}