causantic 0.2.0 → 0.3.0

package/dist/retrieval/traverser.d.ts

@@ -1,66 +0,0 @@
-/**
- * Graph traversal with decay-weighted edges.
- *
- * Uses sum-product rules analogous to Feynman path integrals:
- * - Product: Weights multiply along each path
- * - Sum: Multiple paths to the same node accumulate
- * - Convergence: Cycles naturally attenuate (no explicit detection needed)
- *
- * Since edge weights are in (0,1], path products decrease with length.
- * The minWeight threshold prunes paths that have attenuated below relevance,
- * which naturally handles cycle convergence.
- */
-import type { DecayModelConfig } from '../core/decay-types.js';
-import type { WeightedChunk, TraversalResult, StoredChunk } from '../storage/types.js';
-import type { VectorClock } from '../temporal/vector-clock.js';
-/**
- * Options for graph traversal.
- * Direction-specific decay curves are automatically applied:
- * - Backward: Linear (dies@10) for 4-20 hop range
- * - Forward: Delayed linear (5h, dies@20) for 1-20 hop range
- */
-export interface TraversalOptions {
-    /** Maximum traversal depth. Default: from config. */
-    maxDepth?: number;
-    /** Minimum weight threshold. Default: from config. */
-    minWeight?: number;
-    /** Time-based decay configuration (fallback for edges without vector clocks). */
-    decayConfig?: DecayModelConfig;
-    /** Traversal direction. Determines which decay curve is used. */
-    direction: 'backward' | 'forward';
-    /** Reference clock for vector clock-based decay (optional). */
-    referenceClock?: VectorClock;
-}
-/**
- * Traverse the graph from a starting chunk using sum-product rules.
- *
- * Weights multiply along paths (product) and accumulate when multiple
- * paths reach the same node (sum). Cycles are handled naturally by
- * convergence — since weights are <1, cyclic paths attenuate geometrically
- * and are pruned when they fall below minWeight.
- *
- * @param startChunkId - Starting chunk ID
- * @param queryTime - Query time in milliseconds (for decay calculation)
- * @param options - Traversal options
- * @returns Traversal result with weighted chunks
- */
-export declare function traverse(startChunkId: string, queryTime: number, options: TraversalOptions): Promise<TraversalResult>;
-/**
- * Traverse from multiple starting points and merge results.
- * Useful for starting from vector search results.
- */
-export declare function traverseMultiple(startChunkIds: string[], startWeights: number[], queryTime: number, options: TraversalOptions): Promise<TraversalResult>;
-/**
- * Get chunks with their content from traversal results.
- */
-export declare function resolveChunks(traversalResult: TraversalResult): Array<{
-    chunk: StoredChunk;
-    weight: number;
-    depth: number;
-}>;
-/**
- * Deduplicate and re-rank weighted chunks.
- * Combines duplicate entries and applies additional scoring.
- */
-export declare function dedupeAndRank(chunks: WeightedChunk[]): WeightedChunk[];
-//# sourceMappingURL=traverser.d.ts.map

package/dist/retrieval/traverser.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"traverser.d.ts","sourceRoot":"","sources":["../../src/retrieval/traverser.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAKH,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAC/D,OAAO,KAAK,EAAE,aAAa,EAAE,eAAe,EAAY,WAAW,EAAE,MAAM,qBAAqB,CAAC;AACjG,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,6BAA6B,CAAC;AAE/D;;;;;GAKG;AACH,MAAM,WAAW,gBAAgB;IAC/B,qDAAqD;IACrD,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,sDAAsD;IACtD,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,iFAAiF;IACjF,WAAW,CAAC,EAAE,gBAAgB,CAAC;IAC/B,iEAAiE;IACjE,SAAS,EAAE,UAAU,GAAG,SAAS,CAAC;IAClC,+DAA+D;IAC/D,cAAc,CAAC,EAAE,WAAW,CAAC;CAC9B;AAED;;;;;;;;;;;;GAYG;AACH,wBAAsB,QAAQ,CAC5B,YAAY,EAAE,MAAM,EACpB,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,gBAAgB,GACxB,OAAO,CAAC,eAAe,CAAC,CAyE1B;AAED;;;GAGG;AACH,wBAAsB,gBAAgB,CACpC,aAAa,EAAE,MAAM,EAAE,EACvB,YAAY,EAAE,MAAM,EAAE,EACtB,SAAS,EAAE,MAAM,EACjB,OAAO,EAAE,gBAAgB,GACxB,OAAO,CAAC,eAAe,CAAC,CA0C1B;AAED;;GAEG;AACH,wBAAgB,aAAa,CAC3B,eAAe,EAAE,eAAe,GAC/B,KAAK,CAAC;IAAE,KAAK,EAAE,WAAW,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC,CAe9D;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,MAAM,EAAE,aAAa,EAAE,GAAG,aAAa,EAAE,CAmBtE"}

package/dist/retrieval/traverser.js

