@jamesaphoenix/tx-core 0.4.1

package/dist/services/retriever-service.js

@@ -0,0 +1,419 @@
+import { Context, Effect, Layer, Option } from "effect";
+import { LearningRepository } from "../repo/learning-repo.js";
+import { EmbeddingService } from "./embedding-service.js";
+import { QueryExpansionService } from "./query-expansion-service.js";
+import { RerankerService } from "./reranker-service.js";
+import { GraphExpansionService } from "./graph-expansion.js";
+import { FeedbackTrackerService } from "./feedback-tracker.js";
+import { cosineSimilarity } from "../utils/math.js";
+/** RRF constant - standard value from the original paper */
+const RRF_K = 60;
+/** Default weights for recency (used as boost on top of RRF) */
+const DEFAULT_RECENCY_WEIGHT = 0.1;
+const MAX_AGE_DAYS = 30;
+/** Boost weights for outcome and frequency */
+const OUTCOME_BOOST = 0.05;
+const FREQUENCY_BOOST = 0.02;
+/** Position-aware bonuses for items ranking highly in any retrieval system */
+const TOP_1_BONUS = 0.05; // Bonus for #1 rank in any system
+const TOP_3_BONUS = 0.02; // Bonus for top 3 in any system
+/** Feedback boost weight - scales the 0-1 feedback score */
+const FEEDBACK_BOOST = 0.05;
+/**
+ * RetrieverService provides pluggable retrieval for learnings.
+ *
+ * Design: PRD-015 specifies retrieval should be pluggable with good defaults.
+ * Users can swap out the default BM25+vector+RRF pipeline for their own
+ * implementation (Pinecone, Weaviate, Chroma, etc.).
+ */
+export class RetrieverService extends Context.Tag("RetrieverService")() {
+}
+/**
+ * Calculate recency score (0-1) based on age in days.
+ * Newer learnings get higher scores.
+ */
+const calculateRecencyScore = (createdAt) => {
+    const ageMs = Date.now() - createdAt.getTime();
+    const ageDays = ageMs / (1000 * 60 * 60 * 24);
+    return Math.max(0, 1 - ageDays / MAX_AGE_DAYS);
+};
+/**
+ * Compute vector similarity scores and return ranked results.
+ * Rank is 1-indexed (1 = best match).
+ */
+const computeVectorRanking = (learnings, queryEmbedding) => {
+    if (!queryEmbedding) {
+        return [];
+    }
+    const withScores = learnings
+        .filter(l => l.embedding !== null)
+        .map(learning => {
+        const similarity = cosineSimilarity(queryEmbedding, learning.embedding);
+        // Normalize cosine similarity from [-1, 1] to [0, 1]
+        const score = (similarity + 1) / 2;
+        return { learning, score };
+    })
+        .sort((a, b) => b.score - a.score);
+    // Add 1-indexed ranks
+    return withScores.map((item, idx) => ({
+        ...item,
+        rank: idx + 1
+    }));
+};
+/**
+ * Reciprocal Rank Fusion (RRF) score calculation.
+ * Formula: RRF(d) = Σ 1/(k + rank_i(d))
+ *
+ * k is a constant (typically 60) that determines how much to weight
+ * items that appear in multiple lists vs items that rank highly in one list.
+ *
+ * @param k - RRF constant (default 60)
+ * @param ranks - Array of ranks (1-indexed, 0 means not present in that list)
+ */
+const rrfScore = (k, ...ranks) => {
+    return ranks.reduce((sum, rank) => {
+        if (rank === 0)
+            return sum; // Not present in this list
+        return sum + 1 / (k + rank);
+    }, 0);
+};
+/**
+ * Combine BM25 and vector search results using Reciprocal Rank Fusion (RRF).
+ *
+ * RRF is a robust method for combining ranked lists that:
+ * 1. Does not require score normalization
+ * 2. Works well when combining different retrieval systems
+ * 3. Is robust to outliers and different score distributions
+ *
+ * The final relevance score combines:
+ * - RRF score from BM25 and vector rankings
+ * - Recency boost for newer learnings
+ * - Outcome boost for learnings marked as helpful
+ * - Frequency boost for frequently retrieved learnings
+ */
+const computeRRFScoring = (bm25Results, vectorRanking) => {
+    // Build lookup maps for quick access
+    const bm25Map = new Map();
+    bm25Results.forEach((result, idx) => {
+        bm25Map.set(result.learning.id, { score: result.score, rank: idx + 1 });
+    });
+    const vectorMap = new Map();
+    vectorRanking.forEach(item => {
+        vectorMap.set(item.learning.id, { score: item.score, rank: item.rank });
+    });
+    // Collect all unique learnings from both sources
+    const allLearnings = new Map();
+    for (const result of bm25Results) {
+        allLearnings.set(result.learning.id, result.learning);
+    }
+    for (const item of vectorRanking) {
+        allLearnings.set(item.learning.id, item.learning);
+    }
+    // Compute RRF scores for all candidates
+    const candidates = [];
+    for (const [id, learning] of allLearnings) {
+        const bm25Info = bm25Map.get(id);
+        const vectorInfo = vectorMap.get(id);
+        const bm25Rank = bm25Info?.rank ?? 0;
+        const vectorRank = vectorInfo?.rank ?? 0;
+        const bm25Score = bm25Info?.score ?? 0;
+        const vectorScore = vectorInfo?.score ?? 0;
+        const recencyScore = calculateRecencyScore(learning.createdAt);
+        const rrf = rrfScore(RRF_K, bm25Rank, vectorRank);
+        candidates.push({
+            learning,
+            bm25Score,
+            bm25Rank,
+            vectorScore,
+            vectorRank,
+            rrfScore: rrf,
+            recencyScore
+        });
+    }
+    // Sort by RRF score (descending)
+    return candidates.sort((a, b) => b.rrfScore - a.rrfScore);
+};
+/**
+ * Calculate position-aware bonus based on best rank across retrieval systems.
+ * Items ranking #1 in any system get a larger bonus; top 3 get a smaller one.
+ *
+ * @param ranks - Array of ranks (1-indexed, 0 means not present in that system)
+ * @returns Position bonus to add to the score
+ */
+const calculatePositionBonus = (...ranks) => {
+    // Filter out zeros (not present in that ranking)
+    const validRanks = ranks.filter(r => r > 0);
+    if (validRanks.length === 0)
+        return 0;
+    const bestRank = Math.min(...validRanks);
+    if (bestRank === 1)
+        return TOP_1_BONUS; // #1 in any system
+    if (bestRank <= 3)
+        return TOP_3_BONUS; // Top 3 in any system
+    return 0;
+};
+/**
+ * Convert RRF candidates to final LearningWithScore results.
+ * Applies additional boosts for recency, outcome, frequency, position, and feedback.
+ *
+ * @param candidates - RRF-scored candidates
+ * @param recencyWeight - Weight for recency boost
+ * @param feedbackScores - Optional map of learning ID to feedback score (0-1)
+ */
+const applyFinalScoring = (candidates, recencyWeight, feedbackScores) => {
+    return candidates.map(candidate => {
+        const { learning, bm25Score, bm25Rank, vectorScore, vectorRank, rrfScore: rrf, recencyScore } = candidate;
+        // Outcome boost: if learning has been marked helpful, boost it
+        const outcomeBoost = learning.outcomeScore !== null
+            ? OUTCOME_BOOST * learning.outcomeScore
+            : 0;
+        // Frequency boost: learnings that have been retrieved more get a small boost
+        const frequencyBoost = FREQUENCY_BOOST * Math.log(1 + learning.usageCount);
+        // Position-aware bonus: reward items that rank highly in any retrieval system
+        const positionBonus = calculatePositionBonus(bm25Rank, vectorRank);
+        // Feedback boost: learnings that were helpful in past runs get boosted
+        // feedbackScore is 0-1 with 0.5 being neutral (no feedback)
+        const feedbackScore = feedbackScores?.get(learning.id) ?? 0.5;
+        const feedbackBoost = FEEDBACK_BOOST * feedbackScore;
+        // Final relevance score: RRF as base + boosts
+        // RRF score range is [0, 2/k] for two lists, normalize to [0, 1] range
+        // Max possible RRF = 2 * 1/(k+1) ≈ 0.0328 for k=60
+        // Normalize: multiply by (k+1)/2 to get ~[0, 1]
+        const normalizedRRF = rrf * (RRF_K + 1) / 2;
+        const relevanceScore = normalizedRRF +
+            recencyWeight * recencyScore +
+            outcomeBoost +
+            frequencyBoost +
+            positionBonus +
+            feedbackBoost;
+        return {
+            ...learning,
+            relevanceScore,
+            bm25Score,
+            vectorScore,
+            recencyScore,
+            rrfScore: rrf,
+            bm25Rank,
+            vectorRank,
+            feedbackScore
+        };
+    }).sort((a, b) => b.relevanceScore - a.relevanceScore);
+};
+/**
+ * Noop fallback - returns empty results.
+ * Used when retrieval is disabled or for testing without full pipeline.
+ */
+export const RetrieverServiceNoop = Layer.succeed(RetrieverService, {
+    search: (_query, _options) => Effect.succeed([]),
+    isAvailable: () => Effect.succeed(false)
+});
+/**
+ * Live implementation with BM25 + vector + RRF pipeline.
+ * Uses the default hybrid search with:
+ * - Query expansion via LLM
+ * - BM25 full-text search
+ * - Vector similarity (when embeddings available)
+ * - RRF fusion
+ * - Optional LLM re-ranking
+ * - Recency/outcome/frequency boosts
+ */
+export const RetrieverServiceLive = Layer.effect(RetrieverService, Effect.gen(function* () {
+    const learningRepo = yield* LearningRepository;
+    const embeddingService = yield* EmbeddingService;
+    const queryExpansionService = yield* QueryExpansionService;
+    const rerankerService = yield* RerankerService;
+    // GraphExpansionService is optional - graceful degradation when not available
+    const graphExpansionServiceOption = yield* Effect.serviceOption(GraphExpansionService);
+    const graphExpansionService = Option.getOrNull(graphExpansionServiceOption);
+    // FeedbackTrackerService is optional - graceful degradation when not available
+    const feedbackTrackerServiceOption = yield* Effect.serviceOption(FeedbackTrackerService);
+    const feedbackTrackerService = Option.getOrNull(feedbackTrackerServiceOption);
+    // Load recency weight from config
+    const recencyWeightStr = yield* learningRepo.getConfig("recency_weight");
+    const recencyWeight = recencyWeightStr ? parseFloat(recencyWeightStr) : DEFAULT_RECENCY_WEIGHT;
+    /**
+     * Apply LLM re-ranking to scored learnings with position-aware blending.
+     * Re-ranking uses a specialized model to improve precision.
+     * Position-aware blending gives bonuses to items that rank highly
+     * across multiple retrieval systems (BM25, vector, AND reranker).
+     * Gracefully degrades if reranker is unavailable.
+     */
+    const applyReranking = (query, learnings, rerankerWeight = 0.3) => Effect.gen(function* () {
+        // Check if reranker is available
+        const isAvailable = yield* rerankerService.isAvailable();
+        if (!isAvailable || learnings.length === 0) {
+            return learnings;
+        }
+        // Extract document contents for reranking
+        const documents = learnings.map(l => l.content);
+        // Get reranker scores (graceful degradation on error)
+        const reranked = yield* Effect.catchAll(rerankerService.rerank(query, documents), () => Effect.succeed(null));
+        if (!reranked) {
+            return learnings;
+        }
+        // Create maps of content to reranker score and rank
+        const rerankerScores = new Map();
+        const rerankerRanks = new Map();
+        reranked.forEach((result, idx) => {
+            rerankerScores.set(result.document, result.score);
+            rerankerRanks.set(result.document, idx + 1); // 1-indexed rank
+        });
+        // Blend reranker scores with existing relevance scores using position-aware bonuses
+        // Formula: final = (1 - weight) * existing + weight * reranker + positionBonus
+        return learnings.map(learning => {
+            const rerankerScore = rerankerScores.get(learning.content) ?? 0;
+            const rerankerRank = rerankerRanks.get(learning.content) ?? 0;
+            // Calculate position bonus across all three systems (BM25, vector, reranker)
+            const positionBonus = calculatePositionBonus(learning.bm25Rank, learning.vectorRank, rerankerRank);
+            // Weighted blend plus position-aware bonus
+            const blendedScore = (1 - rerankerWeight) * learning.relevanceScore +
+                rerankerWeight * rerankerScore +
+                positionBonus;
+            return {
+                ...learning,
+                relevanceScore: blendedScore,
+                rerankerScore // Add reranker score to output
+            };
+        }).sort((a, b) => b.relevanceScore - a.relevanceScore);
+    });
+    /**
+     * Perform BM25 search across multiple queries and merge results.
+     * Uses RRF to combine rankings from each query.
+     */
+    const multiQueryBM25Search = (queries, limit) => Effect.gen(function* () {
+        // Search for each query
+        const allResults = [];
+        for (const query of queries) {
+            const results = yield* learningRepo.bm25Search(query, limit);
+            allResults.push([...results]);
+        }
+        // Merge results using best rank across all queries
+        const learningRanks = new Map();
+        for (const results of allResults) {
+            results.forEach((result, idx) => {
+                const rank = idx + 1;
+                const existing = learningRanks.get(result.learning.id);
+                if (!existing || rank < existing.bestRank) {
+                    learningRanks.set(result.learning.id, {
+                        learning: result.learning,
+                        bestRank: rank,
+                        bestScore: result.score
+                    });
+                }
+            });
+        }
+        // Convert to BM25Result format, sorted by best rank
+        const merged = [...learningRanks.values()]
+            .sort((a, b) => a.bestRank - b.bestRank)
+            .map(item => ({ learning: item.learning, score: item.bestScore }));
+        return merged;
+    });
+    /**
+     * Apply graph expansion to seed learnings and merge with existing results.
+     * Gracefully degrades if expansion fails or GraphExpansionService is unavailable.
+     */
+    const applyGraphExpansion = (seeds, options) => Effect.gen(function* () {
+        const graphOpts = options.graphExpansion;
+        // Skip if not enabled, no seeds, or GraphExpansionService unavailable
+        if (!graphOpts?.enabled || seeds.length === 0 || !graphExpansionService) {
+            return seeds;
+        }
+        // Convert top-k seeds to SeedLearning format for expansion
+        const seedCount = Math.min(seeds.length, 10); // Default top-k seeds
+        const seedLearnings = seeds.slice(0, seedCount).map(s => ({
+            learning: s,
+            score: s.relevanceScore
+        }));
+        // Perform graph expansion (graceful degradation on error)
+        const expansionResult = yield* Effect.catchAll(graphExpansionService.expand(seedLearnings, {
+            depth: graphOpts.depth ?? 2,
+            decayFactor: graphOpts.decayFactor ?? 0.7,
+            maxNodes: graphOpts.maxNodes ?? 100,
+            edgeTypes: graphOpts.edgeTypes
+        }), () => Effect.succeed(null));
+        if (!expansionResult) {
+            // Graph expansion failed, return original seeds with hops=0
+            return seeds.map(s => ({
+                ...s,
+                expansionHops: 0,
+                expansionPath: [s.id],
+                sourceEdge: null
+            }));
+        }
+        // Create a set of seed IDs to track which learnings are direct matches
+        const seedIds = new Set(seeds.map(s => s.id));
+        // Mark seed learnings with expansion metadata (hops=0)
+        const seedsWithMeta = seeds.map(s => ({
+            ...s,
+            expansionHops: 0,
+            expansionPath: [s.id],
+            sourceEdge: null
+        }));
+        // Convert expanded learnings to LearningWithScore format
+        // Only include learnings that aren't already in the seed set (avoid duplicates)
+        const expandedWithScores = expansionResult.expanded
+            .filter(e => !seedIds.has(e.learning.id))
+            .map(e => ({
+            ...e.learning,
+            relevanceScore: e.decayedScore,
+            bm25Score: 0,
+            vectorScore: 0,
+            recencyScore: calculateRecencyScore(e.learning.createdAt),
+            rrfScore: 0,
+            bm25Rank: 0,
+            vectorRank: 0,
+            expansionHops: e.hops,
+            expansionPath: e.path,
+            sourceEdge: e.sourceEdge
+        }));
+        // Merge seeds and expanded, sort by relevance score
+        const merged = [...seedsWithMeta, ...expandedWithScores]
+            .sort((a, b) => b.relevanceScore - a.relevanceScore);
+        return merged;
+    });
+    return {
+        search: (query, options) => Effect.gen(function* () {
+            const { limit = 10, minScore = 0.1 } = options ?? {};
+            // Expand query using LLM (graceful degradation - returns original if unavailable)
+            const expansionResult = yield* Effect.catchAll(queryExpansionService.expand(query), () => Effect.succeed({ original: query, expanded: [query], wasExpanded: false }));
+            // Get BM25 search results across all expanded queries (ranked list 1)
+            const bm25Results = yield* multiQueryBM25Search(expansionResult.expanded, limit * 3);
+            // Try to get query embedding for vector search (graceful degradation)
+            // Use original query for embedding since expanded queries may be noisier
+            const queryEmbedding = yield* Effect.option(embeddingService.embed(query));
+            const queryEmbeddingValue = Option.getOrNull(queryEmbedding);
+            // Get all learnings that have embeddings for vector ranking
+            const learningsWithEmbeddings = yield* learningRepo.findWithEmbeddings(limit * 3);
+            // Compute vector ranking (ranked list 2)
+            const vectorRanking = computeVectorRanking(learningsWithEmbeddings, queryEmbeddingValue);
+            // Combine using RRF
+            const candidates = computeRRFScoring(bm25Results, vectorRanking);
+            // Fetch feedback scores for all candidates in a single batch (graceful degradation)
+            let feedbackScores;
+            if (feedbackTrackerService && candidates.length > 0) {
+                const learningIds = candidates.map(c => c.learning.id);
+                feedbackScores = yield* Effect.catchAll(feedbackTrackerService.getFeedbackScores(learningIds), () => Effect.succeed(new Map(learningIds.map(id => [id, 0.5]))));
+            }
+            // Apply final scoring with boosts (including feedback)
+            const scored = applyFinalScoring(candidates, recencyWeight, feedbackScores);
+            // Apply graph expansion if enabled (after initial RRF scoring)
+            const withGraphExpansion = yield* applyGraphExpansion(scored, options ?? {});
+            // Apply LLM re-ranking to top candidates for improved precision
+            // Only re-rank a reasonable number of candidates to balance quality vs latency
+            const topCandidates = withGraphExpansion.slice(0, Math.min(limit * 2, 20));
+            const reranked = yield* applyReranking(query, topCandidates);
+            // Filter by minimum score and limit
+            return reranked
+                .filter(r => r.relevanceScore >= minScore)
+                .slice(0, limit);
+        }),
+        isAvailable: () => Effect.succeed(true)
+    };
+}));
+/**
+ * Auto-detecting layer that always uses Live since BM25 is always available.
+ * The Live implementation gracefully degrades vector search when embeddings
+ * are unavailable, so Auto just delegates to Live.
+ */
+export const RetrieverServiceAuto = RetrieverServiceLive;
+//# sourceMappingURL=retriever-service.js.map

