abb-opencode-local-rag 0.1.0

package/dist/vectordb/search-filters.d.ts

@@ -0,0 +1,39 @@
+import type { GroupingMode, SearchResult } from './types.js';
+/**
+ * Apply grouping algorithm to filter results by detecting group boundaries.
+ *
+ * Uses statistical threshold (mean + k*std) to identify significant gaps (group boundaries).
+ * - 'similar': Returns only the first group (cuts at first boundary)
+ * - 'related': Returns up to 2 groups (cuts at second boundary)
+ *
+ * @param results - Search results sorted by distance (ascending)
+ * @param mode - Grouping mode ('similar' = 1 group, 'related' = 2 groups)
+ * @returns Filtered results
+ */
+export declare function applyGrouping(results: SearchResult[], mode: GroupingMode): SearchResult[];
+/**
+ * Apply file-based filter to limit results to chunks from the top N files.
+ *
+ * Ranks files by their best (lowest distance) chunk score and keeps only
+ * chunks belonging to the top `maxFiles` files.
+ *
+ * @param results - Search results sorted by distance (ascending)
+ * @param maxFiles - Maximum number of files to keep
+ * @returns Filtered results preserving original order
+ */
+export declare function applyFileFilter(results: SearchResult[], maxFiles: number): SearchResult[];
+/**
+ * Apply keyword boost to rerank vector search results
+ * Uses multiplicative formula: final_distance = distance / (1 + keyword_normalized * weight)
+ *
+ * This proportional boost ensures:
+ * - Keyword matches improve ranking without dominating semantic similarity
+ * - Documents without keyword matches keep their original vector distance
+ * - Higher weight = stronger influence of keyword matching
+ *
+ * @param vectorResults - Results from vector search (already filtered by maxDistance/grouping)
+ * @param ftsResults - Raw FTS results with BM25 scores
+ * @param weight - Boost weight (0-1, from hybridWeight config)
+ */
+export declare function applyKeywordBoost(vectorResults: SearchResult[], ftsResults: Record<string, unknown>[], weight: number): SearchResult[];
+//# sourceMappingURL=search-filters.d.ts.map

package/dist/vectordb/search-filters.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"search-filters.d.ts","sourceRoot":"","sources":["../../src/vectordb/search-filters.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,YAAY,EAAE,YAAY,EAAE,MAAM,YAAY,CAAA;AAS5D;;;;;;;;;;GAUG;AACH,wBAAgB,aAAa,CAAC,OAAO,EAAE,YAAY,EAAE,EAAE,IAAI,EAAE,YAAY,GAAG,YAAY,EAAE,CAyCzF;AAED;;;;;;;;;GASG;AACH,wBAAgB,eAAe,CAAC,OAAO,EAAE,YAAY,EAAE,EAAE,QAAQ,EAAE,MAAM,GAAG,YAAY,EAAE,CAyBzF;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,iBAAiB,CAC/B,aAAa,EAAE,YAAY,EAAE,EAC7B,UAAU,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,EACrC,MAAM,EAAE,MAAM,GACb,YAAY,EAAE,CAoChB"}

package/dist/vectordb/search-filters.js

