@duckcodeailabs/dql-core 0.3.1 → 0.6.0

package/LICENSE

@@ -0,0 +1,123 @@
+Apache License
+Version 2.0, January 2004
+http://www.apache.org/licenses/
+
+TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+1. Definitions.
+
+"License" shall mean the terms and conditions for use, reproduction, and
+distribution as defined by Sections 1 through 9 of this document.
+
+"Licensor" shall mean the copyright owner or entity authorized by the copyright
+owner that is granting the License.
+
+"Legal Entity" shall mean the union of the acting entity and all other entities
+that control, are controlled by, or are under common control with that entity.
+For the purposes of this definition, "control" means (i) the power, direct or
+indirect, to cause the direction or management of such entity, whether by
+contract or otherwise, or (ii) ownership of fifty percent (50%) or more of the
+outstanding shares, or (iii) beneficial ownership of such entity.
+
+"You" (or "Your") shall mean an individual or Legal Entity exercising
+permissions granted by this License.
+
+"Source" form shall mean the preferred form for making modifications, including
+but not limited to software source code, documentation source, and configuration
+files.
+
+"Object" form shall mean any form resulting from mechanical transformation or
+translation of a Source form, including but not limited to compiled object code,
+generated documentation, and conversions to other media types.
+
+"Work" shall mean the work of authorship, whether in Source or Object form, made
+available under the License, as indicated by a copyright notice that is included
+in or attached to the work.
+
+"Derivative Works" shall mean any work, whether in Source or Object form, that
+is based on (or derived from) the Work and for which the editorial revisions,
+annotations, elaborations, or other modifications represent, as a whole, an
+original work of authorship.
+
+"Contribution" shall mean any work of authorship, including the original version
+of the Work and any modifications or additions to that Work or Derivative Works
+thereof, that is intentionally submitted to Licensor for inclusion in the Work
+by the copyright owner or by an individual or Legal Entity authorized to submit
+on behalf of the copyright owner.
+
+"Contributor" shall mean Licensor and any individual or Legal Entity on behalf
+of whom a Contribution has been received by Licensor and subsequently
+incorporated within the Work.
+
+2. Grant of Copyright License.
+
+Subject to the terms and conditions of this License, each Contributor hereby
+grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free,
+irrevocable copyright license to reproduce, prepare Derivative Works of,
+publicly display, publicly perform, sublicense, and distribute the Work and such
+Derivative Works in Source or Object form.
+
+3. Grant of Patent License.
+
+Subject to the terms and conditions of this License, each Contributor hereby
+grants to You a perpetual, worldwide, non-exclusive, no-charge, royalty-free,
+irrevocable patent license to make, have made, use, offer to sell, sell, import,
+and otherwise transfer the Work.
+
+4. Redistribution.
+
+You may reproduce and distribute copies of the Work or Derivative Works thereof
+in any medium, with or without modifications, and in Source or Object form,
+provided that You meet the following conditions:
+
+(a) You must give any other recipients of the Work or Derivative Works a copy of
+this License; and
+
+(b) You must cause any modified files to carry prominent notices stating that
+You changed the files; and
+
+(c) You must retain, in the Source form of any Derivative Works that You
+distribute, all copyright, patent, trademark, and attribution notices from the
+Source form of the Work, excluding those notices that do not pertain to any part
+of the Derivative Works; and
+
+(d) If the Work includes a "NOTICE" text file as part of its distribution, then
+any Derivative Works that You distribute must include a readable copy of the
+attribution notices contained within such NOTICE file, excluding those notices
+that do not pertain to any part of the Derivative Works.
+
+5. Submission of Contributions.
+
+Unless You explicitly state otherwise, any Contribution intentionally submitted
+for inclusion in the Work by You to the Licensor shall be under the terms and
+conditions of this License, without any additional terms or conditions.
+
+6. Trademarks.
+
+This License does not grant permission to use the trade names, trademarks,
+service marks, or product names of the Licensor, except as required for
+reasonable and customary use in describing the origin of the Work.
+
+7. Disclaimer of Warranty.
+
+Unless required by applicable law or agreed to in writing, Licensor provides the
+Work on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either
+express or implied, including, without limitation, any warranties or conditions
+of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A PARTICULAR
+PURPOSE.
+
+8. Limitation of Liability.
+
+In no event and under no legal theory, whether in tort (including negligence),
+contract, or otherwise, unless required by applicable law, shall any Contributor
+be liable to You for damages, including any direct, indirect, special,
+incidental, or consequential damages of any character arising as a result of this
+License or out of the use or inability to use the Work.
+
+9. Accepting Warranty or Additional Liability.
+
+While redistributing the Work or Derivative Works thereof, You may choose to
+offer, and charge a fee for, acceptance of support, warranty, indemnity, or
+other liability obligations and/or rights consistent with this License.
+
+END OF TERMS AND CONDITIONS

package/dist/index.d.ts

