@task-mcp/shared 0.1.0

package/dist/algorithms/topological-sort.js

@@ -0,0 +1,168 @@
+/**
+ * Convert priority string to numeric value
+ */
+export function priorityToNumber(priority) {
+    const map = {
+        critical: 4,
+        high: 3,
+        medium: 2,
+        low: 1,
+    };
+    return map[priority] ?? 2;
+}
+/**
+ * Convert Task to TaskNode
+ */
+export function taskToNode(task) {
+    return {
+        id: task.id,
+        dependencies: (task.dependencies ?? [])
+            .filter((d) => d.type === "blocked_by")
+            .map((d) => d.taskId),
+        priority: priorityToNumber(task.priority),
+        estimate: task.estimate?.expected ?? 0,
+    };
+}
+/**
+ * Topological sort using Kahn's algorithm with priority tie-breaking
+ *
+ * Returns tasks in optimal execution order:
+ * 1. Respects dependencies (blocked_by relationships)
+ * 2. Higher priority tasks come first when dependencies allow
+ *
+ * @throws Error if circular dependency detected
+ */
+export function topologicalSort(tasks) {
+    const nodes = tasks.map(taskToNode);
+    const nodeMap = new Map(nodes.map((n) => [n.id, n]));
+    const taskMap = new Map(tasks.map((t) => [t.id, t]));
+    // Calculate in-degree for each node
+    const inDegree = new Map();
+    const adjacency = new Map();
+    for (const node of nodes) {
+        inDegree.set(node.id, 0);
+        adjacency.set(node.id, []);
+    }
+    // Build graph: if A is blocked_by B, then B -> A (B must come before A)
+    for (const node of nodes) {
+        for (const depId of node.dependencies) {
+            if (nodeMap.has(depId)) {
+                const adj = adjacency.get(depId);
+                if (adj)
+                    adj.push(node.id);
+                inDegree.set(node.id, (inDegree.get(node.id) ?? 0) + 1);
+            }
+        }
+    }
+    // Initialize queue with nodes that have no dependencies
+    const queue = [];
+    for (const node of nodes) {
+        if (inDegree.get(node.id) === 0) {
+            queue.push(node);
+        }
+    }
+    // Sort by priority (higher first)
+    queue.sort((a, b) => b.priority - a.priority);
+    const result = [];
+    while (queue.length > 0) {
+        const current = queue.shift();
+        const task = taskMap.get(current.id);
+        if (task) {
+            result.push(task);
+        }
+        // Update neighbors
+        for (const neighborId of adjacency.get(current.id)) {
+            const newDegree = inDegree.get(neighborId) - 1;
+            inDegree.set(neighborId, newDegree);
+            if (newDegree === 0) {
+                const neighborNode = nodeMap.get(neighborId);
+                queue.push(neighborNode);
+                // Re-sort to maintain priority order
+                queue.sort((a, b) => b.priority - a.priority);
+            }
+        }
+    }
+    // Check for cycles
+    if (result.length !== tasks.length) {
+        const remaining = tasks.filter((t) => !result.some((r) => r.id === t.id));
+        const cycleIds = remaining.map((t) => t.id).join(", ");
+        throw new Error(`Circular dependency detected among tasks: ${cycleIds}`);
+    }
+    return result;
+}
+/**
+ * Detect if adding a dependency would create a cycle
+ */
+export function wouldCreateCycle(tasks, fromId, toId) {
+    // Create a temporary task list with the new dependency
+    const tempTasks = tasks.map((t) => {
+        if (t.id === fromId) {
+            return {
+                ...t,
+                dependencies: [
+                    ...(t.dependencies ?? []),
+                    { taskId: toId, type: "blocked_by" },
+                ],
+            };
+        }
+        return t;
+    });
+    try {
+        topologicalSort(tempTasks);
+        return false;
+    }
+    catch {
+        return true;
+    }
+}
+/**
+ * Find all tasks that depend on a given task (directly or transitively)
+ */
+export function findDependents(tasks, taskId) {
+    const taskMap = new Map(tasks.map((t) => [t.id, t]));
+    const visited = new Set();
+    const result = [];
+    function dfs(id) {
+        for (const task of tasks) {
+            const deps = (task.dependencies ?? [])
+                .filter((d) => d.type === "blocked_by")
+                .map((d) => d.taskId);
+            if (deps.includes(id) && !visited.has(task.id)) {
+                visited.add(task.id);
+                result.push(task);
+                dfs(task.id);
+            }
+        }
+    }
+    dfs(taskId);
+    return result;
+}
+/**
+ * Find all tasks that a given task depends on (directly or transitively)
+ */
+export function findDependencies(tasks, taskId) {
+    const taskMap = new Map(tasks.map((t) => [t.id, t]));
+    const visited = new Set();
+    const result = [];
+    function dfs(id) {
+        const task = taskMap.get(id);
+        if (!task)
+            return;
+        const deps = (task.dependencies ?? [])
+            .filter((d) => d.type === "blocked_by")
+            .map((d) => d.taskId);
+        for (const depId of deps) {
+            if (!visited.has(depId)) {
+                visited.add(depId);
+                const depTask = taskMap.get(depId);
+                if (depTask) {
+                    result.push(depTask);
+                    dfs(depId);
+                }
+            }
+        }
+    }
+    dfs(taskId);
+    return result;
+}
+//# sourceMappingURL=topological-sort.js.map

