log-search 1.0.0

package/dist/query/QueryEngine.d.ts

@@ -0,0 +1,34 @@
+/**
+ * QueryEngine.ts
+ * Full-featured query parser that converts query strings into ParsedQuery trees.
+ *
+ * Supported syntax:
+ *   Simple:   "error"
+ *   Phrase:   "\"connection refused\""
+ *   AND:      "error AND timeout"
+ *   OR:       "error OR warning"
+ *   NOT:      "error NOT 404"
+ *   Regex:    "/error [45]\d{2}/"  or  --regex flag
+ *   Fuzzy:    "~eror"  (threshold default 0.85)
+ *   Level:    "level:ERROR"
+ *   Field:    "status:500"
+ */
+import type { ParsedQuery } from '../types/SearchTypes';
+export interface ParseOptions {
+    ignoreCase?: boolean;
+    isRegex?: boolean;
+}
+export declare class QueryParser {
+    /**
+     * Parse a query string into a ParsedQuery tree.
+     */
+    parse(query: string, options?: ParseOptions): ParsedQuery;
+    private parseExpression;
+    private parseAtom;
+    /**
+     * Split a string by `separator` at the top level (not inside quotes or parens).
+     */
+    private splitTopLevel;
+    private buildRegex;
+}
+//# sourceMappingURL=QueryEngine.d.ts.map

package/dist/query/QueryEngine.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"QueryEngine.d.ts","sourceRoot":"","sources":["../../src/query/QueryEngine.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH,OAAO,KAAK,EACV,WAAW,EAUZ,MAAM,sBAAsB,CAAC;AAE9B,MAAM,WAAW,YAAY;IAC3B,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,OAAO,CAAC,EAAE,OAAO,CAAC;CACnB;AAED,qBAAa,WAAW;IACtB;;OAEG;IACH,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,GAAE,YAAiB,GAAG,WAAW;IA6B7D,OAAO,CAAC,eAAe;IA0CvB,OAAO,CAAC,SAAS;IA8DjB;;OAEG;IACH,OAAO,CAAC,aAAa;IAqCrB,OAAO,CAAC,UAAU;CAWnB"}

package/dist/query/QueryEngine.js