@@ -4,4 +4,5 @@ export * from './parser/index.js';
 export * from './semantic/index.js';
 export * from './errors/index.js';
 export * from './formatter/index.js';
+export * from './lineage/index.js';
 //# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAGA,cAAc,kBAAkB,CAAC;AACjC,cAAc,gBAAgB,CAAC;AAC/B,cAAc,mBAAmB,CAAC;AAClC,cAAc,qBAAqB,CAAC;AACpC,cAAc,mBAAmB,CAAC;AAClC,cAAc,sBAAsB,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAGA,cAAc,kBAAkB,CAAC;AACjC,cAAc,gBAAgB,CAAC;AAC/B,cAAc,mBAAmB,CAAC;AAClC,cAAc,qBAAqB,CAAC;AACpC,cAAc,mBAAmB,CAAC;AAClC,cAAc,sBAAsB,CAAC;AACrC,cAAc,oBAAoB,CAAC"}

package/dist/index.js

@@ -6,4 +6,5 @@ export * from './parser/index.js';
 export * from './semantic/index.js';
 export * from './errors/index.js';
 export * from './formatter/index.js';
+export * from './lineage/index.js';
 //# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,gCAAgC;AAChC,wCAAwC;AAExC,cAAc,kBAAkB,CAAC;AACjC,cAAc,gBAAgB,CAAC;AAC/B,cAAc,mBAAmB,CAAC;AAClC,cAAc,qBAAqB,CAAC;AACpC,cAAc,mBAAmB,CAAC;AAClC,cAAc,sBAAsB,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,gCAAgC;AAChC,wCAAwC;AAExC,cAAc,kBAAkB,CAAC;AACjC,cAAc,gBAAgB,CAAC;AAC/B,cAAc,mBAAmB,CAAC;AAClC,cAAc,qBAAqB,CAAC;AACpC,cAAc,mBAAmB,CAAC;AAClC,cAAc,sBAAsB,CAAC;AACrC,cAAc,oBAAoB,CAAC"}

package/dist/lineage/builder.d.ts

@@ -0,0 +1,43 @@
+/**
+ * Lineage Builder — assembles the full answer-layer lineage graph.
+ *
+ * Walks DQL blocks and semantic layer definitions to build a complete
+ * LineageGraph connecting source tables → blocks → metrics → charts,
+ * with domain boundaries and certification edges.
+ */
+import { LineageGraph } from './lineage-graph.js';
+export interface LineageBlockInput {
+    name: string;
+    sql: string;
+    domain?: string;
+    owner?: string;
+    status?: 'draft' | 'review' | 'certified' | 'deprecated' | 'pending_recertification';
+    certifiedBy?: string;
+    /** Block type: custom, semantic, etc. */
+    blockType?: string;
+    /** Metric reference for semantic blocks */
+    metricRef?: string;
+    /** Chart type from visualization config */
+    chartType?: string;
+    /** Materialized table/view name */
+    materializedAs?: string;
+}
+export interface LineageMetricInput {
+    name: string;
+    table: string;
+    domain: string;
+    type: string;
+}
+export interface LineageDimensionInput {
+    name: string;
+    table: string;
+}
+export interface LineageBuilderOptions {
+    /** Known block names for implicit dependency resolution */
+    blockNames?: Set<string>;
+}
+/**
+ * Build a complete lineage graph from blocks and semantic definitions.
+ */
+export declare function buildLineageGraph(blocks: LineageBlockInput[], metrics: LineageMetricInput[], dimensions: LineageDimensionInput[], options?: LineageBuilderOptions): LineageGraph;
+//# sourceMappingURL=builder.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"builder.d.ts","sourceRoot":"","sources":["../../src/lineage/builder.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAGH,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAIlD,MAAM,WAAW,iBAAiB;IAChC,IAAI,EAAE,MAAM,CAAC;IACb,GAAG,EAAE,MAAM,CAAC;IACZ,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,OAAO,GAAG,QAAQ,GAAG,WAAW,GAAG,YAAY,GAAG,yBAAyB,CAAC;IACrF,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,yCAAyC;IACzC,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,2CAA2C;IAC3C,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,2CAA2C;IAC3C,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,mCAAmC;IACnC,cAAc,CAAC,EAAE,MAAM,CAAC;CACzB;AAED,MAAM,WAAW,kBAAkB;IACjC,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;CACd;AAED,MAAM,WAAW,qBAAqB;IACpC,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,qBAAqB;IACpC,2DAA2D;IAC3D,UAAU,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;CAC1B;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAC/B,MAAM,EAAE,iBAAiB,EAAE,EAC3B,OAAO,EAAE,kBAAkB,EAAE,EAC7B,UAAU,EAAE,qBAAqB,EAAE,EACnC,OAAO,GAAE,qBAA0B,GAClC,YAAY,CAyId"}

package/dist/lineage/builder.js

