@zjlab-frontier/markdown 1.2.6 → 1.2.8

package/dist/index-5325376f-DsGv8AO4.mjs

@@ -1,373 +0,0 @@
-import { i as N, G as A } from "./graph-CSVeLFCJ.mjs";
-import { m as $, l as H } from "./layout-DfnPfvJm.mjs";
-import { c as V } from "./clone-Bekeo3TW.mjs";
-import { i as U, u as W, s as _, a as q, b as z, g as D, p as O, c as K, d as Q, e as p, f as J, h as Y, j as Z } from "./edges-96097737-CTds2HS2.mjs";
-import { l as s, g as T, r as S, d as L } from "./index-C3zgkbpi.mjs";
-import { a as I } from "./createText-1719965b-BEXd6yNU.mjs";
-function m(e) {
-  var t = {
-    options: {
-      directed: e.isDirected(),
-      multigraph: e.isMultigraph(),
-      compound: e.isCompound()
-    },
-    nodes: tt(e),
-    edges: et(e)
-  };
-  return N(e.graph()) || (t.value = V(e.graph())), t;
-}
-function tt(e) {
-  return $(e.nodes(), function(t) {
-    var n = e.node(t), r = e.parent(t), i = { v: t };
-    return N(n) || (i.value = n), N(r) || (i.parent = r), i;
-  });
-}
-function et(e) {
-  return $(e.edges(), function(t) {
-    var n = e.edge(t), r = { v: t.v, w: t.w };
-    return N(t.name) || (r.name = t.name), N(n) || (r.value = n), r;
-  });
-}
-let l = {}, g = {}, R = {};
-const nt = () => {
-  g = {}, R = {}, l = {};
-}, B = (e, t) => (s.trace("In isDescendant", t, " ", e, " = ", g[t].includes(e)), !!g[t].includes(e)), it = (e, t) => (s.info("Descendants of ", t, " is ", g[t]), s.info("Edge is ", e), e.v === t || e.w === t ? !1 : g[t] ? g[t].includes(e.v) || B(e.v, t) || B(e.w, t) || g[t].includes(e.w) : (s.debug("Tilt, ", t, ",not in descendants"), !1)), P = (e, t, n, r) => {
-  s.warn(
-    "Copying children of ",
-    e,
-    "root",
-    r,
-    "data",
-    t.node(e),
-    r
-  );
-  const i = t.children(e) || [];
-  e !== r && i.push(e), s.warn("Copying (nodes) clusterId", e, "nodes", i), i.forEach((a) => {
-    if (t.children(a).length > 0)
-      P(a, t, n, r);
-    else {
-      const d = t.node(a);
-      s.info("cp ", a, " to ", r, " with parent ", e), n.setNode(a, d), r !== t.parent(a) && (s.warn("Setting parent", a, t.parent(a)), n.setParent(a, t.parent(a))), e !== r && a !== e ? (s.debug("Setting parent", a, e), n.setParent(a, e)) : (s.info("In copy ", e, "root", r, "data", t.node(e), r), s.debug(
-        "Not Setting parent for node=",
-        a,
-        "cluster!==rootId",
-        e !== r,
-        "node!==clusterId",
-        a !== e
-      ));
-      const u = t.edges(a);
-      s.debug("Copying Edges", u), u.forEach((f) => {
-        s.info("Edge", f);
-        const h = t.edge(f.v, f.w, f.name);
-        s.info("Edge data", h, r);
-        try {
-          it(f, r) ? (s.info("Copying as ", f.v, f.w, h, f.name), n.setEdge(f.v, f.w, h, f.name), s.info("newGraph edges ", n.edges(), n.edge(n.edges()[0]))) : s.info(
-            "Skipping copy of edge ",
-            f.v,
-            "-->",
-            f.w,
-            " rootId: ",
-            r,
-            " clusterId:",
-            e
-          );
-        } catch (w) {
-          s.error(w);
-        }
-      });
-    }
-    s.debug("Removing node", a), t.removeNode(a);
-  });
-}, k = (e, t) => {
-  const n = t.children(e);
-  let r = [...n];
-  for (const i of n)
-    R[i] = e, r = [...r, ...k(i, t)];
-  return r;
-}, C = (e, t) => {
-  s.trace("Searching", e);
-  const n = t.children(e);
-  if (s.trace("Searching children of id ", e, n), n.length < 1)
-    return s.trace("This is a valid node", e), e;
-  for (const r of n) {
-    const i = C(r, t);
-    if (i)
-      return s.trace("Found replacement for", e, " => ", i), i;
-  }
-}, X = (e) => !l[e] || !l[e].externalConnections ? e : l[e] ? l[e].id : e, st = (e, t) => {
-  if (!e || t > 10) {
-    s.debug("Opting out, no graph ");
-    return;
-  } else
-    s.debug("Opting in, graph ");
-  e.nodes().forEach(function(n) {
-    e.children(n).length > 0 && (s.warn(
-      "Cluster identified",
-      n,
-      " Replacement id in edges: ",
-      C(n, e)
-    ), g[n] = k(n, e), l[n] = { id: C(n, e), clusterData: e.node(n) });
-  }), e.nodes().forEach(function(n) {
-    const r = e.children(n), i = e.edges();
-    r.length > 0 ? (s.debug("Cluster identified", n, g), i.forEach((a) => {
-      if (a.v !== n && a.w !== n) {
-        const d = B(a.v, n), u = B(a.w, n);
-        d ^ u && (s.warn("Edge: ", a, " leaves cluster ", n), s.warn("Descendants of XXX ", n, ": ", g[n]), l[n].externalConnections = !0);
-      }
-    })) : s.debug("Not a cluster ", n, g);
-  });
-  for (let n of Object.keys(l)) {
-    const r = l[n].id, i = e.parent(r);
-    i !== n && l[i] && !l[i].externalConnections && (l[n].id = i);
-  }
-  e.edges().forEach(function(n) {
-    const r = e.edge(n);
-    s.warn("Edge " + n.v + " -> " + n.w + ": " + JSON.stringify(n)), s.warn("Edge " + n.v + " -> " + n.w + ": " + JSON.stringify(e.edge(n)));
-    let i = n.v, a = n.w;
-    if (s.warn(
-      "Fix XXX",
-      l,
-      "ids:",
-      n.v,
-      n.w,
-      "Translating: ",
-      l[n.v],
-      " --- ",
-      l[n.w]
-    ), l[n.v] && l[n.w] && l[n.v] === l[n.w]) {
-      s.warn("Fixing and trixing link to self - removing XXX", n.v, n.w, n.name), s.warn("Fixing and trixing - removing XXX", n.v, n.w, n.name), i = X(n.v), a = X(n.w), e.removeEdge(n.v, n.w, n.name);
-      const d = n.w + "---" + n.v;
-      e.setNode(d, {
-        domId: d,
-        id: d,
-        labelStyle: "",
-        labelText: r.label,
-        padding: 0,
-        shape: "labelRect",
-        style: ""
-      });
-      const u = structuredClone(r), f = structuredClone(r);
-      u.label = "", u.arrowTypeEnd = "none", f.label = "", u.fromCluster = n.v, f.toCluster = n.v, e.setEdge(i, d, u, n.name + "-cyclic-special"), e.setEdge(d, a, f, n.name + "-cyclic-special");
-    } else if (l[n.v] || l[n.w]) {
-      if (s.warn("Fixing and trixing - removing XXX", n.v, n.w, n.name), i = X(n.v), a = X(n.w), e.removeEdge(n.v, n.w, n.name), i !== n.v) {
-        const d = e.parent(i);
-        l[d].externalConnections = !0, r.fromCluster = n.v;
-      }
-      if (a !== n.w) {
-        const d = e.parent(a);
-        l[d].externalConnections = !0, r.toCluster = n.w;
-      }
-      s.warn("Fix Replacing with XXX", i, a, n.name), e.setEdge(i, a, r, n.name);
-    }
-  }), s.warn("Adjusted Graph", m(e)), F(e, 0), s.trace(l);
-}, F = (e, t) => {
-  if (s.warn("extractor - ", t, m(e), e.children("D")), t > 10) {
-    s.error("Bailing out");
-    return;
-  }
-  let n = e.nodes(), r = !1;
-  for (const i of n) {
-    const a = e.children(i);
-    r = r || a.length > 0;
-  }
-  if (!r) {
-    s.debug("Done, no node has children", e.nodes());
-    return;
-  }
-  s.debug("Nodes = ", n, t);
-  for (const i of n)
-    if (s.debug(
-      "Extracting node",
-      i,
-      l,
-      l[i] && !l[i].externalConnections,
-      !e.parent(i),
-      e.node(i),
-      e.children("D"),
-      " Depth ",
-      t
-    ), !l[i])
-      s.debug("Not a cluster", i, t);
-    else if (!l[i].externalConnections && // !graph.parent(node) &&
-    e.children(i) && e.children(i).length > 0) {
-      s.warn(
-        "Cluster without external connections, without a parent and with children",
-        i,
-        t
-      );
-      let d = e.graph().rankdir === "TB" ? "LR" : "TB";
-      l[i] && l[i].clusterData && l[i].clusterData.dir && (d = l[i].clusterData.dir, s.warn("Fixing dir", l[i].clusterData.dir, d));
-      const u = new A({
-        multigraph: !0,
-        compound: !0
-      }).setGraph({
-        rankdir: d,
-        // Todo: set proper spacing
-        nodesep: 50,
-        ranksep: 50,
-        marginx: 8,
-        marginy: 8
-      }).setDefaultEdgeLabel(function() {
-        return {};
-      });
-      s.warn("Old graph before copy", m(e)), P(i, e, u, i), e.setNode(i, {
-        clusterNode: !0,
-        id: i,
-        clusterData: l[i].clusterData,
-        labelText: l[i].labelText,
-        graph: u
-      }), s.warn("New graph after copy node: (", i, ")", m(u)), s.debug("Old graph after copy", m(e));
-    } else
-      s.warn(
-        "Cluster ** ",
-        i,
-        " **not meeting the criteria !externalConnections:",
-        !l[i].externalConnections,
-        " no parent: ",
-        !e.parent(i),
-        " children ",
-        e.children(i) && e.children(i).length > 0,
-        e.children("D"),
-        t
-      ), s.debug(l);
-  n = e.nodes(), s.warn("New list of nodes", n);
-  for (const i of n) {
-    const a = e.node(i);
-    s.warn(" Now next level", i, a), a.clusterNode && F(a.graph, t + 1);
-  }
-}, G = (e, t) => {
-  if (t.length === 0)
-    return [];
-  let n = Object.assign(t);
-  return t.forEach((r) => {
-    const i = e.children(r), a = G(e, i);
-    n = [...n, ...a];
-  }), n;
-}, rt = (e) => G(e, e.children()), at = (e, t) => {
-  s.info("Creating subgraph rect for ", t.id, t);
-  const n = T(), r = e.insert("g").attr("class", "cluster" + (t.class ? " " + t.class : "")).attr("id", t.id), i = r.insert("rect", ":first-child"), a = S(n.flowchart.htmlLabels), d = r.insert("g").attr("class", "cluster-label"), u = t.labelType === "markdown" ? I(d, t.labelText, { style: t.labelStyle, useHtmlLabels: a }) : d.node().appendChild(J(t.labelText, t.labelStyle, void 0, !0));
-  let f = u.getBBox();
-  if (S(n.flowchart.htmlLabels)) {
-    const c = u.children[0], o = L(u);
-    f = c.getBoundingClientRect(), o.attr("width", f.width), o.attr("height", f.height);
-  }
-  const h = 0 * t.padding, w = h / 2, x = t.width <= f.width + h ? f.width + h : t.width;
-  t.width <= f.width + h ? t.diff = (f.width - t.width) / 2 - t.padding / 2 : t.diff = -t.padding / 2, s.trace("Data ", t, JSON.stringify(t)), i.attr("style", t.style).attr("rx", t.rx).attr("ry", t.ry).attr("x", t.x - x / 2).attr("y", t.y - t.height / 2 - w).attr("width", x).attr("height", t.height + h);
-  const { subGraphTitleTopMargin: v } = D(n);
-  a ? d.attr(
-    "transform",
-    // This puts the label on top of the box instead of inside it
-    `translate(${t.x - f.width / 2}, ${t.y - t.height / 2 + v})`
-  ) : d.attr(
-    "transform",
-    // This puts the label on top of the box instead of inside it
-    `translate(${t.x}, ${t.y - t.height / 2 + v})`
-  );
-  const y = i.node().getBBox();
-  return t.width = y.width, t.height = y.height, t.intersect = function(c) {
-    return p(t, c);
-  }, r;
-}, ct = (e, t) => {
-  const n = e.insert("g").attr("class", "note-cluster").attr("id", t.id), r = n.insert("rect", ":first-child"), i = 0 * t.padding, a = i / 2;
-  r.attr("rx", t.rx).attr("ry", t.ry).attr("x", t.x - t.width / 2 - a).attr("y", t.y - t.height / 2 - a).attr("width", t.width + i).attr("height", t.height + i).attr("fill", "none");
-  const d = r.node().getBBox();
-  return t.width = d.width, t.height = d.height, t.intersect = function(u) {
-    return p(t, u);
-  }, n;
-}, ot = (e, t) => {
-  const n = T(), r = e.insert("g").attr("class", t.classes).attr("id", t.id), i = r.insert("rect", ":first-child"), a = r.insert("g").attr("class", "cluster-label"), d = r.append("rect"), u = a.node().appendChild(J(t.labelText, t.labelStyle, void 0, !0));
-  let f = u.getBBox();
-  if (S(n.flowchart.htmlLabels)) {
-    const c = u.children[0], o = L(u);
-    f = c.getBoundingClientRect(), o.attr("width", f.width), o.attr("height", f.height);
-  }
-  f = u.getBBox();
-  const h = 0 * t.padding, w = h / 2, x = t.width <= f.width + t.padding ? f.width + t.padding : t.width;
-  t.width <= f.width + t.padding ? t.diff = (f.width + t.padding * 0 - t.width) / 2 : t.diff = -t.padding / 2, i.attr("class", "outer").attr("x", t.x - x / 2 - w).attr("y", t.y - t.height / 2 - w).attr("width", x + h).attr("height", t.height + h), d.attr("class", "inner").attr("x", t.x - x / 2 - w).attr("y", t.y - t.height / 2 - w + f.height - 1).attr("width", x + h).attr("height", t.height + h - f.height - 3);
-  const { subGraphTitleTopMargin: v } = D(n);
-  a.attr(
-    "transform",
-    `translate(${t.x - f.width / 2}, ${t.y - t.height / 2 - t.padding / 3 + (S(n.flowchart.htmlLabels) ? 5 : 3) + v})`
-  );
-  const y = i.node().getBBox();
-  return t.height = y.height, t.intersect = function(c) {
-    return p(t, c);
-  }, r;
-}, lt = (e, t) => {
-  const n = e.insert("g").attr("class", t.classes).attr("id", t.id), r = n.insert("rect", ":first-child"), i = 0 * t.padding, a = i / 2;
-  r.attr("class", "divider").attr("x", t.x - t.width / 2 - a).attr("y", t.y - t.height / 2).attr("width", t.width + i).attr("height", t.height + i);
-  const d = r.node().getBBox();
-  return t.width = d.width, t.height = d.height, t.diff = -t.padding / 2, t.intersect = function(u) {
-    return p(t, u);
-  }, n;
-}, ft = { rect: at, roundedWithTitle: ot, noteGroup: ct, divider: lt };
-let j = {};
-const dt = (e, t) => {
-  s.trace("Inserting cluster");
-  const n = t.shape || "rect";
-  j[t.id] = ft[n](e, t);
-}, ut = () => {
-  j = {};
-}, M = async (e, t, n, r, i, a) => {
-  s.info("Graph in recursive render: XXX", m(t), i);
-  const d = t.graph().rankdir;
-  s.trace("Dir in recursive render - dir:", d);
-  const u = e.insert("g").attr("class", "root");
-  t.nodes() ? s.info("Recursive render XXX", t.nodes()) : s.info("No nodes found for", t), t.edges().length > 0 && s.trace("Recursive edges", t.edge(t.edges()[0]));
-  const f = u.insert("g").attr("class", "clusters"), h = u.insert("g").attr("class", "edgePaths"), w = u.insert("g").attr("class", "edgeLabels"), x = u.insert("g").attr("class", "nodes");
-  await Promise.all(
-    t.nodes().map(async function(c) {
-      const o = t.node(c);
-      if (i !== void 0) {
-        const b = JSON.parse(JSON.stringify(i.clusterData));
-        s.info("Setting data for cluster XXX (", c, ") ", b, i), t.setNode(i.id, b), t.parent(c) || (s.trace("Setting parent", c, i.id), t.setParent(c, i.id, b));
-      }
-      if (s.info("(Insert) Node XXX" + c + ": " + JSON.stringify(t.node(c))), o && o.clusterNode) {
-        s.info("Cluster identified", c, o.width, t.node(c));
-        const b = await M(
-          x,
-          o.graph,
-          n,
-          r,
-          t.node(c),
-          a
-        ), E = b.elem;
-        W(o, E), o.diff = b.diff || 0, s.info("Node bounds (abc123)", c, o, o.width, o.x, o.y), _(E, o), s.warn("Recursive render complete ", E, o);
-      } else
-        t.children(c).length > 0 ? (s.info("Cluster - the non recursive path XXX", c, o.id, o, t), s.info(C(o.id, t)), l[o.id] = { id: C(o.id, t), node: o }) : (s.info("Node - the non recursive path", c, o.id, o), await q(x, t.node(c), d));
-    })
-  ), t.edges().forEach(function(c) {
-    const o = t.edge(c.v, c.w, c.name);
-    s.info("Edge " + c.v + " -> " + c.w + ": " + JSON.stringify(c)), s.info("Edge " + c.v + " -> " + c.w + ": ", c, " ", JSON.stringify(t.edge(c))), s.info("Fix", l, "ids:", c.v, c.w, "Translating: ", l[c.v], l[c.w]), z(w, o);
-  }), t.edges().forEach(function(c) {
-    s.info("Edge " + c.v + " -> " + c.w + ": " + JSON.stringify(c));
-  }), s.info("#############################################"), s.info("###                Layout                 ###"), s.info("#############################################"), s.info(t), H(t), s.info("Graph after layout:", m(t));
-  let v = 0;
-  const { subGraphTitleTotalMargin: y } = D(a);
-  return rt(t).forEach(function(c) {
-    const o = t.node(c);
-    s.info("Position " + c + ": " + JSON.stringify(t.node(c))), s.info(
-      "Position " + c + ": (" + o.x,
-      "," + o.y,
-      ") width: ",
-      o.width,
-      " height: ",
-      o.height
-    ), o && o.clusterNode ? (o.y += y, O(o)) : t.children(c).length > 0 ? (o.height += y, dt(f, o), l[o.id].node = o) : (o.y += y / 2, O(o));
-  }), t.edges().forEach(function(c) {
-    const o = t.edge(c);
-    s.info("Edge " + c.v + " -> " + c.w + ": " + JSON.stringify(o), o), o.points.forEach((E) => E.y += y / 2);
-    const b = K(h, c, o, l, n, t, r);
-    Q(o, b);
-  }), t.nodes().forEach(function(c) {
-    const o = t.node(c);
-    s.info(c, o.type, o.diff), o.type === "group" && (v = o.diff);
-  }), { elem: u, diff: v };
-}, bt = async (e, t, n, r, i) => {
-  U(e, n, r, i), Y(), Z(), ut(), nt(), s.warn("Graph at first:", JSON.stringify(m(t))), st(t), s.warn("Graph after:", JSON.stringify(m(t)));
-  const a = T();
-  await M(e, t, r, i, void 0, a);
-};
-export {
-  bt as r
-};