package/dist/services/retriever-service.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"retriever-service.js","sourceRoot":"","sources":["../../src/services/retriever-service.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAA;AACvD,OAAO,EAAE,kBAAkB,EAAmB,MAAM,0BAA0B,CAAA;AAC9E,OAAO,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAA;AACzD,OAAO,EAAE,qBAAqB,EAAE,MAAM,8BAA8B,CAAA;AACpE,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAA;AACvD,OAAO,EAAE,qBAAqB,EAAqB,MAAM,sBAAsB,CAAA;AAC/E,OAAO,EAAE,sBAAsB,EAAE,MAAM,uBAAuB,CAAA;AAG9D,OAAO,EAAE,gBAAgB,EAAE,MAAM,kBAAkB,CAAA;AAEnD,4DAA4D;AAC5D,MAAM,KAAK,GAAG,EAAE,CAAA;AAEhB,gEAAgE;AAChE,MAAM,sBAAsB,GAAG,GAAG,CAAA;AAClC,MAAM,YAAY,GAAG,EAAE,CAAA;AAEvB,8CAA8C;AAC9C,MAAM,aAAa,GAAG,IAAI,CAAA;AAC1B,MAAM,eAAe,GAAG,IAAI,CAAA;AAE5B,8EAA8E;AAC9E,MAAM,WAAW,GAAG,IAAI,CAAA,CAAE,kCAAkC;AAC5D,MAAM,WAAW,GAAG,IAAI,CAAA,CAAE,gCAAgC;AAE1D,4DAA4D;AAC5D,MAAM,cAAc,GAAG,IAAI,CAAA;AAE3B;;;;;;GAMG;AACH,MAAM,OAAO,gBAAiB,SAAQ,OAAO,CAAC,GAAG,CAAC,kBAAkB,CAAC,EAclE;CAAG;AAEN;;;GAGG;AACH,MAAM,qBAAqB,GAAG,CAAC,SAAe,EAAU,EAAE;IACxD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC,OAAO,EAAE,CAAA;IAC9C,MAAM,OAAO,GAAG,KAAK,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAA;IAC7C,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,OAAO,GAAG,YAAY,CAAC,CAAA;AAChD,CAAC,CAAA;AAED;;;GAGG;AACH,MAAM,oBAAoB,GAAG,CAC3B,SAA8B,EAC9B,cAAmC,EACoB,EAAE;IACzD,IAAI,CAAC,cAAc,EAAE,CAAC;QACpB,OAAO,EAAE,CAAA;IACX,CAAC;IAED,MAAM,UAAU,GAAG,SAAS;SACzB,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,IAAI,CAAC;SACjC,GAAG,CAAC,QAAQ,CAAC,EAAE;QACd,MAAM,UAAU,GAAG,gBAAgB,CAAC,cAAc,EAAE,QAAQ,CAAC,SAAU,CAAC,CAAA;QACxE,qDAAqD;QACrD,MAAM,KAAK,GAAG,CAAC,UAAU,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;QAClC,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAA;IAC5B,CAAC,CAAC;SACD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAA;IAEpC,sBAAsB;IACtB,OAAO,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;QACpC,GAAG,IAAI;QACP,IAAI,EAAE,GAAG,GAAG,CAAC;KACd,CAAC,CAAC,CAAA;AACL,CAAC,CAAA;AAED;;;;;;;;;GASG;AACH,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAE,GAAG,KAAe,EAAU,EAAE;IACzD,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE;QAChC,IAAI,IAAI,KAAK,CAAC;YAAE,OAAO,GAAG,CAAA,CAAC,2BAA2B;QACtD,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAA;IAC7B,CAAC,EAAE,CAAC,CAAC,CAAA;AACP,CAAC,CAAA;AAeD;;;;;;;;;;;;;GAaG;AACH,MAAM,iBAAiB,GAAG,CACxB,WAAkC,EAClC,aAAoE,EACpD,EAAE;IAClB,qCAAqC;IACrC,MAAM,OAAO,GAAG,IAAI,GAAG,EAA2C,CAAA;IAClE,WAAW,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE;QAClC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,CAAA;IACzE,CAAC,CAAC,CAAA;IAEF,MAAM,SAAS,GAAG,IAAI,GAAG,EAA2C,CAAA;IACpE,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;QAC3B,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAA;IACzE,CAAC,CAAC,CAAA;IAEF,iDAAiD;IACjD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAoB,CAAA;IAChD,KAAK,MAAM,MAAM,IAAI,WAAW,EAAE,CAAC;QACjC,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAA;IACvD,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;QACjC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAA;IACnD,CAAC;IAED,wCAAwC;IACxC,MAAM,UAAU,GAAmB,EAAE,CAAA;IACrC,KAAK,MAAM,CAAC,EAAE,EAAE,QAAQ,CAAC,IAAI,YAAY,EAAE,CAAC;QAC1C,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QAChC,MAAM,UAAU,GAAG,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QAEpC,MAAM,QAAQ,GAAG,QAAQ,EAAE,IAAI,IAAI,CAAC,CAAA;QACpC,MAAM,UAAU,GAAG,UAAU,EAAE,IAAI,IAAI,CAAC,CAAA;QACxC,MAAM,SAAS,GAAG,QAAQ,EAAE,KAAK,IAAI,CAAC,CAAA;QACtC,MAAM,WAAW,GAAG,UAAU,EAAE,KAAK,IAAI,CAAC,CAAA;QAC1C,MAAM,YAAY,GAAG,qBAAqB,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAA;QAE9D,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAA;QAEjD,UAAU,CAAC,IAAI,CAAC;YACd,QAAQ;YACR,SAAS;YACT,QAAQ;YACR,WAAW;YACX,UAAU;YACV,QAAQ,EAAE,GAAG;YACb,YAAY;SACb,CAAC,CAAA;IACJ,CAAC;IAED,iCAAiC;IACjC,OAAO,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAA;AAC3D,CAAC,CAAA;AAED;;;;;;GAMG;AACH,MAAM,sBAAsB,GAAG,CAAC,GAAG,KAAe,EAAU,EAAE;IAC5D,iDAAiD;IACjD,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;IAC3C,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAA;IAErC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,CAAA;IAExC,IAAI,QAAQ,KAAK,CAAC;QAAE,OAAO,WAAW,CAAA,CAAK,mBAAmB;IAC9D,IAAI,QAAQ,IAAI,CAAC;QAAE,OAAO,WAAW,CAAA,CAAM,sBAAsB;IACjE,OAAO,CAAC,CAAA;AACV,CAAC,CAAA;AAED;;;;;;;GAOG;AACH,MAAM,iBAAiB,GAAG,CACxB,UAA0B,EAC1B,aAAqB,EACrB,cAA4C,EACvB,EAAE;IACvB,OAAO,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE;QAChC,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,WAAW,EAAE,UAAU,EAAE,QAAQ,EAAE,GAAG,EAAE,YAAY,EAAE,GAAG,SAAS,CAAA;QAEzG,+DAA+D;QAC/D,MAAM,YAAY,GAAG,QAAQ,CAAC,YAAY,KAAK,IAAI;YACjD,CAAC,CAAC,aAAa,GAAG,QAAQ,CAAC,YAAY;YACvC,CAAC,CAAC,CAAC,CAAA;QAEL,6EAA6E;QAC7E,MAAM,cAAc,GAAG,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAA;QAE1E,8EAA8E;QAC9E,MAAM,aAAa,GAAG,sBAAsB,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAA;QAElE,uEAAuE;QACvE,4DAA4D;QAC5D,MAAM,aAAa,GAAG,cAAc,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,GAAG,CAAA;QAC7D,MAAM,aAAa,GAAG,cAAc,GAAG,aAAa,CAAA;QAEpD,8CAA8C;QAC9C,uEAAuE;QACvE,mDAAmD;QACnD,gDAAgD;QAChD,MAAM,aAAa,GAAG,GAAG,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;QAE3C,MAAM,cAAc,GAAG,aAAa;YACb,aAAa,GAAG,YAAY;YAC5B,YAAY;YACZ,cAAc;YACd,aAAa;YACb,aAAa,CAAA;QAEpC,OAAO;YACL,GAAG,QAAQ;YACX,cAAc;YACd,SAAS;YACT,WAAW;YACX,YAAY;YACZ,QAAQ,EAAE,GAAG;YACb,QAAQ;YACR,UAAU;YACV,aAAa;SACd,CAAA;IACH,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,GAAG,CAAC,CAAC,cAAc,CAAC,CAAA;AACxD,CAAC,CAAA;AAED;;;GAGG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,KAAK,CAAC,OAAO,CAC/C,gBAAgB,EAChB;IACE,MAAM,EAAE,CAAC,MAAM,EAAE,QAAQ,EAAE,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;IAChD,WAAW,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC;CACzC,CACF,CAAA;AAED;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,KAAK,CAAC,MAAM,CAC9C,gBAAgB,EAChB,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,MAAM,YAAY,GAAG,KAAK,CAAC,CAAC,kBAAkB,CAAA;IAC9C,MAAM,gBAAgB,GAAG,KAAK,CAAC,CAAC,gBAAgB,CAAA;IAChD,MAAM,qBAAqB,GAAG,KAAK,CAAC,CAAC,qBAAqB,CAAA;IAC1D,MAAM,eAAe,GAAG,KAAK,CAAC,CAAC,eAAe,CAAA;IAC9C,8EAA8E;IAC9E,MAAM,2BAA2B,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC,qBAAqB,CAAC,CAAA;IACtF,MAAM,qBAAqB,GAAG,MAAM,CAAC,SAAS,CAAC,2BAA2B,CAAC,CAAA;IAC3E,+EAA+E;IAC/E,MAAM,4BAA4B,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC,sBAAsB,CAAC,CAAA;IACxF,MAAM,sBAAsB,GAAG,MAAM,CAAC,SAAS,CAAC,4BAA4B,CAAC,CAAA;IAE7E,kCAAkC;IAClC,MAAM,gBAAgB,GAAG,KAAK,CAAC,CAAC,YAAY,CAAC,SAAS,CAAC,gBAAgB,CAAC,CAAA;IACxE,MAAM,aAAa,GAAG,gBAAgB,CAAC,CAAC,CAAC,UAAU,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,sBAAsB,CAAA;IAE9F;;;;;;OAMG;IACH,MAAM,cAAc,GAAG,CACrB,KAAa,EACb,SAA8B,EAC9B,cAAc,GAAG,GAAG,EACpB,EAAE,CACF,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;QAClB,iCAAiC;QACjC,MAAM,WAAW,GAAG,KAAK,CAAC,CAAC,eAAe,CAAC,WAAW,EAAE,CAAA;QACxD,IAAI,CAAC,WAAW,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC3C,OAAO,SAAS,CAAA;QAClB,CAAC;QAED,0CAA0C;QAC1C,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAA;QAE/C,sDAAsD;QACtD,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,QAAQ,CACrC,eAAe,CAAC,MAAM,CAAC,KAAK,EAAE,SAAS,CAAC,EACxC,GAAG,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAC3B,CAAA;QAED,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,OAAO,SAAS,CAAA;QAClB,CAAC;QAED,oDAAoD;QACpD,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAA;QAChD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkB,CAAA;QAC/C,QAAQ,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE;YAC/B,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,KAAK,CAAC,CAAA;YACjD,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,EAAE,GAAG,GAAG,CAAC,CAAC,CAAA,CAAC,iBAAiB;QAC/D,CAAC,CAAC,CAAA;QAEF,oFAAoF;QACpF,+EAA+E;QAC/E,OAAO,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;YAC9B,MAAM,aAAa,GAAG,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;YAC/D,MAAM,YAAY,GAAG,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;YAE7D,6EAA6E;YAC7E,MAAM,aAAa,GAAG,sBAAsB,CAC1C,QAAQ,CAAC,QAAQ,EACjB,QAAQ,CAAC,UAAU,EACnB,YAAY,CACb,CAAA;YAED,2CAA2C;YAC3C,MAAM,YAAY,GAAG,CAAC,CAAC,GAAG,cAAc,CAAC,GAAG,QAAQ,CAAC,cAAc;gBAC9C,cAAc,GAAG,aAAa;gBAC9B,aAAa,CAAA;YAElC,OAAO;gBACL,GAAG,QAAQ;gBACX,cAAc,EAAE,YAAY;gBAC5B,aAAa,CAAC,+BAA+B;aAC9C,CAAA;QACH,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,GAAG,CAAC,CAAC,cAAc,CAAC,CAAA;IACxD,CAAC,CAAC,CAAA;IAEJ;;;OAGG;IACH,MAAM,oBAAoB,GAAG,CAAC,OAA0B,EAAE,KAAa,EAAE,EAAE,CACzE,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;QAClB,wBAAwB;QACxB,MAAM,UAAU,GAAmB,EAAE,CAAA;QACrC,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,YAAY,CAAC,UAAU,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;YAC5D,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAA;QAC/B,CAAC;QAED,mDAAmD;QACnD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAuE,CAAA;QAEpG,KAAK,MAAM,OAAO,IAAI,UAAU,EAAE,CAAC;YACjC,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE;gBAC9B,MAAM,IAAI,GAAG,GAAG,GAAG,CAAC,CAAA;gBACpB,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAA;gBACtD,IAAI,CAAC,QAAQ,IAAI,IAAI,GAAG,QAAQ,CAAC,QAAQ,EAAE,CAAC;oBAC1C,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE;wBACpC,QAAQ,EAAE,MAAM,CAAC,QAAQ;wBACzB,QAAQ,EAAE,IAAI;wBACd,SAAS,EAAE,MAAM,CAAC,KAAK;qBACxB,CAAC,CAAA;gBACJ,CAAC;YACH,CAAC,CAAC,CAAA;QACJ,CAAC;QAED,oDAAoD;QACpD,MAAM,MAAM,GAAG,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC;aACvC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC;aACvC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAA;QAEpE,OAAO,MAAM,CAAA;IACf,CAAC,CAAC,CAAA;IAEJ;;;OAGG;IACH,MAAM,mBAAmB,GAAG,CAC1B,KAA0B,EAC1B,OAAyB,EACzB,EAAE,CACF,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;QAClB,MAAM,SAAS,GAAG,OAAO,CAAC,cAAc,CAAA;QACxC,sEAAsE;QACtE,IAAI,CAAC,SAAS,EAAE,OAAO,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,qBAAqB,EAAE,CAAC;YACxE,OAAO,KAAK,CAAA;QACd,CAAC;QAED,2DAA2D;QAC3D,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,CAAA,CAAC,sBAAsB;QACnE,MAAM,aAAa,GAAmB,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACxE,QAAQ,EAAE,CAAC;YACX,KAAK,EAAE,CAAC,CAAC,cAAc;SACxB,CAAC,CAAC,CAAA;QAEH,0DAA0D;QAC1D,MAAM,eAAe,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,QAAQ,CAC5C,qBAAqB,CAAC,MAAM,CAAC,aAAa,EAAE;YAC1C,KAAK,EAAE,SAAS,CAAC,KAAK,IAAI,CAAC;YAC3B,WAAW,EAAE,SAAS,CAAC,WAAW,IAAI,GAAG;YACzC,QAAQ,EAAE,SAAS,CAAC,QAAQ,IAAI,GAAG;YACnC,SAAS,EAAE,SAAS,CAAC,SAAS;SAC/B,CAAC,EACF,GAAG,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAC3B,CAAA;QAED,IAAI,CAAC,eAAe,EAAE,CAAC;YACrB,4DAA4D;YAC5D,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBACrB,GAAG,CAAC;gBACJ,aAAa,EAAE,CAAC;gBAChB,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBACrB,UAAU,EAAE,IAAI;aACjB,CAAC,CAAC,CAAA;QACL,CAAC;QAED,uEAAuE;QACvE,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAE7C,uDAAuD;QACvD,MAAM,aAAa,GAAwB,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACzD,GAAG,CAAC;YACJ,aAAa,EAAE,CAAC;YAChB,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACrB,UAAU,EAAE,IAAI;SACjB,CAAC,CAAC,CAAA;QAEH,yDAAyD;QACzD,gFAAgF;QAChF,MAAM,kBAAkB,GAAwB,eAAe,CAAC,QAAQ;aACrE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;aACxC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACT,GAAG,CAAC,CAAC,QAAQ;YACb,cAAc,EAAE,CAAC,CAAC,YAAY;YAC9B,SAAS,EAAE,CAAC;YACZ,WAAW,EAAE,CAAC;YACd,YAAY,EAAE,qBAAqB,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,CAAC;YACzD,QAAQ,EAAE,CAAC;YACX,QAAQ,EAAE,CAAC;YACX,UAAU,EAAE,CAAC;YACb,aAAa,EAAE,CAAC,CAAC,IAAI;YACrB,aAAa,EAAE,CAAC,CAAC,IAA6B;YAC9C,UAAU,EAAE,CAAC,CAAC,UAAU;SACzB,CAAC,CAAC,CAAA;QAEL,oDAAoD;QACpD,MAAM,MAAM,GAAG,CAAC,GAAG,aAAa,EAAE,GAAG,kBAAkB,CAAC;aACrD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,GAAG,CAAC,CAAC,cAAc,CAAC,CAAA;QAEtD,OAAO,MAAM,CAAA;IACf,CAAC,CAAC,CAAA;IAEJ,OAAO;QACL,MAAM,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,EAAE,CACzB,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;YAClB,MAAM,EAAE,KAAK,GAAG,EAAE,EAAE,QAAQ,GAAG,GAAG,EAAE,GAAG,OAAO,IAAI,EAAE,CAAA;YAEpD,kFAAkF;YAClF,MAAM,eAAe,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,QAAQ,CAC5C,qBAAqB,CAAC,MAAM,CAAC,KAAK,CAAC,EACnC,GAAG,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,KAAK,CAAC,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC,CACjF,CAAA;YAED,sEAAsE;YACtE,MAAM,WAAW,GAAG,KAAK,CAAC,CAAC,oBAAoB,CAAC,eAAe,CAAC,QAAQ,EAAE,KAAK,GAAG,CAAC,CAAC,CAAA;YAEpF,sEAAsE;YACtE,yEAAyE;YACzE,MAAM,cAAc,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,gBAAgB,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAA;YAC1E,MAAM,mBAAmB,GAAG,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,CAAA;YAE5D,4DAA4D;YAC5D,MAAM,uBAAuB,GAAG,KAAK,CAAC,CAAC,YAAY,CAAC,kBAAkB,CAAC,KAAK,GAAG,CAAC,CAAC,CAAA;YAEjF,yCAAyC;YACzC,MAAM,aAAa,GAAG,oBAAoB,CAAC,uBAAuB,EAAE,mBAAmB,CAAC,CAAA;YAExF,oBAAoB;YACpB,MAAM,UAAU,GAAG,iBAAiB,CAAC,WAAW,EAAE,aAAa,CAAC,CAAA;YAEhE,oFAAoF;YACpF,IAAI,cAAuD,CAAA;YAC3D,IAAI,sBAAsB,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACpD,MAAM,WAAW,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAA;gBACtD,cAAc,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,QAAQ,CACrC,sBAAsB,CAAC,iBAAiB,CAAC,WAAW,CAAC,EACrD,GAAG,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAgC,CAAC,CAC/F,CAAA;YACH,CAAC;YAED,uDAAuD;YACvD,MAAM,MAAM,GAAG,iBAAiB,CAAC,UAAU,EAAE,aAAa,EAAE,cAAc,CAAC,CAAA;YAE3E,+DAA+D;YAC/D,MAAM,kBAAkB,GAAG,KAAK,CAAC,CAAC,mBAAmB,CAAC,MAAM,EAAE,OAAO,IAAI,EAAE,CAAC,CAAA;YAE5E,gEAAgE;YAChE,+EAA+E;YAC/E,MAAM,aAAa,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAA;YAC1E,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,cAAc,CAAC,KAAK,EAAE,aAAa,CAAC,CAAA;YAE5D,oCAAoC;YACpC,OAAO,QAAQ;iBACZ,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,cAAc,IAAI,QAAQ,CAAC;iBACzC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;QACpB,CAAC,CAAC;QAEJ,WAAW,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC;KACxC,CAAA;AACH,CAAC,CAAC,CACH,CAAA;AAED;;;;GAIG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,oBAAoB,CAAA"}