package/dist/algorithms/topological-sort.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"topological-sort.js","sourceRoot":"","sources":["../../src/algorithms/topological-sort.ts"],"names":[],"mappings":"AAYA;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,QAAgB;IAC/C,MAAM,GAAG,GAA2B;QAClC,QAAQ,EAAE,CAAC;QACX,IAAI,EAAE,CAAC;QACP,MAAM,EAAE,CAAC;QACT,GAAG,EAAE,CAAC;KACP,CAAC;IACF,OAAO,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;AAC5B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,UAAU,CAAC,IAAU;IACnC,OAAO;QACL,EAAE,EAAE,IAAI,CAAC,EAAE;QACX,YAAY,EAAE,CAAC,IAAI,CAAC,YAAY,IAAI,EAAE,CAAC;aACpC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,YAAY,CAAC;aACtC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;QACvB,QAAQ,EAAE,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC;QACzC,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,QAAQ,IAAI,CAAC;KACvC,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,eAAe,CAAC,KAAa;IAC3C,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IACpC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAErD,oCAAoC;IACpC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE9C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACzB,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC7B,CAAC;IAED,wEAAwE;IACxE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACtC,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACvB,MAAM,GAAG,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBACjC,IAAI,GAAG;oBAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC3B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC1D,CAAC;QACH,CAAC;IACH,CAAC;IAED,wDAAwD;IACxD,MAAM,KAAK,GAAe,EAAE,CAAC;IAC7B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;YAChC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnB,CAAC;IACH,CAAC;IAED,kCAAkC;IAClC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;IAE9C,MAAM,MAAM,GAAW,EAAE,CAAC;IAE1B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC/B,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACrC,IAAI,IAAI,EAAE,CAAC;YACT,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpB,CAAC;QAED,mBAAmB;QACnB,KAAK,MAAM,UAAU,IAAI,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAE,EAAE,CAAC;YACpD,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAE,GAAG,CAAC,CAAC;YAChD,QAAQ,CAAC,GAAG,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;YAEpC,IAAI,SAAS,KAAK,CAAC,EAAE,CAAC;gBACpB,MAAM,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC;gBAC9C,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;gBACzB,qCAAqC;gBACrC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;YAChD,CAAC;QACH,CAAC;IACH,CAAC;IAED,mBAAmB;IACnB,IAAI,MAAM,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,EAAE,CAAC;QACnC,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1E,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvD,MAAM,IAAI,KAAK,CAAC,6CAA6C,QAAQ,EAAE,CAAC,CAAC;IAC3E,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAC9B,KAAa,EACb,MAAc,EACd,IAAY;IAEZ,uDAAuD;IACvD,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QAChC,IAAI,CAAC,CAAC,EAAE,KAAK,MAAM,EAAE,CAAC;YACpB,OAAO;gBACL,GAAG,CAAC;gBACJ,YAAY,EAAE;oBACZ,GAAG,CAAC,CAAC,CAAC,YAAY,IAAI,EAAE,CAAC;oBACzB,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,YAAqB,EAAE;iBAC9C;aACF,CAAC;QACJ,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC;QACH,eAAe,CAAC,SAAS,CAAC,CAAC;QAC3B,OAAO,KAAK,CAAC;IACf,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,KAAa,EAAE,MAAc;IAC1D,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,MAAM,GAAW,EAAE,CAAC;IAE1B,SAAS,GAAG,CAAC,EAAU;QACrB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC,YAAY,IAAI,EAAE,CAAC;iBACnC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,YAAY,CAAC;iBACtC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YAExB,IAAI,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC/C,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACrB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBAClB,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACf,CAAC;QACH,CAAC;IACH,CAAC;IAED,GAAG,CAAC,MAAM,CAAC,CAAC;IACZ,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAa,EAAE,MAAc;IAC5D,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,MAAM,GAAW,EAAE,CAAC;IAE1B,SAAS,GAAG,CAAC,EAAU;QACrB,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC7B,IAAI,CAAC,IAAI;YAAE,OAAO;QAElB,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC,YAAY,IAAI,EAAE,CAAC;aACnC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,YAAY,CAAC;aACtC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAExB,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACxB,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBACnB,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBACnC,IAAI,OAAO,EAAE,CAAC;oBACZ,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;oBACrB,GAAG,CAAC,KAAK,CAAC,CAAC;gBACb,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,GAAG,CAAC,MAAM,CAAC,CAAC;IACZ,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/algorithms/topological-sort.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=topological-sort.test.d.ts.map

package/dist/algorithms/topological-sort.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"topological-sort.test.d.ts","sourceRoot":"","sources":["../../src/algorithms/topological-sort.test.ts"],"names":[],"mappings":""}

