cgdl-lib 0.2.0

package/LICENSE

@@ -0,0 +1,21 @@
+# MIT License
+
+Copyright (c) 2026 Linguistic Agents Ltd.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,251 @@
+# cgdl-lib
+
+A tiny, deliberate TypeScript library that reads plain-text CGDL and builds an in-memory directed graph.
+
+cgdl-lib implements only the graph-building core of CGDL:
+
+- class selection
+- node selection
+- properties
+- outgoing edges (with fully consistent incoming edges)
+- preservation of non-structural lines as Line { signal, text }
+
+Everything else is preserved but never interpreted. Higher layers (protocols, CLIs, editors) can assign meaning to preserved lines later.
+
+Status: not published to npm yet. Use from source / GitHub until the first release.
+
+----------------------------------------------------------------
+
+WHAT CGDL IS
+
+CGDL (Context Graph Description Language) is a line-oriented, hand-editable format for describing small graphs and attached context. It is designed to be friendly to:
+
+- hand-editing
+- git diffs
+- sequential reading
+- structured notes that happen to form a graph
+
+----------------------------------------------------------------
+
+CORE SYNTAX (IMPLEMENTED)
+
+1) Class directives
+
+Open / reopen class:
+
+[[ ClassName ]]
+
+Effects:
+
+- state.currentClass = "ClassName"
+- clears current node selection
+
+Close class (enter graph-level class mode):
+
+[[ ]]
+
+Effects:
+
+- state.currentClass = ""
+- clears current node selection
+
+Note: Leading whitespace is ignored for directive detection.
+
+----------------------------------------------------------------
+
+Node directives
+
+Open/select node in the current class:
+
+## Label text
+
+Effects:
+
+- creates node if needed: (currentClass, "Label text")
+- sets it as current node
+
+Close current node only (class stays open):
+
+##
+
+Effects:
+
+- clears current node selection
+
+----------------------------------------------------------------
+
+## Properties
+
+Set property:
+
+{} key = value
+
+Parsing:
+
+- key is trimmed and whitespace-collapsed
+- value is everything after the first = (so = is allowed inside the value)
+
+Behavior:
+
+- applies to the effective node (see below)
+- overwrites (reassignment semantics): last value wins
+
+----------------------------------------------------------------
+
+## Outgoing edges
+
+Outgoing edge:
+
+OtherClass:TargetLabel
+
+Behavior:
+
+- adds an outgoing edge from the effective node
+- always creates the target node if it doesn’t exist yet (stub node)
+- maintains consistent edges:
+  - source stores target in _outgoingSet
+  - target stores source in _incomingSet
+- duplicate edge adds are ignored (with a warning)
+
+----------------------------------------------------------------
+
+EFFECTIVE NODE RULES (IMPORTANT)
+
+Commands must still work even when no explicit node is currently open.
+
+Definition:
+
+- If an explicit node is open (state.currentNodeKey != ""):
+  effectiveNode = that node
+- Else:
+  effectiveNode = graph.getOrCreateNode(state.currentClass, "")
+
+So when no node is selected, properties and edges attach to the class default node:
+
+(currentClass, "")
+
+Graph-level class
+
+After [[ ]], currentClass = "".
+
+Nodes opened via ## Label in this state become:
+
+("", "Label")
+
+These are graph-level / global feature nodes.
+
+----------------------------------------------------------------
+
+UNORDERED-BY-DESIGN
+
+Graph node sets are unordered by design. cgdl-lib intentionally does not preserve insertion order.
+
+Do not write tests or logic that depends on iteration order of nodes or edges.
+
+----------------------------------------------------------------
+
+LINE PRESERVATION AND 2-CHAR SIGNALS (FROZEN RULE)
+
+Non-structural lines are preserved inside the current node as:
+
+Line { signal: string, text: string }
+
+Signal extraction:
+
+1. Ignore leading whitespace for detection.
+2. If the first two non-whitespace characters are BOTH punctuation,
+3. AND neither is one of: - , ' , _
+4. Then:
+   signal = those 2 chars
+   text = the rest (trimOne)
+5. Otherwise:
+   signal = ""
+   text = left-trimmed line
+
+Notes:
+
+- '-' and "'" are treated as “word-ish” and never count as command punctuation.
+- whitespace cannot be part of a command.
+
+Examples:
+
+- "{} country = France" -> signal "{}"
+- "!! hello"            -> signal "!!"
+- "-> something"        -> not a signal (contains '-') -> signal ""
+- "'# foo"              -> not a signal (contains "'") -> signal ""
+- "+-" at start         -> not a signal (contains '-') -> signal ""
+
+Text normalization:
+
+- display normalization collapses whitespace runs and trims
+- keying normalization lowercases
+
+----------------------------------------------------------------
+
+API
+
+readText(text: string)
+
+Parses full text and returns:
+
+- graph
+- state (incremental reader state)
+- diagnostics (warnings/errors)
+
+readLine(graph, state, diagnostics, rawLine, lineNo)
+
+Incremental parser for editor / streaming scenarios:
+
+- updates graph and state
+- appends warnings/errors to diagnostics
+
+Diagnostics store:
+
+- warnings: { lineNo, message }[]
+- errors: { lineNo, message }[]
+
+----------------------------------------------------------------
+
+INCREMENTAL PARSING EXAMPLE
+
+import { CGGraph } from "../src/model/CGGraph";
+import { ReaderState } from "../src/reader/ReaderState";
+import { Diagnostics } from "../src/reader/Diagnostics";
+import { readLine } from "../src/reader/Reader";
+
+const graph = new CGGraph();
+const state = new ReaderState();
+const diagnostics = new Diagnostics();
+
+const lines = [
+  "[[ Places ]]",
+  "## Paris",
+  "{} country = France",
+  "Food:Croissant",
+  "##",
+  "## Lyon",
+  "{} country = France",
+];
+
+lines.forEach((rawLine, i) => {
+  readLine(graph, state, diagnostics, rawLine, i + 1);
+});
+
+console.log(graph);
+console.log(diagnostics);
+
+----------------------------------------------------------------
+
+DEVELOPMENT
+
+Tests (vitest):
+npm test
+
+Build:
+npm run build
+
+----------------------------------------------------------------
+
+LICENSE
+
+MIT (see LICENSE).