@@ -1,160 +0,0 @@
-/**
- * Graph traversal with decay-weighted edges.
- *
- * Uses sum-product rules analogous to Feynman path integrals:
- * - Product: Weights multiply along each path
- * - Sum: Multiple paths to the same node accumulate
- * - Convergence: Cycles naturally attenuate (no explicit detection needed)
- *
- * Since edge weights are in (0,1], path products decrease with length.
- * The minWeight threshold prunes paths that have attenuated below relevance,
- * which naturally handles cycle convergence.
- */
-import { getWeightedEdges } from '../storage/edge-store.js';
-import { getChunkById } from '../storage/chunk-store.js';
-import { getConfig } from '../config/memory-config.js';
-/**
- * Traverse the graph from a starting chunk using sum-product rules.
- *
- * Weights multiply along paths (product) and accumulate when multiple
- * paths reach the same node (sum). Cycles are handled naturally by
- * convergence — since weights are <1, cyclic paths attenuate geometrically
- * and are pruned when they fall below minWeight.
- *
- * @param startChunkId - Starting chunk ID
- * @param queryTime - Query time in milliseconds (for decay calculation)
- * @param options - Traversal options
- * @returns Traversal result with weighted chunks
- */
-export async function traverse(startChunkId, queryTime, options) {
-    const config = getConfig();
-    const { maxDepth = config.maxTraversalDepth, minWeight = config.minSignalThreshold, direction, referenceClock, } = options;
-    // Select time-based decay config as fallback (for edges without vector clocks)
-    const decayConfig = options.decayConfig ?? (direction === 'backward' ? config.shortRangeDecay : config.forwardDecay);
-    // Accumulate weights across all paths (sum rule)
-    const accumulatedWeights = new Map();
-    const minDepths = new Map();
-    let pathsExplored = 0;
-    async function visit(chunkId, depth, pathWeight) {
-        // Prune paths that have attenuated below threshold (convergence criterion)
-        // Since edge weights are <1, cyclic paths naturally attenuate until pruned
-        if (pathWeight < minWeight)
-            return;
-        if (depth > maxDepth)
-            return;
-        pathsExplored++;
-        // Accumulate this path's weight contribution (sum rule)
-        const existingWeight = accumulatedWeights.get(chunkId) ?? 0;
-        accumulatedWeights.set(chunkId, existingWeight + pathWeight);
-        // Track minimum depth for reporting
-        const existingDepth = minDepths.get(chunkId) ?? Infinity;
-        minDepths.set(chunkId, Math.min(existingDepth, depth));
-        // Get weighted edges from this chunk
-        const edges = getWeightedEdges(chunkId, queryTime, decayConfig, direction, referenceClock);
-        for (const edge of edges) {
-            // Compute new path weight (product rule)
-            const newWeight = pathWeight * edge.weight;
-            // Recursively visit — cycles naturally attenuate via weight products <1
-            await visit(edge.targetChunkId, depth + 1, newWeight);
-        }
-    }
-    // Start traversal from the given chunk
-    await visit(startChunkId, 0, 1.0);
-    // Convert accumulated weights to results
-    const results = [];
-    for (const [chunkId, weight] of accumulatedWeights) {
-        if (chunkId !== startChunkId) { // Exclude start node from results
-            results.push({
-                chunkId,
-                weight,
-                depth: minDepths.get(chunkId) ?? 0,
-            });
-        }
-    }
-    // Sort by weight descending
-    results.sort((a, b) => b.weight - a.weight);
-    return {
-        chunks: results,
-        visited: pathsExplored,
-    };
-}
-/**
- * Traverse from multiple starting points and merge results.
- * Useful for starting from vector search results.
- */
-export async function traverseMultiple(startChunkIds, startWeights, queryTime, options) {
-    // Track all visited and accumulated weights
-    const globalWeights = new Map();
-    const globalDepths = new Map();
-    let totalVisited = 0;
-    for (let i = 0; i < startChunkIds.length; i++) {
-        const startId = startChunkIds[i];
-        const startWeight = startWeights[i] ?? 1.0;
-        // Adjust options with starting weight
-        const result = await traverse(startId, queryTime, options);
-        totalVisited += result.visited;
-        // Merge results, accumulating weights
-        for (const chunk of result.chunks) {
-            const scaledWeight = chunk.weight * startWeight;
-            const existingWeight = globalWeights.get(chunk.chunkId) ?? 0;
-            globalWeights.set(chunk.chunkId, existingWeight + scaledWeight);
-            // Keep minimum depth
-            const existingDepth = globalDepths.get(chunk.chunkId) ?? Infinity;
-            globalDepths.set(chunk.chunkId, Math.min(existingDepth, chunk.depth));
-        }
-    }
-    // Convert to array and sort
-    const chunks = [];
-    for (const [chunkId, weight] of globalWeights) {
-        chunks.push({
-            chunkId,
-            weight,
-            depth: globalDepths.get(chunkId) ?? 0,
-        });
-    }
-    chunks.sort((a, b) => b.weight - a.weight);
-    return {
-        chunks,
-        visited: totalVisited,
-    };
-}
-/**
- * Get chunks with their content from traversal results.
- */
-export function resolveChunks(traversalResult) {
-    const resolved = [];
-    for (const wc of traversalResult.chunks) {
-        const chunk = getChunkById(wc.chunkId);
-        if (chunk) {
-            resolved.push({
-                chunk,
-                weight: wc.weight,
-                depth: wc.depth,
-            });
-        }
-    }
-    return resolved;
-}
-/**
- * Deduplicate and re-rank weighted chunks.
- * Combines duplicate entries and applies additional scoring.
- */
-export function dedupeAndRank(chunks) {
-    const byId = new Map();
-    for (const chunk of chunks) {
-        const existing = byId.get(chunk.chunkId);
-        if (existing) {
-            // Combine weights (sum with diminishing returns)
-            existing.weight = existing.weight + chunk.weight * 0.5;
-            // Keep minimum depth
-            existing.depth = Math.min(existing.depth, chunk.depth);
-        }
-        else {
-            byId.set(chunk.chunkId, { ...chunk });
-        }
-    }
-    const deduped = Array.from(byId.values());
-    deduped.sort((a, b) => b.weight - a.weight);
-    return deduped;
-}
-//# sourceMappingURL=traverser.js.map