@@ -0,0 +1,192 @@
+/**
+ * Lineage Builder — assembles the full answer-layer lineage graph.
+ *
+ * Walks DQL blocks and semantic layer definitions to build a complete
+ * LineageGraph connecting source tables → blocks → metrics → charts,
+ * with domain boundaries and certification edges.
+ */
+import { extractTablesFromSql } from './sql-parser.js';
+import { LineageGraph } from './lineage-graph.js';
+/**
+ * Build a complete lineage graph from blocks and semantic definitions.
+ */
+export function buildLineageGraph(blocks, metrics, dimensions, options = {}) {
+    const graph = new LineageGraph();
+    const blockNames = options.blockNames ?? new Set(blocks.map((b) => b.name));
+    const materializedMap = new Map();
+    for (const block of blocks) {
+        materializedMap.set((block.materializedAs ?? block.name).toLowerCase(), block.name);
+    }
+    // 1. Add block nodes
+    for (const block of blocks) {
+        graph.addNode({
+            id: `block:${block.name}`,
+            type: 'block',
+            name: block.name,
+            domain: block.domain,
+            owner: block.owner,
+            status: block.status,
+            metadata: {
+                blockType: block.blockType,
+                materializedAs: block.materializedAs,
+            },
+        });
+    }
+    // 2. Add metric nodes
+    for (const metric of metrics) {
+        graph.addNode({
+            id: `metric:${metric.name}`,
+            type: 'metric',
+            name: metric.name,
+            domain: metric.domain,
+            metadata: { type: metric.type },
+        });
+        // Metric → source table edge
+        const tableNodeId = ensureTableNode(graph, metric.table);
+        graph.addEdge({
+            source: tableNodeId,
+            target: `metric:${metric.name}`,
+            type: 'aggregates',
+        });
+    }
+    // 3. Add dimension nodes
+    for (const dim of dimensions) {
+        graph.addNode({
+            id: `dimension:${dim.name}`,
+            type: 'dimension',
+            name: dim.name,
+        });
+        const tableNodeId = ensureTableNode(graph, dim.table);
+        graph.addEdge({
+            source: tableNodeId,
+            target: `dimension:${dim.name}`,
+            type: 'reads_from',
+        });
+    }
+    // 4. Process each block's SQL for dependencies
+    for (const block of blocks) {
+        const blockNodeId = `block:${block.name}`;
+        const parseResult = extractTablesFromSql(block.sql);
+        // ref() calls → block-to-block edges
+        for (const ref of parseResult.refs) {
+            if (blockNames.has(ref)) {
+                graph.addEdge({
+                    source: `block:${ref}`,
+                    target: blockNodeId,
+                    type: 'feeds_into',
+                });
+                addCrossDomainEdgeIfNeeded(graph, `block:${ref}`, blockNodeId);
+            }
+        }
+        // SQL table references
+        for (const table of parseResult.tables) {
+            const resolved = materializedMap.get(table.toLowerCase());
+            if (resolved && resolved !== block.name) {
+                // Table matches another block's materialized name
+                graph.addEdge({
+                    source: `block:${resolved}`,
+                    target: blockNodeId,
+                    type: 'feeds_into',
+                });
+                addCrossDomainEdgeIfNeeded(graph, `block:${resolved}`, blockNodeId);
+            }
+            else if (!resolved) {
+                // External table dependency
+                const tableNodeId = ensureTableNode(graph, table);
+                graph.addEdge({
+                    source: tableNodeId,
+                    target: blockNodeId,
+                    type: 'reads_from',
+                });
+            }
+        }
+        // Semantic block → metric edge
+        if (block.blockType === 'semantic' && block.metricRef) {
+            const metricNodeId = `metric:${block.metricRef}`;
+            if (graph.getNode(metricNodeId)) {
+                graph.addEdge({
+                    source: metricNodeId,
+                    target: blockNodeId,
+                    type: 'aggregates',
+                });
+                addCrossDomainEdgeIfNeeded(graph, metricNodeId, blockNodeId);
+            }
+        }
+        // Chart visualization edge
+        if (block.chartType) {
+            const chartNodeId = `chart:${block.name}`;
+            graph.addNode({
+                id: chartNodeId,
+                type: 'chart',
+                name: `${block.name} (${block.chartType})`,
+                domain: block.domain,
+                metadata: { chartType: block.chartType },
+            });
+            graph.addEdge({
+                source: blockNodeId,
+                target: chartNodeId,
+                type: 'visualizes',
+            });
+        }
+        // Certification is stored as node metadata (status + certifiedBy), not as an edge.
+        // Self-loops would confuse graph traversal without adding lineage value.
+    }
+    // 5. Add domain nodes and connect
+    addDomainNodes(graph);
+    return graph;
+}
+/** Ensure a source_table node exists and return its ID. */
+function ensureTableNode(graph, rawTableName) {
+    const tableName = normalizeTableName(rawTableName);
+    const nodeId = `table:${tableName}`;
+    if (!graph.getNode(nodeId)) {
+        graph.addNode({
+            id: nodeId,
+            type: 'source_table',
+            name: tableName,
+        });
+    }
+    return nodeId;
+}
+/**
+ * Normalize DuckDB reader function calls to plain table names.
+ * e.g., "read_csv_auto('./data/revenue.csv')" → "revenue"
+ */
+function normalizeTableName(name) {
+    const readerMatch = name.match(/^(?:read_csv_auto|read_csv|read_parquet|read_json|read_json_auto)\s*\(\s*['"]([^'"]+)['"]\s*\)$/i);
+    if (readerMatch) {
+        // Extract filename without extension from the path
+        const path = readerMatch[1];
+        const filename = path.split('/').pop() ?? path;
+        return filename.replace(/\.(csv|parquet|json)$/i, '');
+    }
+    return name;
+}
+/** Add a crosses_domain edge if source and target are in different domains. */
+function addCrossDomainEdgeIfNeeded(graph, sourceId, targetId) {
+    const sourceNode = graph.getNode(sourceId);
+    const targetNode = graph.getNode(targetId);
+    if (sourceNode?.domain && targetNode?.domain && sourceNode.domain !== targetNode.domain) {
+        graph.addEdge({
+            source: sourceId,
+            target: targetId,
+            type: 'crosses_domain',
+            sourceDomain: sourceNode.domain,
+            targetDomain: targetNode.domain,
+        });
+    }
+}
+/** Add domain nodes and connect blocks/metrics to their domains. */
+function addDomainNodes(graph) {
+    const domains = graph.getDomains();
+    for (const domain of domains) {
+        const domainNodeId = `domain:${domain}`;
+        graph.addNode({
+            id: domainNodeId,
+            type: 'domain',
+            name: domain,
+            domain,
+        });
+    }
+}
+//# sourceMappingURL=builder.js.map