package/dist/index.d.ts

@@ -0,0 +1 @@
+//# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":""}

package/dist/index.js

@@ -0,0 +1 @@
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":""}

package/dist/model/CGGraph.d.ts

@@ -0,0 +1,59 @@
+/**
+ * Graph storage:
+ * - nodes: Map<NodeKey, CGNode>
+ *
+ * Identity is (ClassName, Label) => NodeKey = norm(class)::norm(label)
+ * NOTE: CGDL node sets are unordered by design, so we do NOT maintain insertion order.
+ */
+import type { NodeKey } from "../types";
+import { CGNode } from "./CGNode";
+/**
+ * In-memory container for a CGDL graph.
+ * Stores nodes by canonical NodeKey.
+ * Nodes are created/merged on demand via getOrCreateNode.
+ * Unordered by design — no insertion order preserved.
+ */
+export declare class CGGraph {
+    readonly nodes: Map<NodeKey, CGNode>;
+    makeNodeKey(className: string, label: string): NodeKey;
+    getNodeByKey(key: NodeKey): CGNode | undefined;
+    getOrCreateNode(className: string, label: string): CGNode;
+    /**
+     * Deletes a node and cleans all connected edges.
+     * Returns true if the node existed and was removed.
+     */
+    deleteNode(className: string, label: string): boolean;
+    /**
+     * Adds a specific outgoing edge from source to target.
+     * Returns true if the edge did not exist and was added.
+     */
+    addEdge(sourceClass: string, sourceLabel: string, targetClass: string, targetLabel: string): boolean;
+    /**
+     * Deletes a specific outgoing edge from source to target.
+     * Returns true if the edge existed and was removed.
+     */
+    deleteEdge(sourceClass: string, sourceLabel: string, targetClass: string, targetLabel: string): boolean;
+    /**
+     * Parses a NodeKey "cls::label" into its normalized parts.
+     * Both parts are already normalized, because NodeKey is canonical.
+     */
+    parseNodeKey(key: NodeKey): {
+        cls: string;
+        label: string;
+    };
+    /**
+     * Deterministic CGDL-like dump:
+     * - Nodes sorted by canonical key (stable for testing/debug).
+     * - Emits [[ Class ]] blocks and ## Label lines.
+     * - Properties emitted as: {} KEY = value  (KEY uppercased)
+     * - Edges emitted as: TargetClass:TargetLabel
+     *
+     * Notes:
+     * - Uses display names stored on nodes (classNameDisplay/labelDisplay) so output matches
+     *   the canonical “first-seen” casing/spaces you want to keep.
+     * - Edge targets are dumped using canonical node display if the target exists;
+     *   otherwise falls back to parsed key parts.
+     */
+    toLinesCgdl(): string[];
+}
+//# sourceMappingURL=CGGraph.d.ts.map