@@ -0,0 +1,187 @@
+"use strict";
+/**
+ * QueryEngine.ts
+ * Full-featured query parser that converts query strings into ParsedQuery trees.
+ *
+ * Supported syntax:
+ *   Simple:   "error"
+ *   Phrase:   "\"connection refused\""
+ *   AND:      "error AND timeout"
+ *   OR:       "error OR warning"
+ *   NOT:      "error NOT 404"
+ *   Regex:    "/error [45]\d{2}/"  or  --regex flag
+ *   Fuzzy:    "~eror"  (threshold default 0.85)
+ *   Level:    "level:ERROR"
+ *   Field:    "status:500"
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.QueryParser = void 0;
+class QueryParser {
+    /**
+     * Parse a query string into a ParsedQuery tree.
+     */
+    parse(query, options = {}) {
+        const raw = query.trim();
+        // ── Explicit regex flag ─────────────────────────────────────────────────
+        if (options.isRegex) {
+            return this.buildRegex(raw, options.ignoreCase ?? true);
+        }
+        // ── Regex literal: /pattern/flags ───────────────────────────────────────
+        const regexLiteral = raw.match(/^\/(.+)\/([gimsuy]*)$/);
+        if (regexLiteral) {
+            try {
+                const flags = (options.ignoreCase ? 'i' : '') + regexLiteral[2].replace(/i/g, '');
+                return {
+                    type: 'regex',
+                    raw,
+                    pattern: new RegExp(regexLiteral[1], flags),
+                };
+            }
+            catch {
+                // Fall through to simple parse
+            }
+        }
+        // ── Tokenize ─────────────────────────────────────────────────────────────
+        return this.parseExpression(raw);
+    }
+    // ─── Recursive Descent Parser ─────────────────────────────────────────────
+    parseExpression(input) {
+        const raw = input.trim();
+        // Split on top-level AND / OR (not inside quotes)
+        const orParts = this.splitTopLevel(raw, ' OR ');
+        if (orParts.length > 1) {
+            return {
+                type: 'or',
+                raw,
+                operands: orParts.map((p) => this.parseExpression(p)),
+            };
+        }
+        const andParts = this.splitTopLevel(raw, ' AND ');
+        if (andParts.length > 1) {
+            return {
+                type: 'and',
+                raw,
+                operands: andParts.map((p) => this.parseExpression(p)),
+            };
+        }
+        // Split on top-level NOT
+        const notParts = this.splitTopLevel(raw, ' NOT ');
+        if (notParts.length === 2) {
+            return {
+                type: 'and',
+                raw,
+                operands: [
+                    this.parseExpression(notParts[0]),
+                    {
+                        type: 'not',
+                        raw: notParts[1],
+                        operand: this.parseExpression(notParts[1]),
+                    },
+                ],
+            };
+        }
+        return this.parseAtom(raw);
+    }
+    parseAtom(raw) {
+        const trimmed = raw.trim();
+        // Phrase query: "exact phrase"
+        if (trimmed.startsWith('"') && trimmed.endsWith('"') && trimmed.length > 2) {
+            const phrase = trimmed.slice(1, -1);
+            const terms = phrase.split(/\s+/).filter(Boolean);
+            if (terms.length === 1) {
+                return { type: 'simple', raw, term: terms[0].toLowerCase() };
+            }
+            return {
+                type: 'phrase',
+                raw,
+                phrase,
+                terms: terms.map((t) => t.toLowerCase()),
+            };
+        }
+        // Fuzzy: ~term
+        if (trimmed.startsWith('~') && trimmed.length > 1) {
+            const fuzzyPart = trimmed.slice(1);
+            const colonIdx = fuzzyPart.lastIndexOf(':');
+            let term = fuzzyPart;
+            let threshold = 0.85;
+            if (colonIdx !== -1) {
+                const t = parseFloat(fuzzyPart.slice(colonIdx + 1));
+                if (!isNaN(t) && t >= 0 && t <= 1) {
+                    term = fuzzyPart.slice(0, colonIdx);
+                    threshold = t;
+                }
+            }
+            return { type: 'fuzzy', raw, term: term.toLowerCase(), threshold };
+        }
+        // Field query: field:value  (e.g., level:ERROR, status:500)
+        const colonIdx = trimmed.indexOf(':');
+        if (colonIdx > 0 && colonIdx < trimmed.length - 1) {
+            const field = trimmed.slice(0, colonIdx).toLowerCase().trim();
+            const value = trimmed.slice(colonIdx + 1).trim().replace(/^"|"$/g, '');
+            if (field === 'level' || field === 'severity') {
+                return {
+                    type: 'level',
+                    raw,
+                    level: value.toUpperCase(),
+                };
+            }
+            return { type: 'field', raw, field, value };
+        }
+        // Parenthesized expression
+        if (trimmed.startsWith('(') && trimmed.endsWith(')')) {
+            return this.parseExpression(trimmed.slice(1, -1));
+        }
+        // Simple term
+        return { type: 'simple', raw, term: trimmed.toLowerCase() };
+    }
+    /**
+     * Split a string by `separator` at the top level (not inside quotes or parens).
+     */
+    splitTopLevel(input, separator) {
+        const parts = [];
+        let depth = 0;
+        let inQuote = false;
+        let current = '';
+        let i = 0;
+        while (i < input.length) {
+            const char = input[i];
+            if (char === '"') {
+                inQuote = !inQuote;
+                current += char;
+                i++;
+                continue;
+            }
+            if (!inQuote) {
+                if (char === '(')
+                    depth++;
+                if (char === ')')
+                    depth--;
+                if (depth === 0 && input.slice(i).startsWith(separator)) {
+                    parts.push(current.trim());
+                    current = '';
+                    i += separator.length;
+                    continue;
+                }
+            }
+            current += char;
+            i++;
+        }
+        if (current.trim())
+            parts.push(current.trim());
+        return parts;
+    }
+    buildRegex(pattern, ignoreCase) {
+        const flags = ignoreCase ? 'gi' : 'g';
+        let regex;
+        try {
+            regex = new RegExp(pattern, flags);
+        }
+        catch {
+            // Escape and retry as literal
+            regex = new RegExp(pattern.replace(/[.*+?^${}()|[\]\\]/g, '\\$&'), flags);
+        }
+        return { type: 'regex', raw: pattern, pattern: regex };
+    }
+}
+exports.QueryParser = QueryParser;
+//# sourceMappingURL=QueryEngine.js.map