package/dist/services/score-service.d.ts

@@ -0,0 +1,43 @@
+import { Context, Effect, Layer } from "effect";
+import { TaskRepository } from "../repo/task-repo.js";
+import { DependencyRepository } from "../repo/dep-repo.js";
+import { TaskNotFoundError, DatabaseError } from "../errors.js";
+import { HierarchyService } from "./hierarchy-service.js";
+import type { Task, TaskId } from "@jamesaphoenix/tx-types";
+/**
+ * Score breakdown showing each adjustment factor (for CLI display)
+ */
+export interface ScoreBreakdown {
+    readonly baseScore: number;
+    readonly blockingBonus: number;
+    readonly blockingCount: number;
+    readonly ageBonus: number;
+    readonly ageHours: number;
+    readonly depthPenalty: number;
+    readonly depth: number;
+    readonly blockedPenalty: number;
+    readonly finalScore: number;
+}
+declare const ScoreService_base: Context.TagClass<ScoreService, "ScoreService", {
+    /**
+     * Calculate the final score with dynamic adjustments
+     */
+    readonly calculate: (task: Task) => Effect.Effect<number, DatabaseError>;
+    /**
+     * Calculate score for a task by ID
+     */
+    readonly calculateById: (id: TaskId) => Effect.Effect<number, TaskNotFoundError | DatabaseError>;
+    /**
+     * Get detailed score breakdown for display
+     */
+    readonly getBreakdown: (task: Task) => Effect.Effect<ScoreBreakdown, DatabaseError>;
+    /**
+     * Get score breakdown by task ID
+     */
+    readonly getBreakdownById: (id: TaskId) => Effect.Effect<ScoreBreakdown, TaskNotFoundError | DatabaseError>;
+}>;
+export declare class ScoreService extends ScoreService_base {
+}
+export declare const ScoreServiceLive: Layer.Layer<ScoreService, never, TaskRepository | DependencyRepository | HierarchyService>;
+export {};
+//# sourceMappingURL=score-service.d.ts.map