package/dist/retrieval/traverser.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"traverser.js","sourceRoot":"","sources":["../../src/retrieval/traverser.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC;AAC5D,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AACzD,OAAO,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AAwBvD;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,KAAK,UAAU,QAAQ,CAC5B,YAAoB,EACpB,SAAiB,EACjB,OAAyB;IAEzB,MAAM,MAAM,GAAG,SAAS,EAAE,CAAC;IAC3B,MAAM,EACJ,QAAQ,GAAG,MAAM,CAAC,iBAAiB,EACnC,SAAS,GAAG,MAAM,CAAC,kBAAkB,EACrC,SAAS,EACT,cAAc,GACf,GAAG,OAAO,CAAC;IAEZ,+EAA+E;IAC/E,MAAM,WAAW,GAAG,OAAO,CAAC,WAAW,IAAI,CAAC,SAAS,KAAK,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;IAErH,iDAAiD;IACjD,MAAM,kBAAkB,GAAG,IAAI,GAAG,EAAkB,CAAC;IACrD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,IAAI,aAAa,GAAG,CAAC,CAAC;IAEtB,KAAK,UAAU,KAAK,CAAC,OAAe,EAAE,KAAa,EAAE,UAAkB;QACrE,2EAA2E;QAC3E,2EAA2E;QAC3E,IAAI,UAAU,GAAG,SAAS;YAAE,OAAO;QACnC,IAAI,KAAK,GAAG,QAAQ;YAAE,OAAO;QAE7B,aAAa,EAAE,CAAC;QAEhB,wDAAwD;QACxD,MAAM,cAAc,GAAG,kBAAkB,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAC5D,kBAAkB,CAAC,GAAG,CAAC,OAAO,EAAE,cAAc,GAAG,UAAU,CAAC,CAAC;QAE7D,oCAAoC;QACpC,MAAM,aAAa,GAAG,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,QAAQ,CAAC;QACzD,SAAS,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC,CAAC;QAEvD,qCAAqC;QACrC,MAAM,KAAK,GAAG,gBAAgB,CAC5B,OAAO,EACP,SAAS,EACT,WAAW,EACX,SAAS,EACT,cAAc,CACf,CAAC;QAEF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,yCAAyC;YACzC,MAAM,SAAS,GAAG,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC;YAE3C,wEAAwE;YACxE,MAAM,KAAK,CAAC,IAAI,CAAC,aAAa,EAAE,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IAED,uCAAuC;IACvC,MAAM,KAAK,CAAC,YAAY,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;IAElC,yCAAyC;IACzC,MAAM,OAAO,GAAoB,EAAE,CAAC;IACpC,KAAK,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,IAAI,kBAAkB,EAAE,CAAC;QACnD,IAAI,OAAO,KAAK,YAAY,EAAE,CAAC,CAAE,kCAAkC;YACjE,OAAO,CAAC,IAAI,CAAC;gBACX,OAAO;gBACP,MAAM;gBACN,KAAK,EAAE,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC;aACnC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,4BAA4B;IAC5B,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IAE5C,OAAO;QACL,MAAM,EAAE,OAAO;QACf,OAAO,EAAE,aAAa;KACvB,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,aAAuB,EACvB,YAAsB,EACtB,SAAiB,EACjB,OAAyB;IAEzB,4CAA4C;IAC5C,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAC;IAChD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC/C,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,MAAM,OAAO,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,WAAW,GAAG,YAAY,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;QAE3C,sCAAsC;QACtC,MAAM,MAAM,GAAG,MAAM,QAAQ,CAAC,OAAO,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;QAC3D,YAAY,IAAI,MAAM,CAAC,OAAO,CAAC;QAE/B,sCAAsC;QACtC,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;YAClC,MAAM,YAAY,GAAG,KAAK,CAAC,MAAM,GAAG,WAAW,CAAC;YAChD,MAAM,cAAc,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC7D,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,cAAc,GAAG,YAAY,CAAC,CAAC;YAEhE,qBAAqB;YACrB,MAAM,aAAa,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,QAAQ,CAAC;YAClE,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QACxE,CAAC;IACH,CAAC;IAED,4BAA4B;IAC5B,MAAM,MAAM,GAAoB,EAAE,CAAC;IACnC,KAAK,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;QAC9C,MAAM,CAAC,IAAI,CAAC;YACV,OAAO;YACP,MAAM;YACN,KAAK,EAAE,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC;SACtC,CAAC,CAAC;IACL,CAAC;IAED,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IAE3C,OAAO;QACL,MAAM;QACN,OAAO,EAAE,YAAY;KACtB,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAC3B,eAAgC;IAEhC,MAAM,QAAQ,GAAiE,EAAE,CAAC;IAElF,KAAK,MAAM,EAAE,IAAI,eAAe,CAAC,MAAM,EAAE,CAAC;QACxC,MAAM,KAAK,GAAG,YAAY,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC;QACvC,IAAI,KAAK,EAAE,CAAC;YACV,QAAQ,CAAC,IAAI,CAAC;gBACZ,KAAK;gBACL,MAAM,EAAE,EAAE,CAAC,MAAM;gBACjB,KAAK,EAAE,EAAE,CAAC,KAAK;aAChB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,MAAuB;IACnD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAyB,CAAC;IAE9C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QACzC,IAAI,QAAQ,EAAE,CAAC;YACb,iDAAiD;YACjD,QAAQ,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,GAAG,CAAC;YACvD,qBAAqB;YACrB,QAAQ,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;QACzD,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC;QACxC,CAAC;IACH,CAAC;IAED,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IAC1C,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;IAE5C,OAAO,OAAO,CAAC;AACjB,CAAC"}

