@task-mcp/shared 1.0.22 → 1.0.24

package/dist/algorithms/tech-analysis.test.js

@@ -0,0 +1,330 @@
+import { describe, test, expect } from "bun:test";
+import { suggestSafeOrder, findBreakingChanges, findHighRiskTasks, groupByTechArea, getComplexitySummary, getTechStackSummary, suggestSubtaskCount, } from "./tech-analysis.js";
+// Helper to create mock tasks with tech stack analysis
+function createTask(id, options = {}) {
+    const task = {
+        id,
+        title: `Task ${id}`,
+        status: options.status ?? "pending",
+        priority: options.priority ?? "medium",
+        workspace: "test-workspace",
+        createdAt: new Date().toISOString(),
+        updatedAt: new Date().toISOString(),
+    };
+    if (options.areas || options.riskLevel !== undefined || options.hasBreakingChange !== undefined) {
+        task.techStack = {};
+        if (options.areas) {
+            task.techStack.areas = options.areas;
+        }
+        if (options.riskLevel !== undefined) {
+            task.techStack.riskLevel = options.riskLevel;
+        }
+        if (options.hasBreakingChange !== undefined) {
+            task.techStack.hasBreakingChange = options.hasBreakingChange;
+        }
+    }
+    if (options.complexityScore !== undefined) {
+        task.complexity = {
+            score: options.complexityScore,
+        };
+    }
+    return task;
+}
+describe("suggestSafeOrder", () => {
+    test("returns empty result for empty input", () => {
+        const result = suggestSafeOrder([]);
+        expect(result.orderedTasks).toEqual([]);
+        expect(result.phases).toEqual([]);
+        expect(result.summary.totalTasks).toBe(0);
+    });
+    test("returns empty for all completed tasks", () => {
+        const tasks = [createTask("A", { status: "completed" })];
+        const result = suggestSafeOrder(tasks);
+        expect(result.orderedTasks).toEqual([]);
+    });
+    test("orders by tech level (schema before backend)", () => {
+        const tasks = [
+            createTask("backend-task", { areas: ["backend"] }),
+            createTask("schema-task", { areas: ["schema"] }),
+        ];
+        const result = suggestSafeOrder(tasks);
+        expect(result.orderedTasks[0].id).toBe("schema-task");
+        expect(result.orderedTasks[1].id).toBe("backend-task");
+    });
+    test("orders by tech level (full chain)", () => {
+        const tasks = [
+            createTask("frontend", { areas: ["frontend"] }),
+            createTask("backend", { areas: ["backend"] }),
+            createTask("schema", { areas: ["schema"] }),
+            createTask("test", { areas: ["test"] }),
+            createTask("devops", { areas: ["devops"] }),
+        ];
+        const result = suggestSafeOrder(tasks);
+        const order = result.orderedTasks.map((t) => t.id);
+        expect(order).toEqual(["schema", "devops", "backend", "frontend", "test"]);
+    });
+    test("orders by risk level within same tech level", () => {
+        const tasks = [
+            createTask("high-risk", { areas: ["backend"], riskLevel: "high" }),
+            createTask("low-risk", { areas: ["backend"], riskLevel: "low" }),
+            createTask("medium-risk", { areas: ["backend"], riskLevel: "medium" }),
+        ];
+        const result = suggestSafeOrder(tasks);
+        const order = result.orderedTasks.map((t) => t.id);
+        expect(order).toEqual(["low-risk", "medium-risk", "high-risk"]);
+    });
+    test("puts breaking changes last within same tech/risk level", () => {
+        const tasks = [
+            createTask("breaking", { areas: ["backend"], riskLevel: "low", hasBreakingChange: true }),
+            createTask("safe", { areas: ["backend"], riskLevel: "low", hasBreakingChange: false }),
+        ];
+        const result = suggestSafeOrder(tasks);
+        expect(result.orderedTasks[0].id).toBe("safe");
+        expect(result.orderedTasks[1].id).toBe("breaking");
+    });
+    test("uses priority as tiebreaker", () => {
+        const tasks = [
+            createTask("low-priority", { areas: ["backend"], priority: "low" }),
+            createTask("high-priority", { areas: ["backend"], priority: "high" }),
+        ];
+        const result = suggestSafeOrder(tasks);
+        expect(result.orderedTasks[0].id).toBe("high-priority");
+        expect(result.orderedTasks[1].id).toBe("low-priority");
+    });
+    test("groups tasks into phases by tech level", () => {
+        const tasks = [
+            createTask("schema1", { areas: ["schema"] }),
+            createTask("schema2", { areas: ["schema"] }),
+            createTask("backend1", { areas: ["backend"] }),
+        ];
+        const result = suggestSafeOrder(tasks);
+        expect(result.phases.length).toBe(2);
+        expect(result.phases[0].primaryArea).toBe("schema");
+        expect(result.phases[0].tasks.length).toBe(2);
+        expect(result.phases[1].primaryArea).toBe("backend");
+        expect(result.phases[1].tasks.length).toBe(1);
+    });
+    test("calculates summary statistics correctly", () => {
+        const tasks = [
+            createTask("t1", { areas: ["backend"], hasBreakingChange: true }),
+            createTask("t2", { areas: ["backend"], riskLevel: "high" }),
+            createTask("t3", { areas: ["backend"], riskLevel: "critical" }),
+            createTask("t4", { areas: ["backend"] }),
+        ];
+        const result = suggestSafeOrder(tasks);
+        expect(result.summary.totalTasks).toBe(4);
+        expect(result.summary.breakingChanges).toBe(1);
+        expect(result.summary.highRiskCount).toBe(2);
+    });
+});
+describe("findBreakingChanges", () => {
+    test("returns empty for no breaking changes", () => {
+        const tasks = [
+            createTask("t1", { areas: ["backend"], hasBreakingChange: false }),
+            createTask("t2", { areas: ["backend"] }),
+        ];
+        const result = findBreakingChanges(tasks);
+        expect(result).toEqual([]);
+    });
+    test("finds tasks with breaking changes", () => {
+        const tasks = [
+            createTask("t1", { areas: ["backend"], hasBreakingChange: true }),
+            createTask("t2", { areas: ["backend"], hasBreakingChange: false }),
+            createTask("t3", { areas: ["schema"], hasBreakingChange: true }),
+        ];
+        const result = findBreakingChanges(tasks);
+        expect(result.length).toBe(2);
+        expect(result.map((t) => t.id).sort()).toEqual(["t1", "t3"]);
+    });
+    test("excludes completed tasks", () => {
+        const tasks = [
+            createTask("t1", { status: "completed", areas: ["backend"], hasBreakingChange: true }),
+            createTask("t2", { status: "pending", areas: ["backend"], hasBreakingChange: true }),
+        ];
+        const result = findBreakingChanges(tasks);
+        expect(result.length).toBe(1);
+        expect(result[0].id).toBe("t2");
+    });
+});
+describe("findHighRiskTasks", () => {
+    test("returns empty for no high-risk tasks", () => {
+        const tasks = [
+            createTask("t1", { areas: ["backend"], riskLevel: "low" }),
+            createTask("t2", { areas: ["backend"], riskLevel: "medium" }),
+        ];
+        const result = findHighRiskTasks(tasks);
+        expect(result).toEqual([]);
+    });
+    test("finds high and critical risk tasks", () => {
+        const tasks = [
+            createTask("t1", { areas: ["backend"], riskLevel: "low" }),
+            createTask("t2", { areas: ["backend"], riskLevel: "high" }),
+            createTask("t3", { areas: ["backend"], riskLevel: "critical" }),
+        ];
+        const result = findHighRiskTasks(tasks);
+        expect(result.length).toBe(2);
+        expect(result.map((t) => t.id).sort()).toEqual(["t2", "t3"]);
+    });
+});
+describe("groupByTechArea", () => {
+    test("returns all areas with empty arrays for empty input", () => {
+        const result = groupByTechArea([]);
+        expect(result.get("schema")).toEqual([]);
+        expect(result.get("backend")).toEqual([]);
+        expect(result.get("frontend")).toEqual([]);
+    });
+    test("groups tasks by their tech areas", () => {
+        const tasks = [
+            createTask("t1", { areas: ["backend"] }),
+            createTask("t2", { areas: ["backend"] }),
+            createTask("t3", { areas: ["frontend"] }),
+        ];
+        const result = groupByTechArea(tasks);
+        expect(result.get("backend").length).toBe(2);
+        expect(result.get("frontend").length).toBe(1);
+        expect(result.get("schema").length).toBe(0);
+    });
+    test("task appears in multiple groups if it spans multiple areas", () => {
+        const tasks = [createTask("fullstack", { areas: ["backend", "frontend"] })];
+        const result = groupByTechArea(tasks);
+        expect(result.get("backend").length).toBe(1);
+        expect(result.get("frontend").length).toBe(1);
+        expect(result.get("backend")[0].id).toBe("fullstack");
+    });
+    test("defaults to backend if no area specified", () => {
+        const tasks = [createTask("t1", {})];
+        const result = groupByTechArea(tasks);
+        expect(result.get("backend").length).toBe(1);
+    });
+    test("excludes completed tasks", () => {
+        const tasks = [
+            createTask("t1", { status: "completed", areas: ["backend"] }),
+            createTask("t2", { status: "pending", areas: ["backend"] }),
+        ];
+        const result = groupByTechArea(tasks);
+        expect(result.get("backend").length).toBe(1);
+    });
+});
+describe("getComplexitySummary", () => {
+    test("returns empty summary for no tasks", () => {
+        const result = getComplexitySummary([]);
+        expect(result.distribution).toEqual({ low: 0, medium: 0, high: 0 });
+        expect(result.needsBreakdown).toEqual([]);
+        expect(result.averageScore).toBe(0);
+        expect(result.unanalyzed).toEqual([]);
+    });
+    test("calculates distribution correctly", () => {
+        const tasks = [
+            createTask("t1", { complexityScore: 2 }), // low
+            createTask("t2", { complexityScore: 3 }), // low
+            createTask("t3", { complexityScore: 5 }), // medium
+            createTask("t4", { complexityScore: 8 }), // high
+        ];
+        const result = getComplexitySummary(tasks);
+        expect(result.distribution.low).toBe(2);
+        expect(result.distribution.medium).toBe(1);
+        expect(result.distribution.high).toBe(1);
+    });
+    test("identifies tasks needing breakdown (score >= 7)", () => {
+        const tasks = [
+            createTask("t1", { complexityScore: 6 }),
+            createTask("t2", { complexityScore: 7 }),
+            createTask("t3", { complexityScore: 9 }),
+        ];
+        const result = getComplexitySummary(tasks);
+        expect(result.needsBreakdown.length).toBe(2);
+        expect(result.needsBreakdown.map((t) => t.id).sort()).toEqual(["t2", "t3"]);
+    });
+    test("calculates average score correctly", () => {
+        const tasks = [
+            createTask("t1", { complexityScore: 2 }),
+            createTask("t2", { complexityScore: 6 }),
+            createTask("t3", { complexityScore: 10 }),
+        ];
+        const result = getComplexitySummary(tasks);
+        expect(result.averageScore).toBe(6); // (2+6+10)/3
+    });
+    test("identifies unanalyzed tasks", () => {
+        const tasks = [createTask("analyzed", { complexityScore: 5 }), createTask("not-analyzed", {})];
+        const result = getComplexitySummary(tasks);
+        expect(result.unanalyzed.length).toBe(1);
+        expect(result.unanalyzed[0].id).toBe("not-analyzed");
+    });
+    test("excludes completed tasks", () => {
+        const tasks = [
+            createTask("t1", { status: "completed", complexityScore: 10 }),
+            createTask("t2", { status: "pending", complexityScore: 5 }),
+        ];
+        const result = getComplexitySummary(tasks);
+        expect(result.distribution.high).toBe(0);
+        expect(result.distribution.medium).toBe(1);
+    });
+});
+describe("getTechStackSummary", () => {
+    test("returns empty summary for no tasks", () => {
+        const result = getTechStackSummary([]);
+        expect(result.areaCounts.schema).toBe(0);
+        expect(result.breakingChanges).toEqual([]);
+        expect(result.unanalyzed).toEqual([]);
+    });
+    test("counts tasks by area correctly", () => {
+        const tasks = [
+            createTask("t1", { areas: ["backend"] }),
+            createTask("t2", { areas: ["backend", "frontend"] }),
+            createTask("t3", { areas: ["schema"] }),
+        ];
+        const result = getTechStackSummary(tasks);
+        expect(result.areaCounts.backend).toBe(2);
+        expect(result.areaCounts.frontend).toBe(1);
+        expect(result.areaCounts.schema).toBe(1);
+    });
+    test("tracks risk distribution", () => {
+        const tasks = [
+            createTask("t1", { areas: ["backend"], riskLevel: "low" }),
+            createTask("t2", { areas: ["backend"], riskLevel: "medium" }),
+            createTask("t3", { areas: ["backend"], riskLevel: "high" }),
+        ];
+        const result = getTechStackSummary(tasks);
+        expect(result.riskDistribution.low).toBe(1);
+        expect(result.riskDistribution.medium).toBe(1);
+        expect(result.riskDistribution.high).toBe(1);
+    });
+    test("identifies breaking changes", () => {
+        const tasks = [
+            createTask("t1", { areas: ["backend"], hasBreakingChange: true }),
+            createTask("t2", { areas: ["backend"], hasBreakingChange: false }),
+        ];
+        const result = getTechStackSummary(tasks);
+        expect(result.breakingChanges.length).toBe(1);
+        expect(result.breakingChanges[0].id).toBe("t1");
+    });
+    test("identifies unanalyzed tasks", () => {
+        const tasks = [createTask("analyzed", { areas: ["backend"] }), createTask("not-analyzed", {})];
+        const result = getTechStackSummary(tasks);
+        expect(result.unanalyzed.length).toBe(1);
+        expect(result.unanalyzed[0].id).toBe("not-analyzed");
+    });
+});
+describe("suggestSubtaskCount", () => {
+    test("returns 0 for very low complexity (1-2)", () => {
+        expect(suggestSubtaskCount(1)).toBe(0);
+        expect(suggestSubtaskCount(2)).toBe(0);
+    });
+    test("returns 2 for low complexity (3-4)", () => {
+        expect(suggestSubtaskCount(3)).toBe(2);
+        expect(suggestSubtaskCount(4)).toBe(2);
+    });
+    test("returns 3-4 for medium complexity (5-6)", () => {
+        expect(suggestSubtaskCount(5)).toBe(4);
+        expect(suggestSubtaskCount(6)).toBe(4);
+    });
+    test("returns 5-6 for high complexity (7-8)", () => {
+        expect(suggestSubtaskCount(7)).toBe(6);
+        expect(suggestSubtaskCount(8)).toBe(6);
+    });
+    test("returns 7-10 for very high complexity (9-10)", () => {
+        expect(suggestSubtaskCount(9)).toBe(9);
+        expect(suggestSubtaskCount(10)).toBe(10);
+    });
+});
+//# sourceMappingURL=tech-analysis.test.js.map

