oolong-engine 0.0.2 → 0.0.3

package/dist/dagre-KLK3FWXG-Cx_a9Dpr.js

@@ -0,0 +1,447 @@
+import { _ as X, ap as F, aq as Y, ar as _, as as H, l as i, c as V, at as q, au as U, ac as $, ai as z, ad as P, ab as K, av as Q, aw as W, ax as Z } from "./mermaid.core-CYBWUA0z.js";
+import { G as B } from "./graph-DiZQNfv4.js";
+import { l as I } from "./index-BhhXoa2I.js";
+import { i as x } from "./_baseUniq-CwpENewx.js";
+import { c as L } from "./clone-D4gz6IgV.js";
+import { m as A } from "./_basePickBy-Lezj_ebM.js";
+function E(e) {
+  var t = {
+    options: {
+      directed: e.isDirected(),
+      multigraph: e.isMultigraph(),
+      compound: e.isCompound()
+    },
+    nodes: ee(e),
+    edges: ne(e)
+  };
+  return x(e.graph()) || (t.value = L(e.graph())), t;
+}
+function ee(e) {
+  return A(e.nodes(), function(t) {
+    var n = e.node(t), o = e.parent(t), c = { v: t };
+    return x(n) || (c.value = n), x(o) || (c.parent = o), c;
+  });
+}
+function ne(e) {
+  return A(e.edges(), function(t) {
+    var n = e.edge(t), o = { v: t.v, w: t.w };
+    return x(t.name) || (o.name = t.name), x(n) || (o.value = n), o;
+  });
+}
+var f = /* @__PURE__ */ new Map(), b = /* @__PURE__ */ new Map(), J = /* @__PURE__ */ new Map(), te = /* @__PURE__ */ X(() => {
+  b.clear(), J.clear(), f.clear();
+}, "clear"), O = /* @__PURE__ */ X((e, t) => {
+  const n = b.get(t) || [];
+  return i.trace("In isDescendant", t, " ", e, " = ", n.includes(e)), n.includes(e);
+}, "isDescendant"), se = /* @__PURE__ */ X((e, t) => {
+  const n = b.get(t) || [];
+  return i.info("Descendants of ", t, " is ", n), i.info("Edge is ", e), e.v === t || e.w === t ? !1 : n ? n.includes(e.v) || O(e.v, t) || O(e.w, t) || n.includes(e.w) : (i.debug("Tilt, ", t, ",not in descendants"), !1);
+}, "edgeInCluster"), G = /* @__PURE__ */ X((e, t, n, o) => {
+  i.warn(
+    "Copying children of ",
+    e,
+    "root",
+    o,
+    "data",
+    t.node(e),
+    o
+  );
+  const c = t.children(e) || [];
+  e !== o && c.push(e), i.warn("Copying (nodes) clusterId", e, "nodes", c), c.forEach((a) => {
+    if (t.children(a).length > 0)
+      G(a, t, n, o);
+    else {
+      const r = t.node(a);
+      i.info("cp ", a, " to ", o, " with parent ", e), n.setNode(a, r), o !== t.parent(a) && (i.warn("Setting parent", a, t.parent(a)), n.setParent(a, t.parent(a))), e !== o && a !== e ? (i.debug("Setting parent", a, e), n.setParent(a, e)) : (i.info("In copy ", e, "root", o, "data", t.node(e), o), i.debug(
+        "Not Setting parent for node=",
+        a,
+        "cluster!==rootId",
+        e !== o,
+        "node!==clusterId",
+        a !== e
+      ));
+      const u = t.edges(a);
+      i.debug("Copying Edges", u), u.forEach((l) => {
+        i.info("Edge", l);
+        const h = t.edge(l.v, l.w, l.name);
+        i.info("Edge data", h, o);
+        try {
+          se(l, o) ? (i.info("Copying as ", l.v, l.w, h, l.name), n.setEdge(l.v, l.w, h, l.name), i.info("newGraph edges ", n.edges(), n.edge(n.edges()[0]))) : i.info(
+            "Skipping copy of edge ",
+            l.v,
+            "-->",
+            l.w,
+            " rootId: ",
+            o,
+            " clusterId:",
+            e
+          );
+        } catch (C) {
+          i.error(C);
+        }
+      });
+    }
+    i.debug("Removing node", a), t.removeNode(a);
+  });
+}, "copy"), R = /* @__PURE__ */ X((e, t) => {
+  const n = t.children(e);
+  let o = [...n];
+  for (const c of n)
+    J.set(c, e), o = [...o, ...R(c, t)];
+  return o;
+}, "extractDescendants"), ie = /* @__PURE__ */ X((e, t, n) => {
+  const o = e.edges().filter((l) => l.v === t || l.w === t), c = e.edges().filter((l) => l.v === n || l.w === n), a = o.map((l) => ({ v: l.v === t ? n : l.v, w: l.w === t ? t : l.w })), r = c.map((l) => ({ v: l.v, w: l.w }));
+  return a.filter((l) => r.some((h) => l.v === h.v && l.w === h.w));
+}, "findCommonEdges"), D = /* @__PURE__ */ X((e, t, n) => {
+  const o = t.children(e);
+  if (i.trace("Searching children of id ", e, o), o.length < 1)
+    return e;
+  let c;
+  for (const a of o) {
+    const r = D(a, t, n), u = ie(t, n, r);
+    if (r)
+      if (u.length > 0)
+        c = r;
+      else
+        return r;
+  }
+  return c;
+}, "findNonClusterChild"), k = /* @__PURE__ */ X((e) => !f.has(e) || !f.get(e).externalConnections ? e : f.has(e) ? f.get(e).id : e, "getAnchorId"), re = /* @__PURE__ */ X((e, t) => {
+  if (!e || t > 10) {
+    i.debug("Opting out, no graph ");
+    return;
+  } else
+    i.debug("Opting in, graph ");
+  e.nodes().forEach(function(n) {
+    e.children(n).length > 0 && (i.warn(
+      "Cluster identified",
+      n,
+      " Replacement id in edges: ",
+      D(n, e, n)
+    ), b.set(n, R(n, e)), f.set(n, { id: D(n, e, n), clusterData: e.node(n) }));
+  }), e.nodes().forEach(function(n) {
+    const o = e.children(n), c = e.edges();
+    o.length > 0 ? (i.debug("Cluster identified", n, b), c.forEach((a) => {
+      const r = O(a.v, n), u = O(a.w, n);
+      r ^ u && (i.warn("Edge: ", a, " leaves cluster ", n), i.warn("Descendants of XXX ", n, ": ", b.get(n)), f.get(n).externalConnections = !0);
+    })) : i.debug("Not a cluster ", n, b);
+  });
+  for (let n of f.keys()) {
+    const o = f.get(n).id, c = e.parent(o);
+    c !== n && f.has(c) && !f.get(c).externalConnections && (f.get(n).id = c);
+  }
+  e.edges().forEach(function(n) {
+    const o = e.edge(n);
+    i.warn("Edge " + n.v + " -> " + n.w + ": " + JSON.stringify(n)), i.warn("Edge " + n.v + " -> " + n.w + ": " + JSON.stringify(e.edge(n)));
+    let c = n.v, a = n.w;
+    if (i.warn(
+      "Fix XXX",
+      f,
+      "ids:",
+      n.v,
+      n.w,
+      "Translating: ",
+      f.get(n.v),
+      " --- ",
+      f.get(n.w)
+    ), f.get(n.v) || f.get(n.w)) {
+      if (i.warn("Fixing and trying - removing XXX", n.v, n.w, n.name), c = k(n.v), a = k(n.w), e.removeEdge(n.v, n.w, n.name), c !== n.v) {
+        const r = e.parent(c);
+        f.get(r).externalConnections = !0, o.fromCluster = n.v;
+      }
+      if (a !== n.w) {
+        const r = e.parent(a);
+        f.get(r).externalConnections = !0, o.toCluster = n.w;
+      }
+      i.warn("Fix Replacing with XXX", c, a, n.name), e.setEdge(c, a, o, n.name);
+    }
+  }), i.warn("Adjusted Graph", E(e)), T(e, 0), i.trace(f);
+}, "adjustClustersAndEdges"), T = /* @__PURE__ */ X((e, t) => {
+  var c, a;
+  if (i.warn("extractor - ", t, E(e), e.children("D")), t > 10) {
+    i.error("Bailing out");
+    return;
+  }
+  let n = e.nodes(), o = !1;
+  for (const r of n) {
+    const u = e.children(r);
+    o = o || u.length > 0;
+  }
+  if (!o) {
+    i.debug("Done, no node has children", e.nodes());
+    return;
+  }
+  i.debug("Nodes = ", n, t);
+  for (const r of n)
+    if (i.debug(
+      "Extracting node",
+      r,
+      f,
+      f.has(r) && !f.get(r).externalConnections,
+      !e.parent(r),
+      e.node(r),
+      e.children("D"),
+      " Depth ",
+      t
+    ), !f.has(r))
+      i.debug("Not a cluster", r, t);
+    else if (!f.get(r).externalConnections && e.children(r) && e.children(r).length > 0) {
+      i.warn(
+        "Cluster without external connections, without a parent and with children",
+        r,
+        t
+      );
+      let l = e.graph().rankdir === "TB" ? "LR" : "TB";
+      (a = (c = f.get(r)) == null ? void 0 : c.clusterData) != null && a.dir && (l = f.get(r).clusterData.dir, i.warn("Fixing dir", f.get(r).clusterData.dir, l));
+      const h = new B({
+        multigraph: !0,
+        compound: !0
+      }).setGraph({
+        rankdir: l,
+        nodesep: 50,
+        ranksep: 50,
+        marginx: 8,
+        marginy: 8
+      }).setDefaultEdgeLabel(function() {
+        return {};
+      });
+      i.warn("Old graph before copy", E(e)), G(r, e, h, r), e.setNode(r, {
+        clusterNode: !0,
+        id: r,
+        clusterData: f.get(r).clusterData,
+        label: f.get(r).label,
+        graph: h
+      }), i.warn("New graph after copy node: (", r, ")", E(h)), i.debug("Old graph after copy", E(e));
+    } else
+      i.warn(
+        "Cluster ** ",
+        r,
+        " **not meeting the criteria !externalConnections:",
+        !f.get(r).externalConnections,
+        " no parent: ",
+        !e.parent(r),
+        " children ",
+        e.children(r) && e.children(r).length > 0,
+        e.children("D"),
+        t
+      ), i.debug(f);
+  n = e.nodes(), i.warn("New list of nodes", n);
+  for (const r of n) {
+    const u = e.node(r);
+    i.warn(" Now next level", r, u), u != null && u.clusterNode && T(u.graph, t + 1);
+  }
+}, "extractor"), M = /* @__PURE__ */ X((e, t) => {
+  if (t.length === 0)
+    return [];
+  let n = Object.assign([], t);
+  return t.forEach((o) => {
+    const c = e.children(o), a = M(e, c);
+    n = [...n, ...a];
+  }), n;
+}, "sorter"), oe = /* @__PURE__ */ X((e) => M(e, e.children()), "sortNodesByHierarchy"), j = /* @__PURE__ */ X(async (e, t, n, o, c, a) => {
+  i.warn("Graph in recursive render:XAX", E(t), c);
+  const r = t.graph().rankdir;
+  i.trace("Dir in recursive render - dir:", r);
+  const u = e.insert("g").attr("class", "root");
+  t.nodes() ? i.info("Recursive render XXX", t.nodes()) : i.info("No nodes found for", t), t.edges().length > 0 && i.info("Recursive edges", t.edge(t.edges()[0]));
+  const l = u.insert("g").attr("class", "clusters"), h = u.insert("g").attr("class", "edgePaths"), C = u.insert("g").attr("class", "edgeLabels"), g = u.insert("g").attr("class", "nodes");
+  await Promise.all(
+    t.nodes().map(async function(d) {
+      const s = t.node(d);
+      if (c !== void 0) {
+        const w = JSON.parse(JSON.stringify(c.clusterData));
+        i.trace(
+          `Setting data for parent cluster XXX
+ Node.id = `,
+          d,
+          `
+ data=`,
+          w.height,
+          `
+Parent cluster`,
+          c.height
+        ), t.setNode(c.id, w), t.parent(d) || (i.trace("Setting parent", d, c.id), t.setParent(d, c.id, w));
+      }
+      if (i.info("(Insert) Node XXX" + d + ": " + JSON.stringify(t.node(d))), s != null && s.clusterNode) {
+        i.info("Cluster identified XBX", d, s.width, t.node(d));
+        const { ranksep: w, nodesep: m } = t.graph();
+        s.graph.setGraph({
+          ...s.graph.graph(),
+          ranksep: w + 25,
+          nodesep: m
+        });
+        const N = await j(
+          g,
+          s.graph,
+          n,
+          o,
+          t.node(d),
+          a
+        ), S = N.elem;
+        q(s, S), s.diff = N.diff || 0, i.info(
+          "New compound node after recursive render XAX",
+          d,
+          "width",
+          // node,
+          s.width,
+          "height",
+          s.height
+          // node.x,
+          // node.y
+        ), U(S, s);
+      } else
+        t.children(d).length > 0 ? (i.trace(
+          "Cluster - the non recursive path XBX",
+          d,
+          s.id,
+          s,
+          s.width,
+          "Graph:",
+          t
+        ), i.trace(D(s.id, t)), f.set(s.id, { id: D(s.id, t), node: s })) : (i.trace("Node - the non recursive path XAX", d, g, t.node(d), r), await $(g, t.node(d), { config: a, dir: r }));
+    })
+  ), await (/* @__PURE__ */ X(async () => {
+    const d = t.edges().map(async function(s) {
+      const w = t.edge(s.v, s.w, s.name);
+      i.info("Edge " + s.v + " -> " + s.w + ": " + JSON.stringify(s)), i.info("Edge " + s.v + " -> " + s.w + ": ", s, " ", JSON.stringify(t.edge(s))), i.info(
+        "Fix",
+        f,
+        "ids:",
+        s.v,
+        s.w,
+        "Translating: ",
+        f.get(s.v),
+        f.get(s.w)
+      ), await Z(C, w);
+    });
+    await Promise.all(d);
+  }, "processEdges"))(), i.info("Graph before layout:", JSON.stringify(E(t))), i.info("############################################# XXX"), i.info("###                Layout                 ### XXX"), i.info("############################################# XXX"), I(t), i.info("Graph after layout:", JSON.stringify(E(t)));
+  let p = 0, { subGraphTitleTotalMargin: y } = z(a);
+  return await Promise.all(
+    oe(t).map(async function(d) {
+      var w;
+      const s = t.node(d);
+      if (i.info(
+        "Position XBX => " + d + ": (" + s.x,
+        "," + s.y,
+        ") width: ",
+        s.width,
+        " height: ",
+        s.height
+      ), s != null && s.clusterNode)
+        s.y += y, i.info(
+          "A tainted cluster node XBX1",
+          d,
+          s.id,
+          s.width,
+          s.height,
+          s.x,
+          s.y,
+          t.parent(d)
+        ), f.get(s.id).node = s, P(s);
+      else if (t.children(d).length > 0) {
+        i.info(
+          "A pure cluster node XBX1",
+          d,
+          s.id,
+          s.x,
+          s.y,
+          s.width,
+          s.height,
+          t.parent(d)
+        ), s.height += y, t.node(s.parentId);
+        const m = (s == null ? void 0 : s.padding) / 2 || 0, N = ((w = s == null ? void 0 : s.labelBBox) == null ? void 0 : w.height) || 0, S = N - m || 0;
+        i.debug("OffsetY", S, "labelHeight", N, "halfPadding", m), await K(l, s), f.get(s.id).node = s;
+      } else {
+        const m = t.node(s.parentId);
+        s.y += y / 2, i.info(
+          "A regular node XBX1 - using the padding",
+          s.id,
+          "parent",
+          s.parentId,
+          s.width,
+          s.height,
+          s.x,
+          s.y,
+          "offsetY",
+          s.offsetY,
+          "parent",
+          m,
+          m == null ? void 0 : m.offsetY,
+          s
+        ), P(s);
+      }
+    })
+  ), t.edges().forEach(function(d) {
+    const s = t.edge(d);
+    i.info("Edge " + d.v + " -> " + d.w + ": " + JSON.stringify(s), s), s.points.forEach((S) => S.y += y / 2);
+    const w = t.node(d.v);
+    var m = t.node(d.w);
+    const N = Q(h, s, f, n, w, m, o);
+    W(s, N);
+  }), t.nodes().forEach(function(d) {
+    const s = t.node(d);
+    i.info(d, s.type, s.diff), s.isGroup && (p = s.diff);
+  }), i.warn("Returning from recursive render XAX", u, p), { elem: u, diff: p };
+}, "recursiveRender"), ge = /* @__PURE__ */ X(async (e, t) => {
+  var a, r, u, l, h, C;
+  const n = new B({
+    multigraph: !0,
+    compound: !0
+  }).setGraph({
+    rankdir: e.direction,
+    nodesep: ((a = e.config) == null ? void 0 : a.nodeSpacing) || ((u = (r = e.config) == null ? void 0 : r.flowchart) == null ? void 0 : u.nodeSpacing) || e.nodeSpacing,
+    ranksep: ((l = e.config) == null ? void 0 : l.rankSpacing) || ((C = (h = e.config) == null ? void 0 : h.flowchart) == null ? void 0 : C.rankSpacing) || e.rankSpacing,
+    marginx: 8,
+    marginy: 8
+  }).setDefaultEdgeLabel(function() {
+    return {};
+  }), o = t.select("g");
+  F(o, e.markers, e.type, e.diagramId), Y(), _(), H(), te(), e.nodes.forEach((g) => {
+    n.setNode(g.id, { ...g }), g.parentId && n.setParent(g.id, g.parentId);
+  }), i.debug("Edges:", e.edges), e.edges.forEach((g) => {
+    if (g.start === g.end) {
+      const v = g.start, p = v + "---" + v + "---1", y = v + "---" + v + "---2", d = n.node(v);
+      n.setNode(p, {
+        domId: p,
+        id: p,
+        parentId: d.parentId,
+        labelStyle: "",
+        label: "",
+        padding: 0,
+        shape: "labelRect",
+        // shape: 'rect',
+        style: "",
+        width: 10,
+        height: 10
+      }), n.setParent(p, d.parentId), n.setNode(y, {
+        domId: y,
+        id: y,
+        parentId: d.parentId,
+        labelStyle: "",
+        padding: 0,
+        // shape: 'rect',
+        shape: "labelRect",
+        label: "",
+        style: "",
+        width: 10,
+        height: 10
+      }), n.setParent(y, d.parentId);
+      const s = structuredClone(g), w = structuredClone(g), m = structuredClone(g);
+      s.label = "", s.arrowTypeEnd = "none", s.id = v + "-cyclic-special-1", w.arrowTypeStart = "none", w.arrowTypeEnd = "none", w.id = v + "-cyclic-special-mid", m.label = "", d.isGroup && (s.fromCluster = v, m.toCluster = v), m.id = v + "-cyclic-special-2", m.arrowTypeStart = "none", n.setEdge(v, p, s, v + "-cyclic-special-0"), n.setEdge(p, y, w, v + "-cyclic-special-1"), n.setEdge(y, v, m, v + "-cyc<lic-special-2");
+    } else
+      n.setEdge(g.start, g.end, { ...g }, g.id);
+  }), i.warn("Graph at first:", JSON.stringify(E(n))), re(n), i.warn("Graph after XAX:", JSON.stringify(E(n)));
+  const c = V();
+  await j(
+    o,
+    n,
+    e.type,
+    e.diagramId,
+    void 0,
+    c
+  );
+}, "render");
+export {
+  ge as render
+};