package/dist/services/score-service.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"score-service.d.ts","sourceRoot":"","sources":["../../src/services/score-service.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,QAAQ,CAAA;AAC/C,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAA;AACrD,OAAO,EAAE,oBAAoB,EAAE,MAAM,qBAAqB,CAAA;AAC1D,OAAO,EAAE,iBAAiB,EAAE,aAAa,EAAE,MAAM,cAAc,CAAA;AAC/D,OAAO,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAA;AACzD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,yBAAyB,CAAA;AAE3D;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAA;IAC1B,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAA;IAC9B,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAA;IAC9B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;IACzB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;IACzB,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAA;IAC7B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAA;IAC/B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAA;CAC5B;;IAKG;;OAEG;wBACiB,CAAC,IAAI,EAAE,IAAI,KAAK,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC;IAExE;;OAEG;4BACqB,CAAC,EAAE,EAAE,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,iBAAiB,GAAG,aAAa,CAAC;IAEhG;;OAEG;2BACoB,CAAC,IAAI,EAAE,IAAI,KAAK,MAAM,CAAC,MAAM,CAAC,cAAc,EAAE,aAAa,CAAC;IAEnF;;OAEG;+BACwB,CAAC,EAAE,EAAE,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,cAAc,EAAE,iBAAiB,GAAG,aAAa,CAAC;;AArB/G,qBAAa,YAAa,SAAQ,iBAuB/B;CAAG;AAEN,eAAO,MAAM,gBAAgB,4FAoG5B,CAAA"}

