@fbdo/smart-agentic-calendar 0.1.0

package/dist/analytics/productivity.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"productivity.d.ts","sourceRoot":"","sources":["../../src/analytics/productivity.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,oCAAoC,CAAC;AAC9E,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,wBAAwB,CAAC;AAChE,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAG1C,qBAAa,sBAAsB;IACjC,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAsB;gBAExC,aAAa,EAAE,mBAAmB;IAI9C,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,aAAa,CAAC,EAAE,IAAI,GAAG,iBAAiB;CAiCjE"}

package/dist/analytics/productivity.js

@@ -0,0 +1,34 @@
+import { resolvePeriod } from "./period.js";
+export class ProductivityCalculator {
+    analyticsRepo;
+    constructor(analyticsRepo) {
+        this.analyticsRepo = analyticsRepo;
+    }
+    compute(period, referenceDate) {
+        const range = resolvePeriod(period, referenceDate);
+        const completedTasks = this.analyticsRepo.getCompletedTasks(range.start, range.end);
+        const allOverdueTasks = this.analyticsRepo.getOverdueTasks(range.end);
+        const cancelledTasks = this.analyticsRepo.getCancelledTasks(range.start, range.end);
+        // Filter overdue tasks to those with deadline within the period
+        const overdueTasks = allOverdueTasks.filter((t) => t.deadline !== null && t.deadline >= range.start);
+        const tasksCompleted = completedTasks.length;
+        const tasksOverdue = overdueTasks.length;
+        const tasksCancelled = cancelledTasks.length;
+        const resolvedCount = tasksCompleted + tasksOverdue + tasksCancelled;
+        const completionRate = resolvedCount === 0 ? 0 : round2((tasksCompleted / resolvedCount) * 100);
+        const onTimeCount = completedTasks.filter((t) => t.wasOnTime).length;
+        const onTimeRate = completedTasks.length === 0 ? 0 : round2((onTimeCount / completedTasks.length) * 100);
+        return {
+            period,
+            tasksCompleted,
+            tasksOverdue,
+            tasksCancelled,
+            completionRate,
+            onTimeRate,
+        };
+    }
+}
+function round2(value) {
+    return Math.round(value * 100) / 100;
+}
+//# sourceMappingURL=productivity.js.map

package/dist/analytics/productivity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"productivity.js","sourceRoot":"","sources":["../../src/analytics/productivity.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAE5C,MAAM,OAAO,sBAAsB;IAChB,aAAa,CAAsB;IAEpD,YAAY,aAAkC;QAC5C,IAAI,CAAC,aAAa,GAAG,aAAa,CAAC;IACrC,CAAC;IAED,OAAO,CAAC,MAAc,EAAE,aAAoB;QAC1C,MAAM,KAAK,GAAG,aAAa,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;QAEnD,MAAM,cAAc,GAAG,IAAI,CAAC,aAAa,CAAC,iBAAiB,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;QACpF,MAAM,eAAe,GAAG,IAAI,CAAC,aAAa,CAAC,eAAe,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACtE,MAAM,cAAc,GAAG,IAAI,CAAC,aAAa,CAAC,iBAAiB,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;QAEpF,gEAAgE;QAChE,MAAM,YAAY,GAAG,eAAe,CAAC,MAAM,CACzC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,IAAI,IAAI,CAAC,CAAC,QAAQ,IAAI,KAAK,CAAC,KAAK,CACxD,CAAC;QAEF,MAAM,cAAc,GAAG,cAAc,CAAC,MAAM,CAAC;QAC7C,MAAM,YAAY,GAAG,YAAY,CAAC,MAAM,CAAC;QACzC,MAAM,cAAc,GAAG,cAAc,CAAC,MAAM,CAAC;QAE7C,MAAM,aAAa,GAAG,cAAc,GAAG,YAAY,GAAG,cAAc,CAAC;QAErE,MAAM,cAAc,GAAG,aAAa,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,cAAc,GAAG,aAAa,CAAC,GAAG,GAAG,CAAC,CAAC;QAEhG,MAAM,WAAW,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,MAAM,CAAC;QACrE,MAAM,UAAU,GACd,cAAc,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,WAAW,GAAG,cAAc,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC;QAExF,OAAO;YACL,MAAM;YACN,cAAc;YACd,YAAY;YACZ,cAAc;YACd,cAAc;YACd,UAAU;SACX,CAAC;IACJ,CAAC;CACF;AAED,SAAS,MAAM,CAAC,KAAa;IAC3B,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,GAAG,CAAC;AACvC,CAAC"}

package/dist/common/constants.d.ts

@@ -0,0 +1,13 @@
+export declare const DEFAULT_BUFFER_TIME_MINUTES = 15;
+export declare const DEFAULT_PRIORITY: "P3";
+export declare const DEFAULT_DURATION_MINUTES = 60;
+export declare const DEFAULT_SCHEDULING_HORIZON_WEEKS = 4;
+export declare const DEFAULT_MINIMUM_BLOCK_MINUTES = 30;
+export declare const DEFAULT_FOCUS_TIME_MINIMUM_BLOCK_MINUTES = 60;
+export declare const VALID_PRIORITIES: readonly ["P1", "P2", "P3", "P4"];
+export declare const VALID_STATUSES: readonly ["pending", "scheduled", "completed", "cancelled", "at_risk"];
+export declare const VALID_PERIODS: readonly ["day", "week", "month"];
+export declare const MAX_SCHEDULING_HORIZON_WEEKS = 12;
+export declare const MIN_MINIMUM_BLOCK_MINUTES = 15;
+export declare const MAX_MINIMUM_BLOCK_MINUTES = 120;
+//# sourceMappingURL=constants.d.ts.map

package/dist/common/constants.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"constants.d.ts","sourceRoot":"","sources":["../../src/common/constants.ts"],"names":[],"mappings":"AAAA,eAAO,MAAM,2BAA2B,KAAK,CAAC;AAC9C,eAAO,MAAM,gBAAgB,EAAG,IAAa,CAAC;AAC9C,eAAO,MAAM,wBAAwB,KAAK,CAAC;AAC3C,eAAO,MAAM,gCAAgC,IAAI,CAAC;AAClD,eAAO,MAAM,6BAA6B,KAAK,CAAC;AAChD,eAAO,MAAM,wCAAwC,KAAK,CAAC;AAE3D,eAAO,MAAM,gBAAgB,mCAAoC,CAAC;AAClE,eAAO,MAAM,cAAc,wEAMjB,CAAC;AACX,eAAO,MAAM,aAAa,mCAAoC,CAAC;AAE/D,eAAO,MAAM,4BAA4B,KAAK,CAAC;AAC/C,eAAO,MAAM,yBAAyB,KAAK,CAAC;AAC5C,eAAO,MAAM,yBAAyB,MAAM,CAAC"}

