@memberjunction/search-engine 5.33.0 → 5.34.1

package/dist/rerankers/BGEReRanker.d.ts

@@ -0,0 +1,57 @@
+/**
+ * @fileoverview BGE local-model re-ranker (P2D.5).
+ *
+ * Self-hosted reranker for deployments that don't want to send candidate documents
+ * to a third-party API. Wraps `@xenova/transformers`' `pipeline('text-classification')`
+ * loaded with a Xenova-converted BGE reranker model (e.g. `Xenova/bge-reranker-base`,
+ * `Xenova/bge-reranker-large`, `Xenova/bge-reranker-v2-m3`).
+ *
+ * **Cost.** Zero — local model. Reports 0 cents to the budget guard.
+ *
+ * **Model loading.** Lazy: the model is downloaded on first use into the configured
+ * `TRANSFORMERS_CACHE_DIR` (or the transformers.js default). The model is NOT bundled
+ * in the npm package. Override the model and cache directory via:
+ *   - `ScopeConfig.reRanker.config.model` — HuggingFace ID or local path
+ *   - `ScopeConfig.reRanker.config.cacheDir` — override TRANSFORMERS_CACHE_DIR
+ *
+ * **Optional peer dep.** `@xenova/transformers` is in `optionalDependencies`. Loaded
+ * via dynamic import per CLAUDE.md rule #8 case 2 — consumers who don't want a
+ * local-model reranker don't pay the bundle cost.
+ *
+ * @module @memberjunction/search-engine
+ */
+import { UserInfo } from '@memberjunction/core';
+import { BaseReRanker } from '../generic/BaseReRanker.js';
+import { SearchResultItem } from '../generic/search.types.js';
+/**
+ * Local BGE reranker. Configure per scope via
+ * `SearchScope.ScopeConfig.reRanker.driverClass = 'BGEReRanker'`.
+ */
+export declare class BGEReRanker extends BaseReRanker {
+    get DriverClass(): string;
+    get Name(): string;
+    get Version(): string;
+    /**
+     * No hard cap from the model itself, but practical memory limits apply. We cap at
+     * 5000 to match what fits comfortably in 16 GB RAM with `bge-reranker-base`.
+     */
+    GetMaxResultCount(): number;
+    /** Local model — no per-call charge. */
+    EstimateCostCents(_resultCount: number): number;
+    ReRank(query: string, candidates: SearchResultItem[], topN: number, _contextUser: UserInfo, config?: Record<string, unknown>): Promise<SearchResultItem[]>;
+    /** Subclasses can override to customize the candidate's text representation. */
+    protected buildText(item: SearchResultItem): string;
+    /**
+     * Normalize the various shapes transformers.js may return into a flat number[]
+     * with one score per input pair. Throws when the shape doesn't match.
+     */
+    protected extractScores(raw: unknown, expectedLength: number): number[];
+}
+/** Tree-shake prevention helper. */
+export declare function LoadBGEReRanker(): void;
+/**
+ * Test-only export: clear the per-model pipeline cache. Used by tests so each test
+ * can install its own mock pipeline.
+ */
+export declare function __resetBGEPipelineCacheForTests(): void;
+//# sourceMappingURL=BGEReRanker.d.ts.map

package/dist/rerankers/BGEReRanker.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"BGEReRanker.d.ts","sourceRoot":"","sources":["../../src/rerankers/BGEReRanker.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAGH,OAAO,EAAY,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAC1D,OAAO,EAAE,YAAY,EAAE,MAAM,yBAAyB,CAAC;AACvD,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AA6D3D;;;GAGG;AACH,qBACa,WAAY,SAAQ,YAAY;IACzC,IAAW,WAAW,IAAI,MAAM,CAE/B;IACD,IAAoB,IAAI,IAAI,MAAM,CAEjC;IACD,IAAoB,OAAO,IAAI,MAAM,CAEpC;IAED;;;OAGG;IACa,iBAAiB,IAAI,MAAM;IAI3C,wCAAwC;IACxB,iBAAiB,CAAC,YAAY,EAAE,MAAM,GAAG,MAAM;IAIzC,MAAM,CACxB,KAAK,EAAE,MAAM,EACb,UAAU,EAAE,gBAAgB,EAAE,EAC9B,IAAI,EAAE,MAAM,EACZ,YAAY,EAAE,QAAQ,EACtB,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GACjC,OAAO,CAAC,gBAAgB,EAAE,CAAC;IAiD9B,gFAAgF;IAChF,SAAS,CAAC,SAAS,CAAC,IAAI,EAAE,gBAAgB,GAAG,MAAM;IAKnD;;;OAGG;IACH,SAAS,CAAC,aAAa,CAAC,GAAG,EAAE,OAAO,EAAE,cAAc,EAAE,MAAM,GAAG,MAAM,EAAE;CAqB1E;AAED,oCAAoC;AACpC,wBAAgB,eAAe,IAAI,IAAI,CAGtC;AAED;;;GAGG;AACH,wBAAgB,+BAA+B,IAAI,IAAI,CAGtD"}

package/dist/rerankers/BGEReRanker.js

