@64mb/freelens-power 1.4.0 → 1.6.0

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.
Files changed (107) hide show
  1. package/README.md +7 -4
  2. package/out/main/ai-ipc.js +34 -3
  3. package/out/main/ai-ipc.js.map +1 -1
  4. package/out/main/common/power-logs-limits.js +227 -0
  5. package/out/main/common/power-logs-limits.js.map +1 -0
  6. package/out/main/common/power-logs.js +32 -0
  7. package/out/main/common/power-logs.js.map +1 -0
  8. package/out/main/common/resource-search.js +61 -0
  9. package/out/main/common/resource-search.js.map +1 -0
  10. package/out/main/common/store/logs-preferences-store.js +45 -0
  11. package/out/main/common/store/logs-preferences-store.js.map +1 -0
  12. package/out/main/common/store/monitoring-preferences-store.js +5 -0
  13. package/out/main/common/store/monitoring-preferences-store.js.map +1 -1
  14. package/out/main/dashboard-icon-cache.js +1 -1
  15. package/out/main/index.js +6 -0
  16. package/out/main/index.js.map +1 -1
  17. package/out/main/power-logs-budget.js +126 -0
  18. package/out/main/power-logs-budget.js.map +1 -0
  19. package/out/main/power-logs-child.js +86 -0
  20. package/out/main/power-logs-child.js.map +1 -0
  21. package/out/main/power-logs-database.js +179 -0
  22. package/out/main/power-logs-database.js.map +1 -0
  23. package/out/main/power-logs-ipc.js +275 -0
  24. package/out/main/power-logs-ipc.js.map +1 -0
  25. package/out/main/power-logs-query-child.js +23 -0
  26. package/out/main/power-logs-query-child.js.map +1 -0
  27. package/out/main/power-logs-query.js +127 -0
  28. package/out/main/power-logs-query.js.map +1 -0
  29. package/out/main/power-logs-worker.js +215 -0
  30. package/out/main/power-logs-worker.js.map +1 -0
  31. package/out/main/resource-search-database.js +209 -0
  32. package/out/main/resource-search-database.js.map +1 -0
  33. package/out/main/resource-search-worker.js +56 -0
  34. package/out/main/resource-search-worker.js.map +1 -0
  35. package/out/main/resource-search.js +155 -0
  36. package/out/main/resource-search.js.map +1 -0
  37. package/out/renderer/ai-logs-sql.js +27 -0
  38. package/out/renderer/ai-logs-sql.js.map +1 -0
  39. package/out/renderer/ai-message.js +48 -27
  40. package/out/renderer/ai-message.js.map +1 -1
  41. package/out/renderer/ai-terminal-context.js +50 -40
  42. package/out/renderer/ai-terminal-context.js.map +1 -1
  43. package/out/renderer/ai.js +15 -2
  44. package/out/renderer/ai.js.map +1 -1
  45. package/out/renderer/appearance.js +2 -1
  46. package/out/renderer/appearance.js.map +1 -1
  47. package/out/renderer/gateway-relationships-client.js +107 -0
  48. package/out/renderer/gateway-relationships-client.js.map +1 -0
  49. package/out/renderer/index.js +67 -29
  50. package/out/renderer/index.js.map +1 -1
  51. package/out/renderer/power-log-json.js +29 -0
  52. package/out/renderer/power-log-json.js.map +1 -0
  53. package/out/renderer/power-logs-client.js +35 -0
  54. package/out/renderer/power-logs-client.js.map +1 -0
  55. package/out/renderer/power-logs-collector.js +316 -0
  56. package/out/renderer/power-logs-collector.js.map +1 -0
  57. package/out/renderer/power-logs-entrypoints.js +201 -0
  58. package/out/renderer/power-logs-entrypoints.js.map +1 -0
  59. package/out/renderer/power-logs-sql-row.js +52 -0
  60. package/out/renderer/power-logs-sql-row.js.map +1 -0
  61. package/out/renderer/power-logs-transport.js +122 -0
  62. package/out/renderer/power-logs-transport.js.map +1 -0
  63. package/out/renderer/power-logs.css.js +116 -0
  64. package/out/renderer/power-logs.css.js.map +1 -0
  65. package/out/renderer/power-logs.js +1352 -0
  66. package/out/renderer/power-logs.js.map +1 -0
  67. package/out/renderer/preferences/logs-preferences.js +93 -0
  68. package/out/renderer/preferences/logs-preferences.js.map +1 -0
  69. package/out/renderer/preferences/monitoring-preferences.js +10 -0
  70. package/out/renderer/preferences/monitoring-preferences.js.map +1 -1
  71. package/out/renderer/preferences/preferences.js +24 -10
  72. package/out/renderer/preferences/preferences.js.map +1 -1
  73. package/out/renderer/resource-relationships.css.js +1 -1
  74. package/out/renderer/resource-relationships.css.js.map +1 -1
  75. package/out/renderer/resource-relationships.js +46 -8
  76. package/out/renderer/resource-relationships.js.map +1 -1
  77. package/out/renderer/resource-search-client.js +116 -0
  78. package/out/renderer/resource-search-client.js.map +1 -0
  79. package/out/renderer/resource-search-discovery.js +79 -0
  80. package/out/renderer/resource-search-discovery.js.map +1 -0
  81. package/out/renderer/resource-search-model.js +2 -1
  82. package/out/renderer/resource-search-model.js.map +1 -1
  83. package/out/renderer/resource-search-routing.js +78 -0
  84. package/out/renderer/resource-search-routing.js.map +1 -0
  85. package/out/renderer/resource-search-sync.js +199 -0
  86. package/out/renderer/resource-search-sync.js.map +1 -0
  87. package/out/renderer/resource-search.js +279 -54
  88. package/out/renderer/resource-search.js.map +1 -1
  89. package/out/renderer/src/common/gateway-relationships.js +122 -0
  90. package/out/renderer/src/common/gateway-relationships.js.map +1 -0
  91. package/out/renderer/src/common/power-log-parser.js +114 -0
  92. package/out/renderer/src/common/power-log-parser.js.map +1 -0
  93. package/out/renderer/src/common/power-logs-ai.js +56 -0
  94. package/out/renderer/src/common/power-logs-ai.js.map +1 -0
  95. package/out/renderer/src/common/power-logs-limits.js +227 -0
  96. package/out/renderer/src/common/power-logs-limits.js.map +1 -0
  97. package/out/renderer/src/common/power-logs.js +32 -0
  98. package/out/renderer/src/common/power-logs.js.map +1 -0
  99. package/out/renderer/src/common/resource-relationships.js +8 -0
  100. package/out/renderer/src/common/resource-relationships.js.map +1 -1
  101. package/out/renderer/src/common/resource-search.js +6 -0
  102. package/out/renderer/src/common/resource-search.js.map +1 -0
  103. package/out/renderer/src/common/store/logs-preferences-store.js +45 -0
  104. package/out/renderer/src/common/store/logs-preferences-store.js.map +1 -0
  105. package/out/renderer/src/common/store/monitoring-preferences-store.js +5 -0
  106. package/out/renderer/src/common/store/monitoring-preferences-store.js.map +1 -1
  107. package/package.json +8 -2
