@noy-db/hub 0.7.0 → 0.8.0-pre.0

package/dist/{chunk-UXWB3FPF.js → chunk-I3JDRCMW.js}

@@ -1,9 +1,9 @@
 import {
   getAtPath
-} from "./chunk-TRGTKX5E.js";
+} from "./chunk-GHLTDZRS.js";
 import {
   SearchNotEnabledError
-} from "./chunk-7O3Y4PPD.js";
+} from "./chunk-244VXYPG.js";
 
 // src/with-lookup/search/tokenize.ts
 var WORD = /[\p{L}\p{N}]+/gu;
@@ -85,25 +85,122 @@ var segmentTokens = (text) => {
 };
 var segmentTokenizer = (text) => segmentTokens(text).map((t) => t.term);
 
+// src/with-lookup/search/phrase.ts
+var QUOTED = /"([^"]*)"(?:~(\d+))?/g;
+function parseSearchQuery(query) {
+  const phrases = [];
+  const rest = query.replace(QUOTED, (_m, body, slop) => {
+    const terms = segmentTokenizer(body);
+    if (terms.length > 0) phrases.push({ terms, slop: slop === void 0 ? void 0 : Number(slop) });
+    return " ";
+  });
+  return { terms: segmentTokenizer(rest), phrases };
+}
+function matchClause(positions, clause) {
+  const lists = [];
+  for (const t of clause.terms) {
+    const l = positions.get(t);
+    if (l === void 0 || l.length === 0) return NO_MATCH;
+    lists.push(l);
+  }
+  return clause.slop === void 0 ? matchOrderedAdjacent(lists) : matchWindow(dedupeByTerm(clause.terms, lists), clause.terms.length + clause.slop);
+}
+var NO_MATCH = { count: 0, start: -1 };
+function matchOrderedAdjacent(lists) {
+  const sets = lists.slice(1).map((l) => new Set(l));
+  let count = 0;
+  let start = -1;
+  for (const p of lists[0]) {
+    let ok = true;
+    for (let i = 0; i < sets.length; i++) {
+      if (!sets[i].has(p + i + 1)) {
+        ok = false;
+        break;
+      }
+    }
+    if (ok) {
+      count++;
+      if (start < 0) start = p;
+    }
+  }
+  return { count, start };
+}
+function dedupeByTerm(terms, lists) {
+  const seen = /* @__PURE__ */ new Set();
+  const out = [];
+  for (let i = 0; i < terms.length; i++) {
+    if (seen.has(terms[i])) continue;
+    seen.add(terms[i]);
+    out.push(lists[i]);
+  }
+  return out;
+}
+function matchWindow(lists, size) {
+  const merged = [];
+  for (let t = 0; t < lists.length; t++) for (const p of lists[t]) merged.push({ pos: p, term: t });
+  merged.sort((a, b) => a.pos - b.pos || a.term - b.term);
+  const need = lists.length;
+  const have = new Array(need).fill(0);
+  let distinct = 0;
+  let left = 0;
+  let count = 0;
+  let start = -1;
+  for (let right = 0; right < merged.length; right++) {
+    const rt = merged[right].term;
+    if (have[rt] === 0) distinct++;
+    have[rt] = have[rt] + 1;
+    while (distinct === need && have[merged[left].term] > 1) {
+      const lt = merged[left].term;
+      have[lt] = have[lt] - 1;
+      left++;
+    }
+    if (distinct === need && merged[right].pos - merged[left].pos + 1 <= size) {
+      count++;
+      if (start < 0) start = merged[left].pos;
+    }
+  }
+  return { count, start };
+}
+
 // src/with-lookup/search/inverted-index.ts
 var K12 = 1.2;
 var B2 = 0.75;
