schematex 0.4.2 → 0.5.0

package/dist/chunk-PIV2A3HG.js

@@ -0,0 +1,55 @@
+// src/core/dsl-suggest.ts
+function distance(a, b, cap) {
+  if (a === b) return 0;
+  if (Math.abs(a.length - b.length) > cap) return cap + 1;
+  const al = a.length;
+  const bl = b.length;
+  const prev = new Array(bl + 1);
+  const curr = new Array(bl + 1);
+  for (let j = 0; j <= bl; j++) prev[j] = j;
+  for (let i = 1; i <= al; i++) {
+    curr[0] = i;
+    let rowMin = i;
+    for (let j = 1; j <= bl; j++) {
+      const cost = a[i - 1] === b[j - 1] ? 0 : 1;
+      curr[j] = Math.min(
+        prev[j] + 1,
+        // deletion
+        curr[j - 1] + 1,
+        // insertion
+        prev[j - 1] + cost
+        // substitution
+      );
+      if (curr[j] < rowMin) rowMin = curr[j];
+    }
+    if (rowMin > cap) return cap + 1;
+    for (let j = 0; j <= bl; j++) prev[j] = curr[j];
+  }
+  return prev[bl];
+}
+function suggestKeyword(input, candidates) {
+  const needle = input.toLowerCase();
+  let best = null;
+  let secondBest = Infinity;
+  for (const c of candidates) {
+    const d = distance(needle, c.toLowerCase(), 2);
+    if (d > 2) continue;
+    if (best === null || d < best.dist) {
+      secondBest = best?.dist ?? Infinity;
+      best = { word: c, dist: d };
+    } else if (d < secondBest) {
+      secondBest = d;
+    }
+  }
+  if (best === null) return null;
+  if (secondBest <= best.dist) return null;
+  return best.word;
+}
+function didYouMean(input, candidates) {
+  const s = suggestKeyword(input, candidates);
+  return s ? ` (did you mean '${s}'?)` : "";
+}
+
+export { didYouMean };
+//# sourceMappingURL=chunk-PIV2A3HG.js.map
+//# sourceMappingURL=chunk-PIV2A3HG.js.map