package/dist/infoDiagram-8eee0895-Cx7V52QV.mjs

@@ -1,319 +0,0 @@
-import { l as Y, T as D, e as M } from "./index-C3zgkbpi.mjs";
-var O = (function() {
-  var a = function(u, t, e, n) {
-    for (e = e || {}, n = u.length; n--; e[u[n]] = t)
-      ;
-    return e;
-  }, f = [6, 9, 10], m = {
-    trace: function() {
-    },
-    yy: {},
-    symbols_: { error: 2, start: 3, info: 4, document: 5, EOF: 6, line: 7, statement: 8, NL: 9, showInfo: 10, $accept: 0, $end: 1 },
-    terminals_: { 2: "error", 4: "info", 6: "EOF", 9: "NL", 10: "showInfo" },
-    productions_: [0, [3, 3], [5, 0], [5, 2], [7, 1], [7, 1], [8, 1]],
-    performAction: function(t, e, n, s, r, i, d) {
-      switch (i.length - 1, r) {
-        case 1:
-          return s;
-        case 4:
-          break;
-        case 6:
-          s.setInfo(!0);
-          break;
-      }
-    },
-    table: [{ 3: 1, 4: [1, 2] }, { 1: [3] }, a(f, [2, 2], { 5: 3 }), { 6: [1, 4], 7: 5, 8: 6, 9: [1, 7], 10: [1, 8] }, { 1: [2, 1] }, a(f, [2, 3]), a(f, [2, 4]), a(f, [2, 5]), a(f, [2, 6])],
-    defaultActions: { 4: [2, 1] },
-    parseError: function(t, e) {
-      if (e.recoverable)
-        this.trace(t);
-      else {
-        var n = new Error(t);
-        throw n.hash = e, n;
-      }
-    },
-    parse: function(t) {
-      var e = this, n = [0], s = [], r = [null], i = [], d = this.table, P = "", v = 0, T = 0, N = 2, L = 1, R = i.slice.call(arguments, 1), o = Object.create(this.lexer), p = { yy: {} };
-      for (var E in this.yy)
-        Object.prototype.hasOwnProperty.call(this.yy, E) && (p.yy[E] = this.yy[E]);
-      o.setInput(t, p.yy), p.yy.lexer = o, p.yy.parser = this, typeof o.yylloc > "u" && (o.yylloc = {});
-      var I = o.yylloc;
-      i.push(I);
-      var z = o.options && o.options.ranges;
-      typeof p.yy.parseError == "function" ? this.parseError = p.yy.parseError : this.parseError = Object.getPrototypeOf(this).parseError;
-      function U() {
-        var y;
-        return y = s.pop() || o.lex() || L, typeof y != "number" && (y instanceof Array && (s = y, y = s.pop()), y = e.symbols_[y] || y), y;
-      }
-      for (var l, g, h, w, _ = {}, b, c, F, S; ; ) {
-        if (g = n[n.length - 1], this.defaultActions[g] ? h = this.defaultActions[g] : ((l === null || typeof l > "u") && (l = U()), h = d[g] && d[g][l]), typeof h > "u" || !h.length || !h[0]) {
-          var A = "";
-          S = [];
-          for (b in d[g])
-            this.terminals_[b] && b > N && S.push("'" + this.terminals_[b] + "'");
-          o.showPosition ? A = "Parse error on line " + (v + 1) + `:
-` + o.showPosition() + `
-Expecting ` + S.join(", ") + ", got '" + (this.terminals_[l] || l) + "'" : A = "Parse error on line " + (v + 1) + ": Unexpected " + (l == L ? "end of input" : "'" + (this.terminals_[l] || l) + "'"), this.parseError(A, {
-            text: o.match,
-            token: this.terminals_[l] || l,
-            line: o.yylineno,
-            loc: I,
-            expected: S
-          });
-        }
-        if (h[0] instanceof Array && h.length > 1)
-          throw new Error("Parse Error: multiple actions possible at state: " + g + ", token: " + l);
-        switch (h[0]) {
-          case 1:
-            n.push(l), r.push(o.yytext), i.push(o.yylloc), n.push(h[1]), l = null, T = o.yyleng, P = o.yytext, v = o.yylineno, I = o.yylloc;
-            break;
-          case 2:
-            if (c = this.productions_[h[1]][1], _.$ = r[r.length - c], _._$ = {
-              first_line: i[i.length - (c || 1)].first_line,
-              last_line: i[i.length - 1].last_line,
-              first_column: i[i.length - (c || 1)].first_column,
-              last_column: i[i.length - 1].last_column
-            }, z && (_._$.range = [
-              i[i.length - (c || 1)].range[0],
-              i[i.length - 1].range[1]
-            ]), w = this.performAction.apply(_, [
-              P,
-              T,
-              v,
-              p.yy,
-              h[1],
-              r,
-              i
-            ].concat(R)), typeof w < "u")
-              return w;
-            c && (n = n.slice(0, -1 * c * 2), r = r.slice(0, -1 * c), i = i.slice(0, -1 * c)), n.push(this.productions_[h[1]][0]), r.push(_.$), i.push(_._$), F = d[n[n.length - 2]][n[n.length - 1]], n.push(F);
-            break;
-          case 3:
-            return !0;
-        }
-      }
-      return !0;
-    }
-  }, k = /* @__PURE__ */ (function() {
-    var u = {
-      EOF: 1,
-      parseError: function(e, n) {
-        if (this.yy.parser)
-          this.yy.parser.parseError(e, n);
-        else
-          throw new Error(e);
-      },
-      // resets the lexer, sets new input
-      setInput: function(t, e) {
-        return this.yy = e || this.yy || {}, this._input = t, this._more = this._backtrack = this.done = !1, this.yylineno = this.yyleng = 0, this.yytext = this.matched = this.match = "", this.conditionStack = ["INITIAL"], this.yylloc = {
-          first_line: 1,
-          first_column: 0,
-          last_line: 1,
-          last_column: 0
-        }, this.options.ranges && (this.yylloc.range = [0, 0]), this.offset = 0, this;
-      },
-      // consumes and returns one char from the input
-      input: function() {
-        var t = this._input[0];
-        this.yytext += t, this.yyleng++, this.offset++, this.match += t, this.matched += t;
-        var e = t.match(/(?:\r\n?|\n).*/g);
-        return e ? (this.yylineno++, this.yylloc.last_line++) : this.yylloc.last_column++, this.options.ranges && this.yylloc.range[1]++, this._input = this._input.slice(1), t;
-      },
-      // unshifts one char (or a string) into the input
-      unput: function(t) {
-        var e = t.length, n = t.split(/(?:\r\n?|\n)/g);
-        this._input = t + this._input, this.yytext = this.yytext.substr(0, this.yytext.length - e), this.offset -= e;
-        var s = this.match.split(/(?:\r\n?|\n)/g);
-        this.match = this.match.substr(0, this.match.length - 1), this.matched = this.matched.substr(0, this.matched.length - 1), n.length - 1 && (this.yylineno -= n.length - 1);
-        var r = this.yylloc.range;
-        return this.yylloc = {
-          first_line: this.yylloc.first_line,
-          last_line: this.yylineno + 1,
-          first_column: this.yylloc.first_column,
-          last_column: n ? (n.length === s.length ? this.yylloc.first_column : 0) + s[s.length - n.length].length - n[0].length : this.yylloc.first_column - e
-        }, this.options.ranges && (this.yylloc.range = [r[0], r[0] + this.yyleng - e]), this.yyleng = this.yytext.length, this;
-      },
-      // When called from action, caches matched text and appends it on next action
-      more: function() {
-        return this._more = !0, this;
-      },
-      // When called from action, signals the lexer that this rule fails to match the input, so the next matching rule (regex) should be tested instead.
-      reject: function() {
-        if (this.options.backtrack_lexer)
-          this._backtrack = !0;
-        else
-          return this.parseError("Lexical error on line " + (this.yylineno + 1) + `. You can only invoke reject() in the lexer when the lexer is of the backtracking persuasion (options.backtrack_lexer = true).
-` + this.showPosition(), {
-            text: "",
-            token: null,
-            line: this.yylineno
-          });
-        return this;
-      },
-      // retain first n characters of the match
-      less: function(t) {
-        this.unput(this.match.slice(t));
-      },
-      // displays already matched input, i.e. for error messages
-      pastInput: function() {
-        var t = this.matched.substr(0, this.matched.length - this.match.length);
-        return (t.length > 20 ? "..." : "") + t.substr(-20).replace(/\n/g, "");
-      },
-      // displays upcoming input, i.e. for error messages
-      upcomingInput: function() {
-        var t = this.match;
-        return t.length < 20 && (t += this._input.substr(0, 20 - t.length)), (t.substr(0, 20) + (t.length > 20 ? "..." : "")).replace(/\n/g, "");
-      },
-      // displays the character position where the lexing error occurred, i.e. for error messages
-      showPosition: function() {
-        var t = this.pastInput(), e = new Array(t.length + 1).join("-");
-        return t + this.upcomingInput() + `
-` + e + "^";
-      },
-      // test the lexed token: return FALSE when not a match, otherwise return token
-      test_match: function(t, e) {
-        var n, s, r;
-        if (this.options.backtrack_lexer && (r = {
-          yylineno: this.yylineno,
-          yylloc: {
-            first_line: this.yylloc.first_line,
-            last_line: this.last_line,
-            first_column: this.yylloc.first_column,
-            last_column: this.yylloc.last_column
-          },
-          yytext: this.yytext,
-          match: this.match,
-          matches: this.matches,
-          matched: this.matched,
-          yyleng: this.yyleng,
-          offset: this.offset,
-          _more: this._more,
-          _input: this._input,
-          yy: this.yy,
-          conditionStack: this.conditionStack.slice(0),
-          done: this.done
-        }, this.options.ranges && (r.yylloc.range = this.yylloc.range.slice(0))), s = t[0].match(/(?:\r\n?|\n).*/g), s && (this.yylineno += s.length), this.yylloc = {
-          first_line: this.yylloc.last_line,
-          last_line: this.yylineno + 1,
-          first_column: this.yylloc.last_column,
-          last_column: s ? s[s.length - 1].length - s[s.length - 1].match(/\r?\n?/)[0].length : this.yylloc.last_column + t[0].length
-        }, this.yytext += t[0], this.match += t[0], this.matches = t, this.yyleng = this.yytext.length, this.options.ranges && (this.yylloc.range = [this.offset, this.offset += this.yyleng]), this._more = !1, this._backtrack = !1, this._input = this._input.slice(t[0].length), this.matched += t[0], n = this.performAction.call(this, this.yy, this, e, this.conditionStack[this.conditionStack.length - 1]), this.done && this._input && (this.done = !1), n)
-          return n;
-        if (this._backtrack) {
-          for (var i in r)
-            this[i] = r[i];
-          return !1;
-        }
-        return !1;
-      },
-      // return next match in input
-      next: function() {
-        if (this.done)
-          return this.EOF;
-        this._input || (this.done = !0);
-        var t, e, n, s;
-        this._more || (this.yytext = "", this.match = "");
-        for (var r = this._currentRules(), i = 0; i < r.length; i++)
-          if (n = this._input.match(this.rules[r[i]]), n && (!e || n[0].length > e[0].length)) {
-            if (e = n, s = i, this.options.backtrack_lexer) {
-              if (t = this.test_match(n, r[i]), t !== !1)
-                return t;
-              if (this._backtrack) {
-                e = !1;
-                continue;
-              } else
-                return !1;
-            } else if (!this.options.flex)
-              break;
-          }
-        return e ? (t = this.test_match(e, r[s]), t !== !1 ? t : !1) : this._input === "" ? this.EOF : this.parseError("Lexical error on line " + (this.yylineno + 1) + `. Unrecognized text.
-` + this.showPosition(), {
-          text: "",
-          token: null,
-          line: this.yylineno
-        });
-      },
-      // return next match that has a token
-      lex: function() {
-        var e = this.next();
-        return e || this.lex();
-      },
-      // activates a new lexer condition state (pushes the new lexer condition state onto the condition stack)
-      begin: function(e) {
-        this.conditionStack.push(e);
-      },
-      // pop the previously active lexer condition state off the condition stack
-      popState: function() {
-        var e = this.conditionStack.length - 1;
-        return e > 0 ? this.conditionStack.pop() : this.conditionStack[0];
-      },
-      // produce the lexer rule set which is active for the currently active lexer condition state
-      _currentRules: function() {
-        return this.conditionStack.length && this.conditionStack[this.conditionStack.length - 1] ? this.conditions[this.conditionStack[this.conditionStack.length - 1]].rules : this.conditions.INITIAL.rules;
-      },
-      // return the currently active lexer condition state; when an index argument is provided it produces the N-th previous condition state, if available
-      topState: function(e) {
-        return e = this.conditionStack.length - 1 - Math.abs(e || 0), e >= 0 ? this.conditionStack[e] : "INITIAL";
-      },
-      // alias for begin(condition)
-      pushState: function(e) {
-        this.begin(e);
-      },
-      // return the number of states currently on the stack
-      stateStackSize: function() {
-        return this.conditionStack.length;
-      },
-      options: { "case-insensitive": !0 },
-      performAction: function(e, n, s, r) {
-        switch (s) {
-          case 0:
-            return 4;
-          case 1:
-            return 9;
-          case 2:
-            return "space";
-          case 3:
-            return 10;
-          case 4:
-            return 6;
-          case 5:
-            return "TXT";
-        }
-      },
-      rules: [/^(?:info\b)/i, /^(?:[\s\n\r]+)/i, /^(?:[\s]+)/i, /^(?:showInfo\b)/i, /^(?:$)/i, /^(?:.)/i],
-      conditions: { INITIAL: { rules: [0, 1, 2, 3, 4, 5], inclusive: !0 } }
-    };
-    return u;
-  })();
-  m.lexer = k;
-  function x() {
-    this.yy = {};
-  }
-  return x.prototype = m, m.Parser = x, new x();
-})();
-O.parser = O;
-const B = O, j = {
-  info: !1
-};
-let $ = j.info;
-const V = (a) => {
-  $ = a;
-}, X = () => $, q = () => {
-  $ = j.info;
-}, C = {
-  clear: q,
-  setInfo: V,
-  getInfo: X
-}, G = (a, f, m) => {
-  Y.debug(`rendering info diagram
-` + a);
-  const k = D(f);
-  M(k, 100, 400, !0), k.append("g").append("text").attr("x", 100).attr("y", 40).attr("class", "version").attr("font-size", 32).style("text-anchor", "middle").text(`v${m}`);
-}, H = { draw: G }, K = {
-  parser: B,
-  db: C,
-  renderer: H
-};
-export {
-  K as diagram
-};