@stoneforge/quarry 0.1.0

package/dist/services/dependency.js

@@ -0,0 +1,566 @@
+/**
+ * Dependency Service - Core operations for managing dependencies
+ *
+ * Provides CRUD operations for dependencies:
+ * - addDependency: Create a new dependency between elements
+ * - removeDependency: Remove an existing dependency
+ * - getDependencies: Get all dependencies from a source element
+ * - getDependents: Get all elements that depend on a target
+ *
+ * All operations emit events for audit trail.
+ */
+import { createDependency, validateDependencyType, validateElementId, validateEntityId, DependencyType as DT, normalizeRelatesToDependency, participatesInCycleDetection, EventType, createEvent, NotFoundError, ConflictError, ErrorCode, } from '@stoneforge/core';
+/**
+ * Default cycle detection configuration
+ */
+export const DEFAULT_CYCLE_DETECTION_CONFIG = {
+    maxDepth: 100,
+};
+// ============================================================================
+// DependencyService Class
+// ============================================================================
+/**
+ * Service for managing dependencies between elements
+ */
+export class DependencyService {
+    db;
+    constructor(db) {
+        this.db = db;
+    }
+    // --------------------------------------------------------------------------
+    // Schema Initialization
+    // --------------------------------------------------------------------------
+    /**
+     * Initialize the dependencies table schema
+     * Should be called during database setup
+     */
+    initSchema() {
+        this.db.exec(`
+      CREATE TABLE IF NOT EXISTS dependencies (
+        blocked_id TEXT NOT NULL,
+        blocker_id TEXT NOT NULL,
+        type TEXT NOT NULL,
+        created_at TEXT NOT NULL,
+        created_by TEXT NOT NULL,
+        metadata TEXT,
+        PRIMARY KEY (blocked_id, blocker_id, type)
+      )
+    `);
+        // Create indexes for efficient lookups
+        this.db.exec(`
+      CREATE INDEX IF NOT EXISTS idx_dependencies_blocker ON dependencies(blocker_id)
+    `);
+        this.db.exec(`
+      CREATE INDEX IF NOT EXISTS idx_dependencies_type ON dependencies(type)
+    `);
+        this.db.exec(`
+      CREATE INDEX IF NOT EXISTS idx_dependencies_blocked_type ON dependencies(blocked_id, type)
+    `);
+    }
+    // --------------------------------------------------------------------------
+    // Add Dependency
+    // --------------------------------------------------------------------------
+    /**
+     * Add a new dependency between elements
+     *
+     * @param input - Dependency creation input
+     * @param cycleConfig - Optional configuration for cycle detection
+     * @returns The created dependency
+     * @throws ValidationError if input is invalid
+     * @throws ConflictError if dependency already exists or would create a cycle
+     */
+    addDependency(input, cycleConfig) {
+        // Create and validate the dependency
+        const dependency = createDependency(input);
+        // For relates-to, normalize the direction (smaller ID is always blockedId)
+        let blockedId = dependency.blockedId;
+        let blockerId = dependency.blockerId;
+        if (dependency.type === DT.RELATES_TO) {
+            const normalized = normalizeRelatesToDependency(blockedId, blockerId);
+            blockedId = normalized.blockedId;
+            blockerId = normalized.blockerId;
+        }
+        // Check for cycles before inserting (for blocking dependency types)
+        this.checkForCycle(blockedId, blockerId, dependency.type, cycleConfig);
+        // Serialize metadata
+        const metadataJson = Object.keys(dependency.metadata).length > 0
+            ? JSON.stringify(dependency.metadata)
+            : null;
+        // Insert into database
+        try {
+            this.db.run(`INSERT INTO dependencies (blocked_id, blocker_id, type, created_at, created_by, metadata)
+         VALUES (?, ?, ?, ?, ?, ?)`, [
+                blockedId,
+                blockerId,
+                dependency.type,
+                dependency.createdAt,
+                dependency.createdBy,
+                metadataJson,
+            ]);
+        }
+        catch (error) {
+            // Check for duplicate key error
+            if (error instanceof Error && error.message.includes('UNIQUE constraint failed')) {
+                throw new ConflictError(`Dependency already exists: ${blockedId} -> ${blockerId} (${dependency.type})`, ErrorCode.DUPLICATE_DEPENDENCY, { blockedId, blockerId, type: dependency.type });
+            }
+            throw error;
+        }
+        // Return the dependency (with potentially normalized IDs for relates-to)
+        if (dependency.type === DT.RELATES_TO && blockedId !== dependency.blockedId) {
+            return {
+                ...dependency,
+                blockedId: blockedId,
+                blockerId: blockerId,
+            };
+        }
+        return dependency;
+    }
+    // --------------------------------------------------------------------------
+    // Remove Dependency
+    // --------------------------------------------------------------------------
+    /**
+     * Remove an existing dependency
+     *
+     * @param blockedId - Blocked element ID
+     * @param blockerId - Blocker element ID
+     * @param type - Dependency type
+     * @param actor - Entity performing the removal (for events)
+     * @returns true if dependency was removed
+     * @throws NotFoundError if dependency doesn't exist
+     */
+    removeDependency(blockedId, blockerId, type, actor) {
+        // Validate inputs
+        validateElementId(blockedId, 'blockedId');
+        validateElementId(blockerId, 'blockerId');
+        validateDependencyType(type);
+        validateEntityId(actor, 'actor');
+        // For relates-to, normalize the direction
+        let normalizedBlocked = blockedId;
+        let normalizedBlocker = blockerId;
+        if (type === DT.RELATES_TO) {
+            const normalized = normalizeRelatesToDependency(blockedId, blockerId);
+            normalizedBlocked = normalized.blockedId;
+            normalizedBlocker = normalized.blockerId;
+        }
+        // Delete from database
+        const result = this.db.run(`DELETE FROM dependencies WHERE blocked_id = ? AND blocker_id = ? AND type = ?`, [normalizedBlocked, normalizedBlocker, type]);
+        if (result.changes === 0) {
+            throw new NotFoundError(`Dependency not found: ${normalizedBlocked} -> ${normalizedBlocker} (${type})`, ErrorCode.DEPENDENCY_NOT_FOUND, { blockedId: normalizedBlocked, blockerId: normalizedBlocker, type });
+        }
+        return true;
+    }
+    // --------------------------------------------------------------------------
+    // Get Dependencies
+    // --------------------------------------------------------------------------
+    /**
+     * Get all dependencies where the given element is blocked
+     *
+     * @param blockedId - Blocked element ID
+     * @param type - Optional filter by dependency type
+     * @returns Array of dependencies
+     */
+    getDependencies(blockedId, type) {
+        validateElementId(blockedId, 'blockedId');
+        if (type !== undefined) {
+            validateDependencyType(type);
+        }
+        let sql = `SELECT blocked_id, blocker_id, type, created_at, created_by, metadata
+               FROM dependencies WHERE blocked_id = ?`;
+        const params = [blockedId];
+        if (type !== undefined) {
+            sql += ` AND type = ?`;
+            params.push(type);
+        }
+        sql += ` ORDER BY created_at`;
+        const rows = this.db.query(sql, params);
+        return rows.map((row) => this.rowToDependency(row));
+    }
+    /**
+     * Get all bidirectional relates-to dependencies for an element
+     * (since relates-to is stored with normalized IDs, we need to check both directions)
+     *
+     * @param elementId - Element ID
+     * @returns Array of relates-to dependencies
+     */
+    getRelatedTo(elementId) {
+        validateElementId(elementId, 'elementId');
+        const sql = `SELECT blocked_id, blocker_id, type, created_at, created_by, metadata
+                 FROM dependencies
+                 WHERE type = ? AND (blocked_id = ? OR blocker_id = ?)
+                 ORDER BY created_at`;
+        const rows = this.db.query(sql, [DT.RELATES_TO, elementId, elementId]);
+        return rows.map((row) => this.rowToDependency(row));
+    }
+    // --------------------------------------------------------------------------
+    // Get Dependents
+    // --------------------------------------------------------------------------
+    /**
+     * Get all elements that are blocked by a given blocker (reverse lookup)
+     *
+     * @param blockerId - Blocker element ID
+     * @param type - Optional filter by dependency type
+     * @returns Array of dependencies where blockerId is the blocker
+     */
+    getDependents(blockerId, type) {
+        validateElementId(blockerId, 'blockerId');
+        if (type !== undefined) {
+            validateDependencyType(type);
+        }
+        let sql = `SELECT blocked_id, blocker_id, type, created_at, created_by, metadata
+               FROM dependencies WHERE blocker_id = ?`;
+        const params = [blockerId];
+        if (type !== undefined) {
+            sql += ` AND type = ?`;
+            params.push(type);
+        }
+        sql += ` ORDER BY created_at`;
+        const rows = this.db.query(sql, params);
+        return rows.map((row) => this.rowToDependency(row));
+    }
+    // --------------------------------------------------------------------------
+    // Existence Check
+    // --------------------------------------------------------------------------
+    /**
+     * Check if a specific dependency exists
+     *
+     * @param blockedId - Blocked element ID
+     * @param blockerId - Blocker element ID
+     * @param type - Dependency type
+     * @returns true if dependency exists
+     */
+    exists(blockedId, blockerId, type) {
+        validateElementId(blockedId, 'blockedId');
+        validateElementId(blockerId, 'blockerId');
+        validateDependencyType(type);
+        // For relates-to, normalize the direction
+        let normalizedBlocked = blockedId;
+        let normalizedBlocker = blockerId;
+        if (type === DT.RELATES_TO) {
+            const normalized = normalizeRelatesToDependency(blockedId, blockerId);
+            normalizedBlocked = normalized.blockedId;
+            normalizedBlocker = normalized.blockerId;
+        }
+        const result = this.db.queryOne(`SELECT COUNT(*) as count FROM dependencies
+       WHERE blocked_id = ? AND blocker_id = ? AND type = ?`, [normalizedBlocked, normalizedBlocker, type]);
+        return (result?.count ?? 0) > 0;
+    }
+    // --------------------------------------------------------------------------
+    // Get Single Dependency
+    // --------------------------------------------------------------------------
+    /**
+     * Get a specific dependency by its composite key
+     *
+     * @param blockedId - Blocked element ID
+     * @param blockerId - Blocker element ID
+     * @param type - Dependency type
+     * @returns The dependency or undefined if not found
+     */
+    getDependency(blockedId, blockerId, type) {
+        validateElementId(blockedId, 'blockedId');
+        validateElementId(blockerId, 'blockerId');
+        validateDependencyType(type);
+        // For relates-to, normalize the direction
+        let normalizedBlocked = blockedId;
+        let normalizedBlocker = blockerId;
+        if (type === DT.RELATES_TO) {
+            const normalized = normalizeRelatesToDependency(blockedId, blockerId);
+            normalizedBlocked = normalized.blockedId;
+            normalizedBlocker = normalized.blockerId;
+        }
+        const row = this.db.queryOne(`SELECT blocked_id, blocker_id, type, created_at, created_by, metadata
+       FROM dependencies
+       WHERE blocked_id = ? AND blocker_id = ? AND type = ?`, [normalizedBlocked, normalizedBlocker, type]);
+        return row ? this.rowToDependency(row) : undefined;
+    }
+    // --------------------------------------------------------------------------
+    // Bulk Operations
+    // --------------------------------------------------------------------------
+    /**
+     * Get all dependencies for multiple source elements
+     *
+     * @param blockedIds - Array of blocked element IDs
+     * @param type - Optional filter by dependency type
+     * @returns Array of dependencies
+     */
+    getDependenciesForMany(blockedIds, type) {
+        if (blockedIds.length === 0) {
+            return [];
+        }
+        blockedIds.forEach((id, i) => validateElementId(id, `blockedIds[${i}]`));
+        if (type !== undefined) {
+            validateDependencyType(type);
+        }
+        const placeholders = blockedIds.map(() => '?').join(',');
+        let sql = `SELECT blocked_id, blocker_id, type, created_at, created_by, metadata
+               FROM dependencies WHERE blocked_id IN (${placeholders})`;
+        const params = [...blockedIds];
+        if (type !== undefined) {
+            sql += ` AND type = ?`;
+            params.push(type);
+        }
+        sql += ` ORDER BY blocked_id, created_at`;
+        const rows = this.db.query(sql, params);
+        return rows.map((row) => this.rowToDependency(row));
+    }
+    /**
+     * Remove all dependencies from a source element
+     *
+     * @param blockedId - Blocked element ID
+     * @param type - Optional filter by dependency type
+     * @returns Number of dependencies removed
+     */
+    removeAllDependencies(blockedId, type) {
+        validateElementId(blockedId, 'blockedId');
+        if (type !== undefined) {
+            validateDependencyType(type);
+        }
+        let sql = `DELETE FROM dependencies WHERE blocked_id = ?`;
+        const params = [blockedId];
+        if (type !== undefined) {
+            sql += ` AND type = ?`;
+            params.push(type);
+        }
+        const result = this.db.run(sql, params);
+        return result.changes;
+    }
+    /**
+     * Remove all dependencies to a target element (cascade on element delete)
+     *
+     * @param blockerId - Blocker element ID
+     * @returns Number of dependencies removed
+     */
+    removeAllDependents(blockerId) {
+        validateElementId(blockerId, 'blockerId');
+        const result = this.db.run(`DELETE FROM dependencies WHERE blocker_id = ?`, [blockerId]);
+        return result.changes;
+    }
+    // --------------------------------------------------------------------------
+    // Count Operations
+    // --------------------------------------------------------------------------
+    /**
+     * Count dependencies from a source element
+     */
+    countDependencies(blockedId, type) {
+        validateElementId(blockedId, 'blockedId');
+        if (type !== undefined) {
+            validateDependencyType(type);
+        }
+        let sql = `SELECT COUNT(*) as count FROM dependencies WHERE blocked_id = ?`;
+        const params = [blockedId];
+        if (type !== undefined) {
+            sql += ` AND type = ?`;
+            params.push(type);
+        }
+        const result = this.db.queryOne(sql, params);
+        return result?.count ?? 0;
+    }
+    /**
+     * Count dependents of a target element
+     */
+    countDependents(blockerId, type) {
+        validateElementId(blockerId, 'blockerId');
+        if (type !== undefined) {
+            validateDependencyType(type);
+        }
+        let sql = `SELECT COUNT(*) as count FROM dependencies WHERE blocker_id = ?`;
+        const params = [blockerId];
+        if (type !== undefined) {
+            sql += ` AND type = ?`;
+            params.push(type);
+        }
+        const result = this.db.queryOne(sql, params);
+        return result?.count ?? 0;
+    }
+    // --------------------------------------------------------------------------
+    // Cycle Detection
+    // --------------------------------------------------------------------------
+    /**
+     * Check if adding a dependency would create a cycle
+     *
+     * Uses BFS traversal from target to check if source is reachable
+     * through existing blocking dependencies. Only blocking dependency
+     * types participate in cycle detection (blocks, parent-child, awaits).
+     *
+     * The relates-to type is excluded because it's bidirectional by design.
+     *
+     * @param blockedId - The blocked element of the proposed dependency
+     * @param blockerId - The blocker element of the proposed dependency
+     * @param type - The type of dependency being added
+     * @param config - Optional configuration for cycle detection
+     * @returns CycleDetectionResult with cycle status and details
+     */
+    detectCycle(blockedId, blockerId, type, config = DEFAULT_CYCLE_DETECTION_CONFIG) {
+        validateElementId(blockedId, 'blockedId');
+        validateElementId(blockerId, 'blockerId');
+        validateDependencyType(type);
+        // Non-blocking types don't participate in cycle detection
+        if (!participatesInCycleDetection(type)) {
+            return {
+                hasCycle: false,
+                nodesVisited: 0,
+                depthLimitReached: false,
+            };
+        }
+        // BFS from blocker to see if we can reach blockedId
+        const visited = new Set();
+        const queue = [
+            { elementId: blockerId, depth: 0, path: [blockerId] },
+        ];
+        while (queue.length > 0) {
+            const current = queue.shift();
+            // Check depth limit
+            if (current.depth >= config.maxDepth) {
+                return {
+                    hasCycle: false,
+                    nodesVisited: visited.size,
+                    depthLimitReached: true,
+                };
+            }
+            // Skip already visited nodes
+            if (visited.has(current.elementId)) {
+                continue;
+            }
+            visited.add(current.elementId);
+            // Found the blocked element - cycle detected!
+            if (current.elementId === blockedId) {
+                return {
+                    hasCycle: true,
+                    cyclePath: [...current.path, blockedId],
+                    nodesVisited: visited.size,
+                    depthLimitReached: false,
+                };
+            }
+            // Get all blocking dependencies from this element
+            const blockingDeps = this.getBlockingDependenciesFrom(current.elementId);
+            for (const dep of blockingDeps) {
+                if (!visited.has(dep.blockerId)) {
+                    queue.push({
+                        elementId: dep.blockerId,
+                        depth: current.depth + 1,
+                        path: [...current.path, dep.blockerId],
+                    });
+                }
+            }
+        }
+        return {
+            hasCycle: false,
+            nodesVisited: visited.size,
+            depthLimitReached: false,
+        };
+    }
+    /**
+     * Check if adding a dependency would create a cycle and throw if so
+     *
+     * @param blockedId - The blocked element of the proposed dependency
+     * @param blockerId - The blocker element of the proposed dependency
+     * @param type - The type of dependency being added
+     * @param config - Optional configuration for cycle detection
+     * @throws ConflictError if a cycle would be created
+     */
+    checkForCycle(blockedId, blockerId, type, config) {
+        const result = this.detectCycle(blockedId, blockerId, type, config);
+        if (result.hasCycle) {
+            const cyclePath = result.cyclePath?.join(' -> ') ?? `${blockerId} -> ... -> ${blockedId}`;
+            throw new ConflictError(`Adding dependency would create a cycle: ${cyclePath}`, ErrorCode.CYCLE_DETECTED, {
+                blockedId,
+                blockerId,
+                dependencyType: type,
+                cyclePath: result.cyclePath,
+            });
+        }
+    }
+    /**
+     * Get all blocking dependencies from an element
+     * (internal helper for cycle detection)
+     */
+    getBlockingDependenciesFrom(elementId) {
+        const sql = `SELECT blocked_id, blocker_id, type, created_at, created_by, metadata
+                 FROM dependencies
+                 WHERE blocked_id = ? AND type IN (?, ?, ?)
+                 ORDER BY created_at`;
+        const rows = this.db.query(sql, [
+            elementId,
+            DT.BLOCKS,
+            DT.PARENT_CHILD,
+            DT.AWAITS,
+        ]);
+        return rows.map((row) => this.rowToDependency(row));
+    }
+    // --------------------------------------------------------------------------
+    // Private Helpers
+    // --------------------------------------------------------------------------
+    /**
+     * Convert a database row to a Dependency object
+     */
+    rowToDependency(row) {
+        const metadata = row.metadata ? JSON.parse(row.metadata) : {};
+        return {
+            blockedId: row.blocked_id,
+            blockerId: row.blocker_id,
+            type: row.type,
+            createdAt: row.created_at,
+            createdBy: row.created_by,
+            metadata,
+        };
+    }
+}
+// ============================================================================
+// Event Creation Helpers
+// ============================================================================
+/**
+ * Create a dependency_added event
+ *
+ * Use this to create an audit event when a dependency is added.
+ * The event should be persisted by an EventService.
+ *
+ * @param dependency - The dependency that was added
+ * @returns An EventWithoutId ready to be persisted
+ */
+export function createDependencyAddedEvent(dependency) {
+    return createEvent({
+        elementId: dependency.blockedId,
+        eventType: EventType.DEPENDENCY_ADDED,
+        actor: dependency.createdBy,
+        oldValue: null,
+        newValue: {
+            blockedId: dependency.blockedId,
+            blockerId: dependency.blockerId,
+            type: dependency.type,
+            metadata: dependency.metadata,
+        },
+    });
+}
+/**
+ * Create a dependency_removed event
+ *
+ * Use this to create an audit event when a dependency is removed.
+ * The event should be persisted by an EventService.
+ *
+ * @param dependency - The dependency that was removed
+ * @param actor - The entity that removed the dependency
+ * @returns An EventWithoutId ready to be persisted
+ */
+export function createDependencyRemovedEvent(dependency, actor) {
+    return createEvent({
+        elementId: dependency.blockedId,
+        eventType: EventType.DEPENDENCY_REMOVED,
+        actor,
+        oldValue: {
+            blockedId: dependency.blockedId,
+            blockerId: dependency.blockerId,
+            type: dependency.type,
+            metadata: dependency.metadata,
+        },
+        newValue: null,
+    });
+}
+// ============================================================================
+// Factory Function
+// ============================================================================
+/**
+ * Create a new DependencyService instance
+ */
+export function createDependencyService(db) {
+    return new DependencyService(db);
+}
+//# sourceMappingURL=dependency.js.map

