@duckcodeailabs/dql-core 0.3.1 → 0.6.0

package/dist/lineage/domain-lineage.d.ts

@@ -0,0 +1,96 @@
+/**
+ * Domain-specific lineage analysis — DQL's key differentiator.
+ *
+ * Tracks how data flows across business domains, creating "trust chains"
+ * where certified blocks serve as trust checkpoints. Enables impact analysis
+ * across domain boundaries.
+ */
+import type { LineageGraph, LineageEdge } from './lineage-graph.js';
+export interface TrustChainNode {
+    nodeId: string;
+    name: string;
+    domain?: string;
+    status?: string;
+    owner?: string;
+    /** Whether this node is a trust checkpoint (certified block) */
+    isTrustCheckpoint: boolean;
+}
+export interface TrustChain {
+    /** Ordered nodes from source to target */
+    nodes: TrustChainNode[];
+    /** Number of certified checkpoints in the chain */
+    certifiedCount: number;
+    /** Number of uncertified nodes (trust gaps) */
+    uncertifiedCount: number;
+    /** Trust score: certified / total (0.0 to 1.0) */
+    trustScore: number;
+    /** Domain boundaries crossed */
+    domainCrossings: Array<{
+        from: string;
+        to: string;
+    }>;
+}
+export interface DomainImpact {
+    /** Domain name */
+    domain: string;
+    /** Nodes in this domain that are affected */
+    affectedNodes: Array<{
+        id: string;
+        name: string;
+        status?: string;
+    }>;
+    /** Number of certified blocks affected */
+    certifiedBlocksAffected: number;
+}
+export interface ImpactAnalysis {
+    /** The source node being analyzed */
+    sourceNode: string;
+    /** Total downstream nodes affected */
+    totalAffected: number;
+    /** Breakdown by domain */
+    domainImpacts: DomainImpact[];
+    /** Cross-domain edges in the impact path */
+    domainCrossings: Array<{
+        from: string;
+        to: string;
+        edgeCount: number;
+    }>;
+}
+export interface DomainFlow {
+    /** Source domain */
+    from: string;
+    /** Target domain */
+    to: string;
+    /** Edges connecting these domains */
+    edges: LineageEdge[];
+    /** Nodes at the boundary (source side) */
+    sourceNodes: string[];
+    /** Nodes at the boundary (target side) */
+    targetNodes: string[];
+}
+/**
+ * Build a trust chain from a source node to a target node.
+ * Shows certification status at every step.
+ */
+export declare function buildTrustChain(graph: LineageGraph, fromId: string, toId: string): TrustChain | null;
+/**
+ * Analyze the impact of changing a node — which domains and blocks are affected downstream.
+ */
+export declare function analyzeImpact(graph: LineageGraph, nodeId: string): ImpactAnalysis;
+/**
+ * Detect all cross-domain data flows in the graph.
+ */
+export declare function detectDomainFlows(graph: LineageGraph): DomainFlow[];
+/**
+ * Get a trust overview for all blocks in a domain.
+ */
+export declare function getDomainTrustOverview(graph: LineageGraph, domain: string): {
+    totalBlocks: number;
+    certified: number;
+    draft: number;
+    review: number;
+    deprecated: number;
+    pendingRecertification: number;
+    trustScore: number;
+};
+//# sourceMappingURL=domain-lineage.d.ts.map

package/dist/lineage/domain-lineage.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"domain-lineage.d.ts","sourceRoot":"","sources":["../../src/lineage/domain-lineage.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAe,WAAW,EAAE,MAAM,oBAAoB,CAAC;AAIjF,MAAM,WAAW,cAAc;IAC7B,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,gEAAgE;IAChE,iBAAiB,EAAE,OAAO,CAAC;CAC5B;AAED,MAAM,WAAW,UAAU;IACzB,0CAA0C;IAC1C,KAAK,EAAE,cAAc,EAAE,CAAC;IACxB,mDAAmD;IACnD,cAAc,EAAE,MAAM,CAAC;IACvB,+CAA+C;IAC/C,gBAAgB,EAAE,MAAM,CAAC;IACzB,kDAAkD;IAClD,UAAU,EAAE,MAAM,CAAC;IACnB,gCAAgC;IAChC,eAAe,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CACtD;AAID,MAAM,WAAW,YAAY;IAC3B,kBAAkB;IAClB,MAAM,EAAE,MAAM,CAAC;IACf,6CAA6C;IAC7C,aAAa,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,MAAM,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IACpE,0CAA0C;IAC1C,uBAAuB,EAAE,MAAM,CAAC;CACjC;AAED,MAAM,WAAW,cAAc;IAC7B,qCAAqC;IACrC,UAAU,EAAE,MAAM,CAAC;IACnB,sCAAsC;IACtC,aAAa,EAAE,MAAM,CAAC;IACtB,0BAA0B;IAC1B,aAAa,EAAE,YAAY,EAAE,CAAC;IAC9B,4CAA4C;IAC5C,eAAe,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,EAAE,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CACzE;AAID,MAAM,WAAW,UAAU;IACzB,oBAAoB;IACpB,IAAI,EAAE,MAAM,CAAC;IACb,oBAAoB;IACpB,EAAE,EAAE,MAAM,CAAC;IACX,qCAAqC;IACrC,KAAK,EAAE,WAAW,EAAE,CAAC;IACrB,0CAA0C;IAC1C,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,0CAA0C;IAC1C,WAAW,EAAE,MAAM,EAAE,CAAC;CACvB;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,YAAY,EACnB,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,MAAM,GACX,UAAU,GAAG,IAAI,CAuCnB;AAED;;GAEG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,YAAY,EAAE,MAAM,EAAE,MAAM,GAAG,cAAc,CA6CjF;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,YAAY,GAAG,UAAU,EAAE,CAyBnE;AAED;;GAEG;AACH,wBAAgB,sBAAsB,CACpC,KAAK,EAAE,YAAY,EACnB,MAAM,EAAE,MAAM,GACb;IACD,WAAW,EAAE,MAAM,CAAC;IACpB,SAAS,EAAE,MAAM,CAAC;IAClB,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,CAAC;IACnB,sBAAsB,EAAE,MAAM,CAAC;IAC/B,UAAU,EAAE,MAAM,CAAC;CACpB,CAmBA"}