package/dist/storage/clock-store.d.ts

@@ -1,80 +0,0 @@
-/**
- * Persistence layer for vector clocks.
- *
- * Stores and retrieves vector clocks from SQLite for:
- * - Reference clocks (per project): Element-wise max of all agent clocks
- * - Agent clocks (per project + agent): Current clock state for each agent
- */
-import { type VectorClock } from '../temporal/vector-clock.js';
-/**
- * Get the reference clock for a project.
- * The reference clock is the element-wise max of all agent clocks,
- * representing the "current time" for decay calculation.
- *
- * @param projectSlug - Project identifier
- * @returns Current reference clock (empty if none stored)
- */
-export declare function getReferenceClock(projectSlug: string): VectorClock;
-/**
- * Set the reference clock for a project.
- *
- * @param projectSlug - Project identifier
- * @param clock - New reference clock
- */
-export declare function setReferenceClock(projectSlug: string, clock: VectorClock): void;
-/**
- * Get the clock for a specific agent within a project.
- *
- * @param projectSlug - Project identifier
- * @param agentId - Agent identifier (e.g., 'ui', 'human', or sub-agent ID)
- * @returns Agent's current clock (empty if none stored)
- */
-export declare function getAgentClock(projectSlug: string, agentId: string): VectorClock;
-/**
- * Update the clock for a specific agent and refresh the reference clock.
- * The reference clock is automatically updated to be the merge of all agent clocks.
- *
- * @param projectSlug - Project identifier
- * @param agentId - Agent identifier
- * @param clock - New clock state for this agent
- */
-export declare function updateAgentClock(projectSlug: string, agentId: string, clock: VectorClock): void;
-/**
- * Get all agent clocks for a project.
- *
- * @param projectSlug - Project identifier
- * @returns Map of agentId → clock
- */
-export declare function getAllAgentClocks(projectSlug: string): Map<string, VectorClock>;
-/**
- * Rebuild the reference clock from all agent clocks.
- * Useful after data recovery or manual edits.
- *
- * @param projectSlug - Project identifier
- * @returns The newly computed reference clock
- */
-export declare function rebuildReferenceClock(projectSlug: string): VectorClock;
-/**
- * Delete all clocks for a project.
- * Used when clearing project data.
- *
- * @param projectSlug - Project identifier
- * @returns Number of records deleted
- */
-export declare function deleteProjectClocks(projectSlug: string): number;
-/**
- * Get the last update time for a clock.
- *
- * @param projectSlug - Project identifier
- * @param agentId - Agent identifier (optional, for reference clock if omitted)
- * @returns ISO timestamp of last update, or null if not found
- */
-export declare function getClockUpdateTime(projectSlug: string, agentId?: string): string | null;
-/**
- * Check if a project has any stored clocks.
- *
- * @param projectSlug - Project identifier
- * @returns true if project has stored clocks
- */
-export declare function hasProjectClocks(projectSlug: string): boolean;
-//# sourceMappingURL=clock-store.d.ts.map

