@api-client/core 0.11.11 → 0.12.1

package/build/src/modeling/DomainSerialization.js

@@ -0,0 +1,288 @@
+import { Graph } from '@api-client/graph';
+import { DomainAssociationKind, DomainEntityKind, DomainModelKind, DomainNamespaceKind, DomainPropertyKind, } from '../models/kinds.js';
+import { DomainNamespace } from './DomainNamespace.js';
+import { DomainModel } from './DomainModel.js';
+import { DomainEntity } from './DomainEntity.js';
+import { DomainProperty } from './DomainProperty.js';
+import { DomainAssociation } from './DomainAssociation.js';
+function writeNodes(g, domainKey) {
+    const result = [];
+    for (const v of g.nodes()) {
+        const nodeValue = g.node(v);
+        if (!nodeValue || nodeValue.domain.key !== domainKey) {
+            // Filter out foreign nodes
+            continue;
+        }
+        // We do only use single parent for the graph. Potentially this could be
+        // replaced with the `g.parent(v)` method.
+        const parents = [...g.parents(v)];
+        const node = { v };
+        node.value = nodeValue.toJSON();
+        if (parents.length) {
+            node.parents = parents;
+        }
+        result.push(node);
+    }
+    return result;
+}
+function writeEdges(g, domainKey) {
+    const result = [];
+    for (const e of g.edges()) {
+        const edgeValue = g.edge(e);
+        if (!edgeValue) {
+            continue;
+        }
+        const sourceNode = g.node(e.v);
+        const targetNode = g.node(e.w);
+        if (!sourceNode || !targetNode) {
+            continue;
+        }
+        if (sourceNode.domain.key !== domainKey) {
+            // Filter out edges starting from foreign nodes. These are foreign associations
+            // that have nothing to do with the current domain.
+            continue;
+        }
+        if (targetNode.domain.key !== domainKey && edgeValue.type !== 'association' && edgeValue.type !== 'parent') {
+            // Filter out edges to foreign nodes except for associations and parent-child relations
+            continue;
+        }
+        const edge = { v: e.v, w: e.w };
+        if (e.name) {
+            edge.name = e.name;
+        }
+        edge.value = structuredClone(edgeValue);
+        result.push(edge);
+    }
+    return result;
+}
+export function serialize(g, domainKey) {
+    const json = {
+        options: {
+            directed: g.isDirected(),
+            multigraph: g.isMultigraph(),
+            compound: g.isCompound(),
+        },
+        nodes: writeNodes(g, domainKey),
+        edges: writeEdges(g, domainKey),
+    };
+    return json;
+}
+/**
+ * Removes all foreign nodes, edges, and parents from the graph.
+ * @param g The graph to remove the foreign nodes from
+ * @param domainKey The key of the domain to remove
+ */
+export function removeForeignGraph(g, domainKey) {
+    for (const node of g.nodes()) {
+        const nodeValue = g.node(node);
+        if (!nodeValue) {
+            continue;
+        }
+        if (nodeValue.domain.key === domainKey) {
+            // This is a foreign node, remove it from the graph.
+            g.removeNode(node);
+            // When a node is removed, all edges and parents are removed as well.
+            // No need to iterate over them.
+        }
+    }
+}
+/**
+ * Merges a foreign domain graph into the current domain graph.
+ * @param own Our domain graph
+ * @param foreign The foreign domain graph
+ * @param domain The key of the foreign domain
+ */
+export function mergeGraph(own, foreign, domain) {
+    const nodes = new Set();
+    const edges = new Set();
+    // Copy nodes
+    for (const node of foreign.nodes()) {
+        const foreignNode = foreign.node(node);
+        if (!foreignNode) {
+            continue;
+        }
+        const foreignKey = `${domain}:${node}`;
+        own.setNode(foreignKey, foreignNode);
+        nodes.add(foreignKey);
+    }
+    // Copy edges
+    for (const edge of foreign.edges()) {
+        const label = foreign.edge(edge);
+        if (!label) {
+            continue;
+        }
+        const foreignSource = `${domain}:${edge.v}`;
+        const foreignTarget = `${domain}:${edge.w}`;
+        // const foreignEdge = foreign.edge(edge)
+        own.setEdge(foreignSource, foreignTarget, {
+            foreign: true,
+            domain,
+            ...label,
+        });
+        edges.add(`${foreignSource}|${foreignTarget}`);
+    }
+    const notRootEntities = new Set();
+    // Copy parent-child relationships
+    for (const node of foreign.nodes()) {
+        const foreignNodeKey = `${domain}:${node}`;
+        for (const parent of foreign.parents(node)) {
+            const foreignParentKey = `${domain}:${parent}`;
+            const srcNode = own.node(foreignNodeKey);
+            const targetNode = own.node(foreignParentKey);
+            if (srcNode.kind === DomainEntityKind && targetNode.kind === DomainEntityKind) {
+                // entities can have multiple parents between them. We need to respect that.
+                if (!notRootEntities.has(foreignNodeKey)) {
+                    // We use `setParent` in the first run to remove the entity from the root
+                    // of the graph.
+                    notRootEntities.add(foreignNodeKey);
+                    own.setParent(foreignNodeKey, foreignParentKey);
+                }
+                else {
+                    own.addParent(foreignNodeKey, foreignParentKey);
+                }
+            }
+            else {
+                // other nodes can only have a single parent.
+                own.setParent(foreignNodeKey, foreignParentKey);
+            }
+        }
+    }
+    return {
+        nodes,
+        edges,
+    };
+}
+/**
+ * Properties and associations are stored as nodes with edges to the parent entity in the graph.
+ * At the time of restoring these nodes, the graph has no edges yet.
+ * This function finds the parent of the child node in the edges list.
+ * @param child The DomainProperty or DomainAssociation key
+ * @param edges The list of serialized graph edges
+ * @returns The parent key of the child or undefined if not found
+ */
+function findEdgeParent(child, edges) {
+    for (const edge of edges) {
+        if (edge.w === child) {
+            return edge.v;
+        }
+    }
+    return undefined;
+}
+/**
+ * Restores the previously serialized node entry.
+ * @param root The DataDomain instance to use as the root for the graph
+ * @param entry The node entry to restore
+ * @param edges The list of serialized graph edges
+ * @returns The restored node instance
+ * @throws Error if the entry is malformed or the kind is unknown
+ */
+function prepareNode(root, entry, edges) {
+    if (!entry) {
+        throw new Error(`Unable to restore data domain graph. Malformed node entry`);
+    }
+    const domainElement = entry;
+    if (!domainElement.kind) {
+        throw new Error(`Unable to restore data domain graph. Malformed node entry`);
+    }
+    if (domainElement.kind === DomainNamespaceKind) {
+        return new DomainNamespace(root, domainElement);
+    }
+    if (domainElement.kind === DomainModelKind) {
+        return new DomainModel(root, domainElement);
+    }
+    if (domainElement.kind === DomainEntityKind) {
+        return new DomainEntity(root, domainElement);
+    }
+    if (domainElement.kind === DomainPropertyKind) {
+        const typed = domainElement;
+        const parent = findEdgeParent(typed.key, edges);
+        if (!parent) {
+            throw new Error(`Unable to restore data domain graph. Malformed node entry`);
+        }
+        return new DomainProperty(root, parent, typed);
+    }
+    if (domainElement.kind === DomainAssociationKind) {
+        const typed = domainElement;
+        const parent = findEdgeParent(typed.key, edges);
+        if (!parent) {
+            throw new Error(`Unable to restore data domain graph. Malformed node entry`);
+        }
+        return new DomainAssociation(root, parent, typed);
+    }
+    throw new Error(`Unable to restore data domain graph. Unknown node kind ${domainElement.kind}`);
+}
+/**
+ * To deserialize a graph:
+ *
+ * - Create a new DataDomain instance
+ * - Restore all foreign nodes and edges
+ * - Call the deserialize function
+ *
+ * @param root The DataDomain instance to use as the root for the graph
+ * @param json The previously serialized graph
+ * @returns Deserialized graph instance
+ */
+export function deserialize(root, json, dependencies) {
+    const g = new Graph({
+        compound: true,
+        multigraph: true,
+        directed: true,
+    });
+    let foreignNodes = new Set();
+    let foreignEdges = new Set();
+    if (dependencies) {
+        for (const dependency of dependencies) {
+            const result = mergeGraph(g, dependency.graph, dependency.key);
+            if (result.edges.size) {
+                foreignEdges = new Set([...foreignEdges, ...result.edges]);
+            }
+            if (result.nodes.size) {
+                foreignNodes = new Set([...foreignNodes, ...result.nodes]);
+            }
+            root.dependencies.set(dependency.key, dependency);
+        }
+    }
+    if (!json) {
+        return g;
+    }
+    if (Array.isArray(json.nodes)) {
+        for (const entry of json.nodes) {
+            g.setNode(entry.v, prepareNode(root, entry.value, json.edges));
+            if (entry.parents) {
+                for (const parent of entry.parents) {
+                    // In data domain graph, all nodes that can have parents can only have a single parent.
+                    // It's the business logic of the library.
+                    // Parent-child relationships:
+                    // - Namespace -> Namespace
+                    // - Namespace -> Model
+                    // - Model -> Entity
+                    // Entities and Association are associated with the parent entity through edges.
+                    g.setParent(entry.v, parent);
+                }
+            }
+        }
+    }
+    if (Array.isArray(json.edges)) {
+        for (const entry of json.edges) {
+            if (!entry.value) {
+                throw new Error(`Unable to restore data domain graph. Malformed edge entry`);
+            }
+            if (entry.value.foreign) {
+                // The `v` has to be local to the graph. The `w` must be foreign.
+                if (!foreignNodes.has(entry.w)) {
+                    // console.warn(`Missing foreign node: ${entry.w}. Skipping edge.`)
+                    continue;
+                }
+            }
+            if (foreignNodes.has(entry.v) || foreignNodes.has(entry.w)) {
+                if (!g.hasNode(entry.v) || !g.hasNode(entry.w)) {
+                    // console.warn(`Missing foreign node: ${entry.v} or ${entry.w}. Skipping edge.`)
+                    continue;
+                }
+            }
+            g.setEdge({ v: entry.v, w: entry.w, name: entry.name }, entry.value);
+        }
+    }
+    return g;
+}
+//# sourceMappingURL=DomainSerialization.js.map

