opencode-telos 1.0.0

package/dist/sdd/graph/integrity.js

@@ -0,0 +1,462 @@
+import { getNode, addRelationship, } from "./engine.js";
+// ─── Main Entry Point ──────────────────────────────────────────────
+/**
+ * Runs a full integrity check on the graph and optionally fixes issues.
+ * This should be called after any graph mutation (add/remove node or relationship).
+ */
+export function ensureGraphIntegrity(graph, options = {}) {
+    const autoFix = options.auto_fix ?? true;
+    const report = {
+        orphan_nodes: [],
+        disconnected_groups: [],
+        redundant_relationships: [],
+        fixes_applied: [],
+        summary: {
+            total_nodes: graph.nodes.length,
+            total_relationships: graph.relationships.length,
+            orphans_found: 0,
+            disconnected_groups_found: 0,
+            redundant_relationships_found: 0,
+            fixes_applied: 0,
+            graph_connected: false,
+        },
+    };
+    // Build focus node set for targeted checks
+    const focusSet = options.focusNodeIds ? new Set(options.focusNodeIds) : null;
+    const skipChecks = new Set(options.skipChecks || []);
+    // Filter graph to focus nodes if specified
+    const graphToCheck = focusSet ? filterGraphToFocus(graph, focusSet) : graph;
+    // Step 1: Detect and fix redundant relationships first (before connectivity)
+    if (!skipChecks.has("redundant")) {
+        report.redundant_relationships = detectRedundantRelationships(graphToCheck);
+        report.summary.redundant_relationships_found = report.redundant_relationships.length;
+        if (autoFix) {
+            for (const redundant of report.redundant_relationships) {
+                removeRedundantRelationship(graph, redundant);
+                report.fixes_applied.push({
+                    action: redundant.reason === "self_loop" ? "removed_self_loop" : redundant.reason === "duplicate" ? "removed_duplicate" : "removed_reversed",
+                    details: `Removed ${redundant.reason}: ${redundant.from} → ${redundant.to} (${redundant.type})`,
+                    relationship: { from: redundant.from, to: redundant.to, type: redundant.type },
+                });
+            }
+        }
+    }
+    // Step 2: Detect orphan nodes (no relationships at all)
+    if (!skipChecks.has("orphans")) {
+        report.orphan_nodes = detectOrphanNodes(graphToCheck);
+        if (options.maxOrphans && report.orphan_nodes.length > options.maxOrphans) {
+            report.orphan_nodes = report.orphan_nodes.slice(0, options.maxOrphans);
+        }
+        report.summary.orphans_found = report.orphan_nodes.length;
+        if (autoFix) {
+            for (const orphan of report.orphan_nodes) {
+                const fix = connectOrphanNode(graph, orphan);
+                if (fix)
+                    report.fixes_applied.push(fix);
+            }
+        }
+    }
+    // Step 3: Detect disconnected subgraphs
+    if (!skipChecks.has("disconnected")) {
+        // Check connectivity cache
+        const graphHash = `${graphToCheck.nodes.length}:${graphToCheck.relationships.length}`;
+        const cachedConnectivity = options?.connectivityCache?.get(graphHash);
+        const cacheMaxAge = 30000; // 30 seconds
+        if (cachedConnectivity && (Date.now() - cachedConnectivity.timestamp) < cacheMaxAge) {
+            report.disconnected_groups = options.maxGroups ? cachedConnectivity.groups.slice(0, options.maxGroups) : cachedConnectivity.groups;
+            report.summary.disconnected_groups_found = cachedConnectivity.groups.length;
+            report.summary.graph_connected = cachedConnectivity.connected;
+        }
+        else {
+            const { mainGroup, disconnectedGroups } = detectDisconnectedGroups(graphToCheck);
+            if (options.maxGroups && disconnectedGroups.length > options.maxGroups) {
+                report.disconnected_groups = disconnectedGroups.slice(0, options.maxGroups);
+            }
+            else {
+                report.disconnected_groups = disconnectedGroups;
+            }
+            report.summary.disconnected_groups_found = disconnectedGroups.length;
+            report.summary.graph_connected = disconnectedGroups.length === 0;
+            // Store in cache
+            if (options?.connectivityCache) {
+                options.connectivityCache.set(graphHash, {
+                    connected: disconnectedGroups.length === 0,
+                    groups: disconnectedGroups,
+                    timestamp: Date.now(),
+                });
+            }
+        }
+        if (autoFix) {
+            for (const group of report.disconnected_groups) {
+                const fix = connectDisconnectedGroup(graph, group, { nodeIds: new Set(graph.nodes.map(n => n.id)), representative: graph.project_id });
+                if (fix)
+                    report.fixes_applied.push(fix);
+            }
+        }
+    }
+    report.summary.fixes_applied = report.fixes_applied.length;
+    return report;
+}
+/**
+ * Filter a graph to only include focus nodes and their immediate neighbors.
+ */
+function filterGraphToFocus(graph, focusIds) {
+    const neighborIds = new Set();
+    for (const rel of graph.relationships) {
+        if (focusIds.has(rel.from))
+            neighborIds.add(rel.to);
+        if (focusIds.has(rel.to))
+            neighborIds.add(rel.from);
+    }
+    const includeIds = new Set([...focusIds, ...neighborIds]);
+    return {
+        ...graph,
+        nodes: graph.nodes.filter(n => includeIds.has(n.id)),
+        relationships: graph.relationships.filter(r => includeIds.has(r.from) && includeIds.has(r.to)),
+    };
+}
+// ─── Redundant Relationship Detection ──────────────────────────────
+function detectRedundantRelationships(graph) {
+    const redundants = [];
+    const seen = new Set();
+    for (const rel of graph.relationships) {
+        // Self-loops are always redundant
+        if (rel.from === rel.to) {
+            redundants.push({
+                relationship_id: rel.id,
+                from: rel.from,
+                to: rel.to,
+                type: rel.type,
+                reason: "self_loop",
+            });
+            continue;
+        }
+        // Exact duplicates (same from, to, type)
+        const key = `${rel.from}||${rel.to}||${rel.type}`;
+        if (seen.has(key)) {
+            redundants.push({
+                relationship_id: rel.id,
+                from: rel.from,
+                to: rel.to,
+                type: rel.type,
+                reason: "duplicate",
+            });
+            continue;
+        }
+        seen.add(key);
+        // Reversed relationship exists (A→B and B→A with same type)
+        const reverseKey = `${rel.to}||${rel.from}||${rel.type}`;
+        if (seen.has(reverseKey)) {
+            // Only flag if the relationship is not bidirectional by design
+            if (!isBidirectionalType(rel.type)) {
+                redundants.push({
+                    relationship_id: rel.id,
+                    from: rel.from,
+                    to: rel.to,
+                    type: rel.type,
+                    reason: "reversed_exists",
+                });
+            }
+        }
+    }
+    return redundants;
+}
+function isBidirectionalType(type) {
+    // Some relationship types are naturally bidirectional
+    const bidirectional = new Set([
+        "contradicts",
+        "supersedes",
+        "blocked_by",
+    ]);
+    return bidirectional.has(type);
+}
+function removeRedundantRelationship(graph, redundant) {
+    // Find and remove the actual relationship object
+    const idx = graph.relationships.findIndex((r) => r.from === redundant.from && r.to === redundant.to && r.type === redundant.type);
+    if (idx !== -1) {
+        graph.relationships.splice(idx, 1);
+        graph.metadata.updated_at = new Date().toISOString();
+    }
+}
+// ─── Orphan Node Detection ─────────────────────────────────────────
+function detectOrphanNodes(graph) {
+    const orphans = [];
+    const relatedIds = new Set();
+    for (const rel of graph.relationships) {
+        relatedIds.add(rel.from);
+        relatedIds.add(rel.to);
+    }
+    for (const node of graph.nodes) {
+        if (relatedIds.has(node.id))
+            continue;
+        orphans.push({
+            node_id: node.id,
+            node_name: node.name,
+            node_type: node.type,
+        });
+    }
+    return orphans;
+}
+function connectOrphanNode(graph, orphan) {
+    const projectId = graph.project_id;
+    const projectNode = getNode(graph, projectId);
+    if (!projectNode)
+        return null;
+    // Strategy: connect to project root with "contains" relationship
+    try {
+        addRelationship(graph, projectId, orphan.node_id, "contains");
+        return {
+            action: "connected_orphan",
+            details: `Connected orphan "${orphan.node_name}" (${orphan.node_type}) to project root`,
+            relationship: { from: projectId, to: orphan.node_id, type: "contains" },
+        };
+    }
+    catch {
+        // Relationship might already exist
+        return null;
+    }
+}
+function detectDisconnectedGroups(graph) {
+    const projectId = graph.project_id;
+    const visited = new Set();
+    const allGroups = [];
+    // Build adjacency list for BFS
+    const adj = new Map();
+    for (const node of graph.nodes) {
+        adj.set(node.id, new Set());
+    }
+    for (const rel of graph.relationships) {
+        adj.get(rel.from)?.add(rel.to);
+        adj.get(rel.to)?.add(rel.from);
+    }
+    // Find all connected components via BFS
+    for (const node of graph.nodes) {
+        if (visited.has(node.id))
+            continue;
+        const group = new Set();
+        const queue = [node.id];
+        visited.add(node.id);
+        while (queue.length > 0) {
+            const current = queue.shift();
+            group.add(current);
+            for (const neighbor of adj.get(current) || []) {
+                if (!visited.has(neighbor)) {
+                    visited.add(neighbor);
+                    queue.push(neighbor);
+                }
+            }
+        }
+        allGroups.push({ nodeIds: group, representative: node.id });
+    }
+    // The main group is the one containing the project root
+    const mainGroup = allGroups.find((g) => g.nodeIds.has(projectId)) || allGroups[0];
+    // All other groups are disconnected
+    const disconnectedGroups = [];
+    let groupId = 0;
+    for (const group of allGroups) {
+        if (group === mainGroup)
+            continue;
+        if (group.nodeIds.size === 0)
+            continue;
+        groupId++;
+        const nodeIds = [...group.nodeIds];
+        const nodeNames = nodeIds
+            .map((id) => getNode(graph, id))
+            .filter(Boolean)
+            .map((n) => n.name);
+        // Find the best connection target for this group
+        const suggestedConnection = findBestConnectionTarget(graph, group, mainGroup);
+        disconnectedGroups.push({
+            group_id: groupId,
+            node_ids: nodeIds,
+            node_names: nodeNames,
+            size: group.nodeIds.size,
+            suggested_connection: suggestedConnection,
+        });
+    }
+    return { mainGroup, disconnectedGroups };
+}
+function findBestConnectionTarget(graph, group, mainGroup) {
+    // Strategy 1: Find nodes in the group that share a type with nodes in the main group
+    // and suggest connecting them
+    const groupNodes = [...group.nodeIds]
+        .map((id) => getNode(graph, id))
+        .filter(Boolean);
+    const mainNodes = [...mainGroup.nodeIds]
+        .map((id) => getNode(graph, id))
+        .filter(Boolean);
+    // Try to find a semantic connection
+    for (const groupNode of groupNodes) {
+        for (const mainNode of mainNodes) {
+            const relType = suggestRelationshipType(groupNode, mainNode);
+            if (relType) {
+                return {
+                    target_id: mainNode.id,
+                    target_name: mainNode.name,
+                    relationship_type: relType,
+                };
+            }
+        }
+    }
+    // Fallback: connect to project root
+    const projectId = graph.project_id;
+    return {
+        target_id: projectId,
+        target_name: "Project Root",
+        relationship_type: "contains",
+    };
+}
+function suggestRelationshipType(source, target) {
+    const s = source.type;
+    const t = target.type;
+    // Semantic connection rules based on node types
+    const rules = [
+        // Features use entities and architecture
+        ["feature", "entity", "uses"],
+        ["feature", "architecture_component", "uses"],
+        ["feature", "requirement", "satisfied_by"],
+        // Requirements
+        ["requirement", "feature", "implemented_by"],
+        ["requirement", "task", "implemented_by"],
+        // Endpoints expose entities
+        ["endpoint", "entity", "exposes"],
+        ["api", "endpoint", "contains"],
+        // Entities persist to database
+        ["entity", "database", "persists_to"],
+        ["entity", "table", "persists_to"],
+        // Architecture depends on
+        ["architecture_component", "architecture_component", "depends_on"],
+        // Business rules
+        ["business_rule", "feature", "constrains"],
+        ["business_rule", "requirement", "constrains"],
+        // Decisions influence
+        ["decision", "feature", "influences"],
+        ["decision", "architecture_component", "influences"],
+        // Tasks implement
+        ["task", "requirement", "implements"],
+        ["task", "feature", "implements"],
+        // Files contain symbols
+        ["file", "symbol", "contains"],
+        // Changes affect
+        ["change", "feature", "affects"],
+        ["change", "entity", "affects"],
+        // Tests test
+        ["test", "requirement", "tests"],
+        ["test", "feature", "tests"],
+    ];
+    // Check both directions
+    for (const [fromType, toType, relType] of rules) {
+        if (s === fromType && t === toType)
+            return relType;
+        if (s === toType && t === fromType) {
+            // Reverse the relationship direction
+            return relType;
+        }
+    }
+    // Default: use "contains" from parent to child based on hierarchy
+    const hierarchy = getHierarchyLevel(s);
+    const targetHierarchy = getHierarchyLevel(t);
+    if (hierarchy < targetHierarchy)
+        return "contains";
+    if (hierarchy > targetHierarchy)
+        return "belongs_to";
+    return null;
+}
+function getHierarchyLevel(type) {
+    // Higher number = more specific/leaf node
+    const levels = {
+        project: 0,
+        domain: 1,
+        architecture_component: 2,
+        database: 2,
+        feature: 3,
+        requirement: 3,
+        entity: 3,
+        api: 3,
+        business_rule: 3,
+        decision: 3,
+        endpoint: 4,
+        table: 4,
+        field: 5,
+        task: 4,
+        test: 4,
+        file: 4,
+        symbol: 5,
+        change: 2,
+        constitution: 1,
+    };
+    return levels[type] ?? 3;
+}
+function connectDisconnectedGroup(graph, group, mainGroup) {
+    if (!group.suggested_connection)
+        return null;
+    // Connect the first node of the disconnected group to the suggested target
+    const sourceNodeId = group.node_ids[0];
+    const targetId = group.suggested_connection.target_id;
+    const relType = group.suggested_connection.relationship_type;
+    // Verify both nodes exist
+    if (!getNode(graph, sourceNodeId) || !getNode(graph, targetId))
+        return null;
+    try {
+        addRelationship(graph, sourceNodeId, targetId, relType);
+        return {
+            action: "merged_group",
+            details: `Merged disconnected group (${group.size} nodes: ${group.node_names.slice(0, 3).join(", ")}${group.size > 3 ? "..." : ""}) → "${group.suggested_connection.target_name}" via ${relType}`,
+            relationship: { from: sourceNodeId, to: targetId, type: relType },
+        };
+    }
+    catch {
+        return null;
+    }
+}
+// ─── Formatting ────────────────────────────────────────────────────
+export function formatIntegrityReport(report) {
+    const lines = [];
+    const emoji = report.summary.graph_connected ? "✅" : "⚠️";
+    lines.push(`${emoji} Graph Integrity Report\n`);
+    lines.push(`**Nodes:** ${report.summary.total_nodes}`);
+    lines.push(`**Relationships:** ${report.summary.total_relationships}`);
+    lines.push(`**Connected:** ${report.summary.graph_connected ? "Yes" : "No"}`);
+    lines.push("");
+    if (report.summary.fixes_applied > 0) {
+        lines.push(`### 🔧 Fixes Applied (${report.summary.fixes_applied})`);
+        for (const fix of report.fixes_applied) {
+            lines.push(`- **${fix.action}:** ${fix.details}`);
+        }
+        lines.push("");
+    }
+    if (report.orphan_nodes.length > 0 && report.summary.fixes_applied === 0) {
+        lines.push(`### 🔴 Orphan Nodes (${report.orphan_nodes.length})`);
+        for (const orphan of report.orphan_nodes.slice(0, 10)) {
+            lines.push(`- **${orphan.node_name}** (${orphan.node_type}) [${orphan.node_id}]`);
+        }
+        if (report.orphan_nodes.length > 10) {
+            lines.push(`- ... and ${report.orphan_nodes.length - 10} more`);
+        }
+        lines.push("");
+    }
+    if (report.disconnected_groups.length > 0 && report.summary.fixes_applied === 0) {
+        lines.push(`### 🏝️ Disconnected Groups (${report.disconnected_groups.length})`);
+        for (const group of report.disconnected_groups) {
+            const names = group.node_names.slice(0, 5).join(", ");
+            const extra = group.node_names.length > 5 ? ` ... (+${group.node_names.length - 5})` : "";
+            lines.push(`- **Group ${group.group_id}** (${group.size} nodes): ${names}${extra}`);
+            if (group.suggested_connection) {
+                lines.push(`  → Suggested: connect to "${group.suggested_connection.target_name}" via ${group.suggested_connection.relationship_type}`);
+            }
+        }
+        lines.push("");
+    }
+    if (report.redundant_relationships.length > 0 && report.summary.fixes_applied === 0) {
+        lines.push(`### 🔄 Redundant Relationships (${report.redundant_relationships.length})`);
+        for (const r of report.redundant_relationships.slice(0, 10)) {
+            lines.push(`- ${r.from} → ${r.to} (${r.type}): ${r.reason}`);
+        }
+        lines.push("");
+    }
+    if (report.summary.fixes_applied === 0 && report.summary.graph_connected) {
+        lines.push("✅ Graph is fully connected. No issues found.");
+    }
+    return lines.join("\n");
+}
+//# sourceMappingURL=integrity.js.map

