@kong-ui-public/documentation 1.4.17-pr.2640.fb8bab909.0 → 1.4.17

package/dist/{dagre-4EVJKHTY-CcAruc30-B3UMlKNl.js → dagre-2BBEFEWP-Bh_bYuL8-Cej31YXN.js}

@@ -1,9 +1,9 @@
-import { _ as w, 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-CMZig9xg.js";
-import { L as k } from "./graph-BYZMvqpu-BXRs5843.js";
-import { o as V } from "./layout-BHI4imdk-CESYC-il.js";
-import { E as x } from "./_baseUniq-SAfYgIkf-buEvGj9H.js";
-import { a as W } from "./clone-_5SW34SG-DOuhA6mG.js";
-import { g as G } from "./_basePickBy-zlkqRmFy-D6w9JBLu.js";
+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: {
@@ -14,29 +14,29 @@ function X(e) {
     nodes: Z(e),
     edges: ee(e)
   };
-  return x(e.graph()) || (n.value = W(e.graph())), n;
+  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 x(r) || (d.value = r), x(s) || (d.parent = s), d;
+    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 x(n.name) || (s.name = n.name), x(r) || (s.value = r), s;
+    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__ */ w(() => {
+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__ */ w((e, n) => {
+}, "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__ */ w((e, n) => {
+}, "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__ */ w((e, n, r, s) => {
+}, "edgeInCluster"), J = /* @__PURE__ */ v((e, n, r, s) => {
   t.warn(
     "Copying children of ",
     e,
@@ -83,22 +83,22 @@ var u = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), B = /* @__PURE
     }
     t.debug("Removing node", c), n.removeNode(c);
   });
-}, "copy"), P = /* @__PURE__ */ w((e, n) => {
+}, "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__ */ w((e, n, r) => {
+}, "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"), S = /* @__PURE__ */ w((e, n, r) => {
+}, "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 = S(c, n, r), l = te(n, r, a);
+    const a = x(c, n, r), l = te(n, r, a);
     if (a)
       if (l.length > 0)
         d = a;
@@ -106,7 +106,7 @@ var u = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), B = /* @__PURE
         return a;
   }
   return d;
-}, "findNonClusterChild"), O = /* @__PURE__ */ w((e) => !u.has(e) || !u.get(e).externalConnections ? e : u.has(e) ? u.get(e).id : e, "getAnchorId"), ie = /* @__PURE__ */ w((e, n) => {
+}, "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;
@@ -117,8 +117,8 @@ var u = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), B = /* @__PURE
       "Cluster identified",
       r,
       " Replacement id in edges: ",
-      S(r, e, r)
-    ), N.set(r, P(r, e)), u.set(r, { id: S(r, e, r), clusterData: e.node(r) }));
+      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) => {
@@ -155,8 +155,8 @@ var u = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), B = /* @__PURE
       }
       t.warn("Fix Replacing with XXX", d, c, r.name), e.setEdge(d, c, s, r.name);
     }
-  }), t.warn("Adjusted Graph", X(e)), A(e, 0), t.trace(u);
-}, "adjustClustersAndEdges"), A = /* @__PURE__ */ w((e, n) => {
+  }), 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");
@@ -228,23 +228,23 @@ var u = /* @__PURE__ */ new Map(), N = /* @__PURE__ */ new Map(), B = /* @__PURE
   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 && A(l.graph, n + 1);
+    t.warn(" Now next level", a, l), l != null && l.clusterNode && T(l.graph, n + 1);
   }
-}, "extractor"), R = /* @__PURE__ */ w((e, n) => {
+}, "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 = R(e, d);
+    const d = e.children(s), c = A(e, d);
     r = [...r, ...c];
   }), r;
-}, "sorter"), ae = /* @__PURE__ */ w((e) => R(e, e.children()), "sortNodesByHierarchy"), T = /* @__PURE__ */ w(async (e, n, r, s, d, c) => {
+}, "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"), h = l.insert("g").attr("class", "nodes");
+  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);
@@ -264,14 +264,14 @@ Parent cluster`,
       }
       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: v } = n.graph();
+        const { ranksep: i, nodesep: w } = n.graph();
         o.graph.setGraph({
           ...o.graph.graph(),
           ranksep: i + 25,
-          nodesep: v
+          nodesep: w
         });
-        const m = await T(
-          h,
+        const m = await R(
+          p,
           o.graph,
           r,
           s,
@@ -298,9 +298,9 @@ Parent cluster`,
           o.width,
           "Graph:",
           n