package/dist/algorithms/tech-analysis.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tech-analysis.test.js","sourceRoot":"","sources":["../../src/algorithms/tech-analysis.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAClD,OAAO,EACL,gBAAgB,EAChB,mBAAmB,EACnB,iBAAiB,EACjB,eAAe,EACf,oBAAoB,EACpB,mBAAmB,EACnB,mBAAmB,GACpB,MAAM,oBAAoB,CAAC;AAG5B,uDAAuD;AACvD,SAAS,UAAU,CACjB,EAAU,EACV,UAOI,EAAE;IAEN,MAAM,IAAI,GAAS;QACjB,EAAE;QACF,KAAK,EAAE,QAAQ,EAAE,EAAE;QACnB,MAAM,EAAE,OAAO,CAAC,MAAM,IAAI,SAAS;QACnC,QAAQ,EAAE,OAAO,CAAC,QAAQ,IAAI,QAAQ;QACtC,SAAS,EAAE,gBAAgB;QAC3B,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QACnC,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;KACpC,CAAC;IAEF,IAAI,OAAO,CAAC,KAAK,IAAI,OAAO,CAAC,SAAS,KAAK,SAAS,IAAI,OAAO,CAAC,iBAAiB,KAAK,SAAS,EAAE,CAAC;QAChG,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;QACpB,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;YAClB,IAAI,CAAC,SAAS,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;QACvC,CAAC;QACD,IAAI,OAAO,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;YACpC,IAAI,CAAC,SAAS,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC;QAC/C,CAAC;QACD,IAAI,OAAO,CAAC,iBAAiB,KAAK,SAAS,EAAE,CAAC;YAC5C,IAAI,CAAC,SAAS,CAAC,iBAAiB,GAAG,OAAO,CAAC,iBAAiB,CAAC;QAC/D,CAAC;IACH,CAAC;IAED,IAAI,OAAO,CAAC,eAAe,KAAK,SAAS,EAAE,CAAC;QAC1C,IAAI,CAAC,UAAU,GAAG;YAChB,KAAK,EAAE,OAAO,CAAC,eAAe;SAC/B,CAAC;IACJ,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;IAChC,IAAI,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAChD,MAAM,MAAM,GAAG,gBAAgB,CAAC,EAAE,CAAC,CAAC;QACpC,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACxC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAClC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,uCAAuC,EAAE,GAAG,EAAE;QACjD,MAAM,KAAK,GAAG,CAAC,UAAU,CAAC,GAAG,EAAE,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC;QACzD,MAAM,MAAM,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;QACvC,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,8CAA8C,EAAE,GAAG,EAAE;QACxD,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,cAAc,EAAE,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC;YAClD,UAAU,CAAC,aAAa,EAAE,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC;SACjD,CAAC;QACF,MAAM,MAAM,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;QAEvC,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QACvD,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC7C,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,UAAU,EAAE,EAAE,KAAK,EAAE,CAAC,UAAU,CAAC,EAAE,CAAC;YAC/C,UAAU,CAAC,SAAS,EAAE,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC;YAC7C,UAAU,CAAC,QAAQ,EAAE,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC3C,UAAU,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC;YACvC,UAAU,CAAC,QAAQ,EAAE,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC;SAC5C,CAAC;QACF,MAAM,MAAM,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;QAEvC,MAAM,KAAK,GAAG,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACnD,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,CAAC,CAAC,CAAC;IAC7E,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACvD,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,WAAW,EAAE,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC;YAClE,UAAU,CAAC,UAAU,EAAE,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;YAChE,UAAU,CAAC,aAAa,EAAE,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,SAAS,EAAE,QAAQ,EAAE,CAAC;SACvE,CAAC;QACF,MAAM,MAAM,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;QAEvC,MAAM,KAAK,GAAG,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACnD,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,UAAU,EAAE,aAAa,EAAE,WAAW,CAAC,CAAC,CAAC;IAClE,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,wDAAwD,EAAE,GAAG,EAAE;QAClE,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,UAAU,EAAE,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC;YACzF,UAAU,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,iBAAiB,EAAE,KAAK,EAAE,CAAC;SACvF,CAAC;QACF,MAAM,MAAM,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;QAEvC,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAChD,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACvC,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,cAAc,EAAE,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;YACnE,UAAU,CAAC,eAAe,EAAE,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC;SACtE,CAAC;QACF,MAAM,MAAM,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;QAEvC,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;QACzD,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,wCAAwC,EAAE,GAAG,EAAE;QAClD,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,SAAS,EAAE,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC5C,UAAU,CAAC,SAAS,EAAE,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC5C,UAAU,CAAC,UAAU,EAAE,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC;SAC/C,CAAC;QACF,MAAM,MAAM,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;QAEvC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACrD,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACtD,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,yCAAyC,EAAE,GAAG,EAAE;QACnD,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC;YACjE,UAAU,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC;YAC3D,UAAU,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,SAAS,EAAE,UAAU,EAAE,CAAC;YAC/D,UAAU,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC;SACzC,CAAC;QACF,MAAM,MAAM,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;QAEvC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;IACnC,IAAI,CAAC,uCAAuC,EAAE,GAAG,EAAE;QACjD,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,iBAAiB,EAAE,KAAK,EAAE,CAAC;YAClE,UAAU,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC;SACzC,CAAC;QACF,MAAM,MAAM,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;QAC1C,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC7C,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC;YACjE,UAAU,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,iBAAiB,EAAE,KAAK,EAAE,CAAC;YAClE,UAAU,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC;SACjE,CAAC;QACF,MAAM,MAAM,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;QAC1C,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;IAC/D,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,0BAA0B,EAAE,GAAG,EAAE;QACpC,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC;YACtF,UAAU,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC;SACrF,CAAC;QACF,MAAM,MAAM,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;QAC1C,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,IAAI,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;IACjC,IAAI,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAChD,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;YAC1D,UAAU,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,SAAS,EAAE,QAAQ,EAAE,CAAC;SAC9D,CAAC;QACF,MAAM,MAAM,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;QACxC,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC9C,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;YAC1D,UAAU,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC;YAC3D,UAAU,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,SAAS,EAAE,UAAU,EAAE,CAAC;SAChE,CAAC;QACF,MAAM,MAAM,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;QACxC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;IAC/D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;IAC/B,IAAI,CAAC,qDAAqD,EAAE,GAAG,EAAE;QAC/D,MAAM,MAAM,GAAG,eAAe,CAAC,EAAE,CAAC,CAAC;QACnC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACzC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC1C,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,kCAAkC,EAAE,GAAG,EAAE;QAC5C,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC;YACxC,UAAU,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC;YACxC,UAAU,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,UAAU,CAAC,EAAE,CAAC;SAC1C,CAAC;QACF,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QAEtC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9C,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,4DAA4D,EAAE,GAAG,EAAE;QACtE,MAAM,KAAK,GAAG,CAAC,UAAU,CAAC,WAAW,EAAE,EAAE,KAAK,EAAE,CAAC,SAAS,EAAE,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5E,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QAEtC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9C,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,0CAA0C,EAAE,GAAG,EAAE;QACpD,MAAM,KAAK,GAAG,CAAC,UAAU,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;QACrC,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QACtC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,0BAA0B,EAAE,GAAG,EAAE;QACpC,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC;YAC7D,UAAU,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC;SAC5D,CAAC;QACF,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QACtC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,sBAAsB,EAAE,GAAG,EAAE;IACpC,IAAI,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC9C,MAAM,MAAM,GAAG,oBAAoB,CAAC,EAAE,CAAC,CAAC;QACxC,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;QACpE,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC1C,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC7C,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,IAAI,EAAE,EAAE,eAAe,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM;YAChD,UAAU,CAAC,IAAI,EAAE,EAAE,eAAe,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM;YAChD,UAAU,CAAC,IAAI,EAAE,EAAE,eAAe,EAAE,CAAC,EAAE,CAAC,EAAE,SAAS;YACnD,UAAU,CAAC,IAAI,EAAE,EAAE,eAAe,EAAE,CAAC,EAAE,CAAC,EAAE,OAAO;SAClD,CAAC;QACF,MAAM,MAAM,GAAG,oBAAoB,CAAC,KAAK,CAAC,CAAC;QAE3C,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxC,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,iDAAiD,EAAE,GAAG,EAAE;QAC3D,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,IAAI,EAAE,EAAE,eAAe,EAAE,CAAC,EAAE,CAAC;YACxC,UAAU,CAAC,IAAI,EAAE,EAAE,eAAe,EAAE,CAAC,EAAE,CAAC;YACxC,UAAU,CAAC,IAAI,EAAE,EAAE,eAAe,EAAE,CAAC,EAAE,CAAC;SACzC,CAAC;QACF,MAAM,MAAM,GAAG,oBAAoB,CAAC,KAAK,CAAC,CAAC;QAE3C,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7C,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;IAC9E,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC9C,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,IAAI,EAAE,EAAE,eAAe,EAAE,CAAC,EAAE,CAAC;YACxC,UAAU,CAAC,IAAI,EAAE,EAAE,eAAe,EAAE,CAAC,EAAE,CAAC;YACxC,UAAU,CAAC,IAAI,EAAE,EAAE,eAAe,EAAE,EAAE,EAAE,CAAC;SAC1C,CAAC;QACF,MAAM,MAAM,GAAG,oBAAoB,CAAC,KAAK,CAAC,CAAC;QAE3C,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa;IACpD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACvC,MAAM,KAAK,GAAG,CAAC,UAAU,CAAC,UAAU,EAAE,EAAE,eAAe,EAAE,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC,CAAC;QAC/F,MAAM,MAAM,GAAG,oBAAoB,CAAC,KAAK,CAAC,CAAC;QAE3C,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,0BAA0B,EAAE,GAAG,EAAE;QACpC,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,WAAW,EAAE,eAAe,EAAE,EAAE,EAAE,CAAC;YAC9D,UAAU,CAAC,IAAI,EAAE,EAAE,MAAM,EAAE,SAAS,EAAE,eAAe,EAAE,CAAC,EAAE,CAAC;SAC5D,CAAC;QACF,MAAM,MAAM,GAAG,oBAAoB,CAAC,KAAK,CAAC,CAAC;QAE3C,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;IACnC,IAAI,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC9C,MAAM,MAAM,GAAG,mBAAmB,CAAC,EAAE,CAAC,CAAC;QACvC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC3C,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,gCAAgC,EAAE,GAAG,EAAE;QAC1C,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC;YACxC,UAAU,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,SAAS,EAAE,UAAU,CAAC,EAAE,CAAC;YACpD,UAAU,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC;SACxC,CAAC;QACF,MAAM,MAAM,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;QAE1C,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1C,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,0BAA0B,EAAE,GAAG,EAAE;QACpC,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;YAC1D,UAAU,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,SAAS,EAAE,QAAQ,EAAE,CAAC;YAC7D,UAAU,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC;SAC5D,CAAC;QACF,MAAM,MAAM,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;QAE1C,MAAM,CAAC,MAAM,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5C,MAAM,CAAC,MAAM,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,MAAM,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACvC,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,iBAAiB,EAAE,IAAI,EAAE,CAAC;YACjE,UAAU,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,iBAAiB,EAAE,KAAK,EAAE,CAAC;SACnE,CAAC;QACF,MAAM,MAAM,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;QAE1C,MAAM,CAAC,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9C,MAAM,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACvC,MAAM,KAAK,GAAG,CAAC,UAAU,CAAC,UAAU,EAAE,EAAE,KAAK,EAAE,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC,CAAC;QAC/F,MAAM,MAAM,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;QAE1C,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;IACnC,IAAI,CAAC,yCAAyC,EAAE,GAAG,EAAE;QACnD,MAAM,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvC,MAAM,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC9C,MAAM,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvC,MAAM,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,yCAAyC,EAAE,GAAG,EAAE;QACnD,MAAM,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvC,MAAM,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,uCAAuC,EAAE,GAAG,EAAE;QACjD,MAAM,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvC,MAAM,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,8CAA8C,EAAE,GAAG,EAAE;QACxD,MAAM,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvC,MAAM,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

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

