drizzle-cube 0.5.1 → 0.5.3

package/dist/client/chunks/{exceljs.min-CcjgM-qg.js → exceljs.min-DaJsLlWM.js}

@@ -846,7 +846,7 @@ var n = /* @__PURE__ */ t(((t, n) => {
 									this.model.address = e;
 								}
 								toCsvString() {
-									return this.model.value ? 1 : 0;
+									return +!!this.model.value;
 								}
 								release() {}
 								toString() {
@@ -1834,10 +1834,10 @@ var n = /* @__PURE__ */ t(((t, n) => {
 						return this.table.rows.length;
 					}
 					get filterHeight() {
-						return this.height + (this.table.headerRow ? 1 : 0);
+						return this.height + +!!this.table.headerRow;
 					}
 					get tableHeight() {
-						return this.filterHeight + (this.table.totalsRow ? 1 : 0);
+						return this.filterHeight + +!!this.table.totalsRow;
 					}
 					validate() {
 						let { table: e } = this, t = (e, t, n) => {
@@ -3199,7 +3199,7 @@ var n = /* @__PURE__ */ t(((t, n) => {
 						}
 						return a === o ? n : n + e.substring(a, o);
 					},
-					strcmp: (e, t) => e < t ? -1 : e > t ? 1 : 0,
+					strcmp: (e, t) => e < t ? -1 : +(e > t),
 					isUndefined: (e) => r.call(e) === "[object Undefined]",
 					isObject: (e) => r.call(e) === "[object Object]",
 					deepMerge() {
@@ -5403,7 +5403,7 @@ var n = /* @__PURE__ */ t(((t, n) => {
 								e.leafNode("f", n, t.formula), e.leafNode("v", null, t.result);
 								break;
 							case o.ValueType.Boolean:
-								e.addAttribute("t", "b"), e.leafNode("f", n, t.formula), e.leafNode("v", null, t.result ? 1 : 0);
+								e.addAttribute("t", "b"), e.leafNode("f", n, t.formula), e.leafNode("v", null, +!!t.result);
 								break;
 							case o.ValueType.Error:
 								e.addAttribute("t", "e"), e.leafNode("f", n, t.formula), e.leafNode("v", null, t.result.error);
@@ -14760,7 +14760,7 @@ var n = /* @__PURE__ */ t(((t, n) => {
 					p = r.from(p);
 					var g = i.mont(d.modulus);
 					e = (e = new i(e).toRed(g)).redPow(new i(d.publicExponent)), e = r.from(e.fromRed().toArray());
-					var _ = m < 8 ? 1 : 0;
+					var _ = +(m < 8);
 					for (f = Math.min(e.length, p.length), e.length !== p.length && (_ = 1), h = -1; ++h < f;) _ |= e[h] ^ p[h];
 					return _ === 0;
 				};
@@ -15189,7 +15189,7 @@ var n = /* @__PURE__ */ t(((t, n) => {
 								n = e[i], r = t[i];
 								break;
 							}
-							return n < r ? -1 : r < n ? 1 : 0;
+							return n < r ? -1 : +(r < n);
 						}, a.isEncoding = function(e) {
 							switch (String(e).toLowerCase()) {
 								case "hex":
@@ -15252,7 +15252,7 @@ var n = /* @__PURE__ */ t(((t, n) => {
 								o = l[d], s = u[d];
 								break;
 							}
-							return o < s ? -1 : s < o ? 1 : 0;
+							return o < s ? -1 : +(s < o);
 						}, a.prototype.includes = function(e, t, n) {
 							return this.indexOf(e, t, n) !== -1;
 						}, a.prototype.indexOf = function(e, t, n) {
@@ -20633,7 +20633,7 @@ var n = /* @__PURE__ */ t(((t, n) => {
 								if (g.cmpn(0) !== 0) {
 									var _ = p.invm(this.n).mul(g.mul(t.getPrivate()).iadd(e));
 									if ((_ = _.umod(this.n)).cmpn(0) !== 0) {
-										var v = (m.getY().isOdd() ? 1 : 0) | (h.cmp(g) === 0 ? 0 : 2);
+										var v = !!m.getY().isOdd() | (h.cmp(g) === 0 ? 0 : 2);
 										return a.canonical && _.cmp(this.nh) > 0 && (_ = this.n.sub(_), v ^= 1), new u({
 											r: g,
 											s: _,
@@ -22506,19 +22506,19 @@ var n = /* @__PURE__ */ t(((t, n) => {
 					return e + t + n + r + i >>> 0;
 				}, n.sum64 = function(e, t, n, r) {
 					var i = e[t], a = r + e[t + 1] >>> 0;
-					e[t] = (a < r ? 1 : 0) + n + i >>> 0, e[t + 1] = a;
+					e[t] = +(a < r) + n + i >>> 0, e[t + 1] = a;
 				}, n.sum64_hi = function(e, t, n, r) {
-					return (t + r >>> 0 < t ? 1 : 0) + e + n >>> 0;
+					return +(t + r >>> 0 < t) + e + n >>> 0;
 				}, n.sum64_lo = function(e, t, n, r) {
 					return t + r >>> 0;
 				}, n.sum64_4_hi = function(e, t, n, r, i, a, o, s) {
 					var c = 0, l = t;
-					return c += (l = l + r >>> 0) < t ? 1 : 0, c += (l = l + a >>> 0) < a ? 1 : 0, e + n + i + o + (c += (l = l + s >>> 0) < s ? 1 : 0) >>> 0;
+					return c += +((l = l + r >>> 0) < t), c += +((l = l + a >>> 0) < a), e + n + i + o + (c += +((l = l + s >>> 0) < s)) >>> 0;
 				}, n.sum64_4_lo = function(e, t, n, r, i, a, o, s) {
 					return t + r + a + s >>> 0;
 				}, n.sum64_5_hi = function(e, t, n, r, i, a, o, s, c, l) {
 					var u = 0, d = t;
-					return u += (d = d + r >>> 0) < t ? 1 : 0, u += (d = d + a >>> 0) < a ? 1 : 0, u += (d = d + s >>> 0) < s ? 1 : 0, e + n + i + o + c + (u += (d = d + l >>> 0) < l ? 1 : 0) >>> 0;
+					return u += +((d = d + r >>> 0) < t), u += +((d = d + a >>> 0) < a), u += +((d = d + s >>> 0) < s), e + n + i + o + c + (u += +((d = d + l >>> 0) < l)) >>> 0;
 				}, n.sum64_5_lo = function(e, t, n, r, i, a, o, s, c, l) {
 					return t + r + a + s + l >>> 0;
 				}, n.rotr64_hi = function(e, t, n) {
@@ -22578,8 +22578,8 @@ var n = /* @__PURE__ */ t(((t, n) => {
 					}
 					return (p ? -1 : 1) * o * 2 ** (a - r);
 				}, n.write = function(e, t, n, r, i, a) {
-					var o, s, c, l = 8 * a - i - 1, u = (1 << l) - 1, d = u >> 1, f = i === 23 ? 2 ** -24 - 2 ** -77 : 0, p = r ? 0 : a - 1, m = r ? 1 : -1, h = t < 0 || t === 0 && 1 / t < 0 ? 1 : 0;
-					for (t = Math.abs(t), isNaN(t) || t === Infinity ? (s = isNaN(t) ? 1 : 0, o = u) : (o = Math.floor(Math.log(t) / Math.LN2), t * (c = 2 ** -o) < 1 && (o--, c *= 2), (t += o + d >= 1 ? f / c : f * 2 ** (1 - d)) * c >= 2 && (o++, c /= 2), o + d >= u ? (s = 0, o = u) : o + d >= 1 ? (s = (t * c - 1) * 2 ** i, o += d) : (s = t * 2 ** (d - 1) * 2 ** i, o = 0)); i >= 8; e[n + p] = 255 & s, p += m, s /= 256, i -= 8);
+					var o, s, c, l = 8 * a - i - 1, u = (1 << l) - 1, d = u >> 1, f = i === 23 ? 2 ** -24 - 2 ** -77 : 0, p = r ? 0 : a - 1, m = r ? 1 : -1, h = +(t < 0 || t === 0 && 1 / t < 0);
+					for (t = Math.abs(t), isNaN(t) || t === Infinity ? (s = +!!isNaN(t), o = u) : (o = Math.floor(Math.log(t) / Math.LN2), t * (c = 2 ** -o) < 1 && (o--, c *= 2), (t += o + d >= 1 ? f / c : f * 2 ** (1 - d)) * c >= 2 && (o++, c /= 2), o + d >= u ? (s = 0, o = u) : o + d >= 1 ? (s = (t * c - 1) * 2 ** i, o += d) : (s = t * 2 ** (d - 1) * 2 ** i, o = 0)); i >= 8; e[n + p] = 255 & s, p += m, s /= 256, i -= 8);
 					for (o = o << i | s, l += i; l > 0; e[n + p] = 255 & o, p += m, o /= 256, l -= 8);
 					e[n + p - m] |= 128 * h;
 				};
@@ -24517,7 +24517,7 @@ while (l[++a] === l[++n] && l[++a] === l[++n] && l[++a] === l[++n] && l[++a] ===
 										var n, i, o, c;
 										if (!e || !e.state || 5 < t || t < 0) return e ? p(e, l) : l;
 										if (i = e.state, !e.output || !e.input && e.avail_in !== 0 || i.status === 666 && t !== 4) return p(e, e.avail_out === 0 ? -5 : l);
-										if (i.strm = e, n = i.last_flush, i.last_flush = t, i.status === 42) if (i.wrap === 2) e.adler = 0, v(i, 31), v(i, 139), v(i, 8), i.gzhead ? (v(i, (i.gzhead.text ? 1 : 0) + (i.gzhead.hcrc ? 2 : 0) + (i.gzhead.extra ? 4 : 0) + (i.gzhead.name ? 8 : 0) + (i.gzhead.comment ? 16 : 0)), v(i, 255 & i.gzhead.time), v(i, i.gzhead.time >> 8 & 255), v(i, i.gzhead.time >> 16 & 255), v(i, i.gzhead.time >> 24 & 255), v(i, i.level === 9 ? 2 : 2 <= i.strategy || i.level < 2 ? 4 : 0), v(i, 255 & i.gzhead.os), i.gzhead.extra && i.gzhead.extra.length && (v(i, 255 & i.gzhead.extra.length), v(i, i.gzhead.extra.length >> 8 & 255)), i.gzhead.hcrc && (e.adler = s(e.adler, i.pending_buf, i.pending, 0)), i.gzindex = 0, i.status = 69) : (v(i, 0), v(i, 0), v(i, 0), v(i, 0), v(i, 0), v(i, i.level === 9 ? 2 : 2 <= i.strategy || i.level < 2 ? 4 : 0), v(i, 3), i.status = f);
+										if (i.strm = e, n = i.last_flush, i.last_flush = t, i.status === 42) if (i.wrap === 2) e.adler = 0, v(i, 31), v(i, 139), v(i, 8), i.gzhead ? (v(i, +!!i.gzhead.text + (i.gzhead.hcrc ? 2 : 0) + (i.gzhead.extra ? 4 : 0) + (i.gzhead.name ? 8 : 0) + (i.gzhead.comment ? 16 : 0)), v(i, 255 & i.gzhead.time), v(i, i.gzhead.time >> 8 & 255), v(i, i.gzhead.time >> 16 & 255), v(i, i.gzhead.time >> 24 & 255), v(i, i.level === 9 ? 2 : 2 <= i.strategy || i.level < 2 ? 4 : 0), v(i, 255 & i.gzhead.os), i.gzhead.extra && i.gzhead.extra.length && (v(i, 255 & i.gzhead.extra.length), v(i, i.gzhead.extra.length >> 8 & 255)), i.gzhead.hcrc && (e.adler = s(e.adler, i.pending_buf, i.pending, 0)), i.gzindex = 0, i.status = 69) : (v(i, 0), v(i, 0), v(i, 0), v(i, 0), v(i, 0), v(i, i.level === 9 ? 2 : 2 <= i.strategy || i.level < 2 ? 4 : 0), v(i, 3), i.status = f);
 										else {
 											var d = 8 + (i.w_bits - 8 << 4) << 8;
 											d |= (2 <= i.strategy || i.level < 2 ? 0 : i.level < 6 ? 1 : i.level === 6 ? 2 : 3) << 6, i.strstart !== 0 && (d |= 32), d += 31 - d % 31, i.status = f, y(i, d), i.strstart !== 0 && (y(i, e.adler >>> 16), y(i, 65535 & e.adler)), e.adler = 1;
@@ -24581,7 +24581,7 @@ while (r === s[++i] && r === s[++i] && r === s[++i] && r === s[++i] && r === s[+
 											if (b !== 3 && b !== 4 || (i.status = 666), b === 1 || b === 3) return e.avail_out === 0 && (i.last_flush = -1), 0;
 											if (b === 2 && (t === 1 ? a._tr_align(i) : t !== 5 && (a._tr_stored_block(i, 0, 0, !1), t === 3 && (h(i.head), i.lookahead === 0 && (i.strstart = 0, i.block_start = 0, i.insert = 0))), g(e), e.avail_out === 0)) return i.last_flush = -1, 0;
 										}
-										return t === 4 ? i.wrap <= 0 ? 1 : (i.wrap === 2 ? (v(i, 255 & e.adler), v(i, e.adler >> 8 & 255), v(i, e.adler >> 16 & 255), v(i, e.adler >> 24 & 255), v(i, 255 & e.total_in), v(i, e.total_in >> 8 & 255), v(i, e.total_in >> 16 & 255), v(i, e.total_in >> 24 & 255)) : (y(i, e.adler >>> 16), y(i, 65535 & e.adler)), g(e), 0 < i.wrap && (i.wrap = -i.wrap), i.pending === 0 ? 1 : 0) : 0;
+										return t === 4 ? i.wrap <= 0 ? 1 : (i.wrap === 2 ? (v(i, 255 & e.adler), v(i, e.adler >> 8 & 255), v(i, e.adler >> 16 & 255), v(i, e.adler >> 24 & 255), v(i, 255 & e.total_in), v(i, e.total_in >> 8 & 255), v(i, e.total_in >> 16 & 255), v(i, e.total_in >> 24 & 255)) : (y(i, e.adler >>> 16), y(i, 65535 & e.adler)), g(e), 0 < i.wrap && (i.wrap = -i.wrap), +(i.pending === 0)) : 0;
 									}, n.deflateEnd = function(e) {
 										var t;
 										return e && e.state ? (t = e.state.status) !== 42 && t !== 69 && t !== 73 && t !== 91 && t !== 103 && t !== f && t !== 666 ? p(e, l) : (e.state = null, t === f ? p(e, -3) : 0) : l;
@@ -25486,7 +25486,7 @@ while (r === s[++i] && r === s[++i] && r === s[++i] && r === s[++i] && r === s[+
 									i(x);
 									var I = !1;
 									function L(e, t, n, i) {
-										E(e, 0 + (i ? 1 : 0), 3), function(e, t, n, i) {
+										E(e, 0 + +!!i, 3), function(e, t, n, i) {
 											j(e), T(e, n), T(e, ~n), r.arraySet(e.pending_buf, e.window, t, n, e.pending), e.pending += n;
 										}(e, t, n);
 									}
@@ -25516,7 +25516,7 @@ while (r === s[++i] && r === s[++i] && r === s[++i] && r === s[++i] && r === s[+
 											var t;
 											for (F(e, e.dyn_ltree, e.l_desc.max_code), F(e, e.dyn_dtree, e.d_desc.max_code), P(e, e.bl_desc), t = 18; 3 <= t && e.bl_tree[2 * f[t] + 1] === 0; t--);
 											return e.opt_len += 3 * (t + 1) + 5 + 5 + 4, t;
-										}(e), i = e.opt_len + 3 + 7 >>> 3, (o = e.static_len + 3 + 7 >>> 3) <= i && (i = o)) : i = o = n + 5, n + 4 <= i && t !== -1 ? L(e, t, n, r) : e.strategy === 4 || o === i ? (E(e, 2 + (r ? 1 : 0), 3), ee(e, p, m)) : (E(e, 4 + (r ? 1 : 0), 3), function(e, t, n, r) {
+										}(e), i = e.opt_len + 3 + 7 >>> 3, (o = e.static_len + 3 + 7 >>> 3) <= i && (i = o)) : i = o = n + 5, n + 4 <= i && t !== -1 ? L(e, t, n, r) : e.strategy === 4 || o === i ? (E(e, 2 + +!!r, 3), ee(e, p, m)) : (E(e, 4 + +!!r, 3), function(e, t, n, r) {
 											var i;
 											for (E(e, t - 257, 5), E(e, n - 1, 5), E(e, r - 4, 4), i = 0; i < r; i++) E(e, e.bl_tree[2 * f[i] + 1], 3);
 											te(e, e.dyn_ltree, t - 1), te(e, e.dyn_dtree, n - 1);
@@ -26342,7 +26342,7 @@ while (r === s[++i] && r === s[++i] && r === s[++i] && r === s[++i] && r === s[+
 							this.__data__ = H ? H(null) : {}, this.size = 0;
 						}, se.prototype.delete = function(e) {
 							var t = this.has(e) && delete this.__data__[e];
-							return this.size -= t ? 1 : 0, t;
+							return this.size -= +!!t, t;
 						}, se.prototype.get = function(e) {
 							var t = this.__data__;
 							if (H) {
@@ -26355,7 +26355,7 @@ while (r === s[++i] && r === s[++i] && r === s[++i] && r === s[++i] && r === s[+
 							return H ? t[e] !== void 0 : k.call(t, e);
 						}, se.prototype.set = function(e, t) {
 							var n = this.__data__;
-							return this.size += this.has(e) ? 0 : 1, n[e] = H && t === void 0 ? "__lodash_hash_undefined__" : t, this;
+							return this.size += +!this.has(e), n[e] = H && t === void 0 ? "__lodash_hash_undefined__" : t, this;
 						}, J.prototype.clear = function() {
 							this.__data__ = [], this.size = 0;
 						}, J.prototype.delete = function(e) {
@@ -26377,7 +26377,7 @@ while (r === s[++i] && r === s[++i] && r === s[++i] && r === s[++i] && r === s[+
 							};
 						}, Y.prototype.delete = function(e) {
 							var t = he(this, e).delete(e);
-							return this.size -= t ? 1 : 0, t;
+							return this.size -= +!!t, t;
 						}, Y.prototype.get = function(e) {
 							return he(this, e).get(e);
 						}, Y.prototype.has = function(e) {
@@ -30495,7 +30495,7 @@ while (r === s[++i] && r === s[++i] && r === s[++i] && r === s[++i] && r === s[+
 					return (e >>> 19 | t << 13) ^ (t >>> 29 | e << 3) ^ (e >>> 6 | t << 26);
 				}
 				function _(e, t) {
-					return e >>> 0 < t >>> 0 ? 1 : 0;
+					return +(e >>> 0 < t >>> 0);
 				}
 				r(c, i), c.prototype.init = function() {
 					return this._ah = 1779033703, this._bh = 3144134277, this._ch = 1013904242, this._dh = 2773480762, this._eh = 1359893119, this._fh = 2600822924, this._gh = 528734635, this._hh = 1541459225, this._al = 4089235720, this._bl = 2227873595, this._cl = 4271175723, this._dl = 1595750129, this._el = 2917565137, this._fl = 725511199, this._gl = 4215389547, this._hl = 327033209, this;
@@ -31983,4 +31983,4 @@ while (r === s[++i] && r === s[++i] && r === s[++i] && r === s[++i] && r === s[+
 //#endregion
 export default n();
 
-//# sourceMappingURL=exceljs.min-CcjgM-qg.js.map
+//# sourceMappingURL=exceljs.min-DaJsLlWM.js.map