package/dist/algorithms/topological-sort.test.js

@@ -0,0 +1,162 @@
+import { describe, test, expect } from "bun:test";
+import { priorityToNumber, topologicalSort, wouldCreateCycle, findDependents, findDependencies, } from "./topological-sort.js";
+// Helper to create mock tasks
+function createTask(id, priority = "medium", deps = []) {
+    return {
+        id,
+        title: `Task ${id}`,
+        status: "pending",
+        priority: priority,
+        projectId: "test-project",
+        createdAt: new Date().toISOString(),
+        updatedAt: new Date().toISOString(),
+        dependencies: deps.map((depId) => ({ taskId: depId, type: "blocked_by" })),
+    };
+}
+describe("priorityToNumber", () => {
+    test("converts critical to 4", () => {
+        expect(priorityToNumber("critical")).toBe(4);
+    });
+    test("converts high to 3", () => {
+        expect(priorityToNumber("high")).toBe(3);
+    });
+    test("converts medium to 2", () => {
+        expect(priorityToNumber("medium")).toBe(2);
+    });
+    test("converts low to 1", () => {
+        expect(priorityToNumber("low")).toBe(1);
+    });
+    test("defaults to 2 for unknown priority", () => {
+        expect(priorityToNumber("unknown")).toBe(2);
+    });
+});
+describe("topologicalSort", () => {
+    test("returns empty array for empty input", () => {
+        const result = topologicalSort([]);
+        expect(result).toEqual([]);
+    });
+    test("returns single task unchanged", () => {
+        const tasks = [createTask("A")];
+        const result = topologicalSort(tasks);
+        expect(result.length).toBe(1);
+        expect(result[0].id).toBe("A");
+    });
+    test("sorts by dependency order", () => {
+        // B depends on A, so A should come first
+        const tasks = [createTask("B", "high", ["A"]), createTask("A", "low")];
+        const result = topologicalSort(tasks);
+        expect(result[0].id).toBe("A");
+        expect(result[1].id).toBe("B");
+    });
+    test("respects priority when no dependencies", () => {
+        const tasks = [
+            createTask("A", "low"),
+            createTask("B", "critical"),
+            createTask("C", "high"),
+        ];
+        const result = topologicalSort(tasks);
+        expect(result[0].id).toBe("B"); // critical first
+        expect(result[1].id).toBe("C"); // then high
+        expect(result[2].id).toBe("A"); // then low
+    });
+    test("handles chain of dependencies", () => {
+        // C -> B -> A (C depends on B, B depends on A)
+        const tasks = [
+            createTask("C", "critical", ["B"]),
+            createTask("B", "high", ["A"]),
+            createTask("A", "low"),
+        ];
+        const result = topologicalSort(tasks);
+        expect(result.map((t) => t.id)).toEqual(["A", "B", "C"]);
+    });
+    test("throws on circular dependency", () => {
+        // A -> B -> A
+        const tasks = [createTask("A", "medium", ["B"]), createTask("B", "medium", ["A"])];
+        expect(() => topologicalSort(tasks)).toThrow(/Circular dependency/);
+    });
+    test("handles diamond dependency", () => {
+        // D depends on B and C, both depend on A
+        const tasks = [
+            createTask("D", "medium", ["B", "C"]),
+            createTask("B", "high", ["A"]),
+            createTask("C", "low", ["A"]),
+            createTask("A", "medium"),
+        ];
+        const result = topologicalSort(tasks);
+        // A must come first, D must come last
+        expect(result[0].id).toBe("A");
+        expect(result[3].id).toBe("D");
+    });
+});
+describe("wouldCreateCycle", () => {
+    test("returns false for valid dependency", () => {
+        const tasks = [createTask("A"), createTask("B")];
+        // Adding B blocked_by A should not create cycle
+        expect(wouldCreateCycle(tasks, "B", "A")).toBe(false);
+    });
+    test("returns true for direct cycle", () => {
+        const tasks = [createTask("A", "medium", ["B"]), createTask("B")];
+        // B is already blocking A, so A blocking B would create cycle
+        expect(wouldCreateCycle(tasks, "B", "A")).toBe(true);
+    });
+    test("returns true for indirect cycle", () => {
+        const tasks = [
+            createTask("A", "medium", ["B"]),
+            createTask("B", "medium", ["C"]),
+            createTask("C"),
+        ];
+        // A <- B <- C, adding C <- A would create cycle
+        expect(wouldCreateCycle(tasks, "C", "A")).toBe(true);
+    });
+});
+describe("findDependents", () => {
+    test("returns empty for task with no dependents", () => {
+        const tasks = [createTask("A"), createTask("B")];
+        const result = findDependents(tasks, "A");
+        expect(result).toEqual([]);
+    });
+    test("finds direct dependents", () => {
+        const tasks = [
+            createTask("A"),
+            createTask("B", "medium", ["A"]),
+            createTask("C", "medium", ["A"]),
+        ];
+        const result = findDependents(tasks, "A");
+        expect(result.map((t) => t.id).sort()).toEqual(["B", "C"]);
+    });
+    test("finds transitive dependents", () => {
+        const tasks = [
+            createTask("A"),
+            createTask("B", "medium", ["A"]),
+            createTask("C", "medium", ["B"]),
+        ];
+        const result = findDependents(tasks, "A");
+        expect(result.map((t) => t.id).sort()).toEqual(["B", "C"]);
+    });
+});
+describe("findDependencies", () => {
+    test("returns empty for task with no dependencies", () => {
+        const tasks = [createTask("A"), createTask("B")];
+        const result = findDependencies(tasks, "A");
+        expect(result).toEqual([]);
+    });
+    test("finds direct dependencies", () => {
+        const tasks = [
+            createTask("A"),
+            createTask("B"),
+            createTask("C", "medium", ["A", "B"]),
+        ];
+        const result = findDependencies(tasks, "C");
+        expect(result.map((t) => t.id).sort()).toEqual(["A", "B"]);
+    });
+    test("finds transitive dependencies", () => {
+        const tasks = [
+            createTask("A"),
+            createTask("B", "medium", ["A"]),
+            createTask("C", "medium", ["B"]),
+        ];
+        const result = findDependencies(tasks, "C");
+        expect(result.map((t) => t.id).sort()).toEqual(["A", "B"]);
+    });
+});
+//# sourceMappingURL=topological-sort.test.js.map