package/dist/model/CGGraph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"CGGraph.d.ts","sourceRoot":"","sources":["../../src/model/CGGraph.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,UAAU,CAAC;AAExC,OAAO,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAElC;;;;;GAKG;AACH,qBAAa,OAAO;IAClB,SAAgB,KAAK,EAAE,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,CAAa;IAEjD,WAAW,CAAC,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO;IAItD,YAAY,CAAC,GAAG,EAAE,OAAO,GAAG,MAAM,GAAG,SAAS;IAI9C,eAAe,CAAC,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM;IAoBhE;;;OAGG;IACI,UAAU,CAAC,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO;IAoC5D;;;OAGG;IAEI,OAAO,CACZ,WAAW,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EACxC,WAAW,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GACvC,OAAO;IAcV;;;OAGG;IACI,UAAU,CACf,WAAW,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EACxC,WAAW,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GACvC,OAAO;IAeV;;;OAGG;IACI,YAAY,CAAC,GAAG,EAAE,OAAO,GAAG;QAAE,GAAG,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE;IAMjE;;;;;;;;;;;;OAYG;IACI,WAAW,IAAI,MAAM,EAAE;CAkD/B"}

package/dist/model/CGGraph.js

@@ -0,0 +1,156 @@
+// src/model/CGGraph.ts
+import { normalizeDisplay, normalizeKeyPart } from "../utils/normalize";
+import { CGNode } from "./CGNode";
+/**
+ * In-memory container for a CGDL graph.
+ * Stores nodes by canonical NodeKey.
+ * Nodes are created/merged on demand via getOrCreateNode.
+ * Unordered by design — no insertion order preserved.
+ */
+export class CGGraph {
+    nodes = new Map();
+    makeNodeKey(className, label) {
+        return `${normalizeKeyPart(className)}::${normalizeKeyPart(label)}`;
+    }
+    getNodeByKey(key) {
+        return this.nodes.get(key);
+    }
+    getOrCreateNode(className, label) {
+        const key = this.makeNodeKey(className, label);
+        const existing = this.nodes.get(key);
+        if (existing) {
+            existing.refreshDisplay(normalizeDisplay(className), normalizeDisplay(label));
+            return existing;
+        }
+        const node = new CGNode({
+            key,
+            classNameDisplay: normalizeDisplay(className),
+            labelDisplay: normalizeDisplay(label),
+        });
+        this.nodes.set(key, node);
+        return node;
+    }
+    /**
+     * Deletes a node and cleans all connected edges.
+     * Returns true if the node existed and was removed.
+     */
+    deleteNode(className, label) {
+        const key = this.makeNodeKey(className, label);
+        const node = this.nodes.get(key);
+        if (!node)
+            return false;
+        // Clean incoming edges (sources pointing TO this node)
+        for (const sourceKey of Array.from(node._incomingSet)) {
+            const source = this.nodes.get(sourceKey);
+            if (source) {
+                source.removeOutgoing(className, label);
+            }
+        }
+        // Clean outgoing edges (targets this node points TO)
+        for (const targetKey of Array.from(node._outgoingSet)) {
+            const target = this.nodes.get(targetKey);
+            if (target) {
+                target.removeIncoming(className, label);
+            }
+        }
+        // Optional: drop references from the node object itself
+        node._incomingSet.clear();
+        node._outgoingSet.clear();
+        this.nodes.delete(key);
+        return true;
+    }
+    /**
+     * Adds a specific outgoing edge from source to target.
+     * Returns true if the edge did not exist and was added.
+     */
+    addEdge(sourceClass, sourceLabel, targetClass, targetLabel) {
+        const source = this.getOrCreateNode(sourceClass, sourceLabel);
+        const target = this.getOrCreateNode(targetClass, targetLabel);
+        const inserted = source.addOutgoing(targetClass, targetLabel);
+        if (!inserted)
+            return false;
+        target.addIncoming(sourceClass, sourceLabel);
+        return true;
+    }
+    /**
+     * Deletes a specific outgoing edge from source to target.
+     * Returns true if the edge existed and was removed.
+     */
+    deleteEdge(sourceClass, sourceLabel, targetClass, targetLabel) {
+        const source = this.nodes.get(this.makeNodeKey(sourceClass, sourceLabel));
+        if (!source || !source.removeOutgoing(targetClass, targetLabel))
+            return false;
+        const target = this.nodes.get(this.makeNodeKey(targetClass, targetLabel));
+        if (target) {
+            target.removeIncoming(sourceClass, sourceLabel);
+        }
+        return true;
+    }
+    /**
+     * Parses a NodeKey "cls::label" into its normalized parts.
+     * Both parts are already normalized, because NodeKey is canonical.
+     */
+    parseNodeKey(key) {
+        const i = key.indexOf("::");
+        if (i < 0)
+            return { cls: "", label: key };
+        return { cls: key.slice(0, i), label: key.slice(i + 2) };
+    }
+    /**
+     * Deterministic CGDL-like dump:
+     * - Nodes sorted by canonical key (stable for testing/debug).
+     * - Emits [[ Class ]] blocks and ## Label lines.
+     * - Properties emitted as: {} KEY = value  (KEY uppercased)
+     * - Edges emitted as: TargetClass:TargetLabel
+     *
+     * Notes:
+     * - Uses display names stored on nodes (classNameDisplay/labelDisplay) so output matches
+     *   the canonical “first-seen” casing/spaces you want to keep.
+     * - Edge targets are dumped using canonical node display if the target exists;
+     *   otherwise falls back to parsed key parts.
+     */
+    toLinesCgdl() {
+        const out = [];
+        const nodeKeys = Array.from(this.nodes.keys()).sort();
+        let currentClassDisplay = null;
+        for (const key of nodeKeys) {
+            const node = this.nodes.get(key);
+            const clsDisp = node.classNameDisplay;
+            const labelDisp = node.labelDisplay;
+            // Emit class header when class changes (including graph-level class "")
+            if (currentClassDisplay === null || currentClassDisplay !== clsDisp) {
+                currentClassDisplay = clsDisp;
+                out.push(`[[ ${clsDisp} ]]`.trim()); // if clsDisp == "" -> "[[]]" after trim
+            }
+            // Emit node header
+            out.push(`## ${labelDisp}`.trim()); // if labelDisp == "" -> "##" after trim
+            // Properties: stable, key uppercased in output
+            const props = Array.from(node.properties.entries()).sort(([a], [b]) => a.localeCompare(b));
+            for (const [k, v] of props) {
+                out.push(`{} ${k.toUpperCase()} = ${v}`);
+            }
+            // Outgoing edges: stable by target key, but display using target node's canonical display if present
+            const outs = Array.from(node._outgoingSet.values()).sort();
+            for (const targetKey of outs) {
+                const target = this.nodes.get(targetKey);
+                if (target) {
+                    out.push(`${target.classNameDisplay}:${target.labelDisplay}`);
+                }
+                else {
+                    // Fallback: derive from key if node missing (should be rare in your design)
+                    const parsed = this.parseNodeKey(targetKey);
+                    out.push(`${parsed.cls}:${parsed.label}`);
+                }
+            }
+            // Preserved lines (optional): keep in stored order, reconstruct as close as possible
+            for (const l of node.lines) {
+                if (l.signal)
+                    out.push(`${l.signal} ${l.text}`.trimEnd());
+                else
+                    out.push(`${l.text}`.trimEnd());
+            }
+        }
+        return out;
+    }
+}
+//# sourceMappingURL=CGGraph.js.map

