ai-database 2.0.2 → 2.1.3

package/dist/schema/dependency-graph.d.ts

@@ -0,0 +1,133 @@
+/**
+ * Dependency Graph - builds and manages type dependencies for cascade generation
+ *
+ * This module provides:
+ * - Graph construction from parsed schema relationships
+ * - Topological sorting for correct generation order
+ * - Cycle detection with clear error messages
+ * - Parallel group identification for concurrent generation
+ *
+ * @packageDocumentation
+ */
+import type { ParsedSchema } from '../types.js';
+/**
+ * A node in the schema dependency graph representing an entity type
+ */
+export interface SchemaDepNode {
+    /** Type name */
+    name: string;
+    /** Types this node depends on (hard dependencies from -> and <-) */
+    dependsOn: string[];
+    /** Types that depend on this node */
+    dependedOnBy: string[];
+    /** Types this node softly depends on (from ~> and <~ fuzzy operators) */
+    softDependsOn: string[];
+}
+/**
+ * An edge in the dependency graph representing a relationship
+ */
+export interface SchemaDepEdge {
+    /** Source type */
+    from: string;
+    /** Target type */
+    to: string;
+    /** Whether this is an array relationship */
+    isArray: boolean;
+    /** The operator used: ->, ~>, <-, <~ */
+    operator: '->' | '~>' | '<-' | '<~';
+    /** Field name (may include ? suffix for optional fields) */
+    fieldName: string;
+}
+/**
+ * The complete dependency graph structure
+ */
+export interface SchemaDepGraph {
+    /** Map of type name to node */
+    nodes: Record<string, SchemaDepNode>;
+    /** All edges in the graph */
+    edges: SchemaDepEdge[];
+}
+/**
+ * Primitive types that don't create dependencies
+ */
+export declare const PRIMITIVE_TYPES: Set<string>;
+/**
+ * Error thrown when a circular dependency is detected
+ */
+export declare class CircularDependencyError extends Error {
+    /** The path of types that form the cycle */
+    readonly cyclePath: string[];
+    constructor(cyclePath: string[]);
+}
+/**
+ * Build a dependency graph from a parsed schema
+ *
+ * @param schema - The parsed schema from parseSchema()
+ * @returns The dependency graph with nodes and edges
+ */
+export declare function buildDependencyGraph(schema: ParsedSchema): SchemaDepGraph;
+/**
+ * Compute topological order for generating types
+ *
+ * Returns types in order such that dependencies come before dependents.
+ * This is essential for cascade generation - we need to create referenced
+ * entities before the entities that reference them.
+ *
+ * @param graph - The dependency graph
+ * @param rootType - The root type to start from
+ * @param ignoreOptional - If true, optional dependencies don't contribute to ordering
+ * @returns Array of type names in generation order (dependencies first, root last)
+ * @throws CircularDependencyError if a cycle is detected
+ */
+export declare function topologicalSort(graph: SchemaDepGraph, rootType: string, ignoreOptional?: boolean): string[];
+/**
+ * Options for cycle detection
+ */
+export interface DetectCyclesOptions {
+    /** If true, optional dependencies are ignored when detecting cycles */
+    ignoreOptional?: boolean;
+}
+/**
+ * Detect all cycles in the dependency graph
+ *
+ * @param graph - The dependency graph to check
+ * @param options - Detection options
+ * @returns Array of cycles, where each cycle is an array of type names
+ *          The first and last element of each cycle are the same (showing the loop)
+ */
+export declare function detectCycles(graph: SchemaDepGraph, options?: DetectCyclesOptions): string[][];
+/**
+ * Get parallel generation groups - types that can be generated concurrently
+ *
+ * Returns an array of arrays, where each inner array contains types that
+ * can be generated in parallel (they have no dependencies on each other).
+ * Groups are ordered so that earlier groups must complete before later ones.
+ *
+ * @param graph - The dependency graph
+ * @param rootType - The root type to start from
+ * @returns Array of parallel groups, in execution order
+ */
+export declare function getParallelGroups(graph: SchemaDepGraph, rootType: string): string[][];
+/**
+ * Get all dependencies for a specific type (including transitive)
+ *
+ * @param graph - The dependency graph
+ * @param typeName - The type to get dependencies for
+ * @returns Set of all type names this type depends on
+ */
+export declare function getAllDependencies(graph: SchemaDepGraph, typeName: string): Set<string>;
+/**
+ * Check if the graph has any cycles
+ *
+ * @param graph - The dependency graph
+ * @returns true if cycles exist, false otherwise
+ */
+export declare function hasCycles(graph: SchemaDepGraph): boolean;
+/**
+ * Get a human-readable visualization of the dependency graph
+ *
+ * @param graph - The dependency graph
+ * @returns Multi-line string showing the graph structure
+ */
+export declare function visualizeGraph(graph: SchemaDepGraph): string;
+//# sourceMappingURL=dependency-graph.d.ts.map

