@kong-ui-public/documentation 1.4.31 → 1.4.32-pr.2694.d983d66d0.0

package/dist/dagre-2BBEFEWP-Bh_bYuL8-Cej31YXN.js

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

package/dist/defaultLocale-D7EN2tov-CK6dgF7Y.js

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