package/dist/storage/clock-store.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"clock-store.d.ts","sourceRoot":"","sources":["../../src/storage/clock-store.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAGH,OAAO,EACL,KAAK,WAAW,EAKjB,MAAM,6BAA6B,CAAC;AAErC;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAAC,WAAW,EAAE,MAAM,GAAG,WAAW,CAQlE;AAED;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAAC,WAAW,EAAE,MAAM,EAAE,KAAK,EAAE,WAAW,GAAG,IAAI,CAU/E;AAED;;;;;;GAMG;AACH,wBAAgB,aAAa,CAAC,WAAW,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,WAAW,CAQ/E;AAED;;;;;;;GAOG;AACH,wBAAgB,gBAAgB,CAAC,WAAW,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,WAAW,GAAG,IAAI,CAgB/F;AAED;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAAC,WAAW,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAkB/E;AAED;;;;;;GAMG;AACH,wBAAgB,qBAAqB,CAAC,WAAW,EAAE,MAAM,GAAG,WAAW,CAUtE;AAED;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CAAC,WAAW,EAAE,MAAM,GAAG,MAAM,CAI/D;AAED;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAAC,WAAW,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CASvF;AAED;;;;;GAKG;AACH,wBAAgB,gBAAgB,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAQ7D"}

package/dist/storage/clock-store.js

@@ -1,155 +0,0 @@
-/**
- * Persistence layer for vector clocks.
- *
- * Stores and retrieves vector clocks from SQLite for:
- * - Reference clocks (per project): Element-wise max of all agent clocks
- * - Agent clocks (per project + agent): Current clock state for each agent
- */
-import { getDb } from './db.js';
-import { serialize, deserialize, merge, createClock, } from '../temporal/vector-clock.js';
-/**
- * Get the reference clock for a project.
- * The reference clock is the element-wise max of all agent clocks,
- * representing the "current time" for decay calculation.
- *
- * @param projectSlug - Project identifier
- * @returns Current reference clock (empty if none stored)
- */
-export function getReferenceClock(projectSlug) {
-    const db = getDb();
-    const row = db
-        .prepare('SELECT clock_data FROM vector_clocks WHERE id = ? AND project_slug = ?')
-        .get(`project:${projectSlug}`, projectSlug);
-    return row ? deserialize(row.clock_data) : createClock();
-}
-/**
- * Set the reference clock for a project.
- *
- * @param projectSlug - Project identifier
- * @param clock - New reference clock
- */
-export function setReferenceClock(projectSlug, clock) {
-    const db = getDb();
-    db.prepare(`
-    INSERT INTO vector_clocks (id, project_slug, clock_data, updated_at)
-    VALUES (?, ?, ?, CURRENT_TIMESTAMP)
-    ON CONFLICT(id) DO UPDATE SET
-      clock_data = excluded.clock_data,
-      updated_at = CURRENT_TIMESTAMP
-  `).run(`project:${projectSlug}`, projectSlug, serialize(clock));
-}
-/**
- * Get the clock for a specific agent within a project.
- *
- * @param projectSlug - Project identifier
- * @param agentId - Agent identifier (e.g., 'ui', 'human', or sub-agent ID)
- * @returns Agent's current clock (empty if none stored)
- */
-export function getAgentClock(projectSlug, agentId) {
-    const db = getDb();
-    const row = db
-        .prepare('SELECT clock_data FROM vector_clocks WHERE id = ? AND project_slug = ?')
-        .get(`agent:${projectSlug}:${agentId}`, projectSlug);
-    return row ? deserialize(row.clock_data) : createClock();
-}
-/**
- * Update the clock for a specific agent and refresh the reference clock.
- * The reference clock is automatically updated to be the merge of all agent clocks.
- *
- * @param projectSlug - Project identifier
- * @param agentId - Agent identifier
- * @param clock - New clock state for this agent
- */
-export function updateAgentClock(projectSlug, agentId, clock) {
-    const db = getDb();
-    // Store the agent's clock
-    db.prepare(`
-    INSERT INTO vector_clocks (id, project_slug, clock_data, updated_at)
-    VALUES (?, ?, ?, CURRENT_TIMESTAMP)
-    ON CONFLICT(id) DO UPDATE SET
-      clock_data = excluded.clock_data,
-      updated_at = CURRENT_TIMESTAMP
-  `).run(`agent:${projectSlug}:${agentId}`, projectSlug, serialize(clock));
-    // Update reference clock (merge with existing)
-    const currentRef = getReferenceClock(projectSlug);
-    const newRef = merge(currentRef, clock);
-    setReferenceClock(projectSlug, newRef);
-}
-/**
- * Get all agent clocks for a project.
- *
- * @param projectSlug - Project identifier
- * @returns Map of agentId → clock
- */
-export function getAllAgentClocks(projectSlug) {
-    const db = getDb();
-    const rows = db
-        .prepare('SELECT id, clock_data FROM vector_clocks WHERE project_slug = ? AND id LIKE ?')
-        .all(projectSlug, `agent:${projectSlug}:%`);
-    const result = new Map();
-    const prefix = `agent:${projectSlug}:`;
-    for (const row of rows) {
-        if (row.id.startsWith(prefix)) {
-            const agentId = row.id.slice(prefix.length);
-            result.set(agentId, deserialize(row.clock_data));
-        }
-    }
-    return result;
-}
-/**
- * Rebuild the reference clock from all agent clocks.
- * Useful after data recovery or manual edits.
- *
- * @param projectSlug - Project identifier
- * @returns The newly computed reference clock
- */
-export function rebuildReferenceClock(projectSlug) {
-    const agentClocks = getAllAgentClocks(projectSlug);
-    let ref = createClock();
-    for (const clock of agentClocks.values()) {
-        ref = merge(ref, clock);
-    }
-    setReferenceClock(projectSlug, ref);
-    return ref;
-}
-/**
- * Delete all clocks for a project.
- * Used when clearing project data.
- *
- * @param projectSlug - Project identifier
- * @returns Number of records deleted
- */
-export function deleteProjectClocks(projectSlug) {
-    const db = getDb();
-    const result = db.prepare('DELETE FROM vector_clocks WHERE project_slug = ?').run(projectSlug);
-    return result.changes;
-}
-/**
- * Get the last update time for a clock.
- *
- * @param projectSlug - Project identifier
- * @param agentId - Agent identifier (optional, for reference clock if omitted)
- * @returns ISO timestamp of last update, or null if not found
- */
-export function getClockUpdateTime(projectSlug, agentId) {
-    const db = getDb();
-    const id = agentId ? `agent:${projectSlug}:${agentId}` : `project:${projectSlug}`;
-    const row = db
-        .prepare('SELECT updated_at FROM vector_clocks WHERE id = ?')
-        .get(id);
-    return row?.updated_at ?? null;
-}
-/**
- * Check if a project has any stored clocks.
- *
- * @param projectSlug - Project identifier
- * @returns true if project has stored clocks
- */
-export function hasProjectClocks(projectSlug) {
-    const db = getDb();
-    const row = db
-        .prepare('SELECT 1 FROM vector_clocks WHERE project_slug = ? LIMIT 1')
-        .get(projectSlug);
-    return row !== undefined;
-}
-//# sourceMappingURL=clock-store.js.map

