@jamesaphoenix/tx-core 0.4.1

package/dist/services/graph-expansion.js

@@ -0,0 +1,466 @@
+import { Context, Effect, Layer } from "effect";
+import { EdgeService } from "./edge-service.js";
+import { LearningRepository } from "../repo/learning-repo.js";
+import { AnchorRepository } from "../repo/anchor-repo.js";
+import { ValidationError } from "../errors.js";
+import { EDGE_TYPES } from "@jamesaphoenix/tx-types";
+export class GraphExpansionService extends Context.Tag("GraphExpansionService")() {
+}
+/**
+ * Noop implementation that returns seeds without expansion.
+ * Used when graph expansion is disabled or for testing.
+ */
+export const GraphExpansionServiceNoop = Layer.succeed(GraphExpansionService, {
+    expand: (seeds) => Effect.succeed({
+        seeds: seeds.map(s => ({
+            learning: s.learning,
+            hops: 0,
+            decayedScore: s.score,
+            path: [s.learning.id],
+            sourceEdge: null,
+            edgeWeight: null
+        })),
+        expanded: [],
+        all: seeds.map(s => ({
+            learning: s.learning,
+            hops: 0,
+            decayedScore: s.score,
+            path: [s.learning.id],
+            sourceEdge: null,
+            edgeWeight: null
+        })),
+        stats: {
+            seedCount: seeds.length,
+            expandedCount: 0,
+            maxDepthReached: 0,
+            nodesVisited: seeds.length
+        }
+    }),
+    expandFromFiles: (files) => Effect.succeed({
+        anchored: [],
+        expanded: [],
+        all: [],
+        stats: {
+            inputFileCount: files.length,
+            anchoredCount: 0,
+            expandedCount: 0,
+            maxDepthReached: 0,
+            filesVisited: files.length
+        }
+    })
+});
+/**
+ * Default expansion options.
+ */
+const DEFAULT_OPTIONS = {
+    depth: 2,
+    decayFactor: 0.7,
+    maxNodes: 100,
+};
+/**
+ * Type guard to check if edgeTypes is a simple array (backwards compatibility).
+ */
+const isSimpleEdgeTypeArray = (edgeTypes) => {
+    if (edgeTypes === undefined)
+        return true;
+    return Array.isArray(edgeTypes);
+};
+/**
+ * Validate an EdgeTypeFilter for conflicting include/exclude entries.
+ * Returns a ValidationError if the same edge type appears in both include and exclude.
+ */
+const validateEdgeTypeFilter = (filter, context = "edgeTypes") => Effect.gen(function* () {
+    const { include, exclude, perHop } = filter;
+    // Check for overlapping types in include and exclude
+    if (include && exclude) {
+        const includeSet = new Set(include);
+        const overlap = exclude.filter(t => includeSet.has(t));
+        if (overlap.length > 0) {
+            return yield* Effect.fail(new ValidationError({
+                reason: `${context}: conflicting filters - edge types appear in both include and exclude: ${overlap.join(", ")}`
+            }));
+        }
+    }
+    // Recursively validate perHop filters
+    if (perHop) {
+        for (const [hop, hopFilter] of Object.entries(perHop)) {
+            yield* validateEdgeTypeFilter(hopFilter, `${context}.perHop[${hop}]`);
+        }
+    }
+});
+/**
+ * Resolve EdgeTypeFilter to an array of edge types for a specific hop.
+ * Returns undefined if all edge types should be traversed.
+ */
+const resolveEdgeTypesForHop = (filter, hop) => {
+    // Simple array or undefined - pass through
+    if (isSimpleEdgeTypeArray(filter)) {
+        return filter;
+    }
+    // Check for hop-specific override
+    const hopFilter = filter.perHop?.[hop];
+    if (hopFilter) {
+        // Recursively resolve (perHop filters don't have perHop themselves typically)
+        return resolveEdgeTypesForHop(hopFilter, hop);
+    }
+    // Apply include/exclude from base filter
+    const { include, exclude } = filter;
+    if (include && include.length > 0) {
+        return include;
+    }
+    if (exclude && exclude.length > 0) {
+        // Return all edge types except excluded ones
+        return EDGE_TYPES.filter(t => !exclude.includes(t));
+    }
+    // No filtering - return undefined to traverse all
+    return undefined;
+};
+/**
+ * Validate expansion options.
+ */
+const validateOptions = (options) => Effect.gen(function* () {
+    const depth = options.depth ?? DEFAULT_OPTIONS.depth;
+    const decayFactor = options.decayFactor ?? DEFAULT_OPTIONS.decayFactor;
+    const maxNodes = options.maxNodes ?? DEFAULT_OPTIONS.maxNodes;
+    if (depth < 0) {
+        return yield* Effect.fail(new ValidationError({
+            reason: `Expansion depth must be >= 0, got: ${depth}`
+        }));
+    }
+    if (depth > 10) {
+        return yield* Effect.fail(new ValidationError({
+            reason: `Expansion depth must be <= 10, got: ${depth}`
+        }));
+    }
+    if (decayFactor <= 0 || decayFactor > 1) {
+        return yield* Effect.fail(new ValidationError({
+            reason: `Decay factor must be in (0, 1], got: ${decayFactor}`
+        }));
+    }
+    if (maxNodes < 1) {
+        return yield* Effect.fail(new ValidationError({
+            reason: `Max nodes must be >= 1, got: ${maxNodes}`
+        }));
+    }
+    // Validate EdgeTypeFilter if provided
+    if (options.edgeTypes && !isSimpleEdgeTypeArray(options.edgeTypes)) {
+        yield* validateEdgeTypeFilter(options.edgeTypes);
+    }
+});
+export const GraphExpansionServiceLive = Layer.effect(GraphExpansionService, Effect.gen(function* () {
+    const edgeService = yield* EdgeService;
+    const learningRepo = yield* LearningRepository;
+    const anchorRepo = yield* AnchorRepository;
+    return {
+        expand: (seeds, options = {}) => Effect.gen(function* () {
+            // Validate options
+            yield* validateOptions(options);
+            const depth = options.depth ?? DEFAULT_OPTIONS.depth;
+            const decayFactor = options.decayFactor ?? DEFAULT_OPTIONS.decayFactor;
+            const maxNodes = options.maxNodes ?? DEFAULT_OPTIONS.maxNodes;
+            const edgeTypeFilter = options.edgeTypes;
+            // Handle empty seeds
+            if (seeds.length === 0) {
+                return {
+                    seeds: [],
+                    expanded: [],
+                    all: [],
+                    stats: {
+                        seedCount: 0,
+                        expandedCount: 0,
+                        maxDepthReached: 0,
+                        nodesVisited: 0,
+                    },
+                };
+            }
+            // Track visited learning IDs to prevent cycles
+            const visited = new Set();
+            // Convert seeds to ExpandedLearning format
+            const seedLearnings = seeds.map((seed) => {
+                visited.add(seed.learning.id);
+                return {
+                    learning: seed.learning,
+                    hops: 0,
+                    decayedScore: seed.score,
+                    path: [seed.learning.id],
+                    sourceEdge: null,
+                    edgeWeight: null,
+                };
+            });
+            // If depth is 0, just return seeds
+            if (depth === 0) {
+                return {
+                    seeds: seedLearnings,
+                    expanded: [],
+                    all: seedLearnings,
+                    stats: {
+                        seedCount: seedLearnings.length,
+                        expandedCount: 0,
+                        maxDepthReached: 0,
+                        nodesVisited: seedLearnings.length,
+                    },
+                };
+            }
+            let frontier = seeds.map((seed) => ({
+                learningId: seed.learning.id,
+                score: seed.score,
+                path: [seed.learning.id],
+            }));
+            const expanded = [];
+            let maxDepthReached = 0;
+            // BFS traversal
+            for (let currentHop = 1; currentHop <= depth; currentHop++) {
+                if (frontier.length === 0)
+                    break;
+                if (expanded.length >= maxNodes)
+                    break;
+                const nextFrontier = [];
+                for (const node of frontier) {
+                    if (expanded.length >= maxNodes)
+                        break;
+                    // Find neighbors bidirectionally (per PRD-016 resolved question #1)
+                    // Resolve edge types for this specific hop (supports per-hop overrides)
+                    const edgeTypesForHop = resolveEdgeTypesForHop(edgeTypeFilter, currentHop);
+                    const neighbors = yield* edgeService.findNeighbors("learning", String(node.learningId), {
+                        depth: 1,
+                        direction: "both",
+                        edgeTypes: edgeTypesForHop,
+                    });
+                    // Filter to only learning neighbors and process
+                    const learningNeighbors = neighbors.filter((n) => n.nodeType === "learning");
+                    for (const neighbor of learningNeighbors) {
+                        if (expanded.length >= maxNodes)
+                            break;
+                        const neighborId = parseInt(neighbor.nodeId, 10);
+                        if (isNaN(neighborId))
+                            continue;
+                        if (visited.has(neighborId))
+                            continue;
+                        visited.add(neighborId);
+                        // Fetch the learning to include in results
+                        const learning = yield* learningRepo.findById(neighborId);
+                        if (!learning)
+                            continue;
+                        // Calculate decayed score: parentScore * edgeWeight * decayFactor
+                        const newScore = node.score * neighbor.weight * decayFactor;
+                        const newPath = [...node.path, learning.id];
+                        expanded.push({
+                            learning,
+                            hops: currentHop,
+                            decayedScore: newScore,
+                            path: newPath,
+                            sourceEdge: neighbor.edgeType,
+                            edgeWeight: neighbor.weight,
+                        });
+                        maxDepthReached = currentHop;
+                        // Add to next frontier for further expansion
+                        nextFrontier.push({
+                            learningId: learning.id,
+                            score: newScore,
+                            path: newPath,
+                        });
+                    }
+                }
+                frontier = nextFrontier;
+            }
+            // Sort expanded by decayed score (highest first)
+            expanded.sort((a, b) => b.decayedScore - a.decayedScore);
+            // Enforce maxNodes limit on expanded
+            const limitedExpanded = expanded.slice(0, maxNodes);
+            const all = [...seedLearnings, ...limitedExpanded];
+            return {
+                seeds: seedLearnings,
+                expanded: limitedExpanded,
+                all,
+                stats: {
+                    seedCount: seedLearnings.length,
+                    expandedCount: limitedExpanded.length,
+                    maxDepthReached,
+                    nodesVisited: visited.size,
+                },
+            };
+        }),
+        expandFromFiles: (files, options = {}) => Effect.gen(function* () {
+            // Validate options
+            const depth = options.depth ?? DEFAULT_OPTIONS.depth;
+            const decayFactor = options.decayFactor ?? DEFAULT_OPTIONS.decayFactor;
+            const maxNodes = options.maxNodes ?? DEFAULT_OPTIONS.maxNodes;
+            if (depth < 0) {
+                return yield* Effect.fail(new ValidationError({
+                    reason: `Expansion depth must be >= 0, got: ${depth}`
+                }));
+            }
+            if (depth > 10) {
+                return yield* Effect.fail(new ValidationError({
+                    reason: `Expansion depth must be <= 10, got: ${depth}`
+                }));
+            }
+            if (decayFactor <= 0 || decayFactor > 1) {
+                return yield* Effect.fail(new ValidationError({
+                    reason: `Decay factor must be in (0, 1], got: ${decayFactor}`
+                }));
+            }
+            if (maxNodes < 1) {
+                return yield* Effect.fail(new ValidationError({
+                    reason: `Max nodes must be >= 1, got: ${maxNodes}`
+                }));
+            }
+            // Handle empty files input
+            if (files.length === 0) {
+                return {
+                    anchored: [],
+                    expanded: [],
+                    all: [],
+                    stats: {
+                        inputFileCount: 0,
+                        anchoredCount: 0,
+                        expandedCount: 0,
+                        maxDepthReached: 0,
+                        filesVisited: 0,
+                    },
+                };
+            }
+            // Track visited files and learnings to prevent duplicates
+            const visitedFiles = new Set(files);
+            const visitedLearningIds = new Set();
+            // Step 1: Find learnings ANCHORED_TO the input files (hop 0)
+            const anchoredLearnings = [];
+            for (const filePath of files) {
+                const anchors = yield* anchorRepo.findByFilePath(filePath);
+                // Filter to only valid anchors
+                const validAnchors = anchors.filter(a => a.status === "valid");
+                for (const anchor of validAnchors) {
+                    if (visitedLearningIds.has(anchor.learningId))
+                        continue;
+                    visitedLearningIds.add(anchor.learningId);
+                    const learning = yield* learningRepo.findById(anchor.learningId);
+                    if (!learning)
+                        continue;
+                    anchoredLearnings.push({
+                        learning,
+                        sourceFile: filePath,
+                        hops: 0,
+                        decayedScore: 1.0, // Base score for directly anchored learnings
+                        sourceEdge: "ANCHORED_TO",
+                        edgeWeight: null,
+                    });
+                }
+            }
+            // If depth is 0, just return anchored learnings
+            if (depth === 0) {
+                const limitedAnchored = anchoredLearnings.slice(0, maxNodes);
+                return {
+                    anchored: limitedAnchored,
+                    expanded: [],
+                    all: limitedAnchored,
+                    stats: {
+                        inputFileCount: files.length,
+                        anchoredCount: limitedAnchored.length,
+                        expandedCount: 0,
+                        maxDepthReached: 0,
+                        filesVisited: files.length,
+                    },
+                };
+            }
+            let frontier = files.map(f => ({
+                filePath: f,
+                score: 1.0,
+            }));
+            const expandedLearnings = [];
+            let maxDepthReached = 0;
+            const totalLearnings = () => anchoredLearnings.length + expandedLearnings.length;
+            // BFS traversal through file relationships
+            for (let currentHop = 1; currentHop <= depth; currentHop++) {
+                if (frontier.length === 0)
+                    break;
+                if (totalLearnings() >= maxNodes)
+                    break;
+                const nextFrontier = [];
+                for (const node of frontier) {
+                    if (totalLearnings() >= maxNodes)
+                        break;
+                    // Find related files via IMPORTS and CO_CHANGES_WITH edges
+                    // Note: For file nodes, nodeType is "file" and nodeId is the file path
+                    const neighbors = yield* edgeService.findNeighbors("file", node.filePath, {
+                        depth: 1,
+                        direction: "both",
+                        edgeTypes: ["IMPORTS", "CO_CHANGES_WITH"],
+                    });
+                    // Filter to only file neighbors
+                    const fileNeighbors = neighbors.filter((n) => n.nodeType === "file");
+                    for (const neighbor of fileNeighbors) {
+                        if (totalLearnings() >= maxNodes)
+                            break;
+                        const relatedFilePath = neighbor.nodeId;
+                        if (visitedFiles.has(relatedFilePath))
+                            continue;
+                        visitedFiles.add(relatedFilePath);
+                        // Calculate decayed score for this hop
+                        const hopScore = node.score * neighbor.weight * decayFactor;
+                        // Find learnings anchored to this related file
+                        const anchors = yield* anchorRepo.findByFilePath(relatedFilePath);
+                        const validAnchors = anchors.filter(a => a.status === "valid");
+                        for (const anchor of validAnchors) {
+                            if (totalLearnings() >= maxNodes)
+                                break;
+                            if (visitedLearningIds.has(anchor.learningId))
+                                continue;
+                            visitedLearningIds.add(anchor.learningId);
+                            const learning = yield* learningRepo.findById(anchor.learningId);
+                            if (!learning)
+                                continue;
+                            expandedLearnings.push({
+                                learning,
+                                sourceFile: relatedFilePath,
+                                hops: currentHop,
+                                decayedScore: hopScore,
+                                sourceEdge: neighbor.edgeType,
+                                edgeWeight: neighbor.weight,
+                            });
+                            maxDepthReached = currentHop;
+                        }
+                        // Add to next frontier for further expansion
+                        nextFrontier.push({
+                            filePath: relatedFilePath,
+                            score: hopScore,
+                        });
+                    }
+                }
+                frontier = nextFrontier;
+            }
+            // Sort expanded by decayed score (highest first)
+            expandedLearnings.sort((a, b) => b.decayedScore - a.decayedScore);
+            // Enforce maxNodes limit
+            const totalAvailable = anchoredLearnings.length + expandedLearnings.length;
+            let limitedAnchored = anchoredLearnings;
+            let limitedExpanded = expandedLearnings;
+            if (totalAvailable > maxNodes) {
+                // Prioritize anchored learnings, then fill with expanded
+                if (anchoredLearnings.length >= maxNodes) {
+                    limitedAnchored = anchoredLearnings.slice(0, maxNodes);
+                    limitedExpanded = [];
+                }
+                else {
+                    const remainingSlots = maxNodes - anchoredLearnings.length;
+                    limitedExpanded = expandedLearnings.slice(0, remainingSlots);
+                }
+            }
+            // Combine all and sort by decayedScore
+            const all = [...limitedAnchored, ...limitedExpanded];
+            all.sort((a, b) => b.decayedScore - a.decayedScore);
+            return {
+                anchored: limitedAnchored,
+                expanded: limitedExpanded,
+                all,
+                stats: {
+                    inputFileCount: files.length,
+                    anchoredCount: limitedAnchored.length,
+                    expandedCount: limitedExpanded.length,
+                    maxDepthReached,
+                    filesVisited: visitedFiles.size,
+                },
+            };
+        }),
+    };
+}));
+//# sourceMappingURL=graph-expansion.js.map