@@ -0,0 +1,136 @@
+// Search filter functions extracted from VectorStore for testability
+/**
+ * Standard deviation multiplier for detecting group boundaries.
+ * A gap is considered a "boundary" if it exceeds mean + k*std.
+ * Value of 1.5 means gaps > 1.5 standard deviations above mean are boundaries.
+ */
+const GROUPING_BOUNDARY_STD_MULTIPLIER = 1.5;
+/**
+ * Apply grouping algorithm to filter results by detecting group boundaries.
+ *
+ * Uses statistical threshold (mean + k*std) to identify significant gaps (group boundaries).
+ * - 'similar': Returns only the first group (cuts at first boundary)
+ * - 'related': Returns up to 2 groups (cuts at second boundary)
+ *
+ * @param results - Search results sorted by distance (ascending)
+ * @param mode - Grouping mode ('similar' = 1 group, 'related' = 2 groups)
+ * @returns Filtered results
+ */
+export function applyGrouping(results, mode) {
+    if (results.length <= 1)
+        return results;
+    // Calculate gaps between consecutive results with their indices
+    const gaps = [];
+    for (let i = 0; i < results.length - 1; i++) {
+        const current = results[i];
+        const next = results[i + 1];
+        if (current !== undefined && next !== undefined) {
+            gaps.push({ index: i + 1, gap: next.score - current.score });
+        }
+    }
+    if (gaps.length === 0)
+        return results;
+    // Calculate statistical threshold to identify significant gaps (group boundaries)
+    const gapValues = gaps.map((g) => g.gap);
+    const mean = gapValues.reduce((a, b) => a + b, 0) / gapValues.length;
+    const variance = gapValues.reduce((a, b) => a + (b - mean) ** 2, 0) / gapValues.length;
+    const std = Math.sqrt(variance);
+    const threshold = mean + GROUPING_BOUNDARY_STD_MULTIPLIER * std;
+    // Find all significant gaps (group boundaries)
+    const boundaries = gaps.filter((g) => g.gap > threshold).map((g) => g.index);
+    // If no boundaries found, return all results
+    if (boundaries.length === 0)
+        return results;
+    // Determine how many groups to include based on mode
+    // 'similar': 1 group (cut at first boundary)
+    // 'related': 2 groups (cut at second boundary, or return all if only 1 boundary)
+    const groupsToInclude = mode === 'similar' ? 1 : 2;
+    const boundaryIndex = groupsToInclude - 1;
+    // If we don't have enough boundaries, return all results for 'related' mode
+    if (boundaryIndex >= boundaries.length) {
+        return mode === 'related' ? results : results.slice(0, boundaries[0]);
+    }
+    // Cut at the appropriate boundary
+    return results.slice(0, boundaries[boundaryIndex]);
+}
+/**
+ * Apply file-based filter to limit results to chunks from the top N files.
+ *
+ * Ranks files by their best (lowest distance) chunk score and keeps only
+ * chunks belonging to the top `maxFiles` files.
+ *
+ * @param results - Search results sorted by distance (ascending)
+ * @param maxFiles - Maximum number of files to keep
+ * @returns Filtered results preserving original order
+ */
+export function applyFileFilter(results, maxFiles) {
+    if (results.length === 0)
+        return results;
+    // Find the best (lowest) score per file
+    const fileScores = new Map();
+    for (const result of results) {
+        const current = fileScores.get(result.filePath);
+        if (current === undefined || result.score < current) {
+            fileScores.set(result.filePath, result.score);
+        }
+    }
+    // If we have fewer or equal files than maxFiles, return all
+    if (fileScores.size <= maxFiles)
+        return results;
+    // Sort files by best score (ascending) and take top N
+    const topFiles = new Set([...fileScores.entries()]
+        .sort((a, b) => a[1] - b[1])
+        .slice(0, maxFiles)
+        .map(([filePath]) => filePath));
+    // Filter results to only include chunks from top files
+    return results.filter((result) => topFiles.has(result.filePath));
+}
+/**
+ * Apply keyword boost to rerank vector search results
+ * Uses multiplicative formula: final_distance = distance / (1 + keyword_normalized * weight)
+ *
+ * This proportional boost ensures:
+ * - Keyword matches improve ranking without dominating semantic similarity
+ * - Documents without keyword matches keep their original vector distance
+ * - Higher weight = stronger influence of keyword matching
+ *
+ * @param vectorResults - Results from vector search (already filtered by maxDistance/grouping)
+ * @param ftsResults - Raw FTS results with BM25 scores
+ * @param weight - Boost weight (0-1, from hybridWeight config)
+ */
+export function applyKeywordBoost(vectorResults, ftsResults, weight) {
+    // Build FTS score map with normalized scores (0-1)
+    let maxBm25Score = 0;
+    for (const result of ftsResults) {
+        if (!result)
+            continue;
+        const score = result['_score'] ?? 0;
+        if (score > maxBm25Score)
+            maxBm25Score = score;
+    }
+    const ftsScoreMap = new Map();
+    for (const result of ftsResults) {
+        if (!result)
+            continue;
+        const key = `${result['filePath']}:${result['chunkIndex']}`;
+        const rawScore = result['_score'] ?? 0;
+        const normalized = maxBm25Score > 0 ? rawScore / maxBm25Score : 0;
+        ftsScoreMap.set(key, normalized);
+    }
+    // Apply multiplicative boost to vector results
+    const boostedResults = vectorResults.map((result) => {
+        const key = `${result.filePath}:${result.chunkIndex}`;
+        const keywordScore = ftsScoreMap.get(key) ?? 0;
+        // Multiplicative boost: distance / (1 + keyword * weight)
+        // - If keyword matches (score=1) and weight=1: distance halved
+        // - If no keyword match (score=0): distance unchanged
+        const boostedDistance = result.score / (1 + keywordScore * weight);
+        return {
+            ...result,
+            score: boostedDistance,
+        };
+    });
+    // Re-sort by boosted distance (ascending = better)
+    return boostedResults.sort((a, b) => a.score - b.score);
+}
+//# sourceMappingURL=search-filters.js.map

package/dist/vectordb/search-filters.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"search-filters.js","sourceRoot":"","sources":["../../src/vectordb/search-filters.ts"],"names":[],"mappings":"AAAA,qEAAqE;AAIrE;;;;GAIG;AACH,MAAM,gCAAgC,GAAG,GAAG,CAAA;AAE5C;;;;;;;;;;GAUG;AACH,MAAM,UAAU,aAAa,CAAC,OAAuB,EAAE,IAAkB;IACvE,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,OAAO,CAAA;IAEvC,gEAAgE;IAChE,MAAM,IAAI,GAAqC,EAAE,CAAA;IACjD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5C,MAAM,OAAO,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;QAC1B,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QAC3B,IAAI,OAAO,KAAK,SAAS,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YAChD,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC,CAAA;QAC9D,CAAC;IACH,CAAC;IAED,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,OAAO,CAAA;IAErC,kFAAkF;IAClF,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;IACxC,MAAM,IAAI,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC,MAAM,CAAA;IACpE,MAAM,QAAQ,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC,MAAM,CAAA;IACtF,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;IAC/B,MAAM,SAAS,GAAG,IAAI,GAAG,gCAAgC,GAAG,GAAG,CAAA;IAE/D,+CAA+C;IAC/C,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAA;IAE5E,6CAA6C;IAC7C,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,OAAO,CAAA;IAE3C,qDAAqD;IACrD,6CAA6C;IAC7C,iFAAiF;IACjF,MAAM,eAAe,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAClD,MAAM,aAAa,GAAG,eAAe,GAAG,CAAC,CAAA;IAEzC,4EAA4E;IAC5E,IAAI,aAAa,IAAI,UAAU,CAAC,MAAM,EAAE,CAAC;QACvC,OAAO,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;IACvE,CAAC;IAED,kCAAkC;IAClC,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,aAAa,CAAC,CAAC,CAAA;AACpD,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,eAAe,CAAC,OAAuB,EAAE,QAAgB;IACvE,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,OAAO,CAAA;IAExC,wCAAwC;IACxC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAA;IAC5C,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAA;QAC/C,IAAI,OAAO,KAAK,SAAS,IAAI,MAAM,CAAC,KAAK,GAAG,OAAO,EAAE,CAAC;YACpD,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,KAAK,CAAC,CAAA;QAC/C,CAAC;IACH,CAAC;IAED,4DAA4D;IAC5D,IAAI,UAAU,CAAC,IAAI,IAAI,QAAQ;QAAE,OAAO,OAAO,CAAA;IAE/C,sDAAsD;IACtD,MAAM,QAAQ,GAAG,IAAI,GAAG,CACtB,CAAC,GAAG,UAAU,CAAC,OAAO,EAAE,CAAC;SACtB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;SAC3B,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC;SAClB,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CACjC,CAAA;IAED,uDAAuD;IACvD,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAA;AAClE,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,iBAAiB,CAC/B,aAA6B,EAC7B,UAAqC,EACrC,MAAc;IAEd,mDAAmD;IACnD,IAAI,YAAY,GAAG,CAAC,CAAA;IACpB,KAAK,MAAM,MAAM,IAAI,UAAU,EAAE,CAAC;QAChC,IAAI,CAAC,MAAM;YAAE,SAAQ;QACrB,MAAM,KAAK,GAAI,MAAM,CAAC,QAAQ,CAAY,IAAI,CAAC,CAAA;QAC/C,IAAI,KAAK,GAAG,YAAY;YAAE,YAAY,GAAG,KAAK,CAAA;IAChD,CAAC;IAED,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAA;IAC7C,KAAK,MAAM,MAAM,IAAI,UAAU,EAAE,CAAC;QAChC,IAAI,CAAC,MAAM;YAAE,SAAQ;QACrB,MAAM,GAAG,GAAG,GAAG,MAAM,CAAC,UAAU,CAAC,IAAI,MAAM,CAAC,YAAY,CAAC,EAAE,CAAA;QAC3D,MAAM,QAAQ,GAAI,MAAM,CAAC,QAAQ,CAAY,IAAI,CAAC,CAAA;QAClD,MAAM,UAAU,GAAG,YAAY,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,CAAA;QACjE,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,UAAU,CAAC,CAAA;IAClC,CAAC;IAED,+CAA+C;IAC/C,MAAM,cAAc,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE;QAClD,MAAM,GAAG,GAAG,GAAG,MAAM,CAAC,QAAQ,IAAI,MAAM,CAAC,UAAU,EAAE,CAAA;QACrD,MAAM,YAAY,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QAE9C,0DAA0D;QAC1D,+DAA+D;QAC/D,sDAAsD;QACtD,MAAM,eAAe,GAAG,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,YAAY,GAAG,MAAM,CAAC,CAAA;QAElE,OAAO;YACL,GAAG,MAAM;YACT,KAAK,EAAE,eAAe;SACvB,CAAA;IACH,CAAC,CAAC,CAAA;IAEF,mDAAmD;IACnD,OAAO,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAA;AACzD,CAAC"}

