@danielfgray/pg-sourcerer 0.1.0

package/dist/ir/relation-graph.d.ts

@@ -0,0 +1,113 @@
+/**
+ * Relation Graph Utilities
+ *
+ * Utilities for navigating entity relationships in the IR using Effect's Graph module.
+ * Useful for query builders, documentation generators, ERD tools, etc.
+ */
+import { Graph, Option } from "effect";
+import type { Relation, ReverseRelation, SemanticIR, TableEntity } from "./semantic-ir.js";
+/**
+ * Edge data stored in the relation graph.
+ * Represents a foreign key constraint between two entities.
+ */
+export interface RelationEdge {
+    readonly constraintName: string;
+    readonly columns: readonly {
+        readonly local: string;
+        readonly foreign: string;
+    }[];
+    /** Entity that owns the FK column (the "child" in the relationship) */
+    readonly fkHolder: string;
+}
+/**
+ * The relation graph type - a directed graph where:
+ * - Nodes are entity names (strings)
+ * - Edges point from FK holder → referenced entity
+ * - Edge data contains constraint info
+ */
+export type RelationGraph = Graph.DirectedGraph<string, RelationEdge>;
+/**
+ * An entity that can be directly joined from another entity.
+ */
+export interface JoinableEntity {
+    readonly entity: TableEntity;
+    readonly direction: "belongsTo" | "hasMany";
+    readonly relation: Relation | ReverseRelation;
+    /** Human-readable description: "orders via user_id → users.id" */
+    readonly description: string;
+}
+/**
+ * A single step in a join path between two entities.
+ */
+export interface JoinStep {
+    readonly from: string;
+    readonly to: string;
+    readonly direction: "belongsTo" | "hasMany";
+    readonly constraintName: string;
+    readonly columns: readonly {
+        readonly local: string;
+        readonly foreign: string;
+    }[];
+}
+/**
+ * Result of path finding - either a path or information about why none exists.
+ */
+export type JoinPathResult = {
+    readonly _tag: "Found";
+    readonly path: readonly JoinStep[];
+} | {
+    readonly _tag: "NotFound";
+    readonly from: string;
+    readonly to: string;
+} | {
+    readonly _tag: "SameEntity";
+    readonly entity: string;
+} | {
+    readonly _tag: "EntityNotFound";
+    readonly entity: string;
+};
+/**
+ * Build a directed graph from the IR's entity relations.
+ *
+ * Edges point from FK holder → referenced entity (i.e., orders → users
+ * when orders.user_id references users.id).
+ *
+ * Use with Graph.bfs/dfs and direction: 'outgoing' for belongsTo traversal,
+ * direction: 'incoming' for hasMany traversal.
+ */
+export declare function buildRelationGraph(ir: SemanticIR): RelationGraph;
+/**
+ * Get the node index for an entity name in the graph.
+ */
+export declare function getEntityIndex(graph: RelationGraph, entityName: string): Option.Option<Graph.NodeIndex>;
+/**
+ * Get all entities directly joinable from this entity (via FK in either direction).
+ *
+ * Returns both:
+ * - belongsTo: entities this one references (we have the FK)
+ * - hasMany: entities that reference this one (they have the FK)
+ */
+export declare function getJoinableEntities(ir: SemanticIR, entityName: string): readonly JoinableEntity[];
+/**
+ * Find the shortest path between two entities using BFS.
+ *
+ * Returns a JoinPathResult indicating:
+ * - Found: path exists with the steps to take
+ * - NotFound: no path exists between the entities
+ * - SameEntity: from and to are the same entity
+ * - EntityNotFound: one of the entity names doesn't exist in the IR
+ *
+ * The algorithm explores both directions (belongsTo and hasMany) to find
+ * any valid path through the relation graph.
+ */
+export declare function findJoinPath(ir: SemanticIR, from: string, to: string): JoinPathResult;
+/**
+ * Export the relation graph as a Mermaid diagram.
+ * Useful for documentation and debugging.
+ */
+export declare function toMermaid(graph: RelationGraph): string;
+/**
+ * Export the relation graph as a Mermaid diagram directly from IR.
+ */
+export declare function irToMermaid(ir: SemanticIR): string;
+//# sourceMappingURL=relation-graph.d.ts.map

