@antdv-next/x 0.2.0 → 1.0.0

package/dist-browser/dagre-KLK3FWXG-CFC0naVr.js

@@ -0,0 +1,294 @@
+import { g as e, h as t } from "./src-BukXhifV.js";
+import { r as n } from "./_baseUniq-Ch3HuHeT.js";
+import { s as r } from "./_basePickBy-Cy7KVmkk.js";
+import { t as i } from "./dagre-BJOzGlhW.js";
+import "./chunk-GEFDOKGD-P7WhyrTU.js";
+import { t as a } from "./clone-BXDbKCDu.js";
+import { t as o } from "./graphlib-C7ysKz4u.js";
+import { b as s } from "./chunk-7R4GIKGN-DuTRhdsf.js";
+import "./chunk-PU5JKC2W-DkEFvrjH.js";
+import "./chunk-MX3YWQON-MkpK3uBD.js";
+import { n as c } from "./chunk-YBOYWFTD-BUW4AzEX.js";
+import "./chunk-PQ6SQG4A-CQ9Csv7s.js";
+import { a as l, c as u, i as d, l as f, n as p, t as m, u as h } from "./chunk-KYZI473N-DJmSs1gK.js";
+import { a as g, i as _, n as v, r as y, t as b } from "./chunk-O4XLMI2P-e-ZzDQwg.js";
+//#region ../../node_modules/dagre-d3-es/src/graphlib/json.js
+function x(e) {
+	var t = {
+		options: {
+			directed: e.isDirected(),
+			multigraph: e.isMultigraph(),
+			compound: e.isCompound()
+		},
+		nodes: S(e),
+		edges: C(e)
+	};
+	return n(e.graph()) || (t.value = a(e.graph())), t;
+}
+function S(e) {
+	return r(e.nodes(), function(t) {
+		var r = e.node(t), i = e.parent(t), a = { v: t };
+		return n(r) || (a.value = r), n(i) || (a.parent = i), a;
+	});
+}
+function C(e) {
+	return r(e.edges(), function(t) {
+		var r = e.edge(t), i = {
+			v: t.v,
+			w: t.w
+		};
+		return n(t.name) || (i.name = t.name), n(r) || (i.value = r), i;
+	});
+}
+//#endregion
+//#region ../../node_modules/mermaid/dist/chunks/mermaid.core/dagre-KLK3FWXG.mjs
+var w = /* @__PURE__ */ new Map(), T = /* @__PURE__ */ new Map(), E = /* @__PURE__ */ new Map(), D = /* @__PURE__ */ t(() => {
+	T.clear(), E.clear(), w.clear();
+}, "clear"), O = /* @__PURE__ */ t((t, n) => {
+	let r = T.get(n) || [];
+	return e.trace("In isDescendant", n, " ", t, " = ", r.includes(t)), r.includes(t);
+}, "isDescendant"), k = /* @__PURE__ */ t((t, n) => {
+	let r = T.get(n) || [];
+	return e.info("Descendants of ", n, " is ", r), e.info("Edge is ", t), t.v === n || t.w === n ? !1 : r ? r.includes(t.v) || O(t.v, n) || O(t.w, n) || r.includes(t.w) : (e.debug("Tilt, ", n, ",not in descendants"), !1);
+}, "edgeInCluster"), A = /* @__PURE__ */ t((t, n, r, i) => {
+	e.warn("Copying children of ", t, "root", i, "data", n.node(t), i);
+	let a = n.children(t) || [];
+	t !== i && a.push(t), e.warn("Copying (nodes) clusterId", t, "nodes", a), a.forEach((a) => {
+		if (n.children(a).length > 0) A(a, n, r, i);
+		else {
+			let o = n.node(a);
+			e.info("cp ", a, " to ", i, " with parent ", t), r.setNode(a, o), i !== n.parent(a) && (e.warn("Setting parent", a, n.parent(a)), r.setParent(a, n.parent(a))), t !== i && a !== t ? (e.debug("Setting parent", a, t), r.setParent(a, t)) : (e.info("In copy ", t, "root", i, "data", n.node(t), i), e.debug("Not Setting parent for node=", a, "cluster!==rootId", t !== i, "node!==clusterId", a !== t));
+			let s = n.edges(a);
+			e.debug("Copying Edges", s), s.forEach((a) => {
+				e.info("Edge", a);
+				let o = n.edge(a.v, a.w, a.name);
+				e.info("Edge data", o, i);
+				try {
+					k(a, i) ? (e.info("Copying as ", a.v, a.w, o, a.name), r.setEdge(a.v, a.w, o, a.name), e.info("newGraph edges ", r.edges(), r.edge(r.edges()[0]))) : e.info("Skipping copy of edge ", a.v, "-->", a.w, " rootId: ", i, " clusterId:", t);
+				} catch (t) {
+					e.error(t);
+				}
+			});
+		}
+		e.debug("Removing node", a), n.removeNode(a);
+	});
+}, "copy"), j = /* @__PURE__ */ t((e, t) => {
+	let n = t.children(e), r = [...n];
+	for (let i of n) E.set(i, e), r = [...r, ...j(i, t)];
+	return r;
+}, "extractDescendants"), M = /* @__PURE__ */ t((e, t, n) => {
+	let r = e.edges().filter((e) => e.v === t || e.w === t), i = e.edges().filter((e) => e.v === n || e.w === n), a = r.map((e) => ({
+		v: e.v === t ? n : e.v,
+		w: e.w === t ? t : e.w
+	})), o = i.map((e) => ({
+		v: e.v,
+		w: e.w
+	}));
+	return a.filter((e) => o.some((t) => e.v === t.v && e.w === t.w));
+}, "findCommonEdges"), N = /* @__PURE__ */ t((t, n, r) => {
+	let i = n.children(t);
+	if (e.trace("Searching children of id ", t, i), i.length < 1) return t;
+	let a;
+	for (let e of i) {
+		let t = N(e, n, r), i = M(n, r, t);
+		if (t) if (i.length > 0) a = t;
+		else return t;
+	}
+	return a;
+}, "findNonClusterChild"), P = /* @__PURE__ */ t((e) => !w.has(e) || !w.get(e).externalConnections ? e : w.has(e) ? w.get(e).id : e, "getAnchorId"), F = /* @__PURE__ */ t((t, n) => {
+	if (!t || n > 10) {
+		e.debug("Opting out, no graph ");
+		return;
+	} else e.debug("Opting in, graph ");
+	t.nodes().forEach(function(n) {
+		t.children(n).length > 0 && (e.warn("Cluster identified", n, " Replacement id in edges: ", N(n, t, n)), T.set(n, j(n, t)), w.set(n, {
+			id: N(n, t, n),
+			clusterData: t.node(n)
+		}));
+	}), t.nodes().forEach(function(n) {
+		let r = t.children(n), i = t.edges();
+		r.length > 0 ? (e.debug("Cluster identified", n, T), i.forEach((t) => {
+			O(t.v, n) ^ O(t.w, n) && (e.warn("Edge: ", t, " leaves cluster ", n), e.warn("Descendants of XXX ", n, ": ", T.get(n)), w.get(n).externalConnections = !0);
+		})) : e.debug("Not a cluster ", n, T);
+	});
+	for (let e of w.keys()) {
+		let n = w.get(e).id, r = t.parent(n);
+		r !== e && w.has(r) && !w.get(r).externalConnections && (w.get(e).id = r);
+	}
+	t.edges().forEach(function(n) {
+		let r = t.edge(n);
+		e.warn("Edge " + n.v + " -> " + n.w + ": " + JSON.stringify(n)), e.warn("Edge " + n.v + " -> " + n.w + ": " + JSON.stringify(t.edge(n)));
+		let i = n.v, a = n.w;
+		if (e.warn("Fix XXX", w, "ids:", n.v, n.w, "Translating: ", w.get(n.v), " --- ", w.get(n.w)), w.get(n.v) || w.get(n.w)) {
+			if (e.warn("Fixing and trying - removing XXX", n.v, n.w, n.name), i = P(n.v), a = P(n.w), t.removeEdge(n.v, n.w, n.name), i !== n.v) {
+				let e = t.parent(i);
+				w.get(e).externalConnections = !0, r.fromCluster = n.v;
+			}
+			if (a !== n.w) {
+				let e = t.parent(a);
+				w.get(e).externalConnections = !0, r.toCluster = n.w;
+			}
+			e.warn("Fix Replacing with XXX", i, a, n.name), t.setEdge(i, a, r, n.name);
+		}
+	}), e.warn("Adjusted Graph", x(t)), I(t, 0), e.trace(w);
+}, "adjustClustersAndEdges"), I = /* @__PURE__ */ t((t, n) => {
+	if (e.warn("extractor - ", n, x(t), t.children("D")), n > 10) {
+		e.error("Bailing out");
+		return;
+	}
+	let r = t.nodes(), i = !1;
+	for (let e of r) {
+		let n = t.children(e);
+		i ||= n.length > 0;
+	}
+	if (!i) {
+		e.debug("Done, no node has children", t.nodes());
+		return;
+	}
+	e.debug("Nodes = ", r, n);
+	for (let i of r) if (e.debug("Extracting node", i, w, w.has(i) && !w.get(i).externalConnections, !t.parent(i), t.node(i), t.children("D"), " Depth ", n), !w.has(i)) e.debug("Not a cluster", i, n);
+	else if (!w.get(i).externalConnections && t.children(i) && t.children(i).length > 0) {
+		e.warn("Cluster without external connections, without a parent and with children", i, n);
+		let r = t.graph().rankdir === "TB" ? "LR" : "TB";
+		w.get(i)?.clusterData?.dir && (r = w.get(i).clusterData.dir, e.warn("Fixing dir", w.get(i).clusterData.dir, r));
+		let a = new o({
+			multigraph: !0,
+			compound: !0
+		}).setGraph({
+			rankdir: r,
+			nodesep: 50,
+			ranksep: 50,
+			marginx: 8,
+			marginy: 8
+		}).setDefaultEdgeLabel(function() {
+			return {};
+		});
+		e.warn("Old graph before copy", x(t)), A(i, t, a, i), t.setNode(i, {
+			clusterNode: !0,
+			id: i,
+			clusterData: w.get(i).clusterData,
+			label: w.get(i).label,
+			graph: a
+		}), e.warn("New graph after copy node: (", i, ")", x(a)), e.debug("Old graph after copy", x(t));
+	} else e.warn("Cluster ** ", i, " **not meeting the criteria !externalConnections:", !w.get(i).externalConnections, " no parent: ", !t.parent(i), " children ", t.children(i) && t.children(i).length > 0, t.children("D"), n), e.debug(w);
+	r = t.nodes(), e.warn("New list of nodes", r);
+	for (let i of r) {
+		let r = t.node(i);
+		e.warn(" Now next level", i, r), r?.clusterNode && I(r.graph, n + 1);
+	}
+}, "extractor"), L = /* @__PURE__ */ t((e, t) => {
+	if (t.length === 0) return [];
+	let n = Object.assign([], t);
+	return t.forEach((t) => {
+		let r = L(e, e.children(t));
+		n = [...n, ...r];
+	}), n;
+}, "sorter"), R = /* @__PURE__ */ t((e) => L(e, e.children()), "sortNodesByHierarchy"), z = /* @__PURE__ */ t(async (n, r, a, o, s, p) => {
+	e.warn("Graph in recursive render:XAX", x(r), s);
+	let m = r.graph().rankdir;
+	e.trace("Dir in recursive render - dir:", m);
+	let _ = n.insert("g").attr("class", "root");
+	r.nodes() ? e.info("Recursive render XXX", r.nodes()) : e.info("No nodes found for", r), r.edges().length > 0 && e.info("Recursive edges", r.edge(r.edges()[0]));
+	let b = _.insert("g").attr("class", "clusters"), S = _.insert("g").attr("class", "edgePaths"), C = _.insert("g").attr("class", "edgeLabels"), T = _.insert("g").attr("class", "nodes");
+	await Promise.all(r.nodes().map(async function(t) {
+		let n = r.node(t);
+		if (s !== void 0) {
+			let n = JSON.parse(JSON.stringify(s.clusterData));
+			e.trace("Setting data for parent cluster XXX\n Node.id = ", t, "\n data=", n.height, "\nParent cluster", s.height), r.setNode(s.id, n), r.parent(t) || (e.trace("Setting parent", t, s.id), r.setParent(t, s.id, n));
+		}
+		if (e.info("(Insert) Node XXX" + t + ": " + JSON.stringify(r.node(t))), n?.clusterNode) {
+			e.info("Cluster identified XBX", t, n.width, r.node(t));
+			let { ranksep: i, nodesep: s } = r.graph();
+			n.graph.setGraph({
+				...n.graph.graph(),
+				ranksep: i + 25,
+				nodesep: s
+			});
+			let c = await z(T, n.graph, a, o, r.node(t), p), l = c.elem;
+			h(n, l), n.diff = c.diff || 0, e.info("New compound node after recursive render XAX", t, "width", n.width, "height", n.height), f(l, n);
+		} else r.children(t).length > 0 ? (e.trace("Cluster - the non recursive path XBX", t, n.id, n, n.width, "Graph:", r), e.trace(N(n.id, r)), w.set(n.id, {
+			id: N(n.id, r),
+			node: n
+		})) : (e.trace("Node - the non recursive path XAX", t, T, r.node(t), m), await l(T, r.node(t), {
+			config: p,
+			dir: m
+		}));
+	})), await (/* @__PURE__ */ t(async () => {
+		let t = r.edges().map(async function(t) {
+			let n = r.edge(t.v, t.w, t.name);
+			e.info("Edge " + t.v + " -> " + t.w + ": " + JSON.stringify(t)), e.info("Edge " + t.v + " -> " + t.w + ": ", t, " ", JSON.stringify(r.edge(t))), e.info("Fix", w, "ids:", t.v, t.w, "Translating: ", w.get(t.v), w.get(t.w)), await y(C, n);
+		});
+		await Promise.all(t);
+	}, "processEdges"))(), e.info("Graph before layout:", JSON.stringify(x(r))), e.info("############################################# XXX"), e.info("###                Layout                 ### XXX"), e.info("############################################# XXX"), i(r), e.info("Graph after layout:", JSON.stringify(x(r)));
+	let E = 0, { subGraphTitleTotalMargin: D } = c(p);
+	return await Promise.all(R(r).map(async function(t) {
+		let n = r.node(t);
+		if (e.info("Position XBX => " + t + ": (" + n.x, "," + n.y, ") width: ", n.width, " height: ", n.height), n?.clusterNode) n.y += D, e.info("A tainted cluster node XBX1", t, n.id, n.width, n.height, n.x, n.y, r.parent(t)), w.get(n.id).node = n, u(n);
+		else if (r.children(t).length > 0) {
+			e.info("A pure cluster node XBX1", t, n.id, n.x, n.y, n.width, n.height, r.parent(t)), n.height += D, r.node(n.parentId);
+			let i = n?.padding / 2 || 0, a = n?.labelBBox?.height || 0, o = a - i || 0;
+			e.debug("OffsetY", o, "labelHeight", a, "halfPadding", i), await d(b, n), w.get(n.id).node = n;
+		} else {
+			let t = r.node(n.parentId);
+			n.y += D / 2, e.info("A regular node XBX1 - using the padding", n.id, "parent", n.parentId, n.width, n.height, n.x, n.y, "offsetY", n.offsetY, "parent", t, t?.offsetY, n), u(n);
+		}
+	})), r.edges().forEach(function(t) {
+		let n = r.edge(t);
+		e.info("Edge " + t.v + " -> " + t.w + ": " + JSON.stringify(n), n), n.points.forEach((e) => e.y += D / 2), g(n, v(S, n, w, a, r.node(t.v), r.node(t.w), o));
+	}), r.nodes().forEach(function(t) {
+		let n = r.node(t);
+		e.info(t, n.type, n.diff), n.isGroup && (E = n.diff);
+	}), e.warn("Returning from recursive render XAX", _, E), {
+		elem: _,
+		diff: E
+	};
+}, "recursiveRender"), B = /* @__PURE__ */ t(async (t, n) => {
+	let r = new o({
+		multigraph: !0,
+		compound: !0
+	}).setGraph({
+		rankdir: t.direction,
+		nodesep: t.config?.nodeSpacing || t.config?.flowchart?.nodeSpacing || t.nodeSpacing,
+		ranksep: t.config?.rankSpacing || t.config?.flowchart?.rankSpacing || t.rankSpacing,
+		marginx: 8,
+		marginy: 8
+	}).setDefaultEdgeLabel(function() {
+		return {};
+	}), i = n.select("g");
+	_(i, t.markers, t.type, t.diagramId), p(), b(), m(), D(), t.nodes.forEach((e) => {
+		r.setNode(e.id, { ...e }), e.parentId && r.setParent(e.id, e.parentId);
+	}), e.debug("Edges:", t.edges), t.edges.forEach((e) => {
+		if (e.start === e.end) {
+			let t = e.start, n = t + "---" + t + "---1", i = t + "---" + t + "---2", a = r.node(t);
+			r.setNode(n, {
+				domId: n,
+				id: n,
+				parentId: a.parentId,
+				labelStyle: "",
+				label: "",
+				padding: 0,
+				shape: "labelRect",
+				style: "",
+				width: 10,
+				height: 10
+			}), r.setParent(n, a.parentId), r.setNode(i, {
+				domId: i,
+				id: i,
+				parentId: a.parentId,
+				labelStyle: "",
+				padding: 0,
+				shape: "labelRect",
+				label: "",
+				style: "",
+				width: 10,
+				height: 10
+			}), r.setParent(i, a.parentId);
+			let o = structuredClone(e), s = structuredClone(e), c = structuredClone(e);
+			o.label = "", o.arrowTypeEnd = "none", o.id = t + "-cyclic-special-1", s.arrowTypeStart = "none", s.arrowTypeEnd = "none", s.id = t + "-cyclic-special-mid", c.label = "", a.isGroup && (o.fromCluster = t, c.toCluster = t), c.id = t + "-cyclic-special-2", c.arrowTypeStart = "none", r.setEdge(t, n, o, t + "-cyclic-special-0"), r.setEdge(n, i, s, t + "-cyclic-special-1"), r.setEdge(i, t, c, t + "-cyc<lic-special-2");
+		} else r.setEdge(e.start, e.end, { ...e }, e.id);
+	}), e.warn("Graph at first:", JSON.stringify(x(r))), F(r), e.warn("Graph after XAX:", JSON.stringify(x(r)));
+	let a = s();
+	await z(i, r, t.type, t.diagramId, void 0, a);
+}, "render");
+//#endregion
+export { B as render };

