@duckcodeailabs/dql-core 0.8.8 → 0.8.10

package/dist/lineage/query.d.ts

@@ -1,60 +0,0 @@
-/**
- * Lineage Query Engine — focused, searchable lineage views.
- *
- * Replaces the "show everything" approach with targeted subgraph queries:
- * - Focus on a specific node and get its upstream/downstream chain
- * - Search nodes by name across all types
- * - Filter by type, domain, depth
- */
-import { LineageGraph, type LineageNode, type LineageNodeType, type LineageGraphJSON } from './lineage-graph.js';
-export interface LineageQuery {
-    /** Node name or ID to center the query on */
-    focus?: string;
-    /** Search by name (case-insensitive substring match) */
-    search?: string;
-    /** Filter by node types */
-    types?: LineageNodeType[];
-    /** Filter by domain */
-    domain?: string;
-    /** Max hops upstream from focal node (default: Infinity) */
-    upstreamDepth?: number;
-    /** Max hops downstream from focal node (default: Infinity) */
-    downstreamDepth?: number;
-}
-export interface LineageQueryResult {
-    /** Focused subgraph containing only relevant nodes and edges */
-    graph: LineageGraphJSON;
-    /** The focal node (if focus was specified and resolved) */
-    focalNode?: LineageNode;
-    /** Search matches with relevance scores (if search was specified) */
-    matches?: Array<{
-        node: LineageNode;
-        score: number;
-    }>;
-}
-/**
- * Execute a lineage query against the graph.
- *
- * Examples:
- *   queryLineage(graph, { focus: 'total_revenue' })
- *     → subgraph centered on metric:total_revenue with full upstream/downstream
- *
- *   queryLineage(graph, { search: 'revenue' })
- *     → all nodes matching "revenue" with relevance scores
- *
- *   queryLineage(graph, { focus: 'fct_orders', upstreamDepth: 2, downstreamDepth: 1 })
- *     → 2 hops upstream, 1 hop downstream from dbt_model:fct_orders
- *
- *   queryLineage(graph, { domain: 'finance', types: ['metric', 'block'] })
- *     → all finance metrics and blocks with their immediate connections
- */
-export declare function queryLineage(graph: LineageGraph, query: LineageQuery): LineageQueryResult;
-/**
- * Lightweight search — returns matching nodes without building a subgraph.
- * Suitable for autocomplete / search-as-you-type.
- */
-export declare function searchNodes(graph: LineageGraph, searchTerm: string, limit?: number): Array<{
-    node: LineageNode;
-    score: number;
-}>;
-//# sourceMappingURL=query.d.ts.map

package/dist/lineage/query.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"query.d.ts","sourceRoot":"","sources":["../../src/lineage/query.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAAE,YAAY,EAAE,KAAK,WAAW,EAAE,KAAK,eAAe,EAAE,KAAK,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAIjH,MAAM,WAAW,YAAY;IAC3B,6CAA6C;IAC7C,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,wDAAwD;IACxD,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,2BAA2B;IAC3B,KAAK,CAAC,EAAE,eAAe,EAAE,CAAC;IAC1B,uBAAuB;IACvB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,4DAA4D;IAC5D,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,8DAA8D;IAC9D,eAAe,CAAC,EAAE,MAAM,CAAC;CAC1B;AAED,MAAM,WAAW,kBAAkB;IACjC,gEAAgE;IAChE,KAAK,EAAE,gBAAgB,CAAC;IACxB,2DAA2D;IAC3D,SAAS,CAAC,EAAE,WAAW,CAAC;IACxB,qEAAqE;IACrE,OAAO,CAAC,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,WAAW,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CACvD;AA2FD;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,YAAY,EAAE,KAAK,EAAE,YAAY,GAAG,kBAAkB,CAkBzF;AA0FD;;;GAGG;AACH,wBAAgB,WAAW,CACzB,KAAK,EAAE,YAAY,EACnB,UAAU,EAAE,MAAM,EAClB,KAAK,SAAK,GACT,KAAK,CAAC;IAAE,IAAI,EAAE,WAAW,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC,CAY7C"}

package/dist/lineage/query.js

