@statewalker/db-sqlite-index 0.1.0 → 0.1.2

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/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) {
@@ -14,7 +15,10 @@ function prepare(v, dims, metric) {
14
15
  if (v.length !== dims) throw new Error(`vector-index: expected ${dims} dims, got ${v.length}`);
15
16
  const f = v instanceof Float32Array ? v : Float32Array.from(v);
16
17
  for (let i = 0; i < f.length; i++) if (!Number.isFinite(f[i])) throw new Error("vector-index: vector contains a non-finite value");
17
- return metric === "cosine" ? normalize(f) : f.slice();
18
+ if (metric !== "cosine") return f.slice();
19
+ const out = normalize(f);
20
+ if (!out.some((x) => x !== 0)) throw new Error("vector-index: a zero vector has no direction under the cosine metric");
21
+ return out;
18
22
  }
19
23
  /** Distance between two float vectors at offsets; lower is closer. */
20
24
  function distance(metric, a, ao, b, bo, d) {
@@ -347,6 +351,8 @@ function parseList(bytes, count, dims) {
347
351
  };
348
352
  }
349
353
  /** The in-memory part of a segment: centroids and list sizes. List blocks are fetched by the caller. */
354
+ /** The share of a segment's lists that {@link SegmentIndex.probe} may widen to for `minRows`. */
355
+ const MAX_WIDEN_FRACTION = 1 / 3;
350
356
  var SegmentIndex = class {
351
357
  gen;
352
358
  dims;
@@ -363,21 +369,66 @@ var SegmentIndex = class {
363
369
  get nlist() {
364
370
  return this.counts.length;
365
371
  }
366
- /** The `nprobe` non-empty lists whose centroids are closest to the query. */
367
- probe(query, nprobe) {
372
+ /**
373
+ * The non-empty lists closest to the query, in centroid order: at least the
374
+ * `nprobe` nearest, then more until the probed lists hold `minRows` rows (or
375
+ * none are left). `minRows` 0 probes exactly `nprobe` lists. The widening
376
+ * stops at a third of the lists ({@link MAX_WIDEN_FRACTION}), so a large `k`
377
+ * never turns a search into a scan of every list.
378
+ */
379
+ probe(query, nprobe, minRows = 0) {
380
+ const maxLists = Math.max(nprobe, Math.ceil(this.nlist * MAX_WIDEN_FRACTION));
368
381
  const m = this.metric === "l2" ? "l2" : "dot";
369
- const top = new TopK(Math.min(nprobe, this.nlist));
382
+ const scored = [];
370
383
  for (let c = 0; c < this.nlist; c++) {
371
384
  if (this.counts[c] === 0) continue;
372
- top.push(distance(m, query, 0, this.centroids, c * this.dims, this.dims), c);
385
+ scored.push({
386
+ d: distance(m, query, 0, this.centroids, c * this.dims, this.dims),
387
+ c
388
+ });
373
389
  }
374
- return top.sorted().map((e) => e.item);
390
+ scored.sort((a, b) => a.d - b.d || a.c - b.c);
391
+ const out = [];
392
+ let rows = 0;
393
+ for (const { c } of scored) {
394
+ if (out.length >= nprobe && (rows >= minRows || out.length >= maxLists)) break;
395
+ out.push(c);
396
+ rows += this.counts[c];
397
+ }
398
+ return out;
399
+ }
400
+ /**
401
+ * Whether stage 1 passes a list of `n` rows whole (in row order, not ranked):
402
+ * a list no longer than `limit`, or a flat segment's only list of at most
403
+ * {@link MIN_TRAIN} rows. Callers must not cut such a list by position.
404
+ */
405
+ passesWhole(n, limit) {
406
+ return n <= limit || this.nlist === 1 && n <= 2048;
375
407
  }
376
408
  /**
377
409
  * Stage 1: the `limit` rows of a list with the best estimated distance, from
378
410
  * residual sign bits plus the stored residual norm and centroid projection.
411
+ *
412
+ * A flat segment (one list of at most {@link MIN_TRAIN} rows) passes every row:
413
+ * its centroid is the mean of all vectors, far from most of them on clustered
414
+ * data, so the 1-bit estimate is weakest exactly there (issue #40), while
415
+ * int8-scoring the whole list costs no more than scanning the tail. A list
416
+ * that does not exceed `limit` also passes whole, without estimating.
379
417
  */
380
418
  filterList(query, c, data, limit, keep) {
419
+ const n = data.ids.length;
420
+ if (this.passesWhole(n, limit)) {
421
+ const all = [];
422
+ for (let r = 0; r < n; r++) {
423
+ const id = data.ids[r];
424
+ if (!keep || keep(id)) all.push({
425
+ list: c,
426
+ row: r,
427
+ id
428
+ });
429
+ }
430
+ return all;
431
+ }
381
432
  const d = this.dims;
382
433
  const w = wordsFor(d);
383
434
  const co = c * d;
@@ -390,7 +441,7 @@ var SegmentIndex = class {
390
441
  const angle = Math.PI / d;
391
442
  const l2 = this.metric === "l2";
392
443
  const top = new TopK(limit);
393
- for (let r = 0; r < data.ids.length; r++) {
444
+ for (let r = 0; r < n; r++) {
394
445
  const id = data.ids[r];
395
446
  if (keep && !keep(id)) continue;
396
447
  const rr = qn * data.rnorm[r] * Math.cos(angle * hamming(qb, data.bits, r * w, w));
@@ -599,6 +650,13 @@ var Lru = class {
599
650
  //#region src/vector/vector-index.ts
600
651
  /** Ids per lookup (bound as one JSON parameter). */
601
652
  const VALIDATE_BATCH = 2e3;
653
+ /** Lists probed per segment when the caller passes no `nprobe`. */
654
+ const DEFAULT_NPROBE = 8;
655
+ /**
656
+ * Without an explicit `nprobe`, probe lists until they hold this many times
657
+ * `k × oversample` rows (#67).
658
+ */
659
+ const PROBE_ROWS_FACTOR = 16;
602
660
  /** Upserted rows per transaction. */
603
661
  const WRITE_BATCH = 200;
604
662
  /**
@@ -641,7 +699,7 @@ var VectorIndex = class {
641
699
  /** Bumped before and after each commit that changes the segment list: odd while one runs. */
642
700
  #epoch = 0;
643
701
  constructor(opts) {
644
- if (!/^[A-Za-z_][A-Za-z0-9_]*$/.test(opts.prefix)) throw new Error(`vector-index: bad prefix ${opts.prefix}`);
702
+ if (!PREFIX_PATTERN.test(opts.prefix)) throw new Error(`vector-index: bad prefix ${opts.prefix}`);
645
703
  if (!Number.isInteger(opts.dims) || opts.dims < 1) throw new Error("vector-index: dims must be a positive integer");
646
704
  this.dims = opts.dims;
647
705
  this.metric = opts.metric ?? "cosine";
@@ -763,39 +821,75 @@ var VectorIndex = class {
763
821
  }
764
822
  async search(query, opts = {}) {
765
823
  this.#assertReady();
824
+ opts.signal?.throwIfAborted();
766
825
  const k = opts.k ?? 10;
767
- const nprobe = opts.nprobe ?? 8;
768
826
  const perList = k * (opts.oversample ?? 8);
827
+ const nprobe = opts.nprobe ?? DEFAULT_NPROBE;
828
+ const minRows = opts.nprobe === void 0 ? PROBE_ROWS_FACTOR * perList : 0;
769
829
  const q = prepare(query, this.dims, this.metric);
770
830
  const d = this.dims;
771
831
  const filter = opts.filter;
832
+ const rerank = opts.exact ? k * 4 : k;
772
833
  return this.#read(async (segments) => {
834
+ opts.signal?.throwIfAborted();
773
835
  const tailTop = new TopK(k);
774
836
  for (const [id, { vector }] of this.#tail) {
775
837
  if (filter && !filter(id)) continue;
776
838
  tailTop.push(distance(this.metric, q, 0, vector, 0, d), id);
777
839
  }
778
- const hits = [];
779
- const keep = (id) => !this.#tail.has(id) && (!filter || filter(id));
840
+ const probed = [];
780
841
  await Promise.all(segments.map(async (seg) => {
781
- const lists = seg.probe(q, nprobe);
842
+ const lists = seg.probe(q, nprobe, minRows);
782
843
  const datas = await this.#store.lists(seg, lists);
783
- opts.signal?.throwIfAborted();
784
- lists.forEach((c, i) => {
785
- const data = datas[i];
786
- for (const cand of seg.filterList(q, c, data, perList, keep)) hits.push({
787
- ...cand,
844
+ lists.forEach((list, i) => {
845
+ probed.push({
788
846
  seg,
789
- data
847
+ list,
848
+ data: datas[i]
790
849
  });
791
850
  });
792
851
  }));
793
- const live = await this.#generations(hits.map((h) => h.id));
794
- const segTop = new TopK(opts.exact ? k * 4 : k);
795
- for (const h of hits) {
796
- if (live.get(h.id) !== h.seg.gen) continue;
797
- segTop.push(h.seg.scoreInt8(q, h.data, h.row), h);
852
+ opts.signal?.throwIfAborted();
853
+ const gens = /* @__PURE__ */ new Map();
854
+ const hits = [];
855
+ let pending = probed.map((p) => ({
856
+ ...p,
857
+ limit: perList
858
+ }));
859
+ while (pending.length > 0) {
860
+ const rounds = pending.map((p) => {
861
+ const keep = (id) => !this.#tail.has(id) && !(gens.has(id) && gens.get(id) !== p.seg.gen) && (!filter || filter(id));
862
+ return {
863
+ p,
864
+ cands: p.seg.filterList(q, p.list, p.data, p.limit, keep)
865
+ };
866
+ });
867
+ const unknown = rounds.flatMap((r) => r.cands.map((c) => c.id)).filter((id) => !gens.has(id));
868
+ if (unknown.length > 0) {
869
+ const found = await this.#generations(unknown);
870
+ for (const id of unknown) gens.set(id, found.get(id));
871
+ opts.signal?.throwIfAborted();
872
+ }
873
+ pending = [];
874
+ for (const { p, cands } of rounds) {
875
+ const live = cands.filter((c) => gens.get(c.id) === p.seg.gen);
876
+ const whole = p.seg.passesWhole(p.data.ids.length, p.limit);
877
+ if (!whole && live.length < perList && cands.length === p.limit) {
878
+ pending.push({
879
+ ...p,
880
+ limit: p.limit * 2
881
+ });
882
+ continue;
883
+ }
884
+ for (const cand of whole ? live : live.slice(0, perList)) hits.push({
885
+ ...cand,
886
+ seg: p.seg,
887
+ data: p.data
888
+ });
889
+ }
798
890
  }
891
+ const segTop = new TopK(rerank);
892
+ for (const h of hits) segTop.push(h.seg.scoreInt8(q, h.data, h.row), h);
799
893
  let segResults = segTop.sorted().map((e) => ({
800
894
  id: e.item.id,
801
895
  distance: e.score,
@@ -1043,7 +1137,7 @@ function assertId(id) {
1043
1137
  }
1044
1138
  /** Drops every table of the index under `prefix`, in one transaction. Needs no dims or metric. */
1045
1139
  async function dropVectorIndex(db, prefix) {
1046
- if (!/^[A-Za-z_][A-Za-z0-9_]*$/.test(prefix)) throw new Error(`vector-index: bad prefix ${prefix}`);
1140
+ if (!PREFIX_PATTERN.test(prefix)) throw new Error(`vector-index: bad prefix ${prefix}`);
1047
1141
  await inTransaction(db, async (tx) => {
1048
1142
  for (const t of [
1049
1143
  "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 if (metric !== \"cosine\") return f.slice();\n const out = normalize(f);\n if (!out.some((x) => x !== 0)) {\n throw new Error(\"vector-index: a zero vector has no direction under the cosine metric\");\n }\n return out;\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. */\n/** The share of a segment's lists that {@link SegmentIndex.probe} may widen to for `minRows`. */\nexport const MAX_WIDEN_FRACTION = 1 / 3;\n\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 /**\n * The non-empty lists closest to the query, in centroid order: at least the\n * `nprobe` nearest, then more until the probed lists hold `minRows` rows (or\n * none are left). `minRows` 0 probes exactly `nprobe` lists. The widening\n * stops at a third of the lists ({@link MAX_WIDEN_FRACTION}), so a large `k`\n * never turns a search into a scan of every list.\n */\n probe(query: Float32Array, nprobe: number, minRows = 0): number[] {\n const maxLists = Math.max(nprobe, Math.ceil(this.nlist * MAX_WIDEN_FRACTION));\n const m: Metric = this.metric === \"l2\" ? \"l2\" : \"dot\";\n const scored: { d: number; c: number }[] = [];\n for (let c = 0; c < this.nlist; c++) {\n if (this.counts[c] === 0) continue;\n scored.push({ d: distance(m, query, 0, this.centroids, c * this.dims, this.dims), c });\n }\n scored.sort((a, b) => a.d - b.d || a.c - b.c);\n const out: number[] = [];\n let rows = 0;\n for (const { c } of scored) {\n if (out.length >= nprobe && (rows >= minRows || out.length >= maxLists)) break;\n out.push(c);\n rows += this.counts[c];\n }\n return out;\n }\n\n /**\n * Whether stage 1 passes a list of `n` rows whole (in row order, not ranked):\n * a list no longer than `limit`, or a flat segment's only list of at most\n * {@link MIN_TRAIN} rows. Callers must not cut such a list by position.\n */\n passesWhole(n: number, limit: number): boolean {\n return n <= limit || (this.nlist === 1 && n <= MIN_TRAIN);\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 * A flat segment (one list of at most {@link MIN_TRAIN} rows) passes every row:\n * its centroid is the mean of all vectors, far from most of them on clustered\n * data, so the 1-bit estimate is weakest exactly there (issue #40), while\n * int8-scoring the whole list costs no more than scanning the tail. A list\n * that does not exceed `limit` also passes whole, without estimating.\n */\n filterList(\n query: Float32Array,\n c: number,\n data: ListData,\n limit: number,\n keep?: (id: number) => boolean,\n ): Candidate[] {\n const n = data.ids.length;\n if (this.passesWhole(n, limit)) {\n const all: Candidate[] = [];\n for (let r = 0; r < n; r++) {\n const id = data.ids[r];\n if (!keep || keep(id)) all.push({ list: c, row: r, id });\n }\n return all;\n }\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 < n; 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 /**\n * IVF lists probed per segment, exactly. Default: at least 8, more until the\n * probed lists hold 16 × k × oversample rows (small lists after auto-compaction).\n */\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/** Lists probed per segment when the caller passes no `nprobe`. */\nconst DEFAULT_NPROBE = 8;\n/**\n * Without an explicit `nprobe`, probe lists until they hold this many times\n * `k × oversample` rows (#67).\n */\nconst PROBE_ROWS_FACTOR = 16;\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 opts.signal?.throwIfAborted();\n const k = opts.k ?? 10;\n const perList = k * (opts.oversample ?? 8);\n // An explicit nprobe probes exactly that many lists. The default probes at least\n // DEFAULT_NPROBE lists and keeps going while they hold fewer than\n // PROBE_ROWS_FACTOR × perList rows: after auto-compaction lists are small\n // (~65 rows at 4200 vectors), and 8 of them miss neighbours spread over many (#67).\n const nprobe = opts.nprobe ?? DEFAULT_NPROBE;\n const minRows = opts.nprobe === undefined ? PROBE_ROWS_FACTOR * perList : 0;\n const q = prepare(query, this.dims, this.metric);\n const d = this.dims;\n const filter = opts.filter;\n const rerank = opts.exact ? k * 4 : k;\n\n return this.#read(async (segments) => {\n opts.signal?.throwIfAborted();\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 // Probe lists and load their blocks.\n type Probed = { seg: SegmentIndex; list: number; data: ListData };\n const probed: Probed[] = [];\n await Promise.all(\n segments.map(async (seg) => {\n const lists = seg.probe(q, nprobe, minRows);\n const datas = await this.#store.lists(seg, lists);\n lists.forEach((list, i) => {\n probed.push({ seg, list, data: datas[i] as ListData });\n });\n }),\n );\n opts.signal?.throwIfAborted();\n\n // Stage 1: keep the best `perList` rows of each list by estimated residual\n // distance. A segment row counts only if its generation holds the live copy\n // of its id. Rows found dead (deleted, or overwritten in another generation)\n // are excluded and the list is filtered again with a doubled limit, so dead\n // rows never take the slots of live ones (#33).\n type Hit = Candidate & { seg: SegmentIndex; data: ListData };\n const gens = new Map<number, number | undefined>(); // id -> live gen; undefined = deleted\n const hits: Hit[] = [];\n let pending = probed.map((p) => ({ ...p, limit: perList }));\n while (pending.length > 0) {\n const rounds = pending.map((p) => {\n // Tail ids are never live in a segment; known-dead rows are skipped too.\n const keep = (id: number) =>\n !this.#tail.has(id) &&\n !(gens.has(id) && gens.get(id) !== p.seg.gen) &&\n (!filter || filter(id));\n return { p, cands: p.seg.filterList(q, p.list, p.data, p.limit, keep) };\n });\n const unknown = rounds\n .flatMap((r) => r.cands.map((c) => c.id))\n .filter((id) => !gens.has(id));\n if (unknown.length > 0) {\n const found = await this.#generations(unknown);\n for (const id of unknown) gens.set(id, found.get(id));\n opts.signal?.throwIfAborted();\n }\n pending = [];\n for (const { p, cands } of rounds) {\n const live = cands.filter((c) => gens.get(c.id) === p.seg.gen);\n // A list passed whole comes in row order: keep all of it, the int8 re-rank ranks it.\n const whole = p.seg.passesWhole(p.data.ids.length, p.limit);\n if (!whole && live.length < perList && cands.length === p.limit) {\n pending.push({ ...p, limit: p.limit * 2 }); // some were dead and more rows remain\n continue;\n }\n for (const cand of whole ? live : live.slice(0, perList))\n hits.push({ ...cand, seg: p.seg, data: p.data });\n }\n }\n\n // Stage 2: int8 re-rank.\n const segTop = new TopK<Hit>(rerank);\n for (const h of hits) {\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,IAAI,WAAW,UAAU,OAAO,EAAE,MAAM;CACxC,MAAM,MAAM,UAAU,CAAC;CACvB,IAAI,CAAC,IAAI,MAAM,MAAM,MAAM,CAAC,GAC1B,MAAM,IAAI,MAAM,sEAAsE;CAExF,OAAO;AACT;;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;;;;AC3KA,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;;;AAUA,MAAa,qBAAqB,IAAI;AAEtC,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;;;;;;;;CASA,MAAM,OAAqB,QAAgB,UAAU,GAAa;EAChE,MAAM,WAAW,KAAK,IAAI,QAAQ,KAAK,KAAK,KAAK,QAAQ,kBAAkB,CAAC;EAC5E,MAAM,IAAY,KAAK,WAAW,OAAO,OAAO;EAChD,MAAM,SAAqC,CAAC;EAC5C,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,KAAK;GACnC,IAAI,KAAK,OAAO,OAAO,GAAG;GAC1B,OAAO,KAAK;IAAE,GAAG,SAAS,GAAG,OAAO,GAAG,KAAK,WAAW,IAAI,KAAK,MAAM,KAAK,IAAI;IAAG;GAAE,CAAC;EACvF;EACA,OAAO,MAAM,GAAG,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;EAC5C,MAAM,MAAgB,CAAC;EACvB,IAAI,OAAO;EACX,KAAK,MAAM,EAAE,OAAO,QAAQ;GAC1B,IAAI,IAAI,UAAU,WAAW,QAAQ,WAAW,IAAI,UAAU,WAAW;GACzE,IAAI,KAAK,CAAC;GACV,QAAQ,KAAK,OAAO;EACtB;EACA,OAAO;CACT;;;;;;CAOA,YAAY,GAAW,OAAwB;EAC7C,OAAO,KAAK,SAAU,KAAK,UAAU,KAAK,KAAA;CAC5C;;;;;;;;;;;CAYA,WACE,OACA,GACA,MACA,OACA,MACa;EACb,MAAM,IAAI,KAAK,IAAI;EACnB,IAAI,KAAK,YAAY,GAAG,KAAK,GAAG;GAC9B,MAAM,MAAmB,CAAC;GAC1B,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;IAC1B,MAAM,KAAK,KAAK,IAAI;IACpB,IAAI,CAAC,QAAQ,KAAK,EAAE,GAAG,IAAI,KAAK;KAAE,MAAM;KAAG,KAAK;KAAG;IAAG,CAAC;GACzD;GACA,OAAO;EACT;EACA,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,GAAG,KAAK;GAC1B,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;;;;AChRA,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;;;;;;;ACxBA,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,iBAAiB;;;;;AAKvB,MAAM,oBAAoB;;AAE1B,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,KAAK,QAAQ,eAAe;EAC5B,MAAM,IAAI,KAAK,KAAK;EACpB,MAAM,UAAU,KAAK,KAAK,cAAc;EAKxC,MAAM,SAAS,KAAK,UAAU;EAC9B,MAAM,UAAU,KAAK,WAAW,KAAA,IAAY,oBAAoB,UAAU;EAC1E,MAAM,IAAI,QAAQ,OAAO,KAAK,MAAM,KAAK,MAAM;EAC/C,MAAM,IAAI,KAAK;EACf,MAAM,SAAS,KAAK;EACpB,MAAM,SAAS,KAAK,QAAQ,IAAI,IAAI;EAEpC,OAAO,KAAK,MAAM,OAAO,aAAa;GACpC,KAAK,QAAQ,eAAe;GAE5B,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,SAAmB,CAAC;GAC1B,MAAM,QAAQ,IACZ,SAAS,IAAI,OAAO,QAAQ;IAC1B,MAAM,QAAQ,IAAI,MAAM,GAAG,QAAQ,OAAO;IAC1C,MAAM,QAAQ,MAAM,KAAK,OAAO,MAAM,KAAK,KAAK;IAChD,MAAM,SAAS,MAAM,MAAM;KACzB,OAAO,KAAK;MAAE;MAAK;MAAM,MAAM,MAAM;KAAe,CAAC;IACvD,CAAC;GACH,CAAC,CACH;GACA,KAAK,QAAQ,eAAe;GAQ5B,MAAM,uBAAO,IAAI,IAAgC;GACjD,MAAM,OAAc,CAAC;GACrB,IAAI,UAAU,OAAO,KAAK,OAAO;IAAE,GAAG;IAAG,OAAO;GAAQ,EAAE;GAC1D,OAAO,QAAQ,SAAS,GAAG;IACzB,MAAM,SAAS,QAAQ,KAAK,MAAM;KAEhC,MAAM,QAAQ,OACZ,CAAC,KAAK,MAAM,IAAI,EAAE,KAClB,EAAE,KAAK,IAAI,EAAE,KAAK,KAAK,IAAI,EAAE,MAAM,EAAE,IAAI,SACxC,CAAC,UAAU,OAAO,EAAE;KACvB,OAAO;MAAE;MAAG,OAAO,EAAE,IAAI,WAAW,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,IAAI;KAAE;IACxE,CAAC;IACD,MAAM,UAAU,OACb,SAAS,MAAM,EAAE,MAAM,KAAK,MAAM,EAAE,EAAE,CAAC,CAAC,CACxC,QAAQ,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC;IAC/B,IAAI,QAAQ,SAAS,GAAG;KACtB,MAAM,QAAQ,MAAM,KAAK,aAAa,OAAO;KAC7C,KAAK,MAAM,MAAM,SAAS,KAAK,IAAI,IAAI,MAAM,IAAI,EAAE,CAAC;KACpD,KAAK,QAAQ,eAAe;IAC9B;IACA,UAAU,CAAC;IACX,KAAK,MAAM,EAAE,GAAG,WAAW,QAAQ;KACjC,MAAM,OAAO,MAAM,QAAQ,MAAM,KAAK,IAAI,EAAE,EAAE,MAAM,EAAE,IAAI,GAAG;KAE7D,MAAM,QAAQ,EAAE,IAAI,YAAY,EAAE,KAAK,IAAI,QAAQ,EAAE,KAAK;KAC1D,IAAI,CAAC,SAAS,KAAK,SAAS,WAAW,MAAM,WAAW,EAAE,OAAO;MAC/D,QAAQ,KAAK;OAAE,GAAG;OAAG,OAAO,EAAE,QAAQ;MAAE,CAAC;MACzC;KACF;KACA,KAAK,MAAM,QAAQ,QAAQ,OAAO,KAAK,MAAM,GAAG,OAAO,GACrD,KAAK,KAAK;MAAE,GAAG;MAAM,KAAK,EAAE;MAAK,MAAM,EAAE;KAAK,CAAC;IACnD;GACF;GAGA,MAAM,SAAS,IAAI,KAAU,MAAM;GACnC,KAAK,MAAM,KAAK,MACd,OAAO,KAAK,EAAE,IAAI,UAAU,GAAG,EAAE,MAAM,EAAE,GAAG,GAAG,CAAC;GAElD,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"}