@statewalker/db-sqlite-index 0.1.0 → 0.1.1

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.
@@ -1 +1 @@
1
- {"version":3,"file":"ngram.d.mts","names":[],"sources":["../src/ngram/fold.ts","../src/ngram/fts5-backend.ts","../src/ngram/ngram-store.ts","../src/ngram/plan-query.ts","../src/ngram/trigrams.ts"],"mappings":";;;;;;;;;;;;;;wBAYgB,KAAK;;;KCRT;EAAc;EAAY;;;;KCI1B;EAAe;EAAe;;KAC9B;EAAa;EAAY,SAAS;;KAClC;;EAEV;;EAEA;;EAEA;;EAEA;;EAEA,UAAU;EACV,SAAS;;KAEC;;EAEV,MAAM;;EAEN;;KAEU;EAAsB,IAAI;EAAI;EAAgB;;qBAI7C;;;WAEF;EAMT,cAAc,IAAI,QAAQ,SAAkB;EAatC,QAAQ;EAuBR,OAAO,OAAO,cAAc;EA0B5B,OAAO,gBAAgB;EAavB,OAAO,iBAAiB,OAAM,qBAA0B,QAAQ;;EAwChE,SAAS,gBAAgB,QAAQ;;EAMjC,QAAQ;;;;;qBC9JH;KAED;;EAEV,OAAO;;;;;EAKP;;wBAGc,UACd,iBACA;EAAQ;EAAiB;IACxB;;;;wBCRa,SAAS"}
1
+ {"version":3,"file":"ngram.d.mts","names":[],"sources":["../src/ngram/fold.ts","../src/ngram/fts5-backend.ts","../src/ngram/ngram-store.ts","../src/ngram/plan-query.ts","../src/ngram/trigrams.ts"],"mappings":";;;;;;;;;;;;;;wBAYgB,KAAK;;;KCRT;EAAc;EAAY;;;;KCK1B;EAAe;EAAe;;KAC9B;EAAa;EAAY,SAAS;;KAClC;;EAEV;;EAEA;;EAEA;;EAEA;;EAEA,UAAU;EACV,SAAS;;KAEC;;EAEV,MAAM;;EAEN;;KAEU;EAAsB,IAAI;EAAI;EAAgB;;qBAI7C;;;WAEF;EAMT,cAAc,IAAI,QAAQ,SAAkB;EAatC,QAAQ;EAuBR,OAAO,OAAO,cAAc;EA0B5B,OAAO,gBAAgB;EAavB,OAAO,iBAAiB,OAAM,qBAA0B,QAAQ;;EAwChE,SAAS,gBAAgB,QAAQ;;EAMjC,QAAQ;;;;;qBC/JH;KAED;;EAEV,OAAO;;;;;EAKP;;wBAGc,UACd,iBACA;EAAQ;EAAiB;IACxB;;;;wBCRa,SAAS"}
package/dist/ngram.mjs CHANGED
@@ -1,3 +1,4 @@
1
+ import { t as PREFIX_PATTERN } from "./prefix-CTeW1EwH.mjs";
1
2
  import { inTransaction } from "@statewalker/db-sqlite";
2
3
  //#region src/ngram/fold.ts
3
4
  /**
@@ -502,7 +503,7 @@ var NgramStore = class {
502
503
  #store;
503
504
  #backend;
504
505
  constructor({ db, prefix, store = "fts5" }) {
505
- if (!/^[A-Za-z_][A-Za-z0-9_]*$/.test(prefix)) throw new Error(`ngram: prefix "${prefix}" must match /^[A-Za-z_][A-Za-z0-9_]*$/`);
506
+ if (!PREFIX_PATTERN.test(prefix)) throw new Error(`ngram: prefix "${prefix}" must match ${PREFIX_PATTERN}`);
506
507
  if (store !== "fts5" && store !== "postings") throw new Error(`ngram: unknown store "${store}"`);
507
508
  this.#db = db;
508
509
  this.#prefix = prefix;
@@ -1 +1 @@
1
- {"version":3,"file":"ngram.mjs","names":[],"sources":["../src/ngram/fold.ts","../src/ngram/json-chunks.ts","../src/ngram/fts5-backend.ts","../src/ngram/regex-literals.ts","../src/ngram/plan-query.ts","../src/ngram/trigrams.ts","../src/ngram/postings-backend.ts","../src/ngram/ngram-store.ts"],"sourcesContent":["/**\n * Case fold per code point, applied to indexed text and to query literals alike.\n *\n * Upper-then-lower maps every character a case-insensitive JS regex treats as\n * equal to one form (Σ σ ς → σ, ſ → s). A character whose upper case is several\n * code points (ß → SS) only matches itself under `/i`, so it keeps its own\n * lower case. Folding per code point makes fold(a + b) === fold(a) + fold(b), so\n * a substring of the text stays a substring of the folded text. A character\n * whose folded form has a different UTF-16 length (İ → i + U+0307) is kept as\n * is, so fold preserves the length and offsets into the folded text are\n * offsets into the original.\n */\nexport function fold(text: string): string {\n let out = \"\";\n for (const ch of text) {\n const upper = ch.toUpperCase();\n const lower = (Array.from(upper).length === 1 ? upper : ch).toLowerCase();\n out += lower.length === ch.length ? lower : ch;\n }\n return out;\n}\n","/**\n * Serialises rows into JSON array parameters for `json_each(?)`, each at most\n * `maxChars` UTF-16 code units. 500k code units stay under a Durable Object's\n * ~2 MB string limit even at 4 bytes per code point; a single row larger than\n * that still fails there with \"string or blob too big\".\n */\nexport function chunkJson(rows: unknown[], maxChars = 500_000): string[] {\n const chunks: string[] = [];\n let current: string[] = [];\n let size = 2;\n for (const row of rows) {\n const json = JSON.stringify(row);\n if (current.length > 0 && size + json.length + 1 > maxChars) {\n chunks.push(`[${current.join(\",\")}]`);\n current = [];\n size = 2;\n }\n current.push(json);\n size += json.length + 1;\n }\n if (current.length > 0) chunks.push(`[${current.join(\",\")}]`);\n return chunks;\n}\n","import type { Db } from \"@statewalker/db-api\";\nimport { fold } from \"./fold.js\";\nimport { chunkJson } from \"./json-chunks.js\";\n\nexport type NgramItem = { id: number; text: string };\n\n/** How one store finds candidate ids; texts and verification live in NgramStore. */\nexport type GramBackend = {\n create(tx: Db): Promise<void>;\n add(tx: Db, items: NgramItem[]): Promise<void>;\n /** `items` hold the texts as currently stored, so their grams can be removed exactly. */\n remove(tx: Db, items: NgramItem[]): Promise<void>;\n /** Ids whose text contains every literal of at least one branch; ascending, at most `max`. */\n candidates(db: Db, branches: string[][], max: number): Promise<number[]>;\n};\n\nconst ROW = \"json_extract(value, '$[0]'), json_extract(value, '$[1]')\";\n\n/**\n * FTS5 trigram over folded text. Contentless (`content=''`), because NgramStore\n * already keeps the text; a contentless row is deleted by replaying its exact\n * indexed value through the 'delete' command, which is why `remove` needs the\n * stored texts. `case_sensitive 1`: folding is done by `fold`, the same function\n * that folds query literals, so the index and the planner can never disagree.\n */\nexport function newFts5Backend(prefix: string): GramBackend {\n const table = `${prefix}ng`;\n const write = async (tx: Db, items: NgramItem[], command: \"insert\" | \"delete\") => {\n const sql =\n command === \"insert\"\n ? `INSERT INTO ${table}(rowid, text) SELECT ${ROW} FROM json_each(?)`\n : `INSERT INTO ${table}(${table}, rowid, text) SELECT 'delete', ${ROW} FROM json_each(?)`;\n for (const chunk of chunkJson(items.map((item) => [item.id, fold(item.text)]))) {\n await tx.query(sql, [chunk]);\n }\n };\n return {\n create: (tx) =>\n tx.exec(\n `CREATE VIRTUAL TABLE IF NOT EXISTS ${table} USING fts5(text, content='', tokenize='trigram case_sensitive 1')`,\n ),\n add: (tx, items) => write(tx, items, \"insert\"),\n remove: (tx, items) => write(tx, items, \"delete\"),\n async candidates(db, branches, max) {\n // A quoted string is a phrase of consecutive trigrams, i.e. an exact substring.\n const quote = (literal: string) => `\"${literal.replaceAll('\"', '\"\"')}\"`;\n const match = branches.map((branch) => `(${branch.map(quote).join(\" AND \")})`).join(\" OR \");\n const rows = await db.query<{ id: number }>(\n `SELECT rowid AS id FROM ${table} WHERE ${table} MATCH ? ORDER BY rowid LIMIT ?`,\n [match, max],\n );\n return rows.map((row) => Number(row.id));\n },\n };\n}\n","/*\n * Mandatory-literal extraction from a regex, after Russ Cox's trigram method.\n * Ported from hypgrep 0.5.3 src/regex.js (Hyperparam), MIT License:\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy of this\n * software and associated documentation files (the \"Software\"), to deal in the Software\n * without restriction, including without limitation the rights to use, copy, modify,\n * merge, publish, distribute, sublicense, and/or sell copies of the Software, and to\n * permit persons to whom the Software is furnished to do so, subject to the following\n * conditions: The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED \"AS IS\",\n * WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED.\n */\n\n/** Cross-product cap: past it, the construct counts as a wildcard. */\nconst MAX_DNF = 32;\n\ntype LiveBranch = { literals: string[]; run: string };\ntype Quantifier = { copies: number; openEnded: boolean; end: number };\ntype GroupPrefix = { kind: \"consuming\"; innerStart: number } | { kind: \"assertion\" | \"unknown\" };\n\n/**\n * DNF of literals that every match must contain: a string can match only if all\n * literals of at least one branch occur in it. An empty branch matches anything.\n * Conservative: a construct it cannot reason about becomes a wildcard, never a literal.\n *\n * /abc(def|ghi)/ → [[\"abcdef\"], [\"abcghi\"]] /foo|.+/ → [[\"foo\"], []]\n */\nexport function regexLiterals(regex: RegExp): string[][] {\n // v-mode class syntax desyncs skipClass and would invent literals.\n if (regex.flags.includes(\"v\")) return [[]];\n return expandRegion(regex.source, 0, regex.source.length).dnf;\n}\n\n/** `exact`: every arm is one contiguous literal that is the arm's whole match, with nothing dropped. */\ntype Region = { dnf: string[][]; exact: boolean };\n\nfunction expandRegion(src: string, start: number, end: number): Region {\n const dnf: string[][] = [];\n let exact = true;\n for (const [bStart, bEnd] of splitTopLevelAlternation(src, start, end)) {\n const arm = expandBranch(src, bStart, bEnd);\n for (const branch of arm.dnf) dnf.push(branch);\n exact = exact && arm.exact;\n }\n return { dnf, exact };\n}\n\nfunction splitTopLevelAlternation(\n src: string,\n start: number,\n end: number,\n): Array<[number, number]> {\n const spans: Array<[number, number]> = [];\n let bStart = start;\n let depth = 0;\n let i = start;\n while (i < end) {\n const c = src[i];\n if (c === \"\\\\\") {\n i += 2;\n continue;\n }\n if (c === \"[\") {\n i = skipClass(src, i);\n continue;\n }\n if (c === \"(\") depth += 1;\n else if (c === \")\") depth -= 1;\n else if (c === \"|\" && depth === 0) {\n spans.push([bStart, i]);\n bStart = i + 1;\n }\n i += 1;\n }\n spans.push([bStart, end]);\n return spans;\n}\n\nfunction expandBranch(src: string, start: number, end: number): Region {\n let cross: LiveBranch[] = [{ literals: [], run: \"\" }];\n // Set when part of the match is not captured in a literal (wildcard, optional or repeated\n // atom, assertion): gluing this branch to neighbouring text would be unsound.\n let lossy = false;\n const flushRuns = () => {\n for (const b of cross) {\n if (b.run.length > 0) {\n b.literals.push(b.run);\n b.run = \"\";\n }\n }\n };\n // Append `text` repeated by the quantifier's mandatory copies to every live run.\n const appendRun = (text: string, q: Quantifier) => {\n if (q.copies === 0) {\n lossy = true;\n flushRuns();\n return;\n }\n for (const b of cross) b.run += text.repeat(q.copies);\n if (q.openEnded) {\n lossy = true;\n flushRuns();\n }\n };\n\n let i = start;\n while (i < end) {\n const c = src[i] ?? \"\";\n\n if (c === \"^\" || c === \"$\") {\n i += 1;\n continue;\n }\n\n if (c === \"\\\\\") {\n const next = src[i + 1];\n if (next === undefined) {\n i += 1;\n continue;\n }\n const escaped = parseEscapedLiteral(src, i);\n if (escaped) {\n const q = peekQuantifier(src, escaped.end);\n i = q.end;\n appendRun(escaped.char, q);\n continue;\n }\n // \\d \\w \\s \\b, backrefs, \\p{…}: a wildcard; consume its payload.\n if (/[a-zA-Z0-9]/.test(next)) {\n lossy = true;\n flushRuns();\n i = peekQuantifier(src, skipSpecialEscape(src, i)).end;\n continue;\n }\n // \\. \\/ \\( …: the literal character.\n const q = peekQuantifier(src, i + 2);\n i = q.end;\n appendRun(next, q);\n continue;\n }\n\n if (c === \"[\") {\n const classEnd = skipClass(src, i);\n const chars = parseLiteralClass(src, i, classEnd);\n const q = peekQuantifier(src, classEnd);\n i = q.end;\n if (\n q.copies === 0 ||\n chars === null ||\n q.copies > 1 ||\n cross.length * chars.length > MAX_DNF\n ) {\n lossy = true;\n flushRuns();\n continue;\n }\n cross = cross.flatMap((b) =>\n chars.map((ch) => ({ literals: b.literals.slice(), run: b.run + ch })),\n );\n if (q.openEnded) {\n lossy = true;\n flushRuns();\n }\n continue;\n }\n\n if (c === \"(\") {\n const groupEnd = skipGroup(src, i);\n const group = parseGroupPrefix(src, i);\n const q = peekQuantifier(src, groupEnd);\n i = q.end;\n if (group.kind !== \"consuming\" || q.copies === 0) {\n lossy = true;\n flushRuns();\n continue;\n }\n const { dnf: inner, exact } = expandRegion(src, group.innerStart, groupEnd - 1);\n // Fold into the run only when every arm is one contiguous literal used once and is the\n // arm's whole match: a repeated group (`(a|b){3}`) may pick different arms per copy, and\n // a wildcard at an arm's edge (`x(.abc)`) must not be glued away.\n const foldable =\n exact && q.copies === 1 && inner.length > 0 && inner.every((b) => b.length === 1);\n lossy = lossy || q.openEnded || !foldable;\n if (foldable && cross.length * inner.length <= MAX_DNF) {\n cross = cross.flatMap((b) =>\n inner.map((arm) => ({ literals: b.literals.slice(), run: b.run + (arm[0] ?? \"\") })),\n );\n if (q.openEnded) flushRuns();\n continue;\n }\n lossy = true;\n flushRuns();\n if (cross.length * inner.length > MAX_DNF) continue;\n cross = cross.flatMap((b) =>\n inner.map((arm) => ({ literals: b.literals.concat(arm), run: \"\" })),\n );\n continue;\n }\n\n if (c === \".\") {\n lossy = true;\n flushRuns();\n i = peekQuantifier(src, i + 1).end;\n continue;\n }\n\n const q = peekQuantifier(src, i + 1);\n i = q.end;\n appendRun(c, q);\n }\n flushRuns();\n return {\n dnf: cross.map((b) => b.literals),\n exact: !lossy && cross.every((b) => b.literals.length === 1),\n };\n}\n\n/** Where a group's consuming body starts; lookarounds and unknown `(?…)` are not consuming. */\nfunction parseGroupPrefix(src: string, start: number): GroupPrefix {\n if (src[start + 1] !== \"?\") return { kind: \"consuming\", innerStart: start + 1 };\n const marker = src[start + 2];\n if (marker === \":\") return { kind: \"consuming\", innerStart: start + 3 };\n if (marker === \"=\" || marker === \"!\") return { kind: \"assertion\" };\n if (marker === \"<\") {\n const next = src[start + 3];\n if (next === \"=\" || next === \"!\") return { kind: \"assertion\" };\n const nameEnd = src.indexOf(\">\", start + 3);\n if (nameEnd >= 0) return { kind: \"consuming\", innerStart: nameEnd + 1 };\n }\n return { kind: \"unknown\" };\n}\n\n/**\n * `\\xHH`, `\\uHHHH`: escapes that stand for one literal character. `\\u{…}` is not one:\n * the planner compiles without the `u` flag, where it means \"u\" repeated or the text \"u{…}\".\n */\nfunction parseEscapedLiteral(\n src: string,\n start: number,\n): { char: string; end: number } | undefined {\n const kind = src[start + 1];\n if (kind === \"x\") {\n const hex = src.slice(start + 2, start + 4);\n if (!/^[0-9a-fA-F]{2}$/.test(hex)) return undefined;\n return { char: String.fromCharCode(Number.parseInt(hex, 16)), end: start + 4 };\n }\n if (kind === \"u\") {\n const hex = src.slice(start + 2, start + 6);\n if (!/^[0-9a-fA-F]{4}$/.test(hex)) return undefined;\n return { char: String.fromCharCode(Number.parseInt(hex, 16)), end: start + 6 };\n }\n return undefined;\n}\n\n/**\n * Skip an escape that is not a literal punctuation character, so its payload\n * (`\\x41`, `\\p{L}`, `\\k<name>`, backrefs) never leaks into a literal. Malformed\n * `\\x`, `\\u`, `\\c` payloads are Annex-B literals and are rescanned as atoms.\n */\nfunction skipSpecialEscape(src: string, start: number): number {\n const next = src[start + 1];\n if (next === \"x\") {\n return /^[0-9a-fA-F]{2}$/.test(src.slice(start + 2, start + 4)) ? start + 4 : start + 2;\n }\n if (next === \"u\") {\n if (src[start + 2] === \"{\") {\n const close = src.indexOf(\"}\", start + 3);\n return close >= 0 ? close + 1 : src.length;\n }\n return /^[0-9a-fA-F]{4}$/.test(src.slice(start + 2, start + 6)) ? start + 6 : start + 2;\n }\n if (next === \"c\") return /^[a-zA-Z]$/.test(src[start + 2] ?? \"\") ? start + 3 : start + 2;\n if ((next === \"p\" || next === \"P\") && src[start + 2] === \"{\") {\n const close = src.indexOf(\"}\", start + 3);\n return close >= 0 ? close + 1 : src.length;\n }\n if (next === \"k\" && src[start + 2] === \"<\") {\n const close = src.indexOf(\">\", start + 3);\n return close >= 0 ? close + 1 : src.length;\n }\n if (/[0-9]/.test(next ?? \"\")) {\n let i = start + 2;\n while (/[0-9]/.test(src[i] ?? \"\")) i += 1;\n return i;\n }\n return Math.min(start + 2, src.length);\n}\n\n/** A `[...]` class as literal alternatives, or null if negated, ranged, special or empty. */\nfunction parseLiteralClass(src: string, start: number, end: number): string[] | null {\n let i = start + 1;\n const lastInside = end - 1;\n if (src[i] === \"^\") return null;\n const chars = new Set<string>();\n while (i < lastInside) {\n const c = src[i] ?? \"\";\n if (c === \"\\\\\") {\n const next = src[i + 1];\n if (next === undefined || /[a-zA-Z]/.test(next)) return null;\n chars.add(next);\n i += 2;\n continue;\n }\n if (i + 2 < lastInside && src[i + 1] === \"-\") return null;\n chars.add(c);\n i += 1;\n }\n // A surrogate half would split an astral character the index sees as one code point.\n if ([...chars].some((ch) => /[\\ud800-\\udfff]/.test(ch))) return null;\n return chars.size === 0 ? null : [...chars];\n}\n\n/** Mandatory copies of the preceding atom, whether more may follow, and where the quantifier ends. */\nfunction peekQuantifier(src: string, i: number): Quantifier {\n const c = src[i];\n if (c === \"?\" || c === \"*\" || c === \"+\") {\n const end = src[i + 1] === \"?\" ? i + 2 : i + 1;\n return { copies: c === \"+\" ? 1 : 0, openEnded: true, end };\n }\n if (c === \"{\") {\n const close = src.indexOf(\"}\", i);\n if (close < 0) return { copies: 1, openEnded: false, end: i };\n const m = /^(\\d+)(?:,(\\d*))?$/.exec(src.slice(i + 1, close));\n if (!m) return { copies: 1, openEnded: false, end: i };\n const min = Number(m[1]);\n const max = m[2] === undefined ? min : m[2] === \"\" ? Number.POSITIVE_INFINITY : Number(m[2]);\n const end = src[close + 1] === \"?\" ? close + 2 : close + 1;\n return { copies: min, openEnded: max > min, end };\n }\n return { copies: 1, openEnded: false, end: i };\n}\n\nfunction skipClass(src: string, i: number): number {\n let j = i + 1;\n if (src[j] === \"^\") j += 1;\n while (j < src.length && src[j] !== \"]\") j += src[j] === \"\\\\\" && j + 1 < src.length ? 2 : 1;\n return j < src.length ? j + 1 : j;\n}\n\nfunction skipGroup(src: string, i: number): number {\n let depth = 1;\n let j = i + 1;\n while (j < src.length && depth > 0) {\n const c = src[j];\n if (c === \"\\\\\" && j + 1 < src.length) {\n j += 2;\n continue;\n }\n if (c === \"[\") {\n j = skipClass(src, j);\n continue;\n }\n if (c === \"(\") depth += 1;\n else if (c === \")\") depth -= 1;\n j += 1;\n }\n return j;\n}\n","import { fold } from \"./fold.js\";\nimport { regexLiterals } from \"./regex-literals.js\";\n\n/** Longer patterns are rejected: a JS regex cannot be interrupted once it runs. */\nexport const MAX_PATTERN_LENGTH = 1000;\n\nexport type QueryPlan = {\n /** The pattern as a global regex (`i` added when not case-sensitive); verifies candidates. */\n regex: RegExp;\n /**\n * Per DNF branch, the folded literals of at least 3 code points that a match must\n * contain. `null` when some branch has none: only a scan can answer the pattern.\n */\n branches: string[][] | null;\n};\n\nexport function planQuery(\n pattern: string,\n opts: { regex?: boolean; caseSensitive?: boolean } = {},\n): QueryPlan {\n if (pattern.length > MAX_PATTERN_LENGTH) {\n throw new RangeError(\n `ngram: pattern is ${pattern.length} characters, the limit is ${MAX_PATTERN_LENGTH}`,\n );\n }\n // The regex has no `u` flag (case folding is unsound under /iu), so `\\p{…}` would silently\n // match the literal text \"p{…}\". An odd run of backslashes before `p` is a real escape.\n if (opts.regex && /(?<!\\\\)(?:\\\\\\\\)*\\\\[pP]\\{/.test(pattern)) {\n throw new SyntaxError(\n \"ngram: \\\\p{…} and \\\\P{…} are not supported in regex mode (patterns compile without the u flag)\",\n );\n }\n const source = opts.regex ? pattern : pattern.replace(/[.*+?^${}()|[\\]\\\\/]/g, \"\\\\$&\");\n const regex = new RegExp(source, opts.caseSensitive === false ? \"gi\" : \"g\");\n const branches: string[][] = [];\n for (const literals of regexLiterals(regex)) {\n const usable = literals.map(fold).filter((literal) => Array.from(literal).length >= 3);\n if (usable.length === 0) return { regex, branches: null };\n branches.push(usable);\n }\n return { regex, branches };\n}\n","import { fold } from \"./fold.js\";\n\n/** Distinct 3-code-point grams of an already folded string, in first-seen order. */\nexport function gramsOf(folded: string): string[] {\n const cps = Array.from(folded);\n const out = new Set<string>();\n for (let i = 0; i + 3 <= cps.length; i++) out.add(cps.slice(i, i + 3).join(\"\"));\n return [...out];\n}\n\n/** Distinct trigrams of `text` as the index sees it: case-folded, by code point. */\nexport function trigrams(text: string): string[] {\n return gramsOf(fold(text));\n}\n\n/**\n * One SQLite INTEGER per gram. Three BMP code points pack exactly into 48 bits.\n * A gram with an astral code point keeps the low 16 bits of each code point\n * above 2^48: a collision only adds candidates, which verification removes.\n */\nexport function encodeGram(gram: string): number {\n const [a = 0, b = 0, c = 0] = Array.from(gram, (ch) => ch.codePointAt(0) ?? 0);\n if (a < 0x10000 && b < 0x10000 && c < 0x10000) return a * 2 ** 32 + b * 2 ** 16 + c;\n return 2 ** 48 + (a % 0x10000) * 2 ** 32 + (b % 0x10000) * 2 ** 16 + (c % 0x10000);\n}\n","import type { GramBackend, NgramItem } from \"./fts5-backend.js\";\nimport { chunkJson } from \"./json-chunks.js\";\nimport { encodeGram, gramsOf, trigrams } from \"./trigrams.js\";\n\nconst PAIR = \"json_extract(value, '$[0]'), json_extract(value, '$[1]')\";\n\n/**\n * One row per (gram, id) in a WITHOUT ROWID table: the primary key is the\n * posting list, clustered by gram. A text is a candidate for a branch when it\n * holds every distinct gram of the branch's literals.\n */\nexport function newPostingsBackend(prefix: string): GramBackend {\n const table = `${prefix}grams`;\n const pairs = (items: NgramItem[]) =>\n chunkJson(\n items.flatMap((item) => trigrams(item.text).map((gram) => [encodeGram(gram), item.id])),\n );\n return {\n create: (tx) =>\n tx.exec(\n `CREATE TABLE IF NOT EXISTS ${table}(gram INTEGER NOT NULL, id INTEGER NOT NULL, PRIMARY KEY (gram, id)) WITHOUT ROWID`,\n ),\n async add(tx, items) {\n for (const chunk of pairs(items)) {\n await tx.query(\n `INSERT OR IGNORE INTO ${table}(gram, id) SELECT ${PAIR} FROM json_each(?)`,\n [chunk],\n );\n }\n },\n async remove(tx, items) {\n for (const chunk of pairs(items)) {\n await tx.query(\n `DELETE FROM ${table} WHERE (gram, id) IN (SELECT ${PAIR} FROM json_each(?))`,\n [chunk],\n );\n }\n },\n async candidates(db, branches, max) {\n const ids = new Set<number>();\n for (const branch of branches) {\n // Literals are already folded: split them without folding again.\n const grams = [...new Set(branch.flatMap((literal) => gramsOf(literal).map(encodeGram)))];\n const rows = await db.query<{ id: number }>(\n `SELECT id FROM ${table} WHERE gram IN (SELECT value FROM json_each(?)) GROUP BY id HAVING count(*) = ? ORDER BY id LIMIT ?`,\n [JSON.stringify(grams), grams.length, max],\n );\n for (const row of rows) ids.add(Number(row.id));\n }\n return [...ids].sort((a, b) => a - b).slice(0, max);\n },\n };\n}\n","import type { Db } from \"@statewalker/db-api\";\nimport { inTransaction } from \"@statewalker/db-sqlite\";\nimport { type GramBackend, type NgramItem, newFts5Backend } from \"./fts5-backend.js\";\nimport { chunkJson } from \"./json-chunks.js\";\nimport { planQuery } from \"./plan-query.js\";\nimport { newPostingsBackend } from \"./postings-backend.js\";\n\nexport type { NgramItem };\nexport type NgramMatch = { start: number; end: number };\nexport type NgramHit = { id: number; matches: NgramMatch[] };\nexport type NgramSearchOptions = {\n /** Treat `pattern` as a JS regex source; otherwise it is literal text. */\n regex?: boolean;\n /** Default true (grep semantics). */\n caseSensitive?: boolean;\n /** Maximum hits. Default 100. */\n limit?: number;\n /** Maximum candidates verified. Default 10,000. */\n candidateBudget?: number;\n /** Keep only ids for which this returns true (applied before verification). */\n filter?: (id: number) => boolean;\n signal?: AbortSignal;\n};\nexport type NgramSearchResult = {\n /** Ascending id order; every non-empty match, offsets in UTF-16 code units. */\n hits: NgramHit[];\n /** True when the search stopped before checking every candidate (budget or limit). */\n truncated: boolean;\n};\nexport type NgramStoreOptions = { db: Db; prefix: string; store?: \"fts5\" | \"postings\" };\n\nconst VERIFY_BATCH = 256;\n\nexport class NgramStore {\n /** `{prefix}texts`: its `id` column holds exactly the stored ids. Callers may join it in SQL. */\n readonly idTable: string;\n readonly #db: Db;\n readonly #prefix: string;\n readonly #store: \"fts5\" | \"postings\";\n readonly #backend: GramBackend;\n\n constructor({ db, prefix, store = \"fts5\" }: NgramStoreOptions) {\n if (!/^[A-Za-z_][A-Za-z0-9_]*$/.test(prefix)) {\n throw new Error(`ngram: prefix \"${prefix}\" must match /^[A-Za-z_][A-Za-z0-9_]*$/`);\n }\n if (store !== \"fts5\" && store !== \"postings\")\n throw new Error(`ngram: unknown store \"${store}\"`);\n this.#db = db;\n this.#prefix = prefix;\n this.idTable = `${prefix}texts`;\n this.#store = store;\n this.#backend = store === \"fts5\" ? newFts5Backend(prefix) : newPostingsBackend(prefix);\n }\n\n async init(): Promise<void> {\n const p = this.#prefix;\n await inTransaction(this.#db, async (tx) => {\n await tx.exec(\n `CREATE TABLE IF NOT EXISTS ${p}meta(key TEXT PRIMARY KEY, value TEXT NOT NULL)`,\n );\n const [row] = await tx.query<{ value: string }>(\n `SELECT value FROM ${p}meta WHERE key = 'store'`,\n );\n if (row && row.value !== this.#store) {\n throw new Error(\n `ngram: index \"${p}\" was created with store \"${row.value}\", opened with \"${this.#store}\"`,\n );\n }\n if (!row)\n await tx.query(`INSERT INTO ${p}meta(key, value) VALUES ('store', ?)`, [this.#store]);\n await tx.exec(\n `CREATE TABLE IF NOT EXISTS ${p}texts(id INTEGER PRIMARY KEY, text TEXT NOT NULL)`,\n );\n await this.#backend.create(tx);\n });\n }\n\n async upsert(items: NgramItem[]): Promise<void> {\n // The last text per id wins; a repeated id would leave stale grams behind.\n // A lone surrogate would be stored differently from how it was indexed, so a\n // later delete could not replay it: texts are made well-formed first.\n const latest = [\n ...new Map(items.map(({ id, text }) => [id, { id, text: text.toWellFormed() }])).values(),\n ];\n if (latest.length === 0) return;\n await inTransaction(this.#db, async (tx) => {\n await this.#backend.remove(\n tx,\n await this.#load(\n tx,\n latest.map((item) => item.id),\n ),\n );\n for (const chunk of chunkJson(latest.map((item) => [item.id, item.text]))) {\n await tx.query(\n `INSERT OR REPLACE INTO ${this.#prefix}texts(id, text) SELECT json_extract(value, '$[0]'), json_extract(value, '$[1]') FROM json_each(?)`,\n [chunk],\n );\n }\n await this.#backend.add(tx, latest);\n });\n }\n\n async delete(ids: number[]): Promise<void> {\n if (ids.length === 0) return;\n await inTransaction(this.#db, async (tx) => {\n await this.#backend.remove(tx, await this.#load(tx, ids));\n for (const chunk of chunkJson(ids)) {\n await tx.query(\n `DELETE FROM ${this.#prefix}texts WHERE id IN (SELECT value FROM json_each(?))`,\n [chunk],\n );\n }\n });\n }\n\n async search(pattern: string, opts: NgramSearchOptions = {}): Promise<NgramSearchResult> {\n const { limit = 100, candidateBudget = 10_000, filter, signal } = opts;\n const plan = planQuery(pattern, {\n regex: opts.regex,\n caseSensitive: opts.caseSensitive ?? true,\n });\n signal?.throwIfAborted();\n if (limit <= 0) return { hits: [], truncated: true };\n const found =\n plan.branches === null\n ? (\n await this.#db.query<{ id: number }>(\n `SELECT id FROM ${this.#prefix}texts ORDER BY id LIMIT ?`,\n [candidateBudget + 1],\n )\n ).map((row) => Number(row.id))\n : await this.#backend.candidates(this.#db, plan.branches, candidateBudget + 1);\n let truncated = found.length > candidateBudget;\n const ids = found.slice(0, candidateBudget).filter((id) => !filter || filter(id));\n\n const hits: NgramHit[] = [];\n let last: number | undefined;\n verify: for (let i = 0; i < ids.length; i += VERIFY_BATCH) {\n signal?.throwIfAborted();\n for (const { id, text } of await this.#load(this.#db, ids.slice(i, i + VERIFY_BATCH))) {\n last = id;\n const matches: NgramMatch[] = [];\n for (const m of text.matchAll(plan.regex)) {\n if (m[0].length > 0) matches.push({ start: m.index, end: m.index + m[0].length });\n }\n if (matches.length === 0) continue;\n hits.push({ id, matches });\n if (hits.length >= limit) break verify;\n }\n }\n if (hits.length >= limit && last !== ids.at(-1)) truncated = true;\n return { hits, truncated };\n }\n\n /** The stored original texts of `ids`; unknown ids are absent. */\n async getTexts(ids: number[]): Promise<Map<number, string>> {\n const items = await this.#load(this.#db, ids);\n return new Map(items.map((item) => [item.id, item.text]));\n }\n\n /** Drops the tables of both stores, so it works without knowing which one created the prefix. */\n async drop(): Promise<void> {\n const p = this.#prefix;\n await inTransaction(this.#db, async (tx) => {\n for (const t of [\"ng\", \"grams\", \"texts\", \"meta\"])\n await tx.exec(`DROP TABLE IF EXISTS ${p}${t}`);\n });\n }\n\n /** Stored texts for `ids`, ascending by id; missing ids are skipped. */\n async #load(db: Db, ids: number[]): Promise<NgramItem[]> {\n const out: NgramItem[] = [];\n for (const chunk of chunkJson([...ids].sort((a, b) => a - b))) {\n const rows = await db.query<{ id: number; text: string }>(\n `SELECT id, text FROM ${this.#prefix}texts WHERE id IN (SELECT value FROM json_each(?)) ORDER BY id`,\n [chunk],\n );\n for (const row of rows) out.push({ id: Number(row.id), text: String(row.text) });\n }\n return out;\n }\n}\n"],"mappings":";;;;;;;;;;;;;;AAYA,SAAgB,KAAK,MAAsB;CACzC,IAAI,MAAM;CACV,KAAK,MAAM,MAAM,MAAM;EACrB,MAAM,QAAQ,GAAG,YAAY;EAC7B,MAAM,SAAS,MAAM,KAAK,KAAK,CAAC,CAAC,WAAW,IAAI,QAAQ,GAAA,CAAI,YAAY;EACxE,OAAO,MAAM,WAAW,GAAG,SAAS,QAAQ;CAC9C;CACA,OAAO;AACT;;;;;;;;;ACdA,SAAgB,UAAU,MAAiB,WAAW,KAAmB;CACvE,MAAM,SAAmB,CAAC;CAC1B,IAAI,UAAoB,CAAC;CACzB,IAAI,OAAO;CACX,KAAK,MAAM,OAAO,MAAM;EACtB,MAAM,OAAO,KAAK,UAAU,GAAG;EAC/B,IAAI,QAAQ,SAAS,KAAK,OAAO,KAAK,SAAS,IAAI,UAAU;GAC3D,OAAO,KAAK,IAAI,QAAQ,KAAK,GAAG,EAAE,EAAE;GACpC,UAAU,CAAC;GACX,OAAO;EACT;EACA,QAAQ,KAAK,IAAI;EACjB,QAAQ,KAAK,SAAS;CACxB;CACA,IAAI,QAAQ,SAAS,GAAG,OAAO,KAAK,IAAI,QAAQ,KAAK,GAAG,EAAE,EAAE;CAC5D,OAAO;AACT;;;ACNA,MAAM,MAAM;;;;;;;;AASZ,SAAgB,eAAe,QAA6B;CAC1D,MAAM,QAAQ,GAAG,OAAO;CACxB,MAAM,QAAQ,OAAO,IAAQ,OAAoB,YAAiC;EAChF,MAAM,MACJ,YAAY,WACR,eAAe,MAAM,uBAAuB,IAAI,sBAChD,eAAe,MAAM,GAAG,MAAM,kCAAkC,IAAI;EAC1E,KAAK,MAAM,SAAS,UAAU,MAAM,KAAK,SAAS,CAAC,KAAK,IAAI,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,GAC3E,MAAM,GAAG,MAAM,KAAK,CAAC,KAAK,CAAC;CAE/B;CACA,OAAO;EACL,SAAS,OACP,GAAG,KACD,sCAAsC,MAAM,mEAC9C;EACF,MAAM,IAAI,UAAU,MAAM,IAAI,OAAO,QAAQ;EAC7C,SAAS,IAAI,UAAU,MAAM,IAAI,OAAO,QAAQ;EAChD,MAAM,WAAW,IAAI,UAAU,KAAK;GAElC,MAAM,SAAS,YAAoB,IAAI,QAAQ,WAAW,MAAK,MAAI,EAAE;GACrE,MAAM,QAAQ,SAAS,KAAK,WAAW,IAAI,OAAO,IAAI,KAAK,CAAC,CAAC,KAAK,OAAO,EAAE,EAAE,CAAC,CAAC,KAAK,MAAM;GAK1F,QAAO,MAJY,GAAG,MACpB,2BAA2B,MAAM,SAAS,MAAM,kCAChD,CAAC,OAAO,GAAG,CACb,EAAA,CACY,KAAK,QAAQ,OAAO,IAAI,EAAE,CAAC;EACzC;CACF;AACF;;;;ACvCA,MAAM,UAAU;;;;;;;;AAahB,SAAgB,cAAc,OAA2B;CAEvD,IAAI,MAAM,MAAM,SAAS,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC;CACzC,OAAO,aAAa,MAAM,QAAQ,GAAG,MAAM,OAAO,MAAM,CAAC,CAAC;AAC5D;AAKA,SAAS,aAAa,KAAa,OAAe,KAAqB;CACrE,MAAM,MAAkB,CAAC;CACzB,IAAI,QAAQ;CACZ,KAAK,MAAM,CAAC,QAAQ,SAAS,yBAAyB,KAAK,OAAO,GAAG,GAAG;EACtE,MAAM,MAAM,aAAa,KAAK,QAAQ,IAAI;EAC1C,KAAK,MAAM,UAAU,IAAI,KAAK,IAAI,KAAK,MAAM;EAC7C,QAAQ,SAAS,IAAI;CACvB;CACA,OAAO;EAAE;EAAK;CAAM;AACtB;AAEA,SAAS,yBACP,KACA,OACA,KACyB;CACzB,MAAM,QAAiC,CAAC;CACxC,IAAI,SAAS;CACb,IAAI,QAAQ;CACZ,IAAI,IAAI;CACR,OAAO,IAAI,KAAK;EACd,MAAM,IAAI,IAAI;EACd,IAAI,MAAM,MAAM;GACd,KAAK;GACL;EACF;EACA,IAAI,MAAM,KAAK;GACb,IAAI,UAAU,KAAK,CAAC;GACpB;EACF;EACA,IAAI,MAAM,KAAK,SAAS;OACnB,IAAI,MAAM,KAAK,SAAS;OACxB,IAAI,MAAM,OAAO,UAAU,GAAG;GACjC,MAAM,KAAK,CAAC,QAAQ,CAAC,CAAC;GACtB,SAAS,IAAI;EACf;EACA,KAAK;CACP;CACA,MAAM,KAAK,CAAC,QAAQ,GAAG,CAAC;CACxB,OAAO;AACT;AAEA,SAAS,aAAa,KAAa,OAAe,KAAqB;CACrE,IAAI,QAAsB,CAAC;EAAE,UAAU,CAAC;EAAG,KAAK;CAAG,CAAC;CAGpD,IAAI,QAAQ;CACZ,MAAM,kBAAkB;EACtB,KAAK,MAAM,KAAK,OACd,IAAI,EAAE,IAAI,SAAS,GAAG;GACpB,EAAE,SAAS,KAAK,EAAE,GAAG;GACrB,EAAE,MAAM;EACV;CAEJ;CAEA,MAAM,aAAa,MAAc,MAAkB;EACjD,IAAI,EAAE,WAAW,GAAG;GAClB,QAAQ;GACR,UAAU;GACV;EACF;EACA,KAAK,MAAM,KAAK,OAAO,EAAE,OAAO,KAAK,OAAO,EAAE,MAAM;EACpD,IAAI,EAAE,WAAW;GACf,QAAQ;GACR,UAAU;EACZ;CACF;CAEA,IAAI,IAAI;CACR,OAAO,IAAI,KAAK;EACd,MAAM,IAAI,IAAI,MAAM;EAEpB,IAAI,MAAM,OAAO,MAAM,KAAK;GAC1B,KAAK;GACL;EACF;EAEA,IAAI,MAAM,MAAM;GACd,MAAM,OAAO,IAAI,IAAI;GACrB,IAAI,SAAS,KAAA,GAAW;IACtB,KAAK;IACL;GACF;GACA,MAAM,UAAU,oBAAoB,KAAK,CAAC;GAC1C,IAAI,SAAS;IACX,MAAM,IAAI,eAAe,KAAK,QAAQ,GAAG;IACzC,IAAI,EAAE;IACN,UAAU,QAAQ,MAAM,CAAC;IACzB;GACF;GAEA,IAAI,cAAc,KAAK,IAAI,GAAG;IAC5B,QAAQ;IACR,UAAU;IACV,IAAI,eAAe,KAAK,kBAAkB,KAAK,CAAC,CAAC,CAAC,CAAC;IACnD;GACF;GAEA,MAAM,IAAI,eAAe,KAAK,IAAI,CAAC;GACnC,IAAI,EAAE;GACN,UAAU,MAAM,CAAC;GACjB;EACF;EAEA,IAAI,MAAM,KAAK;GACb,MAAM,WAAW,UAAU,KAAK,CAAC;GACjC,MAAM,QAAQ,kBAAkB,KAAK,GAAG,QAAQ;GAChD,MAAM,IAAI,eAAe,KAAK,QAAQ;GACtC,IAAI,EAAE;GACN,IACE,EAAE,WAAW,KACb,UAAU,QACV,EAAE,SAAS,KACX,MAAM,SAAS,MAAM,SAAS,SAC9B;IACA,QAAQ;IACR,UAAU;IACV;GACF;GACA,QAAQ,MAAM,SAAS,MACrB,MAAM,KAAK,QAAQ;IAAE,UAAU,EAAE,SAAS,MAAM;IAAG,KAAK,EAAE,MAAM;GAAG,EAAE,CACvE;GACA,IAAI,EAAE,WAAW;IACf,QAAQ;IACR,UAAU;GACZ;GACA;EACF;EAEA,IAAI,MAAM,KAAK;GACb,MAAM,WAAW,UAAU,KAAK,CAAC;GACjC,MAAM,QAAQ,iBAAiB,KAAK,CAAC;GACrC,MAAM,IAAI,eAAe,KAAK,QAAQ;GACtC,IAAI,EAAE;GACN,IAAI,MAAM,SAAS,eAAe,EAAE,WAAW,GAAG;IAChD,QAAQ;IACR,UAAU;IACV;GACF;GACA,MAAM,EAAE,KAAK,OAAO,UAAU,aAAa,KAAK,MAAM,YAAY,WAAW,CAAC;GAI9E,MAAM,WACJ,SAAS,EAAE,WAAW,KAAK,MAAM,SAAS,KAAK,MAAM,OAAO,MAAM,EAAE,WAAW,CAAC;GAClF,QAAQ,SAAS,EAAE,aAAa,CAAC;GACjC,IAAI,YAAY,MAAM,SAAS,MAAM,UAAU,SAAS;IACtD,QAAQ,MAAM,SAAS,MACrB,MAAM,KAAK,SAAS;KAAE,UAAU,EAAE,SAAS,MAAM;KAAG,KAAK,EAAE,OAAO,IAAI,MAAM;IAAI,EAAE,CACpF;IACA,IAAI,EAAE,WAAW,UAAU;IAC3B;GACF;GACA,QAAQ;GACR,UAAU;GACV,IAAI,MAAM,SAAS,MAAM,SAAS,SAAS;GAC3C,QAAQ,MAAM,SAAS,MACrB,MAAM,KAAK,SAAS;IAAE,UAAU,EAAE,SAAS,OAAO,GAAG;IAAG,KAAK;GAAG,EAAE,CACpE;GACA;EACF;EAEA,IAAI,MAAM,KAAK;GACb,QAAQ;GACR,UAAU;GACV,IAAI,eAAe,KAAK,IAAI,CAAC,CAAC,CAAC;GAC/B;EACF;EAEA,MAAM,IAAI,eAAe,KAAK,IAAI,CAAC;EACnC,IAAI,EAAE;EACN,UAAU,GAAG,CAAC;CAChB;CACA,UAAU;CACV,OAAO;EACL,KAAK,MAAM,KAAK,MAAM,EAAE,QAAQ;EAChC,OAAO,CAAC,SAAS,MAAM,OAAO,MAAM,EAAE,SAAS,WAAW,CAAC;CAC7D;AACF;;AAGA,SAAS,iBAAiB,KAAa,OAA4B;CACjE,IAAI,IAAI,QAAQ,OAAO,KAAK,OAAO;EAAE,MAAM;EAAa,YAAY,QAAQ;CAAE;CAC9E,MAAM,SAAS,IAAI,QAAQ;CAC3B,IAAI,WAAW,KAAK,OAAO;EAAE,MAAM;EAAa,YAAY,QAAQ;CAAE;CACtE,IAAI,WAAW,OAAO,WAAW,KAAK,OAAO,EAAE,MAAM,YAAY;CACjE,IAAI,WAAW,KAAK;EAClB,MAAM,OAAO,IAAI,QAAQ;EACzB,IAAI,SAAS,OAAO,SAAS,KAAK,OAAO,EAAE,MAAM,YAAY;EAC7D,MAAM,UAAU,IAAI,QAAQ,KAAK,QAAQ,CAAC;EAC1C,IAAI,WAAW,GAAG,OAAO;GAAE,MAAM;GAAa,YAAY,UAAU;EAAE;CACxE;CACA,OAAO,EAAE,MAAM,UAAU;AAC3B;;;;;AAMA,SAAS,oBACP,KACA,OAC2C;CAC3C,MAAM,OAAO,IAAI,QAAQ;CACzB,IAAI,SAAS,KAAK;EAChB,MAAM,MAAM,IAAI,MAAM,QAAQ,GAAG,QAAQ,CAAC;EAC1C,IAAI,CAAC,mBAAmB,KAAK,GAAG,GAAG,OAAO,KAAA;EAC1C,OAAO;GAAE,MAAM,OAAO,aAAa,OAAO,SAAS,KAAK,EAAE,CAAC;GAAG,KAAK,QAAQ;EAAE;CAC/E;CACA,IAAI,SAAS,KAAK;EAChB,MAAM,MAAM,IAAI,MAAM,QAAQ,GAAG,QAAQ,CAAC;EAC1C,IAAI,CAAC,mBAAmB,KAAK,GAAG,GAAG,OAAO,KAAA;EAC1C,OAAO;GAAE,MAAM,OAAO,aAAa,OAAO,SAAS,KAAK,EAAE,CAAC;GAAG,KAAK,QAAQ;EAAE;CAC/E;AAEF;;;;;;AAOA,SAAS,kBAAkB,KAAa,OAAuB;CAC7D,MAAM,OAAO,IAAI,QAAQ;CACzB,IAAI,SAAS,KACX,OAAO,mBAAmB,KAAK,IAAI,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,IAAI,QAAQ,IAAI,QAAQ;CAExF,IAAI,SAAS,KAAK;EAChB,IAAI,IAAI,QAAQ,OAAO,KAAK;GAC1B,MAAM,QAAQ,IAAI,QAAQ,KAAK,QAAQ,CAAC;GACxC,OAAO,SAAS,IAAI,QAAQ,IAAI,IAAI;EACtC;EACA,OAAO,mBAAmB,KAAK,IAAI,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,IAAI,QAAQ,IAAI,QAAQ;CACxF;CACA,IAAI,SAAS,KAAK,OAAO,aAAa,KAAK,IAAI,QAAQ,MAAM,EAAE,IAAI,QAAQ,IAAI,QAAQ;CACvF,KAAK,SAAS,OAAO,SAAS,QAAQ,IAAI,QAAQ,OAAO,KAAK;EAC5D,MAAM,QAAQ,IAAI,QAAQ,KAAK,QAAQ,CAAC;EACxC,OAAO,SAAS,IAAI,QAAQ,IAAI,IAAI;CACtC;CACA,IAAI,SAAS,OAAO,IAAI,QAAQ,OAAO,KAAK;EAC1C,MAAM,QAAQ,IAAI,QAAQ,KAAK,QAAQ,CAAC;EACxC,OAAO,SAAS,IAAI,QAAQ,IAAI,IAAI;CACtC;CACA,IAAI,QAAQ,KAAK,QAAQ,EAAE,GAAG;EAC5B,IAAI,IAAI,QAAQ;EAChB,OAAO,QAAQ,KAAK,IAAI,MAAM,EAAE,GAAG,KAAK;EACxC,OAAO;CACT;CACA,OAAO,KAAK,IAAI,QAAQ,GAAG,IAAI,MAAM;AACvC;;AAGA,SAAS,kBAAkB,KAAa,OAAe,KAA8B;CACnF,IAAI,IAAI,QAAQ;CAChB,MAAM,aAAa,MAAM;CACzB,IAAI,IAAI,OAAO,KAAK,OAAO;CAC3B,MAAM,wBAAQ,IAAI,IAAY;CAC9B,OAAO,IAAI,YAAY;EACrB,MAAM,IAAI,IAAI,MAAM;EACpB,IAAI,MAAM,MAAM;GACd,MAAM,OAAO,IAAI,IAAI;GACrB,IAAI,SAAS,KAAA,KAAa,WAAW,KAAK,IAAI,GAAG,OAAO;GACxD,MAAM,IAAI,IAAI;GACd,KAAK;GACL;EACF;EACA,IAAI,IAAI,IAAI,cAAc,IAAI,IAAI,OAAO,KAAK,OAAO;EACrD,MAAM,IAAI,CAAC;EACX,KAAK;CACP;CAEA,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,MAAM,OAAO,kBAAkB,KAAK,EAAE,CAAC,GAAG,OAAO;CAChE,OAAO,MAAM,SAAS,IAAI,OAAO,CAAC,GAAG,KAAK;AAC5C;;AAGA,SAAS,eAAe,KAAa,GAAuB;CAC1D,MAAM,IAAI,IAAI;CACd,IAAI,MAAM,OAAO,MAAM,OAAO,MAAM,KAAK;EACvC,MAAM,MAAM,IAAI,IAAI,OAAO,MAAM,IAAI,IAAI,IAAI;EAC7C,OAAO;GAAE,QAAQ,MAAM,MAAM,IAAI;GAAG,WAAW;GAAM;EAAI;CAC3D;CACA,IAAI,MAAM,KAAK;EACb,MAAM,QAAQ,IAAI,QAAQ,KAAK,CAAC;EAChC,IAAI,QAAQ,GAAG,OAAO;GAAE,QAAQ;GAAG,WAAW;GAAO,KAAK;EAAE;EAC5D,MAAM,IAAI,qBAAqB,KAAK,IAAI,MAAM,IAAI,GAAG,KAAK,CAAC;EAC3D,IAAI,CAAC,GAAG,OAAO;GAAE,QAAQ;GAAG,WAAW;GAAO,KAAK;EAAE;EACrD,MAAM,MAAM,OAAO,EAAE,EAAE;EACvB,MAAM,MAAM,EAAE,OAAO,KAAA,IAAY,MAAM,EAAE,OAAO,KAAK,OAAO,oBAAoB,OAAO,EAAE,EAAE;EAC3F,MAAM,MAAM,IAAI,QAAQ,OAAO,MAAM,QAAQ,IAAI,QAAQ;EACzD,OAAO;GAAE,QAAQ;GAAK,WAAW,MAAM;GAAK;EAAI;CAClD;CACA,OAAO;EAAE,QAAQ;EAAG,WAAW;EAAO,KAAK;CAAE;AAC/C;AAEA,SAAS,UAAU,KAAa,GAAmB;CACjD,IAAI,IAAI,IAAI;CACZ,IAAI,IAAI,OAAO,KAAK,KAAK;CACzB,OAAO,IAAI,IAAI,UAAU,IAAI,OAAO,KAAK,KAAK,IAAI,OAAO,QAAQ,IAAI,IAAI,IAAI,SAAS,IAAI;CAC1F,OAAO,IAAI,IAAI,SAAS,IAAI,IAAI;AAClC;AAEA,SAAS,UAAU,KAAa,GAAmB;CACjD,IAAI,QAAQ;CACZ,IAAI,IAAI,IAAI;CACZ,OAAO,IAAI,IAAI,UAAU,QAAQ,GAAG;EAClC,MAAM,IAAI,IAAI;EACd,IAAI,MAAM,QAAQ,IAAI,IAAI,IAAI,QAAQ;GACpC,KAAK;GACL;EACF;EACA,IAAI,MAAM,KAAK;GACb,IAAI,UAAU,KAAK,CAAC;GACpB;EACF;EACA,IAAI,MAAM,KAAK,SAAS;OACnB,IAAI,MAAM,KAAK,SAAS;EAC7B,KAAK;CACP;CACA,OAAO;AACT;;;;AClWA,MAAa,qBAAqB;AAYlC,SAAgB,UACd,SACA,OAAqD,CAAC,GAC3C;CACX,IAAI,QAAQ,SAAA,KACV,MAAM,IAAI,WACR,qBAAqB,QAAQ,OAAO,4BAA4B,oBAClE;CAIF,IAAI,KAAK,SAAS,2BAA2B,KAAK,OAAO,GACvD,MAAM,IAAI,YACR,gGACF;CAEF,MAAM,SAAS,KAAK,QAAQ,UAAU,QAAQ,QAAQ,wBAAwB,MAAM;CACpF,MAAM,QAAQ,IAAI,OAAO,QAAQ,KAAK,kBAAkB,QAAQ,OAAO,GAAG;CAC1E,MAAM,WAAuB,CAAC;CAC9B,KAAK,MAAM,YAAY,cAAc,KAAK,GAAG;EAC3C,MAAM,SAAS,SAAS,IAAI,IAAI,CAAC,CAAC,QAAQ,YAAY,MAAM,KAAK,OAAO,CAAC,CAAC,UAAU,CAAC;EACrF,IAAI,OAAO,WAAW,GAAG,OAAO;GAAE;GAAO,UAAU;EAAK;EACxD,SAAS,KAAK,MAAM;CACtB;CACA,OAAO;EAAE;EAAO;CAAS;AAC3B;;;;ACtCA,SAAgB,QAAQ,QAA0B;CAChD,MAAM,MAAM,MAAM,KAAK,MAAM;CAC7B,MAAM,sBAAM,IAAI,IAAY;CAC5B,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,QAAQ,KAAK,IAAI,IAAI,IAAI,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;CAC9E,OAAO,CAAC,GAAG,GAAG;AAChB;;AAGA,SAAgB,SAAS,MAAwB;CAC/C,OAAO,QAAQ,KAAK,IAAI,CAAC;AAC3B;;;;;;AAOA,SAAgB,WAAW,MAAsB;CAC/C,MAAM,CAAC,IAAI,GAAG,IAAI,GAAG,IAAI,KAAK,MAAM,KAAK,OAAO,OAAO,GAAG,YAAY,CAAC,KAAK,CAAC;CAC7E,IAAI,IAAI,SAAW,IAAI,SAAW,IAAI,OAAS,OAAO,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK;CAClF,OAAO,KAAK,KAAM,IAAI,QAAW,KAAK,KAAM,IAAI,QAAW,KAAK,KAAM,IAAI;AAC5E;;;ACpBA,MAAM,OAAO;;;;;;AAOb,SAAgB,mBAAmB,QAA6B;CAC9D,MAAM,QAAQ,GAAG,OAAO;CACxB,MAAM,SAAS,UACb,UACE,MAAM,SAAS,SAAS,SAAS,KAAK,IAAI,CAAC,CAAC,KAAK,SAAS,CAAC,WAAW,IAAI,GAAG,KAAK,EAAE,CAAC,CAAC,CACxF;CACF,OAAO;EACL,SAAS,OACP,GAAG,KACD,8BAA8B,MAAM,mFACtC;EACF,MAAM,IAAI,IAAI,OAAO;GACnB,KAAK,MAAM,SAAS,MAAM,KAAK,GAC7B,MAAM,GAAG,MACP,yBAAyB,MAAM,oBAAoB,KAAK,qBACxD,CAAC,KAAK,CACR;EAEJ;EACA,MAAM,OAAO,IAAI,OAAO;GACtB,KAAK,MAAM,SAAS,MAAM,KAAK,GAC7B,MAAM,GAAG,MACP,eAAe,MAAM,+BAA+B,KAAK,sBACzD,CAAC,KAAK,CACR;EAEJ;EACA,MAAM,WAAW,IAAI,UAAU,KAAK;GAClC,MAAM,sBAAM,IAAI,IAAY;GAC5B,KAAK,MAAM,UAAU,UAAU;IAE7B,MAAM,QAAQ,CAAC,GAAG,IAAI,IAAI,OAAO,SAAS,YAAY,QAAQ,OAAO,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC;IACxF,MAAM,OAAO,MAAM,GAAG,MACpB,kBAAkB,MAAM,sGACxB;KAAC,KAAK,UAAU,KAAK;KAAG,MAAM;KAAQ;IAAG,CAC3C;IACA,KAAK,MAAM,OAAO,MAAM,IAAI,IAAI,OAAO,IAAI,EAAE,CAAC;GAChD;GACA,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,GAAG,MAAM,IAAI,CAAC,CAAC,CAAC,MAAM,GAAG,GAAG;EACpD;CACF;AACF;;;ACrBA,MAAM,eAAe;AAErB,IAAa,aAAb,MAAwB;;CAEtB;CACA;CACA;CACA;CACA;CAEA,YAAY,EAAE,IAAI,QAAQ,QAAQ,UAA6B;EAC7D,IAAI,CAAC,2BAA2B,KAAK,MAAM,GACzC,MAAM,IAAI,MAAM,kBAAkB,OAAO,wCAAwC;EAEnF,IAAI,UAAU,UAAU,UAAU,YAChC,MAAM,IAAI,MAAM,yBAAyB,MAAM,EAAE;EACnD,KAAK,MAAM;EACX,KAAK,UAAU;EACf,KAAK,UAAU,GAAG,OAAO;EACzB,KAAK,SAAS;EACd,KAAK,WAAW,UAAU,SAAS,eAAe,MAAM,IAAI,mBAAmB,MAAM;CACvF;CAEA,MAAM,OAAsB;EAC1B,MAAM,IAAI,KAAK;EACf,MAAM,cAAc,KAAK,KAAK,OAAO,OAAO;GAC1C,MAAM,GAAG,KACP,8BAA8B,EAAE,gDAClC;GACA,MAAM,CAAC,OAAO,MAAM,GAAG,MACrB,qBAAqB,EAAE,yBACzB;GACA,IAAI,OAAO,IAAI,UAAU,KAAK,QAC5B,MAAM,IAAI,MACR,iBAAiB,EAAE,4BAA4B,IAAI,MAAM,kBAAkB,KAAK,OAAO,EACzF;GAEF,IAAI,CAAC,KACH,MAAM,GAAG,MAAM,eAAe,EAAE,uCAAuC,CAAC,KAAK,MAAM,CAAC;GACtF,MAAM,GAAG,KACP,8BAA8B,EAAE,kDAClC;GACA,MAAM,KAAK,SAAS,OAAO,EAAE;EAC/B,CAAC;CACH;CAEA,MAAM,OAAO,OAAmC;EAI9C,MAAM,SAAS,CACb,GAAG,IAAI,IAAI,MAAM,KAAK,EAAE,IAAI,WAAW,CAAC,IAAI;GAAE;GAAI,MAAM,KAAK,aAAa;EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAC1F;EACA,IAAI,OAAO,WAAW,GAAG;EACzB,MAAM,cAAc,KAAK,KAAK,OAAO,OAAO;GAC1C,MAAM,KAAK,SAAS,OAClB,IACA,MAAM,KAAK,MACT,IACA,OAAO,KAAK,SAAS,KAAK,EAAE,CAC9B,CACF;GACA,KAAK,MAAM,SAAS,UAAU,OAAO,KAAK,SAAS,CAAC,KAAK,IAAI,KAAK,IAAI,CAAC,CAAC,GACtE,MAAM,GAAG,MACP,0BAA0B,KAAK,QAAQ,oGACvC,CAAC,KAAK,CACR;GAEF,MAAM,KAAK,SAAS,IAAI,IAAI,MAAM;EACpC,CAAC;CACH;CAEA,MAAM,OAAO,KAA8B;EACzC,IAAI,IAAI,WAAW,GAAG;EACtB,MAAM,cAAc,KAAK,KAAK,OAAO,OAAO;GAC1C,MAAM,KAAK,SAAS,OAAO,IAAI,MAAM,KAAK,MAAM,IAAI,GAAG,CAAC;GACxD,KAAK,MAAM,SAAS,UAAU,GAAG,GAC/B,MAAM,GAAG,MACP,eAAe,KAAK,QAAQ,qDAC5B,CAAC,KAAK,CACR;EAEJ,CAAC;CACH;CAEA,MAAM,OAAO,SAAiB,OAA2B,CAAC,GAA+B;EACvF,MAAM,EAAE,QAAQ,KAAK,kBAAkB,KAAQ,QAAQ,WAAW;EAClE,MAAM,OAAO,UAAU,SAAS;GAC9B,OAAO,KAAK;GACZ,eAAe,KAAK,iBAAiB;EACvC,CAAC;EACD,QAAQ,eAAe;EACvB,IAAI,SAAS,GAAG,OAAO;GAAE,MAAM,CAAC;GAAG,WAAW;EAAK;EACnD,MAAM,QACJ,KAAK,aAAa,QAEZ,MAAM,KAAK,IAAI,MACb,kBAAkB,KAAK,QAAQ,4BAC/B,CAAC,kBAAkB,CAAC,CACtB,EAAA,CACA,KAAK,QAAQ,OAAO,IAAI,EAAE,CAAC,IAC7B,MAAM,KAAK,SAAS,WAAW,KAAK,KAAK,KAAK,UAAU,kBAAkB,CAAC;EACjF,IAAI,YAAY,MAAM,SAAS;EAC/B,MAAM,MAAM,MAAM,MAAM,GAAG,eAAe,CAAC,CAAC,QAAQ,OAAO,CAAC,UAAU,OAAO,EAAE,CAAC;EAEhF,MAAM,OAAmB,CAAC;EAC1B,IAAI;EACJ,QAAQ,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK,cAAc;GACzD,QAAQ,eAAe;GACvB,KAAK,MAAM,EAAE,IAAI,UAAU,MAAM,KAAK,MAAM,KAAK,KAAK,IAAI,MAAM,GAAG,IAAI,YAAY,CAAC,GAAG;IACrF,OAAO;IACP,MAAM,UAAwB,CAAC;IAC/B,KAAK,MAAM,KAAK,KAAK,SAAS,KAAK,KAAK,GACtC,IAAI,EAAE,EAAE,CAAC,SAAS,GAAG,QAAQ,KAAK;KAAE,OAAO,EAAE;KAAO,KAAK,EAAE,QAAQ,EAAE,EAAE,CAAC;IAAO,CAAC;IAElF,IAAI,QAAQ,WAAW,GAAG;IAC1B,KAAK,KAAK;KAAE;KAAI;IAAQ,CAAC;IACzB,IAAI,KAAK,UAAU,OAAO,MAAM;GAClC;EACF;EACA,IAAI,KAAK,UAAU,SAAS,SAAS,IAAI,GAAG,EAAE,GAAG,YAAY;EAC7D,OAAO;GAAE;GAAM;EAAU;CAC3B;;CAGA,MAAM,SAAS,KAA6C;EAC1D,MAAM,QAAQ,MAAM,KAAK,MAAM,KAAK,KAAK,GAAG;EAC5C,OAAO,IAAI,IAAI,MAAM,KAAK,SAAS,CAAC,KAAK,IAAI,KAAK,IAAI,CAAC,CAAC;CAC1D;;CAGA,MAAM,OAAsB;EAC1B,MAAM,IAAI,KAAK;EACf,MAAM,cAAc,KAAK,KAAK,OAAO,OAAO;GAC1C,KAAK,MAAM,KAAK;IAAC;IAAM;IAAS;IAAS;GAAM,GAC7C,MAAM,GAAG,KAAK,wBAAwB,IAAI,GAAG;EACjD,CAAC;CACH;;CAGA,MAAM,MAAM,IAAQ,KAAqC;EACvD,MAAM,MAAmB,CAAC;EAC1B,KAAK,MAAM,SAAS,UAAU,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,GAAG,MAAM,IAAI,CAAC,CAAC,GAAG;GAC7D,MAAM,OAAO,MAAM,GAAG,MACpB,wBAAwB,KAAK,QAAQ,iEACrC,CAAC,KAAK,CACR;GACA,KAAK,MAAM,OAAO,MAAM,IAAI,KAAK;IAAE,IAAI,OAAO,IAAI,EAAE;IAAG,MAAM,OAAO,IAAI,IAAI;GAAE,CAAC;EACjF;EACA,OAAO;CACT;AACF"}
1
+ {"version":3,"file":"ngram.mjs","names":[],"sources":["../src/ngram/fold.ts","../src/ngram/json-chunks.ts","../src/ngram/fts5-backend.ts","../src/ngram/regex-literals.ts","../src/ngram/plan-query.ts","../src/ngram/trigrams.ts","../src/ngram/postings-backend.ts","../src/ngram/ngram-store.ts"],"sourcesContent":["/**\n * Case fold per code point, applied to indexed text and to query literals alike.\n *\n * Upper-then-lower maps every character a case-insensitive JS regex treats as\n * equal to one form (Σ σ ς → σ, ſ → s). A character whose upper case is several\n * code points (ß → SS) only matches itself under `/i`, so it keeps its own\n * lower case. Folding per code point makes fold(a + b) === fold(a) + fold(b), so\n * a substring of the text stays a substring of the folded text. A character\n * whose folded form has a different UTF-16 length (İ → i + U+0307) is kept as\n * is, so fold preserves the length and offsets into the folded text are\n * offsets into the original.\n */\nexport function fold(text: string): string {\n let out = \"\";\n for (const ch of text) {\n const upper = ch.toUpperCase();\n const lower = (Array.from(upper).length === 1 ? upper : ch).toLowerCase();\n out += lower.length === ch.length ? lower : ch;\n }\n return out;\n}\n","/**\n * Serialises rows into JSON array parameters for `json_each(?)`, each at most\n * `maxChars` UTF-16 code units. 500k code units stay under a Durable Object's\n * ~2 MB string limit even at 4 bytes per code point; a single row larger than\n * that still fails there with \"string or blob too big\".\n */\nexport function chunkJson(rows: unknown[], maxChars = 500_000): string[] {\n const chunks: string[] = [];\n let current: string[] = [];\n let size = 2;\n for (const row of rows) {\n const json = JSON.stringify(row);\n if (current.length > 0 && size + json.length + 1 > maxChars) {\n chunks.push(`[${current.join(\",\")}]`);\n current = [];\n size = 2;\n }\n current.push(json);\n size += json.length + 1;\n }\n if (current.length > 0) chunks.push(`[${current.join(\",\")}]`);\n return chunks;\n}\n","import type { Db } from \"@statewalker/db-api\";\nimport { fold } from \"./fold.js\";\nimport { chunkJson } from \"./json-chunks.js\";\n\nexport type NgramItem = { id: number; text: string };\n\n/** How one store finds candidate ids; texts and verification live in NgramStore. */\nexport type GramBackend = {\n create(tx: Db): Promise<void>;\n add(tx: Db, items: NgramItem[]): Promise<void>;\n /** `items` hold the texts as currently stored, so their grams can be removed exactly. */\n remove(tx: Db, items: NgramItem[]): Promise<void>;\n /** Ids whose text contains every literal of at least one branch; ascending, at most `max`. */\n candidates(db: Db, branches: string[][], max: number): Promise<number[]>;\n};\n\nconst ROW = \"json_extract(value, '$[0]'), json_extract(value, '$[1]')\";\n\n/**\n * FTS5 trigram over folded text. Contentless (`content=''`), because NgramStore\n * already keeps the text; a contentless row is deleted by replaying its exact\n * indexed value through the 'delete' command, which is why `remove` needs the\n * stored texts. `case_sensitive 1`: folding is done by `fold`, the same function\n * that folds query literals, so the index and the planner can never disagree.\n */\nexport function newFts5Backend(prefix: string): GramBackend {\n const table = `${prefix}ng`;\n const write = async (tx: Db, items: NgramItem[], command: \"insert\" | \"delete\") => {\n const sql =\n command === \"insert\"\n ? `INSERT INTO ${table}(rowid, text) SELECT ${ROW} FROM json_each(?)`\n : `INSERT INTO ${table}(${table}, rowid, text) SELECT 'delete', ${ROW} FROM json_each(?)`;\n for (const chunk of chunkJson(items.map((item) => [item.id, fold(item.text)]))) {\n await tx.query(sql, [chunk]);\n }\n };\n return {\n create: (tx) =>\n tx.exec(\n `CREATE VIRTUAL TABLE IF NOT EXISTS ${table} USING fts5(text, content='', tokenize='trigram case_sensitive 1')`,\n ),\n add: (tx, items) => write(tx, items, \"insert\"),\n remove: (tx, items) => write(tx, items, \"delete\"),\n async candidates(db, branches, max) {\n // A quoted string is a phrase of consecutive trigrams, i.e. an exact substring.\n const quote = (literal: string) => `\"${literal.replaceAll('\"', '\"\"')}\"`;\n const match = branches.map((branch) => `(${branch.map(quote).join(\" AND \")})`).join(\" OR \");\n const rows = await db.query<{ id: number }>(\n `SELECT rowid AS id FROM ${table} WHERE ${table} MATCH ? ORDER BY rowid LIMIT ?`,\n [match, max],\n );\n return rows.map((row) => Number(row.id));\n },\n };\n}\n","/*\n * Mandatory-literal extraction from a regex, after Russ Cox's trigram method.\n * Ported from hypgrep 0.5.3 src/regex.js (Hyperparam), MIT License:\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy of this\n * software and associated documentation files (the \"Software\"), to deal in the Software\n * without restriction, including without limitation the rights to use, copy, modify,\n * merge, publish, distribute, sublicense, and/or sell copies of the Software, and to\n * permit persons to whom the Software is furnished to do so, subject to the following\n * conditions: The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED \"AS IS\",\n * WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED.\n */\n\n/** Cross-product cap: past it, the construct counts as a wildcard. */\nconst MAX_DNF = 32;\n\ntype LiveBranch = { literals: string[]; run: string };\ntype Quantifier = { copies: number; openEnded: boolean; end: number };\ntype GroupPrefix = { kind: \"consuming\"; innerStart: number } | { kind: \"assertion\" | \"unknown\" };\n\n/**\n * DNF of literals that every match must contain: a string can match only if all\n * literals of at least one branch occur in it. An empty branch matches anything.\n * Conservative: a construct it cannot reason about becomes a wildcard, never a literal.\n *\n * /abc(def|ghi)/ → [[\"abcdef\"], [\"abcghi\"]] /foo|.+/ → [[\"foo\"], []]\n */\nexport function regexLiterals(regex: RegExp): string[][] {\n // v-mode class syntax desyncs skipClass and would invent literals.\n if (regex.flags.includes(\"v\")) return [[]];\n return expandRegion(regex.source, 0, regex.source.length).dnf;\n}\n\n/** `exact`: every arm is one contiguous literal that is the arm's whole match, with nothing dropped. */\ntype Region = { dnf: string[][]; exact: boolean };\n\nfunction expandRegion(src: string, start: number, end: number): Region {\n const dnf: string[][] = [];\n let exact = true;\n for (const [bStart, bEnd] of splitTopLevelAlternation(src, start, end)) {\n const arm = expandBranch(src, bStart, bEnd);\n for (const branch of arm.dnf) dnf.push(branch);\n exact = exact && arm.exact;\n }\n return { dnf, exact };\n}\n\nfunction splitTopLevelAlternation(\n src: string,\n start: number,\n end: number,\n): Array<[number, number]> {\n const spans: Array<[number, number]> = [];\n let bStart = start;\n let depth = 0;\n let i = start;\n while (i < end) {\n const c = src[i];\n if (c === \"\\\\\") {\n i += 2;\n continue;\n }\n if (c === \"[\") {\n i = skipClass(src, i);\n continue;\n }\n if (c === \"(\") depth += 1;\n else if (c === \")\") depth -= 1;\n else if (c === \"|\" && depth === 0) {\n spans.push([bStart, i]);\n bStart = i + 1;\n }\n i += 1;\n }\n spans.push([bStart, end]);\n return spans;\n}\n\nfunction expandBranch(src: string, start: number, end: number): Region {\n let cross: LiveBranch[] = [{ literals: [], run: \"\" }];\n // Set when part of the match is not captured in a literal (wildcard, optional or repeated\n // atom, assertion): gluing this branch to neighbouring text would be unsound.\n let lossy = false;\n const flushRuns = () => {\n for (const b of cross) {\n if (b.run.length > 0) {\n b.literals.push(b.run);\n b.run = \"\";\n }\n }\n };\n // Append `text` repeated by the quantifier's mandatory copies to every live run.\n const appendRun = (text: string, q: Quantifier) => {\n if (q.copies === 0) {\n lossy = true;\n flushRuns();\n return;\n }\n for (const b of cross) b.run += text.repeat(q.copies);\n if (q.openEnded) {\n lossy = true;\n flushRuns();\n }\n };\n\n let i = start;\n while (i < end) {\n const c = src[i] ?? \"\";\n\n if (c === \"^\" || c === \"$\") {\n i += 1;\n continue;\n }\n\n if (c === \"\\\\\") {\n const next = src[i + 1];\n if (next === undefined) {\n i += 1;\n continue;\n }\n const escaped = parseEscapedLiteral(src, i);\n if (escaped) {\n const q = peekQuantifier(src, escaped.end);\n i = q.end;\n appendRun(escaped.char, q);\n continue;\n }\n // \\d \\w \\s \\b, backrefs, \\p{…}: a wildcard; consume its payload.\n if (/[a-zA-Z0-9]/.test(next)) {\n lossy = true;\n flushRuns();\n i = peekQuantifier(src, skipSpecialEscape(src, i)).end;\n continue;\n }\n // \\. \\/ \\( …: the literal character.\n const q = peekQuantifier(src, i + 2);\n i = q.end;\n appendRun(next, q);\n continue;\n }\n\n if (c === \"[\") {\n const classEnd = skipClass(src, i);\n const chars = parseLiteralClass(src, i, classEnd);\n const q = peekQuantifier(src, classEnd);\n i = q.end;\n if (\n q.copies === 0 ||\n chars === null ||\n q.copies > 1 ||\n cross.length * chars.length > MAX_DNF\n ) {\n lossy = true;\n flushRuns();\n continue;\n }\n cross = cross.flatMap((b) =>\n chars.map((ch) => ({ literals: b.literals.slice(), run: b.run + ch })),\n );\n if (q.openEnded) {\n lossy = true;\n flushRuns();\n }\n continue;\n }\n\n if (c === \"(\") {\n const groupEnd = skipGroup(src, i);\n const group = parseGroupPrefix(src, i);\n const q = peekQuantifier(src, groupEnd);\n i = q.end;\n if (group.kind !== \"consuming\" || q.copies === 0) {\n lossy = true;\n flushRuns();\n continue;\n }\n const { dnf: inner, exact } = expandRegion(src, group.innerStart, groupEnd - 1);\n // Fold into the run only when every arm is one contiguous literal used once and is the\n // arm's whole match: a repeated group (`(a|b){3}`) may pick different arms per copy, and\n // a wildcard at an arm's edge (`x(.abc)`) must not be glued away.\n const foldable =\n exact && q.copies === 1 && inner.length > 0 && inner.every((b) => b.length === 1);\n lossy = lossy || q.openEnded || !foldable;\n if (foldable && cross.length * inner.length <= MAX_DNF) {\n cross = cross.flatMap((b) =>\n inner.map((arm) => ({ literals: b.literals.slice(), run: b.run + (arm[0] ?? \"\") })),\n );\n if (q.openEnded) flushRuns();\n continue;\n }\n lossy = true;\n flushRuns();\n if (cross.length * inner.length > MAX_DNF) continue;\n cross = cross.flatMap((b) =>\n inner.map((arm) => ({ literals: b.literals.concat(arm), run: \"\" })),\n );\n continue;\n }\n\n if (c === \".\") {\n lossy = true;\n flushRuns();\n i = peekQuantifier(src, i + 1).end;\n continue;\n }\n\n const q = peekQuantifier(src, i + 1);\n i = q.end;\n appendRun(c, q);\n }\n flushRuns();\n return {\n dnf: cross.map((b) => b.literals),\n exact: !lossy && cross.every((b) => b.literals.length === 1),\n };\n}\n\n/** Where a group's consuming body starts; lookarounds and unknown `(?…)` are not consuming. */\nfunction parseGroupPrefix(src: string, start: number): GroupPrefix {\n if (src[start + 1] !== \"?\") return { kind: \"consuming\", innerStart: start + 1 };\n const marker = src[start + 2];\n if (marker === \":\") return { kind: \"consuming\", innerStart: start + 3 };\n if (marker === \"=\" || marker === \"!\") return { kind: \"assertion\" };\n if (marker === \"<\") {\n const next = src[start + 3];\n if (next === \"=\" || next === \"!\") return { kind: \"assertion\" };\n const nameEnd = src.indexOf(\">\", start + 3);\n if (nameEnd >= 0) return { kind: \"consuming\", innerStart: nameEnd + 1 };\n }\n return { kind: \"unknown\" };\n}\n\n/**\n * `\\xHH`, `\\uHHHH`: escapes that stand for one literal character. `\\u{…}` is not one:\n * the planner compiles without the `u` flag, where it means \"u\" repeated or the text \"u{…}\".\n */\nfunction parseEscapedLiteral(\n src: string,\n start: number,\n): { char: string; end: number } | undefined {\n const kind = src[start + 1];\n if (kind === \"x\") {\n const hex = src.slice(start + 2, start + 4);\n if (!/^[0-9a-fA-F]{2}$/.test(hex)) return undefined;\n return { char: String.fromCharCode(Number.parseInt(hex, 16)), end: start + 4 };\n }\n if (kind === \"u\") {\n const hex = src.slice(start + 2, start + 6);\n if (!/^[0-9a-fA-F]{4}$/.test(hex)) return undefined;\n return { char: String.fromCharCode(Number.parseInt(hex, 16)), end: start + 6 };\n }\n return undefined;\n}\n\n/**\n * Skip an escape that is not a literal punctuation character, so its payload\n * (`\\x41`, `\\p{L}`, `\\k<name>`, backrefs) never leaks into a literal. Malformed\n * `\\x`, `\\u`, `\\c` payloads are Annex-B literals and are rescanned as atoms.\n */\nfunction skipSpecialEscape(src: string, start: number): number {\n const next = src[start + 1];\n if (next === \"x\") {\n return /^[0-9a-fA-F]{2}$/.test(src.slice(start + 2, start + 4)) ? start + 4 : start + 2;\n }\n if (next === \"u\") {\n if (src[start + 2] === \"{\") {\n const close = src.indexOf(\"}\", start + 3);\n return close >= 0 ? close + 1 : src.length;\n }\n return /^[0-9a-fA-F]{4}$/.test(src.slice(start + 2, start + 6)) ? start + 6 : start + 2;\n }\n if (next === \"c\") return /^[a-zA-Z]$/.test(src[start + 2] ?? \"\") ? start + 3 : start + 2;\n if ((next === \"p\" || next === \"P\") && src[start + 2] === \"{\") {\n const close = src.indexOf(\"}\", start + 3);\n return close >= 0 ? close + 1 : src.length;\n }\n if (next === \"k\" && src[start + 2] === \"<\") {\n const close = src.indexOf(\">\", start + 3);\n return close >= 0 ? close + 1 : src.length;\n }\n if (/[0-9]/.test(next ?? \"\")) {\n let i = start + 2;\n while (/[0-9]/.test(src[i] ?? \"\")) i += 1;\n return i;\n }\n return Math.min(start + 2, src.length);\n}\n\n/** A `[...]` class as literal alternatives, or null if negated, ranged, special or empty. */\nfunction parseLiteralClass(src: string, start: number, end: number): string[] | null {\n let i = start + 1;\n const lastInside = end - 1;\n if (src[i] === \"^\") return null;\n const chars = new Set<string>();\n while (i < lastInside) {\n const c = src[i] ?? \"\";\n if (c === \"\\\\\") {\n const next = src[i + 1];\n if (next === undefined || /[a-zA-Z]/.test(next)) return null;\n chars.add(next);\n i += 2;\n continue;\n }\n if (i + 2 < lastInside && src[i + 1] === \"-\") return null;\n chars.add(c);\n i += 1;\n }\n // A surrogate half would split an astral character the index sees as one code point.\n if ([...chars].some((ch) => /[\\ud800-\\udfff]/.test(ch))) return null;\n return chars.size === 0 ? null : [...chars];\n}\n\n/** Mandatory copies of the preceding atom, whether more may follow, and where the quantifier ends. */\nfunction peekQuantifier(src: string, i: number): Quantifier {\n const c = src[i];\n if (c === \"?\" || c === \"*\" || c === \"+\") {\n const end = src[i + 1] === \"?\" ? i + 2 : i + 1;\n return { copies: c === \"+\" ? 1 : 0, openEnded: true, end };\n }\n if (c === \"{\") {\n const close = src.indexOf(\"}\", i);\n if (close < 0) return { copies: 1, openEnded: false, end: i };\n const m = /^(\\d+)(?:,(\\d*))?$/.exec(src.slice(i + 1, close));\n if (!m) return { copies: 1, openEnded: false, end: i };\n const min = Number(m[1]);\n const max = m[2] === undefined ? min : m[2] === \"\" ? Number.POSITIVE_INFINITY : Number(m[2]);\n const end = src[close + 1] === \"?\" ? close + 2 : close + 1;\n return { copies: min, openEnded: max > min, end };\n }\n return { copies: 1, openEnded: false, end: i };\n}\n\nfunction skipClass(src: string, i: number): number {\n let j = i + 1;\n if (src[j] === \"^\") j += 1;\n while (j < src.length && src[j] !== \"]\") j += src[j] === \"\\\\\" && j + 1 < src.length ? 2 : 1;\n return j < src.length ? j + 1 : j;\n}\n\nfunction skipGroup(src: string, i: number): number {\n let depth = 1;\n let j = i + 1;\n while (j < src.length && depth > 0) {\n const c = src[j];\n if (c === \"\\\\\" && j + 1 < src.length) {\n j += 2;\n continue;\n }\n if (c === \"[\") {\n j = skipClass(src, j);\n continue;\n }\n if (c === \"(\") depth += 1;\n else if (c === \")\") depth -= 1;\n j += 1;\n }\n return j;\n}\n","import { fold } from \"./fold.js\";\nimport { regexLiterals } from \"./regex-literals.js\";\n\n/** Longer patterns are rejected: a JS regex cannot be interrupted once it runs. */\nexport const MAX_PATTERN_LENGTH = 1000;\n\nexport type QueryPlan = {\n /** The pattern as a global regex (`i` added when not case-sensitive); verifies candidates. */\n regex: RegExp;\n /**\n * Per DNF branch, the folded literals of at least 3 code points that a match must\n * contain. `null` when some branch has none: only a scan can answer the pattern.\n */\n branches: string[][] | null;\n};\n\nexport function planQuery(\n pattern: string,\n opts: { regex?: boolean; caseSensitive?: boolean } = {},\n): QueryPlan {\n if (pattern.length > MAX_PATTERN_LENGTH) {\n throw new RangeError(\n `ngram: pattern is ${pattern.length} characters, the limit is ${MAX_PATTERN_LENGTH}`,\n );\n }\n // The regex has no `u` flag (case folding is unsound under /iu), so `\\p{…}` would silently\n // match the literal text \"p{…}\". An odd run of backslashes before `p` is a real escape.\n if (opts.regex && /(?<!\\\\)(?:\\\\\\\\)*\\\\[pP]\\{/.test(pattern)) {\n throw new SyntaxError(\n \"ngram: \\\\p{…} and \\\\P{…} are not supported in regex mode (patterns compile without the u flag)\",\n );\n }\n const source = opts.regex ? pattern : pattern.replace(/[.*+?^${}()|[\\]\\\\/]/g, \"\\\\$&\");\n const regex = new RegExp(source, opts.caseSensitive === false ? \"gi\" : \"g\");\n const branches: string[][] = [];\n for (const literals of regexLiterals(regex)) {\n const usable = literals.map(fold).filter((literal) => Array.from(literal).length >= 3);\n if (usable.length === 0) return { regex, branches: null };\n branches.push(usable);\n }\n return { regex, branches };\n}\n","import { fold } from \"./fold.js\";\n\n/** Distinct 3-code-point grams of an already folded string, in first-seen order. */\nexport function gramsOf(folded: string): string[] {\n const cps = Array.from(folded);\n const out = new Set<string>();\n for (let i = 0; i + 3 <= cps.length; i++) out.add(cps.slice(i, i + 3).join(\"\"));\n return [...out];\n}\n\n/** Distinct trigrams of `text` as the index sees it: case-folded, by code point. */\nexport function trigrams(text: string): string[] {\n return gramsOf(fold(text));\n}\n\n/**\n * One SQLite INTEGER per gram. Three BMP code points pack exactly into 48 bits.\n * A gram with an astral code point keeps the low 16 bits of each code point\n * above 2^48: a collision only adds candidates, which verification removes.\n */\nexport function encodeGram(gram: string): number {\n const [a = 0, b = 0, c = 0] = Array.from(gram, (ch) => ch.codePointAt(0) ?? 0);\n if (a < 0x10000 && b < 0x10000 && c < 0x10000) return a * 2 ** 32 + b * 2 ** 16 + c;\n return 2 ** 48 + (a % 0x10000) * 2 ** 32 + (b % 0x10000) * 2 ** 16 + (c % 0x10000);\n}\n","import type { GramBackend, NgramItem } from \"./fts5-backend.js\";\nimport { chunkJson } from \"./json-chunks.js\";\nimport { encodeGram, gramsOf, trigrams } from \"./trigrams.js\";\n\nconst PAIR = \"json_extract(value, '$[0]'), json_extract(value, '$[1]')\";\n\n/**\n * One row per (gram, id) in a WITHOUT ROWID table: the primary key is the\n * posting list, clustered by gram. A text is a candidate for a branch when it\n * holds every distinct gram of the branch's literals.\n */\nexport function newPostingsBackend(prefix: string): GramBackend {\n const table = `${prefix}grams`;\n const pairs = (items: NgramItem[]) =>\n chunkJson(\n items.flatMap((item) => trigrams(item.text).map((gram) => [encodeGram(gram), item.id])),\n );\n return {\n create: (tx) =>\n tx.exec(\n `CREATE TABLE IF NOT EXISTS ${table}(gram INTEGER NOT NULL, id INTEGER NOT NULL, PRIMARY KEY (gram, id)) WITHOUT ROWID`,\n ),\n async add(tx, items) {\n for (const chunk of pairs(items)) {\n await tx.query(\n `INSERT OR IGNORE INTO ${table}(gram, id) SELECT ${PAIR} FROM json_each(?)`,\n [chunk],\n );\n }\n },\n async remove(tx, items) {\n for (const chunk of pairs(items)) {\n await tx.query(\n `DELETE FROM ${table} WHERE (gram, id) IN (SELECT ${PAIR} FROM json_each(?))`,\n [chunk],\n );\n }\n },\n async candidates(db, branches, max) {\n const ids = new Set<number>();\n for (const branch of branches) {\n // Literals are already folded: split them without folding again.\n const grams = [...new Set(branch.flatMap((literal) => gramsOf(literal).map(encodeGram)))];\n const rows = await db.query<{ id: number }>(\n `SELECT id FROM ${table} WHERE gram IN (SELECT value FROM json_each(?)) GROUP BY id HAVING count(*) = ? ORDER BY id LIMIT ?`,\n [JSON.stringify(grams), grams.length, max],\n );\n for (const row of rows) ids.add(Number(row.id));\n }\n return [...ids].sort((a, b) => a - b).slice(0, max);\n },\n };\n}\n","import type { Db } from \"@statewalker/db-api\";\nimport { inTransaction } from \"@statewalker/db-sqlite\";\nimport { PREFIX_PATTERN } from \"../prefix.js\";\nimport { type GramBackend, type NgramItem, newFts5Backend } from \"./fts5-backend.js\";\nimport { chunkJson } from \"./json-chunks.js\";\nimport { planQuery } from \"./plan-query.js\";\nimport { newPostingsBackend } from \"./postings-backend.js\";\n\nexport type { NgramItem };\nexport type NgramMatch = { start: number; end: number };\nexport type NgramHit = { id: number; matches: NgramMatch[] };\nexport type NgramSearchOptions = {\n /** Treat `pattern` as a JS regex source; otherwise it is literal text. */\n regex?: boolean;\n /** Default true (grep semantics). */\n caseSensitive?: boolean;\n /** Maximum hits. Default 100. */\n limit?: number;\n /** Maximum candidates verified. Default 10,000. */\n candidateBudget?: number;\n /** Keep only ids for which this returns true (applied before verification). */\n filter?: (id: number) => boolean;\n signal?: AbortSignal;\n};\nexport type NgramSearchResult = {\n /** Ascending id order; every non-empty match, offsets in UTF-16 code units. */\n hits: NgramHit[];\n /** True when the search stopped before checking every candidate (budget or limit). */\n truncated: boolean;\n};\nexport type NgramStoreOptions = { db: Db; prefix: string; store?: \"fts5\" | \"postings\" };\n\nconst VERIFY_BATCH = 256;\n\nexport class NgramStore {\n /** `{prefix}texts`: its `id` column holds exactly the stored ids. Callers may join it in SQL. */\n readonly idTable: string;\n readonly #db: Db;\n readonly #prefix: string;\n readonly #store: \"fts5\" | \"postings\";\n readonly #backend: GramBackend;\n\n constructor({ db, prefix, store = \"fts5\" }: NgramStoreOptions) {\n if (!PREFIX_PATTERN.test(prefix)) {\n throw new Error(`ngram: prefix \"${prefix}\" must match ${PREFIX_PATTERN}`);\n }\n if (store !== \"fts5\" && store !== \"postings\")\n throw new Error(`ngram: unknown store \"${store}\"`);\n this.#db = db;\n this.#prefix = prefix;\n this.idTable = `${prefix}texts`;\n this.#store = store;\n this.#backend = store === \"fts5\" ? newFts5Backend(prefix) : newPostingsBackend(prefix);\n }\n\n async init(): Promise<void> {\n const p = this.#prefix;\n await inTransaction(this.#db, async (tx) => {\n await tx.exec(\n `CREATE TABLE IF NOT EXISTS ${p}meta(key TEXT PRIMARY KEY, value TEXT NOT NULL)`,\n );\n const [row] = await tx.query<{ value: string }>(\n `SELECT value FROM ${p}meta WHERE key = 'store'`,\n );\n if (row && row.value !== this.#store) {\n throw new Error(\n `ngram: index \"${p}\" was created with store \"${row.value}\", opened with \"${this.#store}\"`,\n );\n }\n if (!row)\n await tx.query(`INSERT INTO ${p}meta(key, value) VALUES ('store', ?)`, [this.#store]);\n await tx.exec(\n `CREATE TABLE IF NOT EXISTS ${p}texts(id INTEGER PRIMARY KEY, text TEXT NOT NULL)`,\n );\n await this.#backend.create(tx);\n });\n }\n\n async upsert(items: NgramItem[]): Promise<void> {\n // The last text per id wins; a repeated id would leave stale grams behind.\n // A lone surrogate would be stored differently from how it was indexed, so a\n // later delete could not replay it: texts are made well-formed first.\n const latest = [\n ...new Map(items.map(({ id, text }) => [id, { id, text: text.toWellFormed() }])).values(),\n ];\n if (latest.length === 0) return;\n await inTransaction(this.#db, async (tx) => {\n await this.#backend.remove(\n tx,\n await this.#load(\n tx,\n latest.map((item) => item.id),\n ),\n );\n for (const chunk of chunkJson(latest.map((item) => [item.id, item.text]))) {\n await tx.query(\n `INSERT OR REPLACE INTO ${this.#prefix}texts(id, text) SELECT json_extract(value, '$[0]'), json_extract(value, '$[1]') FROM json_each(?)`,\n [chunk],\n );\n }\n await this.#backend.add(tx, latest);\n });\n }\n\n async delete(ids: number[]): Promise<void> {\n if (ids.length === 0) return;\n await inTransaction(this.#db, async (tx) => {\n await this.#backend.remove(tx, await this.#load(tx, ids));\n for (const chunk of chunkJson(ids)) {\n await tx.query(\n `DELETE FROM ${this.#prefix}texts WHERE id IN (SELECT value FROM json_each(?))`,\n [chunk],\n );\n }\n });\n }\n\n async search(pattern: string, opts: NgramSearchOptions = {}): Promise<NgramSearchResult> {\n const { limit = 100, candidateBudget = 10_000, filter, signal } = opts;\n const plan = planQuery(pattern, {\n regex: opts.regex,\n caseSensitive: opts.caseSensitive ?? true,\n });\n signal?.throwIfAborted();\n if (limit <= 0) return { hits: [], truncated: true };\n const found =\n plan.branches === null\n ? (\n await this.#db.query<{ id: number }>(\n `SELECT id FROM ${this.#prefix}texts ORDER BY id LIMIT ?`,\n [candidateBudget + 1],\n )\n ).map((row) => Number(row.id))\n : await this.#backend.candidates(this.#db, plan.branches, candidateBudget + 1);\n let truncated = found.length > candidateBudget;\n const ids = found.slice(0, candidateBudget).filter((id) => !filter || filter(id));\n\n const hits: NgramHit[] = [];\n let last: number | undefined;\n verify: for (let i = 0; i < ids.length; i += VERIFY_BATCH) {\n signal?.throwIfAborted();\n for (const { id, text } of await this.#load(this.#db, ids.slice(i, i + VERIFY_BATCH))) {\n last = id;\n const matches: NgramMatch[] = [];\n for (const m of text.matchAll(plan.regex)) {\n if (m[0].length > 0) matches.push({ start: m.index, end: m.index + m[0].length });\n }\n if (matches.length === 0) continue;\n hits.push({ id, matches });\n if (hits.length >= limit) break verify;\n }\n }\n if (hits.length >= limit && last !== ids.at(-1)) truncated = true;\n return { hits, truncated };\n }\n\n /** The stored original texts of `ids`; unknown ids are absent. */\n async getTexts(ids: number[]): Promise<Map<number, string>> {\n const items = await this.#load(this.#db, ids);\n return new Map(items.map((item) => [item.id, item.text]));\n }\n\n /** Drops the tables of both stores, so it works without knowing which one created the prefix. */\n async drop(): Promise<void> {\n const p = this.#prefix;\n await inTransaction(this.#db, async (tx) => {\n for (const t of [\"ng\", \"grams\", \"texts\", \"meta\"])\n await tx.exec(`DROP TABLE IF EXISTS ${p}${t}`);\n });\n }\n\n /** Stored texts for `ids`, ascending by id; missing ids are skipped. */\n async #load(db: Db, ids: number[]): Promise<NgramItem[]> {\n const out: NgramItem[] = [];\n for (const chunk of chunkJson([...ids].sort((a, b) => a - b))) {\n const rows = await db.query<{ id: number; text: string }>(\n `SELECT id, text FROM ${this.#prefix}texts WHERE id IN (SELECT value FROM json_each(?)) ORDER BY id`,\n [chunk],\n );\n for (const row of rows) out.push({ id: Number(row.id), text: String(row.text) });\n }\n return out;\n }\n}\n"],"mappings":";;;;;;;;;;;;;;;AAYA,SAAgB,KAAK,MAAsB;CACzC,IAAI,MAAM;CACV,KAAK,MAAM,MAAM,MAAM;EACrB,MAAM,QAAQ,GAAG,YAAY;EAC7B,MAAM,SAAS,MAAM,KAAK,KAAK,CAAC,CAAC,WAAW,IAAI,QAAQ,GAAA,CAAI,YAAY;EACxE,OAAO,MAAM,WAAW,GAAG,SAAS,QAAQ;CAC9C;CACA,OAAO;AACT;;;;;;;;;ACdA,SAAgB,UAAU,MAAiB,WAAW,KAAmB;CACvE,MAAM,SAAmB,CAAC;CAC1B,IAAI,UAAoB,CAAC;CACzB,IAAI,OAAO;CACX,KAAK,MAAM,OAAO,MAAM;EACtB,MAAM,OAAO,KAAK,UAAU,GAAG;EAC/B,IAAI,QAAQ,SAAS,KAAK,OAAO,KAAK,SAAS,IAAI,UAAU;GAC3D,OAAO,KAAK,IAAI,QAAQ,KAAK,GAAG,EAAE,EAAE;GACpC,UAAU,CAAC;GACX,OAAO;EACT;EACA,QAAQ,KAAK,IAAI;EACjB,QAAQ,KAAK,SAAS;CACxB;CACA,IAAI,QAAQ,SAAS,GAAG,OAAO,KAAK,IAAI,QAAQ,KAAK,GAAG,EAAE,EAAE;CAC5D,OAAO;AACT;;;ACNA,MAAM,MAAM;;;;;;;;AASZ,SAAgB,eAAe,QAA6B;CAC1D,MAAM,QAAQ,GAAG,OAAO;CACxB,MAAM,QAAQ,OAAO,IAAQ,OAAoB,YAAiC;EAChF,MAAM,MACJ,YAAY,WACR,eAAe,MAAM,uBAAuB,IAAI,sBAChD,eAAe,MAAM,GAAG,MAAM,kCAAkC,IAAI;EAC1E,KAAK,MAAM,SAAS,UAAU,MAAM,KAAK,SAAS,CAAC,KAAK,IAAI,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,GAC3E,MAAM,GAAG,MAAM,KAAK,CAAC,KAAK,CAAC;CAE/B;CACA,OAAO;EACL,SAAS,OACP,GAAG,KACD,sCAAsC,MAAM,mEAC9C;EACF,MAAM,IAAI,UAAU,MAAM,IAAI,OAAO,QAAQ;EAC7C,SAAS,IAAI,UAAU,MAAM,IAAI,OAAO,QAAQ;EAChD,MAAM,WAAW,IAAI,UAAU,KAAK;GAElC,MAAM,SAAS,YAAoB,IAAI,QAAQ,WAAW,MAAK,MAAI,EAAE;GACrE,MAAM,QAAQ,SAAS,KAAK,WAAW,IAAI,OAAO,IAAI,KAAK,CAAC,CAAC,KAAK,OAAO,EAAE,EAAE,CAAC,CAAC,KAAK,MAAM;GAK1F,QAAO,MAJY,GAAG,MACpB,2BAA2B,MAAM,SAAS,MAAM,kCAChD,CAAC,OAAO,GAAG,CACb,EAAA,CACY,KAAK,QAAQ,OAAO,IAAI,EAAE,CAAC;EACzC;CACF;AACF;;;;ACvCA,MAAM,UAAU;;;;;;;;AAahB,SAAgB,cAAc,OAA2B;CAEvD,IAAI,MAAM,MAAM,SAAS,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC;CACzC,OAAO,aAAa,MAAM,QAAQ,GAAG,MAAM,OAAO,MAAM,CAAC,CAAC;AAC5D;AAKA,SAAS,aAAa,KAAa,OAAe,KAAqB;CACrE,MAAM,MAAkB,CAAC;CACzB,IAAI,QAAQ;CACZ,KAAK,MAAM,CAAC,QAAQ,SAAS,yBAAyB,KAAK,OAAO,GAAG,GAAG;EACtE,MAAM,MAAM,aAAa,KAAK,QAAQ,IAAI;EAC1C,KAAK,MAAM,UAAU,IAAI,KAAK,IAAI,KAAK,MAAM;EAC7C,QAAQ,SAAS,IAAI;CACvB;CACA,OAAO;EAAE;EAAK;CAAM;AACtB;AAEA,SAAS,yBACP,KACA,OACA,KACyB;CACzB,MAAM,QAAiC,CAAC;CACxC,IAAI,SAAS;CACb,IAAI,QAAQ;CACZ,IAAI,IAAI;CACR,OAAO,IAAI,KAAK;EACd,MAAM,IAAI,IAAI;EACd,IAAI,MAAM,MAAM;GACd,KAAK;GACL;EACF;EACA,IAAI,MAAM,KAAK;GACb,IAAI,UAAU,KAAK,CAAC;GACpB;EACF;EACA,IAAI,MAAM,KAAK,SAAS;OACnB,IAAI,MAAM,KAAK,SAAS;OACxB,IAAI,MAAM,OAAO,UAAU,GAAG;GACjC,MAAM,KAAK,CAAC,QAAQ,CAAC,CAAC;GACtB,SAAS,IAAI;EACf;EACA,KAAK;CACP;CACA,MAAM,KAAK,CAAC,QAAQ,GAAG,CAAC;CACxB,OAAO;AACT;AAEA,SAAS,aAAa,KAAa,OAAe,KAAqB;CACrE,IAAI,QAAsB,CAAC;EAAE,UAAU,CAAC;EAAG,KAAK;CAAG,CAAC;CAGpD,IAAI,QAAQ;CACZ,MAAM,kBAAkB;EACtB,KAAK,MAAM,KAAK,OACd,IAAI,EAAE,IAAI,SAAS,GAAG;GACpB,EAAE,SAAS,KAAK,EAAE,GAAG;GACrB,EAAE,MAAM;EACV;CAEJ;CAEA,MAAM,aAAa,MAAc,MAAkB;EACjD,IAAI,EAAE,WAAW,GAAG;GAClB,QAAQ;GACR,UAAU;GACV;EACF;EACA,KAAK,MAAM,KAAK,OAAO,EAAE,OAAO,KAAK,OAAO,EAAE,MAAM;EACpD,IAAI,EAAE,WAAW;GACf,QAAQ;GACR,UAAU;EACZ;CACF;CAEA,IAAI,IAAI;CACR,OAAO,IAAI,KAAK;EACd,MAAM,IAAI,IAAI,MAAM;EAEpB,IAAI,MAAM,OAAO,MAAM,KAAK;GAC1B,KAAK;GACL;EACF;EAEA,IAAI,MAAM,MAAM;GACd,MAAM,OAAO,IAAI,IAAI;GACrB,IAAI,SAAS,KAAA,GAAW;IACtB,KAAK;IACL;GACF;GACA,MAAM,UAAU,oBAAoB,KAAK,CAAC;GAC1C,IAAI,SAAS;IACX,MAAM,IAAI,eAAe,KAAK,QAAQ,GAAG;IACzC,IAAI,EAAE;IACN,UAAU,QAAQ,MAAM,CAAC;IACzB;GACF;GAEA,IAAI,cAAc,KAAK,IAAI,GAAG;IAC5B,QAAQ;IACR,UAAU;IACV,IAAI,eAAe,KAAK,kBAAkB,KAAK,CAAC,CAAC,CAAC,CAAC;IACnD;GACF;GAEA,MAAM,IAAI,eAAe,KAAK,IAAI,CAAC;GACnC,IAAI,EAAE;GACN,UAAU,MAAM,CAAC;GACjB;EACF;EAEA,IAAI,MAAM,KAAK;GACb,MAAM,WAAW,UAAU,KAAK,CAAC;GACjC,MAAM,QAAQ,kBAAkB,KAAK,GAAG,QAAQ;GAChD,MAAM,IAAI,eAAe,KAAK,QAAQ;GACtC,IAAI,EAAE;GACN,IACE,EAAE,WAAW,KACb,UAAU,QACV,EAAE,SAAS,KACX,MAAM,SAAS,MAAM,SAAS,SAC9B;IACA,QAAQ;IACR,UAAU;IACV;GACF;GACA,QAAQ,MAAM,SAAS,MACrB,MAAM,KAAK,QAAQ;IAAE,UAAU,EAAE,SAAS,MAAM;IAAG,KAAK,EAAE,MAAM;GAAG,EAAE,CACvE;GACA,IAAI,EAAE,WAAW;IACf,QAAQ;IACR,UAAU;GACZ;GACA;EACF;EAEA,IAAI,MAAM,KAAK;GACb,MAAM,WAAW,UAAU,KAAK,CAAC;GACjC,MAAM,QAAQ,iBAAiB,KAAK,CAAC;GACrC,MAAM,IAAI,eAAe,KAAK,QAAQ;GACtC,IAAI,EAAE;GACN,IAAI,MAAM,SAAS,eAAe,EAAE,WAAW,GAAG;IAChD,QAAQ;IACR,UAAU;IACV;GACF;GACA,MAAM,EAAE,KAAK,OAAO,UAAU,aAAa,KAAK,MAAM,YAAY,WAAW,CAAC;GAI9E,MAAM,WACJ,SAAS,EAAE,WAAW,KAAK,MAAM,SAAS,KAAK,MAAM,OAAO,MAAM,EAAE,WAAW,CAAC;GAClF,QAAQ,SAAS,EAAE,aAAa,CAAC;GACjC,IAAI,YAAY,MAAM,SAAS,MAAM,UAAU,SAAS;IACtD,QAAQ,MAAM,SAAS,MACrB,MAAM,KAAK,SAAS;KAAE,UAAU,EAAE,SAAS,MAAM;KAAG,KAAK,EAAE,OAAO,IAAI,MAAM;IAAI,EAAE,CACpF;IACA,IAAI,EAAE,WAAW,UAAU;IAC3B;GACF;GACA,QAAQ;GACR,UAAU;GACV,IAAI,MAAM,SAAS,MAAM,SAAS,SAAS;GAC3C,QAAQ,MAAM,SAAS,MACrB,MAAM,KAAK,SAAS;IAAE,UAAU,EAAE,SAAS,OAAO,GAAG;IAAG,KAAK;GAAG,EAAE,CACpE;GACA;EACF;EAEA,IAAI,MAAM,KAAK;GACb,QAAQ;GACR,UAAU;GACV,IAAI,eAAe,KAAK,IAAI,CAAC,CAAC,CAAC;GAC/B;EACF;EAEA,MAAM,IAAI,eAAe,KAAK,IAAI,CAAC;EACnC,IAAI,EAAE;EACN,UAAU,GAAG,CAAC;CAChB;CACA,UAAU;CACV,OAAO;EACL,KAAK,MAAM,KAAK,MAAM,EAAE,QAAQ;EAChC,OAAO,CAAC,SAAS,MAAM,OAAO,MAAM,EAAE,SAAS,WAAW,CAAC;CAC7D;AACF;;AAGA,SAAS,iBAAiB,KAAa,OAA4B;CACjE,IAAI,IAAI,QAAQ,OAAO,KAAK,OAAO;EAAE,MAAM;EAAa,YAAY,QAAQ;CAAE;CAC9E,MAAM,SAAS,IAAI,QAAQ;CAC3B,IAAI,WAAW,KAAK,OAAO;EAAE,MAAM;EAAa,YAAY,QAAQ;CAAE;CACtE,IAAI,WAAW,OAAO,WAAW,KAAK,OAAO,EAAE,MAAM,YAAY;CACjE,IAAI,WAAW,KAAK;EAClB,MAAM,OAAO,IAAI,QAAQ;EACzB,IAAI,SAAS,OAAO,SAAS,KAAK,OAAO,EAAE,MAAM,YAAY;EAC7D,MAAM,UAAU,IAAI,QAAQ,KAAK,QAAQ,CAAC;EAC1C,IAAI,WAAW,GAAG,OAAO;GAAE,MAAM;GAAa,YAAY,UAAU;EAAE;CACxE;CACA,OAAO,EAAE,MAAM,UAAU;AAC3B;;;;;AAMA,SAAS,oBACP,KACA,OAC2C;CAC3C,MAAM,OAAO,IAAI,QAAQ;CACzB,IAAI,SAAS,KAAK;EAChB,MAAM,MAAM,IAAI,MAAM,QAAQ,GAAG,QAAQ,CAAC;EAC1C,IAAI,CAAC,mBAAmB,KAAK,GAAG,GAAG,OAAO,KAAA;EAC1C,OAAO;GAAE,MAAM,OAAO,aAAa,OAAO,SAAS,KAAK,EAAE,CAAC;GAAG,KAAK,QAAQ;EAAE;CAC/E;CACA,IAAI,SAAS,KAAK;EAChB,MAAM,MAAM,IAAI,MAAM,QAAQ,GAAG,QAAQ,CAAC;EAC1C,IAAI,CAAC,mBAAmB,KAAK,GAAG,GAAG,OAAO,KAAA;EAC1C,OAAO;GAAE,MAAM,OAAO,aAAa,OAAO,SAAS,KAAK,EAAE,CAAC;GAAG,KAAK,QAAQ;EAAE;CAC/E;AAEF;;;;;;AAOA,SAAS,kBAAkB,KAAa,OAAuB;CAC7D,MAAM,OAAO,IAAI,QAAQ;CACzB,IAAI,SAAS,KACX,OAAO,mBAAmB,KAAK,IAAI,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,IAAI,QAAQ,IAAI,QAAQ;CAExF,IAAI,SAAS,KAAK;EAChB,IAAI,IAAI,QAAQ,OAAO,KAAK;GAC1B,MAAM,QAAQ,IAAI,QAAQ,KAAK,QAAQ,CAAC;GACxC,OAAO,SAAS,IAAI,QAAQ,IAAI,IAAI;EACtC;EACA,OAAO,mBAAmB,KAAK,IAAI,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,IAAI,QAAQ,IAAI,QAAQ;CACxF;CACA,IAAI,SAAS,KAAK,OAAO,aAAa,KAAK,IAAI,QAAQ,MAAM,EAAE,IAAI,QAAQ,IAAI,QAAQ;CACvF,KAAK,SAAS,OAAO,SAAS,QAAQ,IAAI,QAAQ,OAAO,KAAK;EAC5D,MAAM,QAAQ,IAAI,QAAQ,KAAK,QAAQ,CAAC;EACxC,OAAO,SAAS,IAAI,QAAQ,IAAI,IAAI;CACtC;CACA,IAAI,SAAS,OAAO,IAAI,QAAQ,OAAO,KAAK;EAC1C,MAAM,QAAQ,IAAI,QAAQ,KAAK,QAAQ,CAAC;EACxC,OAAO,SAAS,IAAI,QAAQ,IAAI,IAAI;CACtC;CACA,IAAI,QAAQ,KAAK,QAAQ,EAAE,GAAG;EAC5B,IAAI,IAAI,QAAQ;EAChB,OAAO,QAAQ,KAAK,IAAI,MAAM,EAAE,GAAG,KAAK;EACxC,OAAO;CACT;CACA,OAAO,KAAK,IAAI,QAAQ,GAAG,IAAI,MAAM;AACvC;;AAGA,SAAS,kBAAkB,KAAa,OAAe,KAA8B;CACnF,IAAI,IAAI,QAAQ;CAChB,MAAM,aAAa,MAAM;CACzB,IAAI,IAAI,OAAO,KAAK,OAAO;CAC3B,MAAM,wBAAQ,IAAI,IAAY;CAC9B,OAAO,IAAI,YAAY;EACrB,MAAM,IAAI,IAAI,MAAM;EACpB,IAAI,MAAM,MAAM;GACd,MAAM,OAAO,IAAI,IAAI;GACrB,IAAI,SAAS,KAAA,KAAa,WAAW,KAAK,IAAI,GAAG,OAAO;GACxD,MAAM,IAAI,IAAI;GACd,KAAK;GACL;EACF;EACA,IAAI,IAAI,IAAI,cAAc,IAAI,IAAI,OAAO,KAAK,OAAO;EACrD,MAAM,IAAI,CAAC;EACX,KAAK;CACP;CAEA,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,MAAM,OAAO,kBAAkB,KAAK,EAAE,CAAC,GAAG,OAAO;CAChE,OAAO,MAAM,SAAS,IAAI,OAAO,CAAC,GAAG,KAAK;AAC5C;;AAGA,SAAS,eAAe,KAAa,GAAuB;CAC1D,MAAM,IAAI,IAAI;CACd,IAAI,MAAM,OAAO,MAAM,OAAO,MAAM,KAAK;EACvC,MAAM,MAAM,IAAI,IAAI,OAAO,MAAM,IAAI,IAAI,IAAI;EAC7C,OAAO;GAAE,QAAQ,MAAM,MAAM,IAAI;GAAG,WAAW;GAAM;EAAI;CAC3D;CACA,IAAI,MAAM,KAAK;EACb,MAAM,QAAQ,IAAI,QAAQ,KAAK,CAAC;EAChC,IAAI,QAAQ,GAAG,OAAO;GAAE,QAAQ;GAAG,WAAW;GAAO,KAAK;EAAE;EAC5D,MAAM,IAAI,qBAAqB,KAAK,IAAI,MAAM,IAAI,GAAG,KAAK,CAAC;EAC3D,IAAI,CAAC,GAAG,OAAO;GAAE,QAAQ;GAAG,WAAW;GAAO,KAAK;EAAE;EACrD,MAAM,MAAM,OAAO,EAAE,EAAE;EACvB,MAAM,MAAM,EAAE,OAAO,KAAA,IAAY,MAAM,EAAE,OAAO,KAAK,OAAO,oBAAoB,OAAO,EAAE,EAAE;EAC3F,MAAM,MAAM,IAAI,QAAQ,OAAO,MAAM,QAAQ,IAAI,QAAQ;EACzD,OAAO;GAAE,QAAQ;GAAK,WAAW,MAAM;GAAK;EAAI;CAClD;CACA,OAAO;EAAE,QAAQ;EAAG,WAAW;EAAO,KAAK;CAAE;AAC/C;AAEA,SAAS,UAAU,KAAa,GAAmB;CACjD,IAAI,IAAI,IAAI;CACZ,IAAI,IAAI,OAAO,KAAK,KAAK;CACzB,OAAO,IAAI,IAAI,UAAU,IAAI,OAAO,KAAK,KAAK,IAAI,OAAO,QAAQ,IAAI,IAAI,IAAI,SAAS,IAAI;CAC1F,OAAO,IAAI,IAAI,SAAS,IAAI,IAAI;AAClC;AAEA,SAAS,UAAU,KAAa,GAAmB;CACjD,IAAI,QAAQ;CACZ,IAAI,IAAI,IAAI;CACZ,OAAO,IAAI,IAAI,UAAU,QAAQ,GAAG;EAClC,MAAM,IAAI,IAAI;EACd,IAAI,MAAM,QAAQ,IAAI,IAAI,IAAI,QAAQ;GACpC,KAAK;GACL;EACF;EACA,IAAI,MAAM,KAAK;GACb,IAAI,UAAU,KAAK,CAAC;GACpB;EACF;EACA,IAAI,MAAM,KAAK,SAAS;OACnB,IAAI,MAAM,KAAK,SAAS;EAC7B,KAAK;CACP;CACA,OAAO;AACT;;;;AClWA,MAAa,qBAAqB;AAYlC,SAAgB,UACd,SACA,OAAqD,CAAC,GAC3C;CACX,IAAI,QAAQ,SAAA,KACV,MAAM,IAAI,WACR,qBAAqB,QAAQ,OAAO,4BAA4B,oBAClE;CAIF,IAAI,KAAK,SAAS,2BAA2B,KAAK,OAAO,GACvD,MAAM,IAAI,YACR,gGACF;CAEF,MAAM,SAAS,KAAK,QAAQ,UAAU,QAAQ,QAAQ,wBAAwB,MAAM;CACpF,MAAM,QAAQ,IAAI,OAAO,QAAQ,KAAK,kBAAkB,QAAQ,OAAO,GAAG;CAC1E,MAAM,WAAuB,CAAC;CAC9B,KAAK,MAAM,YAAY,cAAc,KAAK,GAAG;EAC3C,MAAM,SAAS,SAAS,IAAI,IAAI,CAAC,CAAC,QAAQ,YAAY,MAAM,KAAK,OAAO,CAAC,CAAC,UAAU,CAAC;EACrF,IAAI,OAAO,WAAW,GAAG,OAAO;GAAE;GAAO,UAAU;EAAK;EACxD,SAAS,KAAK,MAAM;CACtB;CACA,OAAO;EAAE;EAAO;CAAS;AAC3B;;;;ACtCA,SAAgB,QAAQ,QAA0B;CAChD,MAAM,MAAM,MAAM,KAAK,MAAM;CAC7B,MAAM,sBAAM,IAAI,IAAY;CAC5B,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,QAAQ,KAAK,IAAI,IAAI,IAAI,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;CAC9E,OAAO,CAAC,GAAG,GAAG;AAChB;;AAGA,SAAgB,SAAS,MAAwB;CAC/C,OAAO,QAAQ,KAAK,IAAI,CAAC;AAC3B;;;;;;AAOA,SAAgB,WAAW,MAAsB;CAC/C,MAAM,CAAC,IAAI,GAAG,IAAI,GAAG,IAAI,KAAK,MAAM,KAAK,OAAO,OAAO,GAAG,YAAY,CAAC,KAAK,CAAC;CAC7E,IAAI,IAAI,SAAW,IAAI,SAAW,IAAI,OAAS,OAAO,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK;CAClF,OAAO,KAAK,KAAM,IAAI,QAAW,KAAK,KAAM,IAAI,QAAW,KAAK,KAAM,IAAI;AAC5E;;;ACpBA,MAAM,OAAO;;;;;;AAOb,SAAgB,mBAAmB,QAA6B;CAC9D,MAAM,QAAQ,GAAG,OAAO;CACxB,MAAM,SAAS,UACb,UACE,MAAM,SAAS,SAAS,SAAS,KAAK,IAAI,CAAC,CAAC,KAAK,SAAS,CAAC,WAAW,IAAI,GAAG,KAAK,EAAE,CAAC,CAAC,CACxF;CACF,OAAO;EACL,SAAS,OACP,GAAG,KACD,8BAA8B,MAAM,mFACtC;EACF,MAAM,IAAI,IAAI,OAAO;GACnB,KAAK,MAAM,SAAS,MAAM,KAAK,GAC7B,MAAM,GAAG,MACP,yBAAyB,MAAM,oBAAoB,KAAK,qBACxD,CAAC,KAAK,CACR;EAEJ;EACA,MAAM,OAAO,IAAI,OAAO;GACtB,KAAK,MAAM,SAAS,MAAM,KAAK,GAC7B,MAAM,GAAG,MACP,eAAe,MAAM,+BAA+B,KAAK,sBACzD,CAAC,KAAK,CACR;EAEJ;EACA,MAAM,WAAW,IAAI,UAAU,KAAK;GAClC,MAAM,sBAAM,IAAI,IAAY;GAC5B,KAAK,MAAM,UAAU,UAAU;IAE7B,MAAM,QAAQ,CAAC,GAAG,IAAI,IAAI,OAAO,SAAS,YAAY,QAAQ,OAAO,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC;IACxF,MAAM,OAAO,MAAM,GAAG,MACpB,kBAAkB,MAAM,sGACxB;KAAC,KAAK,UAAU,KAAK;KAAG,MAAM;KAAQ;IAAG,CAC3C;IACA,KAAK,MAAM,OAAO,MAAM,IAAI,IAAI,OAAO,IAAI,EAAE,CAAC;GAChD;GACA,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,GAAG,MAAM,IAAI,CAAC,CAAC,CAAC,MAAM,GAAG,GAAG;EACpD;CACF;AACF;;;ACpBA,MAAM,eAAe;AAErB,IAAa,aAAb,MAAwB;;CAEtB;CACA;CACA;CACA;CACA;CAEA,YAAY,EAAE,IAAI,QAAQ,QAAQ,UAA6B;EAC7D,IAAI,CAAC,eAAe,KAAK,MAAM,GAC7B,MAAM,IAAI,MAAM,kBAAkB,OAAO,eAAe,gBAAgB;EAE1E,IAAI,UAAU,UAAU,UAAU,YAChC,MAAM,IAAI,MAAM,yBAAyB,MAAM,EAAE;EACnD,KAAK,MAAM;EACX,KAAK,UAAU;EACf,KAAK,UAAU,GAAG,OAAO;EACzB,KAAK,SAAS;EACd,KAAK,WAAW,UAAU,SAAS,eAAe,MAAM,IAAI,mBAAmB,MAAM;CACvF;CAEA,MAAM,OAAsB;EAC1B,MAAM,IAAI,KAAK;EACf,MAAM,cAAc,KAAK,KAAK,OAAO,OAAO;GAC1C,MAAM,GAAG,KACP,8BAA8B,EAAE,gDAClC;GACA,MAAM,CAAC,OAAO,MAAM,GAAG,MACrB,qBAAqB,EAAE,yBACzB;GACA,IAAI,OAAO,IAAI,UAAU,KAAK,QAC5B,MAAM,IAAI,MACR,iBAAiB,EAAE,4BAA4B,IAAI,MAAM,kBAAkB,KAAK,OAAO,EACzF;GAEF,IAAI,CAAC,KACH,MAAM,GAAG,MAAM,eAAe,EAAE,uCAAuC,CAAC,KAAK,MAAM,CAAC;GACtF,MAAM,GAAG,KACP,8BAA8B,EAAE,kDAClC;GACA,MAAM,KAAK,SAAS,OAAO,EAAE;EAC/B,CAAC;CACH;CAEA,MAAM,OAAO,OAAmC;EAI9C,MAAM,SAAS,CACb,GAAG,IAAI,IAAI,MAAM,KAAK,EAAE,IAAI,WAAW,CAAC,IAAI;GAAE;GAAI,MAAM,KAAK,aAAa;EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAC1F;EACA,IAAI,OAAO,WAAW,GAAG;EACzB,MAAM,cAAc,KAAK,KAAK,OAAO,OAAO;GAC1C,MAAM,KAAK,SAAS,OAClB,IACA,MAAM,KAAK,MACT,IACA,OAAO,KAAK,SAAS,KAAK,EAAE,CAC9B,CACF;GACA,KAAK,MAAM,SAAS,UAAU,OAAO,KAAK,SAAS,CAAC,KAAK,IAAI,KAAK,IAAI,CAAC,CAAC,GACtE,MAAM,GAAG,MACP,0BAA0B,KAAK,QAAQ,oGACvC,CAAC,KAAK,CACR;GAEF,MAAM,KAAK,SAAS,IAAI,IAAI,MAAM;EACpC,CAAC;CACH;CAEA,MAAM,OAAO,KAA8B;EACzC,IAAI,IAAI,WAAW,GAAG;EACtB,MAAM,cAAc,KAAK,KAAK,OAAO,OAAO;GAC1C,MAAM,KAAK,SAAS,OAAO,IAAI,MAAM,KAAK,MAAM,IAAI,GAAG,CAAC;GACxD,KAAK,MAAM,SAAS,UAAU,GAAG,GAC/B,MAAM,GAAG,MACP,eAAe,KAAK,QAAQ,qDAC5B,CAAC,KAAK,CACR;EAEJ,CAAC;CACH;CAEA,MAAM,OAAO,SAAiB,OAA2B,CAAC,GAA+B;EACvF,MAAM,EAAE,QAAQ,KAAK,kBAAkB,KAAQ,QAAQ,WAAW;EAClE,MAAM,OAAO,UAAU,SAAS;GAC9B,OAAO,KAAK;GACZ,eAAe,KAAK,iBAAiB;EACvC,CAAC;EACD,QAAQ,eAAe;EACvB,IAAI,SAAS,GAAG,OAAO;GAAE,MAAM,CAAC;GAAG,WAAW;EAAK;EACnD,MAAM,QACJ,KAAK,aAAa,QAEZ,MAAM,KAAK,IAAI,MACb,kBAAkB,KAAK,QAAQ,4BAC/B,CAAC,kBAAkB,CAAC,CACtB,EAAA,CACA,KAAK,QAAQ,OAAO,IAAI,EAAE,CAAC,IAC7B,MAAM,KAAK,SAAS,WAAW,KAAK,KAAK,KAAK,UAAU,kBAAkB,CAAC;EACjF,IAAI,YAAY,MAAM,SAAS;EAC/B,MAAM,MAAM,MAAM,MAAM,GAAG,eAAe,CAAC,CAAC,QAAQ,OAAO,CAAC,UAAU,OAAO,EAAE,CAAC;EAEhF,MAAM,OAAmB,CAAC;EAC1B,IAAI;EACJ,QAAQ,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK,cAAc;GACzD,QAAQ,eAAe;GACvB,KAAK,MAAM,EAAE,IAAI,UAAU,MAAM,KAAK,MAAM,KAAK,KAAK,IAAI,MAAM,GAAG,IAAI,YAAY,CAAC,GAAG;IACrF,OAAO;IACP,MAAM,UAAwB,CAAC;IAC/B,KAAK,MAAM,KAAK,KAAK,SAAS,KAAK,KAAK,GACtC,IAAI,EAAE,EAAE,CAAC,SAAS,GAAG,QAAQ,KAAK;KAAE,OAAO,EAAE;KAAO,KAAK,EAAE,QAAQ,EAAE,EAAE,CAAC;IAAO,CAAC;IAElF,IAAI,QAAQ,WAAW,GAAG;IAC1B,KAAK,KAAK;KAAE;KAAI;IAAQ,CAAC;IACzB,IAAI,KAAK,UAAU,OAAO,MAAM;GAClC;EACF;EACA,IAAI,KAAK,UAAU,SAAS,SAAS,IAAI,GAAG,EAAE,GAAG,YAAY;EAC7D,OAAO;GAAE;GAAM;EAAU;CAC3B;;CAGA,MAAM,SAAS,KAA6C;EAC1D,MAAM,QAAQ,MAAM,KAAK,MAAM,KAAK,KAAK,GAAG;EAC5C,OAAO,IAAI,IAAI,MAAM,KAAK,SAAS,CAAC,KAAK,IAAI,KAAK,IAAI,CAAC,CAAC;CAC1D;;CAGA,MAAM,OAAsB;EAC1B,MAAM,IAAI,KAAK;EACf,MAAM,cAAc,KAAK,KAAK,OAAO,OAAO;GAC1C,KAAK,MAAM,KAAK;IAAC;IAAM;IAAS;IAAS;GAAM,GAC7C,MAAM,GAAG,KAAK,wBAAwB,IAAI,GAAG;EACjD,CAAC;CACH;;CAGA,MAAM,MAAM,IAAQ,KAAqC;EACvD,MAAM,MAAmB,CAAC;EAC1B,KAAK,MAAM,SAAS,UAAU,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,GAAG,MAAM,IAAI,CAAC,CAAC,GAAG;GAC7D,MAAM,OAAO,MAAM,GAAG,MACpB,wBAAwB,KAAK,QAAQ,iEACrC,CAAC,KAAK,CACR;GACA,KAAK,MAAM,OAAO,MAAM,IAAI,KAAK;IAAE,IAAI,OAAO,IAAI,EAAE;IAAG,MAAM,OAAO,IAAI,IAAI;GAAE,CAAC;EACjF;EACA,OAAO;CACT;AACF"}
@@ -0,0 +1,7 @@
1
+ //#region src/prefix.ts
2
+ /** Table-name prefixes the indexes accept: an SQL identifier, so it is safe to interpolate. */
3
+ const PREFIX_PATTERN = /^[A-Za-z_][A-Za-z0-9_]*$/;
4
+ //#endregion
5
+ export { PREFIX_PATTERN as t };
6
+
7
+ //# sourceMappingURL=prefix-CTeW1EwH.mjs.map
@@ -0,0 +1 @@
1
+ {"version":3,"file":"prefix-CTeW1EwH.mjs","names":[],"sources":["../src/prefix.ts"],"sourcesContent":["/** Table-name prefixes the indexes accept: an SQL identifier, so it is safe to interpolate. */\nexport const PREFIX_PATTERN = /^[A-Za-z_][A-Za-z0-9_]*$/;\n"],"mappings":";;AACA,MAAa,iBAAiB"}
@@ -1 +1 @@
1
- {"version":3,"file":"vector.d.mts","names":[],"sources":["../src/vector/types.ts","../src/vector/sql-segment-store.ts","../src/vector/vector-index.ts"],"mappings":";;KAAY;UAEK;EACf;;EAEA;;UAGe;EACf;;EAEA;;EAEA;;EAEA;;EAEA,UAAU;EACV,SAAS;;;;UCRM;EACf;EACA;EACA;;;;UCMe;EACf,IAAI;;EAEJ;EACA;EACA,SAAS;;EAET,SAAS;;EAET;;;;;;EAMA;;UAGe;;EAEf;EACA,QAAQ;;UAGO;EACf;EACA,UAAU;EACV;;;;;;;;;;;;;;;;;qBAkCW;;WACF;WACA,QAAQ;;WAER;EAkBT,YAAY,MAAM;;EAqBZ,QAAQ;;EA+BR,WAAW;MAqBb,SAAS;EAUP,OAAO,OAAO,eAAe;EAiC7B,OAAO,gBAAgB;EAwBvB,OAAO,OAAO,mBAAmB,OAAM,gBAAqB,QAAQ;;EAoEpE,WAAW,gBAAgB,QAAQ,YAAY;;EAwC/C,WAAW;;;;;EAkDX,SAAS;;EAgET,YAAY;;;wBAiHE,gBAAgB,IAAI,IAAI,iBAAiB"}
1
+ {"version":3,"file":"vector.d.mts","names":[],"sources":["../src/vector/types.ts","../src/vector/sql-segment-store.ts","../src/vector/vector-index.ts"],"mappings":";;KAAY;UAEK;EACf;;EAEA;;UAGe;EACf;;EAEA;;EAEA;;EAEA;;EAEA,UAAU;EACV,SAAS;;;;UCRM;EACf;EACA;EACA;;;;UCOe;EACf,IAAI;;EAEJ;EACA;EACA,SAAS;;EAET,SAAS;;EAET;;;;;;EAMA;;UAGe;;EAEf;EACA,QAAQ;;UAGO;EACf;EACA,UAAU;EACV;;;;;;;;;;;;;;;;;qBAkCW;;WACF;WACA,QAAQ;;WAER;EAkBT,YAAY,MAAM;;EAqBZ,QAAQ;;EA+BR,WAAW;MAqBb,SAAS;EAUP,OAAO,OAAO,eAAe;EAiC7B,OAAO,gBAAgB;EAwBvB,OAAO,OAAO,mBAAmB,OAAM,gBAAqB,QAAQ;;EAoEpE,WAAW,gBAAgB,QAAQ,YAAY;;EAwC/C,WAAW;;;;;EAkDX,SAAS;;EAgET,YAAY;;;wBAiHE,gBAAgB,IAAI,IAAI,iBAAiB"}
package/dist/vector.mjs CHANGED
@@ -1,3 +1,4 @@
1
+ import { t as PREFIX_PATTERN } from "./prefix-CTeW1EwH.mjs";
1
2
  import { inTransaction } from "@statewalker/db-sqlite";
2
3
  //#region src/vector/math.ts
3
4
  function normalize(v) {
@@ -641,7 +642,7 @@ var VectorIndex = class {
641
642
  /** Bumped before and after each commit that changes the segment list: odd while one runs. */
642
643
  #epoch = 0;
643
644
  constructor(opts) {
644
- if (!/^[A-Za-z_][A-Za-z0-9_]*$/.test(opts.prefix)) throw new Error(`vector-index: bad prefix ${opts.prefix}`);
645
+ if (!PREFIX_PATTERN.test(opts.prefix)) throw new Error(`vector-index: bad prefix ${opts.prefix}`);
645
646
  if (!Number.isInteger(opts.dims) || opts.dims < 1) throw new Error("vector-index: dims must be a positive integer");
646
647
  this.dims = opts.dims;
647
648
  this.metric = opts.metric ?? "cosine";
@@ -1043,7 +1044,7 @@ function assertId(id) {
1043
1044
  }
1044
1045
  /** Drops every table of the index under `prefix`, in one transaction. Needs no dims or metric. */
1045
1046
  async function dropVectorIndex(db, prefix) {
1046
- if (!/^[A-Za-z_][A-Za-z0-9_]*$/.test(prefix)) throw new Error(`vector-index: bad prefix ${prefix}`);
1047
+ if (!PREFIX_PATTERN.test(prefix)) throw new Error(`vector-index: bad prefix ${prefix}`);
1047
1048
  await inTransaction(db, async (tx) => {
1048
1049
  for (const t of [
1049
1050
  "meta",
@@ -1 +1 @@
1
- {"version":3,"file":"vector.mjs","names":[],"sources":["../src/vector/math.ts","../src/vector/kmeans.ts","../src/vector/segment.ts","../src/vector/types.ts","../src/vector/sql-segment-store.ts","../src/vector/vector-index.ts"],"sourcesContent":["import type { Metric } from \"./types.js\";\n\nexport function normalize(v: Float32Array): Float32Array {\n let n = 0;\n for (let i = 0; i < v.length; i++) n += v[i] * v[i];\n n = Math.sqrt(n);\n const out = new Float32Array(v.length);\n if (n === 0) return out;\n for (let i = 0; i < v.length; i++) out[i] = v[i] / n;\n return out;\n}\n\n/** Vectors are stored pre-normalized for cosine, so cosine reduces to dot. */\nexport function prepare(v: ArrayLike<number>, dims: number, metric: Metric): Float32Array {\n if (v.length !== dims) throw new Error(`vector-index: expected ${dims} dims, got ${v.length}`);\n const f = v instanceof Float32Array ? v : Float32Array.from(v);\n for (let i = 0; i < f.length; i++) {\n if (!Number.isFinite(f[i])) throw new Error(\"vector-index: vector contains a non-finite value\");\n }\n return metric === \"cosine\" ? normalize(f) : f.slice();\n}\n\n/** Distance between two float vectors at offsets; lower is closer. */\nexport function distance(\n metric: Metric,\n a: Float32Array,\n ao: number,\n b: Float32Array,\n bo: number,\n d: number,\n): number {\n if (metric === \"l2\") {\n let s = 0;\n for (let i = 0; i < d; i++) {\n const x = a[ao + i] - b[bo + i];\n s += x * x;\n }\n return s;\n }\n let s = 0;\n for (let i = 0; i < d; i++) s += a[ao + i] * b[bo + i];\n return metric === \"cosine\" ? 1 - s : -s;\n}\n\n// ------------------------------------------------------------ int8\n\n/** Symmetric per-vector int8: x ≈ q * scale / 127. Returns the scale. */\nexport function quantizeInt8(v: Float32Array, vo: number, d: number, out: Int8Array, oo: number) {\n let max = 0;\n for (let i = 0; i < d; i++) max = Math.max(max, Math.abs(v[vo + i]));\n const inv = max === 0 ? 0 : 127 / max;\n for (let i = 0; i < d; i++) out[oo + i] = Math.round(v[vo + i] * inv);\n return max;\n}\n\n/** Distance between a float query and an int8-coded vector. */\nexport function distanceInt8(\n metric: Metric,\n q: Float32Array,\n codes: Int8Array,\n co: number,\n scale: number,\n d: number,\n): number {\n const f = scale / 127;\n if (metric === \"l2\") {\n let s = 0;\n for (let i = 0; i < d; i++) {\n const x = q[i] - codes[co + i] * f;\n s += x * x;\n }\n return s;\n }\n let s = 0;\n for (let i = 0; i < d; i++) s += q[i] * codes[co + i];\n s *= f;\n return metric === \"cosine\" ? 1 - s : -s;\n}\n\nexport function dequantizeInt8(codes: Int8Array, co: number, scale: number, d: number) {\n const out = new Float32Array(d);\n const f = scale / 127;\n for (let i = 0; i < d; i++) out[i] = codes[co + i] * f;\n return out;\n}\n\n// ------------------------------------------------------------ 1-bit\n\nexport const wordsFor = (d: number) => (d + 31) >>> 5;\n\n/** Sign bits of (v - centroid): residual binarization, meaningful for every metric. */\nexport function residualBits(\n v: Float32Array,\n vo: number,\n c: Float32Array,\n co: number,\n d: number,\n out: Uint32Array,\n oo: number,\n) {\n const w = wordsFor(d);\n out.fill(0, oo, oo + w);\n for (let i = 0; i < d; i++) {\n if (v[vo + i] > c[co + i]) out[oo + (i >>> 5)] |= 1 << (i & 31);\n }\n}\n\nexport function hamming(a: Uint32Array, b: Uint32Array, bo: number, w: number): number {\n let n = 0;\n for (let i = 0; i < w; i++) {\n let x = a[i] ^ b[bo + i];\n x -= (x >>> 1) & 0x55555555;\n x = (x & 0x33333333) + ((x >>> 2) & 0x33333333);\n n += Math.imul((x + (x >>> 4)) & 0x0f0f0f0f, 0x01010101) >>> 24;\n }\n return n;\n}\n\n// ------------------------------------------------------------ top-k\n\n/** Keeps the `k` smallest scores. A binary max-heap over parallel arrays. */\nexport class TopK<T> {\n readonly #k: number;\n readonly #scores: number[] = [];\n readonly #items: T[] = [];\n\n constructor(k: number) {\n this.#k = Math.max(0, k);\n }\n\n get size() {\n return this.#scores.length;\n }\n\n /** The score a new item must beat, or Infinity while not full. */\n get bound() {\n return this.#scores.length < this.#k ? Number.POSITIVE_INFINITY : this.#scores[0];\n }\n\n push(score: number, item: T) {\n if (this.#k === 0) return;\n const s = this.#scores;\n const it = this.#items;\n if (s.length < this.#k) {\n s.push(score);\n it.push(item);\n let i = s.length - 1;\n while (i > 0) {\n const p = (i - 1) >> 1;\n if (s[p] >= s[i]) break;\n this.#swap(i, p);\n i = p;\n }\n return;\n }\n if (score >= s[0]) return;\n s[0] = score;\n it[0] = item;\n let i = 0;\n for (;;) {\n const l = 2 * i + 1;\n const r = l + 1;\n let m = i;\n if (l < s.length && s[l] > s[m]) m = l;\n if (r < s.length && s[r] > s[m]) m = r;\n if (m === i) break;\n this.#swap(i, m);\n i = m;\n }\n }\n\n /** Ascending by score. */\n sorted(): { score: number; item: T }[] {\n return this.#scores\n .map((score, i) => ({ score, item: this.#items[i] }))\n .sort((a, b) => a.score - b.score);\n }\n\n #swap(i: number, j: number) {\n const s = this.#scores;\n const it = this.#items;\n [s[i], s[j]] = [s[j], s[i]];\n [it[i], it[j]] = [it[j], it[i]];\n }\n}\n","import { distance, normalize } from \"./math.js\";\nimport type { Metric } from \"./types.js\";\n\nexport interface KMeansOptions {\n iterations?: number;\n /** Training points drawn from the data. Default min(n, 32 * k, 25_000). */\n sampleSize?: number;\n seed?: number;\n}\n\n/** Small deterministic PRNG so segment builds are reproducible. */\nexport function mulberry32(seed: number) {\n let a = seed >>> 0;\n return () => {\n a = (a + 0x6d2b79f5) >>> 0;\n let t = a;\n t = Math.imul(t ^ (t >>> 15), t | 1);\n t ^= t + Math.imul(t ^ (t >>> 7), t | 61);\n return ((t ^ (t >>> 14)) >>> 0) / 4294967296;\n };\n}\n\n/** Index of the closest centroid. */\nexport function nearest(\n metric: Metric,\n data: Float32Array,\n offset: number,\n centroids: Float32Array,\n k: number,\n d: number,\n): number {\n let best = 0;\n let bestD = Number.POSITIVE_INFINITY;\n // Centroids are compared with l2 for l2, and with dot otherwise (spherical k-means).\n const m: Metric = metric === \"l2\" ? \"l2\" : \"dot\";\n for (let c = 0; c < k; c++) {\n const dist = distance(m, data, offset, centroids, c * d, d);\n if (dist < bestD) {\n bestD = dist;\n best = c;\n }\n }\n return best;\n}\n\n/**\n * k-means++ seeding plus Lloyd iterations on a sample. `data` is n × d, flat.\n * For cosine and dot, centroids are re-normalized (spherical k-means).\n */\nexport function kmeans(\n data: Float32Array,\n n: number,\n d: number,\n k: number,\n metric: Metric,\n opts: KMeansOptions = {},\n): Float32Array {\n const rand = mulberry32(opts.seed ?? 42);\n k = Math.max(1, Math.min(k, n));\n const sampleSize = Math.min(n, opts.sampleSize ?? Math.min(32 * k, 25_000));\n\n // Reservoir-free sample: a partial Fisher–Yates over indices.\n const idx = new Uint32Array(n);\n for (let i = 0; i < n; i++) idx[i] = i;\n for (let i = 0; i < sampleSize; i++) {\n const j = i + Math.floor(rand() * (n - i));\n [idx[i], idx[j]] = [idx[j], idx[i]];\n }\n const sample = new Float32Array(sampleSize * d);\n for (let i = 0; i < sampleSize; i++) sample.set(data.subarray(idx[i] * d, idx[i] * d + d), i * d);\n\n const spherical = metric !== \"l2\";\n const centroids = new Float32Array(k * d);\n\n // k-means++ with squared l2 on the sample.\n centroids.set(sample.subarray(0, d), 0);\n const minD = new Float64Array(sampleSize).fill(Number.POSITIVE_INFINITY);\n for (let c = 1; c < k; c++) {\n let total = 0;\n for (let i = 0; i < sampleSize; i++) {\n const dd = distance(\"l2\", sample, i * d, centroids, (c - 1) * d, d);\n if (dd < minD[i]) minD[i] = dd;\n total += minD[i];\n }\n let r = rand() * total;\n let pick = sampleSize - 1;\n for (let i = 0; i < sampleSize; i++) {\n r -= minD[i];\n if (r <= 0) {\n pick = i;\n break;\n }\n }\n centroids.set(sample.subarray(pick * d, pick * d + d), c * d);\n }\n\n const assign = new Uint32Array(sampleSize);\n const counts = new Uint32Array(k);\n const iterations = opts.iterations ?? 10;\n for (let it = 0; it < iterations; it++) {\n let moved = 0;\n for (let i = 0; i < sampleSize; i++) {\n const c = nearest(metric, sample, i * d, centroids, k, d);\n if (c !== assign[i] || it === 0) moved++;\n assign[i] = c;\n }\n const sums = new Float64Array(k * d);\n counts.fill(0);\n for (let i = 0; i < sampleSize; i++) {\n const c = assign[i];\n counts[c]++;\n for (let j = 0; j < d; j++) sums[c * d + j] += sample[i * d + j];\n }\n for (let c = 0; c < k; c++) {\n if (counts[c] === 0) {\n // Re-seed an empty cluster with a random sample point.\n const p = Math.floor(rand() * sampleSize);\n centroids.set(sample.subarray(p * d, p * d + d), c * d);\n continue;\n }\n for (let j = 0; j < d; j++) centroids[c * d + j] = sums[c * d + j] / counts[c];\n }\n if (spherical) {\n for (let c = 0; c < k; c++) {\n centroids.set(normalize(centroids.subarray(c * d, c * d + d)), c * d);\n }\n }\n if (it > 0 && moved === 0) break;\n }\n return centroids;\n}\n","import { kmeans, nearest } from \"./kmeans.js\";\nimport {\n distance,\n distanceInt8,\n hamming,\n quantizeInt8,\n residualBits,\n TopK,\n wordsFor,\n} from \"./math.js\";\nimport type { Metric } from \"./types.js\";\n\n/**\n * An IVF segment as storage-neutral parts. This module does no I/O; a store\n * decides where the parts live.\n *\n * per list: a centroid f32[dims] and a row count\n * per list, the searchable block (little-endian, each section padded to 8 bytes):\n * ids f64[count] | bits u32[count × words] | rnorm f32[count] | cdot f32[count]\n * scales f32[count] | codes i8[count × dims]\n * per list, the float block f32[count × dims] (exact re-rank, lossless merge, read-back)\n *\n * bits = signs of the residual r = x - c (c = the list centroid)\n * rnorm = |r|, cdot = c·r. With them the 1-bit stage estimates the real\n * metric, RaBitQ-style: r_q·r ≈ |r_q| |r| cos(π · hamming / dims).\n */\nconst align8 = (n: number) => (n + 7) & ~7;\n\nexport interface ListLayout {\n count: number;\n idsAt: number;\n bitsAt: number;\n rnormAt: number;\n cdotAt: number;\n scalesAt: number;\n codesAt: number;\n /** Bytes of the searchable block. */\n length: number;\n}\n\nexport function listLayout(count: number, dims: number): ListLayout {\n const w = wordsFor(dims);\n const idsAt = 0;\n const bitsAt = align8(idsAt + 8 * count);\n const rnormAt = align8(bitsAt + 4 * w * count);\n const cdotAt = align8(rnormAt + 4 * count);\n const scalesAt = align8(cdotAt + 4 * count);\n const codesAt = align8(scalesAt + 4 * count);\n const length = align8(codesAt + dims * count);\n return { count, idsAt, bitsAt, rnormAt, cdotAt, scalesAt, codesAt, length };\n}\n\n// ------------------------------------------------------------------ build\n\nexport interface BuildInput {\n dims: number;\n metric: Metric;\n ids: Float64Array;\n /** n × dims, already prepared (normalized for cosine). */\n vectors: Float32Array;\n nlist?: number;\n seed?: number;\n}\n\nexport interface BuiltSegment {\n nlist: number;\n counts: Uint32Array;\n /** nlist × dims */\n centroids: Float32Array;\n /** Searchable block per list. */\n lists: Uint8Array[];\n /** Float32 block per list. */\n floats: Uint8Array[];\n}\n\n/** Below this size a segment is a single flat list: training would not pay off. */\nexport const MIN_TRAIN = 2048;\n\nexport function defaultNlist(n: number) {\n if (n < MIN_TRAIN) return 1;\n return Math.max(1, Math.min(1024, Math.round(Math.sqrt(n))));\n}\n\nexport function buildSegment(input: BuildInput): BuiltSegment {\n const { dims: d, metric, ids, vectors } = input;\n const n = ids.length;\n const nlist = Math.max(1, Math.min(input.nlist ?? defaultNlist(n), Math.max(1, n)));\n\n let centroids: Float32Array;\n if (nlist === 1) {\n centroids = new Float32Array(d);\n for (let i = 0; i < n; i++) for (let j = 0; j < d; j++) centroids[j] += vectors[i * d + j];\n if (n > 0) for (let j = 0; j < d; j++) centroids[j] /= n;\n } else {\n centroids = kmeans(vectors, n, d, nlist, metric, { seed: input.seed });\n }\n\n const assign = new Uint32Array(n);\n const counts = new Uint32Array(nlist);\n for (let i = 0; i < n; i++) {\n const c = nlist === 1 ? 0 : nearest(metric, vectors, i * d, centroids, nlist, d);\n assign[i] = c;\n counts[c]++;\n }\n\n const w = wordsFor(d);\n const layouts = Array.from(counts, (count) => listLayout(count, d));\n const lists = layouts.map((l) => new Uint8Array(l.length));\n const floats = Array.from(counts, (count) => new Uint8Array(4 * count * d));\n const views = layouts.map((l, c) => {\n const buf = lists[c].buffer;\n return {\n ids: new Float64Array(buf, l.idsAt, l.count),\n bits: new Uint32Array(buf, l.bitsAt, l.count * w),\n rnorm: new Float32Array(buf, l.rnormAt, l.count),\n cdot: new Float32Array(buf, l.cdotAt, l.count),\n scales: new Float32Array(buf, l.scalesAt, l.count),\n codes: new Int8Array(buf, l.codesAt, l.count * d),\n floats: new Float32Array(floats[c].buffer, 0, l.count * d),\n };\n });\n\n const fill = new Uint32Array(nlist);\n for (let i = 0; i < n; i++) {\n const c = assign[i];\n const j = fill[c]++;\n const v = views[c];\n v.ids[j] = ids[i];\n residualBits(vectors, i * d, centroids, c * d, d, v.bits, j * w);\n const [rn, cd] = residualStats(vectors, i * d, centroids, c * d, d);\n v.rnorm[j] = rn;\n v.cdot[j] = cd;\n v.scales[j] = quantizeInt8(vectors, i * d, d, v.codes, j * d);\n v.floats.set(vectors.subarray(i * d, i * d + d), j * d);\n }\n return { nlist, counts, centroids, lists, floats };\n}\n\n/** [|x - c|, c·(x - c)] */\nfunction residualStats(x: Float32Array, xo: number, c: Float32Array, co: number, d: number) {\n let nn = 0;\n let cd = 0;\n for (let i = 0; i < d; i++) {\n const r = x[xo + i] - c[co + i];\n nn += r * r;\n cd += c[co + i] * r;\n }\n return [Math.sqrt(nn), cd];\n}\n\n// ------------------------------------------------------------------ read\n\nexport interface ListData {\n ids: Float64Array;\n bits: Uint32Array;\n rnorm: Float32Array;\n cdot: Float32Array;\n scales: Float32Array;\n codes: Int8Array;\n}\n\n/** Typed views over a searchable block (copied only when it does not start at offset 0). */\nexport function parseList(bytes: Uint8Array, count: number, dims: number): ListData {\n const l = listLayout(count, dims);\n if (bytes.byteLength !== l.length) {\n throw new Error(`vector-index: list block has ${bytes.byteLength} bytes, expected ${l.length}`);\n }\n const buf = bytes.byteOffset === 0 ? bytes.buffer : bytes.slice().buffer;\n const w = wordsFor(dims);\n return {\n ids: new Float64Array(buf, l.idsAt, count),\n bits: new Uint32Array(buf, l.bitsAt, count * w),\n rnorm: new Float32Array(buf, l.rnormAt, count),\n cdot: new Float32Array(buf, l.cdotAt, count),\n scales: new Float32Array(buf, l.scalesAt, count),\n codes: new Int8Array(buf, l.codesAt, count * dims),\n };\n}\n\nexport interface Candidate {\n list: number;\n row: number;\n id: number;\n}\n\n/** The in-memory part of a segment: centroids and list sizes. List blocks are fetched by the caller. */\nexport class SegmentIndex {\n constructor(\n readonly gen: number,\n readonly dims: number,\n readonly metric: Metric,\n readonly centroids: Float32Array,\n readonly counts: Uint32Array,\n ) {}\n\n get nlist() {\n return this.counts.length;\n }\n\n /** The `nprobe` non-empty lists whose centroids are closest to the query. */\n probe(query: Float32Array, nprobe: number): number[] {\n const m: Metric = this.metric === \"l2\" ? \"l2\" : \"dot\";\n const top = new TopK<number>(Math.min(nprobe, this.nlist));\n for (let c = 0; c < this.nlist; c++) {\n if (this.counts[c] === 0) continue;\n top.push(distance(m, query, 0, this.centroids, c * this.dims, this.dims), c);\n }\n return top.sorted().map((e) => e.item);\n }\n\n /**\n * Stage 1: the `limit` rows of a list with the best estimated distance, from\n * residual sign bits plus the stored residual norm and centroid projection.\n */\n filterList(\n query: Float32Array,\n c: number,\n data: ListData,\n limit: number,\n keep?: (id: number) => boolean,\n ): Candidate[] {\n const d = this.dims;\n const w = wordsFor(d);\n const co = c * d;\n const qb = new Uint32Array(w);\n residualBits(query, 0, this.centroids, co, d, qb, 0);\n const [qn, qcd] = residualStats(query, 0, this.centroids, co, d);\n let cc = 0;\n for (let i = 0; i < d; i++) cc += this.centroids[co + i] * this.centroids[co + i];\n const qc = cc + qcd; // q·c\n const angle = Math.PI / d;\n const l2 = this.metric === \"l2\";\n const top = new TopK<Candidate>(limit);\n for (let r = 0; r < data.ids.length; r++) {\n const id = data.ids[r];\n if (keep && !keep(id)) continue;\n const rr = qn * data.rnorm[r] * Math.cos(angle * hamming(qb, data.bits, r * w, w));\n // q·x = q·c + c·r_x + r_q·r_x ; |q-x|² = |r_q|² + |r_x|² - 2 r_q·r_x\n const est = l2 ? qn * qn + data.rnorm[r] * data.rnorm[r] - 2 * rr : -(qc + data.cdot[r] + rr);\n if (est < top.bound) top.push(est, { list: c, row: r, id });\n }\n return top.sorted().map((e) => e.item);\n }\n\n /** Stage 2: approximate distance from the int8 codes. */\n scoreInt8(query: Float32Array, data: ListData, row: number): number {\n return distanceInt8(\n this.metric,\n query,\n data.codes,\n row * this.dims,\n data.scales[row],\n this.dims,\n );\n }\n}\n","export type Metric = \"cosine\" | \"dot\" | \"l2\";\n\nexport interface SearchHit {\n id: number;\n /** Lower is closer: 1 - cos for cosine, -dot for dot, squared L2 for l2. */\n distance: number;\n}\n\nexport interface SearchOptions {\n k?: number;\n /** IVF lists probed per segment. Default 8. */\n nprobe?: number;\n /** Candidates kept per probed list by the 1-bit filter = k * oversample. Default 8. */\n oversample?: number;\n /** Re-rank the int8 winners with the stored float32 vectors. Default false. */\n exact?: boolean;\n /** Keep only ids for which this returns true (applied before re-ranking). */\n filter?: (id: number) => boolean;\n signal?: AbortSignal;\n}\n\n/** An aligned Float32Array copy of BLOB bytes (views over arbitrary offsets are unsafe). */\nexport function toFloat32(bytes: Uint8Array): Float32Array {\n const copy = bytes.slice();\n return new Float32Array(copy.buffer, 0, copy.byteLength >> 2);\n}\n\nexport function float32Bytes(v: Float32Array): Uint8Array {\n return new Uint8Array(v.buffer, v.byteOffset, v.byteLength).slice();\n}\n","import type { Db } from \"@statewalker/db-api\";\nimport { type BuiltSegment, type ListData, parseList, SegmentIndex } from \"./segment.js\";\nimport { float32Bytes, type Metric, toFloat32 } from \"./types.js\";\n\n/**\n * Largest BLOB written in one row. Durable Object SQLite rejects values over\n * ~2 MB (\"string or blob too big\"); 1 MiB leaves headroom.\n */\nexport const PART_BYTES = 1024 * 1024;\n\nexport interface SegmentRef {\n gen: number;\n count: number;\n nlist: number;\n}\n\n/**\n * Segment rows: one centroid row per list, and each list's searchable and\n * float32 blocks split into parts. Reads go through an LRU cache: a\n * generation is immutable, so cached blocks never go stale.\n */\nexport class SqlSegmentStore {\n readonly #db: Db;\n readonly #dims: number;\n readonly #t: { centroids: string; seg: string; f32: string };\n readonly #cache: Lru<ListData | Float32Array>;\n\n constructor(db: Db, prefix: string, dims: number, cacheBytes = 64 * 1024 * 1024) {\n this.#db = db;\n this.#dims = dims;\n this.#t = { centroids: `${prefix}centroids`, seg: `${prefix}seg`, f32: `${prefix}f32` };\n this.#cache = new Lru(cacheBytes);\n }\n\n schema(): string[] {\n const { centroids, seg, f32 } = this.#t;\n return [\n `CREATE TABLE IF NOT EXISTS ${centroids}(gen INTEGER, list INTEGER, count INTEGER NOT NULL,\n centroid BLOB NOT NULL, PRIMARY KEY (gen, list)) WITHOUT ROWID`,\n `CREATE TABLE IF NOT EXISTS ${seg}(gen INTEGER, list INTEGER, part INTEGER,\n bytes BLOB NOT NULL, PRIMARY KEY (gen, list, part)) WITHOUT ROWID`,\n `CREATE TABLE IF NOT EXISTS ${f32}(gen INTEGER, list INTEGER, part INTEGER,\n bytes BLOB NOT NULL, PRIMARY KEY (gen, list, part)) WITHOUT ROWID`,\n ];\n }\n\n /** Writes every row of a built segment. Call inside `inTransaction`. */\n async write(tx: Db, gen: number, built: BuiltSegment): Promise<void> {\n const d = this.#dims;\n for (let c = 0; c < built.nlist; c++) {\n await tx.query(\n `INSERT INTO ${this.#t.centroids}(gen, list, count, centroid) VALUES (?, ?, ?, ?)`,\n [gen, c, built.counts[c], float32Bytes(built.centroids.subarray(c * d, (c + 1) * d))],\n );\n await writeParts(tx, this.#t.seg, gen, c, built.lists[c] as Uint8Array);\n await writeParts(tx, this.#t.f32, gen, c, built.floats[c] as Uint8Array);\n }\n }\n\n /** Loads the in-memory part (centroids, list sizes) of a committed segment. */\n async open(ref: SegmentRef, metric: Metric): Promise<SegmentIndex> {\n const d = this.#dims;\n const rows = await this.#db.query<{ list: number; count: number; centroid: Uint8Array }>(\n `SELECT list, count, centroid FROM ${this.#t.centroids} WHERE gen = ? ORDER BY list`,\n [ref.gen],\n );\n if (rows.length !== ref.nlist) {\n throw new Error(\n `vector-index: segment ${ref.gen} has ${rows.length} lists, expected ${ref.nlist}`,\n );\n }\n const centroids = new Float32Array(ref.nlist * d);\n const counts = new Uint32Array(ref.nlist);\n for (const r of rows) {\n const c = Number(r.list);\n centroids.set(toFloat32(r.centroid), c * d);\n counts[c] = Number(r.count);\n }\n return new SegmentIndex(ref.gen, d, metric, centroids, counts);\n }\n\n /** Searchable blocks of lists `cs`: cached ones from memory, the rest in one query. */\n async lists(seg: SegmentIndex, cs: number[]): Promise<ListData[]> {\n const out = new Map<number, ListData>();\n const missing: number[] = [];\n for (const c of cs) {\n const hit = this.#cache.get(`s:${seg.gen}:${c}`) as ListData | undefined;\n if (hit) out.set(c, hit);\n else missing.push(c);\n }\n if (missing.length > 0) {\n const blocks = await readParts(this.#db, this.#t.seg, seg.gen, missing);\n for (const c of missing) {\n const bytes = blocks.get(c) ?? new Uint8Array(0);\n const data = parseList(bytes, seg.counts[c] as number, this.#dims);\n this.#cache.set(`s:${seg.gen}:${c}`, data, bytes.byteLength);\n out.set(c, data);\n }\n }\n return cs.map((c) => out.get(c) as ListData);\n }\n\n /** Every float32 vector of list `c` (count × dims). */\n async floats(seg: SegmentIndex, c: number): Promise<Float32Array> {\n const key = `f:${seg.gen}:${c}`;\n const hit = this.#cache.get(key) as Float32Array | undefined;\n if (hit) return hit;\n const blocks = await readParts(this.#db, this.#t.f32, seg.gen, [c]);\n const floats = toFloat32(blocks.get(c) ?? new Uint8Array(0));\n this.#cache.set(key, floats, floats.byteLength);\n return floats;\n }\n\n /** Deletes the rows of `gens`. Call inside `inTransaction`. */\n async drop(tx: Db, gens: number[]): Promise<void> {\n const json = JSON.stringify(gens);\n for (const table of Object.values(this.#t)) {\n await tx.query(`DELETE FROM ${table} WHERE gen IN (SELECT value FROM json_each(?))`, [json]);\n }\n for (const gen of gens) this.#cache.deletePrefix(`s:${gen}:`, `f:${gen}:`);\n }\n\n /** Deletes rows of every generation not in `live` (left by a crash before a reap). */\n async sweep(tx: Db, live: number[]): Promise<void> {\n const json = JSON.stringify(live);\n for (const table of Object.values(this.#t)) {\n await tx.query(`DELETE FROM ${table} WHERE gen NOT IN (SELECT value FROM json_each(?))`, [\n json,\n ]);\n }\n }\n}\n\nasync function writeParts(tx: Db, table: string, gen: number, list: number, bytes: Uint8Array) {\n for (let part = 0, at = 0; at < bytes.byteLength; part++, at += PART_BYTES) {\n await tx.query(`INSERT INTO ${table}(gen, list, part, bytes) VALUES (?, ?, ?, ?)`, [\n gen,\n list,\n part,\n bytes.slice(at, at + PART_BYTES),\n ]);\n }\n}\n\n/** The joined parts of each list in `lists`, as fresh arrays starting at offset 0. */\nasync function readParts(\n db: Db,\n table: string,\n gen: number,\n lists: number[],\n): Promise<Map<number, Uint8Array>> {\n const rows = await db.query<{ list: number; bytes: Uint8Array }>(\n `SELECT list, bytes FROM ${table}\n WHERE gen = ? AND list IN (SELECT value FROM json_each(?)) ORDER BY list, part`,\n [gen, JSON.stringify(lists)],\n );\n const parts = new Map<number, Uint8Array[]>();\n for (const r of rows) {\n const list = Number(r.list);\n const acc = parts.get(list) ?? [];\n acc.push(r.bytes);\n parts.set(list, acc);\n }\n const out = new Map<number, Uint8Array>();\n for (const [list, ps] of parts) {\n const joined = new Uint8Array(ps.reduce((n, p) => n + p.byteLength, 0));\n let at = 0;\n for (const p of ps) {\n joined.set(p, at);\n at += p.byteLength;\n }\n out.set(list, joined);\n }\n return out;\n}\n\n/** Byte-budgeted LRU; Map order is LRU order (re-inserted on every hit). */\nclass Lru<V> {\n readonly #max: number;\n readonly #map = new Map<string, { value: V; size: number }>();\n #bytes = 0;\n\n constructor(maxBytes: number) {\n this.#max = maxBytes;\n }\n\n get(key: string): V | undefined {\n const e = this.#map.get(key);\n if (!e) return undefined;\n this.#map.delete(key);\n this.#map.set(key, e);\n return e.value;\n }\n\n set(key: string, value: V, size: number) {\n const old = this.#map.get(key);\n if (old) {\n this.#map.delete(key);\n this.#bytes -= old.size;\n }\n this.#map.set(key, { value, size });\n this.#bytes += size;\n for (const [k, e] of this.#map) {\n if (this.#bytes <= this.#max) break;\n this.#map.delete(k);\n this.#bytes -= e.size;\n }\n }\n\n deletePrefix(...prefixes: string[]) {\n for (const [k, e] of this.#map) {\n if (prefixes.some((p) => k.startsWith(p))) {\n this.#map.delete(k);\n this.#bytes -= e.size;\n }\n }\n }\n}\n","import type { Db } from \"@statewalker/db-api\";\nimport { inTransaction } from \"@statewalker/db-sqlite\";\nimport { distance, prepare, TopK } from \"./math.js\";\nimport {\n type BuiltSegment,\n buildSegment,\n type Candidate,\n type ListData,\n SegmentIndex,\n} from \"./segment.js\";\nimport { type SegmentRef, SqlSegmentStore } from \"./sql-segment-store.js\";\nimport {\n float32Bytes,\n type Metric,\n type SearchHit,\n type SearchOptions,\n toFloat32,\n} from \"./types.js\";\n\nexport interface VectorIndexOptions {\n db: Db;\n /** Table name prefix, e.g. \"vec_\". Letters, digits and underscores. */\n prefix: string;\n dims: number;\n metric?: Metric;\n /** IVF lists for a new segment of n vectors. Default ~sqrt(n), flat below 2048. */\n nlist?: (n: number) => number;\n /** Cache budget for list blocks read from SQLite, in bytes. Default 64 MiB. */\n cacheBytes?: number;\n /**\n * upsert() seals the tail into a segment once it holds this many vectors.\n * Default 4096: compacting a larger tail risks the 15 s operation deadline of\n * a Durable Object on celld. Infinity turns it off.\n */\n autoCompactAt?: number;\n}\n\nexport interface VectorItem {\n /** A safe integer: typically the rowid of your documents table. */\n id: number;\n vector: ArrayLike<number>;\n}\n\nexport interface VectorIndexStats {\n tail: number;\n segments: SegmentRef[];\n seq: number;\n}\n\ninterface State {\n seq: number;\n nextGen: number;\n segments: SegmentRef[];\n}\n\ninterface TailEntry {\n seq: number;\n vector: Float32Array;\n}\n\n/** Ids per lookup (bound as one JSON parameter). */\nconst VALIDATE_BATCH = 2000;\n/** Upserted rows per transaction. */\nconst WRITE_BATCH = 200;\n\n/**\n * An LSM-style vector index over a `Db`.\n *\n * - The mutable tail lives in `{p}tail`, mirrored in memory and searched exactly.\n * - `compact()` seals the tail into an immutable IVF segment (1-bit residual\n * filter → int8 re-rank → float32 re-rank on `exact`), written as rows in the\n * same transaction that moves the ids out of the tail.\n * - `{p}ids(id, gen)` says which generation holds the live copy of each id\n * (0 = tail). A segment hit counts only if its generation matches, so deletes\n * and overwrites never touch segment rows. `merge()` rewrites all segments\n * into one, dropping dead rows.\n *\n * One writer per database is assumed (a Durable Object, a worker, one tab);\n * within an instance, writes are serialized.\n */\nexport class VectorIndex {\n readonly dims: number;\n readonly metric: Metric;\n /** `{prefix}ids`: its `id` column holds exactly the live ids. Callers may join it in SQL. */\n readonly idTable: string;\n readonly #db: Db;\n readonly #store: SqlSegmentStore;\n readonly #nlist?: (n: number) => number;\n readonly #autoCompactAt: number;\n readonly #t: { meta: string; ids: string; tail: string };\n\n #state: State = { seq: 0, nextGen: 1, segments: [] };\n #tail = new Map<number, TailEntry>();\n #segments: SegmentIndex[] = [];\n #refs = new Map<SegmentIndex, number>();\n #retired: SegmentIndex[] = [];\n #queue: Promise<unknown> = Promise.resolve();\n #maintaining = false;\n #ready = false;\n /** Bumped before and after each commit that changes the segment list: odd while one runs. */\n #epoch = 0;\n\n constructor(opts: VectorIndexOptions) {\n if (!/^[A-Za-z_][A-Za-z0-9_]*$/.test(opts.prefix)) {\n throw new Error(`vector-index: bad prefix ${opts.prefix}`);\n }\n if (!Number.isInteger(opts.dims) || opts.dims < 1) {\n throw new Error(\"vector-index: dims must be a positive integer\");\n }\n this.dims = opts.dims;\n this.metric = opts.metric ?? \"cosine\";\n this.#db = opts.db;\n this.#store = new SqlSegmentStore(opts.db, opts.prefix, opts.dims, opts.cacheBytes);\n this.#nlist = opts.nlist;\n this.#autoCompactAt = opts.autoCompactAt ?? 4096;\n const p = opts.prefix;\n this.#t = { meta: `${p}meta`, ids: `${p}ids`, tail: `${p}tail` };\n this.idTable = this.#t.ids;\n }\n\n // ------------------------------------------------------------ lifecycle\n\n /** Creates tables if missing, loads state and sweeps rows of crashed maintenance. */\n async init(): Promise<void> {\n const { meta, ids, tail } = this.#t;\n for (const s of [\n `CREATE TABLE IF NOT EXISTS ${meta}(k TEXT PRIMARY KEY, v TEXT NOT NULL)`,\n `CREATE TABLE IF NOT EXISTS ${ids}(id INTEGER PRIMARY KEY, gen INTEGER NOT NULL)`,\n `CREATE INDEX IF NOT EXISTS ${ids}_gen ON ${ids}(gen)`,\n `CREATE TABLE IF NOT EXISTS ${tail}(id INTEGER PRIMARY KEY, seq INTEGER NOT NULL, vec BLOB NOT NULL)`,\n `CREATE INDEX IF NOT EXISTS ${tail}_seq ON ${tail}(seq)`,\n ...this.#store.schema(),\n ]) {\n await this.#db.exec(s);\n }\n\n const config = JSON.stringify({ dims: this.dims, metric: this.metric });\n await this.#db.query(\n `INSERT INTO ${meta}(k, v) VALUES ('config', ?) ON CONFLICT(k) DO NOTHING`,\n [config],\n );\n const [stored] = await this.#db.query<{ v: string }>(\n `SELECT v FROM ${meta} WHERE k = 'config'`,\n );\n if (stored?.v !== config) {\n throw new Error(`vector-index: tables were created with ${stored?.v}, not ${config}`);\n }\n await this.refresh();\n const live = this.#state.segments.map((s) => s.gen);\n await inTransaction(this.#db, (tx) => this.#store.sweep(tx, live));\n this.#ready = true;\n }\n\n /** Reloads state, tail and segments from storage (e.g. after another writer changed them). */\n async refresh(): Promise<void> {\n const [row] = await this.#db.query<{ v: string }>(\n `SELECT v FROM ${this.#t.meta} WHERE k = 'state'`,\n );\n const state: State = row ? JSON.parse(row.v) : { seq: 0, nextGen: 1, segments: [] };\n\n const tail = new Map<number, TailEntry>();\n const rows = await this.#db.query<{ id: number; seq: number; vec: Uint8Array }>(\n `SELECT id, seq, vec FROM ${this.#t.tail}`,\n );\n for (const r of rows) tail.set(Number(r.id), { seq: Number(r.seq), vector: toFloat32(r.vec) });\n\n const known = new Map(this.#segments.map((s) => [s.gen, s]));\n const segments = await Promise.all(\n state.segments.map((s) => known.get(s.gen) ?? this.#store.open(s, this.metric)),\n );\n this.#state = state;\n this.#tail = tail;\n this.#segments = segments;\n }\n\n get stats(): VectorIndexStats {\n return {\n tail: this.#tail.size,\n segments: this.#state.segments.map((s) => ({ ...s })),\n seq: this.#state.seq,\n };\n }\n\n // ------------------------------------------------------------ writes\n\n async upsert(items: VectorItem[]): Promise<void> {\n this.#assertReady();\n const prepared = items.map((it) => {\n assertId(it.id);\n return { id: it.id, vector: prepare(it.vector, this.dims, this.metric) };\n });\n const { tail, ids } = this.#t;\n for (let i = 0; i < prepared.length; i += WRITE_BATCH) {\n const batch = prepared.slice(i, i + WRITE_BATCH);\n await this.#exclusive(async () => {\n const seq = this.#state.seq + 1;\n const next = { ...this.#state, seq };\n await inTransaction(this.#db, async (tx) => {\n for (const { id, vector } of batch) {\n await tx.query(\n `INSERT INTO ${tail}(id, seq, vec) VALUES (?, ?, ?)\n ON CONFLICT(id) DO UPDATE SET seq = excluded.seq, vec = excluded.vec`,\n [id, seq, float32Bytes(vector)],\n );\n await tx.query(\n `INSERT INTO ${ids}(id, gen) VALUES (?, 0) ON CONFLICT(id) DO UPDATE SET gen = 0`,\n [id],\n );\n }\n await this.#saveState(tx, next);\n });\n this.#state = next;\n for (const { id, vector } of batch) this.#tail.set(id, { seq, vector });\n });\n if (this.#tail.size >= this.#autoCompactAt && !this.#maintaining) await this.compact();\n }\n }\n\n async delete(ids: number[]): Promise<void> {\n this.#assertReady();\n ids.forEach(assertId);\n await this.#exclusive(async () => {\n for (let i = 0; i < ids.length; i += VALIDATE_BATCH) {\n const chunk = ids.slice(i, i + VALIDATE_BATCH);\n const json = JSON.stringify(chunk);\n await inTransaction(this.#db, async (tx) => {\n await tx.query(\n `DELETE FROM ${this.#t.tail} WHERE id IN (SELECT value FROM json_each(?))`,\n [json],\n );\n await tx.query(\n `DELETE FROM ${this.#t.ids} WHERE id IN (SELECT value FROM json_each(?))`,\n [json],\n );\n });\n for (const id of chunk) this.#tail.delete(id);\n }\n });\n }\n\n // ------------------------------------------------------------ search\n\n async search(query: ArrayLike<number>, opts: SearchOptions = {}): Promise<SearchHit[]> {\n this.#assertReady();\n const k = opts.k ?? 10;\n const nprobe = opts.nprobe ?? 8;\n const perList = k * (opts.oversample ?? 8);\n const q = prepare(query, this.dims, this.metric);\n const d = this.dims;\n const filter = opts.filter;\n\n return this.#read(async (segments) => {\n // Tail: exact, from memory.\n const tailTop = new TopK<number>(k);\n for (const [id, { vector }] of this.#tail) {\n if (filter && !filter(id)) continue;\n tailTop.push(distance(this.metric, q, 0, vector, 0, d), id);\n }\n\n // Stage 1: probe lists, keep the best rows of each by estimated residual distance.\n type Hit = Candidate & { seg: SegmentIndex; data: ListData };\n const hits: Hit[] = [];\n // Tail ids are never live in a segment; skip them early.\n const keep = (id: number) => !this.#tail.has(id) && (!filter || filter(id));\n await Promise.all(\n segments.map(async (seg) => {\n const lists = seg.probe(q, nprobe);\n const datas = await this.#store.lists(seg, lists);\n opts.signal?.throwIfAborted();\n lists.forEach((c, i) => {\n const data = datas[i] as ListData;\n for (const cand of seg.filterList(q, c, data, perList, keep))\n hits.push({ ...cand, seg, data });\n });\n }),\n );\n\n // Liveness: a segment row counts only if its generation holds the live copy.\n const live = await this.#generations(hits.map((h) => h.id));\n\n // Stage 2: int8 re-rank.\n const rerank = opts.exact ? k * 4 : k;\n const segTop = new TopK<Hit>(rerank);\n for (const h of hits) {\n if (live.get(h.id) !== h.seg.gen) continue;\n segTop.push(h.seg.scoreInt8(q, h.data, h.row), h);\n }\n let segResults = segTop\n .sorted()\n .map((e) => ({ id: e.item.id, distance: e.score, hit: e.item }));\n\n // Stage 3: exact re-rank from stored floats.\n if (opts.exact) {\n segResults = await Promise.all(\n segResults.map(async (r) => {\n const all = await this.#store.floats(r.hit.seg, r.hit.list);\n const v = all.subarray(r.hit.row * d, (r.hit.row + 1) * d);\n return { ...r, distance: distance(this.metric, q, 0, v, 0, d) };\n }),\n );\n }\n\n const final = new TopK<number>(k);\n for (const r of segResults) final.push(r.distance, r.id);\n for (const e of tailTop.sorted()) final.push(e.score, e.item);\n return final.sorted().map((e) => ({ id: e.item, distance: e.score }));\n });\n }\n\n /** The stored vectors of the live `ids` (normalised for cosine); unknown or deleted ids are absent. */\n async getVectors(ids: number[]): Promise<Map<number, Float32Array>> {\n this.#assertReady();\n ids.forEach(assertId);\n return this.#read(async (segments) => {\n const out = new Map<number, Float32Array>();\n const gens = await this.#generations(ids);\n const wanted = new Map<number, Set<number>>(); // gen -> ids\n for (const [id, gen] of gens) {\n if (gen === 0) {\n const entry = this.#tail.get(id);\n if (entry) out.set(id, entry.vector.slice());\n continue;\n }\n const set = wanted.get(gen) ?? new Set<number>();\n set.add(id);\n wanted.set(gen, set);\n }\n for (const seg of segments) {\n const set = wanted.get(seg.gen);\n if (!set) continue;\n for (let c = 0; c < seg.nlist && set.size > 0; c++) {\n if (seg.counts[c] === 0) continue;\n const [data] = (await this.#store.lists(seg, [c])) as [ListData];\n let floats: Float32Array | null = null;\n for (let r = 0; r < data.ids.length; r++) {\n const id = data.ids[r] as number;\n if (!set.has(id)) continue;\n floats ??= await this.#store.floats(seg, c);\n out.set(id, floats.slice(r * this.dims, (r + 1) * this.dims));\n set.delete(id);\n }\n }\n }\n return out;\n });\n }\n\n // ------------------------------------------------------------ maintenance\n\n /** Seals the current tail into a new segment. Returns the number of vectors sealed. */\n async compact(): Promise<number> {\n this.#assertReady();\n return this.#maintenance(async () => {\n const snapshot = await this.#exclusive(async () => ({\n maxSeq: this.#state.seq,\n entries: [...this.#tail.entries()],\n }));\n if (snapshot.entries.length === 0) return 0;\n\n const n = snapshot.entries.length;\n const ids = new Float64Array(n);\n const vectors = new Float32Array(n * this.dims);\n snapshot.entries.forEach(([id, e], i) => {\n ids[i] = id;\n vectors.set(e.vector, i * this.dims);\n });\n const built = this.#build(ids, vectors);\n\n await this.#exclusive(() =>\n this.#swapSegments(async () => {\n const ref = this.#refOf(built, n);\n const next: State = {\n ...this.#state,\n nextGen: ref.gen + 1,\n segments: [...this.#state.segments, ref],\n };\n const { ids: idsT, tail } = this.#t;\n await inTransaction(this.#db, async (tx) => {\n await this.#store.write(tx, ref.gen, built);\n await tx.query(\n `UPDATE ${idsT} SET gen = ? WHERE gen = 0\n AND id IN (SELECT id FROM ${tail} WHERE seq <= ?)`,\n [ref.gen, snapshot.maxSeq],\n );\n await tx.query(`DELETE FROM ${tail} WHERE seq <= ?`, [snapshot.maxSeq]);\n await this.#saveState(tx, next);\n });\n this.#state = next;\n for (const [id, e] of this.#tail) if (e.seq <= snapshot.maxSeq) this.#tail.delete(id);\n this.#segments = [...this.#segments, this.#segmentOf(ref, built)];\n }),\n );\n return n;\n });\n }\n\n /**\n * Rewrites all segments into one (retraining the IVF lists) and drops dead\n * rows. Holds all live segment vectors in memory while it runs.\n */\n async merge(): Promise<number> {\n this.#assertReady();\n return this.#maintenance(async () => {\n const old = this.#segments;\n if (old.length === 0) return 0;\n const oldGens = old.map((s) => s.gen);\n\n const idList: number[] = [];\n const chunks: Float32Array[] = [];\n for (const seg of old) {\n for (let c = 0; c < seg.nlist; c++) {\n if (seg.counts[c] === 0) continue;\n const [data] = (await this.#store.lists(seg, [c])) as [ListData];\n const floats = await this.#store.floats(seg, c);\n const live = await this.#generations(Array.from(data.ids));\n for (let r = 0; r < data.ids.length; r++) {\n const id = data.ids[r];\n if (live.get(id) !== seg.gen) continue;\n idList.push(id);\n chunks.push(floats.subarray(r * this.dims, (r + 1) * this.dims));\n }\n }\n }\n\n const n = idList.length;\n const vectors = new Float32Array(n * this.dims);\n chunks.forEach((v, i) => {\n vectors.set(v, i * this.dims);\n });\n const built = n > 0 ? this.#build(Float64Array.from(idList), vectors) : null;\n\n await this.#exclusive(() =>\n this.#swapSegments(async () => {\n const ref = built ? this.#refOf(built, n) : null;\n const kept = this.#state.segments.filter((s) => !oldGens.includes(s.gen));\n const next: State = {\n ...this.#state,\n nextGen: ref ? ref.gen + 1 : this.#state.nextGen,\n segments: ref ? [...kept, ref] : kept,\n };\n await inTransaction(this.#db, async (tx) => {\n if (ref && built) {\n await this.#store.write(tx, ref.gen, built);\n await tx.query(\n `UPDATE ${this.#t.ids} SET gen = ? WHERE gen IN (SELECT value FROM json_each(?))`,\n [ref.gen, JSON.stringify(oldGens)],\n );\n }\n await this.#saveState(tx, next);\n });\n this.#state = next;\n this.#segments = [\n ...this.#segments.filter((s) => !oldGens.includes(s.gen)),\n ...(ref && built ? [this.#segmentOf(ref, built)] : []),\n ];\n this.#retired.push(...old);\n }),\n );\n await this.#reap();\n return n;\n });\n }\n\n /** compact() then merge(). */\n async optimize(): Promise<void> {\n await this.compact();\n await this.merge();\n }\n\n // ------------------------------------------------------------ private\n\n #build(ids: Float64Array, vectors: Float32Array): BuiltSegment {\n return buildSegment({\n dims: this.dims,\n metric: this.metric,\n ids,\n vectors,\n nlist: this.#nlist?.(ids.length),\n });\n }\n\n #refOf(built: BuiltSegment, count: number): SegmentRef {\n return { gen: this.#state.nextGen, count, nlist: built.nlist };\n }\n\n #segmentOf(ref: SegmentRef, built: BuiltSegment): SegmentIndex {\n return new SegmentIndex(ref.gen, this.dims, this.metric, built.centroids, built.counts);\n }\n\n async #generations(ids: number[]): Promise<Map<number, number>> {\n const out = new Map<number, number>();\n const unique = [...new Set(ids)];\n for (let i = 0; i < unique.length; i += VALIDATE_BATCH) {\n const rows = await this.#db.query<{ id: number; gen: number }>(\n `SELECT id, gen FROM ${this.#t.ids} WHERE id IN (SELECT value FROM json_each(?))`,\n [JSON.stringify(unique.slice(i, i + VALIDATE_BATCH))],\n );\n for (const r of rows) out.set(Number(r.id), Number(r.gen));\n }\n return out;\n }\n\n async #saveState(tx: Db, state: State): Promise<void> {\n await tx.query(\n `INSERT INTO ${this.#t.meta}(k, v) VALUES ('state', ?)\n ON CONFLICT(k) DO UPDATE SET v = excluded.v`,\n [JSON.stringify(state)],\n );\n }\n\n /** Deletes the rows of retired segments once no search is reading them. */\n async #reap(): Promise<void> {\n const ready = this.#retired.filter((s) => (this.#refs.get(s) ?? 0) === 0);\n if (ready.length === 0) return;\n this.#retired = this.#retired.filter((s) => !ready.includes(s));\n for (const s of ready) this.#refs.delete(s);\n const gens = ready.map((s) => s.gen);\n await inTransaction(this.#db, (tx) => this.#store.drop(tx, gens));\n }\n\n /**\n * Runs `read` over a snapshot of the segments, held against reaping. A read\n * whose liveness lookup straddles a compact or merge commit may not match its\n * snapshot, so it runs again on the new one; the third attempt stands.\n */\n async #read<T>(read: (segments: SegmentIndex[]) => Promise<T>): Promise<T> {\n for (let attempt = 1; ; attempt++) {\n const epoch = this.#epoch;\n const segments = this.#segments;\n for (const s of segments) this.#refs.set(s, (this.#refs.get(s) ?? 0) + 1);\n try {\n const result = await read(segments);\n if (attempt === 3 || (epoch % 2 === 0 && epoch === this.#epoch)) return result;\n } finally {\n for (const s of segments) this.#refs.set(s, (this.#refs.get(s) ?? 1) - 1);\n void this.#reap().catch(() => {}); // a failed reap leaves rows that init() sweeps\n }\n }\n }\n\n /** Commits a segment-list change; readers that overlap it retry (see `#read`). */\n async #swapSegments(fn: () => Promise<void>): Promise<void> {\n this.#epoch++;\n try {\n await fn();\n } finally {\n this.#epoch++;\n }\n }\n\n #exclusive<T>(fn: () => Promise<T>): Promise<T> {\n const run = this.#queue.then(fn, fn);\n this.#queue = run.catch(() => {});\n return run;\n }\n\n async #maintenance<T>(fn: () => Promise<T>): Promise<T> {\n if (this.#maintaining) throw new Error(\"vector-index: compact or merge already running\");\n this.#maintaining = true;\n try {\n return await fn();\n } finally {\n this.#maintaining = false;\n }\n }\n\n #assertReady() {\n if (!this.#ready) throw new Error(\"vector-index: call init() first\");\n }\n}\n\nfunction assertId(id: number) {\n if (!Number.isSafeInteger(id))\n throw new Error(`vector-index: id must be a safe integer, got ${id}`);\n}\n\n/** Drops every table of the index under `prefix`, in one transaction. Needs no dims or metric. */\nexport async function dropVectorIndex(db: Db, prefix: string): Promise<void> {\n if (!/^[A-Za-z_][A-Za-z0-9_]*$/.test(prefix))\n throw new Error(`vector-index: bad prefix ${prefix}`);\n await inTransaction(db, async (tx) => {\n for (const t of [\"meta\", \"ids\", \"tail\", \"centroids\", \"seg\", \"f32\"]) {\n await tx.exec(`DROP TABLE IF EXISTS ${prefix}${t}`);\n }\n });\n}\n"],"mappings":";;AAEA,SAAgB,UAAU,GAA+B;CACvD,IAAI,IAAI;CACR,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK,KAAK,EAAE,KAAK,EAAE;CACjD,IAAI,KAAK,KAAK,CAAC;CACf,MAAM,MAAM,IAAI,aAAa,EAAE,MAAM;CACrC,IAAI,MAAM,GAAG,OAAO;CACpB,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK,IAAI,KAAK,EAAE,KAAK;CACnD,OAAO;AACT;;AAGA,SAAgB,QAAQ,GAAsB,MAAc,QAA8B;CACxF,IAAI,EAAE,WAAW,MAAM,MAAM,IAAI,MAAM,0BAA0B,KAAK,aAAa,EAAE,QAAQ;CAC7F,MAAM,IAAI,aAAa,eAAe,IAAI,aAAa,KAAK,CAAC;CAC7D,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAC5B,IAAI,CAAC,OAAO,SAAS,EAAE,EAAE,GAAG,MAAM,IAAI,MAAM,kDAAkD;CAEhG,OAAO,WAAW,WAAW,UAAU,CAAC,IAAI,EAAE,MAAM;AACtD;;AAGA,SAAgB,SACd,QACA,GACA,IACA,GACA,IACA,GACQ;CACR,IAAI,WAAW,MAAM;EACnB,IAAI,IAAI;EACR,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;GAC1B,MAAM,IAAI,EAAE,KAAK,KAAK,EAAE,KAAK;GAC7B,KAAK,IAAI;EACX;EACA,OAAO;CACT;CACA,IAAI,IAAI;CACR,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,KAAK,EAAE,KAAK,KAAK,EAAE,KAAK;CACpD,OAAO,WAAW,WAAW,IAAI,IAAI,CAAC;AACxC;;AAKA,SAAgB,aAAa,GAAiB,IAAY,GAAW,KAAgB,IAAY;CAC/F,IAAI,MAAM;CACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,MAAM,KAAK,IAAI,KAAK,KAAK,IAAI,EAAE,KAAK,EAAE,CAAC;CACnE,MAAM,MAAM,QAAQ,IAAI,IAAI,MAAM;CAClC,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,IAAI,KAAK,KAAK,KAAK,MAAM,EAAE,KAAK,KAAK,GAAG;CACpE,OAAO;AACT;;AAGA,SAAgB,aACd,QACA,GACA,OACA,IACA,OACA,GACQ;CACR,MAAM,IAAI,QAAQ;CAClB,IAAI,WAAW,MAAM;EACnB,IAAI,IAAI;EACR,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;GAC1B,MAAM,IAAI,EAAE,KAAK,MAAM,KAAK,KAAK;GACjC,KAAK,IAAI;EACX;EACA,OAAO;CACT;CACA,IAAI,IAAI;CACR,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,KAAK,EAAE,KAAK,MAAM,KAAK;CACnD,KAAK;CACL,OAAO,WAAW,WAAW,IAAI,IAAI,CAAC;AACxC;AAWA,MAAa,YAAY,MAAe,IAAI,OAAQ;;AAGpD,SAAgB,aACd,GACA,IACA,GACA,IACA,GACA,KACA,IACA;CACA,MAAM,IAAI,SAAS,CAAC;CACpB,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC;CACtB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACrB,IAAI,EAAE,KAAK,KAAK,EAAE,KAAK,IAAI,IAAI,MAAM,MAAM,OAAO,MAAM,IAAI;AAEhE;AAEA,SAAgB,QAAQ,GAAgB,GAAgB,IAAY,GAAmB;CACrF,IAAI,IAAI;CACR,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EAC1B,IAAI,IAAI,EAAE,KAAK,EAAE,KAAK;EACtB,KAAM,MAAM,IAAK;EACjB,KAAK,IAAI,cAAgB,MAAM,IAAK;EACpC,KAAK,KAAK,KAAM,KAAK,MAAM,KAAM,WAAY,QAAU,MAAM;CAC/D;CACA,OAAO;AACT;;AAKA,IAAa,OAAb,MAAqB;CACnB;CACA,UAA6B,CAAC;CAC9B,SAAuB,CAAC;CAExB,YAAY,GAAW;EACrB,KAAK,KAAK,KAAK,IAAI,GAAG,CAAC;CACzB;CAEA,IAAI,OAAO;EACT,OAAO,KAAK,QAAQ;CACtB;;CAGA,IAAI,QAAQ;EACV,OAAO,KAAK,QAAQ,SAAS,KAAK,KAAK,OAAO,oBAAoB,KAAK,QAAQ;CACjF;CAEA,KAAK,OAAe,MAAS;EAC3B,IAAI,KAAK,OAAO,GAAG;EACnB,MAAM,IAAI,KAAK;EACf,MAAM,KAAK,KAAK;EAChB,IAAI,EAAE,SAAS,KAAK,IAAI;GACtB,EAAE,KAAK,KAAK;GACZ,GAAG,KAAK,IAAI;GACZ,IAAI,IAAI,EAAE,SAAS;GACnB,OAAO,IAAI,GAAG;IACZ,MAAM,IAAK,IAAI,KAAM;IACrB,IAAI,EAAE,MAAM,EAAE,IAAI;IAClB,KAAK,MAAM,GAAG,CAAC;IACf,IAAI;GACN;GACA;EACF;EACA,IAAI,SAAS,EAAE,IAAI;EACnB,EAAE,KAAK;EACP,GAAG,KAAK;EACR,IAAI,IAAI;EACR,SAAS;GACP,MAAM,IAAI,IAAI,IAAI;GAClB,MAAM,IAAI,IAAI;GACd,IAAI,IAAI;GACR,IAAI,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,IAAI,IAAI;GACrC,IAAI,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,IAAI,IAAI;GACrC,IAAI,MAAM,GAAG;GACb,KAAK,MAAM,GAAG,CAAC;GACf,IAAI;EACN;CACF;;CAGA,SAAuC;EACrC,OAAO,KAAK,QACT,KAAK,OAAO,OAAO;GAAE;GAAO,MAAM,KAAK,OAAO;EAAG,EAAE,CAAC,CACpD,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;CACrC;CAEA,MAAM,GAAW,GAAW;EAC1B,MAAM,IAAI,KAAK;EACf,MAAM,KAAK,KAAK;EAChB,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,EAAE,IAAI,EAAE,EAAE;EAC1B,CAAC,GAAG,IAAI,GAAG,MAAM,CAAC,GAAG,IAAI,GAAG,EAAE;CAChC;AACF;;;;AC7KA,SAAgB,WAAW,MAAc;CACvC,IAAI,IAAI,SAAS;CACjB,aAAa;EACX,IAAK,IAAI,eAAgB;EACzB,IAAI,IAAI;EACR,IAAI,KAAK,KAAK,IAAK,MAAM,IAAK,IAAI,CAAC;EACnC,KAAK,IAAI,KAAK,KAAK,IAAK,MAAM,GAAI,IAAI,EAAE;EACxC,SAAS,IAAK,MAAM,QAAS,KAAK;CACpC;AACF;;AAGA,SAAgB,QACd,QACA,MACA,QACA,WACA,GACA,GACQ;CACR,IAAI,OAAO;CACX,IAAI,QAAQ,OAAO;CAEnB,MAAM,IAAY,WAAW,OAAO,OAAO;CAC3C,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EAC1B,MAAM,OAAO,SAAS,GAAG,MAAM,QAAQ,WAAW,IAAI,GAAG,CAAC;EAC1D,IAAI,OAAO,OAAO;GAChB,QAAQ;GACR,OAAO;EACT;CACF;CACA,OAAO;AACT;;;;;AAMA,SAAgB,OACd,MACA,GACA,GACA,GACA,QACA,OAAsB,CAAC,GACT;CACd,MAAM,OAAO,WAAW,KAAK,QAAQ,EAAE;CACvC,IAAI,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,CAAC,CAAC;CAC9B,MAAM,aAAa,KAAK,IAAI,GAAG,KAAK,cAAc,KAAK,IAAI,KAAK,GAAG,IAAM,CAAC;CAG1E,MAAM,MAAM,IAAI,YAAY,CAAC;CAC7B,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,IAAI,KAAK;CACrC,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,KAAK;EACnC,MAAM,IAAI,IAAI,KAAK,MAAM,KAAK,KAAK,IAAI,EAAE;EACzC,CAAC,IAAI,IAAI,IAAI,MAAM,CAAC,IAAI,IAAI,IAAI,EAAE;CACpC;CACA,MAAM,SAAS,IAAI,aAAa,aAAa,CAAC;CAC9C,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,KAAK,OAAO,IAAI,KAAK,SAAS,IAAI,KAAK,GAAG,IAAI,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC;CAEhG,MAAM,YAAY,WAAW;CAC7B,MAAM,YAAY,IAAI,aAAa,IAAI,CAAC;CAGxC,UAAU,IAAI,OAAO,SAAS,GAAG,CAAC,GAAG,CAAC;CACtC,MAAM,OAAO,IAAI,aAAa,UAAU,CAAC,CAAC,KAAK,OAAO,iBAAiB;CACvE,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EAC1B,IAAI,QAAQ;EACZ,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,KAAK;GACnC,MAAM,KAAK,SAAS,MAAM,QAAQ,IAAI,GAAG,YAAY,IAAI,KAAK,GAAG,CAAC;GAClE,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK;GAC5B,SAAS,KAAK;EAChB;EACA,IAAI,IAAI,KAAK,IAAI;EACjB,IAAI,OAAO,aAAa;EACxB,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,KAAK;GACnC,KAAK,KAAK;GACV,IAAI,KAAK,GAAG;IACV,OAAO;IACP;GACF;EACF;EACA,UAAU,IAAI,OAAO,SAAS,OAAO,GAAG,OAAO,IAAI,CAAC,GAAG,IAAI,CAAC;CAC9D;CAEA,MAAM,SAAS,IAAI,YAAY,UAAU;CACzC,MAAM,SAAS,IAAI,YAAY,CAAC;CAChC,MAAM,aAAa,KAAK,cAAc;CACtC,KAAK,IAAI,KAAK,GAAG,KAAK,YAAY,MAAM;EACtC,IAAI,QAAQ;EACZ,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,KAAK;GACnC,MAAM,IAAI,QAAQ,QAAQ,QAAQ,IAAI,GAAG,WAAW,GAAG,CAAC;GACxD,IAAI,MAAM,OAAO,MAAM,OAAO,GAAG;GACjC,OAAO,KAAK;EACd;EACA,MAAM,OAAO,IAAI,aAAa,IAAI,CAAC;EACnC,OAAO,KAAK,CAAC;EACb,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,KAAK;GACnC,MAAM,IAAI,OAAO;GACjB,OAAO,EAAE;GACT,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,KAAK,IAAI,IAAI,MAAM,OAAO,IAAI,IAAI;EAChE;EACA,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;GAC1B,IAAI,OAAO,OAAO,GAAG;IAEnB,MAAM,IAAI,KAAK,MAAM,KAAK,IAAI,UAAU;IACxC,UAAU,IAAI,OAAO,SAAS,IAAI,GAAG,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC;IACtD;GACF;GACA,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,UAAU,IAAI,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,OAAO;EAC9E;EACA,IAAI,WACF,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACrB,UAAU,IAAI,UAAU,UAAU,SAAS,IAAI,GAAG,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC;EAGxE,IAAI,KAAK,KAAK,UAAU,GAAG;CAC7B;CACA,OAAO;AACT;;;;;;;;;;;;;;;;;ACxGA,MAAM,UAAU,MAAe,IAAI,IAAK;AAcxC,SAAgB,WAAW,OAAe,MAA0B;CAClE,MAAM,IAAI,SAAS,IAAI;CACvB,MAAM,QAAQ;CACd,MAAM,SAAS,OAAO,QAAQ,IAAI,KAAK;CACvC,MAAM,UAAU,OAAO,SAAS,IAAI,IAAI,KAAK;CAC7C,MAAM,SAAS,OAAO,UAAU,IAAI,KAAK;CACzC,MAAM,WAAW,OAAO,SAAS,IAAI,KAAK;CAC1C,MAAM,UAAU,OAAO,WAAW,IAAI,KAAK;CAE3C,OAAO;EAAE;EAAO;EAAO;EAAQ;EAAS;EAAQ;EAAU;EAAS,QADpD,OAAO,UAAU,OAAO,KACiC;CAAE;AAC5E;AA4BA,SAAgB,aAAa,GAAW;CACtC,IAAI,IAAA,MAAe,OAAO;CAC1B,OAAO,KAAK,IAAI,GAAG,KAAK,IAAI,MAAM,KAAK,MAAM,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC;AAC7D;AAEA,SAAgB,aAAa,OAAiC;CAC5D,MAAM,EAAE,MAAM,GAAG,QAAQ,KAAK,YAAY;CAC1C,MAAM,IAAI,IAAI;CACd,MAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,IAAI,MAAM,SAAS,aAAa,CAAC,GAAG,KAAK,IAAI,GAAG,CAAC,CAAC,CAAC;CAElF,IAAI;CACJ,IAAI,UAAU,GAAG;EACf,YAAY,IAAI,aAAa,CAAC;EAC9B,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,UAAU,MAAM,QAAQ,IAAI,IAAI;EACxF,IAAI,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,UAAU,MAAM;CACzD,OACE,YAAY,OAAO,SAAS,GAAG,GAAG,OAAO,QAAQ,EAAE,MAAM,MAAM,KAAK,CAAC;CAGvE,MAAM,SAAS,IAAI,YAAY,CAAC;CAChC,MAAM,SAAS,IAAI,YAAY,KAAK;CACpC,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EAC1B,MAAM,IAAI,UAAU,IAAI,IAAI,QAAQ,QAAQ,SAAS,IAAI,GAAG,WAAW,OAAO,CAAC;EAC/E,OAAO,KAAK;EACZ,OAAO,EAAE;CACX;CAEA,MAAM,IAAI,SAAS,CAAC;CACpB,MAAM,UAAU,MAAM,KAAK,SAAS,UAAU,WAAW,OAAO,CAAC,CAAC;CAClE,MAAM,QAAQ,QAAQ,KAAK,MAAM,IAAI,WAAW,EAAE,MAAM,CAAC;CACzD,MAAM,SAAS,MAAM,KAAK,SAAS,UAAU,IAAI,WAAW,IAAI,QAAQ,CAAC,CAAC;CAC1E,MAAM,QAAQ,QAAQ,KAAK,GAAG,MAAM;EAClC,MAAM,MAAM,MAAM,EAAE,CAAC;EACrB,OAAO;GACL,KAAK,IAAI,aAAa,KAAK,EAAE,OAAO,EAAE,KAAK;GAC3C,MAAM,IAAI,YAAY,KAAK,EAAE,QAAQ,EAAE,QAAQ,CAAC;GAChD,OAAO,IAAI,aAAa,KAAK,EAAE,SAAS,EAAE,KAAK;GAC/C,MAAM,IAAI,aAAa,KAAK,EAAE,QAAQ,EAAE,KAAK;GAC7C,QAAQ,IAAI,aAAa,KAAK,EAAE,UAAU,EAAE,KAAK;GACjD,OAAO,IAAI,UAAU,KAAK,EAAE,SAAS,EAAE,QAAQ,CAAC;GAChD,QAAQ,IAAI,aAAa,OAAO,EAAE,CAAC,QAAQ,GAAG,EAAE,QAAQ,CAAC;EAC3D;CACF,CAAC;CAED,MAAM,OAAO,IAAI,YAAY,KAAK;CAClC,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EAC1B,MAAM,IAAI,OAAO;EACjB,MAAM,IAAI,KAAK,EAAE;EACjB,MAAM,IAAI,MAAM;EAChB,EAAE,IAAI,KAAK,IAAI;EACf,aAAa,SAAS,IAAI,GAAG,WAAW,IAAI,GAAG,GAAG,EAAE,MAAM,IAAI,CAAC;EAC/D,MAAM,CAAC,IAAI,MAAM,cAAc,SAAS,IAAI,GAAG,WAAW,IAAI,GAAG,CAAC;EAClE,EAAE,MAAM,KAAK;EACb,EAAE,KAAK,KAAK;EACZ,EAAE,OAAO,KAAK,aAAa,SAAS,IAAI,GAAG,GAAG,EAAE,OAAO,IAAI,CAAC;EAC5D,EAAE,OAAO,IAAI,QAAQ,SAAS,IAAI,GAAG,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC;CACxD;CACA,OAAO;EAAE;EAAO;EAAQ;EAAW;EAAO;CAAO;AACnD;;AAGA,SAAS,cAAc,GAAiB,IAAY,GAAiB,IAAY,GAAW;CAC1F,IAAI,KAAK;CACT,IAAI,KAAK;CACT,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EAC1B,MAAM,IAAI,EAAE,KAAK,KAAK,EAAE,KAAK;EAC7B,MAAM,IAAI;EACV,MAAM,EAAE,KAAK,KAAK;CACpB;CACA,OAAO,CAAC,KAAK,KAAK,EAAE,GAAG,EAAE;AAC3B;;AAcA,SAAgB,UAAU,OAAmB,OAAe,MAAwB;CAClF,MAAM,IAAI,WAAW,OAAO,IAAI;CAChC,IAAI,MAAM,eAAe,EAAE,QACzB,MAAM,IAAI,MAAM,gCAAgC,MAAM,WAAW,mBAAmB,EAAE,QAAQ;CAEhG,MAAM,MAAM,MAAM,eAAe,IAAI,MAAM,SAAS,MAAM,MAAM,CAAC,CAAC;CAClE,MAAM,IAAI,SAAS,IAAI;CACvB,OAAO;EACL,KAAK,IAAI,aAAa,KAAK,EAAE,OAAO,KAAK;EACzC,MAAM,IAAI,YAAY,KAAK,EAAE,QAAQ,QAAQ,CAAC;EAC9C,OAAO,IAAI,aAAa,KAAK,EAAE,SAAS,KAAK;EAC7C,MAAM,IAAI,aAAa,KAAK,EAAE,QAAQ,KAAK;EAC3C,QAAQ,IAAI,aAAa,KAAK,EAAE,UAAU,KAAK;EAC/C,OAAO,IAAI,UAAU,KAAK,EAAE,SAAS,QAAQ,IAAI;CACnD;AACF;;AASA,IAAa,eAAb,MAA0B;CAEb;CACA;CACA;CACA;CACA;CALX,YACE,KACA,MACA,QACA,WACA,QACA;EALS,KAAA,MAAA;EACA,KAAA,OAAA;EACA,KAAA,SAAA;EACA,KAAA,YAAA;EACA,KAAA,SAAA;CACR;CAEH,IAAI,QAAQ;EACV,OAAO,KAAK,OAAO;CACrB;;CAGA,MAAM,OAAqB,QAA0B;EACnD,MAAM,IAAY,KAAK,WAAW,OAAO,OAAO;EAChD,MAAM,MAAM,IAAI,KAAa,KAAK,IAAI,QAAQ,KAAK,KAAK,CAAC;EACzD,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,KAAK;GACnC,IAAI,KAAK,OAAO,OAAO,GAAG;GAC1B,IAAI,KAAK,SAAS,GAAG,OAAO,GAAG,KAAK,WAAW,IAAI,KAAK,MAAM,KAAK,IAAI,GAAG,CAAC;EAC7E;EACA,OAAO,IAAI,OAAO,CAAC,CAAC,KAAK,MAAM,EAAE,IAAI;CACvC;;;;;CAMA,WACE,OACA,GACA,MACA,OACA,MACa;EACb,MAAM,IAAI,KAAK;EACf,MAAM,IAAI,SAAS,CAAC;EACpB,MAAM,KAAK,IAAI;EACf,MAAM,KAAK,IAAI,YAAY,CAAC;EAC5B,aAAa,OAAO,GAAG,KAAK,WAAW,IAAI,GAAG,IAAI,CAAC;EACnD,MAAM,CAAC,IAAI,OAAO,cAAc,OAAO,GAAG,KAAK,WAAW,IAAI,CAAC;EAC/D,IAAI,KAAK;EACT,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,MAAM,KAAK,UAAU,KAAK,KAAK,KAAK,UAAU,KAAK;EAC/E,MAAM,KAAK,KAAK;EAChB,MAAM,QAAQ,KAAK,KAAK;EACxB,MAAM,KAAK,KAAK,WAAW;EAC3B,MAAM,MAAM,IAAI,KAAgB,KAAK;EACrC,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,QAAQ,KAAK;GACxC,MAAM,KAAK,KAAK,IAAI;GACpB,IAAI,QAAQ,CAAC,KAAK,EAAE,GAAG;GACvB,MAAM,KAAK,KAAK,KAAK,MAAM,KAAK,KAAK,IAAI,QAAQ,QAAQ,IAAI,KAAK,MAAM,IAAI,GAAG,CAAC,CAAC;GAEjF,MAAM,MAAM,KAAK,KAAK,KAAK,KAAK,MAAM,KAAK,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,KAAK,KAAK,KAAK,KAAK;GAC1F,IAAI,MAAM,IAAI,OAAO,IAAI,KAAK,KAAK;IAAE,MAAM;IAAG,KAAK;IAAG;GAAG,CAAC;EAC5D;EACA,OAAO,IAAI,OAAO,CAAC,CAAC,KAAK,MAAM,EAAE,IAAI;CACvC;;CAGA,UAAU,OAAqB,MAAgB,KAAqB;EAClE,OAAO,aACL,KAAK,QACL,OACA,KAAK,OACL,MAAM,KAAK,MACX,KAAK,OAAO,MACZ,KAAK,IACP;CACF;AACF;;;;ACzOA,SAAgB,UAAU,OAAiC;CACzD,MAAM,OAAO,MAAM,MAAM;CACzB,OAAO,IAAI,aAAa,KAAK,QAAQ,GAAG,KAAK,cAAc,CAAC;AAC9D;AAEA,SAAgB,aAAa,GAA6B;CACxD,OAAO,IAAI,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC,MAAM;AACpE;;;;;;;ACrBA,MAAa,aAAa;;;;;;AAa1B,IAAa,kBAAb,MAA6B;CAC3B;CACA;CACA;CACA;CAEA,YAAY,IAAQ,QAAgB,MAAc,aAAa,UAAkB;EAC/E,KAAK,MAAM;EACX,KAAK,QAAQ;EACb,KAAK,KAAK;GAAE,WAAW,GAAG,OAAO;GAAY,KAAK,GAAG,OAAO;GAAM,KAAK,GAAG,OAAO;EAAK;EACtF,KAAK,SAAS,IAAI,IAAI,UAAU;CAClC;CAEA,SAAmB;EACjB,MAAM,EAAE,WAAW,KAAK,QAAQ,KAAK;EACrC,OAAO;GACL,8BAA8B,UAAU;;GAExC,8BAA8B,IAAI;;GAElC,8BAA8B,IAAI;;EAEpC;CACF;;CAGA,MAAM,MAAM,IAAQ,KAAa,OAAoC;EACnE,MAAM,IAAI,KAAK;EACf,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,OAAO,KAAK;GACpC,MAAM,GAAG,MACP,eAAe,KAAK,GAAG,UAAU,mDACjC;IAAC;IAAK;IAAG,MAAM,OAAO;IAAI,aAAa,MAAM,UAAU,SAAS,IAAI,IAAI,IAAI,KAAK,CAAC,CAAC;GAAC,CACtF;GACA,MAAM,WAAW,IAAI,KAAK,GAAG,KAAK,KAAK,GAAG,MAAM,MAAM,EAAgB;GACtE,MAAM,WAAW,IAAI,KAAK,GAAG,KAAK,KAAK,GAAG,MAAM,OAAO,EAAgB;EACzE;CACF;;CAGA,MAAM,KAAK,KAAiB,QAAuC;EACjE,MAAM,IAAI,KAAK;EACf,MAAM,OAAO,MAAM,KAAK,IAAI,MAC1B,qCAAqC,KAAK,GAAG,UAAU,+BACvD,CAAC,IAAI,GAAG,CACV;EACA,IAAI,KAAK,WAAW,IAAI,OACtB,MAAM,IAAI,MACR,yBAAyB,IAAI,IAAI,OAAO,KAAK,OAAO,mBAAmB,IAAI,OAC7E;EAEF,MAAM,YAAY,IAAI,aAAa,IAAI,QAAQ,CAAC;EAChD,MAAM,SAAS,IAAI,YAAY,IAAI,KAAK;EACxC,KAAK,MAAM,KAAK,MAAM;GACpB,MAAM,IAAI,OAAO,EAAE,IAAI;GACvB,UAAU,IAAI,UAAU,EAAE,QAAQ,GAAG,IAAI,CAAC;GAC1C,OAAO,KAAK,OAAO,EAAE,KAAK;EAC5B;EACA,OAAO,IAAI,aAAa,IAAI,KAAK,GAAG,QAAQ,WAAW,MAAM;CAC/D;;CAGA,MAAM,MAAM,KAAmB,IAAmC;EAChE,MAAM,sBAAM,IAAI,IAAsB;EACtC,MAAM,UAAoB,CAAC;EAC3B,KAAK,MAAM,KAAK,IAAI;GAClB,MAAM,MAAM,KAAK,OAAO,IAAI,KAAK,IAAI,IAAI,GAAG,GAAG;GAC/C,IAAI,KAAK,IAAI,IAAI,GAAG,GAAG;QAClB,QAAQ,KAAK,CAAC;EACrB;EACA,IAAI,QAAQ,SAAS,GAAG;GACtB,MAAM,SAAS,MAAM,UAAU,KAAK,KAAK,KAAK,GAAG,KAAK,IAAI,KAAK,OAAO;GACtE,KAAK,MAAM,KAAK,SAAS;IACvB,MAAM,QAAQ,OAAO,IAAI,CAAC,qBAAK,IAAI,WAAW,CAAC;IAC/C,MAAM,OAAO,UAAU,OAAO,IAAI,OAAO,IAAc,KAAK,KAAK;IACjE,KAAK,OAAO,IAAI,KAAK,IAAI,IAAI,GAAG,KAAK,MAAM,MAAM,UAAU;IAC3D,IAAI,IAAI,GAAG,IAAI;GACjB;EACF;EACA,OAAO,GAAG,KAAK,MAAM,IAAI,IAAI,CAAC,CAAa;CAC7C;;CAGA,MAAM,OAAO,KAAmB,GAAkC;EAChE,MAAM,MAAM,KAAK,IAAI,IAAI,GAAG;EAC5B,MAAM,MAAM,KAAK,OAAO,IAAI,GAAG;EAC/B,IAAI,KAAK,OAAO;EAEhB,MAAM,SAAS,WAAU,MADJ,UAAU,KAAK,KAAK,KAAK,GAAG,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC,EACzC,CAAO,IAAI,CAAC,qBAAK,IAAI,WAAW,CAAC,CAAC;EAC3D,KAAK,OAAO,IAAI,KAAK,QAAQ,OAAO,UAAU;EAC9C,OAAO;CACT;;CAGA,MAAM,KAAK,IAAQ,MAA+B;EAChD,MAAM,OAAO,KAAK,UAAU,IAAI;EAChC,KAAK,MAAM,SAAS,OAAO,OAAO,KAAK,EAAE,GACvC,MAAM,GAAG,MAAM,eAAe,MAAM,iDAAiD,CAAC,IAAI,CAAC;EAE7F,KAAK,MAAM,OAAO,MAAM,KAAK,OAAO,aAAa,KAAK,IAAI,IAAI,KAAK,IAAI,EAAE;CAC3E;;CAGA,MAAM,MAAM,IAAQ,MAA+B;EACjD,MAAM,OAAO,KAAK,UAAU,IAAI;EAChC,KAAK,MAAM,SAAS,OAAO,OAAO,KAAK,EAAE,GACvC,MAAM,GAAG,MAAM,eAAe,MAAM,qDAAqD,CACvF,IACF,CAAC;CAEL;AACF;AAEA,eAAe,WAAW,IAAQ,OAAe,KAAa,MAAc,OAAmB;CAC7F,KAAK,IAAI,OAAO,GAAG,KAAK,GAAG,KAAK,MAAM,YAAY,QAAQ,MAAM,YAC9D,MAAM,GAAG,MAAM,eAAe,MAAM,+CAA+C;EACjF;EACA;EACA;EACA,MAAM,MAAM,IAAI,KAAK,UAAU;CACjC,CAAC;AAEL;;AAGA,eAAe,UACb,IACA,OACA,KACA,OACkC;CAClC,MAAM,OAAO,MAAM,GAAG,MACpB,2BAA2B,MAAM;sFAEjC,CAAC,KAAK,KAAK,UAAU,KAAK,CAAC,CAC7B;CACA,MAAM,wBAAQ,IAAI,IAA0B;CAC5C,KAAK,MAAM,KAAK,MAAM;EACpB,MAAM,OAAO,OAAO,EAAE,IAAI;EAC1B,MAAM,MAAM,MAAM,IAAI,IAAI,KAAK,CAAC;EAChC,IAAI,KAAK,EAAE,KAAK;EAChB,MAAM,IAAI,MAAM,GAAG;CACrB;CACA,MAAM,sBAAM,IAAI,IAAwB;CACxC,KAAK,MAAM,CAAC,MAAM,OAAO,OAAO;EAC9B,MAAM,SAAS,IAAI,WAAW,GAAG,QAAQ,GAAG,MAAM,IAAI,EAAE,YAAY,CAAC,CAAC;EACtE,IAAI,KAAK;EACT,KAAK,MAAM,KAAK,IAAI;GAClB,OAAO,IAAI,GAAG,EAAE;GAChB,MAAM,EAAE;EACV;EACA,IAAI,IAAI,MAAM,MAAM;CACtB;CACA,OAAO;AACT;;AAGA,IAAM,MAAN,MAAa;CACX;CACA,uBAAgB,IAAI,IAAwC;CAC5D,SAAS;CAET,YAAY,UAAkB;EAC5B,KAAK,OAAO;CACd;CAEA,IAAI,KAA4B;EAC9B,MAAM,IAAI,KAAK,KAAK,IAAI,GAAG;EAC3B,IAAI,CAAC,GAAG,OAAO,KAAA;EACf,KAAK,KAAK,OAAO,GAAG;EACpB,KAAK,KAAK,IAAI,KAAK,CAAC;EACpB,OAAO,EAAE;CACX;CAEA,IAAI,KAAa,OAAU,MAAc;EACvC,MAAM,MAAM,KAAK,KAAK,IAAI,GAAG;EAC7B,IAAI,KAAK;GACP,KAAK,KAAK,OAAO,GAAG;GACpB,KAAK,UAAU,IAAI;EACrB;EACA,KAAK,KAAK,IAAI,KAAK;GAAE;GAAO;EAAK,CAAC;EAClC,KAAK,UAAU;EACf,KAAK,MAAM,CAAC,GAAG,MAAM,KAAK,MAAM;GAC9B,IAAI,KAAK,UAAU,KAAK,MAAM;GAC9B,KAAK,KAAK,OAAO,CAAC;GAClB,KAAK,UAAU,EAAE;EACnB;CACF;CAEA,aAAa,GAAG,UAAoB;EAClC,KAAK,MAAM,CAAC,GAAG,MAAM,KAAK,MACxB,IAAI,SAAS,MAAM,MAAM,EAAE,WAAW,CAAC,CAAC,GAAG;GACzC,KAAK,KAAK,OAAO,CAAC;GAClB,KAAK,UAAU,EAAE;EACnB;CAEJ;AACF;;;;AC5JA,MAAM,iBAAiB;;AAEvB,MAAM,cAAc;;;;;;;;;;;;;;;;AAiBpB,IAAa,cAAb,MAAyB;CACvB;CACA;;CAEA;CACA;CACA;CACA;CACA;CACA;CAEA,SAAgB;EAAE,KAAK;EAAG,SAAS;EAAG,UAAU,CAAC;CAAE;CACnD,wBAAQ,IAAI,IAAuB;CACnC,YAA4B,CAAC;CAC7B,wBAAQ,IAAI,IAA0B;CACtC,WAA2B,CAAC;CAC5B,SAA2B,QAAQ,QAAQ;CAC3C,eAAe;CACf,SAAS;;CAET,SAAS;CAET,YAAY,MAA0B;EACpC,IAAI,CAAC,2BAA2B,KAAK,KAAK,MAAM,GAC9C,MAAM,IAAI,MAAM,4BAA4B,KAAK,QAAQ;EAE3D,IAAI,CAAC,OAAO,UAAU,KAAK,IAAI,KAAK,KAAK,OAAO,GAC9C,MAAM,IAAI,MAAM,+CAA+C;EAEjE,KAAK,OAAO,KAAK;EACjB,KAAK,SAAS,KAAK,UAAU;EAC7B,KAAK,MAAM,KAAK;EAChB,KAAK,SAAS,IAAI,gBAAgB,KAAK,IAAI,KAAK,QAAQ,KAAK,MAAM,KAAK,UAAU;EAClF,KAAK,SAAS,KAAK;EACnB,KAAK,iBAAiB,KAAK,iBAAiB;EAC5C,MAAM,IAAI,KAAK;EACf,KAAK,KAAK;GAAE,MAAM,GAAG,EAAE;GAAO,KAAK,GAAG,EAAE;GAAM,MAAM,GAAG,EAAE;EAAM;EAC/D,KAAK,UAAU,KAAK,GAAG;CACzB;;CAKA,MAAM,OAAsB;EAC1B,MAAM,EAAE,MAAM,KAAK,SAAS,KAAK;EACjC,KAAK,MAAM,KAAK;GACd,8BAA8B,KAAK;GACnC,8BAA8B,IAAI;GAClC,8BAA8B,IAAI,UAAU,IAAI;GAChD,8BAA8B,KAAK;GACnC,8BAA8B,KAAK,UAAU,KAAK;GAClD,GAAG,KAAK,OAAO,OAAO;EACxB,GACE,MAAM,KAAK,IAAI,KAAK,CAAC;EAGvB,MAAM,SAAS,KAAK,UAAU;GAAE,MAAM,KAAK;GAAM,QAAQ,KAAK;EAAO,CAAC;EACtE,MAAM,KAAK,IAAI,MACb,eAAe,KAAK,wDACpB,CAAC,MAAM,CACT;EACA,MAAM,CAAC,UAAU,MAAM,KAAK,IAAI,MAC9B,iBAAiB,KAAK,oBACxB;EACA,IAAI,QAAQ,MAAM,QAChB,MAAM,IAAI,MAAM,0CAA0C,QAAQ,EAAE,QAAQ,QAAQ;EAEtF,MAAM,KAAK,QAAQ;EACnB,MAAM,OAAO,KAAK,OAAO,SAAS,KAAK,MAAM,EAAE,GAAG;EAClD,MAAM,cAAc,KAAK,MAAM,OAAO,KAAK,OAAO,MAAM,IAAI,IAAI,CAAC;EACjE,KAAK,SAAS;CAChB;;CAGA,MAAM,UAAyB;EAC7B,MAAM,CAAC,OAAO,MAAM,KAAK,IAAI,MAC3B,iBAAiB,KAAK,GAAG,KAAK,mBAChC;EACA,MAAM,QAAe,MAAM,KAAK,MAAM,IAAI,CAAC,IAAI;GAAE,KAAK;GAAG,SAAS;GAAG,UAAU,CAAC;EAAE;EAElF,MAAM,uBAAO,IAAI,IAAuB;EACxC,MAAM,OAAO,MAAM,KAAK,IAAI,MAC1B,4BAA4B,KAAK,GAAG,MACtC;EACA,KAAK,MAAM,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,EAAE,GAAG;GAAE,KAAK,OAAO,EAAE,GAAG;GAAG,QAAQ,UAAU,EAAE,GAAG;EAAE,CAAC;EAE7F,MAAM,QAAQ,IAAI,IAAI,KAAK,UAAU,KAAK,MAAM,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;EAC3D,MAAM,WAAW,MAAM,QAAQ,IAC7B,MAAM,SAAS,KAAK,MAAM,MAAM,IAAI,EAAE,GAAG,KAAK,KAAK,OAAO,KAAK,GAAG,KAAK,MAAM,CAAC,CAChF;EACA,KAAK,SAAS;EACd,KAAK,QAAQ;EACb,KAAK,YAAY;CACnB;CAEA,IAAI,QAA0B;EAC5B,OAAO;GACL,MAAM,KAAK,MAAM;GACjB,UAAU,KAAK,OAAO,SAAS,KAAK,OAAO,EAAE,GAAG,EAAE,EAAE;GACpD,KAAK,KAAK,OAAO;EACnB;CACF;CAIA,MAAM,OAAO,OAAoC;EAC/C,KAAK,aAAa;EAClB,MAAM,WAAW,MAAM,KAAK,OAAO;GACjC,SAAS,GAAG,EAAE;GACd,OAAO;IAAE,IAAI,GAAG;IAAI,QAAQ,QAAQ,GAAG,QAAQ,KAAK,MAAM,KAAK,MAAM;GAAE;EACzE,CAAC;EACD,MAAM,EAAE,MAAM,QAAQ,KAAK;EAC3B,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK,aAAa;GACrD,MAAM,QAAQ,SAAS,MAAM,GAAG,IAAI,WAAW;GAC/C,MAAM,KAAK,WAAW,YAAY;IAChC,MAAM,MAAM,KAAK,OAAO,MAAM;IAC9B,MAAM,OAAO;KAAE,GAAG,KAAK;KAAQ;IAAI;IACnC,MAAM,cAAc,KAAK,KAAK,OAAO,OAAO;KAC1C,KAAK,MAAM,EAAE,IAAI,YAAY,OAAO;MAClC,MAAM,GAAG,MACP,eAAe,KAAK;sFAEpB;OAAC;OAAI;OAAK,aAAa,MAAM;MAAC,CAChC;MACA,MAAM,GAAG,MACP,eAAe,IAAI,gEACnB,CAAC,EAAE,CACL;KACF;KACA,MAAM,KAAK,WAAW,IAAI,IAAI;IAChC,CAAC;IACD,KAAK,SAAS;IACd,KAAK,MAAM,EAAE,IAAI,YAAY,OAAO,KAAK,MAAM,IAAI,IAAI;KAAE;KAAK;IAAO,CAAC;GACxE,CAAC;GACD,IAAI,KAAK,MAAM,QAAQ,KAAK,kBAAkB,CAAC,KAAK,cAAc,MAAM,KAAK,QAAQ;EACvF;CACF;CAEA,MAAM,OAAO,KAA8B;EACzC,KAAK,aAAa;EAClB,IAAI,QAAQ,QAAQ;EACpB,MAAM,KAAK,WAAW,YAAY;GAChC,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK,gBAAgB;IACnD,MAAM,QAAQ,IAAI,MAAM,GAAG,IAAI,cAAc;IAC7C,MAAM,OAAO,KAAK,UAAU,KAAK;IACjC,MAAM,cAAc,KAAK,KAAK,OAAO,OAAO;KAC1C,MAAM,GAAG,MACP,eAAe,KAAK,GAAG,KAAK,gDAC5B,CAAC,IAAI,CACP;KACA,MAAM,GAAG,MACP,eAAe,KAAK,GAAG,IAAI,gDAC3B,CAAC,IAAI,CACP;IACF,CAAC;IACD,KAAK,MAAM,MAAM,OAAO,KAAK,MAAM,OAAO,EAAE;GAC9C;EACF,CAAC;CACH;CAIA,MAAM,OAAO,OAA0B,OAAsB,CAAC,GAAyB;EACrF,KAAK,aAAa;EAClB,MAAM,IAAI,KAAK,KAAK;EACpB,MAAM,SAAS,KAAK,UAAU;EAC9B,MAAM,UAAU,KAAK,KAAK,cAAc;EACxC,MAAM,IAAI,QAAQ,OAAO,KAAK,MAAM,KAAK,MAAM;EAC/C,MAAM,IAAI,KAAK;EACf,MAAM,SAAS,KAAK;EAEpB,OAAO,KAAK,MAAM,OAAO,aAAa;GAEpC,MAAM,UAAU,IAAI,KAAa,CAAC;GAClC,KAAK,MAAM,CAAC,IAAI,EAAE,aAAa,KAAK,OAAO;IACzC,IAAI,UAAU,CAAC,OAAO,EAAE,GAAG;IAC3B,QAAQ,KAAK,SAAS,KAAK,QAAQ,GAAG,GAAG,QAAQ,GAAG,CAAC,GAAG,EAAE;GAC5D;GAIA,MAAM,OAAc,CAAC;GAErB,MAAM,QAAQ,OAAe,CAAC,KAAK,MAAM,IAAI,EAAE,MAAM,CAAC,UAAU,OAAO,EAAE;GACzE,MAAM,QAAQ,IACZ,SAAS,IAAI,OAAO,QAAQ;IAC1B,MAAM,QAAQ,IAAI,MAAM,GAAG,MAAM;IACjC,MAAM,QAAQ,MAAM,KAAK,OAAO,MAAM,KAAK,KAAK;IAChD,KAAK,QAAQ,eAAe;IAC5B,MAAM,SAAS,GAAG,MAAM;KACtB,MAAM,OAAO,MAAM;KACnB,KAAK,MAAM,QAAQ,IAAI,WAAW,GAAG,GAAG,MAAM,SAAS,IAAI,GACzD,KAAK,KAAK;MAAE,GAAG;MAAM;MAAK;KAAK,CAAC;IACpC,CAAC;GACH,CAAC,CACH;GAGA,MAAM,OAAO,MAAM,KAAK,aAAa,KAAK,KAAK,MAAM,EAAE,EAAE,CAAC;GAI1D,MAAM,SAAS,IAAI,KADJ,KAAK,QAAQ,IAAI,IAAI,CACD;GACnC,KAAK,MAAM,KAAK,MAAM;IACpB,IAAI,KAAK,IAAI,EAAE,EAAE,MAAM,EAAE,IAAI,KAAK;IAClC,OAAO,KAAK,EAAE,IAAI,UAAU,GAAG,EAAE,MAAM,EAAE,GAAG,GAAG,CAAC;GAClD;GACA,IAAI,aAAa,OACd,OAAO,CAAC,CACR,KAAK,OAAO;IAAE,IAAI,EAAE,KAAK;IAAI,UAAU,EAAE;IAAO,KAAK,EAAE;GAAK,EAAE;GAGjE,IAAI,KAAK,OACP,aAAa,MAAM,QAAQ,IACzB,WAAW,IAAI,OAAO,MAAM;IAE1B,MAAM,KAAI,MADQ,KAAK,OAAO,OAAO,EAAE,IAAI,KAAK,EAAE,IAAI,IAAI,EAAA,CAC5C,SAAS,EAAE,IAAI,MAAM,IAAI,EAAE,IAAI,MAAM,KAAK,CAAC;IACzD,OAAO;KAAE,GAAG;KAAG,UAAU,SAAS,KAAK,QAAQ,GAAG,GAAG,GAAG,GAAG,CAAC;IAAE;GAChE,CAAC,CACH;GAGF,MAAM,QAAQ,IAAI,KAAa,CAAC;GAChC,KAAK,MAAM,KAAK,YAAY,MAAM,KAAK,EAAE,UAAU,EAAE,EAAE;GACvD,KAAK,MAAM,KAAK,QAAQ,OAAO,GAAG,MAAM,KAAK,EAAE,OAAO,EAAE,IAAI;GAC5D,OAAO,MAAM,OAAO,CAAC,CAAC,KAAK,OAAO;IAAE,IAAI,EAAE;IAAM,UAAU,EAAE;GAAM,EAAE;EACtE,CAAC;CACH;;CAGA,MAAM,WAAW,KAAmD;EAClE,KAAK,aAAa;EAClB,IAAI,QAAQ,QAAQ;EACpB,OAAO,KAAK,MAAM,OAAO,aAAa;GACpC,MAAM,sBAAM,IAAI,IAA0B;GAC1C,MAAM,OAAO,MAAM,KAAK,aAAa,GAAG;GACxC,MAAM,yBAAS,IAAI,IAAyB;GAC5C,KAAK,MAAM,CAAC,IAAI,QAAQ,MAAM;IAC5B,IAAI,QAAQ,GAAG;KACb,MAAM,QAAQ,KAAK,MAAM,IAAI,EAAE;KAC/B,IAAI,OAAO,IAAI,IAAI,IAAI,MAAM,OAAO,MAAM,CAAC;KAC3C;IACF;IACA,MAAM,MAAM,OAAO,IAAI,GAAG,qBAAK,IAAI,IAAY;IAC/C,IAAI,IAAI,EAAE;IACV,OAAO,IAAI,KAAK,GAAG;GACrB;GACA,KAAK,MAAM,OAAO,UAAU;IAC1B,MAAM,MAAM,OAAO,IAAI,IAAI,GAAG;IAC9B,IAAI,CAAC,KAAK;IACV,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,SAAS,IAAI,OAAO,GAAG,KAAK;KAClD,IAAI,IAAI,OAAO,OAAO,GAAG;KACzB,MAAM,CAAC,QAAS,MAAM,KAAK,OAAO,MAAM,KAAK,CAAC,CAAC,CAAC;KAChD,IAAI,SAA8B;KAClC,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,QAAQ,KAAK;MACxC,MAAM,KAAK,KAAK,IAAI;MACpB,IAAI,CAAC,IAAI,IAAI,EAAE,GAAG;MAClB,WAAW,MAAM,KAAK,OAAO,OAAO,KAAK,CAAC;MAC1C,IAAI,IAAI,IAAI,OAAO,MAAM,IAAI,KAAK,OAAO,IAAI,KAAK,KAAK,IAAI,CAAC;MAC5D,IAAI,OAAO,EAAE;KACf;IACF;GACF;GACA,OAAO;EACT,CAAC;CACH;;CAKA,MAAM,UAA2B;EAC/B,KAAK,aAAa;EAClB,OAAO,KAAK,aAAa,YAAY;GACnC,MAAM,WAAW,MAAM,KAAK,WAAW,aAAa;IAClD,QAAQ,KAAK,OAAO;IACpB,SAAS,CAAC,GAAG,KAAK,MAAM,QAAQ,CAAC;GACnC,EAAE;GACF,IAAI,SAAS,QAAQ,WAAW,GAAG,OAAO;GAE1C,MAAM,IAAI,SAAS,QAAQ;GAC3B,MAAM,MAAM,IAAI,aAAa,CAAC;GAC9B,MAAM,UAAU,IAAI,aAAa,IAAI,KAAK,IAAI;GAC9C,SAAS,QAAQ,SAAS,CAAC,IAAI,IAAI,MAAM;IACvC,IAAI,KAAK;IACT,QAAQ,IAAI,EAAE,QAAQ,IAAI,KAAK,IAAI;GACrC,CAAC;GACD,MAAM,QAAQ,KAAK,OAAO,KAAK,OAAO;GAEtC,MAAM,KAAK,iBACT,KAAK,cAAc,YAAY;IAC7B,MAAM,MAAM,KAAK,OAAO,OAAO,CAAC;IAChC,MAAM,OAAc;KAClB,GAAG,KAAK;KACR,SAAS,IAAI,MAAM;KACnB,UAAU,CAAC,GAAG,KAAK,OAAO,UAAU,GAAG;IACzC;IACA,MAAM,EAAE,KAAK,MAAM,SAAS,KAAK;IACjC,MAAM,cAAc,KAAK,KAAK,OAAO,OAAO;KAC1C,MAAM,KAAK,OAAO,MAAM,IAAI,IAAI,KAAK,KAAK;KAC1C,MAAM,GAAG,MACP,UAAU,KAAK;yCACY,KAAK,mBAChC,CAAC,IAAI,KAAK,SAAS,MAAM,CAC3B;KACA,MAAM,GAAG,MAAM,eAAe,KAAK,kBAAkB,CAAC,SAAS,MAAM,CAAC;KACtE,MAAM,KAAK,WAAW,IAAI,IAAI;IAChC,CAAC;IACD,KAAK,SAAS;IACd,KAAK,MAAM,CAAC,IAAI,MAAM,KAAK,OAAO,IAAI,EAAE,OAAO,SAAS,QAAQ,KAAK,MAAM,OAAO,EAAE;IACpF,KAAK,YAAY,CAAC,GAAG,KAAK,WAAW,KAAK,WAAW,KAAK,KAAK,CAAC;GAClE,CAAC,CACH;GACA,OAAO;EACT,CAAC;CACH;;;;;CAMA,MAAM,QAAyB;EAC7B,KAAK,aAAa;EAClB,OAAO,KAAK,aAAa,YAAY;GACnC,MAAM,MAAM,KAAK;GACjB,IAAI,IAAI,WAAW,GAAG,OAAO;GAC7B,MAAM,UAAU,IAAI,KAAK,MAAM,EAAE,GAAG;GAEpC,MAAM,SAAmB,CAAC;GAC1B,MAAM,SAAyB,CAAC;GAChC,KAAK,MAAM,OAAO,KAChB,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,OAAO,KAAK;IAClC,IAAI,IAAI,OAAO,OAAO,GAAG;IACzB,MAAM,CAAC,QAAS,MAAM,KAAK,OAAO,MAAM,KAAK,CAAC,CAAC,CAAC;IAChD,MAAM,SAAS,MAAM,KAAK,OAAO,OAAO,KAAK,CAAC;IAC9C,MAAM,OAAO,MAAM,KAAK,aAAa,MAAM,KAAK,KAAK,GAAG,CAAC;IACzD,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,QAAQ,KAAK;KACxC,MAAM,KAAK,KAAK,IAAI;KACpB,IAAI,KAAK,IAAI,EAAE,MAAM,IAAI,KAAK;KAC9B,OAAO,KAAK,EAAE;KACd,OAAO,KAAK,OAAO,SAAS,IAAI,KAAK,OAAO,IAAI,KAAK,KAAK,IAAI,CAAC;IACjE;GACF;GAGF,MAAM,IAAI,OAAO;GACjB,MAAM,UAAU,IAAI,aAAa,IAAI,KAAK,IAAI;GAC9C,OAAO,SAAS,GAAG,MAAM;IACvB,QAAQ,IAAI,GAAG,IAAI,KAAK,IAAI;GAC9B,CAAC;GACD,MAAM,QAAQ,IAAI,IAAI,KAAK,OAAO,aAAa,KAAK,MAAM,GAAG,OAAO,IAAI;GAExE,MAAM,KAAK,iBACT,KAAK,cAAc,YAAY;IAC7B,MAAM,MAAM,QAAQ,KAAK,OAAO,OAAO,CAAC,IAAI;IAC5C,MAAM,OAAO,KAAK,OAAO,SAAS,QAAQ,MAAM,CAAC,QAAQ,SAAS,EAAE,GAAG,CAAC;IACxE,MAAM,OAAc;KAClB,GAAG,KAAK;KACR,SAAS,MAAM,IAAI,MAAM,IAAI,KAAK,OAAO;KACzC,UAAU,MAAM,CAAC,GAAG,MAAM,GAAG,IAAI;IACnC;IACA,MAAM,cAAc,KAAK,KAAK,OAAO,OAAO;KAC1C,IAAI,OAAO,OAAO;MAChB,MAAM,KAAK,OAAO,MAAM,IAAI,IAAI,KAAK,KAAK;MAC1C,MAAM,GAAG,MACP,UAAU,KAAK,GAAG,IAAI,6DACtB,CAAC,IAAI,KAAK,KAAK,UAAU,OAAO,CAAC,CACnC;KACF;KACA,MAAM,KAAK,WAAW,IAAI,IAAI;IAChC,CAAC;IACD,KAAK,SAAS;IACd,KAAK,YAAY,CACf,GAAG,KAAK,UAAU,QAAQ,MAAM,CAAC,QAAQ,SAAS,EAAE,GAAG,CAAC,GACxD,GAAI,OAAO,QAAQ,CAAC,KAAK,WAAW,KAAK,KAAK,CAAC,IAAI,CAAC,CACtD;IACA,KAAK,SAAS,KAAK,GAAG,GAAG;GAC3B,CAAC,CACH;GACA,MAAM,KAAK,MAAM;GACjB,OAAO;EACT,CAAC;CACH;;CAGA,MAAM,WAA0B;EAC9B,MAAM,KAAK,QAAQ;EACnB,MAAM,KAAK,MAAM;CACnB;CAIA,OAAO,KAAmB,SAAqC;EAC7D,OAAO,aAAa;GAClB,MAAM,KAAK;GACX,QAAQ,KAAK;GACb;GACA;GACA,OAAO,KAAK,SAAS,IAAI,MAAM;EACjC,CAAC;CACH;CAEA,OAAO,OAAqB,OAA2B;EACrD,OAAO;GAAE,KAAK,KAAK,OAAO;GAAS;GAAO,OAAO,MAAM;EAAM;CAC/D;CAEA,WAAW,KAAiB,OAAmC;EAC7D,OAAO,IAAI,aAAa,IAAI,KAAK,KAAK,MAAM,KAAK,QAAQ,MAAM,WAAW,MAAM,MAAM;CACxF;CAEA,MAAM,aAAa,KAA6C;EAC9D,MAAM,sBAAM,IAAI,IAAoB;EACpC,MAAM,SAAS,CAAC,GAAG,IAAI,IAAI,GAAG,CAAC;EAC/B,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,gBAAgB;GACtD,MAAM,OAAO,MAAM,KAAK,IAAI,MAC1B,uBAAuB,KAAK,GAAG,IAAI,gDACnC,CAAC,KAAK,UAAU,OAAO,MAAM,GAAG,IAAI,cAAc,CAAC,CAAC,CACtD;GACA,KAAK,MAAM,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,EAAE,GAAG,OAAO,EAAE,GAAG,CAAC;EAC3D;EACA,OAAO;CACT;CAEA,MAAM,WAAW,IAAQ,OAA6B;EACpD,MAAM,GAAG,MACP,eAAe,KAAK,GAAG,KAAK;qDAE5B,CAAC,KAAK,UAAU,KAAK,CAAC,CACxB;CACF;;CAGA,MAAM,QAAuB;EAC3B,MAAM,QAAQ,KAAK,SAAS,QAAQ,OAAO,KAAK,MAAM,IAAI,CAAC,KAAK,OAAO,CAAC;EACxE,IAAI,MAAM,WAAW,GAAG;EACxB,KAAK,WAAW,KAAK,SAAS,QAAQ,MAAM,CAAC,MAAM,SAAS,CAAC,CAAC;EAC9D,KAAK,MAAM,KAAK,OAAO,KAAK,MAAM,OAAO,CAAC;EAC1C,MAAM,OAAO,MAAM,KAAK,MAAM,EAAE,GAAG;EACnC,MAAM,cAAc,KAAK,MAAM,OAAO,KAAK,OAAO,KAAK,IAAI,IAAI,CAAC;CAClE;;;;;;CAOA,MAAM,MAAS,MAA4D;EACzE,KAAK,IAAI,UAAU,IAAK,WAAW;GACjC,MAAM,QAAQ,KAAK;GACnB,MAAM,WAAW,KAAK;GACtB,KAAK,MAAM,KAAK,UAAU,KAAK,MAAM,IAAI,IAAI,KAAK,MAAM,IAAI,CAAC,KAAK,KAAK,CAAC;GACxE,IAAI;IACF,MAAM,SAAS,MAAM,KAAK,QAAQ;IAClC,IAAI,YAAY,KAAM,QAAQ,MAAM,KAAK,UAAU,KAAK,QAAS,OAAO;GAC1E,UAAU;IACR,KAAK,MAAM,KAAK,UAAU,KAAK,MAAM,IAAI,IAAI,KAAK,MAAM,IAAI,CAAC,KAAK,KAAK,CAAC;IACxE,KAAU,MAAM,CAAC,CAAC,YAAY,CAAC,CAAC;GAClC;EACF;CACF;;CAGA,MAAM,cAAc,IAAwC;EAC1D,KAAK;EACL,IAAI;GACF,MAAM,GAAG;EACX,UAAU;GACR,KAAK;EACP;CACF;CAEA,WAAc,IAAkC;EAC9C,MAAM,MAAM,KAAK,OAAO,KAAK,IAAI,EAAE;EACnC,KAAK,SAAS,IAAI,YAAY,CAAC,CAAC;EAChC,OAAO;CACT;CAEA,MAAM,aAAgB,IAAkC;EACtD,IAAI,KAAK,cAAc,MAAM,IAAI,MAAM,gDAAgD;EACvF,KAAK,eAAe;EACpB,IAAI;GACF,OAAO,MAAM,GAAG;EAClB,UAAU;GACR,KAAK,eAAe;EACtB;CACF;CAEA,eAAe;EACb,IAAI,CAAC,KAAK,QAAQ,MAAM,IAAI,MAAM,iCAAiC;CACrE;AACF;AAEA,SAAS,SAAS,IAAY;CAC5B,IAAI,CAAC,OAAO,cAAc,EAAE,GAC1B,MAAM,IAAI,MAAM,gDAAgD,IAAI;AACxE;;AAGA,eAAsB,gBAAgB,IAAQ,QAA+B;CAC3E,IAAI,CAAC,2BAA2B,KAAK,MAAM,GACzC,MAAM,IAAI,MAAM,4BAA4B,QAAQ;CACtD,MAAM,cAAc,IAAI,OAAO,OAAO;EACpC,KAAK,MAAM,KAAK;GAAC;GAAQ;GAAO;GAAQ;GAAa;GAAO;EAAK,GAC/D,MAAM,GAAG,KAAK,wBAAwB,SAAS,GAAG;CAEtD,CAAC;AACH"}
1
+ {"version":3,"file":"vector.mjs","names":[],"sources":["../src/vector/math.ts","../src/vector/kmeans.ts","../src/vector/segment.ts","../src/vector/types.ts","../src/vector/sql-segment-store.ts","../src/vector/vector-index.ts"],"sourcesContent":["import type { Metric } from \"./types.js\";\n\nexport function normalize(v: Float32Array): Float32Array {\n let n = 0;\n for (let i = 0; i < v.length; i++) n += v[i] * v[i];\n n = Math.sqrt(n);\n const out = new Float32Array(v.length);\n if (n === 0) return out;\n for (let i = 0; i < v.length; i++) out[i] = v[i] / n;\n return out;\n}\n\n/** Vectors are stored pre-normalized for cosine, so cosine reduces to dot. */\nexport function prepare(v: ArrayLike<number>, dims: number, metric: Metric): Float32Array {\n if (v.length !== dims) throw new Error(`vector-index: expected ${dims} dims, got ${v.length}`);\n const f = v instanceof Float32Array ? v : Float32Array.from(v);\n for (let i = 0; i < f.length; i++) {\n if (!Number.isFinite(f[i])) throw new Error(\"vector-index: vector contains a non-finite value\");\n }\n return metric === \"cosine\" ? normalize(f) : f.slice();\n}\n\n/** Distance between two float vectors at offsets; lower is closer. */\nexport function distance(\n metric: Metric,\n a: Float32Array,\n ao: number,\n b: Float32Array,\n bo: number,\n d: number,\n): number {\n if (metric === \"l2\") {\n let s = 0;\n for (let i = 0; i < d; i++) {\n const x = a[ao + i] - b[bo + i];\n s += x * x;\n }\n return s;\n }\n let s = 0;\n for (let i = 0; i < d; i++) s += a[ao + i] * b[bo + i];\n return metric === \"cosine\" ? 1 - s : -s;\n}\n\n// ------------------------------------------------------------ int8\n\n/** Symmetric per-vector int8: x ≈ q * scale / 127. Returns the scale. */\nexport function quantizeInt8(v: Float32Array, vo: number, d: number, out: Int8Array, oo: number) {\n let max = 0;\n for (let i = 0; i < d; i++) max = Math.max(max, Math.abs(v[vo + i]));\n const inv = max === 0 ? 0 : 127 / max;\n for (let i = 0; i < d; i++) out[oo + i] = Math.round(v[vo + i] * inv);\n return max;\n}\n\n/** Distance between a float query and an int8-coded vector. */\nexport function distanceInt8(\n metric: Metric,\n q: Float32Array,\n codes: Int8Array,\n co: number,\n scale: number,\n d: number,\n): number {\n const f = scale / 127;\n if (metric === \"l2\") {\n let s = 0;\n for (let i = 0; i < d; i++) {\n const x = q[i] - codes[co + i] * f;\n s += x * x;\n }\n return s;\n }\n let s = 0;\n for (let i = 0; i < d; i++) s += q[i] * codes[co + i];\n s *= f;\n return metric === \"cosine\" ? 1 - s : -s;\n}\n\n// ------------------------------------------------------------ 1-bit\n\nexport const wordsFor = (d: number) => (d + 31) >>> 5;\n\n/** Sign bits of (v - centroid): residual binarization, meaningful for every metric. */\nexport function residualBits(\n v: Float32Array,\n vo: number,\n c: Float32Array,\n co: number,\n d: number,\n out: Uint32Array,\n oo: number,\n) {\n const w = wordsFor(d);\n out.fill(0, oo, oo + w);\n for (let i = 0; i < d; i++) {\n if (v[vo + i] > c[co + i]) out[oo + (i >>> 5)] |= 1 << (i & 31);\n }\n}\n\nexport function hamming(a: Uint32Array, b: Uint32Array, bo: number, w: number): number {\n let n = 0;\n for (let i = 0; i < w; i++) {\n let x = a[i] ^ b[bo + i];\n x -= (x >>> 1) & 0x55555555;\n x = (x & 0x33333333) + ((x >>> 2) & 0x33333333);\n n += Math.imul((x + (x >>> 4)) & 0x0f0f0f0f, 0x01010101) >>> 24;\n }\n return n;\n}\n\n// ------------------------------------------------------------ top-k\n\n/** Keeps the `k` smallest scores. A binary max-heap over parallel arrays. */\nexport class TopK<T> {\n readonly #k: number;\n readonly #scores: number[] = [];\n readonly #items: T[] = [];\n\n constructor(k: number) {\n this.#k = Math.max(0, k);\n }\n\n get size() {\n return this.#scores.length;\n }\n\n /** The score a new item must beat, or Infinity while not full. */\n get bound() {\n return this.#scores.length < this.#k ? Number.POSITIVE_INFINITY : this.#scores[0];\n }\n\n push(score: number, item: T) {\n if (this.#k === 0) return;\n const s = this.#scores;\n const it = this.#items;\n if (s.length < this.#k) {\n s.push(score);\n it.push(item);\n let i = s.length - 1;\n while (i > 0) {\n const p = (i - 1) >> 1;\n if (s[p] >= s[i]) break;\n this.#swap(i, p);\n i = p;\n }\n return;\n }\n if (score >= s[0]) return;\n s[0] = score;\n it[0] = item;\n let i = 0;\n for (;;) {\n const l = 2 * i + 1;\n const r = l + 1;\n let m = i;\n if (l < s.length && s[l] > s[m]) m = l;\n if (r < s.length && s[r] > s[m]) m = r;\n if (m === i) break;\n this.#swap(i, m);\n i = m;\n }\n }\n\n /** Ascending by score. */\n sorted(): { score: number; item: T }[] {\n return this.#scores\n .map((score, i) => ({ score, item: this.#items[i] }))\n .sort((a, b) => a.score - b.score);\n }\n\n #swap(i: number, j: number) {\n const s = this.#scores;\n const it = this.#items;\n [s[i], s[j]] = [s[j], s[i]];\n [it[i], it[j]] = [it[j], it[i]];\n }\n}\n","import { distance, normalize } from \"./math.js\";\nimport type { Metric } from \"./types.js\";\n\nexport interface KMeansOptions {\n iterations?: number;\n /** Training points drawn from the data. Default min(n, 32 * k, 25_000). */\n sampleSize?: number;\n seed?: number;\n}\n\n/** Small deterministic PRNG so segment builds are reproducible. */\nexport function mulberry32(seed: number) {\n let a = seed >>> 0;\n return () => {\n a = (a + 0x6d2b79f5) >>> 0;\n let t = a;\n t = Math.imul(t ^ (t >>> 15), t | 1);\n t ^= t + Math.imul(t ^ (t >>> 7), t | 61);\n return ((t ^ (t >>> 14)) >>> 0) / 4294967296;\n };\n}\n\n/** Index of the closest centroid. */\nexport function nearest(\n metric: Metric,\n data: Float32Array,\n offset: number,\n centroids: Float32Array,\n k: number,\n d: number,\n): number {\n let best = 0;\n let bestD = Number.POSITIVE_INFINITY;\n // Centroids are compared with l2 for l2, and with dot otherwise (spherical k-means).\n const m: Metric = metric === \"l2\" ? \"l2\" : \"dot\";\n for (let c = 0; c < k; c++) {\n const dist = distance(m, data, offset, centroids, c * d, d);\n if (dist < bestD) {\n bestD = dist;\n best = c;\n }\n }\n return best;\n}\n\n/**\n * k-means++ seeding plus Lloyd iterations on a sample. `data` is n × d, flat.\n * For cosine and dot, centroids are re-normalized (spherical k-means).\n */\nexport function kmeans(\n data: Float32Array,\n n: number,\n d: number,\n k: number,\n metric: Metric,\n opts: KMeansOptions = {},\n): Float32Array {\n const rand = mulberry32(opts.seed ?? 42);\n k = Math.max(1, Math.min(k, n));\n const sampleSize = Math.min(n, opts.sampleSize ?? Math.min(32 * k, 25_000));\n\n // Reservoir-free sample: a partial Fisher–Yates over indices.\n const idx = new Uint32Array(n);\n for (let i = 0; i < n; i++) idx[i] = i;\n for (let i = 0; i < sampleSize; i++) {\n const j = i + Math.floor(rand() * (n - i));\n [idx[i], idx[j]] = [idx[j], idx[i]];\n }\n const sample = new Float32Array(sampleSize * d);\n for (let i = 0; i < sampleSize; i++) sample.set(data.subarray(idx[i] * d, idx[i] * d + d), i * d);\n\n const spherical = metric !== \"l2\";\n const centroids = new Float32Array(k * d);\n\n // k-means++ with squared l2 on the sample.\n centroids.set(sample.subarray(0, d), 0);\n const minD = new Float64Array(sampleSize).fill(Number.POSITIVE_INFINITY);\n for (let c = 1; c < k; c++) {\n let total = 0;\n for (let i = 0; i < sampleSize; i++) {\n const dd = distance(\"l2\", sample, i * d, centroids, (c - 1) * d, d);\n if (dd < minD[i]) minD[i] = dd;\n total += minD[i];\n }\n let r = rand() * total;\n let pick = sampleSize - 1;\n for (let i = 0; i < sampleSize; i++) {\n r -= minD[i];\n if (r <= 0) {\n pick = i;\n break;\n }\n }\n centroids.set(sample.subarray(pick * d, pick * d + d), c * d);\n }\n\n const assign = new Uint32Array(sampleSize);\n const counts = new Uint32Array(k);\n const iterations = opts.iterations ?? 10;\n for (let it = 0; it < iterations; it++) {\n let moved = 0;\n for (let i = 0; i < sampleSize; i++) {\n const c = nearest(metric, sample, i * d, centroids, k, d);\n if (c !== assign[i] || it === 0) moved++;\n assign[i] = c;\n }\n const sums = new Float64Array(k * d);\n counts.fill(0);\n for (let i = 0; i < sampleSize; i++) {\n const c = assign[i];\n counts[c]++;\n for (let j = 0; j < d; j++) sums[c * d + j] += sample[i * d + j];\n }\n for (let c = 0; c < k; c++) {\n if (counts[c] === 0) {\n // Re-seed an empty cluster with a random sample point.\n const p = Math.floor(rand() * sampleSize);\n centroids.set(sample.subarray(p * d, p * d + d), c * d);\n continue;\n }\n for (let j = 0; j < d; j++) centroids[c * d + j] = sums[c * d + j] / counts[c];\n }\n if (spherical) {\n for (let c = 0; c < k; c++) {\n centroids.set(normalize(centroids.subarray(c * d, c * d + d)), c * d);\n }\n }\n if (it > 0 && moved === 0) break;\n }\n return centroids;\n}\n","import { kmeans, nearest } from \"./kmeans.js\";\nimport {\n distance,\n distanceInt8,\n hamming,\n quantizeInt8,\n residualBits,\n TopK,\n wordsFor,\n} from \"./math.js\";\nimport type { Metric } from \"./types.js\";\n\n/**\n * An IVF segment as storage-neutral parts. This module does no I/O; a store\n * decides where the parts live.\n *\n * per list: a centroid f32[dims] and a row count\n * per list, the searchable block (little-endian, each section padded to 8 bytes):\n * ids f64[count] | bits u32[count × words] | rnorm f32[count] | cdot f32[count]\n * scales f32[count] | codes i8[count × dims]\n * per list, the float block f32[count × dims] (exact re-rank, lossless merge, read-back)\n *\n * bits = signs of the residual r = x - c (c = the list centroid)\n * rnorm = |r|, cdot = c·r. With them the 1-bit stage estimates the real\n * metric, RaBitQ-style: r_q·r ≈ |r_q| |r| cos(π · hamming / dims).\n */\nconst align8 = (n: number) => (n + 7) & ~7;\n\nexport interface ListLayout {\n count: number;\n idsAt: number;\n bitsAt: number;\n rnormAt: number;\n cdotAt: number;\n scalesAt: number;\n codesAt: number;\n /** Bytes of the searchable block. */\n length: number;\n}\n\nexport function listLayout(count: number, dims: number): ListLayout {\n const w = wordsFor(dims);\n const idsAt = 0;\n const bitsAt = align8(idsAt + 8 * count);\n const rnormAt = align8(bitsAt + 4 * w * count);\n const cdotAt = align8(rnormAt + 4 * count);\n const scalesAt = align8(cdotAt + 4 * count);\n const codesAt = align8(scalesAt + 4 * count);\n const length = align8(codesAt + dims * count);\n return { count, idsAt, bitsAt, rnormAt, cdotAt, scalesAt, codesAt, length };\n}\n\n// ------------------------------------------------------------------ build\n\nexport interface BuildInput {\n dims: number;\n metric: Metric;\n ids: Float64Array;\n /** n × dims, already prepared (normalized for cosine). */\n vectors: Float32Array;\n nlist?: number;\n seed?: number;\n}\n\nexport interface BuiltSegment {\n nlist: number;\n counts: Uint32Array;\n /** nlist × dims */\n centroids: Float32Array;\n /** Searchable block per list. */\n lists: Uint8Array[];\n /** Float32 block per list. */\n floats: Uint8Array[];\n}\n\n/** Below this size a segment is a single flat list: training would not pay off. */\nexport const MIN_TRAIN = 2048;\n\nexport function defaultNlist(n: number) {\n if (n < MIN_TRAIN) return 1;\n return Math.max(1, Math.min(1024, Math.round(Math.sqrt(n))));\n}\n\nexport function buildSegment(input: BuildInput): BuiltSegment {\n const { dims: d, metric, ids, vectors } = input;\n const n = ids.length;\n const nlist = Math.max(1, Math.min(input.nlist ?? defaultNlist(n), Math.max(1, n)));\n\n let centroids: Float32Array;\n if (nlist === 1) {\n centroids = new Float32Array(d);\n for (let i = 0; i < n; i++) for (let j = 0; j < d; j++) centroids[j] += vectors[i * d + j];\n if (n > 0) for (let j = 0; j < d; j++) centroids[j] /= n;\n } else {\n centroids = kmeans(vectors, n, d, nlist, metric, { seed: input.seed });\n }\n\n const assign = new Uint32Array(n);\n const counts = new Uint32Array(nlist);\n for (let i = 0; i < n; i++) {\n const c = nlist === 1 ? 0 : nearest(metric, vectors, i * d, centroids, nlist, d);\n assign[i] = c;\n counts[c]++;\n }\n\n const w = wordsFor(d);\n const layouts = Array.from(counts, (count) => listLayout(count, d));\n const lists = layouts.map((l) => new Uint8Array(l.length));\n const floats = Array.from(counts, (count) => new Uint8Array(4 * count * d));\n const views = layouts.map((l, c) => {\n const buf = lists[c].buffer;\n return {\n ids: new Float64Array(buf, l.idsAt, l.count),\n bits: new Uint32Array(buf, l.bitsAt, l.count * w),\n rnorm: new Float32Array(buf, l.rnormAt, l.count),\n cdot: new Float32Array(buf, l.cdotAt, l.count),\n scales: new Float32Array(buf, l.scalesAt, l.count),\n codes: new Int8Array(buf, l.codesAt, l.count * d),\n floats: new Float32Array(floats[c].buffer, 0, l.count * d),\n };\n });\n\n const fill = new Uint32Array(nlist);\n for (let i = 0; i < n; i++) {\n const c = assign[i];\n const j = fill[c]++;\n const v = views[c];\n v.ids[j] = ids[i];\n residualBits(vectors, i * d, centroids, c * d, d, v.bits, j * w);\n const [rn, cd] = residualStats(vectors, i * d, centroids, c * d, d);\n v.rnorm[j] = rn;\n v.cdot[j] = cd;\n v.scales[j] = quantizeInt8(vectors, i * d, d, v.codes, j * d);\n v.floats.set(vectors.subarray(i * d, i * d + d), j * d);\n }\n return { nlist, counts, centroids, lists, floats };\n}\n\n/** [|x - c|, c·(x - c)] */\nfunction residualStats(x: Float32Array, xo: number, c: Float32Array, co: number, d: number) {\n let nn = 0;\n let cd = 0;\n for (let i = 0; i < d; i++) {\n const r = x[xo + i] - c[co + i];\n nn += r * r;\n cd += c[co + i] * r;\n }\n return [Math.sqrt(nn), cd];\n}\n\n// ------------------------------------------------------------------ read\n\nexport interface ListData {\n ids: Float64Array;\n bits: Uint32Array;\n rnorm: Float32Array;\n cdot: Float32Array;\n scales: Float32Array;\n codes: Int8Array;\n}\n\n/** Typed views over a searchable block (copied only when it does not start at offset 0). */\nexport function parseList(bytes: Uint8Array, count: number, dims: number): ListData {\n const l = listLayout(count, dims);\n if (bytes.byteLength !== l.length) {\n throw new Error(`vector-index: list block has ${bytes.byteLength} bytes, expected ${l.length}`);\n }\n const buf = bytes.byteOffset === 0 ? bytes.buffer : bytes.slice().buffer;\n const w = wordsFor(dims);\n return {\n ids: new Float64Array(buf, l.idsAt, count),\n bits: new Uint32Array(buf, l.bitsAt, count * w),\n rnorm: new Float32Array(buf, l.rnormAt, count),\n cdot: new Float32Array(buf, l.cdotAt, count),\n scales: new Float32Array(buf, l.scalesAt, count),\n codes: new Int8Array(buf, l.codesAt, count * dims),\n };\n}\n\nexport interface Candidate {\n list: number;\n row: number;\n id: number;\n}\n\n/** The in-memory part of a segment: centroids and list sizes. List blocks are fetched by the caller. */\nexport class SegmentIndex {\n constructor(\n readonly gen: number,\n readonly dims: number,\n readonly metric: Metric,\n readonly centroids: Float32Array,\n readonly counts: Uint32Array,\n ) {}\n\n get nlist() {\n return this.counts.length;\n }\n\n /** The `nprobe` non-empty lists whose centroids are closest to the query. */\n probe(query: Float32Array, nprobe: number): number[] {\n const m: Metric = this.metric === \"l2\" ? \"l2\" : \"dot\";\n const top = new TopK<number>(Math.min(nprobe, this.nlist));\n for (let c = 0; c < this.nlist; c++) {\n if (this.counts[c] === 0) continue;\n top.push(distance(m, query, 0, this.centroids, c * this.dims, this.dims), c);\n }\n return top.sorted().map((e) => e.item);\n }\n\n /**\n * Stage 1: the `limit` rows of a list with the best estimated distance, from\n * residual sign bits plus the stored residual norm and centroid projection.\n */\n filterList(\n query: Float32Array,\n c: number,\n data: ListData,\n limit: number,\n keep?: (id: number) => boolean,\n ): Candidate[] {\n const d = this.dims;\n const w = wordsFor(d);\n const co = c * d;\n const qb = new Uint32Array(w);\n residualBits(query, 0, this.centroids, co, d, qb, 0);\n const [qn, qcd] = residualStats(query, 0, this.centroids, co, d);\n let cc = 0;\n for (let i = 0; i < d; i++) cc += this.centroids[co + i] * this.centroids[co + i];\n const qc = cc + qcd; // q·c\n const angle = Math.PI / d;\n const l2 = this.metric === \"l2\";\n const top = new TopK<Candidate>(limit);\n for (let r = 0; r < data.ids.length; r++) {\n const id = data.ids[r];\n if (keep && !keep(id)) continue;\n const rr = qn * data.rnorm[r] * Math.cos(angle * hamming(qb, data.bits, r * w, w));\n // q·x = q·c + c·r_x + r_q·r_x ; |q-x|² = |r_q|² + |r_x|² - 2 r_q·r_x\n const est = l2 ? qn * qn + data.rnorm[r] * data.rnorm[r] - 2 * rr : -(qc + data.cdot[r] + rr);\n if (est < top.bound) top.push(est, { list: c, row: r, id });\n }\n return top.sorted().map((e) => e.item);\n }\n\n /** Stage 2: approximate distance from the int8 codes. */\n scoreInt8(query: Float32Array, data: ListData, row: number): number {\n return distanceInt8(\n this.metric,\n query,\n data.codes,\n row * this.dims,\n data.scales[row],\n this.dims,\n );\n }\n}\n","export type Metric = \"cosine\" | \"dot\" | \"l2\";\n\nexport interface SearchHit {\n id: number;\n /** Lower is closer: 1 - cos for cosine, -dot for dot, squared L2 for l2. */\n distance: number;\n}\n\nexport interface SearchOptions {\n k?: number;\n /** IVF lists probed per segment. Default 8. */\n nprobe?: number;\n /** Candidates kept per probed list by the 1-bit filter = k * oversample. Default 8. */\n oversample?: number;\n /** Re-rank the int8 winners with the stored float32 vectors. Default false. */\n exact?: boolean;\n /** Keep only ids for which this returns true (applied before re-ranking). */\n filter?: (id: number) => boolean;\n signal?: AbortSignal;\n}\n\n/** An aligned Float32Array copy of BLOB bytes (views over arbitrary offsets are unsafe). */\nexport function toFloat32(bytes: Uint8Array): Float32Array {\n const copy = bytes.slice();\n return new Float32Array(copy.buffer, 0, copy.byteLength >> 2);\n}\n\nexport function float32Bytes(v: Float32Array): Uint8Array {\n return new Uint8Array(v.buffer, v.byteOffset, v.byteLength).slice();\n}\n","import type { Db } from \"@statewalker/db-api\";\nimport { type BuiltSegment, type ListData, parseList, SegmentIndex } from \"./segment.js\";\nimport { float32Bytes, type Metric, toFloat32 } from \"./types.js\";\n\n/**\n * Largest BLOB written in one row. Durable Object SQLite rejects values over\n * ~2 MB (\"string or blob too big\"); 1 MiB leaves headroom.\n */\nexport const PART_BYTES = 1024 * 1024;\n\nexport interface SegmentRef {\n gen: number;\n count: number;\n nlist: number;\n}\n\n/**\n * Segment rows: one centroid row per list, and each list's searchable and\n * float32 blocks split into parts. Reads go through an LRU cache: a\n * generation is immutable, so cached blocks never go stale.\n */\nexport class SqlSegmentStore {\n readonly #db: Db;\n readonly #dims: number;\n readonly #t: { centroids: string; seg: string; f32: string };\n readonly #cache: Lru<ListData | Float32Array>;\n\n constructor(db: Db, prefix: string, dims: number, cacheBytes = 64 * 1024 * 1024) {\n this.#db = db;\n this.#dims = dims;\n this.#t = { centroids: `${prefix}centroids`, seg: `${prefix}seg`, f32: `${prefix}f32` };\n this.#cache = new Lru(cacheBytes);\n }\n\n schema(): string[] {\n const { centroids, seg, f32 } = this.#t;\n return [\n `CREATE TABLE IF NOT EXISTS ${centroids}(gen INTEGER, list INTEGER, count INTEGER NOT NULL,\n centroid BLOB NOT NULL, PRIMARY KEY (gen, list)) WITHOUT ROWID`,\n `CREATE TABLE IF NOT EXISTS ${seg}(gen INTEGER, list INTEGER, part INTEGER,\n bytes BLOB NOT NULL, PRIMARY KEY (gen, list, part)) WITHOUT ROWID`,\n `CREATE TABLE IF NOT EXISTS ${f32}(gen INTEGER, list INTEGER, part INTEGER,\n bytes BLOB NOT NULL, PRIMARY KEY (gen, list, part)) WITHOUT ROWID`,\n ];\n }\n\n /** Writes every row of a built segment. Call inside `inTransaction`. */\n async write(tx: Db, gen: number, built: BuiltSegment): Promise<void> {\n const d = this.#dims;\n for (let c = 0; c < built.nlist; c++) {\n await tx.query(\n `INSERT INTO ${this.#t.centroids}(gen, list, count, centroid) VALUES (?, ?, ?, ?)`,\n [gen, c, built.counts[c], float32Bytes(built.centroids.subarray(c * d, (c + 1) * d))],\n );\n await writeParts(tx, this.#t.seg, gen, c, built.lists[c] as Uint8Array);\n await writeParts(tx, this.#t.f32, gen, c, built.floats[c] as Uint8Array);\n }\n }\n\n /** Loads the in-memory part (centroids, list sizes) of a committed segment. */\n async open(ref: SegmentRef, metric: Metric): Promise<SegmentIndex> {\n const d = this.#dims;\n const rows = await this.#db.query<{ list: number; count: number; centroid: Uint8Array }>(\n `SELECT list, count, centroid FROM ${this.#t.centroids} WHERE gen = ? ORDER BY list`,\n [ref.gen],\n );\n if (rows.length !== ref.nlist) {\n throw new Error(\n `vector-index: segment ${ref.gen} has ${rows.length} lists, expected ${ref.nlist}`,\n );\n }\n const centroids = new Float32Array(ref.nlist * d);\n const counts = new Uint32Array(ref.nlist);\n for (const r of rows) {\n const c = Number(r.list);\n centroids.set(toFloat32(r.centroid), c * d);\n counts[c] = Number(r.count);\n }\n return new SegmentIndex(ref.gen, d, metric, centroids, counts);\n }\n\n /** Searchable blocks of lists `cs`: cached ones from memory, the rest in one query. */\n async lists(seg: SegmentIndex, cs: number[]): Promise<ListData[]> {\n const out = new Map<number, ListData>();\n const missing: number[] = [];\n for (const c of cs) {\n const hit = this.#cache.get(`s:${seg.gen}:${c}`) as ListData | undefined;\n if (hit) out.set(c, hit);\n else missing.push(c);\n }\n if (missing.length > 0) {\n const blocks = await readParts(this.#db, this.#t.seg, seg.gen, missing);\n for (const c of missing) {\n const bytes = blocks.get(c) ?? new Uint8Array(0);\n const data = parseList(bytes, seg.counts[c] as number, this.#dims);\n this.#cache.set(`s:${seg.gen}:${c}`, data, bytes.byteLength);\n out.set(c, data);\n }\n }\n return cs.map((c) => out.get(c) as ListData);\n }\n\n /** Every float32 vector of list `c` (count × dims). */\n async floats(seg: SegmentIndex, c: number): Promise<Float32Array> {\n const key = `f:${seg.gen}:${c}`;\n const hit = this.#cache.get(key) as Float32Array | undefined;\n if (hit) return hit;\n const blocks = await readParts(this.#db, this.#t.f32, seg.gen, [c]);\n const floats = toFloat32(blocks.get(c) ?? new Uint8Array(0));\n this.#cache.set(key, floats, floats.byteLength);\n return floats;\n }\n\n /** Deletes the rows of `gens`. Call inside `inTransaction`. */\n async drop(tx: Db, gens: number[]): Promise<void> {\n const json = JSON.stringify(gens);\n for (const table of Object.values(this.#t)) {\n await tx.query(`DELETE FROM ${table} WHERE gen IN (SELECT value FROM json_each(?))`, [json]);\n }\n for (const gen of gens) this.#cache.deletePrefix(`s:${gen}:`, `f:${gen}:`);\n }\n\n /** Deletes rows of every generation not in `live` (left by a crash before a reap). */\n async sweep(tx: Db, live: number[]): Promise<void> {\n const json = JSON.stringify(live);\n for (const table of Object.values(this.#t)) {\n await tx.query(`DELETE FROM ${table} WHERE gen NOT IN (SELECT value FROM json_each(?))`, [\n json,\n ]);\n }\n }\n}\n\nasync function writeParts(tx: Db, table: string, gen: number, list: number, bytes: Uint8Array) {\n for (let part = 0, at = 0; at < bytes.byteLength; part++, at += PART_BYTES) {\n await tx.query(`INSERT INTO ${table}(gen, list, part, bytes) VALUES (?, ?, ?, ?)`, [\n gen,\n list,\n part,\n bytes.slice(at, at + PART_BYTES),\n ]);\n }\n}\n\n/** The joined parts of each list in `lists`, as fresh arrays starting at offset 0. */\nasync function readParts(\n db: Db,\n table: string,\n gen: number,\n lists: number[],\n): Promise<Map<number, Uint8Array>> {\n const rows = await db.query<{ list: number; bytes: Uint8Array }>(\n `SELECT list, bytes FROM ${table}\n WHERE gen = ? AND list IN (SELECT value FROM json_each(?)) ORDER BY list, part`,\n [gen, JSON.stringify(lists)],\n );\n const parts = new Map<number, Uint8Array[]>();\n for (const r of rows) {\n const list = Number(r.list);\n const acc = parts.get(list) ?? [];\n acc.push(r.bytes);\n parts.set(list, acc);\n }\n const out = new Map<number, Uint8Array>();\n for (const [list, ps] of parts) {\n const joined = new Uint8Array(ps.reduce((n, p) => n + p.byteLength, 0));\n let at = 0;\n for (const p of ps) {\n joined.set(p, at);\n at += p.byteLength;\n }\n out.set(list, joined);\n }\n return out;\n}\n\n/** Byte-budgeted LRU; Map order is LRU order (re-inserted on every hit). */\nclass Lru<V> {\n readonly #max: number;\n readonly #map = new Map<string, { value: V; size: number }>();\n #bytes = 0;\n\n constructor(maxBytes: number) {\n this.#max = maxBytes;\n }\n\n get(key: string): V | undefined {\n const e = this.#map.get(key);\n if (!e) return undefined;\n this.#map.delete(key);\n this.#map.set(key, e);\n return e.value;\n }\n\n set(key: string, value: V, size: number) {\n const old = this.#map.get(key);\n if (old) {\n this.#map.delete(key);\n this.#bytes -= old.size;\n }\n this.#map.set(key, { value, size });\n this.#bytes += size;\n for (const [k, e] of this.#map) {\n if (this.#bytes <= this.#max) break;\n this.#map.delete(k);\n this.#bytes -= e.size;\n }\n }\n\n deletePrefix(...prefixes: string[]) {\n for (const [k, e] of this.#map) {\n if (prefixes.some((p) => k.startsWith(p))) {\n this.#map.delete(k);\n this.#bytes -= e.size;\n }\n }\n }\n}\n","import type { Db } from \"@statewalker/db-api\";\nimport { inTransaction } from \"@statewalker/db-sqlite\";\nimport { PREFIX_PATTERN } from \"../prefix.js\";\nimport { distance, prepare, TopK } from \"./math.js\";\nimport {\n type BuiltSegment,\n buildSegment,\n type Candidate,\n type ListData,\n SegmentIndex,\n} from \"./segment.js\";\nimport { type SegmentRef, SqlSegmentStore } from \"./sql-segment-store.js\";\nimport {\n float32Bytes,\n type Metric,\n type SearchHit,\n type SearchOptions,\n toFloat32,\n} from \"./types.js\";\n\nexport interface VectorIndexOptions {\n db: Db;\n /** Table name prefix, e.g. \"vec_\". Letters, digits and underscores. */\n prefix: string;\n dims: number;\n metric?: Metric;\n /** IVF lists for a new segment of n vectors. Default ~sqrt(n), flat below 2048. */\n nlist?: (n: number) => number;\n /** Cache budget for list blocks read from SQLite, in bytes. Default 64 MiB. */\n cacheBytes?: number;\n /**\n * upsert() seals the tail into a segment once it holds this many vectors.\n * Default 4096: compacting a larger tail risks the 15 s operation deadline of\n * a Durable Object on celld. Infinity turns it off.\n */\n autoCompactAt?: number;\n}\n\nexport interface VectorItem {\n /** A safe integer: typically the rowid of your documents table. */\n id: number;\n vector: ArrayLike<number>;\n}\n\nexport interface VectorIndexStats {\n tail: number;\n segments: SegmentRef[];\n seq: number;\n}\n\ninterface State {\n seq: number;\n nextGen: number;\n segments: SegmentRef[];\n}\n\ninterface TailEntry {\n seq: number;\n vector: Float32Array;\n}\n\n/** Ids per lookup (bound as one JSON parameter). */\nconst VALIDATE_BATCH = 2000;\n/** Upserted rows per transaction. */\nconst WRITE_BATCH = 200;\n\n/**\n * An LSM-style vector index over a `Db`.\n *\n * - The mutable tail lives in `{p}tail`, mirrored in memory and searched exactly.\n * - `compact()` seals the tail into an immutable IVF segment (1-bit residual\n * filter → int8 re-rank → float32 re-rank on `exact`), written as rows in the\n * same transaction that moves the ids out of the tail.\n * - `{p}ids(id, gen)` says which generation holds the live copy of each id\n * (0 = tail). A segment hit counts only if its generation matches, so deletes\n * and overwrites never touch segment rows. `merge()` rewrites all segments\n * into one, dropping dead rows.\n *\n * One writer per database is assumed (a Durable Object, a worker, one tab);\n * within an instance, writes are serialized.\n */\nexport class VectorIndex {\n readonly dims: number;\n readonly metric: Metric;\n /** `{prefix}ids`: its `id` column holds exactly the live ids. Callers may join it in SQL. */\n readonly idTable: string;\n readonly #db: Db;\n readonly #store: SqlSegmentStore;\n readonly #nlist?: (n: number) => number;\n readonly #autoCompactAt: number;\n readonly #t: { meta: string; ids: string; tail: string };\n\n #state: State = { seq: 0, nextGen: 1, segments: [] };\n #tail = new Map<number, TailEntry>();\n #segments: SegmentIndex[] = [];\n #refs = new Map<SegmentIndex, number>();\n #retired: SegmentIndex[] = [];\n #queue: Promise<unknown> = Promise.resolve();\n #maintaining = false;\n #ready = false;\n /** Bumped before and after each commit that changes the segment list: odd while one runs. */\n #epoch = 0;\n\n constructor(opts: VectorIndexOptions) {\n if (!PREFIX_PATTERN.test(opts.prefix)) {\n throw new Error(`vector-index: bad prefix ${opts.prefix}`);\n }\n if (!Number.isInteger(opts.dims) || opts.dims < 1) {\n throw new Error(\"vector-index: dims must be a positive integer\");\n }\n this.dims = opts.dims;\n this.metric = opts.metric ?? \"cosine\";\n this.#db = opts.db;\n this.#store = new SqlSegmentStore(opts.db, opts.prefix, opts.dims, opts.cacheBytes);\n this.#nlist = opts.nlist;\n this.#autoCompactAt = opts.autoCompactAt ?? 4096;\n const p = opts.prefix;\n this.#t = { meta: `${p}meta`, ids: `${p}ids`, tail: `${p}tail` };\n this.idTable = this.#t.ids;\n }\n\n // ------------------------------------------------------------ lifecycle\n\n /** Creates tables if missing, loads state and sweeps rows of crashed maintenance. */\n async init(): Promise<void> {\n const { meta, ids, tail } = this.#t;\n for (const s of [\n `CREATE TABLE IF NOT EXISTS ${meta}(k TEXT PRIMARY KEY, v TEXT NOT NULL)`,\n `CREATE TABLE IF NOT EXISTS ${ids}(id INTEGER PRIMARY KEY, gen INTEGER NOT NULL)`,\n `CREATE INDEX IF NOT EXISTS ${ids}_gen ON ${ids}(gen)`,\n `CREATE TABLE IF NOT EXISTS ${tail}(id INTEGER PRIMARY KEY, seq INTEGER NOT NULL, vec BLOB NOT NULL)`,\n `CREATE INDEX IF NOT EXISTS ${tail}_seq ON ${tail}(seq)`,\n ...this.#store.schema(),\n ]) {\n await this.#db.exec(s);\n }\n\n const config = JSON.stringify({ dims: this.dims, metric: this.metric });\n await this.#db.query(\n `INSERT INTO ${meta}(k, v) VALUES ('config', ?) ON CONFLICT(k) DO NOTHING`,\n [config],\n );\n const [stored] = await this.#db.query<{ v: string }>(\n `SELECT v FROM ${meta} WHERE k = 'config'`,\n );\n if (stored?.v !== config) {\n throw new Error(`vector-index: tables were created with ${stored?.v}, not ${config}`);\n }\n await this.refresh();\n const live = this.#state.segments.map((s) => s.gen);\n await inTransaction(this.#db, (tx) => this.#store.sweep(tx, live));\n this.#ready = true;\n }\n\n /** Reloads state, tail and segments from storage (e.g. after another writer changed them). */\n async refresh(): Promise<void> {\n const [row] = await this.#db.query<{ v: string }>(\n `SELECT v FROM ${this.#t.meta} WHERE k = 'state'`,\n );\n const state: State = row ? JSON.parse(row.v) : { seq: 0, nextGen: 1, segments: [] };\n\n const tail = new Map<number, TailEntry>();\n const rows = await this.#db.query<{ id: number; seq: number; vec: Uint8Array }>(\n `SELECT id, seq, vec FROM ${this.#t.tail}`,\n );\n for (const r of rows) tail.set(Number(r.id), { seq: Number(r.seq), vector: toFloat32(r.vec) });\n\n const known = new Map(this.#segments.map((s) => [s.gen, s]));\n const segments = await Promise.all(\n state.segments.map((s) => known.get(s.gen) ?? this.#store.open(s, this.metric)),\n );\n this.#state = state;\n this.#tail = tail;\n this.#segments = segments;\n }\n\n get stats(): VectorIndexStats {\n return {\n tail: this.#tail.size,\n segments: this.#state.segments.map((s) => ({ ...s })),\n seq: this.#state.seq,\n };\n }\n\n // ------------------------------------------------------------ writes\n\n async upsert(items: VectorItem[]): Promise<void> {\n this.#assertReady();\n const prepared = items.map((it) => {\n assertId(it.id);\n return { id: it.id, vector: prepare(it.vector, this.dims, this.metric) };\n });\n const { tail, ids } = this.#t;\n for (let i = 0; i < prepared.length; i += WRITE_BATCH) {\n const batch = prepared.slice(i, i + WRITE_BATCH);\n await this.#exclusive(async () => {\n const seq = this.#state.seq + 1;\n const next = { ...this.#state, seq };\n await inTransaction(this.#db, async (tx) => {\n for (const { id, vector } of batch) {\n await tx.query(\n `INSERT INTO ${tail}(id, seq, vec) VALUES (?, ?, ?)\n ON CONFLICT(id) DO UPDATE SET seq = excluded.seq, vec = excluded.vec`,\n [id, seq, float32Bytes(vector)],\n );\n await tx.query(\n `INSERT INTO ${ids}(id, gen) VALUES (?, 0) ON CONFLICT(id) DO UPDATE SET gen = 0`,\n [id],\n );\n }\n await this.#saveState(tx, next);\n });\n this.#state = next;\n for (const { id, vector } of batch) this.#tail.set(id, { seq, vector });\n });\n if (this.#tail.size >= this.#autoCompactAt && !this.#maintaining) await this.compact();\n }\n }\n\n async delete(ids: number[]): Promise<void> {\n this.#assertReady();\n ids.forEach(assertId);\n await this.#exclusive(async () => {\n for (let i = 0; i < ids.length; i += VALIDATE_BATCH) {\n const chunk = ids.slice(i, i + VALIDATE_BATCH);\n const json = JSON.stringify(chunk);\n await inTransaction(this.#db, async (tx) => {\n await tx.query(\n `DELETE FROM ${this.#t.tail} WHERE id IN (SELECT value FROM json_each(?))`,\n [json],\n );\n await tx.query(\n `DELETE FROM ${this.#t.ids} WHERE id IN (SELECT value FROM json_each(?))`,\n [json],\n );\n });\n for (const id of chunk) this.#tail.delete(id);\n }\n });\n }\n\n // ------------------------------------------------------------ search\n\n async search(query: ArrayLike<number>, opts: SearchOptions = {}): Promise<SearchHit[]> {\n this.#assertReady();\n const k = opts.k ?? 10;\n const nprobe = opts.nprobe ?? 8;\n const perList = k * (opts.oversample ?? 8);\n const q = prepare(query, this.dims, this.metric);\n const d = this.dims;\n const filter = opts.filter;\n\n return this.#read(async (segments) => {\n // Tail: exact, from memory.\n const tailTop = new TopK<number>(k);\n for (const [id, { vector }] of this.#tail) {\n if (filter && !filter(id)) continue;\n tailTop.push(distance(this.metric, q, 0, vector, 0, d), id);\n }\n\n // Stage 1: probe lists, keep the best rows of each by estimated residual distance.\n type Hit = Candidate & { seg: SegmentIndex; data: ListData };\n const hits: Hit[] = [];\n // Tail ids are never live in a segment; skip them early.\n const keep = (id: number) => !this.#tail.has(id) && (!filter || filter(id));\n await Promise.all(\n segments.map(async (seg) => {\n const lists = seg.probe(q, nprobe);\n const datas = await this.#store.lists(seg, lists);\n opts.signal?.throwIfAborted();\n lists.forEach((c, i) => {\n const data = datas[i] as ListData;\n for (const cand of seg.filterList(q, c, data, perList, keep))\n hits.push({ ...cand, seg, data });\n });\n }),\n );\n\n // Liveness: a segment row counts only if its generation holds the live copy.\n const live = await this.#generations(hits.map((h) => h.id));\n\n // Stage 2: int8 re-rank.\n const rerank = opts.exact ? k * 4 : k;\n const segTop = new TopK<Hit>(rerank);\n for (const h of hits) {\n if (live.get(h.id) !== h.seg.gen) continue;\n segTop.push(h.seg.scoreInt8(q, h.data, h.row), h);\n }\n let segResults = segTop\n .sorted()\n .map((e) => ({ id: e.item.id, distance: e.score, hit: e.item }));\n\n // Stage 3: exact re-rank from stored floats.\n if (opts.exact) {\n segResults = await Promise.all(\n segResults.map(async (r) => {\n const all = await this.#store.floats(r.hit.seg, r.hit.list);\n const v = all.subarray(r.hit.row * d, (r.hit.row + 1) * d);\n return { ...r, distance: distance(this.metric, q, 0, v, 0, d) };\n }),\n );\n }\n\n const final = new TopK<number>(k);\n for (const r of segResults) final.push(r.distance, r.id);\n for (const e of tailTop.sorted()) final.push(e.score, e.item);\n return final.sorted().map((e) => ({ id: e.item, distance: e.score }));\n });\n }\n\n /** The stored vectors of the live `ids` (normalised for cosine); unknown or deleted ids are absent. */\n async getVectors(ids: number[]): Promise<Map<number, Float32Array>> {\n this.#assertReady();\n ids.forEach(assertId);\n return this.#read(async (segments) => {\n const out = new Map<number, Float32Array>();\n const gens = await this.#generations(ids);\n const wanted = new Map<number, Set<number>>(); // gen -> ids\n for (const [id, gen] of gens) {\n if (gen === 0) {\n const entry = this.#tail.get(id);\n if (entry) out.set(id, entry.vector.slice());\n continue;\n }\n const set = wanted.get(gen) ?? new Set<number>();\n set.add(id);\n wanted.set(gen, set);\n }\n for (const seg of segments) {\n const set = wanted.get(seg.gen);\n if (!set) continue;\n for (let c = 0; c < seg.nlist && set.size > 0; c++) {\n if (seg.counts[c] === 0) continue;\n const [data] = (await this.#store.lists(seg, [c])) as [ListData];\n let floats: Float32Array | null = null;\n for (let r = 0; r < data.ids.length; r++) {\n const id = data.ids[r] as number;\n if (!set.has(id)) continue;\n floats ??= await this.#store.floats(seg, c);\n out.set(id, floats.slice(r * this.dims, (r + 1) * this.dims));\n set.delete(id);\n }\n }\n }\n return out;\n });\n }\n\n // ------------------------------------------------------------ maintenance\n\n /** Seals the current tail into a new segment. Returns the number of vectors sealed. */\n async compact(): Promise<number> {\n this.#assertReady();\n return this.#maintenance(async () => {\n const snapshot = await this.#exclusive(async () => ({\n maxSeq: this.#state.seq,\n entries: [...this.#tail.entries()],\n }));\n if (snapshot.entries.length === 0) return 0;\n\n const n = snapshot.entries.length;\n const ids = new Float64Array(n);\n const vectors = new Float32Array(n * this.dims);\n snapshot.entries.forEach(([id, e], i) => {\n ids[i] = id;\n vectors.set(e.vector, i * this.dims);\n });\n const built = this.#build(ids, vectors);\n\n await this.#exclusive(() =>\n this.#swapSegments(async () => {\n const ref = this.#refOf(built, n);\n const next: State = {\n ...this.#state,\n nextGen: ref.gen + 1,\n segments: [...this.#state.segments, ref],\n };\n const { ids: idsT, tail } = this.#t;\n await inTransaction(this.#db, async (tx) => {\n await this.#store.write(tx, ref.gen, built);\n await tx.query(\n `UPDATE ${idsT} SET gen = ? WHERE gen = 0\n AND id IN (SELECT id FROM ${tail} WHERE seq <= ?)`,\n [ref.gen, snapshot.maxSeq],\n );\n await tx.query(`DELETE FROM ${tail} WHERE seq <= ?`, [snapshot.maxSeq]);\n await this.#saveState(tx, next);\n });\n this.#state = next;\n for (const [id, e] of this.#tail) if (e.seq <= snapshot.maxSeq) this.#tail.delete(id);\n this.#segments = [...this.#segments, this.#segmentOf(ref, built)];\n }),\n );\n return n;\n });\n }\n\n /**\n * Rewrites all segments into one (retraining the IVF lists) and drops dead\n * rows. Holds all live segment vectors in memory while it runs.\n */\n async merge(): Promise<number> {\n this.#assertReady();\n return this.#maintenance(async () => {\n const old = this.#segments;\n if (old.length === 0) return 0;\n const oldGens = old.map((s) => s.gen);\n\n const idList: number[] = [];\n const chunks: Float32Array[] = [];\n for (const seg of old) {\n for (let c = 0; c < seg.nlist; c++) {\n if (seg.counts[c] === 0) continue;\n const [data] = (await this.#store.lists(seg, [c])) as [ListData];\n const floats = await this.#store.floats(seg, c);\n const live = await this.#generations(Array.from(data.ids));\n for (let r = 0; r < data.ids.length; r++) {\n const id = data.ids[r];\n if (live.get(id) !== seg.gen) continue;\n idList.push(id);\n chunks.push(floats.subarray(r * this.dims, (r + 1) * this.dims));\n }\n }\n }\n\n const n = idList.length;\n const vectors = new Float32Array(n * this.dims);\n chunks.forEach((v, i) => {\n vectors.set(v, i * this.dims);\n });\n const built = n > 0 ? this.#build(Float64Array.from(idList), vectors) : null;\n\n await this.#exclusive(() =>\n this.#swapSegments(async () => {\n const ref = built ? this.#refOf(built, n) : null;\n const kept = this.#state.segments.filter((s) => !oldGens.includes(s.gen));\n const next: State = {\n ...this.#state,\n nextGen: ref ? ref.gen + 1 : this.#state.nextGen,\n segments: ref ? [...kept, ref] : kept,\n };\n await inTransaction(this.#db, async (tx) => {\n if (ref && built) {\n await this.#store.write(tx, ref.gen, built);\n await tx.query(\n `UPDATE ${this.#t.ids} SET gen = ? WHERE gen IN (SELECT value FROM json_each(?))`,\n [ref.gen, JSON.stringify(oldGens)],\n );\n }\n await this.#saveState(tx, next);\n });\n this.#state = next;\n this.#segments = [\n ...this.#segments.filter((s) => !oldGens.includes(s.gen)),\n ...(ref && built ? [this.#segmentOf(ref, built)] : []),\n ];\n this.#retired.push(...old);\n }),\n );\n await this.#reap();\n return n;\n });\n }\n\n /** compact() then merge(). */\n async optimize(): Promise<void> {\n await this.compact();\n await this.merge();\n }\n\n // ------------------------------------------------------------ private\n\n #build(ids: Float64Array, vectors: Float32Array): BuiltSegment {\n return buildSegment({\n dims: this.dims,\n metric: this.metric,\n ids,\n vectors,\n nlist: this.#nlist?.(ids.length),\n });\n }\n\n #refOf(built: BuiltSegment, count: number): SegmentRef {\n return { gen: this.#state.nextGen, count, nlist: built.nlist };\n }\n\n #segmentOf(ref: SegmentRef, built: BuiltSegment): SegmentIndex {\n return new SegmentIndex(ref.gen, this.dims, this.metric, built.centroids, built.counts);\n }\n\n async #generations(ids: number[]): Promise<Map<number, number>> {\n const out = new Map<number, number>();\n const unique = [...new Set(ids)];\n for (let i = 0; i < unique.length; i += VALIDATE_BATCH) {\n const rows = await this.#db.query<{ id: number; gen: number }>(\n `SELECT id, gen FROM ${this.#t.ids} WHERE id IN (SELECT value FROM json_each(?))`,\n [JSON.stringify(unique.slice(i, i + VALIDATE_BATCH))],\n );\n for (const r of rows) out.set(Number(r.id), Number(r.gen));\n }\n return out;\n }\n\n async #saveState(tx: Db, state: State): Promise<void> {\n await tx.query(\n `INSERT INTO ${this.#t.meta}(k, v) VALUES ('state', ?)\n ON CONFLICT(k) DO UPDATE SET v = excluded.v`,\n [JSON.stringify(state)],\n );\n }\n\n /** Deletes the rows of retired segments once no search is reading them. */\n async #reap(): Promise<void> {\n const ready = this.#retired.filter((s) => (this.#refs.get(s) ?? 0) === 0);\n if (ready.length === 0) return;\n this.#retired = this.#retired.filter((s) => !ready.includes(s));\n for (const s of ready) this.#refs.delete(s);\n const gens = ready.map((s) => s.gen);\n await inTransaction(this.#db, (tx) => this.#store.drop(tx, gens));\n }\n\n /**\n * Runs `read` over a snapshot of the segments, held against reaping. A read\n * whose liveness lookup straddles a compact or merge commit may not match its\n * snapshot, so it runs again on the new one; the third attempt stands.\n */\n async #read<T>(read: (segments: SegmentIndex[]) => Promise<T>): Promise<T> {\n for (let attempt = 1; ; attempt++) {\n const epoch = this.#epoch;\n const segments = this.#segments;\n for (const s of segments) this.#refs.set(s, (this.#refs.get(s) ?? 0) + 1);\n try {\n const result = await read(segments);\n if (attempt === 3 || (epoch % 2 === 0 && epoch === this.#epoch)) return result;\n } finally {\n for (const s of segments) this.#refs.set(s, (this.#refs.get(s) ?? 1) - 1);\n void this.#reap().catch(() => {}); // a failed reap leaves rows that init() sweeps\n }\n }\n }\n\n /** Commits a segment-list change; readers that overlap it retry (see `#read`). */\n async #swapSegments(fn: () => Promise<void>): Promise<void> {\n this.#epoch++;\n try {\n await fn();\n } finally {\n this.#epoch++;\n }\n }\n\n #exclusive<T>(fn: () => Promise<T>): Promise<T> {\n const run = this.#queue.then(fn, fn);\n this.#queue = run.catch(() => {});\n return run;\n }\n\n async #maintenance<T>(fn: () => Promise<T>): Promise<T> {\n if (this.#maintaining) throw new Error(\"vector-index: compact or merge already running\");\n this.#maintaining = true;\n try {\n return await fn();\n } finally {\n this.#maintaining = false;\n }\n }\n\n #assertReady() {\n if (!this.#ready) throw new Error(\"vector-index: call init() first\");\n }\n}\n\nfunction assertId(id: number) {\n if (!Number.isSafeInteger(id))\n throw new Error(`vector-index: id must be a safe integer, got ${id}`);\n}\n\n/** Drops every table of the index under `prefix`, in one transaction. Needs no dims or metric. */\nexport async function dropVectorIndex(db: Db, prefix: string): Promise<void> {\n if (!PREFIX_PATTERN.test(prefix)) throw new Error(`vector-index: bad prefix ${prefix}`);\n await inTransaction(db, async (tx) => {\n for (const t of [\"meta\", \"ids\", \"tail\", \"centroids\", \"seg\", \"f32\"]) {\n await tx.exec(`DROP TABLE IF EXISTS ${prefix}${t}`);\n }\n });\n}\n"],"mappings":";;;AAEA,SAAgB,UAAU,GAA+B;CACvD,IAAI,IAAI;CACR,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK,KAAK,EAAE,KAAK,EAAE;CACjD,IAAI,KAAK,KAAK,CAAC;CACf,MAAM,MAAM,IAAI,aAAa,EAAE,MAAM;CACrC,IAAI,MAAM,GAAG,OAAO;CACpB,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK,IAAI,KAAK,EAAE,KAAK;CACnD,OAAO;AACT;;AAGA,SAAgB,QAAQ,GAAsB,MAAc,QAA8B;CACxF,IAAI,EAAE,WAAW,MAAM,MAAM,IAAI,MAAM,0BAA0B,KAAK,aAAa,EAAE,QAAQ;CAC7F,MAAM,IAAI,aAAa,eAAe,IAAI,aAAa,KAAK,CAAC;CAC7D,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAC5B,IAAI,CAAC,OAAO,SAAS,EAAE,EAAE,GAAG,MAAM,IAAI,MAAM,kDAAkD;CAEhG,OAAO,WAAW,WAAW,UAAU,CAAC,IAAI,EAAE,MAAM;AACtD;;AAGA,SAAgB,SACd,QACA,GACA,IACA,GACA,IACA,GACQ;CACR,IAAI,WAAW,MAAM;EACnB,IAAI,IAAI;EACR,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;GAC1B,MAAM,IAAI,EAAE,KAAK,KAAK,EAAE,KAAK;GAC7B,KAAK,IAAI;EACX;EACA,OAAO;CACT;CACA,IAAI,IAAI;CACR,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,KAAK,EAAE,KAAK,KAAK,EAAE,KAAK;CACpD,OAAO,WAAW,WAAW,IAAI,IAAI,CAAC;AACxC;;AAKA,SAAgB,aAAa,GAAiB,IAAY,GAAW,KAAgB,IAAY;CAC/F,IAAI,MAAM;CACV,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,MAAM,KAAK,IAAI,KAAK,KAAK,IAAI,EAAE,KAAK,EAAE,CAAC;CACnE,MAAM,MAAM,QAAQ,IAAI,IAAI,MAAM;CAClC,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,IAAI,KAAK,KAAK,KAAK,MAAM,EAAE,KAAK,KAAK,GAAG;CACpE,OAAO;AACT;;AAGA,SAAgB,aACd,QACA,GACA,OACA,IACA,OACA,GACQ;CACR,MAAM,IAAI,QAAQ;CAClB,IAAI,WAAW,MAAM;EACnB,IAAI,IAAI;EACR,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;GAC1B,MAAM,IAAI,EAAE,KAAK,MAAM,KAAK,KAAK;GACjC,KAAK,IAAI;EACX;EACA,OAAO;CACT;CACA,IAAI,IAAI;CACR,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,KAAK,EAAE,KAAK,MAAM,KAAK;CACnD,KAAK;CACL,OAAO,WAAW,WAAW,IAAI,IAAI,CAAC;AACxC;AAIA,MAAa,YAAY,MAAe,IAAI,OAAQ;;AAGpD,SAAgB,aACd,GACA,IACA,GACA,IACA,GACA,KACA,IACA;CACA,MAAM,IAAI,SAAS,CAAC;CACpB,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC;CACtB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACrB,IAAI,EAAE,KAAK,KAAK,EAAE,KAAK,IAAI,IAAI,MAAM,MAAM,OAAO,MAAM,IAAI;AAEhE;AAEA,SAAgB,QAAQ,GAAgB,GAAgB,IAAY,GAAmB;CACrF,IAAI,IAAI;CACR,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EAC1B,IAAI,IAAI,EAAE,KAAK,EAAE,KAAK;EACtB,KAAM,MAAM,IAAK;EACjB,KAAK,IAAI,cAAgB,MAAM,IAAK;EACpC,KAAK,KAAK,KAAM,KAAK,MAAM,KAAM,WAAY,QAAU,MAAM;CAC/D;CACA,OAAO;AACT;;AAKA,IAAa,OAAb,MAAqB;CACnB;CACA,UAA6B,CAAC;CAC9B,SAAuB,CAAC;CAExB,YAAY,GAAW;EACrB,KAAK,KAAK,KAAK,IAAI,GAAG,CAAC;CACzB;CAEA,IAAI,OAAO;EACT,OAAO,KAAK,QAAQ;CACtB;;CAGA,IAAI,QAAQ;EACV,OAAO,KAAK,QAAQ,SAAS,KAAK,KAAK,OAAO,oBAAoB,KAAK,QAAQ;CACjF;CAEA,KAAK,OAAe,MAAS;EAC3B,IAAI,KAAK,OAAO,GAAG;EACnB,MAAM,IAAI,KAAK;EACf,MAAM,KAAK,KAAK;EAChB,IAAI,EAAE,SAAS,KAAK,IAAI;GACtB,EAAE,KAAK,KAAK;GACZ,GAAG,KAAK,IAAI;GACZ,IAAI,IAAI,EAAE,SAAS;GACnB,OAAO,IAAI,GAAG;IACZ,MAAM,IAAK,IAAI,KAAM;IACrB,IAAI,EAAE,MAAM,EAAE,IAAI;IAClB,KAAK,MAAM,GAAG,CAAC;IACf,IAAI;GACN;GACA;EACF;EACA,IAAI,SAAS,EAAE,IAAI;EACnB,EAAE,KAAK;EACP,GAAG,KAAK;EACR,IAAI,IAAI;EACR,SAAS;GACP,MAAM,IAAI,IAAI,IAAI;GAClB,MAAM,IAAI,IAAI;GACd,IAAI,IAAI;GACR,IAAI,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,IAAI,IAAI;GACrC,IAAI,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,IAAI,IAAI;GACrC,IAAI,MAAM,GAAG;GACb,KAAK,MAAM,GAAG,CAAC;GACf,IAAI;EACN;CACF;;CAGA,SAAuC;EACrC,OAAO,KAAK,QACT,KAAK,OAAO,OAAO;GAAE;GAAO,MAAM,KAAK,OAAO;EAAG,EAAE,CAAC,CACpD,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;CACrC;CAEA,MAAM,GAAW,GAAW;EAC1B,MAAM,IAAI,KAAK;EACf,MAAM,KAAK,KAAK;EAChB,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,EAAE,IAAI,EAAE,EAAE;EAC1B,CAAC,GAAG,IAAI,GAAG,MAAM,CAAC,GAAG,IAAI,GAAG,EAAE;CAChC;AACF;;;;ACtKA,SAAgB,WAAW,MAAc;CACvC,IAAI,IAAI,SAAS;CACjB,aAAa;EACX,IAAK,IAAI,eAAgB;EACzB,IAAI,IAAI;EACR,IAAI,KAAK,KAAK,IAAK,MAAM,IAAK,IAAI,CAAC;EACnC,KAAK,IAAI,KAAK,KAAK,IAAK,MAAM,GAAI,IAAI,EAAE;EACxC,SAAS,IAAK,MAAM,QAAS,KAAK;CACpC;AACF;;AAGA,SAAgB,QACd,QACA,MACA,QACA,WACA,GACA,GACQ;CACR,IAAI,OAAO;CACX,IAAI,QAAQ,OAAO;CAEnB,MAAM,IAAY,WAAW,OAAO,OAAO;CAC3C,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EAC1B,MAAM,OAAO,SAAS,GAAG,MAAM,QAAQ,WAAW,IAAI,GAAG,CAAC;EAC1D,IAAI,OAAO,OAAO;GAChB,QAAQ;GACR,OAAO;EACT;CACF;CACA,OAAO;AACT;;;;;AAMA,SAAgB,OACd,MACA,GACA,GACA,GACA,QACA,OAAsB,CAAC,GACT;CACd,MAAM,OAAO,WAAW,KAAK,QAAQ,EAAE;CACvC,IAAI,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,CAAC,CAAC;CAC9B,MAAM,aAAa,KAAK,IAAI,GAAG,KAAK,cAAc,KAAK,IAAI,KAAK,GAAG,IAAM,CAAC;CAG1E,MAAM,MAAM,IAAI,YAAY,CAAC;CAC7B,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,IAAI,KAAK;CACrC,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,KAAK;EACnC,MAAM,IAAI,IAAI,KAAK,MAAM,KAAK,KAAK,IAAI,EAAE;EACzC,CAAC,IAAI,IAAI,IAAI,MAAM,CAAC,IAAI,IAAI,IAAI,EAAE;CACpC;CACA,MAAM,SAAS,IAAI,aAAa,aAAa,CAAC;CAC9C,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,KAAK,OAAO,IAAI,KAAK,SAAS,IAAI,KAAK,GAAG,IAAI,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC;CAEhG,MAAM,YAAY,WAAW;CAC7B,MAAM,YAAY,IAAI,aAAa,IAAI,CAAC;CAGxC,UAAU,IAAI,OAAO,SAAS,GAAG,CAAC,GAAG,CAAC;CACtC,MAAM,OAAO,IAAI,aAAa,UAAU,CAAC,CAAC,KAAK,OAAO,iBAAiB;CACvE,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EAC1B,IAAI,QAAQ;EACZ,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,KAAK;GACnC,MAAM,KAAK,SAAS,MAAM,QAAQ,IAAI,GAAG,YAAY,IAAI,KAAK,GAAG,CAAC;GAClE,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK;GAC5B,SAAS,KAAK;EAChB;EACA,IAAI,IAAI,KAAK,IAAI;EACjB,IAAI,OAAO,aAAa;EACxB,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,KAAK;GACnC,KAAK,KAAK;GACV,IAAI,KAAK,GAAG;IACV,OAAO;IACP;GACF;EACF;EACA,UAAU,IAAI,OAAO,SAAS,OAAO,GAAG,OAAO,IAAI,CAAC,GAAG,IAAI,CAAC;CAC9D;CAEA,MAAM,SAAS,IAAI,YAAY,UAAU;CACzC,MAAM,SAAS,IAAI,YAAY,CAAC;CAChC,MAAM,aAAa,KAAK,cAAc;CACtC,KAAK,IAAI,KAAK,GAAG,KAAK,YAAY,MAAM;EACtC,IAAI,QAAQ;EACZ,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,KAAK;GACnC,MAAM,IAAI,QAAQ,QAAQ,QAAQ,IAAI,GAAG,WAAW,GAAG,CAAC;GACxD,IAAI,MAAM,OAAO,MAAM,OAAO,GAAG;GACjC,OAAO,KAAK;EACd;EACA,MAAM,OAAO,IAAI,aAAa,IAAI,CAAC;EACnC,OAAO,KAAK,CAAC;EACb,KAAK,IAAI,IAAI,GAAG,IAAI,YAAY,KAAK;GACnC,MAAM,IAAI,OAAO;GACjB,OAAO,EAAE;GACT,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,KAAK,IAAI,IAAI,MAAM,OAAO,IAAI,IAAI;EAChE;EACA,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;GAC1B,IAAI,OAAO,OAAO,GAAG;IAEnB,MAAM,IAAI,KAAK,MAAM,KAAK,IAAI,UAAU;IACxC,UAAU,IAAI,OAAO,SAAS,IAAI,GAAG,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC;IACtD;GACF;GACA,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,UAAU,IAAI,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,OAAO;EAC9E;EACA,IAAI,WACF,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACrB,UAAU,IAAI,UAAU,UAAU,SAAS,IAAI,GAAG,IAAI,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC;EAGxE,IAAI,KAAK,KAAK,UAAU,GAAG;CAC7B;CACA,OAAO;AACT;;;;;;;;;;;;;;;;;ACxGA,MAAM,UAAU,MAAe,IAAI,IAAK;AAcxC,SAAgB,WAAW,OAAe,MAA0B;CAClE,MAAM,IAAI,SAAS,IAAI;CACvB,MAAM,QAAQ;CACd,MAAM,SAAS,OAAO,QAAQ,IAAI,KAAK;CACvC,MAAM,UAAU,OAAO,SAAS,IAAI,IAAI,KAAK;CAC7C,MAAM,SAAS,OAAO,UAAU,IAAI,KAAK;CACzC,MAAM,WAAW,OAAO,SAAS,IAAI,KAAK;CAC1C,MAAM,UAAU,OAAO,WAAW,IAAI,KAAK;CAE3C,OAAO;EAAE;EAAO;EAAO;EAAQ;EAAS;EAAQ;EAAU;EAAS,QADpD,OAAO,UAAU,OAAO,KACiC;CAAE;AAC5E;AA4BA,SAAgB,aAAa,GAAW;CACtC,IAAI,IAAA,MAAe,OAAO;CAC1B,OAAO,KAAK,IAAI,GAAG,KAAK,IAAI,MAAM,KAAK,MAAM,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC;AAC7D;AAEA,SAAgB,aAAa,OAAiC;CAC5D,MAAM,EAAE,MAAM,GAAG,QAAQ,KAAK,YAAY;CAC1C,MAAM,IAAI,IAAI;CACd,MAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,IAAI,MAAM,SAAS,aAAa,CAAC,GAAG,KAAK,IAAI,GAAG,CAAC,CAAC,CAAC;CAElF,IAAI;CACJ,IAAI,UAAU,GAAG;EACf,YAAY,IAAI,aAAa,CAAC;EAC9B,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,UAAU,MAAM,QAAQ,IAAI,IAAI;EACxF,IAAI,IAAI,GAAG,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,UAAU,MAAM;CACzD,OACE,YAAY,OAAO,SAAS,GAAG,GAAG,OAAO,QAAQ,EAAE,MAAM,MAAM,KAAK,CAAC;CAGvE,MAAM,SAAS,IAAI,YAAY,CAAC;CAChC,MAAM,SAAS,IAAI,YAAY,KAAK;CACpC,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EAC1B,MAAM,IAAI,UAAU,IAAI,IAAI,QAAQ,QAAQ,SAAS,IAAI,GAAG,WAAW,OAAO,CAAC;EAC/E,OAAO,KAAK;EACZ,OAAO,EAAE;CACX;CAEA,MAAM,IAAI,SAAS,CAAC;CACpB,MAAM,UAAU,MAAM,KAAK,SAAS,UAAU,WAAW,OAAO,CAAC,CAAC;CAClE,MAAM,QAAQ,QAAQ,KAAK,MAAM,IAAI,WAAW,EAAE,MAAM,CAAC;CACzD,MAAM,SAAS,MAAM,KAAK,SAAS,UAAU,IAAI,WAAW,IAAI,QAAQ,CAAC,CAAC;CAC1E,MAAM,QAAQ,QAAQ,KAAK,GAAG,MAAM;EAClC,MAAM,MAAM,MAAM,EAAE,CAAC;EACrB,OAAO;GACL,KAAK,IAAI,aAAa,KAAK,EAAE,OAAO,EAAE,KAAK;GAC3C,MAAM,IAAI,YAAY,KAAK,EAAE,QAAQ,EAAE,QAAQ,CAAC;GAChD,OAAO,IAAI,aAAa,KAAK,EAAE,SAAS,EAAE,KAAK;GAC/C,MAAM,IAAI,aAAa,KAAK,EAAE,QAAQ,EAAE,KAAK;GAC7C,QAAQ,IAAI,aAAa,KAAK,EAAE,UAAU,EAAE,KAAK;GACjD,OAAO,IAAI,UAAU,KAAK,EAAE,SAAS,EAAE,QAAQ,CAAC;GAChD,QAAQ,IAAI,aAAa,OAAO,EAAE,CAAC,QAAQ,GAAG,EAAE,QAAQ,CAAC;EAC3D;CACF,CAAC;CAED,MAAM,OAAO,IAAI,YAAY,KAAK;CAClC,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EAC1B,MAAM,IAAI,OAAO;EACjB,MAAM,IAAI,KAAK,EAAE;EACjB,MAAM,IAAI,MAAM;EAChB,EAAE,IAAI,KAAK,IAAI;EACf,aAAa,SAAS,IAAI,GAAG,WAAW,IAAI,GAAG,GAAG,EAAE,MAAM,IAAI,CAAC;EAC/D,MAAM,CAAC,IAAI,MAAM,cAAc,SAAS,IAAI,GAAG,WAAW,IAAI,GAAG,CAAC;EAClE,EAAE,MAAM,KAAK;EACb,EAAE,KAAK,KAAK;EACZ,EAAE,OAAO,KAAK,aAAa,SAAS,IAAI,GAAG,GAAG,EAAE,OAAO,IAAI,CAAC;EAC5D,EAAE,OAAO,IAAI,QAAQ,SAAS,IAAI,GAAG,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC;CACxD;CACA,OAAO;EAAE;EAAO;EAAQ;EAAW;EAAO;CAAO;AACnD;;AAGA,SAAS,cAAc,GAAiB,IAAY,GAAiB,IAAY,GAAW;CAC1F,IAAI,KAAK;CACT,IAAI,KAAK;CACT,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;EAC1B,MAAM,IAAI,EAAE,KAAK,KAAK,EAAE,KAAK;EAC7B,MAAM,IAAI;EACV,MAAM,EAAE,KAAK,KAAK;CACpB;CACA,OAAO,CAAC,KAAK,KAAK,EAAE,GAAG,EAAE;AAC3B;;AAcA,SAAgB,UAAU,OAAmB,OAAe,MAAwB;CAClF,MAAM,IAAI,WAAW,OAAO,IAAI;CAChC,IAAI,MAAM,eAAe,EAAE,QACzB,MAAM,IAAI,MAAM,gCAAgC,MAAM,WAAW,mBAAmB,EAAE,QAAQ;CAEhG,MAAM,MAAM,MAAM,eAAe,IAAI,MAAM,SAAS,MAAM,MAAM,CAAC,CAAC;CAClE,MAAM,IAAI,SAAS,IAAI;CACvB,OAAO;EACL,KAAK,IAAI,aAAa,KAAK,EAAE,OAAO,KAAK;EACzC,MAAM,IAAI,YAAY,KAAK,EAAE,QAAQ,QAAQ,CAAC;EAC9C,OAAO,IAAI,aAAa,KAAK,EAAE,SAAS,KAAK;EAC7C,MAAM,IAAI,aAAa,KAAK,EAAE,QAAQ,KAAK;EAC3C,QAAQ,IAAI,aAAa,KAAK,EAAE,UAAU,KAAK;EAC/C,OAAO,IAAI,UAAU,KAAK,EAAE,SAAS,QAAQ,IAAI;CACnD;AACF;;AASA,IAAa,eAAb,MAA0B;CAEb;CACA;CACA;CACA;CACA;CALX,YACE,KACA,MACA,QACA,WACA,QACA;EALS,KAAA,MAAA;EACA,KAAA,OAAA;EACA,KAAA,SAAA;EACA,KAAA,YAAA;EACA,KAAA,SAAA;CACR;CAEH,IAAI,QAAQ;EACV,OAAO,KAAK,OAAO;CACrB;;CAGA,MAAM,OAAqB,QAA0B;EACnD,MAAM,IAAY,KAAK,WAAW,OAAO,OAAO;EAChD,MAAM,MAAM,IAAI,KAAa,KAAK,IAAI,QAAQ,KAAK,KAAK,CAAC;EACzD,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,KAAK;GACnC,IAAI,KAAK,OAAO,OAAO,GAAG;GAC1B,IAAI,KAAK,SAAS,GAAG,OAAO,GAAG,KAAK,WAAW,IAAI,KAAK,MAAM,KAAK,IAAI,GAAG,CAAC;EAC7E;EACA,OAAO,IAAI,OAAO,CAAC,CAAC,KAAK,MAAM,EAAE,IAAI;CACvC;;;;;CAMA,WACE,OACA,GACA,MACA,OACA,MACa;EACb,MAAM,IAAI,KAAK;EACf,MAAM,IAAI,SAAS,CAAC;EACpB,MAAM,KAAK,IAAI;EACf,MAAM,KAAK,IAAI,YAAY,CAAC;EAC5B,aAAa,OAAO,GAAG,KAAK,WAAW,IAAI,GAAG,IAAI,CAAC;EACnD,MAAM,CAAC,IAAI,OAAO,cAAc,OAAO,GAAG,KAAK,WAAW,IAAI,CAAC;EAC/D,IAAI,KAAK;EACT,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,MAAM,KAAK,UAAU,KAAK,KAAK,KAAK,UAAU,KAAK;EAC/E,MAAM,KAAK,KAAK;EAChB,MAAM,QAAQ,KAAK,KAAK;EACxB,MAAM,KAAK,KAAK,WAAW;EAC3B,MAAM,MAAM,IAAI,KAAgB,KAAK;EACrC,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,QAAQ,KAAK;GACxC,MAAM,KAAK,KAAK,IAAI;GACpB,IAAI,QAAQ,CAAC,KAAK,EAAE,GAAG;GACvB,MAAM,KAAK,KAAK,KAAK,MAAM,KAAK,KAAK,IAAI,QAAQ,QAAQ,IAAI,KAAK,MAAM,IAAI,GAAG,CAAC,CAAC;GAEjF,MAAM,MAAM,KAAK,KAAK,KAAK,KAAK,MAAM,KAAK,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,KAAK,KAAK,KAAK,KAAK;GAC1F,IAAI,MAAM,IAAI,OAAO,IAAI,KAAK,KAAK;IAAE,MAAM;IAAG,KAAK;IAAG;GAAG,CAAC;EAC5D;EACA,OAAO,IAAI,OAAO,CAAC,CAAC,KAAK,MAAM,EAAE,IAAI;CACvC;;CAGA,UAAU,OAAqB,MAAgB,KAAqB;EAClE,OAAO,aACL,KAAK,QACL,OACA,KAAK,OACL,MAAM,KAAK,MACX,KAAK,OAAO,MACZ,KAAK,IACP;CACF;AACF;;;;ACzOA,SAAgB,UAAU,OAAiC;CACzD,MAAM,OAAO,MAAM,MAAM;CACzB,OAAO,IAAI,aAAa,KAAK,QAAQ,GAAG,KAAK,cAAc,CAAC;AAC9D;AAEA,SAAgB,aAAa,GAA6B;CACxD,OAAO,IAAI,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC,MAAM;AACpE;;;;;;;ACrBA,MAAa,aAAa;;;;;;AAa1B,IAAa,kBAAb,MAA6B;CAC3B;CACA;CACA;CACA;CAEA,YAAY,IAAQ,QAAgB,MAAc,aAAa,UAAkB;EAC/E,KAAK,MAAM;EACX,KAAK,QAAQ;EACb,KAAK,KAAK;GAAE,WAAW,GAAG,OAAO;GAAY,KAAK,GAAG,OAAO;GAAM,KAAK,GAAG,OAAO;EAAK;EACtF,KAAK,SAAS,IAAI,IAAI,UAAU;CAClC;CAEA,SAAmB;EACjB,MAAM,EAAE,WAAW,KAAK,QAAQ,KAAK;EACrC,OAAO;GACL,8BAA8B,UAAU;;GAExC,8BAA8B,IAAI;;GAElC,8BAA8B,IAAI;;EAEpC;CACF;;CAGA,MAAM,MAAM,IAAQ,KAAa,OAAoC;EACnE,MAAM,IAAI,KAAK;EACf,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,OAAO,KAAK;GACpC,MAAM,GAAG,MACP,eAAe,KAAK,GAAG,UAAU,mDACjC;IAAC;IAAK;IAAG,MAAM,OAAO;IAAI,aAAa,MAAM,UAAU,SAAS,IAAI,IAAI,IAAI,KAAK,CAAC,CAAC;GAAC,CACtF;GACA,MAAM,WAAW,IAAI,KAAK,GAAG,KAAK,KAAK,GAAG,MAAM,MAAM,EAAgB;GACtE,MAAM,WAAW,IAAI,KAAK,GAAG,KAAK,KAAK,GAAG,MAAM,OAAO,EAAgB;EACzE;CACF;;CAGA,MAAM,KAAK,KAAiB,QAAuC;EACjE,MAAM,IAAI,KAAK;EACf,MAAM,OAAO,MAAM,KAAK,IAAI,MAC1B,qCAAqC,KAAK,GAAG,UAAU,+BACvD,CAAC,IAAI,GAAG,CACV;EACA,IAAI,KAAK,WAAW,IAAI,OACtB,MAAM,IAAI,MACR,yBAAyB,IAAI,IAAI,OAAO,KAAK,OAAO,mBAAmB,IAAI,OAC7E;EAEF,MAAM,YAAY,IAAI,aAAa,IAAI,QAAQ,CAAC;EAChD,MAAM,SAAS,IAAI,YAAY,IAAI,KAAK;EACxC,KAAK,MAAM,KAAK,MAAM;GACpB,MAAM,IAAI,OAAO,EAAE,IAAI;GACvB,UAAU,IAAI,UAAU,EAAE,QAAQ,GAAG,IAAI,CAAC;GAC1C,OAAO,KAAK,OAAO,EAAE,KAAK;EAC5B;EACA,OAAO,IAAI,aAAa,IAAI,KAAK,GAAG,QAAQ,WAAW,MAAM;CAC/D;;CAGA,MAAM,MAAM,KAAmB,IAAmC;EAChE,MAAM,sBAAM,IAAI,IAAsB;EACtC,MAAM,UAAoB,CAAC;EAC3B,KAAK,MAAM,KAAK,IAAI;GAClB,MAAM,MAAM,KAAK,OAAO,IAAI,KAAK,IAAI,IAAI,GAAG,GAAG;GAC/C,IAAI,KAAK,IAAI,IAAI,GAAG,GAAG;QAClB,QAAQ,KAAK,CAAC;EACrB;EACA,IAAI,QAAQ,SAAS,GAAG;GACtB,MAAM,SAAS,MAAM,UAAU,KAAK,KAAK,KAAK,GAAG,KAAK,IAAI,KAAK,OAAO;GACtE,KAAK,MAAM,KAAK,SAAS;IACvB,MAAM,QAAQ,OAAO,IAAI,CAAC,qBAAK,IAAI,WAAW,CAAC;IAC/C,MAAM,OAAO,UAAU,OAAO,IAAI,OAAO,IAAc,KAAK,KAAK;IACjE,KAAK,OAAO,IAAI,KAAK,IAAI,IAAI,GAAG,KAAK,MAAM,MAAM,UAAU;IAC3D,IAAI,IAAI,GAAG,IAAI;GACjB;EACF;EACA,OAAO,GAAG,KAAK,MAAM,IAAI,IAAI,CAAC,CAAa;CAC7C;;CAGA,MAAM,OAAO,KAAmB,GAAkC;EAChE,MAAM,MAAM,KAAK,IAAI,IAAI,GAAG;EAC5B,MAAM,MAAM,KAAK,OAAO,IAAI,GAAG;EAC/B,IAAI,KAAK,OAAO;EAEhB,MAAM,SAAS,WAAU,MADJ,UAAU,KAAK,KAAK,KAAK,GAAG,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC,EACzC,CAAO,IAAI,CAAC,qBAAK,IAAI,WAAW,CAAC,CAAC;EAC3D,KAAK,OAAO,IAAI,KAAK,QAAQ,OAAO,UAAU;EAC9C,OAAO;CACT;;CAGA,MAAM,KAAK,IAAQ,MAA+B;EAChD,MAAM,OAAO,KAAK,UAAU,IAAI;EAChC,KAAK,MAAM,SAAS,OAAO,OAAO,KAAK,EAAE,GACvC,MAAM,GAAG,MAAM,eAAe,MAAM,iDAAiD,CAAC,IAAI,CAAC;EAE7F,KAAK,MAAM,OAAO,MAAM,KAAK,OAAO,aAAa,KAAK,IAAI,IAAI,KAAK,IAAI,EAAE;CAC3E;;CAGA,MAAM,MAAM,IAAQ,MAA+B;EACjD,MAAM,OAAO,KAAK,UAAU,IAAI;EAChC,KAAK,MAAM,SAAS,OAAO,OAAO,KAAK,EAAE,GACvC,MAAM,GAAG,MAAM,eAAe,MAAM,qDAAqD,CACvF,IACF,CAAC;CAEL;AACF;AAEA,eAAe,WAAW,IAAQ,OAAe,KAAa,MAAc,OAAmB;CAC7F,KAAK,IAAI,OAAO,GAAG,KAAK,GAAG,KAAK,MAAM,YAAY,QAAQ,MAAM,YAC9D,MAAM,GAAG,MAAM,eAAe,MAAM,+CAA+C;EACjF;EACA;EACA;EACA,MAAM,MAAM,IAAI,KAAK,UAAU;CACjC,CAAC;AAEL;;AAGA,eAAe,UACb,IACA,OACA,KACA,OACkC;CAClC,MAAM,OAAO,MAAM,GAAG,MACpB,2BAA2B,MAAM;sFAEjC,CAAC,KAAK,KAAK,UAAU,KAAK,CAAC,CAC7B;CACA,MAAM,wBAAQ,IAAI,IAA0B;CAC5C,KAAK,MAAM,KAAK,MAAM;EACpB,MAAM,OAAO,OAAO,EAAE,IAAI;EAC1B,MAAM,MAAM,MAAM,IAAI,IAAI,KAAK,CAAC;EAChC,IAAI,KAAK,EAAE,KAAK;EAChB,MAAM,IAAI,MAAM,GAAG;CACrB;CACA,MAAM,sBAAM,IAAI,IAAwB;CACxC,KAAK,MAAM,CAAC,MAAM,OAAO,OAAO;EAC9B,MAAM,SAAS,IAAI,WAAW,GAAG,QAAQ,GAAG,MAAM,IAAI,EAAE,YAAY,CAAC,CAAC;EACtE,IAAI,KAAK;EACT,KAAK,MAAM,KAAK,IAAI;GAClB,OAAO,IAAI,GAAG,EAAE;GAChB,MAAM,EAAE;EACV;EACA,IAAI,IAAI,MAAM,MAAM;CACtB;CACA,OAAO;AACT;;AAGA,IAAM,MAAN,MAAa;CACX;CACA,uBAAgB,IAAI,IAAwC;CAC5D,SAAS;CAET,YAAY,UAAkB;EAC5B,KAAK,OAAO;CACd;CAEA,IAAI,KAA4B;EAC9B,MAAM,IAAI,KAAK,KAAK,IAAI,GAAG;EAC3B,IAAI,CAAC,GAAG,OAAO,KAAA;EACf,KAAK,KAAK,OAAO,GAAG;EACpB,KAAK,KAAK,IAAI,KAAK,CAAC;EACpB,OAAO,EAAE;CACX;CAEA,IAAI,KAAa,OAAU,MAAc;EACvC,MAAM,MAAM,KAAK,KAAK,IAAI,GAAG;EAC7B,IAAI,KAAK;GACP,KAAK,KAAK,OAAO,GAAG;GACpB,KAAK,UAAU,IAAI;EACrB;EACA,KAAK,KAAK,IAAI,KAAK;GAAE;GAAO;EAAK,CAAC;EAClC,KAAK,UAAU;EACf,KAAK,MAAM,CAAC,GAAG,MAAM,KAAK,MAAM;GAC9B,IAAI,KAAK,UAAU,KAAK,MAAM;GAC9B,KAAK,KAAK,OAAO,CAAC;GAClB,KAAK,UAAU,EAAE;EACnB;CACF;CAEA,aAAa,GAAG,UAAoB;EAClC,KAAK,MAAM,CAAC,GAAG,MAAM,KAAK,MACxB,IAAI,SAAS,MAAM,MAAM,EAAE,WAAW,CAAC,CAAC,GAAG;GACzC,KAAK,KAAK,OAAO,CAAC;GAClB,KAAK,UAAU,EAAE;EACnB;CAEJ;AACF;;;;AC3JA,MAAM,iBAAiB;;AAEvB,MAAM,cAAc;;;;;;;;;;;;;;;;AAiBpB,IAAa,cAAb,MAAyB;CACvB;CACA;;CAEA;CACA;CACA;CACA;CACA;CACA;CAEA,SAAgB;EAAE,KAAK;EAAG,SAAS;EAAG,UAAU,CAAC;CAAE;CACnD,wBAAQ,IAAI,IAAuB;CACnC,YAA4B,CAAC;CAC7B,wBAAQ,IAAI,IAA0B;CACtC,WAA2B,CAAC;CAC5B,SAA2B,QAAQ,QAAQ;CAC3C,eAAe;CACf,SAAS;;CAET,SAAS;CAET,YAAY,MAA0B;EACpC,IAAI,CAAC,eAAe,KAAK,KAAK,MAAM,GAClC,MAAM,IAAI,MAAM,4BAA4B,KAAK,QAAQ;EAE3D,IAAI,CAAC,OAAO,UAAU,KAAK,IAAI,KAAK,KAAK,OAAO,GAC9C,MAAM,IAAI,MAAM,+CAA+C;EAEjE,KAAK,OAAO,KAAK;EACjB,KAAK,SAAS,KAAK,UAAU;EAC7B,KAAK,MAAM,KAAK;EAChB,KAAK,SAAS,IAAI,gBAAgB,KAAK,IAAI,KAAK,QAAQ,KAAK,MAAM,KAAK,UAAU;EAClF,KAAK,SAAS,KAAK;EACnB,KAAK,iBAAiB,KAAK,iBAAiB;EAC5C,MAAM,IAAI,KAAK;EACf,KAAK,KAAK;GAAE,MAAM,GAAG,EAAE;GAAO,KAAK,GAAG,EAAE;GAAM,MAAM,GAAG,EAAE;EAAM;EAC/D,KAAK,UAAU,KAAK,GAAG;CACzB;;CAKA,MAAM,OAAsB;EAC1B,MAAM,EAAE,MAAM,KAAK,SAAS,KAAK;EACjC,KAAK,MAAM,KAAK;GACd,8BAA8B,KAAK;GACnC,8BAA8B,IAAI;GAClC,8BAA8B,IAAI,UAAU,IAAI;GAChD,8BAA8B,KAAK;GACnC,8BAA8B,KAAK,UAAU,KAAK;GAClD,GAAG,KAAK,OAAO,OAAO;EACxB,GACE,MAAM,KAAK,IAAI,KAAK,CAAC;EAGvB,MAAM,SAAS,KAAK,UAAU;GAAE,MAAM,KAAK;GAAM,QAAQ,KAAK;EAAO,CAAC;EACtE,MAAM,KAAK,IAAI,MACb,eAAe,KAAK,wDACpB,CAAC,MAAM,CACT;EACA,MAAM,CAAC,UAAU,MAAM,KAAK,IAAI,MAC9B,iBAAiB,KAAK,oBACxB;EACA,IAAI,QAAQ,MAAM,QAChB,MAAM,IAAI,MAAM,0CAA0C,QAAQ,EAAE,QAAQ,QAAQ;EAEtF,MAAM,KAAK,QAAQ;EACnB,MAAM,OAAO,KAAK,OAAO,SAAS,KAAK,MAAM,EAAE,GAAG;EAClD,MAAM,cAAc,KAAK,MAAM,OAAO,KAAK,OAAO,MAAM,IAAI,IAAI,CAAC;EACjE,KAAK,SAAS;CAChB;;CAGA,MAAM,UAAyB;EAC7B,MAAM,CAAC,OAAO,MAAM,KAAK,IAAI,MAC3B,iBAAiB,KAAK,GAAG,KAAK,mBAChC;EACA,MAAM,QAAe,MAAM,KAAK,MAAM,IAAI,CAAC,IAAI;GAAE,KAAK;GAAG,SAAS;GAAG,UAAU,CAAC;EAAE;EAElF,MAAM,uBAAO,IAAI,IAAuB;EACxC,MAAM,OAAO,MAAM,KAAK,IAAI,MAC1B,4BAA4B,KAAK,GAAG,MACtC;EACA,KAAK,MAAM,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,EAAE,GAAG;GAAE,KAAK,OAAO,EAAE,GAAG;GAAG,QAAQ,UAAU,EAAE,GAAG;EAAE,CAAC;EAE7F,MAAM,QAAQ,IAAI,IAAI,KAAK,UAAU,KAAK,MAAM,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;EAC3D,MAAM,WAAW,MAAM,QAAQ,IAC7B,MAAM,SAAS,KAAK,MAAM,MAAM,IAAI,EAAE,GAAG,KAAK,KAAK,OAAO,KAAK,GAAG,KAAK,MAAM,CAAC,CAChF;EACA,KAAK,SAAS;EACd,KAAK,QAAQ;EACb,KAAK,YAAY;CACnB;CAEA,IAAI,QAA0B;EAC5B,OAAO;GACL,MAAM,KAAK,MAAM;GACjB,UAAU,KAAK,OAAO,SAAS,KAAK,OAAO,EAAE,GAAG,EAAE,EAAE;GACpD,KAAK,KAAK,OAAO;EACnB;CACF;CAIA,MAAM,OAAO,OAAoC;EAC/C,KAAK,aAAa;EAClB,MAAM,WAAW,MAAM,KAAK,OAAO;GACjC,SAAS,GAAG,EAAE;GACd,OAAO;IAAE,IAAI,GAAG;IAAI,QAAQ,QAAQ,GAAG,QAAQ,KAAK,MAAM,KAAK,MAAM;GAAE;EACzE,CAAC;EACD,MAAM,EAAE,MAAM,QAAQ,KAAK;EAC3B,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK,aAAa;GACrD,MAAM,QAAQ,SAAS,MAAM,GAAG,IAAI,WAAW;GAC/C,MAAM,KAAK,WAAW,YAAY;IAChC,MAAM,MAAM,KAAK,OAAO,MAAM;IAC9B,MAAM,OAAO;KAAE,GAAG,KAAK;KAAQ;IAAI;IACnC,MAAM,cAAc,KAAK,KAAK,OAAO,OAAO;KAC1C,KAAK,MAAM,EAAE,IAAI,YAAY,OAAO;MAClC,MAAM,GAAG,MACP,eAAe,KAAK;sFAEpB;OAAC;OAAI;OAAK,aAAa,MAAM;MAAC,CAChC;MACA,MAAM,GAAG,MACP,eAAe,IAAI,gEACnB,CAAC,EAAE,CACL;KACF;KACA,MAAM,KAAK,WAAW,IAAI,IAAI;IAChC,CAAC;IACD,KAAK,SAAS;IACd,KAAK,MAAM,EAAE,IAAI,YAAY,OAAO,KAAK,MAAM,IAAI,IAAI;KAAE;KAAK;IAAO,CAAC;GACxE,CAAC;GACD,IAAI,KAAK,MAAM,QAAQ,KAAK,kBAAkB,CAAC,KAAK,cAAc,MAAM,KAAK,QAAQ;EACvF;CACF;CAEA,MAAM,OAAO,KAA8B;EACzC,KAAK,aAAa;EAClB,IAAI,QAAQ,QAAQ;EACpB,MAAM,KAAK,WAAW,YAAY;GAChC,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK,gBAAgB;IACnD,MAAM,QAAQ,IAAI,MAAM,GAAG,IAAI,cAAc;IAC7C,MAAM,OAAO,KAAK,UAAU,KAAK;IACjC,MAAM,cAAc,KAAK,KAAK,OAAO,OAAO;KAC1C,MAAM,GAAG,MACP,eAAe,KAAK,GAAG,KAAK,gDAC5B,CAAC,IAAI,CACP;KACA,MAAM,GAAG,MACP,eAAe,KAAK,GAAG,IAAI,gDAC3B,CAAC,IAAI,CACP;IACF,CAAC;IACD,KAAK,MAAM,MAAM,OAAO,KAAK,MAAM,OAAO,EAAE;GAC9C;EACF,CAAC;CACH;CAIA,MAAM,OAAO,OAA0B,OAAsB,CAAC,GAAyB;EACrF,KAAK,aAAa;EAClB,MAAM,IAAI,KAAK,KAAK;EACpB,MAAM,SAAS,KAAK,UAAU;EAC9B,MAAM,UAAU,KAAK,KAAK,cAAc;EACxC,MAAM,IAAI,QAAQ,OAAO,KAAK,MAAM,KAAK,MAAM;EAC/C,MAAM,IAAI,KAAK;EACf,MAAM,SAAS,KAAK;EAEpB,OAAO,KAAK,MAAM,OAAO,aAAa;GAEpC,MAAM,UAAU,IAAI,KAAa,CAAC;GAClC,KAAK,MAAM,CAAC,IAAI,EAAE,aAAa,KAAK,OAAO;IACzC,IAAI,UAAU,CAAC,OAAO,EAAE,GAAG;IAC3B,QAAQ,KAAK,SAAS,KAAK,QAAQ,GAAG,GAAG,QAAQ,GAAG,CAAC,GAAG,EAAE;GAC5D;GAIA,MAAM,OAAc,CAAC;GAErB,MAAM,QAAQ,OAAe,CAAC,KAAK,MAAM,IAAI,EAAE,MAAM,CAAC,UAAU,OAAO,EAAE;GACzE,MAAM,QAAQ,IACZ,SAAS,IAAI,OAAO,QAAQ;IAC1B,MAAM,QAAQ,IAAI,MAAM,GAAG,MAAM;IACjC,MAAM,QAAQ,MAAM,KAAK,OAAO,MAAM,KAAK,KAAK;IAChD,KAAK,QAAQ,eAAe;IAC5B,MAAM,SAAS,GAAG,MAAM;KACtB,MAAM,OAAO,MAAM;KACnB,KAAK,MAAM,QAAQ,IAAI,WAAW,GAAG,GAAG,MAAM,SAAS,IAAI,GACzD,KAAK,KAAK;MAAE,GAAG;MAAM;MAAK;KAAK,CAAC;IACpC,CAAC;GACH,CAAC,CACH;GAGA,MAAM,OAAO,MAAM,KAAK,aAAa,KAAK,KAAK,MAAM,EAAE,EAAE,CAAC;GAI1D,MAAM,SAAS,IAAI,KADJ,KAAK,QAAQ,IAAI,IAAI,CACD;GACnC,KAAK,MAAM,KAAK,MAAM;IACpB,IAAI,KAAK,IAAI,EAAE,EAAE,MAAM,EAAE,IAAI,KAAK;IAClC,OAAO,KAAK,EAAE,IAAI,UAAU,GAAG,EAAE,MAAM,EAAE,GAAG,GAAG,CAAC;GAClD;GACA,IAAI,aAAa,OACd,OAAO,CAAC,CACR,KAAK,OAAO;IAAE,IAAI,EAAE,KAAK;IAAI,UAAU,EAAE;IAAO,KAAK,EAAE;GAAK,EAAE;GAGjE,IAAI,KAAK,OACP,aAAa,MAAM,QAAQ,IACzB,WAAW,IAAI,OAAO,MAAM;IAE1B,MAAM,KAAI,MADQ,KAAK,OAAO,OAAO,EAAE,IAAI,KAAK,EAAE,IAAI,IAAI,EAAA,CAC5C,SAAS,EAAE,IAAI,MAAM,IAAI,EAAE,IAAI,MAAM,KAAK,CAAC;IACzD,OAAO;KAAE,GAAG;KAAG,UAAU,SAAS,KAAK,QAAQ,GAAG,GAAG,GAAG,GAAG,CAAC;IAAE;GAChE,CAAC,CACH;GAGF,MAAM,QAAQ,IAAI,KAAa,CAAC;GAChC,KAAK,MAAM,KAAK,YAAY,MAAM,KAAK,EAAE,UAAU,EAAE,EAAE;GACvD,KAAK,MAAM,KAAK,QAAQ,OAAO,GAAG,MAAM,KAAK,EAAE,OAAO,EAAE,IAAI;GAC5D,OAAO,MAAM,OAAO,CAAC,CAAC,KAAK,OAAO;IAAE,IAAI,EAAE;IAAM,UAAU,EAAE;GAAM,EAAE;EACtE,CAAC;CACH;;CAGA,MAAM,WAAW,KAAmD;EAClE,KAAK,aAAa;EAClB,IAAI,QAAQ,QAAQ;EACpB,OAAO,KAAK,MAAM,OAAO,aAAa;GACpC,MAAM,sBAAM,IAAI,IAA0B;GAC1C,MAAM,OAAO,MAAM,KAAK,aAAa,GAAG;GACxC,MAAM,yBAAS,IAAI,IAAyB;GAC5C,KAAK,MAAM,CAAC,IAAI,QAAQ,MAAM;IAC5B,IAAI,QAAQ,GAAG;KACb,MAAM,QAAQ,KAAK,MAAM,IAAI,EAAE;KAC/B,IAAI,OAAO,IAAI,IAAI,IAAI,MAAM,OAAO,MAAM,CAAC;KAC3C;IACF;IACA,MAAM,MAAM,OAAO,IAAI,GAAG,qBAAK,IAAI,IAAY;IAC/C,IAAI,IAAI,EAAE;IACV,OAAO,IAAI,KAAK,GAAG;GACrB;GACA,KAAK,MAAM,OAAO,UAAU;IAC1B,MAAM,MAAM,OAAO,IAAI,IAAI,GAAG;IAC9B,IAAI,CAAC,KAAK;IACV,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,SAAS,IAAI,OAAO,GAAG,KAAK;KAClD,IAAI,IAAI,OAAO,OAAO,GAAG;KACzB,MAAM,CAAC,QAAS,MAAM,KAAK,OAAO,MAAM,KAAK,CAAC,CAAC,CAAC;KAChD,IAAI,SAA8B;KAClC,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,QAAQ,KAAK;MACxC,MAAM,KAAK,KAAK,IAAI;MACpB,IAAI,CAAC,IAAI,IAAI,EAAE,GAAG;MAClB,WAAW,MAAM,KAAK,OAAO,OAAO,KAAK,CAAC;MAC1C,IAAI,IAAI,IAAI,OAAO,MAAM,IAAI,KAAK,OAAO,IAAI,KAAK,KAAK,IAAI,CAAC;MAC5D,IAAI,OAAO,EAAE;KACf;IACF;GACF;GACA,OAAO;EACT,CAAC;CACH;;CAKA,MAAM,UAA2B;EAC/B,KAAK,aAAa;EAClB,OAAO,KAAK,aAAa,YAAY;GACnC,MAAM,WAAW,MAAM,KAAK,WAAW,aAAa;IAClD,QAAQ,KAAK,OAAO;IACpB,SAAS,CAAC,GAAG,KAAK,MAAM,QAAQ,CAAC;GACnC,EAAE;GACF,IAAI,SAAS,QAAQ,WAAW,GAAG,OAAO;GAE1C,MAAM,IAAI,SAAS,QAAQ;GAC3B,MAAM,MAAM,IAAI,aAAa,CAAC;GAC9B,MAAM,UAAU,IAAI,aAAa,IAAI,KAAK,IAAI;GAC9C,SAAS,QAAQ,SAAS,CAAC,IAAI,IAAI,MAAM;IACvC,IAAI,KAAK;IACT,QAAQ,IAAI,EAAE,QAAQ,IAAI,KAAK,IAAI;GACrC,CAAC;GACD,MAAM,QAAQ,KAAK,OAAO,KAAK,OAAO;GAEtC,MAAM,KAAK,iBACT,KAAK,cAAc,YAAY;IAC7B,MAAM,MAAM,KAAK,OAAO,OAAO,CAAC;IAChC,MAAM,OAAc;KAClB,GAAG,KAAK;KACR,SAAS,IAAI,MAAM;KACnB,UAAU,CAAC,GAAG,KAAK,OAAO,UAAU,GAAG;IACzC;IACA,MAAM,EAAE,KAAK,MAAM,SAAS,KAAK;IACjC,MAAM,cAAc,KAAK,KAAK,OAAO,OAAO;KAC1C,MAAM,KAAK,OAAO,MAAM,IAAI,IAAI,KAAK,KAAK;KAC1C,MAAM,GAAG,MACP,UAAU,KAAK;yCACY,KAAK,mBAChC,CAAC,IAAI,KAAK,SAAS,MAAM,CAC3B;KACA,MAAM,GAAG,MAAM,eAAe,KAAK,kBAAkB,CAAC,SAAS,MAAM,CAAC;KACtE,MAAM,KAAK,WAAW,IAAI,IAAI;IAChC,CAAC;IACD,KAAK,SAAS;IACd,KAAK,MAAM,CAAC,IAAI,MAAM,KAAK,OAAO,IAAI,EAAE,OAAO,SAAS,QAAQ,KAAK,MAAM,OAAO,EAAE;IACpF,KAAK,YAAY,CAAC,GAAG,KAAK,WAAW,KAAK,WAAW,KAAK,KAAK,CAAC;GAClE,CAAC,CACH;GACA,OAAO;EACT,CAAC;CACH;;;;;CAMA,MAAM,QAAyB;EAC7B,KAAK,aAAa;EAClB,OAAO,KAAK,aAAa,YAAY;GACnC,MAAM,MAAM,KAAK;GACjB,IAAI,IAAI,WAAW,GAAG,OAAO;GAC7B,MAAM,UAAU,IAAI,KAAK,MAAM,EAAE,GAAG;GAEpC,MAAM,SAAmB,CAAC;GAC1B,MAAM,SAAyB,CAAC;GAChC,KAAK,MAAM,OAAO,KAChB,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,OAAO,KAAK;IAClC,IAAI,IAAI,OAAO,OAAO,GAAG;IACzB,MAAM,CAAC,QAAS,MAAM,KAAK,OAAO,MAAM,KAAK,CAAC,CAAC,CAAC;IAChD,MAAM,SAAS,MAAM,KAAK,OAAO,OAAO,KAAK,CAAC;IAC9C,MAAM,OAAO,MAAM,KAAK,aAAa,MAAM,KAAK,KAAK,GAAG,CAAC;IACzD,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,QAAQ,KAAK;KACxC,MAAM,KAAK,KAAK,IAAI;KACpB,IAAI,KAAK,IAAI,EAAE,MAAM,IAAI,KAAK;KAC9B,OAAO,KAAK,EAAE;KACd,OAAO,KAAK,OAAO,SAAS,IAAI,KAAK,OAAO,IAAI,KAAK,KAAK,IAAI,CAAC;IACjE;GACF;GAGF,MAAM,IAAI,OAAO;GACjB,MAAM,UAAU,IAAI,aAAa,IAAI,KAAK,IAAI;GAC9C,OAAO,SAAS,GAAG,MAAM;IACvB,QAAQ,IAAI,GAAG,IAAI,KAAK,IAAI;GAC9B,CAAC;GACD,MAAM,QAAQ,IAAI,IAAI,KAAK,OAAO,aAAa,KAAK,MAAM,GAAG,OAAO,IAAI;GAExE,MAAM,KAAK,iBACT,KAAK,cAAc,YAAY;IAC7B,MAAM,MAAM,QAAQ,KAAK,OAAO,OAAO,CAAC,IAAI;IAC5C,MAAM,OAAO,KAAK,OAAO,SAAS,QAAQ,MAAM,CAAC,QAAQ,SAAS,EAAE,GAAG,CAAC;IACxE,MAAM,OAAc;KAClB,GAAG,KAAK;KACR,SAAS,MAAM,IAAI,MAAM,IAAI,KAAK,OAAO;KACzC,UAAU,MAAM,CAAC,GAAG,MAAM,GAAG,IAAI;IACnC;IACA,MAAM,cAAc,KAAK,KAAK,OAAO,OAAO;KAC1C,IAAI,OAAO,OAAO;MAChB,MAAM,KAAK,OAAO,MAAM,IAAI,IAAI,KAAK,KAAK;MAC1C,MAAM,GAAG,MACP,UAAU,KAAK,GAAG,IAAI,6DACtB,CAAC,IAAI,KAAK,KAAK,UAAU,OAAO,CAAC,CACnC;KACF;KACA,MAAM,KAAK,WAAW,IAAI,IAAI;IAChC,CAAC;IACD,KAAK,SAAS;IACd,KAAK,YAAY,CACf,GAAG,KAAK,UAAU,QAAQ,MAAM,CAAC,QAAQ,SAAS,EAAE,GAAG,CAAC,GACxD,GAAI,OAAO,QAAQ,CAAC,KAAK,WAAW,KAAK,KAAK,CAAC,IAAI,CAAC,CACtD;IACA,KAAK,SAAS,KAAK,GAAG,GAAG;GAC3B,CAAC,CACH;GACA,MAAM,KAAK,MAAM;GACjB,OAAO;EACT,CAAC;CACH;;CAGA,MAAM,WAA0B;EAC9B,MAAM,KAAK,QAAQ;EACnB,MAAM,KAAK,MAAM;CACnB;CAIA,OAAO,KAAmB,SAAqC;EAC7D,OAAO,aAAa;GAClB,MAAM,KAAK;GACX,QAAQ,KAAK;GACb;GACA;GACA,OAAO,KAAK,SAAS,IAAI,MAAM;EACjC,CAAC;CACH;CAEA,OAAO,OAAqB,OAA2B;EACrD,OAAO;GAAE,KAAK,KAAK,OAAO;GAAS;GAAO,OAAO,MAAM;EAAM;CAC/D;CAEA,WAAW,KAAiB,OAAmC;EAC7D,OAAO,IAAI,aAAa,IAAI,KAAK,KAAK,MAAM,KAAK,QAAQ,MAAM,WAAW,MAAM,MAAM;CACxF;CAEA,MAAM,aAAa,KAA6C;EAC9D,MAAM,sBAAM,IAAI,IAAoB;EACpC,MAAM,SAAS,CAAC,GAAG,IAAI,IAAI,GAAG,CAAC;EAC/B,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,gBAAgB;GACtD,MAAM,OAAO,MAAM,KAAK,IAAI,MAC1B,uBAAuB,KAAK,GAAG,IAAI,gDACnC,CAAC,KAAK,UAAU,OAAO,MAAM,GAAG,IAAI,cAAc,CAAC,CAAC,CACtD;GACA,KAAK,MAAM,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,EAAE,GAAG,OAAO,EAAE,GAAG,CAAC;EAC3D;EACA,OAAO;CACT;CAEA,MAAM,WAAW,IAAQ,OAA6B;EACpD,MAAM,GAAG,MACP,eAAe,KAAK,GAAG,KAAK;qDAE5B,CAAC,KAAK,UAAU,KAAK,CAAC,CACxB;CACF;;CAGA,MAAM,QAAuB;EAC3B,MAAM,QAAQ,KAAK,SAAS,QAAQ,OAAO,KAAK,MAAM,IAAI,CAAC,KAAK,OAAO,CAAC;EACxE,IAAI,MAAM,WAAW,GAAG;EACxB,KAAK,WAAW,KAAK,SAAS,QAAQ,MAAM,CAAC,MAAM,SAAS,CAAC,CAAC;EAC9D,KAAK,MAAM,KAAK,OAAO,KAAK,MAAM,OAAO,CAAC;EAC1C,MAAM,OAAO,MAAM,KAAK,MAAM,EAAE,GAAG;EACnC,MAAM,cAAc,KAAK,MAAM,OAAO,KAAK,OAAO,KAAK,IAAI,IAAI,CAAC;CAClE;;;;;;CAOA,MAAM,MAAS,MAA4D;EACzE,KAAK,IAAI,UAAU,IAAK,WAAW;GACjC,MAAM,QAAQ,KAAK;GACnB,MAAM,WAAW,KAAK;GACtB,KAAK,MAAM,KAAK,UAAU,KAAK,MAAM,IAAI,IAAI,KAAK,MAAM,IAAI,CAAC,KAAK,KAAK,CAAC;GACxE,IAAI;IACF,MAAM,SAAS,MAAM,KAAK,QAAQ;IAClC,IAAI,YAAY,KAAM,QAAQ,MAAM,KAAK,UAAU,KAAK,QAAS,OAAO;GAC1E,UAAU;IACR,KAAK,MAAM,KAAK,UAAU,KAAK,MAAM,IAAI,IAAI,KAAK,MAAM,IAAI,CAAC,KAAK,KAAK,CAAC;IACxE,KAAU,MAAM,CAAC,CAAC,YAAY,CAAC,CAAC;GAClC;EACF;CACF;;CAGA,MAAM,cAAc,IAAwC;EAC1D,KAAK;EACL,IAAI;GACF,MAAM,GAAG;EACX,UAAU;GACR,KAAK;EACP;CACF;CAEA,WAAc,IAAkC;EAC9C,MAAM,MAAM,KAAK,OAAO,KAAK,IAAI,EAAE;EACnC,KAAK,SAAS,IAAI,YAAY,CAAC,CAAC;EAChC,OAAO;CACT;CAEA,MAAM,aAAgB,IAAkC;EACtD,IAAI,KAAK,cAAc,MAAM,IAAI,MAAM,gDAAgD;EACvF,KAAK,eAAe;EACpB,IAAI;GACF,OAAO,MAAM,GAAG;EAClB,UAAU;GACR,KAAK,eAAe;EACtB;CACF;CAEA,eAAe;EACb,IAAI,CAAC,KAAK,QAAQ,MAAM,IAAI,MAAM,iCAAiC;CACrE;AACF;AAEA,SAAS,SAAS,IAAY;CAC5B,IAAI,CAAC,OAAO,cAAc,EAAE,GAC1B,MAAM,IAAI,MAAM,gDAAgD,IAAI;AACxE;;AAGA,eAAsB,gBAAgB,IAAQ,QAA+B;CAC3E,IAAI,CAAC,eAAe,KAAK,MAAM,GAAG,MAAM,IAAI,MAAM,4BAA4B,QAAQ;CACtF,MAAM,cAAc,IAAI,OAAO,OAAO;EACpC,KAAK,MAAM,KAAK;GAAC;GAAQ;GAAO;GAAQ;GAAa;GAAO;EAAK,GAC/D,MAAM,GAAG,KAAK,wBAAwB,SAAS,GAAG;CAEtD,CAAC;AACH"}
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "@statewalker/db-sqlite-index",
3
- "version": "0.1.0",
3
+ "version": "0.1.1",
4
4
  "private": false,
5
5
  "type": "module",
6
6
  "description": "Id-based vector (IVF) and n-gram indexes stored in SQLite through @statewalker/db-api: Node, browser and Durable Objects.",
@@ -35,8 +35,8 @@
35
35
  "src"
36
36
  ],
37
37
  "dependencies": {
38
- "@statewalker/db-api": "^0.1.4",
39
- "@statewalker/db-sqlite": "^0.1.0"
38
+ "@statewalker/db-api": "^0.1.5",
39
+ "@statewalker/db-sqlite": "^0.1.1"
40
40
  },
41
41
  "devDependencies": {
42
42
  "@types/node": "^26.6.4",
@@ -44,9 +44,9 @@
44
44
  "tsdown": "^0.23.0",
45
45
  "tsx": "^4.23.15",
46
46
  "typescript": "^7.0.2",
47
- "vitest": "^5.0.3",
48
- "@statewalker/db-sqlite-do": "^0.1.0",
49
- "@statewalker/db-sqlite-node": "^0.3.0"
47
+ "vitest": "^4.1.10 || ^5.0.3",
48
+ "@statewalker/db-sqlite-do": "^0.1.1",
49
+ "@statewalker/db-sqlite-node": "^0.3.1"
50
50
  },
51
51
  "sideEffects": false,
52
52
  "publishConfig": {
@@ -1,5 +1,6 @@
1
1
  import type { Db } from "@statewalker/db-api";
2
2
  import { inTransaction } from "@statewalker/db-sqlite";
3
+ import { PREFIX_PATTERN } from "../prefix.js";
3
4
  import { type GramBackend, type NgramItem, newFts5Backend } from "./fts5-backend.js";
4
5
  import { chunkJson } from "./json-chunks.js";
5
6
  import { planQuery } from "./plan-query.js";
@@ -40,8 +41,8 @@ export class NgramStore {
40
41
  readonly #backend: GramBackend;
41
42
 
42
43
  constructor({ db, prefix, store = "fts5" }: NgramStoreOptions) {
43
- if (!/^[A-Za-z_][A-Za-z0-9_]*$/.test(prefix)) {
44
- throw new Error(`ngram: prefix "${prefix}" must match /^[A-Za-z_][A-Za-z0-9_]*$/`);
44
+ if (!PREFIX_PATTERN.test(prefix)) {
45
+ throw new Error(`ngram: prefix "${prefix}" must match ${PREFIX_PATTERN}`);
45
46
  }
46
47
  if (store !== "fts5" && store !== "postings")
47
48
  throw new Error(`ngram: unknown store "${store}"`);
package/src/prefix.ts ADDED
@@ -0,0 +1,2 @@
1
+ /** Table-name prefixes the indexes accept: an SQL identifier, so it is safe to interpolate. */
2
+ export const PREFIX_PATTERN = /^[A-Za-z_][A-Za-z0-9_]*$/;
@@ -77,13 +77,6 @@ export function distanceInt8(
77
77
  return metric === "cosine" ? 1 - s : -s;
78
78
  }
79
79
 
80
- export function dequantizeInt8(codes: Int8Array, co: number, scale: number, d: number) {
81
- const out = new Float32Array(d);
82
- const f = scale / 127;
83
- for (let i = 0; i < d; i++) out[i] = codes[co + i] * f;
84
- return out;
85
- }
86
-
87
80
  // ------------------------------------------------------------ 1-bit
88
81
 
89
82
  export const wordsFor = (d: number) => (d + 31) >>> 5;
@@ -1,5 +1,6 @@
1
1
  import type { Db } from "@statewalker/db-api";
2
2
  import { inTransaction } from "@statewalker/db-sqlite";
3
+ import { PREFIX_PATTERN } from "../prefix.js";
3
4
  import { distance, prepare, TopK } from "./math.js";
4
5
  import {
5
6
  type BuiltSegment,
@@ -101,7 +102,7 @@ export class VectorIndex {
101
102
  #epoch = 0;
102
103
 
103
104
  constructor(opts: VectorIndexOptions) {
104
- if (!/^[A-Za-z_][A-Za-z0-9_]*$/.test(opts.prefix)) {
105
+ if (!PREFIX_PATTERN.test(opts.prefix)) {
105
106
  throw new Error(`vector-index: bad prefix ${opts.prefix}`);
106
107
  }
107
108
  if (!Number.isInteger(opts.dims) || opts.dims < 1) {
@@ -576,8 +577,7 @@ function assertId(id: number) {
576
577
 
577
578
  /** Drops every table of the index under `prefix`, in one transaction. Needs no dims or metric. */
578
579
  export async function dropVectorIndex(db: Db, prefix: string): Promise<void> {
579
- if (!/^[A-Za-z_][A-Za-z0-9_]*$/.test(prefix))
580
- throw new Error(`vector-index: bad prefix ${prefix}`);
580
+ if (!PREFIX_PATTERN.test(prefix)) throw new Error(`vector-index: bad prefix ${prefix}`);
581
581
  await inTransaction(db, async (tx) => {
582
582
  for (const t of ["meta", "ids", "tail", "centroids", "seg", "f32"]) {
583
583
  await tx.exec(`DROP TABLE IF EXISTS ${prefix}${t}`);