package/dist/model/CGGraph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"CGGraph.js","sourceRoot":"","sources":["../../src/model/CGGraph.ts"],"names":[],"mappings":"AAAA,uBAAuB;AAWvB,OAAO,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AACxE,OAAO,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAElC;;;;;GAKG;AACH,MAAM,OAAO,OAAO;IACF,KAAK,GAAyB,IAAI,GAAG,EAAE,CAAC;IAEjD,WAAW,CAAC,SAAiB,EAAE,KAAa;QACjD,OAAO,GAAG,gBAAgB,CAAC,SAAS,CAAC,KAAK,gBAAgB,CAAC,KAAK,CAAC,EAAE,CAAC;IACtE,CAAC;IAEM,YAAY,CAAC,GAAY;QAC9B,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC7B,CAAC;IAEM,eAAe,CAAC,SAAiB,EAAE,KAAa;QAErD,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;QAE/C,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,QAAQ,EAAE,CAAC;YACb,QAAQ,CAAC,cAAc,CAAC,gBAAgB,CAAC,SAAS,CAAC,EAAE,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC;YAC9E,OAAO,QAAQ,CAAC;QAClB,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,MAAM,CAAC;YACtB,GAAG;YACH,gBAAgB,EAAE,gBAAgB,CAAC,SAAS,CAAC;YAC7C,YAAY,EAAE,gBAAgB,CAAC,KAAK,CAAC;SACtC,CAAC,CAAC;QAEH,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC1B,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACI,UAAU,CAAC,SAAiB,EAAE,KAAa;QAEhD,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;QAC/C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACjC,IAAI,CAAC,IAAI;YACP,OAAO,KAAK,CAAC;QAEf,uDAAuD;QACvD,KAAK,MAAM,SAAS,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,EACrD,CAAC;YACC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACzC,IAAI,MAAM,EACV,CAAC;gBACC,MAAM,CAAC,cAAc,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC;QAED,qDAAqD;QACrD,KAAK,MAAM,SAAS,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,EACrD,CAAC;YACC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACzC,IAAI,MAAM,EACV,CAAC;gBACC,MAAM,CAAC,cAAc,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC;QAED,wDAAwD;QACxD,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;QAC1B,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;QAE1B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAEvB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IAEI,OAAO,CACZ,WAAmB,EAAE,WAAmB,EACxC,WAAmB,EAAE,WAAmB;QAGxC,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;QAC9D,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;QAE9D,MAAM,QAAQ,GAAG,MAAM,CAAC,WAAW,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;QAC9D,IAAI,CAAC,QAAQ;YACX,OAAO,KAAK,CAAC;QAEf,MAAM,CAAC,WAAW,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;QAC7C,OAAO,IAAI,CAAC;IACd,CAAC;IAGD;;;OAGG;IACI,UAAU,CACf,WAAmB,EAAE,WAAmB,EACxC,WAAmB,EAAE,WAAmB;QAExC,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC,CAAC;QAE1E,IAAI,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC,WAAW,EAAE,WAAW,CAAC;YAC7D,OAAO,KAAK,CAAC;QAEf,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC,CAAC;QAC1E,IAAI,MAAM,EACV,CAAC;YACC,MAAM,CAAC,cAAc,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;QAClD,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACI,YAAY,CAAC,GAAY;QAC9B,MAAM,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAC5B,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,KAAK,EAAE,GAAa,EAAE,CAAC;QACpD,OAAO,EAAE,GAAG,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;IAC3D,CAAC;IAED;;;;;;;;;;;;OAYG;IACI,WAAW;QAChB,MAAM,GAAG,GAAa,EAAE,CAAC;QAEzB,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QAEtD,IAAI,mBAAmB,GAAkB,IAAI,CAAC;QAE9C,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;YAElC,MAAM,OAAO,GAAG,IAAI,CAAC,gBAAgB,CAAC;YACtC,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC;YAEpC,wEAAwE;YACxE,IAAI,mBAAmB,KAAK,IAAI,IAAI,mBAAmB,KAAK,OAAO,EAAE,CAAC;gBACpE,mBAAmB,GAAG,OAAO,CAAC;gBAC9B,GAAG,CAAC,IAAI,CAAC,MAAM,OAAO,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,wCAAwC;YAC/E,CAAC;YAED,mBAAmB;YACnB,GAAG,CAAC,IAAI,CAAC,MAAM,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,wCAAwC;YAE5E,+CAA+C;YAC/C,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3F,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC;gBAC3B,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,WAAW,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC;YAC3C,CAAC;YAED,qGAAqG;YACrG,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;YAC3D,KAAK,MAAM,SAAS,IAAI,IAAI,EAAE,CAAC;gBAC7B,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBACzC,IAAI,MAAM,EAAE,CAAC;oBACX,GAAG,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,gBAAgB,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC,CAAC;gBAChE,CAAC;qBAAM,CAAC;oBACN,4EAA4E;oBAC5E,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;oBAC5C,GAAG,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,GAAG,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;gBAC5C,CAAC;YACH,CAAC;YAED,qFAAqF;YACrF,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;gBAC3B,IAAI,CAAC,CAAC,MAAM;oBAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;;oBACrD,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;YACvC,CAAC;QACH,CAAC;QAED,OAAO,GAAG,CAAC;IACb,CAAC;CACF"}