package/dist/algorithms/topological-sort.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"topological-sort.test.js","sourceRoot":"","sources":["../../src/algorithms/topological-sort.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAClD,OAAO,EACL,gBAAgB,EAChB,eAAe,EACf,gBAAgB,EAChB,cAAc,EACd,gBAAgB,GACjB,MAAM,uBAAuB,CAAC;AAG/B,8BAA8B;AAC9B,SAAS,UAAU,CAAC,EAAU,EAAE,WAAmB,QAAQ,EAAE,OAAiB,EAAE;IAC9E,OAAO;QACL,EAAE;QACF,KAAK,EAAE,QAAQ,EAAE,EAAE;QACnB,MAAM,EAAE,SAAS;QACjB,QAAQ,EAAE,QAA4B;QACtC,SAAS,EAAE,cAAc;QACzB,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QACnC,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QACnC,YAAY,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,YAAqB,EAAE,CAAC,CAAC;KACpF,CAAC;AACJ,CAAC;AAED,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;IAChC,IAAI,CAAC,wBAAwB,EAAE,GAAG,EAAE;QAClC,MAAM,CAAC,gBAAgB,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAC9B,MAAM,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,sBAAsB,EAAE,GAAG,EAAE;QAChC,MAAM,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,mBAAmB,EAAE,GAAG,EAAE;QAC7B,MAAM,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC9C,MAAM,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;IAC/B,IAAI,CAAC,qCAAqC,EAAE,GAAG,EAAE;QAC/C,MAAM,MAAM,GAAG,eAAe,CAAC,EAAE,CAAC,CAAC;QACnC,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACzC,MAAM,KAAK,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;QAChC,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QACtC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACrC,yCAAyC;QACzC,MAAM,KAAK,GAAG,CAAC,UAAU,CAAC,GAAG,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;QACvE,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QACtC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAChC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,wCAAwC,EAAE,GAAG,EAAE;QAClD,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC;YACtB,UAAU,CAAC,GAAG,EAAE,UAAU,CAAC;YAC3B,UAAU,CAAC,GAAG,EAAE,MAAM,CAAC;SACxB,CAAC;QACF,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QACtC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,iBAAiB;QAClD,MAAM,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY;QAC7C,MAAM,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW;IAC9C,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACzC,+CAA+C;QAC/C,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,GAAG,EAAE,UAAU,EAAE,CAAC,GAAG,CAAC,CAAC;YAClC,UAAU,CAAC,GAAG,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC;YAC9B,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC;SACvB,CAAC;QACF,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QACtC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACzC,cAAc;QACd,MAAM,KAAK,GAAG,CAAC,UAAU,CAAC,GAAG,EAAE,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,GAAG,EAAE,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACnF,MAAM,CAAC,GAAG,EAAE,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,qBAAqB,CAAC,CAAC;IACtE,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACtC,yCAAyC;QACzC,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,GAAG,EAAE,QAAQ,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACrC,UAAU,CAAC,GAAG,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC;YAC9B,UAAU,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC;YAC7B,UAAU,CAAC,GAAG,EAAE,QAAQ,CAAC;SAC1B,CAAC;QACF,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QACtC,sCAAsC;QACtC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAChC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;IAChC,IAAI,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC9C,MAAM,KAAK,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;QACjD,gDAAgD;QAChD,MAAM,CAAC,gBAAgB,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACzC,MAAM,KAAK,GAAG,CAAC,UAAU,CAAC,GAAG,EAAE,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;QAClE,8DAA8D;QAC9D,MAAM,CAAC,gBAAgB,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,iCAAiC,EAAE,GAAG,EAAE;QAC3C,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,GAAG,EAAE,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;YAChC,UAAU,CAAC,GAAG,EAAE,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;YAChC,UAAU,CAAC,GAAG,CAAC;SAChB,CAAC;QACF,gDAAgD;QAChD,MAAM,CAAC,gBAAgB,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;IAC9B,IAAI,CAAC,2CAA2C,EAAE,GAAG,EAAE;QACrD,MAAM,KAAK,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;QACjD,MAAM,MAAM,GAAG,cAAc,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAC1C,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,yBAAyB,EAAE,GAAG,EAAE;QACnC,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,GAAG,CAAC;YACf,UAAU,CAAC,GAAG,EAAE,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;YAChC,UAAU,CAAC,GAAG,EAAE,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;SACjC,CAAC;QACF,MAAM,MAAM,GAAG,cAAc,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAC1C,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACvC,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,GAAG,CAAC;YACf,UAAU,CAAC,GAAG,EAAE,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;YAChC,UAAU,CAAC,GAAG,EAAE,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;SACjC,CAAC;QACF,MAAM,MAAM,GAAG,cAAc,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAC1C,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;IAChC,IAAI,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACvD,MAAM,KAAK,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;QACjD,MAAM,MAAM,GAAG,gBAAgB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAC5C,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACrC,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,GAAG,CAAC;YACf,UAAU,CAAC,GAAG,CAAC;YACf,UAAU,CAAC,GAAG,EAAE,QAAQ,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;SACtC,CAAC;QACF,MAAM,MAAM,GAAG,gBAAgB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAC5C,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACzC,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,GAAG,CAAC;YACf,UAAU,CAAC,GAAG,EAAE,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;YAChC,UAAU,CAAC,GAAG,EAAE,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC;SACjC,CAAC;QACF,MAAM,MAAM,GAAG,gBAAgB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAC5C,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,4 @@
+export * from "./schemas/index.js";
+export * from "./algorithms/index.js";
+export * from "./utils/index.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AACA,cAAc,oBAAoB,CAAC;AAGnC,cAAc,uBAAuB,CAAC;AAGtC,cAAc,kBAAkB,CAAC"}