package/dist/common/constants.js

@@ -0,0 +1,19 @@
+export const DEFAULT_BUFFER_TIME_MINUTES = 15;
+export const DEFAULT_PRIORITY = "P3";
+export const DEFAULT_DURATION_MINUTES = 60;
+export const DEFAULT_SCHEDULING_HORIZON_WEEKS = 4;
+export const DEFAULT_MINIMUM_BLOCK_MINUTES = 30;
+export const DEFAULT_FOCUS_TIME_MINIMUM_BLOCK_MINUTES = 60;
+export const VALID_PRIORITIES = ["P1", "P2", "P3", "P4"];
+export const VALID_STATUSES = [
+    "pending",
+    "scheduled",
+    "completed",
+    "cancelled",
+    "at_risk",
+];
+export const VALID_PERIODS = ["day", "week", "month"];
+export const MAX_SCHEDULING_HORIZON_WEEKS = 12;
+export const MIN_MINIMUM_BLOCK_MINUTES = 15;
+export const MAX_MINIMUM_BLOCK_MINUTES = 120;
+//# sourceMappingURL=constants.js.map

package/dist/common/constants.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"constants.js","sourceRoot":"","sources":["../../src/common/constants.ts"],"names":[],"mappings":"AAAA,MAAM,CAAC,MAAM,2BAA2B,GAAG,EAAE,CAAC;AAC9C,MAAM,CAAC,MAAM,gBAAgB,GAAG,IAAa,CAAC;AAC9C,MAAM,CAAC,MAAM,wBAAwB,GAAG,EAAE,CAAC;AAC3C,MAAM,CAAC,MAAM,gCAAgC,GAAG,CAAC,CAAC;AAClD,MAAM,CAAC,MAAM,6BAA6B,GAAG,EAAE,CAAC;AAChD,MAAM,CAAC,MAAM,wCAAwC,GAAG,EAAE,CAAC;AAE3D,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAU,CAAC;AAClE,MAAM,CAAC,MAAM,cAAc,GAAG;IAC5B,SAAS;IACT,WAAW;IACX,WAAW;IACX,WAAW;IACX,SAAS;CACD,CAAC;AACX,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAU,CAAC;AAE/D,MAAM,CAAC,MAAM,4BAA4B,GAAG,EAAE,CAAC;AAC/C,MAAM,CAAC,MAAM,yBAAyB,GAAG,EAAE,CAAC;AAC5C,MAAM,CAAC,MAAM,yBAAyB,GAAG,GAAG,CAAC"}

package/dist/common/id.d.ts

@@ -0,0 +1,2 @@
+export declare function generateId(): string;
+//# sourceMappingURL=id.d.ts.map

package/dist/common/id.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"id.d.ts","sourceRoot":"","sources":["../../src/common/id.ts"],"names":[],"mappings":"AAEA,wBAAgB,UAAU,IAAI,MAAM,CAEnC"}

package/dist/common/id.js

@@ -0,0 +1,5 @@
+import { randomUUID } from "node:crypto";
+export function generateId() {
+    return randomUUID();
+}
+//# sourceMappingURL=id.js.map

package/dist/common/id.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"id.js","sourceRoot":"","sources":["../../src/common/id.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEzC,MAAM,UAAU,UAAU;IACxB,OAAO,UAAU,EAAE,CAAC;AACtB,CAAC"}

package/dist/common/time.d.ts

@@ -0,0 +1,11 @@
+export declare function toUTC(date: Date): string;
+export declare function parseUTC(isoString: string): Date;
+export declare function isValidISO8601(str: string): boolean;
+export declare function isValidTimeHHMM(str: string): boolean;
+export declare function isValidDateYYYYMMDD(str: string): boolean;
+export declare function nowUTC(): string;
+export declare function startOfDay(isoString: string): string;
+export declare function endOfDay(isoString: string): string;
+export declare function addMinutes(isoString: string, minutes: number): string;
+export declare function diffMinutes(start: string, end: string): number;
+//# sourceMappingURL=time.d.ts.map

package/dist/common/time.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"time.d.ts","sourceRoot":"","sources":["../../src/common/time.ts"],"names":[],"mappings":"AAAA,wBAAgB,KAAK,CAAC,IAAI,EAAE,IAAI,GAAG,MAAM,CAExC;AAED,wBAAgB,QAAQ,CAAC,SAAS,EAAE,MAAM,GAAG,IAAI,CAShD;AAED,wBAAgB,cAAc,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAanD;AAED,wBAAgB,eAAe,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAIpD;AAED,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAQxD;AAED,wBAAgB,MAAM,IAAI,MAAM,CAE/B;AAED,wBAAgB,UAAU,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,CAIpD;AAED,wBAAgB,QAAQ,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,CAIlD;AAED,wBAAgB,UAAU,CAAC,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,CAIrE;AAED,wBAAgB,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAI9D"}

package/dist/common/time.js