package/dist/schema/dependency-graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency-graph.d.ts","sourceRoot":"","sources":["../../src/schema/dependency-graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAe,MAAM,aAAa,CAAA;AAM5D;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B,gBAAgB;IAChB,IAAI,EAAE,MAAM,CAAA;IACZ,oEAAoE;IACpE,SAAS,EAAE,MAAM,EAAE,CAAA;IACnB,qCAAqC;IACrC,YAAY,EAAE,MAAM,EAAE,CAAA;IACtB,yEAAyE;IACzE,aAAa,EAAE,MAAM,EAAE,CAAA;CACxB;AAED;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B,kBAAkB;IAClB,IAAI,EAAE,MAAM,CAAA;IACZ,kBAAkB;IAClB,EAAE,EAAE,MAAM,CAAA;IACV,4CAA4C;IAC5C,OAAO,EAAE,OAAO,CAAA;IAChB,wCAAwC;IACxC,QAAQ,EAAE,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,CAAA;IACnC,4DAA4D;IAC5D,SAAS,EAAE,MAAM,CAAA;CAClB;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,+BAA+B;IAC/B,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,aAAa,CAAC,CAAA;IACpC,6BAA6B;IAC7B,KAAK,EAAE,aAAa,EAAE,CAAA;CACvB;AAMD;;GAEG;AACH,eAAO,MAAM,eAAe,aAY1B,CAAA;AAMF;;GAEG;AACH,qBAAa,uBAAwB,SAAQ,KAAK;IAChD,4CAA4C;IAC5C,SAAgB,SAAS,EAAE,MAAM,EAAE,CAAA;gBAEvB,SAAS,EAAE,MAAM,EAAE;CAMhC;AAMD;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAAC,MAAM,EAAE,YAAY,GAAG,cAAc,CAyEzE;AAMD;;;;;;;;;;;;GAYG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,cAAc,EACrB,QAAQ,EAAE,MAAM,EAChB,cAAc,UAAQ,GACrB,MAAM,EAAE,CAyCV;AAMD;;GAEG;AACH,MAAM,WAAW,mBAAmB;IAClC,uEAAuE;IACvE,cAAc,CAAC,EAAE,OAAO,CAAA;CACzB;AAED;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAC1B,KAAK,EAAE,cAAc,EACrB,OAAO,GAAE,mBAAwB,GAChC,MAAM,EAAE,EAAE,CA0CZ;AAMD;;;;;;;;;;GAUG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,EAAE,EAAE,CAgErF;AAMD;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,CAiBvF;AAED;;;;;GAKG;AACH,wBAAgB,SAAS,CAAC,KAAK,EAAE,cAAc,GAAG,OAAO,CAExD;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,cAAc,GAAG,MAAM,CAqB5D"}

package/dist/schema/dependency-graph.js