package/dist/index.js

@@ -0,0 +1,7 @@
+// Schemas
+export * from "./schemas/index.js";
+// Algorithms
+export * from "./algorithms/index.js";
+// Utilities
+export * from "./utils/index.js";
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,UAAU;AACV,cAAc,oBAAoB,CAAC;AAEnC,aAAa;AACb,cAAc,uBAAuB,CAAC;AAEtC,YAAY;AACZ,cAAc,kBAAkB,CAAC"}

package/dist/schemas/index.d.ts

@@ -0,0 +1,4 @@
+export { Priority, TaskStatus, DependencyType, Dependency, TimeEstimate, Recurrence, Task, TaskCreateInput, TaskUpdateInput, } from "./task.js";
+export { ProjectStatus, Context, Project, ProjectCreateInput, ProjectUpdateInput, } from "./project.js";
+export { SmartViewFilter, SortField, SortOrder, SmartView, BuiltInView, } from "./view.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/schemas/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/schemas/index.ts"],"names":[],"mappings":"AACA,OAAO,EACL,QAAQ,EACR,UAAU,EACV,cAAc,EACd,UAAU,EACV,YAAY,EACZ,UAAU,EACV,IAAI,EACJ,eAAe,EACf,eAAe,GAChB,MAAM,WAAW,CAAC;AAGnB,OAAO,EACL,aAAa,EACb,OAAO,EACP,OAAO,EACP,kBAAkB,EAClB,kBAAkB,GACnB,MAAM,cAAc,CAAC;AAGtB,OAAO,EACL,eAAe,EACf,SAAS,EACT,SAAS,EACT,SAAS,EACT,WAAW,GACZ,MAAM,WAAW,CAAC"}

package/dist/schemas/index.js

@@ -0,0 +1,7 @@
+// Task schemas
+export { Priority, TaskStatus, DependencyType, Dependency, TimeEstimate, Recurrence, Task, TaskCreateInput, TaskUpdateInput, } from "./task.js";
+// Project schemas
+export { ProjectStatus, Context, Project, ProjectCreateInput, ProjectUpdateInput, } from "./project.js";
+// View schemas
+export { SmartViewFilter, SortField, SortOrder, SmartView, BuiltInView, } from "./view.js";
+//# sourceMappingURL=index.js.map

package/dist/schemas/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/schemas/index.ts"],"names":[],"mappings":"AAAA,eAAe;AACf,OAAO,EACL,QAAQ,EACR,UAAU,EACV,cAAc,EACd,UAAU,EACV,YAAY,EACZ,UAAU,EACV,IAAI,EACJ,eAAe,EACf,eAAe,GAChB,MAAM,WAAW,CAAC;AAEnB,kBAAkB;AAClB,OAAO,EACL,aAAa,EACb,OAAO,EACP,OAAO,EACP,kBAAkB,EAClB,kBAAkB,GACnB,MAAM,cAAc,CAAC;AAEtB,eAAe;AACf,OAAO,EACL,eAAe,EACf,SAAS,EACT,SAAS,EACT,SAAS,EACT,WAAW,GACZ,MAAM,WAAW,CAAC"}