package/dist/query/QueryEngine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"QueryEngine.js","sourceRoot":"","sources":["../../src/query/QueryEngine.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;GAcG;;;AAoBH,MAAa,WAAW;IACtB;;OAEG;IACH,KAAK,CAAC,KAAa,EAAE,UAAwB,EAAE;QAC7C,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;QAEzB,2EAA2E;QAC3E,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;YACpB,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,OAAO,CAAC,UAAU,IAAI,IAAI,CAAC,CAAC;QAC1D,CAAC;QAED,2EAA2E;QAC3E,MAAM,YAAY,GAAG,GAAG,CAAC,KAAK,CAAC,uBAAuB,CAAC,CAAC;QACxD,IAAI,YAAY,EAAE,CAAC;YACjB,IAAI,CAAC;gBACH,MAAM,KAAK,GAAG,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;gBAClF,OAAO;oBACL,IAAI,EAAE,OAAO;oBACb,GAAG;oBACH,OAAO,EAAE,IAAI,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC;iBAC9B,CAAC;YAClB,CAAC;YAAC,MAAM,CAAC;gBACP,+BAA+B;YACjC,CAAC;QACH,CAAC;QAED,4EAA4E;QAC5E,OAAO,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;IACnC,CAAC;IAED,6EAA6E;IAErE,eAAe,CAAC,KAAa;QACnC,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;QAEzB,kDAAkD;QAClD,MAAM,OAAO,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QAChD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,OAAO;gBACL,IAAI,EAAE,IAAI;gBACV,GAAG;gBACH,QAAQ,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;aAC3C,CAAC;QACf,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QAClD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,OAAO;gBACL,IAAI,EAAE,KAAK;gBACX,GAAG;gBACH,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;aAC3C,CAAC;QAChB,CAAC;QAED,yBAAyB;QACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;QAClD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,OAAO;gBACL,IAAI,EAAE,KAAK;gBACX,GAAG;gBACH,QAAQ,EAAE;oBACR,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;oBACjC;wBACE,IAAI,EAAE,KAAK;wBACX,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC;wBAChB,OAAO,EAAE,IAAI,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;qBAC/B;iBACd;aACU,CAAC;QAChB,CAAC;QAED,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;IAC7B,CAAC;IAEO,SAAS,CAAC,GAAW;QAC3B,MAAM,OAAO,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;QAE3B,+BAA+B;QAC/B,IAAI,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3E,MAAM,MAAM,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACpC,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAClD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACvB,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,EAAiB,CAAC;YAC9E,CAAC;YACD,OAAO;gBACL,IAAI,EAAE,QAAQ;gBACd,GAAG;gBACH,MAAM;gBACN,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;aAC1B,CAAC;QACnB,CAAC;QAED,eAAe;QACf,IAAI,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAClD,MAAM,SAAS,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACnC,MAAM,QAAQ,GAAG,SAAS,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;YAC5C,IAAI,IAAI,GAAG,SAAS,CAAC;YACrB,IAAI,SAAS,GAAG,IAAI,CAAC;YAErB,IAAI,QAAQ,KAAK,CAAC,CAAC,EAAE,CAAC;gBACpB,MAAM,CAAC,GAAG,UAAU,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC;gBACpD,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;oBAClC,IAAI,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;oBACpC,SAAS,GAAG,CAAC,CAAC;gBAChB,CAAC;YACH,CAAC;YAED,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,WAAW,EAAE,EAAE,SAAS,EAAgB,CAAC;QACnF,CAAC;QAED,4DAA4D;QAC5D,MAAM,QAAQ,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACtC,IAAI,QAAQ,GAAG,CAAC,IAAI,QAAQ,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAClD,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC;YAC9D,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;YAEvE,IAAI,KAAK,KAAK,OAAO,IAAI,KAAK,KAAK,UAAU,EAAE,CAAC;gBAC9C,OAAO;oBACL,IAAI,EAAE,OAAO;oBACb,GAAG;oBACH,KAAK,EAAE,KAAK,CAAC,WAAW,EAAS;iBACpB,CAAC;YAClB,CAAC;YAED,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,EAAgB,CAAC;QAC5D,CAAC;QAED,2BAA2B;QAC3B,IAAI,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YACrD,OAAO,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACpD,CAAC;QAED,cAAc;QACd,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,IAAI,EAAE,OAAO,CAAC,WAAW,EAAE,EAAiB,CAAC;IAC7E,CAAC;IAED;;OAEG;IACK,aAAa,CAAC,KAAa,EAAE,SAAiB;QACpD,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,IAAI,OAAO,GAAG,EAAE,CAAC;QACjB,IAAI,CAAC,GAAG,CAAC,CAAC;QAEV,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;YACxB,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YAEtB,IAAI,IAAI,KAAK,GAAG,EAAE,CAAC;gBACjB,OAAO,GAAG,CAAC,OAAO,CAAC;gBACnB,OAAO,IAAI,IAAI,CAAC;gBAChB,CAAC,EAAE,CAAC;gBACJ,SAAS;YACX,CAAC;YAED,IAAI,CAAC,OAAO,EAAE,CAAC;gBACb,IAAI,IAAI,KAAK,GAAG;oBAAE,KAAK,EAAE,CAAC;gBAC1B,IAAI,IAAI,KAAK,GAAG;oBAAE,KAAK,EAAE,CAAC;gBAE1B,IAAI,KAAK,KAAK,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,SAAS,CAAC,EAAE,CAAC;oBACxD,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;oBAC3B,OAAO,GAAG,EAAE,CAAC;oBACb,CAAC,IAAI,SAAS,CAAC,MAAM,CAAC;oBACtB,SAAS;gBACX,CAAC;YACH,CAAC;YAED,OAAO,IAAI,IAAI,CAAC;YAChB,CAAC,EAAE,CAAC;QACN,CAAC;QAED,IAAI,OAAO,CAAC,IAAI,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;QAC/C,OAAO,KAAK,CAAC;IACf,CAAC;IAEO,UAAU,CAAC,OAAe,EAAE,UAAmB;QACrD,MAAM,KAAK,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC;QACtC,IAAI,KAAa,CAAC;QAClB,IAAI,CAAC;YACH,KAAK,GAAG,IAAI,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QACrC,CAAC;QAAC,MAAM,CAAC;YACP,8BAA8B;YAC9B,KAAK,GAAG,IAAI,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,qBAAqB,EAAE,MAAM,CAAC,EAAE,KAAK,CAAC,CAAC;QAC5E,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;IACzD,CAAC;CACF;AA5LD,kCA4LC"}