package/dist/chunk-PIV2A3HG.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/core/dsl-suggest.ts"],"names":[],"mappings":";AAgBA,SAAS,QAAA,CAAS,CAAA,EAAW,CAAA,EAAW,GAAA,EAAqB;AAC3D,EAAA,IAAI,CAAA,KAAM,GAAG,OAAO,CAAA;AACpB,EAAA,IAAI,IAAA,CAAK,IAAI,CAAA,CAAE,MAAA,GAAS,EAAE,MAAM,CAAA,GAAI,GAAA,EAAK,OAAO,GAAA,GAAM,CAAA;AACtD,EAAA,MAAM,KAAK,CAAA,CAAE,MAAA;AACb,EAAA,MAAM,KAAK,CAAA,CAAE,MAAA;AAEb,EAAA,MAAM,IAAA,GAAO,IAAI,KAAA,CAAc,EAAA,GAAK,CAAC,CAAA;AACrC,EAAA,MAAM,IAAA,GAAO,IAAI,KAAA,CAAc,EAAA,GAAK,CAAC,CAAA;AACrC,EAAA,KAAA,IAAS,IAAI,CAAA,EAAG,CAAA,IAAK,IAAI,CAAA,EAAA,EAAK,IAAA,CAAK,CAAC,CAAA,GAAI,CAAA;AACxC,EAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,IAAK,EAAA,EAAI,CAAA,EAAA,EAAK;AAC5B,IAAA,IAAA,CAAK,CAAC,CAAA,GAAI,CAAA;AACV,IAAA,IAAI,MAAA,GAAS,CAAA;AACb,IAAA,KAAA,IAAS,CAAA,GAAI,CAAA,EAAG,CAAA,IAAK,EAAA,EAAI,CAAA,EAAA,EAAK;AAC5B,MAAA,MAAM,IAAA,GAAO,EAAE,CAAA,GAAI,CAAC,MAAM,CAAA,CAAE,CAAA,GAAI,CAAC,CAAA,GAAI,CAAA,GAAI,CAAA;AACzC,MAAA,IAAA,CAAK,CAAC,IAAI,IAAA,CAAK,GAAA;AAAA,QACb,IAAA,CAAK,CAAC,CAAA,GAAK,CAAA;AAAA;AAAA,QACX,IAAA,CAAK,CAAA,GAAI,CAAC,CAAA,GAAK,CAAA;AAAA;AAAA,QACf,IAAA,CAAK,CAAA,GAAI,CAAC,CAAA,GAAK;AAAA;AAAA,OACjB;AACA,MAAA,IAAI,KAAK,CAAC,CAAA,GAAK,MAAA,EAAQ,MAAA,GAAS,KAAK,CAAC,CAAA;AAAA,IACxC;AACA,IAAA,IAAI,MAAA,GAAS,GAAA,EAAK,OAAO,GAAA,GAAM,CAAA;AAC/B,IAAA,KAAA,IAAS,CAAA,GAAI,GAAG,CAAA,IAAK,EAAA,EAAI,KAAK,IAAA,CAAK,CAAC,CAAA,GAAI,IAAA,CAAK,CAAC,CAAA;AAAA,EAChD;AACA,EAAA,OAAO,KAAK,EAAE,CAAA;AAChB;AAWO,SAAS,cAAA,CACd,OACA,UAAA,EACe;AACf,EAAA,MAAM,MAAA,GAAS,MAAM,WAAA,EAAY;AACjC,EAAA,IAAI,IAAA,GAA8C,IAAA;AAClD,EAAA,IAAI,UAAA,GAAa,QAAA;AACjB,EAAA,KAAA,MAAW,KAAK,UAAA,EAAY;AAC1B,IAAA,MAAM,IAAI,QAAA,CAAS,MAAA,EAAQ,CAAA,CAAE,WAAA,IAAe,CAAC,CAAA;AAC7C,IAAA,IAAI,IAAI,CAAA,EAAG;AACX,IAAA,IAAI,IAAA,KAAS,IAAA,IAAQ,CAAA,GAAI,IAAA,CAAK,IAAA,EAAM;AAClC,MAAA,UAAA,GAAa,MAAM,IAAA,IAAQ,QAAA;AAC3B,MAAA,IAAA,GAAO,EAAE,IAAA,EAAM,CAAA,EAAG,IAAA,EAAM,CAAA,EAAE;AAAA,IAC5B,CAAA,MAAA,IAAW,IAAI,UAAA,EAAY;AACzB,MAAA,UAAA,GAAa,CAAA;AAAA,IACf;AAAA,EACF;AACA,EAAA,IAAI,IAAA,KAAS,MAAM,OAAO,IAAA;AAG1B,EAAA,IAAI,UAAA,IAAc,IAAA,CAAK,IAAA,EAAM,OAAO,IAAA;AACpC,EAAA,OAAO,IAAA,CAAK,IAAA;AACd;AAMO,SAAS,UAAA,CAAW,OAAe,UAAA,EAAsC;AAC9E,EAAA,MAAM,CAAA,GAAI,cAAA,CAAe,KAAA,EAAO,UAAU,CAAA;AAC1C,EAAA,OAAO,CAAA,GAAI,CAAA,gBAAA,EAAmB,CAAC,CAAA,GAAA,CAAA,GAAQ,EAAA;AACzC","file":"chunk-PIV2A3HG.js","sourcesContent":["/**\n * \"Did you mean…?\" helper for parser error messages.\n *\n * Every diagram parser eventually rejects an unknown keyword (an unknown\n * node type, an unknown directive, a misspelled mode). The bare error\n * \"unknown element type 'RES'\" tells the LLM nothing — but\n * \"unknown element type 'RES' (did you mean 'OTE'?)\" gives it the bump\n * it needs to self-correct on the next attempt.\n *\n * Implementation is a textbook Levenshtein distance with an early-exit\n * cap of 3. We only suggest if the closest valid keyword is within 2\n * edits AND meaningfully closer than the second-best — that avoids the\n * \"did you mean 'a'?\" noise when input was nonsense.\n */\n\n/** Edit distance with an upper-bound short-circuit. */\nfunction distance(a: string, b: string, cap: number): number {\n  if (a === b) return 0;\n  if (Math.abs(a.length - b.length) > cap) return cap + 1;\n  const al = a.length;\n  const bl = b.length;\n  // Pre-pad shorter to longer.\n  const prev = new Array<number>(bl + 1);\n  const curr = new Array<number>(bl + 1);\n  for (let j = 0; j <= bl; j++) prev[j] = j;\n  for (let i = 1; i <= al; i++) {\n    curr[0] = i;\n    let rowMin = i;\n    for (let j = 1; j <= bl; j++) {\n      const cost = a[i - 1] === b[j - 1] ? 0 : 1;\n      curr[j] = Math.min(\n        prev[j]! + 1, // deletion\n        curr[j - 1]! + 1, // insertion\n        prev[j - 1]! + cost // substitution\n      );\n      if (curr[j]! < rowMin) rowMin = curr[j]!;\n    }\n    if (rowMin > cap) return cap + 1;\n    for (let j = 0; j <= bl; j++) prev[j] = curr[j]!;\n  }\n  return prev[bl]!;\n}\n\n/**\n * Suggest the closest valid keyword to `input` from `candidates`.\n *\n * Returns the keyword if it's within edit distance 2 AND strictly closer\n * than every other candidate (i.e. unambiguous). Returns null otherwise.\n *\n * Comparison is case-insensitive. The returned suggestion preserves the\n * casing of the candidate, not the input.\n */\nexport function suggestKeyword(\n  input: string,\n  candidates: Iterable<string>\n): string | null {\n  const needle = input.toLowerCase();\n  let best: { word: string; dist: number } | null = null;\n  let secondBest = Infinity;\n  for (const c of candidates) {\n    const d = distance(needle, c.toLowerCase(), 2);\n    if (d > 2) continue;\n    if (best === null || d < best.dist) {\n      secondBest = best?.dist ?? Infinity;\n      best = { word: c, dist: d };\n    } else if (d < secondBest) {\n      secondBest = d;\n    }\n  }\n  if (best === null) return null;\n  // Require strict separation so we don't pick arbitrarily between two\n  // equally-close candidates (\"OTE\" vs \"OTL\" for \"OTX\" — useless).\n  if (secondBest <= best.dist) return null;\n  return best.word;\n}\n\n/**\n * Build a \"(did you mean 'X'?)\" suffix, or empty string if no good match.\n * Convenience wrapper so call sites read as one expression.\n */\nexport function didYouMean(input: string, candidates: Iterable<string>): string {\n  const s = suggestKeyword(input, candidates);\n  return s ? ` (did you mean '${s}'?)` : \"\";\n}\n"]}

package/dist/{chunk-E2EJRVWS.cjs → chunk-QTNPMIO2.cjs}

@@ -1,5 +1,6 @@
 'use strict';
 
+var chunk3KRL2EGN_cjs = require('./chunk-3KRL2EGN.cjs');
 var chunkD7EHZFK4_cjs = require('./chunk-D7EHZFK4.cjs');
 var chunk3WNW5Y7P_cjs = require('./chunk-3WNW5Y7P.cjs');
 
@@ -291,6 +292,47 @@ function parseCssProps(s) {
   }
   return props;
 }