package/dist/lineage/domain-lineage.js

@@ -0,0 +1,140 @@
+/**
+ * Domain-specific lineage analysis — DQL's key differentiator.
+ *
+ * Tracks how data flows across business domains, creating "trust chains"
+ * where certified blocks serve as trust checkpoints. Enables impact analysis
+ * across domain boundaries.
+ */
+/**
+ * Build a trust chain from a source node to a target node.
+ * Shows certification status at every step.
+ */
+export function buildTrustChain(graph, fromId, toId) {
+    const path = graph.pathBetween(fromId, toId);
+    if (path.length === 0)
+        return null;
+    const nodes = [];
+    const domainCrossings = [];
+    let prevDomain;
+    for (const nodeId of path) {
+        const node = graph.getNode(nodeId);
+        if (!node)
+            continue;
+        const isTrustCheckpoint = node.status === 'certified';
+        nodes.push({
+            nodeId: node.id,
+            name: node.name,
+            domain: node.domain,
+            status: node.status,
+            owner: node.owner,
+            isTrustCheckpoint,
+        });
+        if (prevDomain && node.domain && prevDomain !== node.domain) {
+            domainCrossings.push({ from: prevDomain, to: node.domain });
+        }
+        if (node.domain)
+            prevDomain = node.domain;
+    }
+    const certifiedCount = nodes.filter((n) => n.isTrustCheckpoint).length;
+    const total = nodes.length;
+    return {
+        nodes,
+        certifiedCount,
+        uncertifiedCount: total - certifiedCount,
+        trustScore: total > 0 ? certifiedCount / total : 0,
+        domainCrossings,
+    };
+}
+/**
+ * Analyze the impact of changing a node — which domains and blocks are affected downstream.
+ */
+export function analyzeImpact(graph, nodeId) {
+    const descendants = graph.descendants(nodeId);
+    // Group by domain
+    const byDomain = new Map();
+    for (const node of descendants) {
+        const domain = node.domain ?? '(unassigned)';
+        const list = byDomain.get(domain) ?? [];
+        list.push(node);
+        byDomain.set(domain, list);
+    }
+    const domainImpacts = [];
+    for (const [domain, nodes] of byDomain) {
+        domainImpacts.push({
+            domain,
+            affectedNodes: nodes.map((n) => ({ id: n.id, name: n.name, status: n.status })),
+            certifiedBlocksAffected: nodes.filter((n) => n.status === 'certified').length,
+        });
+    }
+    // Find domain crossings in the impact zone
+    const descendantIds = new Set(descendants.map((n) => n.id));
+    descendantIds.add(nodeId);
+    const crossingMap = new Map();
+    const crossingEdges = [];
+    for (const edge of graph.getCrossDomainEdges()) {
+        if (descendantIds.has(edge.source) && descendantIds.has(edge.target)) {
+            const key = `${edge.sourceDomain}→${edge.targetDomain}`;
+            crossingMap.set(key, (crossingMap.get(key) ?? 0) + 1);
+        }
+    }
+    for (const [key, count] of crossingMap) {
+        const [from, to] = key.split('→');
+        crossingEdges.push({ from, to, edgeCount: count });
+    }
+    return {
+        sourceNode: nodeId,
+        totalAffected: descendants.length,
+        domainImpacts,
+        domainCrossings: crossingEdges,
+    };
+}
+/**
+ * Detect all cross-domain data flows in the graph.
+ */
+export function detectDomainFlows(graph) {
+    const flowMap = new Map();
+    for (const edge of graph.getCrossDomainEdges()) {
+        if (!edge.sourceDomain || !edge.targetDomain)
+            continue;
+        const key = `${edge.sourceDomain}→${edge.targetDomain}`;
+        let flow = flowMap.get(key);
+        if (!flow) {
+            flow = {
+                from: edge.sourceDomain,
+                to: edge.targetDomain,
+                edges: [],
+                sourceNodes: [],
+                targetNodes: [],
+            };
+            flowMap.set(key, flow);
+        }
+        flow.edges.push(edge);
+        if (!flow.sourceNodes.includes(edge.source))
+            flow.sourceNodes.push(edge.source);
+        if (!flow.targetNodes.includes(edge.target))
+            flow.targetNodes.push(edge.target);
+    }
+    return [...flowMap.values()];
+}
+/**
+ * Get a trust overview for all blocks in a domain.
+ */
+export function getDomainTrustOverview(graph, domain) {
+    const nodes = graph.getNodesByDomain(domain).filter((n) => n.type === 'block');
+    const total = nodes.length;
+    const certified = nodes.filter((n) => n.status === 'certified').length;
+    const draft = nodes.filter((n) => n.status === 'draft').length;
+    const review = nodes.filter((n) => n.status === 'review').length;
+    const deprecated = nodes.filter((n) => n.status === 'deprecated').length;
+    const pendingRecertification = nodes.filter((n) => n.status === 'pending_recertification').length;
+    return {
+        totalBlocks: total,
+        certified,
+        draft,
+        review,
+        deprecated,
+        pendingRecertification,
+        trustScore: total > 0 ? certified / total : 0,
+    };
+}
+//# sourceMappingURL=domain-lineage.js.map