package/build/src/modeling/DomainSerialization.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DomainSerialization.js","sourceRoot":"","sources":["../../../src/modeling/DomainSerialization.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAkB,MAAM,mBAAmB,CAAA;AAEzD,OAAO,EACL,qBAAqB,EACrB,gBAAgB,EAChB,eAAe,EACf,mBAAmB,EACnB,kBAAkB,GACnB,MAAM,oBAAoB,CAAA;AAC3B,OAAO,EAAE,eAAe,EAA8B,MAAM,sBAAsB,CAAA;AAElF,OAAO,EAAE,WAAW,EAA0B,MAAM,kBAAkB,CAAA;AACtE,OAAO,EAAE,YAAY,EAAsB,MAAM,mBAAmB,CAAA;AACpE,OAAO,EAAE,cAAc,EAAwB,MAAM,qBAAqB,CAAA;AAC1E,OAAO,EAAE,iBAAiB,EAA2B,MAAM,wBAAwB,CAAA;AAanF,SAAS,UAAU,CAAC,CAAkB,EAAE,SAAiB;IACvD,MAAM,MAAM,GAAmB,EAAE,CAAA;IACjC,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC;QAC1B,MAAM,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC3B,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC,MAAM,CAAC,GAAG,KAAK,SAAS,EAAE,CAAC;YACrD,2BAA2B;YAC3B,SAAQ;QACV,CAAC;QACD,wEAAwE;QACxE,0CAA0C;QAC1C,MAAM,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;QACjC,MAAM,IAAI,GAAiB,EAAE,CAAC,EAAE,CAAA;QAChC,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC,MAAM,EAAE,CAAA;QAC/B,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;YACnB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;QACxB,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACnB,CAAC;IACD,OAAO,MAAM,CAAA;AACf,CAAC;AAED,SAAS,UAAU,CAAC,CAAkB,EAAE,SAAiB;IACvD,MAAM,MAAM,GAAgC,EAAE,CAAA;IAC9C,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC;QAC1B,MAAM,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC3B,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,SAAQ;QACV,CAAC;QACD,MAAM,UAAU,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAC9B,MAAM,UAAU,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAC9B,IAAI,CAAC,UAAU,IAAI,CAAC,UAAU,EAAE,CAAC;YAC/B,SAAQ;QACV,CAAC;QACD,IAAI,UAAU,CAAC,MAAM,CAAC,GAAG,KAAK,SAAS,EAAE,CAAC;YACxC,+EAA+E;YAC/E,mDAAmD;YACnD,SAAQ;QACV,CAAC;QACD,IAAI,UAAU,CAAC,MAAM,CAAC,GAAG,KAAK,SAAS,IAAI,SAAS,CAAC,IAAI,KAAK,aAAa,IAAI,SAAS,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC3G,uFAAuF;YACvF,SAAQ;QACV,CAAC;QACD,MAAM,IAAI,GAA8B,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAA;QAC1D,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;YACX,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAA;QACpB,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,eAAe,CAAC,SAAS,CAAC,CAAA;QACvC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACnB,CAAC;IACD,OAAO,MAAM,CAAA;AACf,CAAC;AAED,MAAM,UAAU,SAAS,CAAC,CAAkB,EAAE,SAAiB;IAC7D,MAAM,IAAI,GAAoB;QAC5B,OAAO,EAAE;YACP,QAAQ,EAAE,CAAC,CAAC,UAAU,EAAE;YACxB,UAAU,EAAE,CAAC,CAAC,YAAY,EAAE;YAC5B,QAAQ,EAAE,CAAC,CAAC,UAAU,EAAE;SACzB;QACD,KAAK,EAAE,UAAU,CAAC,CAAC,EAAE,SAAS,CAAC;QAC/B,KAAK,EAAE,UAAU,CAAC,CAAC,EAAE,SAAS,CAAC;KAChC,CAAA;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,kBAAkB,CAAC,CAAkB,EAAE,SAAiB;IACtE,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC;QAC7B,MAAM,SAAS,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAC9B,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,SAAQ;QACV,CAAC;QACD,IAAI,SAAS,CAAC,MAAM,CAAC,GAAG,KAAK,SAAS,EAAE,CAAC;YACvC,oDAAoD;YACpD,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAA;YAClB,qEAAqE;YACrE,gCAAgC;QAClC,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,UAAU,CAAC,GAAoB,EAAE,OAAwB,EAAE,MAAc;IACvF,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAA;IAC/B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAA;IAC/B,aAAa;IACb,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC;QACnC,MAAM,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QACtC,IAAI,CAAC,WAAW,EAAE,CAAC;YACjB,SAAQ;QACV,CAAC;QACD,MAAM,UAAU,GAAG,GAAG,MAAM,IAAI,IAAI,EAAE,CAAA;QACtC,GAAG,CAAC,OAAO,CAAC,UAAU,EAAE,WAAW,CAAC,CAAA;QACpC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAA;IACvB,CAAC;IACD,aAAa;IACb,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC;QACnC,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAChC,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,SAAQ;QACV,CAAC;QACD,MAAM,aAAa,GAAG,GAAG,MAAM,IAAI,IAAI,CAAC,CAAC,EAAE,CAAA;QAC3C,MAAM,aAAa,GAAG,GAAG,MAAM,IAAI,IAAI,CAAC,CAAC,EAAE,CAAA;QAC3C,yCAAyC;QACzC,GAAG,CAAC,OAAO,CAAC,aAAa,EAAE,aAAa,EAAE;YACxC,OAAO,EAAE,IAAI;YACb,MAAM;YACN,GAAG,KAAK;SACT,CAAC,CAAA;QACF,KAAK,CAAC,GAAG,CAAC,GAAG,aAAa,IAAI,aAAa,EAAE,CAAC,CAAA;IAChD,CAAC;IACD,MAAM,eAAe,GAAG,IAAI,GAAG,EAAU,CAAA;IACzC,kCAAkC;IAClC,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC;QACnC,MAAM,cAAc,GAAG,GAAG,MAAM,IAAI,IAAI,EAAE,CAAA;QAC1C,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YAC3C,MAAM,gBAAgB,GAAG,GAAG,MAAM,IAAI,MAAM,EAAE,CAAA;YAC9C,MAAM,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,cAAc,CAAwB,CAAA;YAC/D,MAAM,UAAU,GAAG,GAAG,CAAC,IAAI,CAAC,gBAAgB,CAAwB,CAAA;YACpE,IAAI,OAAO,CAAC,IAAI,KAAK,gBAAgB,IAAI,UAAU,CAAC,IAAI,KAAK,gBAAgB,EAAE,CAAC;gBAC9E,4EAA4E;gBAC5E,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,cAAc,CAAC,EAAE,CAAC;oBACzC,yEAAyE;oBACzE,gBAAgB;oBAChB,eAAe,CAAC,GAAG,CAAC,cAAc,CAAC,CAAA;oBACnC,GAAG,CAAC,SAAS,CAAC,cAAc,EAAE,gBAAgB,CAAC,CAAA;gBACjD,CAAC;qBAAM,CAAC;oBACN,GAAG,CAAC,SAAS,CAAC,cAAc,EAAE,gBAAgB,CAAC,CAAA;gBACjD,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,6CAA6C;gBAC7C,GAAG,CAAC,SAAS,CAAC,cAAc,EAAE,gBAAgB,CAAC,CAAA;YACjD,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO;QACL,KAAK;QACL,KAAK;KACN,CAAA;AACH,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,cAAc,CAAC,KAAa,EAAE,KAAkC;IACvE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,CAAC,KAAK,KAAK,EAAE,CAAC;YACrB,OAAO,IAAI,CAAC,CAAC,CAAA;QACf,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAA;AAClB,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,WAAW,CAAC,IAAgB,EAAE,KAAc,EAAE,KAAkC;IACvF,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,MAAM,IAAI,KAAK,CAAC,2DAA2D,CAAC,CAAA;IAC9E,CAAC;IACD,MAAM,aAAa,GAAG,KAA0B,CAAA;IAChD,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC;QACxB,MAAM,IAAI,KAAK,CAAC,2DAA2D,CAAC,CAAA;IAC9E,CAAC;IACD,IAAI,aAAa,CAAC,IAAI,KAAK,mBAAmB,EAAE,CAAC;QAC/C,OAAO,IAAI,eAAe,CAAC,IAAI,EAAE,aAAsC,CAAC,CAAA;IAC1E,CAAC;IACD,IAAI,aAAa,CAAC,IAAI,KAAK,eAAe,EAAE,CAAC;QAC3C,OAAO,IAAI,WAAW,CAAC,IAAI,EAAE,aAAkC,CAAC,CAAA;IAClE,CAAC;IACD,IAAI,aAAa,CAAC,IAAI,KAAK,gBAAgB,EAAE,CAAC;QAC5C,OAAO,IAAI,YAAY,CAAC,IAAI,EAAE,aAAmC,CAAC,CAAA;IACpE,CAAC;IACD,IAAI,aAAa,CAAC,IAAI,KAAK,kBAAkB,EAAE,CAAC;QAC9C,MAAM,KAAK,GAAG,aAAqC,CAAA;QACnD,MAAM,MAAM,GAAG,cAAc,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;QAC/C,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,IAAI,KAAK,CAAC,2DAA2D,CAAC,CAAA;QAC9E,CAAC;QACD,OAAO,IAAI,cAAc,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,CAAA;IAChD,CAAC;IACD,IAAI,aAAa,CAAC,IAAI,KAAK,qBAAqB,EAAE,CAAC;QACjD,MAAM,KAAK,GAAG,aAAwC,CAAA;QACtD,MAAM,MAAM,GAAG,cAAc,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;QAC/C,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,IAAI,KAAK,CAAC,2DAA2D,CAAC,CAAA;QAC9E,CAAC;QACD,OAAO,IAAI,iBAAiB,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,CAAA;IACnD,CAAC;IACD,MAAM,IAAI,KAAK,CAAC,0DAA0D,aAAa,CAAC,IAAI,EAAE,CAAC,CAAA;AACjG,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,WAAW,CAAC,IAAgB,EAAE,IAAsB,EAAE,YAA2B;IAC/F,MAAM,CAAC,GAAG,IAAI,KAAK,CAAgD;QACjE,QAAQ,EAAE,IAAI;QACd,UAAU,EAAE,IAAI;QAChB,QAAQ,EAAE,IAAI;KACf,CAAC,CAAA;IACF,IAAI,YAAY,GAAG,IAAI,GAAG,EAAU,CAAA;IACpC,IAAI,YAAY,GAAG,IAAI,GAAG,EAAU,CAAA;IACpC,IAAI,YAAY,EAAE,CAAC;QACjB,KAAK,MAAM,UAAU,IAAI,YAAY,EAAE,CAAC;YACtC,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,EAAE,UAAU,CAAC,KAAK,EAAE,UAAU,CAAC,GAAG,CAAC,CAAA;YAC9D,IAAI,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;gBACtB,YAAY,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,YAAY,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAA;YAC5D,CAAC;YACD,IAAI,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;gBACtB,YAAY,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,YAAY,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAA;YAC5D,CAAC;YACD,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,EAAE,UAAU,CAAC,CAAA;QACnD,CAAC;IACH,CAAC;IACD,IAAI,CAAC,IAAI,EAAE,CAAC;QACV,OAAO,CAAC,CAAA;IACV,CAAC;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QAC9B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC/B,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAA;YAC9D,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;gBAClB,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;oBACnC,uFAAuF;oBACvF,0CAA0C;oBAC1C,8BAA8B;oBAC9B,2BAA2B;oBAC3B,uBAAuB;oBACvB,oBAAoB;oBACpB,gFAAgF;oBAChF,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAA;gBAC9B,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QAC9B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC/B,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;gBACjB,MAAM,IAAI,KAAK,CAAC,2DAA2D,CAAC,CAAA;YAC9E,CAAC;YACD,IAAI,KAAK,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;gBACxB,iEAAiE;gBACjE,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC/B,mEAAmE;oBACnE,SAAQ;gBACV,CAAC;YACH,CAAC;YACD,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC3D,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC/C,iFAAiF;oBACjF,SAAQ;gBACV,CAAC;YACH,CAAC;YACD,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,EAAE,KAAK,CAAC,KAAK,CAAC,CAAA;QACtE,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAA;AACV,CAAC","sourcesContent":["import { Graph, JsonEdge, Node } from '@api-client/graph'\nimport type { DataDomainGraph, DomainGraphEdge, DomainGraphNodeType, SerializedGraph } from './types.js'\nimport {\n  DomainAssociationKind,\n  DomainEntityKind,\n  DomainModelKind,\n  DomainNamespaceKind,\n  DomainPropertyKind,\n} from '../models/kinds.js'\nimport { DomainNamespace, type DomainNamespaceSchema } from './DomainNamespace.js'\nimport type { DataDomain } from './DataDomain.js'\nimport { DomainModel, type DomainModelSchema } from './DomainModel.js'\nimport { DomainEntity, DomainEntitySchema } from './DomainEntity.js'\nimport { DomainProperty, DomainPropertySchema } from './DomainProperty.js'\nimport { DomainAssociation, DomainAssociationSchema } from './DomainAssociation.js'\n\ninterface GraphMergeResult {\n  /**\n   * The set of node ids generated for the foreign nodes.\n   */\n  nodes: Set<string>\n  /**\n   * The set of edge ids generated for the foreign edges.\n   */\n  edges: Set<string>\n}\n\nfunction writeNodes(g: DataDomainGraph, domainKey: string): Node<object>[] {\n  const result: Node<object>[] = []\n  for (const v of g.nodes()) {\n    const nodeValue = g.node(v)\n    if (!nodeValue || nodeValue.domain.key !== domainKey) {\n      // Filter out foreign nodes\n      continue\n    }\n    // We do only use single parent for the graph. Potentially this could be\n    // replaced with the `g.parent(v)` method.\n    const parents = [...g.parents(v)]\n    const node: Node<object> = { v }\n    node.value = nodeValue.toJSON()\n    if (parents.length) {\n      node.parents = parents\n    }\n    result.push(node)\n  }\n  return result\n}\n\nfunction writeEdges(g: DataDomainGraph, domainKey: string): JsonEdge<DomainGraphEdge>[] {\n  const result: JsonEdge<DomainGraphEdge>[] = []\n  for (const e of g.edges()) {\n    const edgeValue = g.edge(e)\n    if (!edgeValue) {\n      continue\n    }\n    const sourceNode = g.node(e.v)\n    const targetNode = g.node(e.w)\n    if (!sourceNode || !targetNode) {\n      continue\n    }\n    if (sourceNode.domain.key !== domainKey) {\n      // Filter out edges starting from foreign nodes. These are foreign associations\n      // that have nothing to do with the current domain.\n      continue\n    }\n    if (targetNode.domain.key !== domainKey && edgeValue.type !== 'association' && edgeValue.type !== 'parent') {\n      // Filter out edges to foreign nodes except for associations and parent-child relations\n      continue\n    }\n    const edge: JsonEdge<DomainGraphEdge> = { v: e.v, w: e.w }\n    if (e.name) {\n      edge.name = e.name\n    }\n    edge.value = structuredClone(edgeValue)\n    result.push(edge)\n  }\n  return result\n}\n\nexport function serialize(g: DataDomainGraph, domainKey: string): SerializedGraph {\n  const json: SerializedGraph = {\n    options: {\n      directed: g.isDirected(),\n      multigraph: g.isMultigraph(),\n      compound: g.isCompound(),\n    },\n    nodes: writeNodes(g, domainKey),\n    edges: writeEdges(g, domainKey),\n  }\n  return json\n}\n\n/**\n * Removes all foreign nodes, edges, and parents from the graph.\n * @param g The graph to remove the foreign nodes from\n * @param domainKey The key of the domain to remove\n */\nexport function removeForeignGraph(g: DataDomainGraph, domainKey: string): void {\n  for (const node of g.nodes()) {\n    const nodeValue = g.node(node)\n    if (!nodeValue) {\n      continue\n    }\n    if (nodeValue.domain.key === domainKey) {\n      // This is a foreign node, remove it from the graph.\n      g.removeNode(node)\n      // When a node is removed, all edges and parents are removed as well.\n      // No need to iterate over them.\n    }\n  }\n}\n\n/**\n * Merges a foreign domain graph into the current domain graph.\n * @param own Our domain graph\n * @param foreign The foreign domain graph\n * @param domain The key of the foreign domain\n */\nexport function mergeGraph(own: DataDomainGraph, foreign: DataDomainGraph, domain: string): GraphMergeResult {\n  const nodes = new Set<string>()\n  const edges = new Set<string>()\n  // Copy nodes\n  for (const node of foreign.nodes()) {\n    const foreignNode = foreign.node(node)\n    if (!foreignNode) {\n      continue\n    }\n    const foreignKey = `${domain}:${node}`\n    own.setNode(foreignKey, foreignNode)\n    nodes.add(foreignKey)\n  }\n  // Copy edges\n  for (const edge of foreign.edges()) {\n    const label = foreign.edge(edge)\n    if (!label) {\n      continue\n    }\n    const foreignSource = `${domain}:${edge.v}`\n    const foreignTarget = `${domain}:${edge.w}`\n    // const foreignEdge = foreign.edge(edge)\n    own.setEdge(foreignSource, foreignTarget, {\n      foreign: true,\n      domain,\n      ...label,\n    })\n    edges.add(`${foreignSource}|${foreignTarget}`)\n  }\n  const notRootEntities = new Set<string>()\n  // Copy parent-child relationships\n  for (const node of foreign.nodes()) {\n    const foreignNodeKey = `${domain}:${node}`\n    for (const parent of foreign.parents(node)) {\n      const foreignParentKey = `${domain}:${parent}`\n      const srcNode = own.node(foreignNodeKey) as DomainGraphNodeType\n      const targetNode = own.node(foreignParentKey) as DomainGraphNodeType\n      if (srcNode.kind === DomainEntityKind && targetNode.kind === DomainEntityKind) {\n        // entities can have multiple parents between them. We need to respect that.\n        if (!notRootEntities.has(foreignNodeKey)) {\n          // We use `setParent` in the first run to remove the entity from the root\n          // of the graph.\n          notRootEntities.add(foreignNodeKey)\n          own.setParent(foreignNodeKey, foreignParentKey)\n        } else {\n          own.addParent(foreignNodeKey, foreignParentKey)\n        }\n      } else {\n        // other nodes can only have a single parent.\n        own.setParent(foreignNodeKey, foreignParentKey)\n      }\n    }\n  }\n  return {\n    nodes,\n    edges,\n  }\n}\n\n/**\n * Properties and associations are stored as nodes with edges to the parent entity in the graph.\n * At the time of restoring these nodes, the graph has no edges yet.\n * This function finds the parent of the child node in the edges list.\n * @param child The DomainProperty or DomainAssociation key\n * @param edges The list of serialized graph edges\n * @returns The parent key of the child or undefined if not found\n */\nfunction findEdgeParent(child: string, edges: JsonEdge<DomainGraphEdge>[]): string | undefined {\n  for (const edge of edges) {\n    if (edge.w === child) {\n      return edge.v\n    }\n  }\n  return undefined\n}\n\n/**\n * Restores the previously serialized node entry.\n * @param root The DataDomain instance to use as the root for the graph\n * @param entry The node entry to restore\n * @param edges The list of serialized graph edges\n * @returns The restored node instance\n * @throws Error if the entry is malformed or the kind is unknown\n */\nfunction prepareNode(root: DataDomain, entry: unknown, edges: JsonEdge<DomainGraphEdge>[]): DomainGraphNodeType {\n  if (!entry) {\n    throw new Error(`Unable to restore data domain graph. Malformed node entry`)\n  }\n  const domainElement = entry as { kind?: string }\n  if (!domainElement.kind) {\n    throw new Error(`Unable to restore data domain graph. Malformed node entry`)\n  }\n  if (domainElement.kind === DomainNamespaceKind) {\n    return new DomainNamespace(root, domainElement as DomainNamespaceSchema)\n  }\n  if (domainElement.kind === DomainModelKind) {\n    return new DomainModel(root, domainElement as DomainModelSchema)\n  }\n  if (domainElement.kind === DomainEntityKind) {\n    return new DomainEntity(root, domainElement as DomainEntitySchema)\n  }\n  if (domainElement.kind === DomainPropertyKind) {\n    const typed = domainElement as DomainPropertySchema\n    const parent = findEdgeParent(typed.key, edges)\n    if (!parent) {\n      throw new Error(`Unable to restore data domain graph. Malformed node entry`)\n    }\n    return new DomainProperty(root, parent, typed)\n  }\n  if (domainElement.kind === DomainAssociationKind) {\n    const typed = domainElement as DomainAssociationSchema\n    const parent = findEdgeParent(typed.key, edges)\n    if (!parent) {\n      throw new Error(`Unable to restore data domain graph. Malformed node entry`)\n    }\n    return new DomainAssociation(root, parent, typed)\n  }\n  throw new Error(`Unable to restore data domain graph. Unknown node kind ${domainElement.kind}`)\n}\n\n/**\n * To deserialize a graph:\n *\n * - Create a new DataDomain instance\n * - Restore all foreign nodes and edges\n * - Call the deserialize function\n *\n * @param root The DataDomain instance to use as the root for the graph\n * @param json The previously serialized graph\n * @returns Deserialized graph instance\n */\nexport function deserialize(root: DataDomain, json?: SerializedGraph, dependencies?: DataDomain[]): DataDomainGraph {\n  const g = new Graph<unknown, DomainGraphNodeType, DomainGraphEdge>({\n    compound: true,\n    multigraph: true,\n    directed: true,\n  })\n  let foreignNodes = new Set<string>()\n  let foreignEdges = new Set<string>()\n  if (dependencies) {\n    for (const dependency of dependencies) {\n      const result = mergeGraph(g, dependency.graph, dependency.key)\n      if (result.edges.size) {\n        foreignEdges = new Set([...foreignEdges, ...result.edges])\n      }\n      if (result.nodes.size) {\n        foreignNodes = new Set([...foreignNodes, ...result.nodes])\n      }\n      root.dependencies.set(dependency.key, dependency)\n    }\n  }\n  if (!json) {\n    return g\n  }\n  if (Array.isArray(json.nodes)) {\n    for (const entry of json.nodes) {\n      g.setNode(entry.v, prepareNode(root, entry.value, json.edges))\n      if (entry.parents) {\n        for (const parent of entry.parents) {\n          // In data domain graph, all nodes that can have parents can only have a single parent.\n          // It's the business logic of the library.\n          // Parent-child relationships:\n          // - Namespace -> Namespace\n          // - Namespace -> Model\n          // - Model -> Entity\n          // Entities and Association are associated with the parent entity through edges.\n          g.setParent(entry.v, parent)\n        }\n      }\n    }\n  }\n  if (Array.isArray(json.edges)) {\n    for (const entry of json.edges) {\n      if (!entry.value) {\n        throw new Error(`Unable to restore data domain graph. Malformed edge entry`)\n      }\n      if (entry.value.foreign) {\n        // The `v` has to be local to the graph. The `w` must be foreign.\n        if (!foreignNodes.has(entry.w)) {\n          // console.warn(`Missing foreign node: ${entry.w}. Skipping edge.`)\n          continue\n        }\n      }\n      if (foreignNodes.has(entry.v) || foreignNodes.has(entry.w)) {\n        if (!g.hasNode(entry.v) || !g.hasNode(entry.w)) {\n          // console.warn(`Missing foreign node: ${entry.v} or ${entry.w}. Skipping edge.`)\n          continue\n        }\n      }\n      g.setEdge({ v: entry.v, w: entry.w, name: entry.name }, entry.value)\n    }\n  }\n  return g\n}\n"]}

package/build/src/modeling/DomainVersioning.d.ts

@@ -0,0 +1,17 @@
+import type { DataDomain } from './DataDomain.js';
+import type { SerializedGraph } from './types.js';
+/**
+ * Serializes a DataDomain for version release, including only relevant foreign nodes.
+ * @param root The DataDomain to serialize.
+ * @param version The version to set in the serialized graph. This mutates the DataDomain.
+ * @returns The serialized graph with the version set.
+ */
+export declare function createGraphVersion(root: DataDomain, version: string): SerializedGraph;
+/**
+ * Serializes a DataDomain for version release, including only relevant foreign nodes.
+ *
+ * @param dataDomain The DataDomain to serialize.
+ * @returns A SerializedGraph containing the versioned data.
+ */
+export declare function serializeForVersionRelease(dataDomain: DataDomain): SerializedGraph;
+//# sourceMappingURL=DomainVersioning.d.ts.map

package/build/src/modeling/DomainVersioning.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"DomainVersioning.d.ts","sourceRoot":"","sources":["../../../src/modeling/DomainVersioning.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAA;AACjD,OAAO,KAAK,EAAoC,eAAe,EAAE,MAAM,YAAY,CAAA;AAEnF;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,UAAU,EAAE,OAAO,EAAE,MAAM,GAAG,eAAe,CAGrF;AAED;;;;;GAKG;AACH,wBAAgB,0BAA0B,CAAC,UAAU,EAAE,UAAU,GAAG,eAAe,CAyElF"}

package/build/src/modeling/DomainVersioning.js

@@ -0,0 +1,124 @@
+/**
+ * Serializes a DataDomain for version release, including only relevant foreign nodes.
+ * @param root The DataDomain to serialize.
+ * @param version The version to set in the serialized graph. This mutates the DataDomain.
+ * @returns The serialized graph with the version set.
+ */
+export function createGraphVersion(root, version) {
+    root.info.version = version;
+    return serializeForVersionRelease(root);
+}
+/**
+ * Serializes a DataDomain for version release, including only relevant foreign nodes.
+ *
+ * @param dataDomain The DataDomain to serialize.
+ * @returns A SerializedGraph containing the versioned data.
+ */
+export function serializeForVersionRelease(dataDomain) {
+    const { graph, key: domainKey } = dataDomain;
+    const relevantForeignNodes = new Set();
+    // 1. Identify relevant foreign nodes: those connected to local entities.
+    for (const node of graph.nodes()) {
+        const nodeValue = graph.node(node);
+        if (!nodeValue) {
+            continue;
+        }
+        if (nodeValue.domain.key === domainKey) {
+            continue; // Skip local nodes
+        }
+        // Check if the foreign node is connected to a local node (directly or indirectly).
+        if (isConnectedToLocal(graph, node, domainKey)) {
+            relevantForeignNodes.add(node);
+        }
+    }
+    // 2. Filter nodes and edges based on relevance.
+    const nodes = [];
+    const edges = [];
+    for (const node of graph.nodes()) {
+        const nodeValue = graph.node(node);
+        if (!nodeValue) {
+            continue;
+        }
+        if (nodeValue.domain.key === domainKey || relevantForeignNodes.has(node)) {
+            const parents = [...graph.parents(node)];
+            const serializedNode = { v: node, value: nodeValue.toJSON() };
+            if (parents.length) {
+                serializedNode.parents = parents;
+            }
+            nodes.push(serializedNode);
+        }
+    }
+    for (const edge of graph.edges()) {
+        const edgeValue = graph.edge(edge);
+        if (!edgeValue)
+            continue;
+        const sourceNode = graph.node(edge.v);
+        const targetNode = graph.node(edge.w);
+        if (!sourceNode || !targetNode)
+            continue;
+        const isSourceRelevant = sourceNode.domain.key === domainKey || relevantForeignNodes.has(edge.v);
+        const isTargetRelevant = targetNode.domain.key === domainKey || relevantForeignNodes.has(edge.w);
+        if (isSourceRelevant && isTargetRelevant) {
+            const serializedEdge = { v: edge.v, w: edge.w, value: structuredClone(edgeValue) };
+            if (edge.name) {
+                serializedEdge.name = edge.name;
+            }
+            edges.push(serializedEdge);
+        }
+    }
+    // 3. Construct the SerializedGraph.
+    const json = {
+        options: {
+            directed: graph.isDirected(),
+            multigraph: graph.isMultigraph(),
+            compound: graph.isCompound(),
+        },
+        nodes,
+        edges,
+    };
+    return json;
+}
+/**
+ * Checks if a foreign node is connected to a local node (directly or indirectly).
+ *
+ * This function performs a breadth-first search (BFS) to determine if a foreign node
+ * is connected to any local node.
+ *
+ * @param g The DataDomain graph.
+ * @param node The key of the foreign node to check.
+ * @param domainKey The key of the local domain.
+ * @returns True if the foreign node is connected to a local node.
+ */
+function isConnectedToLocal(g, node, domainKey) {
+    const visited = new Set();
+    const queue = [node];
+    while (queue.length > 0) {
+        const current = queue.shift();
+        if (visited.has(current)) {
+            continue;
+        }
+        visited.add(current);
+        const value = g.node(current);
+        if (!value) {
+            continue;
+        }
+        if (value.domain.key === domainKey) {
+            // It means the foreign node is connected to a local node.
+            return true;
+        }
+        // Explore adjacent nodes (both incoming and outgoing edges).
+        for (const edge of g.inEdges(current)) {
+            queue.push(edge.v);
+        }
+        for (const edge of g.outEdges(current)) {
+            const label = g.edge(edge);
+            let id = edge.w;
+            if (label?.foreign) {
+                id = `${label.domain}:${edge.w}`;
+            }
+            queue.push(id);
+        }
+    }
+    return false; // No connection to a local node found.
+}
+//# sourceMappingURL=DomainVersioning.js.map

package/build/src/modeling/DomainVersioning.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"DomainVersioning.js","sourceRoot":"","sources":["../../../src/modeling/DomainVersioning.ts"],"names":[],"mappings":"AAIA;;;;;GAKG;AACH,MAAM,UAAU,kBAAkB,CAAC,IAAgB,EAAE,OAAe;IAClE,IAAI,CAAC,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;IAC3B,OAAO,0BAA0B,CAAC,IAAI,CAAC,CAAA;AACzC,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,0BAA0B,CAAC,UAAsB;IAC/D,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,SAAS,EAAE,GAAG,UAAU,CAAA;IAC5C,MAAM,oBAAoB,GAAG,IAAI,GAAG,EAAU,CAAA;IAE9C,yEAAyE;IACzE,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QACjC,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAClC,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,SAAQ;QACV,CAAC;QACD,IAAI,SAAS,CAAC,MAAM,CAAC,GAAG,KAAK,SAAS,EAAE,CAAC;YACvC,SAAQ,CAAC,mBAAmB;QAC9B,CAAC;QAED,mFAAmF;QACnF,IAAI,kBAAkB,CAAC,KAAK,EAAE,IAAI,EAAE,SAAS,CAAC,EAAE,CAAC;YAC/C,oBAAoB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QAChC,CAAC;IACH,CAAC;IAED,gDAAgD;IAChD,MAAM,KAAK,GAAG,EAAE,CAAA;IAChB,MAAM,KAAK,GAAG,EAAE,CAAA;IAEhB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QACjC,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAClC,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,SAAQ;QACV,CAAC;QAED,IAAI,SAAS,CAAC,MAAM,CAAC,GAAG,KAAK,SAAS,IAAI,oBAAoB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACzE,MAAM,OAAO,GAAG,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAA;YACxC,MAAM,cAAc,GAAiB,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,EAAE,CAAA;YAC3E,IAAI,OAAO,CAAC,MAAM,EAAE,CAAC;gBACnB,cAAc,CAAC,OAAO,GAAG,OAAO,CAAA;YAClC,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,CAAA;QAC5B,CAAC;IACH,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QACjC,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAClC,IAAI,CAAC,SAAS;YAAE,SAAQ;QAExB,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACrC,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAErC,IAAI,CAAC,UAAU,IAAI,CAAC,UAAU;YAAE,SAAQ;QAExC,MAAM,gBAAgB,GAAG,UAAU,CAAC,MAAM,CAAC,GAAG,KAAK,SAAS,IAAI,oBAAoB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAChG,MAAM,gBAAgB,GAAG,UAAU,CAAC,MAAM,CAAC,GAAG,KAAK,SAAS,IAAI,oBAAoB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAEhG,IAAI,gBAAgB,IAAI,gBAAgB,EAAE,CAAC;YACzC,MAAM,cAAc,GAA8B,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,eAAe,CAAC,SAAS,CAAC,EAAE,CAAA;YAC7G,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;gBACd,cAAc,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;YACjC,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,CAAA;QAC5B,CAAC;IACH,CAAC;IAED,oCAAoC;IACpC,MAAM,IAAI,GAAoB;QAC5B,OAAO,EAAE;YACP,QAAQ,EAAE,KAAK,CAAC,UAAU,EAAE;YAC5B,UAAU,EAAE,KAAK,CAAC,YAAY,EAAE;YAChC,QAAQ,EAAE,KAAK,CAAC,UAAU,EAAE;SAC7B;QACD,KAAK;QACL,KAAK;KACN,CAAA;IAED,OAAO,IAAI,CAAA;AACb,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,kBAAkB,CAAC,CAAkB,EAAE,IAAY,EAAE,SAAiB;IAC7E,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;IACjC,MAAM,KAAK,GAAa,CAAC,IAAI,CAAC,CAAA;IAE9B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAY,CAAA;QACvC,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;YACzB,SAAQ;QACV,CAAC;QACD,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;QAEpB,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QAC7B,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,SAAQ;QACV,CAAC;QAED,IAAI,KAAK,CAAC,MAAM,CAAC,GAAG,KAAK,SAAS,EAAE,CAAC;YACnC,0DAA0D;YAC1D,OAAO,IAAI,CAAA;QACb,CAAC;QAED,6DAA6D;QAC7D,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;YACtC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACpB,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;YACvC,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAC1B,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC,CAAA;YACf,IAAI,KAAK,EAAE,OAAO,EAAE,CAAC;gBACnB,EAAE,GAAG,GAAG,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,CAAC,EAAE,CAAA;YAClC,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAChB,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAA,CAAC,uCAAuC;AACtD,CAAC","sourcesContent":["import type { JsonEdge, Node } from '@api-client/graph'\nimport type { DataDomain } from './DataDomain.js'\nimport type { DomainGraphEdge, DataDomainGraph, SerializedGraph } from './types.js'\n\n/**\n * Serializes a DataDomain for version release, including only relevant foreign nodes.\n * @param root The DataDomain to serialize.\n * @param version The version to set in the serialized graph. This mutates the DataDomain.\n * @returns The serialized graph with the version set.\n */\nexport function createGraphVersion(root: DataDomain, version: string): SerializedGraph {\n  root.info.version = version\n  return serializeForVersionRelease(root)\n}\n\n/**\n * Serializes a DataDomain for version release, including only relevant foreign nodes.\n *\n * @param dataDomain The DataDomain to serialize.\n * @returns A SerializedGraph containing the versioned data.\n */\nexport function serializeForVersionRelease(dataDomain: DataDomain): SerializedGraph {\n  const { graph, key: domainKey } = dataDomain\n  const relevantForeignNodes = new Set<string>()\n\n  // 1. Identify relevant foreign nodes: those connected to local entities.\n  for (const node of graph.nodes()) {\n    const nodeValue = graph.node(node)\n    if (!nodeValue) {\n      continue\n    }\n    if (nodeValue.domain.key === domainKey) {\n      continue // Skip local nodes\n    }\n\n    // Check if the foreign node is connected to a local node (directly or indirectly).\n    if (isConnectedToLocal(graph, node, domainKey)) {\n      relevantForeignNodes.add(node)\n    }\n  }\n\n  // 2. Filter nodes and edges based on relevance.\n  const nodes = []\n  const edges = []\n\n  for (const node of graph.nodes()) {\n    const nodeValue = graph.node(node)\n    if (!nodeValue) {\n      continue\n    }\n\n    if (nodeValue.domain.key === domainKey || relevantForeignNodes.has(node)) {\n      const parents = [...graph.parents(node)]\n      const serializedNode: Node<object> = { v: node, value: nodeValue.toJSON() }\n      if (parents.length) {\n        serializedNode.parents = parents\n      }\n      nodes.push(serializedNode)\n    }\n  }\n\n  for (const edge of graph.edges()) {\n    const edgeValue = graph.edge(edge)\n    if (!edgeValue) continue\n\n    const sourceNode = graph.node(edge.v)\n    const targetNode = graph.node(edge.w)\n\n    if (!sourceNode || !targetNode) continue\n\n    const isSourceRelevant = sourceNode.domain.key === domainKey || relevantForeignNodes.has(edge.v)\n    const isTargetRelevant = targetNode.domain.key === domainKey || relevantForeignNodes.has(edge.w)\n\n    if (isSourceRelevant && isTargetRelevant) {\n      const serializedEdge: JsonEdge<DomainGraphEdge> = { v: edge.v, w: edge.w, value: structuredClone(edgeValue) }\n      if (edge.name) {\n        serializedEdge.name = edge.name\n      }\n      edges.push(serializedEdge)\n    }\n  }\n\n  // 3. Construct the SerializedGraph.\n  const json: SerializedGraph = {\n    options: {\n      directed: graph.isDirected(),\n      multigraph: graph.isMultigraph(),\n      compound: graph.isCompound(),\n    },\n    nodes,\n    edges,\n  }\n\n  return json\n}\n\n/**\n * Checks if a foreign node is connected to a local node (directly or indirectly).\n *\n * This function performs a breadth-first search (BFS) to determine if a foreign node\n * is connected to any local node.\n *\n * @param g The DataDomain graph.\n * @param node The key of the foreign node to check.\n * @param domainKey The key of the local domain.\n * @returns True if the foreign node is connected to a local node.\n */\nfunction isConnectedToLocal(g: DataDomainGraph, node: string, domainKey: string): boolean {\n  const visited = new Set<string>()\n  const queue: string[] = [node]\n\n  while (queue.length > 0) {\n    const current = queue.shift() as string\n    if (visited.has(current)) {\n      continue\n    }\n    visited.add(current)\n\n    const value = g.node(current)\n    if (!value) {\n      continue\n    }\n\n    if (value.domain.key === domainKey) {\n      // It means the foreign node is connected to a local node.\n      return true\n    }\n\n    // Explore adjacent nodes (both incoming and outgoing edges).\n    for (const edge of g.inEdges(current)) {\n      queue.push(edge.v)\n    }\n    for (const edge of g.outEdges(current)) {\n      const label = g.edge(edge)\n      let id = edge.w\n      if (label?.foreign) {\n        id = `${label.domain}:${edge.w}`\n      }\n      queue.push(id)\n    }\n  }\n\n  return false // No connection to a local node found.\n}\n"]}

package/build/src/modeling/GraphUtils.d.ts

@@ -0,0 +1,8 @@
+import type { Graph } from '@api-client/graph';
+import type { DomainGraphEdge, DomainGraphNodeType } from './types.js';
+/**
+ * Recursively removes a node and all its children from the graph.
+ * @param key The key of the node to remove.
+ */
+export declare function removeGraphNode(graph: Graph<unknown, DomainGraphNodeType, DomainGraphEdge>, key: string): void;
+//# sourceMappingURL=GraphUtils.d.ts.map

package/build/src/modeling/GraphUtils.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphUtils.d.ts","sourceRoot":"","sources":["../../../src/modeling/GraphUtils.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,mBAAmB,CAAA;AAC9C,OAAO,KAAK,EAAE,eAAe,EAAE,mBAAmB,EAAE,MAAM,YAAY,CAAA;AAEtE;;;GAGG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,KAAK,CAAC,OAAO,EAAE,mBAAmB,EAAE,eAAe,CAAC,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI,CAoB9G"}

package/build/src/modeling/GraphUtils.js

@@ -0,0 +1,26 @@
+/**
+ * Recursively removes a node and all its children from the graph.
+ * @param key The key of the node to remove.
+ */
+export function removeGraphNode(graph, key) {
+    if (!graph.hasNode(key)) {
+        return;
+    }
+    for (const child of graph.children(key)) {
+        removeGraphNode(graph, child);
+    }
+    for (const edge of graph.outEdges(key)) {
+        const label = graph.edge(edge);
+        if (!label) {
+            continue;
+        }
+        // While associations should be associated with the entity through an edge,
+        // I am still on a fence about properties being the same...
+        // We won't be reusing properties within a domain model.
+        if (['property', 'association'].includes(label.type)) {
+            removeGraphNode(graph, edge.w);
+        }
+    }
+    graph.removeNode(key);
+}
+//# sourceMappingURL=GraphUtils.js.map

package/build/src/modeling/GraphUtils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphUtils.js","sourceRoot":"","sources":["../../../src/modeling/GraphUtils.ts"],"names":[],"mappings":"AAGA;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,KAA2D,EAAE,GAAW;IACtG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QACxB,OAAM;IACR,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QACxC,eAAe,CAAC,KAAK,EAAE,KAAK,CAAC,CAAA;IAC/B,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAC9B,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,SAAQ;QACV,CAAC;QACD,2EAA2E;QAC3E,2DAA2D;QAC3D,wDAAwD;QACxD,IAAI,CAAC,UAAU,EAAE,aAAa,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YACrD,eAAe,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,CAAA;QAChC,CAAC;IACH,CAAC;IACD,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAA;AACvB,CAAC","sourcesContent":["import type { Graph } from '@api-client/graph'\nimport type { DomainGraphEdge, DomainGraphNodeType } from './types.js'\n\n/**\n * Recursively removes a node and all its children from the graph.\n * @param key The key of the node to remove.\n */\nexport function removeGraphNode(graph: Graph<unknown, DomainGraphNodeType, DomainGraphEdge>, key: string): void {\n  if (!graph.hasNode(key)) {\n    return\n  }\n  for (const child of graph.children(key)) {\n    removeGraphNode(graph, child)\n  }\n  for (const edge of graph.outEdges(key)) {\n    const label = graph.edge(edge)\n    if (!label) {\n      continue\n    }\n    // While associations should be associated with the entity through an edge,\n    // I am still on a fence about properties being the same...\n    // We won't be reusing properties within a domain model.\n    if (['property', 'association'].includes(label.type)) {\n      removeGraphNode(graph, edge.w)\n    }\n  }\n  graph.removeNode(key)\n}\n"]}