package/dist/vectordb/types.d.ts

@@ -0,0 +1,196 @@
+import { AppError } from '../utils/errors.js';
+/** Multiplier for candidate count in hybrid search (to allow reranking) */
+export declare const HYBRID_SEARCH_CANDIDATE_MULTIPLIER = 2;
+/** FTS index name (bump version when changing tokenizer settings) */
+export declare const FTS_INDEX_NAME = "fts_index_v2";
+/** Threshold for cleaning up old index versions (1 minute) */
+export declare const FTS_CLEANUP_THRESHOLD_MS: number;
+/** Default hybrid-search weight (vector vs FTS blend) when not configured */
+export declare const DEFAULT_HYBRID_WEIGHT = 0.6;
+/**
+ * Grouping mode for quality filtering
+ * - 'similar': Only return the most similar group (stops at first distance jump)
+ * - 'related': Include related groups (stops at second distance jump)
+ */
+export type GroupingMode = 'similar' | 'related';
+/**
+ * VectorStore configuration
+ */
+export interface VectorStoreConfig {
+    /** LanceDB database path */
+    dbPath: string;
+    /** Table name */
+    tableName: string;
+    /** Maximum distance threshold for filtering results (optional) */
+    maxDistance?: number;
+    /** Grouping mode for quality filtering (optional) */
+    grouping?: GroupingMode;
+    /** Hybrid search weight for BM25 (0.0 = vector only, 1.0 = BM25 only, default 0.6) */
+    hybridWeight?: number;
+    /** Maximum number of files to keep in results (optional, filters by best score per file) */
+    maxFiles?: number;
+}
+/**
+ * Per-call options for {@link VectorStore.search}.
+ * Grouped into an object (instead of positional params) so the caller can pass
+ * any subset and so adding options (like `scope`) is not a breaking signature
+ * change.
+ */
+export interface SearchOptions {
+    /** Optional query text for keyword boost (BM25) */
+    queryText?: string;
+    /** Number of results to retrieve (default 10, valid range 1-20) */
+    limit?: number;
+    /**
+     * Optional path-prefix scope (exact-or-descendant, prefixes unioned). Omitted
+     * = no prefilter (backward compatible).
+     */
+    scope?: string[];
+}
+/**
+ * Document metadata
+ */
+export interface DocumentMetadata {
+    /** File name */
+    fileName: string;
+    /** File size in bytes */
+    fileSize: number;
+    /** File type (extension) */
+    fileType: string;
+}
+/**
+ * Validated, bounded image stored in a chunk's ordered attachment JSON.
+ */
+export interface VisualAttachment {
+    imageIndex: number;
+    mimeType: 'image/png' | 'image/jpeg';
+    data: string;
+}
+/**
+ * Vector chunk
+ */
+export interface VectorChunk {
+    /** Chunk ID (UUID) */
+    id: string;
+    /** File path (absolute) */
+    filePath: string;
+    /** Chunk index (zero-based) */
+    chunkIndex: number;
+    /** Chunk text */
+    text: string;
+    /** Embedding vector (dimension depends on model) */
+    vector: number[];
+    /** Metadata */
+    metadata: DocumentMetadata;
+    /** Document title extracted from file content (display-only, not used for scoring) */
+    fileTitle: string | null;
+    /** SHA-256 of the source file bytes; absent for chunks not ingested from a file. */
+    contentHash?: string;
+    /** Ordered `JSON.stringify(VisualAttachment[])`; omitted means no attachments. */
+    visualAttachments?: string;
+    /** Ingestion timestamp (ISO 8601 format) */
+    timestamp: string;
+}
+/**
+ * Search result
+ */
+export interface SearchResult {
+    /** Stable persisted row identity used for attachment hydration. */
+    id: string;
+    /** File path */
+    filePath: string;
+    /** Chunk index */
+    chunkIndex: number;
+    /** Chunk text */
+    text: string;
+    /** Distance score using dot product (0 = identical, 1 = orthogonal, 2 = opposite) */
+    score: number;
+    /** Metadata */
+    metadata: DocumentMetadata;
+    /** Document title extracted from file content (display-only, not used for scoring) */
+    fileTitle: string | null;
+}
+/** Validated attachments for one persisted row, in visual order. */
+export interface HydratedChunkAttachments {
+    id: string;
+    attachments: VisualAttachment[];
+}
+/** Result of one final-identity hydration query. */
+export interface AttachmentHydrationResult {
+    rows: HydratedChunkAttachments[];
+    omittedCount: number;
+}
+/**
+ * Row returned by VectorStore.getChunksByRange.
+ * Distinct from SearchResult: no score (not a ranked result) and no metadata
+ * (not needed for index-adjacent retrieval). Consumed by
+ * handleReadChunkNeighbors and runReadNeighbors.
+ */
+export interface ChunkRow {
+    /** File path (absolute) */
+    filePath: string;
+    /** Chunk index (zero-based) */
+    chunkIndex: number;
+    /** Chunk text */
+    text: string;
+    /** Document title extracted from file content (display-only, not used for scoring) */
+    fileTitle: string | null;
+}
+/**
+ * Raw result from LanceDB query (internal type)
+ */
+export interface LanceDBRawResult {
+    id: string;
+    filePath: string;
+    chunkIndex: number;
+    text: string;
+    metadata: DocumentMetadata;
+    /** Document title (optional - existing rows lack this field before migration) */
+    fileTitle?: string | null;
+    _distance?: number;
+    _score?: number;
+}
+/**
+ * Type guard for LanceDB raw search result
+ */
+export declare function isLanceDBRawResult(value: unknown): value is LanceDBRawResult;
+/**
+ * Convert LanceDB raw result to SearchResult with type validation
+ * @throws DatabaseError if the result is invalid
+ */
+export declare function toSearchResult(raw: unknown): SearchResult;
+/**
+ * Map a raw LanceDB row to a full {@link VectorChunk}, including the stored
+ * embedding vector and metadata. Used for backup/restore (ingest rollback),
+ * where the row must round-trip back through `insertChunks` intact — unlike
+ * {@link toChunkRow} / {@link toSearchResult}, which drop the vector. The
+ * embedding is normalized to `number[]` (LanceDB returns a typed array).
+ */
+export declare function toVectorChunk(raw: unknown): VectorChunk;
+/** Normalize only the defined legacy no-image sentinels; keep malformed JSON observable. */
+export declare function normalizeVisualAttachments(value: unknown): string;
+/** Parse one persisted attachment cell while keeping malformed siblings observable. */
+export declare function parseHydratedVisualAttachments(value: unknown): {
+    attachments: VisualAttachment[];
+    omittedCount: number;
+};
+/**
+ * Convert LanceDB raw row to ChunkRow with type validation.
+ * Mirrors toSearchResult but returns the minimal range-read shape: no score
+ * (not ranked) and no metadata (not needed for index-adjacent retrieval).
+ *
+ * Uses a narrower shape check than isLanceDBRawResult: only
+ * filePath/chunkIndex/text are required because getChunksByRange
+ * does not project metadata. The empty-string-or-missing fileTitle
+ * is normalized to null per §Field Propagation Map.
+ *
+ * @throws DatabaseError if the raw row is missing required fields
+ */
+export declare function toChunkRow(raw: unknown): ChunkRow;
+/**
+ * Database error
+ */
+export declare class DatabaseError extends AppError {
+    constructor(message: string, cause?: Error);
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/vectordb/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/vectordb/types.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAA;AAO7C,2EAA2E;AAC3E,eAAO,MAAM,kCAAkC,IAAI,CAAA;AAEnD,qEAAqE;AACrE,eAAO,MAAM,cAAc,iBAAiB,CAAA;AAE5C,8DAA8D;AAC9D,eAAO,MAAM,wBAAwB,QAAY,CAAA;AAEjD,6EAA6E;AAC7E,eAAO,MAAM,qBAAqB,MAAM,CAAA;AAMxC;;;;GAIG;AACH,MAAM,MAAM,YAAY,GAAG,SAAS,GAAG,SAAS,CAAA;AAEhD;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,4BAA4B;IAC5B,MAAM,EAAE,MAAM,CAAA;IACd,iBAAiB;IACjB,SAAS,EAAE,MAAM,CAAA;IACjB,kEAAkE;IAClE,WAAW,CAAC,EAAE,MAAM,CAAA;IACpB,qDAAqD;IACrD,QAAQ,CAAC,EAAE,YAAY,CAAA;IACvB,sFAAsF;IACtF,YAAY,CAAC,EAAE,MAAM,CAAA;IACrB,4FAA4F;IAC5F,QAAQ,CAAC,EAAE,MAAM,CAAA;CAClB;AAED;;;;;GAKG;AACH,MAAM,WAAW,aAAa;IAC5B,mDAAmD;IACnD,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB,mEAAmE;IACnE,KAAK,CAAC,EAAE,MAAM,CAAA;IACd;;;OAGG;IACH,KAAK,CAAC,EAAE,MAAM,EAAE,CAAA;CACjB;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,gBAAgB;IAChB,QAAQ,EAAE,MAAM,CAAA;IAChB,yBAAyB;IACzB,QAAQ,EAAE,MAAM,CAAA;IAChB,4BAA4B;IAC5B,QAAQ,EAAE,MAAM,CAAA;CACjB;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,UAAU,EAAE,MAAM,CAAA;IAClB,QAAQ,EAAE,WAAW,GAAG,YAAY,CAAA;IACpC,IAAI,EAAE,MAAM,CAAA;CACb;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,sBAAsB;IACtB,EAAE,EAAE,MAAM,CAAA;IACV,2BAA2B;IAC3B,QAAQ,EAAE,MAAM,CAAA;IAChB,+BAA+B;IAC/B,UAAU,EAAE,MAAM,CAAA;IAClB,iBAAiB;IACjB,IAAI,EAAE,MAAM,CAAA;IACZ,oDAAoD;IACpD,MAAM,EAAE,MAAM,EAAE,CAAA;IAChB,eAAe;IACf,QAAQ,EAAE,gBAAgB,CAAA;IAC1B,sFAAsF;IACtF,SAAS,EAAE,MAAM,GAAG,IAAI,CAAA;IACxB,oFAAoF;IACpF,WAAW,CAAC,EAAE,MAAM,CAAA;IACpB,kFAAkF;IAClF,iBAAiB,CAAC,EAAE,MAAM,CAAA;IAC1B,4CAA4C;IAC5C,SAAS,EAAE,MAAM,CAAA;CAClB;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,mEAAmE;IACnE,EAAE,EAAE,MAAM,CAAA;IACV,gBAAgB;IAChB,QAAQ,EAAE,MAAM,CAAA;IAChB,kBAAkB;IAClB,UAAU,EAAE,MAAM,CAAA;IAClB,iBAAiB;IACjB,IAAI,EAAE,MAAM,CAAA;IACZ,qFAAqF;IACrF,KAAK,EAAE,MAAM,CAAA;IACb,eAAe;IACf,QAAQ,EAAE,gBAAgB,CAAA;IAC1B,sFAAsF;IACtF,SAAS,EAAE,MAAM,GAAG,IAAI,CAAA;CACzB;AAED,oEAAoE;AACpE,MAAM,WAAW,wBAAwB;IACvC,EAAE,EAAE,MAAM,CAAA;IACV,WAAW,EAAE,gBAAgB,EAAE,CAAA;CAChC;AAED,oDAAoD;AACpD,MAAM,WAAW,yBAAyB;IACxC,IAAI,EAAE,wBAAwB,EAAE,CAAA;IAChC,YAAY,EAAE,MAAM,CAAA;CACrB;AAED;;;;;GAKG;AACH,MAAM,WAAW,QAAQ;IACvB,2BAA2B;IAC3B,QAAQ,EAAE,MAAM,CAAA;IAChB,+BAA+B;IAC/B,UAAU,EAAE,MAAM,CAAA;IAClB,iBAAiB;IACjB,IAAI,EAAE,MAAM,CAAA;IACZ,sFAAsF;IACtF,SAAS,EAAE,MAAM,GAAG,IAAI,CAAA;CACzB;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAC/B,EAAE,EAAE,MAAM,CAAA;IACV,QAAQ,EAAE,MAAM,CAAA;IAChB,UAAU,EAAE,MAAM,CAAA;IAClB,IAAI,EAAE,MAAM,CAAA;IACZ,QAAQ,EAAE,gBAAgB,CAAA;IAC1B,iFAAiF;IACjF,SAAS,CAAC,EAAE,MAAM,GAAG,IAAI,CAAA;IACzB,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB,MAAM,CAAC,EAAE,MAAM,CAAA;CAChB;AAmBD;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,OAAO,GAAG,KAAK,IAAI,gBAAgB,CAU5E;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAAC,GAAG,EAAE,OAAO,GAAG,YAAY,CAoBzD;AAED;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,GAAG,EAAE,OAAO,GAAG,WAAW,CA+CvD;AAED,4FAA4F;AAC5F,wBAAgB,0BAA0B,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM,CAEjE;AA2CD,uFAAuF;AACvF,wBAAgB,8BAA8B,CAAC,KAAK,EAAE,OAAO,GAAG;IAC9D,WAAW,EAAE,gBAAgB,EAAE,CAAA;IAC/B,YAAY,EAAE,MAAM,CAAA;CACrB,CA4BA;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,OAAO,GAAG,QAAQ,CAqBjD;AAMD;;GAEG;AACH,qBAAa,aAAc,SAAQ,QAAQ;IACzC,YAAY,OAAO,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,KAAK,EAGzC;CACF"}

package/dist/vectordb/types.js

@@ -0,0 +1,224 @@
+// VectorDB type definitions, constants, type guards, and error classes
+import { AppError } from '../utils/errors.js';
+import { MAX_VISUAL_RENDITION_BYTES } from '../utils/limits.js';
+// ============================================
+// Constants
+// ============================================
+/** Multiplier for candidate count in hybrid search (to allow reranking) */
+export const HYBRID_SEARCH_CANDIDATE_MULTIPLIER = 2;
+/** FTS index name (bump version when changing tokenizer settings) */
+export const FTS_INDEX_NAME = 'fts_index_v2';
+/** Threshold for cleaning up old index versions (1 minute) */
+export const FTS_CLEANUP_THRESHOLD_MS = 60 * 1000;
+/** Default hybrid-search weight (vector vs FTS blend) when not configured */
+export const DEFAULT_HYBRID_WEIGHT = 0.6;
+// ============================================
+// Type Guards
+// ============================================
+/**
+ * Type guard for DocumentMetadata
+ */
+function isDocumentMetadata(value) {
+    if (typeof value !== 'object' || value === null)
+        return false;
+    const obj = value;
+    return (typeof obj['fileName'] === 'string' &&
+        typeof obj['fileSize'] === 'number' &&
+        typeof obj['fileType'] === 'string');
+}
+/**
+ * Type guard for LanceDB raw search result
+ */
+export function isLanceDBRawResult(value) {
+    if (typeof value !== 'object' || value === null)
+        return false;
+    const obj = value;
+    return (typeof obj['id'] === 'string' &&
+        typeof obj['filePath'] === 'string' &&
+        typeof obj['chunkIndex'] === 'number' &&
+        typeof obj['text'] === 'string' &&
+        isDocumentMetadata(obj['metadata']));
+}
+/**
+ * Convert LanceDB raw result to SearchResult with type validation
+ * @throws DatabaseError if the result is invalid
+ */
+export function toSearchResult(raw) {
+    if (!isLanceDBRawResult(raw)) {
+        throw new DatabaseError('Invalid search result format from LanceDB');
+    }
+    // Score source: vector search rows carry `_distance` (dot distance, the
+    // normal path). `_score` is a defensive fallback for any FTS-shaped row that
+    // reaches here (the live FTS path consumes `_score` directly in
+    // applyKeywordBoost, not via this mapper). The final `?? 0` is an
+    // effectively-unreachable guard: vectorSearch always returns `_distance`. It
+    // is kept defensive rather than throwing, since a missing score is not worth
+    // failing a whole search over.
+    return {
+        id: raw.id,
+        filePath: raw.filePath,
+        chunkIndex: raw.chunkIndex,
+        text: raw.text,
+        score: raw._distance ?? raw._score ?? 0,
+        metadata: raw.metadata,
+        fileTitle: raw.fileTitle || null,
+    };
+}
+/**
+ * Map a raw LanceDB row to a full {@link VectorChunk}, including the stored
+ * embedding vector and metadata. Used for backup/restore (ingest rollback),
+ * where the row must round-trip back through `insertChunks` intact — unlike
+ * {@link toChunkRow} / {@link toSearchResult}, which drop the vector. The
+ * embedding is normalized to `number[]` (LanceDB returns a typed array).
+ */
+export function toVectorChunk(raw) {
+    if (typeof raw !== 'object' || raw === null) {
+        throw new DatabaseError('Invalid chunk row shape from LanceDB');
+    }
+    const obj = raw;
+    const { id, filePath, chunkIndex, text, vector, metadata, fileTitle, contentHash, visualAttachments, timestamp, } = obj;
+    if (typeof id !== 'string' ||
+        typeof filePath !== 'string' ||
+        typeof chunkIndex !== 'number' ||
+        typeof text !== 'string' ||
+        typeof timestamp !== 'string') {
+        throw new DatabaseError('Invalid chunk row shape from LanceDB (scalar fields)');
+    }
+    if (!isDocumentMetadata(metadata)) {
+        throw new DatabaseError('Invalid chunk row shape from LanceDB (metadata)');
+    }
+    if (vector == null || typeof vector.length !== 'number') {
+        throw new DatabaseError('Invalid chunk row shape from LanceDB (vector)');
+    }
+    return {
+        id,
+        filePath,
+        chunkIndex,
+        text,
+        vector: Array.from(vector),
+        metadata,
+        fileTitle: typeof fileTitle === 'string' && fileTitle.length > 0 ? fileTitle : null,
+        // Omit the key rather than store '' or undefined: the create path seeds ''
+        // for schema inference, and a '' that survived to a caller would read as a
+        // real hash equal to nothing on disk.
+        ...(typeof contentHash === 'string' && contentHash.length > 0 ? { contentHash } : {}),
+        visualAttachments: normalizeVisualAttachments(visualAttachments),
+        timestamp,
+    };
+}
+/** Normalize only the defined legacy no-image sentinels; keep malformed JSON observable. */
+export function normalizeVisualAttachments(value) {
+    return typeof value === 'string' && value.length > 0 ? value : '[]';
+}
+const VISUAL_RENDITION_MAX_BASE64_LENGTH = Math.ceil(MAX_VISUAL_RENDITION_BYTES / 3) * 4;
+function decodeStrictBase64(value) {
+    if (typeof value !== 'string' ||
+        value.length === 0 ||
+        value.length > VISUAL_RENDITION_MAX_BASE64_LENGTH ||
+        value.length % 4 !== 0 ||
+        !/^(?:[A-Za-z0-9+/]{4})*(?:[A-Za-z0-9+/]{2}==|[A-Za-z0-9+/]{3}=)?$/.test(value)) {
+        return null;
+    }
+    const decoded = Buffer.from(value, 'base64');
+    return decoded.toString('base64') === value ? decoded : null;
+}
+function isVisualAttachment(value) {
+    if (typeof value !== 'object' || value === null)
+        return false;
+    const attachment = value;
+    if (!Number.isInteger(attachment.imageIndex) ||
+        attachment.imageIndex < 0 ||
+        (attachment.mimeType !== 'image/png' && attachment.mimeType !== 'image/jpeg')) {
+        return false;
+    }
+    const bytes = decodeStrictBase64(attachment.data);
+    if (!bytes || bytes.byteLength > MAX_VISUAL_RENDITION_BYTES)
+        return false;
+    return attachment.mimeType === 'image/png'
+        ? bytes.length >= 8 &&
+            bytes[0] === 0x89 &&
+            bytes[1] === 0x50 &&
+            bytes[2] === 0x4e &&
+            bytes[3] === 0x47 &&
+            bytes[4] === 0x0d &&
+            bytes[5] === 0x0a &&
+            bytes[6] === 0x1a &&
+            bytes[7] === 0x0a
+        : bytes.length >= 3 && bytes[0] === 0xff && bytes[1] === 0xd8 && bytes[2] === 0xff;
+}
+/** Parse one persisted attachment cell while keeping malformed siblings observable. */
+export function parseHydratedVisualAttachments(value) {
+    if (value === null || value === undefined || value === '' || value === '[]') {
+        return { attachments: [], omittedCount: 0 };
+    }
+    if (typeof value !== 'string')
+        return { attachments: [], omittedCount: 1 };
+    let parsed;
+    try {
+        parsed = JSON.parse(value);
+    }
+    catch {
+        return { attachments: [], omittedCount: 1 };
+    }
+    if (!Array.isArray(parsed))
+        return { attachments: [], omittedCount: 1 };
+    const attachments = [];
+    let omittedCount = 0;
+    for (const item of parsed) {
+        if (!isVisualAttachment(item)) {
+            omittedCount += 1;
+            continue;
+        }
+        attachments.push({
+            imageIndex: item.imageIndex,
+            mimeType: item.mimeType,
+            data: item.data,
+        });
+    }
+    attachments.sort((left, right) => left.imageIndex - right.imageIndex);
+    return { attachments, omittedCount };
+}
+/**
+ * Convert LanceDB raw row to ChunkRow with type validation.
+ * Mirrors toSearchResult but returns the minimal range-read shape: no score
+ * (not ranked) and no metadata (not needed for index-adjacent retrieval).
+ *
+ * Uses a narrower shape check than isLanceDBRawResult: only
+ * filePath/chunkIndex/text are required because getChunksByRange
+ * does not project metadata. The empty-string-or-missing fileTitle
+ * is normalized to null per §Field Propagation Map.
+ *
+ * @throws DatabaseError if the raw row is missing required fields
+ */
+export function toChunkRow(raw) {
+    if (typeof raw !== 'object' || raw === null) {
+        throw new DatabaseError('Invalid chunk row shape from LanceDB');
+    }
+    const obj = raw;
+    if (typeof obj['filePath'] !== 'string' ||
+        typeof obj['chunkIndex'] !== 'number' ||
+        typeof obj['text'] !== 'string') {
+        throw new DatabaseError('Invalid chunk row shape from LanceDB');
+    }
+    const rawFileTitle = obj['fileTitle'];
+    const fileTitle = typeof rawFileTitle === 'string' && rawFileTitle.length > 0 ? rawFileTitle : null;
+    return {
+        filePath: obj['filePath'],
+        chunkIndex: obj['chunkIndex'],
+        text: obj['text'],
+        fileTitle,
+    };
+}
+// ============================================
+// Error Classes
+// ============================================
+/**
+ * Database error
+ */
+export class DatabaseError extends AppError {
+    constructor(message, cause) {
+        super(message, 'vectordb', 'internal', cause);
+        this.name = 'DatabaseError';
+    }
+}
+//# sourceMappingURL=types.js.map

package/dist/vectordb/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/vectordb/types.ts"],"names":[],"mappings":"AAAA,uEAAuE;AAEvE,OAAO,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAA;AAC7C,OAAO,EAAE,0BAA0B,EAAE,MAAM,oBAAoB,CAAA;AAE/D,+CAA+C;AAC/C,YAAY;AACZ,+CAA+C;AAE/C,2EAA2E;AAC3E,MAAM,CAAC,MAAM,kCAAkC,GAAG,CAAC,CAAA;AAEnD,qEAAqE;AACrE,MAAM,CAAC,MAAM,cAAc,GAAG,cAAc,CAAA;AAE5C,8DAA8D;AAC9D,MAAM,CAAC,MAAM,wBAAwB,GAAG,EAAE,GAAG,IAAI,CAAA;AAEjD,6EAA6E;AAC7E,MAAM,CAAC,MAAM,qBAAqB,GAAG,GAAG,CAAA;AAgKxC,+CAA+C;AAC/C,cAAc;AACd,+CAA+C;AAE/C;;GAEG;AACH,SAAS,kBAAkB,CAAC,KAAc;IACxC,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,KAAK,CAAA;IAC7D,MAAM,GAAG,GAAG,KAAgC,CAAA;IAC5C,OAAO,CACL,OAAO,GAAG,CAAC,UAAU,CAAC,KAAK,QAAQ;QACnC,OAAO,GAAG,CAAC,UAAU,CAAC,KAAK,QAAQ;QACnC,OAAO,GAAG,CAAC,UAAU,CAAC,KAAK,QAAQ,CACpC,CAAA;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAc;IAC/C,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,KAAK,CAAA;IAC7D,MAAM,GAAG,GAAG,KAAgC,CAAA;IAC5C,OAAO,CACL,OAAO,GAAG,CAAC,IAAI,CAAC,KAAK,QAAQ;QAC7B,OAAO,GAAG,CAAC,UAAU,CAAC,KAAK,QAAQ;QACnC,OAAO,GAAG,CAAC,YAAY,CAAC,KAAK,QAAQ;QACrC,OAAO,GAAG,CAAC,MAAM,CAAC,KAAK,QAAQ;QAC/B,kBAAkB,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CACpC,CAAA;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,GAAY;IACzC,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,EAAE,CAAC;QAC7B,MAAM,IAAI,aAAa,CAAC,2CAA2C,CAAC,CAAA;IACtE,CAAC;IACD,wEAAwE;IACxE,6EAA6E;IAC7E,gEAAgE;IAChE,kEAAkE;IAClE,6EAA6E;IAC7E,6EAA6E;IAC7E,+BAA+B;IAC/B,OAAO;QACL,EAAE,EAAE,GAAG,CAAC,EAAE;QACV,QAAQ,EAAE,GAAG,CAAC,QAAQ;QACtB,UAAU,EAAE,GAAG,CAAC,UAAU;QAC1B,IAAI,EAAE,GAAG,CAAC,IAAI;QACd,KAAK,EAAE,GAAG,CAAC,SAAS,IAAI,GAAG,CAAC,MAAM,IAAI,CAAC;QACvC,QAAQ,EAAE,GAAG,CAAC,QAAQ;QACtB,SAAS,EAAE,GAAG,CAAC,SAAS,IAAI,IAAI;KACjC,CAAA;AACH,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAAC,GAAY;IACxC,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;QAC5C,MAAM,IAAI,aAAa,CAAC,sCAAsC,CAAC,CAAA;IACjE,CAAC;IACD,MAAM,GAAG,GAAG,GAA8B,CAAA;IAC1C,MAAM,EACJ,EAAE,EACF,QAAQ,EACR,UAAU,EACV,IAAI,EACJ,MAAM,EACN,QAAQ,EACR,SAAS,EACT,WAAW,EACX,iBAAiB,EACjB,SAAS,GACV,GAAG,GAAG,CAAA;IACP,IACE,OAAO,EAAE,KAAK,QAAQ;QACtB,OAAO,QAAQ,KAAK,QAAQ;QAC5B,OAAO,UAAU,KAAK,QAAQ;QAC9B,OAAO,IAAI,KAAK,QAAQ;QACxB,OAAO,SAAS,KAAK,QAAQ,EAC7B,CAAC;QACD,MAAM,IAAI,aAAa,CAAC,sDAAsD,CAAC,CAAA;IACjF,CAAC;IACD,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,EAAE,CAAC;QAClC,MAAM,IAAI,aAAa,CAAC,iDAAiD,CAAC,CAAA;IAC5E,CAAC;IACD,IAAI,MAAM,IAAI,IAAI,IAAI,OAAQ,MAA+B,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;QAClF,MAAM,IAAI,aAAa,CAAC,+CAA+C,CAAC,CAAA;IAC1E,CAAC;IACD,OAAO;QACL,EAAE;QACF,QAAQ;QACR,UAAU;QACV,IAAI;QACJ,MAAM,EAAE,KAAK,CAAC,IAAI,CAAC,MAA2B,CAAC;QAC/C,QAAQ;QACR,SAAS,EAAE,OAAO,SAAS,KAAK,QAAQ,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI;QACnF,2EAA2E;QAC3E,2EAA2E;QAC3E,sCAAsC;QACtC,GAAG,CAAC,OAAO,WAAW,KAAK,QAAQ,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACrF,iBAAiB,EAAE,0BAA0B,CAAC,iBAAiB,CAAC;QAChE,SAAS;KACV,CAAA;AACH,CAAC;AAED,4FAA4F;AAC5F,MAAM,UAAU,0BAA0B,CAAC,KAAc;IACvD,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAA;AACrE,CAAC;AAED,MAAM,kCAAkC,GAAG,IAAI,CAAC,IAAI,CAAC,0BAA0B,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;AAExF,SAAS,kBAAkB,CAAC,KAAc;IACxC,IACE,OAAO,KAAK,KAAK,QAAQ;QACzB,KAAK,CAAC,MAAM,KAAK,CAAC;QAClB,KAAK,CAAC,MAAM,GAAG,kCAAkC;QACjD,KAAK,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC;QACtB,CAAC,kEAAkE,CAAC,IAAI,CAAC,KAAK,CAAC,EAC/E,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC;IACD,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAA;IAC5C,OAAO,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAA;AAC9D,CAAC;AAED,SAAS,kBAAkB,CAAC,KAAc;IACxC,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,KAAK,CAAA;IAC7D,MAAM,UAAU,GAAG,KAAkC,CAAA;IACrD,IACE,CAAC,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,UAAU,CAAC;QACvC,UAAU,CAAC,UAAqB,GAAG,CAAC;QACrC,CAAC,UAAU,CAAC,QAAQ,KAAK,WAAW,IAAI,UAAU,CAAC,QAAQ,KAAK,YAAY,CAAC,EAC7E,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IACD,MAAM,KAAK,GAAG,kBAAkB,CAAC,UAAU,CAAC,IAAI,CAAC,CAAA;IACjD,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,UAAU,GAAG,0BAA0B;QAAE,OAAO,KAAK,CAAA;IACzE,OAAO,UAAU,CAAC,QAAQ,KAAK,WAAW;QACxC,CAAC,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC;YACf,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI;YACjB,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI;YACjB,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI;YACjB,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI;YACjB,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI;YACjB,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI;YACjB,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI;YACjB,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI;QACrB,CAAC,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,CAAA;AACtF,CAAC;AAED,uFAAuF;AACvF,MAAM,UAAU,8BAA8B,CAAC,KAAc;IAI3D,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,EAAE,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;QAC5E,OAAO,EAAE,WAAW,EAAE,EAAE,EAAE,YAAY,EAAE,CAAC,EAAE,CAAA;IAC7C,CAAC;IACD,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,EAAE,WAAW,EAAE,EAAE,EAAE,YAAY,EAAE,CAAC,EAAE,CAAA;IAC1E,IAAI,MAAe,CAAA;IACnB,IAAI,CAAC;QACH,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;IAC5B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,WAAW,EAAE,EAAE,EAAE,YAAY,EAAE,CAAC,EAAE,CAAA;IAC7C,CAAC;IACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;QAAE,OAAO,EAAE,WAAW,EAAE,EAAE,EAAE,YAAY,EAAE,CAAC,EAAE,CAAA;IAEvE,MAAM,WAAW,GAAuB,EAAE,CAAA;IAC1C,IAAI,YAAY,GAAG,CAAC,CAAA;IACpB,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QAC1B,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9B,YAAY,IAAI,CAAC,CAAA;YACjB,SAAQ;QACV,CAAC;QACD,WAAW,CAAC,IAAI,CAAC;YACf,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,IAAI,EAAE,IAAI,CAAC,IAAI;SAChB,CAAC,CAAA;IACJ,CAAC;IACD,WAAW,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC,CAAA;IACrE,OAAO,EAAE,WAAW,EAAE,YAAY,EAAE,CAAA;AACtC,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,UAAU,CAAC,GAAY;IACrC,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;QAC5C,MAAM,IAAI,aAAa,CAAC,sCAAsC,CAAC,CAAA;IACjE,CAAC;IACD,MAAM,GAAG,GAAG,GAA8B,CAAA;IAC1C,IACE,OAAO,GAAG,CAAC,UAAU,CAAC,KAAK,QAAQ;QACnC,OAAO,GAAG,CAAC,YAAY,CAAC,KAAK,QAAQ;QACrC,OAAO,GAAG,CAAC,MAAM,CAAC,KAAK,QAAQ,EAC/B,CAAC;QACD,MAAM,IAAI,aAAa,CAAC,sCAAsC,CAAC,CAAA;IACjE,CAAC;IACD,MAAM,YAAY,GAAG,GAAG,CAAC,WAAW,CAAC,CAAA;IACrC,MAAM,SAAS,GACb,OAAO,YAAY,KAAK,QAAQ,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAA;IACnF,OAAO;QACL,QAAQ,EAAE,GAAG,CAAC,UAAU,CAAC;QACzB,UAAU,EAAE,GAAG,CAAC,YAAY,CAAC;QAC7B,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC;QACjB,SAAS;KACV,CAAA;AACH,CAAC;AAED,+CAA+C;AAC/C,gBAAgB;AAChB,+CAA+C;AAE/C;;GAEG;AACH,MAAM,OAAO,aAAc,SAAQ,QAAQ;IACzC,YAAY,OAAe,EAAE,KAAa;QACxC,KAAK,CAAC,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,KAAK,CAAC,CAAA;QAC7C,IAAI,CAAC,IAAI,GAAG,eAAe,CAAA;IAC7B,CAAC;CACF"}