@@ -0,0 +1,193 @@
+/**
+ * @fileoverview BGE local-model re-ranker (P2D.5).
+ *
+ * Self-hosted reranker for deployments that don't want to send candidate documents
+ * to a third-party API. Wraps `@xenova/transformers`' `pipeline('text-classification')`
+ * loaded with a Xenova-converted BGE reranker model (e.g. `Xenova/bge-reranker-base`,
+ * `Xenova/bge-reranker-large`, `Xenova/bge-reranker-v2-m3`).
+ *
+ * **Cost.** Zero — local model. Reports 0 cents to the budget guard.
+ *
+ * **Model loading.** Lazy: the model is downloaded on first use into the configured
+ * `TRANSFORMERS_CACHE_DIR` (or the transformers.js default). The model is NOT bundled
+ * in the npm package. Override the model and cache directory via:
+ *   - `ScopeConfig.reRanker.config.model` — HuggingFace ID or local path
+ *   - `ScopeConfig.reRanker.config.cacheDir` — override TRANSFORMERS_CACHE_DIR
+ *
+ * **Optional peer dep.** `@xenova/transformers` is in `optionalDependencies`. Loaded
+ * via dynamic import per CLAUDE.md rule #8 case 2 — consumers who don't want a
+ * local-model reranker don't pay the bundle cost.
+ *
+ * @module @memberjunction/search-engine
+ */
+var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
+    var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
+    if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
+    else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
+    return c > 3 && r && Object.defineProperty(target, key, r), r;
+};
+import { RegisterClass } from '@memberjunction/global';
+import { LogError } from '@memberjunction/core';
+import { BaseReRanker } from '../generic/BaseReRanker.js';
+/**
+ * Memoized loader for the transformers.js module. Same pattern as LocalEmbedding —
+ * a single dynamic import the first time, reused thereafter.
+ */
+let transformersPromise = null;
+function loadTransformers() {
+    if (!transformersPromise) {
+        transformersPromise = (async () => {
+            try {
+                // SearchEngine is ESM (`"type": "module"`), so a real dynamic import is
+                // safe here — no need for the `eval('import(...)')` workaround that
+                // packages-as-CJS use. This is also what allows tests to vi.mock().
+                const mod = await import('@xenova/transformers');
+                return mod;
+            }
+            catch (err) {
+                throw new Error(`BGEReRanker: '@xenova/transformers' is not installed. Add it to your project's dependencies if you intend to use the BGE local reranker. Underlying error: ${err instanceof Error ? err.message : String(err)}`);
+            }
+        })();
+    }
+    return transformersPromise;
+}
+/**
+ * Per-model pipeline cache. Keyed by `${modelId}|${cacheDir}` so the same process can
+ * host multiple BGE variants without thrashing.
+ */
+const pipelineCache = new Map();
+async function getPipeline(modelId, cacheDir) {
+    const key = `${modelId}|${cacheDir ?? ''}`;
+    let cached = pipelineCache.get(key);
+    if (!cached) {
+        cached = (async () => {
+            const transformers = await loadTransformers();
+            if (cacheDir)
+                transformers.env.cacheDir = cacheDir;
+            return transformers.pipeline('text-classification', modelId, { quantized: true });
+        })();
+        pipelineCache.set(key, cached);
+    }
+    return cached;
+}
+/**
+ * Local BGE reranker. Configure per scope via
+ * `SearchScope.ScopeConfig.reRanker.driverClass = 'BGEReRanker'`.
+ */
+let BGEReRanker = class BGEReRanker extends BaseReRanker {
+    get DriverClass() {
+        return 'BGEReRanker';
+    }
+    get Name() {
+        return 'BGE';
+    }
+    get Version() {
+        return '1';
+    }
+    /**
+     * No hard cap from the model itself, but practical memory limits apply. We cap at
+     * 5000 to match what fits comfortably in 16 GB RAM with `bge-reranker-base`.
+     */
+    GetMaxResultCount() {
+        return 5000;
+    }
+    /** Local model — no per-call charge. */
+    EstimateCostCents(_resultCount) {
+        return 0;
+    }
+    async ReRank(query, candidates, topN, _contextUser, config) {
+        if (topN <= 0 || candidates.length === 0)
+            return [];
+        const modelId = config?.['model'] ?? 'Xenova/bge-reranker-base';
+        const cacheDir = config?.['cacheDir'];
+        let scoreFor;
+        try {
+            scoreFor = await getPipeline(modelId, cacheDir);
+        }
+        catch (err) {
+            LogError(`BGEReRanker: failed to load pipeline for "${modelId}": ${err instanceof Error ? err.message : String(err)}`);
+            // Fall back to a top-N slice when the local model can't be loaded.
+            return candidates.slice(0, topN);
+        }
+        try {
+            // For cross-encoder reranking we feed each candidate as a [query, doc] pair.
+            // transformers.js text-classification accepts an array of pairs — call once
+            // with all pairs to get one response per pair.
+            const pairs = candidates.map(c => [query, this.buildText(c)]);
+            const raw = await scoreFor(pairs);
+            // The pipeline returns either an array of `{label, score}` (one per pair) or
+            // an array of arrays when multi-label is enabled. Normalize to a flat array
+            // of scores. We treat `score` as relevance directly; for binary cross-encoders
+            // the model emits a logit-style score we use as-is for ranking purposes.
+            const scores = this.extractScores(raw, candidates.length);
+            const ranked = candidates
+                .map((c, i) => ({
+                item: c,
+                score: scores[i] ?? 0,
+            }))
+                .sort((a, b) => b.score - a.score)
+                .slice(0, topN)
+                .map(p => ({
+                ...p.item,
+                Score: p.score,
+                ScoreBreakdown: { ...p.item.ScoreBreakdown, ReRank: p.score },
+            }));
+            // Local model — no cost reported.
+            return ranked;
+        }
+        catch (err) {
+            LogError(`BGEReRanker: rerank failed for "${modelId}": ${err instanceof Error ? err.message : String(err)}`);
+            return candidates.slice(0, topN);
+        }
+    }
+    /** Subclasses can override to customize the candidate's text representation. */
+    buildText(item) {
+        const parts = [item.Title, item.Snippet].filter(p => p != null && p.length > 0);
+        return parts.join('\n');
+    }
+    /**
+     * Normalize the various shapes transformers.js may return into a flat number[]
+     * with one score per input pair. Throws when the shape doesn't match.
+     */
+    extractScores(raw, expectedLength) {
+        if (!Array.isArray(raw)) {
+            throw new Error('BGEReRanker: pipeline did not return an array');
+        }
+        const out = [];
+        for (const entry of raw) {
+            if (entry && typeof entry === 'object' && 'score' in entry && typeof entry.score === 'number') {
+                out.push(entry.score);
+            }
+            else if (Array.isArray(entry)) {
+                // Multi-label form — take the first label's score
+                const first = entry[0];
+                out.push(first && typeof first.score === 'number' ? first.score : 0);
+            }
+            else {
+                out.push(0);
+            }
+        }
+        if (out.length !== expectedLength) {
+            throw new Error(`BGEReRanker: pipeline returned ${out.length} scores for ${expectedLength} inputs`);
+        }
+        return out;
+    }
+};
+BGEReRanker = __decorate([
+    RegisterClass(BaseReRanker, 'BGEReRanker')
+], BGEReRanker);
+export { BGEReRanker };
+/** Tree-shake prevention helper. */
+export function LoadBGEReRanker() {
+    // eslint-disable-next-line @typescript-eslint/no-unused-vars
+    const _ref = BGEReRanker;
+}
+/**
+ * Test-only export: clear the per-model pipeline cache. Used by tests so each test
+ * can install its own mock pipeline.
+ */
+export function __resetBGEPipelineCacheForTests() {
+    pipelineCache.clear();
+    transformersPromise = null;
+}
+//# sourceMappingURL=BGEReRanker.js.map