package/dist/model/CGNode.d.ts

@@ -0,0 +1,45 @@
+/**
+ * Node data:
+ * - properties overwrite (reassignment)
+ * - edges de-dup (duplicate adds warn; stored once)
+ * - lines preserved as Line{signal,text}
+ */
+import type { NodeKey } from "../types";
+import { Line } from "./Line";
+export declare class CGNode {
+    readonly key: NodeKey;
+    classNameDisplay: string;
+    labelDisplay: string;
+    readonly properties: Map<string, string>;
+    readonly _outgoingSet: Set<string>;
+    readonly _incomingSet: Set<string>;
+    readonly lines: Line[];
+    constructor(args: {
+        key: NodeKey;
+        classNameDisplay: string;
+        labelDisplay: string;
+    });
+    refreshDisplay(className: string, label: string): void;
+    setProperty(key: string, value: string): void;
+    /**
+     * Returns true if inserted; false if duplicate.
+     */
+    addOutgoing(targetClass: string, targetLabel: string): boolean;
+    /**
+     * Returns true if inserted; false if duplicate.
+     */
+    addIncoming(sourceClass: string, sourceLabel: string): boolean;
+    addLine(line: Line): void;
+    /**
+     * Removes a specific outgoing edge.
+     * Returns true if the edge existed and was removed.
+     */
+    removeOutgoing(targetClass: string, targetLabel: string): boolean;
+    /**
+     * Removes a specific incoming edge.
+     * Returns true if the edge existed and was removed.
+     */
+    removeIncoming(sourceClass: string, sourceLabel: string): boolean;
+    private edgeKey;
+}
+//# sourceMappingURL=CGNode.d.ts.map