package/dist/query/operators/AndOperator.d.ts

@@ -0,0 +1,18 @@
+/**
+ * AndOperator.ts
+ * Returns only lines that match ALL sub-queries.
+ * Performs sorted-merge intersection for optimal performance.
+ */
+export declare class AndOperator {
+    /**
+     * Intersect multiple offset arrays.
+     * All arrays must be sorted ascending.
+     * Uses a merge-pointer approach — O(n) where n = sum of all list lengths.
+     */
+    static intersect(lists: number[][]): number[];
+    /**
+     * Two-pointer intersection of two sorted arrays. O(n + m).
+     */
+    private static intersectTwo;
+}
+//# sourceMappingURL=AndOperator.d.ts.map

package/dist/query/operators/AndOperator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"AndOperator.d.ts","sourceRoot":"","sources":["../../../src/query/operators/AndOperator.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,qBAAa,WAAW;IACtB;;;;OAIG;IACH,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE;IAiB7C;;OAEG;IACH,OAAO,CAAC,MAAM,CAAC,YAAY;CAmB5B"}

package/dist/query/operators/AndOperator.js

@@ -0,0 +1,55 @@
+"use strict";
+/**
+ * AndOperator.ts
+ * Returns only lines that match ALL sub-queries.
+ * Performs sorted-merge intersection for optimal performance.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.AndOperator = void 0;
+class AndOperator {
+    /**
+     * Intersect multiple offset arrays.
+     * All arrays must be sorted ascending.
+     * Uses a merge-pointer approach — O(n) where n = sum of all list lengths.
+     */
+    static intersect(lists) {
+        if (lists.length === 0)
+            return [];
+        if (lists.length === 1)
+            return lists[0];
+        // Sort by list length ascending (smallest first = fewest iterations)
+        const sorted = [...lists].sort((a, b) => a.length - b.length);
+        // Start with the smallest and progressively intersect
+        let result = sorted[0];
+        for (let i = 1; i < sorted.length; i++) {
+            result = this.intersectTwo(result, sorted[i]);
+            if (result.length === 0)
+                return []; // Short-circuit
+        }
+        return result;
+    }
+    /**
+     * Two-pointer intersection of two sorted arrays. O(n + m).
+     */
+    static intersectTwo(a, b) {
+        const result = [];
+        let i = 0;
+        let j = 0;
+        while (i < a.length && j < b.length) {
+            if (a[i] === b[j]) {
+                result.push(a[i]);
+                i++;
+                j++;
+            }
+            else if (a[i] < b[j]) {
+                i++;
+            }
+            else {
+                j++;
+            }
+        }
+        return result;
+    }
+}
+exports.AndOperator = AndOperator;
+//# sourceMappingURL=AndOperator.js.map