@@ -0,0 +1,58 @@
+import type { Task } from "../schemas/task.js";
+/**
+ * Node representation for graph algorithms
+ */
+export interface TaskNode {
+    id: string;
+    dependencies: string[];
+    priority: number;
+    estimate: number;
+}
+/**
+ * Convert priority string to numeric value
+ */
+export declare function priorityToNumber(priority: string): number;
+/**
+ * Convert Task to TaskNode
+ */
+export declare function taskToNode(task: Task): TaskNode;
+/**
+ * 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 declare function topologicalSort(tasks: Task[]): Task[];
+/**
+ * Detect if adding a dependency would create a cycle
+ */
+export declare function wouldCreateCycle(tasks: Task[], fromId: string, toId: string): boolean;
+/**
+ * Build inverted indices for efficient dependency lookups
+ * Returns:
+ * - dependentsIndex: taskId -> [tasks that depend on this task]
+ * - dependenciesIndex: taskId -> [tasks this task depends on]
+ *
+ * Time complexity: O(n + e) where n = tasks, e = edges
+ */
+export declare function buildDependencyIndices(tasks: Task[]): {
+    taskMap: Map<string, Task>;
+    dependentsIndex: Map<string, string[]>;
+    dependenciesIndex: Map<string, string[]>;
+};
+/**
+ * Find all tasks that depend on a given task (directly or transitively)
+ *
+ * Time complexity: O(n + e) with inverted index
+ */
+export declare function findDependents(tasks: Task[], taskId: string): Task[];
+/**
+ * Find all tasks that a given task depends on (directly or transitively)
+ *
+ * Time complexity: O(n + e) with pre-built index
+ */
+export declare function findDependencies(tasks: Task[], taskId: string): Task[];
+//# sourceMappingURL=topological-sort.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"topological-sort.d.ts","sourceRoot":"","sources":["../../src/algorithms/topological-sort.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,oBAAoB,CAAC;AAG/C;;GAEG;AACH,MAAM,WAAW,QAAQ;IACvB,EAAE,EAAE,MAAM,CAAC;IACX,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,CAQzD;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,IAAI,GAAG,QAAQ,CAS/C;AAED;;;;;;;;GAQG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,EAAE,CA+DrD;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAkBrF;AAED;;;;;;;GAOG;AACH,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG;IACrD,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAC3B,eAAe,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IACvC,iBAAiB,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;CAC1C,CAiCA;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,EAAE,CAwBpE;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,EAAE,CAwBtE"}

