@hybridcore/ui 1.6.0 → 1.6.2

package/dist/components/charts/drill-down-voronoi-treemap/logic.js

@@ -585,13 +585,13 @@ function Be(t, e, n) {
         if (!f[l.index]) {
           if (f[l.index] = !0, g.isDummy)
             continue;
-          for (var v = $e(a), p = [], y = null, C = null, m = 1, k = 1, x = 0; x < v.length; x++) {
-            var w = v[x].getDualPoint(), A = w.x, b = w.y;
-            y !== null && (m = y - A, k = C - b, m < 0 && (m = -m), k < 0 && (k = -k)), (m > U || k > U) && (p.push([A, b]), y = A, C = b);
+          for (var p = $e(a), v = [], y = null, w = null, P = 1, z = 1, x = 0; x < p.length; x++) {
+            var m = p[x].getDualPoint(), C = m.x, A = m.y;
+            y !== null && (P = y - C, z = w - A, P < 0 && (P = -P), z < 0 && (z = -z)), (P > U || z > U) && (v.push([C, A]), y = C, w = A);
           }
-          if (g.nonClippedPolygon = p.reverse(), !g.isDummy && We(g.nonClippedPolygon) > 0) {
-            var D = Ue(n, g.nonClippedPolygon);
-            g.polygon = D, D.site = g, D.length > 0 && u.push(D);
+          if (g.nonClippedPolygon = v.reverse(), !g.isDummy && We(g.nonClippedPolygon) > 0) {
+            var b = Ue(n, g.nonClippedPolygon);
+            g.polygon = b, b.site = g, b.length > 0 && u.push(b);
           }
         }
       }
@@ -651,20 +651,20 @@ function Ze() {
     ], o = [[0, 0], i], u = i, f) : u;
   };
   function h() {
-    var i, s, c, a, l, g, v, p, y, C, m = [], k = [];
-    i = o[0][0], s = o[1][0], c = o[0][1], a = o[1][1], l = s - i, g = a - c, v = i - l, p = s + l, y = c - g, C = a + g, m[0] = [v, y], m[1] = [v, C], m[2] = [p, C], m[3] = [p, y];
+    var i, s, c, a, l, g, p, v, y, w, P = [], z = [];
+    i = o[0][0], s = o[1][0], c = o[0][1], a = o[1][1], l = s - i, g = a - c, p = i - l, v = s + l, y = c - g, w = a + g, P[0] = [p, y], P[1] = [p, w], P[2] = [v, w], P[3] = [v, y];
     for (var x = 0; x < 4; x++)
-      k.push(
+      z.push(
         new G(
-          m[x][0],
-          m[x][1],
+          P[x][0],
+          P[x][1],
           null,
           U,
-          new G(m[x][0], m[x][1], null, U, null, !0),
+          new G(P[x][0], P[x][1], null, U, null, !0),
           !0
         )
       );
-    return k;
+    return z;
   }
   return f;
 }