@@ -0,0 +1,67 @@
+export function toUTC(date) {
+    return date.toISOString();
+}
+export function parseUTC(isoString) {
+    if (!isoString) {
+        throw new Error("Invalid ISO 8601 string: empty");
+    }
+    const date = new Date(isoString);
+    if (isNaN(date.getTime())) {
+        throw new Error(`Invalid ISO 8601 string: ${isoString}`);
+    }
+    return date;
+}
+export function isValidISO8601(str) {
+    if (!str)
+        return false;
+    const date = new Date(str);
+    if (isNaN(date.getTime()))
+        return false;
+    // Verify it round-trips reasonably (rejects things like month 13)
+    const isoRegex = /^\d{4}-\d{2}-\d{2}T\d{2}:\d{2}:\d{2}(\.\d+)?Z$/;
+    if (!isoRegex.test(str))
+        return false;
+    // Verify the parsed date components match the input
+    const [datePart] = str.split("T");
+    const [year, month, day] = datePart.split("-").map(Number);
+    return (date.getUTCFullYear() === year && date.getUTCMonth() + 1 === month && date.getUTCDate() === day);
+}
+export function isValidTimeHHMM(str) {
+    if (!/^\d{2}:\d{2}$/.test(str))
+        return false;
+    const [hours, minutes] = str.split(":").map(Number);
+    return hours >= 0 && hours <= 23 && minutes >= 0 && minutes <= 59;
+}
+export function isValidDateYYYYMMDD(str) {
+    if (!/^\d{4}-\d{2}-\d{2}$/.test(str))
+        return false;
+    const [year, month, day] = str.split("-").map(Number);
+    if (month < 1 || month > 12 || day < 1 || day > 31)
+        return false;
+    const date = new Date(Date.UTC(year, month - 1, day));
+    return (date.getUTCFullYear() === year && date.getUTCMonth() + 1 === month && date.getUTCDate() === day);
+}
+export function nowUTC() {
+    return new Date().toISOString();
+}
+export function startOfDay(isoString) {
+    const date = parseUTC(isoString);
+    date.setUTCHours(0, 0, 0, 0);
+    return date.toISOString();
+}
+export function endOfDay(isoString) {
+    const date = parseUTC(isoString);
+    date.setUTCHours(23, 59, 59, 999);
+    return date.toISOString();
+}
+export function addMinutes(isoString, minutes) {
+    const date = parseUTC(isoString);
+    date.setTime(date.getTime() + minutes * 60_000);
+    return date.toISOString();
+}
+export function diffMinutes(start, end) {
+    const startDate = parseUTC(start);
+    const endDate = parseUTC(end);
+    return (endDate.getTime() - startDate.getTime()) / 60_000;
+}
+//# sourceMappingURL=time.js.map

package/dist/common/time.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"time.js","sourceRoot":"","sources":["../../src/common/time.ts"],"names":[],"mappings":"AAAA,MAAM,UAAU,KAAK,CAAC,IAAU;IAC9B,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC;AAC5B,CAAC;AAED,MAAM,UAAU,QAAQ,CAAC,SAAiB;IACxC,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;IACpD,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC;IACjC,IAAI,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC;QAC1B,MAAM,IAAI,KAAK,CAAC,4BAA4B,SAAS,EAAE,CAAC,CAAC;IAC3D,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,GAAW;IACxC,IAAI,CAAC,GAAG;QAAE,OAAO,KAAK,CAAC;IACvB,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC;IAC3B,IAAI,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;QAAE,OAAO,KAAK,CAAC;IACxC,kEAAkE;IAClE,MAAM,QAAQ,GAAG,gDAAgD,CAAC;IAClE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IACtC,oDAAoD;IACpD,MAAM,CAAC,QAAQ,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAClC,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC3D,OAAO,CACL,IAAI,CAAC,cAAc,EAAE,KAAK,IAAI,IAAI,IAAI,CAAC,WAAW,EAAE,GAAG,CAAC,KAAK,KAAK,IAAI,IAAI,CAAC,UAAU,EAAE,KAAK,GAAG,CAChG,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,GAAW;IACzC,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IAC7C,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACpD,OAAO,KAAK,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE,IAAI,OAAO,IAAI,CAAC,IAAI,OAAO,IAAI,EAAE,CAAC;AACpE,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,GAAW;IAC7C,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IACnD,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACtD,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,EAAE,IAAI,GAAG,GAAG,CAAC,IAAI,GAAG,GAAG,EAAE;QAAE,OAAO,KAAK,CAAC;IACjE,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IACtD,OAAO,CACL,IAAI,CAAC,cAAc,EAAE,KAAK,IAAI,IAAI,IAAI,CAAC,WAAW,EAAE,GAAG,CAAC,KAAK,KAAK,IAAI,IAAI,CAAC,UAAU,EAAE,KAAK,GAAG,CAChG,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,MAAM;IACpB,OAAO,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;AAClC,CAAC;AAED,MAAM,UAAU,UAAU,CAAC,SAAiB;IAC1C,MAAM,IAAI,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;IACjC,IAAI,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7B,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC;AAC5B,CAAC;AAED,MAAM,UAAU,QAAQ,CAAC,SAAiB;IACxC,MAAM,IAAI,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;IACjC,IAAI,CAAC,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;IAClC,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC;AAC5B,CAAC;AAED,MAAM,UAAU,UAAU,CAAC,SAAiB,EAAE,OAAe;IAC3D,MAAM,IAAI,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC;IACjC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,OAAO,GAAG,MAAM,CAAC,CAAC;IAChD,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC;AAC5B,CAAC;AAED,MAAM,UAAU,WAAW,CAAC,KAAa,EAAE,GAAW;IACpD,MAAM,SAAS,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;IAClC,MAAM,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;IAC9B,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,GAAG,SAAS,CAAC,OAAO,EAAE,CAAC,GAAG,MAAM,CAAC;AAC5D,CAAC"}

package/dist/engine/conflict-detector.d.ts

@@ -0,0 +1,22 @@
+import type { Task, TaskPriority } from "../models/task.js";
+import type { TimeBlock } from "../models/schedule.js";
+import type { Availability } from "../models/config.js";
+import type { Conflict, DeprioritizationSuggestion } from "../models/conflict.js";
+import type { DependencyEdge } from "../models/dependency.js";
+interface CompetingTask {
+    taskId: string;
+    priority: TaskPriority;
+    deadline: string | null;
+    scheduledMinutes: number;
+}
+export declare class ConflictDetector {
+    detectConflicts(tasks: Task[], timeBlocks: TimeBlock[], _availability: Availability, dependencies: DependencyEdge[], now: Date): Conflict[];
+    suggestDeprioritizations(atRiskTask: Task, competingTasks: CompetingTask[], requiredMinutes: number): DeprioritizationSuggestion[];
+    findCompetingTasks(atRiskTask: Task, timeBlocks: TimeBlock[], allTasks: Task[]): CompetingTask[];
+    private getScheduledMinutes;
+    private computeAvailableMinutesBeforeDeadline;
+    private computeDependencyChainDuration;
+    private getDependencyChainIds;
+}
+export {};
+//# sourceMappingURL=conflict-detector.d.ts.map