package/dist/lineage/builder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"builder.js","sourceRoot":"","sources":["../../src/lineage/builder.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,oBAAoB,EAAE,MAAM,iBAAiB,CAAC;AACvD,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAsClD;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAC/B,MAA2B,EAC3B,OAA6B,EAC7B,UAAmC,EACnC,UAAiC,EAAE;IAEnC,MAAM,KAAK,GAAG,IAAI,YAAY,EAAE,CAAC;IACjC,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC5E,MAAM,eAAe,GAAG,IAAI,GAAG,EAAkB,CAAC;IAElD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,eAAe,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,cAAc,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;IACtF,CAAC;IAED,qBAAqB;IACrB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,KAAK,CAAC,OAAO,CAAC;YACZ,EAAE,EAAE,SAAS,KAAK,CAAC,IAAI,EAAE;YACzB,IAAI,EAAE,OAAO;YACb,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,MAAM,EAAE,KAAK,CAAC,MAAM;YACpB,KAAK,EAAE,KAAK,CAAC,KAAK;YAClB,MAAM,EAAE,KAAK,CAAC,MAAM;YACpB,QAAQ,EAAE;gBACR,SAAS,EAAE,KAAK,CAAC,SAAS;gBAC1B,cAAc,EAAE,KAAK,CAAC,cAAc;aACrC;SACF,CAAC,CAAC;IACL,CAAC;IAED,sBAAsB;IACtB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,KAAK,CAAC,OAAO,CAAC;YACZ,EAAE,EAAE,UAAU,MAAM,CAAC,IAAI,EAAE;YAC3B,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,MAAM,CAAC,IAAI;YACjB,MAAM,EAAE,MAAM,CAAC,MAAM;YACrB,QAAQ,EAAE,EAAE,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE;SAChC,CAAC,CAAC;QAEH,6BAA6B;QAC7B,MAAM,WAAW,GAAG,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;QACzD,KAAK,CAAC,OAAO,CAAC;YACZ,MAAM,EAAE,WAAW;YACnB,MAAM,EAAE,UAAU,MAAM,CAAC,IAAI,EAAE;YAC/B,IAAI,EAAE,YAAY;SACnB,CAAC,CAAC;IACL,CAAC;IAED,yBAAyB;IACzB,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;QAC7B,KAAK,CAAC,OAAO,CAAC;YACZ,EAAE,EAAE,aAAa,GAAG,CAAC,IAAI,EAAE;YAC3B,IAAI,EAAE,WAAW;YACjB,IAAI,EAAE,GAAG,CAAC,IAAI;SACf,CAAC,CAAC;QAEH,MAAM,WAAW,GAAG,eAAe,CAAC,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;QACtD,KAAK,CAAC,OAAO,CAAC;YACZ,MAAM,EAAE,WAAW;YACnB,MAAM,EAAE,aAAa,GAAG,CAAC,IAAI,EAAE;YAC/B,IAAI,EAAE,YAAY;SACnB,CAAC,CAAC;IACL,CAAC;IAED,+CAA+C;IAC/C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,WAAW,GAAG,SAAS,KAAK,CAAC,IAAI,EAAE,CAAC;QAC1C,MAAM,WAAW,GAAG,oBAAoB,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAEpD,qCAAqC;QACrC,KAAK,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,CAAC;YACnC,IAAI,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACxB,KAAK,CAAC,OAAO,CAAC;oBACZ,MAAM,EAAE,SAAS,GAAG,EAAE;oBACtB,MAAM,EAAE,WAAW;oBACnB,IAAI,EAAE,YAAY;iBACnB,CAAC,CAAC;gBACH,0BAA0B,CAAC,KAAK,EAAE,SAAS,GAAG,EAAE,EAAE,WAAW,CAAC,CAAC;YACjE,CAAC;QACH,CAAC;QAED,uBAAuB;QACvB,KAAK,MAAM,KAAK,IAAI,WAAW,CAAC,MAAM,EAAE,CAAC;YACvC,MAAM,QAAQ,GAAG,eAAe,CAAC,GAAG,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC;YAC1D,IAAI,QAAQ,IAAI,QAAQ,KAAK,KAAK,CAAC,IAAI,EAAE,CAAC;gBACxC,kDAAkD;gBAClD,KAAK,CAAC,OAAO,CAAC;oBACZ,MAAM,EAAE,SAAS,QAAQ,EAAE;oBAC3B,MAAM,EAAE,WAAW;oBACnB,IAAI,EAAE,YAAY;iBACnB,CAAC,CAAC;gBACH,0BAA0B,CAAC,KAAK,EAAE,SAAS,QAAQ,EAAE,EAAE,WAAW,CAAC,CAAC;YACtE,CAAC;iBAAM,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACrB,4BAA4B;gBAC5B,MAAM,WAAW,GAAG,eAAe,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;gBAClD,KAAK,CAAC,OAAO,CAAC;oBACZ,MAAM,EAAE,WAAW;oBACnB,MAAM,EAAE,WAAW;oBACnB,IAAI,EAAE,YAAY;iBACnB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,+BAA+B;QAC/B,IAAI,KAAK,CAAC,SAAS,KAAK,UAAU,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;YACtD,MAAM,YAAY,GAAG,UAAU,KAAK,CAAC,SAAS,EAAE,CAAC;YACjD,IAAI,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE,CAAC;gBAChC,KAAK,CAAC,OAAO,CAAC;oBACZ,MAAM,EAAE,YAAY;oBACpB,MAAM,EAAE,WAAW;oBACnB,IAAI,EAAE,YAAY;iBACnB,CAAC,CAAC;gBACH,0BAA0B,CAAC,KAAK,EAAE,YAAY,EAAE,WAAW,CAAC,CAAC;YAC/D,CAAC;QACH,CAAC;QAED,2BAA2B;QAC3B,IAAI,KAAK,CAAC,SAAS,EAAE,CAAC;YACpB,MAAM,WAAW,GAAG,SAAS,KAAK,CAAC,IAAI,EAAE,CAAC;YAC1C,KAAK,CAAC,OAAO,CAAC;gBACZ,EAAE,EAAE,WAAW;gBACf,IAAI,EAAE,OAAO;gBACb,IAAI,EAAE,GAAG,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,SAAS,GAAG;gBAC1C,MAAM,EAAE,KAAK,CAAC,MAAM;gBACpB,QAAQ,EAAE,EAAE,SAAS,EAAE,KAAK,CAAC,SAAS,EAAE;aACzC,CAAC,CAAC;YACH,KAAK,CAAC,OAAO,CAAC;gBACZ,MAAM,EAAE,WAAW;gBACnB,MAAM,EAAE,WAAW;gBACnB,IAAI,EAAE,YAAY;aACnB,CAAC,CAAC;QACL,CAAC;QAED,mFAAmF;QACnF,yEAAyE;IAC3E,CAAC;IAED,kCAAkC;IAClC,cAAc,CAAC,KAAK,CAAC,CAAC;IAEtB,OAAO,KAAK,CAAC;AACf,CAAC;AAED,2DAA2D;AAC3D,SAAS,eAAe,CAAC,KAAmB,EAAE,YAAoB;IAChE,MAAM,SAAS,GAAG,kBAAkB,CAAC,YAAY,CAAC,CAAC;IACnD,MAAM,MAAM,GAAG,SAAS,SAAS,EAAE,CAAC;IACpC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QAC3B,KAAK,CAAC,OAAO,CAAC;YACZ,EAAE,EAAE,MAAM;YACV,IAAI,EAAE,cAAc;YACpB,IAAI,EAAE,SAAS;SAChB,CAAC,CAAC;IACL,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,SAAS,kBAAkB,CAAC,IAAY;IACtC,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAC5B,kGAAkG,CACnG,CAAC;IACF,IAAI,WAAW,EAAE,CAAC;QAChB,mDAAmD;QACnD,MAAM,IAAI,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,IAAI,CAAC;QAC/C,OAAO,QAAQ,CAAC,OAAO,CAAC,wBAAwB,EAAE,EAAE,CAAC,CAAC;IACxD,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,+EAA+E;AAC/E,SAAS,0BAA0B,CAAC,KAAmB,EAAE,QAAgB,EAAE,QAAgB;IACzF,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IAC3C,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IAE3C,IAAI,UAAU,EAAE,MAAM,IAAI,UAAU,EAAE,MAAM,IAAI,UAAU,CAAC,MAAM,KAAK,UAAU,CAAC,MAAM,EAAE,CAAC;QACxF,KAAK,CAAC,OAAO,CAAC;YACZ,MAAM,EAAE,QAAQ;YAChB,MAAM,EAAE,QAAQ;YAChB,IAAI,EAAE,gBAAgB;YACtB,YAAY,EAAE,UAAU,CAAC,MAAM;YAC/B,YAAY,EAAE,UAAU,CAAC,MAAM;SAChC,CAAC,CAAC;IACL,CAAC;AACH,CAAC;AAED,oEAAoE;AACpE,SAAS,cAAc,CAAC,KAAmB;IACzC,MAAM,OAAO,GAAG,KAAK,CAAC,UAAU,EAAE,CAAC;IAEnC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,MAAM,YAAY,GAAG,UAAU,MAAM,EAAE,CAAC;QACxC,KAAK,CAAC,OAAO,CAAC;YACZ,EAAE,EAAE,YAAY;YAChB,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,MAAM;YACZ,MAAM;SACP,CAAC,CAAC;IACL,CAAC;AACH,CAAC"}

