@task-mcp/shared 1.0.20 → 1.0.21

package/dist/utils/date.test.js

@@ -1,276 +0,0 @@
-import { describe, test, expect } from "bun:test";
-import { now, parseRelativeDate, parseRelativeDateSafe, parseDateString, formatDate, formatDisplayDate, isToday, isPastDue, isWithinDays, isValidDate, DateParseError, } from "./date.js";
-describe("now", () => {
-    test("returns ISO timestamp string", () => {
-        const result = now();
-        expect(typeof result).toBe("string");
-        expect(result).toMatch(/^\d{4}-\d{2}-\d{2}T\d{2}:\d{2}:\d{2}\.\d{3}Z$/);
-    });
-    test("returns current time within tolerance", () => {
-        const before = Date.now();
-        const result = now();
-        const after = Date.now();
-        const resultTime = new Date(result).getTime();
-        expect(resultTime).toBeGreaterThanOrEqual(before);
-        expect(resultTime).toBeLessThanOrEqual(after);
-    });
-});
-describe("parseRelativeDate", () => {
-    test("parses 'today'", () => {
-        const result = parseRelativeDate("today");
-        expect(result).not.toBeNull();
-        const today = new Date();
-        expect(result.getDate()).toBe(today.getDate());
-    });
-    test("parses '오늘' (Korean today)", () => {
-        const result = parseRelativeDate("오늘");
-        expect(result).not.toBeNull();
-        const today = new Date();
-        expect(result.getDate()).toBe(today.getDate());
-    });
-    test("parses 'tomorrow'", () => {
-        const result = parseRelativeDate("tomorrow");
-        expect(result).not.toBeNull();
-        const tomorrow = new Date();
-        tomorrow.setDate(tomorrow.getDate() + 1);
-        expect(result.getDate()).toBe(tomorrow.getDate());
-    });
-    test("parses '내일' (Korean tomorrow)", () => {
-        const result = parseRelativeDate("내일");
-        expect(result).not.toBeNull();
-        const tomorrow = new Date();
-        tomorrow.setDate(tomorrow.getDate() + 1);
-        expect(result.getDate()).toBe(tomorrow.getDate());
-    });
-    test("parses 'yesterday'", () => {
-        const result = parseRelativeDate("yesterday");
-        expect(result).not.toBeNull();
-        const yesterday = new Date();
-        yesterday.setDate(yesterday.getDate() - 1);
-        expect(result.getDate()).toBe(yesterday.getDate());
-    });
-    test("parses 'next week'", () => {
-        const result = parseRelativeDate("next week");
-        expect(result).not.toBeNull();
-        const nextWeek = new Date();
-        nextWeek.setDate(nextWeek.getDate() + 7);
-        expect(result.getDate()).toBe(nextWeek.getDate());
-    });
-    test("parses 'in 3 days'", () => {
-        const result = parseRelativeDate("in 3 days");
-        expect(result).not.toBeNull();
-        const future = new Date();
-        future.setDate(future.getDate() + 3);
-        expect(result.getDate()).toBe(future.getDate());
-    });
-    test("parses '5일 후' (Korean days later)", () => {
-        const result = parseRelativeDate("5일 후");
-        expect(result).not.toBeNull();
-        const future = new Date();
-        future.setDate(future.getDate() + 5);
-        expect(result.getDate()).toBe(future.getDate());
-    });
-    test("parses weekday names", () => {
-        const result = parseRelativeDate("monday");
-        expect(result).not.toBeNull();
-        expect(result.getDay()).toBe(1); // Monday = 1
-    });
-    test("parses ISO date string", () => {
-        const result = parseRelativeDate("2025-12-31");
-        expect(result).not.toBeNull();
-        expect(result.getFullYear()).toBe(2025);
-        expect(result.getMonth()).toBe(11); // December = 11
-        expect(result.getDate()).toBe(31);
-    });
-    test("returns null for invalid input", () => {
-        const result = parseRelativeDate("invalid date string");
-        expect(result).toBeNull();
-    });
-});
-describe("parseRelativeDateSafe", () => {
-    test("returns success result for valid date", () => {
-        const result = parseRelativeDateSafe("tomorrow");
-        expect(result.success).toBe(true);
-        if (result.success === true) {
-            const tomorrow = new Date();
-            tomorrow.setDate(tomorrow.getDate() + 1);
-            expect(result.date.getDate()).toBe(tomorrow.getDate());
-        }
-    });
-    test("returns error for empty input", () => {
-        const result = parseRelativeDateSafe("");
-        expect(result.success).toBe(false);
-        if (result.success === false) {
-            expect(result.reason).toBe("empty_input");
-            expect(result.error).toContain("empty");
-        }
-    });
-    test("returns error for whitespace-only input", () => {
-        const result = parseRelativeDateSafe("   ");
-        expect(result.success).toBe(false);
-        if (result.success === false) {
-            expect(result.reason).toBe("empty_input");
-        }
-    });
-    test("returns error for invalid date format", () => {
-        const result = parseRelativeDateSafe("not a date");
-        expect(result.success).toBe(false);
-        if (result.success === false) {
-            expect(result.reason).toBe("invalid_format");
-            expect(result.error).toContain("Supported formats");
-        }
-    });
-    test("returns error for malformed ISO date", () => {
-        const result = parseRelativeDateSafe("2025-1-5");
-        expect(result.success).toBe(false);
-        if (result.success === false) {
-            expect(result.reason).toBe("invalid_format");
-            expect(result.error).toContain("zero-padded");
-        }
-    });
-    test("returns error for invalid date like Feb 30", () => {
-        const result = parseRelativeDateSafe("2025-02-30");
-        expect(result.success).toBe(false);
-        if (result.success === false) {
-            expect(result.reason).toBe("invalid_date");
-            expect(result.error).toContain("February 30");
-        }
-    });
-    test("returns error for year out of range", () => {
-        const result = parseRelativeDateSafe("1800-01-01");
-        expect(result.success).toBe(false);
-        if (result.success === false) {
-            expect(result.reason).toBe("out_of_range");
-            expect(result.error).toContain("1900-2100");
-        }
-    });
-    test("returns error for excessive day offset", () => {
-        const result = parseRelativeDateSafe("in 5000 days");
-        expect(result.success).toBe(false);
-        if (result.success === false) {
-            expect(result.reason).toBe("out_of_range");
-            expect(result.error).toContain("3650");
-        }
-    });
-});
-describe("isValidDate", () => {
-    test("returns true for valid Date", () => {
-        expect(isValidDate(new Date())).toBe(true);
-        expect(isValidDate(new Date("2025-01-01"))).toBe(true);
-    });
-    test("returns false for Invalid Date", () => {
-        expect(isValidDate(new Date("invalid"))).toBe(false);
-        expect(isValidDate(new Date(NaN))).toBe(false);
-    });
-});
-describe("parseDateString", () => {
-    test("parses valid date string", () => {
-        const result = parseDateString("2025-01-15");
-        expect(result).toBeInstanceOf(Date);
-        expect(result.getFullYear()).toBe(2025);
-    });
-    test("throws DateParseError for empty string", () => {
-        expect(() => parseDateString("")).toThrow(DateParseError);
-        try {
-            parseDateString("");
-        }
-        catch (e) {
-            expect(e).toBeInstanceOf(DateParseError);
-            expect(e.reason).toBe("empty_input");
-        }
-    });
-    test("throws DateParseError for invalid string", () => {
-        expect(() => parseDateString("not a date")).toThrow(DateParseError);
-        try {
-            parseDateString("not a date");
-        }
-        catch (e) {
-            expect(e).toBeInstanceOf(DateParseError);
-            expect(e.reason).toBe("invalid_format");
-            expect(e.input).toBe("not a date");
-        }
-    });
-});
-describe("formatDisplayDate error handling", () => {
-    test("throws DateParseError for invalid string", () => {
-        expect(() => formatDisplayDate("invalid")).toThrow(DateParseError);
-    });
-    test("throws DateParseError for Invalid Date object", () => {
-        expect(() => formatDisplayDate(new Date("invalid"))).toThrow(DateParseError);
-    });
-    test("formats valid string date", () => {
-        const result = formatDisplayDate("2025-06-15");
-        expect(typeof result).toBe("string");
-        expect(result).toMatch(/\d+\/\d+\/\d+/);
-    });
-});
-describe("formatDate", () => {
-    test("formats date as YYYY-MM-DD", () => {
-        const date = new Date("2025-06-15T10:30:00");
-        expect(formatDate(date)).toBe("2025-06-15");
-    });
-});
-describe("isToday", () => {
-    test("returns true for today", () => {
-        expect(isToday(new Date())).toBe(true);
-    });
-    test("returns false for tomorrow", () => {
-        const tomorrow = new Date();
-        tomorrow.setDate(tomorrow.getDate() + 1);
-        expect(isToday(tomorrow)).toBe(false);
-    });
-    test("accepts string input", () => {
-        expect(isToday(new Date().toISOString())).toBe(true);
-    });
-    test("returns false for invalid date string", () => {
-        expect(isToday("invalid")).toBe(false);
-    });
-    test("returns false for Invalid Date object", () => {
-        expect(isToday(new Date("invalid"))).toBe(false);
-    });
-});
-describe("isPastDue", () => {
-    test("returns true for yesterday", () => {
-        const yesterday = new Date();
-        yesterday.setDate(yesterday.getDate() - 1);
-        expect(isPastDue(yesterday)).toBe(true);
-    });
-    test("returns false for tomorrow", () => {
-        const tomorrow = new Date();
-        tomorrow.setDate(tomorrow.getDate() + 1);
-        expect(isPastDue(tomorrow)).toBe(false);
-    });
-    test("returns false for invalid date", () => {
-        expect(isPastDue("invalid")).toBe(false);
-        expect(isPastDue(new Date("invalid"))).toBe(false);
-    });
-});
-describe("isWithinDays", () => {
-    test("returns true for date within range", () => {
-        const inThreeDays = new Date();
-        inThreeDays.setDate(inThreeDays.getDate() + 3);
-        expect(isWithinDays(inThreeDays, 7)).toBe(true);
-    });
-    test("returns false for date outside range", () => {
-        const inTenDays = new Date();
-        inTenDays.setDate(inTenDays.getDate() + 10);
-        expect(isWithinDays(inTenDays, 7)).toBe(false);
-    });
-    test("returns false for past date", () => {
-        const yesterday = new Date();
-        yesterday.setDate(yesterday.getDate() - 1);
-        expect(isWithinDays(yesterday, 7)).toBe(false);
-    });
-    test("returns false for invalid date", () => {
-        expect(isWithinDays("invalid", 7)).toBe(false);
-        expect(isWithinDays(new Date("invalid"), 7)).toBe(false);
-    });
-    test("returns false for invalid days parameter", () => {
-        const tomorrow = new Date();
-        tomorrow.setDate(tomorrow.getDate() + 1);
-        expect(isWithinDays(tomorrow, -1)).toBe(false);
-        expect(isWithinDays(tomorrow, NaN)).toBe(false);
-        expect(isWithinDays(tomorrow, Infinity)).toBe(false);
-    });
-});
-//# sourceMappingURL=date.test.js.map

