perttool 0.1.0-alpha.2

package/CHANGELOG.md

@@ -0,0 +1,53 @@
+# Changelog
+
+このプロジェクトの主な変更を記録する。形式は[Keep a Changelog](https://keepachangelog.com/ja/1.1.0/)を参考にし、versionは[Semantic Versioning](https://semver.org/lang/ja/)に従う。
+
+## [Unreleased]
+
+## [0.1.0-alpha.2] - 2026-07-23
+
+2回目の公開開発プレビュー。安全な編集・進行操作、Mermaid相互変換、説明可能なtask recommendationを追加し、同じartifactをGitHub Releaseとnpmの`alpha` tagへ配布する。
+
+### Added
+
+- `dsl format`とtask/milestone/resource/batch mutationのatomic `--write`、exclusive `--out`、`--expect-digest`
+- `Perttool.MermaidProfile.v1`のsemantic record、integrity digest、fail-closed import設計契約と規範artifact
+- `exportMermaid` Coreと`dag render --to mermaid`のlossless/plain profile、解析annotation、strict loss、exclusive `--out`
+- `importMermaid` Coreと`dag import --from mermaid`のfail-closed profile復元、plain loss report、strict loss、exclusive `--out`
+- canonical keep/remove set、partial join、idempotenceを保証するpure `planAdvance` Coreとpreview-first `dag advance` CLI
+- exact typed fact、comparison、decision trace、canonical descriptionを持つcomplete recommendation graphとpublic `NextResultV3` Core型
+- 5つのself-use planでv3 contract、byte determinism、operational互換、structured why-notを検査するrecommendation shadow gateとgolden
+- feasible replacement、`PTOVR-101`から`PTOVR-106`、caller-asserted human reason、normal trace reference、deterministic `Perttool.OverrideDecision.v1`を返すread-only `validateOverride` Core
+- completeかつknownな`NextResult.v3`をnormal AI task selection authorityへ採用する共有指示、help、unknown-version safe stop dry-run
+- npm publish normalizationを検査するpackage preflight、同一tarballをfail-closedでpublishするmaintainer script、`alpha` dist-tag固定
+
+### Changed
+
+- pre-release breaking changeとして`dag next`のdefault JSONを`Perttool.NextResult.v2`から`Perttool.NextResult.v3`へ変更し、Core、CLI JSON/text、help、packageをatomicに公開
+- npmがCLI entrypointを除去しないよう`bin.perttool`をcanonicalな`dist/cli.js`へ修正
+
+## [0.1.0-alpha.1] - 2026-07-21
+
+最初の公開開発プレビュー。DSLとCLIの評価、read-onlyな計画検査・分析・次task選択を目的とする。stable MVPではなく、互換性のない変更が入る可能性がある。
+
+### Added
+
+- Activity-on-Arrow DSLのparser、semantic/graph validation、複数error recovery
+- exact Rationalを使うPERT/CPM precedence分析とcritical path列挙
+- renewable resource capacityを扱う決定的`parallel-sgs` heuristic schedule
+- `active`、`ready`、`runnable_now`、`blocked_now`、`upcoming`の機械的判定
+- Point見積りとproject-wide velocityによるday/hour forecast
+- text/JSON CLI、構造化help、stable diagnostic codeとsource span
+- `npm link`およびGitHub Release tarballによるCLI導入
+
+### Known limitations
+
+- `dsl format`、task/milestone/resource mutation、`dag advance`は未実装
+- Mermaid import/exportは未実装
+- Resource scheduleは`optimal=false`のheuristicであり、厳密最適解ではない
+- npm registryには未公開。GitHub Release assetを使用する
+- Node.js 24以上が必要
+
+[Unreleased]: https://github.com/mako10k/perttool/compare/v0.1.0-alpha.2...HEAD
+[0.1.0-alpha.2]: https://github.com/mako10k/perttool/compare/v0.1.0-alpha.1...v0.1.0-alpha.2
+[0.1.0-alpha.1]: https://github.com/mako10k/perttool/releases/tag/v0.1.0-alpha.1

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 Makoto Katsumata
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,134 @@
+# perttool
+
+PERT 線図を、Git 管理しやすい文書として記述・検査・分析するためのタスク管理CLI。
+
+`v0.1.0-alpha.2`は公開開発プレビューです。`dsl check`、`dsl format`、`dsl help`、`dag analyze`、`dag next`、`dag advance`、`dag render --to mermaid`、`dag import --from mermaid`、source-preservingなtask/milestone/resource/batch mutation、atomic `--write`、exclusive `--out`、`--expect-digest`を実装済みです。`dag next`はcompleteなrecommendation graphを持つ`Perttool.NextResult.v3`を返し、public Core型とCLI JSON/text/helpを同じ判断へ接続します。Node.js 24以上が必要で、pre-release中は互換性のない変更が入る可能性があります。
+
+- [要件定義](docs/requirements.md)
+- [基本設計](docs/basic-design.md)
+- [DSL 文法仕様](docs/specs/dsl-grammar.md)
+- [Graph Semantics 仕様](docs/specs/graph-semantics.md)
+- [Analysis 仕様](docs/specs/analysis.md)
+- [Mutation Semantics 仕様](docs/specs/mutation.md)
+- [Mermaid Profile 仕様](docs/specs/mermaid-profile.md)
+- [Recommendation Semantics 仕様](docs/specs/recommendation.md)
+- [Recommendation Ranking Policy 仕様](docs/specs/recommendation-ranking.md)
+- [Recommendation Reason Taxonomy 仕様](docs/specs/recommendation-reasons.md)
+- [Recommendation Structured Explanation 仕様](docs/specs/recommendation-explanation.md)
+- [Recommendation Interface Contract 仕様](docs/specs/recommendation-interface.md)
+- [Recommendation Human Override Contract 仕様](docs/specs/recommendation-override.md)
+- [Recommendation 規範例](docs/examples/recommendation.md)
+- [Mermaid Profile 規範例](docs/examples/mermaid-profile.md)
+- [Recommendation 実装・自己利用migration](docs/process/recommendation-migration.md)
+- [NextResult.v3 consumer migration guide](docs/process/next-v3-consumer-migration.md)
+- [Recommendation 設計受け入れレビュー](docs/process/recommendation-design-review.md)
+- [MVP release readiness監査](docs/process/mvp-release-readiness.md)
+- [CLI Interface 仕様](docs/specs/interfaces.md)
+- [Architecture Decision Records](docs/adr/0001-activity-on-arrow.md)
+- [DSL サンプル](docs/examples/README.md)
+- [自己利用計画](docs/process/self-use.md)
+- [MVPマイルストーン計画](plans/mvp.pert)
+- [現在の文法作業計画](plans/grammar.pert)
+- [AI工程制御設計計画](plans/control-plane.pert)
+- [操作系M1-M4実装計画](plans/operations.pert)
+- [Recommendation実装計画](plans/recommendation.pert)
+- [AI 開発ガイド](docs/process/ai-development.md)
+
+基本方針は次のとおりです。
+
+- Activity-on-Arrow とし、タスクを DAG のエッジ、マイルストーンをノードとして扱う
+- 独自 DSL 文書をプロジェクト状態の正本とする
+- PERT/CPM 計算と「次のタスク」の判定を機械的かつ決定的に行う
+- 相対見積り`p`を基準に保持し、明示したproject-wide velocityで`d`または`h`の予測へexact換算する
+- 共有resourceのcapacityから排他実行と並列実行可能数を扱う
+- Mermaid との相互変換、CLI、構造化ヘルプ、AI向けJSON操作導線を同じ共通コア上に提供する
+- MVPはCLIをprimary interfaceとし、MCP/LSP adapterはMVP後に追加する
+- 現行文書は現在と未来を表し、過去は Git 履歴で追跡する
+- parser・check・analyze・next が安定した時点で、文法作業の計画から自己利用を開始する
+
+## Install
+
+公開開発プレビューはnpm registryの`alpha` dist-tagとGitHub prereleaseから導入できます。Maintainer向けの安全境界は[npm publication手順](docs/process/npm-publication.md)を参照してください。
+
+```sh
+npm install --global perttool@alpha
+perttool --version
+```
+
+ローカルcheckoutを開発中のNode.jsユーザー環境へlinkする場合:
+
+```sh
+git clone https://github.com/mako10k/perttool.git
+cd perttool
+npm ci
+npm link
+perttool --version
+```
+
+`prepare` lifecycleが`dist/`をbuildしてから、`perttool` binaryを現在のnpm global prefixへsymlinkします。System領域へsudoでinstallせず、NVMなどuser-ownedのnpm prefixを使用してください。解除はcheckoutで`npm unlink --global perttool`を実行します。
+
+## Development
+
+Setupとrepository check:
+
+```sh
+npm ci
+npm run check
+```
+
+実CLI processを使うE2Eシナリオだけを実行する場合:
+
+```sh
+npm run test:e2e
+```
+
+## CLI examples
+
+```sh
+perttool --help
+perttool dsl check docs/examples/parallel.pert
+perttool dsl check PLAN.pert --max-diagnostics 20 --format json
+perttool dsl format PLAN.pert --check
+perttool dsl format PLAN.pert --diff
+perttool dsl format PLAN.pert --write --expect-digest "$EXPECTED_DIGEST"
+perttool dsl help syntax estimate --level detail --format json
+perttool dsl help syntax velocity --level detail --format json
+perttool dag analyze docs/examples/point-velocity.pert --format json
+perttool dag analyze docs/examples/parallel.pert
+perttool dag analyze docs/examples/parallel.pert --capacity DEVELOPERS=3 --capacity TEST_ENV=2 --format json
+perttool dag next docs/examples/parallel.pert
+perttool dag next docs/examples/parallel.pert --capacity DEVELOPERS=3 --format json
+perttool dag advance docs/examples/advance-partial-before.pert --diff
+perttool dag advance PLAN.pert --write --expect-digest "$EXPECTED_DIGEST"
+perttool dag render docs/examples/parallel.pert --to mermaid --analysis both
+perttool dag render docs/examples/parallel.pert --to mermaid --analysis resource --capacity TEST_ENV=2 --out parallel.mmd
+perttool dag import parallel.mmd --from mermaid
+perttool dag import parallel.mmd --from mermaid --strict-loss --out parallel.pert
+perttool task set docs/examples/minimal.pert WORK --status active --diff
+perttool task set PLAN.pert WORK --status active --write --expect-digest "$EXPECTED_DIGEST"
+perttool resource set docs/examples/parallel.pert TEST_ENV --capacity 2 --format json
+perttool mutation apply docs/examples/minimal.pert --request changes.json --diff
+perttool mutation apply PLAN.pert --request changes.json --out UPDATED.pert
+```
+
+`dag analyze`はexact RationalによるPERT/CPMと、renewable resource capacityを守る決定的な`parallel-sgs` scheduleを別resultとして返します。`duration_unit point`では`velocity 20p/10d`のように宣言し、基準のPoint値とday/hourの`velocity_forecast`を分離して返します。Resource scheduleは実行可能なheuristicであり、最適解とは表示しません。
+
+`dag next`は依存関係上の`ready`、既存schedulerが選ぶ`runnable_now`、工程authorityであるroot `recommendation`を分離します。JSONは全ready taskのtier、exact typed fact、comparison、decision trace、canonical descriptionをcomplete graphとして返し、textは4 tierの`complete=false` summaryとJSON導線を返します。開始できないready taskには不足resourceと占有task、upcoming taskには未充足依存の説明も従来どおり保持します。Consumerは[移行ガイド](docs/process/next-v3-consumer-migration.md)に従い、`schema_version`を最初に検査します。
+
+5 planのshadowとMIG-07 safe-stop dry-runを経て、knownかつcompleteな`NextResult.v3`をperttool開発のnormal AI task selection authorityへ採用しました。Macro recommendationからworkstreamを選んでdetailを再解析し、unknown version、incomplete trace、`PTREC-*`、deferred/discouraged selectionでは開始せず停止します。
+
+Public libraryの`validateOverride`はcompleteな`NextResultV3`と明示的なhuman requestから、normal recommendationを変更せずdeterministicな`Perttool.OverrideDecision.v1`を生成します。これはread-only validationであり、task state、file、Git、networkを変更しません。Override applyとaudit writeのCLIは未実装です。
+
+`dag advance`はeffective reachedより過去のtask/gate/milestoneだけを除去し、未到達joinに必要なdone taskとsatisfied gateを保持します。既定はcandidate previewで、削除entityとfrontier/readyの前後比較をtext/JSONへ含めます。`--write`、`--out`、`--expect-digest`は他のediting commandと同じsafe-write経路を使います。
+
+`dag render --to mermaid`は既定でlosslessな`Perttool.MermaidProfile.v1`をstdoutへ生成します。`--analysis`でprecedence/resource解析値をprojectionへ注記でき、`--out`は既存targetを上書きしません。`--profile plain`はsemantic metadataを持たないため`PTCNV-206`を返し、`--strict-loss`でartifactを拒否できます。
+
+`dag import --from mermaid`はperttool profileのcanonical JSON、record順、metadata/projection digest、semantic model、projection対応をfail-closedで検査し、canonical DSLをpreviewします。Plain Mermaidはstable generated IDとloss reportを返す限定best-effortで、`--strict-loss`はlossy candidateと`--out`を拒否します。
+
+`dsl format`とMutation commandは既定では検査済みcandidateをpreviewし、`--diff`ではunified diffを返します。`dsl format --check`は変更が必要なときだけexit 1です。Preview確認後は`--write`でinitial digestを再照合してatomic replaceし、`--expect-digest`でcaller lockを追加できます。`--out`は既存targetを上書きせず新規documentを作成します。`--format json`ではcandidate、diff、UTF-16 TextEdit、digest、write結果を同じresultへ含めます。
+
+現在は[MVPマイルストーン計画](plans/mvp.pert)をmacro roadmapとするStage 3のpreview-first advance自己利用を行っています。[Recommendation実装計画](plans/recommendation.pert)のMIG-01からMIG-07全22pを1 active dayで完了し、recommendation固有の暫定実測Velocityを`22p/1d`へ更新しました。Detail残作業は0pで、normal recommendation authorityを採用済みです。Macroの唯一のready、`runnable_now`、recommended、precedence/schedule critical work packageは`RELEASE_E2E`、残るmakespanは2dです。Issue #2のAI Agent Guidance RegistryとIssue #3のmulti-plan compositionは独立backlogのままです。
+
+## Security and license
+
+脆弱性は[Security Policy](SECURITY.md)に従って非公開で報告してください。本ソフトウェアは[MIT License](LICENSE)で公開します。変更履歴と既知の制約は[CHANGELOG](CHANGELOG.md)を参照してください。

package/dist/analysis/graph.d.ts

@@ -0,0 +1,41 @@
+import type { DeclarationNode, DocumentNode, RequirementValue } from "../model/syntax.js";
+import type { Rational } from "../model/rational.js";
+import type { DurationUnit, Velocity } from "../model/units.js";
+export type TaskStatus = "planned" | "active" | "blocked" | "done";
+export interface AnalysisResource {
+    readonly declaration: DeclarationNode;
+    readonly id: string;
+    readonly capacity: number;
+}
+export interface AnalysisEdge {
+    readonly declaration: DeclarationNode;
+    readonly id: string;
+    readonly kind: "task" | "gate";
+    readonly source: string;
+    readonly target: string;
+    readonly status: TaskStatus | null;
+    readonly expected: Rational;
+    readonly variance: Rational;
+    readonly priority: number;
+    readonly requirements: readonly RequirementValue[];
+}
+export interface ResidualGraph {
+    readonly document: DocumentNode;
+    readonly project: DeclarationNode;
+    readonly finish: string;
+    readonly durationUnit: DurationUnit;
+    readonly velocity: Velocity | null;
+    readonly criticalEpsilon: Rational;
+    readonly vertices: ReadonlyMap<string, DeclarationNode>;
+    readonly resources: ReadonlyMap<string, AnalysisResource>;
+    readonly edges: readonly AnalysisEdge[];
+    readonly incoming: ReadonlyMap<string, readonly AnalysisEdge[]>;
+    readonly outgoing: ReadonlyMap<string, readonly AnalysisEdge[]>;
+    readonly topologicalOrder: readonly string[];
+    readonly effectiveReached: ReadonlySet<string>;
+    readonly frontier: readonly string[];
+    readonly blockedTaskIds: readonly string[];
+}
+export declare function computeEffectiveReached(document: DocumentNode): ReadonlySet<string>;
+export declare function buildResidualGraph(document: DocumentNode): ResidualGraph;
+//# sourceMappingURL=graph.d.ts.map

package/dist/analysis/graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../../src/analysis/graph.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,eAAe,EACf,YAAY,EAEZ,gBAAgB,EAEjB,MAAM,oBAAoB,CAAC;AAG5B,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAWrD,OAAO,KAAK,EAAE,YAAY,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAEhE,MAAM,MAAM,UAAU,GAAG,SAAS,GAAG,QAAQ,GAAG,SAAS,GAAG,MAAM,CAAC;AAEnE,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,WAAW,EAAE,eAAe,CAAC;IACtC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;CAC3B;AAED,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,WAAW,EAAE,eAAe,CAAC;IACtC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAAC;IAC/B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,MAAM,EAAE,UAAU,GAAG,IAAI,CAAC;IACnC,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC;IAC5B,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC;IAC5B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,YAAY,EAAE,SAAS,gBAAgB,EAAE,CAAC;CACpD;AAED,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,QAAQ,EAAE,YAAY,CAAC;IAChC,QAAQ,CAAC,OAAO,EAAE,eAAe,CAAC;IAClC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,YAAY,EAAE,YAAY,CAAC;IACpC,QAAQ,CAAC,QAAQ,EAAE,QAAQ,GAAG,IAAI,CAAC;IACnC,QAAQ,CAAC,eAAe,EAAE,QAAQ,CAAC;IACnC,QAAQ,CAAC,QAAQ,EAAE,WAAW,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;IACxD,QAAQ,CAAC,SAAS,EAAE,WAAW,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAC;IAC1D,QAAQ,CAAC,KAAK,EAAE,SAAS,YAAY,EAAE,CAAC;IACxC,QAAQ,CAAC,QAAQ,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,YAAY,EAAE,CAAC,CAAC;IAChE,QAAQ,CAAC,QAAQ,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,YAAY,EAAE,CAAC,CAAC;IAChE,QAAQ,CAAC,gBAAgB,EAAE,SAAS,MAAM,EAAE,CAAC;IAC7C,QAAQ,CAAC,gBAAgB,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IAC/C,QAAQ,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,CAAC;IACrC,QAAQ,CAAC,cAAc,EAAE,SAAS,MAAM,EAAE,CAAC;CAC5C;AA6CD,wBAAgB,uBAAuB,CAAC,QAAQ,EAAE,YAAY,GAAG,WAAW,CAAC,MAAM,CAAC,CAkCnF;AAoCD,wBAAgB,kBAAkB,CAAC,QAAQ,EAAE,YAAY,GAAG,aAAa,CA+GxE"}

package/dist/analysis/graph.js

@@ -0,0 +1,199 @@
+import { fieldNamed } from "../model/syntax.js";
+import { compareStableStrings } from "../model/diagnostics.js";
+import { ZERO, add, divide, multiply, rational, rationalFromDuration, square, subtract, } from "../model/rational.js";
+function durationFieldValue(declaration, name) {
+    const field = fieldNamed(declaration, name);
+    if (field === undefined || typeof field.value !== "object" || field.value === null) {
+        throw new Error(`validated ${declaration.id} is missing duration field ${name}`);
+    }
+    return rationalFromDuration(field.value);
+}
+function edgeNumbers(declaration) {
+    if (declaration.kind === "gate")
+        return { expected: ZERO, variance: ZERO };
+    const status = (fieldNamed(declaration, "status")?.value ?? "planned");
+    if (status === "done")
+        return { expected: ZERO, variance: ZERO };
+    const estimate = fieldNamed(declaration, "estimate");
+    if (estimate === undefined) {
+        return { expected: durationFieldValue(declaration, "duration"), variance: ZERO };
+    }
+    const children = estimate.children ?? [];
+    const optimistic = durationFieldValueFromChild(declaration, children, "optimistic");
+    const mostLikely = durationFieldValueFromChild(declaration, children, "most_likely");
+    const pessimistic = durationFieldValueFromChild(declaration, children, "pessimistic");
+    const expected = divide(add(add(optimistic, multiply(rational(4n), mostLikely)), pessimistic), rational(6n));
+    const variance = square(divide(subtract(pessimistic, optimistic), rational(6n)));
+    return { expected, variance };
+}
+function durationFieldValueFromChild(declaration, children, name) {
+    const child = children.find((candidate) => candidate.name === name);
+    if (child === undefined || typeof child.value !== "object" || child.value === null) {
+        throw new Error(`validated estimate ${declaration.id} is missing ${name}`);
+    }
+    return rationalFromDuration(child.value);
+}
+export function computeEffectiveReached(document) {
+    const milestones = document.declarations.filter((declaration) => declaration.kind === "milestone");
+    const edges = document.declarations.filter((declaration) => declaration.kind === "task" || declaration.kind === "gate");
+    const incoming = new Map(milestones.map((milestone) => [milestone.id, []]));
+    for (const edge of edges)
+        incoming.get(edge.to).push(edge);
+    for (const list of incoming.values()) {
+        list.sort((left, right) => compareStableStrings(left.id, right.id));
+    }
+    const reached = new Set(milestones
+        .filter((milestone) => fieldNamed(milestone, "state")?.value === "reached")
+        .map((milestone) => milestone.id));
+    const satisfied = (edge) => {
+        if (!reached.has(edge.from))
+            return false;
+        return edge.kind === "gate" || fieldNamed(edge, "status")?.value === "done";
+    };
+    let changed = true;
+    while (changed) {
+        changed = false;
+        for (const milestone of milestones) {
+            if (reached.has(milestone.id))
+                continue;
+            const edgesIn = incoming.get(milestone.id);
+            if (edgesIn.length > 0 && edgesIn.every(satisfied)) {
+                reached.add(milestone.id);
+                changed = true;
+            }
+        }
+    }
+    return reached;
+}
+function stableTopologicalOrder(vertices, edges) {
+    const indegree = new Map([...vertices.keys()].map((id) => [id, 0]));
+    const outgoing = new Map([...vertices.keys()].map((id) => [id, []]));
+    for (const edge of edges) {
+        indegree.set(edge.target, indegree.get(edge.target) + 1);
+        outgoing.get(edge.source).push(edge);
+    }
+    for (const list of outgoing.values()) {
+        list.sort((left, right) => compareStableStrings(left.id, right.id));
+    }
+    const available = [...indegree]
+        .filter(([, degree]) => degree === 0)
+        .map(([id]) => id)
+        .sort(compareStableStrings);
+    const order = [];
+    while (available.length > 0) {
+        const current = available.shift();
+        order.push(current);
+        for (const edge of outgoing.get(current)) {
+            const degree = indegree.get(edge.target) - 1;
+            indegree.set(edge.target, degree);
+            if (degree === 0) {
+                available.push(edge.target);
+                available.sort(compareStableStrings);
+            }
+        }
+    }
+    if (order.length !== vertices.size)
+        throw new Error("validated residual graph contains a cycle");
+    return order;
+}
+export function buildResidualGraph(document) {
+    const project = document.declarations.find((declaration) => declaration.kind === "project");
+    if (project === undefined)
+        throw new Error("validated document has no project");
+    const finish = fieldNamed(project, "finish").value;
+    const durationUnit = fieldNamed(project, "duration_unit").value;
+    const velocityField = fieldNamed(project, "velocity");
+    const velocityValue = velocityField?.value;
+    const velocity = velocityValue === undefined
+        ? null
+        : {
+            points: rationalFromDuration(velocityValue.points),
+            period: rationalFromDuration(velocityValue.period),
+            periodUnit: velocityValue.period.suffix === "d" ? "day" : "hour",
+        };
+    const epsilonField = fieldNamed(project, "critical_epsilon");
+    const criticalEpsilon = epsilonField === undefined
+        ? ZERO
+        : rationalFromDuration(epsilonField.value);
+    const effectiveReached = computeEffectiveReached(document);
+    const allMilestones = new Map(document.declarations
+        .filter((declaration) => declaration.kind === "milestone")
+        .map((declaration) => [declaration.id, declaration]));
+    const edges = document.declarations
+        .filter((declaration) => (declaration.kind === "task" || declaration.kind === "gate") &&
+        !effectiveReached.has(declaration.to))
+        .map((declaration) => {
+        const numbers = edgeNumbers(declaration);
+        return {
+            declaration,
+            id: declaration.id,
+            kind: declaration.kind,
+            source: declaration.from,
+            target: declaration.to,
+            status: declaration.kind === "task"
+                ? (fieldNamed(declaration, "status")?.value ?? "planned")
+                : null,
+            expected: numbers.expected,
+            variance: numbers.variance,
+            priority: declaration.kind === "task"
+                ? (fieldNamed(declaration, "priority")?.value ?? 0)
+                : 0,
+            requirements: declaration.kind === "task"
+                ? (fieldNamed(declaration, "requires")?.value ?? [])
+                : [],
+        };
+    });
+    edges.sort((left, right) => compareStableStrings(left.id, right.id));
+    const vertexIds = new Set([finish]);
+    for (const edge of edges) {
+        vertexIds.add(edge.source);
+        vertexIds.add(edge.target);
+    }
+    const vertices = new Map([...vertexIds]
+        .sort(compareStableStrings)
+        .map((id) => [id, allMilestones.get(id)]));
+    const incomingMutable = new Map([...vertices.keys()].map((id) => [id, []]));
+    const outgoingMutable = new Map([...vertices.keys()].map((id) => [id, []]));
+    for (const edge of edges) {
+        incomingMutable.get(edge.target).push(edge);
+        outgoingMutable.get(edge.source).push(edge);
+    }
+    for (const list of [...incomingMutable.values(), ...outgoingMutable.values()]) {
+        list.sort((left, right) => compareStableStrings(left.id, right.id));
+    }
+    const resources = new Map(document.declarations
+        .filter((declaration) => declaration.kind === "resource")
+        .sort((left, right) => compareStableStrings(left.id, right.id))
+        .map((declaration) => [
+        declaration.id,
+        {
+            declaration,
+            id: declaration.id,
+            capacity: fieldNamed(declaration, "capacity").value,
+        },
+    ]));
+    const frontier = [...vertices.keys()]
+        .filter((id) => effectiveReached.has(id))
+        .sort(compareStableStrings);
+    return {
+        document,
+        project,
+        finish,
+        durationUnit,
+        velocity,
+        criticalEpsilon,
+        vertices,
+        resources,
+        edges,
+        incoming: incomingMutable,
+        outgoing: outgoingMutable,
+        topologicalOrder: stableTopologicalOrder(vertices, edges),
+        effectiveReached,
+        frontier,
+        blockedTaskIds: edges
+            .filter((edge) => edge.status === "blocked")
+            .map((edge) => edge.id)
+            .sort(compareStableStrings),
+    };
+}
+//# sourceMappingURL=graph.js.map

package/dist/analysis/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../../src/analysis/graph.ts"],"names":[],"mappings":"AAOA,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAChD,OAAO,EAAE,oBAAoB,EAAE,MAAM,yBAAyB,CAAC;AAE/D,OAAO,EACL,IAAI,EACJ,GAAG,EACH,MAAM,EACN,QAAQ,EACR,QAAQ,EACR,oBAAoB,EACpB,MAAM,EACN,QAAQ,GACT,MAAM,sBAAsB,CAAC;AA0C9B,SAAS,kBAAkB,CAAC,WAA4B,EAAE,IAAY;IACpE,MAAM,KAAK,GAAG,UAAU,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;IAC5C,IAAI,KAAK,KAAK,SAAS,IAAI,OAAO,KAAK,CAAC,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;QACnF,MAAM,IAAI,KAAK,CAAC,aAAa,WAAW,CAAC,EAAE,8BAA8B,IAAI,EAAE,CAAC,CAAC;IACnF,CAAC;IACD,OAAO,oBAAoB,CAAC,KAAK,CAAC,KAAsB,CAAC,CAAC;AAC5D,CAAC;AAED,SAAS,WAAW,CAAC,WAA4B;IAI/C,IAAI,WAAW,CAAC,IAAI,KAAK,MAAM;QAAE,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;IAC3E,MAAM,MAAM,GAAG,CAAC,UAAU,CAAC,WAAW,EAAE,QAAQ,CAAC,EAAE,KAAK,IAAI,SAAS,CAAe,CAAC;IACrF,IAAI,MAAM,KAAK,MAAM;QAAE,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;IACjE,MAAM,QAAQ,GAAG,UAAU,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;IACrD,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC3B,OAAO,EAAE,QAAQ,EAAE,kBAAkB,CAAC,WAAW,EAAE,UAAU,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;IACnF,CAAC;IACD,MAAM,QAAQ,GAAG,QAAQ,CAAC,QAAQ,IAAI,EAAE,CAAC;IACzC,MAAM,UAAU,GAAG,2BAA2B,CAAC,WAAW,EAAE,QAAQ,EAAE,YAAY,CAAC,CAAC;IACpF,MAAM,UAAU,GAAG,2BAA2B,CAAC,WAAW,EAAE,QAAQ,EAAE,aAAa,CAAC,CAAC;IACrF,MAAM,WAAW,GAAG,2BAA2B,CAAC,WAAW,EAAE,QAAQ,EAAE,aAAa,CAAC,CAAC;IACtF,MAAM,QAAQ,GAAG,MAAM,CACrB,GAAG,CAAC,GAAG,CAAC,UAAU,EAAE,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC,EAAE,WAAW,CAAC,EACrE,QAAQ,CAAC,EAAE,CAAC,CACb,CAAC;IACF,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,EAAE,UAAU,CAAC,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACjF,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;AAChC,CAAC;AAED,SAAS,2BAA2B,CAClC,WAA4B,EAC5B,QAAuE,EACvE,IAAY;IAEZ,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;IACpE,IAAI,KAAK,KAAK,SAAS,IAAI,OAAO,KAAK,CAAC,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;QACnF,MAAM,IAAI,KAAK,CAAC,sBAAsB,WAAW,CAAC,EAAE,eAAe,IAAI,EAAE,CAAC,CAAC;IAC7E,CAAC;IACD,OAAO,oBAAoB,CAAC,KAAK,CAAC,KAAsB,CAAC,CAAC;AAC5D,CAAC;AAED,MAAM,UAAU,uBAAuB,CAAC,QAAsB;IAC5D,MAAM,UAAU,GAAG,QAAQ,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,WAAW,CAAC,IAAI,KAAK,WAAW,CAAC,CAAC;IACnG,MAAM,KAAK,GAAG,QAAQ,CAAC,YAAY,CAAC,MAAM,CACxC,CAAC,WAAW,EAAE,EAAE,CAAC,WAAW,CAAC,IAAI,KAAK,MAAM,IAAI,WAAW,CAAC,IAAI,KAAK,MAAM,CAC5E,CAAC;IACF,MAAM,QAAQ,GAAG,IAAI,GAAG,CACtB,UAAU,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,SAAS,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAClD,CAAC;IACF,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAG,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7D,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;QACrC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IACtE,CAAC;IACD,MAAM,OAAO,GAAG,IAAI,GAAG,CACrB,UAAU;SACP,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,UAAU,CAAC,SAAS,EAAE,OAAO,CAAC,EAAE,KAAK,KAAK,SAAS,CAAC;SAC1E,GAAG,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC,CACpC,CAAC;IACF,MAAM,SAAS,GAAG,CAAC,IAAqB,EAAW,EAAE;QACnD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QAC3C,OAAO,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,UAAU,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,KAAK,KAAK,MAAM,CAAC;IAC9E,CAAC,CAAC;IACF,IAAI,OAAO,GAAG,IAAI,CAAC;IACnB,OAAO,OAAO,EAAE,CAAC;QACf,OAAO,GAAG,KAAK,CAAC;QAChB,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACnC,IAAI,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;gBAAE,SAAS;YACxC,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAE,CAAC;YAC5C,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,CAAC,KAAK,CAAC,SAAS,CAAC,EAAE,CAAC;gBACnD,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;gBAC1B,OAAO,GAAG,IAAI,CAAC;YACjB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,sBAAsB,CAC7B,QAA8C,EAC9C,KAA8B;IAE9B,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACpE,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAoB,CAAC,CAAC,CAAC,CAAC;IACvF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAE,GAAG,CAAC,CAAC,CAAC;QAC1D,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxC,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;QACrC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IACtE,CAAC;IACD,MAAM,SAAS,GAAG,CAAC,GAAG,QAAQ,CAAC;SAC5B,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,MAAM,KAAK,CAAC,CAAC;SACpC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;SACjB,IAAI,CAAC,oBAAoB,CAAC,CAAC;IAC9B,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC5B,MAAM,OAAO,GAAG,SAAS,CAAC,KAAK,EAAG,CAAC;QACnC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACpB,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAE,EAAE,CAAC;YAC1C,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAE,GAAG,CAAC,CAAC;YAC9C,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YAClC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;gBACjB,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC5B,SAAS,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;YACvC,CAAC;QACH,CAAC;IACH,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,KAAK,QAAQ,CAAC,IAAI;QAAE,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC;IACjG,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,UAAU,kBAAkB,CAAC,QAAsB;IACvD,MAAM,OAAO,GAAG,QAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,WAAW,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC;IAC5F,IAAI,OAAO,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;IAChF,MAAM,MAAM,GAAG,UAAU,CAAC,OAAO,EAAE,QAAQ,CAAE,CAAC,KAAe,CAAC;IAC9D,MAAM,YAAY,GAAG,UAAU,CAAC,OAAO,EAAE,eAAe,CAAE,CAAC,KAAqB,CAAC;IACjF,MAAM,aAAa,GAAG,UAAU,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;IACtD,MAAM,aAAa,GAAG,aAAa,EAAE,KAAkC,CAAC;IACxE,MAAM,QAAQ,GACZ,aAAa,KAAK,SAAS;QACzB,CAAC,CAAC,IAAI;QACN,CAAC,CAAC;YACE,MAAM,EAAE,oBAAoB,CAAC,aAAa,CAAC,MAAM,CAAC;YAClD,MAAM,EAAE,oBAAoB,CAAC,aAAa,CAAC,MAAM,CAAC;YAClD,UAAU,EAAE,aAAa,CAAC,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM;SACjE,CAAC;IACR,MAAM,YAAY,GAAG,UAAU,CAAC,OAAO,EAAE,kBAAkB,CAAC,CAAC;IAC7D,MAAM,eAAe,GACnB,YAAY,KAAK,SAAS;QACxB,CAAC,CAAC,IAAI;QACN,CAAC,CAAC,oBAAoB,CAAC,YAAY,CAAC,KAAsB,CAAC,CAAC;IAChE,MAAM,gBAAgB,GAAG,uBAAuB,CAAC,QAAQ,CAAC,CAAC;IAC3D,MAAM,aAAa,GAAG,IAAI,GAAG,CAC3B,QAAQ,CAAC,YAAY;SAClB,MAAM,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,WAAW,CAAC,IAAI,KAAK,WAAW,CAAC;SACzD,GAAG,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC,WAAW,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC,CACvD,CAAC;IACF,MAAM,KAAK,GAAmB,QAAQ,CAAC,YAAY;SAChD,MAAM,CAAC,CAAC,WAAW,EAAE,EAAE,CACtB,CAAC,WAAW,CAAC,IAAI,KAAK,MAAM,IAAI,WAAW,CAAC,IAAI,KAAK,MAAM,CAAC;QAC5D,CAAC,gBAAgB,CAAC,GAAG,CAAC,WAAW,CAAC,EAAG,CAAC,CACvC;SACA,GAAG,CAAC,CAAC,WAAW,EAAE,EAAE;QACnB,MAAM,OAAO,GAAG,WAAW,CAAC,WAAW,CAAC,CAAC;QACzC,OAAO;YACL,WAAW;YACX,EAAE,EAAE,WAAW,CAAC,EAAE;YAClB,IAAI,EAAE,WAAW,CAAC,IAAuB;YACzC,MAAM,EAAE,WAAW,CAAC,IAAK;YACzB,MAAM,EAAE,WAAW,CAAC,EAAG;YACvB,MAAM,EACJ,WAAW,CAAC,IAAI,KAAK,MAAM;gBACzB,CAAC,CAAE,CAAC,UAAU,CAAC,WAAW,EAAE,QAAQ,CAAC,EAAE,KAAK,IAAI,SAAS,CAAgB;gBACzE,CAAC,CAAC,IAAI;YACV,QAAQ,EAAE,OAAO,CAAC,QAAQ;YAC1B,QAAQ,EAAE,OAAO,CAAC,QAAQ;YAC1B,QAAQ,EACN,WAAW,CAAC,IAAI,KAAK,MAAM;gBACzB,CAAC,CAAE,CAAC,UAAU,CAAC,WAAW,EAAE,UAAU,CAAC,EAAE,KAAK,IAAI,CAAC,CAAY;gBAC/D,CAAC,CAAC,CAAC;YACP,YAAY,EACV,WAAW,CAAC,IAAI,KAAK,MAAM;gBACzB,CAAC,CAAE,CAAC,UAAU,CAAC,WAAW,EAAE,UAAU,CAAC,EAAE,KAAK,IAAI,EAAE,CAAiC;gBACrF,CAAC,CAAC,EAAE;SACT,CAAC;IACJ,CAAC,CAAC,CAAC;IACL,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IACrE,MAAM,SAAS,GAAG,IAAI,GAAG,CAAS,CAAC,MAAM,CAAC,CAAC,CAAC;IAC5C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC3B,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC7B,CAAC;IACD,MAAM,QAAQ,GAAG,IAAI,GAAG,CACtB,CAAC,GAAG,SAAS,CAAC;SACX,IAAI,CAAC,oBAAoB,CAAC;SAC1B,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,aAAa,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,CAAC,CAC7C,CAAC;IACF,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAoB,CAAC,CAAC,CAAC,CAAC;IAC9F,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAoB,CAAC,CAAC,CAAC,CAAC;IAC9F,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7C,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC/C,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,EAAE,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;QAC9E,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IACtE,CAAC;IACD,MAAM,SAAS,GAAG,IAAI,GAAG,CACvB,QAAQ,CAAC,YAAY;SAClB,MAAM,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,WAAW,CAAC,IAAI,KAAK,UAAU,CAAC;SACxD,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;SAC9D,GAAG,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC;QACpB,WAAW,CAAC,EAAE;QACd;YACE,WAAW;YACX,EAAE,EAAE,WAAW,CAAC,EAAE;YAClB,QAAQ,EAAE,UAAU,CAAC,WAAW,EAAE,UAAU,CAAE,CAAC,KAAe;SAC/D;KACF,CAAC,CACL,CAAC;IACF,MAAM,QAAQ,GAAG,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC;SAClC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,gBAAgB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;SACxC,IAAI,CAAC,oBAAoB,CAAC,CAAC;IAC9B,OAAO;QACL,QAAQ;QACR,OAAO;QACP,MAAM;QACN,YAAY;QACZ,QAAQ;QACR,eAAe;QACf,QAAQ;QACR,SAAS;QACT,KAAK;QACL,QAAQ,EAAE,eAAe;QACzB,QAAQ,EAAE,eAAe;QACzB,gBAAgB,EAAE,sBAAsB,CAAC,QAAQ,EAAE,KAAK,CAAC;QACzD,gBAAgB;QAChB,QAAQ;QACR,cAAc,EAAE,KAAK;aAClB,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,KAAK,SAAS,CAAC;aAC3C,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;aACtB,IAAI,CAAC,oBAAoB,CAAC;KAC9B,CAAC;AACJ,CAAC"}

package/dist/analysis/precedence.d.ts

@@ -0,0 +1,52 @@
+import type { Rational } from "../model/rational.js";
+import type { AnalysisEdge, ResidualGraph, TaskStatus } from "./graph.js";
+export interface MilestoneTiming {
+    readonly id: string;
+    readonly earliest: Rational;
+    readonly latest: Rational;
+    readonly slack: Rational;
+}
+export interface EdgeTiming {
+    readonly id: string;
+    readonly source: string;
+    readonly target: string;
+    readonly kind: "task" | "gate";
+    readonly status: TaskStatus | null;
+    readonly expected: Rational;
+    readonly variance: Rational;
+    readonly es: Rational;
+    readonly ef: Rational;
+    readonly ls: Rational;
+    readonly lf: Rational;
+    readonly totalFloat: Rational;
+    readonly freeFloat: Rational;
+    readonly isCritical: boolean;
+    readonly isDriving: boolean;
+    readonly edge: AnalysisEdge;
+}
+export interface CriticalPath {
+    readonly edgeIds: readonly string[];
+    readonly taskIds: readonly string[];
+    readonly gateIds: readonly string[];
+    readonly variance: Rational;
+}
+export interface CriticalResult {
+    readonly milestoneIds: readonly string[];
+    readonly taskIds: readonly string[];
+    readonly gateIds: readonly string[];
+    readonly drivingEdgeIds: readonly string[];
+    readonly representativePath: CriticalPath;
+    readonly pathCount: bigint;
+    readonly paths: readonly CriticalPath[];
+    readonly pathsTruncated: boolean;
+}
+export interface PrecedenceResult {
+    readonly makespan: Rational;
+    readonly conditionalOnBlocksResolved: boolean;
+    readonly blockedTaskIds: readonly string[];
+    readonly milestones: readonly MilestoneTiming[];
+    readonly edges: readonly EdgeTiming[];
+    readonly critical: CriticalResult;
+}
+export declare function analyzePrecedence(graph: ResidualGraph, maxPaths: number): PrecedenceResult;
+//# sourceMappingURL=precedence.d.ts.map

package/dist/analysis/precedence.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"precedence.d.ts","sourceRoot":"","sources":["../../src/analysis/precedence.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AASrD,OAAO,KAAK,EAAE,YAAY,EAAE,aAAa,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAE1E,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC;IAC5B,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC;IAC1B,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC;CAC1B;AAED,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAAC;IAC/B,QAAQ,CAAC,MAAM,EAAE,UAAU,GAAG,IAAI,CAAC;IACnC,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC;IAC5B,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC;IAC5B,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC;IACtB,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC;IACtB,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC;IACtB,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC;IACtB,QAAQ,CAAC,UAAU,EAAE,QAAQ,CAAC;IAC9B,QAAQ,CAAC,SAAS,EAAE,QAAQ,CAAC;IAC7B,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC;IAC7B,QAAQ,CAAC,SAAS,EAAE,OAAO,CAAC;IAC5B,QAAQ,CAAC,IAAI,EAAE,YAAY,CAAC;CAC7B;AAED,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC;CAC7B;AAED,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,YAAY,EAAE,SAAS,MAAM,EAAE,CAAC;IACzC,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,QAAQ,CAAC,cAAc,EAAE,SAAS,MAAM,EAAE,CAAC;IAC3C,QAAQ,CAAC,kBAAkB,EAAE,YAAY,CAAC;IAC1C,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,KAAK,EAAE,SAAS,YAAY,EAAE,CAAC;IACxC,QAAQ,CAAC,cAAc,EAAE,OAAO,CAAC;CAClC;AAED,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC;IAC5B,QAAQ,CAAC,2BAA2B,EAAE,OAAO,CAAC;IAC9C,QAAQ,CAAC,cAAc,EAAE,SAAS,MAAM,EAAE,CAAC;IAC3C,QAAQ,CAAC,UAAU,EAAE,SAAS,eAAe,EAAE,CAAC;IAChD,QAAQ,CAAC,KAAK,EAAE,SAAS,UAAU,EAAE,CAAC;IACtC,QAAQ,CAAC,QAAQ,EAAE,cAAc,CAAC;CACnC;AA6ED,wBAAgB,iBAAiB,CAC/B,KAAK,EAAE,aAAa,EACpB,QAAQ,EAAE,MAAM,GACf,gBAAgB,CAyGlB"}