package/dist/algorithms/topological-sort.js

@@ -0,0 +1,201 @@
+import { PriorityQueue } from "../utils/priority-queue.js";
+/**
+ * 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 priority queue with nodes that have no dependencies
+    // Using max-heap: higher priority comes out first
+    const queue = new PriorityQueue((a, b) => a.priority - b.priority);
+    for (const node of nodes) {
+        if (inDegree.get(node.id) === 0) {
+            queue.push(node);
+        }
+    }
+    const result = [];
+    while (queue.length > 0) {
+        const current = queue.pop();
+        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); // O(log n) insertion maintains heap property
+            }
+        }
+    }
+    // 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;
+    }
+}
+/**
+ * Build inverted indices for efficient dependency lookups
+ * Returns:
+ * - dependentsIndex: taskId -> [tasks that depend on this task]
+ * - dependenciesIndex: taskId -> [tasks this task depends on]
+ *
+ * Time complexity: O(n + e) where n = tasks, e = edges
+ */
+export function buildDependencyIndices(tasks) {
+    const taskMap = new Map();
+    const dependentsIndex = new Map();
+    const dependenciesIndex = new Map();
+    // Initialize maps - O(n)
+    for (const task of tasks) {
+        taskMap.set(task.id, task);
+        dependentsIndex.set(task.id, []);
+        dependenciesIndex.set(task.id, []);
+    }
+    // Build indices - O(e)
+    for (const task of tasks) {
+        const deps = (task.dependencies ?? [])
+            .filter((d) => d.type === "blocked_by")
+            .map((d) => d.taskId);
+        // Store direct dependencies for this task
+        dependenciesIndex.set(task.id, deps.filter((depId) => taskMap.has(depId)));
+        // Update dependents index (reverse lookup)
+        for (const depId of deps) {
+            if (taskMap.has(depId)) {
+                dependentsIndex.get(depId).push(task.id);
+            }
+        }
+    }
+    return { taskMap, dependentsIndex, dependenciesIndex };
+}
+/**
+ * Find all tasks that depend on a given task (directly or transitively)
+ *
+ * Time complexity: O(n + e) with inverted index
+ */
+export function findDependents(tasks, taskId) {
+    const { taskMap, dependentsIndex } = buildDependencyIndices(tasks);
+    const visited = new Set();
+    const result = [];
+    function dfs(id) {
+        const dependentIds = dependentsIndex.get(id);
+        if (!dependentIds)
+            return;
+        for (const depId of dependentIds) {
+            if (!visited.has(depId)) {
+                visited.add(depId);
+                const task = taskMap.get(depId);
+                if (task) {
+                    result.push(task);
+                    dfs(depId);
+                }
+            }
+        }
+    }
+    dfs(taskId);
+    return result;
+}
+/**
+ * Find all tasks that a given task depends on (directly or transitively)
+ *
+ * Time complexity: O(n + e) with pre-built index
+ */
+export function findDependencies(tasks, taskId) {
+    const { taskMap, dependenciesIndex } = buildDependencyIndices(tasks);
+    const visited = new Set();
+    const result = [];
+    function dfs(id) {
+        const depIds = dependenciesIndex.get(id);
+        if (!depIds)
+            return;
+        for (const depId of depIds) {
+            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":"AACA,OAAO,EAAE,aAAa,EAAE,MAAM,4BAA4B,CAAC;AAY3D;;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,iEAAiE;IACjE,kDAAkD;IAClD,MAAM,KAAK,GAAG,IAAI,aAAa,CAAW,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;IAC7E,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,MAAM,MAAM,GAAW,EAAE,CAAC;IAE1B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QAC7B,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,CAAC,6CAA6C;YACzE,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,CAAC,KAAa,EAAE,MAAc,EAAE,IAAY;IAC1E,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,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,IAAI,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,YAAqB,EAAE,CAAC;aACzF,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;;;;;;;GAOG;AACH,MAAM,UAAU,sBAAsB,CAAC,KAAa;IAKlD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAgB,CAAC;IACxC,MAAM,eAAe,GAAG,IAAI,GAAG,EAAoB,CAAC;IACpD,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAoB,CAAC;IAEtD,yBAAyB;IACzB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC3B,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACjC,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IACrC,CAAC;IAED,uBAAuB;IACvB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,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,0CAA0C;QAC1C,iBAAiB,CAAC,GAAG,CACnB,IAAI,CAAC,EAAE,EACP,IAAI,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAC3C,CAAC;QAEF,2CAA2C;QAC3C,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YACzB,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACvB,eAAe,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,eAAe,EAAE,iBAAiB,EAAE,CAAC;AACzD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAAC,KAAa,EAAE,MAAc;IAC1D,MAAM,EAAE,OAAO,EAAE,eAAe,EAAE,GAAG,sBAAsB,CAAC,KAAK,CAAC,CAAC;IAEnE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,MAAM,GAAW,EAAE,CAAC;IAE1B,SAAS,GAAG,CAAC,EAAU;QACrB,MAAM,YAAY,GAAG,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC7C,IAAI,CAAC,YAAY;YAAE,OAAO;QAE1B,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;YACjC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACxB,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBACnB,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBAChC,IAAI,IAAI,EAAE,CAAC;oBACT,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAClB,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;AAED;;;;GAIG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAa,EAAE,MAAc;IAC5D,MAAM,EAAE,OAAO,EAAE,iBAAiB,EAAE,GAAG,sBAAsB,CAAC,KAAK,CAAC,CAAC;IAErE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,MAAM,GAAW,EAAE,CAAC;IAE1B,SAAS,GAAG,CAAC,EAAU;QACrB,MAAM,MAAM,GAAG,iBAAiB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACzC,IAAI,CAAC,MAAM;YAAE,OAAO;QAEpB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,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":""}