package/dist/services/graph-expansion.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-expansion.js","sourceRoot":"","sources":["../../src/services/graph-expansion.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,QAAQ,CAAA;AAC/C,OAAO,EAAE,WAAW,EAA0B,MAAM,mBAAmB,CAAA;AACvE,OAAO,EAAE,kBAAkB,EAAE,MAAM,0BAA0B,CAAA;AAC7D,OAAO,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAA;AACzD,OAAO,EAAiB,eAAe,EAAE,MAAM,cAAc,CAAA;AAE7D,OAAO,EAAE,UAAU,EAAE,MAAM,yBAAyB,CAAA;AA+HpD,MAAM,OAAO,qBAAsB,SAAQ,OAAO,CAAC,GAAG,CAAC,uBAAuB,CAAC,EA+B5E;CAAG;AAEN;;;GAGG;AACH,MAAM,CAAC,MAAM,yBAAyB,GAAG,KAAK,CAAC,OAAO,CACpD,qBAAqB,EACrB;IACE,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE,CAChB,MAAM,CAAC,OAAO,CAAC;QACb,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACrB,QAAQ,EAAE,CAAC,CAAC,QAAQ;YACpB,IAAI,EAAE,CAAC;YACP,YAAY,EAAE,CAAC,CAAC,KAAK;YACrB,IAAI,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;YACrB,UAAU,EAAE,IAAI;YAChB,UAAU,EAAE,IAAI;SACjB,CAAC,CAAC;QACH,QAAQ,EAAE,EAAE;QACZ,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACnB,QAAQ,EAAE,CAAC,CAAC,QAAQ;YACpB,IAAI,EAAE,CAAC;YACP,YAAY,EAAE,CAAC,CAAC,KAAK;YACrB,IAAI,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC;YACrB,UAAU,EAAE,IAAI;YAChB,UAAU,EAAE,IAAI;SACjB,CAAC,CAAC;QACH,KAAK,EAAE;YACL,SAAS,EAAE,KAAK,CAAC,MAAM;YACvB,aAAa,EAAE,CAAC;YAChB,eAAe,EAAE,CAAC;YAClB,YAAY,EAAE,KAAK,CAAC,MAAM;SAC3B;KACF,CAAC;IAEJ,eAAe,EAAE,CAAC,KAAK,EAAE,EAAE,CACzB,MAAM,CAAC,OAAO,CAAC;QACb,QAAQ,EAAE,EAAE;QACZ,QAAQ,EAAE,EAAE;QACZ,GAAG,EAAE,EAAE;QACP,KAAK,EAAE;YACL,cAAc,EAAE,KAAK,CAAC,MAAM;YAC5B,aAAa,EAAE,CAAC;YAChB,aAAa,EAAE,CAAC;YAChB,eAAe,EAAE,CAAC;YAClB,YAAY,EAAE,KAAK,CAAC,MAAM;SAC3B;KACF,CAAC;CACL,CACF,CAAA;AAED;;GAEG;AACH,MAAM,eAAe,GAAuD;IAC1E,KAAK,EAAE,CAAC;IACR,WAAW,EAAE,GAAG;IAChB,QAAQ,EAAE,GAAG;CACd,CAAA;AAED;;GAEG;AACH,MAAM,qBAAqB,GAAG,CAC5B,SAA2D,EACb,EAAE;IAChD,IAAI,SAAS,KAAK,SAAS;QAAE,OAAO,IAAI,CAAA;IACxC,OAAO,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAA;AACjC,CAAC,CAAA;AAED;;;GAGG;AACH,MAAM,sBAAsB,GAAG,CAC7B,MAAsB,EACtB,UAAkB,WAAW,EACS,EAAE,CACxC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,MAAM,CAAA;IAE3C,qDAAqD;IACrD,IAAI,OAAO,IAAI,OAAO,EAAE,CAAC;QACvB,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAA;QACnC,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QACtD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,eAAe,CAAC;gBAC5C,MAAM,EAAE,GAAG,OAAO,0EAA0E,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;aACjH,CAAC,CAAC,CAAA;QACL,CAAC;IACH,CAAC;IAED,sCAAsC;IACtC,IAAI,MAAM,EAAE,CAAC;QACX,KAAK,MAAM,CAAC,GAAG,EAAE,SAAS,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YACtD,KAAK,CAAC,CAAC,sBAAsB,CAAC,SAAS,EAAE,GAAG,OAAO,WAAW,GAAG,GAAG,CAAC,CAAA;QACvE,CAAC;IACH,CAAC;AACH,CAAC,CAAC,CAAA;AAEJ;;;GAGG;AACH,MAAM,sBAAsB,GAAG,CAC7B,MAAwD,EACxD,GAAW,EACsB,EAAE;IACnC,2CAA2C;IAC3C,IAAI,qBAAqB,CAAC,MAAM,CAAC,EAAE,CAAC;QAClC,OAAO,MAAM,CAAA;IACf,CAAC;IAED,kCAAkC;IAClC,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAA;IACtC,IAAI,SAAS,EAAE,CAAC;QACd,8EAA8E;QAC9E,OAAO,sBAAsB,CAAC,SAAS,EAAE,GAAG,CAAC,CAAA;IAC/C,CAAC;IAED,yCAAyC;IACzC,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,MAAM,CAAA;IAEnC,IAAI,OAAO,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAClC,OAAO,OAAO,CAAA;IAChB,CAAC;IAED,IAAI,OAAO,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAClC,6CAA6C;QAC7C,OAAO,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAA;IACrD,CAAC;IAED,kDAAkD;IAClD,OAAO,SAAS,CAAA;AAClB,CAAC,CAAA;AAED;;GAEG;AACH,MAAM,eAAe,GAAG,CAAC,OAA8B,EAAwC,EAAE,CAC/F,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,eAAe,CAAC,KAAK,CAAA;IACpD,MAAM,WAAW,GAAG,OAAO,CAAC,WAAW,IAAI,eAAe,CAAC,WAAW,CAAA;IACtE,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,eAAe,CAAC,QAAQ,CAAA;IAE7D,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QACd,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,eAAe,CAAC;YAC5C,MAAM,EAAE,sCAAsC,KAAK,EAAE;SACtD,CAAC,CAAC,CAAA;IACL,CAAC;IAED,IAAI,KAAK,GAAG,EAAE,EAAE,CAAC;QACf,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,eAAe,CAAC;YAC5C,MAAM,EAAE,uCAAuC,KAAK,EAAE;SACvD,CAAC,CAAC,CAAA;IACL,CAAC;IAED,IAAI,WAAW,IAAI,CAAC,IAAI,WAAW,GAAG,CAAC,EAAE,CAAC;QACxC,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,eAAe,CAAC;YAC5C,MAAM,EAAE,wCAAwC,WAAW,EAAE;SAC9D,CAAC,CAAC,CAAA;IACL,CAAC;IAED,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;QACjB,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,eAAe,CAAC;YAC5C,MAAM,EAAE,gCAAgC,QAAQ,EAAE;SACnD,CAAC,CAAC,CAAA;IACL,CAAC;IAED,sCAAsC;IACtC,IAAI,OAAO,CAAC,SAAS,IAAI,CAAC,qBAAqB,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;QACnE,KAAK,CAAC,CAAC,sBAAsB,CAAC,OAAO,CAAC,SAAS,CAAC,CAAA;IAClD,CAAC;AACH,CAAC,CAAC,CAAA;AAEJ,MAAM,CAAC,MAAM,yBAAyB,GAAG,KAAK,CAAC,MAAM,CACnD,qBAAqB,EACrB,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,MAAM,WAAW,GAAG,KAAK,CAAC,CAAC,WAAW,CAAA;IACtC,MAAM,YAAY,GAAG,KAAK,CAAC,CAAC,kBAAkB,CAAA;IAC9C,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC,gBAAgB,CAAA;IAE1C,OAAO;QACL,MAAM,EAAE,CAAC,KAAK,EAAE,OAAO,GAAG,EAAE,EAAE,EAAE,CAC9B,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;YAClB,mBAAmB;YACnB,KAAK,CAAC,CAAC,eAAe,CAAC,OAAO,CAAC,CAAA;YAE/B,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,eAAe,CAAC,KAAK,CAAA;YACpD,MAAM,WAAW,GAAG,OAAO,CAAC,WAAW,IAAI,eAAe,CAAC,WAAW,CAAA;YACtE,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,eAAe,CAAC,QAAQ,CAAA;YAC7D,MAAM,cAAc,GAAG,OAAO,CAAC,SAAS,CAAA;YAExC,qBAAqB;YACrB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACvB,OAAO;oBACL,KAAK,EAAE,EAAE;oBACT,QAAQ,EAAE,EAAE;oBACZ,GAAG,EAAE,EAAE;oBACP,KAAK,EAAE;wBACL,SAAS,EAAE,CAAC;wBACZ,aAAa,EAAE,CAAC;wBAChB,eAAe,EAAE,CAAC;wBAClB,YAAY,EAAE,CAAC;qBAChB;iBACF,CAAA;YACH,CAAC;YAED,+CAA+C;YAC/C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;YAEjC,2CAA2C;YAC3C,MAAM,aAAa,GAAuB,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;gBAC3D,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAA;gBAC7B,OAAO;oBACL,QAAQ,EAAE,IAAI,CAAC,QAAQ;oBACvB,IAAI,EAAE,CAAC;oBACP,YAAY,EAAE,IAAI,CAAC,KAAK;oBACxB,IAAI,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACxB,UAAU,EAAE,IAAI;oBAChB,UAAU,EAAE,IAAI;iBACjB,CAAA;YACH,CAAC,CAAC,CAAA;YAEF,mCAAmC;YACnC,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;gBAChB,OAAO;oBACL,KAAK,EAAE,aAAa;oBACpB,QAAQ,EAAE,EAAE;oBACZ,GAAG,EAAE,aAAa;oBAClB,KAAK,EAAE;wBACL,SAAS,EAAE,aAAa,CAAC,MAAM;wBAC/B,aAAa,EAAE,CAAC;wBAChB,eAAe,EAAE,CAAC;wBAClB,YAAY,EAAE,aAAa,CAAC,MAAM;qBACnC;iBACF,CAAA;YACH,CAAC;YASD,IAAI,QAAQ,GAAmB,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;gBAClD,UAAU,EAAE,IAAI,CAAC,QAAQ,CAAC,EAAE;gBAC5B,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,IAAI,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;aACzB,CAAC,CAAC,CAAA;YAEH,MAAM,QAAQ,GAAuB,EAAE,CAAA;YACvC,IAAI,eAAe,GAAG,CAAC,CAAA;YAEvB,gBAAgB;YAChB,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,UAAU,IAAI,KAAK,EAAE,UAAU,EAAE,EAAE,CAAC;gBAC3D,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;oBAAE,MAAK;gBAChC,IAAI,QAAQ,CAAC,MAAM,IAAI,QAAQ;oBAAE,MAAK;gBAEtC,MAAM,YAAY,GAAmB,EAAE,CAAA;gBAEvC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;oBAC5B,IAAI,QAAQ,CAAC,MAAM,IAAI,QAAQ;wBAAE,MAAK;oBAEtC,oEAAoE;oBACpE,wEAAwE;oBACxE,MAAM,eAAe,GAAG,sBAAsB,CAAC,cAAc,EAAE,UAAU,CAAC,CAAA;oBAC1E,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,WAAW,CAAC,aAAa,CAChD,UAAU,EACV,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,EACvB;wBACE,KAAK,EAAE,CAAC;wBACR,SAAS,EAAE,MAAM;wBACjB,SAAS,EAAE,eAAe;qBAC3B,CACF,CAAA;oBAED,gDAAgD;oBAChD,MAAM,iBAAiB,GAAG,SAAS,CAAC,MAAM,CACxC,CAAC,CAAC,EAAqD,EAAE,CACvD,CAAC,CAAC,QAAQ,KAAK,UAAU,CAC5B,CAAA;oBAED,KAAK,MAAM,QAAQ,IAAI,iBAAiB,EAAE,CAAC;wBACzC,IAAI,QAAQ,CAAC,MAAM,IAAI,QAAQ;4BAAE,MAAK;wBAEtC,MAAM,UAAU,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC,CAAA;wBAChD,IAAI,KAAK,CAAC,UAAU,CAAC;4BAAE,SAAQ;wBAC/B,IAAI,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC;4BAAE,SAAQ;wBAErC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;wBAEvB,2CAA2C;wBAC3C,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAA;wBACzD,IAAI,CAAC,QAAQ;4BAAE,SAAQ;wBAEvB,kEAAkE;wBAClE,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC,MAAM,GAAG,WAAW,CAAA;wBAC3D,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAA;wBAE3C,QAAQ,CAAC,IAAI,CAAC;4BACZ,QAAQ;4BACR,IAAI,EAAE,UAAU;4BAChB,YAAY,EAAE,QAAQ;4BACtB,IAAI,EAAE,OAAO;4BACb,UAAU,EAAE,QAAQ,CAAC,QAAQ;4BAC7B,UAAU,EAAE,QAAQ,CAAC,MAAM;yBAC5B,CAAC,CAAA;wBAEF,eAAe,GAAG,UAAU,CAAA;wBAE5B,6CAA6C;wBAC7C,YAAY,CAAC,IAAI,CAAC;4BAChB,UAAU,EAAE,QAAQ,CAAC,EAAE;4BACvB,KAAK,EAAE,QAAQ;4BACf,IAAI,EAAE,OAAO;yBACd,CAAC,CAAA;oBACJ,CAAC;gBACH,CAAC;gBAED,QAAQ,GAAG,YAAY,CAAA;YACzB,CAAC;YAED,iDAAiD;YACjD,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,YAAY,CAAC,CAAA;YAExD,qCAAqC;YACrC,MAAM,eAAe,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAA;YAEnD,MAAM,GAAG,GAAG,CAAC,GAAG,aAAa,EAAE,GAAG,eAAe,CAAC,CAAA;YAElD,OAAO;gBACL,KAAK,EAAE,aAAa;gBACpB,QAAQ,EAAE,eAAe;gBACzB,GAAG;gBACH,KAAK,EAAE;oBACL,SAAS,EAAE,aAAa,CAAC,MAAM;oBAC/B,aAAa,EAAE,eAAe,CAAC,MAAM;oBACrC,eAAe;oBACf,YAAY,EAAE,OAAO,CAAC,IAAI;iBAC3B;aACF,CAAA;QACH,CAAC,CAAC;QAEJ,eAAe,EAAE,CAAC,KAAK,EAAE,OAAO,GAAG,EAAE,EAAE,EAAE,CACvC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;YAClB,mBAAmB;YACnB,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,IAAI,eAAe,CAAC,KAAK,CAAA;YACpD,MAAM,WAAW,GAAG,OAAO,CAAC,WAAW,IAAI,eAAe,CAAC,WAAW,CAAA;YACtE,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,eAAe,CAAC,QAAQ,CAAA;YAE7D,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;gBACd,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,eAAe,CAAC;oBAC5C,MAAM,EAAE,sCAAsC,KAAK,EAAE;iBACtD,CAAC,CAAC,CAAA;YACL,CAAC;YAED,IAAI,KAAK,GAAG,EAAE,EAAE,CAAC;gBACf,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,eAAe,CAAC;oBAC5C,MAAM,EAAE,uCAAuC,KAAK,EAAE;iBACvD,CAAC,CAAC,CAAA;YACL,CAAC;YAED,IAAI,WAAW,IAAI,CAAC,IAAI,WAAW,GAAG,CAAC,EAAE,CAAC;gBACxC,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,eAAe,CAAC;oBAC5C,MAAM,EAAE,wCAAwC,WAAW,EAAE;iBAC9D,CAAC,CAAC,CAAA;YACL,CAAC;YAED,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;gBACjB,OAAO,KAAK,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,eAAe,CAAC;oBAC5C,MAAM,EAAE,gCAAgC,QAAQ,EAAE;iBACnD,CAAC,CAAC,CAAA;YACL,CAAC;YAED,2BAA2B;YAC3B,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACvB,OAAO;oBACL,QAAQ,EAAE,EAAE;oBACZ,QAAQ,EAAE,EAAE;oBACZ,GAAG,EAAE,EAAE;oBACP,KAAK,EAAE;wBACL,cAAc,EAAE,CAAC;wBACjB,aAAa,EAAE,CAAC;wBAChB,aAAa,EAAE,CAAC;wBAChB,eAAe,EAAE,CAAC;wBAClB,YAAY,EAAE,CAAC;qBAChB;iBACF,CAAA;YACH,CAAC;YAED,0DAA0D;YAC1D,MAAM,YAAY,GAAG,IAAI,GAAG,CAAS,KAAK,CAAC,CAAA;YAC3C,MAAM,kBAAkB,GAAG,IAAI,GAAG,EAAU,CAAA;YAE5C,6DAA6D;YAC7D,MAAM,iBAAiB,GAA2B,EAAE,CAAA;YAEpD,KAAK,MAAM,QAAQ,IAAI,KAAK,EAAE,CAAC;gBAC7B,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,UAAU,CAAC,cAAc,CAAC,QAAQ,CAAC,CAAA;gBAE1D,+BAA+B;gBAC/B,MAAM,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,OAAO,CAAC,CAAA;gBAE9D,KAAK,MAAM,MAAM,IAAI,YAAY,EAAE,CAAC;oBAClC,IAAI,kBAAkB,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC;wBAAE,SAAQ;oBACvD,kBAAkB,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,CAAA;oBAEzC,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,MAAM,CAAC,UAAU,CAAC,CAAA;oBAChE,IAAI,CAAC,QAAQ;wBAAE,SAAQ;oBAEvB,iBAAiB,CAAC,IAAI,CAAC;wBACrB,QAAQ;wBACR,UAAU,EAAE,QAAQ;wBACpB,IAAI,EAAE,CAAC;wBACP,YAAY,EAAE,GAAG,EAAE,6CAA6C;wBAChE,UAAU,EAAE,aAAa;wBACzB,UAAU,EAAE,IAAI;qBACjB,CAAC,CAAA;gBACJ,CAAC;YACH,CAAC;YAED,gDAAgD;YAChD,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;gBAChB,MAAM,eAAe,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAA;gBAC5D,OAAO;oBACL,QAAQ,EAAE,eAAe;oBACzB,QAAQ,EAAE,EAAE;oBACZ,GAAG,EAAE,eAAe;oBACpB,KAAK,EAAE;wBACL,cAAc,EAAE,KAAK,CAAC,MAAM;wBAC5B,aAAa,EAAE,eAAe,CAAC,MAAM;wBACrC,aAAa,EAAE,CAAC;wBAChB,eAAe,EAAE,CAAC;wBAClB,YAAY,EAAE,KAAK,CAAC,MAAM;qBAC3B;iBACF,CAAA;YACH,CAAC;YAQD,IAAI,QAAQ,GAAuB,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBACjD,QAAQ,EAAE,CAAC;gBACX,KAAK,EAAE,GAAG;aACX,CAAC,CAAC,CAAA;YAEH,MAAM,iBAAiB,GAA2B,EAAE,CAAA;YACpD,IAAI,eAAe,GAAG,CAAC,CAAA;YACvB,MAAM,cAAc,GAAG,GAAG,EAAE,CAAC,iBAAiB,CAAC,MAAM,GAAG,iBAAiB,CAAC,MAAM,CAAA;YAEhF,2CAA2C;YAC3C,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,UAAU,IAAI,KAAK,EAAE,UAAU,EAAE,EAAE,CAAC;gBAC3D,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;oBAAE,MAAK;gBAChC,IAAI,cAAc,EAAE,IAAI,QAAQ;oBAAE,MAAK;gBAEvC,MAAM,YAAY,GAAuB,EAAE,CAAA;gBAE3C,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;oBAC5B,IAAI,cAAc,EAAE,IAAI,QAAQ;wBAAE,MAAK;oBAEvC,2DAA2D;oBAC3D,uEAAuE;oBACvE,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,WAAW,CAAC,aAAa,CAChD,MAAM,EACN,IAAI,CAAC,QAAQ,EACb;wBACE,KAAK,EAAE,CAAC;wBACR,SAAS,EAAE,MAAM;wBACjB,SAAS,EAAE,CAAC,SAAS,EAAE,iBAAiB,CAAC;qBAC1C,CACF,CAAA;oBAED,gCAAgC;oBAChC,MAAM,aAAa,GAAG,SAAS,CAAC,MAAM,CACpC,CAAC,CAAC,EAAiD,EAAE,CACnD,CAAC,CAAC,QAAQ,KAAK,MAAM,CACxB,CAAA;oBAED,KAAK,MAAM,QAAQ,IAAI,aAAa,EAAE,CAAC;wBACrC,IAAI,cAAc,EAAE,IAAI,QAAQ;4BAAE,MAAK;wBAEvC,MAAM,eAAe,GAAG,QAAQ,CAAC,MAAM,CAAA;wBACvC,IAAI,YAAY,CAAC,GAAG,CAAC,eAAe,CAAC;4BAAE,SAAQ;wBAC/C,YAAY,CAAC,GAAG,CAAC,eAAe,CAAC,CAAA;wBAEjC,uCAAuC;wBACvC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC,MAAM,GAAG,WAAW,CAAA;wBAE3D,+CAA+C;wBAC/C,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,UAAU,CAAC,cAAc,CAAC,eAAe,CAAC,CAAA;wBACjE,MAAM,YAAY,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,OAAO,CAAC,CAAA;wBAE9D,KAAK,MAAM,MAAM,IAAI,YAAY,EAAE,CAAC;4BAClC,IAAI,cAAc,EAAE,IAAI,QAAQ;gCAAE,MAAK;4BACvC,IAAI,kBAAkB,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC;gCAAE,SAAQ;4BACvD,kBAAkB,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,CAAA;4BAEzC,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,YAAY,CAAC,QAAQ,CAAC,MAAM,CAAC,UAAU,CAAC,CAAA;4BAChE,IAAI,CAAC,QAAQ;gCAAE,SAAQ;4BAEvB,iBAAiB,CAAC,IAAI,CAAC;gCACrB,QAAQ;gCACR,UAAU,EAAE,eAAe;gCAC3B,IAAI,EAAE,UAAU;gCAChB,YAAY,EAAE,QAAQ;gCACtB,UAAU,EAAE,QAAQ,CAAC,QAAQ;gCAC7B,UAAU,EAAE,QAAQ,CAAC,MAAM;6BAC5B,CAAC,CAAA;4BAEF,eAAe,GAAG,UAAU,CAAA;wBAC9B,CAAC;wBAED,6CAA6C;wBAC7C,YAAY,CAAC,IAAI,CAAC;4BAChB,QAAQ,EAAE,eAAe;4BACzB,KAAK,EAAE,QAAQ;yBAChB,CAAC,CAAA;oBACJ,CAAC;gBACH,CAAC;gBAED,QAAQ,GAAG,YAAY,CAAA;YACzB,CAAC;YAED,iDAAiD;YACjD,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,YAAY,CAAC,CAAA;YAEjE,yBAAyB;YACzB,MAAM,cAAc,GAAG,iBAAiB,CAAC,MAAM,GAAG,iBAAiB,CAAC,MAAM,CAAA;YAC1E,IAAI,eAAe,GAAG,iBAAiB,CAAA;YACvC,IAAI,eAAe,GAAG,iBAAiB,CAAA;YAEvC,IAAI,cAAc,GAAG,QAAQ,EAAE,CAAC;gBAC9B,yDAAyD;gBACzD,IAAI,iBAAiB,CAAC,MAAM,IAAI,QAAQ,EAAE,CAAC;oBACzC,eAAe,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAA;oBACtD,eAAe,GAAG,EAAE,CAAA;gBACtB,CAAC;qBAAM,CAAC;oBACN,MAAM,cAAc,GAAG,QAAQ,GAAG,iBAAiB,CAAC,MAAM,CAAA;oBAC1D,eAAe,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC,CAAA;gBAC9D,CAAC;YACH,CAAC;YAED,uCAAuC;YACvC,MAAM,GAAG,GAAG,CAAC,GAAG,eAAe,EAAE,GAAG,eAAe,CAAC,CAAA;YACpD,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC,YAAY,CAAC,CAAA;YAEnD,OAAO;gBACL,QAAQ,EAAE,eAAe;gBACzB,QAAQ,EAAE,eAAe;gBACzB,GAAG;gBACH,KAAK,EAAE;oBACL,cAAc,EAAE,KAAK,CAAC,MAAM;oBAC5B,aAAa,EAAE,eAAe,CAAC,MAAM;oBACrC,aAAa,EAAE,eAAe,CAAC,MAAM;oBACrC,eAAe;oBACf,YAAY,EAAE,YAAY,CAAC,IAAI;iBAChC;aACF,CAAA;QACH,CAAC,CAAC;KACL,CAAA;AACH,CAAC,CAAC,CACH,CAAA"}

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