package/dist/schemas/project.d.ts

@@ -0,0 +1,55 @@
+export declare const ProjectStatus: import("arktype/internal/methods/string.ts").StringType<"completed" | "active" | "on_hold" | "archived", {}>;
+export type ProjectStatus = typeof ProjectStatus.infer;
+export declare const Context: import("arktype/internal/methods/object.ts").ObjectType<{
+    name: string;
+    color?: string;
+    description?: string;
+}, {}>;
+export type Context = typeof Context.infer;
+export declare const Project: import("arktype/internal/methods/object.ts").ObjectType<{
+    id: string;
+    name: string;
+    status: "completed" | "active" | "on_hold" | "archived";
+    createdAt: string;
+    updatedAt: string;
+    description?: string;
+    defaultPriority?: "critical" | "high" | "medium" | "low";
+    contexts?: {
+        name: string;
+        color?: string;
+        description?: string;
+    }[];
+    targetDate?: string;
+    completionPercentage?: number;
+    criticalPathLength?: number;
+    blockedTaskCount?: number;
+    totalTasks?: number;
+    completedTasks?: number;
+}, {}>;
+export type Project = typeof Project.infer;
+export declare const ProjectCreateInput: import("arktype/internal/methods/object.ts").ObjectType<{
+    name: string;
+    description?: string;
+    defaultPriority?: "critical" | "high" | "medium" | "low";
+    contexts?: {
+        name: string;
+        color?: string;
+        description?: string;
+    }[];
+    targetDate?: string;
+}, {}>;
+export type ProjectCreateInput = typeof ProjectCreateInput.infer;
+export declare const ProjectUpdateInput: import("arktype/internal/methods/object.ts").ObjectType<{
+    name?: string;
+    description?: string;
+    status?: "completed" | "active" | "on_hold" | "archived";
+    defaultPriority?: "critical" | "high" | "medium" | "low";
+    contexts?: {
+        name: string;
+        color?: string;
+        description?: string;
+    }[];
+    targetDate?: string;
+}, {}>;
+export type ProjectUpdateInput = typeof ProjectUpdateInput.infer;
+//# sourceMappingURL=project.d.ts.map

package/dist/schemas/project.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"project.d.ts","sourceRoot":"","sources":["../../src/schemas/project.ts"],"names":[],"mappings":"AAIA,eAAO,MAAM,aAAa,8GAEzB,CAAC;AACF,MAAM,MAAM,aAAa,GAAG,OAAO,aAAa,CAAC,KAAK,CAAC;AAGvD,eAAO,MAAM,OAAO;;;;MAIlB,CAAC;AACH,MAAM,MAAM,OAAO,GAAG,OAAO,OAAO,CAAC,KAAK,CAAC;AAG3C,eAAO,MAAM,OAAO;;;;;;;;;;;;;;;;;;;MAqBlB,CAAC;AACH,MAAM,MAAM,OAAO,GAAG,OAAO,OAAO,CAAC,KAAK,CAAC;AAG3C,eAAO,MAAM,kBAAkB;;;;;;;;;;MAM7B,CAAC;AACH,MAAM,MAAM,kBAAkB,GAAG,OAAO,kBAAkB,CAAC,KAAK,CAAC;AAGjE,eAAO,MAAM,kBAAkB;;;;;;;;;;;MAO7B,CAAC;AACH,MAAM,MAAM,kBAAkB,GAAG,OAAO,kBAAkB,CAAC,KAAK,CAAC"}

package/dist/schemas/project.js

@@ -0,0 +1,48 @@
+import { type } from "arktype";
+import { Priority } from "./task.js";
+// Project status
+export const ProjectStatus = type("'active' | 'on_hold' | 'completed' | 'archived'");
+// Context definition
+export const Context = type({
+    name: "string",
+    "color?": "string", // hex color
+    "description?": "string",
+});
+// Project schema
+export const Project = type({
+    id: "string",
+    name: "string",
+    "description?": "string",
+    status: ProjectStatus,
+    // Project-level settings
+    "defaultPriority?": Priority,
+    "contexts?": Context.array(),
+    // Metadata
+    createdAt: "string",
+    updatedAt: "string",
+    "targetDate?": "string",
+    // Computed stats
+    "completionPercentage?": "number",
+    "criticalPathLength?": "number", // Total minutes on critical path
+    "blockedTaskCount?": "number",
+    "totalTasks?": "number",
+    "completedTasks?": "number",
+});
+// Project creation input
+export const ProjectCreateInput = type({
+    name: "string",
+    "description?": "string",
+    "defaultPriority?": Priority,
+    "contexts?": Context.array(),
+    "targetDate?": "string",
+});
+// Project update input
+export const ProjectUpdateInput = type({
+    "name?": "string",
+    "description?": "string",
+    "status?": ProjectStatus,
+    "defaultPriority?": Priority,
+    "contexts?": Context.array(),
+    "targetDate?": "string",
+});
+//# sourceMappingURL=project.js.map