package/dist/lineage/dependency-resolver.d.ts

@@ -0,0 +1,44 @@
+/**
+ * Dependency resolver for DQL blocks.
+ *
+ * Performs topological sorting of blocks based on ref() calls and
+ * SQL-extracted table dependencies. Detects circular dependencies.
+ */
+/** Minimal block info needed for dependency resolution */
+export interface BlockDependencyInfo {
+    /** Block name (unique identifier) */
+    name: string;
+    /** Raw SQL query for the block */
+    sql: string;
+    /** Domain the block belongs to */
+    domain?: string;
+    /** Materialized table/view name (defaults to block name) */
+    materializedAs?: string;
+}
+/** Result of dependency resolution */
+export interface DependencyResolutionResult {
+    /** Blocks in execution order (dependencies first) */
+    executionOrder: string[];
+    /** Map of block name → its direct dependencies */
+    dependencyMap: Map<string, string[]>;
+    /** Map of block name → blocks that depend on it */
+    dependentsMap: Map<string, string[]>;
+    /** Circular dependency chains detected (empty if none) */
+    cycles: string[][];
+}
+/**
+ * Resolve dependencies among a set of blocks and return execution order.
+ *
+ * Uses both explicit ref() calls and implicit SQL table references to
+ * build the dependency graph. Returns a topological sort or reports cycles.
+ */
+export declare function resolveDependencies(blocks: BlockDependencyInfo[]): DependencyResolutionResult;
+/**
+ * Get all upstream dependencies (transitive) for a given block.
+ */
+export declare function getUpstream(blockName: string, dependencyMap: Map<string, string[]>): string[];
+/**
+ * Get all downstream dependents (transitive) for a given block.
+ */
+export declare function getDownstream(blockName: string, dependentsMap: Map<string, string[]>): string[];
+//# sourceMappingURL=dependency-resolver.d.ts.map

