@cristianormazabal/triton-core 0.1.0 → 0.1.2

package/dist/diagrams/triton/ds/struct/shared.js

@@ -0,0 +1,60 @@
+/**
+ * @file diagrams/struct/shared.ts — Shared helpers for the strip/memory family.
+ */
+export const ARROW_ID = 'struct-arrow';
+/** A small filled arrowhead marker def in the given colour. */
+export function arrowDef(color) {
+    return `<marker id="${ARROW_ID}" markerWidth="8" markerHeight="8" refX="7" refY="4" orient="auto"><path d="M0 0 L8 4 L0 8 z" fill="${color}" /></marker>`;
+}
+/** Tokens on the keyword line and directive lines, trimmed and split. */
+export function lines(input) {
+    return input.split(/\r?\n/).map(l => l.trim()).filter(Boolean);
+}
+/**
+ * Split a directive line into bare tokens and double-quoted tokens.
+ *
+ * Quoted tokens support only `\"` and `\\` escapes and cannot span lines.
+ * Full-line comment handling remains centralized before diagram parsers run;
+ * this tokenizer intentionally does not strip inline `%%` text.
+ */
+export function tokenizeDirective(line) {
+    const tokens = [];
+    let i = 0;
+    while (i < line.length) {
+        while (i < line.length && /\s/.test(line[i]))
+            i++;
+        if (i >= line.length)
+            break;
+        if (line[i] === '"') {
+            i++;
+            let value = '';
+            while (i < line.length) {
+                const ch = line[i];
+                if (ch === '"') {
+                    i++;
+                    break;
+                }
+                if (ch === '\\') {
+                    const next = line[i + 1];
+                    if (next === '"' || next === '\\') {
+                        value += next;
+                        i += 2;
+                        continue;
+                    }
+                }
+                value += ch;
+                i++;
+            }
+            if (line[i - 1] !== '"')
+                throw new Error(`Unterminated quoted string: ${line}`);
+            tokens.push(value);
+            continue;
+        }
+        const start = i;
+        while (i < line.length && !/\s/.test(line[i]))
+            i++;
+        tokens.push(line.slice(start, i));
+    }
+    return tokens;
+}
+//# sourceMappingURL=shared.js.map

