@wildo-ai/saas-specifications 1.1.15 → 1.1.17
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/esm/_core/application-maturity/application-maturity-open-items.d.ts +2 -1
- package/dist/esm/_core/application-maturity/application-maturity-open-items.d.ts.map +1 -1
- package/dist/esm/_core/application-maturity/application-maturity-open-items.js +2 -1
- package/dist/esm/_core/application-maturity/application-maturity-open-items.js.map +1 -1
- package/dist/esm/_core/application-maturity/application-maturity-validation.js +1 -1
- package/dist/esm/_core/application-maturity/application-maturity-validation.js.map +1 -1
- package/dist/esm/_core/build-plan/build-plan-relationship-grouping.d.ts.map +1 -1
- package/dist/esm/_core/build-plan/build-plan-relationship-grouping.js +5 -2
- package/dist/esm/_core/build-plan/build-plan-relationship-grouping.js.map +1 -1
- package/dist/esm/_core/build-plan/build-plan-task-graph-generation.schemas.d.ts +251 -0
- package/dist/esm/_core/build-plan/build-plan-task-graph-generation.schemas.d.ts.map +1 -1
- package/dist/esm/_core/build-plan/build-plan-task-graph-generation.schemas.js +43 -0
- package/dist/esm/_core/build-plan/build-plan-task-graph-generation.schemas.js.map +1 -1
- package/dist/esm/_core/build-plan/build-plan-task-graph.schemas.d.ts +43 -0
- package/dist/esm/_core/build-plan/build-plan-task-graph.schemas.d.ts.map +1 -1
- package/dist/esm/_core/build-plan/build-plan-task-graph.schemas.js +58 -0
- package/dist/esm/_core/build-plan/build-plan-task-graph.schemas.js.map +1 -1
- package/dist/esm/_core/domain-plan/domain-plan-output-set-generation.schemas.d.ts +1 -0
- package/dist/esm/_core/domain-plan/domain-plan-output-set-generation.schemas.d.ts.map +1 -1
- package/dist/esm/_core/domain-plan/domain-plan-output-set-generation.schemas.js +5 -1
- package/dist/esm/_core/domain-plan/domain-plan-output-set-generation.schemas.js.map +1 -1
- package/dist/esm/_core/domain-plan/domain-plan-output-set-validation.js +2 -0
- package/dist/esm/_core/domain-plan/domain-plan-output-set-validation.js.map +1 -1
- package/dist/esm/_core/domain-plan/domain-plan-output-set.schemas.d.ts +3 -0
- package/dist/esm/_core/domain-plan/domain-plan-output-set.schemas.d.ts.map +1 -1
- package/dist/esm/_core/domain-plan/domain-plan-output-set.schemas.js +12 -1
- package/dist/esm/_core/domain-plan/domain-plan-output-set.schemas.js.map +1 -1
- package/dist/esm/_core/execution-view-specification.schemas.d.ts +19 -3
- package/dist/esm/_core/execution-view-specification.schemas.d.ts.map +1 -1
- package/dist/esm/_core/execution-view-specification.schemas.js +11 -1
- package/dist/esm/_core/execution-view-specification.schemas.js.map +1 -1
- package/dist/esm/_core/market/market-snapshot-generation.schemas.d.ts +15 -0
- package/dist/esm/_core/market/market-snapshot-generation.schemas.d.ts.map +1 -1
- package/dist/esm/_core/market/market-snapshot-generation.schemas.js +43 -0
- package/dist/esm/_core/market/market-snapshot-generation.schemas.js.map +1 -1
- package/dist/esm/_core/service-method/service-method-derivation.d.ts +17 -1
- package/dist/esm/_core/service-method/service-method-derivation.d.ts.map +1 -1
- package/dist/esm/_core/service-method/service-method-derivation.js +46 -0
- package/dist/esm/_core/service-method/service-method-derivation.js.map +1 -1
- package/dist/esm/_core/service-method/service-method-generation.schemas.d.ts +5 -0
- package/dist/esm/_core/service-method/service-method-generation.schemas.d.ts.map +1 -1
- package/dist/esm/_core/service-method/service-method.family-aspects.d.ts.map +1 -1
- package/dist/esm/_core/service-method/service-method.family-aspects.js +1 -0
- package/dist/esm/_core/service-method/service-method.family-aspects.js.map +1 -1
- package/dist/esm/_core/service-method/service-method.schemas.d.ts +36 -1
- package/dist/esm/_core/service-method/service-method.schemas.d.ts.map +1 -1
- package/dist/esm/_core/service-method/service-method.schemas.js +49 -1
- package/dist/esm/_core/service-method/service-method.schemas.js.map +1 -1
- package/dist/esm/_core/utils/extract-field-specs.d.ts +4 -3
- package/dist/esm/_core/utils/extract-field-specs.d.ts.map +1 -1
- package/dist/esm/_core/utils/extract-field-specs.js +4 -3
- package/dist/esm/_core/utils/extract-field-specs.js.map +1 -1
- package/dist/esm/application-creation/playbooks.application-creation.schemas.d.ts +5 -4
- package/dist/esm/application-creation/playbooks.application-creation.schemas.d.ts.map +1 -1
- package/dist/esm/application-creation/playbooks.application-creation.schemas.js +5 -4
- package/dist/esm/application-creation/playbooks.application-creation.schemas.js.map +1 -1
- package/dist/esm/assurance/assurance-authority-basis.definitions.d.ts +1 -1
- package/dist/esm/assurance/assurance-authority-basis.definitions.js +1 -1
- package/dist/esm/assurance/assurance-authority-basis.definitions.js.map +1 -1
- package/dist/esm/assurance/assurance-evidence-requirement-bodies.definitions.d.ts.map +1 -1
- package/dist/esm/assurance/assurance-evidence-requirement-bodies.definitions.js +13 -5
- package/dist/esm/assurance/assurance-evidence-requirement-bodies.definitions.js.map +1 -1
- package/dist/esm/assurance/assurance-objective-catalog.definitions.d.ts.map +1 -1
- package/dist/esm/assurance/assurance-objective-catalog.definitions.js +9 -2
- package/dist/esm/assurance/assurance-objective-catalog.definitions.js.map +1 -1
- package/dist/esm/assurance/assurance-verification-requirement-bodies.definitions.d.ts.map +1 -1
- package/dist/esm/assurance/assurance-verification-requirement-bodies.definitions.js +8 -4
- package/dist/esm/assurance/assurance-verification-requirement-bodies.definitions.js.map +1 -1
- package/dist/esm/engine/compliance/resources/signature-requests.resource.specification.d.ts.map +1 -1
- package/dist/esm/engine/compliance/resources/signature-requests.resource.specification.js +8 -5
- package/dist/esm/engine/compliance/resources/signature-requests.resource.specification.js.map +1 -1
- package/dist/esm/engine/engine-resource-specifications.registry.d.ts.map +1 -1
- package/dist/esm/engine/engine-resource-specifications.registry.js +4 -0
- package/dist/esm/engine/engine-resource-specifications.registry.js.map +1 -1
- package/dist/esm/engine/flows-actors/resources/actor-system-executions.resource.specification.d.ts.map +1 -1
- package/dist/esm/engine/flows-actors/resources/actor-system-executions.resource.specification.js +4 -1
- package/dist/esm/engine/flows-actors/resources/actor-system-executions.resource.specification.js.map +1 -1
- package/dist/esm/engine/flows-actors/resources/actor-tasks.resource.specification.d.ts.map +1 -1
- package/dist/esm/engine/flows-actors/resources/actor-tasks.resource.specification.js +3 -0
- package/dist/esm/engine/flows-actors/resources/actor-tasks.resource.specification.js.map +1 -1
- package/dist/esm/engine/flows-actors/resources/remote-agent-task-updates.resource.specification.d.ts +3 -0
- package/dist/esm/engine/flows-actors/resources/remote-agent-task-updates.resource.specification.d.ts.map +1 -0
- package/dist/esm/engine/flows-actors/resources/remote-agent-task-updates.resource.specification.js +98 -0
- package/dist/esm/engine/flows-actors/resources/remote-agent-task-updates.resource.specification.js.map +1 -0
- package/dist/esm/engine/flows-actors/resources/remote-agent-tasks.resource.specification.d.ts +3 -0
- package/dist/esm/engine/flows-actors/resources/remote-agent-tasks.resource.specification.d.ts.map +1 -0
- package/dist/esm/engine/flows-actors/resources/remote-agent-tasks.resource.specification.js +132 -0
- package/dist/esm/engine/flows-actors/resources/remote-agent-tasks.resource.specification.js.map +1 -0
- package/dist/esm/engine/frontend-components/ai-elements/chat/ai-conversation-thread.frontend-component.specification.js +1 -1
- package/dist/esm/engine/frontend-components/ai-elements/chat/ai-conversation-thread.frontend-component.specification.js.map +1 -1
- package/dist/esm/engine/frontend-components/app/app-layout-agent-activity-settings.frontend-component.specification.d.ts +5 -0
- package/dist/esm/engine/frontend-components/app/app-layout-agent-activity-settings.frontend-component.specification.d.ts.map +1 -0
- package/dist/esm/engine/frontend-components/app/app-layout-agent-activity-settings.frontend-component.specification.js +79 -0
- package/dist/esm/engine/frontend-components/app/app-layout-agent-activity-settings.frontend-component.specification.js.map +1 -0
- package/dist/esm/engine/frontend-components/app/app-layout-connected-accounts-settings.frontend-component.specification.d.ts.map +1 -1
- package/dist/esm/engine/frontend-components/app/app-layout-connected-accounts-settings.frontend-component.specification.js +1 -0
- package/dist/esm/engine/frontend-components/app/app-layout-connected-accounts-settings.frontend-component.specification.js.map +1 -1
- package/dist/esm/engine/frontend-components/data-display/approval-seal.frontend-component.specification.js +3 -3
- package/dist/esm/engine/frontend-components/data-display/approval-seal.frontend-component.specification.js.map +1 -1
- package/dist/esm/engine/frontend-components/data-display/signature-requests.frontend-component.specification.d.ts +4 -0
- package/dist/esm/engine/frontend-components/data-display/signature-requests.frontend-component.specification.d.ts.map +1 -0
- package/dist/esm/engine/frontend-components/data-display/signature-requests.frontend-component.specification.js +29 -0
- package/dist/esm/engine/frontend-components/data-display/signature-requests.frontend-component.specification.js.map +1 -0
- package/dist/esm/engine/frontend-components/flows-actors/low-level-ai-approval.frontend-component.specification.js +1 -1
- package/dist/esm/engine/frontend-components/flows-actors/low-level-ai-approval.frontend-component.specification.js.map +1 -1
- package/dist/esm/engine/frontend-components/index.d.ts +2 -0
- package/dist/esm/engine/frontend-components/index.d.ts.map +1 -1
- package/dist/esm/engine/frontend-components/index.js +6 -0
- package/dist/esm/engine/frontend-components/index.js.map +1 -1
- package/dist/esm/engine/notifications/system-emails/delegated-work.system-emails.specification.d.ts +8 -0
- package/dist/esm/engine/notifications/system-emails/delegated-work.system-emails.specification.d.ts.map +1 -0
- package/dist/esm/engine/notifications/system-emails/delegated-work.system-emails.specification.js +65 -0
- package/dist/esm/engine/notifications/system-emails/delegated-work.system-emails.specification.js.map +1 -0
- package/dist/esm/engine/notifications/system-emails/index.d.ts +1 -0
- package/dist/esm/engine/notifications/system-emails/index.d.ts.map +1 -1
- package/dist/esm/engine/notifications/system-emails/index.js +3 -1
- package/dist/esm/engine/notifications/system-emails/index.js.map +1 -1
- package/dist/esm/engine/organizations/resources/organization-members.resource.specification.d.ts +9 -0
- package/dist/esm/engine/organizations/resources/organization-members.resource.specification.d.ts.map +1 -1
- package/dist/esm/engine/organizations/resources/organization-members.resource.specification.js +50 -0
- package/dist/esm/engine/organizations/resources/organization-members.resource.specification.js.map +1 -1
- package/dist/esm/engine/organizations/resources/organization-relationships.resource.specification.d.ts.map +1 -1
- package/dist/esm/engine/organizations/resources/organization-relationships.resource.specification.js +25 -0
- package/dist/esm/engine/organizations/resources/organization-relationships.resource.specification.js.map +1 -1
- package/dist/esm/engine/providers/antigravity.provider.specification.d.ts +7 -0
- package/dist/esm/engine/providers/antigravity.provider.specification.d.ts.map +1 -0
- package/dist/esm/engine/providers/antigravity.provider.specification.js +54 -0
- package/dist/esm/engine/providers/antigravity.provider.specification.js.map +1 -0
- package/dist/esm/engine/providers/google-drive.provider.specification.d.ts.map +1 -1
- package/dist/esm/engine/providers/google-drive.provider.specification.js +8 -0
- package/dist/esm/engine/providers/google-drive.provider.specification.js.map +1 -1
- package/dist/esm/engine/providers/index.d.ts +2 -0
- package/dist/esm/engine/providers/index.d.ts.map +1 -1
- package/dist/esm/engine/providers/index.js +5 -1
- package/dist/esm/engine/providers/index.js.map +1 -1
- package/dist/esm/engine/providers/microsoft-onedrive.provider.specification.d.ts.map +1 -1
- package/dist/esm/engine/providers/microsoft-onedrive.provider.specification.js +17 -0
- package/dist/esm/engine/providers/microsoft-onedrive.provider.specification.js.map +1 -1
- package/dist/esm/engine/providers/outbound-bearer-token.provider.specification.d.ts +7 -0
- package/dist/esm/engine/providers/outbound-bearer-token.provider.specification.d.ts.map +1 -0
- package/dist/esm/engine/providers/outbound-bearer-token.provider.specification.js +41 -0
- package/dist/esm/engine/providers/outbound-bearer-token.provider.specification.js.map +1 -0
- package/dist/esm/engine/providers/twilio.provider.specification.d.ts.map +1 -1
- package/dist/esm/engine/providers/twilio.provider.specification.js +3 -0
- package/dist/esm/engine/providers/twilio.provider.specification.js.map +1 -1
- package/dist/tsconfig.build.tsbuildinfo +1 -1
- package/package.json +8 -8
|
@@ -29,7 +29,8 @@ export declare enum RequirementOpenItemKind {
|
|
|
29
29
|
}
|
|
30
30
|
/**
|
|
31
31
|
* What each evidence level leaves open, by itself. `BUILT` leaves NOTHING open on purpose: a requirement whose build work
|
|
32
|
-
* landed and whose product the probe could not prove (a task that declares no product,
|
|
32
|
+
* landed and whose product the probe could not prove (a task that declares no product, or one whose probe the scaffold had
|
|
33
|
+
* already satisfied, #3900: `unverifiableLandedTaskRefs`) is
|
|
33
34
|
* MARKED ran-not-proven (`application-creation-directive.md`: mark, never gate), and a requirement that is BUILT because
|
|
34
35
|
* something is still missing carries that something as a gap, which is an item below. `VERIFIED` and `OBSERVED` are met.
|
|
35
36
|
*/
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"application-maturity-open-items.d.ts","sourceRoot":"","sources":["../../../../src/_core/application-maturity/application-maturity-open-items.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,wBAAwB,EACxB,KAAK,mBAAmB,EACzB,MAAM,gCAAgC,CAAC;AAExC;;;;;;;;;;;;;;;;;GAiBG;AACH,oBAAY,uBAAuB;IACjC,iEAAiE;IACjE,oBAAoB,yBAAyB;IAC7C,2EAA2E;IAC3E,oBAAoB,yBAAyB;IAC7C,sFAAsF;IACtF,iBAAiB,sBAAsB;IACvC,2FAA2F;IAC3F,2BAA2B,gCAAgC;CAC5D;AAED
|
|
1
|
+
{"version":3,"file":"application-maturity-open-items.d.ts","sourceRoot":"","sources":["../../../../src/_core/application-maturity/application-maturity-open-items.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,wBAAwB,EACxB,KAAK,mBAAmB,EACzB,MAAM,gCAAgC,CAAC;AAExC;;;;;;;;;;;;;;;;;GAiBG;AACH,oBAAY,uBAAuB;IACjC,iEAAiE;IACjE,oBAAoB,yBAAyB;IAC7C,2EAA2E;IAC3E,oBAAoB,yBAAyB;IAC7C,sFAAsF;IACtF,iBAAiB,sBAAsB;IACvC,2FAA2F;IAC3F,2BAA2B,gCAAgC;CAC5D;AAED;;;;;;GAMG;AACH,eAAO,MAAM,2BAA2B,EAAE,QAAQ,CAAC,MAAM,CAAC,wBAAwB,EAAE,uBAAuB,GAAG,IAAI,CAAC,CAMlH,CAAC;AAEF,2DAA2D;AAC3D,MAAM,WAAW,mBAAmB;IAClC,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAC;IAChC,QAAQ,CAAC,IAAI,EAAE,uBAAuB,CAAC;IACvC,qEAAqE;IACrE,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,iGAAiG;IACjG,QAAQ,CAAC,eAAe,CAAC,EAAE,MAAM,CAAC;CACnC;AAED,+HAA+H;AAC/H,wBAAgB,wBAAwB,CAAC,OAAO,EAAE,IAAI,CAAC,mBAAmB,EAAE,cAAc,CAAC,GAAG,mBAAmB,EAAE,CAsBlH"}
|
|
@@ -30,7 +30,8 @@ export var RequirementOpenItemKind;
|
|
|
30
30
|
})(RequirementOpenItemKind || (RequirementOpenItemKind = {}));
|
|
31
31
|
/**
|
|
32
32
|
* What each evidence level leaves open, by itself. `BUILT` leaves NOTHING open on purpose: a requirement whose build work
|
|
33
|
-
* landed and whose product the probe could not prove (a task that declares no product,
|
|
33
|
+
* landed and whose product the probe could not prove (a task that declares no product, or one whose probe the scaffold had
|
|
34
|
+
* already satisfied, #3900: `unverifiableLandedTaskRefs`) is
|
|
34
35
|
* MARKED ran-not-proven (`application-creation-directive.md`: mark, never gate), and a requirement that is BUILT because
|
|
35
36
|
* something is still missing carries that something as a gap, which is an item below. `VERIFIED` and `OBSERVED` are met.
|
|
36
37
|
*/
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"application-maturity-open-items.js","sourceRoot":"","sources":["../../../../src/_core/application-maturity/application-maturity-open-items.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,wBAAwB,GAEzB,MAAM,gCAAgC,CAAC;AAExC;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,CAAN,IAAY,uBASX;AATD,WAAY,uBAAuB;IACjC,iEAAiE;IACjE,wEAA6C,CAAA;IAC7C,2EAA2E;IAC3E,wEAA6C,CAAA;IAC7C,sFAAsF;IACtF,kEAAuC,CAAA;IACvC,2FAA2F;IAC3F,sFAA2D,CAAA;AAC7D,CAAC,EATW,uBAAuB,KAAvB,uBAAuB,QASlC;AAED
|
|
1
|
+
{"version":3,"file":"application-maturity-open-items.js","sourceRoot":"","sources":["../../../../src/_core/application-maturity/application-maturity-open-items.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,wBAAwB,GAEzB,MAAM,gCAAgC,CAAC;AAExC;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,CAAN,IAAY,uBASX;AATD,WAAY,uBAAuB;IACjC,iEAAiE;IACjE,wEAA6C,CAAA;IAC7C,2EAA2E;IAC3E,wEAA6C,CAAA;IAC7C,sFAAsF;IACtF,kEAAuC,CAAA;IACvC,2FAA2F;IAC3F,sFAA2D,CAAA;AAC7D,CAAC,EATW,uBAAuB,KAAvB,uBAAuB,QASlC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,2BAA2B,GAA+E;IACrH,CAAC,wBAAwB,CAAC,WAAW,CAAC,EAAE,uBAAuB,CAAC,oBAAoB;IACpF,CAAC,wBAAwB,CAAC,OAAO,CAAC,EAAE,uBAAuB,CAAC,oBAAoB;IAChF,CAAC,wBAAwB,CAAC,KAAK,CAAC,EAAE,IAAI;IACtC,CAAC,wBAAwB,CAAC,QAAQ,CAAC,EAAE,IAAI;IACzC,CAAC,wBAAwB,CAAC,QAAQ,CAAC,EAAE,IAAI;CAC1C,CAAC;AAYF,+HAA+H;AAC/H,MAAM,UAAU,wBAAwB,CAAC,OAAkD;IACzF,MAAM,KAAK,GAA0B,EAAE,CAAC;IACxC,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,YAAY,EAAE,CAAC;QACvC,MAAM,SAAS,GAAG,2BAA2B,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACzD,IAAI,SAAS,KAAK,uBAAuB,CAAC,oBAAoB,EAAE,CAAC;YAC/D,KAAK,CAAC,IAAI,CAAC,EAAE,cAAc,EAAE,GAAG,CAAC,cAAc,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,8CAA8C,EAAE,CAAC,CAAC;QAC9H,CAAC;aAAM,IAAI,SAAS,KAAK,uBAAuB,CAAC,oBAAoB,EAAE,CAAC;YACtE,KAAK,CAAC,IAAI,CAAC,EAAE,cAAc,EAAE,GAAG,CAAC,cAAc,EAAE,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,gBAAgB,GAAG,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,uCAAuC,EAAE,CAAC,CAAC;QACrK,CAAC;QACD,KAAK,MAAM,GAAG,IAAI,GAAG,CAAC,QAAQ,EAAE,CAAC;YAC/B,KAAK,CAAC,IAAI,CAAC;gBACT,cAAc,EAAE,GAAG,CAAC,cAAc;gBAClC,IAAI,EAAE,uBAAuB,CAAC,iBAAiB;gBAC/C,MAAM,EAAE,GAAG,GAAG,CAAC,aAAa,aAAa,GAAG,CAAC,OAAO,EAAE;gBACtD,GAAG,CAAC,GAAG,CAAC,eAAe,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,eAAe,EAAE,GAAG,CAAC,eAAe,EAAE,CAAC;aACvF,CAAC,CAAC;QACL,CAAC;QACD,KAAK,MAAM,GAAG,IAAI,GAAG,CAAC,iBAAiB,EAAE,CAAC;YACxC,KAAK,CAAC,IAAI,CAAC,EAAE,cAAc,EAAE,GAAG,CAAC,cAAc,EAAE,IAAI,EAAE,uBAAuB,CAAC,2BAA2B,EAAE,MAAM,EAAE,GAAG,GAAG,CAAC,KAAK,kBAAkB,GAAG,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;QACxK,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC","sourcesContent":["import {\n RequirementEvidenceLevel,\n type ApplicationMaturity,\n} from './application-maturity.schemas';\n\n/**\n * WHAT IS STILL OPEN against the application's own requirements (#3701) — the one predicate \"the creation reached its\n * goal\" is derived from.\n *\n * ## Why this exists\n *\n * The unattended drive stopped `goal-reached` on the reference run (2026-11-10) because the loop's model chose to stop,\n * while the application's own maturity reading held 16 of its 24 requirements partly met, each with a gap a coding run\n * reported. A model's choice to stop is a judgement; whether the application meets what it asked of itself is a\n * MEASUREMENT, and this module is that measurement in the form a stop rule can read: one item per thing that keeps a\n * requirement from being met, and an empty list only when nothing does.\n *\n * ## Total over what a reading can say\n *\n * Every row's LEVEL maps to the open item it is, or to none, through {@link REQUIREMENT_LEVEL_OPEN_ITEM}, a total map: a\n * level added to the ladder does not compile until somebody says whether it leaves the requirement open. Every reported\n * gap and every configuration gap on a row is an item of its own, whatever the level.\n */\nexport enum RequirementOpenItemKind {\n /** Nothing the application decided points at the requirement. */\n NOTHING_ADDRESSES_IT = 'NOTHING_ADDRESSES_IT',\n /** Something decided addresses it, and no build work for it has landed. */\n NO_BUILD_WORK_LANDED = 'NO_BUILD_WORK_LANDED',\n /** A coding run reported the requirement still unmet, and the gap is open (#2580). */\n REPORTED_GAP_OPEN = 'REPORTED_GAP_OPEN',\n /** The application's configuration does not turn on what the requirement needs (#3702). */\n CONFIGURATION_DOES_NOT_MEET = 'CONFIGURATION_DOES_NOT_MEET',\n}\n\n/**\n * What each evidence level leaves open, by itself. `BUILT` leaves NOTHING open on purpose: a requirement whose build work\n * landed and whose product the probe could not prove (a task that declares no product, or one whose probe the scaffold had\n * already satisfied, #3900: `unverifiableLandedTaskRefs`) is\n * MARKED ran-not-proven (`application-creation-directive.md`: mark, never gate), and a requirement that is BUILT because\n * something is still missing carries that something as a gap, which is an item below. `VERIFIED` and `OBSERVED` are met.\n */\nexport const REQUIREMENT_LEVEL_OPEN_ITEM: Readonly<Record<RequirementEvidenceLevel, RequirementOpenItemKind | null>> = {\n [RequirementEvidenceLevel.UNADDRESSED]: RequirementOpenItemKind.NOTHING_ADDRESSES_IT,\n [RequirementEvidenceLevel.DECIDED]: RequirementOpenItemKind.NO_BUILD_WORK_LANDED,\n [RequirementEvidenceLevel.BUILT]: null,\n [RequirementEvidenceLevel.VERIFIED]: null,\n [RequirementEvidenceLevel.OBSERVED]: null,\n};\n\n/** One thing that keeps one requirement from being met. */\nexport interface RequirementOpenItem {\n readonly requirementRef: string;\n readonly kind: RequirementOpenItemKind;\n /** The item in words: what is missing, and where it would be met. */\n readonly detail: string;\n /** The task that would close it, when one is named: the follow-up derived for a reported gap. */\n readonly closedByTaskRef?: string;\n}\n\n/** Every open item of a reading, in row order. Empty exactly when every requirement is met by what the reading can measure. */\nexport function listRequirementOpenItems(reading: Pick<ApplicationMaturity, 'requirements'>): RequirementOpenItem[] {\n const items: RequirementOpenItem[] = [];\n for (const row of reading.requirements) {\n const levelItem = REQUIREMENT_LEVEL_OPEN_ITEM[row.level];\n if (levelItem === RequirementOpenItemKind.NOTHING_ADDRESSES_IT) {\n items.push({ requirementRef: row.requirementRef, kind: levelItem, detail: 'nothing the application decided addresses it' });\n } else if (levelItem === RequirementOpenItemKind.NO_BUILD_WORK_LANDED) {\n items.push({ requirementRef: row.requirementRef, kind: levelItem, detail: `addressed by ${row.addressedByRefs.join(', ')}, and no build work for it has landed` });\n }\n for (const gap of row.openGaps) {\n items.push({\n requirementRef: row.requirementRef,\n kind: RequirementOpenItemKind.REPORTED_GAP_OPEN,\n detail: `${gap.originTaskRef} reports: ${gap.missing}`,\n ...(gap.followUpTaskRef === undefined ? {} : { closedByTaskRef: gap.followUpTaskRef }),\n });\n }\n for (const gap of row.configurationGaps) {\n items.push({ requirementRef: row.requirementRef, kind: RequirementOpenItemKind.CONFIGURATION_DOES_NOT_MEET, detail: `${gap.value} is not set in ${gap.declaredIn}` });\n }\n }\n return items;\n}\n"]}
|
|
@@ -74,7 +74,7 @@ export function validateApplicationMaturity(reading) {
|
|
|
74
74
|
findings.push({
|
|
75
75
|
code: ApplicationMaturityFindingCode.LANDED_WITHOUT_PROOF,
|
|
76
76
|
requirementRef: row.requirementRef,
|
|
77
|
-
message: `${row.requirementRef} has landed build work (${row.landedTaskRefs.join(', ')}) whose declared
|
|
77
|
+
message: `${row.requirementRef} has landed build work (${row.landedTaskRefs.join(', ')}) whose product its probe cannot attest (none is declared, or the scaffold had already written what the probe reads), so its evidence stops at BUILT.`,
|
|
78
78
|
});
|
|
79
79
|
}
|
|
80
80
|
}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"application-maturity-validation.js","sourceRoot":"","sources":["../../../../src/_core/application-maturity/application-maturity-validation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,wBAAwB,GAEzB,MAAM,gCAAgC,CAAC;AAExC,kGAAkG;AAClG,MAAM,CAAN,IAAY,8BA2BX;AA3BD,WAAY,8BAA8B;IACxC,2FAA2F;IAC3F,qFAAmD,CAAA;IACnD,qGAAqG;IACrG,+EAA6C,CAAA;IAC7C;;;OAGG;IACH,yEAAuC,CAAA;IACvC;;;OAGG;IACH,6FAA2D,CAAA;IAC3D;;;;;;;;OAQG;IACH,iGAA+D,CAAA;IAC/D,wFAAwF;IACxF,uFAAqD,CAAA;AACvD,CAAC,EA3BW,8BAA8B,KAA9B,8BAA8B,QA2BzC;AAQD;;;;;GAKG;AACH,MAAM,CAAC,MAAM,qCAAqC,GAA8C,EAAE,CAAC;AAEnG,MAAM,UAAU,2BAA2B,CAAC,OAA4B;IACtE,MAAM,QAAQ,GAAiC,EAAE,CAAC;IAClD,IAAI,OAAO,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtC,QAAQ,CAAC,IAAI,CAAC;YACZ,IAAI,EAAE,8BAA8B,CAAC,wBAAwB;YAC7D,cAAc,EAAE,IAAI;YACpB,OAAO,EAAE,iIAAiI;SAC3I,CAAC,CAAC;QACH,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,YAAY,EAAE,CAAC;QACvC,IAAI,GAAG,CAAC,KAAK,KAAK,wBAAwB,CAAC,WAAW,EAAE,CAAC;YACvD,QAAQ,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,8BAA8B,CAAC,uBAAuB;gBAC5D,cAAc,EAAE,GAAG,CAAC,cAAc;gBAClC,OAAO,EAAE,GAAG,GAAG,CAAC,cAAc,8HAA8H;aAC7J,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QACD,IAAI,GAAG,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,aAAa,aAAa,GAAG,CAAC,OAAO,IAAI,GAAG,CAAC,eAAe,KAAK,SAAS,CAAC,CAAC,CAAC,qBAAqB,CAAC,CAAC,CAAC,iBAAiB,GAAG,CAAC,eAAe,eAAe,EAAE,CAAC,CAAC;YAC1M,QAAQ,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,8BAA8B,CAAC,iBAAiB;gBACtD,cAAc,EAAE,GAAG,CAAC,cAAc;gBAClC,OAAO,EAAE,GAAG,GAAG,CAAC,cAAc,mBAAmB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,qDAAqD;aACtH,CAAC,CAAC;QACL,CAAC;QACD,IAAI,GAAG,CAAC,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrC,QAAQ,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,8BAA8B,CAAC,2BAA2B;gBAChE,cAAc,EAAE,GAAG,CAAC,cAAc;gBAClC,OAAO,EAAE,GAAG,GAAG,CAAC,cAAc,mDAAmD,GAAG,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,KAAK,KAAK,GAAG,CAAC,UAAU,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,oEAAoE;aACvO,CAAC,CAAC;QACL,CAAC;QACD,IAAI,GAAG,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,IAAI,GAAG,CAAC,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrE,QAAQ,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,8BAA8B,CAAC,oBAAoB;gBACzD,cAAc,EAAE,GAAG,CAAC,cAAc;gBAClC,OAAO,EAAE,GAAG,GAAG,CAAC,cAAc,2BAA2B,GAAG,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC
|
|
1
|
+
{"version":3,"file":"application-maturity-validation.js","sourceRoot":"","sources":["../../../../src/_core/application-maturity/application-maturity-validation.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,wBAAwB,GAEzB,MAAM,gCAAgC,CAAC;AAExC,kGAAkG;AAClG,MAAM,CAAN,IAAY,8BA2BX;AA3BD,WAAY,8BAA8B;IACxC,2FAA2F;IAC3F,qFAAmD,CAAA;IACnD,qGAAqG;IACrG,+EAA6C,CAAA;IAC7C;;;OAGG;IACH,yEAAuC,CAAA;IACvC;;;OAGG;IACH,6FAA2D,CAAA;IAC3D;;;;;;;;OAQG;IACH,iGAA+D,CAAA;IAC/D,wFAAwF;IACxF,uFAAqD,CAAA;AACvD,CAAC,EA3BW,8BAA8B,KAA9B,8BAA8B,QA2BzC;AAQD;;;;;GAKG;AACH,MAAM,CAAC,MAAM,qCAAqC,GAA8C,EAAE,CAAC;AAEnG,MAAM,UAAU,2BAA2B,CAAC,OAA4B;IACtE,MAAM,QAAQ,GAAiC,EAAE,CAAC;IAClD,IAAI,OAAO,CAAC,YAAY,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtC,QAAQ,CAAC,IAAI,CAAC;YACZ,IAAI,EAAE,8BAA8B,CAAC,wBAAwB;YAC7D,cAAc,EAAE,IAAI;YACpB,OAAO,EAAE,iIAAiI;SAC3I,CAAC,CAAC;QACH,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,YAAY,EAAE,CAAC;QACvC,IAAI,GAAG,CAAC,KAAK,KAAK,wBAAwB,CAAC,WAAW,EAAE,CAAC;YACvD,QAAQ,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,8BAA8B,CAAC,uBAAuB;gBAC5D,cAAc,EAAE,GAAG,CAAC,cAAc;gBAClC,OAAO,EAAE,GAAG,GAAG,CAAC,cAAc,8HAA8H;aAC7J,CAAC,CAAC;YACH,SAAS;QACX,CAAC;QACD,IAAI,GAAG,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,aAAa,aAAa,GAAG,CAAC,OAAO,IAAI,GAAG,CAAC,eAAe,KAAK,SAAS,CAAC,CAAC,CAAC,qBAAqB,CAAC,CAAC,CAAC,iBAAiB,GAAG,CAAC,eAAe,eAAe,EAAE,CAAC,CAAC;YAC1M,QAAQ,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,8BAA8B,CAAC,iBAAiB;gBACtD,cAAc,EAAE,GAAG,CAAC,cAAc;gBAClC,OAAO,EAAE,GAAG,GAAG,CAAC,cAAc,mBAAmB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,qDAAqD;aACtH,CAAC,CAAC;QACL,CAAC;QACD,IAAI,GAAG,CAAC,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrC,QAAQ,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,8BAA8B,CAAC,2BAA2B;gBAChE,cAAc,EAAE,GAAG,CAAC,cAAc;gBAClC,OAAO,EAAE,GAAG,GAAG,CAAC,cAAc,mDAAmD,GAAG,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,KAAK,KAAK,GAAG,CAAC,UAAU,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,oEAAoE;aACvO,CAAC,CAAC;QACL,CAAC;QACD,IAAI,GAAG,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,IAAI,GAAG,CAAC,cAAc,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACrE,QAAQ,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,8BAA8B,CAAC,oBAAoB;gBACzD,cAAc,EAAE,GAAG,CAAC,cAAc;gBAClC,OAAO,EAAE,GAAG,GAAG,CAAC,cAAc,2BAA2B,GAAG,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,uJAAuJ;aAC9O,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IACD,IAAI,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,eAAe,CAAC,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC;QAC1E,QAAQ,CAAC,IAAI,CAAC;YACZ,IAAI,EAAE,8BAA8B,CAAC,6BAA6B;YAClE,cAAc,EAAE,IAAI;YACpB,OAAO,EAAE,iHAAiH;kBACtH,+KAA+K;SACpL,CAAC,CAAC;IACL,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC","sourcesContent":["import {\n RequirementEvidenceLevel,\n type ApplicationMaturity,\n} from './application-maturity.schemas';\n\n/** Deterministic finding over a maturity reading; what the reading SAYS about the application. */\nexport enum ApplicationMaturityFindingCode {\n /** A requirement nothing the application decided points at — the reading's whole point. */\n REQUIREMENT_UNADDRESSED = 'REQUIREMENT_UNADDRESSED',\n /** A requirement whose build task landed and could not be proven, so its evidence stops at BUILT. */\n LANDED_WITHOUT_PROOF = 'LANDED_WITHOUT_PROOF',\n /**\n * A requirement a coding run reported still unmet, with the gap open (#2580): its evidence stops at BUILT, and the\n * finding names what is missing and the follow-up that answers it.\n */\n REPORTED_GAP_OPEN = 'REPORTED_GAP_OPEN',\n /**\n * A requirement the application's configuration does not meet (#3702): it declares an engine capability that is not\n * enabled, or a language that is not served. Its evidence stops at BUILT, and the finding names the declaration to set.\n */\n CONFIGURATION_DOES_NOT_MEET = 'CONFIGURATION_DOES_NOT_MEET',\n /**\n * NO requirement carries a runtime observation, and the reading says why rather than leaving the\n * top of the ladder quietly empty.\n *\n * This is the `RUNTIME_EVIDENCE` lesson from `compliance-is-derived-from-the-product.md`, applied\n * before it costs anything: a tier with no producer reads as \"measured and absent\" when it means\n * \"nothing can measure this yet\". The producer that would fill it is the engine-behaviour e2e\n * drive — a browser scenario naming the requirement it exercises — so the finding names it.\n */\n NO_RUNTIME_OBSERVATION_SOURCE = 'NO_RUNTIME_OBSERVATION_SOURCE',\n /** The application declares no requirements, so there is nothing to measure against. */\n NO_REQUIREMENTS_DECLARED = 'NO_REQUIREMENTS_DECLARED',\n}\n\nexport interface ApplicationMaturityFinding {\n readonly code: ApplicationMaturityFindingCode;\n readonly requirementRef: string | null;\n readonly message: string;\n}\n\n/**\n * NO hard floor, and this one is not a judgement call: a reading that refused would be a gate, and\n * the family exists precisely because there is no \"done\" to gate on. Every finding below describes\n * the APPLICATION — a requirement nobody addressed, a proof nobody could take — and an application\n * in that state is the ordinary early state rather than a defect in the artifact.\n */\nexport const APPLICATION_MATURITY_HARD_FLOOR_CODES: readonly ApplicationMaturityFindingCode[] = [];\n\nexport function validateApplicationMaturity(reading: ApplicationMaturity): readonly ApplicationMaturityFinding[] {\n const findings: ApplicationMaturityFinding[] = [];\n if (reading.requirements.length === 0) {\n findings.push({\n code: ApplicationMaturityFindingCode.NO_REQUIREMENTS_DECLARED,\n requirementRef: null,\n message: 'This application declares no requirements, so its maturity cannot be measured — the reading is NOT_MEASURABLE rather than zero.',\n });\n return findings;\n }\n for (const row of reading.requirements) {\n if (row.level === RequirementEvidenceLevel.UNADDRESSED) {\n findings.push({\n code: ApplicationMaturityFindingCode.REQUIREMENT_UNADDRESSED,\n requirementRef: row.requirementRef,\n message: `${row.requirementRef} is addressed by nothing the application has decided: no feature draft, surface, background unit or build task points at it.`,\n });\n continue;\n }\n if (row.openGaps.length > 0) {\n const gaps = row.openGaps.map((gap) => `${gap.originTaskRef} reports \"${gap.missing}\"${gap.followUpTaskRef === undefined ? ', with no follow-up' : `, answered by ${gap.followUpTaskRef} (not landed)`}`);\n findings.push({\n code: ApplicationMaturityFindingCode.REPORTED_GAP_OPEN,\n requirementRef: row.requirementRef,\n message: `${row.requirementRef} is partly met: ${gaps.join('; ')}. Its evidence stops at BUILT until the gap closes.`,\n });\n }\n if (row.configurationGaps.length > 0) {\n findings.push({\n code: ApplicationMaturityFindingCode.CONFIGURATION_DOES_NOT_MEET,\n requirementRef: row.requirementRef,\n message: `${row.requirementRef} is not met by the application's configuration: ${row.configurationGaps.map((gap) => `${gap.value} (${gap.declaredIn})`).join('; ')}. Its evidence stops at BUILT until the configuration declares it.`,\n });\n }\n if (row.landedTaskRefs.length > 0 && row.provenTaskRefs.length === 0) {\n findings.push({\n code: ApplicationMaturityFindingCode.LANDED_WITHOUT_PROOF,\n requirementRef: row.requirementRef,\n message: `${row.requirementRef} has landed build work (${row.landedTaskRefs.join(', ')}) whose product its probe cannot attest (none is declared, or the scaffold had already written what the probe reads), so its evidence stops at BUILT.`,\n });\n }\n }\n if (reading.requirements.every((row) => row.observationRefs.length === 0)) {\n findings.push({\n code: ApplicationMaturityFindingCode.NO_RUNTIME_OBSERVATION_SOURCE,\n requirementRef: null,\n message: 'No requirement carries a runtime observation, so the OBSERVED level is unreachable for this application today. '\n + 'What would fill it: an engine-behaviour e2e scenario that names the requirement it exercises, so a drive against the running application is evidence rather than a green log.',\n });\n }\n return findings;\n}\n"]}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"build-plan-relationship-grouping.d.ts","sourceRoot":"","sources":["../../../../src/_core/build-plan/build-plan-relationship-grouping.ts"],"names":[],"mappings":"AAAA,OAAO,EAAqD,KAAK,aAAa,EAAE,KAAK,kBAAkB,EAAE,MAAM,iCAAiC,CAAC;AAEjJ;;;;;;;;GAQG;AACH,eAAO,MAAM,mCAAmC,IAAI,CAAC;AAErD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AACH,wBAAgB,8BAA8B,CAAC,KAAK,EAAE,kBAAkB,EAAE,cAAc,GAAE,WAAW,CAAC,MAAM,CAAa,GAAG,kBAAkB,CA+B7I;
|
|
1
|
+
{"version":3,"file":"build-plan-relationship-grouping.d.ts","sourceRoot":"","sources":["../../../../src/_core/build-plan/build-plan-relationship-grouping.ts"],"names":[],"mappings":"AAAA,OAAO,EAAqD,KAAK,aAAa,EAAE,KAAK,kBAAkB,EAAE,MAAM,iCAAiC,CAAC;AAEjJ;;;;;;;;GAQG;AACH,eAAO,MAAM,mCAAmC,IAAI,CAAC;AAErD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AACH,wBAAgB,8BAA8B,CAAC,KAAK,EAAE,kBAAkB,EAAE,cAAc,GAAE,WAAW,CAAC,MAAM,CAAa,GAAG,kBAAkB,CA+B7I;AA8OD,kGAAkG;AAClG,wBAAgB,6BAA6B,CAAC,IAAI,EAAE,aAAa,GAAG,SAAS,MAAM,EAAE,CAEpF;AAED,2EAA2E;AAC3E,wBAAgB,oCAAoC,CAAC,IAAI,EAAE,aAAa,GAAG,SAAS,MAAM,EAAE,CAE3F"}
|
|
@@ -214,7 +214,9 @@ function groupRelationshipTasksExcept(graph, chained, order, sealedTaskRefs) {
|
|
|
214
214
|
for (let position = 1; position < ordered.length; position += 1) {
|
|
215
215
|
const task = ordered[position];
|
|
216
216
|
const previous = ordered[position - 1];
|
|
217
|
-
|
|
217
|
+
// Never onto a sealed task (#3901): a built or landed task keeps the prerequisites it has, and its file is already
|
|
218
|
+
// ordered by the edges it was landed with.
|
|
219
|
+
if (!sealedTaskRefs.has(task.taskRef) && !closureOf(task.taskRef).has(previous.taskRef))
|
|
218
220
|
chainedAfter.set(task.taskRef, previous.taskRef);
|
|
219
221
|
}
|
|
220
222
|
}
|
|
@@ -245,7 +247,8 @@ function groupRelationshipTasksExcept(graph, chained, order, sealedTaskRefs) {
|
|
|
245
247
|
produces: run.flatMap((task) => task.produces),
|
|
246
248
|
skillRefs: unique(run.flatMap((task) => task.skillRefs)),
|
|
247
249
|
prerequisiteTaskRefs: unique([
|
|
248
|
-
|
|
250
|
+
// A sealed run keeps its own prerequisites (#3901): a new run chains after it, never it after another.
|
|
251
|
+
...(previousRun === undefined || sealedTaskRefs.has(head.taskRef) ? [] : [previousRun]),
|
|
249
252
|
...run.flatMap((task) => task.prerequisiteTaskRefs).filter((ref) => !memberRefs.has(ref)).map(remap),
|
|
250
253
|
]).filter((ref) => ref !== head.taskRef),
|
|
251
254
|
servesRefs: unique(run.flatMap((task) => task.servesRefs)),
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"build-plan-relationship-grouping.js","sourceRoot":"","sources":["../../../../src/_core/build-plan/build-plan-relationship-grouping.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,wBAAwB,EAAE,uBAAuB,EAA+C,MAAM,iCAAiC,CAAC;AAEjJ;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,mCAAmC,GAAG,CAAC,CAAC;AAErD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AACH,MAAM,UAAU,8BAA8B,CAAC,KAAyB,EAAE,iBAAsC,IAAI,GAAG,EAAE;IACvH;;;;;;;;;;;;;OAaG;IACH,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;IAC/B,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAU,CAAC,CAAC,CAAC;IACnF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,SAAS,CAAC;QACR,MAAM,OAAO,GAAG,4BAA4B,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC;QACpF,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAU,CAAC,CAAC,CAAC;QAClF,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;YACrF,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAChC,OAAO,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,uBAAuB,CAAC,YAAY,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC;gBAC3H,yGAAyG;mBACtG,CAAC,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,oBAAoB,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,oBAAoB,CAAC,CAAC;gBACzJ,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACnC,CAAC,CAAC,CAAC,CAAC;QACJ,IAAI,eAAe,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,OAAO,CAAC;QAC/C,KAAK,MAAM,SAAS,IAAI,eAAe;YAAE,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAClE,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,kBAAkB,CAAC,KAAyB;IACnD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAU,CAAC,CAAC,CAAC;IAChF,MAAM,eAAe,GAAG,CAAC,OAAe,EAAqB,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,oBAAoB,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACjJ,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC;YAAE,SAAS;QACtC,MAAM,IAAI,GAAiD,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;QAChG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAC9B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAChC,IAAI,IAAI,CAAC,CAAC;QACV,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACzB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC1B,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC;YAC3B,MAAM,aAAa,GAAG,eAAe,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YACrD,IAAI,KAAK,CAAC,IAAI,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC;gBACtC,MAAM,YAAY,GAAG,aAAa,CAAC,KAAK,CAAC,IAAI,CAAE,CAAC;gBAChD,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC;gBAChB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,CAAC;oBAC7B,KAAK,CAAC,GAAG,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;oBAC9B,OAAO,CAAC,GAAG,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;oBAChC,IAAI,IAAI,CAAC,CAAC;oBACV,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;oBACzB,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;oBAC1B,IAAI,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;gBAChD,CAAC;qBAAM,IAAI,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,CAAC;oBACrC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAE,EAAE,KAAK,CAAC,GAAG,CAAC,YAAY,CAAE,CAAC,CAAC,CAAC;gBAC9F,CAAC;gBACD,SAAS;YACX,CAAC;YACD,IAAI,CAAC,GAAG,EAAE,CAAC;YACX,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3B,IAAI,MAAM,KAAK,SAAS;gBAAE,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAE,EAAE,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAE,CAAC,CAAC,CAAC;YAC3H,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC;gBAAE,SAAS;YACtE,MAAM,SAAS,GAAa,EAAE,CAAC;YAC/B,SAAS,CAAC;gBACR,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;gBAC5B,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBACvB,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACvB,IAAI,MAAM,KAAK,KAAK,CAAC,OAAO;oBAAE,MAAM;YACtC,CAAC;YACD,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,eAAe,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC;gBAAE,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC7G,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,SAAS,SAAS,CAAC,KAAyB;IAC1C,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;IAC/D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,MAAM,SAAS,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;IACnC,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC1H,MAAM,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC7D,MAAM,CAAC,GAAG,CAAC,IAAK,CAAC,OAAO,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,SAAS,4BAA4B,CACnC,KAAyB,EACzB,OAA4B,EAC5B,KAAkC,EAClC,cAAmC;IAEnC,MAAM,yBAAyB,GAAG,IAAI,GAAG,EAA2B,CAAC;IACrE,MAAM,oBAAoB,GAAG,IAAI,GAAG,EAA2B,CAAC;IAChE,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,uBAAuB,CAAC,YAAY;YAAE,SAAS;QACxE,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,yBAAyB,CAAC;QACvG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;IAC9F,CAAC;IACD;;;;;;;;;;;OAWG;IACH,MAAM,SAAS,GAAG,uBAAuB,CAAC,KAAK,CAAC,CAAC;IACjD,MAAM,IAAI,GAAsB,EAAE,CAAC;IACnC,KAAK,MAAM,KAAK,IAAI,yBAAyB,CAAC,MAAM,EAAE,EAAE,CAAC;QACvD,IAAI,OAAO,GAAoB,EAAE,CAAC;QAClC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,eAAe,GAAG,KAAK,CAAC;QAC5B;;;;WAIG;QACH,MAAM,UAAU,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC/I,KAAK,MAAM,IAAI,IAAI,iBAAiB,CAAC,UAAU,EAAE,SAAS,CAAC,EAAE,CAAC;YAC5D,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,uBAAuB,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACtH,MAAM,cAAc,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;YAC7F,yGAAyG;YACzG,MAAM,MAAM,GAAG,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAChD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,MAAM,IAAI,eAAe,IAAI,cAAc,IAAI,KAAK,GAAG,SAAS,GAAG,mCAAmC,CAAC,EAAE,CAAC;gBACnI,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACnB,OAAO,GAAG,EAAE,CAAC;gBACb,KAAK,GAAG,CAAC,CAAC;YACZ,CAAC;YACD,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,KAAK,IAAI,SAAS,CAAC;YACnB,eAAe,GAAG,MAAM,CAAC;QAC3B,CAAC;QACD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC7C,CAAC;IACD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC/C,KAAK,MAAM,KAAK,IAAI,oBAAoB,CAAC,MAAM,EAAE,EAAE,CAAC;QAClD,MAAM,OAAO,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAE,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAE,CAAC,CAAC;QACvG,KAAK,IAAI,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,OAAO,CAAC,MAAM,EAAE,QAAQ,IAAI,CAAC,EAAE,CAAC;YAChE,MAAM,IAAI,GAAG,OAAO,CAAC,QAAQ,CAAE,CAAC;YAChC,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,GAAG,CAAC,CAAE,CAAC;YACxC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,OAAO,CAAC;gBAAE,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,OAAO,CAAC,CAAC;QACvG,CAAC;IACH,CAAC;IACD,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAE9G,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC7C,KAAK,MAAM,GAAG,IAAI,IAAI;QAAE,KAAK,MAAM,IAAI,IAAI,GAAG;YAAE,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAE,CAAC,OAAO,CAAC,CAAC;IAC9F,MAAM,KAAK,GAAG,CAAC,OAAe,EAAU,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,OAAO,CAAC;IAC9E,MAAM,MAAM,GAAG,CAAI,MAAoB,EAAO,EAAE,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;IAEtE,MAAM,YAAY,GAAG,IAAI,GAAG,EAAyB,CAAC;IACtD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAoB,CAAC;IACjD,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAE,CAAC;QACrB,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,uBAAuB,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;QACzG,MAAM,WAAW,GAAG,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACxD,YAAY,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;QACpF,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5D,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE;YAC7B,GAAG,IAAI;YACP,SAAS,EAAE,GAAG,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;YAC1F,MAAM,EAAE;gBACN,IAAI,EAAE,uBAAuB,CAAC,YAAY;gBAC1C,SAAS;gBACT,gBAAgB,EAAE,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,uBAAuB,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;aACjJ;YACD,QAAQ,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC;YAC9C,SAAS,EAAE,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACxD,oBAAoB,EAAE,MAAM,CAAC;gBAC3B,GAAG,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;gBACnD,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC;aACrG,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,KAAK,IAAI,CAAC,OAAO,CAAC;YACxC,UAAU,EAAE,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;SAC3D,CAAC,CAAC;IACL,CAAC;IAED,MAAM,KAAK,GAAoB,EAAE,CAAC;IAClC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC9C,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACnB,SAAS;QACX,CAAC;QACD,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC;YAAE,SAAS;QAC3C,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC7C,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,oBAAoB,EAAE,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC5I,CAAC;IACD,OAAO,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE,CAAC;AAC7B,CAAC;AAED,0GAA0G;AAC1G,SAAS,uBAAuB,CAAC,KAAyB;IACxD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAU,CAAC,CAAC,CAAC;IAChF,MAAM,IAAI,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC5C,OAAO,CAAC,OAAO,EAAE,EAAE;QACjB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAChC,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QACtC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAC3B,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,oBAAoB,IAAI,EAAE,CAAC,CAAC,CAAC;QACpE,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;YAC1B,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,SAAS;YAChC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,oBAAoB,IAAI,EAAE,CAAC,CAAC,CAAC;QAC/D,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAS,iBAAiB,CAAC,KAA+B,EAAE,SAAmD;IAC7G,MAAM,OAAO,GAAoB,EAAE,CAAC;IACpC,MAAM,SAAS,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;IAC7B,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,KAAK,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACvI,MAAM,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC7D,OAAO,CAAC,IAAI,CAAC,IAAK,CAAC,CAAC;IACtB,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,wGAAwG;AACxG,SAAS,gBAAgB,CAAC,IAAgC;IACxD,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAkB,CAAC;IACnD,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAE,CAAC;QACrB,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,uBAAuB,CAAC,YAAY;YAAE,SAAS;QACxE,MAAM,QAAQ,GAAG,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QAC7D,IAAI,QAAQ,KAAK,SAAS,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,QAAQ,CAAC,QAAQ,CAAC;YAAE,OAAO,IAAI,CAAC;QACzF,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IAC5D,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,kGAAkG;AAClG,MAAM,UAAU,6BAA6B,CAAC,IAAmB;IAC/D,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,uBAAuB,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC;AACvG,CAAC;AAED,2EAA2E;AAC3E,MAAM,UAAU,oCAAoC,CAAC,IAAmB;IACtE,OAAO,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,IAAI,KAAK,wBAAwB,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAChJ,CAAC","sourcesContent":["import { BuildPlanTaskProductKind, BuildPlanTaskTargetKind, type BuildPlanTask, type BuildPlanTaskGraph } from './build-plan-task-graph.schemas';\n\n/**\n * The most edges one relationship task wires (#3209).\n *\n * A module's edges are one task because they are one FILE; but a task is one coding run, and a run has a\n * time budget (30 minutes by default). Each edge is a `createResourcesRelationship(...)` call plus the holder's\n * ui-behavior and both resources' specifications (#2503), measured on app-creation-test-007 at a few minutes of\n * editing each, with the worker's start and the four checks paid once per run on top. Six edges fit a run with\n * room to spare; the 23 edges of 007's `building-lifecycle` module become four chained runs instead of 23.\n */\nexport const MAXIMUM_RELATIONSHIP_EDGES_PER_TASK = 6;\n\n/**\n * One relationship task per module relationships FILE, chained when a module holds more edges than one run\n * wires (#3209). A pure normalization of a generated plan, applied by the trusted runtime\n * (`parseBuildPlanTaskGraphGeneration`) rather than asked of the model.\n *\n * ## Why the runtime does it instead of the method\n *\n * The decomposer's method says to group edges per module, and a method instruction is a prompt, not a gate:\n * this whole directory is the record of rules that existed in prose and were enforced nowhere. Grouping is a\n * FUNCTION of the plan — which edges share a file is the target's `moduleRef` — so it is derived here, and a\n * model that emits one task per edge still lands a grouped plan. A plan that is already grouped comes back\n * unchanged, so a refining decompose that reuses its prior refs is stable.\n *\n * ## What one group becomes\n *\n * - The edges of one module, in plan order, cut into runs of at most {@link MAXIMUM_RELATIONSHIP_EDGES_PER_TASK}.\n * - Each run is ONE task: its target names every edge it wires (`relationshipRefs`), its products are the union\n * of the merged tasks' products, its prerequisites, skills and `servesRefs` the union of theirs (minus refs to\n * tasks merged into it), its objective each merged objective in order.\n * - Runs of one module are CHAINED: run `k + 1` waits on run `k`. They write one file, and two runs editing one\n * file concurrently is exactly the interference that made the wave re-run each task alone.\n * - Its ref is the first merged task's ref (in dependency order), so a single-edge module keeps its ref. Every edge\n * naming a merged task is rewritten to the run that absorbed it.\n *\n * A task whose target is not `RELATIONSHIP` is untouched. Tasks keep their plan order: a run sits where its first\n * merged task sat.\n *\n * ## A built task is a run of its own (#3204)\n *\n * `sealedTaskRefs` names the tasks already built (landed). Each is a run alone: nothing is merged into it and it is never\n * merged into another, so its ref, target and products stay what they were built as. A new edge of the same module becomes\n * its own run, chained after (or before) the built one like any other run of the module. Without this, a re-decompose that\n * kept a built relationship task exactly and added a new edge beside it had the new edge folded into the built task, which\n * then read as changed (or, the new task first in order, absorbed it and dropped its ref) and was refused for it.\n */\nexport function groupRelationshipTasksByModule(graph: BuildPlanTaskGraph, sealedTaskRefs: ReadonlySet<string> = new Set()): BuildPlanTaskGraph {\n /*\n * Grouping must never make a plan cyclic, and within one module the cut below already guarantees it. ACROSS modules it\n * cannot (review of f077ae7db): merging unions the members' prerequisites, so `a2 → b1` and `b2 → a1` — a valid plan —\n * become `run(a) → run(b) → run(a)`. So the grouped plan is checked, and every module with a node the grouping made on a\n * cycle is CHAINED instead of merged: its tasks stay as written and each waits on the one before it in one order of the\n * whole plan (`planOrder`). Those chain edges all point forward in that order, so they can close no cycle, and the tasks\n * still never run beside each other on their shared file (review of dc5dece9a: reverting the module to the plan as\n * written left them unordered). It terminates (each round chains at least one module more) and its worst case is every\n * module chained, which is acyclic whenever the plan is.\n *\n * Every cycle is looked at, not the first one found (review of dc5dece9a): a cycle of the plan's own, among tasks the\n * grouping did not touch, is the validator's to refuse with the model's refs, and must not hide a cycle the grouping made\n * elsewhere in the same plan.\n */\n const order = planOrder(graph);\n const original = new Map(graph.tasks.map((task) => [task.taskRef, task] as const));\n const chained = new Set<string>();\n for (;;) {\n const grouped = groupRelationshipTasksExcept(graph, chained, order, sealedTaskRefs);\n const byRef = new Map(grouped.tasks.map((task) => [task.taskRef, task] as const));\n const modulesOnCycles = new Set(prerequisiteCycles(grouped).flat().flatMap((taskRef) => {\n const task = byRef.get(taskRef);\n return task !== undefined && task.target.kind === BuildPlanTaskTargetKind.RELATIONSHIP && !chained.has(task.target.moduleRef)\n // A node the grouping made: a merged run, or a task that gained a chain edge or a remapped prerequisite.\n && (task.target.relationshipRefs.length > 1 || JSON.stringify(task.prerequisiteTaskRefs) !== JSON.stringify(original.get(taskRef)?.prerequisiteTaskRefs))\n ? [task.target.moduleRef] : [];\n }));\n if (modulesOnCycles.size === 0) return grouped;\n for (const moduleRef of modulesOnCycles) chained.add(moduleRef);\n }\n}\n\n/**\n * Every prerequisite cycle of the graph, as the task refs of each strongly connected component that holds one (Tarjan's\n * algorithm, iterative, in plan order so the answer is deterministic). Empty when the graph is acyclic.\n */\nfunction prerequisiteCycles(graph: BuildPlanTaskGraph): readonly (readonly string[])[] {\n const byRef = new Map(graph.tasks.map((task) => [task.taskRef, task] as const));\n const prerequisitesOf = (taskRef: string): readonly string[] => (byRef.get(taskRef)?.prerequisiteTaskRefs ?? []).filter((ref) => byRef.has(ref));\n const index = new Map<string, number>();\n const lowLink = new Map<string, number>();\n const onStack = new Set<string>();\n const stack: string[] = [];\n const cycles: string[][] = [];\n let next = 0;\n for (const root of graph.tasks) {\n if (index.has(root.taskRef)) continue;\n const walk: { readonly taskRef: string; edge: number }[] = [{ taskRef: root.taskRef, edge: 0 }];\n index.set(root.taskRef, next);\n lowLink.set(root.taskRef, next);\n next += 1;\n stack.push(root.taskRef);\n onStack.add(root.taskRef);\n while (walk.length > 0) {\n const frame = walk.at(-1)!;\n const prerequisites = prerequisitesOf(frame.taskRef);\n if (frame.edge < prerequisites.length) {\n const prerequisite = prerequisites[frame.edge]!;\n frame.edge += 1;\n if (!index.has(prerequisite)) {\n index.set(prerequisite, next);\n lowLink.set(prerequisite, next);\n next += 1;\n stack.push(prerequisite);\n onStack.add(prerequisite);\n walk.push({ taskRef: prerequisite, edge: 0 });\n } else if (onStack.has(prerequisite)) {\n lowLink.set(frame.taskRef, Math.min(lowLink.get(frame.taskRef)!, index.get(prerequisite)!));\n }\n continue;\n }\n walk.pop();\n const parent = walk.at(-1);\n if (parent !== undefined) lowLink.set(parent.taskRef, Math.min(lowLink.get(parent.taskRef)!, lowLink.get(frame.taskRef)!));\n if (lowLink.get(frame.taskRef) !== index.get(frame.taskRef)) continue;\n const component: string[] = [];\n for (;;) {\n const member = stack.pop()!;\n onStack.delete(member);\n component.push(member);\n if (member === frame.taskRef) break;\n }\n if (component.length > 1 || prerequisitesOf(frame.taskRef).includes(frame.taskRef)) cycles.push(component);\n }\n }\n return cycles;\n}\n\n/**\n * One order of the whole plan in which every task comes after the tasks it waits on, ties kept in plan order (a stable\n * topological order). Where the plan has a cycle of its own, the earliest unplaced task in plan order breaks it.\n */\nfunction planOrder(graph: BuildPlanTaskGraph): ReadonlyMap<string, number> {\n const known = new Set(graph.tasks.map((task) => task.taskRef));\n const placed = new Map<string, number>();\n const remaining = [...graph.tasks];\n while (remaining.length > 0) {\n const ready = remaining.findIndex((task) => task.prerequisiteTaskRefs.every((ref) => !known.has(ref) || placed.has(ref)));\n const [task] = remaining.splice(ready === -1 ? 0 : ready, 1);\n placed.set(task!.taskRef, placed.size);\n }\n return placed;\n}\n\n/**\n * {@link groupRelationshipTasksByModule} for every module but `chained`, whose tasks are kept as written and each made to\n * wait on the one before it in `order` (unless it already does, through any path).\n */\nfunction groupRelationshipTasksExcept(\n graph: BuildPlanTaskGraph,\n chained: ReadonlySet<string>,\n order: ReadonlyMap<string, number>,\n sealedTaskRefs: ReadonlySet<string>,\n): BuildPlanTaskGraph {\n const relationshipTasksByModule = new Map<string, BuildPlanTask[]>();\n const chainedTasksByModule = new Map<string, BuildPlanTask[]>();\n for (const task of graph.tasks) {\n if (task.target.kind !== BuildPlanTaskTargetKind.RELATIONSHIP) continue;\n const byModule = chained.has(task.target.moduleRef) ? chainedTasksByModule : relationshipTasksByModule;\n byModule.set(task.target.moduleRef, [...(byModule.get(task.target.moduleRef) ?? []), task]);\n }\n /*\n * Cut each module's tasks into runs by EDGE count, never by task count: a task the model already grouped carries\n * several edges, and a task carrying more than the bound is kept whole (splitting a task the model authored would\n * invent a ref and a division of its products nobody decided).\n *\n * In DEPENDENCY order, and never across a dependency (review of d47fd23ac): a module's tasks are first ordered so a\n * task comes after every task of the module it waits on, through any path in the graph, and a task that waits on a\n * member of the run being filled starts the next run. Cut in plan order, a relationship task waiting on a LATER one\n * (an e2 waiting on e8) put e8's run after e2's and chained them the other way: a prerequisite cycle the plan never had,\n * refused as a hard floor with a message about refs the model never wrote. With both rules a run of one module never\n * depends on a later run of it; a cycle through ANOTHER module is the caller's check (see above).\n */\n const closureOf = transitivePrerequisites(graph);\n const runs: BuildPlanTask[][] = [];\n for (const tasks of relationshipTasksByModule.values()) {\n let current: BuildPlanTask[] = [];\n let edges = 0;\n let currentIsSealed = false;\n /*\n * Built tasks first (#3204 review R2): the order is kept wherever no dependency decides it, so a built task is cut\n * into the module's first runs and a new edge chains AFTER it. Ordered as written, a new edge listed before a built\n * task made the built task wait on an unbuilt run, which no rearm of the built task could then get past.\n */\n const builtFirst = [...tasks.filter((task) => sealedTaskRefs.has(task.taskRef)), ...tasks.filter((task) => !sealedTaskRefs.has(task.taskRef))];\n for (const task of dependencyOrdered(builtFirst, closureOf)) {\n const taskEdges = task.target.kind === BuildPlanTaskTargetKind.RELATIONSHIP ? task.target.relationshipRefs.length : 0;\n const waitsOnCurrent = current.some((member) => closureOf(task.taskRef).has(member.taskRef));\n // A built task (#3204) neither joins a run nor lets another task join its own: it is always a run alone.\n const sealed = sealedTaskRefs.has(task.taskRef);\n if (current.length > 0 && (sealed || currentIsSealed || waitsOnCurrent || edges + taskEdges > MAXIMUM_RELATIONSHIP_EDGES_PER_TASK)) {\n runs.push(current);\n current = [];\n edges = 0;\n }\n current.push(task);\n edges += taskEdges;\n currentIsSealed = sealed;\n }\n if (current.length > 0) runs.push(current);\n }\n const chainedAfter = new Map<string, string>();\n for (const tasks of chainedTasksByModule.values()) {\n const ordered = [...tasks].sort((left, right) => order.get(left.taskRef)! - order.get(right.taskRef)!);\n for (let position = 1; position < ordered.length; position += 1) {\n const task = ordered[position]!;\n const previous = ordered[position - 1]!;\n if (!closureOf(task.taskRef).has(previous.taskRef)) chainedAfter.set(task.taskRef, previous.taskRef);\n }\n }\n if (runs.every((run) => run.length === 1) && !hasUnchainedRuns(runs) && chainedAfter.size === 0) return graph;\n\n const absorbedBy = new Map<string, string>();\n for (const run of runs) for (const task of run) absorbedBy.set(task.taskRef, run[0]!.taskRef);\n const remap = (taskRef: string): string => absorbedBy.get(taskRef) ?? taskRef;\n const unique = <T>(values: readonly T[]): T[] => [...new Set(values)];\n\n const mergedByHead = new Map<string, BuildPlanTask>();\n const runsByModule = new Map<string, string[]>();\n for (const run of runs) {\n const head = run[0]!;\n const moduleRef = head.target.kind === BuildPlanTaskTargetKind.RELATIONSHIP ? head.target.moduleRef : '';\n const previousRun = runsByModule.get(moduleRef)?.at(-1);\n runsByModule.set(moduleRef, [...(runsByModule.get(moduleRef) ?? []), head.taskRef]);\n const memberRefs = new Set(run.map((task) => task.taskRef));\n mergedByHead.set(head.taskRef, {\n ...head,\n objective: run.length === 1 ? head.objective : run.map((task) => task.objective).join(' '),\n target: {\n kind: BuildPlanTaskTargetKind.RELATIONSHIP,\n moduleRef,\n relationshipRefs: unique(run.flatMap((task) => (task.target.kind === BuildPlanTaskTargetKind.RELATIONSHIP ? task.target.relationshipRefs : []))),\n },\n produces: run.flatMap((task) => task.produces),\n skillRefs: unique(run.flatMap((task) => task.skillRefs)),\n prerequisiteTaskRefs: unique([\n ...(previousRun === undefined ? [] : [previousRun]),\n ...run.flatMap((task) => task.prerequisiteTaskRefs).filter((ref) => !memberRefs.has(ref)).map(remap),\n ]).filter((ref) => ref !== head.taskRef),\n servesRefs: unique(run.flatMap((task) => task.servesRefs)),\n });\n }\n\n const tasks: BuildPlanTask[] = [];\n for (const task of graph.tasks) {\n const merged = mergedByHead.get(task.taskRef);\n if (merged !== undefined) {\n tasks.push(merged);\n continue;\n }\n if (absorbedBy.has(task.taskRef)) continue;\n const after = chainedAfter.get(task.taskRef);\n tasks.push({ ...task, prerequisiteTaskRefs: unique([...task.prerequisiteTaskRefs.map(remap), ...(after === undefined ? [] : [after])]) });\n }\n return { ...graph, tasks };\n}\n\n/** Every task each task waits on, through any path of declared prerequisites; memoized and cycle-safe. */\nfunction transitivePrerequisites(graph: BuildPlanTaskGraph): (taskRef: string) => ReadonlySet<string> {\n const byRef = new Map(graph.tasks.map((task) => [task.taskRef, task] as const));\n const memo = new Map<string, Set<string>>();\n return (taskRef) => {\n const known = memo.get(taskRef);\n if (known !== undefined) return known;\n const reached = new Set<string>();\n memo.set(taskRef, reached);\n const stack = [...(byRef.get(taskRef)?.prerequisiteTaskRefs ?? [])];\n while (stack.length > 0) {\n const next = stack.pop()!;\n if (reached.has(next)) continue;\n reached.add(next);\n stack.push(...(byRef.get(next)?.prerequisiteTaskRefs ?? []));\n }\n return reached;\n };\n}\n\n/**\n * One module's tasks with every task after the tasks of the module it waits on, otherwise in plan order (a stable\n * topological order). A cycle among them, which the validator refuses anyway, leaves the rest in plan order.\n */\nfunction dependencyOrdered(tasks: readonly BuildPlanTask[], closureOf: (taskRef: string) => ReadonlySet<string>): BuildPlanTask[] {\n const ordered: BuildPlanTask[] = [];\n const remaining = [...tasks];\n while (remaining.length > 0) {\n const index = remaining.findIndex((task) => remaining.every((other) => other === task || !closureOf(task.taskRef).has(other.taskRef)));\n const [next] = remaining.splice(index === -1 ? 0 : index, 1);\n ordered.push(next!);\n }\n return ordered;\n}\n\n/** True when two runs of one module are both present and the later does not yet wait on the earlier. */\nfunction hasUnchainedRuns(runs: readonly BuildPlanTask[][]): boolean {\n const previousByModule = new Map<string, string>();\n for (const run of runs) {\n const head = run[0]!;\n if (head.target.kind !== BuildPlanTaskTargetKind.RELATIONSHIP) continue;\n const previous = previousByModule.get(head.target.moduleRef);\n if (previous !== undefined && !head.prerequisiteTaskRefs.includes(previous)) return true;\n previousByModule.set(head.target.moduleRef, head.taskRef);\n }\n return false;\n}\n\n/** The domain-plan relationships a task wires, by its target. Empty for any other target kind. */\nexport function buildPlanTaskRelationshipRefs(task: BuildPlanTask): readonly string[] {\n return task.target.kind === BuildPlanTaskTargetKind.RELATIONSHIP ? task.target.relationshipRefs : [];\n}\n\n/** The `RESOURCE_RELATIONSHIP` products of a task, by relationship ref. */\nexport function buildPlanTaskRelationshipProductRefs(task: BuildPlanTask): readonly string[] {\n return task.produces.flatMap((product) => (product.kind === BuildPlanTaskProductKind.RESOURCE_RELATIONSHIP ? [product.relationshipRef] : []));\n}\n"]}
|
|
1
|
+
{"version":3,"file":"build-plan-relationship-grouping.js","sourceRoot":"","sources":["../../../../src/_core/build-plan/build-plan-relationship-grouping.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,wBAAwB,EAAE,uBAAuB,EAA+C,MAAM,iCAAiC,CAAC;AAEjJ;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,mCAAmC,GAAG,CAAC,CAAC;AAErD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AACH,MAAM,UAAU,8BAA8B,CAAC,KAAyB,EAAE,iBAAsC,IAAI,GAAG,EAAE;IACvH;;;;;;;;;;;;;OAaG;IACH,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;IAC/B,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAU,CAAC,CAAC,CAAC;IACnF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,SAAS,CAAC;QACR,MAAM,OAAO,GAAG,4BAA4B,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC;QACpF,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAU,CAAC,CAAC,CAAC;QAClF,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;YACrF,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAChC,OAAO,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,uBAAuB,CAAC,YAAY,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC;gBAC3H,yGAAyG;mBACtG,CAAC,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,oBAAoB,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,oBAAoB,CAAC,CAAC;gBACzJ,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACnC,CAAC,CAAC,CAAC,CAAC;QACJ,IAAI,eAAe,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO,OAAO,CAAC;QAC/C,KAAK,MAAM,SAAS,IAAI,eAAe;YAAE,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAClE,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,kBAAkB,CAAC,KAAyB;IACnD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAU,CAAC,CAAC,CAAC;IAChF,MAAM,eAAe,GAAG,CAAC,OAAe,EAAqB,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,oBAAoB,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACjJ,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC;YAAE,SAAS;QACtC,MAAM,IAAI,GAAiD,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;QAChG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAC9B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAChC,IAAI,IAAI,CAAC,CAAC;QACV,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACzB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC1B,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC;YAC3B,MAAM,aAAa,GAAG,eAAe,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YACrD,IAAI,KAAK,CAAC,IAAI,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC;gBACtC,MAAM,YAAY,GAAG,aAAa,CAAC,KAAK,CAAC,IAAI,CAAE,CAAC;gBAChD,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC;gBAChB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,CAAC;oBAC7B,KAAK,CAAC,GAAG,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;oBAC9B,OAAO,CAAC,GAAG,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;oBAChC,IAAI,IAAI,CAAC,CAAC;oBACV,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;oBACzB,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;oBAC1B,IAAI,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,YAAY,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;gBAChD,CAAC;qBAAM,IAAI,OAAO,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,CAAC;oBACrC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAE,EAAE,KAAK,CAAC,GAAG,CAAC,YAAY,CAAE,CAAC,CAAC,CAAC;gBAC9F,CAAC;gBACD,SAAS;YACX,CAAC;YACD,IAAI,CAAC,GAAG,EAAE,CAAC;YACX,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3B,IAAI,MAAM,KAAK,SAAS;gBAAE,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAE,EAAE,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAE,CAAC,CAAC,CAAC;YAC3H,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC;gBAAE,SAAS;YACtE,MAAM,SAAS,GAAa,EAAE,CAAC;YAC/B,SAAS,CAAC;gBACR,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;gBAC5B,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBACvB,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACvB,IAAI,MAAM,KAAK,KAAK,CAAC,OAAO;oBAAE,MAAM;YACtC,CAAC;YACD,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,eAAe,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC;gBAAE,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC7G,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,SAAS,SAAS,CAAC,KAAyB;IAC1C,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;IAC/D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,MAAM,SAAS,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;IACnC,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC1H,MAAM,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC7D,MAAM,CAAC,GAAG,CAAC,IAAK,CAAC,OAAO,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,SAAS,4BAA4B,CACnC,KAAyB,EACzB,OAA4B,EAC5B,KAAkC,EAClC,cAAmC;IAEnC,MAAM,yBAAyB,GAAG,IAAI,GAAG,EAA2B,CAAC;IACrE,MAAM,oBAAoB,GAAG,IAAI,GAAG,EAA2B,CAAC;IAChE,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,uBAAuB,CAAC,YAAY;YAAE,SAAS;QACxE,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,yBAAyB,CAAC;QACvG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;IAC9F,CAAC;IACD;;;;;;;;;;;OAWG;IACH,MAAM,SAAS,GAAG,uBAAuB,CAAC,KAAK,CAAC,CAAC;IACjD,MAAM,IAAI,GAAsB,EAAE,CAAC;IACnC,KAAK,MAAM,KAAK,IAAI,yBAAyB,CAAC,MAAM,EAAE,EAAE,CAAC;QACvD,IAAI,OAAO,GAAoB,EAAE,CAAC;QAClC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,eAAe,GAAG,KAAK,CAAC;QAC5B;;;;WAIG;QACH,MAAM,UAAU,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC/I,KAAK,MAAM,IAAI,IAAI,iBAAiB,CAAC,UAAU,EAAE,SAAS,CAAC,EAAE,CAAC;YAC5D,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,uBAAuB,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACtH,MAAM,cAAc,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;YAC7F,yGAAyG;YACzG,MAAM,MAAM,GAAG,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAChD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,MAAM,IAAI,eAAe,IAAI,cAAc,IAAI,KAAK,GAAG,SAAS,GAAG,mCAAmC,CAAC,EAAE,CAAC;gBACnI,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACnB,OAAO,GAAG,EAAE,CAAC;gBACb,KAAK,GAAG,CAAC,CAAC;YACZ,CAAC;YACD,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,KAAK,IAAI,SAAS,CAAC;YACnB,eAAe,GAAG,MAAM,CAAC;QAC3B,CAAC;QACD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC7C,CAAC;IACD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC/C,KAAK,MAAM,KAAK,IAAI,oBAAoB,CAAC,MAAM,EAAE,EAAE,CAAC;QAClD,MAAM,OAAO,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAE,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAE,CAAC,CAAC;QACvG,KAAK,IAAI,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,OAAO,CAAC,MAAM,EAAE,QAAQ,IAAI,CAAC,EAAE,CAAC;YAChE,MAAM,IAAI,GAAG,OAAO,CAAC,QAAQ,CAAE,CAAC;YAChC,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,GAAG,CAAC,CAAE,CAAC;YACxC,mHAAmH;YACnH,2CAA2C;YAC3C,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,OAAO,CAAC;gBAAE,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,OAAO,CAAC,CAAC;QAC5I,CAAC;IACH,CAAC;IACD,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,KAAK,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAE9G,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC7C,KAAK,MAAM,GAAG,IAAI,IAAI;QAAE,KAAK,MAAM,IAAI,IAAI,GAAG;YAAE,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAE,CAAC,OAAO,CAAC,CAAC;IAC9F,MAAM,KAAK,GAAG,CAAC,OAAe,EAAU,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,OAAO,CAAC;IAC9E,MAAM,MAAM,GAAG,CAAI,MAAoB,EAAO,EAAE,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;IAEtE,MAAM,YAAY,GAAG,IAAI,GAAG,EAAyB,CAAC;IACtD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAoB,CAAC;IACjD,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAE,CAAC;QACrB,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,uBAAuB,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;QACzG,MAAM,WAAW,GAAG,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACxD,YAAY,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;QACpF,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5D,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE;YAC7B,GAAG,IAAI;YACP,SAAS,EAAE,GAAG,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;YAC1F,MAAM,EAAE;gBACN,IAAI,EAAE,uBAAuB,CAAC,YAAY;gBAC1C,SAAS;gBACT,gBAAgB,EAAE,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,uBAAuB,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;aACjJ;YACD,QAAQ,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC;YAC9C,SAAS,EAAE,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACxD,oBAAoB,EAAE,MAAM,CAAC;gBAC3B,uGAAuG;gBACvG,GAAG,CAAC,WAAW,KAAK,SAAS,IAAI,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;gBACvF,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC;aACrG,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,KAAK,IAAI,CAAC,OAAO,CAAC;YACxC,UAAU,EAAE,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;SAC3D,CAAC,CAAC;IACL,CAAC;IAED,MAAM,KAAK,GAAoB,EAAE,CAAC;IAClC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC9C,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACnB,SAAS;QACX,CAAC;QACD,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC;YAAE,SAAS;QAC3C,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC7C,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,EAAE,oBAAoB,EAAE,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC5I,CAAC;IACD,OAAO,EAAE,GAAG,KAAK,EAAE,KAAK,EAAE,CAAC;AAC7B,CAAC;AAED,0GAA0G;AAC1G,SAAS,uBAAuB,CAAC,KAAyB;IACxD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAU,CAAC,CAAC,CAAC;IAChF,MAAM,IAAI,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC5C,OAAO,CAAC,OAAO,EAAE,EAAE;QACjB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAChC,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QACtC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAC3B,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,oBAAoB,IAAI,EAAE,CAAC,CAAC,CAAC;QACpE,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;YAC1B,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,SAAS;YAChC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,oBAAoB,IAAI,EAAE,CAAC,CAAC,CAAC;QAC/D,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAS,iBAAiB,CAAC,KAA+B,EAAE,SAAmD;IAC7G,MAAM,OAAO,GAAoB,EAAE,CAAC;IACpC,MAAM,SAAS,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;IAC7B,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC5B,MAAM,KAAK,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,KAAK,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACvI,MAAM,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC7D,OAAO,CAAC,IAAI,CAAC,IAAK,CAAC,CAAC;IACtB,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,wGAAwG;AACxG,SAAS,gBAAgB,CAAC,IAAgC;IACxD,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAkB,CAAC;IACnD,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAE,CAAC;QACrB,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,uBAAuB,CAAC,YAAY;YAAE,SAAS;QACxE,MAAM,QAAQ,GAAG,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QAC7D,IAAI,QAAQ,KAAK,SAAS,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,QAAQ,CAAC,QAAQ,CAAC;YAAE,OAAO,IAAI,CAAC;QACzF,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IAC5D,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,kGAAkG;AAClG,MAAM,UAAU,6BAA6B,CAAC,IAAmB;IAC/D,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,uBAAuB,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC;AACvG,CAAC;AAED,2EAA2E;AAC3E,MAAM,UAAU,oCAAoC,CAAC,IAAmB;IACtE,OAAO,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,IAAI,KAAK,wBAAwB,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAChJ,CAAC","sourcesContent":["import { BuildPlanTaskProductKind, BuildPlanTaskTargetKind, type BuildPlanTask, type BuildPlanTaskGraph } from './build-plan-task-graph.schemas';\n\n/**\n * The most edges one relationship task wires (#3209).\n *\n * A module's edges are one task because they are one FILE; but a task is one coding run, and a run has a\n * time budget (30 minutes by default). Each edge is a `createResourcesRelationship(...)` call plus the holder's\n * ui-behavior and both resources' specifications (#2503), measured on app-creation-test-007 at a few minutes of\n * editing each, with the worker's start and the four checks paid once per run on top. Six edges fit a run with\n * room to spare; the 23 edges of 007's `building-lifecycle` module become four chained runs instead of 23.\n */\nexport const MAXIMUM_RELATIONSHIP_EDGES_PER_TASK = 6;\n\n/**\n * One relationship task per module relationships FILE, chained when a module holds more edges than one run\n * wires (#3209). A pure normalization of a generated plan, applied by the trusted runtime\n * (`parseBuildPlanTaskGraphGeneration`) rather than asked of the model.\n *\n * ## Why the runtime does it instead of the method\n *\n * The decomposer's method says to group edges per module, and a method instruction is a prompt, not a gate:\n * this whole directory is the record of rules that existed in prose and were enforced nowhere. Grouping is a\n * FUNCTION of the plan — which edges share a file is the target's `moduleRef` — so it is derived here, and a\n * model that emits one task per edge still lands a grouped plan. A plan that is already grouped comes back\n * unchanged, so a refining decompose that reuses its prior refs is stable.\n *\n * ## What one group becomes\n *\n * - The edges of one module, in plan order, cut into runs of at most {@link MAXIMUM_RELATIONSHIP_EDGES_PER_TASK}.\n * - Each run is ONE task: its target names every edge it wires (`relationshipRefs`), its products are the union\n * of the merged tasks' products, its prerequisites, skills and `servesRefs` the union of theirs (minus refs to\n * tasks merged into it), its objective each merged objective in order.\n * - Runs of one module are CHAINED: run `k + 1` waits on run `k`. They write one file, and two runs editing one\n * file concurrently is exactly the interference that made the wave re-run each task alone.\n * - Its ref is the first merged task's ref (in dependency order), so a single-edge module keeps its ref. Every edge\n * naming a merged task is rewritten to the run that absorbed it.\n *\n * A task whose target is not `RELATIONSHIP` is untouched. Tasks keep their plan order: a run sits where its first\n * merged task sat.\n *\n * ## A built task is a run of its own (#3204)\n *\n * `sealedTaskRefs` names the tasks already built (landed). Each is a run alone: nothing is merged into it and it is never\n * merged into another, so its ref, target and products stay what they were built as. A new edge of the same module becomes\n * its own run, chained after (or before) the built one like any other run of the module. Without this, a re-decompose that\n * kept a built relationship task exactly and added a new edge beside it had the new edge folded into the built task, which\n * then read as changed (or, the new task first in order, absorbed it and dropped its ref) and was refused for it.\n */\nexport function groupRelationshipTasksByModule(graph: BuildPlanTaskGraph, sealedTaskRefs: ReadonlySet<string> = new Set()): BuildPlanTaskGraph {\n /*\n * Grouping must never make a plan cyclic, and within one module the cut below already guarantees it. ACROSS modules it\n * cannot (review of f077ae7db): merging unions the members' prerequisites, so `a2 → b1` and `b2 → a1` — a valid plan —\n * become `run(a) → run(b) → run(a)`. So the grouped plan is checked, and every module with a node the grouping made on a\n * cycle is CHAINED instead of merged: its tasks stay as written and each waits on the one before it in one order of the\n * whole plan (`planOrder`). Those chain edges all point forward in that order, so they can close no cycle, and the tasks\n * still never run beside each other on their shared file (review of dc5dece9a: reverting the module to the plan as\n * written left them unordered). It terminates (each round chains at least one module more) and its worst case is every\n * module chained, which is acyclic whenever the plan is.\n *\n * Every cycle is looked at, not the first one found (review of dc5dece9a): a cycle of the plan's own, among tasks the\n * grouping did not touch, is the validator's to refuse with the model's refs, and must not hide a cycle the grouping made\n * elsewhere in the same plan.\n */\n const order = planOrder(graph);\n const original = new Map(graph.tasks.map((task) => [task.taskRef, task] as const));\n const chained = new Set<string>();\n for (;;) {\n const grouped = groupRelationshipTasksExcept(graph, chained, order, sealedTaskRefs);\n const byRef = new Map(grouped.tasks.map((task) => [task.taskRef, task] as const));\n const modulesOnCycles = new Set(prerequisiteCycles(grouped).flat().flatMap((taskRef) => {\n const task = byRef.get(taskRef);\n return task !== undefined && task.target.kind === BuildPlanTaskTargetKind.RELATIONSHIP && !chained.has(task.target.moduleRef)\n // A node the grouping made: a merged run, or a task that gained a chain edge or a remapped prerequisite.\n && (task.target.relationshipRefs.length > 1 || JSON.stringify(task.prerequisiteTaskRefs) !== JSON.stringify(original.get(taskRef)?.prerequisiteTaskRefs))\n ? [task.target.moduleRef] : [];\n }));\n if (modulesOnCycles.size === 0) return grouped;\n for (const moduleRef of modulesOnCycles) chained.add(moduleRef);\n }\n}\n\n/**\n * Every prerequisite cycle of the graph, as the task refs of each strongly connected component that holds one (Tarjan's\n * algorithm, iterative, in plan order so the answer is deterministic). Empty when the graph is acyclic.\n */\nfunction prerequisiteCycles(graph: BuildPlanTaskGraph): readonly (readonly string[])[] {\n const byRef = new Map(graph.tasks.map((task) => [task.taskRef, task] as const));\n const prerequisitesOf = (taskRef: string): readonly string[] => (byRef.get(taskRef)?.prerequisiteTaskRefs ?? []).filter((ref) => byRef.has(ref));\n const index = new Map<string, number>();\n const lowLink = new Map<string, number>();\n const onStack = new Set<string>();\n const stack: string[] = [];\n const cycles: string[][] = [];\n let next = 0;\n for (const root of graph.tasks) {\n if (index.has(root.taskRef)) continue;\n const walk: { readonly taskRef: string; edge: number }[] = [{ taskRef: root.taskRef, edge: 0 }];\n index.set(root.taskRef, next);\n lowLink.set(root.taskRef, next);\n next += 1;\n stack.push(root.taskRef);\n onStack.add(root.taskRef);\n while (walk.length > 0) {\n const frame = walk.at(-1)!;\n const prerequisites = prerequisitesOf(frame.taskRef);\n if (frame.edge < prerequisites.length) {\n const prerequisite = prerequisites[frame.edge]!;\n frame.edge += 1;\n if (!index.has(prerequisite)) {\n index.set(prerequisite, next);\n lowLink.set(prerequisite, next);\n next += 1;\n stack.push(prerequisite);\n onStack.add(prerequisite);\n walk.push({ taskRef: prerequisite, edge: 0 });\n } else if (onStack.has(prerequisite)) {\n lowLink.set(frame.taskRef, Math.min(lowLink.get(frame.taskRef)!, index.get(prerequisite)!));\n }\n continue;\n }\n walk.pop();\n const parent = walk.at(-1);\n if (parent !== undefined) lowLink.set(parent.taskRef, Math.min(lowLink.get(parent.taskRef)!, lowLink.get(frame.taskRef)!));\n if (lowLink.get(frame.taskRef) !== index.get(frame.taskRef)) continue;\n const component: string[] = [];\n for (;;) {\n const member = stack.pop()!;\n onStack.delete(member);\n component.push(member);\n if (member === frame.taskRef) break;\n }\n if (component.length > 1 || prerequisitesOf(frame.taskRef).includes(frame.taskRef)) cycles.push(component);\n }\n }\n return cycles;\n}\n\n/**\n * One order of the whole plan in which every task comes after the tasks it waits on, ties kept in plan order (a stable\n * topological order). Where the plan has a cycle of its own, the earliest unplaced task in plan order breaks it.\n */\nfunction planOrder(graph: BuildPlanTaskGraph): ReadonlyMap<string, number> {\n const known = new Set(graph.tasks.map((task) => task.taskRef));\n const placed = new Map<string, number>();\n const remaining = [...graph.tasks];\n while (remaining.length > 0) {\n const ready = remaining.findIndex((task) => task.prerequisiteTaskRefs.every((ref) => !known.has(ref) || placed.has(ref)));\n const [task] = remaining.splice(ready === -1 ? 0 : ready, 1);\n placed.set(task!.taskRef, placed.size);\n }\n return placed;\n}\n\n/**\n * {@link groupRelationshipTasksByModule} for every module but `chained`, whose tasks are kept as written and each made to\n * wait on the one before it in `order` (unless it already does, through any path).\n */\nfunction groupRelationshipTasksExcept(\n graph: BuildPlanTaskGraph,\n chained: ReadonlySet<string>,\n order: ReadonlyMap<string, number>,\n sealedTaskRefs: ReadonlySet<string>,\n): BuildPlanTaskGraph {\n const relationshipTasksByModule = new Map<string, BuildPlanTask[]>();\n const chainedTasksByModule = new Map<string, BuildPlanTask[]>();\n for (const task of graph.tasks) {\n if (task.target.kind !== BuildPlanTaskTargetKind.RELATIONSHIP) continue;\n const byModule = chained.has(task.target.moduleRef) ? chainedTasksByModule : relationshipTasksByModule;\n byModule.set(task.target.moduleRef, [...(byModule.get(task.target.moduleRef) ?? []), task]);\n }\n /*\n * Cut each module's tasks into runs by EDGE count, never by task count: a task the model already grouped carries\n * several edges, and a task carrying more than the bound is kept whole (splitting a task the model authored would\n * invent a ref and a division of its products nobody decided).\n *\n * In DEPENDENCY order, and never across a dependency (review of d47fd23ac): a module's tasks are first ordered so a\n * task comes after every task of the module it waits on, through any path in the graph, and a task that waits on a\n * member of the run being filled starts the next run. Cut in plan order, a relationship task waiting on a LATER one\n * (an e2 waiting on e8) put e8's run after e2's and chained them the other way: a prerequisite cycle the plan never had,\n * refused as a hard floor with a message about refs the model never wrote. With both rules a run of one module never\n * depends on a later run of it; a cycle through ANOTHER module is the caller's check (see above).\n */\n const closureOf = transitivePrerequisites(graph);\n const runs: BuildPlanTask[][] = [];\n for (const tasks of relationshipTasksByModule.values()) {\n let current: BuildPlanTask[] = [];\n let edges = 0;\n let currentIsSealed = false;\n /*\n * Built tasks first (#3204 review R2): the order is kept wherever no dependency decides it, so a built task is cut\n * into the module's first runs and a new edge chains AFTER it. Ordered as written, a new edge listed before a built\n * task made the built task wait on an unbuilt run, which no rearm of the built task could then get past.\n */\n const builtFirst = [...tasks.filter((task) => sealedTaskRefs.has(task.taskRef)), ...tasks.filter((task) => !sealedTaskRefs.has(task.taskRef))];\n for (const task of dependencyOrdered(builtFirst, closureOf)) {\n const taskEdges = task.target.kind === BuildPlanTaskTargetKind.RELATIONSHIP ? task.target.relationshipRefs.length : 0;\n const waitsOnCurrent = current.some((member) => closureOf(task.taskRef).has(member.taskRef));\n // A built task (#3204) neither joins a run nor lets another task join its own: it is always a run alone.\n const sealed = sealedTaskRefs.has(task.taskRef);\n if (current.length > 0 && (sealed || currentIsSealed || waitsOnCurrent || edges + taskEdges > MAXIMUM_RELATIONSHIP_EDGES_PER_TASK)) {\n runs.push(current);\n current = [];\n edges = 0;\n }\n current.push(task);\n edges += taskEdges;\n currentIsSealed = sealed;\n }\n if (current.length > 0) runs.push(current);\n }\n const chainedAfter = new Map<string, string>();\n for (const tasks of chainedTasksByModule.values()) {\n const ordered = [...tasks].sort((left, right) => order.get(left.taskRef)! - order.get(right.taskRef)!);\n for (let position = 1; position < ordered.length; position += 1) {\n const task = ordered[position]!;\n const previous = ordered[position - 1]!;\n // Never onto a sealed task (#3901): a built or landed task keeps the prerequisites it has, and its file is already\n // ordered by the edges it was landed with.\n if (!sealedTaskRefs.has(task.taskRef) && !closureOf(task.taskRef).has(previous.taskRef)) chainedAfter.set(task.taskRef, previous.taskRef);\n }\n }\n if (runs.every((run) => run.length === 1) && !hasUnchainedRuns(runs) && chainedAfter.size === 0) return graph;\n\n const absorbedBy = new Map<string, string>();\n for (const run of runs) for (const task of run) absorbedBy.set(task.taskRef, run[0]!.taskRef);\n const remap = (taskRef: string): string => absorbedBy.get(taskRef) ?? taskRef;\n const unique = <T>(values: readonly T[]): T[] => [...new Set(values)];\n\n const mergedByHead = new Map<string, BuildPlanTask>();\n const runsByModule = new Map<string, string[]>();\n for (const run of runs) {\n const head = run[0]!;\n const moduleRef = head.target.kind === BuildPlanTaskTargetKind.RELATIONSHIP ? head.target.moduleRef : '';\n const previousRun = runsByModule.get(moduleRef)?.at(-1);\n runsByModule.set(moduleRef, [...(runsByModule.get(moduleRef) ?? []), head.taskRef]);\n const memberRefs = new Set(run.map((task) => task.taskRef));\n mergedByHead.set(head.taskRef, {\n ...head,\n objective: run.length === 1 ? head.objective : run.map((task) => task.objective).join(' '),\n target: {\n kind: BuildPlanTaskTargetKind.RELATIONSHIP,\n moduleRef,\n relationshipRefs: unique(run.flatMap((task) => (task.target.kind === BuildPlanTaskTargetKind.RELATIONSHIP ? task.target.relationshipRefs : []))),\n },\n produces: run.flatMap((task) => task.produces),\n skillRefs: unique(run.flatMap((task) => task.skillRefs)),\n prerequisiteTaskRefs: unique([\n // A sealed run keeps its own prerequisites (#3901): a new run chains after it, never it after another.\n ...(previousRun === undefined || sealedTaskRefs.has(head.taskRef) ? [] : [previousRun]),\n ...run.flatMap((task) => task.prerequisiteTaskRefs).filter((ref) => !memberRefs.has(ref)).map(remap),\n ]).filter((ref) => ref !== head.taskRef),\n servesRefs: unique(run.flatMap((task) => task.servesRefs)),\n });\n }\n\n const tasks: BuildPlanTask[] = [];\n for (const task of graph.tasks) {\n const merged = mergedByHead.get(task.taskRef);\n if (merged !== undefined) {\n tasks.push(merged);\n continue;\n }\n if (absorbedBy.has(task.taskRef)) continue;\n const after = chainedAfter.get(task.taskRef);\n tasks.push({ ...task, prerequisiteTaskRefs: unique([...task.prerequisiteTaskRefs.map(remap), ...(after === undefined ? [] : [after])]) });\n }\n return { ...graph, tasks };\n}\n\n/** Every task each task waits on, through any path of declared prerequisites; memoized and cycle-safe. */\nfunction transitivePrerequisites(graph: BuildPlanTaskGraph): (taskRef: string) => ReadonlySet<string> {\n const byRef = new Map(graph.tasks.map((task) => [task.taskRef, task] as const));\n const memo = new Map<string, Set<string>>();\n return (taskRef) => {\n const known = memo.get(taskRef);\n if (known !== undefined) return known;\n const reached = new Set<string>();\n memo.set(taskRef, reached);\n const stack = [...(byRef.get(taskRef)?.prerequisiteTaskRefs ?? [])];\n while (stack.length > 0) {\n const next = stack.pop()!;\n if (reached.has(next)) continue;\n reached.add(next);\n stack.push(...(byRef.get(next)?.prerequisiteTaskRefs ?? []));\n }\n return reached;\n };\n}\n\n/**\n * One module's tasks with every task after the tasks of the module it waits on, otherwise in plan order (a stable\n * topological order). A cycle among them, which the validator refuses anyway, leaves the rest in plan order.\n */\nfunction dependencyOrdered(tasks: readonly BuildPlanTask[], closureOf: (taskRef: string) => ReadonlySet<string>): BuildPlanTask[] {\n const ordered: BuildPlanTask[] = [];\n const remaining = [...tasks];\n while (remaining.length > 0) {\n const index = remaining.findIndex((task) => remaining.every((other) => other === task || !closureOf(task.taskRef).has(other.taskRef)));\n const [next] = remaining.splice(index === -1 ? 0 : index, 1);\n ordered.push(next!);\n }\n return ordered;\n}\n\n/** True when two runs of one module are both present and the later does not yet wait on the earlier. */\nfunction hasUnchainedRuns(runs: readonly BuildPlanTask[][]): boolean {\n const previousByModule = new Map<string, string>();\n for (const run of runs) {\n const head = run[0]!;\n if (head.target.kind !== BuildPlanTaskTargetKind.RELATIONSHIP) continue;\n const previous = previousByModule.get(head.target.moduleRef);\n if (previous !== undefined && !head.prerequisiteTaskRefs.includes(previous)) return true;\n previousByModule.set(head.target.moduleRef, head.taskRef);\n }\n return false;\n}\n\n/** The domain-plan relationships a task wires, by its target. Empty for any other target kind. */\nexport function buildPlanTaskRelationshipRefs(task: BuildPlanTask): readonly string[] {\n return task.target.kind === BuildPlanTaskTargetKind.RELATIONSHIP ? task.target.relationshipRefs : [];\n}\n\n/** The `RESOURCE_RELATIONSHIP` products of a task, by relationship ref. */\nexport function buildPlanTaskRelationshipProductRefs(task: BuildPlanTask): readonly string[] {\n return task.produces.flatMap((product) => (product.kind === BuildPlanTaskProductKind.RESOURCE_RELATIONSHIP ? [product.relationshipRef] : []));\n}\n"]}
|
|
@@ -169,6 +169,8 @@ export declare const BuildPlanTaskGenerationSchema: z.ZodObject<{
|
|
|
169
169
|
eligibleRole: z.ZodOptional<z.ZodString>;
|
|
170
170
|
requiredQualificationKinds: z.ZodOptional<z.ZodArray<z.ZodString>>;
|
|
171
171
|
serviceMethodDecisionRef: z.ZodOptional<z.ZodString>;
|
|
172
|
+
deliverableFileArgument: z.ZodOptional<z.ZodString>;
|
|
173
|
+
electronicSignatureLevel: z.ZodOptional<z.ZodEnum<typeof import("@wildo-ai/external-connectors-models").ElectronicSignature_Level>>;
|
|
172
174
|
}, z.core.$strict>, z.ZodObject<{
|
|
173
175
|
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.WORK_UNIT_RESOURCE>;
|
|
174
176
|
resourceRef: z.ZodString;
|
|
@@ -403,6 +405,8 @@ export declare const BuildPlanTaskGraphGenerationSchema: z.ZodObject<{
|
|
|
403
405
|
eligibleRole: z.ZodOptional<z.ZodString>;
|
|
404
406
|
requiredQualificationKinds: z.ZodOptional<z.ZodArray<z.ZodString>>;
|
|
405
407
|
serviceMethodDecisionRef: z.ZodOptional<z.ZodString>;
|
|
408
|
+
deliverableFileArgument: z.ZodOptional<z.ZodString>;
|
|
409
|
+
electronicSignatureLevel: z.ZodOptional<z.ZodEnum<typeof import("@wildo-ai/external-connectors-models").ElectronicSignature_Level>>;
|
|
406
410
|
}, z.core.$strict>, z.ZodObject<{
|
|
407
411
|
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.WORK_UNIT_RESOURCE>;
|
|
408
412
|
resourceRef: z.ZodString;
|
|
@@ -462,6 +466,253 @@ export declare const BuildPlanTaskGraphGenerationSchema: z.ZodObject<{
|
|
|
462
466
|
}, z.core.$strict>>>;
|
|
463
467
|
}, z.core.$strict>;
|
|
464
468
|
export type BuildPlanTaskGraphGeneration = z.infer<typeof BuildPlanTaskGraphGenerationSchema>;
|
|
469
|
+
/**
|
|
470
|
+
* One SLICE of a build plan written in slices (#3901): the next tasks in dependency order, and whether they finish the plan.
|
|
471
|
+
*
|
|
472
|
+
* Why slices: a whole plan is one answer whose length grows with the application (measured on reference run 44381592258,
|
|
473
|
+
* 462 tasks and about 238,000 output tokens in one decomposition of about 27 minutes), and nothing could be dispatched
|
|
474
|
+
* until it landed. Written in slices, each closed under its prerequisites, the first slice lands within minutes and the
|
|
475
|
+
* build starts on it while the rest is written.
|
|
476
|
+
*
|
|
477
|
+
* A slice holds only NEW tasks. A prerequisite names a task already in the plan or one in this slice, which keeps every
|
|
478
|
+
* landed prefix dispatchable on its own; the generation run holds the landed tasks fixed, so a later slice can only add.
|
|
479
|
+
*
|
|
480
|
+
* Every field is required, so the strict form a provider decodes is this schema itself: `remaining` is what is still to be
|
|
481
|
+
* written when `complete` is false, and empty when it is true (the generation run refuses a false `complete` with nothing
|
|
482
|
+
* remaining, because a pending plan must say what it is waiting for).
|
|
483
|
+
*/
|
|
484
|
+
export declare const BuildPlanTaskGraphSliceGenerationSchema: z.ZodObject<{
|
|
485
|
+
tasks: z.ZodArray<z.ZodObject<{
|
|
486
|
+
slug: z.ZodString;
|
|
487
|
+
objective: z.ZodString;
|
|
488
|
+
target: z.ZodDiscriminatedUnion<[z.ZodObject<{
|
|
489
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskTargetKind.MODULE>;
|
|
490
|
+
moduleRef: z.ZodString;
|
|
491
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
492
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskTargetKind.RESOURCE_STAGE>;
|
|
493
|
+
moduleRef: z.ZodString;
|
|
494
|
+
resourceRef: z.ZodString;
|
|
495
|
+
stage: z.ZodEnum<typeof import("./build-plan-task-graph.schemas").BuildPlanResourceStage>;
|
|
496
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
497
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskTargetKind.RELATIONSHIP>;
|
|
498
|
+
moduleRef: z.ZodString;
|
|
499
|
+
relationshipRefs: z.ZodArray<z.ZodString>;
|
|
500
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
501
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskTargetKind.COMPANION_GENERATION_STEP>;
|
|
502
|
+
generationStepRef: z.ZodString;
|
|
503
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
504
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskTargetKind.SHELL_PLACEMENT>;
|
|
505
|
+
surface: z.ZodEnum<typeof import("..").PlacementSurface>;
|
|
506
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
507
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskTargetKind.MODULE_FRONTEND>;
|
|
508
|
+
moduleRef: z.ZodString;
|
|
509
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
510
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskTargetKind.MODULE_BACKEND>;
|
|
511
|
+
moduleRef: z.ZodString;
|
|
512
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
513
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskTargetKind.APPLICATION_FRONTEND_CONFIG>;
|
|
514
|
+
configSurface: z.ZodEnum<typeof import("./build-plan-task-graph.schemas").FrontendConfigSurface>;
|
|
515
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
516
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskTargetKind.WEBSITE>;
|
|
517
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
518
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskTargetKind.TECHNICAL_DOCUMENTATION>;
|
|
519
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
520
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskTargetKind.WORKER>;
|
|
521
|
+
workerRef: z.ZodString;
|
|
522
|
+
runtime: z.ZodEnum<typeof import("./build-plan-task-graph.schemas").BuildPlanWorkerRuntime>;
|
|
523
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
524
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskTargetKind.MINION>;
|
|
525
|
+
minionRef: z.ZodString;
|
|
526
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
527
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskTargetKind.PROVIDER_BINDING>;
|
|
528
|
+
providerRef: z.ZodString;
|
|
529
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
530
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskTargetKind.BILLING_CATALOG>;
|
|
531
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
532
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskTargetKind.APPLICATION_ROLES>;
|
|
533
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
534
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskTargetKind.ORGANIZATION_MODEL>;
|
|
535
|
+
}, z.core.$strict>], "kind">;
|
|
536
|
+
produces: z.ZodDefault<z.ZodArray<z.ZodDiscriminatedUnion<[z.ZodObject<{
|
|
537
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.RESOURCE_SCHEMA_FIELDS>;
|
|
538
|
+
resourceRef: z.ZodString;
|
|
539
|
+
fieldRefs: z.ZodArray<z.ZodString>;
|
|
540
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
541
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.RESOURCE_REGISTRATION>;
|
|
542
|
+
resourceRef: z.ZodString;
|
|
543
|
+
operationRefs: z.ZodArray<z.ZodString>;
|
|
544
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
545
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.RESOURCE_UI_BEHAVIOR>;
|
|
546
|
+
resourceRef: z.ZodString;
|
|
547
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
548
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.RESOURCE_SPECIFICATION>;
|
|
549
|
+
resourceRef: z.ZodString;
|
|
550
|
+
fieldRefs: z.ZodArray<z.ZodString>;
|
|
551
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
552
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.RESOURCE_RELATIONSHIP>;
|
|
553
|
+
relationshipRef: z.ZodString;
|
|
554
|
+
sourceResourceRef: z.ZodString;
|
|
555
|
+
targetResourceRef: z.ZodString;
|
|
556
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
557
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.RESOURCE_OPERATION>;
|
|
558
|
+
resourceRef: z.ZodString;
|
|
559
|
+
operationRef: z.ZodString;
|
|
560
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
561
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.APPLICATION_VIEW>;
|
|
562
|
+
viewRef: z.ZodString;
|
|
563
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
564
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.APPLICATION_DOCUMENT>;
|
|
565
|
+
documentRef: z.ZodUnion<readonly [z.ZodString, z.ZodString]>;
|
|
566
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
567
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.APPLICATION_MODULE>;
|
|
568
|
+
moduleRef: z.ZodString;
|
|
569
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
570
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.APPLICATION_FRONTEND_CONFIG>;
|
|
571
|
+
configSurface: z.ZodEnum<typeof import("./build-plan-task-graph.schemas").FrontendConfigSurface>;
|
|
572
|
+
declarationRefs: z.ZodArray<z.ZodString>;
|
|
573
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
574
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.RESOURCE_COMPOSITE_VIEW>;
|
|
575
|
+
resourceRef: z.ZodString;
|
|
576
|
+
viewRef: z.ZodString;
|
|
577
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
578
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.RESOURCE_CUSTOM_VIEW>;
|
|
579
|
+
resourceRef: z.ZodString;
|
|
580
|
+
viewRef: z.ZodString;
|
|
581
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
582
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.RESOURCE_CHART_VIEW>;
|
|
583
|
+
resourceRef: z.ZodString;
|
|
584
|
+
chartRef: z.ZodString;
|
|
585
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
586
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.CUSTOM_COMPONENT>;
|
|
587
|
+
componentRef: z.ZodString;
|
|
588
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
589
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.APPLICATION_MILESTONE>;
|
|
590
|
+
milestoneRef: z.ZodString;
|
|
591
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
592
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.APPLICATION_GUIDANCE>;
|
|
593
|
+
guidanceKind: z.ZodEnum<typeof import("./build-plan-task-graph.schemas").ApplicationGuidanceKind>;
|
|
594
|
+
guidanceRef: z.ZodString;
|
|
595
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
596
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.PDF_TEMPLATE>;
|
|
597
|
+
resourceRef: z.ZodString;
|
|
598
|
+
templateRef: z.ZodString;
|
|
599
|
+
serviceMethodDeliverableRef: z.ZodOptional<z.ZodString>;
|
|
600
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
601
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.APPLICATION_WORKER>;
|
|
602
|
+
workerRef: z.ZodString;
|
|
603
|
+
jobRefs: z.ZodArray<z.ZodString>;
|
|
604
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
605
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.APPLICATION_MINION>;
|
|
606
|
+
minionRef: z.ZodString;
|
|
607
|
+
behaviorRefs: z.ZodArray<z.ZodString>;
|
|
608
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
609
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.PROVIDER_BINDING>;
|
|
610
|
+
providerRef: z.ZodString;
|
|
611
|
+
scope: z.ZodEnum<typeof import("./build-plan-task-graph.schemas").ProviderBindingScope>;
|
|
612
|
+
augments: z.ZodOptional<z.ZodString>;
|
|
613
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
614
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.APPLICATION_BILLING_PRODUCT>;
|
|
615
|
+
productKey: z.ZodString;
|
|
616
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
617
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.APPLICATION_ROLE>;
|
|
618
|
+
roleRef: z.ZodString;
|
|
619
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
620
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.APPLICATION_DATA_SEED>;
|
|
621
|
+
seedKey: z.ZodString;
|
|
622
|
+
resourceRef: z.ZodString;
|
|
623
|
+
content: z.ZodEnum<typeof import("./build-plan-task-graph.schemas").BuildPlanDataSeedContent>;
|
|
624
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
625
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.WEBSITE_PAGE>;
|
|
626
|
+
pageRef: z.ZodString;
|
|
627
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
628
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.WEBSITE_SECTION>;
|
|
629
|
+
pageRef: z.ZodString;
|
|
630
|
+
sectionRef: z.ZodString;
|
|
631
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
632
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.DOCUMENTATION_CHAPTER>;
|
|
633
|
+
chapterRef: z.ZodString;
|
|
634
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
635
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.APPLICATION_AGENT>;
|
|
636
|
+
agentRef: z.ZodString;
|
|
637
|
+
shape: z.ZodEnum<typeof import("./build-plan-task-graph.schemas").BuildPlanAgentShape>;
|
|
638
|
+
serviceMethodStepRefs: z.ZodOptional<z.ZodArray<z.ZodString>>;
|
|
639
|
+
serviceMethodAskedDecisionRefs: z.ZodOptional<z.ZodArray<z.ZodString>>;
|
|
640
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
641
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.AGENT_APPROVAL_GATE>;
|
|
642
|
+
functionRef: z.ZodString;
|
|
643
|
+
route: z.ZodEnum<typeof import("@wildo-ai/saas-models").HumanDecision_RouteKind>;
|
|
644
|
+
eligibleRole: z.ZodOptional<z.ZodString>;
|
|
645
|
+
requiredQualificationKinds: z.ZodOptional<z.ZodArray<z.ZodString>>;
|
|
646
|
+
serviceMethodDecisionRef: z.ZodOptional<z.ZodString>;
|
|
647
|
+
deliverableFileArgument: z.ZodOptional<z.ZodString>;
|
|
648
|
+
electronicSignatureLevel: z.ZodOptional<z.ZodEnum<typeof import("@wildo-ai/external-connectors-models").ElectronicSignature_Level>>;
|
|
649
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
650
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.WORK_UNIT_RESOURCE>;
|
|
651
|
+
resourceRef: z.ZodString;
|
|
652
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
653
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.METERED_USAGE_RECORDING>;
|
|
654
|
+
resourceRef: z.ZodString;
|
|
655
|
+
operationRef: z.ZodString;
|
|
656
|
+
productKey: z.ZodString;
|
|
657
|
+
oncePerRecord: z.ZodBoolean;
|
|
658
|
+
serviceMethodServiceRef: z.ZodOptional<z.ZodString>;
|
|
659
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
660
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.RESOURCE_RETENTION_BINDING>;
|
|
661
|
+
resourceRef: z.ZodString;
|
|
662
|
+
retentionClass: z.ZodEnum<typeof import("@wildo-ai/saas-models").DataRetentionClass>;
|
|
663
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
664
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.RELATIONSHIP_CONFERRED_ROLE>;
|
|
665
|
+
relationshipRef: z.ZodString;
|
|
666
|
+
roleRef: z.ZodString;
|
|
667
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
668
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.ORGANIZATION_TYPE>;
|
|
669
|
+
organizationTypeRef: z.ZodString;
|
|
670
|
+
ownsApplication: z.ZodOptional<z.ZodLiteral<true>>;
|
|
671
|
+
offeredRoles: z.ZodOptional<z.ZodArray<z.ZodString>>;
|
|
672
|
+
userTypes: z.ZodOptional<z.ZodArray<z.ZodString>>;
|
|
673
|
+
requiresMfa: z.ZodOptional<z.ZodBoolean>;
|
|
674
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
675
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.ORGANIZATION_RELATIONSHIP_KIND>;
|
|
676
|
+
relationshipRef: z.ZodString;
|
|
677
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
678
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.ORGANIZATION_UNIT_CONFINEMENT>;
|
|
679
|
+
resourceRef: z.ZodString;
|
|
680
|
+
mode: z.ZodEnum<typeof import("@wildo-ai/saas-models").OrganizationRowConfinementMode>;
|
|
681
|
+
fieldName: z.ZodString;
|
|
682
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
683
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.SYSTEM_OF_RECORD_BINDING>;
|
|
684
|
+
resourceRef: z.ZodString;
|
|
685
|
+
systemOfRecordRef: z.ZodString;
|
|
686
|
+
systemOfRecordKind: z.ZodString;
|
|
687
|
+
access: z.ZodEnum<typeof import("@wildo-ai/saas-models").SystemOfRecordAccess>;
|
|
688
|
+
partitioned: z.ZodOptional<z.ZodBoolean>;
|
|
689
|
+
}, z.core.$strict>, z.ZodObject<{
|
|
690
|
+
kind: z.ZodLiteral<import("./build-plan-task-graph.schemas").BuildPlanTaskProductKind.INBOUND_CHANNEL_HANDLER>;
|
|
691
|
+
channel: z.ZodEnum<{
|
|
692
|
+
readonly EMAIL: import("@wildo-ai/saas-models").InboundChannelKind.EMAIL;
|
|
693
|
+
readonly SMS: import("@wildo-ai/saas-models").InboundChannelKind.SMS;
|
|
694
|
+
}>;
|
|
695
|
+
handlerRef: z.ZodString;
|
|
696
|
+
}, z.core.$strict>], "kind">>>;
|
|
697
|
+
functionalTopic: z.ZodEnum<typeof MetaWorkflow_FunctionalTopic>;
|
|
698
|
+
skillRefs: z.ZodArray<z.ZodString>;
|
|
699
|
+
prerequisiteSlugs: z.ZodArray<z.ZodString>;
|
|
700
|
+
servesRefs: z.ZodArray<z.ZodString>;
|
|
701
|
+
}, z.core.$strict>>;
|
|
702
|
+
complete: z.ZodBoolean;
|
|
703
|
+
remaining: z.ZodString;
|
|
704
|
+
}, z.core.$strict>;
|
|
705
|
+
export type BuildPlanTaskGraphSliceGeneration = z.infer<typeof BuildPlanTaskGraphSliceGenerationSchema>;
|
|
706
|
+
/**
|
|
707
|
+
* A persisted task in the provider's form (#3901), so tasks already landed can be re-assembled with a new slice and
|
|
708
|
+
* normalized again as one answer.
|
|
709
|
+
*
|
|
710
|
+
* The slug is the task ref itself: stamping is idempotent on an already-prefixed slug (`applyFamilyRefPrefix`), so the
|
|
711
|
+
* task normalizes back to the same ref, and a task the relationship grouping produced stays one task under its grouped
|
|
712
|
+
* ref (the run seals landed refs against grouping). Exact for every field a task carries except `requestedBy`, which no
|
|
713
|
+
* provider answer holds: a requested task is carried forward by the host, not by a decomposition.
|
|
714
|
+
*/
|
|
715
|
+
export declare function buildPlanTaskAsGeneration(task: Pick<BuildPlanTaskGraph['tasks'][number], 'taskRef' | 'objective' | 'target' | 'produces' | 'functionalTopic' | 'skillRefs' | 'prerequisiteTaskRefs' | 'servesRefs'>): BuildPlanTaskGeneration;
|
|
465
716
|
/**
|
|
466
717
|
* Normalize strict provider output into the persisted family: stamp refs and version, then group the
|
|
467
718
|
* relationship tasks one per module file ({@link groupRelationshipTasksByModule}, #3209). The grouped graph is
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"build-plan-task-graph-generation.schemas.d.ts","sourceRoot":"","sources":["../../../../src/_core/build-plan/build-plan-task-graph-generation.schemas.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,OAAO,EAAE,4BAA4B,EAAE,MAAM,mEAAmE,CAAC;AAGjH,OAAO,EAML,KAAK,kBAAkB,EACxB,MAAM,iCAAiC,CAAC;AAYzC;;;;;GAKG;AACH,eAAO,MAAM,6BAA6B
|
|
1
|
+
{"version":3,"file":"build-plan-task-graph-generation.schemas.d.ts","sourceRoot":"","sources":["../../../../src/_core/build-plan/build-plan-task-graph-generation.schemas.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,OAAO,EAAE,4BAA4B,EAAE,MAAM,mEAAmE,CAAC;AAGjH,OAAO,EAML,KAAK,kBAAkB,EACxB,MAAM,iCAAiC,CAAC;AAYzC;;;;;GAKG;AACH,eAAO,MAAM,6BAA6B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;kBA0BxC,CAAC;AACH,MAAM,MAAM,uBAAuB,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,6BAA6B,CAAC,CAAC;AAEpF;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,0CAA0C;;;kBAIrD,CAAC;AAEH,+FAA+F;AAC/F,eAAO,MAAM,kCAAkC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;kBAgB7C,CAAC;AACH,MAAM,MAAM,4BAA4B,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,kCAAkC,CAAC,CAAC;AAE9F;;;;;;;;;;;;;;GAcG;AACH,eAAO,MAAM,uCAAuC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;kBAMlD,CAAC;AACH,MAAM,MAAM,iCAAiC,GAAG,CAAC,CAAC,KAAK,CAAC,OAAO,uCAAuC,CAAC,CAAC;AAExG;;;;;;;;GAQG;AACH,wBAAgB,yBAAyB,CAAC,IAAI,EAAE,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,EAAE,SAAS,GAAG,WAAW,GAAG,QAAQ,GAAG,UAAU,GAAG,iBAAiB,GAAG,WAAW,GAAG,sBAAsB,GAAG,YAAY,CAAC,GAAG,uBAAuB,CAW7O;AAED;;;;;GAKG;AACH,wBAAgB,iCAAiC,CAAC,KAAK,EAAE,OAAO,EAAE,aAAa,GAAE,WAAW,CAAC,MAAM,CAAa,GAAG,kBAAkB,CAEpI;AAED;;;;GAIG;AACH,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,OAAO,GAAG,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAGlF"}
|