package/dist/lineage/dependency-resolver.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency-resolver.d.ts","sourceRoot":"","sources":["../../src/lineage/dependency-resolver.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,0DAA0D;AAC1D,MAAM,WAAW,mBAAmB;IAClC,qCAAqC;IACrC,IAAI,EAAE,MAAM,CAAC;IACb,kCAAkC;IAClC,GAAG,EAAE,MAAM,CAAC;IACZ,kCAAkC;IAClC,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,4DAA4D;IAC5D,cAAc,CAAC,EAAE,MAAM,CAAC;CACzB;AAED,sCAAsC;AACtC,MAAM,WAAW,0BAA0B;IACzC,qDAAqD;IACrD,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB,kDAAkD;IAClD,aAAa,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IACrC,mDAAmD;IACnD,aAAa,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IACrC,0DAA0D;IAC1D,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC;CACpB;AAED;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,MAAM,EAAE,mBAAmB,EAAE,GAAG,0BAA0B,CAgG7F;AA8CD;;GAEG;AACH,wBAAgB,WAAW,CAAC,SAAS,EAAE,MAAM,EAAE,aAAa,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,CAgB7F;AAED;;GAEG;AACH,wBAAgB,aAAa,CAAC,SAAS,EAAE,MAAM,EAAE,aAAa,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,GAAG,MAAM,EAAE,CAgB/F"}

package/dist/lineage/dependency-resolver.js