package/dist/lineage/domain-lineage.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"domain-lineage.js","sourceRoot":"","sources":["../../src/lineage/domain-lineage.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAkEH;;;GAGG;AACH,MAAM,UAAU,eAAe,CAC7B,KAAmB,EACnB,MAAc,EACd,IAAY;IAEZ,MAAM,IAAI,GAAG,KAAK,CAAC,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAC7C,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEnC,MAAM,KAAK,GAAqB,EAAE,CAAC;IACnC,MAAM,eAAe,GAAwC,EAAE,CAAC;IAEhE,IAAI,UAA8B,CAAC;IAEnC,KAAK,MAAM,MAAM,IAAI,IAAI,EAAE,CAAC;QAC1B,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACnC,IAAI,CAAC,IAAI;YAAE,SAAS;QAEpB,MAAM,iBAAiB,GAAG,IAAI,CAAC,MAAM,KAAK,WAAW,CAAC;QACtD,KAAK,CAAC,IAAI,CAAC;YACT,MAAM,EAAE,IAAI,CAAC,EAAE;YACf,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,iBAAiB;SAClB,CAAC,CAAC;QAEH,IAAI,UAAU,IAAI,IAAI,CAAC,MAAM,IAAI,UAAU,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;YAC5D,eAAe,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QAC9D,CAAC;QACD,IAAI,IAAI,CAAC,MAAM;YAAE,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC;IAC5C,CAAC;IAED,MAAM,cAAc,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,MAAM,CAAC;IACvE,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC;IAE3B,OAAO;QACL,KAAK;QACL,cAAc;QACd,gBAAgB,EAAE,KAAK,GAAG,cAAc;QACxC,UAAU,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,cAAc,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QAClD,eAAe;KAChB,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,KAAmB,EAAE,MAAc;IAC/D,MAAM,WAAW,GAAG,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;IAE9C,kBAAkB;IAClB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAyB,CAAC;IAClD,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,cAAc,CAAC;QAC7C,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QACxC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChB,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAC7B,CAAC;IAED,MAAM,aAAa,GAAmB,EAAE,CAAC;IACzC,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,QAAQ,EAAE,CAAC;QACvC,aAAa,CAAC,IAAI,CAAC;YACjB,MAAM;YACN,aAAa,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC;YAC/E,uBAAuB,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC,MAAM;SAC9E,CAAC,CAAC;IACL,CAAC;IAED,2CAA2C;IAC3C,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5D,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAC1B,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC9C,MAAM,aAAa,GAA2D,EAAE,CAAC;IAEjF,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,mBAAmB,EAAE,EAAE,CAAC;QAC/C,IAAI,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YACrE,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YACxD,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IAED,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,WAAW,EAAE,CAAC;QACvC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAClC,aAAa,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC;IACrD,CAAC;IAED,OAAO;QACL,UAAU,EAAE,MAAM;QAClB,aAAa,EAAE,WAAW,CAAC,MAAM;QACjC,aAAa;QACb,eAAe,EAAE,aAAa;KAC/B,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAmB;IACnD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAsB,CAAC;IAE9C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,mBAAmB,EAAE,EAAE,CAAC;QAC/C,IAAI,CAAC,IAAI,CAAC,YAAY,IAAI,CAAC,IAAI,CAAC,YAAY;YAAE,SAAS;QACvD,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;QAExD,IAAI,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC5B,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,IAAI,GAAG;gBACL,IAAI,EAAE,IAAI,CAAC,YAAY;gBACvB,EAAE,EAAE,IAAI,CAAC,YAAY;gBACrB,KAAK,EAAE,EAAE;gBACT,WAAW,EAAE,EAAE;gBACf,WAAW,EAAE,EAAE;aAChB,CAAC;YACF,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACzB,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC;YAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAChF,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC;YAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAClF,CAAC;IAED,OAAO,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;AAC/B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,sBAAsB,CACpC,KAAmB,EACnB,MAAc;IAUd,MAAM,KAAK,GAAG,KAAK,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC;IAC/E,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC;IAE3B,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC,MAAM,CAAC;IACvE,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,OAAO,CAAC,CAAC,MAAM,CAAC;IAC/D,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC,MAAM,CAAC;IACjE,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,YAAY,CAAC,CAAC,MAAM,CAAC;IACzE,MAAM,sBAAsB,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,yBAAyB,CAAC,CAAC,MAAM,CAAC;IAElG,OAAO;QACL,WAAW,EAAE,KAAK;QAClB,SAAS;QACT,KAAK;QACL,MAAM;QACN,UAAU;QACV,sBAAsB;QACtB,UAAU,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;KAC9C,CAAC;AACJ,CAAC"}