package/dist/rerankers/BGEReRanker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"BGEReRanker.js","sourceRoot":"","sources":["../../src/rerankers/BGEReRanker.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;;;;;;;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,QAAQ,EAAY,MAAM,sBAAsB,CAAC;AAC1D,OAAO,EAAE,YAAY,EAAE,MAAM,yBAAyB,CAAC;AAkBvD;;;GAGG;AACH,IAAI,mBAAmB,GAAuC,IAAI,CAAC;AACnE,SAAS,gBAAgB;IACrB,IAAI,CAAC,mBAAmB,EAAE,CAAC;QACvB,mBAAmB,GAAG,CAAC,KAAK,IAAI,EAAE;YAC9B,IAAI,CAAC;gBACD,wEAAwE;gBACxE,oEAAoE;gBACpE,oEAAoE;gBACpE,MAAM,GAAG,GAAG,MAAM,MAAM,CAAC,sBAAgC,CAAkC,CAAC;gBAC5F,OAAO,GAAG,CAAC;YACf,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACX,MAAM,IAAI,KAAK,CACX,8JAA8J,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CACnN,CAAC;YACN,CAAC;QACL,CAAC,CAAC,EAAE,CAAC;IACT,CAAC;IACD,OAAO,mBAAmB,CAAC;AAC/B,CAAC;AAED;;;GAGG;AACH,MAAM,aAAa,GAAG,IAAI,GAAG,EAAmC,CAAC;AAEjE,KAAK,UAAU,WAAW,CAAC,OAAe,EAAE,QAA4B;IACpE,MAAM,GAAG,GAAG,GAAG,OAAO,IAAI,QAAQ,IAAI,EAAE,EAAE,CAAC;IAC3C,IAAI,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACpC,IAAI,CAAC,MAAM,EAAE,CAAC;QACV,MAAM,GAAG,CAAC,KAAK,IAAI,EAAE;YACjB,MAAM,YAAY,GAAG,MAAM,gBAAgB,EAAE,CAAC;YAC9C,IAAI,QAAQ;gBAAE,YAAY,CAAC,GAAG,CAAC,QAAQ,GAAG,QAAQ,CAAC;YACnD,OAAO,YAAY,CAAC,QAAQ,CAAC,qBAAqB,EAAE,OAAO,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QACtF,CAAC,CAAC,EAAE,CAAC;QACL,aAAa,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IACnC,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC;AAED;;;GAGG;AAEI,IAAM,WAAW,GAAjB,MAAM,WAAY,SAAQ,YAAY;IACzC,IAAW,WAAW;QAClB,OAAO,aAAa,CAAC;IACzB,CAAC;IACD,IAAoB,IAAI;QACpB,OAAO,KAAK,CAAC;IACjB,CAAC;IACD,IAAoB,OAAO;QACvB,OAAO,GAAG,CAAC;IACf,CAAC;IAED;;;OAGG;IACa,iBAAiB;QAC7B,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,wCAAwC;IACxB,iBAAiB,CAAC,YAAoB;QAClD,OAAO,CAAC,CAAC;IACb,CAAC;IAEe,KAAK,CAAC,MAAM,CACxB,KAAa,EACb,UAA8B,EAC9B,IAAY,EACZ,YAAsB,EACtB,MAAgC;QAEhC,IAAI,IAAI,IAAI,CAAC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAEpD,MAAM,OAAO,GAAI,MAAM,EAAE,CAAC,OAAO,CAAwB,IAAI,0BAA0B,CAAC;QACxF,MAAM,QAAQ,GAAG,MAAM,EAAE,CAAC,UAAU,CAAuB,CAAC;QAE5D,IAAI,QAAwB,CAAC;QAC7B,IAAI,CAAC;YACD,QAAQ,GAAG,MAAM,WAAW,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;QACpD,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACX,QAAQ,CAAC,6CAA6C,OAAO,MAAM,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACvH,mEAAmE;YACnE,OAAO,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QACrC,CAAC;QAED,IAAI,CAAC;YACD,6EAA6E;YAC7E,4EAA4E;YAC5E,+CAA+C;YAC/C,MAAM,KAAK,GAA4B,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACvF,MAAM,GAAG,GAAG,MAAM,QAAQ,CAAC,KAA8B,CAAC,CAAC;YAE3D,6EAA6E;YAC7E,4EAA4E;YAC5E,+EAA+E;YAC/E,yEAAyE;YACzE,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;YAE1D,MAAM,MAAM,GAAG,UAAU;iBACpB,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;gBACZ,IAAI,EAAE,CAAC;gBACP,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC;aACxB,CAAC,CAAC;iBACF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;iBACjC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC;iBACd,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBACP,GAAG,CAAC,CAAC,IAAI;gBACT,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,cAAc,EAAE,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,cAAc,EAAE,MAAM,EAAE,CAAC,CAAC,KAAK,EAAE;aAChE,CAAC,CAAC,CAAC;YAER,kCAAkC;YAClC,OAAO,MAAM,CAAC;QAClB,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACX,QAAQ,CAAC,mCAAmC,OAAO,MAAM,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC7G,OAAO,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QACrC,CAAC;IACL,CAAC;IAED,gFAAgF;IACtE,SAAS,CAAC,IAAsB;QACtC,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAChF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IAED;;;OAGG;IACO,aAAa,CAAC,GAAY,EAAE,cAAsB;QACxD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,IAAI,KAAK,CAAC,+CAA+C,CAAC,CAAC;QACrE,CAAC;QACD,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,KAAK,MAAM,KAAK,IAAI,GAAG,EAAE,CAAC;YACtB,IAAI,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,OAAO,IAAI,KAAK,IAAI,OAAQ,KAA4B,CAAC,KAAK,KAAK,QAAQ,EAAE,CAAC;gBACpH,GAAG,CAAC,IAAI,CAAE,KAA2B,CAAC,KAAK,CAAC,CAAC;YACjD,CAAC;iBAAM,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC9B,kDAAkD;gBAClD,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAoC,CAAC;gBAC1D,GAAG,CAAC,IAAI,CAAC,KAAK,IAAI,OAAO,KAAK,CAAC,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACzE,CAAC;iBAAM,CAAC;gBACJ,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAChB,CAAC;QACL,CAAC;QACD,IAAI,GAAG,CAAC,MAAM,KAAK,cAAc,EAAE,CAAC;YAChC,MAAM,IAAI,KAAK,CAAC,kCAAkC,GAAG,CAAC,MAAM,eAAe,cAAc,SAAS,CAAC,CAAC;QACxG,CAAC;QACD,OAAO,GAAG,CAAC;IACf,CAAC;CACJ,CAAA;AA9GY,WAAW;IADvB,aAAa,CAAC,YAAY,EAAE,aAAa,CAAC;GAC9B,WAAW,CA8GvB;;AAED,oCAAoC;AACpC,MAAM,UAAU,eAAe;IAC3B,6DAA6D;IAC7D,MAAM,IAAI,GAAG,WAAW,CAAC;AAC7B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,+BAA+B;IAC3C,aAAa,CAAC,KAAK,EAAE,CAAC;IACtB,mBAAmB,GAAG,IAAI,CAAC;AAC/B,CAAC"}