package/dist/services/dependency.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency.js","sourceRoot":"","sources":["../../src/services/dependency.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAWH,OAAO,EACL,gBAAgB,EAChB,sBAAsB,EACtB,iBAAiB,EACjB,gBAAgB,EAChB,cAAc,IAAI,EAAE,EACpB,4BAA4B,EAC5B,4BAA4B,EAC5B,SAAS,EACT,WAAW,EACX,aAAa,EACb,aAAa,EACb,SAAS,GACV,MAAM,kBAAkB,CAAC;AA8B1B;;GAEG;AACH,MAAM,CAAC,MAAM,8BAA8B,GAAyB;IAClE,QAAQ,EAAE,GAAG;CACd,CAAC;AAgBF,+EAA+E;AAC/E,0BAA0B;AAC1B,+EAA+E;AAE/E;;GAEG;AACH,MAAM,OAAO,iBAAiB;IACC;IAA7B,YAA6B,EAAkB;QAAlB,OAAE,GAAF,EAAE,CAAgB;IAAG,CAAC;IAEnD,6EAA6E;IAC7E,wBAAwB;IACxB,6EAA6E;IAE7E;;;OAGG;IACH,UAAU;QACR,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC;;;;;;;;;;KAUZ,CAAC,CAAC;QAEH,uCAAuC;QACvC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC;;KAEZ,CAAC,CAAC;QACH,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC;;KAEZ,CAAC,CAAC;QACH,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC;;KAEZ,CAAC,CAAC;IACL,CAAC;IAED,6EAA6E;IAC7E,iBAAiB;IACjB,6EAA6E;IAE7E;;;;;;;;OAQG;IACH,aAAa,CACX,KAA4B,EAC5B,WAAkC;QAElC,qCAAqC;QACrC,MAAM,UAAU,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;QAE3C,2EAA2E;QAC3E,IAAI,SAAS,GAAG,UAAU,CAAC,SAAS,CAAC;QACrC,IAAI,SAAS,GAAG,UAAU,CAAC,SAAS,CAAC;QACrC,IAAI,UAAU,CAAC,IAAI,KAAK,EAAE,CAAC,UAAU,EAAE,CAAC;YACtC,MAAM,UAAU,GAAG,4BAA4B,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YACtE,SAAS,GAAG,UAAU,CAAC,SAAS,CAAC;YACjC,SAAS,GAAG,UAAU,CAAC,SAAS,CAAC;QACnC,CAAC;QAED,oEAAoE;QACpE,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,SAAS,EAAE,UAAU,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;QAEvE,qBAAqB;QACrB,MAAM,YAAY,GAChB,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,GAAG,CAAC;YACzC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,QAAQ,CAAC;YACrC,CAAC,CAAC,IAAI,CAAC;QAEX,uBAAuB;QACvB,IAAI,CAAC;YACH,IAAI,CAAC,EAAE,CAAC,GAAG,CACT;mCAC2B,EAC3B;gBACE,SAAS;gBACT,SAAS;gBACT,UAAU,CAAC,IAAI;gBACf,UAAU,CAAC,SAAS;gBACpB,UAAU,CAAC,SAAS;gBACpB,YAAY;aACb,CACF,CAAC;QACJ,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,gCAAgC;YAChC,IAAI,KAAK,YAAY,KAAK,IAAI,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,0BAA0B,CAAC,EAAE,CAAC;gBACjF,MAAM,IAAI,aAAa,CACrB,8BAA8B,SAAS,OAAO,SAAS,KAAK,UAAU,CAAC,IAAI,GAAG,EAC9E,SAAS,CAAC,oBAAoB,EAC9B,EAAE,SAAS,EAAE,SAAS,EAAE,IAAI,EAAE,UAAU,CAAC,IAAI,EAAE,CAChD,CAAC;YACJ,CAAC;YACD,MAAM,KAAK,CAAC;QACd,CAAC;QAED,yEAAyE;QACzE,IAAI,UAAU,CAAC,IAAI,KAAK,EAAE,CAAC,UAAU,IAAI,SAAS,KAAK,UAAU,CAAC,SAAS,EAAE,CAAC;YAC5E,OAAO;gBACL,GAAG,UAAU;gBACb,SAAS,EAAE,SAAsB;gBACjC,SAAS,EAAE,SAAsB;aAClC,CAAC;QACJ,CAAC;QAED,OAAO,UAAU,CAAC;IACpB,CAAC;IAED,6EAA6E;IAC7E,oBAAoB;IACpB,6EAA6E;IAE7E;;;;;;;;;OASG;IACH,gBAAgB,CACd,SAAoB,EACpB,SAAoB,EACpB,IAAoB,EACpB,KAAe;QAEf,kBAAkB;QAClB,iBAAiB,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;QAC1C,iBAAiB,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;QAC1C,sBAAsB,CAAC,IAAI,CAAC,CAAC;QAC7B,gBAAgB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAEjC,0CAA0C;QAC1C,IAAI,iBAAiB,GAAG,SAAS,CAAC;QAClC,IAAI,iBAAiB,GAAG,SAAS,CAAC;QAClC,IAAI,IAAI,KAAK,EAAE,CAAC,UAAU,EAAE,CAAC;YAC3B,MAAM,UAAU,GAAG,4BAA4B,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YACtE,iBAAiB,GAAG,UAAU,CAAC,SAAsB,CAAC;YACtD,iBAAiB,GAAG,UAAU,CAAC,SAAsB,CAAC;QACxD,CAAC;QAED,uBAAuB;QACvB,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CACxB,+EAA+E,EAC/E,CAAC,iBAAiB,EAAE,iBAAiB,EAAE,IAAI,CAAC,CAC7C,CAAC;QAEF,IAAI,MAAM,CAAC,OAAO,KAAK,CAAC,EAAE,CAAC;YACzB,MAAM,IAAI,aAAa,CACrB,yBAAyB,iBAAiB,OAAO,iBAAiB,KAAK,IAAI,GAAG,EAC9E,SAAS,CAAC,oBAAoB,EAC9B,EAAE,SAAS,EAAE,iBAAiB,EAAE,SAAS,EAAE,iBAAiB,EAAE,IAAI,EAAE,CACrE,CAAC;QACJ,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED,6EAA6E;IAC7E,mBAAmB;IACnB,6EAA6E;IAE7E;;;;;;OAMG;IACH,eAAe,CAAC,SAAoB,EAAE,IAAqB;QACzD,iBAAiB,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;QAC1C,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,sBAAsB,CAAC,IAAI,CAAC,CAAC;QAC/B,CAAC;QAED,IAAI,GAAG,GAAG;sDACwC,CAAC;QACnD,MAAM,MAAM,GAAc,CAAC,SAAS,CAAC,CAAC;QAEtC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,GAAG,IAAI,eAAe,CAAC;YACvB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpB,CAAC;QAED,GAAG,IAAI,sBAAsB,CAAC;QAE9B,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,KAAK,CAAgB,GAAG,EAAE,MAAM,CAAC,CAAC;QACvD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC;IACtD,CAAC;IAED;;;;;;OAMG;IACH,YAAY,CAAC,SAAoB;QAC/B,iBAAiB,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;QAE1C,MAAM,GAAG,GAAG;;;qCAGqB,CAAC;QAElC,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,KAAK,CAAgB,GAAG,EAAE,CAAC,EAAE,CAAC,UAAU,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC,CAAC;QACtF,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC;IACtD,CAAC;IAED,6EAA6E;IAC7E,iBAAiB;IACjB,6EAA6E;IAE7E;;;;;;OAMG;IACH,aAAa,CAAC,SAAoB,EAAE,IAAqB;QACvD,iBAAiB,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;QAC1C,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,sBAAsB,CAAC,IAAI,CAAC,CAAC;QAC/B,CAAC;QAED,IAAI,GAAG,GAAG;sDACwC,CAAC;QACnD,MAAM,MAAM,GAAc,CAAC,SAAS,CAAC,CAAC;QAEtC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,GAAG,IAAI,eAAe,CAAC;YACvB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpB,CAAC;QAED,GAAG,IAAI,sBAAsB,CAAC;QAE9B,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,KAAK,CAAgB,GAAG,EAAE,MAAM,CAAC,CAAC;QACvD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC;IACtD,CAAC;IAED,6EAA6E;IAC7E,kBAAkB;IAClB,6EAA6E;IAE7E;;;;;;;OAOG;IACH,MAAM,CAAC,SAAoB,EAAE,SAAoB,EAAE,IAAoB;QACrE,iBAAiB,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;QAC1C,iBAAiB,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;QAC1C,sBAAsB,CAAC,IAAI,CAAC,CAAC;QAE7B,0CAA0C;QAC1C,IAAI,iBAAiB,GAAG,SAAS,CAAC;QAClC,IAAI,iBAAiB,GAAG,SAAS,CAAC;QAClC,IAAI,IAAI,KAAK,EAAE,CAAC,UAAU,EAAE,CAAC;YAC3B,MAAM,UAAU,GAAG,4BAA4B,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YACtE,iBAAiB,GAAG,UAAU,CAAC,SAAsB,CAAC;YACtD,iBAAiB,GAAG,UAAU,CAAC,SAAsB,CAAC;QACxD,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,QAAQ,CAC7B;4DACsD,EACtD,CAAC,iBAAiB,EAAE,iBAAiB,EAAE,IAAI,CAAC,CAC7C,CAAC;QAEF,OAAO,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IAClC,CAAC;IAED,6EAA6E;IAC7E,wBAAwB;IACxB,6EAA6E;IAE7E;;;;;;;OAOG;IACH,aAAa,CACX,SAAoB,EACpB,SAAoB,EACpB,IAAoB;QAEpB,iBAAiB,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;QAC1C,iBAAiB,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;QAC1C,sBAAsB,CAAC,IAAI,CAAC,CAAC;QAE7B,0CAA0C;QAC1C,IAAI,iBAAiB,GAAG,SAAS,CAAC;QAClC,IAAI,iBAAiB,GAAG,SAAS,CAAC;QAClC,IAAI,IAAI,KAAK,EAAE,CAAC,UAAU,EAAE,CAAC;YAC3B,MAAM,UAAU,GAAG,4BAA4B,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YACtE,iBAAiB,GAAG,UAAU,CAAC,SAAsB,CAAC;YACtD,iBAAiB,GAAG,UAAU,CAAC,SAAsB,CAAC;QACxD,CAAC;QAED,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,QAAQ,CAC1B;;4DAEsD,EACtD,CAAC,iBAAiB,EAAE,iBAAiB,EAAE,IAAI,CAAC,CAC7C,CAAC;QAEF,OAAO,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACrD,CAAC;IAED,6EAA6E;IAC7E,kBAAkB;IAClB,6EAA6E;IAE7E;;;;;;OAMG;IACH,sBAAsB,CAAC,UAAuB,EAAE,IAAqB;QACnE,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,UAAU,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,iBAAiB,CAAC,EAAE,EAAE,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC;QACzE,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,sBAAsB,CAAC,IAAI,CAAC,CAAC;QAC/B,CAAC;QAED,MAAM,YAAY,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACzD,IAAI,GAAG,GAAG;wDAC0C,YAAY,GAAG,CAAC;QACpE,MAAM,MAAM,GAAc,CAAC,GAAG,UAAU,CAAC,CAAC;QAE1C,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,GAAG,IAAI,eAAe,CAAC;YACvB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpB,CAAC;QAED,GAAG,IAAI,kCAAkC,CAAC;QAE1C,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,KAAK,CAAgB,GAAG,EAAE,MAAM,CAAC,CAAC;QACvD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC;IACtD,CAAC;IAED;;;;;;OAMG;IACH,qBAAqB,CAAC,SAAoB,EAAE,IAAqB;QAC/D,iBAAiB,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;QAC1C,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,sBAAsB,CAAC,IAAI,CAAC,CAAC;QAC/B,CAAC;QAED,IAAI,GAAG,GAAG,+CAA+C,CAAC;QAC1D,MAAM,MAAM,GAAc,CAAC,SAAS,CAAC,CAAC;QAEtC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,GAAG,IAAI,eAAe,CAAC;YACvB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpB,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QACxC,OAAO,MAAM,CAAC,OAAO,CAAC;IACxB,CAAC;IAED;;;;;OAKG;IACH,mBAAmB,CAAC,SAAoB;QACtC,iBAAiB,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;QAE1C,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CACxB,+CAA+C,EAC/C,CAAC,SAAS,CAAC,CACZ,CAAC;QACF,OAAO,MAAM,CAAC,OAAO,CAAC;IACxB,CAAC;IAED,6EAA6E;IAC7E,mBAAmB;IACnB,6EAA6E;IAE7E;;OAEG;IACH,iBAAiB,CAAC,SAAoB,EAAE,IAAqB;QAC3D,iBAAiB,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;QAC1C,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,sBAAsB,CAAC,IAAI,CAAC,CAAC;QAC/B,CAAC;QAED,IAAI,GAAG,GAAG,iEAAiE,CAAC;QAC5E,MAAM,MAAM,GAAc,CAAC,SAAS,CAAC,CAAC;QAEtC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,GAAG,IAAI,eAAe,CAAC;YACvB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpB,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAoB,GAAG,EAAE,MAAM,CAAC,CAAC;QAChE,OAAO,MAAM,EAAE,KAAK,IAAI,CAAC,CAAC;IAC5B,CAAC;IAED;;OAEG;IACH,eAAe,CAAC,SAAoB,EAAE,IAAqB;QACzD,iBAAiB,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;QAC1C,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,sBAAsB,CAAC,IAAI,CAAC,CAAC;QAC/B,CAAC;QAED,IAAI,GAAG,GAAG,iEAAiE,CAAC;QAC5E,MAAM,MAAM,GAAc,CAAC,SAAS,CAAC,CAAC;QAEtC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,GAAG,IAAI,eAAe,CAAC;YACvB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpB,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAoB,GAAG,EAAE,MAAM,CAAC,CAAC;QAChE,OAAO,MAAM,EAAE,KAAK,IAAI,CAAC,CAAC;IAC5B,CAAC;IAED,6EAA6E;IAC7E,kBAAkB;IAClB,6EAA6E;IAE7E;;;;;;;;;;;;;;OAcG;IACH,WAAW,CACT,SAAoB,EACpB,SAAoB,EACpB,IAAoB,EACpB,SAA+B,8BAA8B;QAE7D,iBAAiB,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;QAC1C,iBAAiB,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;QAC1C,sBAAsB,CAAC,IAAI,CAAC,CAAC;QAE7B,0DAA0D;QAC1D,IAAI,CAAC,4BAA4B,CAAC,IAAI,CAAC,EAAE,CAAC;YACxC,OAAO;gBACL,QAAQ,EAAE,KAAK;gBACf,YAAY,EAAE,CAAC;gBACf,iBAAiB,EAAE,KAAK;aACzB,CAAC;QACJ,CAAC;QAED,oDAAoD;QACpD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAiE;YAC1E,EAAE,SAAS,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,SAAS,CAAC,EAAE;SACtD,CAAC;QAEF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAE/B,oBAAoB;YACpB,IAAI,OAAO,CAAC,KAAK,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;gBACrC,OAAO;oBACL,QAAQ,EAAE,KAAK;oBACf,YAAY,EAAE,OAAO,CAAC,IAAI;oBAC1B,iBAAiB,EAAE,IAAI;iBACxB,CAAC;YACJ,CAAC;YAED,6BAA6B;YAC7B,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;gBACnC,SAAS;YACX,CAAC;YACD,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YAE/B,8CAA8C;YAC9C,IAAI,OAAO,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBACpC,OAAO;oBACL,QAAQ,EAAE,IAAI;oBACd,SAAS,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,SAAS,CAAC;oBACvC,YAAY,EAAE,OAAO,CAAC,IAAI;oBAC1B,iBAAiB,EAAE,KAAK;iBACzB,CAAC;YACJ,CAAC;YAED,kDAAkD;YAClD,MAAM,YAAY,GAAG,IAAI,CAAC,2BAA2B,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YACzE,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;gBAC/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;oBAChC,KAAK,CAAC,IAAI,CAAC;wBACT,SAAS,EAAE,GAAG,CAAC,SAAS;wBACxB,KAAK,EAAE,OAAO,CAAC,KAAK,GAAG,CAAC;wBACxB,IAAI,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,SAAS,CAAC;qBACvC,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO;YACL,QAAQ,EAAE,KAAK;YACf,YAAY,EAAE,OAAO,CAAC,IAAI;YAC1B,iBAAiB,EAAE,KAAK;SACzB,CAAC;IACJ,CAAC;IAED;;;;;;;;OAQG;IACH,aAAa,CACX,SAAoB,EACpB,SAAoB,EACpB,IAAoB,EACpB,MAA6B;QAE7B,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;QAEpE,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;YACpB,MAAM,SAAS,GAAG,MAAM,CAAC,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,SAAS,cAAc,SAAS,EAAE,CAAC;YAC1F,MAAM,IAAI,aAAa,CACrB,2CAA2C,SAAS,EAAE,EACtD,SAAS,CAAC,cAAc,EACxB;gBACE,SAAS;gBACT,SAAS;gBACT,cAAc,EAAE,IAAI;gBACpB,SAAS,EAAE,MAAM,CAAC,SAAS;aAC5B,CACF,CAAC;QACJ,CAAC;IACH,CAAC;IAED;;;OAGG;IACK,2BAA2B,CAAC,SAAoB;QACtD,MAAM,GAAG,GAAG;;;qCAGqB,CAAC;QAElC,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,KAAK,CAAgB,GAAG,EAAE;YAC7C,SAAS;YACT,EAAE,CAAC,MAAM;YACT,EAAE,CAAC,YAAY;YACf,EAAE,CAAC,MAAM;SACV,CAAC,CAAC;QACH,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC;IACtD,CAAC;IAED,6EAA6E;IAC7E,kBAAkB;IAClB,6EAA6E;IAE7E;;OAEG;IACK,eAAe,CAAC,GAAkB;QACxC,MAAM,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAE9D,OAAO;YACL,SAAS,EAAE,GAAG,CAAC,UAAuB;YACtC,SAAS,EAAE,GAAG,CAAC,UAAuB;YACtC,IAAI,EAAE,GAAG,CAAC,IAAsB;YAChC,SAAS,EAAE,GAAG,CAAC,UAAU;YACzB,SAAS,EAAE,GAAG,CAAC,UAAsB;YACrC,QAAQ;SACT,CAAC;IACJ,CAAC;CACF;AAED,+EAA+E;AAC/E,yBAAyB;AACzB,+EAA+E;AAE/E;;;;;;;;GAQG;AACH,MAAM,UAAU,0BAA0B,CAAC,UAAsB;IAC/D,OAAO,WAAW,CAAC;QACjB,SAAS,EAAE,UAAU,CAAC,SAAS;QAC/B,SAAS,EAAE,SAAS,CAAC,gBAAgB;QACrC,KAAK,EAAE,UAAU,CAAC,SAAS;QAC3B,QAAQ,EAAE,IAAI;QACd,QAAQ,EAAE;YACR,SAAS,EAAE,UAAU,CAAC,SAAS;YAC/B,SAAS,EAAE,UAAU,CAAC,SAAS;YAC/B,IAAI,EAAE,UAAU,CAAC,IAAI;YACrB,QAAQ,EAAE,UAAU,CAAC,QAAQ;SAC9B;KACF,CAAC,CAAC;AACL,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,4BAA4B,CAC1C,UAAsB,EACtB,KAAe;IAEf,OAAO,WAAW,CAAC;QACjB,SAAS,EAAE,UAAU,CAAC,SAAS;QAC/B,SAAS,EAAE,SAAS,CAAC,kBAAkB;QACvC,KAAK;QACL,QAAQ,EAAE;YACR,SAAS,EAAE,UAAU,CAAC,SAAS;YAC/B,SAAS,EAAE,UAAU,CAAC,SAAS;YAC/B,IAAI,EAAE,UAAU,CAAC,IAAI;YACrB,QAAQ,EAAE,UAAU,CAAC,QAAQ;SAC9B;QACD,QAAQ,EAAE,IAAI;KACf,CAAC,CAAC;AACL,CAAC;AAED,+EAA+E;AAC/E,mBAAmB;AACnB,+EAA+E;AAE/E;;GAEG;AACH,MAAM,UAAU,uBAAuB,CAAC,EAAkB;IACxD,OAAO,IAAI,iBAAiB,CAAC,EAAE,CAAC,CAAC;AACnC,CAAC"}

