@critical-path/core 0.55.0 → 0.57.0

package/CHANGELOG.md

@@ -1,5 +1,31 @@
 # @critical-path/core
 
+## 0.57.0
+
+### Minor Changes
+
+- 224ad51: One scheduling engine, start constraints and dependency lag.
+  
+  - **BREAKING:** project-calendar critical path analysis now runs on the same date-based passes as assignee mode (every task on the project calendar), so the two cannot drift. Offsets are unchanged; dates now show a successor starting at the next working moment after its predecessor finishes (09:00 the next morning rather than 17:00), and results include `overallocations` and `scheduleId` as in assignee mode. Without a start date the analysis has offsets only, as before.
+  - New `Task.earliestStart`: start no earlier than this date (a date-only value is the start of that day). Applies in critical path analysis and levelling, and on a summary task to every leaf under it.
+  - New `TaskDependency.lagHours`: working hours to wait after the predecessor finishes (negative for a lead), accepted by `addDependency`, `POST /tasks/:id/dependencies` and MCP `add_dependency`. Links that differ only in lag are separate dependencies; the longer wait applies.
+  - Levelling orders its backward pass topologically over dependency and resource links, so leads cannot break slack.
+  - MCP `create_task` / `update_task` accept `earliestStart`.
+
+## 0.56.0
+
+### Minor Changes
+
+- 42ecdb9: Clearing fields over HTTP, validated dates, and correctable time entries.
+  
+  - Update bodies accept `null` to remove an optional field (tasks, projects, deliverables, containers, iterations and time entries); parsing turns it into `undefined`, which every store treats as removal. Required fields (titles, names, task `status` and `priority`) still reject it. New `applyUpdate(record, updates)` applies payloads the same way for optimistic UI state; the React and Svelte task and deliverable state use it.
+  - **BREAKING:** every date field in request bodies must be an ISO date or date-time (`400` otherwise). Free-text dates used to be stored and then broke levelling, metrics and the ladder.
+  - Time entries can be corrected and deleted: `engine.getTimeEntry` / `updateTimeEntry` / `deleteTimeEntry`, `GET | PATCH | DELETE /time-entries/:id`, and the matching client methods. The task's hour totals move by the difference, and `time.updated` / `time.deleted` events are published. A new `time.manage` permission (project managers and admins) covers other people's entries; anyone with `time.log` can manage their own.
+  - `logTime` always requires the task to exist (it used to store orphan entries when no policy was enforced), and logs inside a transaction where the store supports one.
+  - **BREAKING (custom adapters):** `TimeEntryRepository` gains `getTimeEntry(id)` and `updateTimeEntry(id, updates)`.
+  - `FirebaseStore` updates every document inside `runTransaction` when the db supports it and implements `incrementTaskHours`, so concurrent updates and time logs are no longer lost. Pass Firestore's `FieldValue` as the new `fieldValue` option to add hour totals with `FieldValue.increment` (atomic, no contention) instead of transactions.
+  - MCP: new `update_time_entry` and `delete_time_entry` tools.
+
 ## 0.55.0
 
 ### Minor Changes

package/README.md

@@ -365,7 +365,7 @@ console.log(leveled.unleveledProjectEndDate, '->', leveled.projectEndDate);
 
 With `calendars: 'assignee'` (or `criticalPathCalendars: 'assignee'` on the engine), each task uses its assignee's schedule, then its team's, then the project calendar. Passes run on dates, slack is measured in each task's calendar, and each calendar is evaluated in its own `timezone` (IANA name; default UTC), including daylight-saving changes. `levelResources: true` additionally delays tasks so nobody works on two at once (priority rule `levelingPriority`, default least slack), reporting `levelingDelayHours` and `waitingOn` per task. Tasks with `allocation` below 1 take that share of their assignee (a 16h task at 0.5 spans 32 working hours); levelling fits them within 100% per person, and `overallocations` lists who is booked above 100% and when. Teams act as pools of `headcount` people (default: member count) shared by team-only tasks and members' own tasks. Finished tasks take no time. `calculatePortfolioCriticalPath({ projectIds })` levels several projects together, sharing people and teams across them; `includeHiddenWork` also counts unreadable projects' work as `'hidden'`. `effort: 'remaining'` schedules only what is left on in-progress tasks.
 
-Tasks with subtasks are summary tasks, reported as roll-ups of their leaves (`isSummary`); dependencies and deadlines on them apply to every leaf. Unestimated tasks use `defaultEstimateHours` (default 1) and are listed in `unestimatedTaskIds`. Tasks with `isMilestone: true` are zero-duration checkpoints (their estimates are ignored). A `deadline` on any task caps its late finish: a forecast that misses it shows as negative slack along the path driving it, with `deadlineDate` and `deadlineVarianceHours` per task and `missedDeadlineTaskIds` on the analysis. A date-only deadline means the end of that working day; project-calendar mode needs a start date to apply deadlines.
+Tasks with subtasks are summary tasks, reported as roll-ups of their leaves (`isSummary`); dependencies and deadlines on them apply to every leaf. Unestimated tasks use `defaultEstimateHours` (default 1) and are listed in `unestimatedTaskIds`. Tasks with `isMilestone: true` are zero-duration checkpoints (their estimates are ignored). A `deadline` on any task caps its late finish: a forecast that misses it shows as negative slack along the path driving it, with `deadlineDate` and `deadlineVarianceHours` per task and `missedDeadlineTaskIds` on the analysis. A date-only deadline means the end of that working day. `earliestStart` (start no earlier than) and dependency `lagHours` (wait after the predecessor; negative for a lead) constrain the forward pass. Project-calendar mode needs a start date to apply these date constraints.
 
 ### 9. Fractional Lexical Indexing (Kanban Reordering)
 