package/dist/sdd/graph/integrity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"integrity.js","sourceRoot":"","sources":["../../../src/sdd/graph/integrity.ts"],"names":[],"mappings":"AAMA,OAAO,EACL,OAAO,EACP,eAAe,GAIhB,MAAM,aAAa,CAAA;AA0EpB,sEAAsE;AAEtE;;;GAGG;AACH,MAAM,UAAU,oBAAoB,CAClC,KAAqB,EACrB,UAAiC,EAAE;IAEnC,MAAM,OAAO,GAAG,OAAO,CAAC,QAAQ,IAAI,IAAI,CAAA;IAExC,MAAM,MAAM,GAAoB;QAC9B,YAAY,EAAE,EAAE;QAChB,mBAAmB,EAAE,EAAE;QACvB,uBAAuB,EAAE,EAAE;QAC3B,aAAa,EAAE,EAAE;QACjB,OAAO,EAAE;YACP,WAAW,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM;YAC/B,mBAAmB,EAAE,KAAK,CAAC,aAAa,CAAC,MAAM;YAC/C,aAAa,EAAE,CAAC;YAChB,yBAAyB,EAAE,CAAC;YAC5B,6BAA6B,EAAE,CAAC;YAChC,aAAa,EAAE,CAAC;YAChB,eAAe,EAAE,KAAK;SACvB;KACF,CAAA;IAED,2CAA2C;IAC3C,MAAM,QAAQ,GAAG,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,CAAA;IAC5E,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,UAAU,IAAI,EAAE,CAAC,CAAA;IAEpD,2CAA2C;IAC3C,MAAM,YAAY,GAAG,QAAQ,CAAC,CAAC,CAAC,kBAAkB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,KAAK,CAAA;IAE3E,6EAA6E;IAC7E,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;QACjC,MAAM,CAAC,uBAAuB,GAAG,4BAA4B,CAAC,YAAY,CAAC,CAAA;QAC3E,MAAM,CAAC,OAAO,CAAC,6BAA6B,GAAG,MAAM,CAAC,uBAAuB,CAAC,MAAM,CAAA;QAEpF,IAAI,OAAO,EAAE,CAAC;YACZ,KAAK,MAAM,SAAS,IAAI,MAAM,CAAC,uBAAuB,EAAE,CAAC;gBACvD,2BAA2B,CAAC,KAAK,EAAE,SAAS,CAAC,CAAA;gBAC7C,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC;oBACxB,MAAM,EAAE,SAAS,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,kBAAkB;oBAC5I,OAAO,EAAE,WAAW,SAAS,CAAC,MAAM,KAAK,SAAS,CAAC,IAAI,MAAM,SAAS,CAAC,EAAE,KAAK,SAAS,CAAC,IAAI,GAAG;oBAC/F,YAAY,EAAE,EAAE,IAAI,EAAE,SAAS,CAAC,IAAI,EAAE,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,IAAI,EAAE,SAAS,CAAC,IAAI,EAAE;iBAC/E,CAAC,CAAA;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED,wDAAwD;IACxD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;QAC/B,MAAM,CAAC,YAAY,GAAG,iBAAiB,CAAC,YAAY,CAAC,CAAA;QACrD,IAAI,OAAO,CAAC,UAAU,IAAI,MAAM,CAAC,YAAY,CAAC,MAAM,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;YAC1E,MAAM,CAAC,YAAY,GAAG,MAAM,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,UAAU,CAAC,CAAA;QACxE,CAAC;QACD,MAAM,CAAC,OAAO,CAAC,aAAa,GAAG,MAAM,CAAC,YAAY,CAAC,MAAM,CAAA;QAEzD,IAAI,OAAO,EAAE,CAAC;YACZ,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;gBACzC,MAAM,GAAG,GAAG,iBAAiB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAA;gBAC5C,IAAI,GAAG;oBAAE,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YACzC,CAAC;QACH,CAAC;IACH,CAAC;IAED,wCAAwC;IACxC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,cAAc,CAAC,EAAE,CAAC;QACpC,2BAA2B;QAC3B,MAAM,SAAS,GAAG,GAAG,YAAY,CAAC,KAAK,CAAC,MAAM,IAAI,YAAY,CAAC,aAAa,CAAC,MAAM,EAAE,CAAA;QACrF,MAAM,kBAAkB,GAAG,OAAO,EAAE,iBAAiB,EAAE,GAAG,CAAC,SAAS,CAAC,CAAA;QACrE,MAAM,WAAW,GAAG,KAAK,CAAA,CAAC,aAAa;QAEvC,IAAI,kBAAkB,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,kBAAkB,CAAC,SAAS,CAAC,GAAG,WAAW,EAAE,CAAC;YACpF,MAAM,CAAC,mBAAmB,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,kBAAkB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,MAAM,CAAA;YAClI,MAAM,CAAC,OAAO,CAAC,yBAAyB,GAAG,kBAAkB,CAAC,MAAM,CAAC,MAAM,CAAA;YAC3E,MAAM,CAAC,OAAO,CAAC,eAAe,GAAG,kBAAkB,CAAC,SAAS,CAAA;QAC/D,CAAC;aAAM,CAAC;YACN,MAAM,EAAE,SAAS,EAAE,kBAAkB,EAAE,GAAG,wBAAwB,CAAC,YAAY,CAAC,CAAA;YAChF,IAAI,OAAO,CAAC,SAAS,IAAI,kBAAkB,CAAC,MAAM,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;gBACvE,MAAM,CAAC,mBAAmB,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAA;YAC7E,CAAC;iBAAM,CAAC;gBACN,MAAM,CAAC,mBAAmB,GAAG,kBAAkB,CAAA;YACjD,CAAC;YACD,MAAM,CAAC,OAAO,CAAC,yBAAyB,GAAG,kBAAkB,CAAC,MAAM,CAAA;YACpE,MAAM,CAAC,OAAO,CAAC,eAAe,GAAG,kBAAkB,CAAC,MAAM,KAAK,CAAC,CAAA;YAEhE,iBAAiB;YACjB,IAAI,OAAO,EAAE,iBAAiB,EAAE,CAAC;gBAC/B,OAAO,CAAC,iBAAiB,CAAC,GAAG,CAAC,SAAS,EAAE;oBACvC,SAAS,EAAE,kBAAkB,CAAC,MAAM,KAAK,CAAC;oBAC1C,MAAM,EAAE,kBAAkB;oBAC1B,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;iBACtB,CAAC,CAAA;YACJ,CAAC;QACH,CAAC;QAED,IAAI,OAAO,EAAE,CAAC;YACZ,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,mBAAmB,EAAE,CAAC;gBAC/C,MAAM,GAAG,GAAG,wBAAwB,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,OAAO,EAAE,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,cAAc,EAAE,KAAK,CAAC,UAAU,EAAE,CAAC,CAAA;gBACtI,IAAI,GAAG;oBAAE,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YACzC,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,CAAC,OAAO,CAAC,aAAa,GAAG,MAAM,CAAC,aAAa,CAAC,MAAM,CAAA;IAC1D,OAAO,MAAM,CAAA;AACf,CAAC;AAED;;GAEG;AACH,SAAS,kBAAkB,CAAC,KAAqB,EAAE,QAAqB;IACtE,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAA;IACrC,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;QACtC,IAAI,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QACnD,IAAI,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IACrD,CAAC;IACD,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,QAAQ,EAAE,GAAG,WAAW,CAAC,CAAC,CAAA;IAEzD,OAAO;QACL,GAAG,KAAK;QACR,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACpD,aAAa,EAAE,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;KAC/F,CAAA;AACH,CAAC;AAED,sEAAsE;AAEtE,SAAS,4BAA4B,CAAC,KAAqB;IACzD,MAAM,UAAU,GAA4B,EAAE,CAAA;IAC9C,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;IAE9B,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;QACtC,kCAAkC;QAClC,IAAI,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,EAAE,CAAC;YACxB,UAAU,CAAC,IAAI,CAAC;gBACd,eAAe,EAAE,GAAG,CAAC,EAAE;gBACvB,IAAI,EAAE,GAAG,CAAC,IAAI;gBACd,EAAE,EAAE,GAAG,CAAC,EAAE;gBACV,IAAI,EAAE,GAAG,CAAC,IAAI;gBACd,MAAM,EAAE,WAAW;aACpB,CAAC,CAAA;YACF,SAAQ;QACV,CAAC;QAED,yCAAyC;QACzC,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,IAAI,EAAE,CAAA;QACjD,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAClB,UAAU,CAAC,IAAI,CAAC;gBACd,eAAe,EAAE,GAAG,CAAC,EAAE;gBACvB,IAAI,EAAE,GAAG,CAAC,IAAI;gBACd,EAAE,EAAE,GAAG,CAAC,EAAE;gBACV,IAAI,EAAE,GAAG,CAAC,IAAI;gBACd,MAAM,EAAE,WAAW;aACpB,CAAC,CAAA;YACF,SAAQ;QACV,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QAEb,4DAA4D;QAC5D,MAAM,UAAU,GAAG,GAAG,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,EAAE,CAAA;QACxD,IAAI,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;YACzB,+DAA+D;YAC/D,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACnC,UAAU,CAAC,IAAI,CAAC;oBACd,eAAe,EAAE,GAAG,CAAC,EAAE;oBACvB,IAAI,EAAE,GAAG,CAAC,IAAI;oBACd,EAAE,EAAE,GAAG,CAAC,EAAE;oBACV,IAAI,EAAE,GAAG,CAAC,IAAI;oBACd,MAAM,EAAE,iBAAiB;iBAC1B,CAAC,CAAA;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,UAAU,CAAA;AACnB,CAAC;AAED,SAAS,mBAAmB,CAAC,IAAY;IACvC,sDAAsD;IACtD,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC;QAC5B,aAAa;QACb,YAAY;QACZ,YAAY;KACb,CAAC,CAAA;IACF,OAAO,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;AAChC,CAAC;AAED,SAAS,2BAA2B,CAClC,KAAqB,EACrB,SAAgC;IAEhC,iDAAiD;IACjD,MAAM,GAAG,GAAG,KAAK,CAAC,aAAa,CAAC,SAAS,CACvC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,KAAK,SAAS,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,IAAI,CACvF,CAAA;IACD,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC;QACf,KAAK,CAAC,aAAa,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;QAClC,KAAK,CAAC,QAAQ,CAAC,UAAU,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAA;IACtD,CAAC;AACH,CAAC;AAED,sEAAsE;AAEtE,SAAS,iBAAiB,CAAC,KAAqB;IAC9C,MAAM,OAAO,GAAiB,EAAE,CAAA;IAChC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAA;IAEpC,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;QACtC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACxB,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;IACxB,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,SAAQ;QACrC,OAAO,CAAC,IAAI,CAAC;YACX,OAAO,EAAE,IAAI,CAAC,EAAE;YAChB,SAAS,EAAE,IAAI,CAAC,IAAI;YACpB,SAAS,EAAE,IAAI,CAAC,IAAI;SACrB,CAAC,CAAA;IACJ,CAAC;IAED,OAAO,OAAO,CAAA;AAChB,CAAC;AAED,SAAS,iBAAiB,CACxB,KAAqB,EACrB,MAAkB;IAElB,MAAM,SAAS,GAAG,KAAK,CAAC,UAAU,CAAA;IAClC,MAAM,WAAW,GAAG,OAAO,CAAC,KAAK,EAAE,SAAS,CAAC,CAAA;IAE7C,IAAI,CAAC,WAAW;QAAE,OAAO,IAAI,CAAA;IAE7B,iEAAiE;IACjE,IAAI,CAAC;QACH,eAAe,CAAC,KAAK,EAAE,SAAS,EAAE,MAAM,CAAC,OAAO,EAAE,UAAU,CAAC,CAAA;QAC7D,OAAO;YACL,MAAM,EAAE,kBAAkB;YAC1B,OAAO,EAAE,qBAAqB,MAAM,CAAC,SAAS,MAAM,MAAM,CAAC,SAAS,mBAAmB;YACvF,YAAY,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,MAAM,CAAC,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE;SACxE,CAAA;IACH,CAAC;IAAC,MAAM,CAAC;QACP,mCAAmC;QACnC,OAAO,IAAI,CAAA;IACb,CAAC;AACH,CAAC;AASD,SAAS,wBAAwB,CAC/B,KAAqB;IAErB,MAAM,SAAS,GAAG,KAAK,CAAC,UAAU,CAAA;IAClC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;IACjC,MAAM,SAAS,GAAmB,EAAE,CAAA;IAEpC,+BAA+B;IAC/B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAuB,CAAA;IAC1C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAA;IAC7B,CAAC;IACD,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;QACtC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QAC9B,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IAChC,CAAC;IAED,wCAAwC;IACxC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,SAAQ;QAElC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAA;QAC/B,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QACvB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAEpB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAA;YAC9B,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;YAElB,KAAK,MAAM,QAAQ,IAAI,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC9C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC3B,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;oBACrB,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;gBACtB,CAAC;YACH,CAAC;QACH,CAAC;QAED,SAAS,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,cAAc,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,CAAA;IAC7D,CAAC;IAED,wDAAwD;IACxD,MAAM,SAAS,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAA;IAEjF,oCAAoC;IACpC,MAAM,kBAAkB,GAAwB,EAAE,CAAA;IAClD,IAAI,OAAO,GAAG,CAAC,CAAA;IAEf,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;QAC9B,IAAI,KAAK,KAAK,SAAS;YAAE,SAAQ;QACjC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC;YAAE,SAAQ;QAEtC,OAAO,EAAE,CAAA;QACT,MAAM,OAAO,GAAG,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,CAAA;QAClC,MAAM,SAAS,GAAG,OAAO;aACtB,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;aAC/B,MAAM,CAAC,OAAO,CAAC;aACf,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAE,CAAC,IAAI,CAAC,CAAA;QAEtB,iDAAiD;QACjD,MAAM,mBAAmB,GAAG,wBAAwB,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,CAAC,CAAA;QAE7E,kBAAkB,CAAC,IAAI,CAAC;YACtB,QAAQ,EAAE,OAAO;YACjB,QAAQ,EAAE,OAAO;YACjB,UAAU,EAAE,SAAS;YACrB,IAAI,EAAE,KAAK,CAAC,OAAO,CAAC,IAAI;YACxB,oBAAoB,EAAE,mBAAmB;SAC1C,CAAC,CAAA;IACJ,CAAC;IAED,OAAO,EAAE,SAAS,EAAE,kBAAkB,EAAE,CAAA;AAC1C,CAAC;AAED,SAAS,wBAAwB,CAC/B,KAAqB,EACrB,KAAmB,EACnB,SAAuB;IAEvB,qFAAqF;IACrF,8BAA8B;IAC9B,MAAM,UAAU,GAAG,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC;SAClC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;SAC/B,MAAM,CAAC,OAAO,CAAc,CAAA;IAE/B,MAAM,SAAS,GAAG,CAAC,GAAG,SAAS,CAAC,OAAO,CAAC;SACrC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;SAC/B,MAAM,CAAC,OAAO,CAAc,CAAA;IAE/B,oCAAoC;IACpC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,MAAM,OAAO,GAAG,uBAAuB,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAA;YAC5D,IAAI,OAAO,EAAE,CAAC;gBACZ,OAAO;oBACL,SAAS,EAAE,QAAQ,CAAC,EAAE;oBACtB,WAAW,EAAE,QAAQ,CAAC,IAAI;oBAC1B,iBAAiB,EAAE,OAAO;iBAC3B,CAAA;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,oCAAoC;IACpC,MAAM,SAAS,GAAG,KAAK,CAAC,UAAU,CAAA;IAClC,OAAO;QACL,SAAS,EAAE,SAAS;QACpB,WAAW,EAAE,cAAc;QAC3B,iBAAiB,EAAE,UAAU;KAC9B,CAAA;AACH,CAAC;AAED,SAAS,uBAAuB,CAC9B,MAAe,EACf,MAAe;IAEf,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAA;IACrB,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAA;IAErB,gDAAgD;IAChD,MAAM,KAAK,GAA8C;QACvD,yCAAyC;QACzC,CAAC,SAAS,EAAE,QAAQ,EAAE,MAAM,CAAC;QAC7B,CAAC,SAAS,EAAE,wBAAwB,EAAE,MAAM,CAAC;QAC7C,CAAC,SAAS,EAAE,aAAa,EAAE,cAAc,CAAC;QAC1C,eAAe;QACf,CAAC,aAAa,EAAE,SAAS,EAAE,gBAAgB,CAAC;QAC5C,CAAC,aAAa,EAAE,MAAM,EAAE,gBAAgB,CAAC;QACzC,4BAA4B;QAC5B,CAAC,UAAU,EAAE,QAAQ,EAAE,SAAS,CAAC;QACjC,CAAC,KAAK,EAAE,UAAU,EAAE,UAAU,CAAC;QAC/B,+BAA+B;QAC/B,CAAC,QAAQ,EAAE,UAAU,EAAE,aAAa,CAAC;QACrC,CAAC,QAAQ,EAAE,OAAO,EAAE,aAAa,CAAC;QAClC,0BAA0B;QAC1B,CAAC,wBAAwB,EAAE,wBAAwB,EAAE,YAAY,CAAC;QAClE,iBAAiB;QACjB,CAAC,eAAe,EAAE,SAAS,EAAE,YAAY,CAAC;QAC1C,CAAC,eAAe,EAAE,aAAa,EAAE,YAAY,CAAC;QAC9C,sBAAsB;QACtB,CAAC,UAAU,EAAE,SAAS,EAAE,YAAY,CAAC;QACrC,CAAC,UAAU,EAAE,wBAAwB,EAAE,YAAY,CAAC;QACpD,kBAAkB;QAClB,CAAC,MAAM,EAAE,aAAa,EAAE,YAAY,CAAC;QACrC,CAAC,MAAM,EAAE,SAAS,EAAE,YAAY,CAAC;QACjC,wBAAwB;QACxB,CAAC,MAAM,EAAE,QAAQ,EAAE,UAAU,CAAC;QAC9B,iBAAiB;QACjB,CAAC,QAAQ,EAAE,SAAS,EAAE,SAAS,CAAC;QAChC,CAAC,QAAQ,EAAE,QAAQ,EAAE,SAAS,CAAC;QAC/B,aAAa;QACb,CAAC,MAAM,EAAE,aAAa,EAAE,OAAO,CAAC;QAChC,CAAC,MAAM,EAAE,SAAS,EAAE,OAAO,CAAC;KAC7B,CAAA;IAED,wBAAwB;IACxB,KAAK,MAAM,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,CAAC,IAAI,KAAK,EAAE,CAAC;QAChD,IAAI,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,MAAM;YAAE,OAAO,OAAO,CAAA;QAClD,IAAI,CAAC,KAAK,MAAM,IAAI,CAAC,KAAK,QAAQ,EAAE,CAAC;YACnC,qCAAqC;YACrC,OAAO,OAAO,CAAA;QAChB,CAAC;IACH,CAAC;IAED,kEAAkE;IAClE,MAAM,SAAS,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAA;IACtC,MAAM,eAAe,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAA;IAC5C,IAAI,SAAS,GAAG,eAAe;QAAE,OAAO,UAAU,CAAA;IAClD,IAAI,SAAS,GAAG,eAAe;QAAE,OAAO,YAAY,CAAA;IAEpD,OAAO,IAAI,CAAA;AACb,CAAC;AAED,SAAS,iBAAiB,CAAC,IAAY;IACrC,0CAA0C;IAC1C,MAAM,MAAM,GAA2B;QACrC,OAAO,EAAE,CAAC;QACV,MAAM,EAAE,CAAC;QACT,sBAAsB,EAAE,CAAC;QACzB,QAAQ,EAAE,CAAC;QACX,OAAO,EAAE,CAAC;QACV,WAAW,EAAE,CAAC;QACd,MAAM,EAAE,CAAC;QACT,GAAG,EAAE,CAAC;QACN,aAAa,EAAE,CAAC;QAChB,QAAQ,EAAE,CAAC;QACX,QAAQ,EAAE,CAAC;QACX,KAAK,EAAE,CAAC;QACR,KAAK,EAAE,CAAC;QACR,IAAI,EAAE,CAAC;QACP,IAAI,EAAE,CAAC;QACP,IAAI,EAAE,CAAC;QACP,MAAM,EAAE,CAAC;QACT,MAAM,EAAE,CAAC;QACT,YAAY,EAAE,CAAC;KAChB,CAAA;IACD,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;AAC1B,CAAC;AAED,SAAS,wBAAwB,CAC/B,KAAqB,EACrB,KAAwB,EACxB,SAAuB;IAEvB,IAAI,CAAC,KAAK,CAAC,oBAAoB;QAAE,OAAO,IAAI,CAAA;IAE5C,2EAA2E;IAC3E,MAAM,YAAY,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAA;IACtC,MAAM,QAAQ,GAAG,KAAK,CAAC,oBAAoB,CAAC,SAAS,CAAA;IACrD,MAAM,OAAO,GAAG,KAAK,CAAC,oBAAoB,CAAC,iBAAiB,CAAA;IAE5D,0BAA0B;IAC1B,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,QAAQ,CAAC;QAAE,OAAO,IAAI,CAAA;IAE3E,IAAI,CAAC;QACH,eAAe,CAAC,KAAK,EAAE,YAAY,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAA;QACvD,OAAO;YACL,MAAM,EAAE,cAAc;YACtB,OAAO,EAAE,8BAA8B,KAAK,CAAC,IAAI,WAAW,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,QAAQ,KAAK,CAAC,oBAAoB,CAAC,WAAW,SAAS,OAAO,EAAE;YACjM,YAAY,EAAE,EAAE,IAAI,EAAE,YAAY,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE;SAClE,CAAA;IACH,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAA;IACb,CAAC;AACH,CAAC;AAED,sEAAsE;AAEtE,MAAM,UAAU,qBAAqB,CAAC,MAAuB;IAC3D,MAAM,KAAK,GAAa,EAAE,CAAA;IAE1B,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAA;IACzD,KAAK,CAAC,IAAI,CAAC,GAAG,KAAK,2BAA2B,CAAC,CAAA;IAE/C,KAAK,CAAC,IAAI,CAAC,cAAc,MAAM,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,CAAA;IACtD,KAAK,CAAC,IAAI,CAAC,sBAAsB,MAAM,CAAC,OAAO,CAAC,mBAAmB,EAAE,CAAC,CAAA;IACtE,KAAK,CAAC,IAAI,CAAC,kBAAkB,MAAM,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAA;IAC7E,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IAEd,IAAI,MAAM,CAAC,OAAO,CAAC,aAAa,GAAG,CAAC,EAAE,CAAC;QACrC,KAAK,CAAC,IAAI,CAAC,yBAAyB,MAAM,CAAC,OAAO,CAAC,aAAa,GAAG,CAAC,CAAA;QACpE,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,aAAa,EAAE,CAAC;YACvC,KAAK,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,MAAM,OAAO,GAAG,CAAC,OAAO,EAAE,CAAC,CAAA;QACnD,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IAChB,CAAC;IAED,IAAI,MAAM,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,aAAa,KAAK,CAAC,EAAE,CAAC;QACzE,KAAK,CAAC,IAAI,CAAC,wBAAwB,MAAM,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAA;QACjE,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;YACtD,KAAK,CAAC,IAAI,CAAC,OAAO,MAAM,CAAC,SAAS,OAAO,MAAM,CAAC,SAAS,MAAM,MAAM,CAAC,OAAO,GAAG,CAAC,CAAA;QACnF,CAAC;QACD,IAAI,MAAM,CAAC,YAAY,CAAC,MAAM,GAAG,EAAE,EAAE,CAAC;YACpC,KAAK,CAAC,IAAI,CAAC,aAAa,MAAM,CAAC,YAAY,CAAC,MAAM,GAAG,EAAE,OAAO,CAAC,CAAA;QACjE,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IAChB,CAAC;IAED,IAAI,MAAM,CAAC,mBAAmB,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,aAAa,KAAK,CAAC,EAAE,CAAC;QAChF,KAAK,CAAC,IAAI,CAAC,gCAAgC,MAAM,CAAC,mBAAmB,CAAC,MAAM,GAAG,CAAC,CAAA;QAChF,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,mBAAmB,EAAE,CAAC;YAC/C,MAAM,KAAK,GAAG,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACrD,MAAM,KAAK,GAAG,KAAK,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,KAAK,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAA;YACzF,KAAK,CAAC,IAAI,CAAC,aAAa,KAAK,CAAC,QAAQ,OAAO,KAAK,CAAC,IAAI,YAAY,KAAK,GAAG,KAAK,EAAE,CAAC,CAAA;YACnF,IAAI,KAAK,CAAC,oBAAoB,EAAE,CAAC;gBAC/B,KAAK,CAAC,IAAI,CAAC,8BAA8B,KAAK,CAAC,oBAAoB,CAAC,WAAW,SAAS,KAAK,CAAC,oBAAoB,CAAC,iBAAiB,EAAE,CAAC,CAAA;YACzI,CAAC;QACH,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IAChB,CAAC;IAED,IAAI,MAAM,CAAC,uBAAuB,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,aAAa,KAAK,CAAC,EAAE,CAAC;QACpF,KAAK,CAAC,IAAI,CAAC,mCAAmC,MAAM,CAAC,uBAAuB,CAAC,MAAM,GAAG,CAAC,CAAA;QACvF,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,uBAAuB,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;YAC5D,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,MAAM,EAAE,CAAC,CAAA;QAC9D,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IAChB,CAAC;IAED,IAAI,MAAM,CAAC,OAAO,CAAC,aAAa,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,eAAe,EAAE,CAAC;QACzE,KAAK,CAAC,IAAI,CAAC,8CAA8C,CAAC,CAAA;IAC5D,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;AACzB,CAAC"}