package/dist/diagrams/triton/ds/struct/shared.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"shared.js","sourceRoot":"","sources":["../../../../../../../src/diagrams/triton/ds/struct/shared.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,MAAM,CAAC,MAAM,QAAQ,GAAG,cAAc,CAAC;AAEvC,+DAA+D;AAC/D,MAAM,UAAU,QAAQ,CAAC,KAAa;IACpC,OAAO,eAAe,QAAQ,uGAAuG,KAAK,eAAe,CAAC;AAC5J,CAAC;AAED,yEAAyE;AACzE,MAAM,UAAU,KAAK,CAAC,KAAa;IACjC,OAAO,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;AACjE,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAAC,IAAY;IAC5C,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,IAAI,CAAC,GAAG,CAAC,CAAC;IAEV,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QACvB,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;YAAE,CAAC,EAAE,CAAC;QACnD,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM;YAAE,MAAM;QAE5B,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;YACpB,CAAC,EAAE,CAAC;YACJ,IAAI,KAAK,GAAG,EAAE,CAAC;YACf,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;gBACvB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAE,CAAC;gBACpB,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;oBACf,CAAC,EAAE,CAAC;oBACJ,MAAM;gBACR,CAAC;gBACD,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;oBAChB,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;oBACzB,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;wBAClC,KAAK,IAAI,IAAI,CAAC;wBACd,CAAC,IAAI,CAAC,CAAC;wBACP,SAAS;oBACX,CAAC;gBACH,CAAC;gBACD,KAAK,IAAI,EAAE,CAAC;gBACZ,CAAC,EAAE,CAAC;YACN,CAAC;YACD,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG;gBAAE,MAAM,IAAI,KAAK,CAAC,+BAA+B,IAAI,EAAE,CAAC,CAAC;YAChF,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnB,SAAS;QACX,CAAC;QAED,MAAM,KAAK,GAAG,CAAC,CAAC;QAChB,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE,CAAC;YAAE,CAAC,EAAE,CAAC;QACpD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/diagrams/{ds → triton/ds}/tree/avl.d.ts

@@ -6,7 +6,7 @@
  * node per key with its balance-factor badge. The structure is always valid by
  * construction — you cannot author an unbalanced AVL tree.
  */
-import type { DiagramModule } from '../../../contracts/index.js';
+import type { DiagramModule } from '../../../../contracts/index.js';
 import type { TreeDocument } from './ir.js';
 /** Build a valid AVL tree IR from the integers in the source. */
 export declare function buildAvl(input: string): TreeDocument;

package/dist/diagrams/triton/ds/tree/avl.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"avl.d.ts","sourceRoot":"","sources":["../../../../../../../src/diagrams/triton/ds/tree/avl.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,aAAa,EAA+B,MAAM,gCAAgC,CAAC;AACjG,OAAO,KAAK,EAAE,YAAY,EAAY,MAAM,SAAS,CAAC;AAsCtD,iEAAiE;AACjE,wBAAgB,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,YAAY,CAkBpD;AAED,eAAO,MAAM,GAAG,EAAE,aAAa,CAAC,YAAY,CAU3C,CAAC"}

package/dist/diagrams/triton/ds/tree/avl.js

@@ -0,0 +1,87 @@
+/**
+ * @file diagrams/tree/avl.ts — AVL-tree front-end over the tree engine.
+ *
+ * Value-driven: the source is a list of integers (`avl insert 50 30 70 …`); the
+ * builder performs real BST insertion with AVL rotations and emits one circle
+ * node per key with its balance-factor badge. The structure is always valid by
+ * construction — you cannot author an unbalanced AVL tree.
+ */
+import { layoutTree } from './layout.js';
+const h = (n) => (n ? n.height : 0);
+const upd = (n) => { n.height = 1 + Math.max(h(n.left), h(n.right)); };
+const bf = (n) => h(n.left) - h(n.right);
+function rotateRight(y) {
+    const x = y.left;
+    y.left = x.right;
+    x.right = y;
+    upd(y);
+    upd(x);
+    return x;
+}
+function rotateLeft(x) {
+    const y = x.right;
+    x.right = y.left;
+    y.left = x;
+    upd(x);
+    upd(y);
+    return y;
+}
+function insert(node, key) {
+    if (!node)
+        return { key, left: null, right: null, height: 1 };
+    if (key < node.key)
+        node.left = insert(node.left, key);
+    else if (key > node.key)
+        node.right = insert(node.right, key);
+    else
+        return node; // ignore duplicates
+    upd(node);
+    const balance = bf(node);
+    if (balance > 1 && key < node.left.key)
+        return rotateRight(node);
+    if (balance < -1 && key > node.right.key)
+        return rotateLeft(node);
+    if (balance > 1 && key > node.left.key) {
+        node.left = rotateLeft(node.left);
+        return rotateRight(node);
+    }
+    if (balance < -1 && key < node.right.key) {
+        node.right = rotateRight(node.right);
+        return rotateLeft(node);
+    }
+    return node;
+}
+/** Build a valid AVL tree IR from the integers in the source. */
+export function buildAvl(input) {
+    const keys = (input.match(/-?\d+/g) ?? []).map(Number);
+    let root = null;
+    for (const k of keys)
+        root = insert(root, k);
+    const nodes = [];
+    let i = 0;
+    const emit = (n) => {
+        const id = `n${i++}`;
+        const children = [];
+        nodes.push({ id, label: String(n.key), kinds: ['circle'], badge: String(bf(n)), children });
+        if (n.left)
+            children.push(emit(n.left));
+        if (n.right)
+            children.push(emit(n.right));
+        return id;
+    };
+    if (root)
+        emit(root);
+    return { version: '1.0', metadata: {}, direction: 'TB', nodes };
+}
+export const avl = {
+    parseMermaid(input) {
+        return buildAvl(input);
+    },
+    parseYaml(input) {
+        return JSON.parse(input);
+    },
+    layout(ir, theme) {
+        return layoutTree(ir, theme);
+    },
+};
+//# sourceMappingURL=avl.js.map

package/dist/diagrams/triton/ds/tree/avl.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"avl.js","sourceRoot":"","sources":["../../../../../../../src/diagrams/triton/ds/tree/avl.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAIH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAIzC,MAAM,CAAC,GAAG,CAAC,CAAiB,EAAU,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC5D,MAAM,GAAG,GAAG,CAAC,CAAU,EAAQ,EAAE,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACtF,MAAM,EAAE,GAAG,CAAC,CAAU,EAAU,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;AAE1D,SAAS,WAAW,CAAC,CAAU;IAC7B,MAAM,CAAC,GAAG,CAAC,CAAC,IAAK,CAAC;IAClB,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC;IACjB,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC;IACZ,GAAG,CAAC,CAAC,CAAC,CAAC;IAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACf,OAAO,CAAC,CAAC;AACX,CAAC;AACD,SAAS,UAAU,CAAC,CAAU;IAC5B,MAAM,CAAC,GAAG,CAAC,CAAC,KAAM,CAAC;IACnB,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC;IACjB,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;IACX,GAAG,CAAC,CAAC,CAAC,CAAC;IAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACf,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,MAAM,CAAC,IAAoB,EAAE,GAAW;IAC/C,IAAI,CAAC,IAAI;QAAE,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;IAC9D,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG;QAAE,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;SAClD,IAAI,GAAG,GAAG,IAAI,CAAC,GAAG;QAAE,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;;QACzD,OAAO,IAAI,CAAC,CAAC,oBAAoB;IACtC,GAAG,CAAC,IAAI,CAAC,CAAC;IACV,MAAM,OAAO,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;IACzB,IAAI,OAAO,GAAG,CAAC,IAAI,GAAG,GAAG,IAAI,CAAC,IAAK,CAAC,GAAG;QAAE,OAAO,WAAW,CAAC,IAAI,CAAC,CAAC;IAClE,IAAI,OAAO,GAAG,CAAC,CAAC,IAAI,GAAG,GAAG,IAAI,CAAC,KAAM,CAAC,GAAG;QAAE,OAAO,UAAU,CAAC,IAAI,CAAC,CAAC;IACnE,IAAI,OAAO,GAAG,CAAC,IAAI,GAAG,GAAG,IAAI,CAAC,IAAK,CAAC,GAAG,EAAE,CAAC;QAAC,IAAI,CAAC,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,IAAK,CAAC,CAAC;QAAC,OAAO,WAAW,CAAC,IAAI,CAAC,CAAC;IAAC,CAAC;IAC1G,IAAI,OAAO,GAAG,CAAC,CAAC,IAAI,GAAG,GAAG,IAAI,CAAC,KAAM,CAAC,GAAG,EAAE,CAAC;QAAC,IAAI,CAAC,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,KAAM,CAAC,CAAC;QAAC,OAAO,UAAU,CAAC,IAAI,CAAC,CAAC;IAAC,CAAC;IAC9G,OAAO,IAAI,CAAC;AACd,CAAC;AAED,iEAAiE;AACjE,MAAM,UAAU,QAAQ,CAAC,KAAa;IACpC,MAAM,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACvD,IAAI,IAAI,GAAmB,IAAI,CAAC;IAChC,KAAK,MAAM,CAAC,IAAI,IAAI;QAAE,IAAI,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAE7C,MAAM,KAAK,GAAe,EAAE,CAAC;IAC7B,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,MAAM,IAAI,GAAG,CAAC,CAAU,EAAU,EAAE;QAClC,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,EAAE,CAAC;QACrB,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC;QAC5F,IAAI,CAAC,CAAC,IAAI;YAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACxC,IAAI,CAAC,CAAC,KAAK;YAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC1C,OAAO,EAAE,CAAC;IACZ,CAAC,CAAC;IACF,IAAI,IAAI;QAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IAErB,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AAClE,CAAC;AAED,MAAM,CAAC,MAAM,GAAG,GAAgC;IAC9C,YAAY,CAAC,KAAa;QACxB,OAAO,QAAQ,CAAC,KAAK,CAAC,CAAC;IACzB,CAAC;IACD,SAAS,CAAC,KAAa;QACrB,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAiB,CAAC;IAC3C,CAAC;IACD,MAAM,CAAC,EAAgB,EAAE,KAAoB;QAC3C,OAAO,UAAU,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IAC/B,CAAC;CACF,CAAC"}

package/dist/diagrams/{ds → triton/ds}/tree/btree.d.ts

@@ -5,7 +5,7 @@
  * with node splitting and emits multi-key strip nodes. Structure is valid by
  * construction (every non-root node holds between ⌈order/2⌉−1 and order−1 keys).
  */
-import type { DiagramModule } from '../../../contracts/index.js';
+import type { DiagramModule } from '../../../../contracts/index.js';
 import type { TreeDocument } from './ir.js';
 export declare function buildBtree(input: string): TreeDocument;
 export declare const btree: DiagramModule<TreeDocument>;

package/dist/diagrams/triton/ds/tree/btree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"btree.d.ts","sourceRoot":"","sources":["../../../../../../../src/diagrams/triton/ds/tree/btree.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,aAAa,EAA+B,MAAM,gCAAgC,CAAC;AACjG,OAAO,KAAK,EAAE,YAAY,EAAY,MAAM,SAAS,CAAC;AAwCtD,wBAAgB,UAAU,CAAC,KAAK,EAAE,MAAM,GAAG,YAAY,CAwBtD;AAED,eAAO,MAAM,KAAK,EAAE,aAAa,CAAC,YAAY,CAI7C,CAAC"}

package/dist/diagrams/triton/ds/tree/btree.js

@@ -0,0 +1,76 @@
+/**
+ * @file diagrams/tree/btree.ts — B-tree front-end over the tree engine.
+ *
+ * Value-driven: `btree order 3 insert 10 20 …` performs real B-tree insertion
+ * with node splitting and emits multi-key strip nodes. Structure is valid by
+ * construction (every non-root node holds between ⌈order/2⌉−1 and order−1 keys).
+ */
+import { layoutTree } from './layout.js';
+/** Insert into a subtree; return a Split if this node overflowed and divided. */
+function insertRec(node, key, order) {
+    if (node.leaf) {
+        let i = node.keys.length - 1;
+        while (i >= 0 && key < node.keys[i])
+            i--;
+        if (i >= 0 && node.keys[i] === key)
+            return null; // dup
+        node.keys.splice(i + 1, 0, key);
+    }
+    else {
+        let i = node.keys.length - 1;
+        while (i >= 0 && key < node.keys[i])
+            i--;
+        if (i >= 0 && node.keys[i] === key)
+            return null; // dup
+        i++;
+        const split = insertRec(node.children[i], key, order);
+        if (split) {
+            node.keys.splice(i, 0, split.up);
+            node.children.splice(i + 1, 0, split.right);
+        }
+    }
+    if (node.keys.length <= order - 1)
+        return null;
+    // overflow: divide around the median
+    const mid = node.keys.length >> 1;
+    const up = node.keys[mid];
+    const right = {
+        keys: node.keys.slice(mid + 1),
+        children: node.leaf ? [] : node.children.slice(mid + 1),
+        leaf: node.leaf,
+    };
+    node.keys = node.keys.slice(0, mid);
+    node.children = node.leaf ? [] : node.children.slice(0, mid + 1);
+    return { up, right };
+}
+export function buildBtree(input) {
+    const orderMatch = input.match(/order\s+(\d+)/i);
+    const order = Math.max(3, orderMatch ? Number(orderMatch[1]) : 3);
+    const afterOrder = input.replace(/order\s+\d+/i, '');
+    const keys = (afterOrder.match(/-?\d+/g) ?? []).map(Number);
+    let root = { keys: [], children: [], leaf: true };
+    for (const k of keys) {
+        const split = insertRec(root, k, order);
+        if (split)
+            root = { keys: [split.up], children: [root, split.right], leaf: false };
+    }
+    const nodes = [];
+    let i = 0;
+    const emit = (n) => {
+        const id = `n${i++}`;
+        const children = [];
+        nodes.push({ id, label: n.keys.join(' | '), kinds: ['strip'], children });
+        for (const c of n.children)
+            children.push(emit(c));
+        return id;
+    };
+    if (root.keys.length > 0 || root.children.length > 0)
+        emit(root);
+    return { version: '1.0', metadata: {}, direction: 'TB', nodes };
+}
+export const btree = {
+    parseMermaid: buildBtree,
+    parseYaml: (input) => JSON.parse(input),
+    layout: (ir, theme) => layoutTree(ir, theme),
+};
+//# sourceMappingURL=btree.js.map

package/dist/diagrams/triton/ds/tree/btree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"btree.js","sourceRoot":"","sources":["../../../../../../../src/diagrams/triton/ds/tree/btree.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAIH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAMzC,iFAAiF;AACjF,SAAS,SAAS,CAAC,IAAW,EAAE,GAAW,EAAE,KAAa;IACxD,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;QACd,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAC7B,OAAO,CAAC,IAAI,CAAC,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE;YAAE,CAAC,EAAE,CAAC;QAC1C,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG;YAAE,OAAO,IAAI,CAAC,CAAC,MAAM;QACvD,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;IAClC,CAAC;SAAM,CAAC;QACN,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAC7B,OAAO,CAAC,IAAI,CAAC,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAE;YAAE,CAAC,EAAE,CAAC;QAC1C,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG;YAAE,OAAO,IAAI,CAAC,CAAC,MAAM;QACvD,CAAC,EAAE,CAAC;QACJ,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAE,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;QACvD,IAAI,KAAK,EAAE,CAAC;YACV,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;YACjC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;QAC9C,CAAC;IACH,CAAC;IACD,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,KAAK,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAE/C,qCAAqC;IACrC,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;IAClC,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAE,CAAC;IAC3B,MAAM,KAAK,GAAU;QACnB,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC;QAC9B,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC;QACvD,IAAI,EAAE,IAAI,CAAC,IAAI;KAChB,CAAC;IACF,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACpC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;IACjE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC;AACvB,CAAC;AAED,MAAM,UAAU,UAAU,CAAC,KAAa;IACtC,MAAM,UAAU,GAAG,KAAK,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC;IACjD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAClE,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC;IACrD,MAAM,IAAI,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAE5D,IAAI,IAAI,GAAU,EAAE,IAAI,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;IACzD,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QACxC,IAAI,KAAK;YAAE,IAAI,GAAG,EAAE,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;IACrF,CAAC;IAED,MAAM,KAAK,GAAe,EAAE,CAAC;IAC7B,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,MAAM,IAAI,GAAG,CAAC,CAAQ,EAAU,EAAE;QAChC,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,EAAE,CAAC;QACrB,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,CAAC,OAAO,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC;QAC1E,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,QAAQ;YAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACnD,OAAO,EAAE,CAAC;IACZ,CAAC,CAAC;IACF,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC;QAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IAEjE,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AAClE,CAAC;AAED,MAAM,CAAC,MAAM,KAAK,GAAgC;IAChD,YAAY,EAAE,UAAU;IACxB,SAAS,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAiB;IACvD,MAAM,EAAE,CAAC,EAAgB,EAAE,KAAoB,EAAgB,EAAE,CAAC,UAAU,CAAC,EAAE,EAAE,KAAK,CAAC;CACxF,CAAC"}

package/dist/diagrams/triton/ds/tree/build.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"build.d.ts","sourceRoot":"","sources":["../../../../../../../src/diagrams/triton/ds/tree/build.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAIH,MAAM,WAAW,OAAO;IACtB,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAC/B,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,UAAU;IACzB,OAAO,EAAE,MAAM,CAAC;IAChB,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;IAClC,SAAS,EAAE,IAAI,GAAG,IAAI,CAAC;IACvB,KAAK,EAAE,OAAO,EAAE,CAAC;CAClB;AAED,iFAAiF;AACjF,MAAM,WAAW,eAAe;IAC9B,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,wBAAgB,UAAU,CAAC,KAAK,EAAE,MAAM,GAAG,UAAU,CAEpD;AAED,6EAA6E;AAC7E,wBAAgB,UAAU,CAAC,KAAK,EAAE,SAAS,OAAO,EAAE,GAAG,eAAe,EAAE,CAiCvE"}

package/dist/diagrams/triton/ds/tree/build.js

@@ -0,0 +1,51 @@
+/**
+ * @file diagrams/tree/build.ts — Shared parsing helpers for the tree family.
+ *
+ * The indentation grammar (shared by `tree` and `plan`) is parsed here and the
+ * raw lines are folded into a child-linked node list. Semantic front-ends
+ * (plan) reuse this; value-driven front-ends (avl, …) build nodes directly.
+ */
+import * as parser from './parser.js';
+export function parseLines(input) {
+    return parser.parse(input);
+}
+/** Fold indentation-nested raw lines into a flat, child-linked node list. */
+export function buildNodes(lines) {
+    const nodes = [];
+    const byId = new Map();
+    const stack = [];
+    lines.forEach((ln, i) => {
+        const id = `n${i}`;
+        while (stack.length > 0 && stack[stack.length - 1].indent >= ln.indent)
+            stack.pop();
+        const parent = stack.length > 0 ? stack[stack.length - 1] : undefined;
+        const kinds = [...ln.kinds];
+        const infoParts = [];
+        let badge;
+        for (const [k, v] of Object.entries(ln.attrs ?? {})) {
+            if (v === true) {
+                kinds.push(k);
+                continue;
+            }
+            if (k === 'badge') {
+                badge = String(v);
+                continue;
+            }
+            infoParts.push(k === 'sub' || k === 'info' ? String(v) : `${k}: ${v}`);
+        }
+        const info = infoParts.length > 0 ? infoParts.join(' · ') : undefined;
+        const node = {
+            id, label: ln.label, kinds, children: [],
+            ...(info !== undefined ? { info } : {}),
+            ...(badge !== undefined ? { badge } : {}),
+            ...(ln.edgeLabel !== undefined ? { edgeLabel: ln.edgeLabel } : {}),
+        };
+        nodes.push(node);
+        byId.set(id, node);
+        if (parent)
+            byId.get(parent.id).children.push(id);
+        stack.push({ indent: ln.indent, id });
+    });
+    return nodes;
+}
+//# sourceMappingURL=build.js.map

package/dist/diagrams/triton/ds/tree/build.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"build.js","sourceRoot":"","sources":["../../../../../../../src/diagrams/triton/ds/tree/build.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,MAAM,MAAM,aAAa,CAAC;AA4BtC,MAAM,UAAU,UAAU,CAAC,KAAa;IACtC,OAAO,MAAM,CAAC,KAAK,CAAC,KAAK,CAAe,CAAC;AAC3C,CAAC;AAED,6EAA6E;AAC7E,MAAM,UAAU,UAAU,CAAC,KAAyB;IAClD,MAAM,KAAK,GAAsB,EAAE,CAAC;IACpC,MAAM,IAAI,GAAG,IAAI,GAAG,EAA2B,CAAC;IAChD,MAAM,KAAK,GAAqC,EAAE,CAAC;IAEnD,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE;QACtB,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;QACnB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC,MAAM,IAAI,EAAE,CAAC,MAAM;YAAE,KAAK,CAAC,GAAG,EAAE,CAAC;QACrF,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAEtE,MAAM,KAAK,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;QAC5B,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,IAAI,KAAyB,CAAC;QAC9B,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,EAAE,CAAC;YACpD,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;gBAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAAC,SAAS;YAAC,CAAC;YAC5C,IAAI,CAAC,KAAK,OAAO,EAAE,CAAC;gBAAC,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBAAC,SAAS;YAAC,CAAC;YACnD,SAAS,CAAC,IAAI,CAAC,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACzE,CAAC;QACD,MAAM,IAAI,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAEtE,MAAM,IAAI,GAAoB;YAC5B,EAAE,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE;YACxC,GAAG,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACvC,GAAG,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACzC,GAAG,CAAC,EAAE,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,EAAE,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACnE,CAAC;QACF,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACnB,IAAI,MAAM;YAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACnD,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/diagrams/{ds → triton/ds}/tree/heap.d.ts

@@ -5,7 +5,7 @@
  * default, `min` supported) with real sift-up, then renders the implicit tree
  * (children of i are 2i+1, 2i+2) as circle nodes.
  */
-import type { DiagramModule } from '../../../contracts/index.js';
+import type { DiagramModule } from '../../../../contracts/index.js';
 import type { TreeDocument } from './ir.js';
 export declare function buildHeap(input: string): TreeDocument;
 export declare const heap: DiagramModule<TreeDocument>;

package/dist/diagrams/triton/ds/tree/heap.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"heap.d.ts","sourceRoot":"","sources":["../../../../../../../src/diagrams/triton/ds/tree/heap.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,aAAa,EAA+B,MAAM,gCAAgC,CAAC;AACjG,OAAO,KAAK,EAAE,YAAY,EAAY,MAAM,SAAS,CAAC;AAGtD,wBAAgB,SAAS,CAAC,KAAK,EAAE,MAAM,GAAG,YAAY,CA+BrD;AAED,eAAO,MAAM,IAAI,EAAE,aAAa,CAAC,YAAY,CAI5C,CAAC"}

package/dist/diagrams/triton/ds/tree/heap.js

@@ -0,0 +1,48 @@
+/**
+ * @file diagrams/tree/heap.ts — Binary-heap front-end over the tree engine.
+ *
+ * Value-driven: `heap max insert 50 30 70 …` builds a binary heap (max by
+ * default, `min` supported) with real sift-up, then renders the implicit tree
+ * (children of i are 2i+1, 2i+2) as circle nodes.
+ */
+import { layoutTree } from './layout.js';
+export function buildHeap(input) {
+    const isMin = /\bmin\b/i.test(input);
+    const keys = (input.match(/-?\d+/g) ?? []).map(Number);
+    const higher = (a, b) => (isMin ? a < b : a > b);
+    const heap = [];
+    for (const k of keys) {
+        heap.push(k);
+        let i = heap.length - 1;
+        while (i > 0) {
+            const parent = (i - 1) >> 1;
+            if (higher(heap[i], heap[parent])) {
+                [heap[i], heap[parent]] = [heap[parent], heap[i]];
+                i = parent;
+            }
+            else
+                break;
+        }
+    }
+    const nodes = [];
+    const emit = (idx) => {
+        const id = `n${idx}`;
+        const children = [];
+        nodes.push({ id, label: String(heap[idx]), kinds: ['circle'], children });
+        const l = 2 * idx + 1, r = 2 * idx + 2;
+        if (l < heap.length)
+            children.push(emit(l));
+        if (r < heap.length)
+            children.push(emit(r));
+        return id;
+    };
+    if (heap.length > 0)
+        emit(0);
+    return { version: '1.0', metadata: {}, direction: 'TB', nodes };
+}
+export const heap = {
+    parseMermaid: buildHeap,
+    parseYaml: (input) => JSON.parse(input),
+    layout: (ir, theme) => layoutTree(ir, theme),
+};
+//# sourceMappingURL=heap.js.map

package/dist/diagrams/triton/ds/tree/heap.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"heap.js","sourceRoot":"","sources":["../../../../../../../src/diagrams/triton/ds/tree/heap.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAIH,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEzC,MAAM,UAAU,SAAS,CAAC,KAAa;IACrC,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,MAAM,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACvD,MAAM,MAAM,GAAG,CAAC,CAAS,EAAE,CAAS,EAAW,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAE1E,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACb,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QACxB,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACb,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;YAC5B,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAE,EAAE,IAAI,CAAC,MAAM,CAAE,CAAC,EAAE,CAAC;gBACpC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAE,EAAE,IAAI,CAAC,CAAC,CAAE,CAAC,CAAC;gBACpD,CAAC,GAAG,MAAM,CAAC;YACb,CAAC;;gBAAM,MAAM;QACf,CAAC;IACH,CAAC;IAED,MAAM,KAAK,GAAe,EAAE,CAAC;IAC7B,MAAM,IAAI,GAAG,CAAC,GAAW,EAAU,EAAE;QACnC,MAAM,EAAE,GAAG,IAAI,GAAG,EAAE,CAAC;QACrB,MAAM,QAAQ,GAAa,EAAE,CAAC;QAC9B,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC;QAC1E,MAAM,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC;QACvC,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM;YAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM;YAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,OAAO,EAAE,CAAC;IACZ,CAAC,CAAC;IACF,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;QAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IAE7B,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AAClE,CAAC;AAED,MAAM,CAAC,MAAM,IAAI,GAAgC;IAC/C,YAAY,EAAE,SAAS;IACvB,SAAS,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAiB;IACvD,MAAM,EAAE,CAAC,EAAgB,EAAE,KAAoB,EAAgB,EAAE,CAAC,UAAU,CAAC,EAAE,EAAE,KAAK,CAAC;CACxF,CAAC"}

package/dist/diagrams/{ds → triton/ds}/tree/index.d.ts

@@ -1,4 +1,4 @@
-import type { DiagramModule } from '../../../contracts/index.js';
+import type { DiagramModule } from '../../../../contracts/index.js';
 import type { TreeDocument } from './ir.js';
 export type { TreeDocument, TreeNode, TreeDirection } from './ir.js';
 export declare const tree: DiagramModule<TreeDocument>;

package/dist/diagrams/triton/ds/tree/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../../../../src/diagrams/triton/ds/tree/index.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAA+B,MAAM,gCAAgC,CAAC;AACjG,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAI5C,YAAY,EAAE,YAAY,EAAE,QAAQ,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AAErE,eAAO,MAAM,IAAI,EAAE,aAAa,CAAC,YAAY,CAkB5C,CAAC"}

package/dist/diagrams/triton/ds/tree/index.js

@@ -0,0 +1,20 @@
+import { layoutTree } from './layout.js';
+import { parseLines, buildNodes } from './build.js';
+export const tree = {
+    parseMermaid(input) {
+        const raw = parseLines(input);
+        return {
+            version: raw.version,
+            metadata: raw.metadata ?? {},
+            direction: raw.direction,
+            nodes: buildNodes(raw.lines),
+        };
+    },
+    parseYaml(input) {
+        return JSON.parse(input);
+    },
+    layout(ir, theme) {
+        return layoutTree(ir, theme);
+    },
+};
+//# sourceMappingURL=index.js.map

package/dist/diagrams/triton/ds/tree/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../../../../src/diagrams/triton/ds/tree/index.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAIpD,MAAM,CAAC,MAAM,IAAI,GAAgC;IAC/C,YAAY,CAAC,KAAa;QACxB,MAAM,GAAG,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;QAC9B,OAAO;YACL,OAAO,EAAE,GAAG,CAAC,OAAO;YACpB,QAAQ,EAAE,GAAG,CAAC,QAAQ,IAAI,EAAE;YAC5B,SAAS,EAAE,GAAG,CAAC,SAAS;YACxB,KAAK,EAAE,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC;SAC7B,CAAC;IACJ,CAAC;IAED,SAAS,CAAC,KAAa;QACrB,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAiB,CAAC;IAC3C,CAAC;IAED,MAAM,CAAC,EAAgB,EAAE,KAAoB;QAC3C,OAAO,UAAU,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IAC/B,CAAC;CACF,CAAC"}

package/dist/diagrams/{ds → triton/ds}/tree/ir.d.ts

@@ -6,7 +6,7 @@
  * front-ends (avl, rbtree, btree, radix, segtree, heap, plan) all compile
  * down to this IR.
  */
-import type { BaseIR } from '../../../contracts/index.js';
+import type { BaseIR } from '../../../../contracts/index.js';
 export type TreeDirection = 'TB' | 'LR';
 export interface TreeNode {
     readonly id: string;

package/dist/diagrams/triton/ds/tree/ir.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ir.d.ts","sourceRoot":"","sources":["../../../../../../../src/diagrams/triton/ds/tree/ir.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,gCAAgC,CAAC;AAE7D,MAAM,MAAM,aAAa,GAAG,IAAI,GAAG,IAAI,CAAC;AAExC,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,8EAA8E;IAC9E,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC,kEAAkE;IAClE,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC;IACvB,uDAAuD;IACvD,QAAQ,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC;IACxB,qEAAqE;IACrE,QAAQ,CAAC,SAAS,CAAC,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,CAAC;CACtC;AAED,MAAM,WAAW,YAAa,SAAQ,MAAM;IAC1C,QAAQ,CAAC,SAAS,EAAE,aAAa,CAAC;IAClC,4EAA4E;IAC5E,QAAQ,CAAC,KAAK,EAAE,SAAS,QAAQ,EAAE,CAAC;CACrC"}

package/dist/diagrams/triton/ds/tree/ir.js

@@ -0,0 +1,10 @@
+/**
+ * @file diagrams/tree/ir.ts — Decorated tree IR.
+ *
+ * One generic hierarchy whose nodes carry a small decoration vocabulary
+ * (kinds → shape/colour, badge, info sub-line, edge label). The semantic
+ * front-ends (avl, rbtree, btree, radix, segtree, heap, plan) all compile
+ * down to this IR.
+ */
+export {};
+//# sourceMappingURL=ir.js.map

package/dist/diagrams/triton/ds/tree/ir.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ir.js","sourceRoot":"","sources":["../../../../../../../src/diagrams/triton/ds/tree/ir.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG"}

package/dist/diagrams/{ds → triton/ds}/tree/layout.d.ts

@@ -8,6 +8,6 @@
  * linkable inside posters.
  */
 import type { TreeDocument } from './ir.js';
-import type { LayoutResult, ResolvedTheme } from '../../../contracts/index.js';
+import type { LayoutResult, ResolvedTheme } from '../../../../contracts/index.js';
 export declare function layoutTree(ir: TreeDocument, theme: ResolvedTheme): LayoutResult;
 //# sourceMappingURL=layout.d.ts.map

package/dist/diagrams/triton/ds/tree/layout.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"layout.d.ts","sourceRoot":"","sources":["../../../../../../../src/diagrams/triton/ds/tree/layout.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,YAAY,EAAY,MAAM,SAAS,CAAC;AACtD,OAAO,KAAK,EACW,YAAY,EAAsB,aAAa,EACrE,MAAM,gCAAgC,CAAC;AAqKxC,wBAAgB,UAAU,CAAC,EAAE,EAAE,YAAY,EAAE,KAAK,EAAE,aAAa,GAAG,YAAY,CAsH/E"}