package/dist/rerankers/CohereReRanker.d.ts

@@ -0,0 +1,65 @@
+/**
+ * @fileoverview Cohere Rerank API integration (P2D.2).
+ *
+ * Wraps Cohere's `rerank-v3.5` (English) and `rerank-multilingual-v3.0` endpoints
+ * for use as a SearchEngine re-ranker. Distinct from `@memberjunction/ai-cohere`'s
+ * `CohereReranker` which is purpose-built for memory-note rerank with a specific
+ * augmented prompt — scope search needs the raw query passed through unchanged
+ * for accurate semantic similarity.
+ *
+ * **Cost model.** Cohere bills per "search," where one search reranks up to 100
+ * documents. Above 100 docs, larger requests count as multiple searches.
+ * Pricing as of 2026-04: $2.00 per 1k searches → 0.2¢ / search.
+ *
+ * **API key resolution.** Uses `GetAIAPIKey('CohereLLM')` — same key the AI-layer
+ * Cohere reranker uses, sourced from the AIAPIKey registry (driver class
+ * `CohereLLM` → env var `AI_VENDOR_API_KEY__COHERELLM`).
+ *
+ * **Optional peer dependency.** `cohere-ai` is declared in `optionalDependencies`
+ * so SearchEngine consumers who don't use Cohere don't pay the bundle cost.
+ * Loaded via a dynamic import per CLAUDE.md rule #8 case 2 (optional peer).
+ *
+ * @module @memberjunction/search-engine
+ */
+import { UserInfo } from '@memberjunction/core';
+import { BaseReranker as AIBaseReranker } from '@memberjunction/ai';
+import { BaseReRanker } from '../generic/BaseReRanker.js';
+import { SearchResultItem } from '../generic/search.types.js';
+/**
+ * Cohere `rerank-v3.5` re-ranker for SearchEngine. Configured per scope via
+ * `SearchScope.ScopeConfig.reRanker.driverClass = 'CohereReRanker'`.
+ *
+ * The model name can be overridden via `ScopeConfig.reRanker.config.model`
+ * (e.g. `'rerank-multilingual-v3.0'`).
+ */
+export declare class CohereReRanker extends BaseReRanker {
+    get DriverClass(): string;
+    get Name(): string;
+    get Version(): string;
+    /**
+     * Cohere caps a single rerank call at 1000 documents. Above this, the SearchEngine
+     * should chunk (not implemented yet — most realistic candidate lists are <100).
+     */
+    GetMaxResultCount(): number;
+    /**
+     * Cohere bills per "search". 1 search reranks up to 100 documents; above 100,
+     * count as `ceil(N/100)` searches. As of 2026-04, $2.00 per 1k searches = 0.2¢
+     * per search. Override via `config.cents_per_search` if Cohere's pricing changes.
+     */
+    EstimateCostCents(resultCount: number): number;
+    protected getAIReranker(config: Record<string, unknown> | undefined, _contextUser: UserInfo): AIBaseReranker | null;
+    /**
+     * Override `ReRank` to record actual cost via the inherited `reportCost` helper
+     * after a successful Cohere call. Cohere bills per request (not per token), so
+     * the post-call cost equals the pre-call estimate — no separate measurement
+     * required.
+     */
+    ReRank(query: string, candidates: SearchResultItem[], topN: number, contextUser: UserInfo, config?: Record<string, unknown>): Promise<SearchResultItem[]>;
+}
+/**
+ * Tree-shake prevention helper. Call from a consumer's `public-api.ts` (or from
+ * `LoadCohereReRanker()` in a generated registration manifest) to guarantee the
+ * `@RegisterClass` side-effect runs.
+ */
+export declare function LoadCohereReRanker(): void;
+//# sourceMappingURL=CohereReRanker.d.ts.map

