@task-mcp/shared 1.0.13 → 1.0.14
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/algorithms/critical-path.d.ts.map +1 -1
- package/dist/algorithms/critical-path.js +2 -14
- package/dist/algorithms/critical-path.js.map +1 -1
- package/dist/algorithms/dependency-integrity.d.ts +8 -0
- package/dist/algorithms/dependency-integrity.d.ts.map +1 -1
- package/dist/algorithms/dependency-integrity.js +42 -24
- package/dist/algorithms/dependency-integrity.js.map +1 -1
- package/dist/algorithms/dependency-integrity.test.d.ts +2 -0
- package/dist/algorithms/dependency-integrity.test.d.ts.map +1 -0
- package/dist/algorithms/dependency-integrity.test.js +309 -0
- package/dist/algorithms/dependency-integrity.test.js.map +1 -0
- package/dist/algorithms/tech-analysis.d.ts +5 -5
- package/dist/algorithms/tech-analysis.d.ts.map +1 -1
- package/dist/algorithms/tech-analysis.js +65 -17
- package/dist/algorithms/tech-analysis.js.map +1 -1
- package/dist/algorithms/topological-sort.d.ts.map +1 -1
- package/dist/algorithms/topological-sort.js +1 -56
- package/dist/algorithms/topological-sort.js.map +1 -1
- package/dist/schemas/index.d.ts +1 -0
- package/dist/schemas/index.d.ts.map +1 -1
- package/dist/schemas/index.js +2 -0
- package/dist/schemas/index.js.map +1 -1
- package/dist/schemas/project.d.ts +6 -6
- package/dist/schemas/state.d.ts +17 -0
- package/dist/schemas/state.d.ts.map +1 -0
- package/dist/schemas/state.js +17 -0
- package/dist/schemas/state.js.map +1 -0
- package/dist/schemas/task.d.ts +13 -4
- package/dist/schemas/task.d.ts.map +1 -1
- package/dist/schemas/task.js +3 -0
- package/dist/schemas/task.js.map +1 -1
- package/dist/schemas/view.d.ts +4 -4
- package/dist/utils/dashboard-renderer.d.ts +3 -0
- package/dist/utils/dashboard-renderer.d.ts.map +1 -1
- package/dist/utils/dashboard-renderer.js +12 -13
- package/dist/utils/dashboard-renderer.js.map +1 -1
- package/dist/utils/dashboard-renderer.test.d.ts +2 -0
- package/dist/utils/dashboard-renderer.test.d.ts.map +1 -0
- package/dist/utils/dashboard-renderer.test.js +777 -0
- package/dist/utils/dashboard-renderer.test.js.map +1 -0
- package/dist/utils/date.d.ts +49 -0
- package/dist/utils/date.d.ts.map +1 -1
- package/dist/utils/date.js +174 -19
- package/dist/utils/date.js.map +1 -1
- package/dist/utils/date.test.js +139 -1
- package/dist/utils/date.test.js.map +1 -1
- package/dist/utils/hierarchy.d.ts +1 -1
- package/dist/utils/hierarchy.d.ts.map +1 -1
- package/dist/utils/hierarchy.js +15 -5
- package/dist/utils/hierarchy.js.map +1 -1
- package/dist/utils/hierarchy.test.d.ts +2 -0
- package/dist/utils/hierarchy.test.d.ts.map +1 -0
- package/dist/utils/hierarchy.test.js +351 -0
- package/dist/utils/hierarchy.test.js.map +1 -0
- package/dist/utils/id.js +1 -1
- package/dist/utils/id.js.map +1 -1
- package/dist/utils/index.d.ts +3 -2
- package/dist/utils/index.d.ts.map +1 -1
- package/dist/utils/index.js +3 -2
- package/dist/utils/index.js.map +1 -1
- package/dist/utils/natural-language.d.ts.map +1 -1
- package/dist/utils/natural-language.js +7 -0
- package/dist/utils/natural-language.js.map +1 -1
- package/dist/utils/natural-language.test.js +24 -0
- package/dist/utils/natural-language.test.js.map +1 -1
- package/dist/utils/priority-queue.d.ts +17 -0
- package/dist/utils/priority-queue.d.ts.map +1 -0
- package/dist/utils/priority-queue.js +62 -0
- package/dist/utils/priority-queue.js.map +1 -0
- package/dist/utils/projection.d.ts +9 -0
- package/dist/utils/projection.d.ts.map +1 -1
- package/dist/utils/projection.js +37 -0
- package/dist/utils/projection.js.map +1 -1
- package/dist/utils/terminal-ui.d.ts +5 -0
- package/dist/utils/terminal-ui.d.ts.map +1 -1
- package/dist/utils/terminal-ui.js +88 -11
- package/dist/utils/terminal-ui.js.map +1 -1
- package/dist/utils/terminal-ui.test.d.ts +2 -0
- package/dist/utils/terminal-ui.test.d.ts.map +1 -0
- package/dist/utils/terminal-ui.test.js +683 -0
- package/dist/utils/terminal-ui.test.js.map +1 -0
- package/package.json +1 -1
- package/src/algorithms/critical-path.ts +6 -14
- package/src/algorithms/dependency-integrity.test.ts +348 -0
- package/src/algorithms/dependency-integrity.ts +41 -26
- package/src/algorithms/tech-analysis.ts +86 -18
- package/src/algorithms/topological-sort.ts +1 -62
- package/src/schemas/index.ts +3 -0
- package/src/schemas/state.ts +23 -0
- package/src/schemas/task.ts +3 -0
- package/src/utils/dashboard-renderer.test.ts +981 -0
- package/src/utils/dashboard-renderer.ts +14 -15
- package/src/utils/date.test.ts +170 -1
- package/src/utils/date.ts +214 -19
- package/src/utils/hierarchy.test.ts +411 -0
- package/src/utils/hierarchy.ts +22 -5
- package/src/utils/id.ts +1 -1
- package/src/utils/index.ts +17 -1
- package/src/utils/natural-language.test.ts +28 -0
- package/src/utils/natural-language.ts +8 -0
- package/src/utils/priority-queue.ts +68 -0
- package/src/utils/projection.ts +46 -2
- package/src/utils/terminal-ui.test.ts +831 -0
- package/src/utils/terminal-ui.ts +90 -10
package/dist/utils/date.test.js
CHANGED
|
@@ -1,5 +1,5 @@
|
|
|
1
1
|
import { describe, test, expect } from "bun:test";
|
|
2
|
-
import { now, parseRelativeDate, formatDate, isToday, isPastDue, isWithinDays } from "./date.js";
|
|
2
|
+
import { now, parseRelativeDate, parseRelativeDateSafe, parseDateString, formatDate, formatDisplayDate, isToday, isPastDue, isWithinDays, isValidDate, DateParseError, } from "./date.js";
|
|
3
3
|
describe("now", () => {
|
|
4
4
|
test("returns ISO timestamp string", () => {
|
|
5
5
|
const result = now();
|
|
@@ -87,6 +87,123 @@ describe("parseRelativeDate", () => {
|
|
|
87
87
|
expect(result).toBeNull();
|
|
88
88
|
});
|
|
89
89
|
});
|
|
90
|
+
describe("parseRelativeDateSafe", () => {
|
|
91
|
+
test("returns success result for valid date", () => {
|
|
92
|
+
const result = parseRelativeDateSafe("tomorrow");
|
|
93
|
+
expect(result.success).toBe(true);
|
|
94
|
+
if (result.success === true) {
|
|
95
|
+
const tomorrow = new Date();
|
|
96
|
+
tomorrow.setDate(tomorrow.getDate() + 1);
|
|
97
|
+
expect(result.date.getDate()).toBe(tomorrow.getDate());
|
|
98
|
+
}
|
|
99
|
+
});
|
|
100
|
+
test("returns error for empty input", () => {
|
|
101
|
+
const result = parseRelativeDateSafe("");
|
|
102
|
+
expect(result.success).toBe(false);
|
|
103
|
+
if (result.success === false) {
|
|
104
|
+
expect(result.reason).toBe("empty_input");
|
|
105
|
+
expect(result.error).toContain("empty");
|
|
106
|
+
}
|
|
107
|
+
});
|
|
108
|
+
test("returns error for whitespace-only input", () => {
|
|
109
|
+
const result = parseRelativeDateSafe(" ");
|
|
110
|
+
expect(result.success).toBe(false);
|
|
111
|
+
if (result.success === false) {
|
|
112
|
+
expect(result.reason).toBe("empty_input");
|
|
113
|
+
}
|
|
114
|
+
});
|
|
115
|
+
test("returns error for invalid date format", () => {
|
|
116
|
+
const result = parseRelativeDateSafe("not a date");
|
|
117
|
+
expect(result.success).toBe(false);
|
|
118
|
+
if (result.success === false) {
|
|
119
|
+
expect(result.reason).toBe("invalid_format");
|
|
120
|
+
expect(result.error).toContain("Supported formats");
|
|
121
|
+
}
|
|
122
|
+
});
|
|
123
|
+
test("returns error for malformed ISO date", () => {
|
|
124
|
+
const result = parseRelativeDateSafe("2025-1-5");
|
|
125
|
+
expect(result.success).toBe(false);
|
|
126
|
+
if (result.success === false) {
|
|
127
|
+
expect(result.reason).toBe("invalid_format");
|
|
128
|
+
expect(result.error).toContain("zero-padded");
|
|
129
|
+
}
|
|
130
|
+
});
|
|
131
|
+
test("returns error for invalid date like Feb 30", () => {
|
|
132
|
+
const result = parseRelativeDateSafe("2025-02-30");
|
|
133
|
+
expect(result.success).toBe(false);
|
|
134
|
+
if (result.success === false) {
|
|
135
|
+
expect(result.reason).toBe("invalid_date");
|
|
136
|
+
expect(result.error).toContain("February 30");
|
|
137
|
+
}
|
|
138
|
+
});
|
|
139
|
+
test("returns error for year out of range", () => {
|
|
140
|
+
const result = parseRelativeDateSafe("1800-01-01");
|
|
141
|
+
expect(result.success).toBe(false);
|
|
142
|
+
if (result.success === false) {
|
|
143
|
+
expect(result.reason).toBe("out_of_range");
|
|
144
|
+
expect(result.error).toContain("1900-2100");
|
|
145
|
+
}
|
|
146
|
+
});
|
|
147
|
+
test("returns error for excessive day offset", () => {
|
|
148
|
+
const result = parseRelativeDateSafe("in 5000 days");
|
|
149
|
+
expect(result.success).toBe(false);
|
|
150
|
+
if (result.success === false) {
|
|
151
|
+
expect(result.reason).toBe("out_of_range");
|
|
152
|
+
expect(result.error).toContain("3650");
|
|
153
|
+
}
|
|
154
|
+
});
|
|
155
|
+
});
|
|
156
|
+
describe("isValidDate", () => {
|
|
157
|
+
test("returns true for valid Date", () => {
|
|
158
|
+
expect(isValidDate(new Date())).toBe(true);
|
|
159
|
+
expect(isValidDate(new Date("2025-01-01"))).toBe(true);
|
|
160
|
+
});
|
|
161
|
+
test("returns false for Invalid Date", () => {
|
|
162
|
+
expect(isValidDate(new Date("invalid"))).toBe(false);
|
|
163
|
+
expect(isValidDate(new Date(NaN))).toBe(false);
|
|
164
|
+
});
|
|
165
|
+
});
|
|
166
|
+
describe("parseDateString", () => {
|
|
167
|
+
test("parses valid date string", () => {
|
|
168
|
+
const result = parseDateString("2025-01-15");
|
|
169
|
+
expect(result).toBeInstanceOf(Date);
|
|
170
|
+
expect(result.getFullYear()).toBe(2025);
|
|
171
|
+
});
|
|
172
|
+
test("throws DateParseError for empty string", () => {
|
|
173
|
+
expect(() => parseDateString("")).toThrow(DateParseError);
|
|
174
|
+
try {
|
|
175
|
+
parseDateString("");
|
|
176
|
+
}
|
|
177
|
+
catch (e) {
|
|
178
|
+
expect(e).toBeInstanceOf(DateParseError);
|
|
179
|
+
expect(e.reason).toBe("empty_input");
|
|
180
|
+
}
|
|
181
|
+
});
|
|
182
|
+
test("throws DateParseError for invalid string", () => {
|
|
183
|
+
expect(() => parseDateString("not a date")).toThrow(DateParseError);
|
|
184
|
+
try {
|
|
185
|
+
parseDateString("not a date");
|
|
186
|
+
}
|
|
187
|
+
catch (e) {
|
|
188
|
+
expect(e).toBeInstanceOf(DateParseError);
|
|
189
|
+
expect(e.reason).toBe("invalid_format");
|
|
190
|
+
expect(e.input).toBe("not a date");
|
|
191
|
+
}
|
|
192
|
+
});
|
|
193
|
+
});
|
|
194
|
+
describe("formatDisplayDate error handling", () => {
|
|
195
|
+
test("throws DateParseError for invalid string", () => {
|
|
196
|
+
expect(() => formatDisplayDate("invalid")).toThrow(DateParseError);
|
|
197
|
+
});
|
|
198
|
+
test("throws DateParseError for Invalid Date object", () => {
|
|
199
|
+
expect(() => formatDisplayDate(new Date("invalid"))).toThrow(DateParseError);
|
|
200
|
+
});
|
|
201
|
+
test("formats valid string date", () => {
|
|
202
|
+
const result = formatDisplayDate("2025-06-15");
|
|
203
|
+
expect(typeof result).toBe("string");
|
|
204
|
+
expect(result).toMatch(/\d+\/\d+\/\d+/);
|
|
205
|
+
});
|
|
206
|
+
});
|
|
90
207
|
describe("formatDate", () => {
|
|
91
208
|
test("formats date as YYYY-MM-DD", () => {
|
|
92
209
|
const date = new Date("2025-06-15T10:30:00");
|
|
@@ -105,6 +222,12 @@ describe("isToday", () => {
|
|
|
105
222
|
test("accepts string input", () => {
|
|
106
223
|
expect(isToday(new Date().toISOString())).toBe(true);
|
|
107
224
|
});
|
|
225
|
+
test("returns false for invalid date string", () => {
|
|
226
|
+
expect(isToday("invalid")).toBe(false);
|
|
227
|
+
});
|
|
228
|
+
test("returns false for Invalid Date object", () => {
|
|
229
|
+
expect(isToday(new Date("invalid"))).toBe(false);
|
|
230
|
+
});
|
|
108
231
|
});
|
|
109
232
|
describe("isPastDue", () => {
|
|
110
233
|
test("returns true for yesterday", () => {
|
|
@@ -117,6 +240,10 @@ describe("isPastDue", () => {
|
|
|
117
240
|
tomorrow.setDate(tomorrow.getDate() + 1);
|
|
118
241
|
expect(isPastDue(tomorrow)).toBe(false);
|
|
119
242
|
});
|
|
243
|
+
test("returns false for invalid date", () => {
|
|
244
|
+
expect(isPastDue("invalid")).toBe(false);
|
|
245
|
+
expect(isPastDue(new Date("invalid"))).toBe(false);
|
|
246
|
+
});
|
|
120
247
|
});
|
|
121
248
|
describe("isWithinDays", () => {
|
|
122
249
|
test("returns true for date within range", () => {
|
|
@@ -134,5 +261,16 @@ describe("isWithinDays", () => {
|
|
|
134
261
|
yesterday.setDate(yesterday.getDate() - 1);
|
|
135
262
|
expect(isWithinDays(yesterday, 7)).toBe(false);
|
|
136
263
|
});
|
|
264
|
+
test("returns false for invalid date", () => {
|
|
265
|
+
expect(isWithinDays("invalid", 7)).toBe(false);
|
|
266
|
+
expect(isWithinDays(new Date("invalid"), 7)).toBe(false);
|
|
267
|
+
});
|
|
268
|
+
test("returns false for invalid days parameter", () => {
|
|
269
|
+
const tomorrow = new Date();
|
|
270
|
+
tomorrow.setDate(tomorrow.getDate() + 1);
|
|
271
|
+
expect(isWithinDays(tomorrow, -1)).toBe(false);
|
|
272
|
+
expect(isWithinDays(tomorrow, NaN)).toBe(false);
|
|
273
|
+
expect(isWithinDays(tomorrow, Infinity)).toBe(false);
|
|
274
|
+
});
|
|
137
275
|
});
|
|
138
276
|
//# sourceMappingURL=date.test.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"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,EAAE,GAAG,EAAE,iBAAiB,EAAE,UAAU,EAAE,OAAO,EAAE,SAAS,EAAE,YAAY,EAAE,MAAM,WAAW,CAAC;AAEjG,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,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;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;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;AACL,CAAC,CAAC,CAAC"}
|
|
1
|
+
{"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"}
|
|
@@ -71,5 +71,5 @@ export interface TaskTreeNode {
|
|
|
71
71
|
task: Task;
|
|
72
72
|
children: TaskTreeNode[];
|
|
73
73
|
}
|
|
74
|
-
export declare function buildTaskTree(tasks: Task[], rootId?: string): TaskTreeNode[];
|
|
74
|
+
export declare function buildTaskTree(tasks: Task[], rootId?: string, maxDepth?: number): TaskTreeNode[];
|
|
75
75
|
//# sourceMappingURL=hierarchy.d.ts.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"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,CA0BlE;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,
|
|
1
|
+
{"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,CA0BlE;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"}
|
package/dist/utils/hierarchy.js
CHANGED
|
@@ -147,7 +147,7 @@ export function getRootTask(tasks, taskId) {
|
|
|
147
147
|
}
|
|
148
148
|
return currentTask;
|
|
149
149
|
}
|
|
150
|
-
export function buildTaskTree(tasks, rootId) {
|
|
150
|
+
export function buildTaskTree(tasks, rootId, maxDepth = MAX_HIERARCHY_DEPTH + 1) {
|
|
151
151
|
const taskMap = new Map(tasks.map((t) => [t.id, t]));
|
|
152
152
|
const childrenMap = new Map();
|
|
153
153
|
// Build parent -> children map
|
|
@@ -158,11 +158,21 @@ export function buildTaskTree(tasks, rootId) {
|
|
|
158
158
|
childrenMap.set(task.parentId, children);
|
|
159
159
|
}
|
|
160
160
|
}
|
|
161
|
-
function buildNode(task) {
|
|
161
|
+
function buildNode(task, depth, visited) {
|
|
162
|
+
// Guard against circular references
|
|
163
|
+
if (visited.has(task.id)) {
|
|
164
|
+
return { task, children: [] };
|
|
165
|
+
}
|
|
166
|
+
// Guard against exceeding max depth
|
|
167
|
+
if (depth >= maxDepth) {
|
|
168
|
+
return { task, children: [] };
|
|
169
|
+
}
|
|
170
|
+
const newVisited = new Set(visited);
|
|
171
|
+
newVisited.add(task.id);
|
|
162
172
|
const children = childrenMap.get(task.id) || [];
|
|
163
173
|
return {
|
|
164
174
|
task,
|
|
165
|
-
children: children.map(buildNode),
|
|
175
|
+
children: children.map((child) => buildNode(child, depth + 1, newVisited)),
|
|
166
176
|
};
|
|
167
177
|
}
|
|
168
178
|
if (rootId) {
|
|
@@ -170,10 +180,10 @@ export function buildTaskTree(tasks, rootId) {
|
|
|
170
180
|
if (!rootTask) {
|
|
171
181
|
return [];
|
|
172
182
|
}
|
|
173
|
-
return [buildNode(rootTask)];
|
|
183
|
+
return [buildNode(rootTask, 0, new Set())];
|
|
174
184
|
}
|
|
175
185
|
// Return all root tasks (no parent)
|
|
176
186
|
const rootTasks = tasks.filter((t) => !t.parentId);
|
|
177
|
-
return rootTasks.map(buildNode);
|
|
187
|
+
return rootTasks.map((task) => buildNode(task, 0, new Set()));
|
|
178
188
|
}
|
|
179
189
|
//# sourceMappingURL=hierarchy.js.map
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"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,MAAM,CAAC,mCAAmC;QAC5C,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,
|
|
1
|
+
{"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,MAAM,CAAC,mCAAmC;QAC5C,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"}
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"hierarchy.test.d.ts","sourceRoot":"","sources":["../../src/utils/hierarchy.test.ts"],"names":[],"mappings":""}
|
|
@@ -0,0 +1,351 @@
|
|
|
1
|
+
import { describe, test, expect } from "bun:test";
|
|
2
|
+
import { MAX_HIERARCHY_DEPTH, getTaskLevel, validateHierarchyDepth, getAncestorIds, getDescendantIds, getChildTasks, getRootTask, buildTaskTree, } from "./hierarchy.js";
|
|
3
|
+
// Helper to create mock tasks
|
|
4
|
+
function createTask(id, parentId, overrides = {}) {
|
|
5
|
+
return {
|
|
6
|
+
id,
|
|
7
|
+
title: `Task ${id}`,
|
|
8
|
+
status: "pending",
|
|
9
|
+
priority: "medium",
|
|
10
|
+
projectId: "test-project",
|
|
11
|
+
createdAt: new Date().toISOString(),
|
|
12
|
+
updatedAt: new Date().toISOString(),
|
|
13
|
+
parentId,
|
|
14
|
+
...overrides,
|
|
15
|
+
};
|
|
16
|
+
}
|
|
17
|
+
describe("MAX_HIERARCHY_DEPTH", () => {
|
|
18
|
+
test("is set to 3", () => {
|
|
19
|
+
expect(MAX_HIERARCHY_DEPTH).toBe(3);
|
|
20
|
+
});
|
|
21
|
+
});
|
|
22
|
+
describe("getTaskLevel", () => {
|
|
23
|
+
test("returns -1 for non-existent task", () => {
|
|
24
|
+
const tasks = [createTask("A")];
|
|
25
|
+
expect(getTaskLevel(tasks, "nonexistent")).toBe(-1);
|
|
26
|
+
});
|
|
27
|
+
test("returns 0 for root task (no parent)", () => {
|
|
28
|
+
const tasks = [createTask("A")];
|
|
29
|
+
expect(getTaskLevel(tasks, "A")).toBe(0);
|
|
30
|
+
});
|
|
31
|
+
test("returns 1 for direct child", () => {
|
|
32
|
+
const tasks = [createTask("A"), createTask("B", "A")];
|
|
33
|
+
expect(getTaskLevel(tasks, "B")).toBe(1);
|
|
34
|
+
});
|
|
35
|
+
test("returns 2 for grandchild", () => {
|
|
36
|
+
const tasks = [createTask("A"), createTask("B", "A"), createTask("C", "B")];
|
|
37
|
+
expect(getTaskLevel(tasks, "C")).toBe(2);
|
|
38
|
+
});
|
|
39
|
+
test("returns 3 for great-grandchild", () => {
|
|
40
|
+
const tasks = [
|
|
41
|
+
createTask("A"),
|
|
42
|
+
createTask("B", "A"),
|
|
43
|
+
createTask("C", "B"),
|
|
44
|
+
createTask("D", "C"),
|
|
45
|
+
];
|
|
46
|
+
expect(getTaskLevel(tasks, "D")).toBe(3);
|
|
47
|
+
});
|
|
48
|
+
test("handles missing parent gracefully", () => {
|
|
49
|
+
// Task B references non-existent parent "missing"
|
|
50
|
+
const tasks = [createTask("A"), createTask("B", "missing")];
|
|
51
|
+
// Should return 0 since parent lookup fails immediately
|
|
52
|
+
expect(getTaskLevel(tasks, "B")).toBe(0);
|
|
53
|
+
});
|
|
54
|
+
test("handles broken chain (middle parent missing)", () => {
|
|
55
|
+
// C -> B -> A, but B is missing
|
|
56
|
+
const tasks = [createTask("A"), createTask("C", "B")];
|
|
57
|
+
// C's parent "B" doesn't exist, so level stays 0
|
|
58
|
+
expect(getTaskLevel(tasks, "C")).toBe(0);
|
|
59
|
+
});
|
|
60
|
+
});
|
|
61
|
+
describe("validateHierarchyDepth", () => {
|
|
62
|
+
test("returns false for non-existent parent", () => {
|
|
63
|
+
const tasks = [createTask("A")];
|
|
64
|
+
expect(validateHierarchyDepth(tasks, "nonexistent")).toBe(false);
|
|
65
|
+
});
|
|
66
|
+
test("returns true when parent is at level 0", () => {
|
|
67
|
+
const tasks = [createTask("A")];
|
|
68
|
+
// Can add child at level 1
|
|
69
|
+
expect(validateHierarchyDepth(tasks, "A")).toBe(true);
|
|
70
|
+
});
|
|
71
|
+
test("returns true when parent is at level 1", () => {
|
|
72
|
+
const tasks = [createTask("A"), createTask("B", "A")];
|
|
73
|
+
// Can add child at level 2
|
|
74
|
+
expect(validateHierarchyDepth(tasks, "B")).toBe(true);
|
|
75
|
+
});
|
|
76
|
+
test("returns true when parent is at level 2", () => {
|
|
77
|
+
const tasks = [createTask("A"), createTask("B", "A"), createTask("C", "B")];
|
|
78
|
+
// Can add child at level 3 (MAX_HIERARCHY_DEPTH)
|
|
79
|
+
expect(validateHierarchyDepth(tasks, "C")).toBe(true);
|
|
80
|
+
});
|
|
81
|
+
test("returns false when parent is at level 3 (max depth)", () => {
|
|
82
|
+
const tasks = [
|
|
83
|
+
createTask("A"),
|
|
84
|
+
createTask("B", "A"),
|
|
85
|
+
createTask("C", "B"),
|
|
86
|
+
createTask("D", "C"),
|
|
87
|
+
];
|
|
88
|
+
// D is at level 3, cannot add child at level 4
|
|
89
|
+
expect(validateHierarchyDepth(tasks, "D")).toBe(false);
|
|
90
|
+
});
|
|
91
|
+
});
|
|
92
|
+
describe("getAncestorIds", () => {
|
|
93
|
+
test("returns empty array for non-existent task", () => {
|
|
94
|
+
const tasks = [createTask("A")];
|
|
95
|
+
expect(getAncestorIds(tasks, "nonexistent")).toEqual([]);
|
|
96
|
+
});
|
|
97
|
+
test("returns empty array for root task", () => {
|
|
98
|
+
const tasks = [createTask("A")];
|
|
99
|
+
expect(getAncestorIds(tasks, "A")).toEqual([]);
|
|
100
|
+
});
|
|
101
|
+
test("returns single ancestor for direct child", () => {
|
|
102
|
+
const tasks = [createTask("A"), createTask("B", "A")];
|
|
103
|
+
expect(getAncestorIds(tasks, "B")).toEqual(["A"]);
|
|
104
|
+
});
|
|
105
|
+
test("returns ancestors ordered from immediate parent to root", () => {
|
|
106
|
+
const tasks = [
|
|
107
|
+
createTask("A"),
|
|
108
|
+
createTask("B", "A"),
|
|
109
|
+
createTask("C", "B"),
|
|
110
|
+
createTask("D", "C"),
|
|
111
|
+
];
|
|
112
|
+
expect(getAncestorIds(tasks, "D")).toEqual(["C", "B", "A"]);
|
|
113
|
+
});
|
|
114
|
+
test("handles missing ancestor in chain", () => {
|
|
115
|
+
// C -> B -> missing
|
|
116
|
+
const tasks = [createTask("B", "missing"), createTask("C", "B")];
|
|
117
|
+
// Returns B and "missing" (the parentId), then stops when "missing" lookup fails
|
|
118
|
+
expect(getAncestorIds(tasks, "C")).toEqual(["B", "missing"]);
|
|
119
|
+
});
|
|
120
|
+
});
|
|
121
|
+
describe("getDescendantIds", () => {
|
|
122
|
+
test("returns empty array for task with no children", () => {
|
|
123
|
+
const tasks = [createTask("A"), createTask("B")];
|
|
124
|
+
expect(getDescendantIds(tasks, "A")).toEqual([]);
|
|
125
|
+
});
|
|
126
|
+
test("returns direct children", () => {
|
|
127
|
+
const tasks = [createTask("A"), createTask("B", "A"), createTask("C", "A")];
|
|
128
|
+
const descendants = getDescendantIds(tasks, "A");
|
|
129
|
+
expect(descendants.sort()).toEqual(["B", "C"]);
|
|
130
|
+
});
|
|
131
|
+
test("returns all descendants (children and grandchildren)", () => {
|
|
132
|
+
const tasks = [
|
|
133
|
+
createTask("A"),
|
|
134
|
+
createTask("B", "A"),
|
|
135
|
+
createTask("C", "A"),
|
|
136
|
+
createTask("D", "B"),
|
|
137
|
+
createTask("E", "B"),
|
|
138
|
+
];
|
|
139
|
+
const descendants = getDescendantIds(tasks, "A");
|
|
140
|
+
expect(descendants.sort()).toEqual(["B", "C", "D", "E"]);
|
|
141
|
+
});
|
|
142
|
+
test("returns descendants in BFS order", () => {
|
|
143
|
+
const tasks = [
|
|
144
|
+
createTask("A"),
|
|
145
|
+
createTask("B", "A"),
|
|
146
|
+
createTask("C", "A"),
|
|
147
|
+
createTask("D", "B"),
|
|
148
|
+
];
|
|
149
|
+
const descendants = getDescendantIds(tasks, "A");
|
|
150
|
+
// BFS: first level (B, C), then second level (D)
|
|
151
|
+
// B and C come before D
|
|
152
|
+
const dIndex = descendants.indexOf("D");
|
|
153
|
+
const bIndex = descendants.indexOf("B");
|
|
154
|
+
const cIndex = descendants.indexOf("C");
|
|
155
|
+
expect(bIndex).toBeLessThan(dIndex);
|
|
156
|
+
expect(cIndex).toBeLessThan(dIndex);
|
|
157
|
+
});
|
|
158
|
+
test("returns empty array for non-existent task", () => {
|
|
159
|
+
const tasks = [createTask("A")];
|
|
160
|
+
expect(getDescendantIds(tasks, "nonexistent")).toEqual([]);
|
|
161
|
+
});
|
|
162
|
+
});
|
|
163
|
+
describe("getChildTasks", () => {
|
|
164
|
+
test("returns empty array for task with no children", () => {
|
|
165
|
+
const tasks = [createTask("A"), createTask("B")];
|
|
166
|
+
expect(getChildTasks(tasks, "A")).toEqual([]);
|
|
167
|
+
});
|
|
168
|
+
test("returns only direct children", () => {
|
|
169
|
+
const tasks = [
|
|
170
|
+
createTask("A"),
|
|
171
|
+
createTask("B", "A"),
|
|
172
|
+
createTask("C", "A"),
|
|
173
|
+
createTask("D", "B"), // grandchild, should not be included
|
|
174
|
+
];
|
|
175
|
+
const children = getChildTasks(tasks, "A");
|
|
176
|
+
expect(children.map((t) => t.id).sort()).toEqual(["B", "C"]);
|
|
177
|
+
});
|
|
178
|
+
test("returns empty array for non-existent parent", () => {
|
|
179
|
+
const tasks = [createTask("A")];
|
|
180
|
+
expect(getChildTasks(tasks, "nonexistent")).toEqual([]);
|
|
181
|
+
});
|
|
182
|
+
test("returns full task objects", () => {
|
|
183
|
+
const tasks = [createTask("A"), createTask("B", "A", { title: "Custom Title" })];
|
|
184
|
+
const children = getChildTasks(tasks, "A");
|
|
185
|
+
expect(children.length).toBe(1);
|
|
186
|
+
expect(children[0].id).toBe("B");
|
|
187
|
+
expect(children[0].title).toBe("Custom Title");
|
|
188
|
+
});
|
|
189
|
+
});
|
|
190
|
+
describe("getRootTask", () => {
|
|
191
|
+
test("returns null for non-existent task", () => {
|
|
192
|
+
const tasks = [createTask("A")];
|
|
193
|
+
expect(getRootTask(tasks, "nonexistent")).toBeNull();
|
|
194
|
+
});
|
|
195
|
+
test("returns the task itself if it has no parent", () => {
|
|
196
|
+
const tasks = [createTask("A")];
|
|
197
|
+
const root = getRootTask(tasks, "A");
|
|
198
|
+
expect(root?.id).toBe("A");
|
|
199
|
+
});
|
|
200
|
+
test("returns root for direct child", () => {
|
|
201
|
+
const tasks = [createTask("A"), createTask("B", "A")];
|
|
202
|
+
const root = getRootTask(tasks, "B");
|
|
203
|
+
expect(root?.id).toBe("A");
|
|
204
|
+
});
|
|
205
|
+
test("returns root for deeply nested task", () => {
|
|
206
|
+
const tasks = [
|
|
207
|
+
createTask("A"),
|
|
208
|
+
createTask("B", "A"),
|
|
209
|
+
createTask("C", "B"),
|
|
210
|
+
createTask("D", "C"),
|
|
211
|
+
];
|
|
212
|
+
const root = getRootTask(tasks, "D");
|
|
213
|
+
expect(root?.id).toBe("A");
|
|
214
|
+
});
|
|
215
|
+
test("handles broken chain (returns earliest found task)", () => {
|
|
216
|
+
// C -> B -> missing
|
|
217
|
+
const tasks = [createTask("B", "missing"), createTask("C", "B")];
|
|
218
|
+
const root = getRootTask(tasks, "C");
|
|
219
|
+
// B's parent "missing" doesn't exist, so B is the root
|
|
220
|
+
expect(root?.id).toBe("B");
|
|
221
|
+
});
|
|
222
|
+
});
|
|
223
|
+
describe("buildTaskTree", () => {
|
|
224
|
+
test("returns empty array for empty task list", () => {
|
|
225
|
+
expect(buildTaskTree([])).toEqual([]);
|
|
226
|
+
});
|
|
227
|
+
test("returns single root task as tree", () => {
|
|
228
|
+
const tasks = [createTask("A")];
|
|
229
|
+
const tree = buildTaskTree(tasks);
|
|
230
|
+
expect(tree.length).toBe(1);
|
|
231
|
+
expect(tree[0].task.id).toBe("A");
|
|
232
|
+
expect(tree[0].children).toEqual([]);
|
|
233
|
+
});
|
|
234
|
+
test("builds tree with children", () => {
|
|
235
|
+
const tasks = [createTask("A"), createTask("B", "A"), createTask("C", "A")];
|
|
236
|
+
const tree = buildTaskTree(tasks);
|
|
237
|
+
expect(tree.length).toBe(1);
|
|
238
|
+
expect(tree[0].task.id).toBe("A");
|
|
239
|
+
expect(tree[0].children.length).toBe(2);
|
|
240
|
+
expect(tree[0].children.map((c) => c.task.id).sort()).toEqual(["B", "C"]);
|
|
241
|
+
});
|
|
242
|
+
test("builds nested tree structure", () => {
|
|
243
|
+
const tasks = [
|
|
244
|
+
createTask("A"),
|
|
245
|
+
createTask("B", "A"),
|
|
246
|
+
createTask("C", "B"),
|
|
247
|
+
createTask("D", "C"),
|
|
248
|
+
];
|
|
249
|
+
const tree = buildTaskTree(tasks);
|
|
250
|
+
expect(tree.length).toBe(1);
|
|
251
|
+
expect(tree[0].task.id).toBe("A");
|
|
252
|
+
expect(tree[0].children.length).toBe(1);
|
|
253
|
+
expect(tree[0].children[0].task.id).toBe("B");
|
|
254
|
+
expect(tree[0].children[0].children.length).toBe(1);
|
|
255
|
+
expect(tree[0].children[0].children[0].task.id).toBe("C");
|
|
256
|
+
expect(tree[0].children[0].children[0].children.length).toBe(1);
|
|
257
|
+
expect(tree[0].children[0].children[0].children[0].task.id).toBe("D");
|
|
258
|
+
});
|
|
259
|
+
test("returns multiple root tasks", () => {
|
|
260
|
+
const tasks = [createTask("A"), createTask("B"), createTask("C")];
|
|
261
|
+
const tree = buildTaskTree(tasks);
|
|
262
|
+
expect(tree.length).toBe(3);
|
|
263
|
+
expect(tree.map((n) => n.task.id).sort()).toEqual(["A", "B", "C"]);
|
|
264
|
+
});
|
|
265
|
+
test("builds tree from specific root", () => {
|
|
266
|
+
const tasks = [
|
|
267
|
+
createTask("A"),
|
|
268
|
+
createTask("B", "A"),
|
|
269
|
+
createTask("C", "B"),
|
|
270
|
+
createTask("X"),
|
|
271
|
+
createTask("Y", "X"),
|
|
272
|
+
];
|
|
273
|
+
const tree = buildTaskTree(tasks, "A");
|
|
274
|
+
expect(tree.length).toBe(1);
|
|
275
|
+
expect(tree[0].task.id).toBe("A");
|
|
276
|
+
expect(tree[0].children.length).toBe(1);
|
|
277
|
+
expect(tree[0].children[0].task.id).toBe("B");
|
|
278
|
+
});
|
|
279
|
+
test("returns empty array for non-existent root", () => {
|
|
280
|
+
const tasks = [createTask("A")];
|
|
281
|
+
const tree = buildTaskTree(tasks, "nonexistent");
|
|
282
|
+
expect(tree).toEqual([]);
|
|
283
|
+
});
|
|
284
|
+
test("can build subtree from middle of hierarchy", () => {
|
|
285
|
+
const tasks = [
|
|
286
|
+
createTask("A"),
|
|
287
|
+
createTask("B", "A"),
|
|
288
|
+
createTask("C", "B"),
|
|
289
|
+
createTask("D", "B"),
|
|
290
|
+
];
|
|
291
|
+
const tree = buildTaskTree(tasks, "B");
|
|
292
|
+
expect(tree.length).toBe(1);
|
|
293
|
+
expect(tree[0].task.id).toBe("B");
|
|
294
|
+
expect(tree[0].children.length).toBe(2);
|
|
295
|
+
expect(tree[0].children.map((c) => c.task.id).sort()).toEqual(["C", "D"]);
|
|
296
|
+
});
|
|
297
|
+
test("respects maxDepth parameter", () => {
|
|
298
|
+
const tasks = [
|
|
299
|
+
createTask("A"),
|
|
300
|
+
createTask("B", "A"),
|
|
301
|
+
createTask("C", "B"),
|
|
302
|
+
createTask("D", "C"),
|
|
303
|
+
];
|
|
304
|
+
// maxDepth of 2 should include A (depth 0), B (depth 1), but stop children at C
|
|
305
|
+
const tree = buildTaskTree(tasks, "A", 2);
|
|
306
|
+
expect(tree.length).toBe(1);
|
|
307
|
+
expect(tree[0].task.id).toBe("A");
|
|
308
|
+
expect(tree[0].children.length).toBe(1);
|
|
309
|
+
expect(tree[0].children[0].task.id).toBe("B");
|
|
310
|
+
// C should be included but with no children (depth 2 is the limit)
|
|
311
|
+
expect(tree[0].children[0].children.length).toBe(1);
|
|
312
|
+
expect(tree[0].children[0].children[0].task.id).toBe("C");
|
|
313
|
+
expect(tree[0].children[0].children[0].children).toEqual([]);
|
|
314
|
+
});
|
|
315
|
+
test("handles circular references gracefully", () => {
|
|
316
|
+
// Create tasks with circular reference: A -> B -> C -> A
|
|
317
|
+
const taskA = createTask("A", "C");
|
|
318
|
+
const taskB = createTask("B", "A");
|
|
319
|
+
const taskC = createTask("C", "B");
|
|
320
|
+
const tasks = [taskA, taskB, taskC];
|
|
321
|
+
// Should not throw or hang - circular ref is detected
|
|
322
|
+
const tree = buildTaskTree(tasks);
|
|
323
|
+
// All tasks have parents, so no "root" tasks exist
|
|
324
|
+
expect(tree).toEqual([]);
|
|
325
|
+
});
|
|
326
|
+
test("handles self-referencing task", () => {
|
|
327
|
+
// Task references itself as parent
|
|
328
|
+
const selfRef = createTask("A", "A");
|
|
329
|
+
const tasks = [selfRef];
|
|
330
|
+
// No root tasks (A has parent), should return empty
|
|
331
|
+
const tree = buildTaskTree(tasks);
|
|
332
|
+
expect(tree).toEqual([]);
|
|
333
|
+
});
|
|
334
|
+
test("handles circular reference when building from specific root", () => {
|
|
335
|
+
// A -> B -> A (circular)
|
|
336
|
+
const taskA = createTask("A");
|
|
337
|
+
const taskB = createTask("B", "A");
|
|
338
|
+
// Manually create circular: make A's children include B which points back
|
|
339
|
+
// by creating a scenario where childrenMap would loop
|
|
340
|
+
const tasks = [taskA, taskB];
|
|
341
|
+
// Simulate circular by modifying childrenMap behavior won't work directly,
|
|
342
|
+
// but we can test that visited set prevents infinite recursion
|
|
343
|
+
// Let's create a more direct test case
|
|
344
|
+
const tree = buildTaskTree(tasks, "A");
|
|
345
|
+
expect(tree.length).toBe(1);
|
|
346
|
+
expect(tree[0].task.id).toBe("A");
|
|
347
|
+
expect(tree[0].children.length).toBe(1);
|
|
348
|
+
expect(tree[0].children[0].task.id).toBe("B");
|
|
349
|
+
});
|
|
350
|
+
});
|
|
351
|
+
//# sourceMappingURL=hierarchy.test.js.map
|