package/dist/model/CGNode.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"CGNode.d.ts","sourceRoot":"","sources":["../../src/model/CGNode.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,UAAU,CAAC;AAExC,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAE9B,qBAAa,MAAM;IAEjB,SAAgB,GAAG,EAAE,OAAO,CAAC;IAGtB,gBAAgB,EAAE,MAAM,CAAC;IACzB,YAAY,EAAE,MAAM,CAAC;IAG5B,SAAgB,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAa;IAE5D,SAAgB,YAAY,EAAE,GAAG,CAAC,MAAM,CAAC,CAAa;IACtD,SAAgB,YAAY,EAAE,GAAG,CAAC,MAAM,CAAC,CAAa;IAGtD,SAAgB,KAAK,EAAE,IAAI,EAAE,CAAM;gBAEhB,IAAI,EAAE;QAAE,GAAG,EAAE,OAAO,CAAC;QAAC,gBAAgB,EAAE,MAAM,CAAC;QAAC,YAAY,EAAE,MAAM,CAAA;KAAE;IAMlF,cAAc,CAAC,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;IAKtD,WAAW,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;IAIpD;;OAEG;IACI,WAAW,CAAC,WAAW,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,OAAO;IAWrE;;OAEG;IACI,WAAW,CAAC,WAAW,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,OAAO;IAY9D,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,IAAI;IAKhC;;;OAGG;IACI,cAAc,CAAC,WAAW,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,OAAO;IAWxE;;;OAGG;IACI,cAAc,CAAC,WAAW,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,OAAO;IASxE,OAAO,CAAC,OAAO;CAGhB"}