package/dist/query/operators/AndOperator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"AndOperator.js","sourceRoot":"","sources":["../../../src/query/operators/AndOperator.ts"],"names":[],"mappings":";AAAA;;;;GAIG;;;AAEH,MAAa,WAAW;IACtB;;;;OAIG;IACH,MAAM,CAAC,SAAS,CAAC,KAAiB;QAChC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAClC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;QAExC,qEAAqE;QACrE,MAAM,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;QAE9D,sDAAsD;QACtD,IAAI,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9C,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,EAAE,CAAC,CAAC,gBAAgB;QACtD,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,YAAY,CAAC,CAAW,EAAE,CAAW;QAClD,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,CAAC,GAAG,CAAC,CAAC;QAEV,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;YACpC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAClB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAClB,CAAC,EAAE,CAAC;gBACJ,CAAC,EAAE,CAAC;YACN,CAAC;iBAAM,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACvB,CAAC,EAAE,CAAC;YACN,CAAC;iBAAM,CAAC;gBACN,CAAC,EAAE,CAAC;YACN,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AA7CD,kCA6CC"}

package/dist/query/operators/NotOperator.d.ts

@@ -0,0 +1,19 @@
+/**
+ * NotOperator.ts
+ * Returns lines from `all` that are NOT in `excluded`.
+ * Uses a sorted set-difference approach.
+ */
+export declare class NotOperator {
+    /**
+     * Set-difference: all offsets in `universe` that are NOT in `excluded`.
+     * Both arrays must be sorted ascending.
+     * O(n + m) time, O(n) space.
+     */
+    static subtract(universe: number[], excluded: number[]): number[];
+    /**
+     * Faster version when both arrays are sorted: two-pointer approach.
+     * O(n + m) time, O(1) extra space (beyond output).
+     */
+    static subtractSorted(universe: number[], excluded: number[]): number[];
+}
+//# sourceMappingURL=NotOperator.d.ts.map

package/dist/query/operators/NotOperator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"NotOperator.d.ts","sourceRoot":"","sources":["../../../src/query/operators/NotOperator.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,qBAAa,WAAW;IACtB;;;;OAIG;IACH,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE;IAQjE;;;OAGG;IACH,MAAM,CAAC,cAAc,CAAC,QAAQ,EAAE,MAAM,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE;CAgBxE"}

package/dist/query/operators/NotOperator.js

@@ -0,0 +1,43 @@
+"use strict";
+/**
+ * NotOperator.ts
+ * Returns lines from `all` that are NOT in `excluded`.
+ * Uses a sorted set-difference approach.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.NotOperator = void 0;
+class NotOperator {
+    /**
+     * Set-difference: all offsets in `universe` that are NOT in `excluded`.
+     * Both arrays must be sorted ascending.
+     * O(n + m) time, O(n) space.
+     */
+    static subtract(universe, excluded) {
+        if (excluded.length === 0)
+            return [...universe];
+        if (universe.length === 0)
+            return [];
+        const excludedSet = new Set(excluded);
+        return universe.filter((o) => !excludedSet.has(o));
+    }
+    /**
+     * Faster version when both arrays are sorted: two-pointer approach.
+     * O(n + m) time, O(1) extra space (beyond output).
+     */
+    static subtractSorted(universe, excluded) {
+        const result = [];
+        let i = 0;
+        let j = 0;
+        while (i < universe.length) {
+            while (j < excluded.length && excluded[j] < universe[i])
+                j++;
+            if (j >= excluded.length || excluded[j] !== universe[i]) {
+                result.push(universe[i]);
+            }
+            i++;
+        }
+        return result;
+    }
+}
+exports.NotOperator = NotOperator;
+//# sourceMappingURL=NotOperator.js.map

