octie-cli 1.0.0

package/dist/core/graph/index.js

@@ -0,0 +1,475 @@
+/**
+ * Task Graph data structure
+ *
+ * Implements a directed graph using adjacency lists for O(1) node lookup
+ * and O(k) edge traversal where k is the number of edges.
+ *
+ * Graph Structure:
+ * - nodes: Map<taskId, TaskNode> for O(1) node lookup
+ * - outgoingEdges: Map<taskId, Set<targetTaskIds>> for forward traversal
+ * - incomingEdges: Map<taskId, Set<sourceTaskIds>> for reverse traversal
+ *
+ * @module core/graph
+ */
+import { TaskNotFoundError, ValidationError, AmbiguousIdError } from '../../types/index.js';
+import { TaskNode } from '../models/task-node.js';
+import { v4 as uuidv4 } from 'uuid';
+/**
+ * TaskGraphStore class
+ *
+ * Manages the task graph data structure with efficient lookup and traversal.
+ * Uses Map and Set for optimal performance:
+ * - O(1) node lookup by ID
+ * - O(k) edge traversal where k = edge count
+ * - O(1) edge existence checking
+ */
+export class TaskGraphStore {
+    /** Primary node storage (hash map for O(1) lookup) */
+    _nodes;
+    /** Outgoing edges: node -> nodes it points to */
+    _outgoingEdges;
+    /** Incoming edges: node -> nodes pointing to it */
+    _incomingEdges;
+    /** Graph metadata */
+    _metadata;
+    /**
+     * Create a new TaskGraphStore
+     * @param metadata - Optional project metadata
+     */
+    constructor(metadata) {
+        this._nodes = new Map();
+        this._outgoingEdges = new Map();
+        this._incomingEdges = new Map();
+        this._metadata = metadata || {
+            project_name: 'Untitled Project',
+            version: '1.0.0',
+            created_at: new Date().toISOString(),
+            updated_at: new Date().toISOString(),
+        };
+    }
+    /**
+     * Get the number of tasks in the graph
+     */
+    get size() {
+        return this._nodes.size;
+    }
+    /**
+     * Get the graph metadata
+     */
+    get metadata() {
+        return { ...this._metadata };
+    }
+    /**
+     * Update graph metadata
+     * @param metadata - New metadata values (partial update)
+     */
+    setMetadata(metadata) {
+        this._metadata = {
+            ...this._metadata,
+            ...metadata,
+            updated_at: new Date().toISOString(),
+        };
+    }
+    /**
+     * Get a task node by ID
+     * @param id - Task ID to look up
+     * @returns Task node or undefined if not found
+     * @complexity O(1)
+     */
+    getNode(id) {
+        return this._nodes.get(id);
+    }
+    /**
+     * Get a task node by ID or throw error
+     * @param id - Task ID to look up
+     * @returns Task node
+     * @throws {TaskNotFoundError} If task not found
+     * @complexity O(1)
+     */
+    getNodeOrThrow(id) {
+        const node = this._nodes.get(id);
+        if (!node) {
+            throw new TaskNotFoundError(id);
+        }
+        return node;
+    }
+    /**
+     * Check if a task exists
+     * @param id - Task ID to check
+     * @returns True if task exists
+     * @complexity O(1)
+     */
+    hasNode(id) {
+        return this._nodes.has(id);
+    }
+    /**
+     * Get a task node by short UUID prefix (first 7-8 characters)
+     * @param prefix - Short UUID prefix to look up
+     * @returns Task node or undefined if not found
+     * @throws {AmbiguousIdError} If multiple tasks match the prefix
+     * @complexity O(n) where n is the number of tasks
+     */
+    getNodeByPrefix(prefix) {
+        const matches = [];
+        const lowerPrefix = prefix.toLowerCase();
+        for (const [id, node] of this._nodes) {
+            if (id.toLowerCase().startsWith(lowerPrefix)) {
+                matches.push(node);
+                if (matches.length > 1) {
+                    throw new AmbiguousIdError(prefix, matches.map(m => m.id));
+                }
+            }
+        }
+        return matches[0];
+    }
+    /**
+     * Get a task node by ID or prefix
+     * @param id - Task ID or short UUID prefix to look up
+     * @returns Task node or undefined if not found
+     * @complexity O(1) for full ID, O(n) for prefix
+     */
+    getNodeByIdOrPrefix(id) {
+        // Try exact match first (O(1))
+        const exactMatch = this.getNode(id);
+        if (exactMatch)
+            return exactMatch;
+        // Fall back to prefix search (O(n))
+        return this.getNodeByPrefix(id);
+    }
+    /**
+     * Generate a unique task ID with collision detection
+     * Ensures that the first 7 characters of the UUID are unique across all tasks
+     * @returns A unique task ID
+     * @throws {Error} If unable to generate unique ID after many attempts
+     */
+    generateUniqueId() {
+        const MAX_ATTEMPTS = 100;
+        const PREFIX_LENGTH = 7;
+        for (let attempt = 0; attempt < MAX_ATTEMPTS; attempt++) {
+            const id = uuidv4();
+            const prefix = id.substring(0, PREFIX_LENGTH);
+            // Check if any existing task has the same prefix
+            let prefixExists = false;
+            for (const existingId of this._nodes.keys()) {
+                if (existingId.substring(0, PREFIX_LENGTH) === prefix) {
+                    prefixExists = true;
+                    break;
+                }
+            }
+            if (!prefixExists) {
+                return id;
+            }
+        }
+        throw new Error(`Failed to generate unique ID after ${MAX_ATTEMPTS} attempts. Too many tasks?`);
+    }
+    /**
+     * Get all task IDs in the graph
+     * @returns Array of task IDs
+     */
+    getAllTaskIds() {
+        return Array.from(this._nodes.keys());
+    }
+    /**
+     * Get all task nodes in the graph
+     * @returns Array of task nodes
+     */
+    getAllTasks() {
+        return Array.from(this._nodes.values());
+    }
+    /**
+     * Add a task node to the graph
+     * @param node - Task node to add
+     * @throws {ValidationError} If task ID already exists
+     * @complexity O(1)
+     */
+    addNode(node) {
+        if (this._nodes.has(node.id)) {
+            throw new ValidationError(`Task with ID '${node.id}' already exists in graph.`, 'id');
+        }
+        this._nodes.set(node.id, node);
+        this._outgoingEdges.set(node.id, new Set(node.edges));
+        // Only initialize incoming edges if not already set (from previous node additions)
+        if (!this._incomingEdges.has(node.id)) {
+            this._incomingEdges.set(node.id, new Set());
+        }
+        // Update incoming edges for all outgoing edges
+        for (const targetId of node.edges) {
+            if (!this._incomingEdges.has(targetId)) {
+                this._incomingEdges.set(targetId, new Set());
+            }
+            this._incomingEdges.get(targetId).add(node.id);
+        }
+        this._metadata.updated_at = new Date().toISOString();
+    }
+    /**
+     * Remove a task node from the graph
+     * @param id - Task ID to remove
+     * @throws {TaskNotFoundError} If task not found
+     * @complexity O(k) where k is the number of edges
+     */
+    removeNode(id) {
+        if (!this._nodes.has(id)) {
+            throw new TaskNotFoundError(id);
+        }
+        // Remove all edges pointing to this node
+        const incomingSources = this._incomingEdges.get(id) || new Set();
+        for (const sourceId of incomingSources) {
+            this._outgoingEdges.get(sourceId)?.delete(id);
+            // Also update the source node's edges field
+            const sourceNode = this._nodes.get(sourceId);
+            if (sourceNode) {
+                sourceNode.edges = sourceNode.edges.filter(eid => eid !== id);
+            }
+        }
+        // Remove all edges from this node
+        const outgoingTargets = this._outgoingEdges.get(id) || new Set();
+        for (const targetId of outgoingTargets) {
+            this._incomingEdges.get(targetId)?.delete(id);
+        }
+        // Remove the node and edge maps
+        this._nodes.delete(id);
+        this._outgoingEdges.delete(id);
+        this._incomingEdges.delete(id);
+        this._metadata.updated_at = new Date().toISOString();
+    }
+    /**
+     * Update a task node in the graph
+     * @param node - Task node with updated values
+     * @throws {TaskNotFoundError} If task not found
+     * @complexity O(1)
+     */
+    updateNode(node) {
+        if (!this._nodes.has(node.id)) {
+            throw new TaskNotFoundError(node.id);
+        }
+        this._nodes.set(node.id, node);
+        this._metadata.updated_at = new Date().toISOString();
+    }
+    /**
+     * Get outgoing edges for a node
+     * @param nodeId - Source task ID
+     * @returns Array of target task IDs
+     * @complexity O(k) where k is the number of outgoing edges
+     */
+    getOutgoingEdges(nodeId) {
+        return Array.from(this._outgoingEdges.get(nodeId) || []);
+    }
+    /**
+     * Get incoming edges for a node
+     * @param nodeId - Target task ID
+     * @returns Array of source task IDs
+     * @complexity O(k) where k is the number of incoming edges
+     */
+    getIncomingEdges(nodeId) {
+        return Array.from(this._incomingEdges.get(nodeId) || []);
+    }
+    /**
+     * Add an edge between two nodes
+     * @param fromId - Source task ID
+     * @param toId - Target task ID
+     * @throws {TaskNotFoundError} If either task not found
+     * @throws {ValidationError} If edge already exists
+     * @complexity O(1)
+     */
+    addEdge(fromId, toId) {
+        if (!this._nodes.has(fromId)) {
+            throw new TaskNotFoundError(fromId);
+        }
+        if (!this._nodes.has(toId)) {
+            throw new TaskNotFoundError(toId);
+        }
+        // Initialize edge sets if needed
+        if (!this._outgoingEdges.has(fromId)) {
+            this._outgoingEdges.set(fromId, new Set());
+        }
+        if (!this._incomingEdges.has(toId)) {
+            this._incomingEdges.set(toId, new Set());
+        }
+        // Check if edge already exists
+        if (this._outgoingEdges.get(fromId).has(toId)) {
+            throw new ValidationError(`Edge from '${fromId}' to '${toId}' already exists.`, 'edges');
+        }
+        // Add edge
+        this._outgoingEdges.get(fromId).add(toId);
+        this._incomingEdges.get(toId).add(fromId);
+        // Update task node's edge list
+        const fromNode = this._nodes.get(fromId);
+        if (!fromNode.edges.includes(toId)) {
+            fromNode.edges.push(toId);
+        }
+        this._metadata.updated_at = new Date().toISOString();
+    }
+    /**
+     * Remove an edge between two nodes
+     * @param fromId - Source task ID
+     * @param toId - Target task ID
+     * @throws {TaskNotFoundError} If either task not found
+     * @throws {ValidationError} If edge doesn't exist
+     * @complexity O(1)
+     */
+    removeEdge(fromId, toId) {
+        if (!this._nodes.has(fromId)) {
+            throw new TaskNotFoundError(fromId);
+        }
+        if (!this._nodes.has(toId)) {
+            throw new TaskNotFoundError(toId);
+        }
+        const outgoingSet = this._outgoingEdges.get(fromId);
+        if (!outgoingSet || !outgoingSet.has(toId)) {
+            throw new ValidationError(`Edge from '${fromId}' to '${toId}' does not exist.`, 'edges');
+        }
+        // Remove edge
+        outgoingSet.delete(toId);
+        this._incomingEdges.get(toId)?.delete(fromId);
+        // Update task node's edge list
+        const fromNode = this._nodes.get(fromId);
+        const edgeIndex = fromNode.edges.indexOf(toId);
+        if (edgeIndex > -1) {
+            fromNode.edges.splice(edgeIndex, 1);
+        }
+        this._metadata.updated_at = new Date().toISOString();
+    }
+    /**
+     * Check if an edge exists
+     * @param fromId - Source task ID
+     * @param toId - Target task ID
+     * @returns True if edge exists
+     * @complexity O(1)
+     */
+    hasEdge(fromId, toId) {
+        const outgoingSet = this._outgoingEdges.get(fromId);
+        return outgoingSet ? outgoingSet.has(toId) : false;
+    }
+    /**
+     * Get root tasks (tasks with no incoming edges)
+     * @returns Array of root task IDs
+     * @complexity O(n) where n is the number of tasks
+     */
+    getRootTasks() {
+        const roots = [];
+        for (const [id, incomingSet] of this._incomingEdges) {
+            if (incomingSet.size === 0) {
+                roots.push(id);
+            }
+        }
+        return roots;
+    }
+    /**
+     * Get orphan tasks (tasks with no edges at all)
+     * @returns Array of orphan task IDs
+     * @complexity O(n) where n is the number of tasks
+     */
+    getOrphanTasks() {
+        const orphans = [];
+        for (const [id] of this._nodes) {
+            const outgoing = this._outgoingEdges.get(id)?.size ?? 0;
+            const incoming = this._incomingEdges.get(id)?.size ?? 0;
+            if (outgoing === 0 && incoming === 0) {
+                orphans.push(id);
+            }
+        }
+        return orphans;
+    }
+    /**
+     * Get leaf tasks (tasks with no outgoing edges)
+     * @returns Array of leaf task IDs
+     * @complexity O(n) where n is the number of tasks
+     */
+    getLeafTasks() {
+        const leaves = [];
+        for (const [id, outgoingSet] of this._outgoingEdges) {
+            if (outgoingSet.size === 0) {
+                leaves.push(id);
+            }
+        }
+        return leaves;
+    }
+    /**
+     * Clear all tasks and edges from the graph
+     * Keeps metadata but resets the graph structure
+     */
+    clear() {
+        this._nodes.clear();
+        this._outgoingEdges.clear();
+        this._incomingEdges.clear();
+        this._metadata.updated_at = new Date().toISOString();
+    }
+    /**
+     * Convert graph to TaskGraph interface
+     * @returns TaskGraph interface representation
+     */
+    toInterface() {
+        return {
+            nodes: new Map(this._nodes),
+            outgoingEdges: new Map(Array.from(this._outgoingEdges.entries()).map(([id, set]) => [id, new Set(set)])),
+            incomingEdges: new Map(Array.from(this._incomingEdges.entries()).map(([id, set]) => [id, new Set(set)])),
+            metadata: this._metadata,
+        };
+    }
+    /**
+     * Create TaskGraphStore from TaskGraph interface
+     * @param graph - TaskGraph interface
+     * @returns New TaskGraphStore instance
+     */
+    static fromInterface(graph) {
+        const store = new TaskGraphStore(graph.metadata);
+        // Add all nodes (convert interface to class instance)
+        for (const [id, node] of graph.nodes) {
+            const taskNode = TaskNode.fromJSON(node);
+            store._nodes.set(id, taskNode);
+        }
+        // Copy edge maps
+        for (const [id, set] of graph.outgoingEdges) {
+            store._outgoingEdges.set(id, new Set(set));
+        }
+        for (const [id, set] of graph.incomingEdges) {
+            store._incomingEdges.set(id, new Set(set));
+        }
+        return store;
+    }
+    /**
+     * Serialize graph to JSON-compatible object
+     * @returns JSON-serializable object
+     */
+    toJSON() {
+        const nodes = {};
+        for (const [id, node] of this._nodes) {
+            nodes[id] = node;
+        }
+        const outgoingEdges = {};
+        for (const [id, set] of this._outgoingEdges) {
+            outgoingEdges[id] = Array.from(set);
+        }
+        const incomingEdges = {};
+        for (const [id, set] of this._incomingEdges) {
+            incomingEdges[id] = Array.from(set);
+        }
+        return {
+            nodes,
+            outgoingEdges,
+            incomingEdges,
+            metadata: this._metadata,
+        };
+    }
+    /**
+     * Deserialize graph from JSON object
+     * @param json - JSON object from toJSON()
+     * @returns New TaskGraphStore instance
+     */
+    static fromJSON(json) {
+        const store = new TaskGraphStore(json.metadata);
+        // Add nodes
+        for (const [id, node] of Object.entries(json.nodes)) {
+            store._nodes.set(id, node);
+        }
+        // Add edges
+        for (const [id, targets] of Object.entries(json.outgoingEdges)) {
+            store._outgoingEdges.set(id, new Set(targets));
+        }
+        for (const [id, sources] of Object.entries(json.incomingEdges)) {
+            store._incomingEdges.set(id, new Set(sources));
+        }
+        return store;
+    }
+}
+//# sourceMappingURL=index.js.map

