bg-editor 0.0.7 → 0.0.8

package/dist/dagre-6UL2VRFP-BPH1NIvl.js

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

package/dist/defaultLocale-DEnRyJdC.js

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