package/dist/model/CGNode.js

@@ -0,0 +1,80 @@
+/**
+ * Node data:
+ * - properties overwrite (reassignment)
+ * - edges de-dup (duplicate adds warn; stored once)
+ * - lines preserved as Line{signal,text}
+ */
+import { normalizeDisplay, normalizeKeyPart } from "../utils/normalize";
+export class CGNode {
+    key;
+    // Display (preserve case, whitespace collapsed)
+    classNameDisplay;
+    labelDisplay;
+    // Properties: overwrite semantics.
+    properties = new Map();
+    _outgoingSet = new Set(); // stores TARGET node keys (to)
+    _incomingSet = new Set(); // stores SOURCE node keys (from)
+    // Non-structural lines inside the node.
+    lines = [];
+    constructor(args) {
+        this.key = args.key;
+        this.classNameDisplay = args.classNameDisplay;
+        this.labelDisplay = args.labelDisplay;
+    }
+    refreshDisplay(className, label) {
+        this.classNameDisplay = normalizeDisplay(className);
+        this.labelDisplay = normalizeDisplay(label);
+    }
+    setProperty(key, value) {
+        this.properties.set(key, value);
+    }
+    /**
+     * Returns true if inserted; false if duplicate.
+     */
+    addOutgoing(targetClass, targetLabel) {
+        const k = this.edgeKey(targetClass, targetLabel);
+        if (this._outgoingSet.has(k))
+            return false;
+        this._outgoingSet.add(k);
+        return true;
+    }
+    /**
+     * Returns true if inserted; false if duplicate.
+     */
+    addIncoming(sourceClass, sourceLabel) {
+        const k = this.edgeKey(sourceClass, sourceLabel);
+        if (this._incomingSet.has(k))
+            return false;
+        this._incomingSet.add(k);
+        return true;
+    }
+    addLine(line) {
+        this.lines.push(line);
+    }
+    /**
+     * Removes a specific outgoing edge.
+     * Returns true if the edge existed and was removed.
+     */
+    removeOutgoing(targetClass, targetLabel) {
+        const k = this.edgeKey(targetClass, targetLabel);
+        if (!this._outgoingSet.has(k))
+            return false;
+        this._outgoingSet.delete(k);
+        return true;
+    }
+    /**
+     * Removes a specific incoming edge.
+     * Returns true if the edge existed and was removed.
+     */
+    removeIncoming(sourceClass, sourceLabel) {
+        const k = this.edgeKey(sourceClass, sourceLabel);
+        if (!this._incomingSet.has(k))
+            return false;
+        this._incomingSet.delete(k);
+        return true;
+    }
+    edgeKey(cls, label) {
+        return `${normalizeKeyPart(cls)}::${normalizeKeyPart(label)}`;
+    }
+}
+//# sourceMappingURL=CGNode.js.map