+var INDEX_SNAPSHOT_VERSION = 2;
 var InvertedIndex = class _InvertedIndex {
   // per field: df (term -> #docs), N (#docs), totalLen
   fieldStats = /* @__PURE__ */ new Map();
   docs = [];
-  static build(docs) {
+  posFields = EMPTY_FIELDS;
+  static build(docs, opts = {}) {
     const idx = new _InvertedIndex();
+    const positional = new Set(opts.positions ?? []);
+    idx.posFields = positional;
     for (const d of docs) {
       for (const f of d.fields) {
         const tokens = segmentTokens(f.text);
         const tf = /* @__PURE__ */ new Map();
         const firstOffset = /* @__PURE__ */ new Map();
-        for (const t of tokens) {
+        const pos = positional.has(f.field) ? /* @__PURE__ */ new Map() : void 0;
+        for (let i = 0; i < tokens.length; i++) {
+          const t = tokens[i];
           tf.set(t.term, (tf.get(t.term) ?? 0) + 1);
           if (!firstOffset.has(t.term)) firstOffset.set(t.term, t.offset);
+          if (pos) {
+            const list = pos.get(t.term);
+            if (list) list.push(i);
+            else pos.set(t.term, [i]);
+          }
         }
-        const doc = { id: d.id, field: f.field, ...f.locale !== void 0 ? { locale: f.locale } : {}, text: f.text, len: tokens.length, tf, firstOffset };
+        const doc = {
+          id: d.id,
+          field: f.field,
+          ...f.locale !== void 0 ? { locale: f.locale } : {},
+          text: f.text,
+          len: tokens.length,
+          tf,
+          firstOffset,
+          ...pos ? { pos } : {}
+        };
         idx.docs.push(doc);
         let s = idx.fieldStats.get(f.field);
         if (!s) {
@@ -117,14 +214,24 @@ var InvertedIndex = class _InvertedIndex {
     }
     return idx;
   }
+  /** Fields this index carries positions for (#1354) — the store compares it against the live config. */
+  get positionFields() {
+    return this.posFields;
+  }
   query(query, opts = {}) {
-    const terms = segmentTokenizer(query);
-    if (terms.length === 0) return [];
-    const usePrefix = opts.prefix ?? false;
+    const parsed = parseSearchQuery(query);
+    if (parsed.phrases.length > 0 && this.posFields.size === 0) {
+      throw new Error(
+        'A phrase or proximity clause ("\u2026" / "\u2026"~n) needs positional postings, and no indexed field declares them. Add the field to the collection\'s `textIndexPositions` option (opt-in: it grows the index).'
+      );
+    }
+    const terms = parsed.terms;
+    const usePrefix = (opts.prefix ?? false) && terms.length > 0;
     const exact = usePrefix ? terms.slice(0, -1) : terms;
     const prefix = usePrefix ? terms[terms.length - 1] : void 0;
+    if (exact.length === 0 && prefix === void 0 && parsed.phrases.length === 0) return [];
     const match = opts.match ?? "any";
-    const required = exact.length + (prefix !== void 0 ? 1 : 0);
+    const required = exact.length + (prefix !== void 0 ? 1 : 0) + parsed.phrases.length;
     const best = /* @__PURE__ */ new Map();
     for (const doc of this.docs) {
       if (opts.fields !== void 0 && !opts.fields.includes(doc.field)) continue;
@@ -141,6 +248,14 @@ var InvertedIndex = class _InvertedIndex {
         const denom = tf + K12 * (1 - B2 + B2 * (doc.len / avgdl));
         score += idf * (tf * (K12 + 1) / (denom || 1));
       };
+      for (const clause of parsed.phrases) {
+        if (!doc.pos) continue;
+        const m = matchClause(doc.pos, clause);
+        if (m.count === 0) continue;
+        let df = Infinity;
+        for (const t of clause.terms) df = Math.min(df, stats.df.get(t) ?? 0);
+        scoreTerm(m.count, df === Infinity ? 1 : df || 1, this.charOffsetAt(doc, m.start));
+      }
       for (const qt of exact) scoreTerm(doc.tf.get(qt) ?? 0, stats.df.get(qt) ?? 0, doc.firstOffset.get(qt) ?? -1);
       if (prefix !== void 0) {
         const exactSet = new Set(exact);
@@ -162,6 +277,8 @@ var InvertedIndex = class _InvertedIndex {
       }
       if (matchedCount === 0) continue;
       if (match === "all" && matchedCount < required) continue;
+      const boost = opts.boost?.[doc.field];
+      if (boost !== void 0 && boost !== 1) score *= boost;
       const hit = {
         id: doc.id,
         score,
@@ -176,9 +293,15 @@ var InvertedIndex = class _InvertedIndex {
     const results = [...best.values()].sort((a, b) => b.score - a.score);
     return opts.limit !== void 0 ? results.slice(0, opts.limit) : results;
   }
+  /** Token ordinal → char offset in the ORIGINAL text, by re-segmenting this one doc. */
+  charOffsetAt(doc, tokenPos) {
+    if (tokenPos < 0) return -1;
+    return segmentTokens(doc.text)[tokenPos]?.offset ?? -1;
+  }
   toSnapshot() {
     return {
-      v: 1,
+      v: INDEX_SNAPSHOT_VERSION,
+      posFields: [...this.posFields],
       fieldStats: [...this.fieldStats].map(([f, s]) => [f, { df: [...s.df], n: s.n, totalLen: s.totalLen }]),
       docs: this.docs.map((d) => ({
         id: d.id,
@@ -187,12 +310,14 @@ var InvertedIndex = class _InvertedIndex {
         len: d.len,
         tf: [...d.tf],
         firstOffset: [...d.firstOffset],
-        ...d.locale !== void 0 ? { locale: d.locale } : {}
+        ...d.locale !== void 0 ? { locale: d.locale } : {},
+        ...d.pos ? { pos: [...d.pos] } : {}
       }))
     };
   }
   static fromSnapshot(s) {
     const idx = new _InvertedIndex();
+    idx.posFields = new Set(s.posFields);
     for (const [f, st] of s.fieldStats) idx.fieldStats.set(f, { df: new Map(st.df), n: st.n, totalLen: st.totalLen });
     for (const d of s.docs) {
       idx.docs.push({
@@ -202,12 +327,14 @@ var InvertedIndex = class _InvertedIndex {
         len: d.len,
         tf: new Map(d.tf),
         firstOffset: new Map(d.firstOffset),
-        ...d.locale !== void 0 ? { locale: d.locale } : {}
+        ...d.locale !== void 0 ? { locale: d.locale } : {},
+        ...d.pos ? { pos: new Map(d.pos.map(([t, l]) => [t, [...l]])) } : {}
       });
     }
     return idx;
   }
 };
+var EMPTY_FIELDS = /* @__PURE__ */ new Set();
 
 // src/with-lookup/search/snippet.ts
 function extractSnippet(text, offset, window = 80) {
@@ -228,8 +355,8 @@ var MemoryIndexStore = class {
   get built() {
     return this.index !== void 0;
   }
-  async ensureBuilt(build) {
-    if (this.index === void 0) this.index = InvertedIndex.build(build());
+  async ensureBuilt(build, opts) {
+    if (this.index === void 0) this.index = InvertedIndex.build(build(), opts);
     return this.index;
   }
   markDirty() {
@@ -294,31 +421,31 @@ function buildBlobFieldEntries(filenamesByField) {
 function withSearch() {
   return {
     async search(ctx, field, query, opts) {
-      const { search } = await import("./collection-facade-4GRREZ6C.js");
+      const { search } = await import("./collection-facade-QU6IJBN3.js");
       return search(ctx, field, query, opts);
     },
     async retrieve(ctx, query, opts) {
-      const { retrieve } = await import("./collection-facade-4GRREZ6C.js");
+      const { retrieve } = await import("./collection-facade-QU6IJBN3.js");
       return retrieve(ctx, query, opts);
     },
     async similarTo(ctx, vector, opts) {
-      const { similarTo } = await import("./collection-facade-4GRREZ6C.js");
+      const { similarTo } = await import("./collection-facade-QU6IJBN3.js");
       return similarTo(ctx, vector, opts);
     },
     async warmIndex(ctx) {
-      const { warmIndex } = await import("./collection-facade-4GRREZ6C.js");
+      const { warmIndex } = await import("./collection-facade-QU6IJBN3.js");
       return warmIndex(ctx);
     },
     async flushIndex(ctx) {
-      const { flushIndex } = await import("./collection-facade-4GRREZ6C.js");
+      const { flushIndex } = await import("./collection-facade-QU6IJBN3.js");
       return flushIndex(ctx);
     },
     async embedOnWrite(ctx, id, record, version) {
-      const { embedOnWrite } = await import("./collection-facade-4GRREZ6C.js");
+      const { embedOnWrite } = await import("./collection-facade-QU6IJBN3.js");
       return embedOnWrite(ctx, id, record, version);
     },
     async rebuildEmbeddings(ctx) {
-      const { rebuildEmbeddings } = await import("./collection-facade-4GRREZ6C.js");
+      const { rebuildEmbeddings } = await import("./collection-facade-QU6IJBN3.js");
       return rebuildEmbeddings(ctx);
     }
   };
@@ -355,6 +482,7 @@ export {
   searchScan,
   segmentTokens,
   segmentTokenizer,
+  INDEX_SNAPSHOT_VERSION,
   InvertedIndex,
   extractSnippet,
   MemoryIndexStore,
@@ -364,4 +492,4 @@ export {
   buildBlobFieldEntries,
   withSearch
 };
-//# sourceMappingURL=chunk-UXWB3FPF.js.map
+//# sourceMappingURL=chunk-I3JDRCMW.js.map

package/dist/chunk-I3JDRCMW.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/with-lookup/search/tokenize.ts","../src/with-lookup/search/scan.ts","../src/with-lookup/search/segment.ts","../src/with-lookup/search/phrase.ts","../src/with-lookup/search/inverted-index.ts","../src/with-lookup/search/snippet.ts","../src/with-lookup/search/index-store.ts","../src/with-lookup/search/build-docs.ts","../src/with-lookup/search/active.ts","../src/with-lookup/search/strategy.ts"],"sourcesContent":["/**\n * Default text tokenizer for scan-mode search.\n *\n * NFKC-normalize → lowercase → split on Unicode letter/number runs. This is a\n * word-boundary tokenizer: it does **not** segment scripts written without\n * inter-word spaces (Thai, Lao, Khmer, CJK) — those collapse to one token per\n * run. For such data, a dictionary/ICU segmenter is the right `tokenizer`\n * (the engine takes one as a parameter); substring/`contains` matching is the\n * pragmatic fallback until then.\n */\nexport type Tokenizer = (text: string) => string[]\n\nconst WORD = /[\\p{L}\\p{N}]+/gu\n\nexport const tokenize: Tokenizer = (text: string): string[] => {\n  if (!text) return []\n  return text.normalize('NFKC').toLowerCase().match(WORD) ?? []\n}\n","/**\n * Scan-mode full-text search — ranks **already-decrypted** records by\n * BM25 against a tokenized query. Pure client-side: nothing is written to the\n * store, so this adds **zero** leakage (unlike a store-usable blind index,\n * which is a separate, gated opt-in).\n *\n * O(n) over the collection; intended for small/medium collections (the pilot's\n * scale) where moving the existing userland scan into the DB is the win.\n */\nimport { tokenize, type Tokenizer } from './tokenize.js'\n\nexport interface SearchOptions {\n  /** Top-N by score (default: all matches). */\n  readonly limit?: number\n  /** `'any'` (default) = OR of query terms; `'all'` = every term must match. */\n  readonly match?: 'any' | 'all'\n  /** Treat the LAST query term as a prefix (typeahead). */\n  readonly prefix?: boolean\n}\n\nexport interface SearchResult<T> {\n  readonly id: string\n  readonly score: number\n  readonly record: T\n}\n\nexport interface SearchEntry<T> {\n  readonly id: string\n  readonly record: T\n}\n\nconst K1 = 1.2\nconst B = 0.75\n\n/** Coerce a field value to searchable text (numbers/booleans stringified). */\nfunction fieldText(record: unknown, field: string): string {\n  const v = (record as Record<string, unknown>)[field]\n  if (typeof v === 'string') return v\n  if (v === null || v === undefined) return ''\n  if (typeof v === 'number' || typeof v === 'boolean') return String(v)\n  return ''\n}\n\nexport function searchScan<T>(\n  entries: ReadonlyArray<SearchEntry<T>>,\n  field: string,\n  query: string,\n  opts: SearchOptions = {},\n  tokenizer: Tokenizer = tokenize,\n): SearchResult<T>[] {\n  const queryTerms = tokenizer(query)\n  if (queryTerms.length === 0) return []\n\n  const match = opts.match ?? 'any'\n  const usePrefix = opts.prefix ?? false\n  const exactTerms = usePrefix ? queryTerms.slice(0, -1) : queryTerms\n  const prefixTerm = usePrefix ? queryTerms[queryTerms.length - 1] : undefined\n\n  // One tokenize pass per doc; collect corpus stats (df, avg length).\n  const docs = entries.map((e) => ({ id: e.id, record: e.record, terms: tokenizer(fieldText(e.record, field)) }))\n  const N = docs.length || 1\n  const df = new Map<string, number>()\n  let totalLen = 0\n  for (const d of docs) {\n    totalLen += d.terms.length\n    for (const t of new Set(d.terms)) df.set(t, (df.get(t) ?? 0) + 1)\n  }\n  const avgdl = totalLen / N || 1\n\n  // Document frequency for the prefix term: docs containing ANY term with it.\n  let prefixDf = 0\n  if (prefixTerm !== undefined) {\n    for (const d of docs) {\n      if (d.terms.some((t) => t.startsWith(prefixTerm))) prefixDf++\n    }\n  }\n\n  const requiredCount = exactTerms.length + (prefixTerm !== undefined ? 1 : 0)\n  const results: SearchResult<T>[] = []\n\n  for (const d of docs) {\n    const tf = new Map<string, number>()\n    for (const t of d.terms) tf.set(t, (tf.get(t) ?? 0) + 1)\n\n    const matched: { tf: number; df: number }[] = []\n    for (const qt of exactTerms) {\n      const c = tf.get(qt) ?? 0\n      if (c > 0) matched.push({ tf: c, df: df.get(qt) ?? 0 })\n    }\n    if (prefixTerm !== undefined) {\n      let ptf = 0\n      for (const [t, c] of tf) if (t.startsWith(prefixTerm)) ptf += c\n      if (ptf > 0) matched.push({ tf: ptf, df: prefixDf })\n    }\n\n    if (matched.length === 0) continue\n    if (match === 'all' && matched.length < requiredCount) continue\n\n    let score = 0\n    for (const m of matched) {\n      const idf = Math.log(1 + (N - m.df + 0.5) / (m.df + 0.5))\n      const denom = m.tf + K1 * (1 - B + B * (d.terms.length / avgdl))\n      score += idf * ((m.tf * (K1 + 1)) / (denom || 1))\n    }\n    results.push({ id: d.id, score, record: d.record })\n  }\n\n  results.sort((a, b) => b.score - a.score)\n  return opts.limit !== undefined ? results.slice(0, opts.limit) : results\n}\n","/**\n * i18n word tokenizer for the L1 lexical index. Uses Intl.Segmenter\n * (standard ECMAScript — hub-portable) to dictionary-segment Thai/Lao/Khmer/CJK,\n * which the word-run `tokenize` cannot. Terms are matched in NFKC-lowercased form;\n * offsets index the ORIGINAL text so snippets slice the user's text.\n */\nimport type { Tokenizer } from './tokenize.js'\n\nconst SEGMENTER = new Intl.Segmenter(undefined, { granularity: 'word' })\n\nexport interface Token {\n  readonly term: string\n  readonly offset: number\n}\n\n/** Word-like tokens with NFKC-lowercased terms + original-text char offsets. */\nexport const segmentTokens = (text: string): Token[] => {\n  const out: Token[] = []\n  if (!text) return out\n  for (const s of SEGMENTER.segment(text)) {\n    if (s.isWordLike) out.push({ term: s.segment.normalize('NFKC').toLowerCase(), offset: s.index })\n  }\n  return out\n}\n\n/** Term-only tokenizer (the public `Tokenizer` shape) — for queries. */\nexport const segmentTokenizer: Tokenizer = (text: string): string[] =>\n  segmentTokens(text).map((t) => t.term)\n","/**\n * Phrase / proximity clause parsing and matching over positional postings\n * (#1354).\n *\n * ## The query syntax\n *\n * A double-quoted run inside a `retrieve()` query string is a **clause**;\n * everything outside quotes stays a bare term and behaves exactly as it did\n * before this file existed.\n *\n *  - `\"tax invoice\"`   — PHRASE: the terms must be adjacent, **in the written\n *                        order**, with nothing between them.\n *  - `\"tax invoice\"~3` — PROXIMITY: the terms must all occur inside a window\n *                        of `k + 3` tokens (`k` = the clause's term count),\n *                        i.e. at most 3 tokens of slack, **in any order**.\n *\n * ⭐ **Proximity is UNORDERED, and that is a deliberate divergence from\n * Lucene.** Lucene's `~n` is an edit distance over positions, so a mere\n * transposition of two adjacent terms costs 2 and `\"invoice tax\"~0` does NOT\n * match the text `tax invoice`. Here `~n` reads as *\"n words of slack, order\n * irrelevant\"* (the Meilisearch / Typesense reading), so `\"invoice tax\"~0`\n * DOES match `tax invoice`. Pinned by\n * `search-phrase-proximity.test.ts` → *\"proximity is unordered — the case\n * Lucene disagrees on\"*. Callers who want ordering use the unslopped phrase\n * form, which is strictly ordered.\n *\n * A clause matches **within one field posting only** — positions are recorded\n * per `(record, field)`, so a term ending `name` and a term starting `notes`\n * can never form a phrase. That is a property of the data layout, not a check.\n *\n * Repeated terms in a PROXIMITY clause collapse to a set (`\"tax tax\"~2`\n * requires only that `tax` occur); a PHRASE clause matches repeats exactly,\n * because it tests literal position arithmetic.\n */\nimport { segmentTokenizer } from './segment.js'\n\n/** One quoted clause. `slop === undefined` ⇒ strict ordered phrase. */\nexport interface PhraseClause {\n  readonly terms: readonly string[]\n  readonly slop: number | undefined\n}\n\nexport interface ParsedQuery {\n  /** Unquoted terms — scored exactly as before #1354. */\n  readonly terms: readonly string[]\n  readonly phrases: readonly PhraseClause[]\n}\n\nconst QUOTED = /\"([^\"]*)\"(?:~(\\d+))?/g\n\n/**\n * Split a raw query into bare terms + quoted clauses. An unterminated quote\n * has no closing delimiter to match, so it never forms a clause and its text\n * falls through to the bare-term tokenizer — a typo degrades to today's\n * behaviour rather than to an error.\n */\nexport function parseSearchQuery(query: string): ParsedQuery {\n  const phrases: PhraseClause[] = []\n  const rest = query.replace(QUOTED, (_m, body: string, slop: string | undefined) => {\n    const terms = segmentTokenizer(body)\n    // A one-term clause is just that term; keep it a clause anyway so `match:'all'`\n    // counts it once, and so `\"foo\"` never silently means something different\n    // from `foo`.\n    if (terms.length > 0) phrases.push({ terms, slop: slop === undefined ? undefined : Number(slop) })\n    return ' '\n  })\n  return { terms: segmentTokenizer(rest), phrases }\n}\n\n/**\n * Occurrences of a clause inside one field's positional postings, plus the\n * token position the first occurrence starts at (`-1` when there is none).\n *\n * `positions` maps term → ascending token ordinals. A term the posting does\n * not carry is an immediate miss.\n */\nexport function matchClause(\n  positions: ReadonlyMap<string, readonly number[]>,\n  clause: PhraseClause,\n): { count: number; start: number } {\n  const lists: (readonly number[])[] = []\n  for (const t of clause.terms) {\n    const l = positions.get(t)\n    if (l === undefined || l.length === 0) return NO_MATCH\n    lists.push(l)\n  }\n  return clause.slop === undefined\n    ? matchOrderedAdjacent(lists)\n    : matchWindow(dedupeByTerm(clause.terms, lists), clause.terms.length + clause.slop)\n}\n\nconst NO_MATCH = { count: 0, start: -1 }\n\n/** Strict phrase: positions p, p+1, … p+k-1, one per term, in written order. */\nfunction matchOrderedAdjacent(lists: readonly (readonly number[])[]): { count: number; start: number } {\n  const sets = lists.slice(1).map((l) => new Set(l))\n  let count = 0\n  let start = -1\n  for (const p of lists[0]!) {\n    let ok = true\n    for (let i = 0; i < sets.length; i++) {\n      if (!sets[i]!.has(p + i + 1)) { ok = false; break }\n    }\n    if (ok) { count++; if (start < 0) start = p }\n  }\n  return { count, start }\n}\n\n/** Distinct terms only — a proximity window asks \"are they all here\", so a\n *  repeated term must not demand two separate occurrences. */\nfunction dedupeByTerm(\n  terms: readonly string[],\n  lists: readonly (readonly number[])[],\n): readonly (readonly number[])[] {\n  const seen = new Set<string>()\n  const out: (readonly number[])[] = []\n  for (let i = 0; i < terms.length; i++) {\n    if (seen.has(terms[i]!)) continue\n    seen.add(terms[i]!)\n    out.push(lists[i]!)\n  }\n  return out\n}\n\n/**\n * Unordered window: count the windows containing every list at least once\n * whose token span is `< size` (span = max − min + 1 ≤ size). One window is\n * counted per right endpoint after shrinking from the left, so overlapping\n * windows do not inflate the count without bound — it is a frequency signal\n * for BM25, not an exact non-overlapping occurrence count.\n */\nfunction matchWindow(\n  lists: readonly (readonly number[])[],\n  size: number,\n): { count: number; start: number } {\n  const merged: { pos: number; term: number }[] = []\n  for (let t = 0; t < lists.length; t++) for (const p of lists[t]!) merged.push({ pos: p, term: t })\n  merged.sort((a, b) => a.pos - b.pos || a.term - b.term)\n\n  const need = lists.length\n  const have = new Array<number>(need).fill(0)\n  let distinct = 0\n  let left = 0\n  let count = 0\n  let start = -1\n  for (let right = 0; right < merged.length; right++) {\n    const rt = merged[right]!.term\n    if (have[rt]! === 0) distinct++\n    have[rt] = have[rt]! + 1\n    while (distinct === need && have[merged[left]!.term]! > 1) {\n      const lt = merged[left]!.term\n      have[lt] = have[lt]! - 1\n      left++\n    }\n    if (distinct === need && merged[right]!.pos - merged[left]!.pos + 1 <= size) {\n      count++\n      if (start < 0) start = merged[left]!.pos\n    }\n  }\n  return { count, start }\n}\n","/**\n * In-memory inverted index for the L1 lexical retrieval layer. Built\n * client-side from already-decrypted records; nothing touches the store. BM25\n * mirrors src/search/scan.ts; multi-field with max-field combination so a record\n * ranks by its strongest field, which also supplies the snippet location.\n *\n * ## Positional postings (#1354)\n *\n * A field named in {@link IndexBuildOptions.positions} additionally records, per\n * term, the ascending token ordinals it occurs at — which is what phrase\n * (`\"tax invoice\"`) and proximity (`\"tax invoice\"~3`) clauses match on. That\n * roughly doubles the per-doc payload (one ordinal per token, on top of the\n * existing tf/firstOffset maps), so it is **opt-in per field**: a field absent\n * from `positions` stores nothing extra and a collection that opts none in\n * serializes a snapshot with no `pos` entries at all.\n *\n * ⭐ Char offsets are NOT stored alongside the ordinals. A matched clause needs\n * one offset, for one hit, to place a snippet — re-segmenting that single doc's\n * text (which the snapshot already carries) is cheaper than paying a second\n * number per token in every persisted index.\n */\nimport { segmentTokens } from './segment.js'\nimport { parseSearchQuery, matchClause } from './phrase.js'\n\nconst K1 = 1.2\nconst B = 0.75\n\nexport interface IndexDoc {\n  readonly id: string\n  readonly fields: ReadonlyArray<{ readonly field: string; readonly locale?: string; readonly text: string }>\n}\n\nexport interface IndexHit {\n  readonly id: string\n  readonly score: number\n  readonly field: string\n  readonly locale?: string\n  readonly text: string\n  readonly offset: number\n}\n\n/** Build-time index shape. The only knob is which fields carry positions. */\nexport interface IndexBuildOptions {\n  /** Fields whose postings record token positions (phrase / proximity). Opt-in: index size grows. */\n  readonly positions?: readonly string[]\n}\n\nexport interface QueryOptions {\n  readonly limit?: number\n  readonly match?: 'any' | 'all'\n  readonly prefix?: boolean\n  readonly fields?: readonly string[]\n  /**\n   * Per-field score weights (BM25F-style, #1354). Purely query-side — nothing\n   * in the index changes. A field with no entry weighs 1, and the no-boost path\n   * performs no multiplication at all, so an unboosted query's scores are\n   * bit-for-bit what they were before boosts existed.\n   *\n   * ⚠️ Textbook BM25F pools term frequencies ACROSS fields before one\n   * saturation step. This index scores each field independently and keeps the\n   * best (see the class doc), so a boost weights the per-field score instead.\n   * Same intent — \"a hit in `name` is worth more than a hit in `notes`\" —\n   * different arithmetic; do not expect Lucene's BM25F numbers.\n   */\n  readonly boost?: Readonly<Record<string, number>>\n}\n\n/**\n * Persisted shape. `v` is the format stamp: an older stamp is REJECTED and the\n * index rebuilt, never migrated or read leniently — see\n * {@link parseIndexSnapshot}. v1 (pre-#1354) had no `posFields` and no `pos`,\n * and a v1 blob read as v2 would silently answer \"this doc has no positions\",\n * i.e. \"your phrase does not match\", which is a wrong answer rather than a slow\n * one.\n */\nexport const INDEX_SNAPSHOT_VERSION = 2\n\nexport interface IndexSnapshot {\n  readonly v: number\n  /** Fields whose docs carry `pos`. Empty ⇒ nobody opted in. */\n  readonly posFields: readonly string[]\n  readonly fieldStats: ReadonlyArray<[string, { df: [string, number][]; n: number; totalLen: number }]>\n  readonly docs: ReadonlyArray<{\n    id: string; field: string; locale?: string; text: string; len: number\n    tf: [string, number][]; firstOffset: [string, number][]\n    /** term -> ascending token ordinals. Present iff `field` ∈ `posFields`. */\n    pos?: [string, number[]][]\n  }>\n}\n\ninterface Doc {\n  id: string\n  field: string\n  locale?: string\n  text: string\n  len: number\n  tf: Map<string, number>\n  firstOffset: Map<string, number>\n  pos?: Map<string, number[]>\n}\n\nexport class InvertedIndex {\n  // per field: df (term -> #docs), N (#docs), totalLen\n  private readonly fieldStats = new Map<string, { df: Map<string, number>; n: number; totalLen: number }>()\n  private readonly docs: Doc[] = []\n  private posFields: ReadonlySet<string> = EMPTY_FIELDS\n\n  static build(docs: ReadonlyArray<IndexDoc>, opts: IndexBuildOptions = {}): InvertedIndex {\n    const idx = new InvertedIndex()\n    const positional = new Set(opts.positions ?? [])\n    idx.posFields = positional\n    for (const d of docs) {\n      for (const f of d.fields) {\n        const tokens = segmentTokens(f.text)\n        const tf = new Map<string, number>()\n        const firstOffset = new Map<string, number>()\n        const pos = positional.has(f.field) ? new Map<string, number[]>() : undefined\n        for (let i = 0; i < tokens.length; i++) {\n          const t = tokens[i]!\n          tf.set(t.term, (tf.get(t.term) ?? 0) + 1)\n          if (!firstOffset.has(t.term)) firstOffset.set(t.term, t.offset)\n          if (pos) {\n            const list = pos.get(t.term)\n            if (list) list.push(i)\n            else pos.set(t.term, [i])\n          }\n        }\n        const doc: Doc = {\n          id: d.id, field: f.field, ...(f.locale !== undefined ? { locale: f.locale } : {}),\n          text: f.text, len: tokens.length, tf, firstOffset, ...(pos ? { pos } : {}),\n        }\n        idx.docs.push(doc)\n        let s = idx.fieldStats.get(f.field)\n        if (!s) { s = { df: new Map(), n: 0, totalLen: 0 }; idx.fieldStats.set(f.field, s) }\n        s.n += 1\n        s.totalLen += doc.len\n        for (const term of tf.keys()) s.df.set(term, (s.df.get(term) ?? 0) + 1)\n      }\n    }\n    return idx\n  }\n\n  /** Fields this index carries positions for (#1354) — the store compares it against the live config. */\n  get positionFields(): ReadonlySet<string> { return this.posFields }\n\n  query(query: string, opts: QueryOptions = {}): IndexHit[] {\n    const parsed = parseSearchQuery(query)\n    if (parsed.phrases.length > 0 && this.posFields.size === 0) {\n      throw new Error(\n        'A phrase or proximity clause (\"…\" / \"…\"~n) needs positional postings, and no indexed field ' +\n          'declares them. Add the field to the collection\\'s `textIndexPositions` option (opt-in: it grows the index).',\n      )\n    }\n    const terms = parsed.terms\n    const usePrefix = (opts.prefix ?? false) && terms.length > 0\n    const exact = usePrefix ? terms.slice(0, -1) : terms\n    const prefix = usePrefix ? terms[terms.length - 1] : undefined\n    if (exact.length === 0 && prefix === undefined && parsed.phrases.length === 0) return []\n    const match = opts.match ?? 'any'\n    const required = exact.length + (prefix !== undefined ? 1 : 0) + parsed.phrases.length\n\n    // best (max-score) doc per record\n    const best = new Map<string, IndexHit>()\n    for (const doc of this.docs) {\n      if (opts.fields !== undefined && !opts.fields.includes(doc.field)) continue\n      const stats = this.fieldStats.get(doc.field)!\n      const avgdl = stats.totalLen / stats.n || 1\n      let score = 0\n      let matchedCount = 0\n      let snippetOffset = -1\n\n      const scoreTerm = (tf: number, df: number, offset: number): void => {\n        if (tf <= 0) return\n        matchedCount += 1\n        if (snippetOffset < 0 && offset >= 0) snippetOffset = offset\n        const idf = Math.log(1 + (stats.n - df + 0.5) / (df + 0.5))\n        const denom = tf + K1 * (1 - B + B * (doc.len / avgdl))\n        score += idf * ((tf * (K1 + 1)) / (denom || 1))\n      }\n\n      // Clauses are scored FIRST so a matched phrase — not a stray loose term —\n      // decides where the snippet window opens.\n      for (const clause of parsed.phrases) {\n        if (!doc.pos) continue // this field did not opt in: it cannot satisfy a clause\n        const m = matchClause(doc.pos, clause)\n        if (m.count === 0) continue\n        // df for a clause is bounded above by the rarest of its terms' df; the\n        // exact clause df would need a second pass over every doc for every\n        // query, which buys precision nobody is asking for at L1.\n        let df = Infinity\n        for (const t of clause.terms) df = Math.min(df, stats.df.get(t) ?? 0)\n        scoreTerm(m.count, df === Infinity ? 1 : df || 1, this.charOffsetAt(doc, m.start))\n      }\n\n      for (const qt of exact) scoreTerm(doc.tf.get(qt) ?? 0, stats.df.get(qt) ?? 0, doc.firstOffset.get(qt) ?? -1)\n\n      if (prefix !== undefined) {\n        // Build a set of exact query terms so we don't double-count a term that\n        // is both an exact match and starts with the prefix (defect 2 fix).\n        const exactSet = new Set(exact)\n        let ptf = 0\n        let poff = -1\n        for (const [term, c] of doc.tf) {\n          if (term.startsWith(prefix) && !exactSet.has(term)) {\n            ptf += c\n            if (poff < 0) poff = doc.firstOffset.get(term) ?? -1\n          }\n        }\n        if (ptf > 0) {\n          // df for the prefix: count DISTINCT docs in this field that have any\n          // prefix-matching term — mirrors scan.ts semantics (defect 1 fix).\n          let pdf = 0\n          for (const d of this.docs) {\n            if (d.field === doc.field && [...d.tf.keys()].some((t) => t.startsWith(prefix))) pdf++\n          }\n          scoreTerm(ptf, pdf || 1, poff)\n        }\n      }\n\n      if (matchedCount === 0) continue\n      if (match === 'all' && matchedCount < required) continue\n\n      // No boost option, or a weight of exactly 1, performs no arithmetic —\n      // that is what makes an unboosted ranking provably unchanged (#1354).\n      const boost = opts.boost?.[doc.field]\n      if (boost !== undefined && boost !== 1) score *= boost\n\n      const hit: IndexHit = {\n        id: doc.id, score, field: doc.field, text: doc.text,\n        offset: snippetOffset < 0 ? 0 : snippetOffset,\n        ...(doc.locale !== undefined ? { locale: doc.locale } : {}),\n      }\n      const prev = best.get(doc.id)\n      if (!prev || hit.score > prev.score) best.set(doc.id, hit)\n    }\n\n    const results = [...best.values()].sort((a, b) => b.score - a.score)\n    return opts.limit !== undefined ? results.slice(0, opts.limit) : results\n  }\n\n  /** Token ordinal → char offset in the ORIGINAL text, by re-segmenting this one doc. */\n  private charOffsetAt(doc: Doc, tokenPos: number): number {\n    if (tokenPos < 0) return -1\n    return segmentTokens(doc.text)[tokenPos]?.offset ?? -1\n  }\n\n  toSnapshot(): IndexSnapshot {\n    return {\n      v: INDEX_SNAPSHOT_VERSION,\n      posFields: [...this.posFields],\n      fieldStats: [...this.fieldStats].map(([f, s]) => [f, { df: [...s.df], n: s.n, totalLen: s.totalLen }]),\n      docs: this.docs.map((d) => ({\n        id: d.id, field: d.field, text: d.text, len: d.len,\n        tf: [...d.tf], firstOffset: [...d.firstOffset],\n        ...(d.locale !== undefined ? { locale: d.locale } : {}),\n        ...(d.pos ? { pos: [...d.pos] as [string, number[]][] } : {}),\n      })),\n    }\n  }\n\n  static fromSnapshot(s: IndexSnapshot): InvertedIndex {\n    const idx = new InvertedIndex()\n    idx.posFields = new Set(s.posFields)\n    for (const [f, st] of s.fieldStats) idx.fieldStats.set(f, { df: new Map(st.df), n: st.n, totalLen: st.totalLen })\n    for (const d of s.docs) {\n      idx.docs.push({\n        id: d.id, field: d.field, text: d.text, len: d.len,\n        tf: new Map(d.tf), firstOffset: new Map(d.firstOffset),\n        ...(d.locale !== undefined ? { locale: d.locale } : {}),\n        ...(d.pos ? { pos: new Map(d.pos.map(([t, l]) => [t, [...l]])) } : {}),\n      })\n    }\n    return idx\n  }\n}\n\nconst EMPTY_FIELDS: ReadonlySet<string> = new Set()\n","/**\n * Minimal-disclosure snippet: a char-window around a match offset (L1).\n * Unicode-safe (operates on code points). `…` marks each truncated end.\n */\nexport function extractSnippet(text: string, offset: number, window = 80): string {\n  const chars = Array.from(text)\n  if (chars.length <= window) return text\n  // offset is a UTF-16 index into `text`; map to a code-point index.\n  const cpOffset = Array.from(text.slice(0, Math.max(0, offset))).length\n  const half = Math.floor(window / 2)\n  let start = Math.max(0, cpOffset - half)\n  const end = Math.min(chars.length, start + window)\n  start = Math.max(0, end - window)\n  const body = chars.slice(start, end).join('')\n  return `${start > 0 ? '…' : ''}${body}${end < chars.length ? '…' : ''}`\n}\n","/**\n * The index persistence seam (L1.5). MemoryIndexStore is session-scoped and\n * lazy; an opaque-blob backend implements the same interface so the\n * collection call-site is unchanged.\n */\nimport { InvertedIndex, type IndexDoc, type IndexBuildOptions } from './inverted-index.js'\n\nexport interface IndexStore {\n  /** `opts` carries the positional-postings opt-in (#1354); a persisted store also\n   *  uses it to decide whether a loaded sidecar still matches the live config. */\n  ensureBuilt(build: () => ReadonlyArray<IndexDoc>, opts?: IndexBuildOptions): Promise<InvertedIndex>\n  markDirty(): void\n  flush(): Promise<void>\n  readonly built: boolean\n}\n\nexport class MemoryIndexStore implements IndexStore {\n  private index: InvertedIndex | undefined\n\n  get built(): boolean { return this.index !== undefined }\n\n  async ensureBuilt(build: () => ReadonlyArray<IndexDoc>, opts?: IndexBuildOptions): Promise<InvertedIndex> {\n    if (this.index === undefined) this.index = InvertedIndex.build(build(), opts)\n    return this.index\n  }\n\n  markDirty(): void { this.index = undefined }\n\n  async flush(): Promise<void> { /* in-memory: nothing to persist */ }\n}\n","/**\n * Map a decrypted record's configured text fields → IndexDoc field entries\n * (L1). String, i18nText, dictKey, and blob-filename expansion. Uses\n * getAtPath for nested/[]-wildcard paths. Blob filenames are NOT inline on the\n * record — the collection pre-resolves them (one listSlots() per record, the\n * heaviest source) and feeds them to {@link buildBlobFieldEntries}.\n */\nimport { getAtPath } from '../../via/i18n/core.js'\nimport type { I18nTextDescriptor } from '../../via/i18n/core.js'\nimport type { DictKeyDescriptor, StaticDictDescriptor } from '../../via/i18n/dictionary.js'\nimport type { IndexDoc } from './inverted-index.js'\n\n/**\n * One entry in an {@link IndexDoc}'s `fields` array — the return shape of the\n * `build*FieldEntries` helpers. Exported so `@noy-db/hub/search` can name the\n * return type of its own public functions (#843 C1: the subpath's first\n * type-reachability gap).\n */\nexport type FieldEntry = IndexDoc['fields'][number]\n\nexport function buildStringFieldEntries(\n  record: Record<string, unknown>,\n  textIndexes: readonly string[],\n  only?: readonly string[],\n): FieldEntry[] {\n  const fields = only ? textIndexes.filter((f) => only.includes(f)) : textIndexes\n  const out: FieldEntry[] = []\n  for (const field of fields) {\n    for (const leaf of getAtPath(record, field)) {\n      if (typeof leaf === 'string' && leaf !== '') out.push({ field, text: leaf })\n    }\n  }\n  return out\n}\n\nexport function buildI18nFieldEntries(\n  record: Record<string, unknown>,\n  i18nFields: Record<string, I18nTextDescriptor>,\n  textIndexes: readonly string[],\n  only?: readonly string[],\n): FieldEntry[] {\n  const fields = (only ? textIndexes.filter((f) => only.includes(f)) : textIndexes).filter((f) => f in i18nFields)\n  const out: FieldEntry[] = []\n  for (const field of fields) {\n    for (const leaf of getAtPath(record, field)) {\n      if (!leaf || typeof leaf !== 'object' || Array.isArray(leaf)) continue\n      for (const [locale, val] of Object.entries(leaf as Record<string, unknown>)) {\n        if (typeof val === 'string' && val !== '') out.push({ field, locale, text: val })\n      }\n    }\n  }\n  return out\n}\n\n/** label map: field -> (key -> { locale -> label }). Precomputed in the collection (async for dynamic dicts). */\nexport function buildDictKeyFieldEntries(\n  record: Record<string, unknown>,\n  dictKeyFields: Record<string, DictKeyDescriptor | StaticDictDescriptor>,\n  labelMaps: Map<string, Map<string, Record<string, string>>>,\n  textIndexes: readonly string[],\n  only?: readonly string[],\n): FieldEntry[] {\n  const fields = (only ? textIndexes.filter((f) => only.includes(f)) : textIndexes).filter((f) => f in dictKeyFields)\n  const out: FieldEntry[] = []\n  for (const field of fields) {\n    const map = labelMaps.get(field)\n    if (!map) continue\n    for (const leaf of getAtPath(record, field)) {\n      const keys = typeof leaf === 'string' ? [leaf] : Array.isArray(leaf) ? leaf.filter((k): k is string => typeof k === 'string') : []\n      for (const key of keys) {\n        const labels = map.get(key)\n        if (!labels) continue\n        for (const [locale, label] of Object.entries(labels)) {\n          if (label !== '') out.push({ field, locale, text: label })\n        }\n      }\n    }\n  }\n  return out\n}\n\n/**\n * Blob filenames precomputed in the collection (`field -> filenames[]`, from one\n * async `listSlots()` per record — the heaviest source, see {@link buildBlobFieldEntries}'s\n * caller). Bytes are never tokenized; only the slot `filename` is indexed.\n */\nexport function buildBlobFieldEntries(filenamesByField: Map<string, string[]>): FieldEntry[] {\n  const out: FieldEntry[] = []\n  for (const [field, names] of filenamesByField) {\n    for (const name of names) if (name !== '') out.push({ field, text: name })\n  }\n  return out\n}\n","/**\n * Enable the search / retrieval capability.\n * Pass to `createNoydb({ searchStrategy: withSearch() })` to make a collection's\n * `search` / `retrieve` / `similarTo` / `warmIndex` / `flushIndex` methods live,\n * and to enable the put()-time embedding-vector compute for collections that\n * declare an `embeddings` config. The search/retrieval engine is dynamically\n * imported here, so it stays out of the floor bundle until opted in.\n */\nimport type { SearchStrategy } from './strategy.js'\n\nexport function withSearch(): SearchStrategy {\n  return {\n    async search(ctx, field, query, opts) {\n      const { search } = await import('./collection-facade.js')\n      return search(ctx, field, query, opts)\n    },\n    async retrieve(ctx, query, opts) {\n      const { retrieve } = await import('./collection-facade.js')\n      return retrieve(ctx, query, opts)\n    },\n    async similarTo(ctx, vector, opts) {\n      const { similarTo } = await import('./collection-facade.js')\n      return similarTo(ctx, vector, opts)\n    },\n    async warmIndex(ctx) {\n      const { warmIndex } = await import('./collection-facade.js')\n      return warmIndex(ctx)\n    },\n    async flushIndex(ctx) {\n      const { flushIndex } = await import('./collection-facade.js')\n      return flushIndex(ctx)\n    },\n    async embedOnWrite(ctx, id, record, version) {\n      const { embedOnWrite } = await import('./collection-facade.js')\n      return embedOnWrite(ctx, id, record, version)\n    },\n    async rebuildEmbeddings(ctx) {\n      const { rebuildEmbeddings } = await import('./collection-facade.js')\n      return rebuildEmbeddings(ctx)\n    },\n  }\n}\n","/**\n * Search capability strategy — the on-demand collection-level retrieval\n * operations the `Collection` routes through: scan-mode full-text `search`,\n * unified `retrieve` (lexical | semantic | hybrid), raw-vector `similarTo`, and\n * the lexical-index lifecycle (`warmIndex` / `flushIndex`). The active engine\n * ({@link withSearch}) dynamically imports the search/retrieval facade (keeping\n * it out of the floor bundle); {@link NO_SEARCH} throws.\n *\n * The embedding write-hook (`embedOnWrite`) is paired here too: opting into\n * `withSearch()` enables both the query surface AND the put()-time vector\n * compute — a vector that no gated `similarTo` / semantic `retrieve` could read\n * is dead weight, so embedding compute is not separately gatable. `Collection`\n * always assembles the per-call {@link SearchContext} and delegates here, so an\n * un-opted-in caller hits `NO_SEARCH`'s throw.\n * @internal\n */\nimport type { SearchContext } from './collection-facade.js'\nimport type { SearchOptions, SearchResult } from './index.js'\nimport type { RetrieveOptions, RetrieveHit, SimilarToOptions } from './retrieve-types.js'\nimport { SearchNotEnabledError } from '../../kernel/errors.js'\n\nexport interface SearchStrategy {\n  search<T>(ctx: SearchContext<T>, field: string, query: string, opts?: SearchOptions): Promise<SearchResult<T>[]>\n  retrieve<T>(ctx: SearchContext<T>, query: string, opts?: RetrieveOptions<T>): Promise<RetrieveHit<T>[]>\n  similarTo<T>(ctx: SearchContext<T>, vector: Float32Array, opts?: SimilarToOptions): Promise<RetrieveHit<T>[]>\n  warmIndex<T>(ctx: SearchContext<T>): Promise<void>\n  flushIndex<T>(ctx: SearchContext<T>): Promise<void>\n  embedOnWrite<T>(ctx: SearchContext<T>, id: string, record: T, version: number): Promise<void>\n  rebuildEmbeddings<T>(ctx: SearchContext<T>): Promise<{ rebuilt: number; skipped: number }>\n}\n\n/**\n * No-op stub — the floor default. Every capability method (and the embedding\n * write-hook) throws {@link SearchNotEnabledError}; opt in with\n * `searchStrategy: withSearch()` in createNoydb. @internal\n */\nexport const NO_SEARCH: SearchStrategy = {\n  async search() { throw new SearchNotEnabledError() },\n  async retrieve() { throw new SearchNotEnabledError() },\n  async similarTo() { throw new SearchNotEnabledError() },\n  async warmIndex() { throw new SearchNotEnabledError() },\n  async flushIndex() { throw new SearchNotEnabledError() },\n  async embedOnWrite() { throw new SearchNotEnabledError() },\n  async rebuildEmbeddings() { throw new SearchNotEnabledError() },\n}\n"],"mappings":";;;;;;;;AAYA,IAAM,OAAO;AAEN,IAAM,WAAsB,CAAC,SAA2B;AAC7D,MAAI,CAAC,KAAM,QAAO,CAAC;AACnB,SAAO,KAAK,UAAU,MAAM,EAAE,YAAY,EAAE,MAAM,IAAI,KAAK,CAAC;AAC9D;;;ACcA,IAAM,KAAK;AACX,IAAM,IAAI;AAGV,SAAS,UAAU,QAAiB,OAAuB;AACzD,QAAM,IAAK,OAAmC,KAAK;AACnD,MAAI,OAAO,MAAM,SAAU,QAAO;AAClC,MAAI,MAAM,QAAQ,MAAM,OAAW,QAAO;AAC1C,MAAI,OAAO,MAAM,YAAY,OAAO,MAAM,UAAW,QAAO,OAAO,CAAC;AACpE,SAAO;AACT;AAEO,SAAS,WACd,SACA,OACA,OACA,OAAsB,CAAC,GACvB,YAAuB,UACJ;AACnB,QAAM,aAAa,UAAU,KAAK;AAClC,MAAI,WAAW,WAAW,EAAG,QAAO,CAAC;AAErC,QAAM,QAAQ,KAAK,SAAS;AAC5B,QAAM,YAAY,KAAK,UAAU;AACjC,QAAM,aAAa,YAAY,WAAW,MAAM,GAAG,EAAE,IAAI;AACzD,QAAM,aAAa,YAAY,WAAW,WAAW,SAAS,CAAC,IAAI;AAGnE,QAAM,OAAO,QAAQ,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,QAAQ,EAAE,QAAQ,OAAO,UAAU,UAAU,EAAE,QAAQ,KAAK,CAAC,EAAE,EAAE;AAC9G,QAAM,IAAI,KAAK,UAAU;AACzB,QAAM,KAAK,oBAAI,IAAoB;AACnC,MAAI,WAAW;AACf,aAAW,KAAK,MAAM;AACpB,gBAAY,EAAE,MAAM;AACpB,eAAW,KAAK,IAAI,IAAI,EAAE,KAAK,EAAG,IAAG,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,KAAK,CAAC;AAAA,EAClE;AACA,QAAM,QAAQ,WAAW,KAAK;AAG9B,MAAI,WAAW;AACf,MAAI,eAAe,QAAW;AAC5B,eAAW,KAAK,MAAM;AACpB,UAAI,EAAE,MAAM,KAAK,CAAC,MAAM,EAAE,WAAW,UAAU,CAAC,EAAG;AAAA,IACrD;AAAA,EACF;AAEA,QAAM,gBAAgB,WAAW,UAAU,eAAe,SAAY,IAAI;AAC1E,QAAM,UAA6B,CAAC;AAEpC,aAAW,KAAK,MAAM;AACpB,UAAM,KAAK,oBAAI,IAAoB;AACnC,eAAW,KAAK,EAAE,MAAO,IAAG,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,KAAK,CAAC;AAEvD,UAAM,UAAwC,CAAC;AAC/C,eAAW,MAAM,YAAY;AAC3B,YAAM,IAAI,GAAG,IAAI,EAAE,KAAK;AACxB,UAAI,IAAI,EAAG,SAAQ,KAAK,EAAE,IAAI,GAAG,IAAI,GAAG,IAAI,EAAE,KAAK,EAAE,CAAC;AAAA,IACxD;AACA,QAAI,eAAe,QAAW;AAC5B,UAAI,MAAM;AACV,iBAAW,CAAC,GAAG,CAAC,KAAK,GAAI,KAAI,EAAE,WAAW,UAAU,EAAG,QAAO;AAC9D,UAAI,MAAM,EAAG,SAAQ,KAAK,EAAE,IAAI,KAAK,IAAI,SAAS,CAAC;AAAA,IACrD;AAEA,QAAI,QAAQ,WAAW,EAAG;AAC1B,QAAI,UAAU,SAAS,QAAQ,SAAS,cAAe;AAEvD,QAAI,QAAQ;AACZ,eAAW,KAAK,SAAS;AACvB,YAAM,MAAM,KAAK,IAAI,KAAK,IAAI,EAAE,KAAK,QAAQ,EAAE,KAAK,IAAI;AACxD,YAAM,QAAQ,EAAE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,MAAM,SAAS;AACzD,eAAS,OAAQ,EAAE,MAAM,KAAK,MAAO,SAAS;AAAA,IAChD;AACA,YAAQ,KAAK,EAAE,IAAI,EAAE,IAAI,OAAO,QAAQ,EAAE,OAAO,CAAC;AAAA,EACpD;AAEA,UAAQ,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AACxC,SAAO,KAAK,UAAU,SAAY,QAAQ,MAAM,GAAG,KAAK,KAAK,IAAI;AACnE;;;ACrGA,IAAM,YAAY,IAAI,KAAK,UAAU,QAAW,EAAE,aAAa,OAAO,CAAC;AAQhE,IAAM,gBAAgB,CAAC,SAA0B;AACtD,QAAM,MAAe,CAAC;AACtB,MAAI,CAAC,KAAM,QAAO;AAClB,aAAW,KAAK,UAAU,QAAQ,IAAI,GAAG;AACvC,QAAI,EAAE,WAAY,KAAI,KAAK,EAAE,MAAM,EAAE,QAAQ,UAAU,MAAM,EAAE,YAAY,GAAG,QAAQ,EAAE,MAAM,CAAC;AAAA,EACjG;AACA,SAAO;AACT;AAGO,IAAM,mBAA8B,CAAC,SAC1C,cAAc,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI;;;ACqBvC,IAAM,SAAS;AAQR,SAAS,iBAAiB,OAA4B;AAC3D,QAAM,UAA0B,CAAC;AACjC,QAAM,OAAO,MAAM,QAAQ,QAAQ,CAAC,IAAI,MAAc,SAA6B;AACjF,UAAM,QAAQ,iBAAiB,IAAI;AAInC,QAAI,MAAM,SAAS,EAAG,SAAQ,KAAK,EAAE,OAAO,MAAM,SAAS,SAAY,SAAY,OAAO,IAAI,EAAE,CAAC;AACjG,WAAO;AAAA,EACT,CAAC;AACD,SAAO,EAAE,OAAO,iBAAiB,IAAI,GAAG,QAAQ;AAClD;AASO,SAAS,YACd,WACA,QACkC;AAClC,QAAM,QAA+B,CAAC;AACtC,aAAW,KAAK,OAAO,OAAO;AAC5B,UAAM,IAAI,UAAU,IAAI,CAAC;AACzB,QAAI,MAAM,UAAa,EAAE,WAAW,EAAG,QAAO;AAC9C,UAAM,KAAK,CAAC;AAAA,EACd;AACA,SAAO,OAAO,SAAS,SACnB,qBAAqB,KAAK,IAC1B,YAAY,aAAa,OAAO,OAAO,KAAK,GAAG,OAAO,MAAM,SAAS,OAAO,IAAI;AACtF;AAEA,IAAM,WAAW,EAAE,OAAO,GAAG,OAAO,GAAG;AAGvC,SAAS,qBAAqB,OAAyE;AACrG,QAAM,OAAO,MAAM,MAAM,CAAC,EAAE,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC;AACjD,MAAI,QAAQ;AACZ,MAAI,QAAQ;AACZ,aAAW,KAAK,MAAM,CAAC,GAAI;AACzB,QAAI,KAAK;AACT,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,UAAI,CAAC,KAAK,CAAC,EAAG,IAAI,IAAI,IAAI,CAAC,GAAG;AAAE,aAAK;AAAO;AAAA,MAAM;AAAA,IACpD;AACA,QAAI,IAAI;AAAE;AAAS,UAAI,QAAQ,EAAG,SAAQ;AAAA,IAAE;AAAA,EAC9C;AACA,SAAO,EAAE,OAAO,MAAM;AACxB;AAIA,SAAS,aACP,OACA,OACgC;AAChC,QAAM,OAAO,oBAAI,IAAY;AAC7B,QAAM,MAA6B,CAAC;AACpC,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AACrC,QAAI,KAAK,IAAI,MAAM,CAAC,CAAE,EAAG;AACzB,SAAK,IAAI,MAAM,CAAC,CAAE;AAClB,QAAI,KAAK,MAAM,CAAC,CAAE;AAAA,EACpB;AACA,SAAO;AACT;AASA,SAAS,YACP,OACA,MACkC;AAClC,QAAM,SAA0C,CAAC;AACjD,WAAS,IAAI,GAAG,IAAI,MAAM,QAAQ,IAAK,YAAW,KAAK,MAAM,CAAC,EAAI,QAAO,KAAK,EAAE,KAAK,GAAG,MAAM,EAAE,CAAC;AACjG,SAAO,KAAK,CAAC,GAAG,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI;AAEtD,QAAM,OAAO,MAAM;AACnB,QAAM,OAAO,IAAI,MAAc,IAAI,EAAE,KAAK,CAAC;AAC3C,MAAI,WAAW;AACf,MAAI,OAAO;AACX,MAAI,QAAQ;AACZ,MAAI,QAAQ;AACZ,WAAS,QAAQ,GAAG,QAAQ,OAAO,QAAQ,SAAS;AAClD,UAAM,KAAK,OAAO,KAAK,EAAG;AAC1B,QAAI,KAAK,EAAE,MAAO,EAAG;AACrB,SAAK,EAAE,IAAI,KAAK,EAAE,IAAK;AACvB,WAAO,aAAa,QAAQ,KAAK,OAAO,IAAI,EAAG,IAAI,IAAK,GAAG;AACzD,YAAM,KAAK,OAAO,IAAI,EAAG;AACzB,WAAK,EAAE,IAAI,KAAK,EAAE,IAAK;AACvB;AAAA,IACF;AACA,QAAI,aAAa,QAAQ,OAAO,KAAK,EAAG,MAAM,OAAO,IAAI,EAAG,MAAM,KAAK,MAAM;AAC3E;AACA,UAAI,QAAQ,EAAG,SAAQ,OAAO,IAAI,EAAG;AAAA,IACvC;AAAA,EACF;AACA,SAAO,EAAE,OAAO,MAAM;AACxB;;;ACxIA,IAAMA,MAAK;AACX,IAAMC,KAAI;AAkDH,IAAM,yBAAyB;AA0B/B,IAAM,gBAAN,MAAM,eAAc;AAAA;AAAA,EAER,aAAa,oBAAI,IAAsE;AAAA,EACvF,OAAc,CAAC;AAAA,EACxB,YAAiC;AAAA,EAEzC,OAAO,MAAM,MAA+B,OAA0B,CAAC,GAAkB;AACvF,UAAM,MAAM,IAAI,eAAc;AAC9B,UAAM,aAAa,IAAI,IAAI,KAAK,aAAa,CAAC,CAAC;AAC/C,QAAI,YAAY;AAChB,eAAW,KAAK,MAAM;AACpB,iBAAW,KAAK,EAAE,QAAQ;AACxB,cAAM,SAAS,cAAc,EAAE,IAAI;AACnC,cAAM,KAAK,oBAAI,IAAoB;AACnC,cAAM,cAAc,oBAAI,IAAoB;AAC5C,cAAM,MAAM,WAAW,IAAI,EAAE,KAAK,IAAI,oBAAI,IAAsB,IAAI;AACpE,iBAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,gBAAM,IAAI,OAAO,CAAC;AAClB,aAAG,IAAI,EAAE,OAAO,GAAG,IAAI,EAAE,IAAI,KAAK,KAAK,CAAC;AACxC,cAAI,CAAC,YAAY,IAAI,EAAE,IAAI,EAAG,aAAY,IAAI,EAAE,MAAM,EAAE,MAAM;AAC9D,cAAI,KAAK;AACP,kBAAM,OAAO,IAAI,IAAI,EAAE,IAAI;AAC3B,gBAAI,KAAM,MAAK,KAAK,CAAC;AAAA,gBAChB,KAAI,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC;AAAA,UAC1B;AAAA,QACF;AACA,cAAM,MAAW;AAAA,UACf,IAAI,EAAE;AAAA,UAAI,OAAO,EAAE;AAAA,UAAO,GAAI,EAAE,WAAW,SAAY,EAAE,QAAQ,EAAE,OAAO,IAAI,CAAC;AAAA,UAC/E,MAAM,EAAE;AAAA,UAAM,KAAK,OAAO;AAAA,UAAQ;AAAA,UAAI;AAAA,UAAa,GAAI,MAAM,EAAE,IAAI,IAAI,CAAC;AAAA,QAC1E;AACA,YAAI,KAAK,KAAK,GAAG;AACjB,YAAI,IAAI,IAAI,WAAW,IAAI,EAAE,KAAK;AAClC,YAAI,CAAC,GAAG;AAAE,cAAI,EAAE,IAAI,oBAAI,IAAI,GAAG,GAAG,GAAG,UAAU,EAAE;AAAG,cAAI,WAAW,IAAI,EAAE,OAAO,CAAC;AAAA,QAAE;AACnF,UAAE,KAAK;AACP,UAAE,YAAY,IAAI;AAClB,mBAAW,QAAQ,GAAG,KAAK,EAAG,GAAE,GAAG,IAAI,OAAO,EAAE,GAAG,IAAI,IAAI,KAAK,KAAK,CAAC;AAAA,MACxE;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAAA;AAAA,EAGA,IAAI,iBAAsC;AAAE,WAAO,KAAK;AAAA,EAAU;AAAA,EAElE,MAAM,OAAe,OAAqB,CAAC,GAAe;AACxD,UAAM,SAAS,iBAAiB,KAAK;AACrC,QAAI,OAAO,QAAQ,SAAS,KAAK,KAAK,UAAU,SAAS,GAAG;AAC1D,YAAM,IAAI;AAAA,QACR;AAAA,MAEF;AAAA,IACF;AACA,UAAM,QAAQ,OAAO;AACrB,UAAM,aAAa,KAAK,UAAU,UAAU,MAAM,SAAS;AAC3D,UAAM,QAAQ,YAAY,MAAM,MAAM,GAAG,EAAE,IAAI;AAC/C,UAAM,SAAS,YAAY,MAAM,MAAM,SAAS,CAAC,IAAI;AACrD,QAAI,MAAM,WAAW,KAAK,WAAW,UAAa,OAAO,QAAQ,WAAW,EAAG,QAAO,CAAC;AACvF,UAAM,QAAQ,KAAK,SAAS;AAC5B,UAAM,WAAW,MAAM,UAAU,WAAW,SAAY,IAAI,KAAK,OAAO,QAAQ;AAGhF,UAAM,OAAO,oBAAI,IAAsB;AACvC,eAAW,OAAO,KAAK,MAAM;AAC3B,UAAI,KAAK,WAAW,UAAa,CAAC,KAAK,OAAO,SAAS,IAAI,KAAK,EAAG;AACnE,YAAM,QAAQ,KAAK,WAAW,IAAI,IAAI,KAAK;AAC3C,YAAM,QAAQ,MAAM,WAAW,MAAM,KAAK;AAC1C,UAAI,QAAQ;AACZ,UAAI,eAAe;AACnB,UAAI,gBAAgB;AAEpB,YAAM,YAAY,CAAC,IAAY,IAAY,WAAyB;AAClE,YAAI,MAAM,EAAG;AACb,wBAAgB;AAChB,YAAI,gBAAgB,KAAK,UAAU,EAAG,iBAAgB;AACtD,cAAM,MAAM,KAAK,IAAI,KAAK,MAAM,IAAI,KAAK,QAAQ,KAAK,IAAI;AAC1D,cAAM,QAAQ,KAAKD,OAAM,IAAIC,KAAIA,MAAK,IAAI,MAAM;AAChD,iBAAS,OAAQ,MAAMD,MAAK,MAAO,SAAS;AAAA,MAC9C;AAIA,iBAAW,UAAU,OAAO,SAAS;AACnC,YAAI,CAAC,IAAI,IAAK;AACd,cAAM,IAAI,YAAY,IAAI,KAAK,MAAM;AACrC,YAAI,EAAE,UAAU,EAAG;AAInB,YAAI,KAAK;AACT,mBAAW,KAAK,OAAO,MAAO,MAAK,KAAK,IAAI,IAAI,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC;AACpE,kBAAU,EAAE,OAAO,OAAO,WAAW,IAAI,MAAM,GAAG,KAAK,aAAa,KAAK,EAAE,KAAK,CAAC;AAAA,MACnF;AAEA,iBAAW,MAAM,MAAO,WAAU,IAAI,GAAG,IAAI,EAAE,KAAK,GAAG,MAAM,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,YAAY,IAAI,EAAE,KAAK,EAAE;AAE3G,UAAI,WAAW,QAAW;AAGxB,cAAM,WAAW,IAAI,IAAI,KAAK;AAC9B,YAAI,MAAM;AACV,YAAI,OAAO;AACX,mBAAW,CAAC,MAAM,CAAC,KAAK,IAAI,IAAI;AAC9B,cAAI,KAAK,WAAW,MAAM,KAAK,CAAC,SAAS,IAAI,IAAI,GAAG;AAClD,mBAAO;AACP,gBAAI,OAAO,EAAG,QAAO,IAAI,YAAY,IAAI,IAAI,KAAK;AAAA,UACpD;AAAA,QACF;AACA,YAAI,MAAM,GAAG;AAGX,cAAI,MAAM;AACV,qBAAW,KAAK,KAAK,MAAM;AACzB,gBAAI,EAAE,UAAU,IAAI,SAAS,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,EAAE,KAAK,CAAC,MAAM,EAAE,WAAW,MAAM,CAAC,EAAG;AAAA,UACnF;AACA,oBAAU,KAAK,OAAO,GAAG,IAAI;AAAA,QAC/B;AAAA,MACF;AAEA,UAAI,iBAAiB,EAAG;AACxB,UAAI,UAAU,SAAS,eAAe,SAAU;AAIhD,YAAM,QAAQ,KAAK,QAAQ,IAAI,KAAK;AACpC,UAAI,UAAU,UAAa,UAAU,EAAG,UAAS;AAEjD,YAAM,MAAgB;AAAA,QACpB,IAAI,IAAI;AAAA,QAAI;AAAA,QAAO,OAAO,IAAI;AAAA,QAAO,MAAM,IAAI;AAAA,QAC/C,QAAQ,gBAAgB,IAAI,IAAI;AAAA,QAChC,GAAI,IAAI,WAAW,SAAY,EAAE,QAAQ,IAAI,OAAO,IAAI,CAAC;AAAA,MAC3D;AACA,YAAM,OAAO,KAAK,IAAI,IAAI,EAAE;AAC5B,UAAI,CAAC,QAAQ,IAAI,QAAQ,KAAK,MAAO,MAAK,IAAI,IAAI,IAAI,GAAG;AAAA,IAC3D;AAEA,UAAM,UAAU,CAAC,GAAG,KAAK,OAAO,CAAC,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AACnE,WAAO,KAAK,UAAU,SAAY,QAAQ,MAAM,GAAG,KAAK,KAAK,IAAI;AAAA,EACnE;AAAA;AAAA,EAGQ,aAAa,KAAU,UAA0B;AACvD,QAAI,WAAW,EAAG,QAAO;AACzB,WAAO,cAAc,IAAI,IAAI,EAAE,QAAQ,GAAG,UAAU;AAAA,EACtD;AAAA,EAEA,aAA4B;AAC1B,WAAO;AAAA,MACL,GAAG;AAAA,MACH,WAAW,CAAC,GAAG,KAAK,SAAS;AAAA,MAC7B,YAAY,CAAC,GAAG,KAAK,UAAU,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,GAAG,GAAG,EAAE,GAAG,UAAU,EAAE,SAAS,CAAC,CAAC;AAAA,MACrG,MAAM,KAAK,KAAK,IAAI,CAAC,OAAO;AAAA,QAC1B,IAAI,EAAE;AAAA,QAAI,OAAO,EAAE;AAAA,QAAO,MAAM,EAAE;AAAA,QAAM,KAAK,EAAE;AAAA,QAC/C,IAAI,CAAC,GAAG,EAAE,EAAE;AAAA,QAAG,aAAa,CAAC,GAAG,EAAE,WAAW;AAAA,QAC7C,GAAI,EAAE,WAAW,SAAY,EAAE,QAAQ,EAAE,OAAO,IAAI,CAAC;AAAA,QACrD,GAAI,EAAE,MAAM,EAAE,KAAK,CAAC,GAAG,EAAE,GAAG,EAA0B,IAAI,CAAC;AAAA,MAC7D,EAAE;AAAA,IACJ;AAAA,EACF;AAAA,EAEA,OAAO,aAAa,GAAiC;AACnD,UAAM,MAAM,IAAI,eAAc;AAC9B,QAAI,YAAY,IAAI,IAAI,EAAE,SAAS;AACnC,eAAW,CAAC,GAAG,EAAE,KAAK,EAAE,WAAY,KAAI,WAAW,IAAI,GAAG,EAAE,IAAI,IAAI,IAAI,GAAG,EAAE,GAAG,GAAG,GAAG,GAAG,UAAU,GAAG,SAAS,CAAC;AAChH,eAAW,KAAK,EAAE,MAAM;AACtB,UAAI,KAAK,KAAK;AAAA,QACZ,IAAI,EAAE;AAAA,QAAI,OAAO,EAAE;AAAA,QAAO,MAAM,EAAE;AAAA,QAAM,KAAK,EAAE;AAAA,QAC/C,IAAI,IAAI,IAAI,EAAE,EAAE;AAAA,QAAG,aAAa,IAAI,IAAI,EAAE,WAAW;AAAA,QACrD,GAAI,EAAE,WAAW,SAAY,EAAE,QAAQ,EAAE,OAAO,IAAI,CAAC;AAAA,QACrD,GAAI,EAAE,MAAM,EAAE,KAAK,IAAI,IAAI,EAAE,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC;AAAA,MACtE,CAAC;AAAA,IACH;AACA,WAAO;AAAA,EACT;AACF;AAEA,IAAM,eAAoC,oBAAI,IAAI;;;AChR3C,SAAS,eAAe,MAAc,QAAgB,SAAS,IAAY;AAChF,QAAM,QAAQ,MAAM,KAAK,IAAI;AAC7B,MAAI,MAAM,UAAU,OAAQ,QAAO;AAEnC,QAAM,WAAW,MAAM,KAAK,KAAK,MAAM,GAAG,KAAK,IAAI,GAAG,MAAM,CAAC,CAAC,EAAE;AAChE,QAAM,OAAO,KAAK,MAAM,SAAS,CAAC;AAClC,MAAI,QAAQ,KAAK,IAAI,GAAG,WAAW,IAAI;AACvC,QAAM,MAAM,KAAK,IAAI,MAAM,QAAQ,QAAQ,MAAM;AACjD,UAAQ,KAAK,IAAI,GAAG,MAAM,MAAM;AAChC,QAAM,OAAO,MAAM,MAAM,OAAO,GAAG,EAAE,KAAK,EAAE;AAC5C,SAAO,GAAG,QAAQ,IAAI,WAAM,EAAE,GAAG,IAAI,GAAG,MAAM,MAAM,SAAS,WAAM,EAAE;AACvE;;;ACCO,IAAM,mBAAN,MAA6C;AAAA,EAC1C;AAAA,EAER,IAAI,QAAiB;AAAE,WAAO,KAAK,UAAU;AAAA,EAAU;AAAA,EAEvD,MAAM,YAAY,OAAsC,MAAkD;AACxG,QAAI,KAAK,UAAU,OAAW,MAAK,QAAQ,cAAc,MAAM,MAAM,GAAG,IAAI;AAC5E,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,YAAkB;AAAE,SAAK,QAAQ;AAAA,EAAU;AAAA,EAE3C,MAAM,QAAuB;AAAA,EAAsC;AACrE;;;ACTO,SAAS,wBACd,QACA,aACA,MACc;AACd,QAAM,SAAS,OAAO,YAAY,OAAO,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,IAAI;AACpE,QAAM,MAAoB,CAAC;AAC3B,aAAW,SAAS,QAAQ;AAC1B,eAAW,QAAQ,UAAU,QAAQ,KAAK,GAAG;AAC3C,UAAI,OAAO,SAAS,YAAY,SAAS,GAAI,KAAI,KAAK,EAAE,OAAO,MAAM,KAAK,CAAC;AAAA,IAC7E;AAAA,EACF;AACA,SAAO;AACT;AAEO,SAAS,sBACd,QACA,YACA,aACA,MACc;AACd,QAAM,UAAU,OAAO,YAAY,OAAO,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,IAAI,aAAa,OAAO,CAAC,MAAM,KAAK,UAAU;AAC/G,QAAM,MAAoB,CAAC;AAC3B,aAAW,SAAS,QAAQ;AAC1B,eAAW,QAAQ,UAAU,QAAQ,KAAK,GAAG;AAC3C,UAAI,CAAC,QAAQ,OAAO,SAAS,YAAY,MAAM,QAAQ,IAAI,EAAG;AAC9D,iBAAW,CAAC,QAAQ,GAAG,KAAK,OAAO,QAAQ,IAA+B,GAAG;AAC3E,YAAI,OAAO,QAAQ,YAAY,QAAQ,GAAI,KAAI,KAAK,EAAE,OAAO,QAAQ,MAAM,IAAI,CAAC;AAAA,MAClF;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAGO,SAAS,yBACd,QACA,eACA,WACA,aACA,MACc;AACd,QAAM,UAAU,OAAO,YAAY,OAAO,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,IAAI,aAAa,OAAO,CAAC,MAAM,KAAK,aAAa;AAClH,QAAM,MAAoB,CAAC;AAC3B,aAAW,SAAS,QAAQ;AAC1B,UAAM,MAAM,UAAU,IAAI,KAAK;AAC/B,QAAI,CAAC,IAAK;AACV,eAAW,QAAQ,UAAU,QAAQ,KAAK,GAAG;AAC3C,YAAM,OAAO,OAAO,SAAS,WAAW,CAAC,IAAI,IAAI,MAAM,QAAQ,IAAI,IAAI,KAAK,OAAO,CAAC,MAAmB,OAAO,MAAM,QAAQ,IAAI,CAAC;AACjI,iBAAW,OAAO,MAAM;AACtB,cAAM,SAAS,IAAI,IAAI,GAAG;AAC1B,YAAI,CAAC,OAAQ;AACb,mBAAW,CAAC,QAAQ,KAAK,KAAK,OAAO,QAAQ,MAAM,GAAG;AACpD,cAAI,UAAU,GAAI,KAAI,KAAK,EAAE,OAAO,QAAQ,MAAM,MAAM,CAAC;AAAA,QAC3D;AAAA,MACF;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;AAOO,SAAS,sBAAsB,kBAAuD;AAC3F,QAAM,MAAoB,CAAC;AAC3B,aAAW,CAAC,OAAO,KAAK,KAAK,kBAAkB;AAC7C,eAAW,QAAQ,MAAO,KAAI,SAAS,GAAI,KAAI,KAAK,EAAE,OAAO,MAAM,KAAK,CAAC;AAAA,EAC3E;AACA,SAAO;AACT;;;AClFO,SAAS,aAA6B;AAC3C,SAAO;AAAA,IACL,MAAM,OAAO,KAAK,OAAO,OAAO,MAAM;AACpC,YAAM,EAAE,OAAO,IAAI,MAAM,OAAO,iCAAwB;AACxD,aAAO,OAAO,KAAK,OAAO,OAAO,IAAI;AAAA,IACvC;AAAA,IACA,MAAM,SAAS,KAAK,OAAO,MAAM;AAC/B,YAAM,EAAE,SAAS,IAAI,MAAM,OAAO,iCAAwB;AAC1D,aAAO,SAAS,KAAK,OAAO,IAAI;AAAA,IAClC;AAAA,IACA,MAAM,UAAU,KAAK,QAAQ,MAAM;AACjC,YAAM,EAAE,UAAU,IAAI,MAAM,OAAO,iCAAwB;AAC3D,aAAO,UAAU,KAAK,QAAQ,IAAI;AAAA,IACpC;AAAA,IACA,MAAM,UAAU,KAAK;AACnB,YAAM,EAAE,UAAU,IAAI,MAAM,OAAO,iCAAwB;AAC3D,aAAO,UAAU,GAAG;AAAA,IACtB;AAAA,IACA,MAAM,WAAW,KAAK;AACpB,YAAM,EAAE,WAAW,IAAI,MAAM,OAAO,iCAAwB;AAC5D,aAAO,WAAW,GAAG;AAAA,IACvB;AAAA,IACA,MAAM,aAAa,KAAK,IAAI,QAAQ,SAAS;AAC3C,YAAM,EAAE,aAAa,IAAI,MAAM,OAAO,iCAAwB;AAC9D,aAAO,aAAa,KAAK,IAAI,QAAQ,OAAO;AAAA,IAC9C;AAAA,IACA,MAAM,kBAAkB,KAAK;AAC3B,YAAM,EAAE,kBAAkB,IAAI,MAAM,OAAO,iCAAwB;AACnE,aAAO,kBAAkB,GAAG;AAAA,IAC9B;AAAA,EACF;AACF;;;ACLO,IAAM,YAA4B;AAAA,EACvC,MAAM,SAAS;AAAE,UAAM,IAAI,sBAAsB;AAAA,EAAE;AAAA,EACnD,MAAM,WAAW;AAAE,UAAM,IAAI,sBAAsB;AAAA,EAAE;AAAA,EACrD,MAAM,YAAY;AAAE,UAAM,IAAI,sBAAsB;AAAA,EAAE;AAAA,EACtD,MAAM,YAAY;AAAE,UAAM,IAAI,sBAAsB;AAAA,EAAE;AAAA,EACtD,MAAM,aAAa;AAAE,UAAM,IAAI,sBAAsB;AAAA,EAAE;AAAA,EACvD,MAAM,eAAe;AAAE,UAAM,IAAI,sBAAsB;AAAA,EAAE;AAAA,EACzD,MAAM,oBAAoB;AAAE,UAAM,IAAI,sBAAsB;AAAA,EAAE;AAChE;","names":["K1","B"]}

package/dist/{chunk-GY4WYNNG.js → chunk-ID6Z6E66.js}

@@ -4,7 +4,7 @@ import {
   formatScaledInt,
   parseToScaledInt,
   rescaleScaledInt
-} from "./chunk-VXANTWBJ.js";
+} from "./chunk-WY2XXTET.js";
 
 // src/via/money/arith.ts
 function parseAmount(label, amount, scale, rounding) {
@@ -120,4 +120,4 @@ export {
   isMoneyString,
   moneyNumber
 };
-//# sourceMappingURL=chunk-GY4WYNNG.js.map
+//# sourceMappingURL=chunk-ID6Z6E66.js.map

package/dist/{chunk-EYBQEIUY.js → chunk-IEX7NK2K.js}

@@ -10,14 +10,14 @@ import {
   verifyPrompt,
   verifyRoster,
   verifyTypedEcho
-} from "./chunk-G56KBWFY.js";
+} from "./chunk-M7NI3IWE.js";
 import {
   NoAccessError,
   NoydbError,
   ValidationError,
   WrongEchoError,
   WrongPromptError
-} from "./chunk-7O3Y4PPD.js";
+} from "./chunk-244VXYPG.js";
 
 // src/with-party/team/echo-ceremony.ts
 async function beginEchoUnlock(store, vault, opts) {
@@ -122,4 +122,4 @@ export {
   MemoryDeviceSeal,
   withTeam
 };
-//# sourceMappingURL=chunk-EYBQEIUY.js.map
+//# sourceMappingURL=chunk-IEX7NK2K.js.map

package/dist/{chunk-KUJDV5QH.js → chunk-ISZQJBML.js}

@@ -1,16 +1,16 @@
 import {
   getHistory,
   historyIdentity
-} from "./chunk-X2DLENDQ.js";
+} from "./chunk-QWGU66MP.js";
 import {
   liveRecordIsElevated
-} from "./chunk-JMGDHKQF.js";
+} from "./chunk-JCN44NCY.js";
 import {
   openEnvelopeJson
-} from "./chunk-77K4PG6P.js";
+} from "./chunk-KJFW62P4.js";
 import {
   ReadOnlyAtInstantError
-} from "./chunk-7O3Y4PPD.js";
+} from "./chunk-244VXYPG.js";
 
 // src/with-commit/history/time-machine.ts
 var VaultInstant = class {
@@ -208,4 +208,4 @@ export {
   VaultInstant,
   CollectionInstant
 };
-//# sourceMappingURL=chunk-KUJDV5QH.js.map
+//# sourceMappingURL=chunk-ISZQJBML.js.map

package/dist/{chunk-LWBCUYZW.js → chunk-IT22PWKV.js}

@@ -1,6 +1,6 @@
 import {
   NoydbError
-} from "./chunk-7O3Y4PPD.js";
+} from "./chunk-244VXYPG.js";
 
 // src/with-formula/computed/index.ts
 var ComputedFieldError = class extends NoydbError {
@@ -35,4 +35,4 @@ export {
   ComputedFieldError,
   evalComputedFields
 };
-//# sourceMappingURL=chunk-LWBCUYZW.js.map
+//# sourceMappingURL=chunk-IT22PWKV.js.map

package/dist/{chunk-EQEYOJBM.js → chunk-IUWCVHQ7.js}

@@ -1,9 +1,9 @@
 import {
   buildRecordEnvelope
-} from "./chunk-SZJ3DLZA.js";
+} from "./chunk-SEE332EV.js";
 import {
   ValidationError
-} from "./chunk-7O3Y4PPD.js";
+} from "./chunk-244VXYPG.js";
 
 // src/with-party/directory/cover/custom.ts
 var CUSTOM_KEY_PATTERN = /^[a-z0-9]+([.-][a-z0-9]+)+$/i;
@@ -230,4 +230,4 @@ export {
   resolveLocale,
   pickLocale
 };
-//# sourceMappingURL=chunk-EQEYOJBM.js.map
+//# sourceMappingURL=chunk-IUWCVHQ7.js.map

package/dist/chunk-IUWCVHQ7.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/with-party/directory/cover/custom.ts","../src/with-party/directory/cover/schema.ts","../src/with-party/directory/cover/storage.ts"],"sourcesContent":["/**\n * The cover's namespaced `custom` extension slot (#800) — input\n * validation, the namespace-level patch merge, and the post-merge\n * size caps.\n *\n * Like everything on the cover, `custom` is plaintext, public by\n * design, and unauthenticated — payloads are hints (display defaults,\n * routing suggestions, registry pointers), never an input to\n * security, authorization, or data-integrity decisions.\n *\n * @see https://github.com/noy-db/docs/blob/main/content/docs/services/public-envelope.md\n *\n * @module\n */\nimport { ValidationError } from '../../../kernel/errors.js'\nimport type { Cover, JsonValue, ResolvedCoverSchema } from './types.js'\n\n/**\n * Namespace keys must be reverse-DNS or package-style identifiers —\n * at least one dot/dash-separated segment (`noydb.viewer`,\n * `com.acme.registry` pass; a bare `config` fails), so two frameworks\n * can't collide on a bare word.\n */\nconst CUSTOM_KEY_PATTERN = /^[a-z0-9]+([.-][a-z0-9]+)+$/i\n\n/** Maximum nesting depth of a namespace payload (containers, not leaves). */\nconst MAX_CUSTOM_DEPTH = 8\n\n/**\n * Validate the owner-supplied `custom` input: the field must be a\n * plain object, every key must match {@link CUSTOM_KEY_PATTERN}, and\n * every value must be JSON-serializable (no functions, `undefined`,\n * symbols, bigints, or cycles) within the depth cap. `null` is\n * accepted — it is the delete-this-namespace directive and never\n * persists. Throws `ValidationError` on the first violation.\n */\nexport function validateCustomInput(custom: Record<string, JsonValue>): void {\n  if (custom === null || typeof custom !== 'object' || Array.isArray(custom)) {\n    throw new ValidationError(\n      `setCover: custom must be a { [namespace]: value } object, got ${\n        Array.isArray(custom) ? 'array' : typeof custom\n      }.`,\n    )\n  }\n  for (const [ns, value] of Object.entries(custom)) {\n    if (!CUSTOM_KEY_PATTERN.test(ns)) {\n      throw new ValidationError(\n        `setCover: custom namespace \"${ns}\" is invalid. Keys must be ` +\n          'reverse-DNS or package-style identifiers with at least one ' +\n          'dot/dash-separated segment (e.g. \"noydb.viewer\", \"com.acme.registry\").',\n      )\n    }\n    assertJsonValue(value, ns, 1, new Set())\n  }\n}\n\nfunction assertJsonValue(\n  value: unknown,\n  ns: string,\n  depth: number,\n  seen: Set<object>,\n): void {\n  if (value === null) return\n  const t = typeof value\n  if (t === 'string' || t === 'number' || t === 'boolean') return\n  if (t !== 'object') {\n    throw new ValidationError(\n      `setCover: custom[\"${ns}\"] contains a non-JSON value (${t}). ` +\n        'Only strings, numbers, booleans, null, arrays, and plain objects are allowed.',\n    )\n  }\n  const container = value as object\n  if (seen.has(container)) {\n    throw new ValidationError(\n      `setCover: custom[\"${ns}\"] contains a circular reference.`,\n    )\n  }\n  if (depth > MAX_CUSTOM_DEPTH) {\n    throw new ValidationError(\n      `setCover: custom[\"${ns}\"] nests deeper than the ${MAX_CUSTOM_DEPTH}-level cap.`,\n    )\n  }\n  seen.add(container)\n  const children = Array.isArray(container) ? container : Object.values(container)\n  for (const child of children) {\n    assertJsonValue(child, ns, depth + 1, seen)\n  }\n  seen.delete(container)\n}\n\n/**\n * Namespace-level patch merge for `setCover`: provided namespaces\n * replace their previous value, absent namespaces are preserved, and\n * an explicit `null` deletes that namespace (so `null` never persists\n * as a namespace value). A whole-`custom`-absent patch preserves the\n * previous custom, consistent with the other cover fields. Rationale:\n * framework A must never need read-modify-write of framework B's data.\n *\n * Returns a spreadable fragment — `{ custom }` when the merge leaves\n * at least one namespace, `{}` when it leaves none (the field is\n * dropped from the persisted document rather than stored empty).\n */\nexport function mergeCustom(\n  existing: Record<string, JsonValue> | undefined,\n  patch: Record<string, JsonValue> | undefined,\n): { custom: Record<string, JsonValue> } | Record<string, never> {\n  if (patch === undefined) {\n    return existing !== undefined ? { custom: existing } : {}\n  }\n  const merged: Record<string, JsonValue> = { ...existing }\n  for (const [ns, value] of Object.entries(patch)) {\n    if (value === null) {\n      delete merged[ns]\n    } else {\n      merged[ns] = value\n    }\n  }\n  return Object.keys(merged).length > 0 ? { custom: merged } : {}\n}\n\n/**\n * Post-merge size caps — validates the WOULD-BE-PERSISTED document\n * (after the namespace merge), so a small patch can't tip the stored\n * cover over a cap unnoticed. `maxCoverBytes` bounds the entire\n * serialized document, which also closes the unbounded locale-map\n * key-count hole for `name` / `description`. Sizes are measured as\n * `JSON.stringify` length. Throws `ValidationError` on violation.\n */\nexport function validateCoverSize(\n  cover: Cover,\n  schema: ResolvedCoverSchema,\n): void {\n  if (cover.custom !== undefined) {\n    const customSize = JSON.stringify(cover.custom).length\n    if (customSize > schema.maxCustomBytes) {\n      throw new ValidationError(\n        `setCover: custom exceeds the ${schema.maxCustomBytes}-byte cap ` +\n          `(got ${customSize} bytes serialized, after merging with the stored namespaces).`,\n      )\n    }\n  }\n  const totalSize = JSON.stringify(cover).length\n  if (totalSize > schema.maxCoverBytes) {\n    throw new ValidationError(\n      `setCover: the cover document exceeds the ${schema.maxCoverBytes}-byte cap ` +\n        `(got ${totalSize} bytes serialized).`,\n    )\n  }\n}\n","/**\n * Validate-on-write for the cover. Runs at every `setCover` call;\n * the developer's schema decides which fields are allowed and the\n * size caps that apply.\n *\n * @module\n */\nimport { ValidationError } from '../../../kernel/errors.js'\nimport { validateCustomInput } from './custom.js'\nimport type {\n  Cover,\n  CoverText,\n  JsonValue,\n  ResolvedCoverSchema,\n  CoverField,\n} from './types.js'\n\n/** Owner-supplied input — the subset of {@link Cover} the owner can set. */\nexport interface SetCoverInput {\n  readonly name?: CoverText\n  readonly description?: CoverText\n  readonly icon?: string\n  readonly defaultLocale?: string\n  /**\n   * Namespace-level patch for the cover's `custom` slot (#800):\n   * provided namespaces replace their previous value, absent\n   * namespaces are preserved, an explicit `null` deletes that\n   * namespace. Requires `'custom'` in the schema's `fields` list —\n   * the `cover: true` shorthand does NOT enable it.\n   */\n  readonly custom?: Record<string, JsonValue>\n}\n\nconst DATA_URL_PREFIX = /^data:([a-zA-Z0-9.+-]+\\/[a-zA-Z0-9.+-]+);base64,/\n\n/**\n * Validate an owner-supplied cover input against the developer's\n * resolved schema. Throws `ValidationError` on the first violation;\n * returns void on success.\n *\n * The validator is deliberately strict: every fail mode is a hard\n * error rather than a silent drop, so the owner finds out immediately\n * which field they oversized rather than discovering a truncated\n * label months later.\n */\nexport function validateCoverInput(\n  input: SetCoverInput,\n  schema: ResolvedCoverSchema,\n): void {\n  const allowed = new Set<CoverField>(schema.fields)\n\n  // Reject any key not in the schema's allowed-field list.\n  for (const key of Object.keys(input)) {\n    const known: CoverField | undefined =\n      key === 'name' || key === 'description' || key === 'icon' || key === 'defaultLocale' || key === 'custom'\n        ? key\n        : undefined\n    if (!known) {\n      throw new ValidationError(\n        `setCover: unknown field \"${key}\". ` +\n          `Allowed fields: ${[...allowed].join(', ')}.`,\n      )\n    }\n    if (!allowed.has(known)) {\n      throw new ValidationError(\n        `setCover: field \"${known}\" is not enabled in this vault's schema. ` +\n          `Allowed fields: ${[...allowed].join(', ')}.`,\n      )\n    }\n  }\n\n  if (input.name !== undefined) {\n    validateText(input.name, 'name', schema.maxStringChars)\n  }\n  if (input.description !== undefined) {\n    validateText(input.description, 'description', schema.maxStringChars)\n  }\n  if (input.icon !== undefined) {\n    validateIcon(input.icon, schema)\n  }\n  if (input.defaultLocale !== undefined && typeof input.defaultLocale !== 'string') {\n    throw new ValidationError(\n      `setCover: defaultLocale must be a string (BCP-47), got ${typeof input.defaultLocale}.`,\n    )\n  }\n  if (input.custom !== undefined) {\n    validateCustomInput(input.custom)\n  }\n}\n\nfunction validateText(\n  value: CoverText,\n  field: string,\n  maxChars: number,\n): void {\n  if (typeof value === 'string') {\n    if (value.length > maxChars) {\n      throw new ValidationError(\n        `setCover: ${field} exceeds the ${maxChars}-character cap (got ${value.length}).`,\n      )\n    }\n    return\n  }\n  if (typeof value !== 'object' || value === null || Array.isArray(value)) {\n    throw new ValidationError(\n      `setCover: ${field} must be a string or { [locale]: string } map, got ${typeof value}.`,\n    )\n  }\n  // Locale map. Each value must be a non-empty string within the cap.\n  for (const [locale, str] of Object.entries(value)) {\n    if (typeof str !== 'string') {\n      throw new ValidationError(\n        `setCover: ${field}[${locale}] must be a string, got ${typeof str}.`,\n      )\n    }\n    if (str.length > maxChars) {\n      throw new ValidationError(\n        `setCover: ${field}[${locale}] exceeds the ${maxChars}-character cap (got ${str.length}).`,\n      )\n    }\n  }\n}\n\nfunction validateIcon(icon: string, schema: ResolvedCoverSchema): void {\n  if (typeof icon !== 'string') {\n    throw new ValidationError(\n      `setCover: icon must be a data: URL string, got ${typeof icon}.`,\n    )\n  }\n  if (icon.length > schema.maxIconBytes) {\n    throw new ValidationError(\n      `setCover: icon exceeds the ${schema.maxIconBytes}-byte cap (got ${icon.length}).`,\n    )\n  }\n  const m = DATA_URL_PREFIX.exec(icon)\n  if (!m) {\n    throw new ValidationError(\n      'setCover: icon must be a base64 data URL ' +\n        '(`data:image/png;base64,…` or `data:image/svg+xml;base64,…`). ' +\n        'External URLs are not supported in v1.',\n    )\n  }\n  const mime = m[1]!\n  if (!schema.iconMimeTypes.includes(mime)) {\n    throw new ValidationError(\n      `setCover: icon MIME type \"${mime}\" is not allowed. ` +\n        `Permitted types: ${schema.iconMimeTypes.join(', ')}.`,\n    )\n  }\n}\n\n/**\n * Lightweight runtime predicate — used by the bundle header\n * validator to recognise a cover without requiring it. (The wire\n * discriminator keeps its frozen name: `_noydb_public: 1`.)\n */\nexport function isCover(x: unknown): x is Cover {\n  if (x === null || typeof x !== 'object' || Array.isArray(x)) return false\n  const obj = x as Record<string, unknown>\n  return obj['_noydb_public'] === 1 && typeof obj['version'] === 'number'\n}\n","/**\n * Persistence helpers for `_meta/public-envelope` — the cover's\n * frozen wire location. Mirrors the bypass-AES pattern used by\n * `_meta/handle` and `_meta/policy` — the document is plaintext\n * JSON, the envelope's `_iv` field is left empty.\n *\n * @module\n */\nimport { buildRecordEnvelope } from '../../../kernel/enclave/index.js'\nimport type { NoydbStore } from '../../../kernel/types.js'\nimport type { Cover } from './types.js'\nimport { isCover } from './schema.js'\n\n/**\n * Reserved id for the vault-level cover record. The VALUE is frozen\n * wire format — the record predates the #799 rename and stays at\n * `_meta/public-envelope` so existing vaults need no migration.\n */\nexport const COVER_RECORD_ID = 'public-envelope'\n\n/**\n * Read the cover from `_meta/public-envelope`. Returns `undefined`\n * when no cover has been persisted (fresh vault, or a vault written\n * before the feature was enabled). Tolerates corrupted documents —\n * a JSON parse failure surfaces as `undefined`, not a thrown error,\n * mirroring `_meta/handle`'s contract.\n */\nexport async function loadCover(\n  store: NoydbStore,\n  vault: string,\n): Promise<Cover | undefined> {\n  const envelope = await store.get(vault, '_meta', COVER_RECORD_ID)\n  if (!envelope) return undefined\n  try {\n    const parsed = JSON.parse(envelope._data) as unknown\n    if (!isCover(parsed)) return undefined\n    return parsed\n  } catch {\n    return undefined\n  }\n}\n\n/** Persist the cover. Idempotent — overwrites any prior write. */\nexport async function saveCover(\n  store: NoydbStore,\n  vault: string,\n  cover: Cover,\n): Promise<void> {\n  const wireEnvelope = buildRecordEnvelope(\n    { collection: '_meta', id: COVER_RECORD_ID, version: 1 },\n    { iv: '', data: JSON.stringify(cover) },\n  )\n  await store.put(vault, '_meta', COVER_RECORD_ID, wireEnvelope)\n}\n\n/**\n * Public, no-key reader. Plain function, not a method on `Noydb` —\n * the whole point is it works without an authenticated session, so\n * a UI can show \"Acme 2026 Tax Records\" before unlocking.\n *\n * Resolves any `name` / `description` locale map through the supplied\n * `locale` (when provided). Omitting `locale` returns the raw\n * cover, which a multilingual picker can render as it pleases.\n */\nexport async function readCover(\n  store: NoydbStore,\n  vault: string,\n  opts: { readonly locale?: string } = {},\n): Promise<Cover | undefined> {\n  const raw = await loadCover(store, vault)\n  if (!raw) return undefined\n  if (opts.locale === undefined) return raw\n  return resolveLocale(raw, opts.locale)\n}\n\n/**\n * Resolve the locale-map fields (`name`, `description`) of a cover\n * to plain strings for the requested locale, falling back through\n * `defaultLocale` and then any available translation.\n *\n * @internal\n */\nexport function resolveLocale(\n  cover: Cover,\n  locale: string,\n): Cover {\n  return {\n    ...cover,\n    ...(cover.name !== undefined ? { name: pickLocale(cover.name, locale, cover.defaultLocale) } : {}),\n    ...(cover.description !== undefined ? { description: pickLocale(cover.description, locale, cover.defaultLocale) } : {}),\n  }\n}\n\n/**\n * Resolve a `string | { [locale]: string }` value to a string for a\n * given locale. Exported so the bundle reader can reuse it without\n * duplicating the fallback chain.\n *\n * **Looser than `resolveI18nText`** — the hub's record-field resolver\n * throws `LocaleNotSpecifiedError` when no translation matches, but\n * label semantics deliberately prefer \"show *something*\" over\n * throwing. The fallback chain is:\n *   1. Exact `locale` match.\n *   2. `defaultLocale` (when supplied on the cover).\n *   3. First non-empty value in the map.\n *   4. Empty string (only if every translation is empty — pathological).\n *\n * This deviation is documented in `https://github.com/noy-db/docs/blob/main/content/docs/services/public-envelope.md`.\n */\nexport function pickLocale(\n  value: string | Record<string, string>,\n  locale: string,\n  defaultLocale: string | undefined,\n): string {\n  if (typeof value === 'string') return value\n  if (value[locale] !== undefined && value[locale] !== '') return value[locale]\n  if (defaultLocale && value[defaultLocale] !== undefined && value[defaultLocale] !== '') {\n    return value[defaultLocale]\n  }\n  for (const v of Object.values(value)) {\n    if (v !== '') return v\n  }\n  return ''\n}\n"],"mappings":";;;;;;;;AAuBA,IAAM,qBAAqB;AAG3B,IAAM,mBAAmB;AAUlB,SAAS,oBAAoB,QAAyC;AAC3E,MAAI,WAAW,QAAQ,OAAO,WAAW,YAAY,MAAM,QAAQ,MAAM,GAAG;AAC1E,UAAM,IAAI;AAAA,MACR,iEACE,MAAM,QAAQ,MAAM,IAAI,UAAU,OAAO,MAC3C;AAAA,IACF;AAAA,EACF;AACA,aAAW,CAAC,IAAI,KAAK,KAAK,OAAO,QAAQ,MAAM,GAAG;AAChD,QAAI,CAAC,mBAAmB,KAAK,EAAE,GAAG;AAChC,YAAM,IAAI;AAAA,QACR,+BAA+B,EAAE;AAAA,MAGnC;AAAA,IACF;AACA,oBAAgB,OAAO,IAAI,GAAG,oBAAI,IAAI,CAAC;AAAA,EACzC;AACF;AAEA,SAAS,gBACP,OACA,IACA,OACA,MACM;AACN,MAAI,UAAU,KAAM;AACpB,QAAM,IAAI,OAAO;AACjB,MAAI,MAAM,YAAY,MAAM,YAAY,MAAM,UAAW;AACzD,MAAI,MAAM,UAAU;AAClB,UAAM,IAAI;AAAA,MACR,qBAAqB,EAAE,iCAAiC,CAAC;AAAA,IAE3D;AAAA,EACF;AACA,QAAM,YAAY;AAClB,MAAI,KAAK,IAAI,SAAS,GAAG;AACvB,UAAM,IAAI;AAAA,MACR,qBAAqB,EAAE;AAAA,IACzB;AAAA,EACF;AACA,MAAI,QAAQ,kBAAkB;AAC5B,UAAM,IAAI;AAAA,MACR,qBAAqB,EAAE,4BAA4B,gBAAgB;AAAA,IACrE;AAAA,EACF;AACA,OAAK,IAAI,SAAS;AAClB,QAAM,WAAW,MAAM,QAAQ,SAAS,IAAI,YAAY,OAAO,OAAO,SAAS;AAC/E,aAAW,SAAS,UAAU;AAC5B,oBAAgB,OAAO,IAAI,QAAQ,GAAG,IAAI;AAAA,EAC5C;AACA,OAAK,OAAO,SAAS;AACvB;AAcO,SAAS,YACd,UACA,OAC+D;AAC/D,MAAI,UAAU,QAAW;AACvB,WAAO,aAAa,SAAY,EAAE,QAAQ,SAAS,IAAI,CAAC;AAAA,EAC1D;AACA,QAAM,SAAoC,EAAE,GAAG,SAAS;AACxD,aAAW,CAAC,IAAI,KAAK,KAAK,OAAO,QAAQ,KAAK,GAAG;AAC/C,QAAI,UAAU,MAAM;AAClB,aAAO,OAAO,EAAE;AAAA,IAClB,OAAO;AACL,aAAO,EAAE,IAAI;AAAA,IACf;AAAA,EACF;AACA,SAAO,OAAO,KAAK,MAAM,EAAE,SAAS,IAAI,EAAE,QAAQ,OAAO,IAAI,CAAC;AAChE;AAUO,SAAS,kBACd,OACA,QACM;AACN,MAAI,MAAM,WAAW,QAAW;AAC9B,UAAM,aAAa,KAAK,UAAU,MAAM,MAAM,EAAE;AAChD,QAAI,aAAa,OAAO,gBAAgB;AACtC,YAAM,IAAI;AAAA,QACR,gCAAgC,OAAO,cAAc,kBAC3C,UAAU;AAAA,MACtB;AAAA,IACF;AAAA,EACF;AACA,QAAM,YAAY,KAAK,UAAU,KAAK,EAAE;AACxC,MAAI,YAAY,OAAO,eAAe;AACpC,UAAM,IAAI;AAAA,MACR,4CAA4C,OAAO,aAAa,kBACtD,SAAS;AAAA,IACrB;AAAA,EACF;AACF;;;ACnHA,IAAM,kBAAkB;AAYjB,SAAS,mBACd,OACA,QACM;AACN,QAAM,UAAU,IAAI,IAAgB,OAAO,MAAM;AAGjD,aAAW,OAAO,OAAO,KAAK,KAAK,GAAG;AACpC,UAAM,QACJ,QAAQ,UAAU,QAAQ,iBAAiB,QAAQ,UAAU,QAAQ,mBAAmB,QAAQ,WAC5F,MACA;AACN,QAAI,CAAC,OAAO;AACV,YAAM,IAAI;AAAA,QACR,4BAA4B,GAAG,sBACV,CAAC,GAAG,OAAO,EAAE,KAAK,IAAI,CAAC;AAAA,MAC9C;AAAA,IACF;AACA,QAAI,CAAC,QAAQ,IAAI,KAAK,GAAG;AACvB,YAAM,IAAI;AAAA,QACR,oBAAoB,KAAK,4DACJ,CAAC,GAAG,OAAO,EAAE,KAAK,IAAI,CAAC;AAAA,MAC9C;AAAA,IACF;AAAA,EACF;AAEA,MAAI,MAAM,SAAS,QAAW;AAC5B,iBAAa,MAAM,MAAM,QAAQ,OAAO,cAAc;AAAA,EACxD;AACA,MAAI,MAAM,gBAAgB,QAAW;AACnC,iBAAa,MAAM,aAAa,eAAe,OAAO,cAAc;AAAA,EACtE;AACA,MAAI,MAAM,SAAS,QAAW;AAC5B,iBAAa,MAAM,MAAM,MAAM;AAAA,EACjC;AACA,MAAI,MAAM,kBAAkB,UAAa,OAAO,MAAM,kBAAkB,UAAU;AAChF,UAAM,IAAI;AAAA,MACR,0DAA0D,OAAO,MAAM,aAAa;AAAA,IACtF;AAAA,EACF;AACA,MAAI,MAAM,WAAW,QAAW;AAC9B,wBAAoB,MAAM,MAAM;AAAA,EAClC;AACF;AAEA,SAAS,aACP,OACA,OACA,UACM;AACN,MAAI,OAAO,UAAU,UAAU;AAC7B,QAAI,MAAM,SAAS,UAAU;AAC3B,YAAM,IAAI;AAAA,QACR,aAAa,KAAK,gBAAgB,QAAQ,uBAAuB,MAAM,MAAM;AAAA,MAC/E;AAAA,IACF;AACA;AAAA,EACF;AACA,MAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,MAAM,QAAQ,KAAK,GAAG;AACvE,UAAM,IAAI;AAAA,MACR,aAAa,KAAK,sDAAsD,OAAO,KAAK;AAAA,IACtF;AAAA,EACF;AAEA,aAAW,CAAC,QAAQ,GAAG,KAAK,OAAO,QAAQ,KAAK,GAAG;AACjD,QAAI,OAAO,QAAQ,UAAU;AAC3B,YAAM,IAAI;AAAA,QACR,aAAa,KAAK,IAAI,MAAM,2BAA2B,OAAO,GAAG;AAAA,MACnE;AAAA,IACF;AACA,QAAI,IAAI,SAAS,UAAU;AACzB,YAAM,IAAI;AAAA,QACR,aAAa,KAAK,IAAI,MAAM,iBAAiB,QAAQ,uBAAuB,IAAI,MAAM;AAAA,MACxF;AAAA,IACF;AAAA,EACF;AACF;AAEA,SAAS,aAAa,MAAc,QAAmC;AACrE,MAAI,OAAO,SAAS,UAAU;AAC5B,UAAM,IAAI;AAAA,MACR,kDAAkD,OAAO,IAAI;AAAA,IAC/D;AAAA,EACF;AACA,MAAI,KAAK,SAAS,OAAO,cAAc;AACrC,UAAM,IAAI;AAAA,MACR,8BAA8B,OAAO,YAAY,kBAAkB,KAAK,MAAM;AAAA,IAChF;AAAA,EACF;AACA,QAAM,IAAI,gBAAgB,KAAK,IAAI;AACnC,MAAI,CAAC,GAAG;AACN,UAAM,IAAI;AAAA,MACR;AAAA,IAGF;AAAA,EACF;AACA,QAAM,OAAO,EAAE,CAAC;AAChB,MAAI,CAAC,OAAO,cAAc,SAAS,IAAI,GAAG;AACxC,UAAM,IAAI;AAAA,MACR,6BAA6B,IAAI,sCACX,OAAO,cAAc,KAAK,IAAI,CAAC;AAAA,IACvD;AAAA,EACF;AACF;AAOO,SAAS,QAAQ,GAAwB;AAC9C,MAAI,MAAM,QAAQ,OAAO,MAAM,YAAY,MAAM,QAAQ,CAAC,EAAG,QAAO;AACpE,QAAM,MAAM;AACZ,SAAO,IAAI,eAAe,MAAM,KAAK,OAAO,IAAI,SAAS,MAAM;AACjE;;;AC9IO,IAAM,kBAAkB;AAS/B,eAAsB,UACpB,OACA,OAC4B;AAC5B,QAAM,WAAW,MAAM,MAAM,IAAI,OAAO,SAAS,eAAe;AAChE,MAAI,CAAC,SAAU,QAAO;AACtB,MAAI;AACF,UAAM,SAAS,KAAK,MAAM,SAAS,KAAK;AACxC,QAAI,CAAC,QAAQ,MAAM,EAAG,QAAO;AAC7B,WAAO;AAAA,EACT,QAAQ;AACN,WAAO;AAAA,EACT;AACF;AAGA,eAAsB,UACpB,OACA,OACA,OACe;AACf,QAAM,eAAe;AAAA,IACnB,EAAE,YAAY,SAAS,IAAI,iBAAiB,SAAS,EAAE;AAAA,IACvD,EAAE,IAAI,IAAI,MAAM,KAAK,UAAU,KAAK,EAAE;AAAA,EACxC;AACA,QAAM,MAAM,IAAI,OAAO,SAAS,iBAAiB,YAAY;AAC/D;AAWA,eAAsB,UACpB,OACA,OACA,OAAqC,CAAC,GACV;AAC5B,QAAM,MAAM,MAAM,UAAU,OAAO,KAAK;AACxC,MAAI,CAAC,IAAK,QAAO;AACjB,MAAI,KAAK,WAAW,OAAW,QAAO;AACtC,SAAO,cAAc,KAAK,KAAK,MAAM;AACvC;AASO,SAAS,cACd,OACA,QACO;AACP,SAAO;AAAA,IACL,GAAG;AAAA,IACH,GAAI,MAAM,SAAS,SAAY,EAAE,MAAM,WAAW,MAAM,MAAM,QAAQ,MAAM,aAAa,EAAE,IAAI,CAAC;AAAA,IAChG,GAAI,MAAM,gBAAgB,SAAY,EAAE,aAAa,WAAW,MAAM,aAAa,QAAQ,MAAM,aAAa,EAAE,IAAI,CAAC;AAAA,EACvH;AACF;AAkBO,SAAS,WACd,OACA,QACA,eACQ;AACR,MAAI,OAAO,UAAU,SAAU,QAAO;AACtC,MAAI,MAAM,MAAM,MAAM,UAAa,MAAM,MAAM,MAAM,GAAI,QAAO,MAAM,MAAM;AAC5E,MAAI,iBAAiB,MAAM,aAAa,MAAM,UAAa,MAAM,aAAa,MAAM,IAAI;AACtF,WAAO,MAAM,aAAa;AAAA,EAC5B;AACA,aAAW,KAAK,OAAO,OAAO,KAAK,GAAG;AACpC,QAAI,MAAM,GAAI,QAAO;AAAA,EACvB;AACA,SAAO;AACT;","names":[]}

package/dist/{chunk-7V4TP3AF.js → chunk-J6UOHJY5.js}

@@ -1,15 +1,15 @@
 import {
   buildRecordAad,
   openEnvelopeJson
-} from "./chunk-77K4PG6P.js";
+} from "./chunk-KJFW62P4.js";
 import {
   buildRecordEnvelope
-} from "./chunk-SZJ3DLZA.js";
+} from "./chunk-SEE332EV.js";
 import {
   encrypt,
   hmacSha256Hex,
   sha256Hex
-} from "./chunk-SL3JAAKN.js";
+} from "./chunk-UYB234ZR.js";
 
 // src/with-audit/forget/strategy.ts
 var NO_FORGET = { subjects: {} };
@@ -149,4 +149,4 @@ export {
   coerceSubjectId,
   readDottedPath
 };
-//# sourceMappingURL=chunk-7V4TP3AF.js.map
+//# sourceMappingURL=chunk-J6UOHJY5.js.map

package/dist/{chunk-JMGDHKQF.js → chunk-JCN44NCY.js}

@@ -1,6 +1,6 @@
 import {
   TierWriteRefusedError
-} from "./chunk-7O3Y4PPD.js";
+} from "./chunk-244VXYPG.js";
 
 // src/kernel/tier-visibility.ts
 async function peekLiveTier(adapter, vault, name, id) {
@@ -49,4 +49,4 @@ export {
   dekKey,
   parseDekKey
 };
-//# sourceMappingURL=chunk-JMGDHKQF.js.map
+//# sourceMappingURL=chunk-JCN44NCY.js.map

package/dist/{chunk-CARABLSQ.js → chunk-K6W7BVZ6.js}

@@ -1,9 +1,9 @@
 import {
   matchesReferencingValue
-} from "./chunk-U4FOQDY4.js";
+} from "./chunk-FH2L2E34.js";
 import {
   PeriodClosedError
-} from "./chunk-7O3Y4PPD.js";
+} from "./chunk-244VXYPG.js";
 
 // src/kernel/via/dispatch.ts
 function touchFor(batch, collection) {
@@ -173,4 +173,4 @@ export {
   forgetDerivedFanout,
   selfWriteFieldEqual
 };
-//# sourceMappingURL=chunk-CARABLSQ.js.map
+//# sourceMappingURL=chunk-K6W7BVZ6.js.map