package/dist/rerankers/CohereReRanker.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"CohereReRanker.d.ts","sourceRoot":"","sources":["../../src/rerankers/CohereReRanker.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAGH,OAAO,EAAY,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAC1D,OAAO,EACH,YAAY,IAAI,cAAc,EAIjC,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAE,YAAY,EAAE,MAAM,yBAAyB,CAAC;AACvD,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AAkE3D;;;;;;GAMG;AACH,qBACa,cAAe,SAAQ,YAAY;IAC5C,IAAW,WAAW,IAAI,MAAM,CAE/B;IACD,IAAoB,IAAI,IAAI,MAAM,CAEjC;IACD,IAAoB,OAAO,IAAI,MAAM,CAEpC;IAED;;;OAGG;IACa,iBAAiB,IAAI,MAAM;IAI3C;;;;OAIG;IACa,iBAAiB,CAAC,WAAW,EAAE,MAAM,GAAG,MAAM;cAK3C,aAAa,CAC5B,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,EAC3C,YAAY,EAAE,QAAQ,GACvB,cAAc,GAAG,IAAI;IAUxB;;;;;OAKG;IACmB,MAAM,CACxB,KAAK,EAAE,MAAM,EACb,UAAU,EAAE,gBAAgB,EAAE,EAC9B,IAAI,EAAE,MAAM,EACZ,WAAW,EAAE,QAAQ,EACrB,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GACjC,OAAO,CAAC,gBAAgB,EAAE,CAAC;CAUjC;AAED;;;;GAIG;AACH,wBAAgB,kBAAkB,IAAI,IAAI,CAGzC"}

package/dist/rerankers/CohereReRanker.js