package/dist/model/CGNode.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"CGNode.js","sourceRoot":"","sources":["../../src/model/CGNode.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAGH,OAAO,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAGxE,MAAM,OAAO,MAAM;IAED,GAAG,CAAU;IAE7B,gDAAgD;IACzC,gBAAgB,CAAS;IACzB,YAAY,CAAS;IAE5B,mCAAmC;IACnB,UAAU,GAAwB,IAAI,GAAG,EAAE,CAAC;IAE5C,YAAY,GAAgB,IAAI,GAAG,EAAE,CAAC,CAAE,+BAA+B;IACvE,YAAY,GAAgB,IAAI,GAAG,EAAE,CAAC,CAAE,iCAAiC;IAEzF,wCAAwC;IACxB,KAAK,GAAW,EAAE,CAAC;IAEnC,YAAmB,IAAsE;QACvF,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;QACpB,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,gBAAgB,CAAC;QAC9C,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,YAAY,CAAC;IACxC,CAAC;IAEM,cAAc,CAAC,SAAiB,EAAE,KAAa;QACpD,IAAI,CAAC,gBAAgB,GAAG,gBAAgB,CAAC,SAAS,CAAC,CAAC;QACpD,IAAI,CAAC,YAAY,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;IAC9C,CAAC;IAEM,WAAW,CAAC,GAAW,EAAE,KAAa;QAC3C,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAClC,CAAC;IAED;;OAEG;IACI,WAAW,CAAC,WAAmB,EAAE,WAAmB;QACzD,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;QAEjD,IAAI,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC;YAC1B,OAAO,KAAK,CAAC;QAEf,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAEzB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACI,WAAW,CAAC,WAAmB,EAAE,WAAmB;QAEzD,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;QAEjD,IAAI,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC;YAC1B,OAAO,KAAK,CAAC;QAEf,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAEzB,OAAO,IAAI,CAAC;IACd,CAAC;IAEM,OAAO,CAAC,IAAU;QAEvB,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxB,CAAC;IAED;;;OAGG;IACI,cAAc,CAAC,WAAmB,EAAE,WAAmB;QAC5D,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;QAEjD,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC;YAC3B,OAAO,KAAK,CAAC;QAEf,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAE5B,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACI,cAAc,CAAC,WAAmB,EAAE,WAAmB;QAC5D,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;QACjD,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC;YAC3B,OAAO,KAAK,CAAC;QAEf,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC5B,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,OAAO,CAAC,GAAW,EAAE,KAAa;QACxC,OAAO,GAAG,gBAAgB,CAAC,GAAG,CAAC,KAAK,gBAAgB,CAAC,KAAK,CAAC,EAAE,CAAC;IAChE,CAAC;CACF"}

package/dist/model/Line.d.ts

@@ -0,0 +1,12 @@
+export declare class Line {
+    readonly signal: string;
+    readonly text: string;
+    constructor(signal: string, text: string);
+    static parse(rawLine: string): Line;
+    static splitSignal(rawLine: string): {
+        signal: string;
+        text: string;
+    };
+    private static isCommandPunct;
+}
+//# sourceMappingURL=Line.d.ts.map

package/dist/model/Line.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Line.d.ts","sourceRoot":"","sources":["../../src/model/Line.ts"],"names":[],"mappings":"AAeA,qBAAa,IAAI;IACf,SAAgB,MAAM,EAAE,MAAM,CAAC;IAC/B,SAAgB,IAAI,EAAE,MAAM,CAAC;gBAEV,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM;WAUjC,KAAK,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI;WAQ5B,WAAW,CAAC,OAAO,EAAE,MAAM,GAAG;QAAE,MAAM,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE;IAuB5E,OAAO,CAAC,MAAM,CAAC,cAAc;CAc9B"}