package/dist/sdd/graph/pruner.d.ts

@@ -0,0 +1,27 @@
+import type { KnowledgeGraph } from "../domain/types.js";
+export interface PruneReport {
+    removed_nodes: Array<{
+        id: string;
+        type: string;
+        name: string;
+        reason: string;
+    }>;
+    deprecated_changes: string[];
+    total_removed: number;
+    total_deprecated: number;
+    space_freed_estimate: string;
+}
+/**
+ * Prune obsolete nodes from the graph:
+ * - FileNodes pointing to deleted files
+ * - SymbolNodes pointing to non-existent symbols
+ * - TestNodes for deleted test files
+ * - Old completed ChangeNodes (>30 days)
+ * - Duplicate relationships
+ */
+export declare function pruneGraph(graph: KnowledgeGraph, projectDir: string): PruneReport;
+/**
+ * Format prune report as readable markdown.
+ */
+export declare function formatPruneReport(report: PruneReport): string;
+//# sourceMappingURL=pruner.d.ts.map

package/dist/sdd/graph/pruner.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pruner.d.ts","sourceRoot":"","sources":["../../../src/sdd/graph/pruner.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAA8C,MAAM,oBAAoB,CAAA;AAKpG,MAAM,WAAW,WAAW;IAC1B,aAAa,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC,CAAA;IAChF,kBAAkB,EAAE,MAAM,EAAE,CAAA;IAC5B,aAAa,EAAE,MAAM,CAAA;IACrB,gBAAgB,EAAE,MAAM,CAAA;IACxB,oBAAoB,EAAE,MAAM,CAAA;CAC7B;AAED;;;;;;;GAOG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,cAAc,EAAE,UAAU,EAAE,MAAM,GAAG,WAAW,CA0BjF;AA+HD;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,WAAW,GAAG,MAAM,CA2C7D"}