package/dist/ir/relation-graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"relation-graph.d.ts","sourceRoot":"","sources":["../../src/ir/relation-graph.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,OAAO,EAAS,KAAK,EAAE,MAAM,EAAQ,MAAM,QAAQ,CAAA;AAEnD,OAAO,KAAK,EAAE,QAAQ,EAAE,eAAe,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAA;AAO1F;;;GAGG;AACH,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAA;IAC/B,QAAQ,CAAC,OAAO,EAAE,SAAS;QAAE,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;KAAE,EAAE,CAAA;IACjF,uEAAuE;IACvE,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;CAC1B;AAED;;;;;GAKG;AACH,MAAM,MAAM,aAAa,GAAG,KAAK,CAAC,aAAa,CAAC,MAAM,EAAE,YAAY,CAAC,CAAA;AAErE;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAA;IAC5B,QAAQ,CAAC,SAAS,EAAE,WAAW,GAAG,SAAS,CAAA;IAC3C,QAAQ,CAAC,QAAQ,EAAE,QAAQ,GAAG,eAAe,CAAA;IAC7C,kEAAkE;IAClE,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAA;CAC7B;AAED;;GAEG;AACH,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;IACnB,QAAQ,CAAC,SAAS,EAAE,WAAW,GAAG,SAAS,CAAA;IAC3C,QAAQ,CAAC,cAAc,EAAE,MAAM,CAAA;IAC/B,QAAQ,CAAC,OAAO,EAAE,SAAS;QAAE,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;KAAE,EAAE,CAAA;CAClF;AAED;;GAEG;AACH,MAAM,MAAM,cAAc,GACtB;IAAE,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;IAAC,QAAQ,CAAC,IAAI,EAAE,SAAS,QAAQ,EAAE,CAAA;CAAE,GAC9D;IAAE,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC;IAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;CAAE,GACzE;IAAE,QAAQ,CAAC,IAAI,EAAE,YAAY,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GACxD;IAAE,QAAQ,CAAC,IAAI,EAAE,gBAAgB,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CAAE,CAAA;AAMhE;;;;;;;;GAQG;AACH,wBAAgB,kBAAkB,CAAC,EAAE,EAAE,UAAU,GAAG,aAAa,CA+BhE;AAED;;GAEG;AACH,wBAAgB,cAAc,CAC5B,KAAK,EAAE,aAAa,EACpB,UAAU,EAAE,MAAM,GACjB,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,CAEhC;AAuBD;;;;;;GAMG;AACH,wBAAgB,mBAAmB,CAAC,EAAE,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,GAAG,SAAS,cAAc,EAAE,CA6CjG;AAeD;;;;;;;;;;;GAWG;AACH,wBAAgB,YAAY,CAAC,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,cAAc,CAmFrF;AA4CD;;;GAGG;AACH,wBAAgB,SAAS,CAAC,KAAK,EAAE,aAAa,GAAG,MAAM,CAMtD;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,EAAE,EAAE,UAAU,GAAG,MAAM,CAElD"}

package/dist/ir/relation-graph.js