package/dist/storage/clock-store.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"clock-store.js","sourceRoot":"","sources":["../../src/storage/clock-store.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAChC,OAAO,EAEL,SAAS,EACT,WAAW,EACX,KAAK,EACL,WAAW,GACZ,MAAM,6BAA6B,CAAC;AAErC;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAAC,WAAmB;IACnD,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IAEnB,MAAM,GAAG,GAAG,EAAE;SACX,OAAO,CAAC,wEAAwE,CAAC;SACjF,GAAG,CAAC,WAAW,WAAW,EAAE,EAAE,WAAW,CAAuC,CAAC;IAEpF,OAAO,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;AAC3D,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAAC,WAAmB,EAAE,KAAkB;IACvE,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IAEnB,EAAE,CAAC,OAAO,CAAC;;;;;;GAMV,CAAC,CAAC,GAAG,CAAC,WAAW,WAAW,EAAE,EAAE,WAAW,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;AAClE,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,aAAa,CAAC,WAAmB,EAAE,OAAe;IAChE,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IAEnB,MAAM,GAAG,GAAG,EAAE;SACX,OAAO,CAAC,wEAAwE,CAAC;SACjF,GAAG,CAAC,SAAS,WAAW,IAAI,OAAO,EAAE,EAAE,WAAW,CAAuC,CAAC;IAE7F,OAAO,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;AAC3D,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,gBAAgB,CAAC,WAAmB,EAAE,OAAe,EAAE,KAAkB;IACvF,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IAEnB,0BAA0B;IAC1B,EAAE,CAAC,OAAO,CAAC;;;;;;GAMV,CAAC,CAAC,GAAG,CAAC,SAAS,WAAW,IAAI,OAAO,EAAE,EAAE,WAAW,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;IAEzE,+CAA+C;IAC/C,MAAM,UAAU,GAAG,iBAAiB,CAAC,WAAW,CAAC,CAAC;IAClD,MAAM,MAAM,GAAG,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;IACxC,iBAAiB,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;AACzC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAAC,WAAmB;IACnD,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IAEnB,MAAM,IAAI,GAAG,EAAE;SACZ,OAAO,CAAC,+EAA+E,CAAC;SACxF,GAAG,CAAC,WAAW,EAAE,SAAS,WAAW,IAAI,CAA8C,CAAC;IAE3F,MAAM,MAAM,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC9C,MAAM,MAAM,GAAG,SAAS,WAAW,GAAG,CAAC;IAEvC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,GAAG,CAAC,EAAE,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;YAC9B,MAAM,OAAO,GAAG,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC5C,MAAM,CAAC,GAAG,CAAC,OAAO,EAAE,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC;QACnD,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,qBAAqB,CAAC,WAAmB;IACvD,MAAM,WAAW,GAAG,iBAAiB,CAAC,WAAW,CAAC,CAAC;IACnD,IAAI,GAAG,GAAG,WAAW,EAAE,CAAC;IAExB,KAAK,MAAM,KAAK,IAAI,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC;QACzC,GAAG,GAAG,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAC1B,CAAC;IAED,iBAAiB,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC;IACpC,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,mBAAmB,CAAC,WAAmB;IACrD,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IACnB,MAAM,MAAM,GAAG,EAAE,CAAC,OAAO,CAAC,kDAAkD,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;IAC/F,OAAO,MAAM,CAAC,OAAO,CAAC;AACxB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAAC,WAAmB,EAAE,OAAgB;IACtE,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IACnB,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,SAAS,WAAW,IAAI,OAAO,EAAE,CAAC,CAAC,CAAC,WAAW,WAAW,EAAE,CAAC;IAElF,MAAM,GAAG,GAAG,EAAE;SACX,OAAO,CAAC,mDAAmD,CAAC;SAC5D,GAAG,CAAC,EAAE,CAAuC,CAAC;IAEjD,OAAO,GAAG,EAAE,UAAU,IAAI,IAAI,CAAC;AACjC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,gBAAgB,CAAC,WAAmB;IAClD,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC;IAEnB,MAAM,GAAG,GAAG,EAAE;SACX,OAAO,CAAC,4DAA4D,CAAC;SACrE,GAAG,CAAC,WAAW,CAAC,CAAC;IAEpB,OAAO,GAAG,KAAK,SAAS,CAAC;AAC3B,CAAC"}