package/dist/schemas/project.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"project.js","sourceRoot":"","sources":["../../src/schemas/project.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,SAAS,CAAC;AAC/B,OAAO,EAAE,QAAQ,EAAE,MAAM,WAAW,CAAC;AAErC,iBAAiB;AACjB,MAAM,CAAC,MAAM,aAAa,GAAG,IAAI,CAC/B,iDAAiD,CAClD,CAAC;AAGF,qBAAqB;AACrB,MAAM,CAAC,MAAM,OAAO,GAAG,IAAI,CAAC;IAC1B,IAAI,EAAE,QAAQ;IACd,QAAQ,EAAE,QAAQ,EAAE,YAAY;IAChC,cAAc,EAAE,QAAQ;CACzB,CAAC,CAAC;AAGH,iBAAiB;AACjB,MAAM,CAAC,MAAM,OAAO,GAAG,IAAI,CAAC;IAC1B,EAAE,EAAE,QAAQ;IACZ,IAAI,EAAE,QAAQ;IACd,cAAc,EAAE,QAAQ;IACxB,MAAM,EAAE,aAAa;IAErB,yBAAyB;IACzB,kBAAkB,EAAE,QAAQ;IAC5B,WAAW,EAAE,OAAO,CAAC,KAAK,EAAE;IAE5B,WAAW;IACX,SAAS,EAAE,QAAQ;IACnB,SAAS,EAAE,QAAQ;IACnB,aAAa,EAAE,QAAQ;IAEvB,iBAAiB;IACjB,uBAAuB,EAAE,QAAQ;IACjC,qBAAqB,EAAE,QAAQ,EAAE,iCAAiC;IAClE,mBAAmB,EAAE,QAAQ;IAC7B,aAAa,EAAE,QAAQ;IACvB,iBAAiB,EAAE,QAAQ;CAC5B,CAAC,CAAC;AAGH,yBAAyB;AACzB,MAAM,CAAC,MAAM,kBAAkB,GAAG,IAAI,CAAC;IACrC,IAAI,EAAE,QAAQ;IACd,cAAc,EAAE,QAAQ;IACxB,kBAAkB,EAAE,QAAQ;IAC5B,WAAW,EAAE,OAAO,CAAC,KAAK,EAAE;IAC5B,aAAa,EAAE,QAAQ;CACxB,CAAC,CAAC;AAGH,uBAAuB;AACvB,MAAM,CAAC,MAAM,kBAAkB,GAAG,IAAI,CAAC;IACrC,OAAO,EAAE,QAAQ;IACjB,cAAc,EAAE,QAAQ;IACxB,SAAS,EAAE,aAAa;IACxB,kBAAkB,EAAE,QAAQ;IAC5B,WAAW,EAAE,OAAO,CAAC,KAAK,EAAE;IAC5B,aAAa,EAAE,QAAQ;CACxB,CAAC,CAAC"}

package/dist/schemas/task.d.ts