package/dist/services/embeddings/fusion.d.ts

@@ -0,0 +1,33 @@
+/**
+ * Reciprocal Rank Fusion (RRF)
+ *
+ * Combines multiple ranked result sets into a single fused ranking.
+ * Used to merge FTS5 (keyword) and vector (semantic) search results.
+ *
+ * Algorithm: score(d) = Σ 1/(k + rank_i(d)) for each ranking i
+ * where k is a smoothing constant (default: 60)
+ */
+/**
+ * A ranked result set identified by document ID.
+ */
+export interface RankedResult {
+    documentId: string;
+    rank: number;
+}
+/**
+ * Fused result with combined RRF score.
+ */
+export interface FusedResult {
+    documentId: string;
+    score: number;
+}
+/**
+ * Combine multiple ranked result sets using Reciprocal Rank Fusion.
+ *
+ * @param rankings - Array of ranked result sets (each sorted by relevance)
+ * @param k - Smoothing constant (default: 60, standard value from literature)
+ * @param limit - Maximum results to return
+ * @returns Fused results sorted by combined score (descending)
+ */
+export declare function reciprocalRankFusion(rankings: RankedResult[][], k?: number, limit?: number): FusedResult[];
+//# sourceMappingURL=fusion.d.ts.map

package/dist/services/embeddings/fusion.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"fusion.d.ts","sourceRoot":"","sources":["../../../src/services/embeddings/fusion.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,UAAU,EAAE,MAAM,CAAC;IACnB,IAAI,EAAE,MAAM,CAAC;CACd;AAED;;GAEG;AACH,MAAM,WAAW,WAAW;IAC1B,UAAU,EAAE,MAAM,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;CACf;AAED;;;;;;;GAOG;AACH,wBAAgB,oBAAoB,CAClC,QAAQ,EAAE,YAAY,EAAE,EAAE,EAC1B,CAAC,GAAE,MAAW,EACd,KAAK,CAAC,EAAE,MAAM,GACb,WAAW,EAAE,CAkBf"}

