logixia 2.0.11 → 2.2.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.
- package/README.md +4 -3
- package/dist/{async-context-BGUCdYAa.mjs → async-context-1YMPGgJZ.mjs} +3 -3
- package/dist/{async-context-BGUCdYAa.mjs.map → async-context-1YMPGgJZ.mjs.map} +1 -1
- package/dist/{async-context-D8um9I5V.js → async-context-CoPhbRG0.js} +4 -4
- package/dist/{async-context-D8um9I5V.js.map → async-context-CoPhbRG0.js.map} +1 -1
- package/dist/{azure-monitor.transport-CTnfwA0F.mjs → azure-monitor.transport-B_dqSV_o.mjs} +4 -4
- package/dist/{azure-monitor.transport-CTnfwA0F.mjs.map → azure-monitor.transport-B_dqSV_o.mjs.map} +1 -1
- package/dist/{azure-monitor.transport-C8KdmsSw.js → azure-monitor.transport-Bl3xVvpN.js} +4 -4
- package/dist/{azure-monitor.transport-C8KdmsSw.js.map → azure-monitor.transport-Bl3xVvpN.js.map} +1 -1
- package/dist/{azure-monitor.transport-CbSHOnNX.d.mts → azure-monitor.transport-C5VjvREZ.d.mts} +2 -2
- package/dist/{azure-monitor.transport-CbSHOnNX.d.mts.map → azure-monitor.transport-C5VjvREZ.d.mts.map} +1 -1
- package/dist/{azure-monitor.transport-Bvf7Xegt.d.ts → azure-monitor.transport-CyHDjHS-.d.ts} +2 -2
- package/dist/{azure-monitor.transport-Bvf7Xegt.d.ts.map → azure-monitor.transport-CyHDjHS-.d.ts.map} +1 -1
- package/dist/azure.d.mts +1 -1
- package/dist/azure.d.ts +1 -1
- package/dist/azure.js +1 -1
- package/dist/azure.mjs +1 -1
- package/dist/{batch-buffer-BJqzpfpT.mjs → batch-buffer-BnmVCCwI.mjs} +2 -2
- package/dist/{batch-buffer-BJqzpfpT.mjs.map → batch-buffer-BnmVCCwI.mjs.map} +1 -1
- package/dist/{batch-buffer-BTQdAXwC.js → batch-buffer-C-ETEX3Y.js} +2 -2
- package/dist/{batch-buffer-BTQdAXwC.js.map → batch-buffer-C-ETEX3Y.js.map} +1 -1
- package/dist/browser.d.mts +2 -0
- package/dist/browser.d.mts.map +1 -1
- package/dist/browser.d.ts +2 -0
- package/dist/browser.d.ts.map +1 -1
- package/dist/browser.js +33 -15
- package/dist/browser.js.map +1 -1
- package/dist/browser.mjs +33 -15
- package/dist/browser.mjs.map +1 -1
- package/dist/{builder-C6kKEVrU.mjs → builder-CbttbixM.mjs} +158 -279
- package/dist/builder-CbttbixM.mjs.map +1 -0
- package/dist/{builder-Up4YxX7l.js → builder-Ck1tsC5d.js} +160 -305
- package/dist/builder-Ck1tsC5d.js.map +1 -0
- package/dist/cloudwatch.d.mts +1 -1
- package/dist/cloudwatch.d.ts +1 -1
- package/dist/cloudwatch.js +1 -1
- package/dist/cloudwatch.mjs +1 -1
- package/dist/{cloudwatch.transport-Bl1qzdBx.mjs → cloudwatch.transport-Brh5fmRN.mjs} +5 -5
- package/dist/{cloudwatch.transport-Bl1qzdBx.mjs.map → cloudwatch.transport-Brh5fmRN.mjs.map} +1 -1
- package/dist/{cloudwatch.transport-BoCyxNKO.js → cloudwatch.transport-DO9e__Z-.js} +5 -5
- package/dist/{cloudwatch.transport-BoCyxNKO.js.map → cloudwatch.transport-DO9e__Z-.js.map} +1 -1
- package/dist/{cloudwatch.transport-CQyT6U91.d.ts → cloudwatch.transport-DdSjUWvu.d.ts} +2 -2
- package/dist/{cloudwatch.transport-CQyT6U91.d.ts.map → cloudwatch.transport-DdSjUWvu.d.ts.map} +1 -1
- package/dist/{cloudwatch.transport-CjVrI6S4.d.mts → cloudwatch.transport-_hS7Mcc5.d.mts} +2 -2
- package/dist/{cloudwatch.transport-CjVrI6S4.d.mts.map → cloudwatch.transport-_hS7Mcc5.d.mts.map} +1 -1
- package/dist/correlation.js +3 -3
- package/dist/correlation.mjs +3 -3
- package/dist/{entry-fields-CJbeaoBs.js → entry-fields-BSLkzw18.js} +3 -3
- package/dist/{entry-fields-CJbeaoBs.js.map → entry-fields-BSLkzw18.js.map} +1 -1
- package/dist/{entry-fields-D_aNnjg0.mjs → entry-fields-J1OBi24o.mjs} +2 -2
- package/dist/{entry-fields-D_aNnjg0.mjs.map → entry-fields-J1OBi24o.mjs.map} +1 -1
- package/dist/error.utils-B8_CwESF.mjs +189 -0
- package/dist/error.utils-B8_CwESF.mjs.map +1 -0
- package/dist/error.utils-fZkRExam.js +212 -0
- package/dist/error.utils-fZkRExam.js.map +1 -0
- package/dist/fastify.d.mts +89 -0
- package/dist/fastify.d.mts.map +1 -0
- package/dist/fastify.d.ts +89 -0
- package/dist/fastify.d.ts.map +1 -0
- package/dist/fastify.js +265 -0
- package/dist/fastify.js.map +1 -0
- package/dist/fastify.mjs +263 -0
- package/dist/fastify.mjs.map +1 -0
- package/dist/gcp.d.mts +1 -1
- package/dist/gcp.d.ts +1 -1
- package/dist/gcp.js +1 -1
- package/dist/gcp.mjs +1 -1
- package/dist/{gcp.transport-DOH4bpWM.mjs → gcp.transport-BY1Z3cS0.mjs} +5 -5
- package/dist/{gcp.transport-DOH4bpWM.mjs.map → gcp.transport-BY1Z3cS0.mjs.map} +1 -1
- package/dist/{gcp.transport-D9SdLPwP.d.mts → gcp.transport-C8VJiEM7.d.mts} +2 -2
- package/dist/{gcp.transport-D9SdLPwP.d.mts.map → gcp.transport-C8VJiEM7.d.mts.map} +1 -1
- package/dist/{gcp.transport-BCIvdFV-.d.ts → gcp.transport-Ct0BtKFo.d.ts} +2 -2
- package/dist/{gcp.transport-BCIvdFV-.d.ts.map → gcp.transport-Ct0BtKFo.d.ts.map} +1 -1
- package/dist/{gcp.transport-D_NHVZrw.js → gcp.transport-V9R4dwdT.js} +5 -5
- package/dist/{gcp.transport-D_NHVZrw.js.map → gcp.transport-V9R4dwdT.js.map} +1 -1
- package/dist/hono.d.mts +66 -0
- package/dist/hono.d.mts.map +1 -0
- package/dist/hono.d.ts +66 -0
- package/dist/hono.d.ts.map +1 -0
- package/dist/hono.js +512 -0
- package/dist/hono.js.map +1 -0
- package/dist/hono.mjs +511 -0
- package/dist/hono.mjs.map +1 -0
- package/dist/{index-BAkPHp5D.d.mts → index-B3ajtXJd.d.mts} +2 -2
- package/dist/{index-BAkPHp5D.d.mts.map → index-B3ajtXJd.d.mts.map} +1 -1
- package/dist/{index-e7LowmAu.d.ts → index-oqD3WNxf.d.ts} +2 -2
- package/dist/{index-e7LowmAu.d.ts.map → index-oqD3WNxf.d.ts.map} +1 -1
- package/dist/index.d.mts +8 -7
- package/dist/index.d.mts.map +1 -1
- package/dist/index.d.ts +8 -7
- package/dist/index.d.ts.map +1 -1
- package/dist/index.js +23 -20
- package/dist/index.js.map +1 -1
- package/dist/index.mjs +11 -9
- package/dist/index.mjs.map +1 -1
- package/dist/{logitron-logger-DVUdgmBY.d.ts → logitron-logger-Csn3e6Qu.d.ts} +2 -2
- package/dist/{logitron-logger-DVUdgmBY.d.ts.map → logitron-logger-Csn3e6Qu.d.ts.map} +1 -1
- package/dist/{logitron-logger-DoWmMjYB.d.mts → logitron-logger-fMOkXr8H.d.mts} +2 -2
- package/dist/{logitron-logger-DoWmMjYB.d.mts.map → logitron-logger-fMOkXr8H.d.mts.map} +1 -1
- package/dist/middleware.d.mts +1 -1
- package/dist/middleware.d.ts +1 -1
- package/dist/middleware.js +6 -5
- package/dist/middleware.js.map +1 -1
- package/dist/middleware.mjs +4 -3
- package/dist/middleware.mjs.map +1 -1
- package/dist/nest.d.mts +47 -15
- package/dist/nest.d.mts.map +1 -1
- package/dist/nest.d.ts +47 -15
- package/dist/nest.d.ts.map +1 -1
- package/dist/nest.js +172 -50
- package/dist/nest.js.map +1 -1
- package/dist/nest.mjs +168 -46
- package/dist/nest.mjs.map +1 -1
- package/dist/{otel-DH6-G6DR.js → otel-BrgvxLDW.js} +319 -66
- package/dist/otel-BrgvxLDW.js.map +1 -0
- package/dist/{otel-DAVxpArV.mjs → otel-C5jBV_l_.mjs} +319 -66
- package/dist/otel-C5jBV_l_.mjs.map +1 -0
- package/dist/own-property-BWkibepN.js +40 -0
- package/dist/own-property-BWkibepN.js.map +1 -0
- package/dist/own-property-CjFw9qwZ.mjs +29 -0
- package/dist/own-property-CjFw9qwZ.mjs.map +1 -0
- package/dist/{request-trace-C7kXMjx5.js → request-trace-6NBSw5lt.js} +14 -3
- package/dist/{request-trace-C7kXMjx5.js.map → request-trace-6NBSw5lt.js.map} +1 -1
- package/dist/{request-trace-Dekcnenb.mjs → request-trace-txUhyyre.mjs} +9 -4
- package/dist/{request-trace-Dekcnenb.mjs.map → request-trace-txUhyyre.mjs.map} +1 -1
- package/dist/{safe-stringify-pZOnzGRJ.mjs → safe-stringify-B5p5ktFe.mjs} +2 -2
- package/dist/{safe-stringify-pZOnzGRJ.mjs.map → safe-stringify-B5p5ktFe.mjs.map} +1 -1
- package/dist/{safe-stringify-CJisLyZ3.js → safe-stringify-J3sh-7YM.js} +5 -5
- package/dist/{safe-stringify-CJisLyZ3.js.map → safe-stringify-J3sh-7YM.js.map} +1 -1
- package/dist/{search-Crf2IEoA.d.mts → search-B-hJe2N-.d.mts} +7 -3
- package/dist/{search-Crf2IEoA.d.mts.map → search-B-hJe2N-.d.mts.map} +1 -1
- package/dist/{search-B4eEzrhM.d.ts → search-BlKBLm5D.d.ts} +7 -3
- package/dist/{search-B4eEzrhM.d.ts.map → search-BlKBLm5D.d.ts.map} +1 -1
- package/dist/{search-CjYl-mo5.mjs → search-CTR4XNHq.mjs} +52 -14
- package/dist/search-CTR4XNHq.mjs.map +1 -0
- package/dist/{search-CJw_xoQl.js → search-_qx4YzRP.js} +52 -14
- package/dist/search-_qx4YzRP.js.map +1 -0
- package/dist/search.d.mts +1 -1
- package/dist/search.d.ts +1 -1
- package/dist/search.js +1 -1
- package/dist/search.mjs +1 -1
- package/dist/{secret-config-D1F4MW69.mjs → secret-config-Cng7XPLx.mjs} +18 -13
- package/dist/secret-config-Cng7XPLx.mjs.map +1 -0
- package/dist/{secret-config-6hdODxBb.js → secret-config-OqmIPmpV.js} +21 -16
- package/dist/secret-config-OqmIPmpV.js.map +1 -0
- package/dist/{sensitive-names-wv27qBQC.mjs → sensitive-names-BiBM6R1X.mjs} +2 -28
- package/dist/sensitive-names-BiBM6R1X.mjs.map +1 -0
- package/dist/{sensitive-names-CNgHaqv9.js → sensitive-names-NiKIRhp5.js} +1 -39
- package/dist/sensitive-names-NiKIRhp5.js.map +1 -0
- package/dist/{slack.transport-C6E0l4kw.d.ts → slack.transport-5OPL7H3u.d.mts} +76 -3
- package/dist/slack.transport-5OPL7H3u.d.mts.map +1 -0
- package/dist/{slack.transport-BDyENuR0.d.mts → slack.transport-BFpBD_Ri.d.ts} +76 -3
- package/dist/slack.transport-BFpBD_Ri.d.ts.map +1 -0
- package/dist/{slack.transport-YvaLJxNv.mjs → slack.transport-C6dzPJHX.mjs} +226 -9
- package/dist/slack.transport-C6dzPJHX.mjs.map +1 -0
- package/dist/{slack.transport-CEYBVzUj.js → slack.transport-Ci0swStG.js} +231 -8
- package/dist/slack.transport-Ci0swStG.js.map +1 -0
- package/dist/testing.d.mts +1 -1
- package/dist/testing.d.ts +1 -1
- package/dist/{transport.types-CzJq4IrF.d.ts → transport.types-B1ejJJP6.d.mts} +6 -1
- package/dist/transport.types-B1ejJJP6.d.mts.map +1 -0
- package/dist/{transport.types-CzJq4IrF.d.mts → transport.types-B1ejJJP6.d.ts} +6 -1
- package/dist/transport.types-B1ejJJP6.d.ts.map +1 -0
- package/dist/transports.d.mts +61 -11
- package/dist/transports.d.mts.map +1 -1
- package/dist/transports.d.ts +61 -11
- package/dist/transports.d.ts.map +1 -1
- package/dist/transports.js +7 -6
- package/dist/transports.mjs +7 -7
- package/dist/worker-entry.js +106 -22
- package/dist/worker.d.mts +1 -1
- package/dist/worker.d.ts +1 -1
- package/dist/worker.js +1 -1
- package/dist/worker.mjs +1 -1
- package/dist/{worker.transport-B9mCQSM1.d.ts → worker.transport-B7olL1Uh.d.ts} +12 -2
- package/dist/worker.transport-B7olL1Uh.d.ts.map +1 -0
- package/dist/{worker.transport-CwNpH98o.js → worker.transport-CZOutlxC.js} +40 -2
- package/dist/worker.transport-CZOutlxC.js.map +1 -0
- package/dist/{worker.transport-DgK_ZXlB.mjs → worker.transport-CxFD8mvS.mjs} +40 -2
- package/dist/worker.transport-CxFD8mvS.mjs.map +1 -0
- package/dist/{worker.transport-Bl8lFRck.d.mts → worker.transport-DnU0_9Bd.d.mts} +12 -2
- package/dist/worker.transport-DnU0_9Bd.d.mts.map +1 -0
- package/package.json +37 -2
- package/dist/builder-C6kKEVrU.mjs.map +0 -1
- package/dist/builder-Up4YxX7l.js.map +0 -1
- package/dist/otel-DAVxpArV.mjs.map +0 -1
- package/dist/otel-DH6-G6DR.js.map +0 -1
- package/dist/search-CJw_xoQl.js.map +0 -1
- package/dist/search-CjYl-mo5.mjs.map +0 -1
- package/dist/secret-config-6hdODxBb.js.map +0 -1
- package/dist/secret-config-D1F4MW69.mjs.map +0 -1
- package/dist/sensitive-names-CNgHaqv9.js.map +0 -1
- package/dist/sensitive-names-wv27qBQC.mjs.map +0 -1
- package/dist/slack.transport-BDyENuR0.d.mts.map +0 -1
- package/dist/slack.transport-C6E0l4kw.d.ts.map +0 -1
- package/dist/slack.transport-CEYBVzUj.js.map +0 -1
- package/dist/slack.transport-YvaLJxNv.mjs.map +0 -1
- package/dist/transport.types-CzJq4IrF.d.mts.map +0 -1
- package/dist/transport.types-CzJq4IrF.d.ts.map +0 -1
- package/dist/worker.transport-B9mCQSM1.d.ts.map +0 -1
- package/dist/worker.transport-Bl8lFRck.d.mts.map +0 -1
- package/dist/worker.transport-CwNpH98o.js.map +0 -1
- package/dist/worker.transport-DgK_ZXlB.mjs.map +0 -1
|
@@ -1,3 +1,4 @@
|
|
|
1
|
+
import { i as stringifyForLog } from "./safe-stringify-B5p5ktFe.mjs";
|
|
1
2
|
import { n as safeToString, t as csvField } from "./csv.utils-ZdxSod5g.mjs";
|
|
2
3
|
// src/search/core/basic-log-indexer.ts
|
|
3
4
|
/**
|
|
@@ -114,8 +115,8 @@ var BasicLogIndexer = class {
|
|
|
114
115
|
const cutoffTime = olderThan.getTime();
|
|
115
116
|
let removedCount = 0;
|
|
116
117
|
for (const [logId, log] of this.index.entries()) if (new Date(log.timestamp).getTime() < cutoffTime) {
|
|
118
|
+
this.removeFromFieldIndices(logId, log);
|
|
117
119
|
this.trackDelete(logId);
|
|
118
|
-
this.removeFromFieldIndices(logId);
|
|
119
120
|
removedCount++;
|
|
120
121
|
}
|
|
121
122
|
return removedCount;
|
|
@@ -159,8 +160,23 @@ var BasicLogIndexer = class {
|
|
|
159
160
|
if (!fieldIndex.has(normalizedValue)) fieldIndex.set(normalizedValue, /* @__PURE__ */ new Set());
|
|
160
161
|
fieldIndex.get(normalizedValue).add(logId);
|
|
161
162
|
}
|
|
162
|
-
removeFromFieldIndices(logId) {
|
|
163
|
-
|
|
163
|
+
removeFromFieldIndices(logId, log) {
|
|
164
|
+
const values = [
|
|
165
|
+
["level", log.level],
|
|
166
|
+
["appName", log.appName],
|
|
167
|
+
["traceId", log.traceId],
|
|
168
|
+
["context", log.context],
|
|
169
|
+
["environment", log.environment]
|
|
170
|
+
];
|
|
171
|
+
for (const [field, value] of values) {
|
|
172
|
+
if (!value) continue;
|
|
173
|
+
const fieldIndex = this.fieldIndices.get(field);
|
|
174
|
+
const key = value.toLowerCase();
|
|
175
|
+
const logIds = fieldIndex === null || fieldIndex === void 0 ? void 0 : fieldIndex.get(key);
|
|
176
|
+
if (!logIds) continue;
|
|
177
|
+
logIds.delete(logId);
|
|
178
|
+
if (logIds.size === 0) fieldIndex.delete(key);
|
|
179
|
+
}
|
|
164
180
|
}
|
|
165
181
|
generateLogId(log) {
|
|
166
182
|
return `${log.timestamp}_${log.level}_${Math.random().toString(36).slice(2, 11)}`;
|
|
@@ -172,7 +188,7 @@ var BasicLogIndexer = class {
|
|
|
172
188
|
trackInsert(logId, log) {
|
|
173
189
|
const existing = this.logSizeById.get(logId);
|
|
174
190
|
if (existing !== void 0) this.indexSizeBytes -= existing;
|
|
175
|
-
const size =
|
|
191
|
+
const size = stringifyForLog(log).length;
|
|
176
192
|
this.index.set(logId, log);
|
|
177
193
|
this.logSizeById.set(logId, size);
|
|
178
194
|
this.indexSizeBytes += size;
|
|
@@ -187,10 +203,14 @@ var BasicLogIndexer = class {
|
|
|
187
203
|
this.index.delete(logId);
|
|
188
204
|
}
|
|
189
205
|
async removeOldestLogs(count) {
|
|
190
|
-
const
|
|
191
|
-
for (const
|
|
206
|
+
const oldest = [];
|
|
207
|
+
for (const entry of this.index) {
|
|
208
|
+
if (oldest.length >= count) break;
|
|
209
|
+
oldest.push(entry);
|
|
210
|
+
}
|
|
211
|
+
for (const [logId, log] of oldest) {
|
|
212
|
+
this.removeFromFieldIndices(logId, log);
|
|
192
213
|
this.trackDelete(logId);
|
|
193
|
-
this.removeFromFieldIndices(logId);
|
|
194
214
|
}
|
|
195
215
|
}
|
|
196
216
|
async clusterLogs(logs) {
|
|
@@ -277,7 +297,9 @@ function extractUserId(query) {
|
|
|
277
297
|
*/
|
|
278
298
|
var BasicSearchEngine = class {
|
|
279
299
|
options;
|
|
280
|
-
|
|
300
|
+
buffer = [];
|
|
301
|
+
/** Index of the oldest live entry in `buffer`; evicted entries are dropped in bulk. */
|
|
302
|
+
head = 0;
|
|
281
303
|
presets = /* @__PURE__ */ new Map();
|
|
282
304
|
searchHistory = [];
|
|
283
305
|
suggestionCache = /* @__PURE__ */ new Map();
|
|
@@ -290,6 +312,14 @@ var BasicSearchEngine = class {
|
|
|
290
312
|
...options
|
|
291
313
|
};
|
|
292
314
|
}
|
|
315
|
+
/** The live logs, oldest first. Compacts away evicted entries on demand. */
|
|
316
|
+
get logs() {
|
|
317
|
+
if (this.head > 0) {
|
|
318
|
+
this.buffer = this.buffer.slice(this.head);
|
|
319
|
+
this.head = 0;
|
|
320
|
+
}
|
|
321
|
+
return this.buffer;
|
|
322
|
+
}
|
|
293
323
|
/**
|
|
294
324
|
* Add logs to the search index.
|
|
295
325
|
*
|
|
@@ -301,15 +331,23 @@ var BasicSearchEngine = class {
|
|
|
301
331
|
*/
|
|
302
332
|
addLogs(logs) {
|
|
303
333
|
var _this$options;
|
|
304
|
-
for (const log of logs) this.
|
|
334
|
+
for (const log of logs) this.buffer.push(log);
|
|
305
335
|
const maxLogs = ((_this$options = this.options) === null || _this$options === void 0 ? void 0 : _this$options.maxLogs) ?? 1e5;
|
|
306
|
-
|
|
336
|
+
const excess = this.buffer.length - this.head - maxLogs;
|
|
337
|
+
if (excess > 0) {
|
|
338
|
+
this.head += excess;
|
|
339
|
+
if (this.head >= Math.max(1, maxLogs / 4)) {
|
|
340
|
+
this.buffer = this.buffer.slice(this.head);
|
|
341
|
+
this.head = 0;
|
|
342
|
+
}
|
|
343
|
+
}
|
|
307
344
|
}
|
|
308
345
|
/**
|
|
309
346
|
* Clear all logs from the index
|
|
310
347
|
*/
|
|
311
348
|
clearLogs() {
|
|
312
|
-
this.
|
|
349
|
+
this.buffer = [];
|
|
350
|
+
this.head = 0;
|
|
313
351
|
}
|
|
314
352
|
/**
|
|
315
353
|
* Get all indexed logs
|
|
@@ -440,9 +478,9 @@ var BasicSearchEngine = class {
|
|
|
440
478
|
*/
|
|
441
479
|
async getStats() {
|
|
442
480
|
return {
|
|
443
|
-
totalResults: this.
|
|
481
|
+
totalResults: this.buffer.length - this.head,
|
|
444
482
|
executionTime: 0,
|
|
445
|
-
indexSize: this.
|
|
483
|
+
indexSize: this.buffer.length - this.head,
|
|
446
484
|
topTerms: this.getTopTerms()
|
|
447
485
|
};
|
|
448
486
|
}
|
|
@@ -1852,4 +1890,4 @@ var SearchManager = class {
|
|
|
1852
1890
|
};
|
|
1853
1891
|
export { BasicSearchEngine as a, CorrelationEngine as i, PatternRecognitionEngine as n, BasicLogIndexer as o, NLPSearchEngine as r, SearchManager as t };
|
|
1854
1892
|
|
|
1855
|
-
//# sourceMappingURL=search-
|
|
1893
|
+
//# sourceMappingURL=search-CTR4XNHq.mjs.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"search-CTR4XNHq.mjs","names":[],"sources":["../src/search/core/basic-log-indexer.ts","../src/search/core/user-id.ts","../src/search/core/basic-search-engine.ts","../src/search/engines/correlation-engine.ts","../src/search/engines/nlp-search-engine.ts","../src/search/engines/pattern-recognition-engine.ts","../src/search/search-manager.ts"],"sourcesContent":["/**\n * Basic log indexer implementation for indexing and managing log entries\n */\n\nimport type { LogEntry } from '../../types';\nimport { stringifyForLog } from '../../utils/safe-stringify';\nimport type { LogCluster, SearchQuery, SemanticIndex } from '../types';\nimport type { ILogIndexer } from './log-indexer.interface';\n\n/**\n * Basic log indexer implementation\n */\nexport class BasicLogIndexer implements ILogIndexer {\n private index: Map<string, LogEntry> = new Map();\n private fieldIndices: Map<string, Map<string, Set<string>>> = new Map();\n private semanticIndex: SemanticIndex | undefined;\n private lastOptimized?: Date;\n /**\n * Running estimate of the serialized index size in bytes, maintained\n * incrementally. The previous implementation JSON.stringify'd EVERY log on\n * each getIndexStats() call — O(n) per call, which for the default 1M-entry\n * cap means stringifying a million objects and blocking the event loop.\n * We keep a per-log byte estimate so the lookup is O(1).\n */\n private indexSizeBytes = 0;\n private readonly logSizeById = new Map<string, number>();\n\n constructor(\n private options?: {\n maxIndexSize?: number;\n autoOptimize?: boolean;\n optimizeThreshold?: number;\n }\n ) {\n this.options = {\n maxIndexSize: 1000000,\n autoOptimize: true,\n optimizeThreshold: 10000,\n ...options,\n };\n\n // Initialize field indices\n this.initializeFieldIndices();\n }\n\n /**\n * Index a single log entry\n */\n async indexLog(log: LogEntry): Promise<void> {\n const logId = this.generateLogId(log);\n\n // Add to main index\n this.trackInsert(logId, log);\n\n // Update field indices\n this.updateFieldIndices(logId, log);\n\n // Auto-optimize if threshold reached\n if (\n this.options?.autoOptimize &&\n this.index.size % (this.options.optimizeThreshold || 10000) === 0\n ) {\n await this.optimizeIndex();\n }\n\n // Enforce max size\n if (this.index.size > (this.options?.maxIndexSize || 1000000)) {\n await this.removeOldestLogs(Math.floor((this.options?.maxIndexSize || 1000000) * 0.1));\n }\n }\n\n /**\n * Index multiple log entries in batch\n */\n async indexBatch(logs: LogEntry[]): Promise<void> {\n for (const log of logs) {\n const logId = this.generateLogId(log);\n this.trackInsert(logId, log);\n this.updateFieldIndices(logId, log);\n }\n\n // Optimize after batch\n if (this.options?.autoOptimize) {\n await this.optimizeIndex();\n }\n }\n\n /**\n * Build semantic index for intelligent search\n */\n async buildSemanticIndex(logs: LogEntry[]): Promise<SemanticIndex> {\n // Build clusters based on log patterns\n const clusters = await this.clusterLogs(logs);\n\n this.semanticIndex = {\n version: '1.0.0',\n indexedCount: logs.length,\n lastUpdated: new Date(),\n clusters,\n };\n\n return this.semanticIndex;\n }\n\n /**\n * Update search suggestions based on search history\n */\n async updateSearchSuggestions(searchHistory: SearchQuery[]): Promise<void> {\n // Extract common patterns from search history\n const patterns = new Map<string, number>();\n\n for (const query of searchHistory) {\n const normalizedQuery = query.query.toLowerCase().trim();\n patterns.set(normalizedQuery, (patterns.get(normalizedQuery) || 0) + 1);\n }\n\n // In a real implementation, this would persist top patterns to storage\n // Top patterns (sorted by frequency) would be stored here\n }\n\n /**\n * Optimize the index for better performance\n */\n async optimizeIndex(): Promise<void> {\n // Rebuild field indices\n this.fieldIndices.clear();\n this.initializeFieldIndices();\n\n for (const [logId, log] of this.index.entries()) {\n this.updateFieldIndices(logId, log);\n }\n\n this.lastOptimized = new Date();\n }\n\n /**\n * Clear the index\n */\n async clearIndex(): Promise<void> {\n this.index.clear();\n this.fieldIndices.clear();\n this.semanticIndex = undefined;\n this.indexSizeBytes = 0;\n this.logSizeById.clear();\n this.initializeFieldIndices();\n }\n\n /**\n * Get index statistics\n */\n async getIndexStats(): Promise<{\n totalDocuments: number;\n indexSize: number;\n lastOptimized?: Date;\n }> {\n return {\n totalDocuments: this.index.size,\n indexSize: this.calculateIndexSize(),\n ...(this.lastOptimized !== undefined ? { lastOptimized: this.lastOptimized } : {}),\n };\n }\n\n /**\n * Remove logs older than specified time\n */\n async removeOldLogs(olderThan: Date): Promise<number> {\n const cutoffTime = olderThan.getTime();\n let removedCount = 0;\n\n for (const [logId, log] of this.index.entries()) {\n const logTime = new Date(log.timestamp).getTime();\n if (logTime < cutoffTime) {\n this.removeFromFieldIndices(logId, log);\n this.trackDelete(logId);\n removedCount++;\n }\n }\n\n return removedCount;\n }\n\n /**\n * Search logs by field\n */\n public searchByField(field: string, value: string): LogEntry[] {\n const fieldIndex = this.fieldIndices.get(field);\n if (!fieldIndex) return [];\n\n const logIds = fieldIndex.get(value.toLowerCase());\n if (!logIds) return [];\n\n return Array.from(logIds)\n .map((id) => this.index.get(id))\n .filter((log): log is LogEntry => log !== undefined);\n }\n\n /**\n * Get all indexed logs\n */\n public getAllLogs(): LogEntry[] {\n return Array.from(this.index.values());\n }\n\n // Private helper methods\n\n private initializeFieldIndices(): void {\n const fields = ['level', 'appName', 'traceId', 'context', 'environment'];\n for (const field of fields) {\n this.fieldIndices.set(field, new Map());\n }\n }\n\n private updateFieldIndices(logId: string, log: LogEntry): void {\n // Index level\n this.addToFieldIndex('level', log.level, logId);\n\n // Index appName\n if (log.appName) {\n this.addToFieldIndex('appName', log.appName, logId);\n }\n\n // Index traceId\n if (log.traceId) {\n this.addToFieldIndex('traceId', log.traceId, logId);\n }\n\n // Index context\n if (log.context) {\n this.addToFieldIndex('context', log.context, logId);\n }\n\n // Index environment\n if (log.environment) {\n this.addToFieldIndex('environment', log.environment, logId);\n }\n }\n\n private addToFieldIndex(field: string, value: string, logId: string): void {\n const fieldIndex = this.fieldIndices.get(field);\n if (!fieldIndex) return;\n\n const normalizedValue = value.toLowerCase();\n if (!fieldIndex.has(normalizedValue)) {\n fieldIndex.set(normalizedValue, new Set());\n }\n fieldIndex.get(normalizedValue)!.add(logId);\n }\n\n private removeFromFieldIndices(logId: string, log: LogEntry): void {\n const values: Array<[string, string | undefined]> = [\n ['level', log.level],\n ['appName', log.appName],\n ['traceId', log.traceId],\n ['context', log.context],\n ['environment', log.environment],\n ];\n for (const [field, value] of values) {\n if (!value) continue;\n const fieldIndex = this.fieldIndices.get(field);\n const key = value.toLowerCase();\n const logIds = fieldIndex?.get(key);\n if (!logIds) continue;\n logIds.delete(logId);\n if (logIds.size === 0) fieldIndex!.delete(key);\n }\n }\n\n private generateLogId(log: LogEntry): string {\n // eslint-disable-next-line sonarjs/pseudo-random -- non-security log ID suffix\n return `${log.timestamp}_${log.level}_${Math.random().toString(36).slice(2, 11)}`;\n }\n\n private calculateIndexSize(): number {\n // O(1): return the incrementally-maintained running total instead of\n // re-stringifying every entry on each call.\n return this.indexSizeBytes;\n }\n\n /** Insert into the main index and update the running size estimate. */\n private trackInsert(logId: string, log: LogEntry): void {\n // If this id somehow already exists, subtract its old size first.\n const existing = this.logSizeById.get(logId);\n if (existing !== undefined) this.indexSizeBytes -= existing;\n\n const size = stringifyForLog(log).length;\n this.index.set(logId, log);\n this.logSizeById.set(logId, size);\n this.indexSizeBytes += size;\n }\n\n /** Delete from the main index and update the running size estimate. */\n private trackDelete(logId: string): void {\n const size = this.logSizeById.get(logId);\n if (size !== undefined) {\n this.indexSizeBytes -= size;\n this.logSizeById.delete(logId);\n }\n this.index.delete(logId);\n }\n\n private async removeOldestLogs(count: number): Promise<void> {\n // The Map iterates in insertion order, so the first entries are the oldest\n // indexed ones; no sort and no scan of the field indices is needed.\n const oldest: Array<[string, LogEntry]> = [];\n for (const entry of this.index) {\n if (oldest.length >= count) break;\n oldest.push(entry);\n }\n\n for (const [logId, log] of oldest) {\n this.removeFromFieldIndices(logId, log);\n this.trackDelete(logId);\n }\n }\n\n private async clusterLogs(logs: LogEntry[]): Promise<LogCluster[]> {\n // Simple clustering based on log patterns\n const clusters = new Map<string, LogEntry[]>();\n\n for (const log of logs) {\n // Create a pattern key based on level and service\n const patternKey = `${log.level}_${log.appName}`;\n\n if (!clusters.has(patternKey)) {\n clusters.set(patternKey, []);\n }\n clusters.get(patternKey)!.push(log);\n }\n\n // Convert to LogCluster format\n return Array.from(clusters.entries()).map(([pattern, clusterLogs], index) => ({\n id: `cluster_${index}`,\n centroid: [], // Would be calculated in a real implementation\n logs: clusterLogs,\n pattern,\n frequency: clusterLogs.length,\n labels: [pattern],\n }));\n }\n}\n","const STOPWORDS = new Set([\n 'is',\n 'was',\n 'are',\n 'the',\n 'a',\n 'an',\n 'of',\n 'for',\n 'do',\n 'did',\n 'does',\n 'in',\n 'on',\n 'at',\n 'with',\n 'who',\n 'what',\n 'from',\n 'that',\n 'and',\n 'or',\n 'to',\n 'has',\n 'have',\n 'had',\n 'by',\n 'as',\n 'my',\n 'me',\n 'all',\n 'any',\n 'it',\n 'be',\n 'not',\n 'no',\n 'when',\n 'where',\n 'which',\n 'logs',\n]);\n\n// \"user id u42\", \"user id is u42\", \"userId: u42\", \"user_id=u42\"\nconst EXPLICIT = /\\buser[\\s_]?id(?:\\s+is|\\s*[:=])?\\s*[\"']?([\\w-]+)/i;\n// \"user u42\" / \"user 42\": the token must contain a digit\nconst WITH_DIGIT = /\\buser\\s+[\"']?([\\w-]*\\d[\\w-]*)/i;\n\nexport interface UserIdMatch {\n id: string;\n /** Exact span of the query that expressed the id, for removal from free text. */\n span: string;\n}\n\n/**\n * Extract a user id from natural-language text. An id must either contain a digit\n * or follow explicit \"user id\" / \"userId:\" syntax and not be a stopword, so phrases\n * like \"what did user do yesterday\" never produce a filter.\n */\nexport function extractUserId(query: string): UserIdMatch | undefined {\n const explicit = EXPLICIT.exec(query);\n if (explicit?.[1] && !STOPWORDS.has(explicit[1].toLowerCase())) {\n return { id: explicit[1], span: explicit[0] };\n }\n const digit = WITH_DIGIT.exec(query);\n if (digit?.[1]) return { id: digit[1], span: digit[0] };\n return undefined;\n}\n","/**\n * Basic search engine implementation with full-text search and filtering\n */\n\nimport type { LogEntry } from '../../types';\nimport { safeToString } from '../../utils/coerce.utils';\nimport type {\n CorrelatedLogs,\n LogCorrelationSummary,\n ParsedNLQuery,\n RelativeTime,\n SearchFilters,\n SearchHighlight,\n SearchOptions,\n SearchPreset,\n SearchResult,\n SearchStats,\n SearchSuggestion,\n SimilarLog,\n TimelineEvent,\n TimeRange,\n} from '../types';\nimport type { ILogSearchEngine } from './search-engine.interface';\nimport { extractUserId } from './user-id';\n\n/**\n * Basic search engine implementation\n */\nexport class BasicSearchEngine implements ILogSearchEngine {\n private buffer: LogEntry[] = [];\n /** Index of the oldest live entry in `buffer`; evicted entries are dropped in bulk. */\n private head = 0;\n private presets: Map<string, SearchPreset> = new Map();\n private searchHistory: string[] = [];\n private suggestionCache: Map<string, SearchSuggestion[]> = new Map();\n\n constructor(private options?: { maxHistorySize?: number; cacheSize?: number; maxLogs?: number }) {\n this.options = {\n maxHistorySize: 1000,\n cacheSize: 100,\n maxLogs: 100_000,\n ...options,\n };\n }\n\n /** The live logs, oldest first. Compacts away evicted entries on demand. */\n private get logs(): LogEntry[] {\n if (this.head > 0) {\n this.buffer = this.buffer.slice(this.head);\n this.head = 0;\n }\n return this.buffer;\n }\n\n /**\n * Add logs to the search index.\n *\n * Bounded to `maxLogs` (default 100k): the buffer previously grew without\n * limit, leaking memory in any long-running process feeding it logs. When the\n * cap is exceeded the oldest entries are dropped (FIFO). We also append with a\n * loop rather than `push(...logs)` to avoid a RangeError from spreading a very\n * large array onto the call stack.\n */\n public addLogs(logs: LogEntry[]): void {\n for (const log of logs) this.buffer.push(log);\n\n const maxLogs = this.options?.maxLogs ?? 100_000;\n const excess = this.buffer.length - this.head - maxLogs;\n if (excess > 0) {\n // Advance the head instead of splicing: splice(0, n) shifts the whole array\n // on every add once at the cap. The dead prefix is compacted once it is\n // a quarter of the cap, so eviction stays O(1) amortized.\n this.head += excess;\n if (this.head >= Math.max(1, maxLogs / 4)) {\n this.buffer = this.buffer.slice(this.head);\n this.head = 0;\n }\n }\n }\n\n /**\n * Clear all logs from the index\n */\n public clearLogs(): void {\n this.buffer = [];\n this.head = 0;\n }\n\n /**\n * Get all indexed logs\n */\n public getLogs(): LogEntry[] {\n return this.logs;\n }\n\n /**\n * Perform a full-text search across logs\n */\n async search(\n query: string,\n filters?: SearchFilters,\n options?: SearchOptions\n ): Promise<SearchResult[]> {\n // Apply filters first\n const textCache = new Map<LogEntry, string>();\n const filteredLogs = this.applyFilters(this.logs, filters, textCache);\n\n // Perform text search\n const results = this.performTextSearch(filteredLogs, query, options, textCache);\n\n // Add to search history\n this.addToSearchHistory(query);\n\n // Apply sorting\n const sorted = this.applySorting(results, options?.sortBy, options?.sortOrder);\n\n // Apply pagination\n const paginated = this.applyPagination(sorted, options?.offset, options?.limit);\n\n // Add context if requested\n if (options?.includeContext) {\n await this.enrichWithContext(paginated, options.contextSize);\n }\n\n return paginated;\n }\n\n /**\n * Natural language search (basic implementation)\n */\n async naturalLanguageSearch(query: string): Promise<SearchResult[]> {\n const parsed = await this.parseNaturalLanguageQuery(query);\n return this.search(parsed.textQuery ?? parsed.originalQuery, parsed.filters, {\n semanticSearch: true,\n includeContext: true,\n });\n }\n\n /**\n * Find logs correlated by trace ID\n */\n async correlateByTraceId(traceId: string): Promise<CorrelatedLogs> {\n const correlatedLogs = this.logs.filter((log) => log.traceId === traceId);\n\n // Sort by timestamp\n correlatedLogs.sort(\n (a, b) => new Date(a.timestamp).getTime() - new Date(b.timestamp).getTime()\n );\n\n // Build timeline\n const timeline: TimelineEvent[] = correlatedLogs.map((log) => {\n let eventType: TimelineEvent['eventType'] = 'info';\n\n if (log.level === 'error') eventType = 'error';\n else if (log.message.toLowerCase().includes('start')) eventType = 'start';\n else if (\n log.message.toLowerCase().includes('end') ||\n log.message.toLowerCase().includes('complete')\n )\n eventType = 'end';\n else if (log.message.toLowerCase().includes('milestone')) eventType = 'milestone';\n\n return {\n timestamp: new Date(log.timestamp),\n log,\n eventType,\n };\n });\n\n // Generate summary\n const summary: LogCorrelationSummary = {\n totalLogs: correlatedLogs.length,\n errorCount: correlatedLogs.filter((l) => l.level === 'error').length,\n warningCount: correlatedLogs.filter((l) => l.level === 'warn').length,\n services: [...new Set(correlatedLogs.map((l) => l.appName))],\n };\n\n // Calculate duration if we have start and end\n if (timeline.length > 0) {\n const start = timeline[0]!.timestamp.getTime();\n const end = timeline[timeline.length - 1]!.timestamp.getTime();\n summary.duration = end - start;\n }\n\n return {\n traceId,\n correlationKey: traceId,\n logs: correlatedLogs,\n timeline,\n summary,\n };\n }\n\n /**\n * Find similar logs based on content similarity\n */\n async findSimilarLogs(logEntry: LogEntry, limit: number = 10): Promise<SimilarLog[]> {\n const similarities: SimilarLog[] = [];\n\n for (const log of this.logs) {\n if (log === logEntry) continue;\n\n const similarity = this.calculateSimilarity(logEntry, log);\n if (similarity > 0.3) {\n // Threshold for similarity\n similarities.push({\n log,\n similarity,\n matchedPatterns: this.findMatchedPatterns(logEntry, log),\n reason: this.generateSimilarityReason(logEntry, log, similarity),\n });\n }\n }\n\n // Sort by similarity and return top results\n return similarities.sort((a, b) => b.similarity - a.similarity).slice(0, limit);\n }\n\n /**\n * Get search suggestions\n */\n async getSuggestions(partialQuery: string, limit: number = 10): Promise<SearchSuggestion[]> {\n const cacheKey = partialQuery.toLowerCase();\n\n // Check cache\n if (this.suggestionCache.has(cacheKey)) {\n return this.suggestionCache.get(cacheKey)!.slice(0, limit);\n }\n\n const suggestions: SearchSuggestion[] = [];\n\n // Field suggestions\n const fields = ['level', 'appName', 'traceId', 'message', 'timestamp'];\n for (const field of fields) {\n if (field.toLowerCase().includes(partialQuery.toLowerCase())) {\n suggestions.push({\n text: field,\n type: 'field',\n category: 'field',\n });\n }\n }\n\n // Value suggestions from logs\n const values = new Set<string>();\n for (const log of this.logs.slice(-1000)) {\n // Recent logs only\n if (log.level?.toLowerCase().includes(partialQuery.toLowerCase())) {\n values.add(log.level);\n }\n if (log.appName?.toLowerCase().includes(partialQuery.toLowerCase())) {\n values.add(log.appName);\n }\n }\n\n for (const value of values) {\n suggestions.push({\n text: value,\n type: 'value',\n category: 'value',\n });\n }\n\n // History suggestions\n for (const historyItem of this.searchHistory.slice(-50)) {\n if (historyItem.toLowerCase().includes(partialQuery.toLowerCase())) {\n suggestions.push({\n text: historyItem,\n type: 'query_history',\n category: 'history',\n });\n }\n }\n\n // Cache suggestions\n this.suggestionCache.set(cacheKey, suggestions);\n\n // Trim cache if too large\n if (this.suggestionCache.size > (this.options?.cacheSize || 100)) {\n const firstKey = this.suggestionCache.keys().next().value as string | undefined;\n if (firstKey !== undefined) this.suggestionCache.delete(firstKey);\n }\n\n return suggestions.slice(0, limit);\n }\n\n /**\n * Get search statistics\n */\n async getStats(): Promise<SearchStats> {\n return {\n totalResults: this.buffer.length - this.head,\n executionTime: 0,\n indexSize: this.buffer.length - this.head,\n topTerms: this.getTopTerms(),\n };\n }\n\n /**\n * Parse natural language query\n */\n async parseNaturalLanguageQuery(query: string): Promise<ParsedNLQuery> {\n const filters: SearchFilters = {};\n const lowerQuery = query.toLowerCase();\n let remainder = query;\n const consume = (re: RegExp): void => {\n remainder = remainder.replace(re, ' ');\n };\n\n const levels: string[] = [];\n if (/\\berrors?\\b/i.test(query)) levels.push('error');\n if (/\\bwarn(?:ing)?s?\\b/i.test(query)) levels.push('warn');\n if (/\\binfo\\b/i.test(query)) levels.push('info');\n if (levels.length > 0) {\n filters.levels = levels;\n consume(/\\b(?:errors?|warn(?:ing)?s?|info)\\b/gi);\n }\n\n const timeRange = this.extractTimeRange(query);\n if (timeRange) {\n filters.timeRange = timeRange;\n consume(/\\b(?:last|past)\\s+(?:\\d+\\s+)?(?:second|minute|hour|day)s?\\b/gi);\n consume(/\\btoday\\b/gi);\n }\n\n const serviceMatch = query.match(/from\\s+(?:the\\s+)?([\\w-]+)\\s+service/i);\n if (serviceMatch?.[1]) {\n filters.services = [serviceMatch[1]];\n consume(/from\\s+(?:the\\s+)?[\\w-]+\\s+service/gi);\n }\n\n const userMatch = extractUserId(query);\n if (userMatch) {\n filters.userIds = [userMatch.id];\n remainder = remainder.replace(userMatch.span, ' ');\n }\n\n let intent: ParsedNLQuery['intent'] = 'general_search';\n if (lowerQuery.includes('error')) intent = 'find_errors';\n if (lowerQuery.includes('trace') || lowerQuery.includes('request')) intent = 'trace_request';\n if (lowerQuery.includes('user')) intent = 'find_user_activity';\n if (lowerQuery.includes('slow') || lowerQuery.includes('performance'))\n intent = 'performance_analysis';\n\n const textQuery = remainder\n .split(/\\s+/)\n .map(trimPunctuation)\n .filter((w) => w && !NL_FILLER_WORDS.has(w.toLowerCase()))\n .join(' ');\n\n return {\n originalQuery: query,\n textQuery,\n intent,\n entities: [],\n filters,\n confidence: 0.7,\n };\n }\n\n /**\n * Save a search preset\n */\n async savePreset(\n preset: Omit<SearchPreset, 'id' | 'createdAt' | 'updatedAt'>\n ): Promise<SearchPreset> {\n const id = this.generateId();\n const now = new Date();\n\n const fullPreset: SearchPreset = {\n ...preset,\n id,\n createdAt: now,\n updatedAt: now,\n };\n\n this.presets.set(id, fullPreset);\n return fullPreset;\n }\n\n /**\n * Get saved presets\n */\n async getPresets(userId?: string): Promise<SearchPreset[]> {\n const allPresets = Array.from(this.presets.values());\n\n if (userId) {\n return allPresets.filter((p) => p.userId === userId || p.shared);\n }\n\n return allPresets;\n }\n\n /**\n * Delete a preset\n */\n async deletePreset(presetId: string): Promise<void> {\n this.presets.delete(presetId);\n }\n\n // Private helper methods\n\n private applyFilters(\n logs: LogEntry[],\n filters: SearchFilters | undefined,\n textCache: Map<LogEntry, string>\n ): LogEntry[] {\n if (!filters) return logs;\n\n const range = filters.timeRange ? resolveTimeRange(filters.timeRange) : undefined;\n const excludes = (filters.excludePatterns ?? []).filter(Boolean).map((p) => p.toLowerCase());\n\n return logs.filter((log) => {\n // Level filter\n if (filters.levels && !filters.levels.includes(log.level)) {\n return false;\n }\n\n // Service filter\n if (filters.services && !filters.services.includes(log.appName)) {\n return false;\n }\n\n // Trace ID filter\n if (filters.traceIds && log.traceId && !filters.traceIds.includes(log.traceId)) {\n return false;\n }\n\n // Time range filter\n if (range) {\n const logTime = new Date(log.timestamp).getTime();\n if (logTime < range.start) return false;\n if (range.end !== undefined && logTime > range.end) return false;\n }\n\n if (filters.userIds && !matchesAny(extractPayloadId(log, USER_ID_KEYS), filters.userIds)) {\n return false;\n }\n\n if (\n filters.sessionIds &&\n !matchesAny(extractPayloadId(log, SESSION_ID_KEYS), filters.sessionIds)\n ) {\n return false;\n }\n\n if (filters.minSeverity !== undefined && levelSeverity(log.level) < filters.minSeverity) {\n return false;\n }\n\n if (excludes.length > 0) {\n const text = this.lowerSearchableText(log, textCache);\n if (excludes.some((p) => text.includes(p))) return false;\n }\n\n if (filters.customFields) {\n for (const [key, expected] of Object.entries(filters.customFields)) {\n const actual = getPath(log, key);\n if (!fieldMatches(actual === undefined ? getPath(log.payload, key) : actual, expected)) {\n return false;\n }\n }\n }\n\n // Error filter\n if (filters.hasError !== undefined) {\n const hasError = log.level === 'error' || !!log.error;\n if (filters.hasError !== hasError) return false;\n }\n\n // Context filter\n if (filters.contexts && log.context && !filters.contexts.includes(log.context)) {\n return false;\n }\n\n return true;\n });\n }\n\n private performTextSearch(\n logs: LogEntry[],\n query: string,\n options: SearchOptions | undefined,\n textCache: Map<LogEntry, string>\n ): SearchResult[] {\n if (!query) {\n return logs.map((log) => ({ log, score: 1 }));\n }\n\n const queryTerms = query.toLowerCase().split(/\\s+/);\n const results: SearchResult[] = [];\n\n for (const log of logs) {\n const searchableText = this.lowerSearchableText(log, textCache);\n let score = 0;\n const highlights: SearchHighlight[] = [];\n const matchedTerms: string[] = [];\n\n for (const term of queryTerms) {\n if (searchableText.includes(term)) {\n score += 1;\n matchedTerms.push(term);\n }\n }\n\n if (score > 0) {\n // Add highlights if requested\n if (options?.highlightMatches) {\n highlights.push({\n field: 'message',\n fragments: this.getHighlightFragments(log.message, matchedTerms),\n matchedTerms,\n });\n }\n\n const result: { log: typeof log; score: number; highlights?: typeof highlights } = {\n log,\n score: score / queryTerms.length, // Normalize score\n };\n if (highlights.length > 0) result.highlights = highlights;\n results.push(result as Parameters<typeof results.push>[0]);\n }\n }\n\n return results;\n }\n\n private lowerSearchableText(log: LogEntry, cache: Map<LogEntry, string>): string {\n let text = cache.get(log);\n if (text === undefined) {\n text = this.getSearchableText(log).toLowerCase();\n cache.set(log, text);\n }\n return text;\n }\n\n private getSearchableText(log: LogEntry): string {\n // safeToString is circular-safe — a stored log with a cyclic payload (an\n // Express req/res, a DB handle) would otherwise make JSON.stringify throw and\n // crash the ENTIRE search, since this runs for every candidate log.\n const payloadText = log.payload ? safeToString(log.payload) : '';\n return [log.message, log.level, log.appName, log.context, payloadText]\n .filter(Boolean)\n .join(' ');\n }\n\n private getHighlightFragments(text: string, terms: string[]): string[] {\n const fragments: string[] = [];\n const lowerText = text.toLowerCase();\n\n for (const term of terms) {\n const index = lowerText.indexOf(term);\n if (index !== -1) {\n const start = Math.max(0, index - 30);\n const end = Math.min(text.length, index + term.length + 30);\n fragments.push(text.slice(start, end));\n }\n }\n\n return fragments;\n }\n\n private applySorting(\n results: SearchResult[],\n sortBy?: string,\n sortOrder: 'asc' | 'desc' = 'desc'\n ): SearchResult[] {\n const sorted = [...results];\n\n sorted.sort((a, b) => {\n let comparison: number;\n\n switch (sortBy) {\n case 'timestamp':\n comparison = new Date(a.log.timestamp).getTime() - new Date(b.log.timestamp).getTime();\n break;\n case 'level':\n comparison = a.log.level.localeCompare(b.log.level);\n break;\n case 'score':\n case 'relevance':\n default:\n comparison = a.score - b.score;\n break;\n }\n\n return sortOrder === 'asc' ? comparison : -comparison;\n });\n\n return sorted;\n }\n\n private applyPagination(\n results: SearchResult[],\n offset: number = 0,\n limit: number = 100\n ): SearchResult[] {\n return results.slice(offset, offset + limit);\n }\n\n private async enrichWithContext(results: SearchResult[], contextSize: number = 5): Promise<void> {\n for (const result of results) {\n const logIndex = this.logs.indexOf(result.log);\n if (logIndex !== -1) {\n const start = Math.max(0, logIndex - contextSize);\n const end = Math.min(this.logs.length, logIndex + contextSize + 1);\n result.context = this.logs.slice(start, end).filter((l) => l !== result.log);\n }\n }\n }\n\n private calculateSimilarity(log1: LogEntry, log2: LogEntry): number {\n let score = 0;\n let factors = 0;\n\n // Same level\n if (log1.level === log2.level) {\n score += 0.3;\n }\n factors++;\n\n // Same service\n if (log1.appName === log2.appName) {\n score += 0.2;\n }\n factors++;\n\n // Same trace\n if (log1.traceId && log1.traceId === log2.traceId) {\n score += 0.3;\n }\n factors++;\n\n // Message similarity\n const messageSimilarity = this.calculateTextSimilarity(log1.message, log2.message);\n score += messageSimilarity * 0.2;\n factors++;\n\n return score / factors;\n }\n\n private calculateTextSimilarity(text1: string, text2: string): number {\n const words1 = new Set(text1.toLowerCase().split(/\\s+/));\n const words2 = new Set(text2.toLowerCase().split(/\\s+/));\n\n const intersection = new Set([...words1].filter((x) => words2.has(x)));\n const union = new Set([...words1, ...words2]);\n\n return union.size > 0 ? intersection.size / union.size : 0;\n }\n\n private findMatchedPatterns(log1: LogEntry, log2: LogEntry): string[] {\n const patterns: string[] = [];\n\n if (log1.level === log2.level) patterns.push('same_level');\n if (log1.appName === log2.appName) patterns.push('same_service');\n if (log1.traceId === log2.traceId) patterns.push('same_trace');\n if (log1.context === log2.context) patterns.push('same_context');\n\n return patterns;\n }\n\n private generateSimilarityReason(log1: LogEntry, log2: LogEntry, similarity: number): string {\n const reasons: string[] = [];\n\n if (log1.level === log2.level) reasons.push('same log level');\n if (log1.appName === log2.appName) reasons.push('same service');\n if (log1.traceId === log2.traceId) reasons.push('same trace ID');\n\n return reasons.length > 0\n ? `Similar because: ${reasons.join(', ')}`\n : `${Math.round(similarity * 100)}% content similarity`;\n }\n\n private extractTimeRange(query: string): TimeRange | undefined {\n const lowerQuery = query.toLowerCase();\n\n const relativeMatch = lowerQuery.match(\n /\\b(?:last|past)\\s+(?:(\\d+)\\s+)?(seconds?|minutes?|hours?|days?)\\b/\n );\n if (relativeMatch?.[2]) {\n const value = relativeMatch[1] ? Number.parseInt(relativeMatch[1], 10) : 1;\n const unit = `${relativeMatch[2].replace(/s$/, '')}s` as RelativeTime['unit'];\n const relative: RelativeTime = { value, unit };\n return { start: resolveTimeRange({ start: 0, relative }).start, relative };\n }\n\n if (lowerQuery.includes('today')) {\n const today = new Date();\n today.setHours(0, 0, 0, 0);\n return { start: today };\n }\n\n return undefined;\n }\n\n private addToSearchHistory(query: string): void {\n this.searchHistory.push(query);\n\n // Trim history if too large\n const maxSize = this.options?.maxHistorySize || 1000;\n if (this.searchHistory.length > maxSize) {\n this.searchHistory = this.searchHistory.slice(-maxSize);\n }\n }\n\n private getTopTerms(): string[] {\n const termCounts = new Map<string, number>();\n\n for (const log of this.logs.slice(-1000)) {\n const words = log.message.toLowerCase().split(/\\s+/);\n for (const word of words) {\n if (word.length > 3) {\n // Ignore short words\n termCounts.set(word, (termCounts.get(word) || 0) + 1);\n }\n }\n }\n\n return Array.from(termCounts.entries())\n .sort((a, b) => b[1] - a[1])\n .slice(0, 10)\n .map(([term]) => term);\n }\n\n private generateId(): string {\n // eslint-disable-next-line sonarjs/pseudo-random -- non-security preset ID generation\n return `preset_${Date.now()}_${Math.random().toString(36).slice(2, 11)}`;\n }\n}\n\nconst UNIT_MS: Record<RelativeTime['unit'], number> = {\n seconds: 1000,\n minutes: 60_000,\n hours: 3_600_000,\n days: 86_400_000,\n};\n\nconst LEVEL_SEVERITY: Record<string, number> = {\n trace: 0,\n verbose: 1,\n debug: 1,\n info: 2,\n log: 2,\n warn: 3,\n warning: 3,\n error: 4,\n fatal: 5,\n critical: 5,\n};\n\nconst USER_ID_KEYS = ['userId', 'user_id', 'userid'];\nconst SESSION_ID_KEYS = ['sessionId', 'session_id', 'sessionid'];\n\nconst NL_FILLER_WORDS = new Set([\n 'show',\n 'me',\n 'find',\n 'get',\n 'list',\n 'search',\n 'display',\n 'all',\n 'any',\n 'the',\n 'a',\n 'an',\n 'in',\n 'of',\n 'for',\n 'from',\n 'with',\n 'during',\n 'within',\n 'over',\n 'logs',\n 'log',\n 'entries',\n 'entry',\n 'messages',\n 'message',\n 'events',\n 'event',\n 'recent',\n 'and',\n 'only',\n 'please',\n 'last',\n 'past',\n]);\n\n/** Strip leading and trailing non-word characters. */\nfunction trimPunctuation(word: string): string {\n const isWord = (c: string | undefined): boolean => c !== undefined && /\\w/.test(c);\n let start = 0;\n let end = word.length;\n while (start < end && !isWord(word[start])) start++;\n while (end > start && !isWord(word[end - 1])) end--;\n return word.slice(start, end);\n}\n\n/** Severity rank of a level name; higher is more severe. Unknown levels rank as info. */\nfunction levelSeverity(level: unknown): number {\n if (typeof level !== 'string') return LEVEL_SEVERITY['info']!;\n return LEVEL_SEVERITY[level.toLowerCase()] ?? LEVEL_SEVERITY['info']!;\n}\n\nfunction resolveTimeRange(range: TimeRange): { start: number; end: number | undefined } {\n const toMs = (v: Date | number): number => (typeof v === 'number' ? v : v.getTime());\n if (range.relative) {\n const { value, unit } = range.relative;\n return {\n start: Date.now() - value * UNIT_MS[unit],\n end: range.end === undefined ? undefined : toMs(range.end),\n };\n }\n return { start: toMs(range.start), end: range.end === undefined ? undefined : toMs(range.end) };\n}\n\nfunction getPath(obj: unknown, path: string): unknown {\n let cur: unknown = obj;\n for (const part of path.split('.')) {\n if (cur === null || typeof cur !== 'object') return undefined;\n cur = (cur as Record<string, unknown>)[part];\n }\n return cur;\n}\n\nfunction deepEqual(a: unknown, b: unknown): boolean {\n if (a === b) return true;\n if (typeof a !== 'object' || typeof b !== 'object' || a === null || b === null) return false;\n if (Array.isArray(a) !== Array.isArray(b)) return false;\n const ka = Object.keys(a);\n const kb = Object.keys(b);\n if (ka.length !== kb.length) return false;\n return ka.every((k) =>\n deepEqual((a as Record<string, unknown>)[k], (b as Record<string, unknown>)[k])\n );\n}\n\n/**\n * Type-aware equality: primitives by ===, except a numeric string matches a numeric\n * log value; objects and arrays by deep equality. A missing field never matches.\n */\nfunction fieldMatches(actual: unknown, expected: unknown): boolean {\n if (actual === undefined) return false;\n if (typeof actual === 'number' && typeof expected === 'string' && expected.trim() !== '') {\n return Number(expected) === actual;\n }\n return deepEqual(actual, expected);\n}\n\nfunction extractPayloadId(log: LogEntry, keys: string[]): string | undefined {\n const payload = log.payload;\n if (!payload) return undefined;\n for (const key of keys) {\n const v = payload[key];\n if (v !== undefined && v !== null) return String(v);\n }\n return undefined;\n}\n\nfunction matchesAny(value: string | undefined, allowed: string[]): boolean {\n return value !== undefined && allowed.includes(value);\n}\n","/**\n * Correlation engine for finding relationships between log entries\n */\n\nimport type { LogEntry } from '../../types';\nimport type {\n CorrelatedLogs,\n LogCorrelationSummary,\n RelatedLog,\n RelationshipType,\n TimelineEvent,\n} from '../types';\n\n/**\n * Correlation engine for log analysis\n */\nexport class CorrelationEngine {\n constructor(\n private options?: {\n maxCorrelationDistance?: number;\n temporalWindowMs?: number;\n minSimilarityScore?: number;\n }\n ) {\n this.options = {\n maxCorrelationDistance: 100,\n temporalWindowMs: 5 * 60 * 1000, // 5 minutes\n minSimilarityScore: 0.3,\n ...options,\n };\n }\n\n /**\n * Find logs related to a given log entry\n */\n async findRelatedLogs(\n log: LogEntry,\n allLogs: LogEntry[],\n limit: number = 50\n ): Promise<RelatedLog[]> {\n const related: RelatedLog[] = [];\n\n for (const otherLog of allLogs) {\n if (otherLog === log) continue;\n\n const relationships = this.findRelationships(log, otherLog);\n\n for (const relationship of relationships) {\n const score = this.calculateRelationshipScore(relationship, log, otherLog);\n\n if (score > (this.options?.minSimilarityScore || 0.3)) {\n related.push({\n log: otherLog,\n relationship,\n score,\n });\n }\n }\n }\n\n // Deduplicate and sort by score\n const uniqueRelated = this.deduplicateRelatedLogs(related);\n return uniqueRelated.sort((a, b) => b.score - a.score).slice(0, limit);\n }\n\n /**\n * Correlate logs by multiple criteria\n */\n async correlateByMultipleCriteria(\n logs: LogEntry[],\n criteria: {\n traceId?: boolean;\n userId?: boolean;\n sessionId?: boolean;\n temporal?: boolean;\n errorCascade?: boolean;\n }\n ): Promise<Map<string, CorrelatedLogs>> {\n const correlations = new Map<string, CorrelatedLogs>();\n\n // Correlate by trace ID\n if (criteria.traceId) {\n const traceCorrelations = this.correlateByTraceId(logs);\n for (const [key, value] of traceCorrelations) {\n correlations.set(`trace_${key}`, value);\n }\n }\n\n // Correlate by user ID\n if (criteria.userId) {\n const userCorrelations = this.correlateByUserId(logs);\n for (const [key, value] of userCorrelations) {\n correlations.set(`user_${key}`, value);\n }\n }\n\n // Correlate by session ID\n if (criteria.sessionId) {\n const sessionCorrelations = this.correlateBySessionId(logs);\n for (const [key, value] of sessionCorrelations) {\n correlations.set(`session_${key}`, value);\n }\n }\n\n // Correlate by temporal proximity\n if (criteria.temporal) {\n const temporalCorrelations = this.correlateByTemporalProximity(logs);\n for (const [key, value] of temporalCorrelations) {\n correlations.set(`temporal_${key}`, value);\n }\n }\n\n // Correlate error cascades\n if (criteria.errorCascade) {\n const errorCorrelations = this.correlateErrorCascades(logs);\n for (const [key, value] of errorCorrelations) {\n correlations.set(`error_${key}`, value);\n }\n }\n\n return correlations;\n }\n\n /**\n * Build a timeline from correlated logs\n */\n buildTimeline(logs: LogEntry[]): TimelineEvent[] {\n const timeline: TimelineEvent[] = [];\n\n // Sort logs by timestamp\n const sortedLogs = [...logs].sort(\n (a, b) => new Date(a.timestamp).getTime() - new Date(b.timestamp).getTime()\n );\n\n for (let i = 0; i < sortedLogs.length; i++) {\n const log = sortedLogs[i] as LogEntry; // noUncheckedIndexedAccess: guarded by loop condition\n const eventType = this.determineEventType(log, sortedLogs, i);\n\n const event: TimelineEvent = {\n timestamp: new Date(log.timestamp),\n log,\n eventType,\n };\n\n // Calculate duration for start/end events\n if (eventType === 'start' && i < sortedLogs.length - 1) {\n const endEvent = sortedLogs\n .slice(i + 1)\n .find((l) => this.determineEventType(l, sortedLogs, sortedLogs.indexOf(l)) === 'end');\n\n if (endEvent) {\n event.duration =\n new Date(endEvent.timestamp).getTime() - new Date(log.timestamp).getTime();\n }\n }\n\n timeline.push(event);\n }\n\n return timeline;\n }\n\n /**\n * Analyze error cascades\n */\n async analyzeErrorCascade(\n logs: LogEntry[]\n ): Promise<{ rootCause?: LogEntry; cascade: LogEntry[]; impactedServices: string[] }> {\n const errors = logs.filter((log) => log.level === 'error');\n\n if (errors.length === 0) {\n return { cascade: [], impactedServices: [] };\n }\n\n // Find root cause (earliest error)\n const rootCause = errors.reduce((earliest, current) =>\n new Date(current.timestamp) < new Date(earliest.timestamp) ? current : earliest\n );\n\n // Build cascade\n const cascade = this.buildErrorCascade(rootCause, errors);\n\n // Get impacted services\n const impactedServices = [...new Set(cascade.map((log) => log.appName))];\n\n return {\n rootCause,\n cascade,\n impactedServices,\n };\n }\n\n // Private methods\n\n private correlateByTraceId(logs: LogEntry[]): Map<string, CorrelatedLogs> {\n const correlations = new Map<string, LogEntry[]>();\n\n for (const log of logs) {\n if (!log.traceId) continue;\n\n if (!correlations.has(log.traceId)) {\n correlations.set(log.traceId, []);\n }\n correlations.get(log.traceId)!.push(log);\n }\n\n return this.convertToCorrelatedLogs(correlations, 'trace');\n }\n\n private correlateByUserId(logs: LogEntry[]): Map<string, CorrelatedLogs> {\n const correlations = new Map<string, LogEntry[]>();\n\n for (const log of logs) {\n const userId = log.payload?.userId as string | undefined;\n if (!userId) continue;\n\n if (!correlations.has(userId)) {\n correlations.set(userId, []);\n }\n correlations.get(userId)!.push(log);\n }\n\n return this.convertToCorrelatedLogs(correlations, 'user');\n }\n\n private correlateBySessionId(logs: LogEntry[]): Map<string, CorrelatedLogs> {\n const correlations = new Map<string, LogEntry[]>();\n\n for (const log of logs) {\n const sessionId = log.payload?.sessionId as string | undefined;\n if (!sessionId) continue;\n\n if (!correlations.has(sessionId)) {\n correlations.set(sessionId, []);\n }\n correlations.get(sessionId)!.push(log);\n }\n\n return this.convertToCorrelatedLogs(correlations, 'session');\n }\n\n private correlateByTemporalProximity(logs: LogEntry[]): Map<string, CorrelatedLogs> {\n const correlations = new Map<string, LogEntry[]>();\n const sortedLogs = [...logs].sort(\n (a, b) => new Date(a.timestamp).getTime() - new Date(b.timestamp).getTime()\n );\n\n let currentGroup: LogEntry[] = [];\n let groupStartTime: number | null = null;\n\n for (const log of sortedLogs) {\n const logTime = new Date(log.timestamp).getTime();\n\n if (groupStartTime === null) {\n groupStartTime = logTime;\n currentGroup = [log];\n } else if (logTime - groupStartTime <= (this.options?.temporalWindowMs || 300000)) {\n currentGroup.push(log);\n } else {\n // Save current group\n if (currentGroup.length > 1) {\n const groupKey = `${groupStartTime}`;\n correlations.set(groupKey, currentGroup);\n }\n\n // Start new group\n groupStartTime = logTime;\n currentGroup = [log];\n }\n }\n\n // Save last group\n if (currentGroup.length > 1 && groupStartTime !== null) {\n correlations.set(`${groupStartTime}`, currentGroup);\n }\n\n return this.convertToCorrelatedLogs(correlations, 'temporal');\n }\n\n private correlateErrorCascades(logs: LogEntry[]): Map<string, CorrelatedLogs> {\n const correlations = new Map<string, LogEntry[]>();\n const errors = logs.filter((log) => log.level === 'error');\n\n for (const error of errors) {\n const cascade = this.buildErrorCascade(error, logs);\n\n if (cascade.length > 1) {\n const key = `${error.timestamp}_${error.message.slice(0, 20)}`;\n correlations.set(key, cascade);\n }\n }\n\n return this.convertToCorrelatedLogs(correlations, 'error_cascade');\n }\n\n private buildErrorCascade(rootError: LogEntry, allLogs: LogEntry[]): LogEntry[] {\n const cascade: LogEntry[] = [rootError];\n const rootTime = new Date(rootError.timestamp).getTime();\n const windowMs = this.options?.temporalWindowMs || 300000;\n\n // Find related errors within time window\n for (const log of allLogs) {\n if (log === rootError) continue;\n\n const logTime = new Date(log.timestamp).getTime();\n const timeDiff = logTime - rootTime;\n\n if (\n timeDiff > 0 &&\n timeDiff <= windowMs &&\n (log.level === 'error' || log.level === 'warn') &&\n (log.traceId === rootError.traceId || log.appName === rootError.appName)\n ) {\n cascade.push(log);\n }\n }\n\n return cascade.sort(\n (a, b) => new Date(a.timestamp).getTime() - new Date(b.timestamp).getTime()\n );\n }\n\n private findRelationships(log1: LogEntry, log2: LogEntry): RelationshipType[] {\n const relationships: RelationshipType[] = [];\n\n // Same trace\n if (log1.traceId && log1.traceId === log2.traceId) {\n relationships.push('same_trace');\n }\n\n // Same user\n const user1 = log1.payload?.userId;\n const user2 = log2.payload?.userId;\n if (user1 && user1 === user2) {\n relationships.push('same_user');\n }\n\n // Same session\n const session1 = log1.payload?.sessionId;\n const session2 = log2.payload?.sessionId;\n if (session1 && session1 === session2) {\n relationships.push('same_session');\n }\n\n // Temporal proximity\n const time1 = new Date(log1.timestamp).getTime();\n const time2 = new Date(log2.timestamp).getTime();\n if (Math.abs(time1 - time2) <= (this.options?.temporalWindowMs || 300000)) {\n relationships.push('temporal_proximity');\n }\n\n // Error cascade\n if (\n (log1.level === 'error' || log2.level === 'error') &&\n time2 > time1 &&\n time2 - time1 <= (this.options?.temporalWindowMs || 300000)\n ) {\n relationships.push('error_cascade');\n }\n\n // Similar pattern\n if (this.haveSimilarPattern(log1, log2)) {\n relationships.push('similar_pattern');\n }\n\n return relationships;\n }\n\n private calculateRelationshipScore(\n relationship: RelationshipType,\n log1: LogEntry,\n log2: LogEntry\n ): number {\n const weights: Record<RelationshipType, number> = {\n same_trace: 0.9,\n same_user: 0.7,\n same_session: 0.8,\n temporal_proximity: 0.4,\n error_cascade: 0.8,\n similar_pattern: 0.5,\n };\n\n let score = weights[relationship] || 0.3;\n\n // Boost score for same service\n if (log1.appName === log2.appName) {\n score += 0.1;\n }\n\n return Math.min(score, 1.0);\n }\n\n private haveSimilarPattern(log1: LogEntry, log2: LogEntry): boolean {\n const normalized1 = this.normalizeMessage(log1.message);\n const normalized2 = this.normalizeMessage(log2.message);\n\n return normalized1 === normalized2;\n }\n\n private normalizeMessage(message: string): string {\n return message\n .replace(/\\d+/g, '<NUM>')\n .replace(/[a-f0-9-]{36}/gi, '<UUID>')\n .toLowerCase()\n .trim();\n }\n\n private determineEventType(\n log: LogEntry,\n _allLogs: LogEntry[],\n _index: number\n ): TimelineEvent['eventType'] {\n const message = log.message.toLowerCase();\n\n if (message.includes('start') || message.includes('begin') || message.includes('initiated')) {\n return 'start';\n }\n\n if (message.includes('end') || message.includes('complete') || message.includes('finished')) {\n return 'end';\n }\n\n if (log.level === 'error') {\n return 'error';\n }\n\n if (message.includes('milestone') || message.includes('checkpoint')) {\n return 'milestone';\n }\n\n return 'info';\n }\n\n private deduplicateRelatedLogs(related: RelatedLog[]): RelatedLog[] {\n const seen = new Set<LogEntry>();\n const unique: RelatedLog[] = [];\n\n for (const item of related) {\n if (!seen.has(item.log)) {\n seen.add(item.log);\n unique.push(item);\n }\n }\n\n return unique;\n }\n\n private convertToCorrelatedLogs(\n correlations: Map<string, LogEntry[]>,\n type: string\n ): Map<string, CorrelatedLogs> {\n const result = new Map<string, CorrelatedLogs>();\n\n for (const [key, logs] of correlations.entries()) {\n if (logs.length < 2) continue; // Skip single log entries\n\n const timeline = this.buildTimeline(logs);\n const summary = this.generateSummary(logs);\n\n result.set(key, {\n correlationKey: key,\n ...(type === 'trace' ? { traceId: key } : {}),\n logs,\n timeline,\n summary,\n });\n }\n\n return result;\n }\n\n private generateSummary(logs: LogEntry[]): LogCorrelationSummary {\n const errorCount = logs.filter((l) => l.level === 'error').length;\n const warningCount = logs.filter((l) => l.level === 'warn').length;\n const services = [...new Set(logs.map((l) => l.appName))];\n\n // Calculate duration\n let duration: number | undefined;\n if (logs.length > 1) {\n const sorted = [...logs].sort(\n (a, b) => new Date(a.timestamp).getTime() - new Date(b.timestamp).getTime()\n );\n const start = new Date((sorted[0] as LogEntry).timestamp).getTime();\n const end = new Date((sorted[sorted.length - 1] as LogEntry).timestamp).getTime();\n duration = end - start;\n }\n\n return {\n totalLogs: logs.length,\n errorCount,\n warningCount,\n services,\n ...(duration !== undefined ? { duration } : {}),\n };\n }\n}\n","/**\n * Advanced search engine with Natural Language Processing capabilities\n */\n\nimport { BasicSearchEngine } from '../core/basic-search-engine';\nimport { extractUserId } from '../core/user-id';\nimport type {\n EntityType,\n ParsedNLQuery,\n QueryEntity,\n QueryIntent,\n SearchFilters,\n SearchOptions,\n SearchResult,\n TimeRange,\n} from '../types';\n\n/**\n * NLP-enhanced search engine\n */\n// Queries can come from users. The intent and entity patterns are cheap on a sentence\n// but some scale with length squared, so nothing past this many characters is parsed.\nconst MAX_QUERY_LENGTH = 2000;\n\nfunction capQuery(query: string): string {\n return query.length > MAX_QUERY_LENGTH ? query.slice(0, MAX_QUERY_LENGTH) : query;\n}\n\nexport class NLPSearchEngine extends BasicSearchEngine {\n private intentPatterns!: Map<QueryIntent, RegExp[]>;\n private entityPatterns!: Map<EntityType, RegExp>;\n\n constructor(options?: Record<string, unknown>) {\n super(options);\n this.initializePatterns();\n }\n\n /**\n * Enhanced natural language query parsing\n */\n override async parseNaturalLanguageQuery(rawQuery: string): Promise<ParsedNLQuery> {\n const query = capQuery(rawQuery);\n const entities: QueryEntity[] = [];\n const filters: SearchFilters = {};\n\n // Detect intent\n const intent = this.detectIntent(query);\n\n // Extract entities\n const extractedEntities = this.extractEntities(query);\n entities.push(...extractedEntities);\n\n // Build filters from entities\n for (const entity of entities) {\n this.applyEntityToFilter(entity, filters);\n }\n\n // Extract time range\n const timeRange = this.extractAdvancedTimeRange(query);\n if (timeRange) {\n filters.timeRange = timeRange;\n }\n\n // Calculate confidence\n const confidence = this.calculateConfidence(intent, entities, query);\n\n return {\n originalQuery: query,\n intent,\n entities,\n filters,\n ...(timeRange !== undefined ? { timeRange } : {}),\n confidence,\n };\n }\n\n /**\n * Enhanced natural language search\n */\n override async naturalLanguageSearch(rawQuery: string): Promise<SearchResult[]> {\n const query = capQuery(rawQuery);\n const parsed = await this.parseNaturalLanguageQuery(query);\n\n // Adjust search options based on intent\n const options: SearchOptions = this.getOptionsForIntent(parsed.intent);\n\n // Extract clean search query (remove filter terms)\n const cleanQuery = this.extractCleanQuery(query, parsed.entities);\n\n return this.search(cleanQuery, parsed.filters, options);\n }\n\n // Private methods\n\n private initializePatterns(): void {\n // Initialize intent patterns\n this.intentPatterns = new Map([\n [\n 'find_errors',\n [\n /show.*errors?/i,\n /find.*errors?/i,\n /all.*errors?/i,\n /errors?\\s+(?:in|from|for)/i,\n /what.*went wrong/i,\n /failures?/i,\n ],\n ],\n [\n 'trace_request',\n [\n /trace\\s+(?:request|id)/i,\n /follow\\s+request/i,\n /track\\s+request/i,\n /request\\s+(?:flow|path)/i,\n /trace.*across/i,\n ],\n ],\n [\n 'find_user_activity',\n [\n /user\\s+(?:\\w+|id)/i,\n /activity\\s+(?:for|of)\\s+user/i,\n /what\\s+did\\s+user/i,\n /user\\s+journey/i,\n /user\\s+session/i,\n ],\n ],\n [\n 'performance_analysis',\n [\n /slow\\s+(?:queries?|requests?|operations?)/i,\n /performance\\s+issues?/i,\n /latency/i,\n /response\\s+time/i,\n /took\\s+(?:too\\s+)?long/i,\n ],\n ],\n [\n 'time_range_query',\n [\n /(?:in|during|from)\\s+the\\s+last/i,\n /(?:today|yesterday|this\\s+week)/i,\n /between.*and/i,\n /in\\s+the\\s+past/i,\n ],\n ],\n [\n 'correlation',\n [\n /related\\s+to/i,\n /connected\\s+with/i,\n /caused\\s+by/i,\n /before.*happened/i,\n /after.*occurred/i,\n ],\n ],\n ]);\n\n // Initialize entity patterns\n this.entityPatterns = new Map([\n ['level', /(error|warn|warning|info|debug|trace|verbose)/i],\n ['service', /(?:from|in)\\s+(?:the\\s+)?(\\w+)\\s+(?:service|app|application)/i],\n ['trace_id', /trace\\s+(?:id\\s+)?['\"]?([\\w-]+)['\"]?/i],\n ['time', /(?:last|past|previous)\\s+(\\d+)\\s+(second|minute|hour|day|week)s?/i],\n // Anchored at a word start with a bounded run, so a long word can't backtrack quadratically.\n ['error_type', /\\b(\\w{0,64}(?:Error|Exception))\\b/i],\n ]);\n }\n\n private detectIntent(query: string): QueryIntent {\n let maxScore = 0;\n let detectedIntent: QueryIntent = 'general_search';\n\n for (const [intent, patterns] of this.intentPatterns.entries()) {\n let score = 0;\n for (const pattern of patterns) {\n if (pattern.test(query)) {\n score++;\n }\n }\n\n if (score > maxScore) {\n maxScore = score;\n detectedIntent = intent;\n }\n }\n\n return detectedIntent;\n }\n\n private extractEntities(query: string): QueryEntity[] {\n const entities: QueryEntity[] = [];\n\n const userId = extractUserId(query);\n if (userId) entities.push({ type: 'user_id', value: userId.id, confidence: 0.8 });\n\n for (const [type, pattern] of this.entityPatterns.entries()) {\n const matches = query.matchAll(new RegExp(pattern, 'gi'));\n\n for (const match of matches) {\n const value = match[1] || match[0];\n entities.push({\n type,\n value: value.trim(),\n confidence: 0.8,\n });\n }\n }\n\n return entities;\n }\n\n private applyEntityToFilter(entity: QueryEntity, filters: SearchFilters): void {\n switch (entity.type) {\n case 'level':\n if (!filters.levels) filters.levels = [];\n filters.levels.push(entity.value.toLowerCase());\n break;\n\n case 'service':\n if (!filters.services) filters.services = [];\n filters.services.push(entity.value);\n break;\n\n case 'user_id':\n if (!filters.userIds) filters.userIds = [];\n filters.userIds.push(entity.value);\n break;\n\n case 'trace_id':\n if (!filters.traceIds) filters.traceIds = [];\n filters.traceIds.push(entity.value);\n break;\n\n case 'error_type':\n // Could be used for more specific filtering\n break;\n }\n }\n\n private extractAdvancedTimeRange(query: string): TimeRange | undefined {\n const lowerQuery = query.toLowerCase();\n\n // Relative time patterns\n const relativePatterns = [\n { pattern: /last\\s+(\\d+)\\s+second/i, unit: 'seconds' as const },\n { pattern: /last\\s+(\\d+)\\s+minute/i, unit: 'minutes' as const },\n { pattern: /last\\s+(\\d+)\\s+hour/i, unit: 'hours' as const },\n { pattern: /last\\s+(\\d+)\\s+day/i, unit: 'days' as const },\n ];\n\n for (const { pattern, unit } of relativePatterns) {\n const match = query.match(pattern);\n if (match) {\n const value = Number.parseInt(match[1] ?? '0');\n const multiplier = {\n seconds: 1000,\n minutes: 60 * 1000,\n hours: 60 * 60 * 1000,\n days: 24 * 60 * 60 * 1000,\n }[unit];\n\n return {\n start: new Date(Date.now() - value * multiplier),\n relative: { value, unit },\n };\n }\n }\n\n // Named time ranges\n if (lowerQuery.includes('today')) {\n const today = new Date();\n today.setHours(0, 0, 0, 0);\n return { start: today };\n }\n\n if (lowerQuery.includes('yesterday')) {\n const yesterday = new Date();\n yesterday.setDate(yesterday.getDate() - 1);\n yesterday.setHours(0, 0, 0, 0);\n const endOfYesterday = new Date(yesterday);\n endOfYesterday.setHours(23, 59, 59, 999);\n return { start: yesterday, end: endOfYesterday };\n }\n\n if (lowerQuery.includes('this week')) {\n const now = new Date();\n const startOfWeek = new Date(now);\n startOfWeek.setDate(now.getDate() - now.getDay());\n startOfWeek.setHours(0, 0, 0, 0);\n return { start: startOfWeek };\n }\n\n return undefined;\n }\n\n private calculateConfidence(intent: QueryIntent, entities: QueryEntity[], query: string): number {\n let confidence = 0.5; // Base confidence\n\n // Boost confidence for specific intents\n if (intent !== 'general_search') {\n confidence += 0.2;\n }\n\n // Boost for number of entities found\n confidence += Math.min(entities.length * 0.1, 0.3);\n\n // Reduce confidence for very short or very long queries\n const wordCount = query.split(/\\s+/).length;\n if (wordCount < 3 || wordCount > 20) {\n confidence -= 0.1;\n }\n\n return Math.max(0, Math.min(1, confidence));\n }\n\n private getOptionsForIntent(intent: QueryIntent): SearchOptions {\n const baseOptions: SearchOptions = {\n limit: 100,\n highlightMatches: true,\n };\n\n switch (intent) {\n case 'find_errors':\n return {\n ...baseOptions,\n includeContext: true,\n contextSize: 3,\n findSimilar: true,\n };\n\n case 'trace_request':\n return {\n ...baseOptions,\n includeContext: true,\n contextSize: 10,\n correlate: true,\n sortBy: 'timestamp',\n sortOrder: 'asc',\n };\n\n case 'find_user_activity':\n return {\n ...baseOptions,\n includeContext: true,\n sortBy: 'timestamp',\n sortOrder: 'asc',\n limit: 200,\n };\n\n case 'performance_analysis':\n return {\n ...baseOptions,\n includeContext: true,\n contextSize: 5,\n sortBy: 'timestamp',\n };\n\n case 'correlation':\n return {\n ...baseOptions,\n includeContext: true,\n contextSize: 5,\n correlate: true,\n findSimilar: true,\n };\n\n default:\n return baseOptions;\n }\n }\n\n private extractCleanQuery(query: string, entities: QueryEntity[]): string {\n let cleanQuery = query;\n\n // Remove entity text from query\n for (const entity of entities) {\n // Remove common patterns\n cleanQuery = cleanQuery.replace(new RegExp(`\\\\b${entity.value}\\\\b`, 'gi'), '');\n }\n\n // Remove common filter words\n const filterWords = [\n 'show',\n 'find',\n 'get',\n 'all',\n 'from',\n 'in',\n 'the',\n 'for',\n 'with',\n 'last',\n 'past',\n 'today',\n 'yesterday',\n 'service',\n 'user',\n 'trace',\n 'error',\n 'errors',\n ];\n\n for (const word of filterWords) {\n cleanQuery = cleanQuery.replace(new RegExp(`\\\\b${word}\\\\b`, 'gi'), '');\n }\n\n // Clean up extra whitespace\n cleanQuery = cleanQuery.replace(/\\s+/g, ' ').trim();\n\n return cleanQuery || query; // Fall back to original if nothing left\n }\n}\n","/**\n * Pattern recognition engine for detecting and analyzing log patterns\n */\n\nimport type { LogEntry } from '../../types';\nimport type { AnomalyDetection, LogPattern } from '../types';\n\nconst STACK_FRAME_TAIL = /:\\d+:\\d+\\)?$/;\n\n/** True when any line is a real stack frame, e.g. ` at fn (/app/file.js:10:5)`. */\nfunction hasStackFrame(message: string): boolean {\n return message.split('\\n').some((line) => {\n const t = line.trim();\n return t.startsWith('at ') && STACK_FRAME_TAIL.test(t);\n });\n}\n\n/**\n * Pattern recognition engine for log analysis\n */\nexport class PatternRecognitionEngine {\n private patterns: Map<string, LogPattern> = new Map();\n private patternFrequencies: Map<string, number> = new Map();\n\n constructor(\n private options?: {\n minFrequency?: number;\n maxPatterns?: number;\n anomalyThreshold?: number;\n }\n ) {\n this.options = {\n minFrequency: 3,\n maxPatterns: 1000,\n anomalyThreshold: 0.3,\n ...options,\n };\n }\n\n /**\n * Analyze logs and detect patterns\n */\n async analyzePatterns(logs: LogEntry[]): Promise<LogPattern[]> {\n // Extract patterns from log messages\n const messagePatterns = this.extractMessagePatterns(logs);\n\n // Extract error patterns\n const errorPatterns = this.extractErrorPatterns(logs);\n\n // Extract timing patterns\n const timingPatterns = this.extractTimingPatterns(logs);\n\n // Combine all patterns\n const allPatterns = [...messagePatterns, ...errorPatterns, ...timingPatterns];\n\n // Filter by frequency\n const frequentPatterns = allPatterns.filter(\n (p) => p.frequency >= (this.options?.minFrequency || 3)\n );\n\n // Sort by frequency\n frequentPatterns.sort((a, b) => b.frequency - a.frequency);\n\n // Limit number of patterns\n const limitedPatterns = frequentPatterns.slice(0, this.options?.maxPatterns || 1000);\n\n // Store patterns\n for (const pattern of limitedPatterns) {\n this.patterns.set(pattern.id, pattern);\n }\n\n return limitedPatterns;\n }\n\n /**\n * Detect anomalies in logs\n */\n async detectAnomalies(logs: LogEntry[]): Promise<AnomalyDetection[]> {\n const anomalies: AnomalyDetection[] = [];\n\n for (const log of logs) {\n const anomalyScore = await this.calculateAnomalyScore(log);\n\n if (anomalyScore > (this.options?.anomalyThreshold || 0.3)) {\n anomalies.push({\n log,\n anomalyScore,\n reason: this.generateAnomalyReason(log, anomalyScore),\n deviations: this.findDeviations(log),\n });\n }\n }\n\n return anomalies.sort((a, b) => b.anomalyScore - a.anomalyScore);\n }\n\n /**\n * Find patterns matching a log entry\n */\n findMatchingPatterns(log: LogEntry): LogPattern[] {\n const matching: LogPattern[] = [];\n\n for (const pattern of this.patterns.values()) {\n if (this.doesLogMatchPattern(log, pattern)) {\n matching.push(pattern);\n }\n }\n\n return matching;\n }\n\n /**\n * Get all detected patterns\n */\n getPatterns(): LogPattern[] {\n return Array.from(this.patterns.values());\n }\n\n /**\n * Get pattern by ID\n */\n getPattern(patternId: string): LogPattern | undefined {\n return this.patterns.get(patternId);\n }\n\n // Private methods\n\n private extractMessagePatterns(logs: LogEntry[]): LogPattern[] {\n const patternMap = new Map<string, { examples: LogEntry[]; count: number }>();\n\n for (const log of logs) {\n // Normalize message by replacing numbers and IDs\n const normalizedMessage = this.normalizeMessage(log.message);\n\n if (!patternMap.has(normalizedMessage)) {\n patternMap.set(normalizedMessage, { examples: [], count: 0 });\n }\n\n const pattern = patternMap.get(normalizedMessage)!;\n if (pattern.examples.length < 3) {\n pattern.examples.push(log);\n }\n pattern.count++;\n }\n\n // Convert to LogPattern array\n return Array.from(patternMap.entries()).map(([pattern, data], index) => ({\n id: `msg_pattern_${index}`,\n pattern,\n examples: data.examples,\n frequency: data.count,\n lastSeen: data.examples[data.examples.length - 1]?.timestamp\n ? new Date((data.examples[data.examples.length - 1] as (typeof data.examples)[0]).timestamp)\n : new Date(),\n category: 'message',\n }));\n }\n\n private extractErrorPatterns(logs: LogEntry[]): LogPattern[] {\n const errorLogs = logs.filter((log) => log.level === 'error' || log.error);\n this.patternFrequencies.clear();\n const patternMap = new Map<string, { examples: LogEntry[]; count: number }>();\n\n for (const log of errorLogs) {\n const errorPattern = this.extractErrorPattern(log);\n\n if (!patternMap.has(errorPattern)) {\n patternMap.set(errorPattern, { examples: [], count: 0 });\n }\n\n const pattern = patternMap.get(errorPattern)!;\n if (pattern.examples.length < 3) {\n pattern.examples.push(log);\n }\n pattern.count++;\n this.patternFrequencies.set(errorPattern, pattern.count);\n }\n\n return Array.from(patternMap.entries()).map(([pattern, data], index) => ({\n id: `error_pattern_${index}`,\n pattern,\n examples: data.examples,\n frequency: data.count,\n lastSeen: data.examples[data.examples.length - 1]?.timestamp\n ? new Date((data.examples[data.examples.length - 1] as (typeof data.examples)[0]).timestamp)\n : new Date(),\n category: 'error',\n severity: 'high',\n }));\n }\n\n private extractTimingPatterns(logs: LogEntry[]): LogPattern[] {\n const patterns: LogPattern[] = [];\n const hourCounts = new Map<number, number>();\n\n // Analyze temporal patterns\n for (const log of logs) {\n const hour = new Date(log.timestamp).getHours();\n hourCounts.set(hour, (hourCounts.get(hour) || 0) + 1);\n }\n\n // Find peak hours\n const peakHour = Array.from(hourCounts.entries()).sort((a, b) => b[1] - a[1])[0];\n\n if (peakHour) {\n patterns.push({\n id: 'timing_peak',\n pattern: `Peak activity at hour ${peakHour[0]}`,\n examples: logs.slice(0, 3),\n frequency: peakHour[1],\n lastSeen: new Date(),\n category: 'timing',\n });\n }\n\n return patterns;\n }\n\n private normalizeMessage(message: string): string {\n return message\n .replace(/[a-f0-9]{8}-[a-f0-9]{4}-[a-f0-9]{4}-[a-f0-9]{4}-[a-f0-9]{12}/gi, '<UUID>') // Replace UUIDs\n .replace(/[a-f0-9]{32}/gi, '<HASH>') // Replace hashes\n .replace(/\\d+/g, '<NUM>') // Replace numbers\n .replace(/\"[^\"]*\"/g, '<STRING>') // Replace quoted strings\n .replace(/\\b\\w+@\\w+\\.\\w+\\b/g, '<EMAIL>') // Replace emails\n .trim();\n }\n\n private extractErrorPattern(log: LogEntry): string {\n if (log.error) {\n return `${log.error.name}: ${this.normalizeMessage(log.error.message || '')}`;\n }\n return this.normalizeMessage(log.message);\n }\n\n private async calculateAnomalyScore(log: LogEntry): Promise<number> {\n let score = 0;\n\n // Check if log matches known patterns\n const matchingPatterns = this.findMatchingPatterns(log);\n if (matchingPatterns.length === 0) {\n score += 0.3; // Unknown pattern\n }\n\n // Check error frequency\n if (log.level === 'error') {\n const errorPattern = this.extractErrorPattern(log);\n const frequency = this.patternFrequencies.get(errorPattern) || 0;\n if (frequency < 2) {\n score += 0.3; // Rare error\n }\n }\n\n // Check time of day\n const hour = new Date(log.timestamp).getHours();\n if (hour < 6 || hour > 22) {\n score += 0.2; // Off-hours activity\n }\n\n return Math.min(score, 1.0);\n }\n\n private generateAnomalyReason(log: LogEntry, score: number): string {\n const reasons: string[] = [];\n\n if (score > 0.7) {\n reasons.push('Highly unusual log entry');\n } else if (score > 0.5) {\n reasons.push('Moderately unusual log entry');\n } else {\n reasons.push('Slightly unusual log entry');\n }\n\n const matchingPatterns = this.findMatchingPatterns(log);\n if (matchingPatterns.length === 0) {\n reasons.push('does not match any known patterns');\n }\n\n if (log.level === 'error') {\n reasons.push('rare error type');\n }\n\n const hour = new Date(log.timestamp).getHours();\n if (hour < 6 || hour > 22) {\n reasons.push('occurred during off-hours');\n }\n\n return reasons.join(', ');\n }\n\n private findDeviations(log: LogEntry): string[] {\n const deviations: string[] = [];\n\n // Check for missing standard fields\n if (!log.traceId) deviations.push('Missing trace ID');\n if (!log.context) deviations.push('Missing context');\n\n // Check for unusual payload\n if (log.payload && Object.keys(log.payload).length > 20) {\n deviations.push('Unusually large payload');\n }\n\n // Check for stack trace in non-error logs\n if (log.level !== 'error' && hasStackFrame(log.message)) {\n deviations.push('Stack trace in non-error log');\n }\n\n return deviations;\n }\n\n private doesLogMatchPattern(log: LogEntry, pattern: LogPattern): boolean {\n const normalizedMessage = this.normalizeMessage(log.message);\n\n if (pattern.regex) {\n return pattern.regex.test(log.message);\n }\n\n return normalizedMessage === pattern.pattern;\n }\n}\n","/**\n * Main search manager that orchestrates all search capabilities\n */\n\nimport type { LogEntry } from '../types';\nimport { csvField } from '../utils/csv.utils';\nimport { BasicLogIndexer } from './core/basic-log-indexer';\nimport { BasicSearchEngine } from './core/basic-search-engine';\nimport { CorrelationEngine } from './engines/correlation-engine';\nimport { NLPSearchEngine } from './engines/nlp-search-engine';\nimport { PatternRecognitionEngine } from './engines/pattern-recognition-engine';\nimport type {\n AnomalyDetection,\n CorrelatedLogs,\n ExportOptions,\n LogPattern,\n ParsedNLQuery,\n RelatedLog,\n SearchFilters,\n SearchOptions,\n SearchPreset,\n SearchResult,\n SearchStats,\n SearchSuggestion,\n SimilarLog,\n} from './types';\n\n/**\n * Configuration for search manager\n */\nexport interface SearchManagerConfig {\n enableNLP?: boolean;\n enablePatternRecognition?: boolean;\n enableCorrelation?: boolean;\n maxIndexSize?: number;\n autoOptimize?: boolean;\n}\n\n/**\n * Main search manager class\n */\nexport class SearchManager {\n private searchEngine: BasicSearchEngine | NLPSearchEngine;\n private indexer: BasicLogIndexer;\n private patternEngine?: PatternRecognitionEngine;\n private correlationEngine?: CorrelationEngine;\n private config: Required<SearchManagerConfig>;\n\n constructor(config?: SearchManagerConfig) {\n this.config = {\n enableNLP: true,\n enablePatternRecognition: true,\n enableCorrelation: true,\n maxIndexSize: 1000000,\n autoOptimize: true,\n ...config,\n };\n\n // Initialize components\n this.searchEngine = this.config.enableNLP ? new NLPSearchEngine() : new BasicSearchEngine();\n\n this.indexer = new BasicLogIndexer({\n maxIndexSize: this.config.maxIndexSize,\n autoOptimize: this.config.autoOptimize,\n });\n\n if (this.config.enablePatternRecognition) {\n this.patternEngine = new PatternRecognitionEngine();\n }\n\n if (this.config.enableCorrelation) {\n this.correlationEngine = new CorrelationEngine();\n }\n }\n\n /**\n * Index new logs\n */\n async indexLogs(logs: LogEntry[]): Promise<void> {\n await this.indexer.indexBatch(logs);\n this.searchEngine.addLogs(logs);\n\n // Analyze patterns if enabled\n if (this.patternEngine && logs.length > 10) {\n await this.patternEngine.analyzePatterns(logs);\n }\n }\n\n /**\n * Add a single log to the index\n */\n async indexLog(log: LogEntry): Promise<void> {\n await this.indexer.indexLog(log);\n this.searchEngine.addLogs([log]);\n }\n\n /**\n * Perform a search\n */\n async search(\n query: string,\n filters?: SearchFilters,\n options?: SearchOptions\n ): Promise<SearchResult[]> {\n return this.searchEngine.search(query, filters, options);\n }\n\n /**\n * Perform a natural language search\n */\n async naturalLanguageSearch(query: string): Promise<SearchResult[]> {\n return this.searchEngine.naturalLanguageSearch(query);\n }\n\n /**\n * Find logs correlated by trace ID\n */\n async correlateByTraceId(traceId: string): Promise<CorrelatedLogs> {\n return this.searchEngine.correlateByTraceId(traceId);\n }\n\n /**\n * Find similar logs\n */\n async findSimilarLogs(logEntry: LogEntry, limit?: number): Promise<SimilarLog[]> {\n return this.searchEngine.findSimilarLogs(logEntry, limit);\n }\n\n /**\n * Find logs related to a given log\n */\n async findRelatedLogs(log: LogEntry, limit?: number): Promise<RelatedLog[]> {\n if (!this.correlationEngine) {\n throw new Error('Correlation engine not enabled');\n }\n\n const allLogs = this.searchEngine.getLogs();\n return this.correlationEngine.findRelatedLogs(log, allLogs, limit);\n }\n\n /**\n * Get search suggestions\n */\n async getSuggestions(partialQuery: string, limit?: number): Promise<SearchSuggestion[]> {\n return this.searchEngine.getSuggestions(partialQuery, limit);\n }\n\n /**\n * Get search statistics\n */\n async getStats(): Promise<SearchStats> {\n return this.searchEngine.getStats();\n }\n\n /**\n * Parse natural language query\n */\n async parseNaturalLanguageQuery(query: string): Promise<ParsedNLQuery> {\n return this.searchEngine.parseNaturalLanguageQuery(query);\n }\n\n /**\n * Save a search preset\n */\n async savePreset(\n preset: Omit<SearchPreset, 'id' | 'createdAt' | 'updatedAt'>\n ): Promise<SearchPreset> {\n return this.searchEngine.savePreset(preset);\n }\n\n /**\n * Get saved presets\n */\n async getPresets(userId?: string): Promise<SearchPreset[]> {\n return this.searchEngine.getPresets(userId);\n }\n\n /**\n * Delete a preset\n */\n async deletePreset(presetId: string): Promise<void> {\n return this.searchEngine.deletePreset(presetId);\n }\n\n /**\n * Detect log patterns\n */\n async detectPatterns(): Promise<LogPattern[]> {\n if (!this.patternEngine) {\n throw new Error('Pattern recognition not enabled');\n }\n\n const allLogs = this.searchEngine.getLogs();\n return this.patternEngine.analyzePatterns(allLogs);\n }\n\n /**\n * Get detected patterns\n */\n getPatterns(): LogPattern[] {\n if (!this.patternEngine) {\n return [];\n }\n\n return this.patternEngine.getPatterns();\n }\n\n /**\n * Detect anomalies in logs\n */\n async detectAnomalies(): Promise<AnomalyDetection[]> {\n if (!this.patternEngine) {\n throw new Error('Pattern recognition not enabled');\n }\n\n const allLogs = this.searchEngine.getLogs();\n return this.patternEngine.detectAnomalies(allLogs);\n }\n\n /**\n * Correlate logs by multiple criteria\n */\n async correlateByMultipleCriteria(criteria: {\n traceId?: boolean;\n userId?: boolean;\n sessionId?: boolean;\n temporal?: boolean;\n errorCascade?: boolean;\n }): Promise<Map<string, CorrelatedLogs>> {\n if (!this.correlationEngine) {\n throw new Error('Correlation engine not enabled');\n }\n\n const allLogs = this.searchEngine.getLogs();\n return this.correlationEngine.correlateByMultipleCriteria(allLogs, criteria);\n }\n\n /**\n * Analyze error cascades\n */\n async analyzeErrorCascade(traceId: string): Promise<{\n rootCause?: LogEntry;\n cascade: LogEntry[];\n impactedServices: string[];\n }> {\n if (!this.correlationEngine) {\n throw new Error('Correlation engine not enabled');\n }\n\n const correlated = await this.correlateByTraceId(traceId);\n return this.correlationEngine.analyzeErrorCascade(correlated.logs);\n }\n\n /**\n * Export search results\n */\n async exportResults(results: SearchResult[], options: ExportOptions): Promise<string> {\n switch (options.format) {\n case 'json':\n return this.exportAsJSON(results, options);\n case 'csv':\n return this.exportAsCSV(results, options);\n case 'text':\n return this.exportAsText(results, options);\n default:\n throw new Error(`Unsupported export format: ${options.format}`);\n }\n }\n\n /**\n * Clear all indexed data\n */\n async clearIndex(): Promise<void> {\n await this.indexer.clearIndex();\n this.searchEngine.clearLogs();\n }\n\n /**\n * Optimize the index\n */\n async optimizeIndex(): Promise<void> {\n await this.indexer.optimizeIndex();\n }\n\n /**\n * Get index statistics\n */\n async getIndexStats(): Promise<{\n totalDocuments: number;\n indexSize: number;\n lastOptimized?: Date;\n }> {\n return this.indexer.getIndexStats();\n }\n\n /**\n * Remove old logs\n */\n async removeOldLogs(olderThan: Date): Promise<number> {\n const removed = await this.indexer.removeOldLogs(olderThan);\n\n // Also remove from search engine\n const allLogs = this.searchEngine.getLogs();\n const filteredLogs = allLogs.filter((log) => new Date(log.timestamp) >= olderThan);\n\n this.searchEngine.clearLogs();\n this.searchEngine.addLogs(filteredLogs);\n\n return removed;\n }\n\n // Private export methods\n\n private exportAsJSON(results: SearchResult[], options: ExportOptions): string {\n const data = options.includeMetadata ? results : results.map((r) => r.log);\n\n if (options.fields) {\n return JSON.stringify(\n data.map((item) => this.filterFields(item, options.fields!)),\n null,\n 2\n );\n }\n\n return JSON.stringify(data, null, 2);\n }\n\n private exportAsCSV(results: SearchResult[], options: ExportOptions): string {\n const logs = results.map((r) => r.log);\n\n if (logs.length === 0) {\n return '';\n }\n\n const fields = options.fields || ['timestamp', 'level', 'appName', 'message'];\n const headers = fields.map((f) => csvField(f)).join(',');\n\n const rows = logs.map((log) => {\n return fields\n .map((field) => {\n const value = (log as unknown as Record<string, unknown>)[field];\n return csvField(value);\n })\n .join(',');\n });\n\n return [headers, ...rows].join('\\n');\n }\n\n private exportAsText(results: SearchResult[], options: ExportOptions): string {\n return results\n .map((result) => {\n const log = result.log;\n let text = `[${log.timestamp}] [${log.level.toUpperCase()}] ${log.appName}: ${log.message}`;\n\n if (options.includeMetadata) {\n text += `\\n Score: ${result.score.toFixed(2)}`;\n if (result.highlights) {\n text += `\\n Matches: ${result.highlights.length}`;\n }\n }\n\n return text;\n })\n .join('\\n\\n');\n }\n\n private filterFields(obj: unknown, fields: string[]): Record<string, unknown> {\n const filtered: Record<string, unknown> = {};\n\n for (const field of fields) {\n if (obj !== null && typeof obj === 'object' && field in obj) {\n filtered[field] = (obj as Record<string, unknown>)[field];\n } else if (field.includes('.')) {\n // Handle nested fields\n const value = this.getNestedValue(obj, field);\n if (value !== undefined) {\n filtered[field] = value;\n }\n }\n }\n\n return filtered;\n }\n\n private getNestedValue(obj: unknown, path: string): unknown {\n return path.split('.').reduce((current: unknown, key) => {\n if (current !== null && typeof current === 'object') {\n return (current as Record<string, unknown>)[key];\n }\n // Not an object — path lookup stops here\n return current;\n }, obj);\n }\n}\n"],"mappings":";;;;;;AAYA,IAAa,kBAAb,MAAoD;CAgBxC;CAfV,wBAAuC,IAAI,IAAI;CAC/C,+BAA8D,IAAI,IAAI;CACtE;CACA;;;;;;;;CAQA,iBAAyB;CACzB,8BAA+B,IAAI,IAAoB;CAEvD,YACE,SAKA;EALQ,KAAA,UAAA;EAMR,KAAK,UAAU;GACb,cAAc;GACd,cAAc;GACd,mBAAmB;GACnB,GAAG;EACL;EAGA,KAAK,uBAAuB;CAC9B;;;;CAKA,MAAM,SAAS,KAA8B;;EAC3C,MAAM,QAAQ,KAAK,cAAc,GAAG;EAGpC,KAAK,YAAY,OAAO,GAAG;EAG3B,KAAK,mBAAmB,OAAO,GAAG;EAGlC,MAAA,gBACE,KAAK,aAAA,QAAA,kBAAA,KAAA,IAAA,KAAA,IAAA,cAAS,iBACd,KAAK,MAAM,QAAQ,KAAK,QAAQ,qBAAqB,SAAW,GAEhE,MAAM,KAAK,cAAc;EAI3B,IAAI,KAAK,MAAM,UAAA,iBAAQ,KAAK,aAAA,QAAA,mBAAA,KAAA,IAAA,KAAA,IAAA,eAAS,iBAAgB,MAAU;;GAC7D,MAAM,KAAK,iBAAiB,KAAK,SAAA,iBAAO,KAAK,aAAA,QAAA,mBAAA,KAAA,IAAA,KAAA,IAAA,eAAS,iBAAgB,OAAW,EAAG,CAAC;EACvF;CACF;;;;CAKA,MAAM,WAAW,MAAiC;;EAChD,KAAK,MAAM,OAAO,MAAM;GACtB,MAAM,QAAQ,KAAK,cAAc,GAAG;GACpC,KAAK,YAAY,OAAO,GAAG;GAC3B,KAAK,mBAAmB,OAAO,GAAG;EACpC;EAGA,KAAA,iBAAI,KAAK,aAAA,QAAA,mBAAA,KAAA,IAAA,KAAA,IAAA,eAAS,cAChB,MAAM,KAAK,cAAc;CAE7B;;;;CAKA,MAAM,mBAAmB,MAA0C;EAEjE,MAAM,WAAW,MAAM,KAAK,YAAY,IAAI;EAE5C,KAAK,gBAAgB;GACnB,SAAS;GACT,cAAc,KAAK;GACnB,6BAAa,IAAI,KAAK;GACtB;EACF;EAEA,OAAO,KAAK;CACd;;;;CAKA,MAAM,wBAAwB,eAA6C;EAEzE,MAAM,2BAAW,IAAI,IAAoB;EAEzC,KAAK,MAAM,SAAS,eAAe;GACjC,MAAM,kBAAkB,MAAM,MAAM,YAAY,CAAC,CAAC,KAAK;GACvD,SAAS,IAAI,kBAAkB,SAAS,IAAI,eAAe,KAAK,KAAK,CAAC;EACxE;CAIF;;;;CAKA,MAAM,gBAA+B;EAEnC,KAAK,aAAa,MAAM;EACxB,KAAK,uBAAuB;EAE5B,KAAK,MAAM,CAAC,OAAO,QAAQ,KAAK,MAAM,QAAQ,GAC5C,KAAK,mBAAmB,OAAO,GAAG;EAGpC,KAAK,gCAAgB,IAAI,KAAK;CAChC;;;;CAKA,MAAM,aAA4B;EAChC,KAAK,MAAM,MAAM;EACjB,KAAK,aAAa,MAAM;EACxB,KAAK,gBAAgB,KAAA;EACrB,KAAK,iBAAiB;EACtB,KAAK,YAAY,MAAM;EACvB,KAAK,uBAAuB;CAC9B;;;;CAKA,MAAM,gBAIH;EACD,OAAO;GACL,gBAAgB,KAAK,MAAM;GAC3B,WAAW,KAAK,mBAAmB;GACnC,GAAI,KAAK,kBAAkB,KAAA,IAAY,EAAE,eAAe,KAAK,cAAc,IAAI,CAAC;EAClF;CACF;;;;CAKA,MAAM,cAAc,WAAkC;EACpD,MAAM,aAAa,UAAU,QAAQ;EACrC,IAAI,eAAe;EAEnB,KAAK,MAAM,CAAC,OAAO,QAAQ,KAAK,MAAM,QAAQ,GAE5C,IADgB,IAAI,KAAK,IAAI,SAAS,CAAC,CAAC,QAC9B,IAAI,YAAY;GACxB,KAAK,uBAAuB,OAAO,GAAG;GACtC,KAAK,YAAY,KAAK;GACtB;EACF;EAGF,OAAO;CACT;;;;CAKA,cAAqB,OAAe,OAA2B;EAC7D,MAAM,aAAa,KAAK,aAAa,IAAI,KAAK;EAC9C,IAAI,CAAC,YAAY,OAAO,CAAC;EAEzB,MAAM,SAAS,WAAW,IAAI,MAAM,YAAY,CAAC;EACjD,IAAI,CAAC,QAAQ,OAAO,CAAC;EAErB,OAAO,MAAM,KAAK,MAAM,CAAC,CACtB,KAAK,OAAO,KAAK,MAAM,IAAI,EAAE,CAAC,CAAC,CAC/B,QAAQ,QAAyB,QAAQ,KAAA,CAAS;CACvD;;;;CAKA,aAAgC;EAC9B,OAAO,MAAM,KAAK,KAAK,MAAM,OAAO,CAAC;CACvC;CAIA,yBAAuC;EAErC,KAAK,MAAM,SAAS;GADJ;GAAS;GAAW;GAAW;GAAW;EACjC,GACvB,KAAK,aAAa,IAAI,uBAAO,IAAI,IAAI,CAAC;CAE1C;CAEA,mBAA2B,OAAe,KAAqB;EAE7D,KAAK,gBAAgB,SAAS,IAAI,OAAO,KAAK;EAG9C,IAAI,IAAI,SACN,KAAK,gBAAgB,WAAW,IAAI,SAAS,KAAK;EAIpD,IAAI,IAAI,SACN,KAAK,gBAAgB,WAAW,IAAI,SAAS,KAAK;EAIpD,IAAI,IAAI,SACN,KAAK,gBAAgB,WAAW,IAAI,SAAS,KAAK;EAIpD,IAAI,IAAI,aACN,KAAK,gBAAgB,eAAe,IAAI,aAAa,KAAK;CAE9D;CAEA,gBAAwB,OAAe,OAAe,OAAqB;EACzE,MAAM,aAAa,KAAK,aAAa,IAAI,KAAK;EAC9C,IAAI,CAAC,YAAY;EAEjB,MAAM,kBAAkB,MAAM,YAAY;EAC1C,IAAI,CAAC,WAAW,IAAI,eAAe,GACjC,WAAW,IAAI,iCAAiB,IAAI,IAAI,CAAC;EAE3C,WAAW,IAAI,eAAe,CAAC,CAAE,IAAI,KAAK;CAC5C;CAEA,uBAA+B,OAAe,KAAqB;EACjE,MAAM,SAA8C;GAClD,CAAC,SAAS,IAAI,KAAK;GACnB,CAAC,WAAW,IAAI,OAAO;GACvB,CAAC,WAAW,IAAI,OAAO;GACvB,CAAC,WAAW,IAAI,OAAO;GACvB,CAAC,eAAe,IAAI,WAAW;EACjC;EACA,KAAK,MAAM,CAAC,OAAO,UAAU,QAAQ;GACnC,IAAI,CAAC,OAAO;GACZ,MAAM,aAAa,KAAK,aAAa,IAAI,KAAK;GAC9C,MAAM,MAAM,MAAM,YAAY;GAC9B,MAAM,SAAA,eAAA,QAAA,eAAA,KAAA,IAAA,KAAA,IAAS,WAAY,IAAI,GAAG;GAClC,IAAI,CAAC,QAAQ;GACb,OAAO,OAAO,KAAK;GACnB,IAAI,OAAO,SAAS,GAAG,WAAY,OAAO,GAAG;EAC/C;CACF;CAEA,cAAsB,KAAuB;EAE3C,OAAO,GAAG,IAAI,UAAU,GAAG,IAAI,MAAM,GAAG,KAAK,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,MAAM,GAAG,EAAE;CAChF;CAEA,qBAAqC;EAGnC,OAAO,KAAK;CACd;;CAGA,YAAoB,OAAe,KAAqB;EAEtD,MAAM,WAAW,KAAK,YAAY,IAAI,KAAK;EAC3C,IAAI,aAAa,KAAA,GAAW,KAAK,kBAAkB;EAEnD,MAAM,OAAO,gBAAgB,GAAG,CAAC,CAAC;EAClC,KAAK,MAAM,IAAI,OAAO,GAAG;EACzB,KAAK,YAAY,IAAI,OAAO,IAAI;EAChC,KAAK,kBAAkB;CACzB;;CAGA,YAAoB,OAAqB;EACvC,MAAM,OAAO,KAAK,YAAY,IAAI,KAAK;EACvC,IAAI,SAAS,KAAA,GAAW;GACtB,KAAK,kBAAkB;GACvB,KAAK,YAAY,OAAO,KAAK;EAC/B;EACA,KAAK,MAAM,OAAO,KAAK;CACzB;CAEA,MAAc,iBAAiB,OAA8B;EAG3D,MAAM,SAAoC,CAAC;EAC3C,KAAK,MAAM,SAAS,KAAK,OAAO;GAC9B,IAAI,OAAO,UAAU,OAAO;GAC5B,OAAO,KAAK,KAAK;EACnB;EAEA,KAAK,MAAM,CAAC,OAAO,QAAQ,QAAQ;GACjC,KAAK,uBAAuB,OAAO,GAAG;GACtC,KAAK,YAAY,KAAK;EACxB;CACF;CAEA,MAAc,YAAY,MAAyC;EAEjE,MAAM,2BAAW,IAAI,IAAwB;EAE7C,KAAK,MAAM,OAAO,MAAM;GAEtB,MAAM,aAAa,GAAG,IAAI,MAAM,GAAG,IAAI;GAEvC,IAAI,CAAC,SAAS,IAAI,UAAU,GAC1B,SAAS,IAAI,YAAY,CAAC,CAAC;GAE7B,SAAS,IAAI,UAAU,CAAC,CAAE,KAAK,GAAG;EACpC;EAGA,OAAO,MAAM,KAAK,SAAS,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,cAAc,WAAW;GAC5E,IAAI,WAAW;GACf,UAAU,CAAC;GACX,MAAM;GACN;GACA,WAAW,YAAY;GACvB,QAAQ,CAAC,OAAO;EAClB,EAAE;CACJ;AACF;;ACnVA,MAAM,4BAAY,IAAI,IAAI;CACxB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;AAGD,MAAM,WAAW;AAEjB,MAAM,aAAa;;;;;;AAanB,SAAgB,cAAc,OAAwC;CACpE,MAAM,WAAW,SAAS,KAAK,KAAK;CACpC,KAAA,aAAA,QAAA,aAAA,KAAA,IAAA,KAAA,IAAI,SAAW,OAAM,CAAC,UAAU,IAAI,SAAS,EAAE,CAAC,YAAY,CAAC,GAC3D,OAAO;EAAE,IAAI,SAAS;EAAI,MAAM,SAAS;CAAG;CAE9C,MAAM,QAAQ,WAAW,KAAK,KAAK;CACnC,IAAA,UAAA,QAAA,UAAA,KAAA,IAAA,KAAA,IAAI,MAAQ,IAAI,OAAO;EAAE,IAAI,MAAM;EAAI,MAAM,MAAM;CAAG;AAExD;;;;;ACtCA,IAAa,oBAAb,MAA2D;CAQrC;CAPpB,SAA6B,CAAC;;CAE9B,OAAe;CACf,0BAA6C,IAAI,IAAI;CACrD,gBAAkC,CAAC;CACnC,kCAA2D,IAAI,IAAI;CAEnE,YAAY,SAAqF;EAA7E,KAAA,UAAA;EAClB,KAAK,UAAU;GACb,gBAAgB;GAChB,WAAW;GACX,SAAS;GACT,GAAG;EACL;CACF;;CAGA,IAAY,OAAmB;EAC7B,IAAI,KAAK,OAAO,GAAG;GACjB,KAAK,SAAS,KAAK,OAAO,MAAM,KAAK,IAAI;GACzC,KAAK,OAAO;EACd;EACA,OAAO,KAAK;CACd;;;;;;;;;;CAWA,QAAe,MAAwB;;EACrC,KAAK,MAAM,OAAO,MAAM,KAAK,OAAO,KAAK,GAAG;EAE5C,MAAM,YAAA,gBAAU,KAAK,aAAA,QAAA,kBAAA,KAAA,IAAA,KAAA,IAAA,cAAS,YAAW;EACzC,MAAM,SAAS,KAAK,OAAO,SAAS,KAAK,OAAO;EAChD,IAAI,SAAS,GAAG;GAId,KAAK,QAAQ;GACb,IAAI,KAAK,QAAQ,KAAK,IAAI,GAAG,UAAU,CAAC,GAAG;IACzC,KAAK,SAAS,KAAK,OAAO,MAAM,KAAK,IAAI;IACzC,KAAK,OAAO;GACd;EACF;CACF;;;;CAKA,YAAyB;EACvB,KAAK,SAAS,CAAC;EACf,KAAK,OAAO;CACd;;;;CAKA,UAA6B;EAC3B,OAAO,KAAK;CACd;;;;CAKA,MAAM,OACJ,OACA,SACA,SACyB;EAEzB,MAAM,4BAAY,IAAI,IAAsB;EAC5C,MAAM,eAAe,KAAK,aAAa,KAAK,MAAM,SAAS,SAAS;EAGpE,MAAM,UAAU,KAAK,kBAAkB,cAAc,OAAO,SAAS,SAAS;EAG9E,KAAK,mBAAmB,KAAK;EAG7B,MAAM,SAAS,KAAK,aAAa,SAAA,YAAA,QAAA,YAAA,KAAA,IAAA,KAAA,IAAS,QAAS,QAAA,YAAA,QAAA,YAAA,KAAA,IAAA,KAAA,IAAQ,QAAS,SAAS;EAG7E,MAAM,YAAY,KAAK,gBAAgB,QAAA,YAAA,QAAA,YAAA,KAAA,IAAA,KAAA,IAAQ,QAAS,QAAA,YAAA,QAAA,YAAA,KAAA,IAAA,KAAA,IAAQ,QAAS,KAAK;EAG9E,IAAA,YAAA,QAAA,YAAA,KAAA,IAAA,KAAA,IAAI,QAAS,gBACX,MAAM,KAAK,kBAAkB,WAAW,QAAQ,WAAW;EAG7D,OAAO;CACT;;;;CAKA,MAAM,sBAAsB,OAAwC;EAClE,MAAM,SAAS,MAAM,KAAK,0BAA0B,KAAK;EACzD,OAAO,KAAK,OAAO,OAAO,aAAa,OAAO,eAAe,OAAO,SAAS;GAC3E,gBAAgB;GAChB,gBAAgB;EAClB,CAAC;CACH;;;;CAKA,MAAM,mBAAmB,SAA0C;EACjE,MAAM,iBAAiB,KAAK,KAAK,QAAQ,QAAQ,IAAI,YAAY,OAAO;EAGxE,eAAe,MACZ,GAAG,MAAM,IAAI,KAAK,EAAE,SAAS,CAAC,CAAC,QAAQ,IAAI,IAAI,KAAK,EAAE,SAAS,CAAC,CAAC,QAAQ,CAC5E;EAGA,MAAM,WAA4B,eAAe,KAAK,QAAQ;GAC5D,IAAI,YAAwC;GAE5C,IAAI,IAAI,UAAU,SAAS,YAAY;QAClC,IAAI,IAAI,QAAQ,YAAY,CAAC,CAAC,SAAS,OAAO,GAAG,YAAY;QAC7D,IACH,IAAI,QAAQ,YAAY,CAAC,CAAC,SAAS,KAAK,KACxC,IAAI,QAAQ,YAAY,CAAC,CAAC,SAAS,UAAU,GAE7C,YAAY;QACT,IAAI,IAAI,QAAQ,YAAY,CAAC,CAAC,SAAS,WAAW,GAAG,YAAY;GAEtE,OAAO;IACL,WAAW,IAAI,KAAK,IAAI,SAAS;IACjC;IACA;GACF;EACF,CAAC;EAGD,MAAM,UAAiC;GACrC,WAAW,eAAe;GAC1B,YAAY,eAAe,QAAQ,MAAM,EAAE,UAAU,OAAO,CAAC,CAAC;GAC9D,cAAc,eAAe,QAAQ,MAAM,EAAE,UAAU,MAAM,CAAC,CAAC;GAC/D,UAAU,CAAC,GAAG,IAAI,IAAI,eAAe,KAAK,MAAM,EAAE,OAAO,CAAC,CAAC;EAC7D;EAGA,IAAI,SAAS,SAAS,GAAG;GACvB,MAAM,QAAQ,SAAS,EAAE,CAAE,UAAU,QAAQ;GAE7C,QAAQ,WADI,SAAS,SAAS,SAAS,EAAE,CAAE,UAAU,QAChC,IAAI;EAC3B;EAEA,OAAO;GACL;GACA,gBAAgB;GAChB,MAAM;GACN;GACA;EACF;CACF;;;;CAKA,MAAM,gBAAgB,UAAoB,QAAgB,IAA2B;EACnF,MAAM,eAA6B,CAAC;EAEpC,KAAK,MAAM,OAAO,KAAK,MAAM;GAC3B,IAAI,QAAQ,UAAU;GAEtB,MAAM,aAAa,KAAK,oBAAoB,UAAU,GAAG;GACzD,IAAI,aAAa,IAEf,aAAa,KAAK;IAChB;IACA;IACA,iBAAiB,KAAK,oBAAoB,UAAU,GAAG;IACvD,QAAQ,KAAK,yBAAyB,UAAU,KAAK,UAAU;GACjE,CAAC;EAEL;EAGA,OAAO,aAAa,MAAM,GAAG,MAAM,EAAE,aAAa,EAAE,UAAU,CAAC,CAAC,MAAM,GAAG,KAAK;CAChF;;;;CAKA,MAAM,eAAe,cAAsB,QAAgB,IAAiC;;EAC1F,MAAM,WAAW,aAAa,YAAY;EAG1C,IAAI,KAAK,gBAAgB,IAAI,QAAQ,GACnC,OAAO,KAAK,gBAAgB,IAAI,QAAQ,CAAC,CAAE,MAAM,GAAG,KAAK;EAG3D,MAAM,cAAkC,CAAC;EAIzC,KAAK,MAAM,SAAS;GADJ;GAAS;GAAW;GAAW;GAAW;EACjC,GACvB,IAAI,MAAM,YAAY,CAAC,CAAC,SAAS,aAAa,YAAY,CAAC,GACzD,YAAY,KAAK;GACf,MAAM;GACN,MAAM;GACN,UAAU;EACZ,CAAC;EAKL,MAAM,yBAAS,IAAI,IAAY;EAC/B,KAAK,MAAM,OAAO,KAAK,KAAK,MAAM,IAAK,GAAG;;GAExC,KAAA,aAAI,IAAI,WAAA,QAAA,eAAA,KAAA,IAAA,KAAA,IAAA,WAAO,YAAY,CAAC,CAAC,SAAS,aAAa,YAAY,CAAC,GAC9D,OAAO,IAAI,IAAI,KAAK;GAEtB,KAAA,eAAI,IAAI,aAAA,QAAA,iBAAA,KAAA,IAAA,KAAA,IAAA,aAAS,YAAY,CAAC,CAAC,SAAS,aAAa,YAAY,CAAC,GAChE,OAAO,IAAI,IAAI,OAAO;EAE1B;EAEA,KAAK,MAAM,SAAS,QAClB,YAAY,KAAK;GACf,MAAM;GACN,MAAM;GACN,UAAU;EACZ,CAAC;EAIH,KAAK,MAAM,eAAe,KAAK,cAAc,MAAM,GAAG,GACpD,IAAI,YAAY,YAAY,CAAC,CAAC,SAAS,aAAa,YAAY,CAAC,GAC/D,YAAY,KAAK;GACf,MAAM;GACN,MAAM;GACN,UAAU;EACZ,CAAC;EAKL,KAAK,gBAAgB,IAAI,UAAU,WAAW;EAG9C,IAAI,KAAK,gBAAgB,UAAA,iBAAQ,KAAK,aAAA,QAAA,mBAAA,KAAA,IAAA,KAAA,IAAA,eAAS,cAAa,MAAM;GAChE,MAAM,WAAW,KAAK,gBAAgB,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC;GACpD,IAAI,aAAa,KAAA,GAAW,KAAK,gBAAgB,OAAO,QAAQ;EAClE;EAEA,OAAO,YAAY,MAAM,GAAG,KAAK;CACnC;;;;CAKA,MAAM,WAAiC;EACrC,OAAO;GACL,cAAc,KAAK,OAAO,SAAS,KAAK;GACxC,eAAe;GACf,WAAW,KAAK,OAAO,SAAS,KAAK;GACrC,UAAU,KAAK,YAAY;EAC7B;CACF;;;;CAKA,MAAM,0BAA0B,OAAuC;EACrE,MAAM,UAAyB,CAAC;EAChC,MAAM,aAAa,MAAM,YAAY;EACrC,IAAI,YAAY;EAChB,MAAM,WAAW,OAAqB;GACpC,YAAY,UAAU,QAAQ,IAAI,GAAG;EACvC;EAEA,MAAM,SAAmB,CAAC;EAC1B,IAAI,eAAe,KAAK,KAAK,GAAG,OAAO,KAAK,OAAO;EACnD,IAAI,sBAAsB,KAAK,KAAK,GAAG,OAAO,KAAK,MAAM;EACzD,IAAI,YAAY,KAAK,KAAK,GAAG,OAAO,KAAK,MAAM;EAC/C,IAAI,OAAO,SAAS,GAAG;GACrB,QAAQ,SAAS;GACjB,QAAQ,uCAAuC;EACjD;EAEA,MAAM,YAAY,KAAK,iBAAiB,KAAK;EAC7C,IAAI,WAAW;GACb,QAAQ,YAAY;GACpB,QAAQ,+DAA+D;GACvE,QAAQ,aAAa;EACvB;EAEA,MAAM,eAAe,MAAM,MAAM,uCAAuC;EACxE,IAAA,iBAAA,QAAA,iBAAA,KAAA,IAAA,KAAA,IAAI,aAAe,IAAI;GACrB,QAAQ,WAAW,CAAC,aAAa,EAAE;GACnC,QAAQ,sCAAsC;EAChD;EAEA,MAAM,YAAY,cAAc,KAAK;EACrC,IAAI,WAAW;GACb,QAAQ,UAAU,CAAC,UAAU,EAAE;GAC/B,YAAY,UAAU,QAAQ,UAAU,MAAM,GAAG;EACnD;EAEA,IAAI,SAAkC;EACtC,IAAI,WAAW,SAAS,OAAO,GAAG,SAAS;EAC3C,IAAI,WAAW,SAAS,OAAO,KAAK,WAAW,SAAS,SAAS,GAAG,SAAS;EAC7E,IAAI,WAAW,SAAS,MAAM,GAAG,SAAS;EAC1C,IAAI,WAAW,SAAS,MAAM,KAAK,WAAW,SAAS,aAAa,GAClE,SAAS;EAQX,OAAO;GACL,eAAe;GACf,WARgB,UACf,MAAM,KAAK,CAAC,CACZ,IAAI,eAAe,CAAC,CACpB,QAAQ,MAAM,KAAK,CAAC,gBAAgB,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,CACzD,KAAK,GAIE;GACR;GACA,UAAU,CAAC;GACX;GACA,YAAY;EACd;CACF;;;;CAKA,MAAM,WACJ,QACuB;EACvB,MAAM,KAAK,KAAK,WAAW;EAC3B,MAAM,sBAAM,IAAI,KAAK;EAErB,MAAM,aAA2B;GAC/B,GAAG;GACH;GACA,WAAW;GACX,WAAW;EACb;EAEA,KAAK,QAAQ,IAAI,IAAI,UAAU;EAC/B,OAAO;CACT;;;;CAKA,MAAM,WAAW,QAA0C;EACzD,MAAM,aAAa,MAAM,KAAK,KAAK,QAAQ,OAAO,CAAC;EAEnD,IAAI,QACF,OAAO,WAAW,QAAQ,MAAM,EAAE,WAAW,UAAU,EAAE,MAAM;EAGjE,OAAO;CACT;;;;CAKA,MAAM,aAAa,UAAiC;EAClD,KAAK,QAAQ,OAAO,QAAQ;CAC9B;CAIA,aACE,MACA,SACA,WACY;EACZ,IAAI,CAAC,SAAS,OAAO;EAErB,MAAM,QAAQ,QAAQ,YAAY,iBAAiB,QAAQ,SAAS,IAAI,KAAA;EACxE,MAAM,YAAY,QAAQ,mBAAmB,CAAC,EAAA,CAAG,OAAO,OAAO,CAAC,CAAC,KAAK,MAAM,EAAE,YAAY,CAAC;EAE3F,OAAO,KAAK,QAAQ,QAAQ;GAE1B,IAAI,QAAQ,UAAU,CAAC,QAAQ,OAAO,SAAS,IAAI,KAAK,GACtD,OAAO;GAIT,IAAI,QAAQ,YAAY,CAAC,QAAQ,SAAS,SAAS,IAAI,OAAO,GAC5D,OAAO;GAIT,IAAI,QAAQ,YAAY,IAAI,WAAW,CAAC,QAAQ,SAAS,SAAS,IAAI,OAAO,GAC3E,OAAO;GAIT,IAAI,OAAO;IACT,MAAM,UAAU,IAAI,KAAK,IAAI,SAAS,CAAC,CAAC,QAAQ;IAChD,IAAI,UAAU,MAAM,OAAO,OAAO;IAClC,IAAI,MAAM,QAAQ,KAAA,KAAa,UAAU,MAAM,KAAK,OAAO;GAC7D;GAEA,IAAI,QAAQ,WAAW,CAAC,WAAW,iBAAiB,KAAK,YAAY,GAAG,QAAQ,OAAO,GACrF,OAAO;GAGT,IACE,QAAQ,cACR,CAAC,WAAW,iBAAiB,KAAK,eAAe,GAAG,QAAQ,UAAU,GAEtE,OAAO;GAGT,IAAI,QAAQ,gBAAgB,KAAA,KAAa,cAAc,IAAI,KAAK,IAAI,QAAQ,aAC1E,OAAO;GAGT,IAAI,SAAS,SAAS,GAAG;IACvB,MAAM,OAAO,KAAK,oBAAoB,KAAK,SAAS;IACpD,IAAI,SAAS,MAAM,MAAM,KAAK,SAAS,CAAC,CAAC,GAAG,OAAO;GACrD;GAEA,IAAI,QAAQ,cACV,KAAK,MAAM,CAAC,KAAK,aAAa,OAAO,QAAQ,QAAQ,YAAY,GAAG;IAClE,MAAM,SAAS,QAAQ,KAAK,GAAG;IAC/B,IAAI,CAAC,aAAa,WAAW,KAAA,IAAY,QAAQ,IAAI,SAAS,GAAG,IAAI,QAAQ,QAAQ,GACnF,OAAO;GAEX;GAIF,IAAI,QAAQ,aAAa,KAAA,GAAW;IAClC,MAAM,WAAW,IAAI,UAAU,WAAW,CAAC,CAAC,IAAI;IAChD,IAAI,QAAQ,aAAa,UAAU,OAAO;GAC5C;GAGA,IAAI,QAAQ,YAAY,IAAI,WAAW,CAAC,QAAQ,SAAS,SAAS,IAAI,OAAO,GAC3E,OAAO;GAGT,OAAO;EACT,CAAC;CACH;CAEA,kBACE,MACA,OACA,SACA,WACgB;EAChB,IAAI,CAAC,OACH,OAAO,KAAK,KAAK,SAAS;GAAE;GAAK,OAAO;EAAE,EAAE;EAG9C,MAAM,aAAa,MAAM,YAAY,CAAC,CAAC,MAAM,KAAK;EAClD,MAAM,UAA0B,CAAC;EAEjC,KAAK,MAAM,OAAO,MAAM;GACtB,MAAM,iBAAiB,KAAK,oBAAoB,KAAK,SAAS;GAC9D,IAAI,QAAQ;GACZ,MAAM,aAAgC,CAAC;GACvC,MAAM,eAAyB,CAAC;GAEhC,KAAK,MAAM,QAAQ,YACjB,IAAI,eAAe,SAAS,IAAI,GAAG;IACjC,SAAS;IACT,aAAa,KAAK,IAAI;GACxB;GAGF,IAAI,QAAQ,GAAG;IAEb,IAAA,YAAA,QAAA,YAAA,KAAA,IAAA,KAAA,IAAI,QAAS,kBACX,WAAW,KAAK;KACd,OAAO;KACP,WAAW,KAAK,sBAAsB,IAAI,SAAS,YAAY;KAC/D;IACF,CAAC;IAGH,MAAM,SAA6E;KACjF;KACA,OAAO,QAAQ,WAAW;IAC5B;IACA,IAAI,WAAW,SAAS,GAAG,OAAO,aAAa;IAC/C,QAAQ,KAAK,MAA4C;GAC3D;EACF;EAEA,OAAO;CACT;CAEA,oBAA4B,KAAe,OAAsC;EAC/E,IAAI,OAAO,MAAM,IAAI,GAAG;EACxB,IAAI,SAAS,KAAA,GAAW;GACtB,OAAO,KAAK,kBAAkB,GAAG,CAAC,CAAC,YAAY;GAC/C,MAAM,IAAI,KAAK,IAAI;EACrB;EACA,OAAO;CACT;CAEA,kBAA0B,KAAuB;EAI/C,MAAM,cAAc,IAAI,UAAU,aAAa,IAAI,OAAO,IAAI;EAC9D,OAAO;GAAC,IAAI;GAAS,IAAI;GAAO,IAAI;GAAS,IAAI;GAAS;EAAW,CAAC,CACnE,OAAO,OAAO,CAAC,CACf,KAAK,GAAG;CACb;CAEA,sBAA8B,MAAc,OAA2B;EACrE,MAAM,YAAsB,CAAC;EAC7B,MAAM,YAAY,KAAK,YAAY;EAEnC,KAAK,MAAM,QAAQ,OAAO;GACxB,MAAM,QAAQ,UAAU,QAAQ,IAAI;GACpC,IAAI,UAAU,IAAI;IAChB,MAAM,QAAQ,KAAK,IAAI,GAAG,QAAQ,EAAE;IACpC,MAAM,MAAM,KAAK,IAAI,KAAK,QAAQ,QAAQ,KAAK,SAAS,EAAE;IAC1D,UAAU,KAAK,KAAK,MAAM,OAAO,GAAG,CAAC;GACvC;EACF;EAEA,OAAO;CACT;CAEA,aACE,SACA,QACA,YAA4B,QACZ;EAChB,MAAM,SAAS,CAAC,GAAG,OAAO;EAE1B,OAAO,MAAM,GAAG,MAAM;GACpB,IAAI;GAEJ,QAAQ,QAAR;IACE,KAAK;KACH,aAAa,IAAI,KAAK,EAAE,IAAI,SAAS,CAAC,CAAC,QAAQ,IAAI,IAAI,KAAK,EAAE,IAAI,SAAS,CAAC,CAAC,QAAQ;KACrF;IACF,KAAK;KACH,aAAa,EAAE,IAAI,MAAM,cAAc,EAAE,IAAI,KAAK;KAClD;IAGF,SACE,aAAa,EAAE,QAAQ,EAAE;GAE7B;GAEA,OAAO,cAAc,QAAQ,aAAa,CAAC;EAC7C,CAAC;EAED,OAAO;CACT;CAEA,gBACE,SACA,SAAiB,GACjB,QAAgB,KACA;EAChB,OAAO,QAAQ,MAAM,QAAQ,SAAS,KAAK;CAC7C;CAEA,MAAc,kBAAkB,SAAyB,cAAsB,GAAkB;EAC/F,KAAK,MAAM,UAAU,SAAS;GAC5B,MAAM,WAAW,KAAK,KAAK,QAAQ,OAAO,GAAG;GAC7C,IAAI,aAAa,IAAI;IACnB,MAAM,QAAQ,KAAK,IAAI,GAAG,WAAW,WAAW;IAChD,MAAM,MAAM,KAAK,IAAI,KAAK,KAAK,QAAQ,WAAW,cAAc,CAAC;IACjE,OAAO,UAAU,KAAK,KAAK,MAAM,OAAO,GAAG,CAAC,CAAC,QAAQ,MAAM,MAAM,OAAO,GAAG;GAC7E;EACF;CACF;CAEA,oBAA4B,MAAgB,MAAwB;EAClE,IAAI,QAAQ;EACZ,IAAI,UAAU;EAGd,IAAI,KAAK,UAAU,KAAK,OACtB,SAAS;EAEX;EAGA,IAAI,KAAK,YAAY,KAAK,SACxB,SAAS;EAEX;EAGA,IAAI,KAAK,WAAW,KAAK,YAAY,KAAK,SACxC,SAAS;EAEX;EAGA,MAAM,oBAAoB,KAAK,wBAAwB,KAAK,SAAS,KAAK,OAAO;EACjF,SAAS,oBAAoB;EAC7B;EAEA,OAAO,QAAQ;CACjB;CAEA,wBAAgC,OAAe,OAAuB;EACpE,MAAM,SAAS,IAAI,IAAI,MAAM,YAAY,CAAC,CAAC,MAAM,KAAK,CAAC;EACvD,MAAM,SAAS,IAAI,IAAI,MAAM,YAAY,CAAC,CAAC,MAAM,KAAK,CAAC;EAEvD,MAAM,eAAe,IAAI,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,QAAQ,MAAM,OAAO,IAAI,CAAC,CAAC,CAAC;EACrE,MAAM,wBAAQ,IAAI,IAAI,CAAC,GAAG,QAAQ,GAAG,MAAM,CAAC;EAE5C,OAAO,MAAM,OAAO,IAAI,aAAa,OAAO,MAAM,OAAO;CAC3D;CAEA,oBAA4B,MAAgB,MAA0B;EACpE,MAAM,WAAqB,CAAC;EAE5B,IAAI,KAAK,UAAU,KAAK,OAAO,SAAS,KAAK,YAAY;EACzD,IAAI,KAAK,YAAY,KAAK,SAAS,SAAS,KAAK,cAAc;EAC/D,IAAI,KAAK,YAAY,KAAK,SAAS,SAAS,KAAK,YAAY;EAC7D,IAAI,KAAK,YAAY,KAAK,SAAS,SAAS,KAAK,cAAc;EAE/D,OAAO;CACT;CAEA,yBAAiC,MAAgB,MAAgB,YAA4B;EAC3F,MAAM,UAAoB,CAAC;EAE3B,IAAI,KAAK,UAAU,KAAK,OAAO,QAAQ,KAAK,gBAAgB;EAC5D,IAAI,KAAK,YAAY,KAAK,SAAS,QAAQ,KAAK,cAAc;EAC9D,IAAI,KAAK,YAAY,KAAK,SAAS,QAAQ,KAAK,eAAe;EAE/D,OAAO,QAAQ,SAAS,IACpB,oBAAoB,QAAQ,KAAK,IAAI,MACrC,GAAG,KAAK,MAAM,aAAa,GAAG,EAAE;CACtC;CAEA,iBAAyB,OAAsC;EAC7D,MAAM,aAAa,MAAM,YAAY;EAErC,MAAM,gBAAgB,WAAW,MAC/B,mEACF;EACA,IAAA,kBAAA,QAAA,kBAAA,KAAA,IAAA,KAAA,IAAI,cAAgB,IAAI;GAGtB,MAAM,WAAyB;IAAE,OAFnB,cAAc,KAAK,OAAO,SAAS,cAAc,IAAI,EAAE,IAAI;IAEjC,MAAA,GADxB,cAAc,EAAE,CAAC,QAAQ,MAAM,EAAE,EAAE;GACN;GAC7C,OAAO;IAAE,OAAO,iBAAiB;KAAE,OAAO;KAAG;IAAS,CAAC,CAAC,CAAC;IAAO;GAAS;EAC3E;EAEA,IAAI,WAAW,SAAS,OAAO,GAAG;GAChC,MAAM,wBAAQ,IAAI,KAAK;GACvB,MAAM,SAAS,GAAG,GAAG,GAAG,CAAC;GACzB,OAAO,EAAE,OAAO,MAAM;EACxB;CAGF;CAEA,mBAA2B,OAAqB;;EAC9C,KAAK,cAAc,KAAK,KAAK;EAG7B,MAAM,YAAA,iBAAU,KAAK,aAAA,QAAA,mBAAA,KAAA,IAAA,KAAA,IAAA,eAAS,mBAAkB;EAChD,IAAI,KAAK,cAAc,SAAS,SAC9B,KAAK,gBAAgB,KAAK,cAAc,MAAM,CAAC,OAAO;CAE1D;CAEA,cAAgC;EAC9B,MAAM,6BAAa,IAAI,IAAoB;EAE3C,KAAK,MAAM,OAAO,KAAK,KAAK,MAAM,IAAK,GAAG;GACxC,MAAM,QAAQ,IAAI,QAAQ,YAAY,CAAC,CAAC,MAAM,KAAK;GACnD,KAAK,MAAM,QAAQ,OACjB,IAAI,KAAK,SAAS,GAEhB,WAAW,IAAI,OAAO,WAAW,IAAI,IAAI,KAAK,KAAK,CAAC;EAG1D;EAEA,OAAO,MAAM,KAAK,WAAW,QAAQ,CAAC,CAAC,CACpC,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,CAC3B,MAAM,GAAG,EAAE,CAAC,CACZ,KAAK,CAAC,UAAU,IAAI;CACzB;CAEA,aAA6B;EAE3B,OAAO,UAAU,KAAK,IAAI,EAAE,GAAG,KAAK,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,MAAM,GAAG,EAAE;CACvE;AACF;AAEA,MAAM,UAAgD;CACpD,SAAS;CACT,SAAS;CACT,OAAO;CACP,MAAM;AACR;AAEA,MAAM,iBAAyC;CAC7C,OAAO;CACP,SAAS;CACT,OAAO;CACP,MAAM;CACN,KAAK;CACL,MAAM;CACN,SAAS;CACT,OAAO;CACP,OAAO;CACP,UAAU;AACZ;AAEA,MAAM,eAAe;CAAC;CAAU;CAAW;AAAQ;AACnD,MAAM,kBAAkB;CAAC;CAAa;CAAc;AAAW;AAE/D,MAAM,kCAAkB,IAAI,IAAI;CAC9B;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;;AAGD,SAAS,gBAAgB,MAAsB;CAC7C,MAAM,UAAU,MAAmC,MAAM,KAAA,KAAa,KAAK,KAAK,CAAC;CACjF,IAAI,QAAQ;CACZ,IAAI,MAAM,KAAK;CACf,OAAO,QAAQ,OAAO,CAAC,OAAO,KAAK,MAAM,GAAG;CAC5C,OAAO,MAAM,SAAS,CAAC,OAAO,KAAK,MAAM,EAAE,GAAG;CAC9C,OAAO,KAAK,MAAM,OAAO,GAAG;AAC9B;;AAGA,SAAS,cAAc,OAAwB;CAC7C,IAAI,OAAO,UAAU,UAAU,OAAO,eAAe;CACrD,OAAO,eAAe,MAAM,YAAY,MAAM,eAAe;AAC/D;AAEA,SAAS,iBAAiB,OAA8D;CACtF,MAAM,QAAQ,MAA8B,OAAO,MAAM,WAAW,IAAI,EAAE,QAAQ;CAClF,IAAI,MAAM,UAAU;EAClB,MAAM,EAAE,OAAO,SAAS,MAAM;EAC9B,OAAO;GACL,OAAO,KAAK,IAAI,IAAI,QAAQ,QAAQ;GACpC,KAAK,MAAM,QAAQ,KAAA,IAAY,KAAA,IAAY,KAAK,MAAM,GAAG;EAC3D;CACF;CACA,OAAO;EAAE,OAAO,KAAK,MAAM,KAAK;EAAG,KAAK,MAAM,QAAQ,KAAA,IAAY,KAAA,IAAY,KAAK,MAAM,GAAG;CAAE;AAChG;AAEA,SAAS,QAAQ,KAAc,MAAuB;CACpD,IAAI,MAAe;CACnB,KAAK,MAAM,QAAQ,KAAK,MAAM,GAAG,GAAG;EAClC,IAAI,QAAQ,QAAQ,OAAO,QAAQ,UAAU,OAAO,KAAA;EACpD,MAAO,IAAgC;CACzC;CACA,OAAO;AACT;AAEA,SAAS,UAAU,GAAY,GAAqB;CAClD,IAAI,MAAM,GAAG,OAAO;CACpB,IAAI,OAAO,MAAM,YAAY,OAAO,MAAM,YAAY,MAAM,QAAQ,MAAM,MAAM,OAAO;CACvF,IAAI,MAAM,QAAQ,CAAC,MAAM,MAAM,QAAQ,CAAC,GAAG,OAAO;CAClD,MAAM,KAAK,OAAO,KAAK,CAAC;CACxB,MAAM,KAAK,OAAO,KAAK,CAAC;CACxB,IAAI,GAAG,WAAW,GAAG,QAAQ,OAAO;CACpC,OAAO,GAAG,OAAO,MACf,UAAW,EAA8B,IAAK,EAA8B,EAAE,CAChF;AACF;;;;;AAMA,SAAS,aAAa,QAAiB,UAA4B;CACjE,IAAI,WAAW,KAAA,GAAW,OAAO;CACjC,IAAI,OAAO,WAAW,YAAY,OAAO,aAAa,YAAY,SAAS,KAAK,MAAM,IACpF,OAAO,OAAO,QAAQ,MAAM;CAE9B,OAAO,UAAU,QAAQ,QAAQ;AACnC;AAEA,SAAS,iBAAiB,KAAe,MAAoC;CAC3E,MAAM,UAAU,IAAI;CACpB,IAAI,CAAC,SAAS,OAAO,KAAA;CACrB,KAAK,MAAM,OAAO,MAAM;EACtB,MAAM,IAAI,QAAQ;EAClB,IAAI,MAAM,KAAA,KAAa,MAAM,MAAM,OAAO,OAAO,CAAC;CACpD;AAEF;AAEA,SAAS,WAAW,OAA2B,SAA4B;CACzE,OAAO,UAAU,KAAA,KAAa,QAAQ,SAAS,KAAK;AACtD;;;;;ACh1BA,IAAa,oBAAb,MAA+B;CAEnB;CADV,YACE,SAKA;EALQ,KAAA,UAAA;EAMR,KAAK,UAAU;GACb,wBAAwB;GACxB,kBAAkB;GAClB,oBAAoB;GACpB,GAAG;EACL;CACF;;;;CAKA,MAAM,gBACJ,KACA,SACA,QAAgB,IACO;EACvB,MAAM,UAAwB,CAAC;EAE/B,KAAK,MAAM,YAAY,SAAS;GAC9B,IAAI,aAAa,KAAK;GAEtB,MAAM,gBAAgB,KAAK,kBAAkB,KAAK,QAAQ;GAE1D,KAAK,MAAM,gBAAgB,eAAe;;IACxC,MAAM,QAAQ,KAAK,2BAA2B,cAAc,KAAK,QAAQ;IAEzE,IAAI,WAAA,gBAAS,KAAK,aAAA,QAAA,kBAAA,KAAA,IAAA,KAAA,IAAA,cAAS,uBAAsB,KAC/C,QAAQ,KAAK;KACX,KAAK;KACL;KACA;IACF,CAAC;GAEL;EACF;EAIA,OADsB,KAAK,uBAAuB,OAC/B,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC,MAAM,GAAG,KAAK;CACvE;;;;CAKA,MAAM,4BACJ,MACA,UAOsC;EACtC,MAAM,+BAAe,IAAI,IAA4B;EAGrD,IAAI,SAAS,SAAS;GACpB,MAAM,oBAAoB,KAAK,mBAAmB,IAAI;GACtD,KAAK,MAAM,CAAC,KAAK,UAAU,mBACzB,aAAa,IAAI,SAAS,OAAO,KAAK;EAE1C;EAGA,IAAI,SAAS,QAAQ;GACnB,MAAM,mBAAmB,KAAK,kBAAkB,IAAI;GACpD,KAAK,MAAM,CAAC,KAAK,UAAU,kBACzB,aAAa,IAAI,QAAQ,OAAO,KAAK;EAEzC;EAGA,IAAI,SAAS,WAAW;GACtB,MAAM,sBAAsB,KAAK,qBAAqB,IAAI;GAC1D,KAAK,MAAM,CAAC,KAAK,UAAU,qBACzB,aAAa,IAAI,WAAW,OAAO,KAAK;EAE5C;EAGA,IAAI,SAAS,UAAU;GACrB,MAAM,uBAAuB,KAAK,6BAA6B,IAAI;GACnE,KAAK,MAAM,CAAC,KAAK,UAAU,sBACzB,aAAa,IAAI,YAAY,OAAO,KAAK;EAE7C;EAGA,IAAI,SAAS,cAAc;GACzB,MAAM,oBAAoB,KAAK,uBAAuB,IAAI;GAC1D,KAAK,MAAM,CAAC,KAAK,UAAU,mBACzB,aAAa,IAAI,SAAS,OAAO,KAAK;EAE1C;EAEA,OAAO;CACT;;;;CAKA,cAAc,MAAmC;EAC/C,MAAM,WAA4B,CAAC;EAGnC,MAAM,aAAa,CAAC,GAAG,IAAI,CAAC,CAAC,MAC1B,GAAG,MAAM,IAAI,KAAK,EAAE,SAAS,CAAC,CAAC,QAAQ,IAAI,IAAI,KAAK,EAAE,SAAS,CAAC,CAAC,QAAQ,CAC5E;EAEA,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;GAC1C,MAAM,MAAM,WAAW;GACvB,MAAM,YAAY,KAAK,mBAAmB,KAAK,YAAY,CAAC;GAE5D,MAAM,QAAuB;IAC3B,WAAW,IAAI,KAAK,IAAI,SAAS;IACjC;IACA;GACF;GAGA,IAAI,cAAc,WAAW,IAAI,WAAW,SAAS,GAAG;IACtD,MAAM,WAAW,WACd,MAAM,IAAI,CAAC,CAAC,CACZ,MAAM,MAAM,KAAK,mBAAmB,GAAG,YAAY,WAAW,QAAQ,CAAC,CAAC,MAAM,KAAK;IAEtF,IAAI,UACF,MAAM,WACJ,IAAI,KAAK,SAAS,SAAS,CAAC,CAAC,QAAQ,IAAI,IAAI,KAAK,IAAI,SAAS,CAAC,CAAC,QAAQ;GAE/E;GAEA,SAAS,KAAK,KAAK;EACrB;EAEA,OAAO;CACT;;;;CAKA,MAAM,oBACJ,MACoF;EACpF,MAAM,SAAS,KAAK,QAAQ,QAAQ,IAAI,UAAU,OAAO;EAEzD,IAAI,OAAO,WAAW,GACpB,OAAO;GAAE,SAAS,CAAC;GAAG,kBAAkB,CAAC;EAAE;EAI7C,MAAM,YAAY,OAAO,QAAQ,UAAU,YACzC,IAAI,KAAK,QAAQ,SAAS,IAAI,IAAI,KAAK,SAAS,SAAS,IAAI,UAAU,QACzE;EAGA,MAAM,UAAU,KAAK,kBAAkB,WAAW,MAAM;EAKxD,OAAO;GACL;GACA;GACA,kBAAA,CALwB,GAAG,IAAI,IAAI,QAAQ,KAAK,QAAQ,IAAI,OAAO,CAAC,CAKrD;EACjB;CACF;CAIA,mBAA2B,MAA+C;EACxE,MAAM,+BAAe,IAAI,IAAwB;EAEjD,KAAK,MAAM,OAAO,MAAM;GACtB,IAAI,CAAC,IAAI,SAAS;GAElB,IAAI,CAAC,aAAa,IAAI,IAAI,OAAO,GAC/B,aAAa,IAAI,IAAI,SAAS,CAAC,CAAC;GAElC,aAAa,IAAI,IAAI,OAAO,CAAC,CAAE,KAAK,GAAG;EACzC;EAEA,OAAO,KAAK,wBAAwB,cAAc,OAAO;CAC3D;CAEA,kBAA0B,MAA+C;EACvE,MAAM,+BAAe,IAAI,IAAwB;EAEjD,KAAK,MAAM,OAAO,MAAM;;GACtB,MAAM,UAAA,eAAS,IAAI,aAAA,QAAA,iBAAA,KAAA,IAAA,KAAA,IAAA,aAAS;GAC5B,IAAI,CAAC,QAAQ;GAEb,IAAI,CAAC,aAAa,IAAI,MAAM,GAC1B,aAAa,IAAI,QAAQ,CAAC,CAAC;GAE7B,aAAa,IAAI,MAAM,CAAC,CAAE,KAAK,GAAG;EACpC;EAEA,OAAO,KAAK,wBAAwB,cAAc,MAAM;CAC1D;CAEA,qBAA6B,MAA+C;EAC1E,MAAM,+BAAe,IAAI,IAAwB;EAEjD,KAAK,MAAM,OAAO,MAAM;;GACtB,MAAM,aAAA,gBAAY,IAAI,aAAA,QAAA,kBAAA,KAAA,IAAA,KAAA,IAAA,cAAS;GAC/B,IAAI,CAAC,WAAW;GAEhB,IAAI,CAAC,aAAa,IAAI,SAAS,GAC7B,aAAa,IAAI,WAAW,CAAC,CAAC;GAEhC,aAAa,IAAI,SAAS,CAAC,CAAE,KAAK,GAAG;EACvC;EAEA,OAAO,KAAK,wBAAwB,cAAc,SAAS;CAC7D;CAEA,6BAAqC,MAA+C;EAClF,MAAM,+BAAe,IAAI,IAAwB;EACjD,MAAM,aAAa,CAAC,GAAG,IAAI,CAAC,CAAC,MAC1B,GAAG,MAAM,IAAI,KAAK,EAAE,SAAS,CAAC,CAAC,QAAQ,IAAI,IAAI,KAAK,EAAE,SAAS,CAAC,CAAC,QAAQ,CAC5E;EAEA,IAAI,eAA2B,CAAC;EAChC,IAAI,iBAAgC;EAEpC,KAAK,MAAM,OAAO,YAAY;;GAC5B,MAAM,UAAU,IAAI,KAAK,IAAI,SAAS,CAAC,CAAC,QAAQ;GAEhD,IAAI,mBAAmB,MAAM;IAC3B,iBAAiB;IACjB,eAAe,CAAC,GAAG;GACrB,OAAO,IAAI,UAAU,qBAAA,iBAAmB,KAAK,aAAA,QAAA,mBAAA,KAAA,IAAA,KAAA,IAAA,eAAS,qBAAoB,MACxE,aAAa,KAAK,GAAG;QAChB;IAEL,IAAI,aAAa,SAAS,GAAG;KAC3B,MAAM,WAAW,GAAG;KACpB,aAAa,IAAI,UAAU,YAAY;IACzC;IAGA,iBAAiB;IACjB,eAAe,CAAC,GAAG;GACrB;EACF;EAGA,IAAI,aAAa,SAAS,KAAK,mBAAmB,MAChD,aAAa,IAAI,GAAG,kBAAkB,YAAY;EAGpD,OAAO,KAAK,wBAAwB,cAAc,UAAU;CAC9D;CAEA,uBAA+B,MAA+C;EAC5E,MAAM,+BAAe,IAAI,IAAwB;EACjD,MAAM,SAAS,KAAK,QAAQ,QAAQ,IAAI,UAAU,OAAO;EAEzD,KAAK,MAAM,SAAS,QAAQ;GAC1B,MAAM,UAAU,KAAK,kBAAkB,OAAO,IAAI;GAElD,IAAI,QAAQ,SAAS,GAAG;IACtB,MAAM,MAAM,GAAG,MAAM,UAAU,GAAG,MAAM,QAAQ,MAAM,GAAG,EAAE;IAC3D,aAAa,IAAI,KAAK,OAAO;GAC/B;EACF;EAEA,OAAO,KAAK,wBAAwB,cAAc,eAAe;CACnE;CAEA,kBAA0B,WAAqB,SAAiC;;EAC9E,MAAM,UAAsB,CAAC,SAAS;EACtC,MAAM,WAAW,IAAI,KAAK,UAAU,SAAS,CAAC,CAAC,QAAQ;EACvD,MAAM,aAAA,iBAAW,KAAK,aAAA,QAAA,mBAAA,KAAA,IAAA,KAAA,IAAA,eAAS,qBAAoB;EAGnD,KAAK,MAAM,OAAO,SAAS;GACzB,IAAI,QAAQ,WAAW;GAGvB,MAAM,WADU,IAAI,KAAK,IAAI,SAAS,CAAC,CAAC,QACjB,IAAI;GAE3B,IACE,WAAW,KACX,YAAY,aACX,IAAI,UAAU,WAAW,IAAI,UAAU,YACvC,IAAI,YAAY,UAAU,WAAW,IAAI,YAAY,UAAU,UAEhE,QAAQ,KAAK,GAAG;EAEpB;EAEA,OAAO,QAAQ,MACZ,GAAG,MAAM,IAAI,KAAK,EAAE,SAAS,CAAC,CAAC,QAAQ,IAAI,IAAI,KAAK,EAAE,SAAS,CAAC,CAAC,QAAQ,CAC5E;CACF;CAEA,kBAA0B,MAAgB,MAAoC;;EAC5E,MAAM,gBAAoC,CAAC;EAG3C,IAAI,KAAK,WAAW,KAAK,YAAY,KAAK,SACxC,cAAc,KAAK,YAAY;EAIjC,MAAM,SAAA,gBAAQ,KAAK,aAAA,QAAA,kBAAA,KAAA,IAAA,KAAA,IAAA,cAAS;EAC5B,MAAM,SAAA,gBAAQ,KAAK,aAAA,QAAA,kBAAA,KAAA,IAAA,KAAA,IAAA,cAAS;EAC5B,IAAI,SAAS,UAAU,OACrB,cAAc,KAAK,WAAW;EAIhC,MAAM,YAAA,iBAAW,KAAK,aAAA,QAAA,mBAAA,KAAA,IAAA,KAAA,IAAA,eAAS;EAC/B,MAAM,YAAA,iBAAW,KAAK,aAAA,QAAA,mBAAA,KAAA,IAAA,KAAA,IAAA,eAAS;EAC/B,IAAI,YAAY,aAAa,UAC3B,cAAc,KAAK,cAAc;EAInC,MAAM,QAAQ,IAAI,KAAK,KAAK,SAAS,CAAC,CAAC,QAAQ;EAC/C,MAAM,QAAQ,IAAI,KAAK,KAAK,SAAS,CAAC,CAAC,QAAQ;EAC/C,IAAI,KAAK,IAAI,QAAQ,KAAK,QAAA,iBAAM,KAAK,aAAA,QAAA,mBAAA,KAAA,IAAA,KAAA,IAAA,eAAS,qBAAoB,MAChE,cAAc,KAAK,oBAAoB;EAIzC,KACG,KAAK,UAAU,WAAW,KAAK,UAAU,YAC1C,QAAQ,SACR,QAAQ,YAAA,iBAAU,KAAK,aAAA,QAAA,mBAAA,KAAA,IAAA,KAAA,IAAA,eAAS,qBAAoB,MAEpD,cAAc,KAAK,eAAe;EAIpC,IAAI,KAAK,mBAAmB,MAAM,IAAI,GACpC,cAAc,KAAK,iBAAiB;EAGtC,OAAO;CACT;CAEA,2BACE,cACA,MACA,MACQ;EAUR,IAAI,QAAQ;GARV,YAAY;GACZ,WAAW;GACX,cAAc;GACd,oBAAoB;GACpB,eAAe;GACf,iBAAiB;EAGD,EAAE,iBAAiB;EAGrC,IAAI,KAAK,YAAY,KAAK,SACxB,SAAS;EAGX,OAAO,KAAK,IAAI,OAAO,CAAG;CAC5B;CAEA,mBAA2B,MAAgB,MAAyB;EAIlE,OAHoB,KAAK,iBAAiB,KAAK,OAG9B,MAFG,KAAK,iBAAiB,KAAK,OAEd;CACnC;CAEA,iBAAyB,SAAyB;EAChD,OAAO,QACJ,QAAQ,QAAQ,OAAO,CAAC,CACxB,QAAQ,mBAAmB,QAAQ,CAAC,CACpC,YAAY,CAAC,CACb,KAAK;CACV;CAEA,mBACE,KACA,UACA,QAC4B;EAC5B,MAAM,UAAU,IAAI,QAAQ,YAAY;EAExC,IAAI,QAAQ,SAAS,OAAO,KAAK,QAAQ,SAAS,OAAO,KAAK,QAAQ,SAAS,WAAW,GACxF,OAAO;EAGT,IAAI,QAAQ,SAAS,KAAK,KAAK,QAAQ,SAAS,UAAU,KAAK,QAAQ,SAAS,UAAU,GACxF,OAAO;EAGT,IAAI,IAAI,UAAU,SAChB,OAAO;EAGT,IAAI,QAAQ,SAAS,WAAW,KAAK,QAAQ,SAAS,YAAY,GAChE,OAAO;EAGT,OAAO;CACT;CAEA,uBAA+B,SAAqC;EAClE,MAAM,uBAAO,IAAI,IAAc;EAC/B,MAAM,SAAuB,CAAC;EAE9B,KAAK,MAAM,QAAQ,SACjB,IAAI,CAAC,KAAK,IAAI,KAAK,GAAG,GAAG;GACvB,KAAK,IAAI,KAAK,GAAG;GACjB,OAAO,KAAK,IAAI;EAClB;EAGF,OAAO;CACT;CAEA,wBACE,cACA,MAC6B;EAC7B,MAAM,yBAAS,IAAI,IAA4B;EAE/C,KAAK,MAAM,CAAC,KAAK,SAAS,aAAa,QAAQ,GAAG;GAChD,IAAI,KAAK,SAAS,GAAG;GAErB,MAAM,WAAW,KAAK,cAAc,IAAI;GACxC,MAAM,UAAU,KAAK,gBAAgB,IAAI;GAEzC,OAAO,IAAI,KAAK;IACd,gBAAgB;IAChB,GAAI,SAAS,UAAU,EAAE,SAAS,IAAI,IAAI,CAAC;IAC3C;IACA;IACA;GACF,CAAC;EACH;EAEA,OAAO;CACT;CAEA,gBAAwB,MAAyC;EAC/D,MAAM,aAAa,KAAK,QAAQ,MAAM,EAAE,UAAU,OAAO,CAAC,CAAC;EAC3D,MAAM,eAAe,KAAK,QAAQ,MAAM,EAAE,UAAU,MAAM,CAAC,CAAC;EAC5D,MAAM,WAAW,CAAC,GAAG,IAAI,IAAI,KAAK,KAAK,MAAM,EAAE,OAAO,CAAC,CAAC;EAGxD,IAAI;EACJ,IAAI,KAAK,SAAS,GAAG;GACnB,MAAM,SAAS,CAAC,GAAG,IAAI,CAAC,CAAC,MACtB,GAAG,MAAM,IAAI,KAAK,EAAE,SAAS,CAAC,CAAC,QAAQ,IAAI,IAAI,KAAK,EAAE,SAAS,CAAC,CAAC,QAAQ,CAC5E;GACA,MAAM,QAAQ,IAAI,KAAM,OAAO,EAAE,CAAc,SAAS,CAAC,CAAC,QAAQ;GAElE,WADY,IAAI,KAAM,OAAO,OAAO,SAAS,EAAE,CAAc,SAAS,CAAC,CAAC,QAC3D,IAAI;EACnB;EAEA,OAAO;GACL,WAAW,KAAK;GAChB;GACA;GACA;GACA,GAAI,aAAa,KAAA,IAAY,EAAE,SAAS,IAAI,CAAC;EAC/C;CACF;AACF;;;;;;;;ACzdA,MAAM,mBAAmB;AAEzB,SAAS,SAAS,OAAuB;CACvC,OAAO,MAAM,SAAS,mBAAmB,MAAM,MAAM,GAAG,gBAAgB,IAAI;AAC9E;AAEA,IAAa,kBAAb,cAAqC,kBAAkB;CACrD;CACA;CAEA,YAAY,SAAmC;EAC7C,MAAM,OAAO;EACb,KAAK,mBAAmB;CAC1B;;;;CAKA,MAAe,0BAA0B,UAA0C;EACjF,MAAM,QAAQ,SAAS,QAAQ;EAC/B,MAAM,WAA0B,CAAC;EACjC,MAAM,UAAyB,CAAC;EAGhC,MAAM,SAAS,KAAK,aAAa,KAAK;EAGtC,MAAM,oBAAoB,KAAK,gBAAgB,KAAK;EACpD,SAAS,KAAK,GAAG,iBAAiB;EAGlC,KAAK,MAAM,UAAU,UACnB,KAAK,oBAAoB,QAAQ,OAAO;EAI1C,MAAM,YAAY,KAAK,yBAAyB,KAAK;EACrD,IAAI,WACF,QAAQ,YAAY;EAItB,MAAM,aAAa,KAAK,oBAAoB,QAAQ,UAAU,KAAK;EAEnE,OAAO;GACL,eAAe;GACf;GACA;GACA;GACA,GAAI,cAAc,KAAA,IAAY,EAAE,UAAU,IAAI,CAAC;GAC/C;EACF;CACF;;;;CAKA,MAAe,sBAAsB,UAA2C;EAC9E,MAAM,QAAQ,SAAS,QAAQ;EAC/B,MAAM,SAAS,MAAM,KAAK,0BAA0B,KAAK;EAGzD,MAAM,UAAyB,KAAK,oBAAoB,OAAO,MAAM;EAGrE,MAAM,aAAa,KAAK,kBAAkB,OAAO,OAAO,QAAQ;EAEhE,OAAO,KAAK,OAAO,YAAY,OAAO,SAAS,OAAO;CACxD;CAIA,qBAAmC;EAEjC,KAAK,iCAAiB,IAAI,IAAI;GAC5B,CACE,eACA;IACE;IACA;IACA;IACA;IACA;IACA;GACF,CACF;GACA,CACE,iBACA;IACE;IACA;IACA;IACA;IACA;GACF,CACF;GACA,CACE,sBACA;IACE;IACA;IACA;IACA;IACA;GACF,CACF;GACA,CACE,wBACA;IACE;IACA;IACA;IACA;IACA;GACF,CACF;GACA,CACE,oBACA;IACE;IACA;IACA;IACA;GACF,CACF;GACA,CACE,eACA;IACE;IACA;IACA;IACA;IACA;GACF,CACF;EACF,CAAC;EAGD,KAAK,iCAAiB,IAAI,IAAI;GAC5B,CAAC,SAAS,gDAAgD;GAC1D,CAAC,WAAW,+DAA+D;GAC3E,CAAC,YAAY,uCAAuC;GACpD,CAAC,QAAQ,mEAAmE;GAE5E,CAAC,cAAc,oCAAoC;EACrD,CAAC;CACH;CAEA,aAAqB,OAA4B;EAC/C,IAAI,WAAW;EACf,IAAI,iBAA8B;EAElC,KAAK,MAAM,CAAC,QAAQ,aAAa,KAAK,eAAe,QAAQ,GAAG;GAC9D,IAAI,QAAQ;GACZ,KAAK,MAAM,WAAW,UACpB,IAAI,QAAQ,KAAK,KAAK,GACpB;GAIJ,IAAI,QAAQ,UAAU;IACpB,WAAW;IACX,iBAAiB;GACnB;EACF;EAEA,OAAO;CACT;CAEA,gBAAwB,OAA8B;EACpD,MAAM,WAA0B,CAAC;EAEjC,MAAM,SAAS,cAAc,KAAK;EAClC,IAAI,QAAQ,SAAS,KAAK;GAAE,MAAM;GAAW,OAAO,OAAO;GAAI,YAAY;EAAI,CAAC;EAEhF,KAAK,MAAM,CAAC,MAAM,YAAY,KAAK,eAAe,QAAQ,GAAG;GAC3D,MAAM,UAAU,MAAM,SAAS,IAAI,OAAO,SAAS,IAAI,CAAC;GAExD,KAAK,MAAM,SAAS,SAAS;IAC3B,MAAM,QAAQ,MAAM,MAAM,MAAM;IAChC,SAAS,KAAK;KACZ;KACA,OAAO,MAAM,KAAK;KAClB,YAAY;IACd,CAAC;GACH;EACF;EAEA,OAAO;CACT;CAEA,oBAA4B,QAAqB,SAA8B;EAC7E,QAAQ,OAAO,MAAf;GACE,KAAK;IACH,IAAI,CAAC,QAAQ,QAAQ,QAAQ,SAAS,CAAC;IACvC,QAAQ,OAAO,KAAK,OAAO,MAAM,YAAY,CAAC;IAC9C;GAEF,KAAK;IACH,IAAI,CAAC,QAAQ,UAAU,QAAQ,WAAW,CAAC;IAC3C,QAAQ,SAAS,KAAK,OAAO,KAAK;IAClC;GAEF,KAAK;IACH,IAAI,CAAC,QAAQ,SAAS,QAAQ,UAAU,CAAC;IACzC,QAAQ,QAAQ,KAAK,OAAO,KAAK;IACjC;GAEF,KAAK;IACH,IAAI,CAAC,QAAQ,UAAU,QAAQ,WAAW,CAAC;IAC3C,QAAQ,SAAS,KAAK,OAAO,KAAK;EAMtC;CACF;CAEA,yBAAiC,OAAsC;EACrE,MAAM,aAAa,MAAM,YAAY;EAUrC,KAAK,MAAM,EAAE,SAAS,UAAU;GAN9B;IAAE,SAAS;IAA0B,MAAM;GAAmB;GAC9D;IAAE,SAAS;IAA0B,MAAM;GAAmB;GAC9D;IAAE,SAAS;IAAwB,MAAM;GAAiB;GAC1D;IAAE,SAAS;IAAuB,MAAM;GAAgB;EAGX,GAAG;GAChD,MAAM,QAAQ,MAAM,MAAM,OAAO;GACjC,IAAI,OAAO;IACT,MAAM,QAAQ,OAAO,SAAS,MAAM,MAAM,GAAG;IAC7C,MAAM,aAAa;KACjB,SAAS;KACT,SAAS;KACT,OAAO;KACP,MAAM;IACR,EAAE;IAEF,OAAO;KACL,OAAO,IAAI,KAAK,KAAK,IAAI,IAAI,QAAQ,UAAU;KAC/C,UAAU;MAAE;MAAO;KAAK;IAC1B;GACF;EACF;EAGA,IAAI,WAAW,SAAS,OAAO,GAAG;GAChC,MAAM,wBAAQ,IAAI,KAAK;GACvB,MAAM,SAAS,GAAG,GAAG,GAAG,CAAC;GACzB,OAAO,EAAE,OAAO,MAAM;EACxB;EAEA,IAAI,WAAW,SAAS,WAAW,GAAG;GACpC,MAAM,4BAAY,IAAI,KAAK;GAC3B,UAAU,QAAQ,UAAU,QAAQ,IAAI,CAAC;GACzC,UAAU,SAAS,GAAG,GAAG,GAAG,CAAC;GAC7B,MAAM,iBAAiB,IAAI,KAAK,SAAS;GACzC,eAAe,SAAS,IAAI,IAAI,IAAI,GAAG;GACvC,OAAO;IAAE,OAAO;IAAW,KAAK;GAAe;EACjD;EAEA,IAAI,WAAW,SAAS,WAAW,GAAG;GACpC,MAAM,sBAAM,IAAI,KAAK;GACrB,MAAM,cAAc,IAAI,KAAK,GAAG;GAChC,YAAY,QAAQ,IAAI,QAAQ,IAAI,IAAI,OAAO,CAAC;GAChD,YAAY,SAAS,GAAG,GAAG,GAAG,CAAC;GAC/B,OAAO,EAAE,OAAO,YAAY;EAC9B;CAGF;CAEA,oBAA4B,QAAqB,UAAyB,OAAuB;EAC/F,IAAI,aAAa;EAGjB,IAAI,WAAW,kBACb,cAAc;EAIhB,cAAc,KAAK,IAAI,SAAS,SAAS,IAAK,EAAG;EAGjD,MAAM,YAAY,MAAM,MAAM,KAAK,CAAC,CAAC;EACrC,IAAI,YAAY,KAAK,YAAY,IAC/B,cAAc;EAGhB,OAAO,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,UAAU,CAAC;CAC5C;CAEA,oBAA4B,QAAoC;EAC9D,MAAM,cAA6B;GACjC,OAAO;GACP,kBAAkB;EACpB;EAEA,QAAQ,QAAR;GACE,KAAK,eACH,OAAO;IACL,GAAG;IACH,gBAAgB;IAChB,aAAa;IACb,aAAa;GACf;GAEF,KAAK,iBACH,OAAO;IACL,GAAG;IACH,gBAAgB;IAChB,aAAa;IACb,WAAW;IACX,QAAQ;IACR,WAAW;GACb;GAEF,KAAK,sBACH,OAAO;IACL,GAAG;IACH,gBAAgB;IAChB,QAAQ;IACR,WAAW;IACX,OAAO;GACT;GAEF,KAAK,wBACH,OAAO;IACL,GAAG;IACH,gBAAgB;IAChB,aAAa;IACb,QAAQ;GACV;GAEF,KAAK,eACH,OAAO;IACL,GAAG;IACH,gBAAgB;IAChB,aAAa;IACb,WAAW;IACX,aAAa;GACf;GAEF,SACE,OAAO;EACX;CACF;CAEA,kBAA0B,OAAe,UAAiC;EACxE,IAAI,aAAa;EAGjB,KAAK,MAAM,UAAU,UAEnB,aAAa,WAAW,QAAQ,IAAI,OAAO,MAAM,OAAO,MAAM,MAAM,IAAI,GAAG,EAAE;EAyB/E,KAAK,MAAM,QAAQ;GApBjB;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;EAG2B,GAC3B,aAAa,WAAW,QAAQ,IAAI,OAAO,MAAM,KAAK,MAAM,IAAI,GAAG,EAAE;EAIvE,aAAa,WAAW,QAAQ,QAAQ,GAAG,CAAC,CAAC,KAAK;EAElD,OAAO,cAAc;CACvB;AACF;;ACtZA,MAAM,mBAAmB;;AAGzB,SAAS,cAAc,SAA0B;CAC/C,OAAO,QAAQ,MAAM,IAAI,CAAC,CAAC,MAAM,SAAS;EACxC,MAAM,IAAI,KAAK,KAAK;EACpB,OAAO,EAAE,WAAW,KAAK,KAAK,iBAAiB,KAAK,CAAC;CACvD,CAAC;AACH;;;;AAKA,IAAa,2BAAb,MAAsC;CAK1B;CAJV,2BAA4C,IAAI,IAAI;CACpD,qCAAkD,IAAI,IAAI;CAE1D,YACE,SAKA;EALQ,KAAA,UAAA;EAMR,KAAK,UAAU;GACb,cAAc;GACd,aAAa;GACb,kBAAkB;GAClB,GAAG;EACL;CACF;;;;CAKA,MAAM,gBAAgB,MAAyC;;EAE7D,MAAM,kBAAkB,KAAK,uBAAuB,IAAI;EAGxD,MAAM,gBAAgB,KAAK,qBAAqB,IAAI;EAGpD,MAAM,iBAAiB,KAAK,sBAAsB,IAAI;EAMtD,MAAM,mBAAmB;GAHJ,GAAG;GAAiB,GAAG;GAAe,GAAG;EAG3B,CAAC,CAAC,QAClC,MAAM;;GAAE,OAAA,EAAA,gBAAA,gBAAc,KAAK,aAAA,QAAA,kBAAA,KAAA,IAAA,KAAA,IAAA,cAAS,iBAAgB;EAAC,CACxD;EAGA,iBAAiB,MAAM,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS;EAGzD,MAAM,kBAAkB,iBAAiB,MAAM,KAAA,iBAAG,KAAK,aAAA,QAAA,mBAAA,KAAA,IAAA,KAAA,IAAA,eAAS,gBAAe,GAAI;EAGnF,KAAK,MAAM,WAAW,iBACpB,KAAK,SAAS,IAAI,QAAQ,IAAI,OAAO;EAGvC,OAAO;CACT;;;;CAKA,MAAM,gBAAgB,MAA+C;EACnE,MAAM,YAAgC,CAAC;EAEvC,KAAK,MAAM,OAAO,MAAM;;GACtB,MAAM,eAAe,MAAM,KAAK,sBAAsB,GAAG;GAEzD,IAAI,kBAAA,iBAAgB,KAAK,aAAA,QAAA,mBAAA,KAAA,IAAA,KAAA,IAAA,eAAS,qBAAoB,KACpD,UAAU,KAAK;IACb;IACA;IACA,QAAQ,KAAK,sBAAsB,KAAK,YAAY;IACpD,YAAY,KAAK,eAAe,GAAG;GACrC,CAAC;EAEL;EAEA,OAAO,UAAU,MAAM,GAAG,MAAM,EAAE,eAAe,EAAE,YAAY;CACjE;;;;CAKA,qBAAqB,KAA6B;EAChD,MAAM,WAAyB,CAAC;EAEhC,KAAK,MAAM,WAAW,KAAK,SAAS,OAAO,GACzC,IAAI,KAAK,oBAAoB,KAAK,OAAO,GACvC,SAAS,KAAK,OAAO;EAIzB,OAAO;CACT;;;;CAKA,cAA4B;EAC1B,OAAO,MAAM,KAAK,KAAK,SAAS,OAAO,CAAC;CAC1C;;;;CAKA,WAAW,WAA2C;EACpD,OAAO,KAAK,SAAS,IAAI,SAAS;CACpC;CAIA,uBAA+B,MAAgC;EAC7D,MAAM,6BAAa,IAAI,IAAqD;EAE5E,KAAK,MAAM,OAAO,MAAM;GAEtB,MAAM,oBAAoB,KAAK,iBAAiB,IAAI,OAAO;GAE3D,IAAI,CAAC,WAAW,IAAI,iBAAiB,GACnC,WAAW,IAAI,mBAAmB;IAAE,UAAU,CAAC;IAAG,OAAO;GAAE,CAAC;GAG9D,MAAM,UAAU,WAAW,IAAI,iBAAiB;GAChD,IAAI,QAAQ,SAAS,SAAS,GAC5B,QAAQ,SAAS,KAAK,GAAG;GAE3B,QAAQ;EACV;EAGA,OAAO,MAAM,KAAK,WAAW,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,OAAO,UAAW;;;IACvE,IAAI,eAAe;IACnB;IACA,UAAU,KAAK;IACf,WAAW,KAAK;IAChB,YAAA,iBAAU,KAAK,SAAS,KAAK,SAAS,SAAS,QAAA,QAAA,mBAAA,KAAA,IAAA,KAAA,IAAA,eAAI,aAC/C,IAAI,KAAM,KAAK,SAAS,KAAK,SAAS,SAAS,EAAE,CAA+B,SAAS,oBACzF,IAAI,KAAK;IACb,UAAU;GACZ;EAAE,CAAA;CACJ;CAEA,qBAA6B,MAAgC;EAC3D,MAAM,YAAY,KAAK,QAAQ,QAAQ,IAAI,UAAU,WAAW,IAAI,KAAK;EACzE,KAAK,mBAAmB,MAAM;EAC9B,MAAM,6BAAa,IAAI,IAAqD;EAE5E,KAAK,MAAM,OAAO,WAAW;GAC3B,MAAM,eAAe,KAAK,oBAAoB,GAAG;GAEjD,IAAI,CAAC,WAAW,IAAI,YAAY,GAC9B,WAAW,IAAI,cAAc;IAAE,UAAU,CAAC;IAAG,OAAO;GAAE,CAAC;GAGzD,MAAM,UAAU,WAAW,IAAI,YAAY;GAC3C,IAAI,QAAQ,SAAS,SAAS,GAC5B,QAAQ,SAAS,KAAK,GAAG;GAE3B,QAAQ;GACR,KAAK,mBAAmB,IAAI,cAAc,QAAQ,KAAK;EACzD;EAEA,OAAO,MAAM,KAAK,WAAW,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,SAAS,OAAO,UAAW;;;IACvE,IAAI,iBAAiB;IACrB;IACA,UAAU,KAAK;IACf,WAAW,KAAK;IAChB,YAAA,kBAAU,KAAK,SAAS,KAAK,SAAS,SAAS,QAAA,QAAA,oBAAA,KAAA,IAAA,KAAA,IAAA,gBAAI,aAC/C,IAAI,KAAM,KAAK,SAAS,KAAK,SAAS,SAAS,EAAE,CAA+B,SAAS,oBACzF,IAAI,KAAK;IACb,UAAU;IACV,UAAU;GACZ;EAAE,CAAA;CACJ;CAEA,sBAA8B,MAAgC;EAC5D,MAAM,WAAyB,CAAC;EAChC,MAAM,6BAAa,IAAI,IAAoB;EAG3C,KAAK,MAAM,OAAO,MAAM;GACtB,MAAM,OAAO,IAAI,KAAK,IAAI,SAAS,CAAC,CAAC,SAAS;GAC9C,WAAW,IAAI,OAAO,WAAW,IAAI,IAAI,KAAK,KAAK,CAAC;EACtD;EAGA,MAAM,WAAW,MAAM,KAAK,WAAW,QAAQ,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;EAE9E,IAAI,UACF,SAAS,KAAK;GACZ,IAAI;GACJ,SAAS,yBAAyB,SAAS;GAC3C,UAAU,KAAK,MAAM,GAAG,CAAC;GACzB,WAAW,SAAS;GACpB,0BAAU,IAAI,KAAK;GACnB,UAAU;EACZ,CAAC;EAGH,OAAO;CACT;CAEA,iBAAyB,SAAyB;EAChD,OAAO,QACJ,QAAQ,kEAAkE,QAAQ,CAAC,CACnF,QAAQ,kBAAkB,QAAQ,CAAC,CACnC,QAAQ,QAAQ,OAAO,CAAC,CACxB,QAAQ,YAAY,UAAU,CAAC,CAC/B,QAAQ,qBAAqB,SAAS,CAAC,CACvC,KAAK;CACV;CAEA,oBAA4B,KAAuB;EACjD,IAAI,IAAI,OACN,OAAO,GAAG,IAAI,MAAM,KAAK,IAAI,KAAK,iBAAiB,IAAI,MAAM,WAAW,EAAE;EAE5E,OAAO,KAAK,iBAAiB,IAAI,OAAO;CAC1C;CAEA,MAAc,sBAAsB,KAAgC;EAClE,IAAI,QAAQ;EAIZ,IADyB,KAAK,qBAAqB,GAChC,CAAC,CAAC,WAAW,GAC9B,SAAS;EAIX,IAAI,IAAI,UAAU,SAAS;GACzB,MAAM,eAAe,KAAK,oBAAoB,GAAG;GAEjD,KADkB,KAAK,mBAAmB,IAAI,YAAY,KAAK,KAC/C,GACd,SAAS;EAEb;EAGA,MAAM,OAAO,IAAI,KAAK,IAAI,SAAS,CAAC,CAAC,SAAS;EAC9C,IAAI,OAAO,KAAK,OAAO,IACrB,SAAS;EAGX,OAAO,KAAK,IAAI,OAAO,CAAG;CAC5B;CAEA,sBAA8B,KAAe,OAAuB;EAClE,MAAM,UAAoB,CAAC;EAE3B,IAAI,QAAQ,IACV,QAAQ,KAAK,0BAA0B;OAClC,IAAI,QAAQ,IACjB,QAAQ,KAAK,8BAA8B;OAE3C,QAAQ,KAAK,4BAA4B;EAI3C,IADyB,KAAK,qBAAqB,GAChC,CAAC,CAAC,WAAW,GAC9B,QAAQ,KAAK,mCAAmC;EAGlD,IAAI,IAAI,UAAU,SAChB,QAAQ,KAAK,iBAAiB;EAGhC,MAAM,OAAO,IAAI,KAAK,IAAI,SAAS,CAAC,CAAC,SAAS;EAC9C,IAAI,OAAO,KAAK,OAAO,IACrB,QAAQ,KAAK,2BAA2B;EAG1C,OAAO,QAAQ,KAAK,IAAI;CAC1B;CAEA,eAAuB,KAAyB;EAC9C,MAAM,aAAuB,CAAC;EAG9B,IAAI,CAAC,IAAI,SAAS,WAAW,KAAK,kBAAkB;EACpD,IAAI,CAAC,IAAI,SAAS,WAAW,KAAK,iBAAiB;EAGnD,IAAI,IAAI,WAAW,OAAO,KAAK,IAAI,OAAO,CAAC,CAAC,SAAS,IACnD,WAAW,KAAK,yBAAyB;EAI3C,IAAI,IAAI,UAAU,WAAW,cAAc,IAAI,OAAO,GACpD,WAAW,KAAK,8BAA8B;EAGhD,OAAO;CACT;CAEA,oBAA4B,KAAe,SAA8B;EACvE,MAAM,oBAAoB,KAAK,iBAAiB,IAAI,OAAO;EAE3D,IAAI,QAAQ,OACV,OAAO,QAAQ,MAAM,KAAK,IAAI,OAAO;EAGvC,OAAO,sBAAsB,QAAQ;CACvC;AACF;;;;;ACtRA,IAAa,gBAAb,MAA2B;CACzB;CACA;CACA;CACA;CACA;CAEA,YAAY,QAA8B;EACxC,KAAK,SAAS;GACZ,WAAW;GACX,0BAA0B;GAC1B,mBAAmB;GACnB,cAAc;GACd,cAAc;GACd,GAAG;EACL;EAGA,KAAK,eAAe,KAAK,OAAO,YAAY,IAAI,gBAAgB,IAAI,IAAI,kBAAkB;EAE1F,KAAK,UAAU,IAAI,gBAAgB;GACjC,cAAc,KAAK,OAAO;GAC1B,cAAc,KAAK,OAAO;EAC5B,CAAC;EAED,IAAI,KAAK,OAAO,0BACd,KAAK,gBAAgB,IAAI,yBAAyB;EAGpD,IAAI,KAAK,OAAO,mBACd,KAAK,oBAAoB,IAAI,kBAAkB;CAEnD;;;;CAKA,MAAM,UAAU,MAAiC;EAC/C,MAAM,KAAK,QAAQ,WAAW,IAAI;EAClC,KAAK,aAAa,QAAQ,IAAI;EAG9B,IAAI,KAAK,iBAAiB,KAAK,SAAS,IACtC,MAAM,KAAK,cAAc,gBAAgB,IAAI;CAEjD;;;;CAKA,MAAM,SAAS,KAA8B;EAC3C,MAAM,KAAK,QAAQ,SAAS,GAAG;EAC/B,KAAK,aAAa,QAAQ,CAAC,GAAG,CAAC;CACjC;;;;CAKA,MAAM,OACJ,OACA,SACA,SACyB;EACzB,OAAO,KAAK,aAAa,OAAO,OAAO,SAAS,OAAO;CACzD;;;;CAKA,MAAM,sBAAsB,OAAwC;EAClE,OAAO,KAAK,aAAa,sBAAsB,KAAK;CACtD;;;;CAKA,MAAM,mBAAmB,SAA0C;EACjE,OAAO,KAAK,aAAa,mBAAmB,OAAO;CACrD;;;;CAKA,MAAM,gBAAgB,UAAoB,OAAuC;EAC/E,OAAO,KAAK,aAAa,gBAAgB,UAAU,KAAK;CAC1D;;;;CAKA,MAAM,gBAAgB,KAAe,OAAuC;EAC1E,IAAI,CAAC,KAAK,mBACR,MAAM,IAAI,MAAM,gCAAgC;EAGlD,MAAM,UAAU,KAAK,aAAa,QAAQ;EAC1C,OAAO,KAAK,kBAAkB,gBAAgB,KAAK,SAAS,KAAK;CACnE;;;;CAKA,MAAM,eAAe,cAAsB,OAA6C;EACtF,OAAO,KAAK,aAAa,eAAe,cAAc,KAAK;CAC7D;;;;CAKA,MAAM,WAAiC;EACrC,OAAO,KAAK,aAAa,SAAS;CACpC;;;;CAKA,MAAM,0BAA0B,OAAuC;EACrE,OAAO,KAAK,aAAa,0BAA0B,KAAK;CAC1D;;;;CAKA,MAAM,WACJ,QACuB;EACvB,OAAO,KAAK,aAAa,WAAW,MAAM;CAC5C;;;;CAKA,MAAM,WAAW,QAA0C;EACzD,OAAO,KAAK,aAAa,WAAW,MAAM;CAC5C;;;;CAKA,MAAM,aAAa,UAAiC;EAClD,OAAO,KAAK,aAAa,aAAa,QAAQ;CAChD;;;;CAKA,MAAM,iBAAwC;EAC5C,IAAI,CAAC,KAAK,eACR,MAAM,IAAI,MAAM,iCAAiC;EAGnD,MAAM,UAAU,KAAK,aAAa,QAAQ;EAC1C,OAAO,KAAK,cAAc,gBAAgB,OAAO;CACnD;;;;CAKA,cAA4B;EAC1B,IAAI,CAAC,KAAK,eACR,OAAO,CAAC;EAGV,OAAO,KAAK,cAAc,YAAY;CACxC;;;;CAKA,MAAM,kBAA+C;EACnD,IAAI,CAAC,KAAK,eACR,MAAM,IAAI,MAAM,iCAAiC;EAGnD,MAAM,UAAU,KAAK,aAAa,QAAQ;EAC1C,OAAO,KAAK,cAAc,gBAAgB,OAAO;CACnD;;;;CAKA,MAAM,4BAA4B,UAMO;EACvC,IAAI,CAAC,KAAK,mBACR,MAAM,IAAI,MAAM,gCAAgC;EAGlD,MAAM,UAAU,KAAK,aAAa,QAAQ;EAC1C,OAAO,KAAK,kBAAkB,4BAA4B,SAAS,QAAQ;CAC7E;;;;CAKA,MAAM,oBAAoB,SAIvB;EACD,IAAI,CAAC,KAAK,mBACR,MAAM,IAAI,MAAM,gCAAgC;EAGlD,MAAM,aAAa,MAAM,KAAK,mBAAmB,OAAO;EACxD,OAAO,KAAK,kBAAkB,oBAAoB,WAAW,IAAI;CACnE;;;;CAKA,MAAM,cAAc,SAAyB,SAAyC;EACpF,QAAQ,QAAQ,QAAhB;GACE,KAAK,QACH,OAAO,KAAK,aAAa,SAAS,OAAO;GAC3C,KAAK,OACH,OAAO,KAAK,YAAY,SAAS,OAAO;GAC1C,KAAK,QACH,OAAO,KAAK,aAAa,SAAS,OAAO;GAC3C,SACE,MAAM,IAAI,MAAM,8BAA8B,QAAQ,QAAQ;EAClE;CACF;;;;CAKA,MAAM,aAA4B;EAChC,MAAM,KAAK,QAAQ,WAAW;EAC9B,KAAK,aAAa,UAAU;CAC9B;;;;CAKA,MAAM,gBAA+B;EACnC,MAAM,KAAK,QAAQ,cAAc;CACnC;;;;CAKA,MAAM,gBAIH;EACD,OAAO,KAAK,QAAQ,cAAc;CACpC;;;;CAKA,MAAM,cAAc,WAAkC;EACpD,MAAM,UAAU,MAAM,KAAK,QAAQ,cAAc,SAAS;EAI1D,MAAM,eADU,KAAK,aAAa,QACP,CAAC,CAAC,QAAQ,QAAQ,IAAI,KAAK,IAAI,SAAS,KAAK,SAAS;EAEjF,KAAK,aAAa,UAAU;EAC5B,KAAK,aAAa,QAAQ,YAAY;EAEtC,OAAO;CACT;CAIA,aAAqB,SAAyB,SAAgC;EAC5E,MAAM,OAAO,QAAQ,kBAAkB,UAAU,QAAQ,KAAK,MAAM,EAAE,GAAG;EAEzE,IAAI,QAAQ,QACV,OAAO,KAAK,UACV,KAAK,KAAK,SAAS,KAAK,aAAa,MAAM,QAAQ,MAAO,CAAC,GAC3D,MACA,CACF;EAGF,OAAO,KAAK,UAAU,MAAM,MAAM,CAAC;CACrC;CAEA,YAAoB,SAAyB,SAAgC;EAC3E,MAAM,OAAO,QAAQ,KAAK,MAAM,EAAE,GAAG;EAErC,IAAI,KAAK,WAAW,GAClB,OAAO;EAGT,MAAM,SAAS,QAAQ,UAAU;GAAC;GAAa;GAAS;GAAW;EAAS;EAY5E,OAAO,CAXS,OAAO,KAAK,MAAM,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,GAWtC,GAAG,GATJ,KAAK,KAAK,QAAQ;GAC7B,OAAO,OACJ,KAAK,UAAU;IACd,MAAM,QAAS,IAA2C;IAC1D,OAAO,SAAS,KAAK;GACvB,CAAC,CAAC,CACD,KAAK,GAAG;EACb,CAEuB,CAAC,CAAC,CAAC,KAAK,IAAI;CACrC;CAEA,aAAqB,SAAyB,SAAgC;EAC5E,OAAO,QACJ,KAAK,WAAW;GACf,MAAM,MAAM,OAAO;GACnB,IAAI,OAAO,IAAI,IAAI,UAAU,KAAK,IAAI,MAAM,YAAY,EAAE,IAAI,IAAI,QAAQ,IAAI,IAAI;GAElF,IAAI,QAAQ,iBAAiB;IAC3B,QAAQ,cAAc,OAAO,MAAM,QAAQ,CAAC;IAC5C,IAAI,OAAO,YACT,QAAQ,gBAAgB,OAAO,WAAW;GAE9C;GAEA,OAAO;EACT,CAAC,CAAC,CACD,KAAK,MAAM;CAChB;CAEA,aAAqB,KAAc,QAA2C;EAC5E,MAAM,WAAoC,CAAC;EAE3C,KAAK,MAAM,SAAS,QAClB,IAAI,QAAQ,QAAQ,OAAO,QAAQ,YAAY,SAAS,KACtD,SAAS,SAAU,IAAgC;OAC9C,IAAI,MAAM,SAAS,GAAG,GAAG;GAE9B,MAAM,QAAQ,KAAK,eAAe,KAAK,KAAK;GAC5C,IAAI,UAAU,KAAA,GACZ,SAAS,SAAS;EAEtB;EAGF,OAAO;CACT;CAEA,eAAuB,KAAc,MAAuB;EAC1D,OAAO,KAAK,MAAM,GAAG,CAAC,CAAC,QAAQ,SAAkB,QAAQ;GACvD,IAAI,YAAY,QAAQ,OAAO,YAAY,UACzC,OAAQ,QAAoC;GAG9C,OAAO;EACT,GAAG,GAAG;CACR;AACF"}
|
|
@@ -1,3 +1,4 @@
|
|
|
1
|
+
const require_safe_stringify = require("./safe-stringify-J3sh-7YM.js");
|
|
1
2
|
const require_csv_utils = require("./csv.utils-CbVHY1pd.js");
|
|
2
3
|
// src/search/core/basic-log-indexer.ts
|
|
3
4
|
/**
|
|
@@ -114,8 +115,8 @@ var BasicLogIndexer = class {
|
|
|
114
115
|
const cutoffTime = olderThan.getTime();
|
|
115
116
|
let removedCount = 0;
|
|
116
117
|
for (const [logId, log] of this.index.entries()) if (new Date(log.timestamp).getTime() < cutoffTime) {
|
|
118
|
+
this.removeFromFieldIndices(logId, log);
|
|
117
119
|
this.trackDelete(logId);
|
|
118
|
-
this.removeFromFieldIndices(logId);
|
|
119
120
|
removedCount++;
|
|
120
121
|
}
|
|
121
122
|
return removedCount;
|
|
@@ -159,8 +160,23 @@ var BasicLogIndexer = class {
|
|
|
159
160
|
if (!fieldIndex.has(normalizedValue)) fieldIndex.set(normalizedValue, /* @__PURE__ */ new Set());
|
|
160
161
|
fieldIndex.get(normalizedValue).add(logId);
|
|
161
162
|
}
|
|
162
|
-
removeFromFieldIndices(logId) {
|
|
163
|
-
|
|
163
|
+
removeFromFieldIndices(logId, log) {
|
|
164
|
+
const values = [
|
|
165
|
+
["level", log.level],
|
|
166
|
+
["appName", log.appName],
|
|
167
|
+
["traceId", log.traceId],
|
|
168
|
+
["context", log.context],
|
|
169
|
+
["environment", log.environment]
|
|
170
|
+
];
|
|
171
|
+
for (const [field, value] of values) {
|
|
172
|
+
if (!value) continue;
|
|
173
|
+
const fieldIndex = this.fieldIndices.get(field);
|
|
174
|
+
const key = value.toLowerCase();
|
|
175
|
+
const logIds = fieldIndex === null || fieldIndex === void 0 ? void 0 : fieldIndex.get(key);
|
|
176
|
+
if (!logIds) continue;
|
|
177
|
+
logIds.delete(logId);
|
|
178
|
+
if (logIds.size === 0) fieldIndex.delete(key);
|
|
179
|
+
}
|
|
164
180
|
}
|
|
165
181
|
generateLogId(log) {
|
|
166
182
|
return `${log.timestamp}_${log.level}_${Math.random().toString(36).slice(2, 11)}`;
|
|
@@ -172,7 +188,7 @@ var BasicLogIndexer = class {
|
|
|
172
188
|
trackInsert(logId, log) {
|
|
173
189
|
const existing = this.logSizeById.get(logId);
|
|
174
190
|
if (existing !== void 0) this.indexSizeBytes -= existing;
|
|
175
|
-
const size =
|
|
191
|
+
const size = require_safe_stringify.stringifyForLog(log).length;
|
|
176
192
|
this.index.set(logId, log);
|
|
177
193
|
this.logSizeById.set(logId, size);
|
|
178
194
|
this.indexSizeBytes += size;
|
|
@@ -187,10 +203,14 @@ var BasicLogIndexer = class {
|
|
|
187
203
|
this.index.delete(logId);
|
|
188
204
|
}
|
|
189
205
|
async removeOldestLogs(count) {
|
|
190
|
-
const
|
|
191
|
-
for (const
|
|
206
|
+
const oldest = [];
|
|
207
|
+
for (const entry of this.index) {
|
|
208
|
+
if (oldest.length >= count) break;
|
|
209
|
+
oldest.push(entry);
|
|
210
|
+
}
|
|
211
|
+
for (const [logId, log] of oldest) {
|
|
212
|
+
this.removeFromFieldIndices(logId, log);
|
|
192
213
|
this.trackDelete(logId);
|
|
193
|
-
this.removeFromFieldIndices(logId);
|
|
194
214
|
}
|
|
195
215
|
}
|
|
196
216
|
async clusterLogs(logs) {
|
|
@@ -277,7 +297,9 @@ function extractUserId(query) {
|
|
|
277
297
|
*/
|
|
278
298
|
var BasicSearchEngine = class {
|
|
279
299
|
options;
|
|
280
|
-
|
|
300
|
+
buffer = [];
|
|
301
|
+
/** Index of the oldest live entry in `buffer`; evicted entries are dropped in bulk. */
|
|
302
|
+
head = 0;
|
|
281
303
|
presets = /* @__PURE__ */ new Map();
|
|
282
304
|
searchHistory = [];
|
|
283
305
|
suggestionCache = /* @__PURE__ */ new Map();
|
|
@@ -290,6 +312,14 @@ var BasicSearchEngine = class {
|
|
|
290
312
|
...options
|
|
291
313
|
};
|
|
292
314
|
}
|
|
315
|
+
/** The live logs, oldest first. Compacts away evicted entries on demand. */
|
|
316
|
+
get logs() {
|
|
317
|
+
if (this.head > 0) {
|
|
318
|
+
this.buffer = this.buffer.slice(this.head);
|
|
319
|
+
this.head = 0;
|
|
320
|
+
}
|
|
321
|
+
return this.buffer;
|
|
322
|
+
}
|
|
293
323
|
/**
|
|
294
324
|
* Add logs to the search index.
|
|
295
325
|
*
|
|
@@ -301,15 +331,23 @@ var BasicSearchEngine = class {
|
|
|
301
331
|
*/
|
|
302
332
|
addLogs(logs) {
|
|
303
333
|
var _this$options;
|
|
304
|
-
for (const log of logs) this.
|
|
334
|
+
for (const log of logs) this.buffer.push(log);
|
|
305
335
|
const maxLogs = ((_this$options = this.options) === null || _this$options === void 0 ? void 0 : _this$options.maxLogs) ?? 1e5;
|
|
306
|
-
|
|
336
|
+
const excess = this.buffer.length - this.head - maxLogs;
|
|
337
|
+
if (excess > 0) {
|
|
338
|
+
this.head += excess;
|
|
339
|
+
if (this.head >= Math.max(1, maxLogs / 4)) {
|
|
340
|
+
this.buffer = this.buffer.slice(this.head);
|
|
341
|
+
this.head = 0;
|
|
342
|
+
}
|
|
343
|
+
}
|
|
307
344
|
}
|
|
308
345
|
/**
|
|
309
346
|
* Clear all logs from the index
|
|
310
347
|
*/
|
|
311
348
|
clearLogs() {
|
|
312
|
-
this.
|
|
349
|
+
this.buffer = [];
|
|
350
|
+
this.head = 0;
|
|
313
351
|
}
|
|
314
352
|
/**
|
|
315
353
|
* Get all indexed logs
|
|
@@ -440,9 +478,9 @@ var BasicSearchEngine = class {
|
|
|
440
478
|
*/
|
|
441
479
|
async getStats() {
|
|
442
480
|
return {
|
|
443
|
-
totalResults: this.
|
|
481
|
+
totalResults: this.buffer.length - this.head,
|
|
444
482
|
executionTime: 0,
|
|
445
|
-
indexSize: this.
|
|
483
|
+
indexSize: this.buffer.length - this.head,
|
|
446
484
|
topTerms: this.getTopTerms()
|
|
447
485
|
};
|
|
448
486
|
}
|
|
@@ -1887,4 +1925,4 @@ Object.defineProperty(exports, "SearchManager", {
|
|
|
1887
1925
|
}
|
|
1888
1926
|
});
|
|
1889
1927
|
|
|
1890
|
-
//# sourceMappingURL=search-
|
|
1928
|
+
//# sourceMappingURL=search-_qx4YzRP.js.map
|