package/dist/lineage/index.d.ts

@@ -0,0 +1,6 @@
+export { extractTablesFromSql, type SqlParseResult, } from './sql-parser.js';
+export { resolveDependencies, getUpstream, getDownstream, type BlockDependencyInfo, type DependencyResolutionResult, } from './dependency-resolver.js';
+export { LineageGraph, type LineageNode, type LineageEdge, type LineageNodeType, type LineageEdgeType, type LineageGraphJSON, } from './lineage-graph.js';
+export { buildLineageGraph, type LineageBlockInput, type LineageMetricInput, type LineageDimensionInput, type LineageBuilderOptions, } from './builder.js';
+export { buildTrustChain, analyzeImpact, detectDomainFlows, getDomainTrustOverview, type TrustChain, type TrustChainNode, type ImpactAnalysis, type DomainImpact, type DomainFlow, } from './domain-lineage.js';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/lineage/index.ts"],"names":[],"mappings":"AAEA,OAAO,EACL,oBAAoB,EACpB,KAAK,cAAc,GACpB,MAAM,iBAAiB,CAAC;AAEzB,OAAO,EACL,mBAAmB,EACnB,WAAW,EACX,aAAa,EACb,KAAK,mBAAmB,EACxB,KAAK,0BAA0B,GAChC,MAAM,0BAA0B,CAAC;AAElC,OAAO,EACL,YAAY,EACZ,KAAK,WAAW,EAChB,KAAK,WAAW,EAChB,KAAK,eAAe,EACpB,KAAK,eAAe,EACpB,KAAK,gBAAgB,GACtB,MAAM,oBAAoB,CAAC;AAE5B,OAAO,EACL,iBAAiB,EACjB,KAAK,iBAAiB,EACtB,KAAK,kBAAkB,EACvB,KAAK,qBAAqB,EAC1B,KAAK,qBAAqB,GAC3B,MAAM,cAAc,CAAC;AAEtB,OAAO,EACL,eAAe,EACf,aAAa,EACb,iBAAiB,EACjB,sBAAsB,EACtB,KAAK,UAAU,EACf,KAAK,cAAc,EACnB,KAAK,cAAc,EACnB,KAAK,YAAY,EACjB,KAAK,UAAU,GAChB,MAAM,qBAAqB,CAAC"}

package/dist/lineage/index.js

@@ -0,0 +1,7 @@
+// Lineage analysis — SQL parsing, dependency resolution, graph building, and domain lineage
+export { extractTablesFromSql, } from './sql-parser.js';
+export { resolveDependencies, getUpstream, getDownstream, } from './dependency-resolver.js';
+export { LineageGraph, } from './lineage-graph.js';
+export { buildLineageGraph, } from './builder.js';
+export { buildTrustChain, analyzeImpact, detectDomainFlows, getDomainTrustOverview, } from './domain-lineage.js';
+//# sourceMappingURL=index.js.map

package/dist/lineage/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/lineage/index.ts"],"names":[],"mappings":"AAAA,4FAA4F;AAE5F,OAAO,EACL,oBAAoB,GAErB,MAAM,iBAAiB,CAAC;AAEzB,OAAO,EACL,mBAAmB,EACnB,WAAW,EACX,aAAa,GAGd,MAAM,0BAA0B,CAAC;AAElC,OAAO,EACL,YAAY,GAMb,MAAM,oBAAoB,CAAC;AAE5B,OAAO,EACL,iBAAiB,GAKlB,MAAM,cAAc,CAAC;AAEtB,OAAO,EACL,eAAe,EACf,aAAa,EACb,iBAAiB,EACjB,sBAAsB,GAMvB,MAAM,qBAAqB,CAAC"}

package/dist/lineage/lineage-graph.d.ts