package/dist/query/operators/NotOperator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"NotOperator.js","sourceRoot":"","sources":["../../../src/query/operators/NotOperator.ts"],"names":[],"mappings":";AAAA;;;;GAIG;;;AAEH,MAAa,WAAW;IACtB;;;;OAIG;IACH,MAAM,CAAC,QAAQ,CAAC,QAAkB,EAAE,QAAkB;QACpD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,GAAG,QAAQ,CAAC,CAAC;QAChD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAErC,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC;QACtC,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,cAAc,CAAC,QAAkB,EAAE,QAAkB;QAC1D,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,CAAC,GAAG,CAAC,CAAC;QAEV,OAAO,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;YAC3B,OAAO,CAAC,GAAG,QAAQ,CAAC,MAAM,IAAI,QAAQ,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;gBAAE,CAAC,EAAE,CAAC;YAE7D,IAAI,CAAC,IAAI,QAAQ,CAAC,MAAM,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;gBACxD,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3B,CAAC;YACD,CAAC,EAAE,CAAC;QACN,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AAlCD,kCAkCC"}

package/dist/query/operators/OrOperator.d.ts

@@ -0,0 +1,17 @@
+/**
+ * OrOperator.ts
+ * Returns lines that match ANY of the sub-queries.
+ * Performs a sorted merge union.
+ */
+export declare class OrOperator {
+    /**
+     * Union multiple sorted offset arrays into a single sorted, deduplicated array.
+     * Uses a k-way merge — O(n log k) where n = total elements.
+     */
+    static union(lists: number[][]): number[];
+    /**
+     * Merge two sorted arrays into a sorted, deduplicated array. O(n + m).
+     */
+    static mergeTwo(a: number[], b: number[]): number[];
+}
+//# sourceMappingURL=OrOperator.d.ts.map

package/dist/query/operators/OrOperator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"OrOperator.d.ts","sourceRoot":"","sources":["../../../src/query/operators/OrOperator.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,qBAAa,UAAU;IACrB;;;OAGG;IACH,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,GAAG,MAAM,EAAE;IAYzC;;OAEG;IACH,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE;CAsBpD"}

package/dist/query/operators/OrOperator.js

@@ -0,0 +1,54 @@
+"use strict";
+/**
+ * OrOperator.ts
+ * Returns lines that match ANY of the sub-queries.
+ * Performs a sorted merge union.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.OrOperator = void 0;
+class OrOperator {
+    /**
+     * Union multiple sorted offset arrays into a single sorted, deduplicated array.
+     * Uses a k-way merge — O(n log k) where n = total elements.
+     */
+    static union(lists) {
+        if (lists.length === 0)
+            return [];
+        if (lists.length === 1)
+            return [...lists[0]];
+        const result = new Set();
+        for (const list of lists) {
+            for (const offset of list)
+                result.add(offset);
+        }
+        return [...result].sort((a, b) => a - b);
+    }
+    /**
+     * Merge two sorted arrays into a sorted, deduplicated array. O(n + m).
+     */
+    static mergeTwo(a, b) {
+        const result = [];
+        let i = 0;
+        let j = 0;
+        while (i < a.length && j < b.length) {
+            if (a[i] === b[j]) {
+                result.push(a[i]);
+                i++;
+                j++;
+            }
+            else if (a[i] < b[j]) {
+                result.push(a[i++]);
+            }
+            else {
+                result.push(b[j++]);
+            }
+        }
+        while (i < a.length)
+            result.push(a[i++]);
+        while (j < b.length)
+            result.push(b[j++]);
+        return result;
+    }
+}
+exports.OrOperator = OrOperator;
+//# sourceMappingURL=OrOperator.js.map

package/dist/query/operators/OrOperator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"OrOperator.js","sourceRoot":"","sources":["../../../src/query/operators/OrOperator.ts"],"names":[],"mappings":";AAAA;;;;GAIG;;;AAEH,MAAa,UAAU;IACrB;;;OAGG;IACH,MAAM,CAAC,KAAK,CAAC,KAAiB;QAC5B,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAClC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAE7C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;QACjC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,KAAK,MAAM,MAAM,IAAI,IAAI;gBAAE,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAChD,CAAC;QAED,OAAO,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC3C,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,QAAQ,CAAC,CAAW,EAAE,CAAW;QACtC,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,CAAC,GAAG,CAAC,CAAC;QAEV,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;YACpC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAClB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAClB,CAAC,EAAE,CAAC;gBACJ,CAAC,EAAE,CAAC;YACN,CAAC;iBAAM,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACvB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACtB,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QAED,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM;YAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACzC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM;YAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAEzC,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AA1CD,gCA0CC"}