package/dist/services/score-service.js

@@ -0,0 +1,82 @@
+import { Context, Effect, Layer } from "effect";
+import { TaskRepository } from "../repo/task-repo.js";
+import { DependencyRepository } from "../repo/dep-repo.js";
+import { TaskNotFoundError } from "../errors.js";
+import { HierarchyService } from "./hierarchy-service.js";
+export class ScoreService extends Context.Tag("ScoreService")() {
+}
+export const ScoreServiceLive = Layer.effect(ScoreService, Effect.gen(function* () {
+    const taskRepo = yield* TaskRepository;
+    const depRepo = yield* DependencyRepository;
+    const hierarchySvc = yield* HierarchyService;
+    const computeBreakdown = (task, blockingCount, depth) => {
+        // Base score from DB
+        const baseScore = task.score;
+        // Blocking bonus: +25 per task this task blocks
+        const blockingBonus = blockingCount * 25;
+        // Age bonus: old tasks shouldn't rot
+        const ageMs = Date.now() - task.createdAt.getTime();
+        const ageHours = ageMs / (1000 * 60 * 60);
+        let ageBonus = 0;
+        if (ageHours > 48) {
+            ageBonus = 100;
+        }
+        else if (ageHours > 24) {
+            ageBonus = 50;
+        }
+        // Depth penalty: prefer root tasks over deep subtasks
+        const depthPenalty = depth * 10;
+        // Blocked status penalty: blocked tasks should not be prioritized
+        const blockedPenalty = task.status === "blocked" ? 1000 : 0;
+        // Final calculation
+        const finalScore = baseScore + blockingBonus + ageBonus - depthPenalty - blockedPenalty;
+        return {
+            baseScore,
+            blockingBonus,
+            blockingCount,
+            ageBonus,
+            ageHours: Math.floor(ageHours),
+            depthPenalty,
+            depth,
+            blockedPenalty,
+            finalScore
+        };
+    };
+    const getTaskContext = (task) => Effect.gen(function* () {
+        // Get how many tasks this task blocks
+        const blockingIds = yield* depRepo.getBlockingIds(task.id);
+        const blockingCount = blockingIds.length;
+        // Get depth in hierarchy
+        const depth = yield* hierarchySvc.getDepth(task.id).pipe(Effect.catchTag("TaskNotFoundError", () => Effect.succeed(0)));
+        return { blockingCount, depth };
+    });
+    return {
+        calculate: (task) => Effect.gen(function* () {
+            const ctx = yield* getTaskContext(task);
+            const breakdown = computeBreakdown(task, ctx.blockingCount, ctx.depth);
+            return breakdown.finalScore;
+        }),
+        calculateById: (id) => Effect.gen(function* () {
+            const task = yield* taskRepo.findById(id);
+            if (!task) {
+                return yield* Effect.fail(new TaskNotFoundError({ id }));
+            }
+            const ctx = yield* getTaskContext(task);
+            const breakdown = computeBreakdown(task, ctx.blockingCount, ctx.depth);
+            return breakdown.finalScore;
+        }),
+        getBreakdown: (task) => Effect.gen(function* () {
+            const ctx = yield* getTaskContext(task);
+            return computeBreakdown(task, ctx.blockingCount, ctx.depth);
+        }),
+        getBreakdownById: (id) => Effect.gen(function* () {
+            const task = yield* taskRepo.findById(id);
+            if (!task) {
+                return yield* Effect.fail(new TaskNotFoundError({ id }));
+            }
+            const ctx = yield* getTaskContext(task);
+            return computeBreakdown(task, ctx.blockingCount, ctx.depth);
+        })
+    };
+}));
+//# sourceMappingURL=score-service.js.map