@@ -0,0 +1,168 @@
+/**
+ * Dependency resolver for DQL blocks.
+ *
+ * Performs topological sorting of blocks based on ref() calls and
+ * SQL-extracted table dependencies. Detects circular dependencies.
+ */
+import { extractTablesFromSql } from './sql-parser.js';
+/**
+ * Resolve dependencies among a set of blocks and return execution order.
+ *
+ * Uses both explicit ref() calls and implicit SQL table references to
+ * build the dependency graph. Returns a topological sort or reports cycles.
+ */
+export function resolveDependencies(blocks) {
+    const blockNames = new Set(blocks.map((b) => b.name));
+    const materializedNames = new Map();
+    // Map materialized names back to block names
+    for (const block of blocks) {
+        const matName = block.materializedAs ?? block.name;
+        materializedNames.set(matName.toLowerCase(), block.name);
+    }
+    // Build dependency map
+    const dependencyMap = new Map();
+    const dependentsMap = new Map();
+    for (const block of blocks) {
+        dependencyMap.set(block.name, []);
+        dependentsMap.set(block.name, []);
+    }
+    for (const block of blocks) {
+        const parseResult = extractTablesFromSql(block.sql);
+        const deps = new Set();
+        // Explicit ref() calls → direct dependencies
+        for (const ref of parseResult.refs) {
+            if (blockNames.has(ref)) {
+                deps.add(ref);
+            }
+        }
+        // Implicit SQL table references → check if they match a block name
+        for (const table of parseResult.tables) {
+            const resolved = materializedNames.get(table.toLowerCase());
+            if (resolved && resolved !== block.name) {
+                deps.add(resolved);
+            }
+        }
+        const depArray = [...deps];
+        dependencyMap.set(block.name, depArray);
+        // Build reverse map
+        for (const dep of depArray) {
+            const existing = dependentsMap.get(dep) ?? [];
+            existing.push(block.name);
+            dependentsMap.set(dep, existing);
+        }
+    }
+    // Topological sort (Kahn's algorithm): inDeg[node] = number of unresolved deps
+    const inDeg = new Map();
+    for (const block of blocks) {
+        const deps = dependencyMap.get(block.name) ?? [];
+        inDeg.set(block.name, deps.length);
+    }
+    const queue = [];
+    for (const [name, deg] of inDeg) {
+        if (deg === 0)
+            queue.push(name);
+    }
+    const executionOrder = [];
+    while (queue.length > 0) {
+        // Sort queue for deterministic output
+        queue.sort();
+        const current = queue.shift();
+        executionOrder.push(current);
+        // For each block that depends on current, reduce its in-degree
+        const dependents = dependentsMap.get(current) ?? [];
+        for (const dep of dependents) {
+            const newDeg = (inDeg.get(dep) ?? 1) - 1;
+            inDeg.set(dep, newDeg);
+            if (newDeg === 0) {
+                queue.push(dep);
+            }
+        }
+    }
+    // Detect cycles — any block not in executionOrder is part of a cycle
+    const cycles = [];
+    if (executionOrder.length < blocks.length) {
+        const inOrder = new Set(executionOrder);
+        const remaining = blocks.filter((b) => !inOrder.has(b.name)).map((b) => b.name);
+        // Find cycles via DFS
+        const visited = new Set();
+        for (const start of remaining) {
+            if (visited.has(start))
+                continue;
+            const cycle = findCycle(start, dependencyMap, visited);
+            if (cycle.length > 0) {
+                cycles.push(cycle);
+            }
+        }
+    }
+    return { executionOrder, dependencyMap, dependentsMap, cycles };
+}
+/** DFS cycle finder starting from a given node */
+function findCycle(start, dependencyMap, globalVisited) {
+    const path = [];
+    const pathSet = new Set();
+    const stack = [{ node: start, depIdx: 0 }];
+    pathSet.add(start);
+    path.push(start);
+    globalVisited.add(start);
+    while (stack.length > 0) {
+        const top = stack[stack.length - 1];
+        const deps = dependencyMap.get(top.node) ?? [];
+        if (top.depIdx >= deps.length) {
+            stack.pop();
+            path.pop();
+            pathSet.delete(top.node);
+            continue;
+        }
+        const nextDep = deps[top.depIdx];
+        top.depIdx++;
+        if (pathSet.has(nextDep)) {
+            // Found cycle — extract from nextDep's position to end of path
+            const cycleStart = path.indexOf(nextDep);
+            return [...path.slice(cycleStart), nextDep];
+        }
+        if (!globalVisited.has(nextDep)) {
+            globalVisited.add(nextDep);
+            path.push(nextDep);
+            pathSet.add(nextDep);
+            stack.push({ node: nextDep, depIdx: 0 });
+        }
+    }
+    return [];
+}
+/**
+ * Get all upstream dependencies (transitive) for a given block.
+ */
+export function getUpstream(blockName, dependencyMap) {
+    const visited = new Set();
+    const queue = [blockName];
+    while (queue.length > 0) {
+        const current = queue.shift();
+        const deps = dependencyMap.get(current) ?? [];
+        for (const dep of deps) {
+            if (!visited.has(dep)) {
+                visited.add(dep);
+                queue.push(dep);
+            }
+        }
+    }
+    return [...visited];
+}
+/**
+ * Get all downstream dependents (transitive) for a given block.
+ */
+export function getDownstream(blockName, dependentsMap) {
+    const visited = new Set();
+    const queue = [blockName];
+    while (queue.length > 0) {
+        const current = queue.shift();
+        const deps = dependentsMap.get(current) ?? [];
+        for (const dep of deps) {
+            if (!visited.has(dep)) {
+                visited.add(dep);
+                queue.push(dep);
+            }
+        }
+    }
+    return [...visited];
+}
+//# sourceMappingURL=dependency-resolver.js.map