package/dist/engine/conflict-detector.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"conflict-detector.d.ts","sourceRoot":"","sources":["../../src/engine/conflict-detector.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAC5D,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AACxD,OAAO,KAAK,EAAE,QAAQ,EAAE,0BAA0B,EAAE,MAAM,uBAAuB,CAAC;AAClF,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAU9D,UAAU,aAAa;IACrB,MAAM,EAAE,MAAM,CAAC;IACf,QAAQ,EAAE,YAAY,CAAC;IACvB,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB,gBAAgB,EAAE,MAAM,CAAC;CAC1B;AAED,qBAAa,gBAAgB;IAC3B,eAAe,CACb,KAAK,EAAE,IAAI,EAAE,EACb,UAAU,EAAE,SAAS,EAAE,EACvB,aAAa,EAAE,YAAY,EAC3B,YAAY,EAAE,cAAc,EAAE,EAC9B,GAAG,EAAE,IAAI,GACR,QAAQ,EAAE;IA2Eb,wBAAwB,CACtB,UAAU,EAAE,IAAI,EAChB,cAAc,EAAE,aAAa,EAAE,EAC/B,eAAe,EAAE,MAAM,GACtB,0BAA0B,EAAE;IAmC/B,kBAAkB,CAAC,UAAU,EAAE,IAAI,EAAE,UAAU,EAAE,SAAS,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,aAAa,EAAE;IAqChG,OAAO,CAAC,mBAAmB;IAM3B,OAAO,CAAC,qCAAqC;IAO7C,OAAO,CAAC,8BAA8B;IAqCtC,OAAO,CAAC,qBAAqB;CA8B9B"}

package/dist/engine/conflict-detector.js

@@ -0,0 +1,194 @@
+import { diffMinutes } from "../common/time.js";
+const PRIORITY_RANK = {
+    P1: 1,
+    P2: 2,
+    P3: 3,
+    P4: 4,
+};
+export class ConflictDetector {
+    detectConflicts(tasks, timeBlocks, _availability, dependencies, now) {
+        const conflicts = [];
+        for (const task of tasks) {
+            if (task.status === "completed" || task.status === "cancelled") {
+                continue;
+            }
+            // Check 1: Overdue
+            if (task.deadline && new Date(task.deadline) < now) {
+                const scheduledMinutes = this.getScheduledMinutes(task.id, timeBlocks);
+                conflicts.push({
+                    taskId: task.id,
+                    reason: "overdue",
+                    deadline: task.deadline,
+                    requiredMinutes: task.duration,
+                    availableMinutes: scheduledMinutes,
+                    competingTaskIds: [],
+                    suggestions: [],
+                });
+                continue;
+            }
+            // Tasks with no deadline can't have deadline-based conflicts
+            if (!task.deadline) {
+                continue;
+            }
+            // Check 2: Dependency chain infeasibility
+            const chainDuration = this.computeDependencyChainDuration(task, tasks, dependencies);
+            if (chainDuration > 0) {
+                const hoursAvailable = this.computeAvailableMinutesBeforeDeadline(now, new Date(task.deadline));
+                if (chainDuration > hoursAvailable) {
+                    const chainIds = this.getDependencyChainIds(task, tasks, dependencies);
+                    conflicts.push({
+                        taskId: task.id,
+                        reason: "dependency_chain",
+                        deadline: task.deadline,
+                        requiredMinutes: chainDuration,
+                        availableMinutes: hoursAvailable,
+                        competingTaskIds: chainIds,
+                        suggestions: [],
+                    });
+                    continue;
+                }
+            }
+            // Check 3: Insufficient time
+            const scheduledMinutes = this.getScheduledMinutes(task.id, timeBlocks);
+            if (scheduledMinutes < task.duration) {
+                const competing = this.findCompetingTasks(task, timeBlocks, tasks);
+                const requiredMinutes = task.duration - scheduledMinutes;
+                const suggestions = this.suggestDeprioritizations(task, competing, requiredMinutes);
+                conflicts.push({
+                    taskId: task.id,
+                    reason: "insufficient_time",
+                    deadline: task.deadline,
+                    requiredMinutes,
+                    availableMinutes: this.computeAvailableMinutesBeforeDeadline(now, new Date(task.deadline)),
+                    competingTaskIds: competing.map((c) => c.taskId),
+                    suggestions,
+                });
+            }
+        }
+        return conflicts;
+    }
+    suggestDeprioritizations(atRiskTask, competingTasks, requiredMinutes) {
+        // Filter: never suggest deprioritizing a task with a nearer deadline
+        const filtered = competingTasks.filter((t) => {
+            if (!t.deadline || !atRiskTask.deadline)
+                return true;
+            return new Date(t.deadline) > new Date(atRiskTask.deadline);
+        });
+        // Sort: lowest priority first (P4 before P3), then furthest deadline first
+        const sorted = [...filtered].sort((a, b) => {
+            const priorityDiff = (PRIORITY_RANK[b.priority] ?? 99) - (PRIORITY_RANK[a.priority] ?? 99);
+            if (priorityDiff !== 0)
+                return priorityDiff;
+            const aDeadline = a.deadline ? new Date(a.deadline).getTime() : Number.MAX_SAFE_INTEGER;
+            const bDeadline = b.deadline ? new Date(b.deadline).getTime() : Number.MAX_SAFE_INTEGER;
+            return bDeadline - aDeadline;
+        });
+        const suggestions = [];
+        let freedMinutes = 0;
+        for (const task of sorted) {
+            suggestions.push({
+                taskId: task.taskId,
+                currentPriority: task.priority,
+                freedMinutes: task.scheduledMinutes,
+            });
+            freedMinutes += task.scheduledMinutes;
+            if (freedMinutes >= requiredMinutes) {
+                break;
+            }
+        }
+        return suggestions;
+    }
+    findCompetingTasks(atRiskTask, timeBlocks, allTasks) {
+        if (!atRiskTask.deadline)
+            return [];
+        const deadline = new Date(atRiskTask.deadline);
+        const taskMap = new Map();
+        for (const task of allTasks) {
+            taskMap.set(task.id, task);
+        }
+        // Find blocks that occupy time before the at-risk task's deadline
+        const competingBlocks = timeBlocks.filter((b) => b.taskId !== atRiskTask.id && new Date(b.endTime) <= deadline);
+        // Group by taskId and sum scheduled time
+        const minutesByTask = new Map();
+        for (const block of competingBlocks) {
+            const minutes = diffMinutes(block.startTime, block.endTime);
+            minutesByTask.set(block.taskId, (minutesByTask.get(block.taskId) ?? 0) + minutes);
+        }
+        const result = [];
+        for (const [taskId, scheduledMinutes] of minutesByTask) {
+            const task = taskMap.get(taskId);
+            if (task) {
+                result.push({
+                    taskId,
+                    priority: task.priority,
+                    deadline: task.deadline,
+                    scheduledMinutes,
+                });
+            }
+        }
+        return result;
+    }
+    getScheduledMinutes(taskId, timeBlocks) {
+        return timeBlocks
+            .filter((b) => b.taskId === taskId)
+            .reduce((sum, b) => sum + diffMinutes(b.startTime, b.endTime), 0);
+    }
+    computeAvailableMinutesBeforeDeadline(now, deadline) {
+        // Rough estimate: total minutes between now and deadline
+        // A more accurate calculation would factor in availability windows,
+        // but for conflict reporting this provides a useful upper bound
+        return Math.max(0, (deadline.getTime() - now.getTime()) / 60_000);
+    }
+    computeDependencyChainDuration(task, allTasks, dependencies) {
+        const taskMap = new Map();
+        for (const t of allTasks) {
+            taskMap.set(t.id, t);
+        }
+        // Walk backwards through dependencies, summing durations
+        const visited = new Set();
+        let totalDuration = 0;
+        const walk = (taskId) => {
+            if (visited.has(taskId))
+                return;
+            visited.add(taskId);
+            const deps = dependencies.filter((d) => d.taskId === taskId);
+            for (const dep of deps) {
+                const depTask = taskMap.get(dep.dependsOnId);
+                if (depTask && depTask.status !== "completed") {
+                    totalDuration += depTask.duration;
+                    walk(dep.dependsOnId);
+                }
+            }
+        };
+        walk(task.id);
+        // Include the task itself
+        if (totalDuration > 0) {
+            totalDuration += task.duration;
+        }
+        return totalDuration;
+    }
+    getDependencyChainIds(task, allTasks, dependencies) {
+        const taskMap = new Map();
+        for (const t of allTasks) {
+            taskMap.set(t.id, t);
+        }
+        const visited = new Set();
+        const chainIds = [];
+        const walk = (taskId) => {
+            if (visited.has(taskId))
+                return;
+            visited.add(taskId);
+            const deps = dependencies.filter((d) => d.taskId === taskId);
+            for (const dep of deps) {
+                const depTask = taskMap.get(dep.dependsOnId);
+                if (depTask && depTask.status !== "completed") {
+                    chainIds.push(dep.dependsOnId);
+                    walk(dep.dependsOnId);
+                }
+            }
+        };
+        walk(task.id);
+        return chainIds;
+    }
+}
+//# sourceMappingURL=conflict-detector.js.map