-        ), t.trace(S(o.id, n)), u.set(o.id, { id: S(o.id, n), node: o })) : (t.trace("Node - the non recursive path XAX", g, h, n.node(g), a), await $(h, n.node(g), { config: c, dir: a }));
+        ), 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__ */ w(async () => {
+  ), 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(
@@ -316,7 +316,7 @@ Parent cluster`,
     });
     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 p = 0, { subGraphTitleTotalMargin: y } = z(c);
+  let h = 0, { subGraphTitleTotalMargin: y } = z(c);
   return await Promise.all(
     ae(n).map(async function(g) {
       var o;
@@ -350,10 +350,10 @@ Parent cluster`,
           i.height,
           n.parent(g)
         ), i.height += y, n.node(i.parentId);
-        const v = (i == null ? void 0 : i.padding) / 2 || 0, m = ((o = i == null ? void 0 : i.labelBBox) == null ? void 0 : o.height) || 0, b = m - v || 0;
-        t.debug("OffsetY", b, "labelHeight", m, "halfPadding", v), await K(f, i), u.get(i.id).node = i;
+        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 v = n.node(i.parentId);
+        const w = n.node(i.parentId);
         i.y += y / 2, t.info(
           "A regular node XBX1 - using the padding",
           i.id,
@@ -366,8 +366,8 @@ Parent cluster`,
           "offsetY",
           i.offsetY,
           "parent",
-          v,
-          v == null ? void 0 : v.offsetY,
+          w,
+          w == null ? void 0 : w.offsetY,
           i
         ), D(i);
       }
@@ -376,14 +376,14 @@ Parent cluster`,
     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 v = n.node(g.w);
-    const m = Q(E, o, u, r, i, v, s);
+    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 && (p = o.diff);
-  }), t.warn("Returning from recursive render XAX", l, p), { elem: l, diff: p };
-}, "recursiveRender"), ue = /* @__PURE__ */ w(async (e, n) => {
+    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,
@@ -397,11 +397,11 @@ Parent cluster`,
   }).setDefaultEdgeLabel(function() {
     return {};
   }), E = n.select("g");
-  L(E, e.markers, e.type, e.diagramId), M(), j(), F(), ne(), e.nodes.forEach((h) => {
-    f.setNode(h.id, { ...h }), h.parentId && f.setParent(h.id, h.parentId);
-  }), t.debug("Edges:", e.edges), e.edges.forEach((h) => {
-    if (h.start === h.end) {
-      const p = h.start, y = p + "---" + p + "---1", g = p + "---" + p + "---2", o = f.node(p);
+  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,
@@ -427,13 +427,13 @@ Parent cluster`,
         width: 10,
         height: 10
       }), f.setParent(g, o.parentId);
-      const i = structuredClone(h), v = structuredClone(h), m = structuredClone(h);
-      i.label = "", i.arrowTypeEnd = "none", i.id = p + "-cyclic-special-1", v.arrowTypeEnd = "none", v.id = p + "-cyclic-special-mid", m.label = "", o.isGroup && (i.fromCluster = p, m.toCluster = p), m.id = p + "-cyclic-special-2", f.setEdge(p, y, i, p + "-cyclic-special-0"), f.setEdge(y, g, v, p + "-cyclic-special-1"), f.setEdge(g, p, m, p + "-cyc<lic-special-2");
+      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(h.start, h.end, { ...h }, h.id);
+      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 T(
+  await R(
     E,
     f,
     e.type,

package/dist/defaultLocale-D7EN2tov-CK6dgF7Y.js

@@ -0,0 +1,171 @@
+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
+};