+function extractInlineClasses(line2) {
+  const pairs = [];
+  let out = line2;
+  const re = /:::([A-Za-z_][\w-]*)/g;
+  let m;
+  const hits = [];
+  while ((m = re.exec(out)) !== null) {
+    hits.push({ start: m.index, end: m.index + m[0].length, name: m[1] });
+  }
+  if (hits.length === 0) return { stripped: line2, pairs };
+  for (let h = hits.length - 1; h >= 0; h--) {
+    const hit = hits[h];
+    const before = out.slice(0, hit.start);
+    let cursor = before.length;
+    const lastCh = before[cursor - 1];
+    if (lastCh === "]" || lastCh === ")" || lastCh === "}") {
+      const closer = lastCh;
+      const opener = closer === "]" ? "[" : closer === ")" ? "(" : "{";
+      let depth = 0;
+      let i = cursor - 1;
+      for (; i >= 0; i--) {
+        if (before[i] === closer) depth++;
+        else if (before[i] === opener) {
+          depth--;
+          if (depth === 0) break;
+        }
+      }
+      if (i >= 0) cursor = i;
+    }
+    const idEnd = cursor;
+    let idStart = idEnd;
+    while (idStart > 0 && /[A-Za-z0-9_-]/.test(before[idStart - 1])) idStart--;
+    if (idStart === idEnd) {
+      continue;
+    }
+    const id = before.slice(idStart, idEnd);
+    pairs.push({ id, className: hit.name });
+    out = out.slice(0, hit.start) + out.slice(hit.end);
+  }
+  return { stripped: out, pairs };
+}
 function parseFlowchart(source) {
   const lines = source.replace(/\r\n/g, "\n").split("\n");
   const ast = {
@@ -333,10 +375,18 @@ function parseFlowchart(source) {
     ast.title = mQuoted ? mQuoted[1] : extra;
   }
   const subgraphStack = [];
+  const pendingInlineClasses = [];
   for (let i = headerIdx + 1; i < lines.length; i++) {
-    const raw = lines[i];
+    const rawOriginal = lines[i];
+    const originalTrimmed = rawOriginal.trim();
+    if (originalTrimmed.length === 0 || originalTrimmed.startsWith("%%")) {
+      continue;
+    }
+    const { stripped, pairs } = extractInlineClasses(rawOriginal);
+    for (const p of pairs) pendingInlineClasses.push(p);
+    const raw = stripped;
     const trimmed = raw.trim();
-    if (trimmed.length === 0 || trimmed.startsWith("%%")) continue;
+    if (trimmed.length === 0) continue;
     const sgMatch = /^subgraph(?:\s+(.*))?$/.exec(trimmed);
     if (sgMatch) {
       const sg = parseSubgraphHeader(sgMatch[1] ?? "", ast.subgraphs.length);
@@ -459,6 +509,11 @@ function parseFlowchart(source) {
       ast.edges.push(edge);
     }
   }
+  for (const { id, className } of pendingInlineClasses) {
+    const existing = nodeMap.get(id);
+    if (!existing) continue;
+    existing.classes = [...existing.classes ?? [], className];
+  }
   return ast;
 }
 
@@ -769,15 +824,27 @@ function isFullWidth(code) {
   if (code >= 131072 && code <= 196607) return true;
   return false;
 }
-function measureLabelWidth(label) {
+function labelLines(label) {
+  return String(label).split(/<br\s*\/?>|\n/i).map((line2) => line2.replace(/<\/?[bi]>/gi, ""));
+}
+function measureLineWidth(line2) {
   let w = 0;
-  for (const ch of label) {
+  for (const ch of line2) {
     const code = ch.codePointAt(0) ?? 0;
     if (isFullWidth(code)) w += FC_CONST.cjkCharWidth;
     else w += FC_CONST.charWidth;
   }
   return w;
 }
+function measureLabelWidth(label) {
+  const lines = labelLines(label);
+  let max = 0;
+  for (const line2 of lines) {
+    const w = measureLineWidth(line2);
+    if (w > max) max = w;
+  }
+  return max;
+}
 function greedyFAS(nodeIds, edges) {
   const outAdj = /* @__PURE__ */ new Map();
   const inAdj = /* @__PURE__ */ new Map();
@@ -1210,6 +1277,85 @@ function laneBasedXCoords(layerNodes, pathOf, nodeSpacingX, segments) {
   }
   return result;
 }
+function enforceSequentialClusterLayers(ast, layerMap, edges) {
+  const sgParent = /* @__PURE__ */ new Map();
+  for (const sg of ast.subgraphs) {
+    for (const childSg of sg.subgraphs) sgParent.set(childSg, sg.id);
+    if (!sgParent.has(sg.id)) sgParent.set(sg.id, void 0);
+  }
+  const topLevel = ast.subgraphs.filter((sg) => !sgParent.get(sg.id));
+  if (topLevel.length < 2) return;
+  const collect = (sgId) => {
+    const sg = ast.subgraphs.find((s) => s.id === sgId);
+    if (!sg) return [];
+    const ids = [...sg.children];
+    for (const childSgId of sg.subgraphs) ids.push(...collect(childSgId));
+    return ids;
+  };
+  const adjOut = /* @__PURE__ */ new Map();
+  for (const e of edges) {
+    if (!adjOut.has(e.from)) adjOut.set(e.from, []);
+    adjOut.get(e.from).push(e.to);
+  }
+  const hasForwardEdge = (srcSgId, dstSgId) => {
+    const srcIds = new Set(collect(srcSgId));
+    const dstIds = new Set(collect(dstSgId));
+    for (const id of srcIds) {
+      for (const t of adjOut.get(id) ?? []) {
+        if (dstIds.has(t)) return true;
+      }
+    }
+    return false;
+  };
+  const chains = [];
+  let cur = [];
+  for (let i = 0; i < topLevel.length; i++) {
+    const sg = topLevel[i];
+    if (i === 0 || !hasForwardEdge(topLevel[i - 1].id, sg.id)) {
+      if (cur.length > 1) chains.push(cur);
+      cur = [sg.id];
+    } else {
+      cur.push(sg.id);
+    }
+  }
+  if (cur.length > 1) chains.push(cur);
+  if (chains.length === 0) return;
+  for (const chain of chains) {
+    let prevMax = -Infinity;
+    for (const clusterId of chain) {
+      const ids = collect(clusterId);
+      if (ids.length === 0) continue;
+      let curMin = Infinity;
+      let curMax = -Infinity;
+      for (const id of ids) {
+        const l = layerMap.get(id) ?? 0;
+        if (l < curMin) curMin = l;
+        if (l > curMax) curMax = l;
+      }
+      const requiredMin = prevMax === -Infinity ? curMin : prevMax + 1;
+      if (curMin < requiredMin) {
+        const shift = requiredMin - curMin;
+        const toShift = new Set(ids);
+        const queue = [...ids];
+        while (queue.length > 0) {
+          const u = queue.shift();
+          for (const t of adjOut.get(u) ?? []) {
+            if (!toShift.has(t)) {
+              toShift.add(t);
+              queue.push(t);
+            }
+          }
+        }
+        for (const id of toShift) {
+          layerMap.set(id, (layerMap.get(id) ?? 0) + shift);
+        }
+        prevMax = curMax + shift;
+      } else {
+        prevMax = curMax;
+      }
+    }
+  }
+}
 function hasOverlappingTopLevelClusters(ast, layerMap, sgParent) {
   const topLevel = ast.subgraphs.filter((sg) => !sgParent.get(sg.id));
   if (topLevel.length < 2) return false;
@@ -1246,7 +1392,9 @@ function layoutFlowchart(ast) {
       Math.ceil(rawTextW) + FC_CONST.labelHPad * 2
     );
     let shapeW = Math.max(FC_CONST.minNodeWidth, labelW);
-    let shapeH = FC_CONST.nodeHeight;
+    const nLines = labelLines(n.label).length;
+    const multilineH = nLines > 1 ? FC_CONST.nodeHeight + (nLines - 1) * 14 : FC_CONST.nodeHeight;
+    let shapeH = multilineH;
     if (n.shape === "diamond") {
       shapeW = Math.max(shapeW, labelW * 1.4);
       shapeH = Math.max(shapeH, 52);
@@ -1303,6 +1451,7 @@ function layoutFlowchart(ast) {
     };
   });
   const layerMap = longestPathLayers(allIds, ledges);
+  enforceSequentialClusterLayers(ast, layerMap, ledges);
   let dummyCounter = 0;
   const dummies = [];
   const { updatedEdges } = insertDummies(ledges, layerMap, () => {
@@ -2079,14 +2228,8 @@ function renderFlowchart(text2, themeName = "default") {
 var flowchart = {
   type: "flowchart",
   detect(text2) {
-    for (const raw of text2.split(/\r?\n/)) {
-      const t = raw.trim();
-      if (t.length === 0) continue;
-      if (t.startsWith("%%")) continue;
-      const first = t.split(/\s+/)[0]?.toLowerCase() ?? "";
-      return first === "flowchart" || first === "graph";
-    }
-    return false;
+    const first = chunk3KRL2EGN_cjs.firstContentLine(text2)?.split(/\s+/)[0]?.toLowerCase() ?? "";
+    return first === "flowchart" || first === "graph";
   },
   parse: parseFlowchart,
   render(text2, config) {
@@ -2101,5 +2244,5 @@ exports.layoutFlowchart = layoutFlowchart;
 exports.parseFlowchart = parseFlowchart;
 exports.renderFlowchart = renderFlowchart;
 exports.renderFlowchartAST = renderFlowchartAST;
-//# sourceMappingURL=chunk-E2EJRVWS.cjs.map
-//# sourceMappingURL=chunk-E2EJRVWS.cjs.map
+//# sourceMappingURL=chunk-QTNPMIO2.cjs.map
+//# sourceMappingURL=chunk-QTNPMIO2.cjs.map