@@ -0,0 +1,232 @@
+/**
+ * Relation Graph Utilities
+ *
+ * Utilities for navigating entity relationships in the IR using Effect's Graph module.
+ * Useful for query builders, documentation generators, ERD tools, etc.
+ */
+import { Array, Graph, Option, pipe } from "effect";
+import { getAllRelations, isTableEntity } from "./semantic-ir.js";
+// ============================================================================
+// Graph Construction
+// ============================================================================
+/**
+ * Build a directed graph from the IR's entity relations.
+ *
+ * Edges point from FK holder → referenced entity (i.e., orders → users
+ * when orders.user_id references users.id).
+ *
+ * Use with Graph.bfs/dfs and direction: 'outgoing' for belongsTo traversal,
+ * direction: 'incoming' for hasMany traversal.
+ */
+export function buildRelationGraph(ir) {
+    const tableEntities = pipe(Array.fromIterable(ir.entities.values()), Array.filter(isTableEntity));
+    return Graph.directed((mutable) => {
+        // Build entity name → node index mapping
+        const nodeIndices = new Map(tableEntities.map((entity) => [entity.name, Graph.addNode(mutable, entity.name)]));
+        // Add edges for all belongsTo relations
+        for (const entity of tableEntities) {
+            const fromIdx = nodeIndices.get(entity.name);
+            if (fromIdx === undefined)
+                continue;
+            for (const rel of entity.relations) {
+                if (rel.kind !== "belongsTo")
+                    continue;
+                const toIdx = nodeIndices.get(rel.targetEntity);
+                if (toIdx === undefined)
+                    continue; // Skip broken refs
+                Graph.addEdge(mutable, fromIdx, toIdx, {
+                    constraintName: rel.constraintName,
+                    columns: rel.columns,
+                    fkHolder: entity.name,
+                });
+            }
+        }
+    });
+}
+/**
+ * Get the node index for an entity name in the graph.
+ */
+export function getEntityIndex(graph, entityName) {
+    return Graph.findNode(graph, (name) => name === entityName);
+}
+// ============================================================================
+// Joinable Entities
+// ============================================================================
+/**
+ * Format a relation as a human-readable description.
+ * Example: "orders via user_id → users.id"
+ */
+function formatRelationDescription(fromEntity, toEntity, columns, direction) {
+    const columnPairs = columns.map((c) => `${c.local} → ${c.foreign}`).join(", ");
+    return direction === "belongsTo"
+        ? `${fromEntity} via ${columnPairs}`
+        : `${toEntity} via ${columnPairs}`;
+}
+/**
+ * Get all entities directly joinable from this entity (via FK in either direction).
+ *
+ * Returns both:
+ * - belongsTo: entities this one references (we have the FK)
+ * - hasMany: entities that reference this one (they have the FK)
+ */
+export function getJoinableEntities(ir, entityName) {
+    const allRels = getAllRelations(ir, entityName);
+    if (!allRels)
+        return [];
+    const belongsToResults = pipe(allRels.belongsTo, Array.filterMap((rel) => {
+        const target = ir.entities.get(rel.targetEntity);
+        if (!target || !isTableEntity(target))
+            return Option.none();
+        return Option.some({
+            entity: target,
+            direction: "belongsTo",
+            relation: rel,
+            description: formatRelationDescription(entityName, rel.targetEntity, rel.columns, "belongsTo"),
+        });
+    }));
+    const hasManyResults = pipe(allRels.hasMany, Array.filterMap((rel) => {
+        const source = ir.entities.get(rel.sourceEntity);
+        if (!source || !isTableEntity(source))
+            return Option.none();
+        return Option.some({
+            entity: source,
+            direction: "hasMany",
+            relation: rel,
+            description: formatRelationDescription(rel.sourceEntity, entityName, rel.columns, "hasMany"),
+        });
+    }));
+    return [...belongsToResults, ...hasManyResults];
+}
+/**
+ * Find the shortest path between two entities using BFS.
+ *
+ * Returns a JoinPathResult indicating:
+ * - Found: path exists with the steps to take
+ * - NotFound: no path exists between the entities
+ * - SameEntity: from and to are the same entity
+ * - EntityNotFound: one of the entity names doesn't exist in the IR
+ *
+ * The algorithm explores both directions (belongsTo and hasMany) to find
+ * any valid path through the relation graph.
+ */
+export function findJoinPath(ir, from, to) {
+    // Same entity check
+    if (from === to) {
+        return { _tag: "SameEntity", entity: from };
+    }
+    // Validate entities exist
+    const fromEntity = ir.entities.get(from);
+    const toEntity = ir.entities.get(to);
+    if (!fromEntity || !isTableEntity(fromEntity)) {
+        return { _tag: "EntityNotFound", entity: from };
+    }
+    if (!toEntity || !isTableEntity(toEntity)) {
+        return { _tag: "EntityNotFound", entity: to };
+    }
+    // Build graph and get node indices
+    const graph = buildRelationGraph(ir);
+    const fromIdxOpt = getEntityIndex(graph, from);
+    const toIdxOpt = getEntityIndex(graph, to);
+    if (Option.isNone(fromIdxOpt) || Option.isNone(toIdxOpt)) {
+        return { _tag: "NotFound", from, to };
+    }
+    const fromIdx = fromIdxOpt.value;
+    const toIdx = toIdxOpt.value;
+    // BFS with parent tracking for path reconstruction
+    // We need to explore both edge directions (outgoing = belongsTo, incoming = hasMany)
+    const visited = new Set();
+    const parents = new Map();
+    const queue = [{ nodeIdx: fromIdx }];
+    visited.add(fromIdx);
+    while (queue.length > 0) {
+        const { nodeIdx: currentIdx } = queue.shift();
+        if (currentIdx === toIdx) {
+            // Found! Reconstruct path
+            return { _tag: "Found", path: reconstructPath(graph, parents, fromIdx, toIdx) };
+        }
+        // Explore outgoing edges (belongsTo direction)
+        const outgoingEdges = graph.adjacency.get(currentIdx) ?? [];
+        for (const edgeIdx of outgoingEdges) {
+            const edge = graph.edges.get(edgeIdx);
+            if (!edge)
+                continue;
+            const neighborIdx = edge.target;
+            if (!visited.has(neighborIdx)) {
+                visited.add(neighborIdx);
+                parents.set(neighborIdx, {
+                    parentIdx: currentIdx,
+                    edgeIdx,
+                    direction: "belongsTo",
+                });
+                queue.push({ nodeIdx: neighborIdx });
+            }
+        }
+        // Explore incoming edges (hasMany direction)
+        const incomingEdges = graph.reverseAdjacency.get(currentIdx) ?? [];
+        for (const edgeIdx of incomingEdges) {
+            const edge = graph.edges.get(edgeIdx);
+            if (!edge)
+                continue;
+            const neighborIdx = edge.source;
+            if (!visited.has(neighborIdx)) {
+                visited.add(neighborIdx);
+                parents.set(neighborIdx, {
+                    parentIdx: currentIdx,
+                    edgeIdx,
+                    direction: "hasMany",
+                });
+                queue.push({ nodeIdx: neighborIdx });
+            }
+        }
+    }
+    return { _tag: "NotFound", from, to };
+}
+/**
+ * Reconstruct the path from BFS parent pointers.
+ */
+function reconstructPath(graph, parents, fromIdx, toIdx) {
+    const steps = [];
+    let currentIdx = toIdx;
+    while (currentIdx !== fromIdx) {
+        const parent = parents.get(currentIdx);
+        if (!parent)
+            break; // Should never happen if BFS worked correctly
+        const edge = graph.edges.get(parent.edgeIdx);
+        if (!edge)
+            break;
+        const fromName = graph.nodes.get(parent.parentIdx);
+        const toName = graph.nodes.get(currentIdx);
+        if (fromName && toName) {
+            steps.unshift({
+                from: fromName,
+                to: toName,
+                direction: parent.direction,
+                constraintName: edge.data.constraintName,
+                columns: edge.data.columns,
+            });
+        }
+        currentIdx = parent.parentIdx;
+    }
+    return steps;
+}
+// ============================================================================
+// Visualization Helpers
+// ============================================================================
+/**
+ * Export the relation graph as a Mermaid diagram.
+ * Useful for documentation and debugging.
+ */
+export function toMermaid(graph) {
+    return Graph.toMermaid(graph, {
+        direction: "LR",
+        nodeLabel: (name) => name,
+        edgeLabel: (edge) => edge.constraintName,
+    });
+}
+/**
+ * Export the relation graph as a Mermaid diagram directly from IR.
+ */
+export function irToMermaid(ir) {
+    return toMermaid(buildRelationGraph(ir));
+}
+//# sourceMappingURL=relation-graph.js.map