package/dist/engine/conflict-detector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"conflict-detector.js","sourceRoot":"","sources":["../../src/engine/conflict-detector.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAEhD,MAAM,aAAa,GAA2B;IAC5C,EAAE,EAAE,CAAC;IACL,EAAE,EAAE,CAAC;IACL,EAAE,EAAE,CAAC;IACL,EAAE,EAAE,CAAC;CACN,CAAC;AASF,MAAM,OAAO,gBAAgB;IAC3B,eAAe,CACb,KAAa,EACb,UAAuB,EACvB,aAA2B,EAC3B,YAA8B,EAC9B,GAAS;QAET,MAAM,SAAS,GAAe,EAAE,CAAC;QAEjC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,MAAM,KAAK,WAAW,IAAI,IAAI,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;gBAC/D,SAAS;YACX,CAAC;YAED,mBAAmB;YACnB,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,GAAG,EAAE,CAAC;gBACnD,MAAM,gBAAgB,GAAG,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;gBACvE,SAAS,CAAC,IAAI,CAAC;oBACb,MAAM,EAAE,IAAI,CAAC,EAAE;oBACf,MAAM,EAAE,SAAS;oBACjB,QAAQ,EAAE,IAAI,CAAC,QAAQ;oBACvB,eAAe,EAAE,IAAI,CAAC,QAAQ;oBAC9B,gBAAgB,EAAE,gBAAgB;oBAClC,gBAAgB,EAAE,EAAE;oBACpB,WAAW,EAAE,EAAE;iBAChB,CAAC,CAAC;gBACH,SAAS;YACX,CAAC;YAED,6DAA6D;YAC7D,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACnB,SAAS;YACX,CAAC;YAED,0CAA0C;YAC1C,MAAM,aAAa,GAAG,IAAI,CAAC,8BAA8B,CAAC,IAAI,EAAE,KAAK,EAAE,YAAY,CAAC,CAAC;YACrF,IAAI,aAAa,GAAG,CAAC,EAAE,CAAC;gBACtB,MAAM,cAAc,GAAG,IAAI,CAAC,qCAAqC,CAC/D,GAAG,EACH,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CACxB,CAAC;gBACF,IAAI,aAAa,GAAG,cAAc,EAAE,CAAC;oBACnC,MAAM,QAAQ,GAAG,IAAI,CAAC,qBAAqB,CAAC,IAAI,EAAE,KAAK,EAAE,YAAY,CAAC,CAAC;oBACvE,SAAS,CAAC,IAAI,CAAC;wBACb,MAAM,EAAE,IAAI,CAAC,EAAE;wBACf,MAAM,EAAE,kBAAkB;wBAC1B,QAAQ,EAAE,IAAI,CAAC,QAAQ;wBACvB,eAAe,EAAE,aAAa;wBAC9B,gBAAgB,EAAE,cAAc;wBAChC,gBAAgB,EAAE,QAAQ;wBAC1B,WAAW,EAAE,EAAE;qBAChB,CAAC,CAAC;oBACH,SAAS;gBACX,CAAC;YACH,CAAC;YAED,6BAA6B;YAC7B,MAAM,gBAAgB,GAAG,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;YACvE,IAAI,gBAAgB,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACrC,MAAM,SAAS,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;gBACnE,MAAM,eAAe,GAAG,IAAI,CAAC,QAAQ,GAAG,gBAAgB,CAAC;gBACzD,MAAM,WAAW,GAAG,IAAI,CAAC,wBAAwB,CAAC,IAAI,EAAE,SAAS,EAAE,eAAe,CAAC,CAAC;gBAEpF,SAAS,CAAC,IAAI,CAAC;oBACb,MAAM,EAAE,IAAI,CAAC,EAAE;oBACf,MAAM,EAAE,mBAAmB;oBAC3B,QAAQ,EAAE,IAAI,CAAC,QAAQ;oBACvB,eAAe;oBACf,gBAAgB,EAAE,IAAI,CAAC,qCAAqC,CAC1D,GAAG,EACH,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CACxB;oBACD,gBAAgB,EAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;oBAChD,WAAW;iBACZ,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,wBAAwB,CACtB,UAAgB,EAChB,cAA+B,EAC/B,eAAuB;QAEvB,qEAAqE;QACrE,MAAM,QAAQ,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;YAC3C,IAAI,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,UAAU,CAAC,QAAQ;gBAAE,OAAO,IAAI,CAAC;YACrD,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,IAAI,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;QAC9D,CAAC,CAAC,CAAC;QAEH,2EAA2E;QAC3E,MAAM,MAAM,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACzC,MAAM,YAAY,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;YAC3F,IAAI,YAAY,KAAK,CAAC;gBAAE,OAAO,YAAY,CAAC;YAE5C,MAAM,SAAS,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,gBAAgB,CAAC;YACxF,MAAM,SAAS,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,gBAAgB,CAAC;YACxF,OAAO,SAAS,GAAG,SAAS,CAAC;QAC/B,CAAC,CAAC,CAAC;QAEH,MAAM,WAAW,GAAiC,EAAE,CAAC;QACrD,IAAI,YAAY,GAAG,CAAC,CAAC;QAErB,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;YAC1B,WAAW,CAAC,IAAI,CAAC;gBACf,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,eAAe,EAAE,IAAI,CAAC,QAAQ;gBAC9B,YAAY,EAAE,IAAI,CAAC,gBAAgB;aACpC,CAAC,CAAC;YACH,YAAY,IAAI,IAAI,CAAC,gBAAgB,CAAC;YACtC,IAAI,YAAY,IAAI,eAAe,EAAE,CAAC;gBACpC,MAAM;YACR,CAAC;QACH,CAAC;QAED,OAAO,WAAW,CAAC;IACrB,CAAC;IAED,kBAAkB,CAAC,UAAgB,EAAE,UAAuB,EAAE,QAAgB;QAC5E,IAAI,CAAC,UAAU,CAAC,QAAQ;YAAE,OAAO,EAAE,CAAC;QAEpC,MAAM,QAAQ,GAAG,IAAI,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;QAC/C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAgB,CAAC;QACxC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC7B,CAAC;QAED,kEAAkE;QAClE,MAAM,eAAe,GAAG,UAAU,CAAC,MAAM,CACvC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,UAAU,CAAC,EAAE,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,QAAQ,CACrE,CAAC;QAEF,yCAAyC;QACzC,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;QAChD,KAAK,MAAM,KAAK,IAAI,eAAe,EAAE,CAAC;YACpC,MAAM,OAAO,GAAG,WAAW,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;YAC5D,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC;QACpF,CAAC;QAED,MAAM,MAAM,GAAoB,EAAE,CAAC;QACnC,KAAK,MAAM,CAAC,MAAM,EAAE,gBAAgB,CAAC,IAAI,aAAa,EAAE,CAAC;YACvD,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACjC,IAAI,IAAI,EAAE,CAAC;gBACT,MAAM,CAAC,IAAI,CAAC;oBACV,MAAM;oBACN,QAAQ,EAAE,IAAI,CAAC,QAAQ;oBACvB,QAAQ,EAAE,IAAI,CAAC,QAAQ;oBACvB,gBAAgB;iBACjB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAEO,mBAAmB,CAAC,MAAc,EAAE,UAAuB;QACjE,OAAO,UAAU;aACd,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC;aAClC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,WAAW,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;IACtE,CAAC;IAEO,qCAAqC,CAAC,GAAS,EAAE,QAAc;QACrE,yDAAyD;QACzD,oEAAoE;QACpE,gEAAgE;QAChE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,OAAO,EAAE,GAAG,GAAG,CAAC,OAAO,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC;IACpE,CAAC;IAEO,8BAA8B,CACpC,IAAU,EACV,QAAgB,EAChB,YAA8B;QAE9B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAgB,CAAC;QACxC,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACvB,CAAC;QAED,yDAAyD;QACzD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,IAAI,aAAa,GAAG,CAAC,CAAC;QAEtB,MAAM,IAAI,GAAG,CAAC,MAAc,EAAQ,EAAE;YACpC,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,OAAO;YAChC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAEpB,MAAM,IAAI,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;YAC7D,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;gBAC7C,IAAI,OAAO,IAAI,OAAO,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;oBAC9C,aAAa,IAAI,OAAO,CAAC,QAAQ,CAAC;oBAClC,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;gBACxB,CAAC;YACH,CAAC;QACH,CAAC,CAAC;QAEF,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACd,0BAA0B;QAC1B,IAAI,aAAa,GAAG,CAAC,EAAE,CAAC;YACtB,aAAa,IAAI,IAAI,CAAC,QAAQ,CAAC;QACjC,CAAC;QAED,OAAO,aAAa,CAAC;IACvB,CAAC;IAEO,qBAAqB,CAC3B,IAAU,EACV,QAAgB,EAChB,YAA8B;QAE9B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAgB,CAAC;QACxC,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACzB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACvB,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,QAAQ,GAAa,EAAE,CAAC;QAE9B,MAAM,IAAI,GAAG,CAAC,MAAc,EAAQ,EAAE;YACpC,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;gBAAE,OAAO;YAChC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAEpB,MAAM,IAAI,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;YAC7D,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;gBAC7C,IAAI,OAAO,IAAI,OAAO,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;oBAC9C,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;oBAC/B,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;gBACxB,CAAC;YACH,CAAC;QACH,CAAC,CAAC;QAEF,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACd,OAAO,QAAQ,CAAC;IAClB,CAAC;CACF"}

