@ryanstark24/sfgraph-core 1.2.0 → 1.6.0

package/dist/embedding/queue.js

@@ -1,71 +1,429 @@
+import { createHash } from "node:crypto";
 import { asQualifiedName, asSha256 } from "@ryanstark24/sfgraph-shared";
+/** Real SHA-256 of the embedded text. The vector store dedups on this hash
+ *  (skips re-embedding when it matches), so it MUST reflect the actual text —
+ *  otherwise re-ingest never refreshes a vector. Previously this was
+ *  `asSha256("rule:" + qname)`, but asSha256 is a branded-type CAST, not a
+ *  hash, so the value was constant per node and every vector was write-once
+ *  (config-value enrichment, description changes, etc. never re-embedded). */
+export function hashEmbedText(text) {
+    return asSha256(createHash("sha256").update(text).digest("hex"));
+}
+/** True when every component is 0 — the embedder's zero-vector failure
+ *  fallback. Such vectors must not enter the index (they outrank real matches). */
+function isAllZero(v) {
+    for (let i = 0; i < v.length; i++)
+        if (v[i] !== 0)
+            return false;
+    return true;
+}
+/** Copy a string into fresh flat storage. Embed texts are concatenations with
+ *  `snippet.slice(0, 4000)`; V8 keeps such cons/sliced strings pointing at the
+ *  whole parent source, so a queued text could pin an entire file. */
+function flatten(s) {
+    return ` ${s}`.slice(1);
+}
 /**
- * In-process batched embedding queue. push() accumulates; once buffer reaches
- * batchSize, flushBatch() is scheduled. drain() awaits the queue to empty.
+ * Batched embedding queue. push() accumulates; each full batch (or any partial
+ * batch once draining / over capacity) is dispatched to `embed`, up to
+ * `maxInFlight` at a time. drain() awaits the queue to empty.
  *
- * When the underlying embedder fails to load (e.g. transformers missing), the
- * queue logs via onError and silently skips vector upserts — ingest must not
- * crash because embeddings are unavailable.
+ * Last-writer-wins: every push of an (org, qname) gets a sequence number and
+ * supersedes all earlier pushes of that key. A superseded emission is never
+ * embedded if it is still buffered, and never written (to the vector store or
+ * the cache) if it is already in flight. The "unchanged" check (stored hash
+ * equals the text hash) runs at dispatch and only for the latest emission;
+ * skipping it settles the key, so an earlier, different text still in flight
+ * is discarded rather than written over it. The vector store therefore ends
+ * with the last emission's vector and hash, whatever the batching or
+ * completion order.
+ *
+ * When the underlying embedder fails (e.g. transformers missing, worker
+ * crash), the queue reports via onError and skips those vector upserts —
+ * ingest must not crash because embeddings are unavailable.
  */
 export class EmbeddingQueue {
     opts;
     buffer = [];
-    flushing = null;
+    /** Latest sequence number per outstanding (org, qname). An entry is removed
+     *  once that latest emission is written, skipped or dropped, so a missing
+     *  key means every queued emission of it is superseded. */
+    latestSeq = new Map();
+    seq = 0;
+    workSignalled = false;
+    bufferChars = 0;
+    inFlight = 0;
+    inFlightItems = 0;
+    inFlightChars = 0;
+    writeTail = Promise.resolve();
+    draining = false;
+    held;
+    generation = 0;
+    capacityWaiters = [];
     batchSize;
+    maxInFlight;
+    maxPendingChars;
+    dim;
     embedFn;
+    stats = {
+        cached: 0,
+        computed: 0,
+        unchanged: 0,
+        failed: 0,
+        superseded: 0,
+    };
     constructor(opts) {
         this.opts = opts;
-        this.batchSize = opts.batchSize ?? 16;
+        // 64 (was 16): fewer model calls; embedTexts length-sorts and sub-batches
+        // internally, so the larger flush does not inflate padding.
+        this.batchSize = opts.batchSize ?? 64;
+        this.maxInFlight = Math.max(1, opts.maxInFlight ?? 1);
+        this.maxPendingChars = opts.maxPendingChars ?? 64 * 1024 * 1024;
+        this.dim = opts.dim ?? (Number.parseInt(process.env.SFGRAPH_EMBED_MODEL_DIM ?? "", 10) || 384);
         this.embedFn = opts.embed ?? defaultEmbed;
+        this.held = opts.hold ?? false;
+    }
+    /** Lift `hold`: dispatch everything buffered (subject to maxInFlight). */
+    release() {
+        this.held = false;
+        this.pump();
     }
     push(item) {
-        this.buffer.push(item);
-        if (this.buffer.length >= this.batchSize && !this.flushing) {
-            this.flushing = this.flushBatch().finally(() => {
-                this.flushing = null;
-            });
+        // Supersede every earlier emission of this (org, qname). Cheap on purpose:
+        // push runs on the graph-build path; hashing and the stored-hash lookup
+        // wait for dispatch.
+        const key = `${item.orgId}\u0000${item.qname}`;
+        const seq = ++this.seq;
+        this.latestSeq.set(key, seq);
+        const text = flatten(item.text);
+        this.buffer.push({ qname: item.qname, text, orgId: item.orgId, label: item.label, key, seq });
+        this.bufferChars += text.length;
+        this.pump();
+    }
+    signalWork() {
+        if (this.workSignalled)
+            return;
+        this.workSignalled = true;
+        this.opts.onWork?.();
+    }
+    isLatest(q) {
+        return this.latestSeq.get(q.key) === q.seq;
+    }
+    /** The latest emission of its key is done (written, failed or dropped). */
+    settle(q) {
+        if (this.isLatest(q))
+            this.latestSeq.delete(q.key);
+    }
+    /**
+     * Settle every buffered item that needs no model call: drop superseded and
+     * unchanged ones, and write those whose vector is in the persistent cache.
+     * Only items that need inference stay buffered. Lets a no-wait run persist
+     * the cheap part of its work before abandoning the rest. Returns the number
+     * of vectors written.
+     */
+    flushCached() {
+        if (this.buffer.length === 0)
+            return 0;
+        const batch = this.buffer;
+        this.buffer = [];
+        this.bufferChars = 0;
+        const { entries, vectors, misses } = this.prepare(batch);
+        const missSet = new Set(misses);
+        const hits = [];
+        for (let i = 0; i < entries.length; i++) {
+            const e = entries[i];
+            if (missSet.has(i)) {
+                this.buffer.push(e.item);
+                this.bufferChars += e.item.text.length;
+                continue;
+            }
+            hits.push([e, vectors[i]]);
         }
+        const written = this.writeMany(hits).filter(Boolean).length;
+        for (const [e] of hits)
+            this.settle(e.item);
+        this.notifyCapacity();
+        return written;
+    }
+    /** Flush everything (including a partial batch) in the background. */
+    startDrain() {
+        this.draining = true;
+        this.pump();
     }
     async drain() {
-        // Cooperate with any in-flight flush from a prior push(): if `flushing`
-        // is set, await it before starting our own — otherwise we'd run two
-        // concurrent embedFn() calls into @xenova/transformers' WASM runtime
-        // (unsafe / slow). After it settles, check the buffer again and flush
-        // any remaining batches ourselves serially.
-        while (true) {
-            if (this.flushing) {
-                await this.flushing;
-                continue;
+        this.draining = true;
+        try {
+            this.pump();
+            if (this.held)
+                this.release();
+            while (this.inFlight > 0 || this.buffer.length > 0) {
+                await this.writeTail;
+                this.pump();
             }
-            if (this.buffer.length === 0)
-                return;
-            this.flushing = this.flushBatch().finally(() => {
-                this.flushing = null;
-            });
-            await this.flushing;
         }
+        finally {
+            this.draining = false;
+        }
+    }
+    /** Drop all buffered and in-flight work (their results are discarded).
+     *  Returns the number of items dropped. */
+    abandon() {
+        const dropped = this.buffer.filter((q) => this.isLatest(q)).length + this.inFlightItems;
+        if (dropped > 0)
+            this.signalWork();
+        this.generation += 1;
+        this.buffer = [];
+        this.bufferChars = 0;
+        this.latestSeq.clear();
+        this.notifyCapacity();
+        return dropped;
+    }
+    /** True when queued text exceeds the backpressure bound. */
+    get overCapacity() {
+        return this.bufferChars + this.inFlightChars > this.maxPendingChars;
     }
-    /** Test introspection. */
+    /** Resolves once queued text is back under the backpressure bound. */
+    waitForCapacity() {
+        if (!this.overCapacity)
+            return Promise.resolve();
+        this.pump();
+        return new Promise((resolve) => this.capacityWaiters.push(resolve));
+    }
+    /** Test introspection: buffered (not yet dispatched) items. */
     get pending() {
         return this.buffer.length;
     }
-    async flushBatch() {
-        const batch = this.buffer.splice(0, this.batchSize);
-        if (batch.length === 0)
+    /** Buffered plus in-flight items. */
+    get outstanding() {
+        return this.buffer.length + this.inFlightItems;
+    }
+    /**
+     * Task 11c N-1: true when some outstanding item will still write a vector
+     * (in flight, or a latest buffered emission whose stored vector differs).
+     * Stops at the first one; hashes buffered texts, so call it once, off the
+     * per-member path.
+     */
+    hasVectorWork() {
+        if (this.inFlightItems > 0)
+            return true;
+        const sink = this.opts.vectorStore;
+        const getHash = typeof sink.getContentHash === "function" ? sink.getContentHash.bind(sink) : null;
+        for (const b of this.buffer) {
+            if (!this.isLatest(b))
+                continue;
+            if (!getHash)
+                return true;
+            if (getHash(b.orgId, asQualifiedName(b.qname)) !== hashEmbedText(b.text))
+                return true;
+        }
+        return false;
+    }
+    notifyCapacity() {
+        if (this.capacityWaiters.length === 0 || this.overCapacity)
             return;
+        const ws = this.capacityWaiters;
+        this.capacityWaiters = [];
+        for (const w of ws)
+            w();
+    }
+    pump() {
+        while (this.inFlight < this.maxInFlight &&
+            this.buffer.length > 0 &&
+            (this.overCapacity || (!this.held && (this.draining || this.buffer.length >= this.batchSize)))) {
+            this.dispatch();
+        }
+    }
+    dispatch() {
+        const batch = this.buffer.splice(0, this.batchSize);
+        let chars = 0;
+        for (const b of batch)
+            chars += b.text.length;
+        this.bufferChars -= chars;
+        this.inFlight += 1;
+        this.inFlightItems += batch.length;
+        this.inFlightChars += chars;
+        const gen = this.generation;
+        // Prepare synchronously: hash, skip unchanged, consult the cache.
+        let entries = [];
+        let vectors = [];
+        let misses = [];
+        let inference = Promise.resolve([]);
         try {
-            const vectors = await this.embedFn(batch.map((b) => b.text));
-            for (let i = 0; i < batch.length; i++) {
-                const v = vectors[i];
-                if (!v)
-                    continue;
-                const b = batch[i];
-                this.opts.vectorStore.upsertNodeVector(b.orgId, asQualifiedName(b.qname), b.label, v, asSha256(`rule:${b.qname}`));
+            ({ entries, vectors, misses } = this.prepare(batch));
+            // Cache hits are written now: with sequence-based supersede the write
+            // order no longer matters, and this keeps them out of abandon().
+            const missSet = new Set(misses);
+            const hits = [];
+            for (let i = 0; i < entries.length; i++) {
+                if (!missSet.has(i))
+                    hits.push([entries[i], vectors[i]]);
+            }
+            this.writeMany(hits);
+            for (const [e] of hits)
+                this.settle(e.item);
+            if (misses.length > 0) {
+                // Length-sort (stable) for inference only, to cut padding.
+                misses.sort((a, b) => {
+                    const d = entries[a].item.text.length -
+                        entries[b].item.text.length;
+                    return d !== 0 ? d : a - b;
+                });
+                inference = this.embedFn(misses.map((i) => entries[i].item.text));
             }
         }
         catch (e) {
-            this.opts.onError?.(e);
+            inference = Promise.reject(e);
+        }
+        // Observed below; this stops an early rejection being reported as unhandled
+        // while earlier batches are still writing.
+        inference.catch(() => { });
+        this.writeTail = this.writeTail.then(async () => {
+            try {
+                let sorted = null;
+                try {
+                    sorted = await inference;
+                }
+                catch (e) {
+                    if (gen === this.generation) {
+                        this.stats.failed += misses.length;
+                        this.opts.onError?.(e);
+                    }
+                }
+                if (gen !== this.generation)
+                    return;
+                const computed = [];
+                try {
+                    if (sorted)
+                        this.stats.computed += misses.length;
+                    // Emission order within the batch (misses are length-sorted).
+                    const order = [...misses].sort((a, b) => a - b);
+                    const byIndex = new Map();
+                    misses.forEach((i, k) => byIndex.set(i, sorted?.[k]));
+                    // Decide, then write the batch in one transaction, then settle.
+                    // Only the latest emission of a key is ever written, so settling
+                    // after the writes changes nothing.
+                    const toWrite = [];
+                    for (const i of order) {
+                        const e = entries[i];
+                        const v = byIndex.get(i);
+                        if (v && this.isLatest(e.item))
+                            toWrite.push([e, v]);
+                        else if (v)
+                            this.stats.superseded += 1;
+                    }
+                    try {
+                        this.writeMany(toWrite).forEach((ok, k) => {
+                            const [e, v] = toWrite[k];
+                            if (ok)
+                                computed.push({ hash: e.hash, vector: v });
+                        });
+                    }
+                    finally {
+                        for (const i of order)
+                            this.settle(entries[i].item);
+                    }
+                }
+                catch (e) {
+                    this.opts.onError?.(e);
+                }
+                // Separate from the vector writes: a cache failure is not an embedding
+                // failure (every vector above already reached the graph).
+                if (computed.length > 0 && this.opts.cache) {
+                    try {
+                        this.opts.cache.putMany(computed);
+                    }
+                    catch (e) {
+                        const onCacheError = this.opts.onCacheError ??
+                            ((err) => console.warn(`embedding cache write failed: ${err.message}`));
+                        onCacheError(e);
+                    }
+                }
+            }
+            finally {
+                this.inFlight -= 1;
+                this.inFlightItems -= batch.length;
+                this.inFlightChars -= chars;
+                this.notifyCapacity();
+                this.pump();
+            }
+        });
+    }
+    prepare(batch) {
+        const sink = this.opts.vectorStore;
+        const getHash = typeof sink.getContentHash === "function" ? sink.getContentHash.bind(sink) : null;
+        const entries = [];
+        for (const b of batch) {
+            // Drop emissions a later push already replaced: never embed them.
+            if (!this.isLatest(b)) {
+                this.stats.superseded += 1;
+                continue;
+            }
+            // Pre-embed dedup: skip the model when the stored vector already
+            // matches this (latest) text. Settling the key makes any earlier,
+            // different emission still in flight a no-op at write time.
+            const hash = hashEmbedText(b.text);
+            if (getHash && getHash(b.orgId, asQualifiedName(b.qname)) === hash) {
+                this.stats.unchanged += 1;
+                this.settle(b);
+                continue;
+            }
+            entries.push({ item: b, hash });
+        }
+        if (entries.length > 0)
+            this.signalWork();
+        const vectors = new Array(entries.length);
+        const hits = this.opts.cache
+            ? this.opts.cache.getMany(entries.map((e) => e.hash), this.dim)
+            : null;
+        const misses = [];
+        for (let i = 0; i < entries.length; i++) {
+            const hit = hits?.get(entries[i].hash);
+            if (hit) {
+                vectors[i] = hit;
+                this.stats.cached += 1;
+            }
+            else {
+                misses.push(i);
+            }
         }
+        return { entries, vectors, misses };
+    }
+    /** Upsert one vector. Returns false (and writes nothing) for an all-zero
+     *  vector, the embedder's failure fallback: a zero vector sits at a fixed
+     *  mid-range similarity and outranks genuine weak matches in find_similar,
+     *  so no vector is better than a misleading one. */
+    /**
+     * Write a batch of vectors in one transaction when the sink supports it.
+     * If the transaction fails, the batch is retried row by row (upserts are
+     * idempotent), so a failure behaves as it did before batching: rows before
+     * the bad one are kept and the error propagates.
+     */
+    writeMany(pairs) {
+        const run = () => pairs.map(([e, v]) => this.writeOne(e, v));
+        const sink = this.opts.vectorStore;
+        if (pairs.length > 1 && typeof sink.transaction === "function") {
+            const outer = sink.inTransaction === true;
+            try {
+                return sink.transaction(run);
+            }
+            catch (e) {
+                // Inside an outer transaction the batch is a savepoint. Some errors
+                // (SQLITE_FULL, IOERR) roll the outer transaction back too; row-by-row
+                // writes would then autocommit outside it, so surface the error.
+                // (Read through a fresh lookup: TS narrows the property after `outer`.)
+                const stillIn = sink.inTransaction;
+                if (outer && stillIn === false)
+                    throw e;
+                // Otherwise fall through to the unbatched path, which surfaces the error.
+            }
+        }
+        return run();
+    }
+    writeOne(e, v) {
+        if (isAllZero(v))
+            return false;
+        this.opts.vectorStore.upsertNodeVector(e.item.orgId, asQualifiedName(e.item.qname), e.item.label, v, e.hash);
+        return true;
     }
 }
 // Ingest's batched embedder is now a thin wrapper around the shared

package/dist/embedding/queue.js.map

@@ -1 +1 @@
-{"version":3,"file":"queue.js","sourceRoot":"","sources":["../../src/embedding/queue.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,eAAe,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AA2BxE;;;;;;;GAOG;AACH,MAAM,OAAO,cAAc;IAMI;IALrB,MAAM,GAAoB,EAAE,CAAC;IAC7B,QAAQ,GAAyB,IAAI,CAAC;IAC7B,SAAS,CAAS;IAClB,OAAO,CAA+C;IAEvE,YAA6B,IAAwB;QAAxB,SAAI,GAAJ,IAAI,CAAoB;QACnD,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,EAAE,CAAC;QACtC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,KAAK,IAAI,YAAY,CAAC;IAC5C,CAAC;IAED,IAAI,CAAC,IAAmB;QACtB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvB,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,IAAI,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC3D,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE;gBAC7C,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;YACvB,CAAC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,KAAK,CAAC,KAAK;QACT,wEAAwE;QACxE,oEAAoE;QACpE,qEAAqE;QACrE,sEAAsE;QACtE,4CAA4C;QAC5C,OAAO,IAAI,EAAE,CAAC;YACZ,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClB,MAAM,IAAI,CAAC,QAAQ,CAAC;gBACpB,SAAS;YACX,CAAC;YACD,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO;YACrC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE;gBAC7C,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;YACvB,CAAC,CAAC,CAAC;YACH,MAAM,IAAI,CAAC,QAAQ,CAAC;QACtB,CAAC;IACH,CAAC;IAED,0BAA0B;IAC1B,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC5B,CAAC;IAEO,KAAK,CAAC,UAAU;QACtB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QACpD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAC/B,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YAC7D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACtC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;gBACrB,IAAI,CAAC,CAAC;oBAAE,SAAS;gBACjB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAkB,CAAC;gBACpC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,gBAAgB,CACpC,CAAC,CAAC,KAAyB,EAC3B,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC,EACxB,CAAC,CAAC,KAAK,EACP,CAAC,EACD,QAAQ,CAAC,QAAQ,CAAC,CAAC,KAAK,EAAE,CAAC,CAC5B,CAAC;YACJ,CAAC;QACH,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAU,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;CACF;AAED,oEAAoE;AACpE,4EAA4E;AAC5E,0EAA0E;AAC1E,wEAAwE;AACxE,oCAAoC;AACpC,KAAK,UAAU,YAAY,CAAC,KAAe;IACzC,MAAM,EAAE,UAAU,EAAE,GAAG,MAAM,MAAM,CAAC,YAAY,CAAC,CAAC;IAClD,OAAO,UAAU,CAAC,KAAK,CAAC,CAAC;AAC3B,CAAC"}
+{"version":3,"file":"queue.js","sourceRoot":"","sources":["../../src/embedding/queue.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEzC,OAAO,EAAE,eAAe,EAAE,QAAQ,EAAE,MAAM,6BAA6B,CAAC;AAGxE;;;;;8EAK8E;AAC9E,MAAM,UAAU,aAAa,CAAC,IAAY;IACxC,OAAO,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;AACnE,CAAC;AAED;mFACmF;AACnF,SAAS,SAAS,CAAC,CAAe;IAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;IAChE,OAAO,IAAI,CAAC;AACd,CAAC;AAgHD;;sEAEsE;AACtE,SAAS,OAAO,CAAC,CAAS;IACxB,OAAO,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AAC1B,CAAC;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,OAAO,cAAc;IA8BI;IA7BrB,MAAM,GAAiB,EAAE,CAAC;IAClC;;+DAE2D;IACnD,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,GAAG,GAAG,CAAC,CAAC;IACR,aAAa,GAAG,KAAK,CAAC;IACtB,WAAW,GAAG,CAAC,CAAC;IAChB,QAAQ,GAAG,CAAC,CAAC;IACb,aAAa,GAAG,CAAC,CAAC;IAClB,aAAa,GAAG,CAAC,CAAC;IAClB,SAAS,GAAkB,OAAO,CAAC,OAAO,EAAE,CAAC;IAC7C,QAAQ,GAAG,KAAK,CAAC;IACjB,IAAI,CAAU;IACd,UAAU,GAAG,CAAC,CAAC;IACf,eAAe,GAAsB,EAAE,CAAC;IAC/B,SAAS,CAAS;IAClB,WAAW,CAAS;IACpB,eAAe,CAAS;IACxB,GAAG,CAAS;IACZ,OAAO,CAA+C;IAC9D,KAAK,GAAwB;QACpC,MAAM,EAAE,CAAC;QACT,QAAQ,EAAE,CAAC;QACX,SAAS,EAAE,CAAC;QACZ,MAAM,EAAE,CAAC;QACT,UAAU,EAAE,CAAC;KACd,CAAC;IAEF,YAA6B,IAAwB;QAAxB,SAAI,GAAJ,IAAI,CAAoB;QACnD,0EAA0E;QAC1E,4DAA4D;QAC5D,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,EAAE,CAAC;QACtC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,IAAI,CAAC,CAAC,CAAC;QACtD,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC,eAAe,IAAI,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC;QAChE,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,uBAAuB,IAAI,EAAE,EAAE,EAAE,CAAC,IAAI,GAAG,CAAC,CAAC;QAC/F,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,KAAK,IAAI,YAAY,CAAC;QAC1C,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,KAAK,CAAC;IACjC,CAAC;IAED,0EAA0E;IAC1E,OAAO;QACL,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;QAClB,IAAI,CAAC,IAAI,EAAE,CAAC;IACd,CAAC;IAED,IAAI,CAAC,IAAmB;QACtB,2EAA2E;QAC3E,wEAAwE;QACxE,qBAAqB;QACrB,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,EAAE,CAAC;QAC/C,MAAM,GAAG,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC;QACvB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QAC7B,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC;QAC9F,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,MAAM,CAAC;QAChC,IAAI,CAAC,IAAI,EAAE,CAAC;IACd,CAAC;IAEO,UAAU;QAChB,IAAI,IAAI,CAAC,aAAa;YAAE,OAAO;QAC/B,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC;QAC1B,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;IACvB,CAAC;IAEO,QAAQ,CAAC,CAAa;QAC5B,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC;IAC7C,CAAC;IAED,2EAA2E;IACnE,MAAM,CAAC,CAAa;QAC1B,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACrD,CAAC;IAED;;;;;;OAMG;IACH,WAAW;QACT,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QACvC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACjB,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC;QACrB,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACzD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;QAChC,MAAM,IAAI,GAAyC,EAAE,CAAC;QACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAkB,CAAC;YACtC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACnB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBACzB,IAAI,CAAC,WAAW,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;gBACvC,SAAS;YACX,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAiB,CAAC,CAAC,CAAC;QAC7C,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC;QAC5D,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI;YAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC5C,IAAI,CAAC,cAAc,EAAE,CAAC;QACtB,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,sEAAsE;IACtE,UAAU;QACR,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,IAAI,CAAC,IAAI,EAAE,CAAC;IACd,CAAC;IAED,KAAK,CAAC,KAAK;QACT,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,IAAI,CAAC;YACH,IAAI,CAAC,IAAI,EAAE,CAAC;YACZ,IAAI,IAAI,CAAC,IAAI;gBAAE,IAAI,CAAC,OAAO,EAAE,CAAC;YAC9B,OAAO,IAAI,CAAC,QAAQ,GAAG,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACnD,MAAM,IAAI,CAAC,SAAS,CAAC;gBACrB,IAAI,CAAC,IAAI,EAAE,CAAC;YACd,CAAC;QACH,CAAC;gBAAS,CAAC;YACT,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;QACxB,CAAC;IACH,CAAC;IAED;+CAC2C;IAC3C,OAAO;QACL,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC;QACxF,IAAI,OAAO,GAAG,CAAC;YAAE,IAAI,CAAC,UAAU,EAAE,CAAC;QACnC,IAAI,CAAC,UAAU,IAAI,CAAC,CAAC;QACrB,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACjB,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC;QACrB,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;QACvB,IAAI,CAAC,cAAc,EAAE,CAAC;QACtB,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,4DAA4D;IAC5D,IAAI,YAAY;QACd,OAAO,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,eAAe,CAAC;IACtE,CAAC;IAED,sEAAsE;IACtE,eAAe;QACb,IAAI,CAAC,IAAI,CAAC,YAAY;YAAE,OAAO,OAAO,CAAC,OAAO,EAAE,CAAC;QACjD,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;IACtE,CAAC;IAED,+DAA+D;IAC/D,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC5B,CAAC;IAED,qCAAqC;IACrC,IAAI,WAAW;QACb,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC;IACjD,CAAC;IAED;;;;;OAKG;IACH,aAAa;QACX,IAAI,IAAI,CAAC,aAAa,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC;QACxC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC;QACnC,MAAM,OAAO,GACX,OAAO,IAAI,CAAC,cAAc,KAAK,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACpF,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC5B,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;gBAAE,SAAS;YAChC,IAAI,CAAC,OAAO;gBAAE,OAAO,IAAI,CAAC;YAC1B,IAAI,OAAO,CAAC,CAAC,CAAC,KAAyB,EAAE,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC;gBAC1F,OAAO,IAAI,CAAC;QAChB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAEO,cAAc;QACpB,IAAI,IAAI,CAAC,eAAe,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,YAAY;YAAE,OAAO;QACnE,MAAM,EAAE,GAAG,IAAI,CAAC,eAAe,CAAC;QAChC,IAAI,CAAC,eAAe,GAAG,EAAE,CAAC;QAC1B,KAAK,MAAM,CAAC,IAAI,EAAE;YAAE,CAAC,EAAE,CAAC;IAC1B,CAAC;IAEO,IAAI;QACV,OACE,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,WAAW;YAChC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC;YACtB,CAAC,IAAI,CAAC,YAAY,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAC9F,CAAC;YACD,IAAI,CAAC,QAAQ,EAAE,CAAC;QAClB,CAAC;IACH,CAAC;IAEO,QAAQ;QACd,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;QACpD,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,CAAC,IAAI,KAAK;YAAE,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;QAC9C,IAAI,CAAC,WAAW,IAAI,KAAK,CAAC;QAC1B,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;QACnB,IAAI,CAAC,aAAa,IAAI,KAAK,CAAC,MAAM,CAAC;QACnC,IAAI,CAAC,aAAa,IAAI,KAAK,CAAC;QAC5B,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC;QAE5B,kEAAkE;QAClE,IAAI,OAAO,GAAoB,EAAE,CAAC;QAClC,IAAI,OAAO,GAAoC,EAAE,CAAC;QAClD,IAAI,MAAM,GAAa,EAAE,CAAC;QAC1B,IAAI,SAAS,GAA4B,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC7D,IAAI,CAAC;YACH,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;YACrD,sEAAsE;YACtE,iEAAiE;YACjE,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;YAChC,MAAM,IAAI,GAAyC,EAAE,CAAC;YACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,IAAI,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAkB,EAAE,OAAO,CAAC,CAAC,CAAiB,CAAC,CAAC,CAAC;YAC5F,CAAC;YACD,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YACrB,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI;gBAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAC5C,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACtB,2DAA2D;gBAC3D,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;oBACnB,MAAM,CAAC,GACJ,OAAO,CAAC,CAAC,CAAmB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM;wBAC7C,OAAO,CAAC,CAAC,CAAmB,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;oBACjD,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;gBAC7B,CAAC,CAAC,CAAC;gBACH,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAE,OAAO,CAAC,CAAC,CAAmB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YACvF,CAAC;QACH,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,SAAS,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAChC,CAAC;QACD,4EAA4E;QAC5E,2CAA2C;QAC3C,SAAS,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;QAE1B,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE;YAC9C,IAAI,CAAC;gBACH,IAAI,MAAM,GAA0B,IAAI,CAAC;gBACzC,IAAI,CAAC;oBACH,MAAM,GAAG,MAAM,SAAS,CAAC;gBAC3B,CAAC;gBAAC,OAAO,CAAC,EAAE,CAAC;oBACX,IAAI,GAAG,KAAK,IAAI,CAAC,UAAU,EAAE,CAAC;wBAC5B,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC;wBACnC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAU,CAAC,CAAC;oBAClC,CAAC;gBACH,CAAC;gBACD,IAAI,GAAG,KAAK,IAAI,CAAC,UAAU;oBAAE,OAAO;gBACpC,MAAM,QAAQ,GAAkD,EAAE,CAAC;gBACnE,IAAI,CAAC;oBACH,IAAI,MAAM;wBAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,IAAI,MAAM,CAAC,MAAM,CAAC;oBACjD,8DAA8D;oBAC9D,MAAM,KAAK,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBAChD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoC,CAAC;oBAC5D,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBACtD,gEAAgE;oBAChE,iEAAiE;oBACjE,oCAAoC;oBACpC,MAAM,OAAO,GAAyC,EAAE,CAAC;oBACzD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;wBACtB,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAkB,CAAC;wBACtC,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;wBACzB,IAAI,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC;4BAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;6BAChD,IAAI,CAAC;4BAAE,IAAI,CAAC,KAAK,CAAC,UAAU,IAAI,CAAC,CAAC;oBACzC,CAAC;oBACD,IAAI,CAAC;wBACH,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE;4BACxC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAkC,CAAC;4BAC3D,IAAI,EAAE;gCAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;wBACrD,CAAC,CAAC,CAAC;oBACL,CAAC;4BAAS,CAAC;wBACT,KAAK,MAAM,CAAC,IAAI,KAAK;4BAAE,IAAI,CAAC,MAAM,CAAE,OAAO,CAAC,CAAC,CAAmB,CAAC,IAAI,CAAC,CAAC;oBACzE,CAAC;gBACH,CAAC;gBAAC,OAAO,CAAC,EAAE,CAAC;oBACX,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAU,CAAC,CAAC;gBAClC,CAAC;gBACD,uEAAuE;gBACvE,0DAA0D;gBAC1D,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;oBAC3C,IAAI,CAAC;wBACH,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;oBACpC,CAAC;oBAAC,OAAO,CAAC,EAAE,CAAC;wBACX,MAAM,YAAY,GAChB,IAAI,CAAC,IAAI,CAAC,YAAY;4BACtB,CAAC,CAAC,GAAU,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,iCAAiC,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;wBACjF,YAAY,CAAC,CAAU,CAAC,CAAC;oBAC3B,CAAC;gBACH,CAAC;YACH,CAAC;oBAAS,CAAC;gBACT,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC;gBACnB,IAAI,CAAC,aAAa,IAAI,KAAK,CAAC,MAAM,CAAC;gBACnC,IAAI,CAAC,aAAa,IAAI,KAAK,CAAC;gBAC5B,IAAI,CAAC,cAAc,EAAE,CAAC;gBACtB,IAAI,CAAC,IAAI,EAAE,CAAC;YACd,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAEO,OAAO,CAAC,KAAmB;QAKjC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC;QACnC,MAAM,OAAO,GACX,OAAO,IAAI,CAAC,cAAc,KAAK,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QACpF,MAAM,OAAO,GAAoB,EAAE,CAAC;QACpC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,kEAAkE;YAClE,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;gBACtB,IAAI,CAAC,KAAK,CAAC,UAAU,IAAI,CAAC,CAAC;gBAC3B,SAAS;YACX,CAAC;YACD,iEAAiE;YACjE,kEAAkE;YAClE,4DAA4D;YAC5D,MAAM,IAAI,GAAG,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACnC,IAAI,OAAO,IAAI,OAAO,CAAC,CAAC,CAAC,KAAyB,EAAE,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;gBACvF,IAAI,CAAC,KAAK,CAAC,SAAS,IAAI,CAAC,CAAC;gBAC1B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBACf,SAAS;YACX,CAAC;YACD,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC;QAClC,CAAC;QACD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;YAAE,IAAI,CAAC,UAAU,EAAE,CAAC;QAC1C,MAAM,OAAO,GAAoC,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAC3E,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK;YAC1B,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CACrB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAC1B,IAAI,CAAC,GAAG,CACT;YACH,CAAC,CAAC,IAAI,CAAC;QACT,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,GAAG,GAAG,IAAI,EAAE,GAAG,CAAE,OAAO,CAAC,CAAC,CAAmB,CAAC,IAAI,CAAC,CAAC;YAC1D,IAAI,GAAG,EAAE,CAAC;gBACR,OAAO,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;gBACjB,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC;YACzB,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjB,CAAC;QACH,CAAC;QACD,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;IACtC,CAAC;IAED;;;wDAGoD;IACpD;;;;;OAKG;IACK,SAAS,CAAC,KAAmD;QACnE,MAAM,GAAG,GAAG,GAAc,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACxE,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC;QACnC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,IAAI,CAAC,WAAW,KAAK,UAAU,EAAE,CAAC;YAC/D,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,KAAK,IAAI,CAAC;YAC1C,IAAI,CAAC;gBACH,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;YAC/B,CAAC;YAAC,OAAO,CAAC,EAAE,CAAC;gBACX,oEAAoE;gBACpE,uEAAuE;gBACvE,iEAAiE;gBACjE,wEAAwE;gBACxE,MAAM,OAAO,GAAI,IAA6C,CAAC,aAAa,CAAC;gBAC7E,IAAI,KAAK,IAAI,OAAO,KAAK,KAAK;oBAAE,MAAM,CAAC,CAAC;gBACxC,0EAA0E;YAC5E,CAAC;QACH,CAAC;QACD,OAAO,GAAG,EAAE,CAAC;IACf,CAAC;IAEO,QAAQ,CAAC,CAAgB,EAAE,CAAe;QAChD,IAAI,SAAS,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;QAC/B,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,gBAAgB,CACpC,CAAC,CAAC,IAAI,CAAC,KAAyB,EAChC,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,EAC7B,CAAC,CAAC,IAAI,CAAC,KAAK,EACZ,CAAC,EACD,CAAC,CAAC,IAAI,CACP,CAAC;QACF,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAED,oEAAoE;AACpE,4EAA4E;AAC5E,0EAA0E;AAC1E,wEAAwE;AACxE,oCAAoC;AACpC,KAAK,UAAU,YAAY,CAAC,KAAe;IACzC,MAAM,EAAE,UAAU,EAAE,GAAG,MAAM,MAAM,CAAC,YAAY,CAAC,CAAC;IAClD,OAAO,UAAU,CAAC,KAAK,CAAC,CAAC;AAC3B,CAAC"}

package/dist/embedding/tokenize.d.ts

@@ -0,0 +1,18 @@
+/**
+ * Split a Salesforce-style identifier into its component words so search can
+ * match on word boundaries. Salesforce identifiers are overwhelmingly camelCase
+ * (`getAccountById`) and snake_case / `__c` (`Customer_Tier__c`); a raw token
+ * never matches a "account controller" query. We break on:
+ *  - non-alphanumeric separators (`_ . : / -` and the `__c/__r/__e` markers),
+ *  - camelCase boundaries (`fooBar` → `foo Bar`),
+ *  - acronym→word boundaries (`HTTPResponse` → `HTTP Response`),
+ *  - letter↔digit boundaries (`get2Records` → `get 2 Records`).
+ */
+export declare function splitIdentifierWords(s: string): string[];
+/**
+ * Lowercased, de-duplicated, space-joined word form of an identifier — the text
+ * appended to embeddings and indexed by FTS so `account` matches
+ * `AccountController` and `customer tier` matches `Customer_Tier__c`.
+ */
+export declare function tokenizeIdentifier(s: string): string;
+//# sourceMappingURL=tokenize.d.ts.map

package/dist/embedding/tokenize.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tokenize.d.ts","sourceRoot":"","sources":["../../src/embedding/tokenize.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,EAAE,CAYxD;AAED;;;;GAIG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAWpD"}

package/dist/embedding/tokenize.js

@@ -0,0 +1,43 @@
+/**
+ * Split a Salesforce-style identifier into its component words so search can
+ * match on word boundaries. Salesforce identifiers are overwhelmingly camelCase
+ * (`getAccountById`) and snake_case / `__c` (`Customer_Tier__c`); a raw token
+ * never matches a "account controller" query. We break on:
+ *  - non-alphanumeric separators (`_ . : / -` and the `__c/__r/__e` markers),
+ *  - camelCase boundaries (`fooBar` → `foo Bar`),
+ *  - acronym→word boundaries (`HTTPResponse` → `HTTP Response`),
+ *  - letter↔digit boundaries (`get2Records` → `get 2 Records`).
+ */
+export function splitIdentifierWords(s) {
+    const parts = s.split(/[^A-Za-z0-9]+/).filter(Boolean);
+    const words = [];
+    for (const p of parts) {
+        const broken = p
+            .replace(/([a-z0-9])([A-Z])/g, "$1 $2")
+            .replace(/([A-Z]+)([A-Z][a-z])/g, "$1 $2")
+            .replace(/([A-Za-z])([0-9])/g, "$1 $2")
+            .replace(/([0-9])([A-Za-z])/g, "$1 $2");
+        for (const w of broken.split(/\s+/))
+            if (w)
+                words.push(w);
+    }
+    return words;
+}
+/**
+ * Lowercased, de-duplicated, space-joined word form of an identifier — the text
+ * appended to embeddings and indexed by FTS so `account` matches
+ * `AccountController` and `customer tier` matches `Customer_Tier__c`.
+ */
+export function tokenizeIdentifier(s) {
+    const seen = new Set();
+    const out = [];
+    for (const w of splitIdentifierWords(s)) {
+        const lw = w.toLowerCase();
+        if (!seen.has(lw)) {
+            seen.add(lw);
+            out.push(lw);
+        }
+    }
+    return out.join(" ");
+}
+//# sourceMappingURL=tokenize.js.map

package/dist/embedding/tokenize.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tokenize.js","sourceRoot":"","sources":["../../src/embedding/tokenize.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,MAAM,UAAU,oBAAoB,CAAC,CAAS;IAC5C,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACvD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,MAAM,MAAM,GAAG,CAAC;aACb,OAAO,CAAC,oBAAoB,EAAE,OAAO,CAAC;aACtC,OAAO,CAAC,uBAAuB,EAAE,OAAO,CAAC;aACzC,OAAO,CAAC,oBAAoB,EAAE,OAAO,CAAC;aACtC,OAAO,CAAC,oBAAoB,EAAE,OAAO,CAAC,CAAC;QAC1C,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC;YAAE,IAAI,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5D,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,CAAS;IAC1C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,KAAK,MAAM,CAAC,IAAI,oBAAoB,CAAC,CAAC,CAAC,EAAE,CAAC;QACxC,MAAM,EAAE,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;QAC3B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YAClB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACb,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACvB,CAAC"}

package/dist/embedding/worker.d.ts

@@ -1,7 +1,2 @@
-/**
- * Reserved for the future piscina worker entry. The in-process queue in
- * `./queue.ts` does not require this file at runtime — kept as a placeholder
- * so the file layout matches the plan.
- */
 export {};
 //# sourceMappingURL=worker.d.ts.map

package/dist/embedding/worker.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"worker.d.ts","sourceRoot":"","sources":["../../src/embedding/worker.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,EAAE,CAAC"}
+{"version":3,"file":"worker.d.ts","sourceRoot":"","sources":["../../src/embedding/worker.ts"],"names":[],"mappings":""}

package/dist/embedding/worker.js

@@ -1,7 +1,30 @@
 /**
- * Reserved for the future piscina worker entry. The in-process queue in
- * `./queue.ts` does not require this file at runtime — kept as a placeholder
- * so the file layout matches the plan.
+ * Embedding worker entry (spawned by EmbeddingPool from the compiled
+ * `worker.js`). Runs the same `embedTexts` pipeline as the in-process path —
+ * same model, tokenizer cap, length-sorted sub-batches and pooling — so a
+ * vector is the same whichever thread computed it. Requests are processed one
+ * at a time, in arrival order. The process env (SFGRAPH_EMBED_MODEL_*) is
+ * inherited from the parent.
  */
-export {};
+import { parentPort } from "node:worker_threads";
+import { embedTexts } from "./embed.js";
+const port = parentPort;
+if (port) {
+    let chain = Promise.resolve();
+    port.on("message", (req) => {
+        chain = chain.then(async () => {
+            let reply;
+            let transfer = [];
+            try {
+                const vectors = await embedTexts(req.texts);
+                reply = { id: req.id, vectors };
+                transfer = [...new Set(vectors.map((v) => v.buffer))];
+            }
+            catch (e) {
+                reply = { id: req.id, error: e.message ?? String(e) };
+            }
+            port.postMessage(reply, transfer);
+        });
+    });
+}
 //# sourceMappingURL=worker.js.map

package/dist/embedding/worker.js.map

@@ -1 +1 @@
-{"version":3,"file":"worker.js","sourceRoot":"","sources":["../../src/embedding/worker.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,EAAE,CAAC"}
+{"version":3,"file":"worker.js","sourceRoot":"","sources":["../../src/embedding/worker.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AACjD,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAGxC,MAAM,IAAI,GAAG,UAAU,CAAC;AACxB,IAAI,IAAI,EAAE,CAAC;IACT,IAAI,KAAK,GAAkB,OAAO,CAAC,OAAO,EAAE,CAAC;IAC7C,IAAI,CAAC,EAAE,CAAC,SAAS,EAAE,CAAC,GAAiB,EAAE,EAAE;QACvC,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,EAAE;YAC5B,IAAI,KAAiB,CAAC;YACtB,IAAI,QAAQ,GAAkB,EAAE,CAAC;YACjC,IAAI,CAAC;gBACH,MAAM,OAAO,GAAG,MAAM,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBAC5C,KAAK,GAAG,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC;gBAChC,QAAQ,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAqB,CAAC,CAAC,CAAC,CAAC;YACvE,CAAC;YAAC,OAAO,CAAC,EAAE,CAAC;gBACX,KAAK,GAAG,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,KAAK,EAAG,CAAW,CAAC,OAAO,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;YACnE,CAAC;YACD,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC"}