package/dist-browser/defaultLocale-BaPFSbai.js

@@ -0,0 +1,201 @@
+//#region ../../node_modules/d3-format/src/formatDecimal.js
+function e(e) {
+	return Math.abs(e = Math.round(e)) >= 1e21 ? e.toLocaleString("en").replace(/,/g, "") : e.toString(10);
+}
+function t(e, t) {
+	if (!isFinite(e) || e === 0) return null;
+	var n = (e = t ? e.toExponential(t - 1) : e.toExponential()).indexOf("e"), r = e.slice(0, n);
+	return [r.length > 1 ? r[0] + r.slice(2) : r, +e.slice(n + 1)];
+}
+//#endregion
+//#region ../../node_modules/d3-format/src/exponent.js
+function n(e) {
+	return e = t(Math.abs(e)), e ? e[1] : NaN;
+}
+//#endregion
+//#region ../../node_modules/d3-format/src/formatGroup.js
+function r(e, t) {
+	return function(n, r) {
+		for (var i = n.length, a = [], o = 0, s = e[0], c = 0; i > 0 && s > 0 && (c + s + 1 > r && (s = Math.max(1, r - c)), a.push(n.substring(i -= s, i + s)), !((c += s + 1) > r));) s = e[o = (o + 1) % e.length];
+		return a.reverse().join(t);
+	};
+}
+//#endregion
+//#region ../../node_modules/d3-format/src/formatNumerals.js
+function i(e) {
+	return function(t) {
+		return t.replace(/[0-9]/g, function(t) {
+			return e[+t];
+		});
+	};
+}
+//#endregion
+//#region ../../node_modules/d3-format/src/formatSpecifier.js
+var a = /^(?:(.)?([<>=^]))?([+\-( ])?([$#])?(0)?(\d+)?(,)?(\.\d+)?(~)?([a-z%])?$/i;
+function o(e) {
+	if (!(t = a.exec(e))) throw Error("invalid format: " + e);
+	var t;
+	return new s({
+		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]
+	});
+}
+o.prototype = s.prototype;
+function s(e) {
+	this.fill = e.fill === void 0 ? " " : e.fill + "", this.align = e.align === void 0 ? ">" : e.align + "", this.sign = e.sign === void 0 ? "-" : e.sign + "", this.symbol = e.symbol === void 0 ? "" : e.symbol + "", this.zero = !!e.zero, this.width = e.width === void 0 ? void 0 : +e.width, this.comma = !!e.comma, this.precision = e.precision === void 0 ? void 0 : +e.precision, this.trim = !!e.trim, this.type = e.type === void 0 ? "" : e.type + "";
+}
+s.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;
+};
+//#endregion
+//#region ../../node_modules/d3-format/src/formatTrim.js
+function c(e) {
+	out: for (var t = e.length, n = 1, r = -1, i; n < t; ++n) switch (e[n]) {
+		case ".":
+			r = i = n;
+			break;
+		case "0":
+			r === 0 && (r = n), i = n;
+			break;
+		default:
+			if (!+e[n]) break out;
+			r > 0 && (r = 0);
+			break;
+	}
+	return r > 0 ? e.slice(0, r) + e.slice(i + 1) : e;
+}
+//#endregion
+//#region ../../node_modules/d3-format/src/formatPrefixAuto.js
+var l;
+function u(e, n) {
+	var r = t(e, n);
+	if (!r) return l = void 0, e.toPrecision(n);
+	var i = r[0], a = r[1], o = a - (l = Math.max(-8, Math.min(8, Math.floor(a / 3))) * 3) + 1, s = i.length;
+	return o === s ? i : o > s ? i + Array(o - s + 1).join("0") : o > 0 ? i.slice(0, o) + "." + i.slice(o) : "0." + Array(1 - o).join("0") + t(e, Math.max(0, n + o - 1))[0];
+}
+//#endregion
+//#region ../../node_modules/d3-format/src/formatRounded.js
+function d(e, n) {
+	var r = t(e, n);
+	if (!r) return e + "";
+	var i = r[0], a = r[1];
+	return a < 0 ? "0." + Array(-a).join("0") + i : i.length > a + 1 ? i.slice(0, a + 1) + "." + i.slice(a + 1) : i + Array(a - i.length + 2).join("0");
+}
+//#endregion
+//#region ../../node_modules/d3-format/src/formatTypes.js
+var f = {
+	"%": (e, t) => (e * 100).toFixed(t),
+	b: (e) => Math.round(e).toString(2),
+	c: (e) => e + "",
+	d: e,
+	e: (e, t) => e.toExponential(t),
+	f: (e, t) => e.toFixed(t),
+	g: (e, t) => e.toPrecision(t),
+	o: (e) => Math.round(e).toString(8),
+	p: (e, t) => d(e * 100, t),
+	r: d,
+	s: u,
+	X: (e) => Math.round(e).toString(16).toUpperCase(),
+	x: (e) => Math.round(e).toString(16)
+};
+//#endregion
+//#region ../../node_modules/d3-format/src/identity.js
+function p(e) {
+	return e;
+}
+//#endregion
+//#region ../../node_modules/d3-format/src/locale.js
+var m = Array.prototype.map, h = [
+	"y",
+	"z",
+	"a",
+	"f",
+	"p",
+	"n",
+	"µ",
+	"m",
+	"",
+	"k",
+	"M",
+	"G",
+	"T",
+	"P",
+	"E",
+	"Z",
+	"Y"
+];
+function g(e) {
+	var t = e.grouping === void 0 || e.thousands === void 0 ? p : r(m.call(e.grouping, Number), e.thousands + ""), a = e.currency === void 0 ? "" : e.currency[0] + "", s = e.currency === void 0 ? "" : e.currency[1] + "", u = e.decimal === void 0 ? "." : e.decimal + "", d = e.numerals === void 0 ? p : i(m.call(e.numerals, String)), g = e.percent === void 0 ? "%" : e.percent + "", _ = e.minus === void 0 ? "−" : e.minus + "", v = e.nan === void 0 ? "NaN" : e.nan + "";
+	function y(e, n) {
+		e = o(e);
+		var r = e.fill, i = e.align, p = e.sign, m = e.symbol, y = e.zero, b = e.width, x = e.comma, S = e.precision, C = e.trim, w = e.type;
+		w === "n" ? (x = !0, w = "g") : f[w] || (S === void 0 && (S = 12), C = !0, w = "g"), (y || r === "0" && i === "=") && (y = !0, r = "0", i = "=");
+		var T = (n && n.prefix !== void 0 ? n.prefix : "") + (m === "$" ? a : m === "#" && /[boxX]/.test(w) ? "0" + w.toLowerCase() : ""), E = (m === "$" ? s : /[%p]/.test(w) ? g : "") + (n && n.suffix !== void 0 ? n.suffix : ""), D = f[w], O = /[defgprs%]/.test(w);
+		S = S === void 0 ? 6 : /[gprs]/.test(w) ? Math.max(1, Math.min(21, S)) : Math.max(0, Math.min(20, S));
+		function k(e) {
+			var n = T, a = E, o, s, f;
+			if (w === "c") a = D(e) + a, e = "";
+			else {
+				e = +e;
+				var m = e < 0 || 1 / e < 0;
+				if (e = isNaN(e) ? v : D(Math.abs(e), S), C && (e = c(e)), m && +e == 0 && p !== "+" && (m = !1), n = (m ? p === "(" ? p : _ : p === "-" || p === "(" ? "" : p) + n, a = (w === "s" && !isNaN(e) && l !== void 0 ? h[8 + l / 3] : "") + a + (m && p === "(" ? ")" : ""), O) {
+					for (o = -1, s = e.length; ++o < s;) if (f = e.charCodeAt(o), 48 > f || f > 57) {
+						a = (f === 46 ? u + e.slice(o + 1) : e.slice(o)) + a, e = e.slice(0, o);
+						break;
+					}
+				}
+			}
+			x && !y && (e = t(e, Infinity));
+			var g = n.length + e.length + a.length, k = g < b ? Array(b - g + 1).join(r) : "";
+			switch (x && y && (e = t(k + e, k.length ? b - a.length : Infinity), k = ""), i) {
+				case "<":
+					e = n + e + a + k;
+					break;
+				case "=":
+					e = n + k + e + a;
+					break;
+				case "^":
+					e = k.slice(0, g = k.length >> 1) + n + e + a + k.slice(g);
+					break;
+				default:
+					e = k + n + e + a;
+					break;
+			}
+			return d(e);
+		}
+		return k.toString = function() {
+			return e + "";
+		}, k;
+	}
+	function b(e, t) {
+		var r = Math.max(-8, Math.min(8, Math.floor(n(t) / 3))) * 3, i = 10 ** -r, a = y((e = o(e), e.type = "f", e), { suffix: h[8 + r / 3] });
+		return function(e) {
+			return a(i * e);
+		};
+	}
+	return {
+		format: y,
+		formatPrefix: b
+	};
+}
+//#endregion
+//#region ../../node_modules/d3-format/src/defaultLocale.js
+var _, v, y;
+b({
+	thousands: ",",
+	grouping: [3],
+	currency: ["$", ""]
+});
+function b(e) {
+	return _ = g(e), v = _.format, y = _.formatPrefix, _;
+}
+//#endregion
+export { n as i, y as n, o as r, v as t };