@@ -0,0 +1,215 @@
1
+ const require_power_logs = require("./common/power-logs.js");
2
+ const require_power_logs_limits = require("./common/power-logs-limits.js");
3
+ let node_crypto = require("node:crypto");
4
+ let electron = require("electron");
5
+ let node_os = require("node:os");
6
+ let node_path = require("node:path");
7
+ let node_fs = require("node:fs");
8
+ //#region src/main/power-logs-worker.ts
9
+ function sweepPowerLogsStorage(directory = (0, node_path.join)((0, node_os.tmpdir)(), "freelens-power-logs")) {
10
+ (0, node_fs.mkdirSync)(directory, {
11
+ recursive: true,
12
+ mode: 448
13
+ });
14
+ const root = (0, node_fs.lstatSync)(directory);
15
+ if (!root.isDirectory() || root.isSymbolicLink() || process.getuid && root.uid !== process.getuid()) throw new Error("Log storage unavailable");
16
+ (0, node_fs.chmodSync)(directory, 448);
17
+ for (const name of (0, node_fs.readdirSync)(directory)) {
18
+ const match = /^([1-9][0-9]*)-([0-9a-f]{8}-[0-9a-f]{4}-4[0-9a-f]{3}-[89ab][0-9a-f]{3}-[0-9a-f]{12})$/.exec(name);
19
+ if (!match) continue;
20
+ const pid = Number(match[1]);
21
+ if (!Number.isSafeInteger(pid) || pid > 2147483647) continue;
22
+ const path = (0, node_path.join)(directory, name);
23
+ try {
24
+ const entry = (0, node_fs.lstatSync)(path);
25
+ if (!entry.isDirectory() || entry.isSymbolicLink() || process.getuid && entry.uid !== process.getuid()) continue;
26
+ try {
27
+ process.kill(pid, 0);
28
+ } catch (error) {
29
+ if (error.code === "ESRCH") (0, node_fs.rmSync)(path, {
30
+ recursive: true,
31
+ force: true
32
+ });
33
+ }
34
+ } catch {}
35
+ }
36
+ return directory;
37
+ }
38
+ var PowerLogsWorker = class {
39
+ child;
40
+ directory;
41
+ pending = /* @__PURE__ */ new Map();
42
+ sequence = 0;
43
+ closed = false;
44
+ children = /* @__PURE__ */ new Set();
45
+ query;
46
+ readers = /* @__PURE__ */ new Map();
47
+ deleting = /* @__PURE__ */ new Set();
48
+ captureKey(request) {
49
+ return JSON.stringify([
50
+ request.clusterId,
51
+ request.contextId,
52
+ request.captureId
53
+ ]);
54
+ }
55
+ get isClosed() {
56
+ return this.closed;
57
+ }
58
+ constructor() {
59
+ this.directory = (0, node_path.join)(sweepPowerLogsStorage(), `${process.pid}-${(0, node_crypto.randomUUID)()}`);
60
+ (0, node_fs.mkdirSync)(this.directory, { mode: 448 });
61
+ try {
62
+ this.child = electron.utilityProcess.fork((0, node_path.join)(__dirname, "power-logs-child.js"), [this.directory], {
63
+ serviceName: "Power Logs",
64
+ stdio: "ignore"
65
+ });
66
+ } catch {
67
+ (0, node_fs.rmSync)(this.directory, {
68
+ recursive: true,
69
+ force: true
70
+ });
71
+ throw new Error("Log process unavailable");
72
+ }
73
+ this.track(this.child);
74
+ this.child.on("message", ({ id, result, error }) => {
75
+ const pending = this.pending.get(id);
76
+ if (!pending) return;
77
+ clearTimeout(pending.timer);
78
+ this.pending.delete(id);
79
+ if (error) pending.reject(/* @__PURE__ */ new Error("Log operation failed or exceeded its limit"));
80
+ else pending.resolve(result);
81
+ });
82
+ this.child.on("exit", () => {
83
+ this.close();
84
+ });
85
+ }
86
+ track(child) {
87
+ this.children.add(child);
88
+ child.once("exit", () => {
89
+ this.children.delete(child);
90
+ this.cleanup();
91
+ });
92
+ }
93
+ cleanup() {
94
+ if (this.closed && this.children.size === 0) (0, node_fs.rmSync)(this.directory, {
95
+ recursive: true,
96
+ force: true
97
+ });
98
+ }
99
+ call(request, destination) {
100
+ if (request.operation === "query") return this.runQuery(request);
101
+ const active = this.query;
102
+ if (active && request.clusterId === active.request.clusterId && request.contextId === active.request.contextId && (request.operation === "cancel" && request.queryId === active.request.queryId || request.operation === "delete" && request.captureId === active.request.captureId)) active.reject(/* @__PURE__ */ new Error("Log query canceled"));
103
+ if (request.operation === "delete") {
104
+ const key = this.captureKey(request);
105
+ this.deleting.add(key);
106
+ const readers = [...this.readers].filter(([, owner]) => this.captureKey(owner) === key);
107
+ if (readers.length === 0) return this.callStorage(request, destination).finally(() => this.deleting.delete(key));
108
+ return Promise.all(readers.map(([child]) => new Promise((resolve, reject) => {
109
+ const timer = setTimeout(() => reject(/* @__PURE__ */ new Error("Log query process is still closing")), 5e3);
110
+ child.once("exit", () => {
111
+ clearTimeout(timer);
112
+ resolve();
113
+ });
114
+ child.kill();
115
+ }))).then(() => this.callStorage(request, destination)).finally(() => this.deleting.delete(key));
116
+ }
117
+ return this.callStorage(request, destination);
118
+ }
119
+ runQuery(request) {
120
+ if (this.closed || this.query || this.deleting.has(this.captureKey(request))) return Promise.reject(/* @__PURE__ */ new Error("Log query unavailable or busy"));
121
+ return new Promise((resolve, reject) => {
122
+ const finish = (error, result) => {
123
+ if (this.query !== active) return;
124
+ this.query = void 0;
125
+ clearTimeout(active.timer);
126
+ clearTimeout(active.expiry);
127
+ active.child?.kill();
128
+ if (error) reject(error);
129
+ else resolve(result);
130
+ };
131
+ const active = {
132
+ request,
133
+ reject: (error) => finish(error),
134
+ timer: setTimeout(() => finish(/* @__PURE__ */ new Error("Log query exceeded its time limit")), require_power_logs.POWER_LOGS_LIMITS.queryMs)
135
+ };
136
+ this.query = active;
137
+ this.callStorage(request).then((value) => {
138
+ if (this.query !== active) return;
139
+ const snapshot = value;
140
+ const local = typeof snapshot?.database === "string" ? (0, node_path.relative)(this.directory, snapshot.database) : "..";
141
+ if (!local || local.startsWith("..") || (0, node_path.isAbsolute)(local) || snapshot.captureId !== request.captureId || !Number.isFinite(snapshot.expiresAt) || snapshot.expiresAt <= Date.now()) {
142
+ finish(/* @__PURE__ */ new Error("Log snapshot unavailable"));
143
+ return;
144
+ }
145
+ try {
146
+ const child = electron.utilityProcess.fork((0, node_path.join)(__dirname, "power-logs-query-child.js"), [], {
147
+ serviceName: "Power Logs SQL",
148
+ stdio: "ignore"
149
+ });
150
+ active.child = child;
151
+ this.track(child);
152
+ this.readers.set(child, request);
153
+ child.once("exit", () => this.readers.delete(child));
154
+ active.expiry = setTimeout(() => finish(/* @__PURE__ */ new Error("Log snapshot expired")), snapshot.expiresAt - Date.now());
155
+ child.once("exit", () => {
156
+ clearTimeout(active.expiry);
157
+ finish(/* @__PURE__ */ new Error("Log query process unavailable"));
158
+ });
159
+ child.once("message", ({ id, result, error }) => {
160
+ if (id !== 1) return;
161
+ clearTimeout(active.expiry);
162
+ finish(error ? /* @__PURE__ */ new Error("Log query failed or exceeded its limit") : void 0, result);
163
+ });
164
+ child.postMessage({
165
+ id: 1,
166
+ database: snapshot.database,
167
+ sql: request.sql,
168
+ limits: require_power_logs_limits.normalizePowerLogsLimits(require_power_logs.POWER_LOGS_LIMITS)
169
+ });
170
+ } catch {
171
+ finish(/* @__PURE__ */ new Error("Log query process unavailable"));
172
+ }
173
+ }, (error) => finish(error));
174
+ });
175
+ }
176
+ callStorage(request, destination) {
177
+ if (this.closed || this.pending.size >= 16) return Promise.reject(/* @__PURE__ */ new Error("Log storage unavailable or busy"));
178
+ return new Promise((resolve, reject) => {
179
+ const id = ++this.sequence;
180
+ const timer = setTimeout(() => this.close(), 2e4);
181
+ this.pending.set(id, {
182
+ resolve,
183
+ reject,
184
+ timer
185
+ });
186
+ try {
187
+ this.child.postMessage({
188
+ id,
189
+ request,
190
+ destination,
191
+ limits: require_power_logs_limits.normalizePowerLogsLimits(require_power_logs.POWER_LOGS_LIMITS)
192
+ });
193
+ } catch {
194
+ this.close();
195
+ }
196
+ });
197
+ }
198
+ close() {
199
+ if (this.closed) return;
200
+ this.closed = true;
201
+ this.query?.reject(/* @__PURE__ */ new Error("Log storage unavailable"));
202
+ for (const child of this.children) child.kill();
203
+ for (const pending of this.pending.values()) {
204
+ clearTimeout(pending.timer);
205
+ pending.reject(/* @__PURE__ */ new Error("Log storage unavailable"));
206
+ }
207
+ this.pending.clear();
208
+ this.cleanup();
209
+ }
210
+ };
211
+ //#endregion
212
+ exports.PowerLogsWorker = PowerLogsWorker;
213
+ exports.sweepPowerLogsStorage = sweepPowerLogsStorage;
214
+
215
+ //# sourceMappingURL=power-logs-worker.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"power-logs-worker.js","names":[],"sources":["../../src/main/power-logs-worker.ts"],"sourcesContent":["import { randomUUID } from \"node:crypto\";\nimport { chmodSync, lstatSync, mkdirSync, readdirSync, rmSync } from \"node:fs\";\nimport { tmpdir } from \"node:os\";\nimport { isAbsolute, join, relative } from \"node:path\";\nimport { type UtilityProcess, utilityProcess } from \"electron\";\nimport { POWER_LOGS_LIMITS as L, type LogRequest } from \"../common/power-logs\";\nimport { normalizePowerLogsLimits } from \"../common/power-logs-limits\";\n\nimport type { PowerLogsQuerySnapshot } from \"./power-logs-query\";\n\ntype ActiveQuery = {\n request: Extract<LogRequest, { operation: \"query\" }>;\n reject: (error: Error) => void;\n timer: ReturnType<typeof setTimeout>;\n child?: UtilityProcess;\n expiry?: ReturnType<typeof setTimeout>;\n};\n\nexport function sweepPowerLogsStorage(directory = join(tmpdir(), \"freelens-power-logs\")): string {\n mkdirSync(directory, { recursive: true, mode: 0o700 });\n const root = lstatSync(directory);\n if (!root.isDirectory() || root.isSymbolicLink() || (process.getuid && root.uid !== process.getuid()))\n throw new Error(\"Log storage unavailable\");\n chmodSync(directory, 0o700);\n for (const name of readdirSync(directory)) {\n const match = /^([1-9][0-9]*)-([0-9a-f]{8}-[0-9a-f]{4}-4[0-9a-f]{3}-[89ab][0-9a-f]{3}-[0-9a-f]{12})$/.exec(name);\n if (!match) continue;\n const pid = Number(match[1]);\n if (!Number.isSafeInteger(pid) || pid > 2147483647) continue;\n const path = join(directory, name);\n try {\n const entry = lstatSync(path);\n if (!entry.isDirectory() || entry.isSymbolicLink() || (process.getuid && entry.uid !== process.getuid()))\n continue;\n try {\n process.kill(pid, 0);\n } catch (error) {\n if ((error as NodeJS.ErrnoException).code === \"ESRCH\") rmSync(path, { recursive: true, force: true });\n }\n } catch {\n /* another process may have completed cleanup */\n }\n }\n return directory;\n}\n\nexport class PowerLogsWorker {\n private child: UtilityProcess;\n private directory: string;\n private pending = new Map<\n number,\n { resolve: (value: unknown) => void; reject: (error: Error) => void; timer: ReturnType<typeof setTimeout> }\n >();\n private sequence = 0;\n private closed = false;\n private children = new Set<UtilityProcess>();\n private query?: ActiveQuery;\n private readers = new Map<UtilityProcess, LogRequest & { captureId: string }>();\n private deleting = new Set<string>();\n private captureKey(request: LogRequest & { captureId: string }): string {\n return JSON.stringify([request.clusterId, request.contextId, request.captureId]);\n }\n get isClosed(): boolean {\n return this.closed;\n }\n constructor() {\n this.directory = join(sweepPowerLogsStorage(), `${process.pid}-${randomUUID()}`);\n mkdirSync(this.directory, { mode: 0o700 });\n try {\n this.child = utilityProcess.fork(join(__dirname, \"power-logs-child.js\"), [this.directory], {\n serviceName: \"Power Logs\",\n stdio: \"ignore\",\n });\n } catch {\n rmSync(this.directory, { recursive: true, force: true });\n throw new Error(\"Log process unavailable\");\n }\n this.track(this.child);\n this.child.on(\"message\", ({ id, result, error }) => {\n const pending = this.pending.get(id);\n if (!pending) return;\n clearTimeout(pending.timer);\n this.pending.delete(id);\n if (error) pending.reject(new Error(\"Log operation failed or exceeded its limit\"));\n else pending.resolve(result);\n });\n this.child.on(\"exit\", () => {\n this.close();\n });\n }\n private track(child: UtilityProcess): void {\n this.children.add(child);\n child.once(\"exit\", () => {\n this.children.delete(child);\n this.cleanup();\n });\n }\n private cleanup(): void {\n if (this.closed && this.children.size === 0) rmSync(this.directory, { recursive: true, force: true });\n }\n call(request: LogRequest, destination?: string): Promise<unknown> {\n if (request.operation === \"query\") return this.runQuery(request);\n const active = this.query;\n if (\n active &&\n request.clusterId === active.request.clusterId &&\n request.contextId === active.request.contextId &&\n ((request.operation === \"cancel\" && request.queryId === active.request.queryId) ||\n (request.operation === \"delete\" && request.captureId === active.request.captureId))\n ) {\n active.reject(new Error(\"Log query canceled\"));\n }\n if (request.operation === \"delete\") {\n const key = this.captureKey(request);\n this.deleting.add(key);\n const readers = [...this.readers].filter(([, owner]) => this.captureKey(owner) === key);\n if (readers.length === 0) return this.callStorage(request, destination).finally(() => this.deleting.delete(key));\n return Promise.all(\n readers.map(\n ([child]) =>\n new Promise<void>((resolve, reject) => {\n const timer = setTimeout(() => reject(new Error(\"Log query process is still closing\")), 5000);\n child.once(\"exit\", () => {\n clearTimeout(timer);\n resolve();\n });\n child.kill();\n }),\n ),\n )\n .then(() => this.callStorage(request, destination))\n .finally(() => this.deleting.delete(key));\n }\n return this.callStorage(request, destination);\n }\n private runQuery(request: Extract<LogRequest, { operation: \"query\" }>): Promise<unknown> {\n if (this.closed || this.query || this.deleting.has(this.captureKey(request)))\n return Promise.reject(new Error(\"Log query unavailable or busy\"));\n return new Promise((resolve, reject) => {\n const finish = (error?: Error, result?: unknown) => {\n if (this.query !== active) return;\n this.query = undefined;\n clearTimeout(active.timer);\n clearTimeout(active.expiry);\n active.child?.kill();\n if (error) reject(error);\n else resolve(result);\n };\n const active: ActiveQuery = {\n request,\n reject: (error) => finish(error),\n timer: setTimeout(() => finish(new Error(\"Log query exceeded its time limit\")), L.queryMs),\n };\n this.query = active;\n void this.callStorage(request).then(\n (value) => {\n if (this.query !== active) return;\n const snapshot = value as PowerLogsQuerySnapshot;\n const local = typeof snapshot?.database === \"string\" ? relative(this.directory, snapshot.database) : \"..\";\n if (\n !local ||\n local.startsWith(\"..\") ||\n isAbsolute(local) ||\n snapshot.captureId !== request.captureId ||\n !Number.isFinite(snapshot.expiresAt) ||\n snapshot.expiresAt <= Date.now()\n ) {\n finish(new Error(\"Log snapshot unavailable\"));\n return;\n }\n try {\n const child = utilityProcess.fork(join(__dirname, \"power-logs-query-child.js\"), [], {\n serviceName: \"Power Logs SQL\",\n stdio: \"ignore\",\n });\n active.child = child;\n this.track(child);\n this.readers.set(child, request);\n child.once(\"exit\", () => this.readers.delete(child));\n active.expiry = setTimeout(\n () => finish(new Error(\"Log snapshot expired\")),\n snapshot.expiresAt - Date.now(),\n );\n child.once(\"exit\", () => {\n clearTimeout(active.expiry);\n finish(new Error(\"Log query process unavailable\"));\n });\n child.once(\"message\", ({ id, result, error }) => {\n if (id !== 1) return;\n clearTimeout(active.expiry);\n finish(error ? new Error(\"Log query failed or exceeded its limit\") : undefined, result);\n });\n child.postMessage({\n id: 1,\n database: snapshot.database,\n sql: request.sql,\n limits: normalizePowerLogsLimits(L),\n });\n } catch {\n finish(new Error(\"Log query process unavailable\"));\n }\n },\n (error: Error) => finish(error),\n );\n });\n }\n private callStorage(request: LogRequest, destination?: string): Promise<unknown> {\n if (this.closed || this.pending.size >= 16) return Promise.reject(new Error(\"Log storage unavailable or busy\"));\n return new Promise((resolve, reject) => {\n const id = ++this.sequence;\n const timer = setTimeout(() => this.close(), 20000);\n this.pending.set(id, { resolve, reject, timer });\n try {\n this.child.postMessage({ id, request, destination, limits: normalizePowerLogsLimits(L) });\n } catch {\n this.close();\n }\n });\n }\n close(): void {\n if (this.closed) return;\n this.closed = true;\n this.query?.reject(new Error(\"Log storage unavailable\"));\n for (const child of this.children) child.kill();\n for (const pending of this.pending.values()) {\n clearTimeout(pending.timer);\n pending.reject(new Error(\"Log storage unavailable\"));\n }\n this.pending.clear();\n this.cleanup();\n }\n}\n"],"mappings":";;;;;;;;AAkBA,SAAgB,sBAAsB,aAAA,GAAA,UAAA,KAAA,EAAA,GAAA,QAAA,OAAA,CAAwB,GAAG,qBAAqB,GAAW;CAC/F,CAAA,GAAA,QAAA,UAAA,CAAU,WAAW;EAAE,WAAW;EAAM,MAAM;CAAM,CAAC;CACrD,MAAM,QAAA,GAAA,QAAA,UAAA,CAAiB,SAAS;CAChC,IAAI,CAAC,KAAK,YAAY,KAAK,KAAK,eAAe,KAAM,QAAQ,UAAU,KAAK,QAAQ,QAAQ,OAAO,GACjG,MAAM,IAAI,MAAM,yBAAyB;CAC3C,CAAA,GAAA,QAAA,UAAA,CAAU,WAAW,GAAK;CAC1B,KAAK,MAAM,SAAA,GAAA,QAAA,YAAA,CAAoB,SAAS,GAAG;EACzC,MAAM,QAAQ,wFAAwF,KAAK,IAAI;EAC/G,IAAI,CAAC,OAAO;EACZ,MAAM,MAAM,OAAO,MAAM,EAAE;EAC3B,IAAI,CAAC,OAAO,cAAc,GAAG,KAAK,MAAM,YAAY;EACpD,MAAM,QAAA,GAAA,UAAA,KAAA,CAAY,WAAW,IAAI;EACjC,IAAI;GACF,MAAM,SAAA,GAAA,QAAA,UAAA,CAAkB,IAAI;GAC5B,IAAI,CAAC,MAAM,YAAY,KAAK,MAAM,eAAe,KAAM,QAAQ,UAAU,MAAM,QAAQ,QAAQ,OAAO,GACpG;GACF,IAAI;IACF,QAAQ,KAAK,KAAK,CAAC;GACrB,SAAS,OAAO;IACd,IAAK,MAAgC,SAAS,SAAS,CAAA,GAAA,QAAA,OAAA,CAAO,MAAM;KAAE,WAAW;KAAM,OAAO;IAAK,CAAC;GACtG;EACF,QAAQ,CAER;CACF;CACA,OAAO;AACT;AAEA,IAAa,kBAAb,MAA6B;CAC3B;CACA;CACA,0BAAkB,IAAI,IAGpB;CACF,WAAmB;CACnB,SAAiB;CACjB,2BAAmB,IAAI,IAAoB;CAC3C;CACA,0BAAkB,IAAI,IAAwD;CAC9E,2BAAmB,IAAI,IAAY;CACnC,WAAmB,SAAqD;EACtE,OAAO,KAAK,UAAU;GAAC,QAAQ;GAAW,QAAQ;GAAW,QAAQ;EAAS,CAAC;CACjF;CACA,IAAI,WAAoB;EACtB,OAAO,KAAK;CACd;CACA,cAAc;EACZ,KAAK,aAAA,GAAA,UAAA,KAAA,CAAiB,sBAAsB,GAAG,GAAG,QAAQ,IAAI,IAAA,GAAA,YAAA,WAAA,CAAc,GAAG;EAC/E,CAAA,GAAA,QAAA,UAAA,CAAU,KAAK,WAAW,EAAE,MAAM,IAAM,CAAC;EACzC,IAAI;GACF,KAAK,QAAQ,SAAA,eAAe,MAAA,GAAA,UAAA,KAAA,CAAU,WAAW,qBAAqB,GAAG,CAAC,KAAK,SAAS,GAAG;IACzF,aAAa;IACb,OAAO;GACT,CAAC;EACH,QAAQ;GACN,CAAA,GAAA,QAAA,OAAA,CAAO,KAAK,WAAW;IAAE,WAAW;IAAM,OAAO;GAAK,CAAC;GACvD,MAAM,IAAI,MAAM,yBAAyB;EAC3C;EACA,KAAK,MAAM,KAAK,KAAK;EACrB,KAAK,MAAM,GAAG,YAAY,EAAE,IAAI,QAAQ,YAAY;GAClD,MAAM,UAAU,KAAK,QAAQ,IAAI,EAAE;GACnC,IAAI,CAAC,SAAS;GACd,aAAa,QAAQ,KAAK;GAC1B,KAAK,QAAQ,OAAO,EAAE;GACtB,IAAI,OAAO,QAAQ,uBAAO,IAAI,MAAM,4CAA4C,CAAC;QAC5E,QAAQ,QAAQ,MAAM;EAC7B,CAAC;EACD,KAAK,MAAM,GAAG,cAAc;GAC1B,KAAK,MAAM;EACb,CAAC;CACH;CACA,MAAc,OAA6B;EACzC,KAAK,SAAS,IAAI,KAAK;EACvB,MAAM,KAAK,cAAc;GACvB,KAAK,SAAS,OAAO,KAAK;GAC1B,KAAK,QAAQ;EACf,CAAC;CACH;CACA,UAAwB;EACtB,IAAI,KAAK,UAAU,KAAK,SAAS,SAAS,GAAG,CAAA,GAAA,QAAA,OAAA,CAAO,KAAK,WAAW;GAAE,WAAW;GAAM,OAAO;EAAK,CAAC;CACtG;CACA,KAAK,SAAqB,aAAwC;EAChE,IAAI,QAAQ,cAAc,SAAS,OAAO,KAAK,SAAS,OAAO;EAC/D,MAAM,SAAS,KAAK;EACpB,IACE,UACA,QAAQ,cAAc,OAAO,QAAQ,aACrC,QAAQ,cAAc,OAAO,QAAQ,cACnC,QAAQ,cAAc,YAAY,QAAQ,YAAY,OAAO,QAAQ,WACpE,QAAQ,cAAc,YAAY,QAAQ,cAAc,OAAO,QAAQ,YAE1E,OAAO,uBAAO,IAAI,MAAM,oBAAoB,CAAC;EAE/C,IAAI,QAAQ,cAAc,UAAU;GAClC,MAAM,MAAM,KAAK,WAAW,OAAO;GACnC,KAAK,SAAS,IAAI,GAAG;GACrB,MAAM,UAAU,CAAC,GAAG,KAAK,OAAO,CAAC,CAAC,QAAQ,GAAG,WAAW,KAAK,WAAW,KAAK,MAAM,GAAG;GACtF,IAAI,QAAQ,WAAW,GAAG,OAAO,KAAK,YAAY,SAAS,WAAW,CAAC,CAAC,cAAc,KAAK,SAAS,OAAO,GAAG,CAAC;GAC/G,OAAO,QAAQ,IACb,QAAQ,KACL,CAAC,WACA,IAAI,SAAe,SAAS,WAAW;IACrC,MAAM,QAAQ,iBAAiB,uBAAO,IAAI,MAAM,oCAAoC,CAAC,GAAG,GAAI;IAC5F,MAAM,KAAK,cAAc;KACvB,aAAa,KAAK;KAClB,QAAQ;IACV,CAAC;IACD,MAAM,KAAK;GACb,CAAC,CACL,CACF,CAAC,CACE,WAAW,KAAK,YAAY,SAAS,WAAW,CAAC,CAAC,CAClD,cAAc,KAAK,SAAS,OAAO,GAAG,CAAC;EAC5C;EACA,OAAO,KAAK,YAAY,SAAS,WAAW;CAC9C;CACA,SAAiB,SAAwE;EACvF,IAAI,KAAK,UAAU,KAAK,SAAS,KAAK,SAAS,IAAI,KAAK,WAAW,OAAO,CAAC,GACzE,OAAO,QAAQ,uBAAO,IAAI,MAAM,+BAA+B,CAAC;EAClE,OAAO,IAAI,SAAS,SAAS,WAAW;GACtC,MAAM,UAAU,OAAe,WAAqB;IAClD,IAAI,KAAK,UAAU,QAAQ;IAC3B,KAAK,QAAQ,KAAA;IACb,aAAa,OAAO,KAAK;IACzB,aAAa,OAAO,MAAM;IAC1B,OAAO,OAAO,KAAK;IACnB,IAAI,OAAO,OAAO,KAAK;SAClB,QAAQ,MAAM;GACrB;GACA,MAAM,SAAsB;IAC1B;IACA,SAAS,UAAU,OAAO,KAAK;IAC/B,OAAO,iBAAiB,uBAAO,IAAI,MAAM,mCAAmC,CAAC,GAAG,mBAAA,kBAAE,OAAO;GAC3F;GACA,KAAK,QAAQ;GACb,KAAU,YAAY,OAAO,CAAC,CAAC,MAC5B,UAAU;IACT,IAAI,KAAK,UAAU,QAAQ;IAC3B,MAAM,WAAW;IACjB,MAAM,QAAQ,OAAO,UAAU,aAAa,YAAA,GAAA,UAAA,SAAA,CAAoB,KAAK,WAAW,SAAS,QAAQ,IAAI;IACrG,IACE,CAAC,SACD,MAAM,WAAW,IAAI,MAAA,GAAA,UAAA,WAAA,CACV,KAAK,KAChB,SAAS,cAAc,QAAQ,aAC/B,CAAC,OAAO,SAAS,SAAS,SAAS,KACnC,SAAS,aAAa,KAAK,IAAI,GAC/B;KACA,uBAAO,IAAI,MAAM,0BAA0B,CAAC;KAC5C;IACF;IACA,IAAI;KACF,MAAM,QAAQ,SAAA,eAAe,MAAA,GAAA,UAAA,KAAA,CAAU,WAAW,2BAA2B,GAAG,CAAC,GAAG;MAClF,aAAa;MACb,OAAO;KACT,CAAC;KACD,OAAO,QAAQ;KACf,KAAK,MAAM,KAAK;KAChB,KAAK,QAAQ,IAAI,OAAO,OAAO;KAC/B,MAAM,KAAK,cAAc,KAAK,QAAQ,OAAO,KAAK,CAAC;KACnD,OAAO,SAAS,iBACR,uBAAO,IAAI,MAAM,sBAAsB,CAAC,GAC9C,SAAS,YAAY,KAAK,IAAI,CAChC;KACA,MAAM,KAAK,cAAc;MACvB,aAAa,OAAO,MAAM;MAC1B,uBAAO,IAAI,MAAM,+BAA+B,CAAC;KACnD,CAAC;KACD,MAAM,KAAK,YAAY,EAAE,IAAI,QAAQ,YAAY;MAC/C,IAAI,OAAO,GAAG;MACd,aAAa,OAAO,MAAM;MAC1B,OAAO,wBAAQ,IAAI,MAAM,wCAAwC,IAAI,KAAA,GAAW,MAAM;KACxF,CAAC;KACD,MAAM,YAAY;MAChB,IAAI;MACJ,UAAU,SAAS;MACnB,KAAK,QAAQ;MACb,QAAQ,0BAAA,yBAAyB,mBAAA,iBAAC;KACpC,CAAC;IACH,QAAQ;KACN,uBAAO,IAAI,MAAM,+BAA+B,CAAC;IACnD;GACF,IACC,UAAiB,OAAO,KAAK,CAChC;EACF,CAAC;CACH;CACA,YAAoB,SAAqB,aAAwC;EAC/E,IAAI,KAAK,UAAU,KAAK,QAAQ,QAAQ,IAAI,OAAO,QAAQ,uBAAO,IAAI,MAAM,iCAAiC,CAAC;EAC9G,OAAO,IAAI,SAAS,SAAS,WAAW;GACtC,MAAM,KAAK,EAAE,KAAK;GAClB,MAAM,QAAQ,iBAAiB,KAAK,MAAM,GAAG,GAAK;GAClD,KAAK,QAAQ,IAAI,IAAI;IAAE;IAAS;IAAQ;GAAM,CAAC;GAC/C,IAAI;IACF,KAAK,MAAM,YAAY;KAAE;KAAI;KAAS;KAAa,QAAQ,0BAAA,yBAAyB,mBAAA,iBAAC;IAAE,CAAC;GAC1F,QAAQ;IACN,KAAK,MAAM;GACb;EACF,CAAC;CACH;CACA,QAAc;EACZ,IAAI,KAAK,QAAQ;EACjB,KAAK,SAAS;EACd,KAAK,OAAO,uBAAO,IAAI,MAAM,yBAAyB,CAAC;EACvD,KAAK,MAAM,SAAS,KAAK,UAAU,MAAM,KAAK;EAC9C,KAAK,MAAM,WAAW,KAAK,QAAQ,OAAO,GAAG;GAC3C,aAAa,QAAQ,KAAK;GAC1B,QAAQ,uBAAO,IAAI,MAAM,yBAAyB,CAAC;EACrD;EACA,KAAK,QAAQ,MAAM;EACnB,KAAK,QAAQ;CACf;AACF"}
@@ -0,0 +1,209 @@
1
+ //#region src/main/resource-search-database.ts
2
+ var ResourceSearchDatabase = class {
3
+ path;
4
+ db;
5
+ constructor(path, maxBytes = 256 * 1024 * 1024) {
6
+ this.path = path;
7
+ const { DatabaseSync } = require("node:sqlite");
8
+ this.db = new DatabaseSync(path);
9
+ this.db.exec(`PRAGMA busy_timeout=2000; PRAGMA foreign_keys=ON; PRAGMA journal_mode=DELETE; PRAGMA cache_size=-4096;
10
+ CREATE TABLE IF NOT EXISTS documents (
11
+ id INTEGER PRIMARY KEY, cluster TEXT NOT NULL, context TEXT NOT NULL,
12
+ path TEXT NOT NULL, scope TEXT NOT NULL, scan TEXT NOT NULL,
13
+ name TEXT NOT NULL, kind TEXT NOT NULL, json TEXT NOT NULL, text TEXT NOT NULL,
14
+ UNIQUE(cluster, context, path)
15
+ );
16
+ CREATE INDEX IF NOT EXISTS document_scope ON documents(cluster,context,scope);
17
+ CREATE TABLE IF NOT EXISTS scans (cluster TEXT,context TEXT,scope TEXT,scan TEXT,
18
+ PRIMARY KEY(cluster,context,scope)) WITHOUT ROWID;
19
+ CREATE VIRTUAL TABLE IF NOT EXISTS search USING fts5(text,content=documents,content_rowid=id,tokenize=trigram);
20
+ CREATE TRIGGER IF NOT EXISTS document_insert AFTER INSERT ON documents BEGIN
21
+ INSERT INTO search(rowid,text) VALUES(new.id,new.text); END;
22
+ CREATE TRIGGER IF NOT EXISTS document_delete AFTER DELETE ON documents BEGIN
23
+ INSERT INTO search(search,rowid,text) VALUES('delete',old.id,old.text); END;
24
+ CREATE TRIGGER IF NOT EXISTS document_update AFTER UPDATE ON documents BEGIN
25
+ INSERT INTO search(search,rowid,text) VALUES('delete',old.id,old.text);
26
+ INSERT INTO search(rowid,text) VALUES(new.id,new.text); END;
27
+ CREATE TABLE IF NOT EXISTS name_terms (
28
+ document INTEGER REFERENCES documents(id) ON DELETE CASCADE,term TEXT,
29
+ PRIMARY KEY(document,term)) WITHOUT ROWID;
30
+ CREATE INDEX IF NOT EXISTS term_length ON name_terms(length(term));`);
31
+ const pageSize = Number(this.db.prepare("PRAGMA page_size").get()?.page_size ?? 4096);
32
+ this.db.exec(`PRAGMA max_page_count=${Math.max(64, Math.floor(maxBytes / 2 / pageSize))}`);
33
+ this.db.function("search_distance", { deterministic: true }, (left, right, limit) => this.distance(String(left), String(right), Number(limit)));
34
+ this.db.function("search_parts", { deterministic: true }, (name, token) => this.parts(String(name), String(token)));
35
+ try {
36
+ require("node:fs").chmodSync(path, 384);
37
+ } catch {}
38
+ }
39
+ distance(left, right, limit) {
40
+ if (left.length > 64 || right.length > 64 || Math.abs(left.length - right.length) > limit) return limit + 1;
41
+ let previous = Array.from({ length: right.length + 1 }, (_, index) => index);
42
+ let beforePrevious = previous;
43
+ for (let row = 1; row <= left.length; row++) {
44
+ const current = Array(right.length + 1).fill(limit + 1);
45
+ current[0] = row;
46
+ let minimum = limit + 1;
47
+ for (let column = Math.max(1, row - limit); column <= Math.min(right.length, row + limit); column++) {
48
+ current[column] = Math.min(previous[column] + 1, current[column - 1] + 1, previous[column - 1] + (left[row - 1] === right[column - 1] ? 0 : 1));
49
+ if (row > 1 && column > 1 && left[row - 1] === right[column - 2] && left[row - 2] === right[column - 1]) current[column] = Math.min(current[column], beforePrevious[column - 2] + 1);
50
+ minimum = Math.min(minimum, current[column]);
51
+ }
52
+ if (minimum > limit) return limit + 1;
53
+ beforePrevious = previous;
54
+ previous = current;
55
+ }
56
+ return previous[right.length];
57
+ }
58
+ parts(name, token) {
59
+ if (!/^[a-z0-9]+(?:[-._][a-z0-9]+)+$/.test(token)) return 0;
60
+ const wanted = token.split(/[-._]/);
61
+ if (wanted.length > 16) return 0;
62
+ let offset = 0;
63
+ for (const part of name.toLocaleLowerCase().split(/[-._]/).filter(Boolean).slice(0, 16)) if (part === wanted[offset]) offset++;
64
+ return offset === wanted.length ? 1 : 0;
65
+ }
66
+ run(request) {
67
+ const { clusterId, contextId } = request;
68
+ this.db.prepare("DELETE FROM documents WHERE cluster=? AND context<>?").run(clusterId, contextId);
69
+ this.db.prepare("DELETE FROM scans WHERE cluster=? AND context<>?").run(clusterId, contextId);
70
+ if (request.operation === "query") return this.query(clusterId, contextId, request.query, request.limit, request);
71
+ if (request.operation === "status") return {
72
+ available: true,
73
+ count: Number(this.db.prepare("SELECT count(*) AS count FROM documents WHERE cluster=? AND context=?").get(clusterId, contextId)?.count ?? 0),
74
+ bytes: this.bytes()
75
+ };
76
+ if (request.operation === "clear") {
77
+ this.db.prepare("DELETE FROM documents WHERE cluster=?").run(clusterId);
78
+ this.db.prepare("DELETE FROM scans WHERE cluster=?").run(clusterId);
79
+ this.db.exec("VACUUM");
80
+ return true;
81
+ }
82
+ if (request.operation === "permit") return true;
83
+ if (request.operation === "reconcile") {
84
+ const catalog = JSON.stringify(request.resources);
85
+ this.db.prepare(`DELETE FROM documents WHERE cluster=? AND context=? AND
86
+ json_extract(json,'$.group')||'/'||json_extract(json,'$.resource') NOT IN (SELECT value FROM json_each(?))`).run(clusterId, contextId, catalog);
87
+ this.db.prepare(`DELETE FROM scans WHERE cluster=? AND context=? AND NOT EXISTS
88
+ (SELECT 1 FROM json_each(?) WHERE substr(scope,1,length(value)+1)=value||'/')`).run(clusterId, contextId, catalog);
89
+ return true;
90
+ }
91
+ const { scope } = request;
92
+ const prefix = scope.endsWith("/*") ? scope.slice(0, -1) : scope;
93
+ const scopeCondition = scope.endsWith("/*") ? "substr(scope,1,length(?))=?" : "scope=?";
94
+ const scopeArgs = scope.endsWith("/*") ? [prefix, prefix] : [scope];
95
+ if (request.operation === "invalidate") {
96
+ this.db.prepare(`DELETE FROM documents WHERE cluster=? AND context=? AND ${scopeCondition}`).run(clusterId, contextId, ...scopeArgs);
97
+ this.db.prepare(`DELETE FROM scans WHERE cluster=? AND context=? AND ${scopeCondition}`).run(clusterId, contextId, ...scopeArgs);
98
+ return true;
99
+ }
100
+ if (request.operation === "begin") {
101
+ this.db.prepare("INSERT INTO scans VALUES(?,?,?,?) ON CONFLICT(cluster,context,scope) DO UPDATE SET scan=excluded.scan").run(clusterId, contextId, scope, request.scanId);
102
+ return true;
103
+ }
104
+ if (this.db.prepare("SELECT scan FROM scans WHERE cluster=? AND context=? AND scope=?").get(clusterId, contextId, scope)?.scan !== request.scanId) throw new Error("Search scan superseded");
105
+ if (request.operation === "complete") {
106
+ this.db.prepare(`DELETE FROM documents WHERE cluster=? AND context=? AND ${scopeCondition} AND scan<>?`).run(clusterId, contextId, ...scopeArgs, request.scanId);
107
+ this.db.prepare(`DELETE FROM scans WHERE cluster=? AND context=? AND ${scopeCondition}`).run(clusterId, contextId, ...scopeArgs);
108
+ return true;
109
+ }
110
+ this.db.exec("BEGIN");
111
+ try {
112
+ const insert = this.db.prepare(`INSERT INTO documents(cluster,context,path,scope,scan,name,kind,json,text)
113
+ VALUES(?,?,?,?,?,?,?,?,?) ON CONFLICT(cluster,context,path) DO UPDATE SET scope=excluded.scope,
114
+ scan=excluded.scan,name=excluded.name,kind=excluded.kind,json=excluded.json,text=excluded.text RETURNING id`);
115
+ const term = this.db.prepare("INSERT OR IGNORE INTO name_terms VALUES(?,?)");
116
+ for (const document of request.documents) {
117
+ const text = [
118
+ document.name,
119
+ document.kind,
120
+ document.namespace ?? "",
121
+ ...document.aliases ?? [],
122
+ ...Object.entries(document.labels).map(([key, value]) => `${key}=${value}`),
123
+ ...(document.fields ?? []).map((field) => field.text)
124
+ ].join(" ").toLocaleLowerCase();
125
+ const row = insert.get(clusterId, contextId, document.path, scope, request.scanId, document.name, document.kind, JSON.stringify(document), text);
126
+ this.db.prepare("DELETE FROM name_terms WHERE document=?").run(row.id);
127
+ for (const part of new Set([document.name, ...document.name.split(/[-._]/)].map((part) => part.toLocaleLowerCase()))) if (part.length >= 3 && part.length <= 64) term.run(row.id, part);
128
+ }
129
+ this.db.exec("COMMIT");
130
+ } catch (error) {
131
+ try {
132
+ this.db.exec("ROLLBACK");
133
+ } catch {}
134
+ throw error;
135
+ }
136
+ return true;
137
+ }
138
+ query(cluster, context, query, requestedLimit = 200, filters = {}) {
139
+ const limit = Math.max(1, Math.min(1e3, Math.floor(requestedLimit)));
140
+ const tokens = query.slice(0, 300).toLocaleLowerCase().trim().split(/\s+/).filter(Boolean);
141
+ const args = [cluster, context];
142
+ const filtersSql = [];
143
+ if (filters.kind !== void 0) {
144
+ filtersSql.push("LOWER(d.kind)=LOWER(?)");
145
+ args.push(filters.kind);
146
+ }
147
+ if (filters.namespace !== void 0) {
148
+ filtersSql.push("COALESCE(json_extract(d.json,'$.namespace'),'')=?");
149
+ args.push(filters.namespace);
150
+ }
151
+ const escapeLike = (text) => text.replace(/[\\%_]/g, "\\$&");
152
+ const conditions = tokens.map((token) => {
153
+ const clauses = [];
154
+ if ([...token].length >= 3) {
155
+ clauses.push("d.id IN (SELECT rowid FROM search WHERE search MATCH ?)");
156
+ args.push(`"${token.replace(/"/g, "\"\"")}"`);
157
+ } else {
158
+ clauses.push("d.text LIKE ? ESCAPE '\\'");
159
+ args.push(`%${escapeLike(token)}%`);
160
+ }
161
+ if (token.split(/[-._]/).filter(Boolean).length > 1) {
162
+ clauses.push("search_parts(d.name,?)=1");
163
+ args.push(token);
164
+ }
165
+ const distance = token.length >= 7 && token.length <= 64 ? 2 : token.length >= 4 && token.length <= 6 ? 1 : 0;
166
+ if (distance) {
167
+ clauses.push("EXISTS (SELECT 1 FROM name_terms t WHERE t.document=d.id AND length(t.term) BETWEEN ? AND ? AND search_distance(t.term,?,?)<=?)");
168
+ args.push(token.length - distance, token.length + distance, token, distance, distance);
169
+ }
170
+ return `(${clauses.join(" OR ")})`;
171
+ });
172
+ const rankingArgs = [];
173
+ const penalties = tokens.map((token) => {
174
+ const distance = token.length >= 7 && token.length <= 64 ? 2 : token.length >= 4 && token.length <= 6 ? 1 : 0;
175
+ rankingArgs.push(token, token);
176
+ const fallback = distance ? `(SELECT 10*min(search_distance(t.term,?,?)) FROM name_terms t WHERE t.document=d.id AND length(t.term) BETWEEN ? AND ?)` : "100";
177
+ if (distance) rankingArgs.push(token, distance, token.length - distance, token.length + distance);
178
+ return `CASE WHEN instr(d.text,?)>0 THEN 0 WHEN search_parts(d.name,?)=1 THEN 1 ELSE COALESCE(${fallback},100) END`;
179
+ });
180
+ const name = query.toLocaleLowerCase().trim();
181
+ const rows = this.db.prepare(`SELECT d.json,count(*) OVER() AS total FROM documents d
182
+ WHERE d.cluster=? AND d.context=? ${[...filtersSql, ...conditions].length ? `AND ${[...filtersSql, ...conditions].join(" AND ")}` : ""}
183
+ ORDER BY ${penalties.length ? penalties.map((penalty) => `(${penalty})`).join("+") : "NULL"},
184
+ CASE WHEN LOWER(d.name)=? THEN 0 WHEN LOWER(d.name) LIKE ? ESCAPE '\\' THEN 1
185
+ WHEN LOWER(d.kind)=? THEN 2 WHEN instr(LOWER(d.name),?)>0 THEN 3 ELSE 4 END,d.kind,d.name,d.path LIMIT ?`).all(...args, ...rankingArgs, name, `${escapeLike(name)}%`, name, name, limit);
186
+ const total = Number(rows[0]?.total ?? 0);
187
+ return {
188
+ documents: rows.map((row) => JSON.parse(String(row.json))),
189
+ total,
190
+ hasMore: total > rows.length
191
+ };
192
+ }
193
+ bytes() {
194
+ return [this.path, `${this.path}-journal`].reduce((sum, path) => {
195
+ try {
196
+ return sum + require("node:fs").statSync(path).size;
197
+ } catch {
198
+ return sum;
199
+ }
200
+ }, 0);
201
+ }
202
+ close() {
203
+ this.db.close();
204
+ }
205
+ };
206
+ //#endregion
207
+ exports.ResourceSearchDatabase = ResourceSearchDatabase;
208
+
209
+ //# sourceMappingURL=resource-search-database.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"resource-search-database.js","names":[],"sources":["../../src/main/resource-search-database.ts"],"sourcesContent":["import type { SearchDocument, SearchIndexRequest, SearchQueryResult } from \"../common/resource-search\";\n\nexport class ResourceSearchDatabase {\n private db: import(\"node:sqlite\").DatabaseSync;\n\n constructor(\n private path: string,\n maxBytes = 256 * 1024 * 1024,\n ) {\n const { DatabaseSync } = require(\"node:sqlite\") as typeof import(\"node:sqlite\");\n this.db = new DatabaseSync(path);\n this.db.exec(`PRAGMA busy_timeout=2000; PRAGMA foreign_keys=ON; PRAGMA journal_mode=DELETE; PRAGMA cache_size=-4096;\n CREATE TABLE IF NOT EXISTS documents (\n id INTEGER PRIMARY KEY, cluster TEXT NOT NULL, context TEXT NOT NULL,\n path TEXT NOT NULL, scope TEXT NOT NULL, scan TEXT NOT NULL,\n name TEXT NOT NULL, kind TEXT NOT NULL, json TEXT NOT NULL, text TEXT NOT NULL,\n UNIQUE(cluster, context, path)\n );\n CREATE INDEX IF NOT EXISTS document_scope ON documents(cluster,context,scope);\n CREATE TABLE IF NOT EXISTS scans (cluster TEXT,context TEXT,scope TEXT,scan TEXT,\n PRIMARY KEY(cluster,context,scope)) WITHOUT ROWID;\n CREATE VIRTUAL TABLE IF NOT EXISTS search USING fts5(text,content=documents,content_rowid=id,tokenize=trigram);\n CREATE TRIGGER IF NOT EXISTS document_insert AFTER INSERT ON documents BEGIN\n INSERT INTO search(rowid,text) VALUES(new.id,new.text); END;\n CREATE TRIGGER IF NOT EXISTS document_delete AFTER DELETE ON documents BEGIN\n INSERT INTO search(search,rowid,text) VALUES('delete',old.id,old.text); END;\n CREATE TRIGGER IF NOT EXISTS document_update AFTER UPDATE ON documents BEGIN\n INSERT INTO search(search,rowid,text) VALUES('delete',old.id,old.text);\n INSERT INTO search(rowid,text) VALUES(new.id,new.text); END;\n CREATE TABLE IF NOT EXISTS name_terms (\n document INTEGER REFERENCES documents(id) ON DELETE CASCADE,term TEXT,\n PRIMARY KEY(document,term)) WITHOUT ROWID;\n CREATE INDEX IF NOT EXISTS term_length ON name_terms(length(term));`);\n const pageSize = Number(this.db.prepare(\"PRAGMA page_size\").get()?.page_size ?? 4096);\n this.db.exec(`PRAGMA max_page_count=${Math.max(64, Math.floor(maxBytes / 2 / pageSize))}`);\n this.db.function(\"search_distance\", { deterministic: true }, (left, right, limit) =>\n this.distance(String(left), String(right), Number(limit)),\n );\n this.db.function(\"search_parts\", { deterministic: true }, (name, token) => this.parts(String(name), String(token)));\n try {\n require(\"node:fs\").chmodSync(path, 0o600);\n } catch {\n /* in-memory databases have no file */\n }\n }\n\n private distance(left: string, right: string, limit: number): number {\n if (left.length > 64 || right.length > 64 || Math.abs(left.length - right.length) > limit) return limit + 1;\n let previous = Array.from({ length: right.length + 1 }, (_, index) => index);\n let beforePrevious = previous;\n for (let row = 1; row <= left.length; row++) {\n const current = Array<number>(right.length + 1).fill(limit + 1);\n current[0] = row;\n let minimum = limit + 1;\n for (let column = Math.max(1, row - limit); column <= Math.min(right.length, row + limit); column++) {\n current[column] = Math.min(\n previous[column] + 1,\n current[column - 1] + 1,\n previous[column - 1] + (left[row - 1] === right[column - 1] ? 0 : 1),\n );\n if (row > 1 && column > 1 && left[row - 1] === right[column - 2] && left[row - 2] === right[column - 1])\n current[column] = Math.min(current[column], beforePrevious[column - 2] + 1);\n minimum = Math.min(minimum, current[column]);\n }\n if (minimum > limit) return limit + 1;\n beforePrevious = previous;\n previous = current;\n }\n return previous[right.length];\n }\n\n private parts(name: string, token: string): number {\n if (!/^[a-z0-9]+(?:[-._][a-z0-9]+)+$/.test(token)) return 0;\n const wanted = token.split(/[-._]/);\n if (wanted.length > 16) return 0;\n let offset = 0;\n for (const part of name.toLocaleLowerCase().split(/[-._]/).filter(Boolean).slice(0, 16))\n if (part === wanted[offset]) offset++;\n return offset === wanted.length ? 1 : 0;\n }\n\n run(request: SearchIndexRequest): unknown {\n const { clusterId, contextId } = request;\n this.db.prepare(\"DELETE FROM documents WHERE cluster=? AND context<>?\").run(clusterId, contextId);\n this.db.prepare(\"DELETE FROM scans WHERE cluster=? AND context<>?\").run(clusterId, contextId);\n if (request.operation === \"query\") return this.query(clusterId, contextId, request.query, request.limit, request);\n if (request.operation === \"status\")\n return {\n available: true,\n count: Number(\n this.db\n .prepare(\"SELECT count(*) AS count FROM documents WHERE cluster=? AND context=?\")\n .get(clusterId, contextId)?.count ?? 0,\n ),\n bytes: this.bytes(),\n };\n if (request.operation === \"clear\") {\n this.db.prepare(\"DELETE FROM documents WHERE cluster=?\").run(clusterId);\n this.db.prepare(\"DELETE FROM scans WHERE cluster=?\").run(clusterId);\n this.db.exec(\"VACUUM\");\n return true;\n }\n if (request.operation === \"permit\") return true;\n if (request.operation === \"reconcile\") {\n const catalog = JSON.stringify(request.resources);\n this.db\n .prepare(`DELETE FROM documents WHERE cluster=? AND context=? AND\n json_extract(json,'$.group')||'/'||json_extract(json,'$.resource') NOT IN (SELECT value FROM json_each(?))`)\n .run(clusterId, contextId, catalog);\n this.db\n .prepare(`DELETE FROM scans WHERE cluster=? AND context=? AND NOT EXISTS\n (SELECT 1 FROM json_each(?) WHERE substr(scope,1,length(value)+1)=value||'/')`)\n .run(clusterId, contextId, catalog);\n return true;\n }\n const { scope } = request;\n const prefix = scope.endsWith(\"/*\") ? scope.slice(0, -1) : scope;\n const scopeCondition = scope.endsWith(\"/*\") ? \"substr(scope,1,length(?))=?\" : \"scope=?\";\n const scopeArgs = scope.endsWith(\"/*\") ? [prefix, prefix] : [scope];\n if (request.operation === \"invalidate\") {\n this.db\n .prepare(`DELETE FROM documents WHERE cluster=? AND context=? AND ${scopeCondition}`)\n .run(clusterId, contextId, ...scopeArgs);\n this.db\n .prepare(`DELETE FROM scans WHERE cluster=? AND context=? AND ${scopeCondition}`)\n .run(clusterId, contextId, ...scopeArgs);\n return true;\n }\n if (request.operation === \"begin\") {\n this.db\n .prepare(\n \"INSERT INTO scans VALUES(?,?,?,?) ON CONFLICT(cluster,context,scope) DO UPDATE SET scan=excluded.scan\",\n )\n .run(clusterId, contextId, scope, request.scanId);\n return true;\n }\n const scan = this.db\n .prepare(\"SELECT scan FROM scans WHERE cluster=? AND context=? AND scope=?\")\n .get(clusterId, contextId, scope)?.scan;\n if (scan !== request.scanId) throw new Error(\"Search scan superseded\");\n if (request.operation === \"complete\") {\n this.db\n .prepare(`DELETE FROM documents WHERE cluster=? AND context=? AND ${scopeCondition} AND scan<>?`)\n .run(clusterId, contextId, ...scopeArgs, request.scanId);\n this.db\n .prepare(`DELETE FROM scans WHERE cluster=? AND context=? AND ${scopeCondition}`)\n .run(clusterId, contextId, ...scopeArgs);\n return true;\n }\n this.db.exec(\"BEGIN\");\n try {\n const insert = this.db.prepare(`INSERT INTO documents(cluster,context,path,scope,scan,name,kind,json,text)\n VALUES(?,?,?,?,?,?,?,?,?) ON CONFLICT(cluster,context,path) DO UPDATE SET scope=excluded.scope,\n scan=excluded.scan,name=excluded.name,kind=excluded.kind,json=excluded.json,text=excluded.text RETURNING id`);\n const term = this.db.prepare(\"INSERT OR IGNORE INTO name_terms VALUES(?,?)\");\n for (const document of request.documents) {\n const text = [\n document.name,\n document.kind,\n document.namespace ?? \"\",\n ...(document.aliases ?? []),\n ...Object.entries(document.labels).map(([key, value]) => `${key}=${value}`),\n ...(document.fields ?? []).map((field) => field.text),\n ]\n .join(\" \")\n .toLocaleLowerCase();\n const row = insert.get(\n clusterId,\n contextId,\n document.path,\n scope,\n request.scanId,\n document.name,\n document.kind,\n JSON.stringify(document),\n text,\n );\n this.db.prepare(\"DELETE FROM name_terms WHERE document=?\").run(row!.id);\n for (const part of new Set(\n [document.name, ...document.name.split(/[-._]/)].map((part) => part.toLocaleLowerCase()),\n ))\n if (part.length >= 3 && part.length <= 64) term.run(row!.id, part);\n }\n this.db.exec(\"COMMIT\");\n } catch (error) {\n try {\n this.db.exec(\"ROLLBACK\");\n } catch {\n /* sqlite can roll back a full transaction automatically */\n }\n throw error;\n }\n return true;\n }\n\n query(\n cluster: string,\n context: string,\n query: string,\n requestedLimit = 200,\n filters: { kind?: string; namespace?: string } = {},\n ): SearchQueryResult {\n const limit = Math.max(1, Math.min(1000, Math.floor(requestedLimit)));\n const tokens = query.slice(0, 300).toLocaleLowerCase().trim().split(/\\s+/).filter(Boolean);\n const args: (string | number)[] = [cluster, context];\n const filtersSql: string[] = [];\n if (filters.kind !== undefined) {\n filtersSql.push(\"LOWER(d.kind)=LOWER(?)\");\n args.push(filters.kind);\n }\n if (filters.namespace !== undefined) {\n filtersSql.push(\"COALESCE(json_extract(d.json,'$.namespace'),'')=?\");\n args.push(filters.namespace);\n }\n const escapeLike = (text: string) => text.replace(/[\\\\%_]/g, \"\\\\$&\");\n const conditions = tokens.map((token) => {\n const clauses: string[] = [];\n if ([...token].length >= 3) {\n clauses.push(\"d.id IN (SELECT rowid FROM search WHERE search MATCH ?)\");\n args.push(`\"${token.replace(/\"/g, '\"\"')}\"`);\n } else {\n clauses.push(\"d.text LIKE ? ESCAPE '\\\\'\");\n args.push(`%${escapeLike(token)}%`);\n }\n const parts = token.split(/[-._]/).filter(Boolean);\n if (parts.length > 1) {\n clauses.push(\"search_parts(d.name,?)=1\");\n args.push(token);\n }\n const distance = token.length >= 7 && token.length <= 64 ? 2 : token.length >= 4 && token.length <= 6 ? 1 : 0;\n if (distance) {\n clauses.push(\n \"EXISTS (SELECT 1 FROM name_terms t WHERE t.document=d.id AND length(t.term) BETWEEN ? AND ? AND search_distance(t.term,?,?)<=?)\",\n );\n args.push(token.length - distance, token.length + distance, token, distance, distance);\n }\n return `(${clauses.join(\" OR \")})`;\n });\n const rankingArgs: (string | number)[] = [];\n const penalties = tokens.map((token) => {\n const distance = token.length >= 7 && token.length <= 64 ? 2 : token.length >= 4 && token.length <= 6 ? 1 : 0;\n rankingArgs.push(token, token);\n const fallback = distance\n ? `(SELECT 10*min(search_distance(t.term,?,?)) FROM name_terms t WHERE t.document=d.id AND length(t.term) BETWEEN ? AND ?)`\n : \"100\";\n if (distance) rankingArgs.push(token, distance, token.length - distance, token.length + distance);\n return `CASE WHEN instr(d.text,?)>0 THEN 0 WHEN search_parts(d.name,?)=1 THEN 1 ELSE COALESCE(${fallback},100) END`;\n });\n const name = query.toLocaleLowerCase().trim();\n const rows = this.db\n .prepare(`SELECT d.json,count(*) OVER() AS total FROM documents d\n WHERE d.cluster=? AND d.context=? ${[...filtersSql, ...conditions].length ? `AND ${[...filtersSql, ...conditions].join(\" AND \")}` : \"\"}\n ORDER BY ${penalties.length ? penalties.map((penalty) => `(${penalty})`).join(\"+\") : \"NULL\"},\n CASE WHEN LOWER(d.name)=? THEN 0 WHEN LOWER(d.name) LIKE ? ESCAPE '\\\\' THEN 1\n WHEN LOWER(d.kind)=? THEN 2 WHEN instr(LOWER(d.name),?)>0 THEN 3 ELSE 4 END,d.kind,d.name,d.path LIMIT ?`)\n .all(...args, ...rankingArgs, name, `${escapeLike(name)}%`, name, name, limit);\n const total = Number(rows[0]?.total ?? 0);\n return {\n documents: rows.map((row) => JSON.parse(String(row.json)) as SearchDocument),\n total,\n hasMore: total > rows.length,\n };\n }\n\n private bytes(): number {\n return [this.path, `${this.path}-journal`].reduce((sum, path) => {\n try {\n return sum + require(\"node:fs\").statSync(path).size;\n } catch {\n return sum;\n }\n }, 0);\n }\n\n close(): void {\n this.db.close();\n }\n}\n"],"mappings":";AAEA,IAAa,yBAAb,MAAoC;CAIxB;CAHV;CAEA,YACE,MACA,WAAW,MAAM,OAAO,MACxB;EAFQ,KAAA,OAAA;EAGR,MAAM,EAAE,iBAAiB,QAAQ,aAAa;EAC9C,KAAK,KAAK,IAAI,aAAa,IAAI;EAC/B,KAAK,GAAG,KAAK;;;;;;;;;;;;;;;;;;;;;0EAqByD;EACtE,MAAM,WAAW,OAAO,KAAK,GAAG,QAAQ,kBAAkB,CAAC,CAAC,IAAI,CAAC,EAAE,aAAa,IAAI;EACpF,KAAK,GAAG,KAAK,yBAAyB,KAAK,IAAI,IAAI,KAAK,MAAM,WAAW,IAAI,QAAQ,CAAC,GAAG;EACzF,KAAK,GAAG,SAAS,mBAAmB,EAAE,eAAe,KAAK,IAAI,MAAM,OAAO,UACzE,KAAK,SAAS,OAAO,IAAI,GAAG,OAAO,KAAK,GAAG,OAAO,KAAK,CAAC,CAC1D;EACA,KAAK,GAAG,SAAS,gBAAgB,EAAE,eAAe,KAAK,IAAI,MAAM,UAAU,KAAK,MAAM,OAAO,IAAI,GAAG,OAAO,KAAK,CAAC,CAAC;EAClH,IAAI;GACF,QAAQ,SAAS,CAAC,CAAC,UAAU,MAAM,GAAK;EAC1C,QAAQ,CAER;CACF;CAEA,SAAiB,MAAc,OAAe,OAAuB;EACnE,IAAI,KAAK,SAAS,MAAM,MAAM,SAAS,MAAM,KAAK,IAAI,KAAK,SAAS,MAAM,MAAM,IAAI,OAAO,OAAO,QAAQ;EAC1G,IAAI,WAAW,MAAM,KAAK,EAAE,QAAQ,MAAM,SAAS,EAAE,IAAI,GAAG,UAAU,KAAK;EAC3E,IAAI,iBAAiB;EACrB,KAAK,IAAI,MAAM,GAAG,OAAO,KAAK,QAAQ,OAAO;GAC3C,MAAM,UAAU,MAAc,MAAM,SAAS,CAAC,CAAC,CAAC,KAAK,QAAQ,CAAC;GAC9D,QAAQ,KAAK;GACb,IAAI,UAAU,QAAQ;GACtB,KAAK,IAAI,SAAS,KAAK,IAAI,GAAG,MAAM,KAAK,GAAG,UAAU,KAAK,IAAI,MAAM,QAAQ,MAAM,KAAK,GAAG,UAAU;IACnG,QAAQ,UAAU,KAAK,IACrB,SAAS,UAAU,GACnB,QAAQ,SAAS,KAAK,GACtB,SAAS,SAAS,MAAM,KAAK,MAAM,OAAO,MAAM,SAAS,KAAK,IAAI,EACpE;IACA,IAAI,MAAM,KAAK,SAAS,KAAK,KAAK,MAAM,OAAO,MAAM,SAAS,MAAM,KAAK,MAAM,OAAO,MAAM,SAAS,IACnG,QAAQ,UAAU,KAAK,IAAI,QAAQ,SAAS,eAAe,SAAS,KAAK,CAAC;IAC5E,UAAU,KAAK,IAAI,SAAS,QAAQ,OAAO;GAC7C;GACA,IAAI,UAAU,OAAO,OAAO,QAAQ;GACpC,iBAAiB;GACjB,WAAW;EACb;EACA,OAAO,SAAS,MAAM;CACxB;CAEA,MAAc,MAAc,OAAuB;EACjD,IAAI,CAAC,iCAAiC,KAAK,KAAK,GAAG,OAAO;EAC1D,MAAM,SAAS,MAAM,MAAM,OAAO;EAClC,IAAI,OAAO,SAAS,IAAI,OAAO;EAC/B,IAAI,SAAS;EACb,KAAK,MAAM,QAAQ,KAAK,kBAAkB,CAAC,CAAC,MAAM,OAAO,CAAC,CAAC,OAAO,OAAO,CAAC,CAAC,MAAM,GAAG,EAAE,GACpF,IAAI,SAAS,OAAO,SAAS;EAC/B,OAAO,WAAW,OAAO,SAAS,IAAI;CACxC;CAEA,IAAI,SAAsC;EACxC,MAAM,EAAE,WAAW,cAAc;EACjC,KAAK,GAAG,QAAQ,sDAAsD,CAAC,CAAC,IAAI,WAAW,SAAS;EAChG,KAAK,GAAG,QAAQ,kDAAkD,CAAC,CAAC,IAAI,WAAW,SAAS;EAC5F,IAAI,QAAQ,cAAc,SAAS,OAAO,KAAK,MAAM,WAAW,WAAW,QAAQ,OAAO,QAAQ,OAAO,OAAO;EAChH,IAAI,QAAQ,cAAc,UACxB,OAAO;GACL,WAAW;GACX,OAAO,OACL,KAAK,GACF,QAAQ,uEAAuE,CAAC,CAChF,IAAI,WAAW,SAAS,CAAC,EAAE,SAAS,CACzC;GACA,OAAO,KAAK,MAAM;EACpB;EACF,IAAI,QAAQ,cAAc,SAAS;GACjC,KAAK,GAAG,QAAQ,uCAAuC,CAAC,CAAC,IAAI,SAAS;GACtE,KAAK,GAAG,QAAQ,mCAAmC,CAAC,CAAC,IAAI,SAAS;GAClE,KAAK,GAAG,KAAK,QAAQ;GACrB,OAAO;EACT;EACA,IAAI,QAAQ,cAAc,UAAU,OAAO;EAC3C,IAAI,QAAQ,cAAc,aAAa;GACrC,MAAM,UAAU,KAAK,UAAU,QAAQ,SAAS;GAChD,KAAK,GACF,QAAQ;mHACkG,CAAC,CAC3G,IAAI,WAAW,WAAW,OAAO;GACpC,KAAK,GACF,QAAQ;sFACqE,CAAC,CAC9E,IAAI,WAAW,WAAW,OAAO;GACpC,OAAO;EACT;EACA,MAAM,EAAE,UAAU;EAClB,MAAM,SAAS,MAAM,SAAS,IAAI,IAAI,MAAM,MAAM,GAAG,EAAE,IAAI;EAC3D,MAAM,iBAAiB,MAAM,SAAS,IAAI,IAAI,gCAAgC;EAC9E,MAAM,YAAY,MAAM,SAAS,IAAI,IAAI,CAAC,QAAQ,MAAM,IAAI,CAAC,KAAK;EAClE,IAAI,QAAQ,cAAc,cAAc;GACtC,KAAK,GACF,QAAQ,2DAA2D,gBAAgB,CAAC,CACpF,IAAI,WAAW,WAAW,GAAG,SAAS;GACzC,KAAK,GACF,QAAQ,uDAAuD,gBAAgB,CAAC,CAChF,IAAI,WAAW,WAAW,GAAG,SAAS;GACzC,OAAO;EACT;EACA,IAAI,QAAQ,cAAc,SAAS;GACjC,KAAK,GACF,QACC,uGACF,CAAC,CACA,IAAI,WAAW,WAAW,OAAO,QAAQ,MAAM;GAClD,OAAO;EACT;EAIA,IAHa,KAAK,GACf,QAAQ,kEAAkE,CAAC,CAC3E,IAAI,WAAW,WAAW,KAAK,CAAC,EAAE,SACxB,QAAQ,QAAQ,MAAM,IAAI,MAAM,wBAAwB;EACrE,IAAI,QAAQ,cAAc,YAAY;GACpC,KAAK,GACF,QAAQ,2DAA2D,eAAe,aAAa,CAAC,CAChG,IAAI,WAAW,WAAW,GAAG,WAAW,QAAQ,MAAM;GACzD,KAAK,GACF,QAAQ,uDAAuD,gBAAgB,CAAC,CAChF,IAAI,WAAW,WAAW,GAAG,SAAS;GACzC,OAAO;EACT;EACA,KAAK,GAAG,KAAK,OAAO;EACpB,IAAI;GACF,MAAM,SAAS,KAAK,GAAG,QAAQ;;oHAE+E;GAC9G,MAAM,OAAO,KAAK,GAAG,QAAQ,8CAA8C;GAC3E,KAAK,MAAM,YAAY,QAAQ,WAAW;IACxC,MAAM,OAAO;KACX,SAAS;KACT,SAAS;KACT,SAAS,aAAa;KACtB,GAAI,SAAS,WAAW,CAAC;KACzB,GAAG,OAAO,QAAQ,SAAS,MAAM,CAAC,CAAC,KAAK,CAAC,KAAK,WAAW,GAAG,IAAI,GAAG,OAAO;KAC1E,IAAI,SAAS,UAAU,CAAC,EAAA,CAAG,KAAK,UAAU,MAAM,IAAI;IACtD,CAAC,CACE,KAAK,GAAG,CAAC,CACT,kBAAkB;IACrB,MAAM,MAAM,OAAO,IACjB,WACA,WACA,SAAS,MACT,OACA,QAAQ,QACR,SAAS,MACT,SAAS,MACT,KAAK,UAAU,QAAQ,GACvB,IACF;IACA,KAAK,GAAG,QAAQ,yCAAyC,CAAC,CAAC,IAAI,IAAK,EAAE;IACtE,KAAK,MAAM,QAAQ,IAAI,IACrB,CAAC,SAAS,MAAM,GAAG,SAAS,KAAK,MAAM,OAAO,CAAC,CAAC,CAAC,KAAK,SAAS,KAAK,kBAAkB,CAAC,CACzF,GACE,IAAI,KAAK,UAAU,KAAK,KAAK,UAAU,IAAI,KAAK,IAAI,IAAK,IAAI,IAAI;GACrE;GACA,KAAK,GAAG,KAAK,QAAQ;EACvB,SAAS,OAAO;GACd,IAAI;IACF,KAAK,GAAG,KAAK,UAAU;GACzB,QAAQ,CAER;GACA,MAAM;EACR;EACA,OAAO;CACT;CAEA,MACE,SACA,SACA,OACA,iBAAiB,KACjB,UAAiD,CAAC,GAC/B;EACnB,MAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,IAAI,KAAM,KAAK,MAAM,cAAc,CAAC,CAAC;EACpE,MAAM,SAAS,MAAM,MAAM,GAAG,GAAG,CAAC,CAAC,kBAAkB,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,OAAO,OAAO;EACzF,MAAM,OAA4B,CAAC,SAAS,OAAO;EACnD,MAAM,aAAuB,CAAC;EAC9B,IAAI,QAAQ,SAAS,KAAA,GAAW;GAC9B,WAAW,KAAK,wBAAwB;GACxC,KAAK,KAAK,QAAQ,IAAI;EACxB;EACA,IAAI,QAAQ,cAAc,KAAA,GAAW;GACnC,WAAW,KAAK,mDAAmD;GACnE,KAAK,KAAK,QAAQ,SAAS;EAC7B;EACA,MAAM,cAAc,SAAiB,KAAK,QAAQ,WAAW,MAAM;EACnE,MAAM,aAAa,OAAO,KAAK,UAAU;GACvC,MAAM,UAAoB,CAAC;GAC3B,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,UAAU,GAAG;IAC1B,QAAQ,KAAK,yDAAyD;IACtE,KAAK,KAAK,IAAI,MAAM,QAAQ,MAAM,MAAI,EAAE,EAAE;GAC5C,OAAO;IACL,QAAQ,KAAK,2BAA2B;IACxC,KAAK,KAAK,IAAI,WAAW,KAAK,EAAE,EAAE;GACpC;GAEA,IADc,MAAM,MAAM,OAAO,CAAC,CAAC,OAAO,OACtC,CAAA,CAAM,SAAS,GAAG;IACpB,QAAQ,KAAK,0BAA0B;IACvC,KAAK,KAAK,KAAK;GACjB;GACA,MAAM,WAAW,MAAM,UAAU,KAAK,MAAM,UAAU,KAAK,IAAI,MAAM,UAAU,KAAK,MAAM,UAAU,IAAI,IAAI;GAC5G,IAAI,UAAU;IACZ,QAAQ,KACN,iIACF;IACA,KAAK,KAAK,MAAM,SAAS,UAAU,MAAM,SAAS,UAAU,OAAO,UAAU,QAAQ;GACvF;GACA,OAAO,IAAI,QAAQ,KAAK,MAAM,EAAE;EAClC,CAAC;EACD,MAAM,cAAmC,CAAC;EAC1C,MAAM,YAAY,OAAO,KAAK,UAAU;GACtC,MAAM,WAAW,MAAM,UAAU,KAAK,MAAM,UAAU,KAAK,IAAI,MAAM,UAAU,KAAK,MAAM,UAAU,IAAI,IAAI;GAC5G,YAAY,KAAK,OAAO,KAAK;GAC7B,MAAM,WAAW,WACb,4HACA;GACJ,IAAI,UAAU,YAAY,KAAK,OAAO,UAAU,MAAM,SAAS,UAAU,MAAM,SAAS,QAAQ;GAChG,OAAO,yFAAyF,SAAS;EAC3G,CAAC;EACD,MAAM,OAAO,MAAM,kBAAkB,CAAC,CAAC,KAAK;EAC5C,MAAM,OAAO,KAAK,GACf,QAAQ;0CAC2B,CAAC,GAAG,YAAY,GAAG,UAAU,CAAC,CAAC,SAAS,OAAO,CAAC,GAAG,YAAY,GAAG,UAAU,CAAC,CAAC,KAAK,OAAO,MAAM,GAAG;iBAC5H,UAAU,SAAS,UAAU,KAAK,YAAY,IAAI,QAAQ,EAAE,CAAC,CAAC,KAAK,GAAG,IAAI,OAAO;;+GAEa,CAAC,CACzG,IAAI,GAAG,MAAM,GAAG,aAAa,MAAM,GAAG,WAAW,IAAI,EAAE,IAAI,MAAM,MAAM,KAAK;EAC/E,MAAM,QAAQ,OAAO,KAAK,EAAE,EAAE,SAAS,CAAC;EACxC,OAAO;GACL,WAAW,KAAK,KAAK,QAAQ,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,CAAmB;GAC3E;GACA,SAAS,QAAQ,KAAK;EACxB;CACF;CAEA,QAAwB;EACtB,OAAO,CAAC,KAAK,MAAM,GAAG,KAAK,KAAK,SAAS,CAAC,CAAC,QAAQ,KAAK,SAAS;GAC/D,IAAI;IACF,OAAO,MAAM,QAAQ,SAAS,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC;GACjD,QAAQ;IACN,OAAO;GACT;EACF,GAAG,CAAC;CACN;CAEA,QAAc;EACZ,KAAK,GAAG,MAAM;CAChB;AACF"}
@@ -0,0 +1,56 @@
1
+ const require_resource_search_database = require("./resource-search-database.js");
2
+ let node_worker_threads = require("node:worker_threads");
3
+ //#region src/main/resource-search-worker.ts
4
+ var ResourceSearchWorker = class {
5
+ worker;
6
+ sequence = 0;
7
+ pending = /* @__PURE__ */ new Map();
8
+ failure = false;
9
+ constructor(path) {
10
+ this.worker = new node_worker_threads.Worker(`const {parentPort,workerData}=require('node:worker_threads');
11
+ const Engine=${require_resource_search_database.ResourceSearchDatabase.toString()};let engine;
12
+ parentPort.on('message',({id,request})=>{
13
+ try { engine??=new Engine(workerData);parentPort.postMessage({id,result:engine.run(request)}); }
14
+ catch(error) { parentPort.postMessage({id,error:error?.errcode===13?'Search storage is full; clear the local search cache to continue':'Search index operation failed'}); }
15
+ });`, {
16
+ eval: true,
17
+ workerData: path
18
+ });
19
+ this.worker.on("message", ({ id, result, error }) => {
20
+ const pending = this.pending.get(id);
21
+ this.pending.delete(id);
22
+ if (error) pending?.reject(new Error(error));
23
+ else pending?.resolve(result);
24
+ });
25
+ this.worker.on("error", () => this.fail());
26
+ this.worker.on("exit", () => this.fail());
27
+ }
28
+ fail() {
29
+ this.failure = true;
30
+ for (const pending of this.pending.values()) pending.reject(/* @__PURE__ */ new Error("Local search index is unavailable"));
31
+ this.pending.clear();
32
+ }
33
+ call(request) {
34
+ if (this.failure) return Promise.reject(/* @__PURE__ */ new Error("Local search index is unavailable"));
35
+ if (this.pending.size >= 16) return Promise.reject(/* @__PURE__ */ new Error("Local search index is busy"));
36
+ return new Promise((resolve, reject) => {
37
+ const id = ++this.sequence;
38
+ this.pending.set(id, {
39
+ resolve,
40
+ reject
41
+ });
42
+ this.worker.postMessage({
43
+ id,
44
+ request
45
+ });
46
+ });
47
+ }
48
+ close() {
49
+ this.fail();
50
+ this.worker.terminate();
51
+ }
52
+ };
53
+ //#endregion
54
+ exports.ResourceSearchWorker = ResourceSearchWorker;
55
+
56
+ //# sourceMappingURL=resource-search-worker.js.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"resource-search-worker.js","names":[],"sources":["../../src/main/resource-search-worker.ts"],"sourcesContent":["import { Worker } from \"node:worker_threads\";\nimport { ResourceSearchDatabase } from \"./resource-search-database\";\n\nimport type { SearchIndexRequest } from \"../common/resource-search\";\n\nexport class ResourceSearchWorker {\n private worker: Worker;\n private sequence = 0;\n private pending = new Map<number, { resolve: (value: unknown) => void; reject: (error: Error) => void }>();\n private failure = false;\n\n constructor(path: string) {\n // the serialized engine remains self-contained in both bundled and preserved builds\n this.worker = new Worker(\n `const {parentPort,workerData}=require('node:worker_threads');\n const Engine=${ResourceSearchDatabase.toString()};let engine;\n parentPort.on('message',({id,request})=>{\n try { engine??=new Engine(workerData);parentPort.postMessage({id,result:engine.run(request)}); }\n catch(error) { parentPort.postMessage({id,error:error?.errcode===13?'Search storage is full; clear the local search cache to continue':'Search index operation failed'}); }\n });`,\n { eval: true, workerData: path },\n );\n this.worker.on(\"message\", ({ id, result, error }) => {\n const pending = this.pending.get(id);\n this.pending.delete(id);\n if (error) pending?.reject(new Error(error));\n else pending?.resolve(result);\n });\n this.worker.on(\"error\", () => this.fail());\n this.worker.on(\"exit\", () => this.fail());\n }\n\n private fail(): void {\n this.failure = true;\n for (const pending of this.pending.values()) pending.reject(new Error(\"Local search index is unavailable\"));\n this.pending.clear();\n }\n\n call(request: SearchIndexRequest): Promise<unknown> {\n if (this.failure) return Promise.reject(new Error(\"Local search index is unavailable\"));\n if (this.pending.size >= 16) return Promise.reject(new Error(\"Local search index is busy\"));\n return new Promise((resolve, reject) => {\n const id = ++this.sequence;\n this.pending.set(id, { resolve, reject });\n this.worker.postMessage({ id, request });\n });\n }\n\n close(): void {\n this.fail();\n void this.worker.terminate();\n }\n}\n"],"mappings":";;;AAKA,IAAa,uBAAb,MAAkC;CAChC;CACA,WAAmB;CACnB,0BAAkB,IAAI,IAAmF;CACzG,UAAkB;CAElB,YAAY,MAAc;EAExB,KAAK,SAAS,IAAI,oBAAA,OAChB;qBACe,iCAAA,uBAAuB,SAAS,EAAE;;;;YAKjD;GAAE,MAAM;GAAM,YAAY;EAAK,CACjC;EACA,KAAK,OAAO,GAAG,YAAY,EAAE,IAAI,QAAQ,YAAY;GACnD,MAAM,UAAU,KAAK,QAAQ,IAAI,EAAE;GACnC,KAAK,QAAQ,OAAO,EAAE;GACtB,IAAI,OAAO,SAAS,OAAO,IAAI,MAAM,KAAK,CAAC;QACtC,SAAS,QAAQ,MAAM;EAC9B,CAAC;EACD,KAAK,OAAO,GAAG,eAAe,KAAK,KAAK,CAAC;EACzC,KAAK,OAAO,GAAG,cAAc,KAAK,KAAK,CAAC;CAC1C;CAEA,OAAqB;EACnB,KAAK,UAAU;EACf,KAAK,MAAM,WAAW,KAAK,QAAQ,OAAO,GAAG,QAAQ,uBAAO,IAAI,MAAM,mCAAmC,CAAC;EAC1G,KAAK,QAAQ,MAAM;CACrB;CAEA,KAAK,SAA+C;EAClD,IAAI,KAAK,SAAS,OAAO,QAAQ,uBAAO,IAAI,MAAM,mCAAmC,CAAC;EACtF,IAAI,KAAK,QAAQ,QAAQ,IAAI,OAAO,QAAQ,uBAAO,IAAI,MAAM,4BAA4B,CAAC;EAC1F,OAAO,IAAI,SAAS,SAAS,WAAW;GACtC,MAAM,KAAK,EAAE,KAAK;GAClB,KAAK,QAAQ,IAAI,IAAI;IAAE;IAAS;GAAO,CAAC;GACxC,KAAK,OAAO,YAAY;IAAE;IAAI;GAAQ,CAAC;EACzC,CAAC;CACH;CAEA,QAAc;EACZ,KAAK,KAAK;EACV,KAAU,OAAO,UAAU;CAC7B;AACF"}