@@ -0,0 +1,155 @@
+/**
+ * @fileoverview Cohere Rerank API integration (P2D.2).
+ *
+ * Wraps Cohere's `rerank-v3.5` (English) and `rerank-multilingual-v3.0` endpoints
+ * for use as a SearchEngine re-ranker. Distinct from `@memberjunction/ai-cohere`'s
+ * `CohereReranker` which is purpose-built for memory-note rerank with a specific
+ * augmented prompt — scope search needs the raw query passed through unchanged
+ * for accurate semantic similarity.
+ *
+ * **Cost model.** Cohere bills per "search," where one search reranks up to 100
+ * documents. Above 100 docs, larger requests count as multiple searches.
+ * Pricing as of 2026-04: $2.00 per 1k searches → 0.2¢ / search.
+ *
+ * **API key resolution.** Uses `GetAIAPIKey('CohereLLM')` — same key the AI-layer
+ * Cohere reranker uses, sourced from the AIAPIKey registry (driver class
+ * `CohereLLM` → env var `AI_VENDOR_API_KEY__COHERELLM`).
+ *
+ * **Optional peer dependency.** `cohere-ai` is declared in `optionalDependencies`
+ * so SearchEngine consumers who don't use Cohere don't pay the bundle cost.
+ * Loaded via a dynamic import per CLAUDE.md rule #8 case 2 (optional peer).
+ *
+ * @module @memberjunction/search-engine
+ */
+var __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {
+    var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
+    if (typeof Reflect === "object" && typeof Reflect.decorate === "function") r = Reflect.decorate(decorators, target, key, desc);
+    else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
+    return c > 3 && r && Object.defineProperty(target, key, r), r;
+};
+import { RegisterClass } from '@memberjunction/global';
+import { LogError } from '@memberjunction/core';
+import { BaseReranker as AIBaseReranker, GetAIAPIKey, } from '@memberjunction/ai';
+import { BaseReRanker } from '../generic/BaseReRanker.js';
+/**
+ * Memoized loader for the Cohere SDK. The dynamic import is the **single** approved
+ * use of `import()` in this file (CLAUDE.md #8 case 2 — optional peer dep). Caching
+ * the resolved client constructor avoids paying the dynamic import cost on every
+ * Rerank call.
+ */
+let cohereClientCtorPromise = null;
+async function getCohereClientCtor() {
+    if (!cohereClientCtorPromise) {
+        cohereClientCtorPromise = (async () => {
+            try {
+                const mod = await import('cohere-ai');
+                return mod.CohereClient;
+            }
+            catch (err) {
+                throw new Error(`CohereReRanker: 'cohere-ai' is not installed. Add it to your project's dependencies if you intend to use the Cohere reranker. Underlying error: ${err instanceof Error ? err.message : String(err)}`);
+            }
+        })();
+    }
+    return cohereClientCtorPromise;
+}
+/**
+ * Inline AI-layer reranker that calls Cohere's `rerank` endpoint with the raw query
+ * (no enhanced prompt). Distinct from `@memberjunction/ai-cohere`'s `CohereReranker`
+ * which augments the query for memory-note semantics.
+ */
+class CohereScopeAIReranker extends AIBaseReranker {
+    constructor(apiKey, modelName) {
+        super(apiKey, modelName);
+        this._clientPromise = getCohereClientCtor().then(Ctor => new Ctor({ token: this.apiKey }));
+    }
+    async doRerank(params) {
+        const client = await this._clientPromise;
+        const response = await client.rerank({
+            model: this._modelName,
+            query: params.query,
+            documents: params.documents.map(d => d.text),
+            topN: params.topK ?? params.documents.length,
+            returnDocuments: false,
+        });
+        return response.results.map((r, idx) => ({
+            id: params.documents[r.index].id,
+            relevanceScore: r.relevanceScore,
+            document: params.documents[r.index],
+            rank: idx,
+        }));
+    }
+}
+/**
+ * Cohere `rerank-v3.5` re-ranker for SearchEngine. Configured per scope via
+ * `SearchScope.ScopeConfig.reRanker.driverClass = 'CohereReRanker'`.
+ *
+ * The model name can be overridden via `ScopeConfig.reRanker.config.model`
+ * (e.g. `'rerank-multilingual-v3.0'`).
+ */
+let CohereReRanker = class CohereReRanker extends BaseReRanker {
+    get DriverClass() {
+        return 'CohereReRanker';
+    }
+    get Name() {
+        return 'Cohere';
+    }
+    get Version() {
+        return '1';
+    }
+    /**
+     * Cohere caps a single rerank call at 1000 documents. Above this, the SearchEngine
+     * should chunk (not implemented yet — most realistic candidate lists are <100).
+     */
+    GetMaxResultCount() {
+        return 1000;
+    }
+    /**
+     * Cohere bills per "search". 1 search reranks up to 100 documents; above 100,
+     * count as `ceil(N/100)` searches. As of 2026-04, $2.00 per 1k searches = 0.2¢
+     * per search. Override via `config.cents_per_search` if Cohere's pricing changes.
+     */
+    EstimateCostCents(resultCount) {
+        const searches = Math.max(1, Math.ceil(resultCount / 100));
+        return searches * 0.2;
+    }
+    getAIReranker(config, _contextUser) {
+        const apiKey = GetAIAPIKey('CohereLLM');
+        if (!apiKey) {
+            LogError('CohereReRanker: no API key found for driver "CohereLLM" — set AI_VENDOR_API_KEY__COHERELLM or register an AIAPIKeys subclass.');
+            return null;
+        }
+        const modelName = config?.['model'] ?? 'rerank-v3.5';
+        return new CohereScopeAIReranker(apiKey, modelName);
+    }
+    /**
+     * Override `ReRank` to record actual cost via the inherited `reportCost` helper
+     * after a successful Cohere call. Cohere bills per request (not per token), so
+     * the post-call cost equals the pre-call estimate — no separate measurement
+     * required.
+     */
+    async ReRank(query, candidates, topN, contextUser, config) {
+        if (topN <= 0 || candidates.length === 0)
+            return [];
+        const result = await super.ReRank(query, candidates, topN, contextUser, config);
+        // Charge cost only when the call actually went out — when getAIReranker
+        // returns null, super.ReRank short-circuits to a slice and we shouldn't bill.
+        if (this.getAIReranker(config, contextUser)) {
+            this.reportCost(this.EstimateCostCents(candidates.length));
+        }
+        return result;
+    }
+};
+CohereReRanker = __decorate([
+    RegisterClass(BaseReRanker, 'CohereReRanker')
+], CohereReRanker);
+export { CohereReRanker };
+/**
+ * Tree-shake prevention helper. Call from a consumer's `public-api.ts` (or from
+ * `LoadCohereReRanker()` in a generated registration manifest) to guarantee the
+ * `@RegisterClass` side-effect runs.
+ */
+export function LoadCohereReRanker() {
+    // eslint-disable-next-line @typescript-eslint/no-unused-vars
+    const _ref = CohereReRanker;
+}
+//# sourceMappingURL=CohereReRanker.js.map