package/dist/engine/dependency-resolver.d.ts

@@ -0,0 +1,8 @@
+import type { Task } from "../models/task.js";
+import type { DependencyEdge } from "../models/dependency.js";
+export declare class DependencyResolver {
+    validateNoCycles(taskId: string, dependsOnId: string, existingDeps: DependencyEdge[]): boolean;
+    topologicalSort(tasks: Task[], dependencies: DependencyEdge[]): Task[];
+    getBlockedTasks(tasks: Task[], dependencies: DependencyEdge[]): Task[];
+}
+//# sourceMappingURL=dependency-resolver.d.ts.map

package/dist/engine/dependency-resolver.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency-resolver.d.ts","sourceRoot":"","sources":["../../src/engine/dependency-resolver.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,mBAAmB,CAAC;AAC9C,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AA2E9D,qBAAa,kBAAkB;IAC7B,gBAAgB,CAAC,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,YAAY,EAAE,cAAc,EAAE,GAAG,OAAO;IAuD9F,eAAe,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,YAAY,EAAE,cAAc,EAAE,GAAG,IAAI,EAAE;IAoCtE,eAAe,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,YAAY,EAAE,cAAc,EAAE,GAAG,IAAI,EAAE;CAqBvE"}

package/dist/engine/dependency-resolver.js

