@mobileaction/action-kit 1.57.0 → 1.57.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-DzxKra_-.js → annotations-DjS6cZ0g.js} +386 -383
- package/dist/components/typography/index.vue.d.ts +1 -1
- package/dist/export-data-DSMuByxy.js +332 -0
- package/dist/exporting-DZnBR8gm.js +601 -0
- package/dist/funnel-DaTDEOyF.js +134 -0
- package/dist/{index-C8r4OcCO.js → index-bTz35Vhl.js} +1879 -1845
- package/dist/map-BhX11nMc.js +1744 -0
- package/dist/offline-exporting-Dj1jDKzF.js +192 -0
- package/dist/stock-Cv-uIi1p.js +2076 -0
- package/dist/venn-CgBXe2Vp.js +453 -0
- package/dist/wordcloud-Bwb3kAJt.js +227 -0
- package/package.json +2 -2
- package/dist/export-data-B7wYF5EQ.js +0 -327
- package/dist/exporting-B0cCEyyg.js +0 -535
- package/dist/funnel-DTHaLuEK.js +0 -135
- package/dist/map-C_BILLYp.js +0 -1757
- package/dist/offline-exporting-8t0G_rUZ.js +0 -192
- package/dist/stock-DyTZKEyb.js +0 -2044
- package/dist/venn-DfFwIzSQ.js +0 -454
- package/dist/wordcloud-Hu3_8VaC.js +0 -235
package/dist/venn-DfFwIzSQ.js
DELETED
|
@@ -1,454 +0,0 @@
|
|
|
1
|
-
import { g as Ut } from "./index-C8r4OcCO.js";
|
|
2
|
-
function qt(S, q) {
|
|
3
|
-
for (var M = 0; M < q.length; M++) {
|
|
4
|
-
const P = q[M];
|
|
5
|
-
if (typeof P != "string" && !Array.isArray(P)) {
|
|
6
|
-
for (const I in P)
|
|
7
|
-
if (I !== "default" && !(I in S)) {
|
|
8
|
-
const T = Object.getOwnPropertyDescriptor(P, I);
|
|
9
|
-
T && Object.defineProperty(S, I, T.get ? T : {
|
|
10
|
-
enumerable: !0,
|
|
11
|
-
get: () => P[I]
|
|
12
|
-
});
|
|
13
|
-
}
|
|
14
|
-
}
|
|
15
|
-
}
|
|
16
|
-
return Object.freeze(Object.defineProperty(S, Symbol.toStringTag, { value: "Module" }));
|
|
17
|
-
}
|
|
18
|
-
var U = { exports: {} }, Wt = U.exports, pt;
|
|
19
|
-
function Ht() {
|
|
20
|
-
return pt || (pt = 1, function(S, q) {
|
|
21
|
-
/**
|
|
22
|
-
* Highcharts JS v12.3.0 (2025-06-21)
|
|
23
|
-
* @module highcharts/modules/venn
|
|
24
|
-
* @requires highcharts
|
|
25
|
-
*
|
|
26
|
-
* (c) 2017-2025 Highsoft AS
|
|
27
|
-
* Authors: Jon Arild Nygard
|
|
28
|
-
*
|
|
29
|
-
* License: www.highcharts.com/license
|
|
30
|
-
*/
|
|
31
|
-
(function(M, P) {
|
|
32
|
-
S.exports = P(M._Highcharts, M._Highcharts.Color, M._Highcharts.SeriesRegistry);
|
|
33
|
-
})(typeof window > "u" ? Wt : window, (M, P, I) => (() => {
|
|
34
|
-
var T, W, ht = { 512: (n) => {
|
|
35
|
-
n.exports = I;
|
|
36
|
-
}, 620: (n) => {
|
|
37
|
-
n.exports = P;
|
|
38
|
-
}, 944: (n) => {
|
|
39
|
-
n.exports = M;
|
|
40
|
-
} }, Q = {};
|
|
41
|
-
function v(n) {
|
|
42
|
-
var t = Q[n];
|
|
43
|
-
if (t !== void 0) return t.exports;
|
|
44
|
-
var r = Q[n] = { exports: {} };
|
|
45
|
-
return ht[n](r, r.exports, v), r.exports;
|
|
46
|
-
}
|
|
47
|
-
v.n = (n) => {
|
|
48
|
-
var t = n && n.__esModule ? () => n.default : () => n;
|
|
49
|
-
return v.d(t, { a: t }), t;
|
|
50
|
-
}, v.d = (n, t) => {
|
|
51
|
-
for (var r in t) v.o(t, r) && !v.o(n, r) && Object.defineProperty(n, r, { enumerable: !0, get: t[r] });
|
|
52
|
-
}, v.o = (n, t) => Object.prototype.hasOwnProperty.call(n, t);
|
|
53
|
-
var Z = {};
|
|
54
|
-
v.d(Z, { default: () => Ft });
|
|
55
|
-
var gt = v(944), L = v.n(gt), yt = v(620), xt = v.n(yt);
|
|
56
|
-
(function(n) {
|
|
57
|
-
n.getCenterOfPoints = function(t) {
|
|
58
|
-
let r = t.reduce((a, c) => (a.x += c.x, a.y += c.y, a), { x: 0, y: 0 });
|
|
59
|
-
return { x: r.x / t.length, y: r.y / t.length };
|
|
60
|
-
}, n.getDistanceBetweenPoints = function(t, r) {
|
|
61
|
-
return Math.sqrt(Math.pow(r.x - t.x, 2) + Math.pow(r.y - t.y, 2));
|
|
62
|
-
}, n.getAngleBetweenPoints = function(t, r) {
|
|
63
|
-
return Math.atan2(r.x - t.x, r.y - t.y);
|
|
64
|
-
}, n.pointInPolygon = function({ x: t, y: r }, a) {
|
|
65
|
-
let c = a.length, s, e, o = !1;
|
|
66
|
-
for (s = 0, e = c - 1; s < c; e = s++) {
|
|
67
|
-
let [u, i] = a[s], [l, f] = a[e];
|
|
68
|
-
i > r != f > r && t < (l - u) * (r - i) / (f - i) + u && (o = !o);
|
|
69
|
-
}
|
|
70
|
-
return o;
|
|
71
|
-
};
|
|
72
|
-
})(T || (T = {}));
|
|
73
|
-
let N = T, { getAngleBetweenPoints: H, getCenterOfPoints: tt, getDistanceBetweenPoints: D } = N;
|
|
74
|
-
(function(n) {
|
|
75
|
-
function t(i, l) {
|
|
76
|
-
let f = Math.pow(10, l);
|
|
77
|
-
return Math.round(i * f) / f;
|
|
78
|
-
}
|
|
79
|
-
function r(i) {
|
|
80
|
-
if (i <= 0) throw Error("radius of circle must be a positive number.");
|
|
81
|
-
return Math.PI * i * i;
|
|
82
|
-
}
|
|
83
|
-
function a(i, l) {
|
|
84
|
-
return i * i * Math.acos(1 - l / i) - (i - l) * Math.sqrt(l * (2 * i - l));
|
|
85
|
-
}
|
|
86
|
-
function c(i, l) {
|
|
87
|
-
let f = D(i, l), p = i.r, d = l.r, O = [];
|
|
88
|
-
if (f < p + d && f > Math.abs(p - d)) {
|
|
89
|
-
let x = p * p, g = (x - d * d + f * f) / (2 * f), m = Math.sqrt(x - g * g), y = i.x, b = l.x, h = i.y, X = l.y, A = y + g * (b - y) / f, V = h + g * (X - h) / f, j = -(m / f * (X - h)), k = -(m / f * (b - y));
|
|
90
|
-
O = [{ x: t(A + j, 14), y: t(V - k, 14) }, { x: t(A - j, 14), y: t(V + k, 14) }];
|
|
91
|
-
}
|
|
92
|
-
return O;
|
|
93
|
-
}
|
|
94
|
-
function s(i) {
|
|
95
|
-
return i.reduce((l, f, p, d) => {
|
|
96
|
-
let O = d.slice(p + 1).reduce((x, g, m) => {
|
|
97
|
-
let y = [p, m + p + 1];
|
|
98
|
-
return x.concat(c(f, g).map((b) => (b.indexes = y, b)));
|
|
99
|
-
}, []);
|
|
100
|
-
return l.concat(O);
|
|
101
|
-
}, []);
|
|
102
|
-
}
|
|
103
|
-
function e(i, l) {
|
|
104
|
-
return D(i, l) <= l.r + 1e-10;
|
|
105
|
-
}
|
|
106
|
-
function o(i, l) {
|
|
107
|
-
return !l.some(function(f) {
|
|
108
|
-
return !e(i, f);
|
|
109
|
-
});
|
|
110
|
-
}
|
|
111
|
-
function u(i) {
|
|
112
|
-
return s(i).filter(function(l) {
|
|
113
|
-
return o(l, i);
|
|
114
|
-
});
|
|
115
|
-
}
|
|
116
|
-
n.round = t, n.getAreaOfCircle = r, n.getCircularSegmentArea = a, n.getOverlapBetweenCircles = function(i, l, f) {
|
|
117
|
-
let p = 0;
|
|
118
|
-
if (f < i + l) {
|
|
119
|
-
if (f <= Math.abs(l - i)) p = r(i < l ? i : l);
|
|
120
|
-
else {
|
|
121
|
-
let d = (i * i - l * l + f * f) / (2 * f);
|
|
122
|
-
p = a(i, i - d) + a(l, l - (f - d));
|
|
123
|
-
}
|
|
124
|
-
p = t(p, 14);
|
|
125
|
-
}
|
|
126
|
-
return p;
|
|
127
|
-
}, n.getCircleCircleIntersection = c, n.getCirclesIntersectionPoints = s, n.isCircle1CompletelyOverlappingCircle2 = function(i, l) {
|
|
128
|
-
return D(i, l) + l.r < i.r + 1e-10;
|
|
129
|
-
}, n.isPointInsideCircle = e, n.isPointInsideAllCircles = o, n.isPointOutsideAllCircles = function(i, l) {
|
|
130
|
-
return !l.some(function(f) {
|
|
131
|
-
return e(i, f);
|
|
132
|
-
});
|
|
133
|
-
}, n.getCirclesIntersectionPolygon = u, n.getAreaOfIntersectionBetweenCircles = function(i) {
|
|
134
|
-
let l = u(i), f;
|
|
135
|
-
if (l.length > 1) {
|
|
136
|
-
let p = tt(l), d = (l = l.map(function(x) {
|
|
137
|
-
return x.angle = H(p, x), x;
|
|
138
|
-
}).sort(function(x, g) {
|
|
139
|
-
return g.angle - x.angle;
|
|
140
|
-
}))[l.length - 1], O = l.reduce(function(x, g) {
|
|
141
|
-
let { startPoint: m } = x, y = tt([m, g]), b = g.indexes.filter(function(h) {
|
|
142
|
-
return m.indexes.indexOf(h) > -1;
|
|
143
|
-
}).reduce(function(h, X) {
|
|
144
|
-
let A = i[X], V = H(A, g), j = H(A, m), k = j - V + (j < V ? 2 * Math.PI : 0), ft = j - k / 2, B = D(y, { x: A.x + A.r * Math.sin(ft), y: A.y + A.r * Math.cos(ft) }), { r: F } = A;
|
|
145
|
-
return B > 2 * F && (B = 2 * F), (!h || h.width > B) && (h = { r: F, largeArc: +(B > F), width: B, x: g.x, y: g.y }), h;
|
|
146
|
-
}, null);
|
|
147
|
-
if (b) {
|
|
148
|
-
let { r: h } = b;
|
|
149
|
-
x.arcs.push(["A", h, h, 0, b.largeArc, 1, b.x, b.y]), x.startPoint = g;
|
|
150
|
-
}
|
|
151
|
-
return x;
|
|
152
|
-
}, { startPoint: d, arcs: [] }).arcs;
|
|
153
|
-
O.length === 0 || O.length === 1 || (O.unshift(["M", d.x, d.y]), f = { center: p, d: O });
|
|
154
|
-
}
|
|
155
|
-
return f;
|
|
156
|
-
};
|
|
157
|
-
})(W || (W = {}));
|
|
158
|
-
let $ = W, mt = { draw: function(n, t) {
|
|
159
|
-
let { animatableAttribs: r, onComplete: a, css: c, renderer: s } = t, e = n.series && n.series.chart.hasRendered ? void 0 : n.series && n.series.options.animation, o = n.graphic;
|
|
160
|
-
if (t.attribs = { ...t.attribs, class: n.getClassName() }, n.shouldDraw()) o || (n.graphic = o = t.shapeType === "text" ? s.text() : t.shapeType === "image" ? s.image(t.imageUrl || "").attr(t.shapeArgs || {}) : s[t.shapeType](t.shapeArgs || {}), o.add(t.group)), c && o.css(c), o.attr(t.attribs).animate(r, !t.isNew && e, a);
|
|
161
|
-
else if (o) {
|
|
162
|
-
let u = () => {
|
|
163
|
-
n.graphic = o = o && o.destroy(), typeof a == "function" && a();
|
|
164
|
-
};
|
|
165
|
-
Object.keys(r).length ? o.animate(r, void 0, () => u()) : u();
|
|
166
|
-
}
|
|
167
|
-
} };
|
|
168
|
-
var bt = v(512), R = v.n(bt);
|
|
169
|
-
let { scatter: { prototype: { pointClass: vt } } } = R().seriesTypes, { isNumber: Ot } = L(), { getAreaOfCircle: Ct, getCircleCircleIntersection: At, getOverlapBetweenCircles: et, isPointInsideAllCircles: Mt, isPointInsideCircle: Pt, isPointOutsideAllCircles: wt } = $, { getDistanceBetweenPoints: Y } = N, { extend: It, isArray: z, isNumber: Tt, isObject: rt, isString: Et } = L();
|
|
170
|
-
function nt(n) {
|
|
171
|
-
let t = {};
|
|
172
|
-
return n.filter((r) => r.sets.length === 2).forEach((r) => {
|
|
173
|
-
r.sets.forEach((a, c, s) => {
|
|
174
|
-
rt(t[a]) || (t[a] = { totalOverlap: 0, overlapping: {} }), t[a] = { totalOverlap: (t[a].totalOverlap || 0) + r.value, overlapping: { ...t[a].overlapping || {}, [s[1 - c]]: r.value } };
|
|
175
|
-
});
|
|
176
|
-
}), n.filter(_).forEach((r) => {
|
|
177
|
-
let a = t[r.sets[0]];
|
|
178
|
-
It(r, a);
|
|
179
|
-
}), n;
|
|
180
|
-
}
|
|
181
|
-
function it(n, t, r, a, c) {
|
|
182
|
-
let s = n(t), e = n(r), o = 100, u = 1e-10, i = r - t, l, f, p = 1;
|
|
183
|
-
if (t >= r) throw Error("a must be smaller than b.");
|
|
184
|
-
if (s * e > 0) throw Error("f(a) and f(b) must have opposite signs.");
|
|
185
|
-
if (s === 0) l = t;
|
|
186
|
-
else if (e === 0) l = r;
|
|
187
|
-
else for (; p++ <= o && f !== 0 && i > u; ) i = (r - t) / 2, s * (f = n(l = t + i)) > 0 ? t = l : r = l;
|
|
188
|
-
return l;
|
|
189
|
-
}
|
|
190
|
-
function st(n) {
|
|
191
|
-
let t = n.slice(0, -1), r = t.length, a = [], c = (s, e) => (s.sum += e[s.i], s);
|
|
192
|
-
for (let s = 0; s < r; s++) a[s] = t.reduce(c, { sum: 0, i: s }).sum / r;
|
|
193
|
-
return a;
|
|
194
|
-
}
|
|
195
|
-
function G(n, t, r) {
|
|
196
|
-
let a = n + t;
|
|
197
|
-
return r <= 0 ? a : Ct(n < t ? n : t) <= r ? 0 : it((c) => r - et(n, t, c), 0, a);
|
|
198
|
-
}
|
|
199
|
-
function _(n) {
|
|
200
|
-
return z(n.sets) && n.sets.length === 1;
|
|
201
|
-
}
|
|
202
|
-
function ot(n) {
|
|
203
|
-
let t = {};
|
|
204
|
-
return rt(n) && Tt(n.value) && n.value > -1 && z(n.sets) && n.sets.length > 0 && !n.sets.some(function(r) {
|
|
205
|
-
let a = !1;
|
|
206
|
-
return !t[r] && Et(r) ? t[r] = !0 : a = !0, a;
|
|
207
|
-
});
|
|
208
|
-
}
|
|
209
|
-
function lt(n, t) {
|
|
210
|
-
return t.reduce(function(r, a) {
|
|
211
|
-
let c = 0;
|
|
212
|
-
if (a.sets.length > 1) {
|
|
213
|
-
let s = a.value - function(e) {
|
|
214
|
-
let o = 0;
|
|
215
|
-
if (e.length === 2) {
|
|
216
|
-
let u = e[0], i = e[1];
|
|
217
|
-
o = et(u.r, i.r, Y(u, i));
|
|
218
|
-
}
|
|
219
|
-
return o;
|
|
220
|
-
}(a.sets.map(function(e) {
|
|
221
|
-
return n[e];
|
|
222
|
-
}));
|
|
223
|
-
c = Math.round(s * s * 1e11) / 1e11;
|
|
224
|
-
}
|
|
225
|
-
return r + c;
|
|
226
|
-
}, 0);
|
|
227
|
-
}
|
|
228
|
-
function at(n, t) {
|
|
229
|
-
return t.totalOverlap !== void 0 && n.totalOverlap !== void 0 ? t.totalOverlap - n.totalOverlap : NaN;
|
|
230
|
-
}
|
|
231
|
-
let w = { geometry: N, geometryCircles: $, addOverlapToSets: nt, getCentroid: st, getDistanceBetweenCirclesByOverlap: G, getLabelWidth: function(n, t, r) {
|
|
232
|
-
let a = t.reduce((e, o) => Math.min(o.r, e), 1 / 0), c = r.filter((e) => !Pt(n, e)), s = function(e, o) {
|
|
233
|
-
return it((u) => {
|
|
234
|
-
let i = { x: n.x + o * u, y: n.y };
|
|
235
|
-
return -(e - u) + (Mt(i, t) && wt(i, c) ? 0 : Number.MAX_VALUE);
|
|
236
|
-
}, 0, e);
|
|
237
|
-
};
|
|
238
|
-
return 2 * Math.min(s(a, -1), s(a, 1));
|
|
239
|
-
}, getMarginFromCircles: function(n, t, r) {
|
|
240
|
-
let a = t.reduce((c, s) => {
|
|
241
|
-
let e = s.r - Y(n, s);
|
|
242
|
-
return e <= c ? e : c;
|
|
243
|
-
}, Number.MAX_VALUE);
|
|
244
|
-
return r.reduce((c, s) => {
|
|
245
|
-
let e = Y(n, s) - s.r;
|
|
246
|
-
return e <= c ? e : c;
|
|
247
|
-
}, a);
|
|
248
|
-
}, isSet: _, layoutGreedyVenn: function(n) {
|
|
249
|
-
let t = [], r = {};
|
|
250
|
-
n.filter((e) => e.sets.length === 1).forEach((e) => {
|
|
251
|
-
r[e.sets[0]] = e.circle = { x: Number.MAX_VALUE, y: Number.MAX_VALUE, r: Math.sqrt(e.value / Math.PI) };
|
|
252
|
-
});
|
|
253
|
-
let a = (e, o) => {
|
|
254
|
-
let u = e.circle;
|
|
255
|
-
u && (u.x = o.x, u.y = o.y), t.push(e);
|
|
256
|
-
};
|
|
257
|
-
nt(n);
|
|
258
|
-
let c = n.filter(_).sort(at);
|
|
259
|
-
a(c.shift(), { x: 0, y: 0 });
|
|
260
|
-
let s = n.filter((e) => e.sets.length === 2);
|
|
261
|
-
for (let e of c) {
|
|
262
|
-
let o = e.circle;
|
|
263
|
-
if (!o) continue;
|
|
264
|
-
let u = o.r, i = e.overlapping;
|
|
265
|
-
a(e, t.reduce((l, f, p) => {
|
|
266
|
-
let d = f.circle;
|
|
267
|
-
if (!d || !i) return l;
|
|
268
|
-
let O = i[f.sets[0]], x = G(u, d.r, O), g = [{ 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 }];
|
|
269
|
-
for (let m of t.slice(p + 1)) {
|
|
270
|
-
let y = m.circle, b = i[m.sets[0]];
|
|
271
|
-
if (!y) continue;
|
|
272
|
-
let h = G(u, y.r, b);
|
|
273
|
-
g = g.concat(At({ x: d.x, y: d.y, r: x }, { x: y.x, y: y.y, r: h }));
|
|
274
|
-
}
|
|
275
|
-
for (let m of g) {
|
|
276
|
-
o.x = m.x, o.y = m.y;
|
|
277
|
-
let y = lt(r, s);
|
|
278
|
-
y < l.loss && (l.loss = y, l.coordinates = m);
|
|
279
|
-
}
|
|
280
|
-
return l;
|
|
281
|
-
}, { loss: Number.MAX_VALUE, coordinates: void 0 }).coordinates);
|
|
282
|
-
}
|
|
283
|
-
return r;
|
|
284
|
-
}, loss: lt, nelderMead: function(n, t) {
|
|
285
|
-
let r = function(u, i) {
|
|
286
|
-
return u.fx - i.fx;
|
|
287
|
-
}, a = (u, i, l, f) => i.map((p, d) => u * p + l * f[d]), c = (u, i) => (i.fx = n(i), u[u.length - 1] = i, u), s = (u) => {
|
|
288
|
-
let i = u[0];
|
|
289
|
-
return u.map((l) => {
|
|
290
|
-
let f = a(0.5, i, 0.5, l);
|
|
291
|
-
return f.fx = n(f), f;
|
|
292
|
-
});
|
|
293
|
-
}, e = (u, i, l, f) => {
|
|
294
|
-
let p = a(l, u, f, i);
|
|
295
|
-
return p.fx = n(p), p;
|
|
296
|
-
}, o = ((u) => {
|
|
297
|
-
let i = u.length, l = Array(i + 1);
|
|
298
|
-
l[0] = u, l[0].fx = n(u);
|
|
299
|
-
for (let f = 0; f < i; ++f) {
|
|
300
|
-
let p = u.slice();
|
|
301
|
-
p[f] = p[f] ? 1.05 * p[f] : 1e-3, p.fx = n(p), l[f + 1] = p;
|
|
302
|
-
}
|
|
303
|
-
return l;
|
|
304
|
-
})(t);
|
|
305
|
-
for (let u = 0; u < 100; u++) {
|
|
306
|
-
o.sort(r);
|
|
307
|
-
let i = o[o.length - 1], l = st(o), f = e(l, i, 2, -1);
|
|
308
|
-
if (f.fx < o[0].fx) {
|
|
309
|
-
let p = e(l, i, 3, -2);
|
|
310
|
-
o = c(o, p.fx < f.fx ? p : f);
|
|
311
|
-
} else if (f.fx >= o[o.length - 2].fx) {
|
|
312
|
-
let p;
|
|
313
|
-
o = f.fx > i.fx ? (p = e(l, i, 0.5, 0.5)).fx < i.fx ? c(o, p) : s(o) : (p = e(l, i, 1.5, -0.5)).fx < f.fx ? c(o, p) : s(o);
|
|
314
|
-
} else o = c(o, f);
|
|
315
|
-
}
|
|
316
|
-
return o[0];
|
|
317
|
-
}, processVennData: function(n, t) {
|
|
318
|
-
let r = z(n) ? n : [], a = r.reduce(function(s, e) {
|
|
319
|
-
var o;
|
|
320
|
-
return e.sets && ot(o = e) && _(o) && o.value > 0 && s.indexOf(e.sets[0]) === -1 && s.push(e.sets[0]), s;
|
|
321
|
-
}, []).sort(), c = r.reduce(function(s, e) {
|
|
322
|
-
return e.sets && ot(e) && !e.sets.some(function(o) {
|
|
323
|
-
return a.indexOf(o) === -1;
|
|
324
|
-
}) && (s[e.sets.sort().join(t)] = { sets: e.sets, value: e.value || 0 }), s;
|
|
325
|
-
}, {});
|
|
326
|
-
return a.reduce(function(s, e, o, u) {
|
|
327
|
-
return u.slice(o + 1).forEach(function(i) {
|
|
328
|
-
s.push(e + t + i);
|
|
329
|
-
}), s;
|
|
330
|
-
}, []).forEach(function(s) {
|
|
331
|
-
if (!c[s]) {
|
|
332
|
-
let e = { sets: s.split(t), value: 0 };
|
|
333
|
-
c[s] = e;
|
|
334
|
-
}
|
|
335
|
-
}), Object.keys(c).map(function(s) {
|
|
336
|
-
return c[s];
|
|
337
|
-
});
|
|
338
|
-
}, sortByTotalOverlap: at }, { animObject: jt } = L(), { parse: St } = xt(), { getAreaOfIntersectionBetweenCircles: Lt, getCirclesIntersectionPolygon: Vt, isCircle1CompletelyOverlappingCircle2: Bt, isPointInsideAllCircles: Nt, isPointOutsideAllCircles: Dt } = $, { getCenterOfPoints: _t } = N, { scatter: J } = R().seriesTypes, { addEvent: Xt, extend: ct, isArray: ut, isNumber: E, isObject: kt, merge: K } = L();
|
|
339
|
-
class C extends J {
|
|
340
|
-
static getLabelPosition(t, r) {
|
|
341
|
-
let a = t.reduce((s, e) => {
|
|
342
|
-
let o = e.r / 2;
|
|
343
|
-
return [{ x: e.x, y: e.y }, { x: e.x + o, y: e.y }, { x: e.x - o, y: e.y }, { x: e.x, y: e.y + o }, { x: e.x, y: e.y - o }].reduce((u, i) => {
|
|
344
|
-
let l = w.getMarginFromCircles(i, t, r);
|
|
345
|
-
return u.margin < l && (u.point = i, u.margin = l), u;
|
|
346
|
-
}, s);
|
|
347
|
-
}, { point: void 0, margin: -Number.MAX_VALUE }).point, c = w.nelderMead((s) => -w.getMarginFromCircles({ x: s[0], y: s[1] }, t, r), [a.x, a.y]);
|
|
348
|
-
return Nt(a = { x: c[0], y: c[1] }, t) && Dt(a, r) || (a = t.length > 1 ? _t(Vt(t)) : { x: t[0].x, y: t[0].y }), a;
|
|
349
|
-
}
|
|
350
|
-
static getLabelValues(t, r) {
|
|
351
|
-
let a = t.sets, c = r.reduce((o, u) => {
|
|
352
|
-
let i = a.indexOf(u.sets[0]) > -1;
|
|
353
|
-
return u.circle && o[i ? "internal" : "external"].push(u.circle), o;
|
|
354
|
-
}, { internal: [], external: [] });
|
|
355
|
-
c.external = c.external.filter((o) => c.internal.some((u) => !Bt(o, u)));
|
|
356
|
-
let s = C.getLabelPosition(c.internal, c.external), e = w.getLabelWidth(s, c.internal, c.external);
|
|
357
|
-
return { position: s, width: e };
|
|
358
|
-
}
|
|
359
|
-
static layout(t) {
|
|
360
|
-
let r = {}, a = {};
|
|
361
|
-
if (t.length > 0) {
|
|
362
|
-
let c = w.layoutGreedyVenn(t), s = t.filter(w.isSet);
|
|
363
|
-
for (let e of t) {
|
|
364
|
-
let o = e.sets, u = o.join(), i = w.isSet(e) ? c[u] : Lt(o.map((l) => c[l]));
|
|
365
|
-
i && (r[u] = i, a[u] = C.getLabelValues(e, s));
|
|
366
|
-
}
|
|
367
|
-
}
|
|
368
|
-
return { mapOfIdToShape: r, mapOfIdToLabelValues: a };
|
|
369
|
-
}
|
|
370
|
-
static getScale(t, r, a) {
|
|
371
|
-
let c = a.bottom - a.top, s = a.right - a.left, e = (a.right + a.left) / 2, o = (a.top + a.bottom) / 2, u = Math.min(s > 0 ? 1 / s * t : 1, c > 0 ? 1 / c * r : 1);
|
|
372
|
-
return { scale: u, centerX: t / 2 - e * u, centerY: r / 2 - o * u };
|
|
373
|
-
}
|
|
374
|
-
static updateFieldBoundaries(t, r) {
|
|
375
|
-
let a = r.x - r.r, c = r.x + r.r, s = r.y + r.r, e = r.y - r.r;
|
|
376
|
-
return (!E(t.left) || t.left > a) && (t.left = a), (!E(t.right) || t.right < c) && (t.right = c), (!E(t.top) || t.top > e) && (t.top = e), (!E(t.bottom) || t.bottom < s) && (t.bottom = s), t;
|
|
377
|
-
}
|
|
378
|
-
animate(t) {
|
|
379
|
-
if (!t) {
|
|
380
|
-
let r = jt(this.options.animation);
|
|
381
|
-
for (let a of this.points) {
|
|
382
|
-
let c = a.shapeArgs;
|
|
383
|
-
if (a.graphic && c) {
|
|
384
|
-
let s = {}, e = {};
|
|
385
|
-
c.d ? s.opacity = 1e-3 : (s.r = 0, e.r = c.r), a.graphic.attr(s).animate(e, r), c.d && setTimeout(() => {
|
|
386
|
-
a?.graphic?.animate({ opacity: 1 });
|
|
387
|
-
}, r.duration);
|
|
388
|
-
}
|
|
389
|
-
}
|
|
390
|
-
}
|
|
391
|
-
}
|
|
392
|
-
drawPoints() {
|
|
393
|
-
let t = this.chart, r = this.group, a = this.points || [], c = t.renderer;
|
|
394
|
-
for (let s of a) {
|
|
395
|
-
let e = { zIndex: ut(s.sets) ? s.sets.length : 0 }, o = s.shapeArgs;
|
|
396
|
-
t.styledMode || ct(e, this.pointAttribs(s, s.state)), mt.draw(s, { isNew: !s.graphic, animatableAttribs: o, attribs: e, group: r, renderer: c, shapeType: o?.d ? "path" : "circle" });
|
|
397
|
-
}
|
|
398
|
-
}
|
|
399
|
-
init() {
|
|
400
|
-
J.prototype.init.apply(this, arguments), delete this.opacity;
|
|
401
|
-
}
|
|
402
|
-
pointAttribs(t, r) {
|
|
403
|
-
let a = this.options || {}, c = t?.options || {}, s = r && a.states[r] || {}, e = K(a, { color: t?.color }, c, s);
|
|
404
|
-
return { fill: St(e.color).brighten(e.brightness).get(), opacity: e.opacity, stroke: e.borderColor, "stroke-width": e.borderWidth, dashstyle: e.borderDashStyle };
|
|
405
|
-
}
|
|
406
|
-
translate() {
|
|
407
|
-
let t = this.chart;
|
|
408
|
-
this.dataTable.modified = this.dataTable, this.generatePoints();
|
|
409
|
-
let r = w.processVennData(this.options.data, C.splitter), { mapOfIdToShape: a, mapOfIdToLabelValues: c } = C.layout(r), s = Object.keys(a).filter((l) => {
|
|
410
|
-
let f = a[l];
|
|
411
|
-
return f && E(f.r);
|
|
412
|
-
}).reduce((l, f) => C.updateFieldBoundaries(l, a[f]), { top: 0, bottom: 0, left: 0, right: 0 }), e = C.getScale(t.plotWidth, t.plotHeight, s), o = e.scale, u = e.centerX, i = e.centerY;
|
|
413
|
-
for (let l of this.points) {
|
|
414
|
-
let f = ut(l.sets) ? l.sets : [], p = f.join(), d = a[p], O = c[p] || {}, x = l.options?.dataLabels, g, m = O.width, y = O.position;
|
|
415
|
-
if (d) {
|
|
416
|
-
if (d.r) g = { x: u + d.x * o, y: i + d.y * o, r: d.r * o };
|
|
417
|
-
else if (d.d) {
|
|
418
|
-
let b = d.d;
|
|
419
|
-
b.forEach((h) => {
|
|
420
|
-
h[0] === "M" ? (h[1] = u + h[1] * o, h[2] = i + h[2] * o) : h[0] === "A" && (h[1] = h[1] * o, h[2] = h[2] * o, h[6] = u + h[6] * o, h[7] = i + h[7] * o);
|
|
421
|
-
}), g = { d: b };
|
|
422
|
-
}
|
|
423
|
-
y ? (y.x = u + y.x * o, y.y = i + y.y * o) : y = {}, E(m) && (m = Math.round(m * o));
|
|
424
|
-
}
|
|
425
|
-
l.shapeArgs = g, y && g && (l.plotX = y.x, l.plotY = y.y), m && g && (l.dlOptions = K(!0, { style: { width: m } }, kt(x, !0) ? x : void 0)), l.name = l.options.name || f.join("∩");
|
|
426
|
-
}
|
|
427
|
-
}
|
|
428
|
-
}
|
|
429
|
-
C.splitter = "highcharts-split", C.defaultOptions = K(J.defaultOptions, { borderColor: "#cccccc", borderDashStyle: "solid", borderWidth: 1, brighten: 0, clip: !1, colorByPoint: !0, dataLabels: { enabled: !0, verticalAlign: "middle", formatter: function() {
|
|
430
|
-
return this.point.name;
|
|
431
|
-
} }, 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" }), ct(C.prototype, { axisTypes: [], directTouch: !0, isCartesian: !1, pointArrayMap: ["value"], pointClass: class extends vt {
|
|
432
|
-
isValid() {
|
|
433
|
-
return Ot(this.value);
|
|
434
|
-
}
|
|
435
|
-
shouldDraw() {
|
|
436
|
-
return !!this.shapeArgs;
|
|
437
|
-
}
|
|
438
|
-
}, utils: w }), Xt(C, "afterSetOptions", function(n) {
|
|
439
|
-
let t = n.options.states || {};
|
|
440
|
-
if (this.is("venn")) for (let r of Object.keys(t)) t[r].halo = !1;
|
|
441
|
-
}), R().registerSeriesType("venn", C);
|
|
442
|
-
let Ft = L();
|
|
443
|
-
return Z.default;
|
|
444
|
-
})());
|
|
445
|
-
}(U)), U.exports;
|
|
446
|
-
}
|
|
447
|
-
var dt = Ht();
|
|
448
|
-
const $t = /* @__PURE__ */ Ut(dt), Yt = /* @__PURE__ */ qt({
|
|
449
|
-
__proto__: null,
|
|
450
|
-
default: $t
|
|
451
|
-
}, [dt]);
|
|
452
|
-
export {
|
|
453
|
-
Yt as v
|
|
454
|
-
};
|