package/dist/query/operators/RangeOperator.d.ts

@@ -0,0 +1,23 @@
+/**
+ * RangeOperator.ts
+ * Filters a list of line contents by a value range (timestamps, HTTP status codes, etc.).
+ */
+export interface RangeFilter {
+    field: 'timestamp' | 'status' | 'size' | 'custom';
+    from?: string | number;
+    to?: string | number;
+}
+export declare class RangeOperator {
+    /**
+     * Filter lines to those where the extracted field value falls within [from, to].
+     * Returns the indices (into `lines`) that pass the filter.
+     */
+    static filterLines(lines: string[], offsets: number[], filter: RangeFilter): number[];
+    /**
+     * Filter by timestamp range (ISO date strings).
+     */
+    static filterByTimestamp(offsets: number[], lines: string[], since?: string, until?: string): number[];
+    private static extractField;
+    private static inRange;
+}
+//# sourceMappingURL=RangeOperator.d.ts.map

package/dist/query/operators/RangeOperator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"RangeOperator.d.ts","sourceRoot":"","sources":["../../../src/query/operators/RangeOperator.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,MAAM,WAAW,WAAW;IAC1B,KAAK,EAAE,WAAW,GAAG,QAAQ,GAAG,MAAM,GAAG,QAAQ,CAAC;IAClD,IAAI,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IACvB,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;CACtB;AAED,qBAAa,aAAa;IACxB;;;OAGG;IACH,MAAM,CAAC,WAAW,CAChB,KAAK,EAAE,MAAM,EAAE,EACf,OAAO,EAAE,MAAM,EAAE,EACjB,MAAM,EAAE,WAAW,GAClB,MAAM,EAAE;IAaX;;OAEG;IACH,MAAM,CAAC,iBAAiB,CACtB,OAAO,EAAE,MAAM,EAAE,EACjB,KAAK,EAAE,MAAM,EAAE,EACf,KAAK,CAAC,EAAE,MAAM,EACd,KAAK,CAAC,EAAE,MAAM,GACb,MAAM,EAAE;IAcX,OAAO,CAAC,MAAM,CAAC,YAAY;IAmB3B,OAAO,CAAC,MAAM,CAAC,OAAO;CASvB"}

package/dist/query/operators/RangeOperator.js

@@ -0,0 +1,63 @@
+"use strict";
+/**
+ * RangeOperator.ts
+ * Filters a list of line contents by a value range (timestamps, HTTP status codes, etc.).
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.RangeOperator = void 0;
+class RangeOperator {
+    /**
+     * Filter lines to those where the extracted field value falls within [from, to].
+     * Returns the indices (into `lines`) that pass the filter.
+     */
+    static filterLines(lines, offsets, filter) {
+        const result = [];
+        for (let i = 0; i < lines.length; i++) {
+            const value = this.extractField(lines[i], filter.field);
+            if (value !== null && this.inRange(value, filter.from, filter.to)) {
+                result.push(offsets[i]);
+            }
+        }
+        return result;
+    }
+    /**
+     * Filter by timestamp range (ISO date strings).
+     */
+    static filterByTimestamp(offsets, lines, since, until) {
+        const sinceMs = since ? new Date(since).getTime() : 0;
+        const untilMs = until ? new Date(until).getTime() : Infinity;
+        const ISO_TS = /\d{4}-\d{2}-\d{2}[T ]\d{2}:\d{2}:\d{2}/;
+        return offsets.filter((_, i) => {
+            const match = lines[i].match(ISO_TS);
+            if (!match)
+                return true; // include if no timestamp found
+            const ts = new Date(match[0]).getTime();
+            return ts >= sinceMs && ts <= untilMs;
+        });
+    }
+    static extractField(line, field) {
+        switch (field) {
+            case 'timestamp': {
+                const m = line.match(/\d{4}-\d{2}-\d{2}[T ]\d{2}:\d{2}:\d{2}/);
+                return m ? new Date(m[0]).getTime() : null;
+            }
+            case 'status': {
+                const m = line.match(/"\s+(\d{3})\s+/);
+                return m ? parseInt(m[1], 10) : null;
+            }
+            case 'size': {
+                const m = line.match(/\s(\d+)$/);
+                return m ? parseInt(m[1], 10) : null;
+            }
+            default:
+                return null;
+        }
+    }
+    static inRange(value, from, to) {
+        const lo = from !== undefined ? Number(from) : -Infinity;
+        const hi = to !== undefined ? Number(to) : Infinity;
+        return value >= lo && value <= hi;
+    }
+}
+exports.RangeOperator = RangeOperator;
+//# sourceMappingURL=RangeOperator.js.map