@@ -0,0 +1,160 @@
+import { CircularDependencyError, ValidationError } from "../models/errors.js";
+const PRIORITY_RANK = {
+    P1: 1,
+    P2: 2,
+    P3: 3,
+    P4: 4,
+};
+function buildAdjacencyMap(edges) {
+    const adj = new Map();
+    for (const edge of edges) {
+        const deps = adj.get(edge.dependsOnId) ?? [];
+        deps.push(edge.taskId);
+        adj.set(edge.dependsOnId, deps);
+    }
+    return adj;
+}
+function taskSortKey(task) {
+    const priority = PRIORITY_RANK[task.priority] ?? 99;
+    const deadline = task.deadline ? new Date(task.deadline).getTime() : Number.MAX_SAFE_INTEGER;
+    return [priority, deadline, task.duration];
+}
+function compareTasks(a, b) {
+    const [ap, ad, adur] = taskSortKey(a);
+    const [bp, bd, bdur] = taskSortKey(b);
+    return ap - bp || ad - bd || adur - bdur;
+}
+function buildInDegreeAndQueue(tasks, dependencies, taskMap) {
+    const inDegree = new Map();
+    for (const task of tasks) {
+        inDegree.set(task.id, 0);
+    }
+    for (const edge of dependencies) {
+        if (taskMap.has(edge.taskId)) {
+            inDegree.set(edge.taskId, (inDegree.get(edge.taskId) ?? 0) + 1);
+        }
+    }
+    const queue = [];
+    for (const task of tasks) {
+        if ((inDegree.get(task.id) ?? 0) === 0) {
+            queue.push(task);
+        }
+    }
+    queue.sort(compareTasks);
+    return { inDegree, queue };
+}
+function insertSorted(queue, task) {
+    const key = taskSortKey(task);
+    let insertIdx = queue.length;
+    for (let i = 0; i < queue.length; i++) {
+        const qKey = taskSortKey(queue[i]);
+        if (key[0] < qKey[0] ||
+            (key[0] === qKey[0] && key[1] < qKey[1]) ||
+            (key[0] === qKey[0] && key[1] === qKey[1] && key[2] < qKey[2])) {
+            insertIdx = i;
+            break;
+        }
+    }
+    queue.splice(insertIdx, 0, task);
+}
+export class DependencyResolver {
+    validateNoCycles(taskId, dependsOnId, existingDeps) {
+        if (taskId === dependsOnId) {
+            throw new ValidationError("a task cannot depend on itself");
+        }
+        // Check: can we reach taskId starting from dependsOnId via existing edges?
+        // Edges go: dependsOnId → taskId (dependsOn direction)
+        // We need to traverse: from dependsOnId, follow "who depends on this node" edges
+        // If we can reach taskId, then adding taskId→dependsOnId creates a cycle.
+        //
+        // Actually, rethink: edges represent "taskId depends on dependsOnId".
+        // To check if adding (taskId depends on dependsOnId) creates a cycle,
+        // we need to check: can we reach dependsOnId from taskId via existing dependency chains?
+        // i.e., does taskId have a path TO dependsOnId through existing edges?
+        // An edge { taskId: X, dependsOnId: Y } means X depends on Y, so X comes after Y.
+        // Following "depends on" from taskId: taskId → its dependencies → their dependencies → ...
+        // If we find dependsOnId in that chain, adding dependsOnId as another dependency of taskId
+        // doesn't create a cycle (it's just adding a redundant path).
+        //
+        // The cycle occurs if dependsOnId can reach taskId via "depends on" edges.
+        // i.e., dependsOnId depends on ... depends on taskId. Then adding taskId depends on dependsOnId
+        // closes the loop.
+        //
+        // Build reverse lookup: for each node, what does it depend on?
+        const dependsOnMap = new Map();
+        for (const edge of existingDeps) {
+            const deps = dependsOnMap.get(edge.taskId) ?? [];
+            deps.push(edge.dependsOnId);
+            dependsOnMap.set(edge.taskId, deps);
+        }
+        // DFS from dependsOnId, following "dependsOn" edges, looking for taskId
+        const visited = new Set();
+        const stack = [dependsOnId];
+        const path = [];
+        while (stack.length > 0) {
+            const current = stack.pop();
+            if (current === taskId) {
+                throw new CircularDependencyError([taskId, ...path, current]);
+            }
+            if (visited.has(current)) {
+                continue;
+            }
+            visited.add(current);
+            path.push(current);
+            const neighbors = dependsOnMap.get(current) ?? [];
+            for (const neighbor of neighbors) {
+                stack.push(neighbor);
+            }
+        }
+        return true;
+    }
+    topologicalSort(tasks, dependencies) {
+        if (tasks.length === 0)
+            return [];
+        const taskMap = new Map();
+        for (const task of tasks) {
+            taskMap.set(task.id, task);
+        }
+        const adj = buildAdjacencyMap(dependencies);
+        const { inDegree, queue } = buildInDegreeAndQueue(tasks, dependencies, taskMap);
+        const result = [];
+        while (queue.length > 0) {
+            const node = queue.shift();
+            result.push(node);
+            for (const depId of adj.get(node.id) ?? []) {
+                const depTask = taskMap.get(depId);
+                if (!depTask)
+                    continue;
+                const newDegree = (inDegree.get(depId) ?? 1) - 1;
+                inDegree.set(depId, newDegree);
+                if (newDegree === 0) {
+                    insertSorted(queue, depTask);
+                }
+            }
+        }
+        if (result.length < tasks.length) {
+            const remainingIds = tasks.filter((t) => !result.includes(t)).map((t) => t.id);
+            throw new CircularDependencyError(remainingIds);
+        }
+        return result;
+    }
+    getBlockedTasks(tasks, dependencies) {
+        const taskMap = new Map();
+        for (const task of tasks) {
+            taskMap.set(task.id, task);
+        }
+        const blocked = [];
+        for (const task of tasks) {
+            const deps = dependencies.filter((d) => d.taskId === task.id);
+            for (const dep of deps) {
+                const depTask = taskMap.get(dep.dependsOnId);
+                if (depTask && depTask.status !== "completed") {
+                    blocked.push(task);
+                    break;
+                }
+            }
+        }
+        return blocked;
+    }
+}
+//# sourceMappingURL=dependency-resolver.js.map