@@ -0,0 +1,97 @@
+/**
+ * Multi-granularity lineage graph for DQL's answer layer.
+ *
+ * Tracks data flow from source tables through blocks, semantic metrics,
+ * domains, and charts — the full "trust chain" from raw data to rendered answer.
+ */
+export type LineageNodeType = 'source_table' | 'block' | 'metric' | 'dimension' | 'domain' | 'chart';
+export interface LineageNode {
+    /** Unique identifier (e.g., "block:revenue_by_segment", "metric:total_revenue") */
+    id: string;
+    type: LineageNodeType;
+    name: string;
+    /** Business domain this node belongs to */
+    domain?: string;
+    /** Certification status (for blocks) */
+    status?: 'draft' | 'review' | 'certified' | 'deprecated' | 'pending_recertification';
+    /** Owner of the block/metric */
+    owner?: string;
+    /** Additional metadata */
+    metadata?: Record<string, unknown>;
+}
+export type LineageEdgeType = 'reads_from' | 'feeds_into' | 'aggregates' | 'visualizes' | 'crosses_domain' | 'certified_by';
+export interface LineageEdge {
+    source: string;
+    target: string;
+    type: LineageEdgeType;
+    /** For crosses_domain: source and target domain names */
+    sourceDomain?: string;
+    targetDomain?: string;
+    /** Additional metadata */
+    metadata?: Record<string, unknown>;
+}
+export interface LineageGraphJSON {
+    nodes: LineageNode[];
+    edges: LineageEdge[];
+}
+export declare class LineageGraph {
+    private nodes;
+    private edges;
+    /** Outgoing edges: source → edges */
+    private outgoing;
+    /** Incoming edges: target → edges */
+    private incoming;
+    /** Add a node to the graph. Updates if already exists. */
+    addNode(node: LineageNode): void;
+    /** Add an edge to the graph. Deduplicates by source+target+type. */
+    addEdge(edge: LineageEdge): void;
+    /** Get a node by ID. */
+    getNode(id: string): LineageNode | undefined;
+    /** Get all nodes. */
+    getAllNodes(): LineageNode[];
+    /** Get all edges. */
+    getAllEdges(): LineageEdge[];
+    /** Get nodes by type. */
+    getNodesByType(type: LineageNodeType): LineageNode[];
+    /** Get nodes by domain. */
+    getNodesByDomain(domain: string): LineageNode[];
+    /** Get all unique domains in the graph. */
+    getDomains(): string[];
+    /** Get outgoing edges from a node. */
+    getOutgoingEdges(nodeId: string): LineageEdge[];
+    /** Get incoming edges to a node. */
+    getIncomingEdges(nodeId: string): LineageEdge[];
+    /**
+     * Get all ancestors (upstream) of a node via BFS.
+     * Follows incoming edges backwards.
+     */
+    ancestors(nodeId: string): LineageNode[];
+    /**
+     * Get all descendants (downstream) of a node via BFS.
+     * Follows outgoing edges forward.
+     */
+    descendants(nodeId: string): LineageNode[];
+    /**
+     * Find the shortest path between two nodes (BFS).
+     * Returns node IDs in order, or empty array if no path exists.
+     */
+    pathBetween(fromId: string, toId: string): string[];
+    /**
+     * Extract a subgraph containing only nodes matching a filter and
+     * edges between those nodes.
+     */
+    subgraph(filter: (node: LineageNode) => boolean): LineageGraph;
+    /**
+     * Get edges that cross domain boundaries.
+     */
+    getCrossDomainEdges(): LineageEdge[];
+    /** Serialize the graph to JSON. */
+    toJSON(): LineageGraphJSON;
+    /** Deserialize a graph from JSON. */
+    static fromJSON(json: LineageGraphJSON): LineageGraph;
+    /** Number of nodes in the graph. */
+    get nodeCount(): number;
+    /** Number of edges in the graph. */
+    get edgeCount(): number;
+}
+//# sourceMappingURL=lineage-graph.d.ts.map