package/dist/query/operators/RangeOperator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"RangeOperator.js","sourceRoot":"","sources":["../../../src/query/operators/RangeOperator.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAQH,MAAa,aAAa;IACxB;;;OAGG;IACH,MAAM,CAAC,WAAW,CAChB,KAAe,EACf,OAAiB,EACjB,MAAmB;QAEnB,MAAM,MAAM,GAAa,EAAE,CAAC;QAE5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;YACxD,IAAI,KAAK,KAAK,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC;gBAClE,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,iBAAiB,CACtB,OAAiB,EACjB,KAAe,EACf,KAAc,EACd,KAAc;QAEd,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACtD,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC;QAE7D,MAAM,MAAM,GAAG,wCAAwC,CAAC;QAExD,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAC7B,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YACrC,IAAI,CAAC,KAAK;gBAAE,OAAO,IAAI,CAAC,CAAC,gCAAgC;YACzD,MAAM,EAAE,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;YACxC,OAAO,EAAE,IAAI,OAAO,IAAI,EAAE,IAAI,OAAO,CAAC;QACxC,CAAC,CAAC,CAAC;IACL,CAAC;IAEO,MAAM,CAAC,YAAY,CAAC,IAAY,EAAE,KAAa;QACrD,QAAQ,KAAK,EAAE,CAAC;YACd,KAAK,WAAW,CAAC,CAAC,CAAC;gBACjB,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,wCAAwC,CAAC,CAAC;gBAC/D,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;YAC7C,CAAC;YACD,KAAK,QAAQ,CAAC,CAAC,CAAC;gBACd,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC;gBACvC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YACvC,CAAC;YACD,KAAK,MAAM,CAAC,CAAC,CAAC;gBACZ,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;gBACjC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YACvC,CAAC;YACD;gBACE,OAAO,IAAI,CAAC;QAChB,CAAC;IACH,CAAC;IAEO,MAAM,CAAC,OAAO,CACpB,KAAa,EACb,IAAsB,EACtB,EAAoB;QAEpB,MAAM,EAAE,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;QACzD,MAAM,EAAE,GAAG,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;QACpD,OAAO,KAAK,IAAI,EAAE,IAAI,KAAK,IAAI,EAAE,CAAC;IACpC,CAAC;CACF;AAxED,sCAwEC"}

package/dist/query/regex/FuzzyMatcher.d.ts

@@ -0,0 +1,29 @@
+/**
+ * FuzzyMatcher.ts
+ * Performs approximate string matching using Jaro-Winkler similarity.
+ * Used for fuzzy search queries (e.g., ~"eror" finds "error").
+ */
+export declare class FuzzyMatcher {
+    private term;
+    private threshold;
+    constructor(term: string, threshold?: number);
+    /**
+     * Check if a line contains a token similar to the search term.
+     */
+    test(line: string): boolean;
+    /**
+     * Find approximate matches in a line and return their positions.
+     */
+    findMatches(line: string): Array<{
+        token: string;
+        score: number;
+        start: number;
+        end: number;
+    }>;
+    /**
+     * Jaro-Winkler similarity between two strings.
+     * Returns a value in [0, 1].
+     */
+    similarity(s1: string, s2: string): number;
+}
+//# sourceMappingURL=FuzzyMatcher.d.ts.map

package/dist/query/regex/FuzzyMatcher.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"FuzzyMatcher.d.ts","sourceRoot":"","sources":["../../../src/query/regex/FuzzyMatcher.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,qBAAa,YAAY;IACvB,OAAO,CAAC,IAAI,CAAS;IACrB,OAAO,CAAC,SAAS,CAAS;gBAEd,IAAI,EAAE,MAAM,EAAE,SAAS,GAAE,MAAa;IAKlD;;OAEG;IACH,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAK3B;;OAEG;IACH,WAAW,CAAC,IAAI,EAAE,MAAM,GAAG,KAAK,CAAC;QAAE,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,GAAG,EAAE,MAAM,CAAA;KAAE,CAAC;IAgB9F;;;OAGG;IACH,UAAU,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,MAAM;CA6C3C"}