@task-mcp/shared 1.0.20 → 1.0.21
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/package.json +1 -6
- package/dist/algorithms/critical-path.d.ts +0 -46
- package/dist/algorithms/critical-path.d.ts.map +0 -1
- package/dist/algorithms/critical-path.js +0 -320
- package/dist/algorithms/critical-path.js.map +0 -1
- package/dist/algorithms/critical-path.test.d.ts +0 -2
- package/dist/algorithms/critical-path.test.d.ts.map +0 -1
- package/dist/algorithms/critical-path.test.js +0 -194
- package/dist/algorithms/critical-path.test.js.map +0 -1
- package/dist/algorithms/dependency-integrity.d.ts +0 -81
- package/dist/algorithms/dependency-integrity.d.ts.map +0 -1
- package/dist/algorithms/dependency-integrity.js +0 -207
- package/dist/algorithms/dependency-integrity.js.map +0 -1
- package/dist/algorithms/dependency-integrity.test.d.ts +0 -2
- package/dist/algorithms/dependency-integrity.test.d.ts.map +0 -1
- package/dist/algorithms/dependency-integrity.test.js +0 -309
- package/dist/algorithms/dependency-integrity.test.js.map +0 -1
- package/dist/algorithms/index.d.ts +0 -5
- package/dist/algorithms/index.d.ts.map +0 -1
- package/dist/algorithms/index.js +0 -5
- package/dist/algorithms/index.js.map +0 -1
- package/dist/algorithms/tech-analysis.d.ts +0 -106
- package/dist/algorithms/tech-analysis.d.ts.map +0 -1
- package/dist/algorithms/tech-analysis.js +0 -344
- package/dist/algorithms/tech-analysis.js.map +0 -1
- package/dist/algorithms/tech-analysis.test.d.ts +0 -2
- package/dist/algorithms/tech-analysis.test.d.ts.map +0 -1
- package/dist/algorithms/tech-analysis.test.js +0 -338
- package/dist/algorithms/tech-analysis.test.js.map +0 -1
- package/dist/algorithms/topological-sort.d.ts +0 -41
- package/dist/algorithms/topological-sort.d.ts.map +0 -1
- package/dist/algorithms/topological-sort.js +0 -165
- package/dist/algorithms/topological-sort.js.map +0 -1
- package/dist/algorithms/topological-sort.test.d.ts +0 -2
- package/dist/algorithms/topological-sort.test.d.ts.map +0 -1
- package/dist/algorithms/topological-sort.test.js +0 -162
- package/dist/algorithms/topological-sort.test.js.map +0 -1
- package/dist/index.d.ts +0 -4
- package/dist/index.d.ts.map +0 -1
- package/dist/index.js +0 -7
- package/dist/index.js.map +0 -1
- package/dist/schemas/inbox.d.ts +0 -55
- package/dist/schemas/inbox.d.ts.map +0 -1
- package/dist/schemas/inbox.js +0 -25
- package/dist/schemas/inbox.js.map +0 -1
- package/dist/schemas/index.d.ts +0 -7
- package/dist/schemas/index.d.ts.map +0 -1
- package/dist/schemas/index.js +0 -17
- package/dist/schemas/index.js.map +0 -1
- package/dist/schemas/project.d.ts +0 -177
- package/dist/schemas/project.d.ts.map +0 -1
- package/dist/schemas/project.js +0 -56
- package/dist/schemas/project.js.map +0 -1
- package/dist/schemas/response-format.d.ts +0 -148
- package/dist/schemas/response-format.d.ts.map +0 -1
- package/dist/schemas/response-format.js +0 -18
- package/dist/schemas/response-format.js.map +0 -1
- package/dist/schemas/response-schema.d.ts +0 -307
- package/dist/schemas/response-schema.d.ts.map +0 -1
- package/dist/schemas/response-schema.js +0 -75
- package/dist/schemas/response-schema.js.map +0 -1
- package/dist/schemas/response-schema.test.d.ts +0 -2
- package/dist/schemas/response-schema.test.d.ts.map +0 -1
- package/dist/schemas/response-schema.test.js +0 -256
- package/dist/schemas/response-schema.test.js.map +0 -1
- package/dist/schemas/state.d.ts +0 -17
- package/dist/schemas/state.d.ts.map +0 -1
- package/dist/schemas/state.js +0 -17
- package/dist/schemas/state.js.map +0 -1
- package/dist/schemas/task.d.ts +0 -881
- package/dist/schemas/task.d.ts.map +0 -1
- package/dist/schemas/task.js +0 -189
- package/dist/schemas/task.js.map +0 -1
- package/dist/schemas/view.d.ts +0 -143
- package/dist/schemas/view.d.ts.map +0 -1
- package/dist/schemas/view.js +0 -48
- package/dist/schemas/view.js.map +0 -1
- package/dist/utils/dashboard-renderer.d.ts +0 -93
- package/dist/utils/dashboard-renderer.d.ts.map +0 -1
- package/dist/utils/dashboard-renderer.js +0 -424
- package/dist/utils/dashboard-renderer.js.map +0 -1
- package/dist/utils/dashboard-renderer.test.d.ts +0 -2
- package/dist/utils/dashboard-renderer.test.d.ts.map +0 -1
- package/dist/utils/dashboard-renderer.test.js +0 -774
- package/dist/utils/dashboard-renderer.test.js.map +0 -1
- package/dist/utils/date.d.ts +0 -94
- package/dist/utils/date.d.ts.map +0 -1
- package/dist/utils/date.js +0 -323
- package/dist/utils/date.js.map +0 -1
- package/dist/utils/date.test.d.ts +0 -2
- package/dist/utils/date.test.d.ts.map +0 -1
- package/dist/utils/date.test.js +0 -276
- package/dist/utils/date.test.js.map +0 -1
- package/dist/utils/hierarchy.d.ts +0 -102
- package/dist/utils/hierarchy.d.ts.map +0 -1
- package/dist/utils/hierarchy.js +0 -236
- package/dist/utils/hierarchy.js.map +0 -1
- package/dist/utils/hierarchy.test.d.ts +0 -2
- package/dist/utils/hierarchy.test.d.ts.map +0 -1
- package/dist/utils/hierarchy.test.js +0 -436
- package/dist/utils/hierarchy.test.js.map +0 -1
- package/dist/utils/id.d.ts +0 -60
- package/dist/utils/id.d.ts.map +0 -1
- package/dist/utils/id.js +0 -118
- package/dist/utils/id.js.map +0 -1
- package/dist/utils/id.test.d.ts +0 -2
- package/dist/utils/id.test.d.ts.map +0 -1
- package/dist/utils/id.test.js +0 -193
- package/dist/utils/id.test.js.map +0 -1
- package/dist/utils/index.d.ts +0 -12
- package/dist/utils/index.d.ts.map +0 -1
- package/dist/utils/index.js +0 -34
- package/dist/utils/index.js.map +0 -1
- package/dist/utils/natural-language.d.ts +0 -57
- package/dist/utils/natural-language.d.ts.map +0 -1
- package/dist/utils/natural-language.js +0 -211
- package/dist/utils/natural-language.js.map +0 -1
- package/dist/utils/natural-language.test.d.ts +0 -2
- package/dist/utils/natural-language.test.d.ts.map +0 -1
- package/dist/utils/natural-language.test.js +0 -197
- package/dist/utils/natural-language.test.js.map +0 -1
- package/dist/utils/priority-queue.d.ts +0 -17
- package/dist/utils/priority-queue.d.ts.map +0 -1
- package/dist/utils/priority-queue.js +0 -62
- package/dist/utils/priority-queue.js.map +0 -1
- package/dist/utils/priority-queue.test.d.ts +0 -2
- package/dist/utils/priority-queue.test.d.ts.map +0 -1
- package/dist/utils/priority-queue.test.js +0 -82
- package/dist/utils/priority-queue.test.js.map +0 -1
- package/dist/utils/projection.d.ts +0 -65
- package/dist/utils/projection.d.ts.map +0 -1
- package/dist/utils/projection.js +0 -180
- package/dist/utils/projection.js.map +0 -1
- package/dist/utils/projection.test.d.ts +0 -2
- package/dist/utils/projection.test.d.ts.map +0 -1
- package/dist/utils/projection.test.js +0 -336
- package/dist/utils/projection.test.js.map +0 -1
- package/dist/utils/terminal-ui.d.ts +0 -208
- package/dist/utils/terminal-ui.d.ts.map +0 -1
- package/dist/utils/terminal-ui.js +0 -611
- package/dist/utils/terminal-ui.js.map +0 -1
- package/dist/utils/terminal-ui.test.d.ts +0 -2
- package/dist/utils/terminal-ui.test.d.ts.map +0 -1
- package/dist/utils/terminal-ui.test.js +0 -683
- package/dist/utils/terminal-ui.test.js.map +0 -1
- package/dist/utils/workspace.d.ts +0 -100
- package/dist/utils/workspace.d.ts.map +0 -1
- package/dist/utils/workspace.js +0 -173
- package/dist/utils/workspace.js.map +0 -1
- package/dist/utils/workspace.test.d.ts +0 -2
- package/dist/utils/workspace.test.d.ts.map +0 -1
- package/dist/utils/workspace.test.js +0 -97
- package/dist/utils/workspace.test.js.map +0 -1
- package/src/algorithms/critical-path.test.ts +0 -241
- package/src/algorithms/dependency-integrity.test.ts +0 -348
- package/src/algorithms/tech-analysis.test.ts +0 -413
- package/src/algorithms/topological-sort.test.ts +0 -190
- package/src/schemas/response-schema.test.ts +0 -314
- package/src/utils/dashboard-renderer.test.ts +0 -983
- package/src/utils/date.test.ts +0 -329
- package/src/utils/hierarchy.test.ts +0 -505
- package/src/utils/id.test.ts +0 -235
- package/src/utils/natural-language.test.ts +0 -242
- package/src/utils/priority-queue.test.ts +0 -103
- package/src/utils/projection.test.ts +0 -425
- package/src/utils/terminal-ui.test.ts +0 -831
- package/src/utils/workspace.test.ts +0 -125
|
@@ -1,197 +0,0 @@
|
|
|
1
|
-
import { describe, test, expect } from "bun:test";
|
|
2
|
-
import { parseTaskInput, parseInboxInput, InputValidationError, } from "./natural-language.js";
|
|
3
|
-
describe("parseTaskInput", () => {
|
|
4
|
-
describe("priority parsing", () => {
|
|
5
|
-
test("parses !critical priority", () => {
|
|
6
|
-
const result = parseTaskInput("Fix bug !critical");
|
|
7
|
-
expect(result.priority).toBe("critical");
|
|
8
|
-
expect(result.title).toBe("Fix bug");
|
|
9
|
-
});
|
|
10
|
-
test("parses !high priority", () => {
|
|
11
|
-
const result = parseTaskInput("Review PR !high");
|
|
12
|
-
expect(result.priority).toBe("high");
|
|
13
|
-
});
|
|
14
|
-
test("parses !medium priority", () => {
|
|
15
|
-
const result = parseTaskInput("Write docs !medium");
|
|
16
|
-
expect(result.priority).toBe("medium");
|
|
17
|
-
});
|
|
18
|
-
test("parses !low priority", () => {
|
|
19
|
-
const result = parseTaskInput("Clean up !low");
|
|
20
|
-
expect(result.priority).toBe("low");
|
|
21
|
-
});
|
|
22
|
-
test("parses Korean priority !높음", () => {
|
|
23
|
-
const result = parseTaskInput("버그 수정 !높음");
|
|
24
|
-
expect(result.priority).toBe("high");
|
|
25
|
-
expect(result.title).toBe("버그 수정");
|
|
26
|
-
});
|
|
27
|
-
test("parses Korean priority !긴급", () => {
|
|
28
|
-
const result = parseTaskInput("장애 대응 !긴급");
|
|
29
|
-
expect(result.priority).toBe("critical");
|
|
30
|
-
expect(result.title).toBe("장애 대응");
|
|
31
|
-
});
|
|
32
|
-
});
|
|
33
|
-
describe("tag parsing", () => {
|
|
34
|
-
test("parses single tag", () => {
|
|
35
|
-
const result = parseTaskInput("Fix auth #backend");
|
|
36
|
-
expect(result.tags).toEqual(["backend"]);
|
|
37
|
-
expect(result.title).toBe("Fix auth");
|
|
38
|
-
});
|
|
39
|
-
test("parses multiple tags", () => {
|
|
40
|
-
const result = parseTaskInput("Update API #backend #api #v2");
|
|
41
|
-
expect(result.tags).toEqual(["backend", "api", "v2"]);
|
|
42
|
-
});
|
|
43
|
-
test("parses Korean tags", () => {
|
|
44
|
-
const result = parseTaskInput("보고서 작성 #업무 #문서");
|
|
45
|
-
expect(result.tags).toEqual(["업무", "문서"]);
|
|
46
|
-
expect(result.title).toBe("보고서 작성");
|
|
47
|
-
});
|
|
48
|
-
});
|
|
49
|
-
describe("context parsing", () => {
|
|
50
|
-
test("parses single context", () => {
|
|
51
|
-
const result = parseTaskInput("Deep work task @focus");
|
|
52
|
-
expect(result.contexts).toEqual(["focus"]);
|
|
53
|
-
expect(result.title).toBe("Deep work task");
|
|
54
|
-
});
|
|
55
|
-
test("parses multiple contexts", () => {
|
|
56
|
-
const result = parseTaskInput("Review code @focus @office");
|
|
57
|
-
expect(result.contexts).toEqual(["focus", "office"]);
|
|
58
|
-
});
|
|
59
|
-
});
|
|
60
|
-
describe("due date parsing", () => {
|
|
61
|
-
test("parses 'by tomorrow'", () => {
|
|
62
|
-
const result = parseTaskInput("Submit report by tomorrow");
|
|
63
|
-
expect(result.dueDate).toBeDefined();
|
|
64
|
-
expect(result.title).toBe("Submit report");
|
|
65
|
-
});
|
|
66
|
-
test("parses 'until Friday'", () => {
|
|
67
|
-
const result = parseTaskInput("Complete feature until Friday");
|
|
68
|
-
expect(result.dueDate).toBeDefined();
|
|
69
|
-
});
|
|
70
|
-
test("parses Korean '내일까지'", () => {
|
|
71
|
-
const result = parseTaskInput("보고서 제출 내일까지");
|
|
72
|
-
expect(result.dueDate).toBeDefined();
|
|
73
|
-
expect(result.title).toBe("보고서 제출");
|
|
74
|
-
});
|
|
75
|
-
test("parses standalone 'tomorrow' at end", () => {
|
|
76
|
-
const result = parseTaskInput("Submit PR tomorrow");
|
|
77
|
-
expect(result.dueDate).toBeDefined();
|
|
78
|
-
expect(result.title).toBe("Submit PR");
|
|
79
|
-
});
|
|
80
|
-
});
|
|
81
|
-
describe("time estimate parsing", () => {
|
|
82
|
-
test("parses hours only", () => {
|
|
83
|
-
const result = parseTaskInput("Write tests 2h");
|
|
84
|
-
expect(result.estimate?.expected).toBe(120);
|
|
85
|
-
});
|
|
86
|
-
test("parses minutes only", () => {
|
|
87
|
-
const result = parseTaskInput("Quick fix 30m");
|
|
88
|
-
expect(result.estimate?.expected).toBe(30);
|
|
89
|
-
});
|
|
90
|
-
test("parses combined hours and minutes", () => {
|
|
91
|
-
const result = parseTaskInput("Big refactor 1h30m");
|
|
92
|
-
expect(result.estimate?.expected).toBe(90);
|
|
93
|
-
});
|
|
94
|
-
test("removes time estimate from title", () => {
|
|
95
|
-
const result = parseTaskInput("Task 2h30m done");
|
|
96
|
-
expect(result.estimate?.expected).toBe(150);
|
|
97
|
-
expect(result.title).toBe("Task done");
|
|
98
|
-
});
|
|
99
|
-
});
|
|
100
|
-
describe("sortOrder parsing", () => {
|
|
101
|
-
test("parses ^1 as sortOrder 1", () => {
|
|
102
|
-
const result = parseTaskInput("First task ^1");
|
|
103
|
-
expect(result.sortOrder).toBe(1);
|
|
104
|
-
expect(result.title).toBe("First task");
|
|
105
|
-
});
|
|
106
|
-
test("parses ^10 as sortOrder 10", () => {
|
|
107
|
-
const result = parseTaskInput("Tenth task ^10");
|
|
108
|
-
expect(result.sortOrder).toBe(10);
|
|
109
|
-
expect(result.title).toBe("Tenth task");
|
|
110
|
-
});
|
|
111
|
-
test("parses sortOrder in middle of input", () => {
|
|
112
|
-
const result = parseTaskInput("Task ^5 with more text");
|
|
113
|
-
expect(result.sortOrder).toBe(5);
|
|
114
|
-
expect(result.title).toBe("Task with more text");
|
|
115
|
-
});
|
|
116
|
-
test("parses sortOrder with other metadata", () => {
|
|
117
|
-
const result = parseTaskInput("Task ^3 #dev !high");
|
|
118
|
-
expect(result.sortOrder).toBe(3);
|
|
119
|
-
expect(result.tags).toEqual(["dev"]);
|
|
120
|
-
expect(result.priority).toBe("high");
|
|
121
|
-
expect(result.title).toBe("Task");
|
|
122
|
-
});
|
|
123
|
-
});
|
|
124
|
-
describe("combined parsing", () => {
|
|
125
|
-
test("parses full English input", () => {
|
|
126
|
-
const result = parseTaskInput("Review PR #dev !high @focus");
|
|
127
|
-
expect(result.title).toBe("Review PR");
|
|
128
|
-
expect(result.tags).toEqual(["dev"]);
|
|
129
|
-
expect(result.priority).toBe("high");
|
|
130
|
-
expect(result.contexts).toEqual(["focus"]);
|
|
131
|
-
});
|
|
132
|
-
test("parses input with due date", () => {
|
|
133
|
-
const result = parseTaskInput("Submit report by tomorrow #work");
|
|
134
|
-
expect(result.title).toBe("Submit report");
|
|
135
|
-
expect(result.tags).toEqual(["work"]);
|
|
136
|
-
expect(result.dueDate).toBeDefined();
|
|
137
|
-
});
|
|
138
|
-
test("parses full Korean input", () => {
|
|
139
|
-
const result = parseTaskInput("보고서 작성 내일까지 #업무 !높음 @집중");
|
|
140
|
-
expect(result.title).toBe("보고서 작성");
|
|
141
|
-
expect(result.tags).toEqual(["업무"]);
|
|
142
|
-
expect(result.priority).toBe("high");
|
|
143
|
-
expect(result.contexts).toEqual(["집중"]);
|
|
144
|
-
expect(result.dueDate).toBeDefined();
|
|
145
|
-
});
|
|
146
|
-
test("returns clean title with no metadata", () => {
|
|
147
|
-
const result = parseTaskInput("Simple task");
|
|
148
|
-
expect(result.title).toBe("Simple task");
|
|
149
|
-
expect(result.tags).toBeUndefined();
|
|
150
|
-
expect(result.priority).toBeUndefined();
|
|
151
|
-
expect(result.contexts).toBeUndefined();
|
|
152
|
-
expect(result.dueDate).toBeUndefined();
|
|
153
|
-
});
|
|
154
|
-
});
|
|
155
|
-
describe("empty content validation", () => {
|
|
156
|
-
test("throws error when input contains only tags", () => {
|
|
157
|
-
expect(() => parseTaskInput("#tag #only")).toThrow(InputValidationError);
|
|
158
|
-
expect(() => parseTaskInput("#tag #only")).toThrow("Task title cannot be empty after parsing");
|
|
159
|
-
});
|
|
160
|
-
test("throws error when input contains only metadata", () => {
|
|
161
|
-
expect(() => parseTaskInput("#dev !high @focus")).toThrow(InputValidationError);
|
|
162
|
-
});
|
|
163
|
-
test("throws error for empty input", () => {
|
|
164
|
-
expect(() => parseTaskInput("")).toThrow(InputValidationError);
|
|
165
|
-
});
|
|
166
|
-
test("throws error for whitespace-only input", () => {
|
|
167
|
-
expect(() => parseTaskInput(" ")).toThrow(InputValidationError);
|
|
168
|
-
});
|
|
169
|
-
});
|
|
170
|
-
});
|
|
171
|
-
describe("parseInboxInput", () => {
|
|
172
|
-
describe("basic parsing", () => {
|
|
173
|
-
test("parses content with tags", () => {
|
|
174
|
-
const result = parseInboxInput("GraphQL 도입 검토 #backend #연구");
|
|
175
|
-
expect(result.content).toBe("GraphQL 도입 검토");
|
|
176
|
-
expect(result.tags).toEqual(["backend", "연구"]);
|
|
177
|
-
});
|
|
178
|
-
test("parses content without tags", () => {
|
|
179
|
-
const result = parseInboxInput("Simple idea to capture");
|
|
180
|
-
expect(result.content).toBe("Simple idea to capture");
|
|
181
|
-
expect(result.tags).toBeUndefined();
|
|
182
|
-
});
|
|
183
|
-
});
|
|
184
|
-
describe("empty content validation", () => {
|
|
185
|
-
test("throws error when input contains only tags", () => {
|
|
186
|
-
expect(() => parseInboxInput("#tag #only")).toThrow(InputValidationError);
|
|
187
|
-
expect(() => parseInboxInput("#tag #only")).toThrow("Content cannot be empty after parsing");
|
|
188
|
-
});
|
|
189
|
-
test("throws error for empty input", () => {
|
|
190
|
-
expect(() => parseInboxInput("")).toThrow(InputValidationError);
|
|
191
|
-
});
|
|
192
|
-
test("throws error for whitespace-only input", () => {
|
|
193
|
-
expect(() => parseInboxInput(" ")).toThrow(InputValidationError);
|
|
194
|
-
});
|
|
195
|
-
});
|
|
196
|
-
});
|
|
197
|
-
//# sourceMappingURL=natural-language.test.js.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"natural-language.test.js","sourceRoot":"","sources":["../../src/utils/natural-language.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAClD,OAAO,EACL,cAAc,EACd,eAAe,EACf,oBAAoB,GACrB,MAAM,uBAAuB,CAAC;AAE/B,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;IAC9B,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;QAChC,IAAI,CAAC,2BAA2B,EAAE,GAAG,EAAE;YACrC,MAAM,MAAM,GAAG,cAAc,CAAC,mBAAmB,CAAC,CAAC;YACnD,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACzC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACvC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,uBAAuB,EAAE,GAAG,EAAE;YACjC,MAAM,MAAM,GAAG,cAAc,CAAC,iBAAiB,CAAC,CAAC;YACjD,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACvC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,yBAAyB,EAAE,GAAG,EAAE;YACnC,MAAM,MAAM,GAAG,cAAc,CAAC,oBAAoB,CAAC,CAAC;YACpD,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,sBAAsB,EAAE,GAAG,EAAE;YAChC,MAAM,MAAM,GAAG,cAAc,CAAC,eAAe,CAAC,CAAC;YAC/C,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,4BAA4B,EAAE,GAAG,EAAE;YACtC,MAAM,MAAM,GAAG,cAAc,CAAC,WAAW,CAAC,CAAC;YAC3C,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACrC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,4BAA4B,EAAE,GAAG,EAAE;YACtC,MAAM,MAAM,GAAG,cAAc,CAAC,WAAW,CAAC,CAAC;YAC3C,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACzC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;QAC3B,IAAI,CAAC,mBAAmB,EAAE,GAAG,EAAE;YAC7B,MAAM,MAAM,GAAG,cAAc,CAAC,mBAAmB,CAAC,CAAC;YACnD,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC;YACzC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACxC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,sBAAsB,EAAE,GAAG,EAAE;YAChC,MAAM,MAAM,GAAG,cAAc,CAAC,8BAA8B,CAAC,CAAC;YAC9D,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;QACxD,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,oBAAoB,EAAE,GAAG,EAAE;YAC9B,MAAM,MAAM,GAAG,cAAc,CAAC,gBAAgB,CAAC,CAAC;YAChD,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;YAC1C,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACtC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;QAC/B,IAAI,CAAC,uBAAuB,EAAE,GAAG,EAAE;YACjC,MAAM,MAAM,GAAG,cAAc,CAAC,uBAAuB,CAAC,CAAC;YACvD,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;YAC3C,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;QAC9C,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,0BAA0B,EAAE,GAAG,EAAE;YACpC,MAAM,MAAM,GAAG,cAAc,CAAC,4BAA4B,CAAC,CAAC;YAC5D,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;QAChC,IAAI,CAAC,sBAAsB,EAAE,GAAG,EAAE;YAChC,MAAM,MAAM,GAAG,cAAc,CAAC,2BAA2B,CAAC,CAAC;YAC3D,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC;YACrC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;QAC7C,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,uBAAuB,EAAE,GAAG,EAAE;YACjC,MAAM,MAAM,GAAG,cAAc,CAAC,+BAA+B,CAAC,CAAC;YAC/D,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC;QACvC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,sBAAsB,EAAE,GAAG,EAAE;YAChC,MAAM,MAAM,GAAG,cAAc,CAAC,aAAa,CAAC,CAAC;YAC7C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC;YACrC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACtC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,qCAAqC,EAAE,GAAG,EAAE;YAC/C,MAAM,MAAM,GAAG,cAAc,CAAC,oBAAoB,CAAC,CAAC;YACpD,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC;YACrC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,uBAAuB,EAAE,GAAG,EAAE;QACrC,IAAI,CAAC,mBAAmB,EAAE,GAAG,EAAE;YAC7B,MAAM,MAAM,GAAG,cAAc,CAAC,gBAAgB,CAAC,CAAC;YAChD,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC9C,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,qBAAqB,EAAE,GAAG,EAAE;YAC/B,MAAM,MAAM,GAAG,cAAc,CAAC,eAAe,CAAC,CAAC;YAC/C,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC7C,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,mCAAmC,EAAE,GAAG,EAAE;YAC7C,MAAM,MAAM,GAAG,cAAc,CAAC,oBAAoB,CAAC,CAAC;YACpD,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC7C,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,kCAAkC,EAAE,GAAG,EAAE;YAC5C,MAAM,MAAM,GAAG,cAAc,CAAC,iBAAiB,CAAC,CAAC;YACjD,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC5C,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;QACjC,IAAI,CAAC,0BAA0B,EAAE,GAAG,EAAE;YACpC,MAAM,MAAM,GAAG,cAAc,CAAC,eAAe,CAAC,CAAC;YAC/C,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,4BAA4B,EAAE,GAAG,EAAE;YACtC,MAAM,MAAM,GAAG,cAAc,CAAC,gBAAgB,CAAC,CAAC;YAChD,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAClC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,qCAAqC,EAAE,GAAG,EAAE;YAC/C,MAAM,MAAM,GAAG,cAAc,CAAC,wBAAwB,CAAC,CAAC;YACxD,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;QACnD,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,sCAAsC,EAAE,GAAG,EAAE;YAChD,MAAM,MAAM,GAAG,cAAc,CAAC,oBAAoB,CAAC,CAAC;YACpD,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;YACrC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACrC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;QAChC,IAAI,CAAC,2BAA2B,EAAE,GAAG,EAAE;YACrC,MAAM,MAAM,GAAG,cAAc,CAAC,6BAA6B,CAAC,CAAC;YAC7D,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YACvC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;YACrC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACrC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;QAC7C,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,4BAA4B,EAAE,GAAG,EAAE;YACtC,MAAM,MAAM,GAAG,cAAc,CAAC,iCAAiC,CAAC,CAAC;YACjE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;YAC3C,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;YACtC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC;QACvC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,0BAA0B,EAAE,GAAG,EAAE;YACpC,MAAM,MAAM,GAAG,cAAc,CAAC,yBAAyB,CAAC,CAAC;YACzD,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACpC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACpC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACrC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACxC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC;QACvC,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,sCAAsC,EAAE,GAAG,EAAE;YAChD,MAAM,MAAM,GAAG,cAAc,CAAC,aAAa,CAAC,CAAC;YAC7C,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YACzC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,aAAa,EAAE,CAAC;YACpC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,aAAa,EAAE,CAAC;YACxC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,aAAa,EAAE,CAAC;YACxC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,aAAa,EAAE,CAAC;QACzC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,0BAA0B,EAAE,GAAG,EAAE;QACxC,IAAI,CAAC,4CAA4C,EAAE,GAAG,EAAE;YACtD,MAAM,CAAC,GAAG,EAAE,CAAC,cAAc,CAAC,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,oBAAoB,CAAC,CAAC;YACzE,MAAM,CAAC,GAAG,EAAE,CAAC,cAAc,CAAC,YAAY,CAAC,CAAC,CAAC,OAAO,CAChD,0CAA0C,CAC3C,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,gDAAgD,EAAE,GAAG,EAAE;YAC1D,MAAM,CAAC,GAAG,EAAE,CAAC,cAAc,CAAC,mBAAmB,CAAC,CAAC,CAAC,OAAO,CACvD,oBAAoB,CACrB,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,8BAA8B,EAAE,GAAG,EAAE;YACxC,MAAM,CAAC,GAAG,EAAE,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,oBAAoB,CAAC,CAAC;QACjE,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,wCAAwC,EAAE,GAAG,EAAE;YAClD,MAAM,CAAC,GAAG,EAAE,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,oBAAoB,CAAC,CAAC;QACpE,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;IAC/B,QAAQ,CAAC,eAAe,EAAE,GAAG,EAAE;QAC7B,IAAI,CAAC,0BAA0B,EAAE,GAAG,EAAE;YACpC,MAAM,MAAM,GAAG,eAAe,CAAC,4BAA4B,CAAC,CAAC;YAC7D,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;YAC7C,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC;QACjD,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,6BAA6B,EAAE,GAAG,EAAE;YACvC,MAAM,MAAM,GAAG,eAAe,CAAC,wBAAwB,CAAC,CAAC;YACzD,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC;YACtD,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,aAAa,EAAE,CAAC;QACtC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,0BAA0B,EAAE,GAAG,EAAE;QACxC,IAAI,CAAC,4CAA4C,EAAE,GAAG,EAAE;YACtD,MAAM,CAAC,GAAG,EAAE,CAAC,eAAe,CAAC,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,oBAAoB,CAAC,CAAC;YAC1E,MAAM,CAAC,GAAG,EAAE,CAAC,eAAe,CAAC,YAAY,CAAC,CAAC,CAAC,OAAO,CACjD,uCAAuC,CACxC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,8BAA8B,EAAE,GAAG,EAAE;YACxC,MAAM,CAAC,GAAG,EAAE,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,oBAAoB,CAAC,CAAC;QAClE,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,wCAAwC,EAAE,GAAG,EAAE;YAClD,MAAM,CAAC,GAAG,EAAE,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,oBAAoB,CAAC,CAAC;QACrE,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
|
|
@@ -1,17 +0,0 @@
|
|
|
1
|
-
/**
|
|
2
|
-
* Max-heap implementation for priority queue (higher priority = higher value comes first)
|
|
3
|
-
* O(log n) insert and extract operations vs O(n log n) for sort-based approach
|
|
4
|
-
*/
|
|
5
|
-
export declare class PriorityQueue<T> {
|
|
6
|
-
private heap;
|
|
7
|
-
private compare;
|
|
8
|
-
constructor(compare: (a: T, b: T) => number);
|
|
9
|
-
get length(): number;
|
|
10
|
-
push(item: T): void;
|
|
11
|
-
pop(): T | undefined;
|
|
12
|
-
peek(): T | undefined;
|
|
13
|
-
isEmpty(): boolean;
|
|
14
|
-
private bubbleUp;
|
|
15
|
-
private bubbleDown;
|
|
16
|
-
}
|
|
17
|
-
//# sourceMappingURL=priority-queue.d.ts.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"priority-queue.d.ts","sourceRoot":"","sources":["../../src/utils/priority-queue.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,qBAAa,aAAa,CAAC,CAAC;IAC1B,OAAO,CAAC,IAAI,CAAW;IACvB,OAAO,CAAC,OAAO,CAAyB;gBAE5B,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM;IAI3C,IAAI,MAAM,IAAI,MAAM,CAEnB;IAED,IAAI,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI;IAKnB,GAAG,IAAI,CAAC,GAAG,SAAS;IAUpB,IAAI,IAAI,CAAC,GAAG,SAAS;IAIrB,OAAO,IAAI,OAAO;IAIlB,OAAO,CAAC,QAAQ;IAShB,OAAO,CAAC,UAAU;CAmBnB"}
|
|
@@ -1,62 +0,0 @@
|
|
|
1
|
-
/**
|
|
2
|
-
* Max-heap implementation for priority queue (higher priority = higher value comes first)
|
|
3
|
-
* O(log n) insert and extract operations vs O(n log n) for sort-based approach
|
|
4
|
-
*/
|
|
5
|
-
export class PriorityQueue {
|
|
6
|
-
heap = [];
|
|
7
|
-
compare;
|
|
8
|
-
constructor(compare) {
|
|
9
|
-
this.compare = compare;
|
|
10
|
-
}
|
|
11
|
-
get length() {
|
|
12
|
-
return this.heap.length;
|
|
13
|
-
}
|
|
14
|
-
push(item) {
|
|
15
|
-
this.heap.push(item);
|
|
16
|
-
this.bubbleUp(this.heap.length - 1);
|
|
17
|
-
}
|
|
18
|
-
pop() {
|
|
19
|
-
if (this.heap.length === 0)
|
|
20
|
-
return undefined;
|
|
21
|
-
if (this.heap.length === 1)
|
|
22
|
-
return this.heap.pop();
|
|
23
|
-
const result = this.heap[0];
|
|
24
|
-
this.heap[0] = this.heap.pop();
|
|
25
|
-
this.bubbleDown(0);
|
|
26
|
-
return result;
|
|
27
|
-
}
|
|
28
|
-
peek() {
|
|
29
|
-
return this.heap[0];
|
|
30
|
-
}
|
|
31
|
-
isEmpty() {
|
|
32
|
-
return this.heap.length === 0;
|
|
33
|
-
}
|
|
34
|
-
bubbleUp(index) {
|
|
35
|
-
while (index > 0) {
|
|
36
|
-
const parentIndex = Math.floor((index - 1) / 2);
|
|
37
|
-
if (this.compare(this.heap[index], this.heap[parentIndex]) <= 0)
|
|
38
|
-
break;
|
|
39
|
-
[this.heap[index], this.heap[parentIndex]] = [this.heap[parentIndex], this.heap[index]];
|
|
40
|
-
index = parentIndex;
|
|
41
|
-
}
|
|
42
|
-
}
|
|
43
|
-
bubbleDown(index) {
|
|
44
|
-
const length = this.heap.length;
|
|
45
|
-
while (true) {
|
|
46
|
-
const leftChild = 2 * index + 1;
|
|
47
|
-
const rightChild = 2 * index + 2;
|
|
48
|
-
let largest = index;
|
|
49
|
-
if (leftChild < length && this.compare(this.heap[leftChild], this.heap[largest]) > 0) {
|
|
50
|
-
largest = leftChild;
|
|
51
|
-
}
|
|
52
|
-
if (rightChild < length && this.compare(this.heap[rightChild], this.heap[largest]) > 0) {
|
|
53
|
-
largest = rightChild;
|
|
54
|
-
}
|
|
55
|
-
if (largest === index)
|
|
56
|
-
break;
|
|
57
|
-
[this.heap[index], this.heap[largest]] = [this.heap[largest], this.heap[index]];
|
|
58
|
-
index = largest;
|
|
59
|
-
}
|
|
60
|
-
}
|
|
61
|
-
}
|
|
62
|
-
//# sourceMappingURL=priority-queue.js.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"priority-queue.js","sourceRoot":"","sources":["../../src/utils/priority-queue.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,MAAM,OAAO,aAAa;IAChB,IAAI,GAAQ,EAAE,CAAC;IACf,OAAO,CAAyB;IAExC,YAAY,OAA+B;QACzC,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;IAED,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IAC1B,CAAC;IAED,IAAI,CAAC,IAAO;QACV,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACtC,CAAC;IAED,GAAG;QACD,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC7C,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;QAEnD,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAG,CAAC;QAChC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACnB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC;IAChC,CAAC;IAEO,QAAQ,CAAC,KAAa;QAC5B,OAAO,KAAK,GAAG,CAAC,EAAE,CAAC;YACjB,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChD,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAE,EAAE,IAAI,CAAC,IAAI,CAAC,WAAW,CAAE,CAAC,IAAI,CAAC;gBAAE,MAAM;YACzE,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAE,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAE,CAAC,CAAC;YAC1F,KAAK,GAAG,WAAW,CAAC;QACtB,CAAC;IACH,CAAC;IAEO,UAAU,CAAC,KAAa;QAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAChC,OAAO,IAAI,EAAE,CAAC;YACZ,MAAM,SAAS,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;YAChC,MAAM,UAAU,GAAG,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC;YACjC,IAAI,OAAO,GAAG,KAAK,CAAC;YAEpB,IAAI,SAAS,GAAG,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAE,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAE,CAAC,GAAG,CAAC,EAAE,CAAC;gBACvF,OAAO,GAAG,SAAS,CAAC;YACtB,CAAC;YACD,IAAI,UAAU,GAAG,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAE,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAE,CAAC,GAAG,CAAC,EAAE,CAAC;gBACzF,OAAO,GAAG,UAAU,CAAC;YACvB,CAAC;YAED,IAAI,OAAO,KAAK,KAAK;gBAAE,MAAM;YAC7B,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAE,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAE,CAAC,CAAC;YAClF,KAAK,GAAG,OAAO,CAAC;QAClB,CAAC;IACH,CAAC;CACF"}
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"priority-queue.test.d.ts","sourceRoot":"","sources":["../../src/utils/priority-queue.test.ts"],"names":[],"mappings":""}
|
|
@@ -1,82 +0,0 @@
|
|
|
1
|
-
import { describe, expect, test } from "bun:test";
|
|
2
|
-
import { PriorityQueue } from "./priority-queue";
|
|
3
|
-
describe("PriorityQueue", () => {
|
|
4
|
-
test("creates empty queue", () => {
|
|
5
|
-
const pq = new PriorityQueue((a, b) => a - b);
|
|
6
|
-
expect(pq.length).toBe(0);
|
|
7
|
-
expect(pq.isEmpty()).toBe(true);
|
|
8
|
-
});
|
|
9
|
-
test("pop from empty queue returns undefined", () => {
|
|
10
|
-
const pq = new PriorityQueue((a, b) => a - b);
|
|
11
|
-
expect(pq.pop()).toBeUndefined();
|
|
12
|
-
});
|
|
13
|
-
test("peek from empty queue returns undefined", () => {
|
|
14
|
-
const pq = new PriorityQueue((a, b) => a - b);
|
|
15
|
-
expect(pq.peek()).toBeUndefined();
|
|
16
|
-
});
|
|
17
|
-
test("single element operations", () => {
|
|
18
|
-
const pq = new PriorityQueue((a, b) => a - b);
|
|
19
|
-
pq.push(42);
|
|
20
|
-
expect(pq.length).toBe(1);
|
|
21
|
-
expect(pq.peek()).toBe(42);
|
|
22
|
-
expect(pq.pop()).toBe(42);
|
|
23
|
-
expect(pq.isEmpty()).toBe(true);
|
|
24
|
-
});
|
|
25
|
-
test("maintains max-heap property (higher value first with a-b comparator)", () => {
|
|
26
|
-
const pq = new PriorityQueue((a, b) => a - b);
|
|
27
|
-
pq.push(5);
|
|
28
|
-
pq.push(2);
|
|
29
|
-
pq.push(8);
|
|
30
|
-
pq.push(1);
|
|
31
|
-
pq.push(9);
|
|
32
|
-
// Max-heap: higher values come first
|
|
33
|
-
expect(pq.pop()).toBe(9);
|
|
34
|
-
expect(pq.pop()).toBe(8);
|
|
35
|
-
expect(pq.pop()).toBe(5);
|
|
36
|
-
expect(pq.pop()).toBe(2);
|
|
37
|
-
expect(pq.pop()).toBe(1);
|
|
38
|
-
});
|
|
39
|
-
test("works with reversed comparator (min-heap behavior)", () => {
|
|
40
|
-
const pq = new PriorityQueue((a, b) => b - a);
|
|
41
|
-
pq.push(5);
|
|
42
|
-
pq.push(2);
|
|
43
|
-
pq.push(8);
|
|
44
|
-
// Reversed comparator: smaller values come first
|
|
45
|
-
expect(pq.pop()).toBe(2);
|
|
46
|
-
expect(pq.pop()).toBe(5);
|
|
47
|
-
expect(pq.pop()).toBe(8);
|
|
48
|
-
});
|
|
49
|
-
test("works with objects", () => {
|
|
50
|
-
// Higher priority value = higher priority (max-heap)
|
|
51
|
-
const pq = new PriorityQueue((a, b) => a.priority - b.priority);
|
|
52
|
-
pq.push({ priority: 3, name: "high" });
|
|
53
|
-
pq.push({ priority: 1, name: "low" });
|
|
54
|
-
pq.push({ priority: 2, name: "medium" });
|
|
55
|
-
expect(pq.pop()?.name).toBe("high");
|
|
56
|
-
expect(pq.pop()?.name).toBe("medium");
|
|
57
|
-
expect(pq.pop()?.name).toBe("low");
|
|
58
|
-
});
|
|
59
|
-
test("length property tracks queue size correctly", () => {
|
|
60
|
-
const pq = new PriorityQueue((a, b) => a - b);
|
|
61
|
-
expect(pq.length).toBe(0);
|
|
62
|
-
pq.push(1);
|
|
63
|
-
expect(pq.length).toBe(1);
|
|
64
|
-
pq.push(2);
|
|
65
|
-
pq.push(3);
|
|
66
|
-
expect(pq.length).toBe(3);
|
|
67
|
-
pq.pop();
|
|
68
|
-
expect(pq.length).toBe(2);
|
|
69
|
-
pq.pop();
|
|
70
|
-
pq.pop();
|
|
71
|
-
expect(pq.length).toBe(0);
|
|
72
|
-
});
|
|
73
|
-
test("peek does not remove element", () => {
|
|
74
|
-
const pq = new PriorityQueue((a, b) => a - b);
|
|
75
|
-
pq.push(5);
|
|
76
|
-
pq.push(10);
|
|
77
|
-
expect(pq.peek()).toBe(10);
|
|
78
|
-
expect(pq.peek()).toBe(10);
|
|
79
|
-
expect(pq.length).toBe(2);
|
|
80
|
-
});
|
|
81
|
-
});
|
|
82
|
-
//# sourceMappingURL=priority-queue.test.js.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"priority-queue.test.js","sourceRoot":"","sources":["../../src/utils/priority-queue.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,UAAU,CAAC;AAClD,OAAO,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAEjD,QAAQ,CAAC,eAAe,EAAE,GAAG,EAAE;IAC7B,IAAI,CAAC,qBAAqB,EAAE,GAAG,EAAE;QAC/B,MAAM,EAAE,GAAG,IAAI,aAAa,CAAS,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtD,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,wCAAwC,EAAE,GAAG,EAAE;QAClD,MAAM,EAAE,GAAG,IAAI,aAAa,CAAS,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtD,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,yCAAyC,EAAE,GAAG,EAAE;QACnD,MAAM,EAAE,GAAG,IAAI,aAAa,CAAS,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtD,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACrC,MAAM,EAAE,GAAG,IAAI,aAAa,CAAS,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtD,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACZ,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC3B,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC1B,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,sEAAsE,EAAE,GAAG,EAAE;QAChF,MAAM,EAAE,GAAG,IAAI,aAAa,CAAS,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtD,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACX,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACX,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACX,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACX,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAEX,qCAAqC;QACrC,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,oDAAoD,EAAE,GAAG,EAAE;QAC9D,MAAM,EAAE,GAAG,IAAI,aAAa,CAAS,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtD,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACX,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACX,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAEX,iDAAiD;QACjD,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC3B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAK9B,qDAAqD;QACrD,MAAM,EAAE,GAAG,IAAI,aAAa,CAAO,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;QAEtE,EAAE,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;QACvC,EAAE,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;QACtC,EAAE,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;QAEzC,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACpC,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACtC,MAAM,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACvD,MAAM,EAAE,GAAG,IAAI,aAAa,CAAS,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtD,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAE1B,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACX,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAE1B,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACX,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACX,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAE1B,EAAE,CAAC,GAAG,EAAE,CAAC;QACT,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAE1B,EAAE,CAAC,GAAG,EAAE,CAAC;QACT,EAAE,CAAC,GAAG,EAAE,CAAC;QACT,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,8BAA8B,EAAE,GAAG,EAAE;QACxC,MAAM,EAAE,GAAG,IAAI,aAAa,CAAS,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtD,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACX,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAEZ,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC3B,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC3B,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
|
|
@@ -1,65 +0,0 @@
|
|
|
1
|
-
/**
|
|
2
|
-
* Projection Utilities
|
|
3
|
-
*
|
|
4
|
-
* Transform full objects into token-efficient projections.
|
|
5
|
-
* Reduces token usage by 70-88% for list operations.
|
|
6
|
-
*/
|
|
7
|
-
import type { Task } from "../schemas/task.js";
|
|
8
|
-
import type { InboxItem } from "../schemas/inbox.js";
|
|
9
|
-
import type { ResponseFormat, TaskSummary, TaskPreview, InboxSummary, InboxPreview, PaginatedResponse } from "../schemas/response-format.js";
|
|
10
|
-
/**
|
|
11
|
-
* Project a single task to the specified format
|
|
12
|
-
*/
|
|
13
|
-
export declare function projectTask(task: Task, format: ResponseFormat): TaskSummary | TaskPreview | Task;
|
|
14
|
-
/**
|
|
15
|
-
* Project multiple tasks with optional limit
|
|
16
|
-
*/
|
|
17
|
-
export declare function projectTasks(tasks: Task[], format: ResponseFormat, limit?: number): (TaskSummary | TaskPreview | Task)[];
|
|
18
|
-
/**
|
|
19
|
-
* Project tasks with pagination
|
|
20
|
-
*/
|
|
21
|
-
export declare function projectTasksPaginated(tasks: Task[], format: ResponseFormat, limit?: number, offset?: number): PaginatedResponse<TaskSummary | TaskPreview | Task>;
|
|
22
|
-
/**
|
|
23
|
-
* Project a single inbox item to the specified format
|
|
24
|
-
*/
|
|
25
|
-
export declare function projectInboxItem(item: InboxItem, format: ResponseFormat): InboxSummary | InboxPreview | InboxItem;
|
|
26
|
-
/**
|
|
27
|
-
* Project multiple inbox items with optional limit
|
|
28
|
-
*/
|
|
29
|
-
export declare function projectInboxItems(items: InboxItem[], format: ResponseFormat, limit?: number): (InboxSummary | InboxPreview | InboxItem)[];
|
|
30
|
-
/**
|
|
31
|
-
* Format response based on format type
|
|
32
|
-
* - concise/standard: JSON string for machine processing
|
|
33
|
-
* - detailed: Human-readable text
|
|
34
|
-
*/
|
|
35
|
-
export declare function formatResponse<T>(data: T | T[], format: ResponseFormat, detailedFormatter?: (data: T | T[]) => string): string;
|
|
36
|
-
/**
|
|
37
|
-
* Apply pagination parameters
|
|
38
|
-
*/
|
|
39
|
-
export declare function applyPagination<T>(items: T[], limit?: number, offset?: number): {
|
|
40
|
-
items: T[];
|
|
41
|
-
hasMore: boolean;
|
|
42
|
-
total: number;
|
|
43
|
-
};
|
|
44
|
-
/**
|
|
45
|
-
* Truncate string for token efficiency
|
|
46
|
-
*/
|
|
47
|
-
export declare function truncate(str: string, maxLength?: number): string;
|
|
48
|
-
/**
|
|
49
|
-
* Summarize a list of items for token efficiency
|
|
50
|
-
*/
|
|
51
|
-
export declare function summarizeList<T>(items: T[], maxDisplay: number | undefined, getId: (item: T) => string): {
|
|
52
|
-
displayed: T[];
|
|
53
|
-
remaining: number;
|
|
54
|
-
remainingIds: string[];
|
|
55
|
-
};
|
|
56
|
-
/**
|
|
57
|
-
* Sort tasks by sortOrder, then by other criteria.
|
|
58
|
-
* Tasks with sortOrder come first (ascending), then tasks without sortOrder (by updatedAt descending).
|
|
59
|
-
*
|
|
60
|
-
* @param tasks - Array of tasks to sort
|
|
61
|
-
* @param secondarySort - Optional secondary sort when sortOrder is equal or both undefined
|
|
62
|
-
* @returns Sorted array (mutates the original)
|
|
63
|
-
*/
|
|
64
|
-
export declare function sortTasks(tasks: Task[], secondarySort?: "updatedAt" | "priority" | "dueDate"): Task[];
|
|
65
|
-
//# sourceMappingURL=projection.d.ts.map
|
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"projection.d.ts","sourceRoot":"","sources":["../../src/utils/projection.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,oBAAoB,CAAC;AAC/C,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AACrD,OAAO,KAAK,EACV,cAAc,EACd,WAAW,EACX,WAAW,EACX,YAAY,EACZ,YAAY,EACZ,iBAAiB,EAClB,MAAM,+BAA+B,CAAC;AAUvC;;GAEG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,cAAc,GAAG,WAAW,GAAG,WAAW,GAAG,IAAI,CA2BhG;AAED;;GAEG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE,IAAI,EAAE,EACb,MAAM,EAAE,cAAc,EACtB,KAAK,CAAC,EAAE,MAAM,GACb,CAAC,WAAW,GAAG,WAAW,GAAG,IAAI,CAAC,EAAE,CAGtC;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CACnC,KAAK,EAAE,IAAI,EAAE,EACb,MAAM,EAAE,cAAc,EACtB,KAAK,GAAE,MAAW,EAClB,MAAM,GAAE,MAAU,GACjB,iBAAiB,CAAC,WAAW,GAAG,WAAW,GAAG,IAAI,CAAC,CAYrD;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAC9B,IAAI,EAAE,SAAS,EACf,MAAM,EAAE,cAAc,GACrB,YAAY,GAAG,YAAY,GAAG,SAAS,CAuBzC;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAC/B,KAAK,EAAE,SAAS,EAAE,EAClB,MAAM,EAAE,cAAc,EACtB,KAAK,CAAC,EAAE,MAAM,GACb,CAAC,YAAY,GAAG,YAAY,GAAG,SAAS,CAAC,EAAE,CAG7C;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAC9B,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,EACb,MAAM,EAAE,cAAc,EACtB,iBAAiB,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,MAAM,GAC5C,MAAM,CAOR;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAC/B,KAAK,EAAE,CAAC,EAAE,EACV,KAAK,GAAE,MAAW,EAClB,MAAM,GAAE,MAAU,GACjB;IAAE,KAAK,EAAE,CAAC,EAAE,CAAC;IAAC,OAAO,EAAE,OAAO,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAUjD;AAED;;GAEG;AACH,wBAAgB,QAAQ,CAAC,GAAG,EAAE,MAAM,EAAE,SAAS,GAAE,MAAY,GAAG,MAAM,CAGrE;AAED;;GAEG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAC7B,KAAK,EAAE,CAAC,EAAE,EACV,UAAU,EAAE,MAAM,YAAI,EACtB,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,MAAM,GACzB;IAAE,SAAS,EAAE,CAAC,EAAE,CAAC;IAAC,SAAS,EAAE,MAAM,CAAC;IAAC,YAAY,EAAE,MAAM,EAAE,CAAA;CAAE,CAS/D;AAED;;;;;;;GAOG;AACH,wBAAgB,SAAS,CACvB,KAAK,EAAE,IAAI,EAAE,EACb,aAAa,GAAE,WAAW,GAAG,UAAU,GAAG,SAAuB,GAChE,IAAI,EAAE,CAkCR"}
|
package/dist/utils/projection.js
DELETED
|
@@ -1,180 +0,0 @@
|
|
|
1
|
-
/**
|
|
2
|
-
* Projection Utilities
|
|
3
|
-
*
|
|
4
|
-
* Transform full objects into token-efficient projections.
|
|
5
|
-
* Reduces token usage by 70-88% for list operations.
|
|
6
|
-
*/
|
|
7
|
-
/**
|
|
8
|
-
* Exhaustiveness check helper for switch statements.
|
|
9
|
-
* TypeScript will error if a case is not handled.
|
|
10
|
-
*/
|
|
11
|
-
function assertNever(value) {
|
|
12
|
-
throw new Error(`Unexpected value: ${value}`);
|
|
13
|
-
}
|
|
14
|
-
/**
|
|
15
|
-
* Project a single task to the specified format
|
|
16
|
-
*/
|
|
17
|
-
export function projectTask(task, format) {
|
|
18
|
-
switch (format) {
|
|
19
|
-
case "concise":
|
|
20
|
-
return {
|
|
21
|
-
id: task.id,
|
|
22
|
-
title: task.title,
|
|
23
|
-
status: task.status,
|
|
24
|
-
priority: task.priority,
|
|
25
|
-
};
|
|
26
|
-
case "standard":
|
|
27
|
-
return {
|
|
28
|
-
id: task.id,
|
|
29
|
-
title: task.title,
|
|
30
|
-
status: task.status,
|
|
31
|
-
priority: task.priority,
|
|
32
|
-
dueDate: task.dueDate,
|
|
33
|
-
tags: task.tags,
|
|
34
|
-
contexts: task.contexts,
|
|
35
|
-
parentId: task.parentId,
|
|
36
|
-
};
|
|
37
|
-
case "detailed":
|
|
38
|
-
return task;
|
|
39
|
-
default:
|
|
40
|
-
return assertNever(format);
|
|
41
|
-
}
|
|
42
|
-
}
|
|
43
|
-
/**
|
|
44
|
-
* Project multiple tasks with optional limit
|
|
45
|
-
*/
|
|
46
|
-
export function projectTasks(tasks, format, limit) {
|
|
47
|
-
const sliced = limit ? tasks.slice(0, limit) : tasks;
|
|
48
|
-
return sliced.map((task) => projectTask(task, format));
|
|
49
|
-
}
|
|
50
|
-
/**
|
|
51
|
-
* Project tasks with pagination
|
|
52
|
-
*/
|
|
53
|
-
export function projectTasksPaginated(tasks, format, limit = 20, offset = 0) {
|
|
54
|
-
const effectiveLimit = Math.min(limit, 100);
|
|
55
|
-
const sliced = tasks.slice(offset, offset + effectiveLimit);
|
|
56
|
-
const projected = sliced.map((task) => projectTask(task, format));
|
|
57
|
-
return {
|
|
58
|
-
items: projected,
|
|
59
|
-
total: tasks.length,
|
|
60
|
-
limit: effectiveLimit,
|
|
61
|
-
offset,
|
|
62
|
-
hasMore: offset + effectiveLimit < tasks.length,
|
|
63
|
-
};
|
|
64
|
-
}
|
|
65
|
-
/**
|
|
66
|
-
* Project a single inbox item to the specified format
|
|
67
|
-
*/
|
|
68
|
-
export function projectInboxItem(item, format) {
|
|
69
|
-
switch (format) {
|
|
70
|
-
case "concise":
|
|
71
|
-
return {
|
|
72
|
-
id: item.id,
|
|
73
|
-
content: item.content,
|
|
74
|
-
status: item.status,
|
|
75
|
-
};
|
|
76
|
-
case "standard":
|
|
77
|
-
return {
|
|
78
|
-
id: item.id,
|
|
79
|
-
content: item.content,
|
|
80
|
-
status: item.status,
|
|
81
|
-
capturedAt: item.capturedAt,
|
|
82
|
-
tags: item.tags,
|
|
83
|
-
};
|
|
84
|
-
case "detailed":
|
|
85
|
-
return item;
|
|
86
|
-
default:
|
|
87
|
-
return assertNever(format);
|
|
88
|
-
}
|
|
89
|
-
}
|
|
90
|
-
/**
|
|
91
|
-
* Project multiple inbox items with optional limit
|
|
92
|
-
*/
|
|
93
|
-
export function projectInboxItems(items, format, limit) {
|
|
94
|
-
const sliced = limit ? items.slice(0, limit) : items;
|
|
95
|
-
return sliced.map((item) => projectInboxItem(item, format));
|
|
96
|
-
}
|
|
97
|
-
/**
|
|
98
|
-
* Format response based on format type
|
|
99
|
-
* - concise/standard: JSON string for machine processing
|
|
100
|
-
* - detailed: Human-readable text
|
|
101
|
-
*/
|
|
102
|
-
export function formatResponse(data, format, detailedFormatter) {
|
|
103
|
-
if (format === "detailed" && detailedFormatter) {
|
|
104
|
-
return detailedFormatter(data);
|
|
105
|
-
}
|
|
106
|
-
// Concise and standard: compact JSON
|
|
107
|
-
return JSON.stringify(data);
|
|
108
|
-
}
|
|
109
|
-
/**
|
|
110
|
-
* Apply pagination parameters
|
|
111
|
-
*/
|
|
112
|
-
export function applyPagination(items, limit = 20, offset = 0) {
|
|
113
|
-
const effectiveLimit = Math.min(Math.max(1, limit), 100);
|
|
114
|
-
const effectiveOffset = Math.max(0, offset);
|
|
115
|
-
const sliced = items.slice(effectiveOffset, effectiveOffset + effectiveLimit);
|
|
116
|
-
return {
|
|
117
|
-
items: sliced,
|
|
118
|
-
hasMore: effectiveOffset + effectiveLimit < items.length,
|
|
119
|
-
total: items.length,
|
|
120
|
-
};
|
|
121
|
-
}
|
|
122
|
-
/**
|
|
123
|
-
* Truncate string for token efficiency
|
|
124
|
-
*/
|
|
125
|
-
export function truncate(str, maxLength = 100) {
|
|
126
|
-
if (str.length <= maxLength)
|
|
127
|
-
return str;
|
|
128
|
-
return str.slice(0, maxLength - 3) + "...";
|
|
129
|
-
}
|
|
130
|
-
/**
|
|
131
|
-
* Summarize a list of items for token efficiency
|
|
132
|
-
*/
|
|
133
|
-
export function summarizeList(items, maxDisplay = 5, getId) {
|
|
134
|
-
const displayed = items.slice(0, maxDisplay);
|
|
135
|
-
const remaining = items.slice(maxDisplay);
|
|
136
|
-
return {
|
|
137
|
-
displayed,
|
|
138
|
-
remaining: remaining.length,
|
|
139
|
-
remainingIds: remaining.map(getId),
|
|
140
|
-
};
|
|
141
|
-
}
|
|
142
|
-
/**
|
|
143
|
-
* Sort tasks by sortOrder, then by other criteria.
|
|
144
|
-
* Tasks with sortOrder come first (ascending), then tasks without sortOrder (by updatedAt descending).
|
|
145
|
-
*
|
|
146
|
-
* @param tasks - Array of tasks to sort
|
|
147
|
-
* @param secondarySort - Optional secondary sort when sortOrder is equal or both undefined
|
|
148
|
-
* @returns Sorted array (mutates the original)
|
|
149
|
-
*/
|
|
150
|
-
export function sortTasks(tasks, secondarySort = "updatedAt") {
|
|
151
|
-
const priorityWeight = {
|
|
152
|
-
critical: 0,
|
|
153
|
-
high: 1,
|
|
154
|
-
medium: 2,
|
|
155
|
-
low: 3,
|
|
156
|
-
};
|
|
157
|
-
return tasks.sort((a, b) => {
|
|
158
|
-
// Primary: sortOrder (ascending, undefined goes last)
|
|
159
|
-
const orderA = a.sortOrder ?? Infinity;
|
|
160
|
-
const orderB = b.sortOrder ?? Infinity;
|
|
161
|
-
if (orderA !== orderB) {
|
|
162
|
-
return orderA - orderB;
|
|
163
|
-
}
|
|
164
|
-
// Secondary sort when sortOrder is equal or both undefined
|
|
165
|
-
switch (secondarySort) {
|
|
166
|
-
case "priority":
|
|
167
|
-
return (priorityWeight[a.priority] ?? 2) - (priorityWeight[b.priority] ?? 2);
|
|
168
|
-
case "dueDate": {
|
|
169
|
-
const dateA = a.dueDate ? new Date(a.dueDate).getTime() : Infinity;
|
|
170
|
-
const dateB = b.dueDate ? new Date(b.dueDate).getTime() : Infinity;
|
|
171
|
-
return dateA - dateB;
|
|
172
|
-
}
|
|
173
|
-
case "updatedAt":
|
|
174
|
-
return new Date(b.updatedAt).getTime() - new Date(a.updatedAt).getTime();
|
|
175
|
-
default:
|
|
176
|
-
return assertNever(secondarySort);
|
|
177
|
-
}
|
|
178
|
-
});
|
|
179
|
-
}
|
|
180
|
-
//# sourceMappingURL=projection.js.map
|