@@ -1,211 +0,0 @@
-/**
- * Lineage Query Engine — focused, searchable lineage views.
- *
- * Replaces the "show everything" approach with targeted subgraph queries:
- * - Focus on a specific node and get its upstream/downstream chain
- * - Search nodes by name across all types
- * - Filter by type, domain, depth
- */
-// ---- Node ID Resolution ----
-/** Type prefixes to try when resolving a name to a node ID */
-const NODE_PREFIXES = [
-    'block:',
-    'metric:',
-    'table:',
-    'dbt_model:',
-    'dbt_source:',
-    'dashboard:',
-    'dimension:',
-    'chart:',
-    'domain:',
-];
-/**
- * Resolve a name or ID to a node in the graph.
- * Tries exact match first, then prefixed matches.
- */
-function resolveNode(graph, nameOrId) {
-    // Exact match (already prefixed)
-    const exact = graph.getNode(nameOrId);
-    if (exact)
-        return exact;
-    // Try each prefix
-    for (const prefix of NODE_PREFIXES) {
-        const node = graph.getNode(`${prefix}${nameOrId}`);
-        if (node)
-            return node;
-    }
-    // Fuzzy: find first node whose name matches (case-insensitive)
-    const lower = nameOrId.toLowerCase();
-    for (const node of graph.getAllNodes()) {
-        if (node.name.toLowerCase() === lower)
-            return node;
-    }
-    return undefined;
-}
-// ---- Search Scoring ----
-function scoreMatch(nodeName, query) {
-    const name = nodeName.toLowerCase();
-    const q = query.toLowerCase();
-    if (name === q)
-        return 100; // exact match
-    if (name.startsWith(q))
-        return 80; // starts with
-    if (name.endsWith(q))
-        return 60; // ends with
-    if (name.includes(q))
-        return 40; // substring
-    return 0; // no match
-}
-// ---- Depth-Limited BFS ----
-/**
- * BFS traversal with depth limiting.
- * direction='upstream' follows incoming edges, 'downstream' follows outgoing.
- */
-function depthLimitedBFS(graph, startId, direction, maxDepth) {
-    const visited = new Set();
-    const queue = [{ id: startId, depth: 0 }];
-    while (queue.length > 0) {
-        const { id, depth } = queue.shift();
-        if (depth > maxDepth)
-            continue;
-        const edges = direction === 'upstream'
-            ? graph.getIncomingEdges(id)
-            : graph.getOutgoingEdges(id);
-        for (const edge of edges) {
-            const nextId = direction === 'upstream' ? edge.source : edge.target;
-            if (!visited.has(nextId)) {
-                visited.add(nextId);
-                queue.push({ id: nextId, depth: depth + 1 });
-            }
-        }
-    }
-    return visited;
-}
-// ---- Query Execution ----
-/**
- * Execute a lineage query against the graph.
- *
- * Examples:
- *   queryLineage(graph, { focus: 'total_revenue' })
- *     → subgraph centered on metric:total_revenue with full upstream/downstream
- *
- *   queryLineage(graph, { search: 'revenue' })
- *     → all nodes matching "revenue" with relevance scores
- *
- *   queryLineage(graph, { focus: 'fct_orders', upstreamDepth: 2, downstreamDepth: 1 })
- *     → 2 hops upstream, 1 hop downstream from dbt_model:fct_orders
- *
- *   queryLineage(graph, { domain: 'finance', types: ['metric', 'block'] })
- *     → all finance metrics and blocks with their immediate connections
- */
-export function queryLineage(graph, query) {
-    // Search mode: return matching nodes with scores
-    if (query.search && !query.focus) {
-        return executeSearch(graph, query);
-    }
-    // Focus mode: return subgraph centered on a node
-    if (query.focus) {
-        return executeFocus(graph, query);
-    }
-    // Filter mode: domain and/or type filter
-    if (query.domain || query.types) {
-        return executeFilter(graph, query);
-    }
-    // Default: return the full graph
-    return { graph: graph.toJSON() };
-}
-function executeSearch(graph, query) {
-    const searchTerm = query.search;
-    const matches = [];
-    for (const node of graph.getAllNodes()) {
-        // Apply type filter
-        if (query.types && !query.types.includes(node.type))
-            continue;
-        // Apply domain filter
-        if (query.domain && node.domain !== query.domain)
-            continue;
-        const score = scoreMatch(node.name, searchTerm);
-        if (score > 0) {
-            matches.push({ node, score });
-        }
-    }
-    // Sort by score descending, then alphabetically
-    matches.sort((a, b) => b.score - a.score || a.node.name.localeCompare(b.node.name));
-    // Build a subgraph of matched nodes with their immediate edges
-    const matchedIds = new Set(matches.map((m) => m.node.id));
-    const sub = graph.subgraph((n) => matchedIds.has(n.id));
-    return {
-        graph: sub.toJSON(),
-        matches,
-    };
-}
-function executeFocus(graph, query) {
-    const focalNode = resolveNode(graph, query.focus);
-    if (!focalNode) {
-        return { graph: { nodes: [], edges: [] }, matches: [] };
-    }
-    const upstreamDepth = query.upstreamDepth ?? Infinity;
-    const downstreamDepth = query.downstreamDepth ?? Infinity;
-    // Collect all nodes in the focused subgraph
-    const nodeIds = new Set([focalNode.id]);
-    // Upstream BFS
-    const upstreamIds = depthLimitedBFS(graph, focalNode.id, 'upstream', upstreamDepth);
-    for (const id of upstreamIds)
-        nodeIds.add(id);
-    // Downstream BFS
-    const downstreamIds = depthLimitedBFS(graph, focalNode.id, 'downstream', downstreamDepth);
-    for (const id of downstreamIds)
-        nodeIds.add(id);
-    // Apply type/domain filters if specified
-    const sub = graph.subgraph((n) => {
-        if (!nodeIds.has(n.id))
-            return false;
-        if (query.types && !query.types.includes(n.type) && n.id !== focalNode.id)
-            return false;
-        if (query.domain && n.domain !== query.domain && n.id !== focalNode.id)
-            return false;
-        return true;
-    });
-    return {
-        graph: sub.toJSON(),
-        focalNode,
-    };
-}
-function executeFilter(graph, query) {
-    // Get matching nodes
-    const matchedNodes = graph.getAllNodes().filter((n) => {
-        if (query.types && !query.types.includes(n.type))
-            return false;
-        if (query.domain && n.domain !== query.domain)
-            return false;
-        return true;
-    });
-    const matchedIds = new Set(matchedNodes.map((n) => n.id));
-    // Also include immediate neighbors to show connections
-    for (const node of matchedNodes) {
-        for (const edge of graph.getIncomingEdges(node.id)) {
-            matchedIds.add(edge.source);
-        }
-        for (const edge of graph.getOutgoingEdges(node.id)) {
-            matchedIds.add(edge.target);
-        }
-    }
-    const sub = graph.subgraph((n) => matchedIds.has(n.id));
-    return { graph: sub.toJSON() };
-}
-/**
- * Lightweight search — returns matching nodes without building a subgraph.
- * Suitable for autocomplete / search-as-you-type.
- */
-export function searchNodes(graph, searchTerm, limit = 20) {
-    const matches = [];
-    for (const node of graph.getAllNodes()) {
-        const score = scoreMatch(node.name, searchTerm);
-        if (score > 0) {
-            matches.push({ node, score });
-        }
-    }
-    matches.sort((a, b) => b.score - a.score || a.node.name.localeCompare(b.node.name));
-    return matches.slice(0, limit);
-}
-//# sourceMappingURL=query.js.map