@@ -0,0 +1,16 @@
+import { Context, Effect, Layer } from "effect";
+import { TaskRepository } from "../repo/task-repo.js";
+import { TaskNotFoundError, DatabaseError } from "../errors.js";
+import type { Task, TaskId, TaskTree } from "@jamesaphoenix/tx-types";
+declare const HierarchyService_base: Context.TagClass<HierarchyService, "HierarchyService", {
+    readonly getChildren: (id: TaskId) => Effect.Effect<readonly Task[], TaskNotFoundError | DatabaseError>;
+    readonly getAncestors: (id: TaskId) => Effect.Effect<readonly Task[], TaskNotFoundError | DatabaseError>;
+    readonly getTree: (id: TaskId) => Effect.Effect<TaskTree, TaskNotFoundError | DatabaseError>;
+    readonly getDepth: (id: TaskId) => Effect.Effect<number, TaskNotFoundError | DatabaseError>;
+    readonly getRoots: () => Effect.Effect<readonly Task[], DatabaseError>;
+}>;
+export declare class HierarchyService extends HierarchyService_base {
+}
+export declare const HierarchyServiceLive: Layer.Layer<HierarchyService, never, TaskRepository>;
+export {};
+//# sourceMappingURL=hierarchy-service.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"hierarchy-service.d.ts","sourceRoot":"","sources":["../../src/services/hierarchy-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,iBAAiB,EAAE,aAAa,EAAE,MAAM,cAAc,CAAA;AAC/D,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAA;;0BAK3C,CAAC,EAAE,EAAE,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,SAAS,IAAI,EAAE,EAAE,iBAAiB,GAAG,aAAa,CAAC;2BAChF,CAAC,EAAE,EAAE,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,SAAS,IAAI,EAAE,EAAE,iBAAiB,GAAG,aAAa,CAAC;sBACtF,CAAC,EAAE,EAAE,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,iBAAiB,GAAG,aAAa,CAAC;uBACzE,CAAC,EAAE,EAAE,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,iBAAiB,GAAG,aAAa,CAAC;uBACxE,MAAM,MAAM,CAAC,MAAM,CAAC,SAAS,IAAI,EAAE,EAAE,aAAa,CAAC;;AAP1E,qBAAa,gBAAiB,SAAQ,qBASnC;CAAG;AAEN,eAAO,MAAM,oBAAoB,sDAyEhC,CAAA"}