package/dist/domain/authorization.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"authorization.d.ts","sourceRoot":"","sources":["../../src/domain/authorization.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,KAAK,EACL,mBAAmB,EACnB,mBAAmB,EAEnB,WAAW,EACZ,MAAM,mBAAmB,CAAC;AAsB3B,mDAAmD;AACnD,eAAO,MAAM,wBAAwB,EAAE,MAAM,CAAC,WAAW,EAAE,SAAS,mBAAmB,EAAE,CAKxF,CAAC;AAEF,MAAM,WAAW,iBAAiB;IAChC,mEAAmE;IACnE,eAAe,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,WAAW,EAAE,SAAS,mBAAmB,EAAE,CAAC,CAAC,CAAC;IAC/E,0GAA0G;IAC1G,cAAc,CAAC,EAAE,MAAM,EAAE,CAAC;IAC1B;;;OAGG;IACH,iBAAiB,CAAC,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,OAAO,CAAC;IAC9C,8EAA8E;IAC9E,kBAAkB,CAAC,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,OAAO,CAAC;CAChD;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,OAAO,GAAE,iBAAsB,GAAG,mBAAmB,CA6BrF"}
+{"version":3,"file":"authorization.d.ts","sourceRoot":"","sources":["../../src/domain/authorization.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,KAAK,EACL,mBAAmB,EACnB,mBAAmB,EAEnB,WAAW,EACZ,MAAM,mBAAmB,CAAC;AAuB3B,mDAAmD;AACnD,eAAO,MAAM,wBAAwB,EAAE,MAAM,CAAC,WAAW,EAAE,SAAS,mBAAmB,EAAE,CAKxF,CAAC;AAEF,MAAM,WAAW,iBAAiB;IAChC,mEAAmE;IACnE,eAAe,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,WAAW,EAAE,SAAS,mBAAmB,EAAE,CAAC,CAAC,CAAC;IAC/E,0GAA0G;IAC1G,cAAc,CAAC,EAAE,MAAM,EAAE,CAAC;IAC1B;;;OAGG;IACH,iBAAiB,CAAC,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,OAAO,CAAC;IAC9C,8EAA8E;IAC9E,kBAAkB,CAAC,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,OAAO,CAAC;CAChD;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,OAAO,GAAE,iBAAsB,GAAG,mBAAmB,CA8BrF"}

package/dist/domain/authorization.js

@@ -11,6 +11,7 @@ const PROJECT_MANAGER = [
     ...CONTRIBUTOR,
     'task.delete',
     'plan.manage',
+    'time.manage',
     'project.update',
     'project.manage_members',
     'comment.moderate',
@@ -59,6 +60,8 @@ export function createRolePolicy(options = {}) {
             return true;
         if (action === 'attachment.delete' && ownsResource && granted.has('attachment.create'))
             return true;
+        if (action === 'time.manage' && ownsResource && granted.has('time.log'))
+            return true;
         return false;
     };
 }

package/dist/domain/authorization.js.map

@@ -1 +1 @@
-{"version":3,"file":"authorization.js","sourceRoot":"","sources":["../../src/domain/authorization.ts"],"names":[],"mappings":"AAQA,MAAM,MAAM,GAA0B,CAAC,cAAc,CAAC,CAAC;AACvD,MAAM,WAAW,GAA0B;IACzC,GAAG,MAAM;IACT,aAAa;IACb,aAAa;IACb,gBAAgB;IAChB,mBAAmB;IACnB,UAAU;CACX,CAAC;AACF,MAAM,eAAe,GAA0B;IAC7C,GAAG,WAAW;IACd,aAAa;IACb,aAAa;IACb,gBAAgB;IAChB,wBAAwB;IACxB,kBAAkB;IAClB,mBAAmB;CACpB,CAAC;AACF,MAAM,aAAa,GAA0B,CAAC,GAAG,eAAe,EAAE,gBAAgB,EAAE,uBAAuB,CAAC,CAAC;AAE7G,mDAAmD;AACnD,MAAM,CAAC,MAAM,wBAAwB,GAAwD;IAC3F,MAAM,EAAE,MAAM;IACd,WAAW,EAAE,WAAW;IACxB,eAAe,EAAE,eAAe;IAChC,KAAK,EAAE,aAAa;CACrB,CAAC;AAgBF;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAC,UAA6B,EAAE;IAC9D,MAAM,WAAW,GAAG,EAAE,GAAG,wBAAwB,EAAE,GAAG,OAAO,CAAC,eAAe,EAAE,CAAC;IAChF,MAAM,cAAc,GAAG,OAAO,CAAC,cAAc,IAAI,CAAC,OAAO,CAAC,CAAC;IAC3D,MAAM,WAAW,GAAG,CAAC,KAAY,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAClG,MAAM,iBAAiB,GAAG,OAAO,CAAC,iBAAiB,IAAI,CAAC,CAAC,KAAY,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC;IACxG,MAAM,kBAAkB,GAAG,OAAO,CAAC,kBAAkB,IAAI,WAAW,CAAC;IAErE,OAAO,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAwB,EAAW,EAAE;QACtF,IAAI,WAAW,CAAC,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QACpC,IAAI,MAAM,KAAK,gBAAgB;YAAE,OAAO,iBAAiB,CAAC,KAAK,CAAC,CAAC;QACjE,IAAI,MAAM,KAAK,kBAAkB;YAAE,OAAO,kBAAkB,CAAC,KAAK,CAAC,CAAC;QACpE,IAAI,CAAC,OAAO;YAAE,OAAO,KAAK,CAAC;QAE3B,8DAA8D;QAC9D,MAAM,KAAK,GAAG,CAAC,OAAO,CAAC,OAAO,IAAI,EAAE,CAAC;aAClC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;aAChG,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACtB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QAErC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC1E,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,OAAO,IAAI,CAAC;QAErC,8EAA8E;QAC9E,MAAM,YAAY,GAAG,QAAQ,EAAE,OAAO,KAAK,SAAS,IAAI,QAAQ,CAAC,OAAO,KAAK,KAAK,CAAC,MAAM,CAAC;QAC1F,IAAI,MAAM,KAAK,kBAAkB,IAAI,YAAY,IAAI,OAAO,CAAC,GAAG,CAAC,gBAAgB,CAAC;YAAE,OAAO,IAAI,CAAC;QAChG,IAAI,MAAM,KAAK,mBAAmB,IAAI,YAAY,IAAI,OAAO,CAAC,GAAG,CAAC,mBAAmB,CAAC;YAAE,OAAO,IAAI,CAAC;QAEpG,OAAO,KAAK,CAAC;IACf,CAAC,CAAC;AACJ,CAAC"}
+{"version":3,"file":"authorization.js","sourceRoot":"","sources":["../../src/domain/authorization.ts"],"names":[],"mappings":"AAQA,MAAM,MAAM,GAA0B,CAAC,cAAc,CAAC,CAAC;AACvD,MAAM,WAAW,GAA0B;IACzC,GAAG,MAAM;IACT,aAAa;IACb,aAAa;IACb,gBAAgB;IAChB,mBAAmB;IACnB,UAAU;CACX,CAAC;AACF,MAAM,eAAe,GAA0B;IAC7C,GAAG,WAAW;IACd,aAAa;IACb,aAAa;IACb,aAAa;IACb,gBAAgB;IAChB,wBAAwB;IACxB,kBAAkB;IAClB,mBAAmB;CACpB,CAAC;AACF,MAAM,aAAa,GAA0B,CAAC,GAAG,eAAe,EAAE,gBAAgB,EAAE,uBAAuB,CAAC,CAAC;AAE7G,mDAAmD;AACnD,MAAM,CAAC,MAAM,wBAAwB,GAAwD;IAC3F,MAAM,EAAE,MAAM;IACd,WAAW,EAAE,WAAW;IACxB,eAAe,EAAE,eAAe;IAChC,KAAK,EAAE,aAAa;CACrB,CAAC;AAgBF;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAC,UAA6B,EAAE;IAC9D,MAAM,WAAW,GAAG,EAAE,GAAG,wBAAwB,EAAE,GAAG,OAAO,CAAC,eAAe,EAAE,CAAC;IAChF,MAAM,cAAc,GAAG,OAAO,CAAC,cAAc,IAAI,CAAC,OAAO,CAAC,CAAC;IAC3D,MAAM,WAAW,GAAG,CAAC,KAAY,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAClG,MAAM,iBAAiB,GAAG,OAAO,CAAC,iBAAiB,IAAI,CAAC,CAAC,KAAY,EAAE,EAAE,CAAC,KAAK,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC;IACxG,MAAM,kBAAkB,GAAG,OAAO,CAAC,kBAAkB,IAAI,WAAW,CAAC;IAErE,OAAO,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAwB,EAAW,EAAE;QACtF,IAAI,WAAW,CAAC,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QACpC,IAAI,MAAM,KAAK,gBAAgB;YAAE,OAAO,iBAAiB,CAAC,KAAK,CAAC,CAAC;QACjE,IAAI,MAAM,KAAK,kBAAkB;YAAE,OAAO,kBAAkB,CAAC,KAAK,CAAC,CAAC;QACpE,IAAI,CAAC,OAAO;YAAE,OAAO,KAAK,CAAC;QAE3B,8DAA8D;QAC9D,MAAM,KAAK,GAAG,CAAC,OAAO,CAAC,OAAO,IAAI,EAAE,CAAC;aAClC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;aAChG,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACtB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QAErC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC1E,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,OAAO,IAAI,CAAC;QAErC,8EAA8E;QAC9E,MAAM,YAAY,GAAG,QAAQ,EAAE,OAAO,KAAK,SAAS,IAAI,QAAQ,CAAC,OAAO,KAAK,KAAK,CAAC,MAAM,CAAC;QAC1F,IAAI,MAAM,KAAK,kBAAkB,IAAI,YAAY,IAAI,OAAO,CAAC,GAAG,CAAC,gBAAgB,CAAC;YAAE,OAAO,IAAI,CAAC;QAChG,IAAI,MAAM,KAAK,mBAAmB,IAAI,YAAY,IAAI,OAAO,CAAC,GAAG,CAAC,mBAAmB,CAAC;YAAE,OAAO,IAAI,CAAC;QACpG,IAAI,MAAM,KAAK,aAAa,IAAI,YAAY,IAAI,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC;YAAE,OAAO,IAAI,CAAC;QAErF,OAAO,KAAK,CAAC;IACf,CAAC,CAAC;AACJ,CAAC"}

package/dist/domain/cpm.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"cpm.d.ts","sourceRoot":"","sources":["../../src/domain/cpm.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,IAAI,EACJ,cAAc,EAEd,oBAAoB,EACpB,YAAY,EACZ,IAAI,EACJ,IAAI,EAEJ,6BAA6B,EAC9B,MAAM,mBAAmB,CAAC;AAe3B,8GAA8G;AAC9G,eAAO,MAAM,sBAAsB,IAAI,CAAC;AAExC;;;GAGG;AACH,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,IAAI,EAAE,oBAAoB,GAAE,MAA+B,GAAG,MAAM,CAK9G;AAOD,2EAA2E;AAC3E,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,IAAI,GAAG,MAAM,CAGpD;AAED,wEAAwE;AACxE,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,IAAI,EAAE,oBAAoB,CAAC,EAAE,MAAM,GAAG,MAAM,CAErF;AAED,+GAA+G;AAC/G,wBAAgB,cAAc,CAAC,IAAI,EAAE,IAAI,GAAG,OAAO,CAGlD;AAED,6GAA6G;AAC7G,MAAM,MAAM,WAAW,GAAG,UAAU,GAAG,WAAW,CAAC;AAEnD;;;;GAIG;AACH,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,GAAE,WAAwB,EAAE,oBAAoB,CAAC,EAAE,MAAM,GAAG,MAAM,CAMzH;AAED,MAAM,WAAW,UAAU;IACzB,gBAAgB,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACjC,8DAA8D;IAC9D,QAAQ,CAAC,EAAE,YAAY,CAAC;IACxB;;;;;OAKG;IACH,SAAS,CAAC,EAAE,SAAS,GAAG,UAAU,CAAC;IACnC,iFAAiF;IACjF,KAAK,CAAC,EAAE,IAAI,EAAE,CAAC;IACf,kFAAkF;IAClF,KAAK,CAAC,EAAE,IAAI,EAAE,CAAC;IACf;;;;OAIG;IACH,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB;;;;OAIG;IACH,gBAAgB,CAAC,EAAE,gBAAgB,CAAC;IACpC;;;;OAIG;IACH,MAAM,CAAC,EAAE,WAAW,CAAC;IACrB;;;OAGG;IACH,oBAAoB,CAAC,EAAE,MAAM,CAAC;CAC/B;AAED,MAAM,MAAM,gBAAgB,GAAG,OAAO,GAAG,UAAU,GAAG,SAAS,GAAG,OAAO,CAAC;AAE1E,4FAA4F;AAC5F,wBAAgB,mBAAmB,CACjC,IAAI,EAAE,IAAI,EACV,OAAO,EAAE;IAAE,KAAK,CAAC,EAAE,IAAI,EAAE,CAAC;IAAC,KAAK,CAAC,EAAE,IAAI,EAAE,CAAC;IAAC,QAAQ,CAAC,EAAE,YAAY,CAAA;CAAE,GACnE,YAAY,CAOd;AAID;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,GAAE,YAAoC,GAAG,IAAI,CAKzG;AA0qBD,MAAM,WAAW,qBAAqB;IACpC,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,IAAI,EAAE,CAAC;IACd,0DAA0D;IAC1D,gBAAgB,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACjC,8DAA8D;IAC9D,QAAQ,CAAC,EAAE,YAAY,CAAC;IACxB;;;;OAIG;IACH,UAAU,CAAC,EAAE,SAAS,GAAG,QAAQ,CAAC;CACnC;AAED,MAAM,WAAW,mBAAoB,SAAQ,IAAI,CAAC,UAAU,EAAE,kBAAkB,GAAG,UAAU,CAAC;IAC5F,gHAAgH;IAChH,YAAY,CAAC,EAAE,MAAM,EAAE,CAAC;CACzB;AAED;;;;;;GAMG;AACH,wBAAgB,qBAAqB,CACnC,QAAQ,EAAE,qBAAqB,EAAE,EACjC,YAAY,EAAE,cAAc,EAAE,EAC9B,OAAO,GAAE,mBAAwB,GAChC,6BAA6B,CAuC/B;AAED;;;;;;GAMG;AACH,wBAAgB,YAAY,CAC1B,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,IAAI,EAAE,EACb,YAAY,EAAE,cAAc,EAAE,EAC9B,OAAO,GAAE,UAAe,GACvB,oBAAoB,CAmLtB"}
+{"version":3,"file":"cpm.d.ts","sourceRoot":"","sources":["../../src/domain/cpm.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,IAAI,EACJ,cAAc,EAEd,oBAAoB,EACpB,YAAY,EACZ,IAAI,EACJ,IAAI,EAEJ,6BAA6B,EAC9B,MAAM,mBAAmB,CAAC;AAe3B,8GAA8G;AAC9G,eAAO,MAAM,sBAAsB,IAAI,CAAC;AAExC;;;GAGG;AACH,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,IAAI,EAAE,oBAAoB,GAAE,MAA+B,GAAG,MAAM,CAK9G;AAOD,2EAA2E;AAC3E,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,IAAI,GAAG,MAAM,CAGpD;AAED,wEAAwE;AACxE,wBAAgB,mBAAmB,CAAC,IAAI,EAAE,IAAI,EAAE,oBAAoB,CAAC,EAAE,MAAM,GAAG,MAAM,CAErF;AAED,+GAA+G;AAC/G,wBAAgB,cAAc,CAAC,IAAI,EAAE,IAAI,GAAG,OAAO,CAGlD;AAED,6GAA6G;AAC7G,MAAM,MAAM,WAAW,GAAG,UAAU,GAAG,WAAW,CAAC;AAEnD;;;;GAIG;AACH,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,GAAE,WAAwB,EAAE,oBAAoB,CAAC,EAAE,MAAM,GAAG,MAAM,CAMzH;AAED,MAAM,WAAW,UAAU;IACzB,gBAAgB,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACjC,8DAA8D;IAC9D,QAAQ,CAAC,EAAE,YAAY,CAAC;IACxB;;;;;OAKG;IACH,SAAS,CAAC,EAAE,SAAS,GAAG,UAAU,CAAC;IACnC,iFAAiF;IACjF,KAAK,CAAC,EAAE,IAAI,EAAE,CAAC;IACf,kFAAkF;IAClF,KAAK,CAAC,EAAE,IAAI,EAAE,CAAC;IACf;;;;OAIG;IACH,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB;;;;OAIG;IACH,gBAAgB,CAAC,EAAE,gBAAgB,CAAC;IACpC;;;;OAIG;IACH,MAAM,CAAC,EAAE,WAAW,CAAC;IACrB;;;OAGG;IACH,oBAAoB,CAAC,EAAE,MAAM,CAAC;CAC/B;AAED,MAAM,MAAM,gBAAgB,GAAG,OAAO,GAAG,UAAU,GAAG,SAAS,GAAG,OAAO,CAAC;AAE1E,4FAA4F;AAC5F,wBAAgB,mBAAmB,CACjC,IAAI,EAAE,IAAI,EACV,OAAO,EAAE;IAAE,KAAK,CAAC,EAAE,IAAI,EAAE,CAAC;IAAC,KAAK,CAAC,EAAE,IAAI,EAAE,CAAC;IAAC,QAAQ,CAAC,EAAE,YAAY,CAAA;CAAE,GACnE,YAAY,CAOd;AAID;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,GAAE,YAAoC,GAAG,IAAI,CAKzG;AAkvBD,MAAM,WAAW,qBAAqB;IACpC,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,IAAI,EAAE,CAAC;IACd,0DAA0D;IAC1D,gBAAgB,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACjC,8DAA8D;IAC9D,QAAQ,CAAC,EAAE,YAAY,CAAC;IACxB;;;;OAIG;IACH,UAAU,CAAC,EAAE,SAAS,GAAG,QAAQ,CAAC;CACnC;AAED,MAAM,WAAW,mBAAoB,SAAQ,IAAI,CAAC,UAAU,EAAE,kBAAkB,GAAG,UAAU,CAAC;IAC5F,gHAAgH;IAChH,YAAY,CAAC,EAAE,MAAM,EAAE,CAAC;CACzB;AAED;;;;;;GAMG;AACH,wBAAgB,qBAAqB,CACnC,QAAQ,EAAE,qBAAqB,EAAE,EACjC,YAAY,EAAE,cAAc,EAAE,EAC9B,OAAO,GAAE,mBAAwB,GAChC,6BAA6B,CAuC/B;AAED;;;;;;GAMG;AACH,wBAAgB,YAAY,CAC1B,SAAS,EAAE,MAAM,EACjB,KAAK,EAAE,IAAI,EAAE,EACb,YAAY,EAAE,cAAc,EAAE,EAC9B,OAAO,GAAE,UAAe,GACvB,oBAAoB,CAmCtB"}

package/dist/domain/cpm.js

@@ -74,6 +74,7 @@ const milestoneFields = (task, deadline, varianceHours) => ({
     ...(deadline ? { deadlineDate: deadline.toISOString(), deadlineVarianceHours: round2(varianceHours) } : {})
 });
 const allocationField = (task) => (getTaskAllocation(task) < 1 ? { allocation: getTaskAllocation(task) } : {});
+const edgeKey = (before, after) => `${before}\u0000${after}`;
 const deadlinesOf = (graph, id) => graph.deadlines.get(id) ?? [];
 /**
  * The scheduling graph. Only leaf tasks are scheduled: a summary task (one with subtasks among
@@ -96,12 +97,14 @@ function buildGraph(tasks, dependencies) {
     };
     const summaries = new Map([...summaryIds].map((id) => [id, { task: all.get(id), leafIds: leavesOf(id) }]));
     const deadlines = new Map();
+    const earliestStarts = new Map();
     for (const t of tasks) {
-        if (!t.deadline)
-            continue;
-        for (const leaf of leavesOf(t.id))
+        for (const leaf of t.deadline ? leavesOf(t.id) : [])
             deadlines.set(leaf, [...(deadlines.get(leaf) ?? []), t.deadline]);
+        for (const leaf of t.earliestStart ? leavesOf(t.id) : [])
+            earliestStarts.set(leaf, [...(earliestStarts.get(leaf) ?? []), t.earliestStart]);
     }
+    const lags = new Map();
     const taskMap = new Map(tasks.filter((t) => !summaryIds.has(t.id)).map((t) => [t.id, t]));
     const taskIds = Array.from(taskMap.keys());
     // Build adjacency graph:
@@ -117,12 +120,17 @@ function buildGraph(tasks, dependencies) {
         const edge = precedenceOf(dep);
         if (!edge || !all.has(edge.before) || !all.has(edge.after))
             continue;
+        const lag = Number.isFinite(dep.lagHours) ? dep.lagHours : 0;
         for (const before of leavesOf(edge.before)) {
             for (const after of leavesOf(edge.after)) {
                 if (before === after)
                     continue;
                 prerequisites.get(after).add(before);
                 successors.get(before).add(after);
+                // Two links between the same tasks: the longer wait wins
+                const key = edgeKey(before, after);
+                if (lag !== 0 || lags.has(key))
+                    lags.set(key, Math.max(lags.get(key) ?? -Infinity, lag));
             }
         }
     }
@@ -154,7 +162,7 @@ function buildGraph(tasks, dependencies) {
     const sorted = new Set(topoOrder);
     const cyclicTaskIds = taskIds.filter((id) => !sorted.has(id));
     topoOrder.push(...cyclicTaskIds);
-    return { taskMap, taskIds, prerequisites, successors, topoOrder, cyclicTaskIds, summaries, deadlines };
+    return { taskMap, taskIds, prerequisites, successors, topoOrder, cyclicTaskIds, summaries, deadlines, earliestStarts, lags };
 }
 /**
  * Adds each summary task to `analysis` as a roll-up of the leaf tasks under it: earliest start,
@@ -257,7 +265,21 @@ function scheduleOnDates(graph, segments, options, calculatedAt) {
         const deadline = taskMap.get(id).deadline;
         return deadline ? getDeadlineInstant(deadline, calendarOf.get(id)) : undefined;
     };
-    const ctx = { taskMap, calendarOf, durationOf, deadlineOf, ownDeadlineOf, startOf: (id) => segmentOf.get(id).start };
+    // A start constraint means "not before": the first working moment at or after it
+    const notBefore = new Map(taskIds.flatMap((id) => {
+        const instants = (graph.earliestStarts.get(id) ?? []).map((d) => nextWorkingTime(d, calendarOf.get(id)));
+        return instants.length ? [[id, new Date(Math.max(...instants.map((d) => d.getTime())))]] : [];
+    }));
+    const ctx = {
+        taskMap,
+        calendarOf,
+        durationOf,
+        deadlineOf,
+        ownDeadlineOf,
+        notBefore,
+        lagOf: (before, after) => graph.lags.get(edgeKey(before, after)) ?? 0,
+        startOf: (id) => segmentOf.get(id).start
+    };
     const endOfProjects = (dates) => {
         const ends = new Map(segments.map((seg) => [seg.projectId, latest(seg.taskIds.map((id) => dates.finish.get(id)), seg.start)]));
         return (id) => ends.get(segmentOf.get(id).projectId);
@@ -303,6 +325,34 @@ function involving(overallocations, seg) {
     const ids = new Set(seg.taskIds);
     return overallocations.filter((o) => o.taskIds.some((id) => ids.has(id)));
 }
+/** `date` moved by `hours` working hours on `calendar` (back when negative). */
+function shiftWorking(date, hours, calendar) {
+    if (hours > 0)
+        return addWorkingHours(date, hours, calendar);
+    if (hours < 0)
+        return subtractWorkingHours(date, -hours, calendar);
+    return date;
+}
+/**
+ * When a task may start, given when its predecessors finish: the latest of its project's start, its
+ * start constraint and each predecessor's finish plus the lag on that dependency.
+ */
+function readyTime(id, prerequisites, finish, ctx) {
+    let ready = ctx.startOf(id);
+    const floor = ctx.notBefore.get(id);
+    if (floor && floor > ready)
+        ready = floor;
+    const calendar = ctx.calendarOf.get(id);
+    for (const p of prerequisites.get(id)) {
+        const f = finish.get(p);
+        if (!f)
+            continue;
+        const after = shiftWorking(f, ctx.lagOf(p, id), calendar);
+        if (after > ready)
+            ready = after;
+    }
+    return ready;
+}
 function latest(dates, floor) {
     let max = floor;
     for (const d of dates)
@@ -331,12 +381,7 @@ function forwardPass(order, prerequisites, ctx) {
     const start = new Map();
     const finish = new Map();
     for (const id of order) {
-        let ready = ctx.startOf(id);
-        for (const p of prerequisites.get(id)) {
-            const f = finish.get(p);
-            if (f && f > ready)
-                ready = f;
-        }
+        const ready = readyTime(id, prerequisites, finish, ctx);
         const calendar = ctx.calendarOf.get(id);
         const duration = ctx.durationOf.get(id);
         const es = startTime(ready, duration, calendar);
@@ -353,8 +398,10 @@ function backwardPass(order, successorsOf, endOf, ctx) {
         let due = endOf(id);
         for (const s of successorsOf(id)) {
             const ls = start.get(s);
-            if (ls && ls < due)
-                due = ls;
+            // The successor's late start, less the lag it waits after this task finishes
+            const by = ls && shiftWorking(ls, -ctx.lagOf(id, s), ctx.calendarOf.get(s));
+            if (by && by < due)
+                due = by;
         }
         const deadline = ctx.deadlineOf.get(id);
         if (deadline && deadline < due)
@@ -424,12 +471,7 @@ function levelSchedule({ taskMap, taskIds, prerequisites, successors, topoOrder
             eligible.add(topoOrder.find((id) => !start.has(id)));
         const id = first(eligible);
         eligible.delete(id);
-        let ready = ctx.startOf(id);
-        for (const p of prerequisites.get(id)) {
-            const f = finish.get(p);
-            if (f && f > ready)
-                ready = f;
-        }
+        const ready = readyTime(id, prerequisites, finish, ctx);
         const calendar = ctx.calendarOf.get(id);
         const duration = ctx.durationOf.get(id);
         const resources = duration > 0 ? resourcesOf(taskMap.get(id)) : [];
@@ -483,10 +525,36 @@ function levelSchedule({ taskMap, taskIds, prerequisites, successors, topoOrder
     // whose finish freed its capacity.
     for (const [taskId, blocker] of waitingOn)
         link(blocker, taskId);
-    // Every edge (dependency or resource chain) goes forward in levelled start time; ties are
-    // zero-duration tasks, ordered by placement.
+    // The backward pass needs every successor (dependency or resource chain) before its
+    // predecessors. Edges mostly go forward in levelled start time, but a lead (negative lag) can
+    // start a successor first, so walk the edges depth-first, visiting tasks in start order.
     const placement = new Map(placed.map((id, i) => [id, i]));
-    const backwardOrder = [...taskIds].sort((a, b) => start.get(b).getTime() - start.get(a).getTime() || placement.get(b) - placement.get(a));
+    const byStart = [...taskIds].sort((a, b) => start.get(a).getTime() - start.get(b).getTime() || placement.get(a) - placement.get(b));
+    const backwardOrder = [];
+    const visited = new Set();
+    const visit = (root) => {
+        // Iterative post-order, so long chains cannot overflow the stack
+        const stack = [];
+        const enter = (id) => {
+            visited.add(id);
+            stack.push([id, [...successors.get(id), ...(resourceSuccessors.get(id) ?? [])][Symbol.iterator]()]);
+        };
+        enter(root);
+        while (stack.length) {
+            const [id, next] = stack[stack.length - 1];
+            const step = next.next();
+            if (step.done) {
+                stack.pop();
+                backwardOrder.push(id);
+            }
+            else if (!visited.has(step.value)) {
+                enter(step.value);
+            }
+        }
+    };
+    for (const id of byStart)
+        if (!visited.has(id))
+            visit(id);
     return {
         early: { start, finish },
         waitingOn,
@@ -698,145 +766,30 @@ export function calculateCPM(projectId, tasks, dependencies, options = {}) {
             tasks: []
         };
     }
-    const graph = buildGraph(tasks, dependencies);
-    const { taskMap, taskIds, prerequisites, successors, topoOrder } = graph;
     if (options.levelResources && options.calendars !== 'assignee') {
         throw new Error("levelResources requires calendars: 'assignee'.");
     }
-    if (options.calendars === 'assignee') {
-        return calculateCalendarCPM(projectId, calculatedAt, graph, options);
-    }
-    // Deadlines as project-calendar hours from the start. Without a start date there is nothing to
-    // place them against, so they are ignored. A task's late finish is capped by its own deadline and
-    // by those of the summary tasks above it; its schedule reports its own.
-    const capHours = new Map();
-    const ownDeadline = new Map();
-    const toHours = (deadline) => deadline >= projectStartDate
-        ? getWorkingHoursBetween(projectStartDate, deadline, schedule)
-        : -getWorkingHoursBetween(deadline, projectStartDate, schedule);
-    if (projectStartDate) {
-        for (const id of taskIds) {
-            const caps = deadlinesOf(graph, id).map((d) => toHours(getDeadlineInstant(d, schedule)));
-            if (caps.length)
-                capHours.set(id, Math.min(...caps));
-            const own = taskMap.get(id).deadline;
-            if (own)
-                ownDeadline.set(id, getDeadlineInstant(own, schedule));
-        }
-    }
-    // --- FORWARD PASS ---
-    const earlyStart = new Map();
-    const earlyFinish = new Map();
-    for (const id of topoOrder) {
-        const task = taskMap.get(id);
-        const duration = getTaskScheduledHours(task, options.effort, options.defaultEstimateHours);
-        const prereqs = prerequisites.get(id) || new Set();
-        let maxPrereqFinish = 0;
-        for (const p of prereqs) {
-            const pFinish = earlyFinish.get(p) ?? 0;
-            if (pFinish > maxPrereqFinish) {
-                maxPrereqFinish = pFinish;
-            }
-        }
-        const es = maxPrereqFinish;
-        const ef = es + duration;
-        earlyStart.set(id, es);
-        earlyFinish.set(id, ef);
-    }
-    // Total project duration
-    let totalDurationHours = 0;
-    for (const ef of earlyFinish.values()) {
-        if (ef > totalDurationHours) {
-            totalDurationHours = ef;
-        }
-    }
-    // --- BACKWARD PASS ---
-    const lateStart = new Map();
-    const lateFinish = new Map();
-    // Process in reverse topological order
-    for (let i = topoOrder.length - 1; i >= 0; i--) {
-        const id = topoOrder[i];
-        const task = taskMap.get(id);
-        const duration = getTaskScheduledHours(task, options.effort, options.defaultEstimateHours);
-        const succs = successors.get(id) || new Set();
-        let minSuccLateStart = totalDurationHours;
-        if (succs.size > 0) {
-            minSuccLateStart = Infinity;
-            for (const s of succs) {
-                const sLateStart = lateStart.get(s);
-                if (sLateStart !== undefined && sLateStart < minSuccLateStart) {
-                    minSuccLateStart = sLateStart;
-                }
-            }
-            if (!Number.isFinite(minSuccLateStart)) {
-                minSuccLateStart = totalDurationHours;
-            }
-        }
-        const lf = Math.min(minSuccLateStart, capHours.get(id) ?? Infinity);
-        const ls = lf - duration;
-        lateFinish.set(id, lf);
-        lateStart.set(id, ls);
+    // Both modes run the same date-based passes; project mode puts every task on the project calendar.
+    if (options.calendars === 'assignee' || projectStartDate) {
+        return calculateCalendarCPM(projectId, calculatedAt, buildGraph(tasks, dependencies), options);
     }
-    // --- SLACK & CRITICAL PATH ---
-    const schedules = [];
-    const criticalTaskIds = [];
-    for (const id of taskIds) {
-        const es = earlyStart.get(id) ?? 0;
-        const ef = earlyFinish.get(id) ?? 0;
-        const ls = lateStart.get(id) ?? 0;
-        const lf = lateFinish.get(id) ?? 0;
-        const rawSlack = lf - ef;
-        const totalSlack = Math.round(rawSlack * 100) / 100;
-        const isCritical = totalSlack <= 0.001;
-        if (isCritical) {
-            criticalTaskIds.push(id);
-        }
-        const task = taskMap.get(id);
-        const duration = getTaskScheduledHours(task, options.effort, options.defaultEstimateHours);
-        const earlyStartDate = projectStartDate
-            ? addWorkingHours(projectStartDate, es, schedule).toISOString()
-            : undefined;
-        const earlyFinishDate = projectStartDate
-            ? addWorkingHours(projectStartDate, ef, schedule).toISOString()
-            : undefined;
-        const lateStartDate = projectStartDate
-            ? addWorkingHours(projectStartDate, ls, schedule).toISOString()
-            : undefined;
-        const lateFinishDate = projectStartDate
-            ? addWorkingHours(projectStartDate, lf, schedule).toISOString()
-            : undefined;
-        schedules.push({
-            taskId: id,
-            earlyStart: Math.round(es * 100) / 100,
-            earlyFinish: Math.round(ef * 100) / 100,
-            lateStart: Math.round(ls * 100) / 100,
-            lateFinish: Math.round(lf * 100) / 100,
-            totalSlack,
-            isCritical,
-            durationHours: duration,
-            ...allocationField(task),
-            ...milestoneFields(task, ownDeadline.get(id), ownDeadline.has(id) ? toHours(ownDeadline.get(id)) - ef : undefined),
-            slackWorkingHours: totalSlack,
-            earlyStartDate,
-            earlyFinishDate,
-            lateStartDate,
-            lateFinishDate
-        });
-    }
-    const projectEndDate = projectStartDate
-        ? addWorkingHours(projectStartDate, totalDurationHours, schedule).toISOString()
-        : undefined;
-    return finishAnalysis({
-        projectId,
-        calculatedAt,
-        totalDurationHours: Math.round(totalDurationHours * 100) / 100,
-        totalWorkingHours: Math.round(totalDurationHours * 100) / 100,
-        projectStartDate: projectStartDate ? projectStartDate.toISOString() : undefined,
-        projectEndDate,
-        criticalTaskIds,
-        missedDeadlineTaskIds: missedDeadlines(schedules),
-        ...(graph.cyclicTaskIds.length ? { cyclicTaskIds: graph.cyclicTaskIds } : {}),
-        tasks: schedules
-    }, graph, schedule, taskIds);
+    // Without a start date there is nothing to date the schedule from. It runs from a fixed anchor and
+    // reports working-hour offsets only, which do not depend on the anchor because they count working
+    // time on the one calendar. Deadlines and start constraints are dates, so they do not apply.
+    const undatedTasks = tasks.map(({ deadline: _deadline, earliestStart: _earliestStart, ...task }) => task);
+    const analysis = calculateCalendarCPM(projectId, calculatedAt, buildGraph(undatedTasks, dependencies), {
+        ...options,
+        projectStartDate: UNDATED_ANCHOR
+    });
+    return withoutDates(analysis);
+}
+/** A Monday at UTC midnight: where an undated project-calendar schedule is laid out. */
+const UNDATED_ANCHOR = '2001-01-01T00:00:00.000Z';
+/** Drops the dates from an analysis laid out from `UNDATED_ANCHOR`, keeping working-hour offsets. */
+function withoutDates({ projectStartDate: _start, projectEndDate: _end, overallocations: _overallocations, ...analysis }) {
+    return {
+        ...analysis,
+        tasks: analysis.tasks.map(({ earlyStartDate: _es, earlyFinishDate: _ef, lateStartDate: _ls, lateFinishDate: _lf, ...task }) => task)
+    };
 }
 //# sourceMappingURL=cpm.js.map