package/dist/storage/decay.d.ts

@@ -1,125 +0,0 @@
-/**
- * Decay weight calculation for edges.
- * Supports both time-based decay (legacy) and vector clock-based decay.
- */
-import type { DecayModelConfig } from '../core/decay-types.js';
-import { type VectorClock } from '../temporal/vector-clock.js';
-/**
- * Edge direction for hop decay.
- */
-export type EdgeDirection = 'backward' | 'forward';
-/**
- * Hop decay curve type.
- */
-export type HopDecayType = 'exponential' | 'linear' | 'delayed-linear';
-/**
- * Configuration for hop-based decay curves.
- * Different curves are optimal for different directions:
- * - Backward (4-20 hops): Linear dies@10 (MRR=0.688)
- * - Forward (1-20 hops): Delayed linear 5h/dies@20 (MRR=0.849)
- */
-export interface HopDecayConfig {
-    /** Decay curve type */
-    type: HopDecayType;
-    /** For exponential: weight = weightPerHop^hops */
-    weightPerHop?: number;
-    /** For linear/delayed-linear: decay rate per hop */
-    decayPerHop?: number;
-    /** For delayed-linear: hold full weight for N hops */
-    holdHops?: number;
-    /** Minimum weight before edge is considered dead */
-    minWeight: number;
-}
-/**
- * Backward hop decay: Linear (dies@10)
- * Optimal for retrieving causally-related context 4-20 hops back.
- * MRR=0.688 (+35% vs exponential 0.80)
- */
-export declare const BACKWARD_HOP_DECAY: HopDecayConfig;
-/**
- * Forward hop decay: Delayed linear (5-hop hold, dies@20)
- * Optimal for predicting future context 1-20 hops forward.
- * MRR=0.849 (+271% vs exponential 0.80)
- */
-export declare const FORWARD_HOP_DECAY: HopDecayConfig;
-/**
- * Legacy configuration for vector clock-based decay (exponential only).
- * @deprecated Use HopDecayConfig with direction-specific curves instead.
- */
-export interface VectorDecayConfig {
-    /** Weight multiplier per hop (e.g., 0.85 = 15% decay per hop) */
-    weightPerHop: number;
-    /** Minimum weight before edge is considered dead */
-    minWeight: number;
-}
-/**
- * Default vector decay configuration (legacy exponential).
- * @deprecated Use BACKWARD_HOP_DECAY or FORWARD_HOP_DECAY instead.
- */
-export declare const DEFAULT_VECTOR_DECAY: VectorDecayConfig;
-/**
- * Calculate hop-based decay weight using direction-specific curves.
- *
- * @param hops - Number of hops from reference point
- * @param config - Hop decay configuration
- * @returns Weight value (0 to 1), or 0 if below minWeight
- */
-export declare function calculateHopDecayWeight(hops: number, config: HopDecayConfig): number;
-/**
- * Calculate decay weight for an edge based on direction.
- *
- * @param edgeClock - Vector clock stamped on the edge
- * @param referenceClock - Current reference clock for the project
- * @param direction - Edge direction ('backward' or 'forward')
- * @returns Weight value (0 to 1), or 0 if below minWeight
- */
-export declare function calculateDirectionalDecayWeight(edgeClock: VectorClock, referenceClock: VectorClock, direction: EdgeDirection): number;
-/**
- * Calculate decay weight based on vector clock hop count.
- * @deprecated Use calculateDirectionalDecayWeight for direction-specific curves.
- *
- * @param edgeClock - Vector clock stamped on the edge
- * @param referenceClock - Current reference clock for the project
- * @param config - Vector decay configuration
- * @returns Weight value (0 to 1), or 0 if below minWeight
- */
-export declare function calculateVectorDecayWeight(edgeClock: VectorClock, referenceClock: VectorClock, config?: VectorDecayConfig): number;
-/**
- * Calculate decay weight with fallback for legacy edges.
- * Uses vector clock decay if available, falls back to time-based decay.
- *
- * @param edgeClockJson - JSON serialized vector clock (may be null for legacy edges)
- * @param referenceClock - Current reference clock for the project
- * @param direction - Edge direction for curve selection
- * @param createdAtMs - Edge creation time in milliseconds (for fallback)
- * @param queryTimeMs - Query time in milliseconds (for fallback)
- * @param timeConfig - Time-based decay configuration (for fallback)
- * @returns Computed weight value
- */
-export declare function calculateDecayWeightWithFallback(edgeClockJson: string | null, referenceClock: VectorClock, direction: EdgeDirection, createdAtMs: number, queryTimeMs: number, timeConfig: DecayModelConfig): number;
-/**
- * @deprecated Use calculateDecayWeightWithFallback with direction parameter.
- */
-export declare function calculateDecayWeightWithFallbackLegacy(edgeClockJson: string | null, referenceClock: VectorClock, vectorConfig: VectorDecayConfig, createdAtMs: number, queryTimeMs: number, timeConfig: DecayModelConfig): number;
-/**
- * Calculate boosted weight for edges with multiple links.
- * Edges that have been created multiple times (same source/target pair)
- * get a boost to resist decay.
- *
- * @param baseWeight - Base weight after decay
- * @param linkCount - Number of times this edge was created
- * @returns Boosted weight
- */
-export declare function applyLinkBoost(baseWeight: number, linkCount: number): number;
-/**
- * Calculate the decay weight at a given age.
- * @param config - Decay model configuration
- * @param ageMs - Age of the edge in milliseconds
- * @returns Weight value (0 to initialWeight)
- */
-export declare function calculateDecayWeight(config: DecayModelConfig, ageMs: number): number;
-/**
- * Calculate the time when weight reaches zero (or null if asymptotic).
- */
-export declare function getDeathTime(config: DecayModelConfig): number | null;
-//# sourceMappingURL=decay.d.ts.map