package/dist/services/hierarchy-service.js

@@ -0,0 +1,66 @@
+import { Context, Effect, Layer } from "effect";
+import { TaskRepository } from "../repo/task-repo.js";
+import { TaskNotFoundError } from "../errors.js";
+export class HierarchyService extends Context.Tag("HierarchyService")() {
+}
+export const HierarchyServiceLive = Layer.effect(HierarchyService, Effect.gen(function* () {
+    const taskRepo = yield* TaskRepository;
+    const buildTree = (task) => Effect.gen(function* () {
+        const childTasks = yield* taskRepo.findByParent(task.id);
+        const childTrees = [];
+        for (const child of childTasks) {
+            childTrees.push(yield* buildTree(child));
+        }
+        return { task, children: childTrees };
+    });
+    return {
+        getChildren: (id) => Effect.gen(function* () {
+            const task = yield* taskRepo.findById(id);
+            if (!task) {
+                return yield* Effect.fail(new TaskNotFoundError({ id }));
+            }
+            return yield* taskRepo.findByParent(id);
+        }),
+        getAncestors: (id) => Effect.gen(function* () {
+            const task = yield* taskRepo.findById(id);
+            if (!task) {
+                return yield* Effect.fail(new TaskNotFoundError({ id }));
+            }
+            const ancestors = [];
+            let currentId = task.parentId;
+            while (currentId !== null) {
+                const parent = yield* taskRepo.findById(currentId);
+                if (!parent)
+                    break;
+                ancestors.push(parent);
+                currentId = parent.parentId;
+            }
+            return ancestors;
+        }),
+        getTree: (id) => Effect.gen(function* () {
+            const task = yield* taskRepo.findById(id);
+            if (!task) {
+                return yield* Effect.fail(new TaskNotFoundError({ id }));
+            }
+            return yield* buildTree(task);
+        }),
+        getDepth: (id) => Effect.gen(function* () {
+            const task = yield* taskRepo.findById(id);
+            if (!task) {
+                return yield* Effect.fail(new TaskNotFoundError({ id }));
+            }
+            let depth = 0;
+            let currentId = task.parentId;
+            while (currentId !== null) {
+                const parent = yield* taskRepo.findById(currentId);
+                if (!parent)
+                    break;
+                depth++;
+                currentId = parent.parentId;
+            }
+            return depth;
+        }),
+        getRoots: () => taskRepo.findByParent(null)
+    };
+}));
+//# sourceMappingURL=hierarchy-service.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"hierarchy-service.js","sourceRoot":"","sources":["../../src/services/hierarchy-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,iBAAiB,EAAiB,MAAM,cAAc,CAAA;AAG/D,MAAM,OAAO,gBAAiB,SAAQ,OAAO,CAAC,GAAG,CAAC,kBAAkB,CAAC,EASlE;CAAG;AAEN,MAAM,CAAC,MAAM,oBAAoB,GAAG,KAAK,CAAC,MAAM,CAC9C,gBAAgB,EAChB,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;IAClB,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,cAAc,CAAA;IAEtC,MAAM,SAAS,GAAG,CAAC,IAAU,EAA0C,EAAE,CACvE,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;QAClB,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC,QAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QACxD,MAAM,UAAU,GAAe,EAAE,CAAA;QACjC,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;YAC/B,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAA;QAC1C,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,CAAA;IACvC,CAAC,CAAC,CAAA;IAEJ,OAAO;QACL,WAAW,EAAE,CAAC,EAAE,EAAE,EAAE,CAClB,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,OAAO,KAAK,CAAC,CAAC,QAAQ,CAAC,YAAY,CAAC,EAAE,CAAC,CAAA;QACzC,CAAC,CAAC;QAEJ,YAAY,EAAE,CAAC,EAAE,EAAE,EAAE,CACnB,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;YAED,MAAM,SAAS,GAAW,EAAE,CAAA;YAC5B,IAAI,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAA;YAC7B,OAAO,SAAS,KAAK,IAAI,EAAE,CAAC;gBAC1B,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAA;gBAClD,IAAI,CAAC,MAAM;oBAAE,MAAK;gBAClB,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;gBACtB,SAAS,GAAG,MAAM,CAAC,QAAQ,CAAA;YAC7B,CAAC;YACD,OAAO,SAAS,CAAA;QAClB,CAAC,CAAC;QAEJ,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,CACd,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,OAAO,KAAK,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,CAAA;QAC/B,CAAC,CAAC;QAEJ,QAAQ,EAAE,CAAC,EAAE,EAAE,EAAE,CACf,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;YAED,IAAI,KAAK,GAAG,CAAC,CAAA;YACb,IAAI,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAA;YAC7B,OAAO,SAAS,KAAK,IAAI,EAAE,CAAC;gBAC1B,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAA;gBAClD,IAAI,CAAC,MAAM;oBAAE,MAAK;gBAClB,KAAK,EAAE,CAAA;gBACP,SAAS,GAAG,MAAM,CAAC,QAAQ,CAAA;YAC7B,CAAC;YACD,OAAO,KAAK,CAAA;QACd,CAAC,CAAC;QAEJ,QAAQ,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC,YAAY,CAAC,IAAI,CAAC;KAC5C,CAAA;AACH,CAAC,CAAC,CACH,CAAA"}

