1 | import { X as cn, Z as D, $ as U, a0 as Y, a1 as hn } from "./mermaid-9357f3d0.js";
|
2 | import { i as sn } from "./init-f9637058.js";
|
3 | function F(n, t) {
|
4 | return n == null || t == null ? NaN : n < t ? -1 : n > t ? 1 : n >= t ? 0 : NaN;
|
5 | }
|
6 | function mn(n, t) {
|
7 | return n == null || t == null ? NaN : t < n ? -1 : t > n ? 1 : t >= n ? 0 : NaN;
|
8 | }
|
9 | function nn(n) {
|
10 | let t, e, r;
|
11 | n.length !== 2 ? (t = F, e = (u, h) => F(n(u), h), r = (u, h) => n(u) - h) : (t = n === F || n === mn ? n : ln, e = n, r = n);
|
12 | function i(u, h, f = 0, l = u.length) {
|
13 | if (f < l) {
|
14 | if (t(h, h) !== 0)
|
15 | return l;
|
16 | do {
|
17 | const c = f + l >>> 1;
|
18 | e(u[c], h) < 0 ? f = c + 1 : l = c;
|
19 | } while (f < l);
|
20 | }
|
21 | return f;
|
22 | }
|
23 | function o(u, h, f = 0, l = u.length) {
|
24 | if (f < l) {
|
25 | if (t(h, h) !== 0)
|
26 | return l;
|
27 | do {
|
28 | const c = f + l >>> 1;
|
29 | e(u[c], h) <= 0 ? f = c + 1 : l = c;
|
30 | } while (f < l);
|
31 | }
|
32 | return f;
|
33 | }
|
34 | function a(u, h, f = 0, l = u.length) {
|
35 | const c = i(u, h, f, l - 1);
|
36 | return c > f && r(u[c - 1], h) > -r(u[c], h) ? c - 1 : c;
|
37 | }
|
38 | return { left: i, center: a, right: o };
|
39 | }
|
40 | function ln() {
|
41 | return 0;
|
42 | }
|
43 | function dn(n) {
|
44 | return n === null ? NaN : +n;
|
45 | }
|
46 | const gn = nn(F), Mn = gn.right;
|
47 | nn(dn).center;
|
48 | const yn = Mn;
|
49 | var T = Math.sqrt(50), I = Math.sqrt(10), q = Math.sqrt(2);
|
50 | function pn(n, t, e) {
|
51 | var r, i = -1, o, a, u;
|
52 | if (t = +t, n = +n, e = +e, n === t && e > 0)
|
53 | return [n];
|
54 | if ((r = t < n) && (o = n, n = t, t = o), (u = tn(n, t, e)) === 0 || !isFinite(u))
|
55 | return [];
|
56 | if (u > 0) {
|
57 | let h = Math.round(n / u), f = Math.round(t / u);
|
58 | for (h * u < n && ++h, f * u > t && --f, a = new Array(o = f - h + 1); ++i < o; )
|
59 | a[i] = (h + i) * u;
|
60 | } else {
|
61 | u = -u;
|
62 | let h = Math.round(n * u), f = Math.round(t * u);
|
63 | for (h / u < n && ++h, f / u > t && --f, a = new Array(o = f - h + 1); ++i < o; )
|
64 | a[i] = (h + i) / u;
|
65 | }
|
66 | return r && a.reverse(), a;
|
67 | }
|
68 | function tn(n, t, e) {
|
69 | var r = (t - n) / Math.max(0, e), i = Math.floor(Math.log(r) / Math.LN10), o = r / Math.pow(10, i);
|
70 | return i >= 0 ? (o >= T ? 10 : o >= I ? 5 : o >= q ? 2 : 1) * Math.pow(10, i) : -Math.pow(10, -i) / (o >= T ? 10 : o >= I ? 5 : o >= q ? 2 : 1);
|
71 | }
|
72 | function wn(n, t, e) {
|
73 | var r = Math.abs(t - n) / Math.max(0, e), i = Math.pow(10, Math.floor(Math.log(r) / Math.LN10)), o = r / i;
|
74 | return o >= T ? i *= 10 : o >= I ? i *= 5 : o >= q && (i *= 2), t < n ? -i : i;
|
75 | }
|
76 | function Nn(n, t) {
|
77 | t || (t = []);
|
78 | var e = n ? Math.min(t.length, n.length) : 0, r = t.slice(), i;
|
79 | return function(o) {
|
80 | for (i = 0; i < e; ++i)
|
81 | r[i] = n[i] * (1 - o) + t[i] * o;
|
82 | return r;
|
83 | };
|
84 | }
|
85 | function kn(n) {
|
86 | return ArrayBuffer.isView(n) && !(n instanceof DataView);
|
87 | }
|
88 | function vn(n, t) {
|
89 | var e = t ? t.length : 0, r = n ? Math.min(e, n.length) : 0, i = new Array(r), o = new Array(e), a;
|
90 | for (a = 0; a < r; ++a)
|
91 | i[a] = X(n[a], t[a]);
|
92 | for (; a < e; ++a)
|
93 | o[a] = t[a];
|
94 | return function(u) {
|
95 | for (a = 0; a < r; ++a)
|
96 | o[a] = i[a](u);
|
97 | return o;
|
98 | };
|
99 | }
|
100 | function xn(n, t) {
|
101 | var e = new Date();
|
102 | return n = +n, t = +t, function(r) {
|
103 | return e.setTime(n * (1 - r) + t * r), e;
|
104 | };
|
105 | }
|
106 | function An(n, t) {
|
107 | var e = {}, r = {}, i;
|
108 | (n === null || typeof n != "object") && (n = {}), (t === null || typeof t != "object") && (t = {});
|
109 | for (i in t)
|
110 | i in n ? e[i] = X(n[i], t[i]) : r[i] = t[i];
|
111 | return function(o) {
|
112 | for (i in e)
|
113 | r[i] = e[i](o);
|
114 | return r;
|
115 | };
|
116 | }
|
117 | function X(n, t) {
|
118 | var e = typeof t, r;
|
119 | return t == null || e === "boolean" ? cn(t) : (e === "number" ? D : e === "string" ? (r = U(t)) ? (t = r, Y) : hn : t instanceof U ? Y : t instanceof Date ? xn : kn(t) ? Nn : Array.isArray(t) ? vn : typeof t.valueOf != "function" && typeof t.toString != "function" || isNaN(t) ? An : D)(n, t);
|
120 | }
|
121 | function Sn(n, t) {
|
122 | return n = +n, t = +t, function(e) {
|
123 | return Math.round(n * (1 - e) + t * e);
|
124 | };
|
125 | }
|
126 | function bn(n) {
|
127 | return Math.abs(n = Math.round(n)) >= 1e21 ? n.toLocaleString("en").replace(/,/g, "") : n.toString(10);
|
128 | }
|
129 | function R(n, t) {
|
130 | if ((e = (n = t ? n.toExponential(t - 1) : n.toExponential()).indexOf("e")) < 0)
|
131 | return null;
|
132 | var e, r = n.slice(0, e);
|
133 | return [
|
134 | r.length > 1 ? r[0] + r.slice(2) : r,
|
135 | +n.slice(e + 1)
|
136 | ];
|
137 | }
|
138 | function A(n) {
|
139 | return n = R(Math.abs(n)), n ? n[1] : NaN;
|
140 | }
|
141 | function jn(n, t) {
|
142 | return function(e, r) {
|
143 | for (var i = e.length, o = [], a = 0, u = n[0], h = 0; i > 0 && u > 0 && (h + u + 1 > r && (u = Math.max(1, r - h)), o.push(e.substring(i -= u, i + u)), !((h += u + 1) > r)); )
|
144 | u = n[a = (a + 1) % n.length];
|
145 | return o.reverse().join(t);
|
146 | };
|
147 | }
|
148 | function Pn(n) {
|
149 | return function(t) {
|
150 | return t.replace(/[0-9]/g, function(e) {
|
151 | return n[+e];
|
152 | });
|
153 | };
|
154 | }
|
155 | var zn = /^(?:(.)?([<>=^]))?([+\-( ])?([$#])?(0)?(\d+)?(,)?(\.\d+)?(~)?([a-z%])?$/i;
|
156 | function E(n) {
|
157 | if (!(t = zn.exec(n)))
|
158 | throw new Error("invalid format: " + n);
|
159 | var t;
|
160 | return new B({
|
161 | fill: t[1],
|
162 | align: t[2],
|
163 | sign: t[3],
|
164 | symbol: t[4],
|
165 | zero: t[5],
|
166 | width: t[6],
|
167 | comma: t[7],
|
168 | precision: t[8] && t[8].slice(1),
|
169 | trim: t[9],
|
170 | type: t[10]
|
171 | });
|
172 | }
|
173 | E.prototype = B.prototype;
|
174 | function B(n) {
|
175 | 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 + "";
|
176 | }
|
177 | B.prototype.toString = function() {
|
178 | 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;
|
179 | };
|
180 | function $n(n) {
|
181 | n:
|
182 | for (var t = n.length, e = 1, r = -1, i; e < t; ++e)
|
183 | switch (n[e]) {
|
184 | case ".":
|
185 | r = i = e;
|
186 | break;
|
187 | case "0":
|
188 | r === 0 && (r = e), i = e;
|
189 | break;
|
190 | default:
|
191 | if (!+n[e])
|
192 | break n;
|
193 | r > 0 && (r = 0);
|
194 | break;
|
195 | }
|
196 | return r > 0 ? n.slice(0, r) + n.slice(i + 1) : n;
|
197 | }
|
198 | var rn;
|
199 | function Fn(n, t) {
|
200 | var e = R(n, t);
|
201 | if (!e)
|
202 | return n + "";
|
203 | var r = e[0], i = e[1], o = i - (rn = Math.max(-8, Math.min(8, Math.floor(i / 3))) * 3) + 1, a = r.length;
|
204 | return o === a ? r : o > a ? r + new Array(o - a + 1).join("0") : o > 0 ? r.slice(0, o) + "." + r.slice(o) : "0." + new Array(1 - o).join("0") + R(n, Math.max(0, t + o - 1))[0];
|
205 | }
|
206 | function H(n, t) {
|
207 | var e = R(n, t);
|
208 | if (!e)
|
209 | return n + "";
|
210 | var r = e[0], i = e[1];
|
211 | return i < 0 ? "0." + new Array(-i).join("0") + r : r.length > i + 1 ? r.slice(0, i + 1) + "." + r.slice(i + 1) : r + new Array(i - r.length + 2).join("0");
|
212 | }
|
213 | const J = {
|
214 | "%": (n, t) => (n * 100).toFixed(t),
|
215 | b: (n) => Math.round(n).toString(2),
|
216 | c: (n) => n + "",
|
217 | d: bn,
|
218 | e: (n, t) => n.toExponential(t),
|
219 | f: (n, t) => n.toFixed(t),
|
220 | g: (n, t) => n.toPrecision(t),
|
221 | o: (n) => Math.round(n).toString(8),
|
222 | p: (n, t) => H(n * 100, t),
|
223 | r: H,
|
224 | s: Fn,
|
225 | X: (n) => Math.round(n).toString(16).toUpperCase(),
|
226 | x: (n) => Math.round(n).toString(16)
|
227 | };
|
228 | function K(n) {
|
229 | return n;
|
230 | }
|
231 | var Q = Array.prototype.map, W = ["y", "z", "a", "f", "p", "n", "µ", "m", "", "k", "M", "G", "T", "P", "E", "Z", "Y"];
|
232 | function Rn(n) {
|
233 | var t = n.grouping === void 0 || n.thousands === void 0 ? K : jn(Q.call(n.grouping, Number), n.thousands + ""), e = n.currency === void 0 ? "" : n.currency[0] + "", r = n.currency === void 0 ? "" : n.currency[1] + "", i = n.decimal === void 0 ? "." : n.decimal + "", o = n.numerals === void 0 ? K : Pn(Q.call(n.numerals, String)), a = n.percent === void 0 ? "%" : n.percent + "", u = n.minus === void 0 ? "−" : n.minus + "", h = n.nan === void 0 ? "NaN" : n.nan + "";
|
234 | function f(c) {
|
235 | c = E(c);
|
236 | var m = c.fill, p = c.align, M = c.sign, S = c.symbol, k = c.zero, b = c.width, L = c.comma, w = c.precision, G = c.trim, d = c.type;
|
237 | d === "n" ? (L = !0, d = "g") : J[d] || (w === void 0 && (w = 12), G = !0, d = "g"), (k || m === "0" && p === "=") && (k = !0, m = "0", p = "=");
|
238 | var an = S === "$" ? e : S === "#" && /[boxX]/.test(d) ? "0" + d.toLowerCase() : "", un = S === "$" ? r : /[%p]/.test(d) ? a : "", O = J[d], fn = /[defgprs%]/.test(d);
|
239 | w = w === void 0 ? 6 : /[gprs]/.test(d) ? Math.max(1, Math.min(21, w)) : Math.max(0, Math.min(20, w));
|
240 | function V(s) {
|
241 | var N = an, g = un, v, Z, j;
|
242 | if (d === "c")
|
243 | g = O(s) + g, s = "";
|
244 | else {
|
245 | s = +s;
|
246 | var P = s < 0 || 1 / s < 0;
|
247 | if (s = isNaN(s) ? h : O(Math.abs(s), w), G && (s = $n(s)), P && +s == 0 && M !== "+" && (P = !1), N = (P ? M === "(" ? M : u : M === "-" || M === "(" ? "" : M) + N, g = (d === "s" ? W[8 + rn / 3] : "") + g + (P && M === "(" ? ")" : ""), fn) {
|
248 | for (v = -1, Z = s.length; ++v < Z; )
|
249 | if (j = s.charCodeAt(v), 48 > j || j > 57) {
|
250 | g = (j === 46 ? i + s.slice(v + 1) : s.slice(v)) + g, s = s.slice(0, v);
|
251 | break;
|
252 | }
|
253 | }
|
254 | }
|
255 | L && !k && (s = t(s, 1 / 0));
|
256 | var z = N.length + s.length + g.length, y = z < b ? new Array(b - z + 1).join(m) : "";
|
257 | switch (L && k && (s = t(y + s, y.length ? b - g.length : 1 / 0), y = ""), p) {
|
258 | case "<":
|
259 | s = N + s + g + y;
|
260 | break;
|
261 | case "=":
|
262 | s = N + y + s + g;
|
263 | break;
|
264 | case "^":
|
265 | s = y.slice(0, z = y.length >> 1) + N + s + g + y.slice(z);
|
266 | break;
|
267 | default:
|
268 | s = y + N + s + g;
|
269 | break;
|
270 | }
|
271 | return o(s);
|
272 | }
|
273 | return V.toString = function() {
|
274 | return c + "";
|
275 | }, V;
|
276 | }
|
277 | function l(c, m) {
|
278 | var p = f((c = E(c), c.type = "f", c)), M = Math.max(-8, Math.min(8, Math.floor(A(m) / 3))) * 3, S = Math.pow(10, -M), k = W[8 + M / 3];
|
279 | return function(b) {
|
280 | return p(S * b) + k;
|
281 | };
|
282 | }
|
283 | return {
|
284 | format: f,
|
285 | formatPrefix: l
|
286 | };
|
287 | }
|
288 | var $, en, on;
|
289 | En({
|
290 | thousands: ",",
|
291 | grouping: [3],
|
292 | currency: ["$", ""]
|
293 | });
|
294 | function En(n) {
|
295 | return $ = Rn(n), en = $.format, on = $.formatPrefix, $;
|
296 | }
|
297 | function Ln(n) {
|
298 | return Math.max(0, -A(Math.abs(n)));
|
299 | }
|
300 | function Dn(n, t) {
|
301 | return Math.max(0, Math.max(-8, Math.min(8, Math.floor(A(t) / 3))) * 3 - A(Math.abs(n)));
|
302 | }
|
303 | function Tn(n, t) {
|
304 | return n = Math.abs(n), t = Math.abs(t) - n, Math.max(0, A(t) - A(n)) + 1;
|
305 | }
|
306 | function In(n) {
|
307 | return function() {
|
308 | return n;
|
309 | };
|
310 | }
|
311 | function qn(n) {
|
312 | return +n;
|
313 | }
|
314 | var _ = [0, 1];
|
315 | function x(n) {
|
316 | return n;
|
317 | }
|
318 | function C(n, t) {
|
319 | return (t -= n = +n) ? function(e) {
|
320 | return (e - n) / t;
|
321 | } : In(isNaN(t) ? NaN : 0.5);
|
322 | }
|
323 | function Cn(n, t) {
|
324 | var e;
|
325 | return n > t && (e = n, n = t, t = e), function(r) {
|
326 | return Math.max(n, Math.min(t, r));
|
327 | };
|
328 | }
|
329 | function Xn(n, t, e) {
|
330 | var r = n[0], i = n[1], o = t[0], a = t[1];
|
331 | return i < r ? (r = C(i, r), o = e(a, o)) : (r = C(r, i), o = e(o, a)), function(u) {
|
332 | return o(r(u));
|
333 | };
|
334 | }
|
335 | function Bn(n, t, e) {
|
336 | var r = Math.min(n.length, t.length) - 1, i = new Array(r), o = new Array(r), a = -1;
|
337 | for (n[r] < n[0] && (n = n.slice().reverse(), t = t.slice().reverse()); ++a < r; )
|
338 | i[a] = C(n[a], n[a + 1]), o[a] = e(t[a], t[a + 1]);
|
339 | return function(u) {
|
340 | var h = yn(n, u, 1, r) - 1;
|
341 | return o[h](i[h](u));
|
342 | };
|
343 | }
|
344 | function Gn(n, t) {
|
345 | return t.domain(n.domain()).range(n.range()).interpolate(n.interpolate()).clamp(n.clamp()).unknown(n.unknown());
|
346 | }
|
347 | function On() {
|
348 | var n = _, t = _, e = X, r, i, o, a = x, u, h, f;
|
349 | function l() {
|
350 | var m = Math.min(n.length, t.length);
|
351 | return a !== x && (a = Cn(n[0], n[m - 1])), u = m > 2 ? Bn : Xn, h = f = null, c;
|
352 | }
|
353 | function c(m) {
|
354 | return m == null || isNaN(m = +m) ? o : (h || (h = u(n.map(r), t, e)))(r(a(m)));
|
355 | }
|
356 | return c.invert = function(m) {
|
357 | return a(i((f || (f = u(t, n.map(r), D)))(m)));
|
358 | }, c.domain = function(m) {
|
359 | return arguments.length ? (n = Array.from(m, qn), l()) : n.slice();
|
360 | }, c.range = function(m) {
|
361 | return arguments.length ? (t = Array.from(m), l()) : t.slice();
|
362 | }, c.rangeRound = function(m) {
|
363 | return t = Array.from(m), e = Sn, l();
|
364 | }, c.clamp = function(m) {
|
365 | return arguments.length ? (a = m ? !0 : x, l()) : a !== x;
|
366 | }, c.interpolate = function(m) {
|
367 | return arguments.length ? (e = m, l()) : e;
|
368 | }, c.unknown = function(m) {
|
369 | return arguments.length ? (o = m, c) : o;
|
370 | }, function(m, p) {
|
371 | return r = m, i = p, l();
|
372 | };
|
373 | }
|
374 | function Vn() {
|
375 | return On()(x, x);
|
376 | }
|
377 | function Zn(n, t, e, r) {
|
378 | var i = wn(n, t, e), o;
|
379 | switch (r = E(r ?? ",f"), r.type) {
|
380 | case "s": {
|
381 | var a = Math.max(Math.abs(n), Math.abs(t));
|
382 | return r.precision == null && !isNaN(o = Dn(i, a)) && (r.precision = o), on(r, a);
|
383 | }
|
384 | case "":
|
385 | case "e":
|
386 | case "g":
|
387 | case "p":
|
388 | case "r": {
|
389 | r.precision == null && !isNaN(o = Tn(i, Math.max(Math.abs(n), Math.abs(t)))) && (r.precision = o - (r.type === "e"));
|
390 | break;
|
391 | }
|
392 | case "f":
|
393 | case "%": {
|
394 | r.precision == null && !isNaN(o = Ln(i)) && (r.precision = o - (r.type === "%") * 2);
|
395 | break;
|
396 | }
|
397 | }
|
398 | return en(r);
|
399 | }
|
400 | function Un(n) {
|
401 | var t = n.domain;
|
402 | return n.ticks = function(e) {
|
403 | var r = t();
|
404 | return pn(r[0], r[r.length - 1], e ?? 10);
|
405 | }, n.tickFormat = function(e, r) {
|
406 | var i = t();
|
407 | return Zn(i[0], i[i.length - 1], e ?? 10, r);
|
408 | }, n.nice = function(e) {
|
409 | e == null && (e = 10);
|
410 | var r = t(), i = 0, o = r.length - 1, a = r[i], u = r[o], h, f, l = 10;
|
411 | for (u < a && (f = a, a = u, u = f, f = i, i = o, o = f); l-- > 0; ) {
|
412 | if (f = tn(a, u, e), f === h)
|
413 | return r[i] = a, r[o] = u, t(r);
|
414 | if (f > 0)
|
415 | a = Math.floor(a / f) * f, u = Math.ceil(u / f) * f;
|
416 | else if (f < 0)
|
417 | a = Math.ceil(a * f) / f, u = Math.floor(u * f) / f;
|
418 | else
|
419 | break;
|
420 | h = f;
|
421 | }
|
422 | return n;
|
423 | }, n;
|
424 | }
|
425 | function Yn() {
|
426 | var n = Vn();
|
427 | return n.copy = function() {
|
428 | return Gn(n, Yn());
|
429 | }, sn.apply(n, arguments), Un(n);
|
430 | }
|
431 | export {
|
432 | Gn as a,
|
433 | nn as b,
|
434 | Vn as c,
|
435 | Yn as l,
|
436 | wn as t
|
437 | };
|