package/dist/services/embeddings/fusion.js

@@ -0,0 +1,34 @@
+/**
+ * Reciprocal Rank Fusion (RRF)
+ *
+ * Combines multiple ranked result sets into a single fused ranking.
+ * Used to merge FTS5 (keyword) and vector (semantic) search results.
+ *
+ * Algorithm: score(d) = Σ 1/(k + rank_i(d)) for each ranking i
+ * where k is a smoothing constant (default: 60)
+ */
+/**
+ * Combine multiple ranked result sets using Reciprocal Rank Fusion.
+ *
+ * @param rankings - Array of ranked result sets (each sorted by relevance)
+ * @param k - Smoothing constant (default: 60, standard value from literature)
+ * @param limit - Maximum results to return
+ * @returns Fused results sorted by combined score (descending)
+ */
+export function reciprocalRankFusion(rankings, k = 60, limit) {
+    // Accumulate RRF scores per document
+    const scores = new Map();
+    for (const ranking of rankings) {
+        for (const result of ranking) {
+            const rrfScore = 1 / (k + result.rank);
+            const current = scores.get(result.documentId) ?? 0;
+            scores.set(result.documentId, current + rrfScore);
+        }
+    }
+    // Sort by score descending
+    const fused = Array.from(scores.entries())
+        .map(([documentId, score]) => ({ documentId, score }))
+        .sort((a, b) => b.score - a.score);
+    return limit ? fused.slice(0, limit) : fused;
+}
+//# sourceMappingURL=fusion.js.map