package/dist/services/score-service.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"score-service.js","sourceRoot":"","sources":["../../src/services/score-service.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,QAAQ,CAAA;AAC/C,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAA;AACrD,OAAO,EAAE,oBAAoB,EAAE,MAAM,qBAAqB,CAAA;AAC1D,OAAO,EAAE,iBAAiB,EAAiB,MAAM,cAAc,CAAA;AAC/D,OAAO,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAA;AAkBzD,MAAM,OAAO,YAAa,SAAQ,OAAO,CAAC,GAAG,CAAC,cAAc,CAAC,EAuB1D;CAAG;AAEN,MAAM,CAAC,MAAM,gBAAgB,GAAG,KAAK,CAAC,MAAM,CAC1C,YAAY,EACZ,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,cAAc,CAAA;IACtC,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,oBAAoB,CAAA;IAC3C,MAAM,YAAY,GAAG,KAAK,CAAC,CAAC,gBAAgB,CAAA;IAE5C,MAAM,gBAAgB,GAAG,CACvB,IAAU,EACV,aAAqB,EACrB,KAAa,EACG,EAAE;QAClB,qBAAqB;QACrB,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAA;QAE5B,gDAAgD;QAChD,MAAM,aAAa,GAAG,aAAa,GAAG,EAAE,CAAA;QAExC,qCAAqC;QACrC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAA;QACnD,MAAM,QAAQ,GAAG,KAAK,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,CAAC,CAAA;QACzC,IAAI,QAAQ,GAAG,CAAC,CAAA;QAChB,IAAI,QAAQ,GAAG,EAAE,EAAE,CAAC;YAClB,QAAQ,GAAG,GAAG,CAAA;QAChB,CAAC;aAAM,IAAI,QAAQ,GAAG,EAAE,EAAE,CAAC;YACzB,QAAQ,GAAG,EAAE,CAAA;QACf,CAAC;QAED,sDAAsD;QACtD,MAAM,YAAY,GAAG,KAAK,GAAG,EAAE,CAAA;QAE/B,kEAAkE;QAClE,MAAM,cAAc,GAAG,IAAI,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;QAE3D,oBAAoB;QACpB,MAAM,UAAU,GAAG,SAAS,GAAG,aAAa,GAAG,QAAQ,GAAG,YAAY,GAAG,cAAc,CAAA;QAEvF,OAAO;YACL,SAAS;YACT,aAAa;YACb,aAAa;YACb,QAAQ;YACR,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC;YAC9B,YAAY;YACZ,KAAK;YACL,cAAc;YACd,UAAU;SACX,CAAA;IACH,CAAC,CAAA;IAED,MAAM,cAAc,GAAG,CAAC,IAAU,EAAE,EAAE,CACpC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;QAClB,sCAAsC;QACtC,MAAM,WAAW,GAAG,KAAK,CAAC,CAAC,OAAO,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAC1D,MAAM,aAAa,GAAG,WAAW,CAAC,MAAM,CAAA;QAExC,yBAAyB;QACzB,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CACtD,MAAM,CAAC,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAC9D,CAAA;QAED,OAAO,EAAE,aAAa,EAAE,KAAK,EAAE,CAAA;IACjC,CAAC,CAAC,CAAA;IAEJ,OAAO;QACL,SAAS,EAAE,CAAC,IAAI,EAAE,EAAE,CAClB,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;YAClB,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;YACvC,MAAM,SAAS,GAAG,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC,aAAa,EAAE,GAAG,CAAC,KAAK,CAAC,CAAA;YACtE,OAAO,SAAS,CAAC,UAAU,CAAA;QAC7B,CAAC,CAAC;QAEJ,aAAa,EAAE,CAAC,EAAE,EAAE,EAAE,CACpB,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;YAClB,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAA;YACzC,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,iBAAiB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAA;YAC1D,CAAC;YACD,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;YACvC,MAAM,SAAS,GAAG,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC,aAAa,EAAE,GAAG,CAAC,KAAK,CAAC,CAAA;YACtE,OAAO,SAAS,CAAC,UAAU,CAAA;QAC7B,CAAC,CAAC;QAEJ,YAAY,EAAE,CAAC,IAAI,EAAE,EAAE,CACrB,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;YAClB,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;YACvC,OAAO,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC,aAAa,EAAE,GAAG,CAAC,KAAK,CAAC,CAAA;QAC7D,CAAC,CAAC;QAEJ,gBAAgB,EAAE,CAAC,EAAE,EAAE,EAAE,CACvB,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;YAClB,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAA;YACzC,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,iBAAiB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAA;YAC1D,CAAC;YACD,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;YACvC,OAAO,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC,aAAa,EAAE,GAAG,CAAC,KAAK,CAAC,CAAA;QAC7D,CAAC,CAAC;KACL,CAAA;AACH,CAAC,CAAC,CACH,CAAA"}