package/dist/rerankers/CohereReRanker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"CohereReRanker.js","sourceRoot":"","sources":["../../src/rerankers/CohereReRanker.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;;;;;;;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,QAAQ,EAAY,MAAM,sBAAsB,CAAC;AAC1D,OAAO,EACH,YAAY,IAAI,cAAc,EAG9B,WAAW,GACd,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAE,YAAY,EAAE,MAAM,yBAAyB,CAAC;AAGvD;;;;;GAKG;AACH,IAAI,uBAAuB,GAAsE,IAAI,CAAC;AAWtG,KAAK,UAAU,mBAAmB;IAC9B,IAAI,CAAC,uBAAuB,EAAE,CAAC;QAC3B,uBAAuB,GAAG,CAAC,KAAK,IAAI,EAAE;YAClC,IAAI,CAAC;gBACD,MAAM,GAAG,GAAG,MAAM,MAAM,CAAC,WAAW,CAAC,CAAC;gBACtC,OAAO,GAAG,CAAC,YAA4E,CAAC;YAC5F,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACX,MAAM,IAAI,KAAK,CACX,mJAAmJ,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CACxM,CAAC;YACN,CAAC;QACL,CAAC,CAAC,EAAE,CAAC;IACT,CAAC;IACD,OAAO,uBAAuB,CAAC;AACnC,CAAC;AAED;;;;GAIG;AACH,MAAM,qBAAsB,SAAQ,cAAc;IAG9C,YAAY,MAAc,EAAE,SAAiB;QACzC,KAAK,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QACzB,IAAI,CAAC,cAAc,GAAG,mBAAmB,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAC/F,CAAC;IAES,KAAK,CAAC,QAAQ,CAAC,MAAoB;QACzC,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,cAAc,CAAC;QACzC,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC,MAAM,CAAC;YACjC,KAAK,EAAE,IAAI,CAAC,UAAU;YACtB,KAAK,EAAE,MAAM,CAAC,KAAK;YACnB,SAAS,EAAE,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;YAC5C,IAAI,EAAE,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC,SAAS,CAAC,MAAM;YAC5C,eAAe,EAAE,KAAK;SACzB,CAAC,CAAC;QACH,OAAO,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;YACrC,EAAE,EAAE,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE;YAChC,cAAc,EAAE,CAAC,CAAC,cAAc;YAChC,QAAQ,EAAE,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC;YACnC,IAAI,EAAE,GAAG;SACZ,CAAC,CAAC,CAAC;IACR,CAAC;CACJ;AAED;;;;;;GAMG;AAEI,IAAM,cAAc,GAApB,MAAM,cAAe,SAAQ,YAAY;IAC5C,IAAW,WAAW;QAClB,OAAO,gBAAgB,CAAC;IAC5B,CAAC;IACD,IAAoB,IAAI;QACpB,OAAO,QAAQ,CAAC;IACpB,CAAC;IACD,IAAoB,OAAO;QACvB,OAAO,GAAG,CAAC;IACf,CAAC;IAED;;;OAGG;IACa,iBAAiB;QAC7B,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;;;OAIG;IACa,iBAAiB,CAAC,WAAmB;QACjD,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,WAAW,GAAG,GAAG,CAAC,CAAC,CAAC;QAC3D,OAAO,QAAQ,GAAG,GAAG,CAAC;IAC1B,CAAC;IAEkB,aAAa,CAC5B,MAA2C,EAC3C,YAAsB;QAEtB,MAAM,MAAM,GAAG,WAAW,CAAC,WAAW,CAAC,CAAC;QACxC,IAAI,CAAC,MAAM,EAAE,CAAC;YACV,QAAQ,CAAC,+HAA+H,CAAC,CAAC;YAC1I,OAAO,IAAI,CAAC;QAChB,CAAC;QACD,MAAM,SAAS,GAAI,MAAM,EAAE,CAAC,OAAO,CAAwB,IAAI,aAAa,CAAC;QAC7E,OAAO,IAAI,qBAAqB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IACxD,CAAC;IAED;;;;;OAKG;IACa,KAAK,CAAC,MAAM,CACxB,KAAa,EACb,UAA8B,EAC9B,IAAY,EACZ,WAAqB,EACrB,MAAgC;QAEhC,IAAI,IAAI,IAAI,CAAC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QACpD,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC;QAChF,wEAAwE;QACxE,8EAA8E;QAC9E,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE,WAAW,CAAC,EAAE,CAAC;YAC1C,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC;QAC/D,CAAC;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;CACJ,CAAA;AAhEY,cAAc;IAD1B,aAAa,CAAC,YAAY,EAAE,gBAAgB,CAAC;GACjC,cAAc,CAgE1B;;AAED;;;;GAIG;AACH,MAAM,UAAU,kBAAkB;IAC9B,6DAA6D;IAC7D,MAAM,IAAI,GAAG,cAAc,CAAC;AAChC,CAAC"}

