npm - @ubloimmo/uikit - Versions diffs - 1.7.2 → 1.7.3 - Mend

@ubloimmo/uikit 1.7.2 → 1.7.3

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.

Files changed (2859) hide show

package/dist/node_modules/big.js/big.js ADDED Viewed

@@ -0,0 +1,281 @@
+/**
+* @ubloimmo/uikit version 1.7.3
+*
+* Copyright © Ublo 2025
+* https://ublo.immo
+*/
+var _ = 20, m = 1, P = 1e6, O = 1e6, S = -7, U = 21, V = !1, N = "[big.js] ", p = N + "Invalid ", A = p + "decimal places", L = p + "rounding mode", j = N + "Division by zero", h = {}, w = void 0, T = /^-?(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i;
+function q() {
+  function r(e) {
+    var t = this;
+    if (!(t instanceof r)) return e === w ? q() : new r(e);
+    if (e instanceof r)
+      t.s = e.s, t.e = e.e, t.c = e.c.slice();
+    else {
+      if (typeof e != "string") {
+        if (r.strict === !0 && typeof e != "bigint")
+          throw TypeError(p + "value");
+        e = e === 0 && 1 / e < 0 ? "-0" : String(e);
+      }
+      z(t, e);
+    }
+    t.constructor = r;
+  }
+  return r.prototype = h, r.DP = _, r.RM = m, r.NE = S, r.PE = U, r.strict = V, r.roundDown = 0, r.roundHalfUp = 1, r.roundHalfEven = 2, r.roundUp = 3, r;
+}
+function z(r, e) {
+  var t, n, i;
+  if (!T.test(e))
+    throw Error(p + "number");
+  for (r.s = e.charAt(0) == "-" ? (e = e.slice(1), -1) : 1, (t = e.indexOf(".")) > -1 && (e = e.replace(".", "")), (n = e.search(/e/i)) > 0 ? (t < 0 && (t = n), t += +e.slice(n + 1), e = e.substring(0, n)) : t < 0 && (t = e.length), i = e.length, n = 0; n < i && e.charAt(n) == "0"; ) ++n;
+  if (n == i)
+    r.c = [r.e = 0];
+  else {
+    for (; i > 0 && e.charAt(--i) == "0"; ) ;
+    for (r.e = t - n - 1, r.c = [], t = 0; n <= i; ) r.c[t++] = +e.charAt(n++);
+  }
+  return r;
+}
+function b(r, e, t, n) {
+  var i = r.c;
+  if (t === w && (t = r.constructor.RM), t !== 0 && t !== 1 && t !== 2 && t !== 3)
+    throw Error(L);
+  if (e < 1)
+    n = t === 3 && (n || !!i[0]) || e === 0 && (t === 1 && i[0] >= 5 || t === 2 && (i[0] > 5 || i[0] === 5 && (n || i[1] !== w))), i.length = 1, n ? (r.e = r.e - e + 1, i[0] = 1) : i[0] = r.e = 0;
+  else if (e < i.length) {
+    if (n = t === 1 && i[e] >= 5 || t === 2 && (i[e] > 5 || i[e] === 5 && (n || i[e + 1] !== w || i[e - 1] & 1)) || t === 3 && (n || !!i[0]), i.length = e, n) {
+      for (; ++i[--e] > 9; )
+        if (i[e] = 0, e === 0) {
+          ++r.e, i.unshift(1);
+          break;
+        }
+    }
+    for (e = i.length; !i[--e]; ) i.pop();
+  }
+  return r;
+}
+function x(r, e, t) {
+  var n = r.e, i = r.c.join(""), s = i.length;
+  if (e)
+    i = i.charAt(0) + (s > 1 ? "." + i.slice(1) : "") + (n < 0 ? "e" : "e+") + n;
+  else if (n < 0) {
+    for (; ++n; ) i = "0" + i;
+    i = "0." + i;
+  } else if (n > 0)
+    if (++n > s)
+      for (n -= s; n--; ) i += "0";
+    else n < s && (i = i.slice(0, n) + "." + i.slice(n));
+  else s > 1 && (i = i.charAt(0) + "." + i.slice(1));
+  return r.s < 0 && t ? "-" + i : i;
+}
+h.abs = function() {
+  var r = new this.constructor(this);
+  return r.s = 1, r;
+};
+h.cmp = function(r) {
+  var e, t = this, n = t.c, i = (r = new t.constructor(r)).c, s = t.s, u = r.s, o = t.e, f = r.e;
+  if (!n[0] || !i[0]) return n[0] ? s : i[0] ? -u : 0;
+  if (s != u) return s;
+  if (e = s < 0, o != f) return o > f ^ e ? 1 : -1;
+  for (u = (o = n.length) < (f = i.length) ? o : f, s = -1; ++s < u; )
+    if (n[s] != i[s]) return n[s] > i[s] ^ e ? 1 : -1;
+  return o == f ? 0 : o > f ^ e ? 1 : -1;
+};
+h.div = function(r) {
+  var e = this, t = e.constructor, n = e.c, i = (r = new t(r)).c, s = e.s == r.s ? 1 : -1, u = t.DP;
+  if (u !== ~~u || u < 0 || u > P)
+    throw Error(A);
+  if (!i[0])
+    throw Error(j);
+  if (!n[0])
+    return r.s = s, r.c = [r.e = 0], r;
+  var o, f, c, v, l, E = i.slice(), B = o = i.length, k = n.length, a = n.slice(0, o), g = a.length, D = r, R = D.c = [], I = 0, M = u + (D.e = e.e - r.e) + 1;
+  for (D.s = s, s = M < 0 ? 0 : M, E.unshift(0); g++ < o; ) a.push(0);
+  do {
+    for (c = 0; c < 10; c++) {
+      if (o != (g = a.length))
+        v = o > g ? 1 : -1;
+      else
+        for (l = -1, v = 0; ++l < o; )
+          if (i[l] != a[l]) {
+            v = i[l] > a[l] ? 1 : -1;
+            break;
+          }
+      if (v < 0) {
+        for (f = g == o ? i : E; g; ) {
+          if (a[--g] < f[g]) {
+            for (l = g; l && !a[--l]; ) a[l] = 9;
+            --a[l], a[g] += 10;
+          }
+          a[g] -= f[g];
+        }
+        for (; !a[0]; ) a.shift();
+      } else
+        break;
+    }
+    R[I++] = v ? c : ++c, a[0] && v ? a[g] = n[B] || 0 : a = [n[B]];
+  } while ((B++ < k || a[0] !== w) && s--);
+  return !R[0] && I != 1 && (R.shift(), D.e--, M--), I > M && b(D, M, t.RM, a[0] !== w), D;
+};
+h.eq = function(r) {
+  return this.cmp(r) === 0;
+};
+h.gt = function(r) {
+  return this.cmp(r) > 0;
+};
+h.gte = function(r) {
+  return this.cmp(r) > -1;
+};
+h.lt = function(r) {
+  return this.cmp(r) < 0;
+};
+h.lte = function(r) {
+  return this.cmp(r) < 1;
+};
+h.minus = h.sub = function(r) {
+  var e, t, n, i, s = this, u = s.constructor, o = s.s, f = (r = new u(r)).s;
+  if (o != f)
+    return r.s = -f, s.plus(r);
+  var c = s.c.slice(), v = s.e, l = r.c, E = r.e;
+  if (!c[0] || !l[0])
+    return l[0] ? r.s = -f : c[0] ? r = new u(s) : r.s = 1, r;
+  if (o = v - E) {
+    for ((i = o < 0) ? (o = -o, n = c) : (E = v, n = l), n.reverse(), f = o; f--; ) n.push(0);
+    n.reverse();
+  } else
+    for (t = ((i = c.length < l.length) ? c : l).length, o = f = 0; f < t; f++)
+      if (c[f] != l[f]) {
+        i = c[f] < l[f];
+        break;
+      }
+  if (i && (n = c, c = l, l = n, r.s = -r.s), (f = (t = l.length) - (e = c.length)) > 0) for (; f--; ) c[e++] = 0;
+  for (f = e; t > o; ) {
+    if (c[--t] < l[t]) {
+      for (e = t; e && !c[--e]; ) c[e] = 9;
+      --c[e], c[t] += 10;
+    }
+    c[t] -= l[t];
+  }
+  for (; c[--f] === 0; ) c.pop();
+  for (; c[0] === 0; )
+    c.shift(), --E;
+  return c[0] || (r.s = 1, c = [E = 0]), r.c = c, r.e = E, r;
+};
+h.mod = function(r) {
+  var e, t = this, n = t.constructor, i = t.s, s = (r = new n(r)).s;
+  if (!r.c[0])
+    throw Error(j);
+  return t.s = r.s = 1, e = r.cmp(t) == 1, t.s = i, r.s = s, e ? new n(t) : (i = n.DP, s = n.RM, n.DP = n.RM = 0, t = t.div(r), n.DP = i, n.RM = s, this.minus(t.times(r)));
+};
+h.neg = function() {
+  var r = new this.constructor(this);
+  return r.s = -r.s, r;
+};
+h.plus = h.add = function(r) {
+  var e, t, n, i = this, s = i.constructor;
+  if (r = new s(r), i.s != r.s)
+    return r.s = -r.s, i.minus(r);
+  var u = i.e, o = i.c, f = r.e, c = r.c;
+  if (!o[0] || !c[0])
+    return c[0] || (o[0] ? r = new s(i) : r.s = i.s), r;
+  if (o = o.slice(), e = u - f) {
+    for (e > 0 ? (f = u, n = c) : (e = -e, n = o), n.reverse(); e--; ) n.push(0);
+    n.reverse();
+  }
+  for (o.length - c.length < 0 && (n = c, c = o, o = n), e = c.length, t = 0; e; o[e] %= 10) t = (o[--e] = o[e] + c[e] + t) / 10 | 0;
+  for (t && (o.unshift(t), ++f), e = o.length; o[--e] === 0; ) o.pop();
+  return r.c = o, r.e = f, r;
+};
+h.pow = function(r) {
+  var e = this, t = new e.constructor("1"), n = t, i = r < 0;
+  if (r !== ~~r || r < -1e6 || r > O)
+    throw Error(p + "exponent");
+  for (i && (r = -r); r & 1 && (n = n.times(e)), r >>= 1, !!r; )
+    e = e.times(e);
+  return i ? t.div(n) : n;
+};
+h.prec = function(r, e) {
+  if (r !== ~~r || r < 1 || r > P)
+    throw Error(p + "precision");
+  return b(new this.constructor(this), r, e);
+};
+h.round = function(r, e) {
+  if (r === w) r = 0;
+  else if (r !== ~~r || r < -1e6 || r > P)
+    throw Error(A);
+  return b(new this.constructor(this), r + this.e + 1, e);
+};
+h.sqrt = function() {
+  var r, e, t, n = this, i = n.constructor, s = n.s, u = n.e, o = new i("0.5");
+  if (!n.c[0]) return new i(n);
+  if (s < 0)
+    throw Error(N + "No square root");
+  s = Math.sqrt(+x(n, !0, !0)), s === 0 || s === 1 / 0 ? (e = n.c.join(""), e.length + u & 1 || (e += "0"), s = Math.sqrt(e), u = ((u + 1) / 2 | 0) - (u < 0 || u & 1), r = new i((s == 1 / 0 ? "5e" : (s = s.toExponential()).slice(0, s.indexOf("e") + 1)) + u)) : r = new i(s + ""), u = r.e + (i.DP += 4);
+  do
+    t = r, r = o.times(t.plus(n.div(t)));
+  while (t.c.slice(0, u).join("") !== r.c.slice(0, u).join(""));
+  return b(r, (i.DP -= 4) + r.e + 1, i.RM);
+};
+h.times = h.mul = function(r) {
+  var e, t = this, n = t.constructor, i = t.c, s = (r = new n(r)).c, u = i.length, o = s.length, f = t.e, c = r.e;
+  if (r.s = t.s == r.s ? 1 : -1, !i[0] || !s[0])
+    return r.c = [r.e = 0], r;
+  for (r.e = f + c, u < o && (e = i, i = s, s = e, c = u, u = o, o = c), e = new Array(c = u + o); c--; ) e[c] = 0;
+  for (f = o; f--; ) {
+    for (o = 0, c = u + f; c > f; )
+      o = e[c] + s[f] * i[c - f - 1] + o, e[c--] = o % 10, o = o / 10 | 0;
+    e[c] = o;
+  }
+  for (o ? ++r.e : e.shift(), f = e.length; !e[--f]; ) e.pop();
+  return r.c = e, r;
+};
+h.toExponential = function(r, e) {
+  var t = this, n = t.c[0];
+  if (r !== w) {
+    if (r !== ~~r || r < 0 || r > P)
+      throw Error(A);
+    for (t = b(new t.constructor(t), ++r, e); t.c.length < r; ) t.c.push(0);
+  }
+  return x(t, !0, !!n);
+};
+h.toFixed = function(r, e) {
+  var t = this, n = t.c[0];
+  if (r !== w) {
+    if (r !== ~~r || r < 0 || r > P)
+      throw Error(A);
+    for (t = b(new t.constructor(t), r + t.e + 1, e), r = r + t.e + 1; t.c.length < r; ) t.c.push(0);
+  }
+  return x(t, !1, !!n);
+};
+h[Symbol.for("nodejs.util.inspect.custom")] = h.toJSON = h.toString = function() {
+  var r = this, e = r.constructor;
+  return x(r, r.e <= e.NE || r.e >= e.PE, !!r.c[0]);
+};
+h.toNumber = function() {
+  var r = +x(this, !0, !0);
+  if (this.constructor.strict === !0 && !this.eq(r.toString()))
+    throw Error(N + "Imprecise conversion");
+  return r;
+};
+h.toPrecision = function(r, e) {
+  var t = this, n = t.constructor, i = t.c[0];
+  if (r !== w) {
+    if (r !== ~~r || r < 1 || r > P)
+      throw Error(p + "precision");
+    for (t = b(new n(t), r, e); t.c.length < r; ) t.c.push(0);
+  }
+  return x(t, r <= t.e || t.e <= n.NE || t.e >= n.PE, !!i);
+};
+h.valueOf = function() {
+  var r = this, e = r.constructor;
+  if (e.strict === !0)
+    throw Error(N + "valueOf disallowed");
+  return x(r, r.e <= e.NE || r.e >= e.PE, !0);
+};
+var C = q();
+export {
+  C as Big,
+  C as default
+};