package/dist/defaultLocale-BgPVtth8.js

@@ -0,0 +1,171 @@
+function J(n) {
+  return Math.abs(n = Math.round(n)) >= 1e21 ? n.toLocaleString("en").replace(/,/g, "") : n.toString(10);
+}
+function j(n, t) {
+  if (!isFinite(n) || n === 0) return null;
+  var e = (n = t ? n.toExponential(t - 1) : n.toExponential()).indexOf("e"), i = n.slice(0, e);
+  return [
+    i.length > 1 ? i[0] + i.slice(2) : i,
+    +n.slice(e + 1)
+  ];
+}
+function K(n) {
+  return n = j(Math.abs(n)), n ? n[1] : NaN;
+}
+function Q(n, t) {
+  return function(e, i) {
+    for (var o = e.length, a = [], c = 0, h = n[0], M = 0; o > 0 && h > 0 && (M + h + 1 > i && (h = Math.max(1, i - M)), a.push(e.substring(o -= h, o + h)), !((M += h + 1) > i)); )
+      h = n[c = (c + 1) % n.length];
+    return a.reverse().join(t);
+  };
+}
+function V(n) {
+  return function(t) {
+    return t.replace(/[0-9]/g, function(e) {
+      return n[+e];
+    });
+  };
+}
+var W = /^(?:(.)?([<>=^]))?([+\-( ])?([$#])?(0)?(\d+)?(,)?(\.\d+)?(~)?([a-z%])?$/i;
+function $(n) {
+  if (!(t = W.exec(n))) throw new Error("invalid format: " + n);
+  var t;
+  return new L({
+    fill: t[1],
+    align: t[2],
+    sign: t[3],
+    symbol: t[4],
+    zero: t[5],
+    width: t[6],
+    comma: t[7],
+    precision: t[8] && t[8].slice(1),
+    trim: t[9],
+    type: t[10]
+  });
+}
+$.prototype = L.prototype;
+function L(n) {
+  this.fill = n.fill === void 0 ? " " : n.fill + "", this.align = n.align === void 0 ? ">" : n.align + "", this.sign = n.sign === void 0 ? "-" : n.sign + "", this.symbol = n.symbol === void 0 ? "" : n.symbol + "", this.zero = !!n.zero, this.width = n.width === void 0 ? void 0 : +n.width, this.comma = !!n.comma, this.precision = n.precision === void 0 ? void 0 : +n.precision, this.trim = !!n.trim, this.type = n.type === void 0 ? "" : n.type + "";
+}
+L.prototype.toString = function() {
+  return this.fill + this.align + this.sign + this.symbol + (this.zero ? "0" : "") + (this.width === void 0 ? "" : Math.max(1, this.width | 0)) + (this.comma ? "," : "") + (this.precision === void 0 ? "" : "." + Math.max(0, this.precision | 0)) + (this.trim ? "~" : "") + this.type;
+};
+function _(n) {
+  n: for (var t = n.length, e = 1, i = -1, o; e < t; ++e)
+    switch (n[e]) {
+      case ".":
+        i = o = e;
+        break;
+      case "0":
+        i === 0 && (i = e), o = e;
+        break;
+      default:
+        if (!+n[e]) break n;
+        i > 0 && (i = 0);
+        break;
+    }
+  return i > 0 ? n.slice(0, i) + n.slice(o + 1) : n;
+}
+var N;
+function v(n, t) {
+  var e = j(n, t);
+  if (!e) return N = void 0, n.toPrecision(t);
+  var i = e[0], o = e[1], a = o - (N = Math.max(-8, Math.min(8, Math.floor(o / 3))) * 3) + 1, c = i.length;
+  return a === c ? i : a > c ? i + new Array(a - c + 1).join("0") : a > 0 ? i.slice(0, a) + "." + i.slice(a) : "0." + new Array(1 - a).join("0") + j(n, Math.max(0, t + a - 1))[0];
+}
+function X(n, t) {
+  var e = j(n, t);
+  if (!e) return n + "";
+  var i = e[0], o = e[1];
+  return o < 0 ? "0." + new Array(-o).join("0") + i : i.length > o + 1 ? i.slice(0, o + 1) + "." + i.slice(o + 1) : i + new Array(o - i.length + 2).join("0");
+}
+const O = {
+  "%": (n, t) => (n * 100).toFixed(t),
+  b: (n) => Math.round(n).toString(2),
+  c: (n) => n + "",
+  d: J,
+  e: (n, t) => n.toExponential(t),
+  f: (n, t) => n.toFixed(t),
+  g: (n, t) => n.toPrecision(t),
+  o: (n) => Math.round(n).toString(8),
+  p: (n, t) => X(n * 100, t),
+  r: X,
+  s: v,
+  X: (n) => Math.round(n).toString(16).toUpperCase(),
+  x: (n) => Math.round(n).toString(16)
+};
+function R(n) {
+  return n;
+}
+var U = Array.prototype.map, Y = ["y", "z", "a", "f", "p", "n", "µ", "m", "", "k", "M", "G", "T", "P", "E", "Z", "Y"];
+function nn(n) {
+  var t = n.grouping === void 0 || n.thousands === void 0 ? R : Q(U.call(n.grouping, Number), n.thousands + ""), e = n.currency === void 0 ? "" : n.currency[0] + "", i = n.currency === void 0 ? "" : n.currency[1] + "", o = n.decimal === void 0 ? "." : n.decimal + "", a = n.numerals === void 0 ? R : V(U.call(n.numerals, String)), c = n.percent === void 0 ? "%" : n.percent + "", h = n.minus === void 0 ? "−" : n.minus + "", M = n.nan === void 0 ? "NaN" : n.nan + "";
+  function T(f, g) {
+    f = $(f);
+    var b = f.fill, p = f.align, m = f.sign, w = f.symbol, S = f.zero, E = f.width, F = f.comma, y = f.precision, C = f.trim, d = f.type;
+    d === "n" ? (F = !0, d = "g") : O[d] || (y === void 0 && (y = 12), C = !0, d = "g"), (S || b === "0" && p === "=") && (S = !0, b = "0", p = "=");
+    var q = (g && g.prefix !== void 0 ? g.prefix : "") + (w === "$" ? e : w === "#" && /[boxX]/.test(d) ? "0" + d.toLowerCase() : ""), B = (w === "$" ? i : /[%p]/.test(d) ? c : "") + (g && g.suffix !== void 0 ? g.suffix : ""), D = O[d], H = /[defgprs%]/.test(d);
+    y = y === void 0 ? 6 : /[gprs]/.test(d) ? Math.max(1, Math.min(21, y)) : Math.max(0, Math.min(20, y));
+    function G(r) {
+      var l = q, u = B, x, I, k;
+      if (d === "c")
+        u = D(r) + u, r = "";
+      else {
+        r = +r;
+        var P = r < 0 || 1 / r < 0;
+        if (r = isNaN(r) ? M : D(Math.abs(r), y), C && (r = _(r)), P && +r == 0 && m !== "+" && (P = !1), l = (P ? m === "(" ? m : h : m === "-" || m === "(" ? "" : m) + l, u = (d === "s" && !isNaN(r) && N !== void 0 ? Y[8 + N / 3] : "") + u + (P && m === "(" ? ")" : ""), H) {
+          for (x = -1, I = r.length; ++x < I; )
+            if (k = r.charCodeAt(x), 48 > k || k > 57) {
+              u = (k === 46 ? o + r.slice(x + 1) : r.slice(x)) + u, r = r.slice(0, x);
+              break;
+            }
+        }
+      }
+      F && !S && (r = t(r, 1 / 0));
+      var z = l.length + r.length + u.length, s = z < E ? new Array(E - z + 1).join(b) : "";
+      switch (F && S && (r = t(s + r, s.length ? E - u.length : 1 / 0), s = ""), p) {
+        case "<":
+          r = l + r + u + s;
+          break;
+        case "=":
+          r = l + s + r + u;
+          break;
+        case "^":
+          r = s.slice(0, z = s.length >> 1) + l + r + u + s.slice(z);
+          break;
+        default:
+          r = s + l + r + u;
+          break;
+      }
+      return a(r);
+    }
+    return G.toString = function() {
+      return f + "";
+    }, G;
+  }
+  function Z(f, g) {
+    var b = Math.max(-8, Math.min(8, Math.floor(K(g) / 3))) * 3, p = Math.pow(10, -b), m = T((f = $(f), f.type = "f", f), { suffix: Y[8 + b / 3] });
+    return function(w) {
+      return m(p * w);
+    };
+  }
+  return {
+    format: T,
+    formatPrefix: Z
+  };
+}
+var A, tn, rn;
+en({
+  thousands: ",",
+  grouping: [3],
+  currency: ["$", ""]
+});
+function en(n) {
+  return A = nn(n), tn = A.format, rn = A.formatPrefix, A;
+}
+export {
+  rn as a,
+  tn as b,
+  K as e,
+  $ as f
+};