package/dist/lineage/query.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"query.js","sourceRoot":"","sources":["../../src/lineage/query.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AA8BH,+BAA+B;AAE/B,8DAA8D;AAC9D,MAAM,aAAa,GAAG;IACpB,QAAQ;IACR,SAAS;IACT,QAAQ;IACR,YAAY;IACZ,aAAa;IACb,YAAY;IACZ,YAAY;IACZ,QAAQ;IACR,SAAS;CACV,CAAC;AAEF;;;GAGG;AACH,SAAS,WAAW,CAAC,KAAmB,EAAE,QAAgB;IACxD,iCAAiC;IACjC,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IACtC,IAAI,KAAK;QAAE,OAAO,KAAK,CAAC;IAExB,kBAAkB;IAClB,KAAK,MAAM,MAAM,IAAI,aAAa,EAAE,CAAC;QACnC,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,MAAM,GAAG,QAAQ,EAAE,CAAC,CAAC;QACnD,IAAI,IAAI;YAAE,OAAO,IAAI,CAAC;IACxB,CAAC;IAED,+DAA+D;IAC/D,MAAM,KAAK,GAAG,QAAQ,CAAC,WAAW,EAAE,CAAC;IACrC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC;QACvC,IAAI,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,KAAK,KAAK;YAAE,OAAO,IAAI,CAAC;IACrD,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,2BAA2B;AAE3B,SAAS,UAAU,CAAC,QAAgB,EAAE,KAAa;IACjD,MAAM,IAAI,GAAG,QAAQ,CAAC,WAAW,EAAE,CAAC;IACpC,MAAM,CAAC,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;IAE9B,IAAI,IAAI,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC,CAAa,cAAc;IACtD,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;QAAE,OAAO,EAAE,CAAC,CAAM,cAAc;IACtD,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,OAAO,EAAE,CAAC,CAAQ,YAAY;IACpD,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,OAAO,EAAE,CAAC,CAAQ,YAAY;IACpD,OAAO,CAAC,CAAC,CAAgC,WAAW;AACtD,CAAC;AAED,8BAA8B;AAE9B;;;GAGG;AACH,SAAS,eAAe,CACtB,KAAmB,EACnB,OAAe,EACf,SAAoC,EACpC,QAAgB;IAEhB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAyC,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;IAEhF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QACrC,IAAI,KAAK,GAAG,QAAQ;YAAE,SAAS;QAE/B,MAAM,KAAK,GAAG,SAAS,KAAK,UAAU;YACpC,CAAC,CAAC,KAAK,CAAC,gBAAgB,CAAC,EAAE,CAAC;YAC5B,CAAC,CAAC,KAAK,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;QAE/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,MAAM,GAAG,SAAS,KAAK,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;YACpE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACzB,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACpB,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,4BAA4B;AAE5B;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,YAAY,CAAC,KAAmB,EAAE,KAAmB;IACnE,iDAAiD;IACjD,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACjC,OAAO,aAAa,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IACrC,CAAC;IAED,iDAAiD;IACjD,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAChB,OAAO,YAAY,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IACpC,CAAC;IAED,yCAAyC;IACzC,IAAI,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAChC,OAAO,aAAa,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IACrC,CAAC;IAED,iCAAiC;IACjC,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;AACnC,CAAC;AAED,SAAS,aAAa,CAAC,KAAmB,EAAE,KAAmB;IAC7D,MAAM,UAAU,GAAG,KAAK,CAAC,MAAO,CAAC;IACjC,MAAM,OAAO,GAAgD,EAAE,CAAC;IAEhE,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC;QACvC,oBAAoB;QACpB,IAAI,KAAK,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,SAAS;QAC9D,sBAAsB;QACtB,IAAI,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;YAAE,SAAS;QAE3D,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QAChD,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACd,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IAED,gDAAgD;IAChD,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAEpF,+DAA+D;IAC/D,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1D,MAAM,GAAG,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAExD,OAAO;QACL,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE;QACnB,OAAO;KACR,CAAC;AACJ,CAAC;AAED,SAAS,YAAY,CAAC,KAAmB,EAAE,KAAmB;IAC5D,MAAM,SAAS,GAAG,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,KAAM,CAAC,CAAC;IACnD,IAAI,CAAC,SAAS,EAAE,CAAC;QACf,OAAO,EAAE,KAAK,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;IAC1D,CAAC;IAED,MAAM,aAAa,GAAG,KAAK,CAAC,aAAa,IAAI,QAAQ,CAAC;IACtD,MAAM,eAAe,GAAG,KAAK,CAAC,eAAe,IAAI,QAAQ,CAAC;IAE1D,4CAA4C;IAC5C,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,CAAC;IAEhD,eAAe;IACf,MAAM,WAAW,GAAG,eAAe,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE,UAAU,EAAE,aAAa,CAAC,CAAC;IACpF,KAAK,MAAM,EAAE,IAAI,WAAW;QAAE,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAE9C,iBAAiB;IACjB,MAAM,aAAa,GAAG,eAAe,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE,YAAY,EAAE,eAAe,CAAC,CAAC;IAC1F,KAAK,MAAM,EAAE,IAAI,aAAa;QAAE,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAEhD,yCAAyC;IACzC,MAAM,GAAG,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,EAAE;QAC/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YAAE,OAAO,KAAK,CAAC;QACrC,IAAI,KAAK,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,SAAS,CAAC,EAAE;YAAE,OAAO,KAAK,CAAC;QACxF,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,EAAE,KAAK,SAAS,CAAC,EAAE;YAAE,OAAO,KAAK,CAAC;QACrF,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC;IAEH,OAAO;QACL,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE;QACnB,SAAS;KACV,CAAC;AACJ,CAAC;AAED,SAAS,aAAa,CAAC,KAAmB,EAAE,KAAmB;IAC7D,qBAAqB;IACrB,MAAM,YAAY,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;QACpD,IAAI,KAAK,CAAC,KAAK,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC;YAAE,OAAO,KAAK,CAAC;QAC/D,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM;YAAE,OAAO,KAAK,CAAC;QAC5D,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC;IAEH,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAE1D,uDAAuD;IACvD,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;QAChC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACnD,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC9B,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACnD,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,MAAM,GAAG,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAExD,OAAO,EAAE,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC;AACjC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,WAAW,CACzB,KAAmB,EACnB,UAAkB,EAClB,KAAK,GAAG,EAAE;IAEV,MAAM,OAAO,GAAgD,EAAE,CAAC;IAEhE,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QAChD,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACd,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IAED,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IACpF,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AACjC,CAAC"}