@@ -712,10 +712,10 @@ J.prototype.ratio = function() {
 function Je() {
   var t, e, n, r, o, u, f, h;
   function i(c, a, l, g) {
-    var v = !1, p, y;
-    for (t !== g.clip() && (t = g.clip(), e = g.extent(), v = !0), v && s(), p = n + f * g.prng()(), y = o + h * g.prng()(); !Qt(t, [p, y]); )
-      p = n + f * g.prng()(), y = o + h * g.prng()();
-    return [p, y];
+    var p = !1, v, y;
+    for (t !== g.clip() && (t = g.clip(), e = g.extent(), p = !0), p && s(), v = n + f * g.prng()(), y = o + h * g.prng()(); !Qt(t, [v, y]); )
+      v = n + f * g.prng()(), y = o + h * g.prng()();
+    return [v, y];
   }
   function s() {
     n = e[0][0], r = e[1][0], o = e[0][1], u = e[1][1], f = r - n, h = u - o;
@@ -741,7 +741,7 @@ tt.prototype = new Error();
 function $t(t) {
   var e = 0.01, n = 50, r = 0.01, o = Math.random, u = Je(), f = Qe(), h = 1e-10, i = function(d) {
     return d.weight;
-  }, s = e, c = n, a = r, l = o, g = u, v = f, p = Ze(), y = new J(), C = !0, m, k, x, w, A, b, D, F, P, R = ie(Ft), V = re("tick", "end");
+  }, s = e, c = n, a = r, l = o, g = u, p = f, v = Ze(), y = new J(), w = !0, P, z, x, m, C, A, b, F, D, W = ie(Ft), V = re("tick", "end");
   const X = 1, j = 1e3;
   var S;
   function Y(d) {
@@ -750,132 +750,132 @@ function $t(t) {
   function Ot(d, I) {
     return Y(I.x - d.x) + Y(I.y - d.y);
   }
-  P = {
+  D = {
     tick: Wt,
     restart: function() {
-      return R.restart(Ft), P;
+      return W.restart(Ft), D;
     },
     stop: function() {
-      return R.stop(), P;
+      return W.stop(), D;
     },
     weight: function(d) {
-      return arguments.length ? (i = d, C = !0, P) : i;
+      return arguments.length ? (i = d, w = !0, D) : i;
     },
     convergenceRatio: function(d) {
-      return arguments.length ? (s = d, C = !0, P) : s;
+      return arguments.length ? (s = d, w = !0, D) : s;
     },
     maxIterationCount: function(d) {
-      return arguments.length ? (c = d, P) : c;
+      return arguments.length ? (c = d, D) : c;
     },
     minWeightRatio: function(d) {
-      return arguments.length ? (a = d, C = !0, P) : a;
+      return arguments.length ? (a = d, w = !0, D) : a;
     },
     clip: function(d) {
-      return arguments.length ? (p.clip(d), C = !0, P) : p.clip();
+      return arguments.length ? (v.clip(d), w = !0, D) : v.clip();
     },
     extent: function(d) {
-      return arguments.length ? (p.extent(d), C = !0, P) : p.extent();
+      return arguments.length ? (v.extent(d), w = !0, D) : v.extent();
     },
     size: function(d) {
-      return arguments.length ? (p.size(d), C = !0, P) : p.size();
+      return arguments.length ? (v.size(d), w = !0, D) : v.size();
     },
     prng: function(d) {
-      return arguments.length ? (l = d, C = !0, P) : l;
+      return arguments.length ? (l = d, w = !0, D) : l;
     },
     initialPosition: function(d) {
-      return arguments.length ? (g = d, C = !0, P) : g;
+      return arguments.length ? (g = d, w = !0, D) : g;
     },
     initialWeight: function(d) {
-      return arguments.length ? (v = d, C = !0, P) : v;
+      return arguments.length ? (p = d, w = !0, D) : p;
     },
     state: function() {
-      return C && Rt(), {
+      return w && Rt(), {
         ended: F,
-        iterationCount: w,
-        convergenceRatio: b / k,
-        polygons: A
+        iterationCount: m,
+        convergenceRatio: A / z,
+        polygons: C
       };
     },
     on: function(d, I) {
-      return arguments.length === 1 ? V.on(d) : (V.on(d, I), P);
+      return arguments.length === 1 ? V.on(d) : (V.on(d, I), D);
     }
   };
   function Ft() {
-    Wt(), V.call("tick", P), F && (R.stop(), V.call("end", P));
+    Wt(), V.call("tick", D), F && (W.stop(), V.call("end", D));
   }
   function Wt() {
-    F || (C && Rt(), A = le(A, y.ratio()), w++, b = ge(A), y.add(b), D = b < x, F = D || w >= c);
+    F || (w && Rt(), C = le(C, y.ratio()), m++, A = ge(C), y.add(A), b = A < x, F = b || m >= c);
   }
   function Rt() {
-    pe(), m = t.length, k = Math.abs(ft(p.clip())), x = s * k, y.clear().totalArea(k), w = 0, D = !1, A = ae(t, P), F = !1, C = !1;
+    pe(), P = t.length, z = Math.abs(ft(v.clip())), x = s * z, y.clear().totalArea(z), m = 0, b = !1, C = ae(t, D), F = !1, w = !1;
   }
   function ae(d, I) {
-    var N = d.reduce(function(T, M) {
-      return Math.max(T, i(M));
-    }, -1 / 0), _ = N * a, z, E;
-    return z = d.map(function(T, M, O) {
+    var N = d.reduce(function(k, M) {
+      return Math.max(k, i(M));
+    }, -1 / 0), E = N * a, _, T;
+    return _ = d.map(function(k, M, O) {
       return {
         index: M,
-        weight: Math.max(i(T), _),
-        initialPosition: g(T, M, O, I),
-        initialWeight: v(T, M, O, I),
-        originalData: T
+        weight: Math.max(i(k), E),
+        initialPosition: g(k, M, O, I),
+        initialWeight: p(k, M, O, I),
+        originalData: k
       };
-    }), E = he(z, I), S(E), p(E);
+    }), T = he(_, I), S(T), v(T);
   }
   function he(d, I) {
-    var N = d.reduce(function(z, E) {
-      return z += E.weight;
-    }, 0), _;
-    return d.map(function(z, E, T) {
-      return _ = z.initialPosition, Qt(p.clip(), _) || (_ = u(z, E, T, I)), {
-        index: z.index,
-        targetedArea: k * z.weight / N,
-        data: z,
-        x: _[0],
-        y: _[1],
-        weight: z.initialWeight
+    var N = d.reduce(function(_, T) {
+      return _ += T.weight;
+    }, 0), E;
+    return d.map(function(_, T, k) {
+      return E = _.initialPosition, Qt(v.clip(), E) || (E = u(_, T, k, I)), {
+        index: _.index,
+        targetedArea: z * _.weight / N,
+        data: _,
+        x: E[0],
+        y: E[1],
+        weight: _.initialWeight
         // ArlindNocaj/Voronoi-Treemap-Library uses an epsilonesque initial weight; using heavier initial weights allows faster weight adjustements, hence faster stabilization
       };
     });
   }
   function le(d, I) {
     var N;
-    if (ue(d, I), N = d.map(function(_) {
-      return _.site.originalObject;
-    }), d = p(N), d.length < m)
+    if (ue(d, I), N = d.map(function(E) {
+      return E.site.originalObject;
+    }), d = v(N), d.length < P)
       throw new tt("at least 1 site has no area, which is not supposed to arise");
-    if (fe(d, I), N = d.map(function(_) {
-      return _.site.originalObject;
-    }), d = p(N), d.length < m)
+    if (fe(d, I), N = d.map(function(E) {
+      return E.site.originalObject;
+    }), d = v(N), d.length < P)
       throw new tt("at least 1 site has no area, which is not supposed to arise");
     return d;
   }
   function ue(d, I) {
-    var N = [], _ = 0.5, z, E, T, M, O, W, L;
-    z = _ * I, E = 1 - z;
-    for (var mt = 0; mt < m; mt++)
-      T = d[mt], M = T.site.originalObject, O = Ie(T), W = O[0] - M.x, L = O[1] - M.y, W *= E, L *= E, M.x += W, M.y += L, N.push(M);
+    var N = [], E = 0.5, _, T, k, M, O, R, L;
+    _ = E * I, T = 1 - _;
+    for (var mt = 0; mt < P; mt++)
+      k = d[mt], M = k.site.originalObject, O = Ie(k), R = O[0] - M.x, L = O[1] - M.y, R *= T, L *= T, M.x += R, M.y += L, N.push(M);
     S(N);
   }
   function fe(d, I) {
-    var N = [], _ = 0.1, z, E, T, M, O, W;
-    z = _ * I;
-    for (var L = 0; L < m; L++)
-      E = d[L], T = E.site.originalObject, M = ft(E), O = T.targetedArea / M, O = Math.max(O, 1 - _ + z), O = Math.min(O, 1 + _ - z), W = T.weight * O, W = Math.max(W, h), T.weight = W, N.push(T);
+    var N = [], E = 0.1, _, T, k, M, O, R;
+    _ = E * I;
+    for (var L = 0; L < P; L++)
+      T = d[L], k = T.site.originalObject, M = ft(T), O = k.targetedArea / M, O = Math.max(O, 1 - E + _), O = Math.min(O, 1 + E - _), R = k.weight * O, R = Math.max(R, h), k.weight = R, N.push(k);
     S(N);
   }
   function Lt(d) {
-    var I = 0, N, _, z, E, T, M, O;
+    var I = 0, N, E, _, T, k, M, O;
     do {
       if (I > j)
         throw new tt("handleOverweighted0 is looping too much");
       N = !1;
-      for (var W = 0; W < m; W++) {
-        _ = d[W];
-        for (var L = W + 1; L < m; L++)
-          if (z = d[L], _.weight > z.weight ? (E = _, T = z) : (E = z, T = _), M = Ot(_, z), M < E.weight - T.weight) {
-            O = M + T.weight / 2, O = Math.max(O, h), E.weight = O, N = !0, I++;
+      for (var R = 0; R < P; R++) {
+        E = d[R];
+        for (var L = R + 1; L < P; L++)
+          if (_ = d[L], E.weight > _.weight ? (T = E, k = _) : (T = _, k = E), M = Ot(E, _), M < T.weight - k.weight) {
+            O = M + k.weight / 2, O = Math.max(O, h), T.weight = O, N = !0, I++;
             break;
           }
         if (N)
@@ -884,16 +884,16 @@ function $t(t) {
     } while (N);
   }
   function ce(d) {
-    var I = 0, N, _, z, E, T, M, O;
+    var I = 0, N, E, _, T, k, M, O;
     do {
       if (I > j)
         throw new tt("handleOverweighted1 is looping too much");
       N = !1;
-      for (var W = 0; W < m; W++) {
-        _ = d[W];
-        for (var L = W + 1; L < m; L++)
-          if (z = d[L], _.weight > z.weight ? (E = _, T = z) : (E = z, T = _), M = Ot(_, z), M < E.weight - T.weight) {
-            O = E.weight - T.weight - M, T.weight += O + h, N = !0, I++;
+      for (var R = 0; R < P; R++) {
+        E = d[R];
+        for (var L = R + 1; L < P; L++)
+          if (_ = d[L], E.weight > _.weight ? (T = E, k = _) : (T = _, k = E), M = Ot(E, _), M < T.weight - k.weight) {
+            O = T.weight - k.weight - M, k.weight += O + h, N = !0, I++;
             break;
           }
         if (N)
@@ -902,8 +902,8 @@ function $t(t) {
     } while (N);
   }
   function ge(d) {
-    for (var I = 0, N, _, z, E = 0; E < m; E++)
-      N = d[E], _ = N.site.originalObject, z = ft(N), I += Math.abs(_.targetedArea - z);
+    for (var I = 0, N, E, _, T = 0; T < P; T++)
+      N = d[T], E = N.site.originalObject, _ = ft(N), I += Math.abs(E.targetedArea - _);
     return I;
   }
   function pe() {
@@ -918,7 +918,7 @@ function $t(t) {
         console.error("unknown 'handleOverweighted' variant; using variant #1"), S = Lt;
     }
   }
-  return P;
+  return D;
 }
 function tn() {
   var t = 0.01, e = 50, n = 0.01, r = Math.random, o = [
@@ -937,34 +937,34 @@ function tn() {
       weight: 1
     }
   ], l = $t(a).stop();
-  function g(p) {
-    v(o, p);
+  function g(v) {
+    p(o, v);
   }
-  g.convergenceRatio = function(p) {
-    return arguments.length ? (h = p, g) : h;
-  }, g.maxIterationCount = function(p) {
-    return arguments.length ? (i = p, g) : i;
-  }, g.minWeightRatio = function(p) {
-    return arguments.length ? (s = p, g) : s;
-  }, g.clip = function(p) {
-    return arguments.length ? (l.clip(p), o = l.clip(), u = l.extent(), f = l.size(), g) : o;
-  }, g.extent = function(p) {
-    return arguments.length ? (l.extent(p), o = l.clip(), u = l.extent(), f = l.size(), g) : u;
-  }, g.size = function(p) {
-    return arguments.length ? (l.size(p), o = l.clip(), u = l.extent(), f = l.size(), g) : f;
-  }, g.prng = function(p) {
-    return arguments.length ? (c = p, g) : c;
+  g.convergenceRatio = function(v) {
+    return arguments.length ? (h = v, g) : h;
+  }, g.maxIterationCount = function(v) {
+    return arguments.length ? (i = v, g) : i;
+  }, g.minWeightRatio = function(v) {
+    return arguments.length ? (s = v, g) : s;
+  }, g.clip = function(v) {
+    return arguments.length ? (l.clip(v), o = l.clip(), u = l.extent(), f = l.size(), g) : o;
+  }, g.extent = function(v) {
+    return arguments.length ? (l.extent(v), o = l.clip(), u = l.extent(), f = l.size(), g) : u;
+  }, g.size = function(v) {
+    return arguments.length ? (l.size(v), o = l.clip(), u = l.extent(), f = l.size(), g) : f;
+  }, g.prng = function(v) {
+    return arguments.length ? (c = v, g) : c;
   };
-  function v(p, y) {
-    var C;
-    if (y.polygon = p, y.height != 0) {
-      C = $t(y.children).clip(p).weight(function(k) {
-        return k.value;
+  function p(v, y) {
+    var w;
+    if (y.polygon = v, y.height != 0) {
+      w = $t(y.children).clip(v).weight(function(z) {
+        return z.value;
       }).convergenceRatio(h).maxIterationCount(i).minWeightRatio(s).prng(c).stop();
-      for (var m = C.state(); !m.ended; )
-        C.tick(), m = C.state();
-      m.polygons.forEach(function(k) {
-        v(k, k.site.originalObject.data.originalData);
+      for (var P = w.state(); !P.ended; )
+        w.tick(), P = w.state();
+      P.polygons.forEach(function(z) {
+        p(z, z.site.originalObject.data.originalData);
       });
     }
   }
@@ -1034,9 +1034,9 @@ Tt.exports;
       };
       return a.double = function() {
         do
-          var l = s.next() >>> 11, g = (s.next() >>> 0) / 4294967296, v = (l + g) / (1 << 21);
-        while (v === 0);
-        return v;
+          var l = s.next() >>> 11, g = (s.next() >>> 0) / 4294967296, p = (l + g) / (1 << 21);
+        while (p === 0);
+        return p;
       }, a.int32 = s.next, a.quick = a, c && (typeof c == "object" && u(c, s), a.state = function() {
         return u(s, {});
       }), a;
@@ -1069,9 +1069,9 @@ kt.exports;
       };
       return a.double = function() {
         do
-          var l = s.next() >>> 11, g = (s.next() >>> 0) / 4294967296, v = (l + g) / (1 << 21);
-        while (v === 0);
-        return v;
+          var l = s.next() >>> 11, g = (s.next() >>> 0) / 4294967296, p = (l + g) / (1 << 21);
+        while (p === 0);
+        return p;
       }, a.int32 = s.next, a.quick = a, c && (typeof c == "object" && u(c, s), a.state = function() {
         return u(s, {});
       }), a;
@@ -1116,9 +1116,9 @@ Nt.exports;
       };
       return a.double = function() {
         do
-          var l = s.next() >>> 11, g = (s.next() >>> 0) / 4294967296, v = (l + g) / (1 << 21);
-        while (v === 0);
-        return v;
+          var l = s.next() >>> 11, g = (s.next() >>> 0) / 4294967296, p = (l + g) / (1 << 21);
+        while (p === 0);
+        return p;
       }, a.int32 = s.next, a.quick = a, c && (c.x && u(c, s), a.state = function() {
         return u(s, {});
       }), a;
@@ -1136,16 +1136,16 @@ It.exports;
     function o(h) {
       var i = this;
       i.next = function() {
-        var c = i.w, a = i.X, l = i.i, g, v;
-        return i.w = c = c + 1640531527 | 0, v = a[l + 34 & 127], g = a[l = l + 1 & 127], v ^= v << 13, g ^= g << 17, v ^= v >>> 15, g ^= g >>> 12, v = a[l] = v ^ g, i.i = l, v + (c ^ c >>> 16) | 0;
+        var c = i.w, a = i.X, l = i.i, g, p;
+        return i.w = c = c + 1640531527 | 0, p = a[l + 34 & 127], g = a[l = l + 1 & 127], p ^= p << 13, g ^= g << 17, p ^= p >>> 15, g ^= g >>> 12, p = a[l] = p ^ g, i.i = l, p + (c ^ c >>> 16) | 0;
       };
       function s(c, a) {
-        var l, g, v, p, y, C = [], m = 128;
-        for (a === (a | 0) ? (g = a, a = null) : (a = a + "\0", g = 0, m = Math.max(m, a.length)), v = 0, p = -32; p < m; ++p)
-          a && (g ^= a.charCodeAt((p + 32) % a.length)), p === 0 && (y = g), g ^= g << 10, g ^= g >>> 15, g ^= g << 4, g ^= g >>> 13, p >= 0 && (y = y + 1640531527 | 0, l = C[p & 127] ^= g + y, v = l == 0 ? v + 1 : 0);
-        for (v >= 128 && (C[(a && a.length || 0) & 127] = -1), v = 127, p = 4 * 128; p > 0; --p)
-          g = C[v + 34 & 127], l = C[v = v + 1 & 127], g ^= g << 13, l ^= l << 17, g ^= g >>> 15, l ^= l >>> 12, C[v] = g ^ l;
-        c.w = y, c.X = C, c.i = v;
+        var l, g, p, v, y, w = [], P = 128;
+        for (a === (a | 0) ? (g = a, a = null) : (a = a + "\0", g = 0, P = Math.max(P, a.length)), p = 0, v = -32; v < P; ++v)
+          a && (g ^= a.charCodeAt((v + 32) % a.length)), v === 0 && (y = g), g ^= g << 10, g ^= g >>> 15, g ^= g << 4, g ^= g >>> 13, v >= 0 && (y = y + 1640531527 | 0, l = w[v & 127] ^= g + y, p = l == 0 ? p + 1 : 0);
+        for (p >= 128 && (w[(a && a.length || 0) & 127] = -1), p = 127, v = 4 * 128; v > 0; --v)
+          g = w[p + 34 & 127], l = w[p = p + 1 & 127], g ^= g << 13, l ^= l << 17, g ^= g >>> 15, l ^= l >>> 12, w[p] = g ^ l;
+        c.w = y, c.X = w, c.i = p;
       }
       s(i, h);
     }
@@ -1159,9 +1159,9 @@ It.exports;
       };
       return a.double = function() {
         do
-          var l = s.next() >>> 11, g = (s.next() >>> 0) / 4294967296, v = (l + g) / (1 << 21);
-        while (v === 0);
-        return v;
+          var l = s.next() >>> 11, g = (s.next() >>> 0) / 4294967296, p = (l + g) / (1 << 21);
+        while (p === 0);
+        return p;
       }, a.int32 = s.next, a.quick = a, c && (c.X && u(c, s), a.state = function() {
         return u(s, {});
       }), a;
@@ -1180,8 +1180,8 @@ Mt.exports;
     function o(h) {
       var i = this, s = "";
       i.next = function() {
-        var a = i.b, l = i.c, g = i.d, v = i.a;
-        return a = a << 25 ^ a >>> 7 ^ l, l = l - g | 0, g = g << 24 ^ g >>> 8 ^ v, v = v - a | 0, i.b = a = a << 20 ^ a >>> 12 ^ l, i.c = l = l - g | 0, i.d = g << 16 ^ l >>> 16 ^ v, i.a = v - a | 0;
+        var a = i.b, l = i.c, g = i.d, p = i.a;
+        return a = a << 25 ^ a >>> 7 ^ l, l = l - g | 0, g = g << 24 ^ g >>> 8 ^ p, p = p - a | 0, i.b = a = a << 20 ^ a >>> 12 ^ l, i.c = l = l - g | 0, i.d = g << 16 ^ l >>> 16 ^ p, i.a = p - a | 0;
       }, i.a = 0, i.b = 0, i.c = -1640531527, i.d = 1367130551, h === Math.floor(h) ? (i.a = h / 4294967296 | 0, i.b = h | 0) : s += h;
       for (var c = 0; c < s.length + 20; c++)
         i.b ^= s.charCodeAt(c) | 0, i.next();
@@ -1195,9 +1195,9 @@ Mt.exports;
       };
       return a.double = function() {
         do
-          var l = s.next() >>> 11, g = (s.next() >>> 0) / 4294967296, v = (l + g) / (1 << 21);
-        while (v === 0);
-        return v;
+          var l = s.next() >>> 11, g = (s.next() >>> 0) / 4294967296, p = (l + g) / (1 << 21);
+        while (p === 0);
+        return p;
       }, a.int32 = s.next, a.quick = a, c && (typeof c == "object" && u(c, s), a.state = function() {
         return u(s, {});
       }), a;
@@ -1216,77 +1216,77 @@ const hn = {}, ln = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineP
 (function(t) {
   (function(e, n, r) {
     var o = 256, u = 6, f = 52, h = "random", i = r.pow(o, u), s = r.pow(2, f), c = s * 2, a = o - 1, l;
-    function g(x, w, A) {
-      var b = [];
-      w = w == !0 ? { entropy: !0 } : w || {};
-      var D = C(y(
-        w.entropy ? [x, k(n)] : x ?? m(),
+    function g(x, m, C) {
+      var A = [];
+      m = m == !0 ? { entropy: !0 } : m || {};
+      var b = w(y(
+        m.entropy ? [x, z(n)] : x ?? P(),
         3
-      ), b), F = new v(b), P = function() {
-        for (var R = F.g(u), V = i, X = 0; R < s; )
-          R = (R + X) * o, V *= o, X = F.g(1);
-        for (; R >= c; )
-          R /= 2, V /= 2, X >>>= 1;
-        return (R + X) / V;
+      ), A), F = new p(A), D = function() {
+        for (var W = F.g(u), V = i, X = 0; W < s; )
+          W = (W + X) * o, V *= o, X = F.g(1);
+        for (; W >= c; )
+          W /= 2, V /= 2, X >>>= 1;
+        return (W + X) / V;
       };
-      return P.int32 = function() {
+      return D.int32 = function() {
         return F.g(4) | 0;
-      }, P.quick = function() {
+      }, D.quick = function() {
         return F.g(4) / 4294967296;
-      }, P.double = P, C(k(F.S), n), (w.pass || A || function(R, V, X, j) {
-        return j && (j.S && p(j, F), R.state = function() {
-          return p(F, {});
-        }), X ? (r[h] = R, V) : R;
+      }, D.double = D, w(z(F.S), n), (m.pass || C || function(W, V, X, j) {
+        return j && (j.S && v(j, F), W.state = function() {
+          return v(F, {});
+        }), X ? (r[h] = W, V) : W;
       })(
-        P,
         D,
-        "global" in w ? w.global : this == r,
-        w.state
+        b,
+        "global" in m ? m.global : this == r,
+        m.state
       );
     }
-    function v(x) {
-      var w, A = x.length, b = this, D = 0, F = b.i = b.j = 0, P = b.S = [];
-      for (A || (x = [A++]); D < o; )
-        P[D] = D++;
-      for (D = 0; D < o; D++)
-        P[D] = P[F = a & F + x[D % A] + (w = P[D])], P[F] = w;
-      (b.g = function(R) {
-        for (var V, X = 0, j = b.i, S = b.j, Y = b.S; R--; )
+    function p(x) {
+      var m, C = x.length, A = this, b = 0, F = A.i = A.j = 0, D = A.S = [];
+      for (C || (x = [C++]); b < o; )
+        D[b] = b++;
+      for (b = 0; b < o; b++)
+        D[b] = D[F = a & F + x[b % C] + (m = D[b])], D[F] = m;
+      (A.g = function(W) {
+        for (var V, X = 0, j = A.i, S = A.j, Y = A.S; W--; )
           V = Y[j = a & j + 1], X = X * o + Y[a & (Y[j] = Y[S = a & S + V]) + (Y[S] = V)];
-        return b.i = j, b.j = S, X;
+        return A.i = j, A.j = S, X;
       })(o);
     }
-    function p(x, w) {
-      return w.i = x.i, w.j = x.j, w.S = x.S.slice(), w;
+    function v(x, m) {
+      return m.i = x.i, m.j = x.j, m.S = x.S.slice(), m;
     }
-    function y(x, w) {
-      var A = [], b = typeof x, D;
-      if (w && b == "object")
-        for (D in x)
+    function y(x, m) {
+      var C = [], A = typeof x, b;
+      if (m && A == "object")
+        for (b in x)
           try {
-            A.push(y(x[D], w - 1));
+            C.push(y(x[b], m - 1));
           } catch {
           }
-      return A.length ? A : b == "string" ? x : x + "\0";
+      return C.length ? C : A == "string" ? x : x + "\0";
     }
-    function C(x, w) {
-      for (var A = x + "", b, D = 0; D < A.length; )
-        w[a & D] = a & (b ^= w[a & D] * 19) + A.charCodeAt(D++);
-      return k(w);
+    function w(x, m) {
+      for (var C = x + "", A, b = 0; b < C.length; )
+        m[a & b] = a & (A ^= m[a & b] * 19) + C.charCodeAt(b++);
+      return z(m);
     }
-    function m() {
+    function P() {
       try {
         var x;
-        return l && (x = l.randomBytes) ? x = x(o) : (x = new Uint8Array(o), (e.crypto || e.msCrypto).getRandomValues(x)), k(x);
+        return l && (x = l.randomBytes) ? x = x(o) : (x = new Uint8Array(o), (e.crypto || e.msCrypto).getRandomValues(x)), z(x);
       } catch {
-        var w = e.navigator, A = w && w.plugins;
-        return [+/* @__PURE__ */ new Date(), e, A, e.screen, k(n)];
+        var m = e.navigator, C = m && m.plugins;
+        return [+/* @__PURE__ */ new Date(), e, C, e.screen, z(n)];
       }
     }
-    function k(x) {
+    function z(x) {
       return String.fromCharCode.apply(0, x);
     }
-    if (C(r.random(), n), t.exports) {
+    if (w(r.random(), n), t.exports) {
       t.exports = g;
       try {
         l = un;
@@ -1357,8 +1357,8 @@ class xt extends Jt {
       let f = 1 / 0, h = -1 / 0;
       for (let a = 0, l = n.length; a < l; a++) {
         const g = n[a];
-        let v = g[0] * u, p = g[1] * u;
-        o.push([v, p]), f = Math.min(f, v), h = Math.max(h, v);
+        let p = g[0] * u, v = g[1] * u;
+        o.push([p, v]), f = Math.min(f, p), h = Math.max(h, p);
       }
       r.set("coordinates", o);
       const i = e.get("fill"), s = e.get("fillPattern");
@@ -1428,38 +1428,32 @@ const Tn = (t) => {
     sx: h,
     ...i
   } = e, s = be(), a = `hc-drill-down-voronoi-treemap-${Pe().replace(/:/g, "")}`, l = ze(null);
-  _e(() => {
+  let g = null;
+  n.length < 2 ? g = "DrillDownVoronoiTreemap requires at least 2 dimensions" : r.length < 1 && (g = "DrillDownVoronoiTreemap requires at least 1 value"), _e(() => {
+    if (g) return;
     let v;
     return v = setTimeout(() => {
-      if (n.length < 2) {
-        console.error("DrillDownVoronoiTreemap requires at least 2 dimensions");
-        return;
-      }
-      if (r.length < 1) {
-        console.error("DrillDownVoronoiTreemap requires at least 1 value");
-        return;
-      }
-      const p = xe.new(a);
-      l.current = p;
-      const y = we.new(p);
-      y.rule("Polygon", ["hierarchy", "node", "shape", "depth0"]).setAll({ strokeOpacity: 0, fillOpacity: 0 }), y.rule("Polygon", ["hierarchy", "node", "shape", "depth1"]).setAll({
+      const y = xe.new(a);
+      l.current = y;
+      const w = we.new(y);
+      w.rule("Polygon", ["hierarchy", "node", "shape", "depth0"]).setAll({ strokeOpacity: 0, fillOpacity: 0 }), w.rule("Polygon", ["hierarchy", "node", "shape", "depth1"]).setAll({
         strokeWidth: 5,
         fillOpacity: 1,
         stroke: Ht(0)
-      }), y.rule("Polygon", ["hierarchy", "node", "shape", "depth2"]).setAll({
+      }), w.rule("Polygon", ["hierarchy", "node", "shape", "depth2"]).setAll({
         fillOpacity: 0,
         strokeWidth: 1,
         stroke: Ht(0)
-      }), y.rule("HierarchyNode", ["last"]).setAll({ cursorOverStyle: "pointer" }), y.rule("Label", ["node"]).setAll({ fontSize: 11, minScale: 0.7 }), y.rule("Label", ["node", "depth0"]).setAll({ forceHidden: !0 }), y.rule("Label", ["node", "depth1"]).setAll({ forceHidden: !0 }), p.setThemes([me.new(p), y]);
-      const m = p.container.children.push(
-        Te.new(p, {
+      }), w.rule("HierarchyNode", ["last"]).setAll({ cursorOverStyle: "pointer" }), w.rule("Label", ["node"]).setAll({ fontSize: 11, minScale: 0.7 }), w.rule("Label", ["node", "depth0"]).setAll({ forceHidden: !0 }), w.rule("Label", ["node", "depth1"]).setAll({ forceHidden: !0 }), y.setThemes([me.new(y), w]);
+      const z = y.container.children.push(
+        Te.new(y, {
           width: Vt,
           height: Vt,
           wheelable: !0,
           pinchZoom: !0
         })
       ).contents.children.push(
-        xt.new(p, {
+        xt.new(y, {
           paddingLeft: 5,
           paddingRight: 5,
           paddingTop: 5,
@@ -1476,34 +1470,34 @@ const Tn = (t) => {
           cornerCount: 120
         })
       );
-      m.set("colors", De(p, f)), m.labels.template.adapters.add("x", function(x, w) {
-        const A = w.dataItem;
+      z.set("colors", De(y, f)), z.labels.template.adapters.add("x", function(m, C) {
+        const A = C.dataItem;
         if (A) {
           const b = A.get("polygon");
           if (b) {
-            const D = b.getPrivate("minX", 0), F = b.getPrivate("maxX", 0), P = A.dataContext;
-            P && (F - D < 50 ? w.set("text", P.id) : w.set("text", P.name));
+            const F = b.getPrivate("minX", 0), D = b.getPrivate("maxX", 0), W = A.dataContext;
+            W && (D - F < 50 ? C.set("text", W.id) : C.set("text", W.name));
           }
         }
-        return x;
-      }), m.nodes.template.events.on("click", function(x) {
-        const w = x.target.dataItem;
-        w && (w.get("children") || m.selectDataItem(w.get("parent")));
+        return m;
+      }), z.nodes.template.events.on("click", function(m) {
+        const C = m.target.dataItem;
+        C && (C.get("children") || z.selectDataItem(C.get("parent")));
       });
-      const k = (x, w, A) => {
-        if (x === "date") {
+      const x = (m, C, A) => {
+        if (m === "date") {
           let b = "YYYY";
-          return w.includes("month") ? b = "MMM YYYY" : w.includes("day") && (b = "DD MMM YYYY"), Ce(A).format(b);
+          return C.includes("month") ? b = "MMM YYYY" : C.includes("day") && (b = "DD MMM YYYY"), Ce(A).format(b);
         }
         return A;
       };
       if (n.length > 1) {
-        const x = Ae.groupBy(o, n[0].value), w = [];
-        Object.keys(x).forEach((A) => {
-          w.push({
-            name: k(n[0].type, n[0].value, A),
-            children: x[A].map((b) => ({
-              name: k(
+        const m = Ae.groupBy(o, n[0].value), C = [];
+        Object.keys(m).forEach((A) => {
+          C.push({
+            name: x(n[0].type, n[0].value, A),
+            children: m[A].map((b) => ({
+              name: x(
                 n[1].type,
                 n[1].value,
                 b[n[1].value]
@@ -1511,16 +1505,16 @@ const Tn = (t) => {
               [r[0].dataFieldName]: b[r[0].dataFieldName]
             }))
           });
-        }), m.data.setAll([{ children: w }]);
+        }), z.data.setAll([{ children: C }]);
       }
-      m.set("selectedDataItem", m.dataItems[0]), m.appear(1e3, 100);
+      z.set("selectedDataItem", z.dataItems[0]), z.appear(1e3, 100);
     }, u), () => {
-      var p;
-      v && clearTimeout(v), (p = l.current) == null || p.dispose(), l.current = null;
+      var y;
+      v && clearTimeout(v), (y = l.current) == null || y.dispose(), l.current = null;
     };
   }, [o, n, r, s.palette.mode, f]);
-  const g = { ...e };
-  return { chartId: a, ownerState: g, sx: h, other: i };
+  const p = { ...e };
+  return { chartId: a, ownerState: p, sx: h, error: g, other: i };
 };
 export {
   Tn as useDrillDownVoronoiTreemapLogic