package/dist/lineage/lineage-graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lineage-graph.d.ts","sourceRoot":"","sources":["../../src/lineage/lineage-graph.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,MAAM,MAAM,eAAe,GACvB,cAAc,GACd,OAAO,GACP,QAAQ,GACR,WAAW,GACX,QAAQ,GACR,OAAO,CAAC;AAEZ,MAAM,WAAW,WAAW;IAC1B,mFAAmF;IACnF,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,eAAe,CAAC;IACtB,IAAI,EAAE,MAAM,CAAC;IACb,2CAA2C;IAC3C,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,wCAAwC;IACxC,MAAM,CAAC,EAAE,OAAO,GAAG,QAAQ,GAAG,WAAW,GAAG,YAAY,GAAG,yBAAyB,CAAC;IACrF,gCAAgC;IAChC,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,0BAA0B;IAC1B,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACpC;AAID,MAAM,MAAM,eAAe,GACvB,YAAY,GACZ,YAAY,GACZ,YAAY,GACZ,YAAY,GACZ,gBAAgB,GAChB,cAAc,CAAC;AAEnB,MAAM,WAAW,WAAW;IAC1B,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,eAAe,CAAC;IACtB,yDAAyD;IACzD,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,0BAA0B;IAC1B,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACpC;AAID,MAAM,WAAW,gBAAgB;IAC/B,KAAK,EAAE,WAAW,EAAE,CAAC;IACrB,KAAK,EAAE,WAAW,EAAE,CAAC;CACtB;AAED,qBAAa,YAAY;IACvB,OAAO,CAAC,KAAK,CAAkC;IAC/C,OAAO,CAAC,KAAK,CAAqB;IAClC,qCAAqC;IACrC,OAAO,CAAC,QAAQ,CAAoC;IACpD,qCAAqC;IACrC,OAAO,CAAC,QAAQ,CAAoC;IAEpD,0DAA0D;IAC1D,OAAO,CAAC,IAAI,EAAE,WAAW,GAAG,IAAI;IAMhC,oEAAoE;IACpE,OAAO,CAAC,IAAI,EAAE,WAAW,GAAG,IAAI;IAiBhC,wBAAwB;IACxB,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,WAAW,GAAG,SAAS;IAI5C,qBAAqB;IACrB,WAAW,IAAI,WAAW,EAAE;IAI5B,qBAAqB;IACrB,WAAW,IAAI,WAAW,EAAE;IAI5B,yBAAyB;IACzB,cAAc,CAAC,IAAI,EAAE,eAAe,GAAG,WAAW,EAAE;IAIpD,2BAA2B;IAC3B,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,WAAW,EAAE;IAI/C,2CAA2C;IAC3C,UAAU,IAAI,MAAM,EAAE;IAQtB,sCAAsC;IACtC,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,WAAW,EAAE;IAI/C,oCAAoC;IACpC,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,WAAW,EAAE;IAI/C;;;OAGG;IACH,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,WAAW,EAAE;IAiBxC;;;OAGG;IACH,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,WAAW,EAAE;IAiB1C;;;OAGG;IACH,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE;IAgCnD;;;OAGG;IACH,QAAQ,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,WAAW,KAAK,OAAO,GAAG,YAAY;IAoB9D;;OAEG;IACH,mBAAmB,IAAI,WAAW,EAAE;IAIpC,mCAAmC;IACnC,MAAM,IAAI,gBAAgB;IAO1B,qCAAqC;IACrC,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,gBAAgB,GAAG,YAAY;IAWrD,oCAAoC;IACpC,IAAI,SAAS,IAAI,MAAM,CAEtB;IAED,oCAAoC;IACpC,IAAI,SAAS,IAAI,MAAM,CAEtB;CACF"}

package/dist/lineage/lineage-graph.js