package/dist/core/graph/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/core/graph/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AAGH,OAAO,EAAE,iBAAiB,EAAE,eAAe,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAC;AAC5F,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAClD,OAAO,EAAE,EAAE,IAAI,MAAM,EAAE,MAAM,MAAM,CAAC;AAEpC;;;;;;;;GAQG;AACH,MAAM,OAAO,cAAc;IACzB,sDAAsD;IAC9C,MAAM,CAAwB;IAEtC,iDAAiD;IACzC,cAAc,CAA2B;IAEjD,mDAAmD;IAC3C,cAAc,CAA2B;IAEjD,qBAAqB;IACb,SAAS,CAAkB;IAEnC;;;OAGG;IACH,YAAY,QAA0B;QACpC,IAAI,CAAC,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;QACxB,IAAI,CAAC,cAAc,GAAG,IAAI,GAAG,EAAE,CAAC;QAChC,IAAI,CAAC,cAAc,GAAG,IAAI,GAAG,EAAE,CAAC;QAChC,IAAI,CAAC,SAAS,GAAG,QAAQ,IAAI;YAC3B,YAAY,EAAE,kBAAkB;YAChC,OAAO,EAAE,OAAO;YAChB,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;YACpC,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACrC,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,IAAI,QAAQ;QACV,OAAO,EAAE,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;IAC/B,CAAC;IAED;;;OAGG;IACH,WAAW,CAAC,QAAkC;QAC5C,IAAI,CAAC,SAAS,GAAG;YACf,GAAG,IAAI,CAAC,SAAS;YACjB,GAAG,QAAQ;YACX,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACrC,CAAC;IACJ,CAAC;IAED;;;;;OAKG;IACH,OAAO,CAAC,EAAU;QAChB,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC7B,CAAC;IAED;;;;;;OAMG;IACH,cAAc,CAAC,EAAU;QACvB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACjC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,MAAM,IAAI,iBAAiB,CAAC,EAAE,CAAC,CAAC;QAClC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;OAKG;IACH,OAAO,CAAC,EAAU;QAChB,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC7B,CAAC;IAED;;;;;;OAMG;IACH,eAAe,CAAC,MAAc;QAC5B,MAAM,OAAO,GAAe,EAAE,CAAC;QAC/B,MAAM,WAAW,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;QAEzC,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACrC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,UAAU,CAAC,WAAW,CAAC,EAAE,CAAC;gBAC7C,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACnB,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACvB,MAAM,IAAI,gBAAgB,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC7D,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;IACpB,CAAC;IAED;;;;;OAKG;IACH,mBAAmB,CAAC,EAAU;QAC5B,+BAA+B;QAC/B,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACpC,IAAI,UAAU;YAAE,OAAO,UAAU,CAAC;QAElC,oCAAoC;QACpC,OAAO,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC;IAClC,CAAC;IAED;;;;;OAKG;IACH,gBAAgB;QACd,MAAM,YAAY,GAAG,GAAG,CAAC;QACzB,MAAM,aAAa,GAAG,CAAC,CAAC;QAExB,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,YAAY,EAAE,OAAO,EAAE,EAAE,CAAC;YACxD,MAAM,EAAE,GAAG,MAAM,EAAE,CAAC;YACpB,MAAM,MAAM,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC;YAE9C,iDAAiD;YACjD,IAAI,YAAY,GAAG,KAAK,CAAC;YACzB,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC5C,IAAI,UAAU,CAAC,SAAS,CAAC,CAAC,EAAE,aAAa,CAAC,KAAK,MAAM,EAAE,CAAC;oBACtD,YAAY,GAAG,IAAI,CAAC;oBACpB,MAAM;gBACR,CAAC;YACH,CAAC;YAED,IAAI,CAAC,YAAY,EAAE,CAAC;gBAClB,OAAO,EAAE,CAAC;YACZ,CAAC;QACH,CAAC;QAED,MAAM,IAAI,KAAK,CAAC,sCAAsC,YAAY,4BAA4B,CAAC,CAAC;IAClG,CAAC;IAED;;;OAGG;IACH,aAAa;QACX,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;IACxC,CAAC;IAED;;;OAGG;IACH,WAAW;QACT,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;IAC1C,CAAC;IAED;;;;;OAKG;IACH,OAAO,CAAC,IAAc;QACpB,IAAI,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,eAAe,CACvB,iBAAiB,IAAI,CAAC,EAAE,4BAA4B,EACpD,IAAI,CACL,CAAC;QACJ,CAAC;QAED,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC/B,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QAEtD,mFAAmF;QACnF,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACtC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC9C,CAAC;QAED,+CAA+C;QAC/C,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAClC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACvC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;YAC/C,CAAC;YACD,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClD,CAAC;QAED,IAAI,CAAC,SAAS,CAAC,UAAU,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACvD,CAAC;IAED;;;;;OAKG;IACH,UAAU,CAAC,EAAU;QACnB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACzB,MAAM,IAAI,iBAAiB,CAAC,EAAE,CAAC,CAAC;QAClC,CAAC;QAED,yCAAyC;QACzC,MAAM,eAAe,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;QACjE,KAAK,MAAM,QAAQ,IAAI,eAAe,EAAE,CAAC;YACvC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;YAC9C,4CAA4C;YAC5C,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAC7C,IAAI,UAAU,EAAE,CAAC;gBACf,UAAU,CAAC,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC;YAChE,CAAC;QACH,CAAC;QAED,kCAAkC;QAClC,MAAM,eAAe,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC;QACjE,KAAK,MAAM,QAAQ,IAAI,eAAe,EAAE,CAAC;YACvC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;QAChD,CAAC;QAED,gCAAgC;QAChC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACvB,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAE/B,IAAI,CAAC,SAAS,CAAC,UAAU,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACvD,CAAC;IAED;;;;;OAKG;IACH,UAAU,CAAC,IAAc;QACvB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAC9B,MAAM,IAAI,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACvC,CAAC;QAED,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC/B,IAAI,CAAC,SAAS,CAAC,UAAU,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACvD,CAAC;IAED;;;;;OAKG;IACH,gBAAgB,CAAC,MAAc;QAC7B,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;IAC3D,CAAC;IAED;;;;;OAKG;IACH,gBAAgB,CAAC,MAAc;QAC7B,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;IAC3D,CAAC;IAED;;;;;;;OAOG;IACH,OAAO,CAAC,MAAc,EAAE,IAAY;QAClC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,iBAAiB,CAAC,MAAM,CAAC,CAAC;QACtC,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC3B,MAAM,IAAI,iBAAiB,CAAC,IAAI,CAAC,CAAC;QACpC,CAAC;QAED,iCAAiC;QACjC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACrC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC7C,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACnC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC3C,CAAC;QAED,+BAA+B;QAC/B,IAAI,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/C,MAAM,IAAI,eAAe,CACvB,cAAc,MAAM,SAAS,IAAI,mBAAmB,EACpD,OAAO,CACR,CAAC;QACJ,CAAC;QAED,WAAW;QACX,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC3C,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAE3C,+BAA+B;QAC/B,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;QAC1C,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YACnC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5B,CAAC;QAED,IAAI,CAAC,SAAS,CAAC,UAAU,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACvD,CAAC;IAED;;;;;;;OAOG;IACH,UAAU,CAAC,MAAc,EAAE,IAAY;QACrC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,iBAAiB,CAAC,MAAM,CAAC,CAAC;QACtC,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC3B,MAAM,IAAI,iBAAiB,CAAC,IAAI,CAAC,CAAC;QACpC,CAAC;QAED,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpD,IAAI,CAAC,WAAW,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC3C,MAAM,IAAI,eAAe,CACvB,cAAc,MAAM,SAAS,IAAI,mBAAmB,EACpD,OAAO,CACR,CAAC;QACJ,CAAC;QAED,cAAc;QACd,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACzB,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QAE9C,+BAA+B;QAC/B,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;QAC1C,MAAM,SAAS,GAAG,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAC/C,IAAI,SAAS,GAAG,CAAC,CAAC,EAAE,CAAC;YACnB,QAAQ,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;QACtC,CAAC;QAED,IAAI,CAAC,SAAS,CAAC,UAAU,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACvD,CAAC;IAED;;;;;;OAMG;IACH,OAAO,CAAC,MAAc,EAAE,IAAY;QAClC,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpD,OAAO,WAAW,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;IACrD,CAAC;IAED;;;;OAIG;IACH,YAAY;QACV,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,MAAM,CAAC,EAAE,EAAE,WAAW,CAAC,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;YACpD,IAAI,WAAW,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBAC3B,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACjB,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;OAIG;IACH,cAAc;QACZ,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,KAAK,MAAM,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC/B,MAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC;YACxD,MAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC;YACxD,IAAI,QAAQ,KAAK,CAAC,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;gBACrC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;OAIG;IACH,YAAY;QACV,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,KAAK,MAAM,CAAC,EAAE,EAAE,WAAW,CAAC,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;YACpD,IAAI,WAAW,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBAC3B,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAClB,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;OAGG;IACH,KAAK;QACH,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACpB,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC;QAC5B,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC;QAC5B,IAAI,CAAC,SAAS,CAAC,UAAU,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACvD,CAAC;IAED;;;OAGG;IACH,WAAW;QACT,OAAO;YACL,KAAK,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC;YAC3B,aAAa,EAAE,IAAI,GAAG,CACpB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CACjF;YACD,aAAa,EAAE,IAAI,GAAG,CACpB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,OAAO,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CACjF;YACD,QAAQ,EAAE,IAAI,CAAC,SAAS;SACzB,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,aAAa,CAAC,KAAgB;QACnC,MAAM,KAAK,GAAG,IAAI,cAAc,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QAEjD,sDAAsD;QACtD,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YACrC,MAAM,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YACzC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;QACjC,CAAC;QAED,iBAAiB;QACjB,KAAK,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;YAC5C,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7C,CAAC;QACD,KAAK,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,KAAK,CAAC,aAAa,EAAE,CAAC;YAC5C,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7C,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;OAGG;IACH,MAAM;QAMJ,MAAM,KAAK,GAA6B,EAAE,CAAC;QAC3C,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACrC,KAAK,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;QACnB,CAAC;QAED,MAAM,aAAa,GAA6B,EAAE,CAAC;QACnD,KAAK,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;YAC5C,aAAa,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACtC,CAAC;QAED,MAAM,aAAa,GAA6B,EAAE,CAAC;QACnD,KAAK,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;YAC5C,aAAa,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACtC,CAAC;QAED,OAAO;YACL,KAAK;YACL,aAAa;YACb,aAAa;YACb,QAAQ,EAAE,IAAI,CAAC,SAAS;SACzB,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,QAAQ,CAAC,IAKf;QACC,MAAM,KAAK,GAAG,IAAI,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAEhD,YAAY;QACZ,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACpD,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC7B,CAAC;QAED,YAAY;QACZ,KAAK,MAAM,CAAC,EAAE,EAAE,OAAO,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC;YAC/D,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;QACjD,CAAC;QACD,KAAK,MAAM,CAAC,EAAE,EAAE,OAAO,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC;YAC/D,KAAK,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;QACjD,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;CACF"}