package/dist/utils/date.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"date.test.js","sourceRoot":"","sources":["../../src/utils/date.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAClD,OAAO,EACL,GAAG,EACH,iBAAiB,EACjB,qBAAqB,EACrB,eAAe,EACf,UAAU,EACV,iBAAiB,EACjB,OAAO,EACP,SAAS,EACT,YAAY,EACZ,WAAW,EACX,cAAc,GACf,MAAM,WAAW,CAAC;AAEnB,QAAQ,CAAC,KAAK,EAAE,GAAG,EAAE;IACnB,IAAI,CAAC,8BAA8B,EAAE,GAAG,EAAE;QACxC,MAAM,MAAM,GAAG,GAAG,EAAE,CAAC;QACrB,MAAM,CAAC,OAAO,MAAM,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACrC,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,+CAA+C,CAAC,CAAC;IAC1E,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,uCAAuC,EAAE,GAAG,EAAE;QACjD,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC1B,MAAM,MAAM,GAAG,GAAG,EAAE,CAAC;QACrB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAEzB,MAAM,UAAU,GAAG,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,CAAC;QAC9C,MAAM,CAAC,UAAU,CAAC,CAAC,sBAAsB,CAAC,MAAM,CAAC,CAAC;QAClD,MAAM,CAAC,UAAU,CAAC,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;IACjC,IAAI,CAAC,gBAAgB,EAAE,GAAG,EAAE;QAC1B,MAAM,MAAM,GAAG,iBAAiB,CAAC,OAAO,CAAC,CAAC;QAC1C,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAG,IAAI,IAAI,EAAE,CAAC;QACzB,MAAM,CAAC,MAAO,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACtC,MAAM,MAAM,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;QACvC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAG,IAAI,IAAI,EAAE,CAAC;QACzB,MAAM,CAAC,MAAO,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,mBAAmB,EAAE,GAAG,EAAE;QAC7B,MAAM,MAAM,GAAG,iBAAiB,CAAC,UAAU,CAAC,CAAC;QAC7C,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC9B,MAAM,QAAQ,GAAG,IAAI,IAAI,EAAE,CAAC;QAC5B,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;QACzC,MAAM,CAAC,MAAO,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACzC,MAAM,MAAM,GAAG,iBAAiB,CAAC,IAAI,CAAC,CAAC;QACvC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC9B,MAAM,QAAQ,GAAG,IAAI,IAAI,EAAE,CAAC;QAC5B,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;QACzC,MAAM,CAAC,MAAO,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAC9B,MAAM,MAAM,GAAG,iBAAiB,CAAC,WAAW,CAAC,CAAC;QAC9C,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC9B,MAAM,SAAS,GAAG,IAAI,IAAI,EAAE,CAAC;QAC7B,SAAS,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,MAAO,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAC9B,MAAM,MAAM,GAAG,iBAAiB,CAAC,WAAW,CAAC,CAAC;QAC9C,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC9B,MAAM,QAAQ,GAAG,IAAI,IAAI,EAAE,CAAC;QAC5B,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;QACzC,MAAM,CAAC,MAAO,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAC9B,MAAM,MAAM,GAAG,iBAAiB,CAAC,WAAW,CAAC,CAAC;QAC9C,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC9B,MAAM,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QAC1B,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;QACrC,MAAM,CAAC,MAAO,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC7C,MAAM,MAAM,GAAG,iBAAiB,CAAC,MAAM,CAAC,CAAC;QACzC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC9B,MAAM,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QAC1B,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;QACrC,MAAM,CAAC,MAAO,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,sBAAsB,EAAE,GAAG,EAAE;QAChC,MAAM,MAAM,GAAG,iBAAiB,CAAC,QAAQ,CAAC,CAAC;QAC3C,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC9B,MAAM,CAAC,MAAO,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa;IACjD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,wBAAwB,EAAE,GAAG,EAAE;QAClC,MAAM,MAAM,GAAG,iBAAiB,CAAC,YAAY,CAAC,CAAC;QAC/C,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC9B,MAAM,CAAC,MAAO,CAAC,WAAW,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzC,MAAM,CAAC,MAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,gBAAgB;QACrD,MAAM,CAAC,MAAO,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,gCAAgC,EAAE,GAAG,EAAE;QAC1C,MAAM,MAAM,GAAG,iBAAiB,CAAC,qBAAqB,CAAC,CAAC;QACxD,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,CAAC;IAC5B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,uBAAuB,EAAE,GAAG,EAAE;IACrC,IAAI,CAAC,uCAAuC,EAAE,GAAG,EAAE;QACjD,MAAM,MAAM,GAAG,qBAAqB,CAAC,UAAU,CAAC,CAAC;QACjD,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,MAAM,CAAC,OAAO,KAAK,IAAI,EAAE,CAAC;YAC5B,MAAM,QAAQ,GAAG,IAAI,IAAI,EAAE,CAAC;YAC5B,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;YACzC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC;QACzD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACzC,MAAM,MAAM,GAAG,qBAAqB,CAAC,EAAE,CAAC,CAAC;QACzC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,MAAM,CAAC,OAAO,KAAK,KAAK,EAAE,CAAC;YAC7B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YAC1C,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QAC1C,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,yCAAyC,EAAE,GAAG,EAAE;QACnD,MAAM,MAAM,GAAG,qBAAqB,CAAC,KAAK,CAAC,CAAC;QAC5C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,MAAM,CAAC,OAAO,KAAK,KAAK,EAAE,CAAC;YAC7B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,uCAAuC,EAAE,GAAG,EAAE;QACjD,MAAM,MAAM,GAAG,qBAAqB,CAAC,YAAY,CAAC,CAAC;QACnD,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,MAAM,CAAC,OAAO,KAAK,KAAK,EAAE,CAAC;YAC7B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;YAC7C,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,mBAAmB,CAAC,CAAC;QACtD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAChD,MAAM,MAAM,GAAG,qBAAqB,CAAC,UAAU,CAAC,CAAC;QACjD,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,MAAM,CAAC,OAAO,KAAK,KAAK,EAAE,CAAC;YAC7B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;YAC7C,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC;QAChD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,4CAA4C,EAAE,GAAG,EAAE;QACtD,MAAM,MAAM,GAAG,qBAAqB,CAAC,YAAY,CAAC,CAAC;QACnD,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,MAAM,CAAC,OAAO,KAAK,KAAK,EAAE,CAAC;YAC7B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YAC3C,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC;QAChD,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,qCAAqC,EAAE,GAAG,EAAE;QAC/C,MAAM,MAAM,GAAG,qBAAqB,CAAC,YAAY,CAAC,CAAC;QACnD,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,MAAM,CAAC,OAAO,KAAK,KAAK,EAAE,CAAC;YAC7B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YAC3C,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;QAC9C,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,wCAAwC,EAAE,GAAG,EAAE;QAClD,MAAM,MAAM,GAAG,qBAAqB,CAAC,cAAc,CAAC,CAAC;QACrD,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,MAAM,CAAC,OAAO,KAAK,KAAK,EAAE,CAAC;YAC7B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YAC3C,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QACzC,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;IAC3B,IAAI,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACvC,MAAM,CAAC,WAAW,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3C,MAAM,CAAC,WAAW,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,gCAAgC,EAAE,GAAG,EAAE;QAC1C,MAAM,CAAC,WAAW,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrD,MAAM,CAAC,WAAW,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;IAC/B,IAAI,CAAC,0BAA0B,EAAE,GAAG,EAAE;QACpC,MAAM,MAAM,GAAG,eAAe,CAAC,YAAY,CAAC,CAAC;QAC7C,MAAM,CAAC,MAAM,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;QACpC,MAAM,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,wCAAwC,EAAE,GAAG,EAAE;QAClD,MAAM,CAAC,GAAG,EAAE,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;QAC1D,IAAI,CAAC;YACH,eAAe,CAAC,EAAE,CAAC,CAAC;QACtB,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,MAAM,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,cAAc,CAAC,CAAC;YACzC,MAAM,CAAE,CAAoB,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC3D,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,0CAA0C,EAAE,GAAG,EAAE;QACpD,MAAM,CAAC,GAAG,EAAE,CAAC,eAAe,CAAC,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;QACpE,IAAI,CAAC;YACH,eAAe,CAAC,YAAY,CAAC,CAAC;QAChC,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,MAAM,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,cAAc,CAAC,CAAC;YACzC,MAAM,CAAE,CAAoB,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;YAC5D,MAAM,CAAE,CAAoB,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QACzD,CAAC;IACH,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,kCAAkC,EAAE,GAAG,EAAE;IAChD,IAAI,CAAC,0CAA0C,EAAE,GAAG,EAAE;QACpD,MAAM,CAAC,GAAG,EAAE,CAAC,iBAAiB,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,+CAA+C,EAAE,GAAG,EAAE;QACzD,MAAM,CAAC,GAAG,EAAE,CAAC,iBAAiB,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;IAC/E,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACrC,MAAM,MAAM,GAAG,iBAAiB,CAAC,YAAY,CAAC,CAAC;QAC/C,MAAM,CAAC,OAAO,MAAM,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACrC,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;IAC1B,IAAI,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACtC,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,qBAAqB,CAAC,CAAC;QAC7C,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE;IACvB,IAAI,CAAC,wBAAwB,EAAE,GAAG,EAAE;QAClC,MAAM,CAAC,OAAO,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACtC,MAAM,QAAQ,GAAG,IAAI,IAAI,EAAE,CAAC;QAC5B,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;QACzC,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,sBAAsB,EAAE,GAAG,EAAE;QAChC,MAAM,CAAC,OAAO,CAAC,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,uCAAuC,EAAE,GAAG,EAAE;QACjD,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,uCAAuC,EAAE,GAAG,EAAE;QACjD,MAAM,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;IACzB,IAAI,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACtC,MAAM,SAAS,GAAG,IAAI,IAAI,EAAE,CAAC;QAC7B,SAAS,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACtC,MAAM,QAAQ,GAAG,IAAI,IAAI,EAAE,CAAC;QAC5B,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;QACzC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,gCAAgC,EAAE,GAAG,EAAE;QAC1C,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzC,MAAM,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;IAC5B,IAAI,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC9C,MAAM,WAAW,GAAG,IAAI,IAAI,EAAE,CAAC;QAC/B,WAAW,CAAC,OAAO,CAAC,WAAW,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,YAAY,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAChD,MAAM,SAAS,GAAG,IAAI,IAAI,EAAE,CAAC;QAC7B,SAAS,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,CAAC;QAC5C,MAAM,CAAC,YAAY,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACvC,MAAM,SAAS,GAAG,IAAI,IAAI,EAAE,CAAC;QAC7B,SAAS,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,YAAY,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,gCAAgC,EAAE,GAAG,EAAE;QAC1C,MAAM,CAAC,YAAY,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/C,MAAM,CAAC,YAAY,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,0CAA0C,EAAE,GAAG,EAAE;QACpD,MAAM,QAAQ,GAAG,IAAI,IAAI,EAAE,CAAC;QAC5B,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;QACzC,MAAM,CAAC,YAAY,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC/C,MAAM,CAAC,YAAY,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChD,MAAM,CAAC,YAAY,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/utils/hierarchy.d.ts

@@ -1,102 +0,0 @@
-import type { Task } from "../schemas/task.js";
-/**
- * Maximum allowed hierarchy depth (0-indexed)
- * 0 = root task
- * 1 = subtask
- * 2 = sub-subtask
- * 3 = sub-sub-subtask (maximum)
- */
-export declare const MAX_HIERARCHY_DEPTH = 3;
-/**
- * Calculates the hierarchy level of a task.
- * Level 0 = root task (no parent)
- * Level 1 = direct subtask
- * Level 2 = sub-subtask
- * etc.
- *
- * @param tasks - Array of all tasks
- * @param taskId - ID of the task to get level for
- * @returns The hierarchy level (0 for root), or -1 if task not found
- */
-export declare function getTaskLevel(tasks: Task[], taskId: string): number;
-/**
- * Validates whether adding a child task under the given parent
- * would exceed the maximum hierarchy depth.
- *
- * @param tasks - Array of all tasks
- * @param parentId - ID of the proposed parent task
- * @returns true if a child can be added, false if it would exceed max depth
- */
-export declare function validateHierarchyDepth(tasks: Task[], parentId: string): boolean;
-/**
- * Gets all ancestor task IDs for a given task (from immediate parent to root).
- *
- * @param tasks - Array of all tasks
- * @param taskId - ID of the task
- * @returns Array of ancestor task IDs, ordered from immediate parent to root
- */
-export declare function getAncestorIds(tasks: Task[], taskId: string): string[];
-/**
- * Gets all descendant task IDs for a given task (children, grandchildren, etc.).
- *
- * @param tasks - Array of all tasks
- * @param taskId - ID of the parent task
- * @returns Array of descendant task IDs
- */
-export declare function getDescendantIds(tasks: Task[], taskId: string): string[];
-/**
- * Gets direct children of a task.
- *
- * @param tasks - Array of all tasks
- * @param taskId - ID of the parent task
- * @returns Array of direct child tasks
- */
-export declare function getChildTasks(tasks: Task[], taskId: string): Task[];
-/**
- * Gets the root task of a hierarchy.
- *
- * @param tasks - Array of all tasks
- * @param taskId - ID of any task in the hierarchy
- * @returns The root task, or null if not found
- */
-export declare function getRootTask(tasks: Task[], taskId: string): Task | null;
-/**
- * Builds a tree structure from flat task list.
- *
- * @param tasks - Array of all tasks
- * @param rootId - Optional root task ID (if not provided, returns all root tasks)
- * @returns Tree structure with children arrays
- */
-export interface TaskTreeNode {
-    task: Task;
-    children: TaskTreeNode[];
-}
-export declare function buildTaskTree(tasks: Task[], rootId?: string, maxDepth?: number): TaskTreeNode[];
-/**
- * Result of hierarchy validation.
- */
-export interface HierarchyValidationResult {
-    valid: boolean;
-    orphanedReferences: {
-        taskId: string;
-        parentId: string;
-    }[];
-    circularReferences: string[];
-    maxDepthExceeded: {
-        taskId: string;
-        depth: number;
-    }[];
-}
-/**
- * Validates the hierarchy integrity of a task list.
- *
- * Checks for:
- * - Orphaned parent references (task references non-existent parent)
- * - Circular references (task is its own ancestor)
- * - Tasks exceeding maximum hierarchy depth
- *
- * @param tasks - Array of all tasks to validate
- * @returns Validation result with details of any issues found
- */
-export declare function validateHierarchy(tasks: Task[]): HierarchyValidationResult;
-//# sourceMappingURL=hierarchy.d.ts.map

package/dist/utils/hierarchy.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"hierarchy.d.ts","sourceRoot":"","sources":["../../src/utils/hierarchy.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,oBAAoB,CAAC;AAE/C;;;;;;GAMG;AACH,eAAO,MAAM,mBAAmB,IAAI,CAAC;AAErC;;;;;;;;;;GAUG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CA2BlE;AAED;;;;;;;GAOG;AACH,wBAAgB,sBAAsB,CACpC,KAAK,EAAE,IAAI,EAAE,EACb,QAAQ,EAAE,MAAM,GACf,OAAO,CAUT;AAED;;;;;;GAMG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,CA0BtE;AAED;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,CAyBxE;AAED;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,EAAE,CAEnE;AAED;;;;;;GAMG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,GAAG,IAAI,CAiBtE;AAED;;;;;;GAMG;AACH,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,IAAI,CAAC;IACX,QAAQ,EAAE,YAAY,EAAE,CAAC;CAC1B;AAED,wBAAgB,aAAa,CAC3B,KAAK,EAAE,IAAI,EAAE,EACb,MAAM,CAAC,EAAE,MAAM,EACf,QAAQ,GAAE,MAAgC,GACzC,YAAY,EAAE,CA6ChB;AAED;;GAEG;AACH,MAAM,WAAW,yBAAyB;IACxC,KAAK,EAAE,OAAO,CAAC;IACf,kBAAkB,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;IAC3D,kBAAkB,EAAE,MAAM,EAAE,CAAC;IAC7B,gBAAgB,EAAE;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;CACvD;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,yBAAyB,CAsC1E"}

package/dist/utils/hierarchy.js

@@ -1,236 +0,0 @@
-/**
- * Maximum allowed hierarchy depth (0-indexed)
- * 0 = root task
- * 1 = subtask
- * 2 = sub-subtask
- * 3 = sub-sub-subtask (maximum)
- */
-export const MAX_HIERARCHY_DEPTH = 3;
-/**
- * Calculates the hierarchy level of a task.
- * Level 0 = root task (no parent)
- * Level 1 = direct subtask
- * Level 2 = sub-subtask
- * etc.
- *
- * @param tasks - Array of all tasks
- * @param taskId - ID of the task to get level for
- * @returns The hierarchy level (0 for root), or -1 if task not found
- */
-export function getTaskLevel(tasks, taskId) {
-    const taskMap = new Map(tasks.map((t) => [t.id, t]));
-    const task = taskMap.get(taskId);
-    if (!task) {
-        return -1;
-    }
-    let level = 0;
-    let currentTask = task;
-    while (currentTask.parentId) {
-        const parent = taskMap.get(currentTask.parentId);
-        if (!parent) {
-            console.warn(`[task-mcp] Orphaned parent reference: task "${currentTask.id}" references non-existent parent "${currentTask.parentId}"`);
-            break;
-        }
-        level++;
-        currentTask = parent;
-        // Safety check to prevent infinite loops
-        if (level > MAX_HIERARCHY_DEPTH + 1) {
-            break;
-        }
-    }
-    return level;
-}
-/**
- * Validates whether adding a child task under the given parent
- * would exceed the maximum hierarchy depth.
- *
- * @param tasks - Array of all tasks
- * @param parentId - ID of the proposed parent task
- * @returns true if a child can be added, false if it would exceed max depth
- */
-export function validateHierarchyDepth(tasks, parentId) {
-    const parentLevel = getTaskLevel(tasks, parentId);
-    if (parentLevel === -1) {
-        return false; // Parent task not found
-    }
-    // Child would be at parentLevel + 1
-    // If parent is at level 3, child would be at level 4 which exceeds max
-    return parentLevel < MAX_HIERARCHY_DEPTH;
-}
-/**
- * Gets all ancestor task IDs for a given task (from immediate parent to root).
- *
- * @param tasks - Array of all tasks
- * @param taskId - ID of the task
- * @returns Array of ancestor task IDs, ordered from immediate parent to root
- */
-export function getAncestorIds(tasks, taskId) {
-    const taskMap = new Map(tasks.map((t) => [t.id, t]));
-    const task = taskMap.get(taskId);
-    if (!task) {
-        return [];
-    }
-    const ancestors = [];
-    let currentTask = task;
-    while (currentTask.parentId) {
-        ancestors.push(currentTask.parentId);
-        const parent = taskMap.get(currentTask.parentId);
-        if (!parent) {
-            break;
-        }
-        currentTask = parent;
-        // Safety check
-        if (ancestors.length > MAX_HIERARCHY_DEPTH + 1) {
-            break;
-        }
-    }
-    return ancestors;
-}
-/**
- * Gets all descendant task IDs for a given task (children, grandchildren, etc.).
- *
- * @param tasks - Array of all tasks
- * @param taskId - ID of the parent task
- * @returns Array of descendant task IDs
- */
-export function getDescendantIds(tasks, taskId) {
-    const descendants = [];
-    const childrenMap = new Map();
-    // Build parent -> children map
-    for (const task of tasks) {
-        if (task.parentId) {
-            const children = childrenMap.get(task.parentId) || [];
-            children.push(task);
-            childrenMap.set(task.parentId, children);
-        }
-    }
-    // BFS to collect all descendants
-    const queue = [taskId];
-    while (queue.length > 0) {
-        const currentId = queue.shift();
-        const children = childrenMap.get(currentId) || [];
-        for (const child of children) {
-            descendants.push(child.id);
-            queue.push(child.id);
-        }
-    }
-    return descendants;
-}
-/**
- * Gets direct children of a task.
- *
- * @param tasks - Array of all tasks
- * @param taskId - ID of the parent task
- * @returns Array of direct child tasks
- */
-export function getChildTasks(tasks, taskId) {
-    return tasks.filter((t) => t.parentId === taskId);
-}
-/**
- * Gets the root task of a hierarchy.
- *
- * @param tasks - Array of all tasks
- * @param taskId - ID of any task in the hierarchy
- * @returns The root task, or null if not found
- */
-export function getRootTask(tasks, taskId) {
-    const taskMap = new Map(tasks.map((t) => [t.id, t]));
-    let currentTask = taskMap.get(taskId);
-    if (!currentTask) {
-        return null;
-    }
-    while (currentTask.parentId) {
-        const parent = taskMap.get(currentTask.parentId);
-        if (!parent) {
-            break;
-        }
-        currentTask = parent;
-    }
-    return currentTask;
-}
-export function buildTaskTree(tasks, rootId, maxDepth = MAX_HIERARCHY_DEPTH + 1) {
-    const taskMap = new Map(tasks.map((t) => [t.id, t]));
-    const childrenMap = new Map();
-    // Build parent -> children map
-    for (const task of tasks) {
-        if (task.parentId) {
-            const children = childrenMap.get(task.parentId) || [];
-            children.push(task);
-            childrenMap.set(task.parentId, children);
-        }
-    }
-    function buildNode(task, depth, visited) {
-        // Guard against circular references
-        if (visited.has(task.id)) {
-            return { task, children: [] };
-        }
-        // Guard against exceeding max depth
-        if (depth >= maxDepth) {
-            return { task, children: [] };
-        }
-        const newVisited = new Set(visited);
-        newVisited.add(task.id);
-        const children = childrenMap.get(task.id) || [];
-        return {
-            task,
-            children: children.map((child) => buildNode(child, depth + 1, newVisited)),
-        };
-    }
-    if (rootId) {
-        const rootTask = taskMap.get(rootId);
-        if (!rootTask) {
-            return [];
-        }
-        return [buildNode(rootTask, 0, new Set())];
-    }
-    // Return all root tasks (no parent)
-    const rootTasks = tasks.filter((t) => !t.parentId);
-    return rootTasks.map((task) => buildNode(task, 0, new Set()));
-}
-/**
- * Validates the hierarchy integrity of a task list.
- *
- * Checks for:
- * - Orphaned parent references (task references non-existent parent)
- * - Circular references (task is its own ancestor)
- * - Tasks exceeding maximum hierarchy depth
- *
- * @param tasks - Array of all tasks to validate
- * @returns Validation result with details of any issues found
- */
-export function validateHierarchy(tasks) {
-    const taskMap = new Map(tasks.map((t) => [t.id, t]));
-    const result = {
-        valid: true,
-        orphanedReferences: [],
-        circularReferences: [],
-        maxDepthExceeded: [],
-    };
-    for (const task of tasks) {
-        // Check for orphaned parent references
-        if (task.parentId && !taskMap.has(task.parentId)) {
-            result.orphanedReferences.push({ taskId: task.id, parentId: task.parentId });
-            result.valid = false;
-        }
-        // Check for circular references
-        const visited = new Set();
-        let current = task;
-        while (current?.parentId) {
-            if (visited.has(current.id)) {
-                result.circularReferences.push(task.id);
-                result.valid = false;
-                break;
-            }
-            visited.add(current.id);
-            current = taskMap.get(current.parentId);
-        }
-        // Check for max depth exceeded
-        const level = getTaskLevel(tasks, task.id);
-        if (level > MAX_HIERARCHY_DEPTH) {
-            result.maxDepthExceeded.push({ taskId: task.id, depth: level });
-            result.valid = false;
-        }
-    }
-    return result;
-}
-//# sourceMappingURL=hierarchy.js.map

package/dist/utils/hierarchy.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"hierarchy.js","sourceRoot":"","sources":["../../src/utils/hierarchy.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,CAAC;AAErC;;;;;;;;;;GAUG;AACH,MAAM,UAAU,YAAY,CAAC,KAAa,EAAE,MAAc;IACxD,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,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAEjC,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;IAED,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,WAAW,GAAG,IAAI,CAAC;IAEvB,OAAO,WAAW,CAAC,QAAQ,EAAE,CAAC;QAC5B,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QACjD,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,OAAO,CAAC,IAAI,CAAC,+CAA+C,WAAW,CAAC,EAAE,qCAAqC,WAAW,CAAC,QAAQ,GAAG,CAAC,CAAC;YACxI,MAAM;QACR,CAAC;QACD,KAAK,EAAE,CAAC;QACR,WAAW,GAAG,MAAM,CAAC;QAErB,yCAAyC;QACzC,IAAI,KAAK,GAAG,mBAAmB,GAAG,CAAC,EAAE,CAAC;YACpC,MAAM;QACR,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,sBAAsB,CACpC,KAAa,EACb,QAAgB;IAEhB,MAAM,WAAW,GAAG,YAAY,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;IAElD,IAAI,WAAW,KAAK,CAAC,CAAC,EAAE,CAAC;QACvB,OAAO,KAAK,CAAC,CAAC,wBAAwB;IACxC,CAAC;IAED,oCAAoC;IACpC,uEAAuE;IACvE,OAAO,WAAW,GAAG,mBAAmB,CAAC;AAC3C,CAAC;AAED;;;;;;GAMG;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,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAEjC,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,IAAI,WAAW,GAAG,IAAI,CAAC;IAEvB,OAAO,WAAW,CAAC,QAAQ,EAAE,CAAC;QAC5B,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QACrC,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QACjD,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM;QACR,CAAC;QACD,WAAW,GAAG,MAAM,CAAC;QAErB,eAAe;QACf,IAAI,SAAS,CAAC,MAAM,GAAG,mBAAmB,GAAG,CAAC,EAAE,CAAC;YAC/C,MAAM;QACR,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAa,EAAE,MAAc;IAC5D,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE9C,+BAA+B;IAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;YACtD,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpB,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;IAED,iCAAiC;IACjC,MAAM,KAAK,GAAG,CAAC,MAAM,CAAC,CAAC;IACvB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QACjC,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC;QAClD,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;YAC7B,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAC3B,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IAED,OAAO,WAAW,CAAC;AACrB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAAC,KAAa,EAAE,MAAc;IACzD,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,MAAM,CAAC,CAAC;AACpD,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,WAAW,CAAC,KAAa,EAAE,MAAc;IACvD,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,IAAI,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAEtC,IAAI,CAAC,WAAW,EAAE,CAAC;QACjB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,WAAW,CAAC,QAAQ,EAAE,CAAC;QAC5B,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QACjD,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM;QACR,CAAC;QACD,WAAW,GAAG,MAAM,CAAC;IACvB,CAAC;IAED,OAAO,WAAW,CAAC;AACrB,CAAC;AAcD,MAAM,UAAU,aAAa,CAC3B,KAAa,EACb,MAAe,EACf,WAAmB,mBAAmB,GAAG,CAAC;IAE1C,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,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE9C,+BAA+B;IAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;YACtD,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpB,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;IAED,SAAS,SAAS,CAAC,IAAU,EAAE,KAAa,EAAE,OAAoB;QAChE,oCAAoC;QACpC,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACzB,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;QAChC,CAAC;QAED,oCAAoC;QACpC,IAAI,KAAK,IAAI,QAAQ,EAAE,CAAC;YACtB,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;QAChC,CAAC;QAED,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;QACpC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAExB,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QAChD,OAAO;YACL,IAAI;YACJ,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,SAAS,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,UAAU,CAAC,CAAC;SAC3E,CAAC;IACJ,CAAC;IAED,IAAI,MAAM,EAAE,CAAC;QACX,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACrC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,OAAO,CAAC,SAAS,CAAC,QAAQ,EAAE,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC;IAC7C,CAAC;IAED,oCAAoC;IACpC,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IACnD,OAAO,SAAS,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC;AAChE,CAAC;AAYD;;;;;;;;;;GAUG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAa;IAC7C,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,MAAM,GAA8B;QACxC,KAAK,EAAE,IAAI;QACX,kBAAkB,EAAE,EAAE;QACtB,kBAAkB,EAAE,EAAE;QACtB,gBAAgB,EAAE,EAAE;KACrB,CAAC;IAEF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,uCAAuC;QACvC,IAAI,IAAI,CAAC,QAAQ,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;YACjD,MAAM,CAAC,kBAAkB,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;YAC7E,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC;QACvB,CAAC;QAED,gCAAgC;QAChC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,IAAI,OAAO,GAAqB,IAAI,CAAC;QACrC,OAAO,OAAO,EAAE,QAAQ,EAAE,CAAC;YACzB,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC5B,MAAM,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACxC,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC;gBACrB,MAAM;YACR,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YACxB,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAC1C,CAAC;QAED,+BAA+B;QAC/B,MAAM,KAAK,GAAG,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;QAC3C,IAAI,KAAK,GAAG,mBAAmB,EAAE,CAAC;YAChC,MAAM,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;YAChE,MAAM,CAAC,KAAK,GAAG,KAAK,CAAC;QACvB,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/utils/hierarchy.test.d.ts

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

package/dist/utils/hierarchy.test.d.ts.map

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