@mobileaction/action-kit 1.59.0-beta.20260824072801 → 1.59.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/action-kit.mjs +1 -1
- package/dist/annotations-BotVbqYk.js +1275 -0
- package/dist/components/badge/stories/basic.stories.d.ts +2 -2
- package/dist/components/badge/stories/blue.stories.d.ts +2 -2
- package/dist/components/badge/stories/dark.stories.d.ts +2 -2
- package/dist/components/badge/stories/green.stories.d.ts +2 -2
- package/dist/components/badge/stories/orange.stories.d.ts +2 -2
- package/dist/components/badge/stories/pink.stories.d.ts +2 -2
- package/dist/components/badge/stories/purple.stories.d.ts +2 -2
- package/dist/components/badge/stories/red.stories.d.ts +2 -2
- package/dist/components/badge/stories/teal.stories.d.ts +2 -2
- package/dist/components/badge/stories/yellow.stories.d.ts +2 -2
- package/dist/components/cascader/stories/default.stories.d.ts +16 -16
- package/dist/export-data-BR_-2Q3f.js +332 -0
- package/dist/exporting-DR0s0ify.js +601 -0
- package/dist/funnel-DL7kiG31.js +134 -0
- package/dist/{index-6Py-WZ9e.js → index-CBkR2AwI.js} +2355 -2349
- package/dist/map-CMb83okh.js +1731 -0
- package/dist/offline-exporting-YDP5IlMX.js +192 -0
- package/dist/stock-CBVAQBFc.js +2054 -0
- package/dist/venn-D6eKe_-O.js +453 -0
- package/dist/wordcloud-t7GdM2hM.js +227 -0
- package/package.json +30 -15
- package/dist/annotations-DSkf_ftr.js +0 -1496
- package/dist/export-data-DCTe5P_S.js +0 -404
- package/dist/exporting-DQGEobM-.js +0 -739
- package/dist/funnel-CqFEWYxB.js +0 -201
- package/dist/map-DAB70ark.js +0 -1928
- package/dist/offline-exporting-aCzMDQAJ.js +0 -203
- package/dist/stock-CYJWuEFp.js +0 -2216
- package/dist/venn-Dec0FzLN.js +0 -498
- package/dist/wordcloud-CjsQdxnL.js +0 -268
package/dist/venn-Dec0FzLN.js
DELETED
|
@@ -1,498 +0,0 @@
|
|
|
1
|
-
import { g as _t } from "./index-6Py-WZ9e.js";
|
|
2
|
-
function Dt(B, H) {
|
|
3
|
-
for (var P = 0; P < H.length; P++) {
|
|
4
|
-
const M = H[P];
|
|
5
|
-
if (typeof M != "string" && !Array.isArray(M)) {
|
|
6
|
-
for (const E in M)
|
|
7
|
-
if (E !== "default" && !(E in B)) {
|
|
8
|
-
const j = Object.getOwnPropertyDescriptor(M, E);
|
|
9
|
-
j && Object.defineProperty(B, E, j.get ? j : {
|
|
10
|
-
enumerable: !0,
|
|
11
|
-
get: () => M[E]
|
|
12
|
-
});
|
|
13
|
-
}
|
|
14
|
-
}
|
|
15
|
-
}
|
|
16
|
-
return Object.freeze(Object.defineProperty(B, Symbol.toStringTag, { value: "Module" }));
|
|
17
|
-
}
|
|
18
|
-
var W = { exports: {} }, kt = W.exports, dt;
|
|
19
|
-
function Xt() {
|
|
20
|
-
return dt || (dt = 1, (function(B, H) {
|
|
21
|
-
/**
|
|
22
|
-
* Highcharts JS v12.6.0 (2026-04-13)
|
|
23
|
-
* @module highcharts/modules/venn
|
|
24
|
-
* @requires highcharts
|
|
25
|
-
*
|
|
26
|
-
* (c) 2017-2026 Highsoft AS
|
|
27
|
-
* Authors: Jon Arild Nygård
|
|
28
|
-
*
|
|
29
|
-
* A commercial license may be required depending on use.
|
|
30
|
-
* See www.highcharts.com/license
|
|
31
|
-
*/
|
|
32
|
-
(function(P, M) {
|
|
33
|
-
B.exports = M(P._Highcharts, P._Highcharts.Color, P._Highcharts.SeriesRegistry);
|
|
34
|
-
})("u" < typeof window ? kt : window, (P, M, E) => (() => {
|
|
35
|
-
var j, z, R, yt = { 512: (e) => {
|
|
36
|
-
e.exports = E;
|
|
37
|
-
}, 620: (e) => {
|
|
38
|
-
e.exports = M;
|
|
39
|
-
}, 944: (e) => {
|
|
40
|
-
e.exports = P;
|
|
41
|
-
} }, et = {};
|
|
42
|
-
function b(e) {
|
|
43
|
-
var t = et[e];
|
|
44
|
-
if (t !== void 0) return t.exports;
|
|
45
|
-
var n = et[e] = { exports: {} };
|
|
46
|
-
return yt[e](n, n.exports, b), n.exports;
|
|
47
|
-
}
|
|
48
|
-
b.n = (e) => {
|
|
49
|
-
var t = e && e.__esModule ? () => e.default : () => e;
|
|
50
|
-
return b.d(t, { a: t }), t;
|
|
51
|
-
}, b.d = (e, t) => {
|
|
52
|
-
for (var n in t) b.o(t, n) && !b.o(e, n) && Object.defineProperty(e, n, { enumerable: !0, get: t[n] });
|
|
53
|
-
}, b.o = (e, t) => Object.prototype.hasOwnProperty.call(e, t);
|
|
54
|
-
var rt = {};
|
|
55
|
-
b.d(rt, { default: () => Nt });
|
|
56
|
-
var gt = b(944), T = b.n(gt), xt = b(620), mt = b.n(xt);
|
|
57
|
-
(j = z || (z = {})).getCenterOfPoints = function(e) {
|
|
58
|
-
let t = e.reduce((n, s) => (n.x += s.x, n.y += s.y, n), { x: 0, y: 0 });
|
|
59
|
-
return { x: t.x / e.length, y: t.y / e.length };
|
|
60
|
-
}, j.getDistanceBetweenPoints = function(e, t) {
|
|
61
|
-
return Math.sqrt(Math.pow(t.x - e.x, 2) + Math.pow(t.y - e.y, 2));
|
|
62
|
-
}, j.getAngleBetweenPoints = function(e, t) {
|
|
63
|
-
return Math.atan2(t.x - e.x, t.y - e.y);
|
|
64
|
-
}, j.pointInPolygon = function({ x: e, y: t }, n) {
|
|
65
|
-
let s = n.length, c, a, r = !1;
|
|
66
|
-
for (c = 0, a = s - 1; c < s; a = c++) {
|
|
67
|
-
let [l, u] = n[c], [i, o] = n[a];
|
|
68
|
-
u > t != o > t && e < (i - l) * (t - u) / (o - u) + l && (r = !r);
|
|
69
|
-
}
|
|
70
|
-
return r;
|
|
71
|
-
};
|
|
72
|
-
let D = z, { doc: Ut, win: qt } = T();
|
|
73
|
-
function Y(e, t) {
|
|
74
|
-
let n;
|
|
75
|
-
for (n in e || (e = {}), t) e[n] = t[n];
|
|
76
|
-
return e;
|
|
77
|
-
}
|
|
78
|
-
function nt(e) {
|
|
79
|
-
return S(e) && typeof e.nodeType == "number";
|
|
80
|
-
}
|
|
81
|
-
function I(e) {
|
|
82
|
-
return typeof e == "number" && !isNaN(e) && e < 1 / 0 && e > -1 / 0;
|
|
83
|
-
}
|
|
84
|
-
function L(e) {
|
|
85
|
-
let t = Object.prototype.toString.call(e);
|
|
86
|
-
return t === "[object Array]" || t === "[object Array Iterator]";
|
|
87
|
-
}
|
|
88
|
-
function S(e, t) {
|
|
89
|
-
return !!e && typeof e == "object" && (!t || !L(e));
|
|
90
|
-
}
|
|
91
|
-
function $(e, ...t) {
|
|
92
|
-
let n, s = [e, ...t], c = {}, a = function(l, u) {
|
|
93
|
-
return typeof l != "object" && (l = {}), (function(i, o, f) {
|
|
94
|
-
for (let p in i) Object.hasOwnProperty.call(i, p) && o.call(i[p], i[p], p, i);
|
|
95
|
-
})(u, function(i, o) {
|
|
96
|
-
if (o !== "__proto__" && o !== "constructor") {
|
|
97
|
-
let f;
|
|
98
|
-
!S(i, !0) || (f = i?.constructor, S(i, !0) && !nt(i) && f?.name && f.name !== "Object") || nt(i) ? l[o] = u[o] : l[o] = a(l[o] || {}, i);
|
|
99
|
-
}
|
|
100
|
-
}), l;
|
|
101
|
-
};
|
|
102
|
-
e === !0 && (c = s[1], s = Array.prototype.slice.call(s, 2));
|
|
103
|
-
let r = s.length;
|
|
104
|
-
for (n = 0; n < r; n++) c = a(c, s[n]);
|
|
105
|
-
return c;
|
|
106
|
-
}
|
|
107
|
-
let { getAngleBetweenPoints: G, getCenterOfPoints: it, getDistanceBetweenPoints: k } = D;
|
|
108
|
-
(function(e) {
|
|
109
|
-
function t(i, o) {
|
|
110
|
-
let f = Math.pow(10, o);
|
|
111
|
-
return Math.round(i * f) / f;
|
|
112
|
-
}
|
|
113
|
-
function n(i) {
|
|
114
|
-
var o;
|
|
115
|
-
if (i <= 0) throw Error("radius of circle must be a positive number.");
|
|
116
|
-
return (o = Math.PI * i * i) > 1e14 ? o : parseFloat(o.toPrecision(14));
|
|
117
|
-
}
|
|
118
|
-
function s(i, o) {
|
|
119
|
-
return i * i * Math.acos(1 - o / i) - (i - o) * Math.sqrt(o * (2 * i - o));
|
|
120
|
-
}
|
|
121
|
-
function c(i, o) {
|
|
122
|
-
let f = k(i, o), p = i.r, d = o.r, O = [];
|
|
123
|
-
if (f < p + d && f > Math.abs(p - d)) {
|
|
124
|
-
let x = p * p, y = (x - d * d + f * f) / (2 * f), m = Math.sqrt(x - y * y), g = i.x, v = o.x, h = i.y, F = o.y, A = g + y * (v - g) / f, N = h + y * (F - h) / f, V = -(m / f * (F - h)), U = -(m / f * (v - g));
|
|
125
|
-
O = [{ x: t(A + V, 14), y: t(N - U, 14) }, { x: t(A - V, 14), y: t(N + U, 14) }];
|
|
126
|
-
}
|
|
127
|
-
return O;
|
|
128
|
-
}
|
|
129
|
-
function a(i) {
|
|
130
|
-
return i.reduce((o, f, p, d) => {
|
|
131
|
-
let O = d.slice(p + 1).reduce((x, y, m) => {
|
|
132
|
-
let g = [p, m + p + 1];
|
|
133
|
-
return x.concat(c(f, y).map((v) => (v.indexes = g, v)));
|
|
134
|
-
}, []);
|
|
135
|
-
return o.concat(O);
|
|
136
|
-
}, []);
|
|
137
|
-
}
|
|
138
|
-
function r(i, o) {
|
|
139
|
-
return k(i, o) <= o.r + 1e-10;
|
|
140
|
-
}
|
|
141
|
-
function l(i, o) {
|
|
142
|
-
return !o.some(function(f) {
|
|
143
|
-
return !r(i, f);
|
|
144
|
-
});
|
|
145
|
-
}
|
|
146
|
-
function u(i) {
|
|
147
|
-
return a(i).filter(function(o) {
|
|
148
|
-
return l(o, i);
|
|
149
|
-
});
|
|
150
|
-
}
|
|
151
|
-
e.round = t, e.getAreaOfCircle = n, e.getCircularSegmentArea = s, e.getOverlapBetweenCircles = function(i, o, f) {
|
|
152
|
-
let p = 0;
|
|
153
|
-
if (f < i + o) {
|
|
154
|
-
if (f <= Math.abs(o - i)) p = n(i < o ? i : o);
|
|
155
|
-
else {
|
|
156
|
-
let d = (i * i - o * o + f * f) / (2 * f);
|
|
157
|
-
p = s(i, i - d) + s(o, o - (f - d));
|
|
158
|
-
}
|
|
159
|
-
p = t(p, 14);
|
|
160
|
-
}
|
|
161
|
-
return p;
|
|
162
|
-
}, e.getCircleCircleIntersection = c, e.getCirclesIntersectionPoints = a, e.isCircle1CompletelyOverlappingCircle2 = function(i, o) {
|
|
163
|
-
return k(i, o) + o.r < i.r + 1e-10;
|
|
164
|
-
}, e.isPointInsideCircle = r, e.isPointInsideAllCircles = l, e.isPointOutsideAllCircles = function(i, o) {
|
|
165
|
-
return !o.some(function(f) {
|
|
166
|
-
return r(i, f);
|
|
167
|
-
});
|
|
168
|
-
}, e.getCirclesIntersectionPolygon = u, e.getAreaOfIntersectionBetweenCircles = function(i) {
|
|
169
|
-
let o = u(i), f;
|
|
170
|
-
if (o.length > 1) {
|
|
171
|
-
let p = it(o), d = (o = o.map(function(x) {
|
|
172
|
-
return x.angle = G(p, x), x;
|
|
173
|
-
}).sort(function(x, y) {
|
|
174
|
-
return y.angle - x.angle;
|
|
175
|
-
}))[o.length - 1], O = o.reduce(function(x, y) {
|
|
176
|
-
let { startPoint: m } = x, g = it([m, y]), v = y.indexes.filter(function(h) {
|
|
177
|
-
return m.indexes.indexOf(h) > -1;
|
|
178
|
-
}).reduce(function(h, F) {
|
|
179
|
-
let A = i[F], N = G(A, y), V = G(A, m), U = V - N + (V < N ? 2 * Math.PI : 0), pt = V - U / 2, _ = k(g, { x: A.x + A.r * Math.sin(pt), y: A.y + A.r * Math.cos(pt) }), { r: q } = A;
|
|
180
|
-
return _ > 2 * q && (_ = 2 * q), (!h || h.width > _) && (h = { r: q, largeArc: +(_ > q), width: _, x: y.x, y: y.y }), h;
|
|
181
|
-
}, null);
|
|
182
|
-
if (v) {
|
|
183
|
-
let { r: h } = v;
|
|
184
|
-
x.arcs.push(["A", h, h, 0, v.largeArc, 1, v.x, v.y]), x.startPoint = y;
|
|
185
|
-
}
|
|
186
|
-
return x;
|
|
187
|
-
}, { startPoint: d, arcs: [] }).arcs;
|
|
188
|
-
O.length === 0 || O.length === 1 || (O.unshift(["M", d.x, d.y]), f = { center: p, d: O });
|
|
189
|
-
}
|
|
190
|
-
return f;
|
|
191
|
-
};
|
|
192
|
-
})(R || (R = {}));
|
|
193
|
-
let J = R, vt = function(e, t) {
|
|
194
|
-
let { animatableAttribs: n, onComplete: s, css: c, renderer: a } = t, r = e.series && e.series.chart.hasRendered ? void 0 : e.series && e.series.options.animation, l = e.graphic;
|
|
195
|
-
if (t.attribs = { ...t.attribs, class: e.getClassName() }, e.shouldDraw()) l || (e.graphic = l = t.shapeType === "text" ? a.text() : t.shapeType === "image" ? a.image(t.imageUrl || "").attr(t.shapeArgs || {}) : a[t.shapeType](t.shapeArgs || {}), l.add(t.group)), c && l.css(c), l.attr(t.attribs).animate(n, !t.isNew && r, s);
|
|
196
|
-
else if (l) {
|
|
197
|
-
let u = () => {
|
|
198
|
-
e.graphic = l = l && l.destroy(), typeof s == "function" && s();
|
|
199
|
-
};
|
|
200
|
-
Object.keys(n).length ? l.animate(n, void 0, () => u()) : u();
|
|
201
|
-
}
|
|
202
|
-
};
|
|
203
|
-
var bt = b(512), K = b.n(bt);
|
|
204
|
-
let { scatter: { prototype: { pointClass: Ot } } } = K().seriesTypes, { getAreaOfCircle: Ct, getCircleCircleIntersection: At, getOverlapBetweenCircles: ot, isPointInsideAllCircles: Pt, isPointInsideCircle: Mt, isPointOutsideAllCircles: wt } = J, { getDistanceBetweenPoints: Q } = D;
|
|
205
|
-
function st(e) {
|
|
206
|
-
let t = {};
|
|
207
|
-
return e.filter((n) => n.sets.length === 2).forEach((n) => {
|
|
208
|
-
n.sets.forEach((s, c, a) => {
|
|
209
|
-
S(t[s]) || (t[s] = { totalOverlap: 0, overlapping: {} }), t[s] = { totalOverlap: (t[s].totalOverlap || 0) + n.value, overlapping: { ...t[s].overlapping || {}, [a[1 - c]]: n.value } };
|
|
210
|
-
});
|
|
211
|
-
}), e.filter(X).forEach((n) => {
|
|
212
|
-
let s = t[n.sets[0]];
|
|
213
|
-
Y(n, s);
|
|
214
|
-
}), e;
|
|
215
|
-
}
|
|
216
|
-
function lt(e, t, n, s, c) {
|
|
217
|
-
let a = e(t), r = e(n), l = 100, u = 1e-10, i = n - t, o, f, p = 1;
|
|
218
|
-
if (t >= n) throw Error("a must be smaller than b.");
|
|
219
|
-
if (a * r > 0) throw Error("f(a) and f(b) must have opposite signs.");
|
|
220
|
-
if (a === 0) o = t;
|
|
221
|
-
else if (r === 0) o = n;
|
|
222
|
-
else for (; p++ <= l && f !== 0 && i > u; ) i = (n - t) / 2, a * (f = e(o = t + i)) > 0 ? t = o : n = o;
|
|
223
|
-
return o;
|
|
224
|
-
}
|
|
225
|
-
function at(e) {
|
|
226
|
-
let t = e.slice(0, -1), n = t.length, s = [], c = (a, r) => (a.sum += r[a.i], a);
|
|
227
|
-
for (let a = 0; a < n; a++) s[a] = t.reduce(c, { sum: 0, i: a }).sum / n;
|
|
228
|
-
return s;
|
|
229
|
-
}
|
|
230
|
-
function Z(e, t, n) {
|
|
231
|
-
let s = e + t;
|
|
232
|
-
return n <= 0 ? s : Ct(e < t ? e : t) <= n ? 0 : lt((c) => n - ot(e, t, c), 0, s);
|
|
233
|
-
}
|
|
234
|
-
function X(e) {
|
|
235
|
-
return L(e.sets) && e.sets.length === 1;
|
|
236
|
-
}
|
|
237
|
-
function ct(e) {
|
|
238
|
-
let t = {};
|
|
239
|
-
return S(e) && I(e.value) && e.value > -1 && L(e.sets) && e.sets.length > 0 && !e.sets.some(function(n) {
|
|
240
|
-
let s = !1;
|
|
241
|
-
return t[n] || typeof n != "string" ? s = !0 : t[n] = !0, s;
|
|
242
|
-
});
|
|
243
|
-
}
|
|
244
|
-
function ut(e, t) {
|
|
245
|
-
return t.reduce(function(n, s) {
|
|
246
|
-
let c = 0;
|
|
247
|
-
if (s.sets.length > 1) {
|
|
248
|
-
let a = s.value - (function(r) {
|
|
249
|
-
let l = 0;
|
|
250
|
-
if (r.length === 2) {
|
|
251
|
-
let u = r[0], i = r[1];
|
|
252
|
-
l = ot(u.r, i.r, Q(u, i));
|
|
253
|
-
}
|
|
254
|
-
return l;
|
|
255
|
-
})(s.sets.map(function(r) {
|
|
256
|
-
return e[r];
|
|
257
|
-
}));
|
|
258
|
-
c = Math.round(a * a * 1e11) / 1e11;
|
|
259
|
-
}
|
|
260
|
-
return n + c;
|
|
261
|
-
}, 0);
|
|
262
|
-
}
|
|
263
|
-
function ft(e, t) {
|
|
264
|
-
return t.totalOverlap !== void 0 && e.totalOverlap !== void 0 ? t.totalOverlap - e.totalOverlap : NaN;
|
|
265
|
-
}
|
|
266
|
-
let w = { geometry: D, geometryCircles: J, addOverlapToSets: st, getCentroid: at, getDistanceBetweenCirclesByOverlap: Z, getLabelWidth: function(e, t, n) {
|
|
267
|
-
let s = t.reduce((r, l) => Math.min(l.r, r), 1 / 0), c = n.filter((r) => !Mt(e, r)), a = function(r, l) {
|
|
268
|
-
return lt((u) => {
|
|
269
|
-
let i = { x: e.x + l * u, y: e.y };
|
|
270
|
-
return -(r - u) + (Pt(i, t) && wt(i, c) ? 0 : Number.MAX_VALUE);
|
|
271
|
-
}, 0, r);
|
|
272
|
-
};
|
|
273
|
-
return 2 * Math.min(a(s, -1), a(s, 1));
|
|
274
|
-
}, getMarginFromCircles: function(e, t, n) {
|
|
275
|
-
let s = t.reduce((c, a) => {
|
|
276
|
-
let r = a.r - Q(e, a);
|
|
277
|
-
return r <= c ? r : c;
|
|
278
|
-
}, Number.MAX_VALUE);
|
|
279
|
-
return n.reduce((c, a) => {
|
|
280
|
-
let r = Q(e, a) - a.r;
|
|
281
|
-
return r <= c ? r : c;
|
|
282
|
-
}, s);
|
|
283
|
-
}, isSet: X, layoutGreedyVenn: function(e) {
|
|
284
|
-
let t = [], n = {};
|
|
285
|
-
e.filter((r) => r.sets.length === 1).forEach((r) => {
|
|
286
|
-
n[r.sets[0]] = r.circle = { x: Number.MAX_VALUE, y: Number.MAX_VALUE, r: Math.sqrt(r.value / Math.PI) };
|
|
287
|
-
});
|
|
288
|
-
let s = (r, l) => {
|
|
289
|
-
let u = r.circle;
|
|
290
|
-
u && (u.x = l.x, u.y = l.y), t.push(r);
|
|
291
|
-
};
|
|
292
|
-
st(e);
|
|
293
|
-
let c = e.filter(X).sort(ft);
|
|
294
|
-
s(c.shift(), { x: 0, y: 0 });
|
|
295
|
-
let a = e.filter((r) => r.sets.length === 2);
|
|
296
|
-
for (let r of c) {
|
|
297
|
-
let l = r.circle;
|
|
298
|
-
if (!l) continue;
|
|
299
|
-
let u = l.r, i = r.overlapping;
|
|
300
|
-
s(r, t.reduce((o, f, p) => {
|
|
301
|
-
let d = f.circle;
|
|
302
|
-
if (!d || !i) return o;
|
|
303
|
-
let O = i[f.sets[0]], x = Z(u, d.r, O), y = [{ x: d.x + x, y: d.y }, { x: d.x - x, y: d.y }, { x: d.x, y: d.y + x }, { x: d.x, y: d.y - x }];
|
|
304
|
-
for (let m of t.slice(p + 1)) {
|
|
305
|
-
let g = m.circle, v = i[m.sets[0]];
|
|
306
|
-
if (!g) continue;
|
|
307
|
-
let h = Z(u, g.r, v);
|
|
308
|
-
y = y.concat(At({ x: d.x, y: d.y, r: x }, { x: g.x, y: g.y, r: h }));
|
|
309
|
-
}
|
|
310
|
-
for (let m of y) {
|
|
311
|
-
l.x = m.x, l.y = m.y;
|
|
312
|
-
let g = ut(n, a);
|
|
313
|
-
g < o.loss && (o.loss = g, o.coordinates = m);
|
|
314
|
-
}
|
|
315
|
-
return o;
|
|
316
|
-
}, { loss: Number.MAX_VALUE, coordinates: void 0 }).coordinates);
|
|
317
|
-
}
|
|
318
|
-
return n;
|
|
319
|
-
}, loss: ut, nelderMead: function(e, t) {
|
|
320
|
-
let n = function(u, i) {
|
|
321
|
-
return u.fx - i.fx;
|
|
322
|
-
}, s = (u, i, o, f) => i.map((p, d) => u * p + o * f[d]), c = (u, i) => (i.fx = e(i), u[u.length - 1] = i, u), a = (u) => {
|
|
323
|
-
let i = u[0];
|
|
324
|
-
return u.map((o) => {
|
|
325
|
-
let f = s(0.5, i, 0.5, o);
|
|
326
|
-
return f.fx = e(f), f;
|
|
327
|
-
});
|
|
328
|
-
}, r = (u, i, o, f) => {
|
|
329
|
-
let p = s(o, u, f, i);
|
|
330
|
-
return p.fx = e(p), p;
|
|
331
|
-
}, l = ((u) => {
|
|
332
|
-
let i = u.length, o = Array(i + 1);
|
|
333
|
-
o[0] = u, o[0].fx = e(u);
|
|
334
|
-
for (let f = 0; f < i; ++f) {
|
|
335
|
-
let p = u.slice();
|
|
336
|
-
p[f] = p[f] ? 1.05 * p[f] : 1e-3, p.fx = e(p), o[f + 1] = p;
|
|
337
|
-
}
|
|
338
|
-
return o;
|
|
339
|
-
})(t);
|
|
340
|
-
for (let u = 0; u < 100; u++) {
|
|
341
|
-
l.sort(n);
|
|
342
|
-
let i = l[l.length - 1], o = at(l), f = r(o, i, 2, -1);
|
|
343
|
-
if (f.fx < l[0].fx) {
|
|
344
|
-
let p = r(o, i, 3, -2);
|
|
345
|
-
l = c(l, p.fx < f.fx ? p : f);
|
|
346
|
-
} else if (f.fx >= l[l.length - 2].fx) {
|
|
347
|
-
let p;
|
|
348
|
-
l = f.fx > i.fx ? (p = r(o, i, 0.5, 0.5)).fx < i.fx ? c(l, p) : a(l) : (p = r(o, i, 1.5, -0.5)).fx < f.fx ? c(l, p) : a(l);
|
|
349
|
-
} else l = c(l, f);
|
|
350
|
-
}
|
|
351
|
-
return l[0];
|
|
352
|
-
}, processVennData: function(e, t) {
|
|
353
|
-
let n = L(e) ? e : [], s = n.reduce(function(a, r) {
|
|
354
|
-
var l;
|
|
355
|
-
return r.sets && ct(l = r) && X(l) && l.value > 0 && a.indexOf(r.sets[0]) === -1 && a.push(r.sets[0]), a;
|
|
356
|
-
}, []).sort(), c = n.reduce(function(a, r) {
|
|
357
|
-
return r.sets && ct(r) && !r.sets.some(function(l) {
|
|
358
|
-
return s.indexOf(l) === -1;
|
|
359
|
-
}) && (a[r.sets.sort().join(t)] = { sets: r.sets, value: r.value || 0 }), a;
|
|
360
|
-
}, {});
|
|
361
|
-
return s.reduce(function(a, r, l, u) {
|
|
362
|
-
return u.slice(l + 1).forEach(function(i) {
|
|
363
|
-
a.push(r + t + i);
|
|
364
|
-
}), a;
|
|
365
|
-
}, []).forEach(function(a) {
|
|
366
|
-
if (!c[a]) {
|
|
367
|
-
let r = { sets: a.split(t), value: 0 };
|
|
368
|
-
c[a] = r;
|
|
369
|
-
}
|
|
370
|
-
}), Object.keys(c).map(function(a) {
|
|
371
|
-
return c[a];
|
|
372
|
-
});
|
|
373
|
-
}, sortByTotalOverlap: ft }, { animObject: jt } = T(), { parse: It } = mt(), { getAreaOfIntersectionBetweenCircles: Et, getCirclesIntersectionPolygon: Tt, isCircle1CompletelyOverlappingCircle2: Lt, isPointInsideAllCircles: St, isPointOutsideAllCircles: Vt } = J, { getCenterOfPoints: Bt } = D, { scatter: tt } = K().seriesTypes;
|
|
374
|
-
class C extends tt {
|
|
375
|
-
static getLabelPosition(t, n) {
|
|
376
|
-
let s = t.reduce((a, r) => {
|
|
377
|
-
let l = r.r / 2;
|
|
378
|
-
return [{ x: r.x, y: r.y }, { x: r.x + l, y: r.y }, { x: r.x - l, y: r.y }, { x: r.x, y: r.y + l }, { x: r.x, y: r.y - l }].reduce((u, i) => {
|
|
379
|
-
let o = w.getMarginFromCircles(i, t, n);
|
|
380
|
-
return u.margin < o && (u.point = i, u.margin = o), u;
|
|
381
|
-
}, a);
|
|
382
|
-
}, { point: void 0, margin: -Number.MAX_VALUE }).point, c = w.nelderMead((a) => -w.getMarginFromCircles({ x: a[0], y: a[1] }, t, n), [s.x, s.y]);
|
|
383
|
-
return St(s = { x: c[0], y: c[1] }, t) && Vt(s, n) || (s = t.length > 1 ? Bt(Tt(t)) : { x: t[0].x, y: t[0].y }), s;
|
|
384
|
-
}
|
|
385
|
-
static getLabelValues(t, n) {
|
|
386
|
-
let s = t.sets, c = n.reduce((l, u) => {
|
|
387
|
-
let i = s.indexOf(u.sets[0]) > -1;
|
|
388
|
-
return u.circle && l[i ? "internal" : "external"].push(u.circle), l;
|
|
389
|
-
}, { internal: [], external: [] });
|
|
390
|
-
c.external = c.external.filter((l) => c.internal.some((u) => !Lt(l, u)));
|
|
391
|
-
let a = C.getLabelPosition(c.internal, c.external), r = w.getLabelWidth(a, c.internal, c.external);
|
|
392
|
-
return { position: a, width: r };
|
|
393
|
-
}
|
|
394
|
-
static layout(t) {
|
|
395
|
-
let n = {}, s = {};
|
|
396
|
-
if (t.length > 0) {
|
|
397
|
-
let c = w.layoutGreedyVenn(t), a = t.filter(w.isSet);
|
|
398
|
-
for (let r of t) {
|
|
399
|
-
let l = r.sets, u = l.join(), i = w.isSet(r) ? c[u] : Et(l.map((o) => c[o]));
|
|
400
|
-
i && (n[u] = i, s[u] = C.getLabelValues(r, a));
|
|
401
|
-
}
|
|
402
|
-
}
|
|
403
|
-
return { mapOfIdToShape: n, mapOfIdToLabelValues: s };
|
|
404
|
-
}
|
|
405
|
-
static getScale(t, n, s) {
|
|
406
|
-
let c = s.bottom - s.top, a = s.right - s.left, r = (s.right + s.left) / 2, l = (s.top + s.bottom) / 2, u = Math.min(a > 0 ? 1 / a * t : 1, c > 0 ? 1 / c * n : 1);
|
|
407
|
-
return { scale: u, centerX: t / 2 - r * u, centerY: n / 2 - l * u };
|
|
408
|
-
}
|
|
409
|
-
static updateFieldBoundaries(t, n) {
|
|
410
|
-
let s = n.x - n.r, c = n.x + n.r, a = n.y + n.r, r = n.y - n.r;
|
|
411
|
-
return (!I(t.left) || t.left > s) && (t.left = s), (!I(t.right) || t.right < c) && (t.right = c), (!I(t.top) || t.top > r) && (t.top = r), (!I(t.bottom) || t.bottom < a) && (t.bottom = a), t;
|
|
412
|
-
}
|
|
413
|
-
animate(t) {
|
|
414
|
-
if (!t) {
|
|
415
|
-
let n = jt(this.options.animation);
|
|
416
|
-
for (let s of this.points) {
|
|
417
|
-
let c = s.shapeArgs;
|
|
418
|
-
if (s.graphic && c) {
|
|
419
|
-
let a = {}, r = {};
|
|
420
|
-
c.d ? a.opacity = 1e-3 : (a.r = 0, r.r = c.r), s.graphic.attr(a).animate(r, n), c.d && setTimeout(() => {
|
|
421
|
-
s?.graphic?.animate({ opacity: 1 });
|
|
422
|
-
}, n.duration);
|
|
423
|
-
}
|
|
424
|
-
}
|
|
425
|
-
}
|
|
426
|
-
}
|
|
427
|
-
drawPoints() {
|
|
428
|
-
let t = this.chart, n = this.group, s = this.points || [], c = t.renderer;
|
|
429
|
-
for (let a of s) {
|
|
430
|
-
let r = { zIndex: L(a.sets) ? a.sets.length : 0 }, l = a.shapeArgs;
|
|
431
|
-
t.styledMode || Y(r, this.pointAttribs(a, a.state)), vt(a, { isNew: !a.graphic, animatableAttribs: l, attribs: r, group: n, renderer: c, shapeType: l?.d ? "path" : "circle" });
|
|
432
|
-
}
|
|
433
|
-
}
|
|
434
|
-
init() {
|
|
435
|
-
tt.prototype.init.apply(this, arguments), delete this.opacity;
|
|
436
|
-
}
|
|
437
|
-
pointAttribs(t, n) {
|
|
438
|
-
let s = this.options || {}, c = t?.options || {}, a = n && s.states[n] || {}, r = $(s, { color: t?.color }, c, a);
|
|
439
|
-
return { fill: It(r.color).brighten(r.brightness).get(), opacity: r.opacity, stroke: r.borderColor, "stroke-width": r.borderWidth, dashstyle: r.borderDashStyle };
|
|
440
|
-
}
|
|
441
|
-
translate() {
|
|
442
|
-
let t = this.chart;
|
|
443
|
-
this.dataTable.modified = this.dataTable, this.generatePoints();
|
|
444
|
-
let n = w.processVennData(this.options.data, C.splitter), { mapOfIdToShape: s, mapOfIdToLabelValues: c } = C.layout(n), a = Object.keys(s).filter((o) => {
|
|
445
|
-
let f = s[o];
|
|
446
|
-
return f && I(f.r);
|
|
447
|
-
}).reduce((o, f) => C.updateFieldBoundaries(o, s[f]), { top: 0, bottom: 0, left: 0, right: 0 }), r = C.getScale(t.plotWidth, t.plotHeight, a), l = r.scale, u = r.centerX, i = r.centerY;
|
|
448
|
-
for (let o of this.points) {
|
|
449
|
-
let f = L(o.sets) ? o.sets : [], p = f.join(), d = s[p], O = c[p] || {}, x = o.options?.dataLabels, y, m = O.width, g = O.position;
|
|
450
|
-
if (d) {
|
|
451
|
-
if (d.r) y = { x: u + d.x * l, y: i + d.y * l, r: d.r * l };
|
|
452
|
-
else if (d.d) {
|
|
453
|
-
let v = d.d;
|
|
454
|
-
v.forEach((h) => {
|
|
455
|
-
h[0] === "M" ? (h[1] = u + h[1] * l, h[2] = i + h[2] * l) : h[0] === "A" && (h[1] = h[1] * l, h[2] = h[2] * l, h[6] = u + h[6] * l, h[7] = i + h[7] * l);
|
|
456
|
-
}), y = { d: v };
|
|
457
|
-
}
|
|
458
|
-
g ? (g.x = u + g.x * l, g.y = i + g.y * l) : g = {}, I(m) && (m = Math.round(m * l));
|
|
459
|
-
}
|
|
460
|
-
o.shapeArgs = y, g && y && (o.plotX = g.x, o.plotY = g.y), m && y && (o.dlOptions = $(!0, { style: { width: m } }, S(x, !0) ? x : void 0, { zIndex: void 0 })), o.name = o.options.name || f.join("∩");
|
|
461
|
-
}
|
|
462
|
-
}
|
|
463
|
-
}
|
|
464
|
-
C.splitter = "highcharts-split", C.defaultOptions = $(tt.defaultOptions, { borderColor: "#cccccc", borderDashStyle: "solid", borderWidth: 1, brighten: 0, clip: !1, colorByPoint: !0, dataLabels: { enabled: !0, verticalAlign: "middle", formatter: function() {
|
|
465
|
-
return this.point.name;
|
|
466
|
-
} }, inactiveOtherPoints: !0, marker: !1, opacity: 0.75, showInLegend: !1, legendType: "point", states: { hover: { opacity: 1, borderColor: "#333333" }, select: { color: "#cccccc", borderColor: "#000000", animation: !1 }, inactive: { opacity: 0.075 } }, tooltip: { pointFormat: "{point.name}: {point.value}" }, legendSymbol: "rectangle" }), Y(C.prototype, { axisTypes: [], directTouch: !0, isCartesian: !1, pointArrayMap: ["value"], pointClass: class extends Ot {
|
|
467
|
-
isValid() {
|
|
468
|
-
return I(this.value);
|
|
469
|
-
}
|
|
470
|
-
shouldDraw() {
|
|
471
|
-
return !!this.shapeArgs;
|
|
472
|
-
}
|
|
473
|
-
}, utils: w }), (function(e, t, n, s = {}) {
|
|
474
|
-
let c = typeof e == "function" && e.prototype || e;
|
|
475
|
-
Object.hasOwnProperty.call(c, "hcEvents") || (c.hcEvents = {});
|
|
476
|
-
let a = c.hcEvents;
|
|
477
|
-
T().Point && e instanceof T().Point && e.series && e.series.chart && (e.series.chart.runTrackerClick = !0);
|
|
478
|
-
let r = e.addEventListener;
|
|
479
|
-
r && r.call(e, t, n, !!T().supportsPassiveEvents && { passive: s.passive === void 0 ? t.indexOf("touch") !== -1 : s.passive, capture: !1 }), a[t] || (a[t] = []);
|
|
480
|
-
let l = { fn: n, order: typeof s.order == "number" ? s.order : 1 / 0 };
|
|
481
|
-
a[t].push(l), a[t].sort((u, i) => u.order - i.order);
|
|
482
|
-
})(C, "afterSetOptions", function(e) {
|
|
483
|
-
let t = e.options.states || {};
|
|
484
|
-
if (this.is("venn")) for (let n of Object.keys(t)) t[n].halo = !1;
|
|
485
|
-
}), K().registerSeriesType("venn", C);
|
|
486
|
-
let Nt = T();
|
|
487
|
-
return rt.default;
|
|
488
|
-
})());
|
|
489
|
-
})(W)), W.exports;
|
|
490
|
-
}
|
|
491
|
-
var ht = Xt();
|
|
492
|
-
const Ft = /* @__PURE__ */ _t(ht), Ht = /* @__PURE__ */ Dt({
|
|
493
|
-
__proto__: null,
|
|
494
|
-
default: Ft
|
|
495
|
-
}, [ht]);
|
|
496
|
-
export {
|
|
497
|
-
Ht as v
|
|
498
|
-
};
|