@@ -0,0 +1,355 @@
+/**
+ * Dependency Graph - builds and manages type dependencies for cascade generation
+ *
+ * This module provides:
+ * - Graph construction from parsed schema relationships
+ * - Topological sorting for correct generation order
+ * - Cycle detection with clear error messages
+ * - Parallel group identification for concurrent generation
+ *
+ * @packageDocumentation
+ */
+// =============================================================================
+// Constants
+// =============================================================================
+/**
+ * Primitive types that don't create dependencies
+ */
+export const PRIMITIVE_TYPES = new Set([
+    'string',
+    'number',
+    'boolean',
+    'date',
+    'datetime',
+    'json',
+    'markdown',
+    'url',
+    'email',
+    'object',
+    'array',
+]);
+// =============================================================================
+// Errors
+// =============================================================================
+/**
+ * Error thrown when a circular dependency is detected
+ */
+export class CircularDependencyError extends Error {
+    /** The path of types that form the cycle */
+    cyclePath;
+    constructor(cyclePath) {
+        const cycleStr = cyclePath.join(' -> ');
+        super(`Circular dependency detected: ${cycleStr}`);
+        this.name = 'CircularDependencyError';
+        this.cyclePath = cyclePath;
+    }
+}
+// =============================================================================
+// Graph Construction
+// =============================================================================
+/**
+ * Build a dependency graph from a parsed schema
+ *
+ * @param schema - The parsed schema from parseSchema()
+ * @returns The dependency graph with nodes and edges
+ */
+export function buildDependencyGraph(schema) {
+    const nodes = {};
+    const edges = [];
+    // Initialize nodes for all entity types
+    for (const [typeName] of schema.entities) {
+        nodes[typeName] = {
+            name: typeName,
+            dependsOn: [],
+            dependedOnBy: [],
+            softDependsOn: [],
+        };
+    }
+    // Process fields to build edges
+    for (const [typeName, entity] of schema.entities) {
+        for (const [fieldName, field] of entity.fields) {
+            // Skip non-relation fields
+            if (!field.isRelation || !field.relatedType)
+                continue;
+            // Skip primitive types
+            if (PRIMITIVE_TYPES.has(field.relatedType))
+                continue;
+            const target = field.relatedType;
+            const operator = field.operator;
+            const isArray = field.isArray ?? false;
+            const isSoft = operator === '~>' || operator === '<~';
+            const isBackward = operator === '<-' || operator === '<~';
+            const isOptionalField = field.isOptional;
+            // Add edge (mark optional in fieldName for cycle detection)
+            edges.push({
+                from: typeName,
+                to: target,
+                isArray,
+                operator: operator ?? '->',
+                fieldName: isOptionalField ? `${fieldName}?` : fieldName,
+            });
+            // Ensure target node exists (might be external/not in schema)
+            if (!nodes[target]) {
+                nodes[target] = {
+                    name: target,
+                    dependsOn: [],
+                    dependedOnBy: [],
+                    softDependsOn: [],
+                };
+            }
+            // Determine dependency type based on operator
+            const sourceNode = nodes[typeName];
+            const targetNode = nodes[target];
+            if (isSoft || isOptionalField) {
+                // Soft dependency (fuzzy search) or optional field
+                if (!sourceNode.softDependsOn.includes(target)) {
+                    sourceNode.softDependsOn.push(target);
+                }
+            }
+            else if (!isBackward) {
+                // Hard dependency for forward exact references (->)
+                // Backward references (<-) don't create generation dependencies
+                // because the parent creates the child, not vice versa
+                if (!sourceNode.dependsOn.includes(target)) {
+                    sourceNode.dependsOn.push(target);
+                }
+                if (!targetNode.dependedOnBy.includes(typeName)) {
+                    targetNode.dependedOnBy.push(typeName);
+                }
+            }
+        }
+    }
+    return { nodes, edges };
+}
+// =============================================================================
+// Topological Sort
+// =============================================================================
+/**
+ * Compute topological order for generating types
+ *
+ * Returns types in order such that dependencies come before dependents.
+ * This is essential for cascade generation - we need to create referenced
+ * entities before the entities that reference them.
+ *
+ * @param graph - The dependency graph
+ * @param rootType - The root type to start from
+ * @param ignoreOptional - If true, optional dependencies don't contribute to ordering
+ * @returns Array of type names in generation order (dependencies first, root last)
+ * @throws CircularDependencyError if a cycle is detected
+ */
+export function topologicalSort(graph, rootType, ignoreOptional = false) {
+    const visited = new Set();
+    const visiting = new Set();
+    const result = [];
+    function visit(typeName, path) {
+        if (visited.has(typeName))
+            return;
+        if (visiting.has(typeName)) {
+            // Circular dependency detected
+            const cycleStart = path.indexOf(typeName);
+            const cyclePath = [...path.slice(cycleStart), typeName];
+            throw new CircularDependencyError(cyclePath);
+        }
+        visiting.add(typeName);
+        const node = graph.nodes[typeName];
+        if (node) {
+            for (const dep of node.dependsOn) {
+                // Check if this dependency is optional and should be ignored
+                if (ignoreOptional) {
+                    const edge = graph.edges.find((e) => e.from === typeName && e.to === dep);
+                    if (edge && graph.nodes[dep]) {
+                        // Check if field has optional marker
+                        const fieldIsOptional = edge.fieldName.endsWith('?');
+                        if (fieldIsOptional)
+                            continue;
+                    }
+                }
+                visit(dep, [...path, typeName]);
+            }
+        }
+        visiting.delete(typeName);
+        visited.add(typeName);
+        result.push(typeName);
+    }
+    visit(rootType, []);
+    return result;
+}
+/**
+ * Detect all cycles in the dependency graph
+ *
+ * @param graph - The dependency graph to check
+ * @param options - Detection options
+ * @returns Array of cycles, where each cycle is an array of type names
+ *          The first and last element of each cycle are the same (showing the loop)
+ */
+export function detectCycles(graph, options = {}) {
+    const cycles = [];
+    const visited = new Set();
+    const recStack = new Set();
+    function dfs(node, path) {
+        if (recStack.has(node)) {
+            // Found a cycle
+            const cycleStart = path.indexOf(node);
+            const cycle = [...path.slice(cycleStart), node];
+            cycles.push(cycle);
+            return;
+        }
+        if (visited.has(node))
+            return;
+        visited.add(node);
+        recStack.add(node);
+        const nodeInfo = graph.nodes[node];
+        if (nodeInfo) {
+            for (const dep of nodeInfo.dependsOn) {
+                // Skip optional dependencies if configured
+                if (options.ignoreOptional) {
+                    const edge = graph.edges.find((e) => e.from === node && e.to === dep);
+                    if (edge) {
+                        // Check if fieldName ends with ?
+                        if (edge.fieldName.endsWith('?'))
+                            continue;
+                    }
+                }
+                dfs(dep, [...path, node]);
+            }
+        }
+        recStack.delete(node);
+    }
+    for (const node of Object.keys(graph.nodes)) {
+        dfs(node, []);
+    }
+    return cycles;
+}
+// =============================================================================
+// Parallel Groups
+// =============================================================================
+/**
+ * Get parallel generation groups - types that can be generated concurrently
+ *
+ * Returns an array of arrays, where each inner array contains types that
+ * can be generated in parallel (they have no dependencies on each other).
+ * Groups are ordered so that earlier groups must complete before later ones.
+ *
+ * @param graph - The dependency graph
+ * @param rootType - The root type to start from
+ * @returns Array of parallel groups, in execution order
+ */
+export function getParallelGroups(graph, rootType) {
+    const inDegree = {};
+    const relevantNodes = new Set();
+    // First, find all nodes reachable from root
+    function findReachable(node) {
+        if (relevantNodes.has(node))
+            return;
+        relevantNodes.add(node);
+        const nodeInfo = graph.nodes[node];
+        if (nodeInfo) {
+            for (const dep of nodeInfo.dependsOn) {
+                findReachable(dep);
+            }
+        }
+    }
+    findReachable(rootType);
+    // Initialize in-degrees for relevant nodes only
+    for (const node of relevantNodes) {
+        inDegree[node] = 0;
+    }
+    // Count incoming edges (dependencies)
+    for (const node of relevantNodes) {
+        const nodeInfo = graph.nodes[node];
+        if (nodeInfo) {
+            for (const dep of nodeInfo.dependsOn) {
+                if (relevantNodes.has(dep)) {
+                    const currentDegree = inDegree[node] ?? 0;
+                    inDegree[node] = currentDegree + 1;
+                }
+            }
+        }
+    }
+    const groups = [];
+    while (Object.keys(inDegree).length > 0) {
+        // Find all nodes with in-degree 0 (no remaining dependencies)
+        const group = Object.entries(inDegree)
+            .filter(([, degree]) => degree === 0)
+            .map(([node]) => node);
+        if (group.length === 0) {
+            // Remaining nodes have cycles - break to avoid infinite loop
+            break;
+        }
+        groups.push(group);
+        // Remove processed nodes and update in-degrees
+        for (const node of group) {
+            delete inDegree[node];
+            // Reduce in-degree of nodes that depend on this node
+            for (const dependent of graph.nodes[node]?.dependedOnBy ?? []) {
+                if (dependent in inDegree) {
+                    const currentDegree = inDegree[dependent] ?? 0;
+                    inDegree[dependent] = currentDegree - 1;
+                }
+            }
+        }
+    }
+    return groups;
+}
+// =============================================================================
+// Utility Functions
+// =============================================================================
+/**
+ * Get all dependencies for a specific type (including transitive)
+ *
+ * @param graph - The dependency graph
+ * @param typeName - The type to get dependencies for
+ * @returns Set of all type names this type depends on
+ */
+export function getAllDependencies(graph, typeName) {
+    const deps = new Set();
+    function collect(node) {
+        const nodeInfo = graph.nodes[node];
+        if (!nodeInfo)
+            return;
+        for (const dep of nodeInfo.dependsOn) {
+            if (!deps.has(dep)) {
+                deps.add(dep);
+                collect(dep);
+            }
+        }
+    }
+    collect(typeName);
+    return deps;
+}
+/**
+ * Check if the graph has any cycles
+ *
+ * @param graph - The dependency graph
+ * @returns true if cycles exist, false otherwise
+ */
+export function hasCycles(graph) {
+    return detectCycles(graph).length > 0;
+}
+/**
+ * Get a human-readable visualization of the dependency graph
+ *
+ * @param graph - The dependency graph
+ * @returns Multi-line string showing the graph structure
+ */
+export function visualizeGraph(graph) {
+    const lines = ['Dependency Graph:', ''];
+    for (const [name, node] of Object.entries(graph.nodes)) {
+        lines.push(`${name}:`);
+        if (node.dependsOn.length > 0) {
+            lines.push(`  -> ${node.dependsOn.join(', ')} (hard deps)`);
+        }
+        if (node.softDependsOn.length > 0) {
+            lines.push(`  ~> ${node.softDependsOn.join(', ')} (soft deps)`);
+        }
+        if (node.dependedOnBy.length > 0) {
+            lines.push(`  <- ${node.dependedOnBy.join(', ')} (depended on by)`);
+        }
+        if (node.dependsOn.length === 0 && node.softDependsOn.length === 0) {
+            lines.push(`  (no dependencies)`);
+        }
+        lines.push('');
+    }
+    return lines.join('\n');
+}
+//# sourceMappingURL=dependency-graph.js.map