package/dist/lineage/dependency-resolver.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency-resolver.js","sourceRoot":"","sources":["../../src/lineage/dependency-resolver.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,oBAAoB,EAAE,MAAM,iBAAiB,CAAC;AA0BvD;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CAAC,MAA6B;IAC/D,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACtD,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEpD,6CAA6C;IAC7C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,OAAO,GAAG,KAAK,CAAC,cAAc,IAAI,KAAK,CAAC,IAAI,CAAC;QACnD,iBAAiB,CAAC,GAAG,CAAC,OAAO,CAAC,WAAW,EAAE,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;IAC3D,CAAC;IAED,uBAAuB;IACvB,MAAM,aAAa,GAAG,IAAI,GAAG,EAAoB,CAAC;IAClD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAoB,CAAC;IAElD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAClC,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IACpC,CAAC;IAED,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,WAAW,GAAG,oBAAoB,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACpD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAE/B,6CAA6C;QAC7C,KAAK,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,EAAE,CAAC;YACnC,IAAI,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACxB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;QAED,mEAAmE;QACnE,KAAK,MAAM,KAAK,IAAI,WAAW,CAAC,MAAM,EAAE,CAAC;YACvC,MAAM,QAAQ,GAAG,iBAAiB,CAAC,GAAG,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC;YAC5D,IAAI,QAAQ,IAAI,QAAQ,KAAK,KAAK,CAAC,IAAI,EAAE,CAAC;gBACxC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;QAED,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;QAC3B,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QAExC,oBAAoB;QACpB,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;YAC9C,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC1B,aAAa,CAAC,GAAG,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;QACnC,CAAC;IACH,CAAC;IAED,+EAA+E;IAC/E,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QACjD,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IACrC,CAAC;IAED,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC;QAChC,IAAI,GAAG,KAAK,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IAED,MAAM,cAAc,GAAa,EAAE,CAAC;IACpC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,sCAAsC;QACtC,KAAK,CAAC,IAAI,EAAE,CAAC;QACb,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC/B,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAE7B,+DAA+D;QAC/D,MAAM,UAAU,GAAG,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;QACpD,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;YAC7B,MAAM,MAAM,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACzC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;YACvB,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;gBACjB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAClB,CAAC;QACH,CAAC;IACH,CAAC;IAED,qEAAqE;IACrE,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,IAAI,cAAc,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;QAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,cAAc,CAAC,CAAC;QACxC,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAChF,sBAAsB;QACtB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;YAC9B,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;gBAAE,SAAS;YACjC,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,EAAE,aAAa,EAAE,OAAO,CAAC,CAAC;YACvD,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACrB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,cAAc,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,EAAE,CAAC;AAClE,CAAC;AAED,kDAAkD;AAClD,SAAS,SAAS,CAChB,KAAa,EACb,aAAoC,EACpC,aAA0B;IAE1B,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAA4C,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;IACpF,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACnB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACjB,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAEzB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACpC,MAAM,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QAE/C,IAAI,GAAG,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAC9B,KAAK,CAAC,GAAG,EAAE,CAAC;YACZ,IAAI,CAAC,GAAG,EAAE,CAAC;YACX,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACzB,SAAS;QACX,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACjC,GAAG,CAAC,MAAM,EAAE,CAAC;QAEb,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;YACzB,+DAA+D;YAC/D,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YACzC,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,OAAO,CAAC,CAAC;QAC9C,CAAC;QAED,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;YAChC,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAC3B,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACnB,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACrB,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;IAED,OAAO,EAAE,CAAC;AACZ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,SAAiB,EAAE,aAAoC;IACjF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAG,CAAC,SAAS,CAAC,CAAC;IAE1B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC/B,MAAM,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;QAC9C,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACtB,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACjB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAClB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;AACtB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,SAAiB,EAAE,aAAoC;IACnF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAG,CAAC,SAAS,CAAC,CAAC;IAE1B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC/B,MAAM,IAAI,GAAG,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;QAC9C,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACtB,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACjB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAClB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;AACtB,CAAC"}