package/dist/services/index.d.ts

@@ -0,0 +1,36 @@
+/**
+ * @tx/core/services - Service exports
+ */
+export { TaskService, TaskServiceLive } from "./task-service.js";
+export { DependencyService, DependencyServiceLive } from "./dep-service.js";
+export { ReadyService, ReadyServiceLive } from "./ready-service.js";
+export { HierarchyService, HierarchyServiceLive } from "./hierarchy-service.js";
+export { ScoreService, ScoreServiceLive, type ScoreBreakdown } from "./score-service.js";
+export { LearningService, LearningServiceLive } from "./learning-service.js";
+export { FileLearningService, FileLearningServiceLive } from "./file-learning-service.js";
+export { AttemptService, AttemptServiceLive } from "./attempt-service.js";
+export { EmbeddingService, EmbeddingServiceNoop, EmbeddingServiceLive, EmbeddingServiceOpenAI, EmbeddingServiceAuto, createEmbedderLayer, type EmbedderConfig } from "./embedding-service.js";
+export { QueryExpansionService, QueryExpansionServiceNoop, QueryExpansionServiceLive, QueryExpansionServiceAuto, QueryExpansionUnavailableError, type QueryExpansionResult } from "./query-expansion-service.js";
+export { RerankerService, RerankerServiceNoop, RerankerServiceLive, RerankerServiceAuto, type RerankerResult } from "./reranker-service.js";
+export { SyncService, SyncServiceLive, type ExportResult, type ImportResult, type SyncStatus, type CompactResult, type ExportOptions, type ExportAllResult, type ImportAllResult } from "./sync-service.js";
+export { MigrationService, MigrationServiceLive, MIGRATIONS, getLatestVersion, type Migration, type AppliedMigration, type MigrationStatus } from "./migration-service.js";
+export { AutoSyncService, AutoSyncServiceLive, AutoSyncServiceNoop, type AutoSyncEntity } from "./auto-sync-service.js";
+export { AnchorService, AnchorServiceLive, type AnchorVerificationResult, type BatchVerificationResult, type TypedAnchorInput, type GraphStatusResult, type PruneResult } from "./anchor-service.js";
+export { EdgeService, EdgeServiceLive, type NeighborWithDepth, type NeighborWithPath, type FindNeighborsOptions } from "./edge-service.js";
+export { DeduplicationService, DeduplicationServiceLive } from "./deduplication-service.js";
+export { CandidateExtractorService, CandidateExtractorServiceNoop, CandidateExtractorServiceAnthropic, CandidateExtractorServiceOpenAI, CandidateExtractorServiceAuto } from "./candidate-extractor-service.js";
+export { RetrieverService, RetrieverServiceNoop, RetrieverServiceLive, RetrieverServiceAuto } from "./retriever-service.js";
+export { GraphExpansionService, GraphExpansionServiceNoop, GraphExpansionServiceLive, type SeedLearning, type ExpandedLearning, type EdgeTypeFilter, type GraphExpansionOptions, type GraphExpansionResult } from "./graph-expansion.js";
+export { AnchorVerificationService, AnchorVerificationServiceLive, getAnchorTTL, isStale, DEFAULT_ANCHOR_CACHE_TTL, type VerificationResult, type VerificationSummary, type VerifyOptions } from "./anchor-verification.js";
+export { SwarmVerificationService, SwarmVerificationServiceLive, calculateMajorityVote, type VerificationBatch, type BatchResult, type SwarmMetrics, type SwarmVerificationResult, type SwarmVerifyOptions, type VoteResult } from "./swarm-verification.js";
+export { AstGrepService, AstGrepServiceLive, AstGrepServiceNoop, AstGrepServiceAuto, EXT_TO_LANGUAGE, DEFAULT_SYMBOL_PATTERNS } from "./ast-grep-service.js";
+export { DaemonService, DaemonServiceLive, DaemonServiceNoop, PID_FILE_PATH, LAUNCHD_PLIST_PATH, writePid, readPid, removePid, isProcessRunning, defaultDaemonConfig, generateLaunchdPlist, generateSystemdService, SYSTEMD_SERVICE_PATH, type DaemonStatus, type DaemonConfig, type LaunchdPlistOptions, type SystemdServiceOptions } from "./daemon-service.js";
+export { FileWatcherService, FileWatcherServiceLive, FileWatcherServiceNoop, type FileEvent, type FileEventType, type FileWatcherConfig, type FileWatcherStatus } from "./file-watcher-service.js";
+export { PromotionService, PromotionServiceLive, type PromotionResult, type AutoPromoteResult } from "./promotion-service.js";
+export { DiversifierService, DiversifierServiceNoop, DiversifierServiceLive, DiversifierServiceAuto } from "./diversifier-service.js";
+export { FeedbackTrackerService, FeedbackTrackerServiceNoop, FeedbackTrackerServiceLive, type LearningUsageFeedback } from "./feedback-tracker.js";
+export { WorkerService, WorkerServiceLive, type WorkerRegistration, type WorkerFilter, type FindDeadConfig } from "./worker-service.js";
+export { ClaimService, ClaimServiceLive } from "./claim-service.js";
+export { OrchestratorService, OrchestratorServiceLive, type OrchestratorConfig } from "./orchestrator-service.js";
+export { runWorkerProcess, type WorkerProcessConfig } from "./worker-process.js";
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/services/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,WAAW,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAA;AAChE,OAAO,EAAE,iBAAiB,EAAE,qBAAqB,EAAE,MAAM,kBAAkB,CAAA;AAC3E,OAAO,EAAE,YAAY,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAA;AACnE,OAAO,EAAE,gBAAgB,EAAE,oBAAoB,EAAE,MAAM,wBAAwB,CAAA;AAC/E,OAAO,EAAE,YAAY,EAAE,gBAAgB,EAAE,KAAK,cAAc,EAAE,MAAM,oBAAoB,CAAA;AACxF,OAAO,EAAE,eAAe,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAA;AAC5E,OAAO,EAAE,mBAAmB,EAAE,uBAAuB,EAAE,MAAM,4BAA4B,CAAA;AACzF,OAAO,EAAE,cAAc,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAA;AACzE,OAAO,EACL,gBAAgB,EAChB,oBAAoB,EACpB,oBAAoB,EACpB,sBAAsB,EACtB,oBAAoB,EACpB,mBAAmB,EACnB,KAAK,cAAc,EACpB,MAAM,wBAAwB,CAAA;AAC/B,OAAO,EACL,qBAAqB,EACrB,yBAAyB,EACzB,yBAAyB,EACzB,yBAAyB,EACzB,8BAA8B,EAC9B,KAAK,oBAAoB,EAC1B,MAAM,8BAA8B,CAAA;AACrC,OAAO,EACL,eAAe,EACf,mBAAmB,EACnB,mBAAmB,EACnB,mBAAmB,EACnB,KAAK,cAAc,EACpB,MAAM,uBAAuB,CAAA;AAC9B,OAAO,EACL,WAAW,EACX,eAAe,EACf,KAAK,YAAY,EACjB,KAAK,YAAY,EACjB,KAAK,UAAU,EACf,KAAK,aAAa,EAClB,KAAK,aAAa,EAClB,KAAK,eAAe,EACpB,KAAK,eAAe,EACrB,MAAM,mBAAmB,CAAA;AAC1B,OAAO,EACL,gBAAgB,EAChB,oBAAoB,EACpB,UAAU,EACV,gBAAgB,EAChB,KAAK,SAAS,EACd,KAAK,gBAAgB,EACrB,KAAK,eAAe,EACrB,MAAM,wBAAwB,CAAA;AAC/B,OAAO,EACL,eAAe,EACf,mBAAmB,EACnB,mBAAmB,EACnB,KAAK,cAAc,EACpB,MAAM,wBAAwB,CAAA;AAC/B,OAAO,EACL,aAAa,EACb,iBAAiB,EACjB,KAAK,wBAAwB,EAC7B,KAAK,uBAAuB,EAC5B,KAAK,gBAAgB,EACrB,KAAK,iBAAiB,EACtB,KAAK,WAAW,EACjB,MAAM,qBAAqB,CAAA;AAC5B,OAAO,EACL,WAAW,EACX,eAAe,EACf,KAAK,iBAAiB,EACtB,KAAK,gBAAgB,EACrB,KAAK,oBAAoB,EAC1B,MAAM,mBAAmB,CAAA;AAC1B,OAAO,EACL,oBAAoB,EACpB,wBAAwB,EACzB,MAAM,4BAA4B,CAAA;AACnC,OAAO,EACL,yBAAyB,EACzB,6BAA6B,EAC7B,kCAAkC,EAClC,+BAA+B,EAC/B,6BAA6B,EAC9B,MAAM,kCAAkC,CAAA;AACzC,OAAO,EACL,gBAAgB,EAChB,oBAAoB,EACpB,oBAAoB,EACpB,oBAAoB,EACrB,MAAM,wBAAwB,CAAA;AAC/B,OAAO,EACL,qBAAqB,EACrB,yBAAyB,EACzB,yBAAyB,EACzB,KAAK,YAAY,EACjB,KAAK,gBAAgB,EACrB,KAAK,cAAc,EACnB,KAAK,qBAAqB,EAC1B,KAAK,oBAAoB,EAC1B,MAAM,sBAAsB,CAAA;AAC7B,OAAO,EACL,yBAAyB,EACzB,6BAA6B,EAC7B,YAAY,EACZ,OAAO,EACP,wBAAwB,EACxB,KAAK,kBAAkB,EACvB,KAAK,mBAAmB,EACxB,KAAK,aAAa,EACnB,MAAM,0BAA0B,CAAA;AACjC,OAAO,EACL,wBAAwB,EACxB,4BAA4B,EAC5B,qBAAqB,EACrB,KAAK,iBAAiB,EACtB,KAAK,WAAW,EAChB,KAAK,YAAY,EACjB,KAAK,uBAAuB,EAC5B,KAAK,kBAAkB,EACvB,KAAK,UAAU,EAChB,MAAM,yBAAyB,CAAA;AAChC,OAAO,EACL,cAAc,EACd,kBAAkB,EAClB,kBAAkB,EAClB,kBAAkB,EAClB,eAAe,EACf,uBAAuB,EACxB,MAAM,uBAAuB,CAAA;AAC9B,OAAO,EACL,aAAa,EACb,iBAAiB,EACjB,iBAAiB,EACjB,aAAa,EACb,kBAAkB,EAClB,QAAQ,EACR,OAAO,EACP,SAAS,EACT,gBAAgB,EAChB,mBAAmB,EACnB,oBAAoB,EACpB,sBAAsB,EACtB,oBAAoB,EACpB,KAAK,YAAY,EACjB,KAAK,YAAY,EACjB,KAAK,mBAAmB,EACxB,KAAK,qBAAqB,EAC3B,MAAM,qBAAqB,CAAA;AAC5B,OAAO,EACL,kBAAkB,EAClB,sBAAsB,EACtB,sBAAsB,EACtB,KAAK,SAAS,EACd,KAAK,aAAa,EAClB,KAAK,iBAAiB,EACtB,KAAK,iBAAiB,EACvB,MAAM,2BAA2B,CAAA;AAClC,OAAO,EACL,gBAAgB,EAChB,oBAAoB,EACpB,KAAK,eAAe,EACpB,KAAK,iBAAiB,EACvB,MAAM,wBAAwB,CAAA;AAC/B,OAAO,EACL,kBAAkB,EAClB,sBAAsB,EACtB,sBAAsB,EACtB,sBAAsB,EACvB,MAAM,0BAA0B,CAAA;AACjC,OAAO,EACL,sBAAsB,EACtB,0BAA0B,EAC1B,0BAA0B,EAC1B,KAAK,qBAAqB,EAC3B,MAAM,uBAAuB,CAAA;AAC9B,OAAO,EACL,aAAa,EACb,iBAAiB,EACjB,KAAK,kBAAkB,EACvB,KAAK,YAAY,EACjB,KAAK,cAAc,EACpB,MAAM,qBAAqB,CAAA;AAC5B,OAAO,EACL,YAAY,EACZ,gBAAgB,EACjB,MAAM,oBAAoB,CAAA;AAC3B,OAAO,EACL,mBAAmB,EACnB,uBAAuB,EACvB,KAAK,kBAAkB,EACxB,MAAM,2BAA2B,CAAA;AAClC,OAAO,EACL,gBAAgB,EAChB,KAAK,mBAAmB,EACzB,MAAM,qBAAqB,CAAA"}