package/dist/services/embeddings/fusion.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fusion.js","sourceRoot":"","sources":["../../../src/services/embeddings/fusion.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAkBH;;;;;;;GAOG;AACH,MAAM,UAAU,oBAAoB,CAClC,QAA0B,EAC1B,IAAY,EAAE,EACd,KAAc;IAEd,qCAAqC;IACrC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEzC,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;YACvC,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;YACnD,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,EAAE,OAAO,GAAG,QAAQ,CAAC,CAAC;QACpD,CAAC;IACH,CAAC;IAED,2BAA2B;IAC3B,MAAM,KAAK,GAAkB,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;SACtD,GAAG,CAAC,CAAC,CAAC,UAAU,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC;SACrD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IAErC,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;AAC/C,CAAC"}

package/dist/services/embeddings/index.d.ts

@@ -0,0 +1,12 @@
+/**
+ * Embeddings Module
+ *
+ * Public API for document embedding services: semantic search,
+ * hybrid search (RRF fusion), and local embedding providers.
+ */
+export { EmbeddingService } from './service.js';
+export { LocalEmbeddingProvider } from './local-provider.js';
+export { reciprocalRankFusion } from './fusion.js';
+export type { RankedResult, FusedResult } from './fusion.js';
+export type { EmbeddingProvider, StoredEmbedding, SemanticSearchResult, EmbeddingServiceConfig, } from './types.js';
+//# sourceMappingURL=index.d.ts.map