package/dist/ir/relation-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"relation-graph.js","sourceRoot":"","sources":["../../src/ir/relation-graph.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAA;AAGnD,OAAO,EAAE,eAAe,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAA;AAwDjE,+EAA+E;AAC/E,qBAAqB;AACrB,+EAA+E;AAE/E;;;;;;;;GAQG;AACH,MAAM,UAAU,kBAAkB,CAAC,EAAc;IAC/C,MAAM,aAAa,GAAG,IAAI,CACxB,KAAK,CAAC,YAAY,CAAC,EAAE,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EACxC,KAAK,CAAC,MAAM,CAAC,aAAa,CAAC,CAC5B,CAAA;IAED,OAAO,KAAK,CAAC,QAAQ,CAAuB,CAAC,OAAO,EAAE,EAAE;QACtD,yCAAyC;QACzC,MAAM,WAAW,GAAG,IAAI,GAAG,CACzB,aAAa,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,OAAO,CAAC,OAAO,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAClF,CAAA;QAED,wCAAwC;QACxC,KAAK,MAAM,MAAM,IAAI,aAAa,EAAE,CAAC;YACnC,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YAC5C,IAAI,OAAO,KAAK,SAAS;gBAAE,SAAQ;YAEnC,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;gBACnC,IAAI,GAAG,CAAC,IAAI,KAAK,WAAW;oBAAE,SAAQ;gBAEtC,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,YAAY,CAAC,CAAA;gBAC/C,IAAI,KAAK,KAAK,SAAS;oBAAE,SAAQ,CAAC,mBAAmB;gBAErD,KAAK,CAAC,OAAO,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE;oBACrC,cAAc,EAAE,GAAG,CAAC,cAAc;oBAClC,OAAO,EAAE,GAAG,CAAC,OAAO;oBACpB,QAAQ,EAAE,MAAM,CAAC,IAAI;iBACtB,CAAC,CAAA;YACJ,CAAC;QACH,CAAC;IACH,CAAC,CAAC,CAAA;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAC5B,KAAoB,EACpB,UAAkB;IAElB,OAAO,KAAK,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,UAAU,CAAC,CAAA;AAC7D,CAAC;AAED,+EAA+E;AAC/E,oBAAoB;AACpB,+EAA+E;AAE/E;;;GAGG;AACH,SAAS,yBAAyB,CAChC,UAAkB,EAClB,QAAgB,EAChB,OAAwE,EACxE,SAAkC;IAElC,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IAE9E,OAAO,SAAS,KAAK,WAAW;QAC9B,CAAC,CAAC,GAAG,UAAU,QAAQ,WAAW,EAAE;QACpC,CAAC,CAAC,GAAG,QAAQ,QAAQ,WAAW,EAAE,CAAA;AACtC,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,mBAAmB,CAAC,EAAc,EAAE,UAAkB;IACpE,MAAM,OAAO,GAAG,eAAe,CAAC,EAAE,EAAE,UAAU,CAAC,CAAA;IAC/C,IAAI,CAAC,OAAO;QAAE,OAAO,EAAE,CAAA;IAEvB,MAAM,gBAAgB,GAAG,IAAI,CAC3B,OAAO,CAAC,SAAS,EACjB,KAAK,CAAC,SAAS,CAAC,CAAC,GAAG,EAAE,EAAE;QACtB,MAAM,MAAM,GAAG,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,YAAY,CAAC,CAAA;QAChD,IAAI,CAAC,MAAM,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC;YAAE,OAAO,MAAM,CAAC,IAAI,EAAE,CAAA;QAE3D,OAAO,MAAM,CAAC,IAAI,CAAiB;YACjC,MAAM,EAAE,MAAM;YACd,SAAS,EAAE,WAAW;YACtB,QAAQ,EAAE,GAAG;YACb,WAAW,EAAE,yBAAyB,CACpC,UAAU,EACV,GAAG,CAAC,YAAY,EAChB,GAAG,CAAC,OAAO,EACX,WAAW,CACZ;SACF,CAAC,CAAA;IACJ,CAAC,CAAC,CACH,CAAA;IAED,MAAM,cAAc,GAAG,IAAI,CACzB,OAAO,CAAC,OAAO,EACf,KAAK,CAAC,SAAS,CAAC,CAAC,GAAG,EAAE,EAAE;QACtB,MAAM,MAAM,GAAG,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,YAAY,CAAC,CAAA;QAChD,IAAI,CAAC,MAAM,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC;YAAE,OAAO,MAAM,CAAC,IAAI,EAAE,CAAA;QAE3D,OAAO,MAAM,CAAC,IAAI,CAAiB;YACjC,MAAM,EAAE,MAAM;YACd,SAAS,EAAE,SAAS;YACpB,QAAQ,EAAE,GAAG;YACb,WAAW,EAAE,yBAAyB,CACpC,GAAG,CAAC,YAAY,EAChB,UAAU,EACV,GAAG,CAAC,OAAO,EACX,SAAS,CACV;SACF,CAAC,CAAA;IACJ,CAAC,CAAC,CACH,CAAA;IAED,OAAO,CAAC,GAAG,gBAAgB,EAAE,GAAG,cAAc,CAAC,CAAA;AACjD,CAAC;AAeD;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,YAAY,CAAC,EAAc,EAAE,IAAY,EAAE,EAAU;IACnE,oBAAoB;IACpB,IAAI,IAAI,KAAK,EAAE,EAAE,CAAC;QAChB,OAAO,EAAE,IAAI,EAAE,YAAY,EAAE,MAAM,EAAE,IAAI,EAAE,CAAA;IAC7C,CAAC;IAED,0BAA0B;IAC1B,MAAM,UAAU,GAAG,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;IACxC,MAAM,QAAQ,GAAG,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;IAEpC,IAAI,CAAC,UAAU,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,EAAE,CAAC;QAC9C,OAAO,EAAE,IAAI,EAAE,gBAAgB,EAAE,MAAM,EAAE,IAAI,EAAE,CAAA;IACjD,CAAC;IACD,IAAI,CAAC,QAAQ,IAAI,CAAC,aAAa,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC1C,OAAO,EAAE,IAAI,EAAE,gBAAgB,EAAE,MAAM,EAAE,EAAE,EAAE,CAAA;IAC/C,CAAC;IAED,mCAAmC;IACnC,MAAM,KAAK,GAAG,kBAAkB,CAAC,EAAE,CAAC,CAAA;IACpC,MAAM,UAAU,GAAG,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;IAC9C,MAAM,QAAQ,GAAG,cAAc,CAAC,KAAK,EAAE,EAAE,CAAC,CAAA;IAE1C,IAAI,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;QACzD,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,EAAE,EAAE,CAAA;IACvC,CAAC;IAED,MAAM,OAAO,GAAG,UAAU,CAAC,KAAK,CAAA;IAChC,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAA;IAE5B,mDAAmD;IACnD,qFAAqF;IACrF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAmB,CAAA;IAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,EAA8B,CAAA;IACrD,MAAM,KAAK,GAAwC,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,CAAA;IAEzE,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;IAEpB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,OAAO,EAAE,UAAU,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAA;QAE9C,IAAI,UAAU,KAAK,KAAK,EAAE,CAAC;YACzB,0BAA0B;YAC1B,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,eAAe,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,EAAE,CAAA;QACjF,CAAC;QAED,+CAA+C;QAC/C,MAAM,aAAa,GAAG,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,EAAE,CAAA;QAC3D,KAAK,MAAM,OAAO,IAAI,aAAa,EAAE,CAAC;YACpC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;YACrC,IAAI,CAAC,IAAI;gBAAE,SAAQ;YAEnB,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAA;YAC/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;gBAC9B,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;gBACxB,OAAO,CAAC,GAAG,CAAC,WAAW,EAAE;oBACvB,SAAS,EAAE,UAAU;oBACrB,OAAO;oBACP,SAAS,EAAE,WAAW;iBACvB,CAAC,CAAA;gBACF,KAAK,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC,CAAA;YACtC,CAAC;QACH,CAAC;QAED,6CAA6C;QAC7C,MAAM,aAAa,GAAG,KAAK,CAAC,gBAAgB,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,EAAE,CAAA;QAClE,KAAK,MAAM,OAAO,IAAI,aAAa,EAAE,CAAC;YACpC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;YACrC,IAAI,CAAC,IAAI;gBAAE,SAAQ;YAEnB,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAA;YAC/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;gBAC9B,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;gBACxB,OAAO,CAAC,GAAG,CAAC,WAAW,EAAE;oBACvB,SAAS,EAAE,UAAU;oBACrB,OAAO;oBACP,SAAS,EAAE,SAAS;iBACrB,CAAC,CAAA;gBACF,KAAK,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC,CAAA;YACtC,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,EAAE,EAAE,CAAA;AACvC,CAAC;AAED;;GAEG;AACH,SAAS,eAAe,CACtB,KAAoB,EACpB,OAAwC,EACxC,OAAwB,EACxB,KAAsB;IAEtB,MAAM,KAAK,GAAe,EAAE,CAAA;IAC5B,IAAI,UAAU,GAAG,KAAK,CAAA;IAEtB,OAAO,UAAU,KAAK,OAAO,EAAE,CAAC;QAC9B,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;QACtC,IAAI,CAAC,MAAM;YAAE,MAAK,CAAC,8CAA8C;QAEjE,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;QAC5C,IAAI,CAAC,IAAI;YAAE,MAAK;QAEhB,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,CAAA;QAClD,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;QAE1C,IAAI,QAAQ,IAAI,MAAM,EAAE,CAAC;YACvB,KAAK,CAAC,OAAO,CAAC;gBACZ,IAAI,EAAE,QAAQ;gBACd,EAAE,EAAE,MAAM;gBACV,SAAS,EAAE,MAAM,CAAC,SAAS;gBAC3B,cAAc,EAAE,IAAI,CAAC,IAAI,CAAC,cAAc;gBACxC,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO;aAC3B,CAAC,CAAA;QACJ,CAAC;QAED,UAAU,GAAG,MAAM,CAAC,SAAS,CAAA;IAC/B,CAAC;IAED,OAAO,KAAK,CAAA;AACd,CAAC;AAED,+EAA+E;AAC/E,wBAAwB;AACxB,+EAA+E;AAE/E;;;GAGG;AACH,MAAM,UAAU,SAAS,CAAC,KAAoB;IAC5C,OAAO,KAAK,CAAC,SAAS,CAAC,KAAK,EAAE;QAC5B,SAAS,EAAE,IAAI;QACf,SAAS,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI;QACzB,SAAS,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,cAAc;KACzC,CAAC,CAAA;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,EAAc;IACxC,OAAO,SAAS,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC,CAAA;AAC1C,CAAC"}