@@ -0,0 +1,198 @@
+/**
+ * Multi-granularity lineage graph for DQL's answer layer.
+ *
+ * Tracks data flow from source tables through blocks, semantic metrics,
+ * domains, and charts — the full "trust chain" from raw data to rendered answer.
+ */
+export class LineageGraph {
+    nodes = new Map();
+    edges = [];
+    /** Outgoing edges: source → edges */
+    outgoing = new Map();
+    /** Incoming edges: target → edges */
+    incoming = new Map();
+    /** Add a node to the graph. Updates if already exists. */
+    addNode(node) {
+        this.nodes.set(node.id, node);
+        if (!this.outgoing.has(node.id))
+            this.outgoing.set(node.id, []);
+        if (!this.incoming.has(node.id))
+            this.incoming.set(node.id, []);
+    }
+    /** Add an edge to the graph. Deduplicates by source+target+type. */
+    addEdge(edge) {
+        // Deduplicate: skip if an identical edge (same source, target, type) exists
+        const existing = this.outgoing.get(edge.source);
+        if (existing?.some((e) => e.target === edge.target && e.type === edge.type)) {
+            return;
+        }
+        this.edges.push(edge);
+        // Ensure adjacency lists exist even if nodes weren't added explicitly
+        if (!this.outgoing.has(edge.source))
+            this.outgoing.set(edge.source, []);
+        if (!this.incoming.has(edge.target))
+            this.incoming.set(edge.target, []);
+        this.outgoing.get(edge.source).push(edge);
+        this.incoming.get(edge.target).push(edge);
+    }
+    /** Get a node by ID. */
+    getNode(id) {
+        return this.nodes.get(id);
+    }
+    /** Get all nodes. */
+    getAllNodes() {
+        return [...this.nodes.values()];
+    }
+    /** Get all edges. */
+    getAllEdges() {
+        return [...this.edges];
+    }
+    /** Get nodes by type. */
+    getNodesByType(type) {
+        return [...this.nodes.values()].filter((n) => n.type === type);
+    }
+    /** Get nodes by domain. */
+    getNodesByDomain(domain) {
+        return [...this.nodes.values()].filter((n) => n.domain === domain);
+    }
+    /** Get all unique domains in the graph. */
+    getDomains() {
+        const domains = new Set();
+        for (const node of this.nodes.values()) {
+            if (node.domain)
+                domains.add(node.domain);
+        }
+        return [...domains];
+    }
+    /** Get outgoing edges from a node. */
+    getOutgoingEdges(nodeId) {
+        return this.outgoing.get(nodeId) ?? [];
+    }
+    /** Get incoming edges to a node. */
+    getIncomingEdges(nodeId) {
+        return this.incoming.get(nodeId) ?? [];
+    }
+    /**
+     * Get all ancestors (upstream) of a node via BFS.
+     * Follows incoming edges backwards.
+     */
+    ancestors(nodeId) {
+        const visited = new Set();
+        const queue = [nodeId];
+        while (queue.length > 0) {
+            const current = queue.shift();
+            for (const edge of this.incoming.get(current) ?? []) {
+                if (!visited.has(edge.source)) {
+                    visited.add(edge.source);
+                    queue.push(edge.source);
+                }
+            }
+        }
+        return [...visited].map((id) => this.nodes.get(id)).filter(Boolean);
+    }
+    /**
+     * Get all descendants (downstream) of a node via BFS.
+     * Follows outgoing edges forward.
+     */
+    descendants(nodeId) {
+        const visited = new Set();
+        const queue = [nodeId];
+        while (queue.length > 0) {
+            const current = queue.shift();
+            for (const edge of this.outgoing.get(current) ?? []) {
+                if (!visited.has(edge.target)) {
+                    visited.add(edge.target);
+                    queue.push(edge.target);
+                }
+            }
+        }
+        return [...visited].map((id) => this.nodes.get(id)).filter(Boolean);
+    }
+    /**
+     * Find the shortest path between two nodes (BFS).
+     * Returns node IDs in order, or empty array if no path exists.
+     */
+    pathBetween(fromId, toId) {
+        if (fromId === toId)
+            return [fromId];
+        if (!this.nodes.has(fromId) || !this.nodes.has(toId))
+            return [];
+        const visited = new Set([fromId]);
+        const parent = new Map();
+        const queue = [fromId];
+        while (queue.length > 0) {
+            const current = queue.shift();
+            for (const edge of this.outgoing.get(current) ?? []) {
+                if (!visited.has(edge.target)) {
+                    visited.add(edge.target);
+                    parent.set(edge.target, current);
+                    if (edge.target === toId) {
+                        // Reconstruct path
+                        const path = [toId];
+                        let node = toId;
+                        while (parent.has(node)) {
+                            node = parent.get(node);
+                            path.unshift(node);
+                        }
+                        return path;
+                    }
+                    queue.push(edge.target);
+                }
+            }
+        }
+        return []; // No path found
+    }
+    /**
+     * Extract a subgraph containing only nodes matching a filter and
+     * edges between those nodes.
+     */
+    subgraph(filter) {
+        const sub = new LineageGraph();
+        const included = new Set();
+        for (const node of this.nodes.values()) {
+            if (filter(node)) {
+                sub.addNode(node);
+                included.add(node.id);
+            }
+        }
+        for (const edge of this.edges) {
+            if (included.has(edge.source) && included.has(edge.target)) {
+                sub.addEdge(edge);
+            }
+        }
+        return sub;
+    }
+    /**
+     * Get edges that cross domain boundaries.
+     */
+    getCrossDomainEdges() {
+        return this.edges.filter((e) => e.type === 'crosses_domain');
+    }
+    /** Serialize the graph to JSON. */
+    toJSON() {
+        return {
+            nodes: [...this.nodes.values()],
+            edges: [...this.edges],
+        };
+    }
+    /** Deserialize a graph from JSON. */
+    static fromJSON(json) {
+        const graph = new LineageGraph();
+        for (const node of json.nodes) {
+            graph.addNode(node);
+        }
+        for (const edge of json.edges) {
+            graph.addEdge(edge);
+        }
+        return graph;
+    }
+    /** Number of nodes in the graph. */
+    get nodeCount() {
+        return this.nodes.size;
+    }
+    /** Number of edges in the graph. */
+    get edgeCount() {
+        return this.edges.length;
+    }
+}
+//# sourceMappingURL=lineage-graph.js.map