package/dist/storage/decay.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"decay.d.ts","sourceRoot":"","sources":["../../src/storage/decay.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAC/D,OAAO,EAAE,KAAK,WAAW,EAAyB,MAAM,6BAA6B,CAAC;AAEtF;;GAEG;AACH,MAAM,MAAM,aAAa,GAAG,UAAU,GAAG,SAAS,CAAC;AAEnD;;GAEG;AACH,MAAM,MAAM,YAAY,GAAG,aAAa,GAAG,QAAQ,GAAG,gBAAgB,CAAC;AAEvE;;;;;GAKG;AACH,MAAM,WAAW,cAAc;IAC7B,uBAAuB;IACvB,IAAI,EAAE,YAAY,CAAC;IACnB,kDAAkD;IAClD,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,oDAAoD;IACpD,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,sDAAsD;IACtD,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,oDAAoD;IACpD,SAAS,EAAE,MAAM,CAAC;CACnB;AAED;;;;GAIG;AACH,eAAO,MAAM,kBAAkB,EAAE,cAIhC,CAAC;AAEF;;;;GAIG;AACH,eAAO,MAAM,iBAAiB,EAAE,cAK/B,CAAC;AAEF;;;GAGG;AACH,MAAM,WAAW,iBAAiB;IAChC,iEAAiE;IACjE,YAAY,EAAE,MAAM,CAAC;IACrB,oDAAoD;IACpD,SAAS,EAAE,MAAM,CAAC;CACnB;AAED;;;GAGG;AACH,eAAO,MAAM,oBAAoB,EAAE,iBAGlC,CAAC;AAEF;;;;;;GAMG;AACH,wBAAgB,uBAAuB,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,cAAc,GAAG,MAAM,CA6BpF;AAED;;;;;;;GAOG;AACH,wBAAgB,+BAA+B,CAC7C,SAAS,EAAE,WAAW,EACtB,cAAc,EAAE,WAAW,EAC3B,SAAS,EAAE,aAAa,GACvB,MAAM,CAIR;AAED;;;;;;;;GAQG;AACH,wBAAgB,0BAA0B,CACxC,SAAS,EAAE,WAAW,EACtB,cAAc,EAAE,WAAW,EAC3B,MAAM,GAAE,iBAAwC,GAC/C,MAAM,CAIR;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,gCAAgC,CAC9C,aAAa,EAAE,MAAM,GAAG,IAAI,EAC5B,cAAc,EAAE,WAAW,EAC3B,SAAS,EAAE,aAAa,EACxB,WAAW,EAAE,MAAM,EACnB,WAAW,EAAE,MAAM,EACnB,UAAU,EAAE,gBAAgB,GAC3B,MAAM,CAWR;AAED;;GAEG;AACH,wBAAgB,sCAAsC,CACpD,aAAa,EAAE,MAAM,GAAG,IAAI,EAC5B,cAAc,EAAE,WAAW,EAC3B,YAAY,EAAE,iBAAiB,EAC/B,WAAW,EAAE,MAAM,EACnB,WAAW,EAAE,MAAM,EACnB,UAAU,EAAE,gBAAgB,GAC3B,MAAM,CAQR;AAED;;;;;;;;GAQG;AACH,wBAAgB,cAAc,CAAC,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM,CAK5E;AAED;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAAC,MAAM,EAAE,gBAAgB,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAmBpF;AAsED;;GAEG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,gBAAgB,GAAG,MAAM,GAAG,IAAI,CAkCpE"}