package/dist/rerankers/OpenAIReRanker.d.ts

@@ -0,0 +1,62 @@
+/**
+ * @fileoverview OpenAI chat-judge re-ranker (P2D.4).
+ *
+ * **Decision (2026-04-28):** OpenAI does not publish a first-party reranker endpoint.
+ * Their offerings are completions, chat, embeddings, and moderation — there is no
+ * dedicated `/rerank`. This implementation uses the documented fallback from the plan:
+ * a small chat-completion-based "judge" that scores each candidate's relevance to the
+ * query and returns the new ordering. Re-evaluate this decision when OpenAI ships a
+ * first-party reranker — the canonical plan calls out swapping in the first-party
+ * endpoint as soon as it exists.
+ *
+ * **Approach.** Single chat completion call, JSON-mode response. The model receives
+ * the query and a numbered list of documents and returns
+ * `{ "scores": [<number 0..1>, ...] }` with one score per document, in input order.
+ * We then sort by score, slice to topN, and return.
+ *
+ * **Cost.** `gpt-4o-mini` defaults: $0.15 / 1M input tokens, $0.60 / 1M output tokens
+ * (2026-04 pricing). Pre-call estimate uses a conservative ~80 tokens/doc input plus
+ * 8 tokens/doc output. Post-call cost reports the exact `usage.{prompt,completion}_tokens`
+ * from OpenAI so the budget guard sees real spend.
+ *
+ * **API key.** `GetAIAPIKey('OpenAILLM')` —
+ * AI_VENDOR_API_KEY__OPENAILLM or any registered AIAPIKeys subclass.
+ *
+ * @module @memberjunction/search-engine
+ */
+import { UserInfo } from '@memberjunction/core';
+import { BaseReranker as AIBaseReranker } from '@memberjunction/ai';
+import { BaseReRanker } from '../generic/BaseReRanker.js';
+import { SearchResultItem } from '../generic/search.types.js';
+/**
+ * Chat-completion-based "judge" reranker. Configure per scope via
+ * `SearchScope.ScopeConfig.reRanker.driverClass = 'OpenAIReRanker'`.
+ *
+ * Override the model via `ScopeConfig.reRanker.config.model`
+ * (default: `gpt-4o-mini` — change when a first-party OpenAI rerank endpoint launches).
+ */
+export declare class OpenAIReRanker extends BaseReRanker {
+    /** Pricing in cents-per-token. As of 2026-04. */
+    private static readonly PRICING;
+    private currentAIReranker;
+    get DriverClass(): string;
+    get Name(): string;
+    get Version(): string;
+    /**
+     * Effective limit when the candidate list plus prompt fits in the model's input
+     * window. With gpt-4o-mini's 128k input context and ~80 tokens/doc, the practical
+     * cap is well above 1000. Returning 1000 to match the other rerankers; the
+     * SearchEngine will chunk above this when chunking is implemented.
+     */
+    GetMaxResultCount(): number;
+    /**
+     * Pre-call cost estimate. ~80 input tokens/doc + 50 system/query tokens, plus
+     * 8 output tokens/doc. Conservative — actual usage tends to be lower.
+     */
+    EstimateCostCents(resultCount: number): number;
+    protected getAIReranker(config: Record<string, unknown> | undefined, _contextUser: UserInfo): AIBaseReranker | null;
+    ReRank(query: string, candidates: SearchResultItem[], topN: number, contextUser: UserInfo, config?: Record<string, unknown>): Promise<SearchResultItem[]>;
+}
+/** Tree-shake prevention helper. */
+export declare function LoadOpenAIReRanker(): void;
+//# sourceMappingURL=OpenAIReRanker.d.ts.map

package/dist/rerankers/OpenAIReRanker.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"OpenAIReRanker.d.ts","sourceRoot":"","sources":["../../src/rerankers/OpenAIReRanker.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAGH,OAAO,EAAY,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAC1D,OAAO,EACH,YAAY,IAAI,cAAc,EAIjC,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAE,YAAY,EAAE,MAAM,yBAAyB,CAAC;AACvD,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAC;AA0F3D;;;;;;GAMG;AACH,qBACa,cAAe,SAAQ,YAAY;IAC5C,iDAAiD;IACjD,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAK7B;IAEF,OAAO,CAAC,iBAAiB,CAAsC;IAE/D,IAAW,WAAW,IAAI,MAAM,CAE/B;IACD,IAAoB,IAAI,IAAI,MAAM,CAEjC;IACD,IAAoB,OAAO,IAAI,MAAM,CAEpC;IAED;;;;;OAKG;IACa,iBAAiB,IAAI,MAAM;IAI3C;;;OAGG;IACa,iBAAiB,CAAC,WAAW,EAAE,MAAM,GAAG,MAAM;cAO3C,aAAa,CAC5B,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,EAC3C,YAAY,EAAE,QAAQ,GACvB,cAAc,GAAG,IAAI;IAaF,MAAM,CACxB,KAAK,EAAE,MAAM,EACb,UAAU,EAAE,gBAAgB,EAAE,EAC9B,IAAI,EAAE,MAAM,EACZ,WAAW,EAAE,QAAQ,EACrB,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GACjC,OAAO,CAAC,gBAAgB,EAAE,CAAC;CAiBjC;AAED,oCAAoC;AACpC,wBAAgB,kBAAkB,IAAI,IAAI,CAGzC"}