package/dist/engine/dependency-resolver.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency-resolver.js","sourceRoot":"","sources":["../../src/engine/dependency-resolver.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,uBAAuB,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAE/E,MAAM,aAAa,GAA2B;IAC5C,EAAE,EAAE,CAAC;IACL,EAAE,EAAE,CAAC;IACL,EAAE,EAAE,CAAC;IACL,EAAE,EAAE,CAAC;CACN,CAAC;AAEF,SAAS,iBAAiB,CAAC,KAAuB;IAChD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoB,CAAC;IACxC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;QAC7C,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACvB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;IAClC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,WAAW,CAAC,IAAU;IAC7B,MAAM,QAAQ,GAAG,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;IACpD,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,gBAAgB,CAAC;IAC7F,OAAO,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;AAC7C,CAAC;AAED,SAAS,YAAY,CAAC,CAAO,EAAE,CAAO;IACpC,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;IACtC,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;IACtC,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,IAAI,GAAG,IAAI,CAAC;AAC3C,CAAC;AAED,SAAS,qBAAqB,CAC5B,KAAa,EACb,YAA8B,EAC9B,OAA0B;IAE1B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAC3B,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;QAChC,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YAC7B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAClE,CAAC;IACH,CAAC;IAED,MAAM,KAAK,GAAW,EAAE,CAAC;IACzB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YACvC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IAEzB,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;AAC7B,CAAC;AAED,SAAS,YAAY,CAAC,KAAa,EAAE,IAAU;IAC7C,MAAM,GAAG,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;IAC9B,IAAI,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC;IAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACnC,IACE,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;YAChB,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACxC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,EAC9D,CAAC;YACD,SAAS,GAAG,CAAC,CAAC;YACd,MAAM;QACR,CAAC;IACH,CAAC;IACD,KAAK,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;AACnC,CAAC;AAED,MAAM,OAAO,kBAAkB;IAC7B,gBAAgB,CAAC,MAAc,EAAE,WAAmB,EAAE,YAA8B;QAClF,IAAI,MAAM,KAAK,WAAW,EAAE,CAAC;YAC3B,MAAM,IAAI,eAAe,CAAC,gCAAgC,CAAC,CAAC;QAC9D,CAAC;QAED,2EAA2E;QAC3E,uDAAuD;QACvD,iFAAiF;QACjF,0EAA0E;QAC1E,EAAE;QACF,sEAAsE;QACtE,sEAAsE;QACtE,yFAAyF;QACzF,uEAAuE;QACvE,kFAAkF;QAClF,2FAA2F;QAC3F,2FAA2F;QAC3F,8DAA8D;QAC9D,EAAE;QACF,2EAA2E;QAC3E,gGAAgG;QAChG,mBAAmB;QACnB,EAAE;QACF,+DAA+D;QAC/D,MAAM,YAAY,GAAG,IAAI,GAAG,EAAoB,CAAC;QACjD,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;YAChC,MAAM,IAAI,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YACjD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAC5B,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACtC,CAAC;QAED,wEAAwE;QACxE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAG,CAAC,WAAW,CAAC,CAAC;QAC5B,MAAM,IAAI,GAAa,EAAE,CAAC;QAE1B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,EAAY,CAAC;YACtC,IAAI,OAAO,KAAK,MAAM,EAAE,CAAC;gBACvB,MAAM,IAAI,uBAAuB,CAAC,CAAC,MAAM,EAAE,GAAG,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC;YAChE,CAAC;YACD,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gBACzB,SAAS;YACX,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACrB,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACnB,MAAM,SAAS,GAAG,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;YAClD,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED,eAAe,CAAC,KAAa,EAAE,YAA8B;QAC3D,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAElC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAgB,CAAC;QACxC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC7B,CAAC;QAED,MAAM,GAAG,GAAG,iBAAiB,CAAC,YAAY,CAAC,CAAC;QAC5C,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,qBAAqB,CAAC,KAAK,EAAE,YAAY,EAAE,OAAO,CAAC,CAAC;QAEhF,MAAM,MAAM,GAAW,EAAE,CAAC;QAE1B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAU,CAAC;YACnC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAElB,KAAK,MAAM,KAAK,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC3C,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBACnC,IAAI,CAAC,OAAO;oBAAE,SAAS;gBACvB,MAAM,SAAS,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBACjD,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;gBAC/B,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;oBACpB,YAAY,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;gBAC/B,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,MAAM,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;YACjC,MAAM,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAC/E,MAAM,IAAI,uBAAuB,CAAC,YAAY,CAAC,CAAC;QAClD,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,eAAe,CAAC,KAAa,EAAE,YAA8B;QAC3D,MAAM,OAAO,GAAG,IAAI,GAAG,EAAgB,CAAC;QACxC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC7B,CAAC;QAED,MAAM,OAAO,GAAW,EAAE,CAAC;QAE3B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC;YAC9D,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;gBAC7C,IAAI,OAAO,IAAI,OAAO,CAAC,MAAM,KAAK,WAAW,EAAE,CAAC;oBAC9C,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACnB,MAAM;gBACR,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;CACF"}

package/dist/engine/recurrence-manager.d.ts

@@ -0,0 +1,24 @@
+import type { RecurrenceRepository } from "../storage/recurrence-repository.js";
+import type { TaskRepository } from "../storage/task-repository.js";
+import type { RecurrenceTemplate, RecurrenceInstance } from "../models/recurrence.js";
+import type { Task } from "../models/task.js";
+type TaskFields = Omit<Task, "id" | "createdAt" | "updatedAt" | "status" | "actualDuration">;
+export declare class RecurrenceManager {
+    private readonly recurrenceRepo;
+    private readonly taskRepo;
+    private currentHorizonEnd;
+    constructor(recurrenceRepo: RecurrenceRepository, taskRepo: TaskRepository);
+    createRecurringTask(taskData: TaskFields, rruleString: string, now: Date, horizonEnd: Date): {
+        template: RecurrenceTemplate;
+        instances: RecurrenceInstance[];
+    };
+    generateInstances(templateId: string, now: Date, horizonEnd: Date): RecurrenceInstance[];
+    expandHorizon(newHorizonEnd: Date): RecurrenceInstance[];
+    skipInstance(templateId: string, date: string): void;
+    modifyInstance(templateId: string, date: string, updates: Partial<Task>): void;
+    deleteTemplate(templateId: string, now: Date): void;
+    private generateInstancesForTemplate;
+    private parseRule;
+}
+export {};
+//# sourceMappingURL=recurrence-manager.d.ts.map