package/dist/schema/dependency-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency-graph.js","sourceRoot":"","sources":["../../src/schema/dependency-graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAgDH,gFAAgF;AAChF,YAAY;AACZ,gFAAgF;AAEhF;;GAEG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC;IACrC,QAAQ;IACR,QAAQ;IACR,SAAS;IACT,MAAM;IACN,UAAU;IACV,MAAM;IACN,UAAU;IACV,KAAK;IACL,OAAO;IACP,QAAQ;IACR,OAAO;CACR,CAAC,CAAA;AAEF,gFAAgF;AAChF,SAAS;AACT,gFAAgF;AAEhF;;GAEG;AACH,MAAM,OAAO,uBAAwB,SAAQ,KAAK;IAChD,4CAA4C;IAC5B,SAAS,CAAU;IAEnC,YAAY,SAAmB;QAC7B,MAAM,QAAQ,GAAG,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;QACvC,KAAK,CAAC,iCAAiC,QAAQ,EAAE,CAAC,CAAA;QAClD,IAAI,CAAC,IAAI,GAAG,yBAAyB,CAAA;QACrC,IAAI,CAAC,SAAS,GAAG,SAAS,CAAA;IAC5B,CAAC;CACF;AAED,gFAAgF;AAChF,qBAAqB;AACrB,gFAAgF;AAEhF;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CAAC,MAAoB;IACvD,MAAM,KAAK,GAAkC,EAAE,CAAA;IAC/C,MAAM,KAAK,GAAoB,EAAE,CAAA;IAEjC,wCAAwC;IACxC,KAAK,MAAM,CAAC,QAAQ,CAAC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;QACzC,KAAK,CAAC,QAAQ,CAAC,GAAG;YAChB,IAAI,EAAE,QAAQ;YACd,SAAS,EAAE,EAAE;YACb,YAAY,EAAE,EAAE;YAChB,aAAa,EAAE,EAAE;SAClB,CAAA;IACH,CAAC;IAED,gCAAgC;IAChC,KAAK,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;QACjD,KAAK,MAAM,CAAC,SAAS,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;YAC/C,2BAA2B;YAC3B,IAAI,CAAC,KAAK,CAAC,UAAU,IAAI,CAAC,KAAK,CAAC,WAAW;gBAAE,SAAQ;YAErD,uBAAuB;YACvB,IAAI,eAAe,CAAC,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC;gBAAE,SAAQ;YAEpD,MAAM,MAAM,GAAG,KAAK,CAAC,WAAW,CAAA;YAChC,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAA;YAC/B,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,IAAI,KAAK,CAAA;YACtC,MAAM,MAAM,GAAG,QAAQ,KAAK,IAAI,IAAI,QAAQ,KAAK,IAAI,CAAA;YACrD,MAAM,UAAU,GAAG,QAAQ,KAAK,IAAI,IAAI,QAAQ,KAAK,IAAI,CAAA;YACzD,MAAM,eAAe,GAAG,KAAK,CAAC,UAAU,CAAA;YAExC,4DAA4D;YAC5D,KAAK,CAAC,IAAI,CAAC;gBACT,IAAI,EAAE,QAAQ;gBACd,EAAE,EAAE,MAAM;gBACV,OAAO;gBACP,QAAQ,EAAE,QAAQ,IAAI,IAAI;gBAC1B,SAAS,EAAE,eAAe,CAAC,CAAC,CAAC,GAAG,SAAS,GAAG,CAAC,CAAC,CAAC,SAAS;aACzD,CAAC,CAAA;YAEF,8DAA8D;YAC9D,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;gBACnB,KAAK,CAAC,MAAM,CAAC,GAAG;oBACd,IAAI,EAAE,MAAM;oBACZ,SAAS,EAAE,EAAE;oBACb,YAAY,EAAE,EAAE;oBAChB,aAAa,EAAE,EAAE;iBAClB,CAAA;YACH,CAAC;YAED,8CAA8C;YAC9C,MAAM,UAAU,GAAG,KAAK,CAAC,QAAQ,CAAE,CAAA;YACnC,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAE,CAAA;YAEjC,IAAI,MAAM,IAAI,eAAe,EAAE,CAAC;gBAC9B,mDAAmD;gBACnD,IAAI,CAAC,UAAU,CAAC,aAAa,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC/C,UAAU,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;gBACvC,CAAC;YACH,CAAC;iBAAM,IAAI,CAAC,UAAU,EAAE,CAAC;gBACvB,oDAAoD;gBACpD,gEAAgE;gBAChE,uDAAuD;gBACvD,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC3C,UAAU,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;gBACnC,CAAC;gBACD,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAChD,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;gBACxC,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAA;AACzB,CAAC;AAED,gFAAgF;AAChF,mBAAmB;AACnB,gFAAgF;AAEhF;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,eAAe,CAC7B,KAAqB,EACrB,QAAgB,EAChB,cAAc,GAAG,KAAK;IAEtB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;IACjC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAA;IAClC,MAAM,MAAM,GAAa,EAAE,CAAA;IAE3B,SAAS,KAAK,CAAC,QAAgB,EAAE,IAAc;QAC7C,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;YAAE,OAAM;QAEjC,IAAI,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC3B,+BAA+B;YAC/B,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAA;YACzC,MAAM,SAAS,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,QAAQ,CAAC,CAAA;YACvD,MAAM,IAAI,uBAAuB,CAAC,SAAS,CAAC,CAAA;QAC9C,CAAC;QAED,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;QAEtB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAA;QAClC,IAAI,IAAI,EAAE,CAAC;YACT,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;gBACjC,6DAA6D;gBAC7D,IAAI,cAAc,EAAE,CAAC;oBACnB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAA;oBACzE,IAAI,IAAI,IAAI,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;wBAC7B,qCAAqC;wBACrC,MAAM,eAAe,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAA;wBACpD,IAAI,eAAe;4BAAE,SAAQ;oBAC/B,CAAC;gBACH,CAAC;gBACD,KAAK,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAA;YACjC,CAAC;QACH,CAAC;QAED,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAA;QACzB,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;QACrB,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;IACvB,CAAC;IAED,KAAK,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAA;IAEnB,OAAO,MAAM,CAAA;AACf,CAAC;AAcD;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY,CAC1B,KAAqB,EACrB,UAA+B,EAAE;IAEjC,MAAM,MAAM,GAAe,EAAE,CAAA;IAC7B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;IACjC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAA;IAElC,SAAS,GAAG,CAAC,IAAY,EAAE,IAAc;QACvC,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACvB,gBAAgB;YAChB,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;YACrC,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,IAAI,CAAC,CAAA;YAC/C,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YAClB,OAAM;QACR,CAAC;QAED,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,OAAM;QAE7B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACjB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QAElB,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;QAClC,IAAI,QAAQ,EAAE,CAAC;YACb,KAAK,MAAM,GAAG,IAAI,QAAQ,CAAC,SAAS,EAAE,CAAC;gBACrC,2CAA2C;gBAC3C,IAAI,OAAO,CAAC,cAAc,EAAE,CAAC;oBAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAA;oBACrE,IAAI,IAAI,EAAE,CAAC;wBACT,iCAAiC;wBACjC,IAAI,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC;4BAAE,SAAQ;oBAC5C,CAAC;gBACH,CAAC;gBACD,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,EAAE,IAAI,CAAC,CAAC,CAAA;YAC3B,CAAC;QACH,CAAC;QAED,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IACvB,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;QAC5C,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAA;IACf,CAAC;IAED,OAAO,MAAM,CAAA;AACf,CAAC;AAED,gFAAgF;AAChF,kBAAkB;AAClB,gFAAgF;AAEhF;;;;;;;;;;GAUG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAqB,EAAE,QAAgB;IACvE,MAAM,QAAQ,GAA2B,EAAE,CAAA;IAC3C,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAA;IAEvC,4CAA4C;IAC5C,SAAS,aAAa,CAAC,IAAY;QACjC,IAAI,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,OAAM;QACnC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACvB,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;QAClC,IAAI,QAAQ,EAAE,CAAC;YACb,KAAK,MAAM,GAAG,IAAI,QAAQ,CAAC,SAAS,EAAE,CAAC;gBACrC,aAAa,CAAC,GAAG,CAAC,CAAA;YACpB,CAAC;QACH,CAAC;IACH,CAAC;IACD,aAAa,CAAC,QAAQ,CAAC,CAAA;IAEvB,gDAAgD;IAChD,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;QACjC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACpB,CAAC;IAED,sCAAsC;IACtC,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;QACjC,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;QAClC,IAAI,QAAQ,EAAE,CAAC;YACb,KAAK,MAAM,GAAG,IAAI,QAAQ,CAAC,SAAS,EAAE,CAAC;gBACrC,IAAI,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBAC3B,MAAM,aAAa,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;oBACzC,QAAQ,CAAC,IAAI,CAAC,GAAG,aAAa,GAAG,CAAC,CAAA;gBACpC,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,MAAM,GAAe,EAAE,CAAA;IAE7B,OAAO,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxC,8DAA8D;QAC9D,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC;aACnC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,MAAM,KAAK,CAAC,CAAC;aACpC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAA;QAExB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,6DAA6D;YAC7D,MAAK;QACP,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;QAElB,+CAA+C;QAC/C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,OAAO,QAAQ,CAAC,IAAI,CAAC,CAAA;YACrB,qDAAqD;YACrD,KAAK,MAAM,SAAS,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,YAAY,IAAI,EAAE,EAAE,CAAC;gBAC9D,IAAI,SAAS,IAAI,QAAQ,EAAE,CAAC;oBAC1B,MAAM,aAAa,GAAG,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,CAAA;oBAC9C,QAAQ,CAAC,SAAS,CAAC,GAAG,aAAa,GAAG,CAAC,CAAA;gBACzC,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAA;AACf,CAAC;AAED,gFAAgF;AAChF,oBAAoB;AACpB,gFAAgF;AAEhF;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAqB,EAAE,QAAgB;IACxE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;IAE9B,SAAS,OAAO,CAAC,IAAY;QAC3B,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;QAClC,IAAI,CAAC,QAAQ;YAAE,OAAM;QAErB,KAAK,MAAM,GAAG,IAAI,QAAQ,CAAC,SAAS,EAAE,CAAC;YACrC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACnB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;gBACb,OAAO,CAAC,GAAG,CAAC,CAAA;YACd,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,CAAC,QAAQ,CAAC,CAAA;IACjB,OAAO,IAAI,CAAA;AACb,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,SAAS,CAAC,KAAqB;IAC7C,OAAO,YAAY,CAAC,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC,CAAA;AACvC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAAC,KAAqB;IAClD,MAAM,KAAK,GAAa,CAAC,mBAAmB,EAAE,EAAE,CAAC,CAAA;IAEjD,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;QACvD,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,CAAA;QACtB,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9B,KAAK,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,CAAA;QAC7D,CAAC;QACD,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAClC,KAAK,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,CAAA;QACjE,CAAC;QACD,IAAI,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACjC,KAAK,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAA;QACrE,CAAC;QACD,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACnE,KAAK,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAA;QACnC,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IAChB,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;AACzB,CAAC"}