package/dist/lineage/lineage-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lineage-graph.js","sourceRoot":"","sources":["../../src/lineage/lineage-graph.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAuDH,MAAM,OAAO,YAAY;IACf,KAAK,GAAG,IAAI,GAAG,EAAuB,CAAC;IACvC,KAAK,GAAkB,EAAE,CAAC;IAClC,qCAAqC;IAC7B,QAAQ,GAAG,IAAI,GAAG,EAAyB,CAAC;IACpD,qCAAqC;IAC7B,QAAQ,GAAG,IAAI,GAAG,EAAyB,CAAC;IAEpD,0DAA0D;IAC1D,OAAO,CAAC,IAAiB;QACvB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC9B,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAChE,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAClE,CAAC;IAED,oEAAoE;IACpE,OAAO,CAAC,IAAiB;QACvB,4EAA4E;QAC5E,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAChD,IAAI,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5E,OAAO;QACT,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEtB,sEAAsE;QACtE,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC;YAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QACxE,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC;YAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QAExE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3C,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7C,CAAC;IAED,wBAAwB;IACxB,OAAO,CAAC,EAAU;QAChB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED,qBAAqB;IACrB,WAAW;QACT,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IAClC,CAAC;IAED,qBAAqB;IACrB,WAAW;QACT,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;IACzB,CAAC;IAED,yBAAyB;IACzB,cAAc,CAAC,IAAqB;QAClC,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;IACjE,CAAC;IAED,2BAA2B;IAC3B,gBAAgB,CAAC,MAAc;QAC7B,OAAO,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;IACrE,CAAC;IAED,2CAA2C;IAC3C,UAAU;QACR,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,IAAI,IAAI,CAAC,MAAM;gBAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC5C,CAAC;QACD,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;IACtB,CAAC;IAED,sCAAsC;IACtC,gBAAgB,CAAC,MAAc;QAC7B,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;IACzC,CAAC;IAED,oCAAoC;IACpC,gBAAgB,CAAC,MAAc;QAC7B,OAAO,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;IACzC,CAAC;IAED;;;OAGG;IACH,SAAS,CAAC,MAAc;QACtB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAG,CAAC,MAAM,CAAC,CAAC;QAEvB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC/B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;gBACpD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC9B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBACzB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC1B,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACvE,CAAC;IAED;;;OAGG;IACH,WAAW,CAAC,MAAc;QACxB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAG,CAAC,MAAM,CAAC,CAAC;QAEvB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC/B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;gBACpD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC9B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBACzB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC1B,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACvE,CAAC;IAED;;;OAGG;IACH,WAAW,CAAC,MAAc,EAAE,IAAY;QACtC,IAAI,MAAM,KAAK,IAAI;YAAE,OAAO,CAAC,MAAM,CAAC,CAAC;QACrC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,OAAO,EAAE,CAAC;QAEhE,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,MAAM,CAAC,CAAC,CAAC;QAC1C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,MAAM,KAAK,GAAG,CAAC,MAAM,CAAC,CAAC;QAEvB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAC/B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;gBACpD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC9B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBACzB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;oBACjC,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,EAAE,CAAC;wBACzB,mBAAmB;wBACnB,MAAM,IAAI,GAAa,CAAC,IAAI,CAAC,CAAC;wBAC9B,IAAI,IAAI,GAAG,IAAI,CAAC;wBAChB,OAAO,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;4BACxB,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;4BACzB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;wBACrB,CAAC;wBACD,OAAO,IAAI,CAAC;oBACd,CAAC;oBACD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC1B,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,EAAE,CAAC,CAAC,gBAAgB;IAC7B,CAAC;IAED;;;OAGG;IACH,QAAQ,CAAC,MAAsC;QAC7C,MAAM,GAAG,GAAG,IAAI,YAAY,EAAE,CAAC;QAC/B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;QAEnC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,IAAI,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;gBACjB,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAClB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC3D,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;QAED,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;OAEG;IACH,mBAAmB;QACjB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,gBAAgB,CAAC,CAAC;IAC/D,CAAC;IAED,mCAAmC;IACnC,MAAM;QACJ,OAAO;YACL,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YAC/B,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;SACvB,CAAC;IACJ,CAAC;IAED,qCAAqC;IACrC,MAAM,CAAC,QAAQ,CAAC,IAAsB;QACpC,MAAM,KAAK,GAAG,IAAI,YAAY,EAAE,CAAC;QACjC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACtB,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACtB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,oCAAoC;IACpC,IAAI,SAAS;QACX,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED,oCAAoC;IACpC,IAAI,SAAS;QACX,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC3B,CAAC;CACF"}

package/dist/lineage/sql-parser.d.ts

@@ -0,0 +1,23 @@
+/**
+ * Lightweight SQL table extractor for lineage analysis.
+ *
+ * Extracts table references from SQL statements without a full AST parser.
+ * Handles FROM, JOIN, subqueries, and CTEs. Filters out CTE names so only
+ * external table dependencies are returned.
+ */
+export interface SqlParseResult {
+    /** External table dependencies (CTEs excluded) */
+    tables: string[];
+    /** CTE names defined in this query */
+    ctes: string[];
+    /** ref() calls found in the SQL */
+    refs: string[];
+}
+/**
+ * Extract table references from a SQL string.
+ *
+ * Identifies tables in FROM and JOIN clauses, filters out CTE definitions,
+ * and detects ref("block_name") calls.
+ */
+export declare function extractTablesFromSql(sql: string): SqlParseResult;
+//# sourceMappingURL=sql-parser.d.ts.map

package/dist/lineage/sql-parser.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sql-parser.d.ts","sourceRoot":"","sources":["../../src/lineage/sql-parser.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,MAAM,WAAW,cAAc;IAC7B,kDAAkD;IAClD,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,sCAAsC;IACtC,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,mCAAmC;IACnC,IAAI,EAAE,MAAM,EAAE,CAAC;CAChB;AAED;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAAC,GAAG,EAAE,MAAM,GAAG,cAAc,CAmDhE"}