@@ -0,0 +1,124 @@
+export declare const Priority: import("arktype/internal/methods/string.ts").StringType<"critical" | "high" | "medium" | "low", {}>;
+export type Priority = typeof Priority.infer;
+export declare const TaskStatus: import("arktype/internal/methods/string.ts").StringType<"pending" | "in_progress" | "blocked" | "completed" | "cancelled", {}>;
+export type TaskStatus = typeof TaskStatus.infer;
+export declare const DependencyType: import("arktype/internal/methods/string.ts").StringType<"blocks" | "blocked_by" | "related", {}>;
+export type DependencyType = typeof DependencyType.infer;
+export declare const Dependency: import("arktype/internal/methods/object.ts").ObjectType<{
+    taskId: string;
+    type: "blocks" | "blocked_by" | "related";
+    reason?: string;
+}, {}>;
+export type Dependency = typeof Dependency.infer;
+export declare const TimeEstimate: import("arktype/internal/methods/object.ts").ObjectType<{
+    optimistic?: number;
+    expected?: number;
+    pessimistic?: number;
+    confidence?: "high" | "medium" | "low";
+}, {}>;
+export type TimeEstimate = typeof TimeEstimate.infer;
+export declare const Recurrence: import("arktype/internal/methods/object.ts").ObjectType<{
+    pattern: "daily" | "weekly" | "monthly" | "after_completion";
+    interval?: number;
+    daysOfWeek?: number[];
+    endDate?: string;
+}, {}>;
+export type Recurrence = typeof Recurrence.infer;
+export declare const Task: import("arktype/internal/methods/object.ts").ObjectType<{
+    id: string;
+    title: string;
+    status: "pending" | "in_progress" | "blocked" | "completed" | "cancelled";
+    priority: "critical" | "high" | "medium" | "low";
+    projectId: string;
+    createdAt: string;
+    updatedAt: string;
+    description?: string;
+    dependencies?: {
+        taskId: string;
+        type: "blocks" | "blocked_by" | "related";
+        reason?: string;
+    }[];
+    estimate?: {
+        optimistic?: number;
+        expected?: number;
+        pessimistic?: number;
+        confidence?: "high" | "medium" | "low";
+    };
+    actualMinutes?: number;
+    dueDate?: string;
+    startDate?: string;
+    startedAt?: string;
+    completedAt?: string;
+    contexts?: string[];
+    tags?: string[];
+    recurrence?: {
+        pattern: "daily" | "weekly" | "monthly" | "after_completion";
+        interval?: number;
+        daysOfWeek?: number[];
+        endDate?: string;
+    };
+    criticalPath?: boolean;
+    slack?: number;
+    earliestStart?: number;
+    latestStart?: number;
+}, {}>;
+export type Task = typeof Task.infer;
+export declare const TaskCreateInput: import("arktype/internal/methods/object.ts").ObjectType<{
+    title: string;
+    description?: string;
+    projectId?: string;
+    priority?: "critical" | "high" | "medium" | "low";
+    dependencies?: {
+        taskId: string;
+        type: "blocks" | "blocked_by" | "related";
+        reason?: string;
+    }[];
+    estimate?: {
+        optimistic?: number;
+        expected?: number;
+        pessimistic?: number;
+        confidence?: "high" | "medium" | "low";
+    };
+    dueDate?: string;
+    startDate?: string;
+    contexts?: string[];
+    tags?: string[];
+    recurrence?: {
+        pattern: "daily" | "weekly" | "monthly" | "after_completion";
+        interval?: number;
+        daysOfWeek?: number[];
+        endDate?: string;
+    };
+}, {}>;
+export type TaskCreateInput = typeof TaskCreateInput.infer;
+export declare const TaskUpdateInput: import("arktype/internal/methods/object.ts").ObjectType<{
+    title?: string;
+    description?: string;
+    status?: "pending" | "in_progress" | "blocked" | "completed" | "cancelled";
+    priority?: "critical" | "high" | "medium" | "low";
+    projectId?: string;
+    dependencies?: {
+        taskId: string;
+        type: "blocks" | "blocked_by" | "related";
+        reason?: string;
+    }[];
+    estimate?: {
+        optimistic?: number;
+        expected?: number;
+        pessimistic?: number;
+        confidence?: "high" | "medium" | "low";
+    };
+    actualMinutes?: number;
+    dueDate?: string;
+    startDate?: string;
+    contexts?: string[];
+    tags?: string[];
+    recurrence?: {
+        pattern: "daily" | "weekly" | "monthly" | "after_completion";
+        interval?: number;
+        daysOfWeek?: number[];
+        endDate?: string;
+    };
+}, {}>;
+export type TaskUpdateInput = typeof TaskUpdateInput.infer;
+//# sourceMappingURL=task.d.ts.map

package/dist/schemas/task.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"task.d.ts","sourceRoot":"","sources":["../../src/schemas/task.ts"],"names":[],"mappings":"AAGA,eAAO,MAAM,QAAQ,qGAAiD,CAAC;AACvE,MAAM,MAAM,QAAQ,GAAG,OAAO,QAAQ,CAAC,KAAK,CAAC;AAG7C,eAAO,MAAM,UAAU,gIAEtB,CAAC;AACF,MAAM,MAAM,UAAU,GAAG,OAAO,UAAU,CAAC,KAAK,CAAC;AAGjD,eAAO,MAAM,cAAc,kGAE1B,CAAC;AACF,MAAM,MAAM,cAAc,GAAG,OAAO,cAAc,CAAC,KAAK,CAAC;AAGzD,eAAO,MAAM,UAAU;;;;MAIrB,CAAC;AACH,MAAM,MAAM,UAAU,GAAG,OAAO,UAAU,CAAC,KAAK,CAAC;AAGjD,eAAO,MAAM,YAAY;;;;;MAKvB,CAAC;AACH,MAAM,MAAM,YAAY,GAAG,OAAO,YAAY,CAAC,KAAK,CAAC;AAGrD,eAAO,MAAM,UAAU;;;;;MAKrB,CAAC;AACH,MAAM,MAAM,UAAU,GAAG,OAAO,UAAU,CAAC,KAAK,CAAC;AAGjD,eAAO,MAAM,IAAI;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;MAmCf,CAAC;AACH,MAAM,MAAM,IAAI,GAAG,OAAO,IAAI,CAAC,KAAK,CAAC;AAGrC,eAAO,MAAM,eAAe;;;;;;;;;;;;;;;;;;;;;;;;;;MAY1B,CAAC;AACH,MAAM,MAAM,eAAe,GAAG,OAAO,eAAe,CAAC,KAAK,CAAC;AAG3D,eAAO,MAAM,eAAe;;;;;;;;;;;;;;;;;;;;;;;;;;;;MAc1B,CAAC;AACH,MAAM,MAAM,eAAe,GAAG,OAAO,eAAe,CAAC,KAAK,CAAC"}