@opencloud-eu/web-client 8.0.0 → 8.1.0

package/dist/{ocs-CGD-4vGl.js → ocs-CDSkdguM.js}

@@ -1,5 +1,5 @@
 import { t as e } from "./urlJoin-_pUL1TUx.js";
-import { a as t, n, s as r, t as i } from "./toString-DfgrQ1mh.js";
+import { a as t, n, s as r, t as i } from "./toString-CVetDRwx.js";
 //#region ../../node_modules/.pnpm/lodash-es@4.18.1/node_modules/lodash-es/_isKey.js
 var a = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/, o = /^\w*$/;
 function s(e, n) {
@@ -294,7 +294,7 @@ ue.read = function(e, t, n, r, i) {
 			case "latin1":
 			case "binary": return n;
 			case "utf8":
-			case "utf-8": return Se(e).length;
+			case "utf-8": return xe(e).length;
 			case "ucs2":
 			case "ucs-2":
 			case "utf16le":
@@ -302,7 +302,7 @@ ue.read = function(e, t, n, r, i) {
 			case "hex": return n >>> 1;
 			case "base64": return we(e).length;
 			default:
-				if (i) return r ? -1 : Se(e).length;
+				if (i) return r ? -1 : xe(e).length;
 				t = ("" + t).toLowerCase(), i = !0;
 		}
 	}
@@ -321,7 +321,7 @@ ue.read = function(e, t, n, r, i) {
 			case "ucs2":
 			case "ucs-2":
 			case "utf16le":
-			case "utf-16le": return me(this, t, n);
+			case "utf-16le": return D(this, t, n);
 			default:
 				if (r) throw TypeError("Unknown encoding: " + e);
 				e = (e + "").toLowerCase(), r = !0;
@@ -430,10 +430,10 @@ ue.read = function(e, t, n, r, i) {
 		return o;
 	}
 	function re(e, t, n, r) {
-		return Te(Se(t, e.length - n), e, n, r);
+		return Te(xe(t, e.length - n), e, n, r);
 	}
 	function ie(e, t, n, r) {
-		return Te(I(t), e, n, r);
+		return Te(Se(t), e, n, r);
 	}
 	function ae(e, t, n, r) {
 		return Te(we(t), e, n, r);
@@ -526,7 +526,7 @@ ue.read = function(e, t, n, r, i) {
 		for (let r = t; r < n; ++r) i += De[e[r]];
 		return i;
 	}
-	function me(e, t, n) {
+	function D(e, t, n) {
 		let r = e.slice(t, n), i = "";
 		for (let e = 0; e < r.length - 1; e += 2) i += String.fromCharCode(r[e] + r[e + 1] * 256);
 		return i;
@@ -537,88 +537,88 @@ ue.read = function(e, t, n, r, i) {
 		let r = this.subarray(e, t);
 		return Object.setPrototypeOf(r, u.prototype), r;
 	};
-	function D(e, t, n) {
+	function O(e, t, n) {
 		if (e % 1 != 0 || e < 0) throw RangeError("offset is not uint");
 		if (e + t > n) throw RangeError("Trying to access beyond buffer length");
 	}
 	u.prototype.readUintLE = u.prototype.readUIntLE = function(e, t, n) {
-		e >>>= 0, t >>>= 0, n || D(e, t, this.length);
+		e >>>= 0, t >>>= 0, n || O(e, t, this.length);
 		let r = this[e], i = 1, a = 0;
 		for (; ++a < t && (i *= 256);) r += this[e + a] * i;
 		return r;
 	}, u.prototype.readUintBE = u.prototype.readUIntBE = function(e, t, n) {
-		e >>>= 0, t >>>= 0, n || D(e, t, this.length);
+		e >>>= 0, t >>>= 0, n || O(e, t, this.length);
 		let r = this[e + --t], i = 1;
 		for (; t > 0 && (i *= 256);) r += this[e + --t] * i;
 		return r;
 	}, u.prototype.readUint8 = u.prototype.readUInt8 = function(e, t) {
-		return e >>>= 0, t || D(e, 1, this.length), this[e];
+		return e >>>= 0, t || O(e, 1, this.length), this[e];
 	}, u.prototype.readUint16LE = u.prototype.readUInt16LE = function(e, t) {
-		return e >>>= 0, t || D(e, 2, this.length), this[e] | this[e + 1] << 8;
+		return e >>>= 0, t || O(e, 2, this.length), this[e] | this[e + 1] << 8;
 	}, u.prototype.readUint16BE = u.prototype.readUInt16BE = function(e, t) {
-		return e >>>= 0, t || D(e, 2, this.length), this[e] << 8 | this[e + 1];
+		return e >>>= 0, t || O(e, 2, this.length), this[e] << 8 | this[e + 1];
 	}, u.prototype.readUint32LE = u.prototype.readUInt32LE = function(e, t) {
-		return e >>>= 0, t || D(e, 4, this.length), (this[e] | this[e + 1] << 8 | this[e + 2] << 16) + this[e + 3] * 16777216;
+		return e >>>= 0, t || O(e, 4, this.length), (this[e] | this[e + 1] << 8 | this[e + 2] << 16) + this[e + 3] * 16777216;
 	}, u.prototype.readUint32BE = u.prototype.readUInt32BE = function(e, t) {
-		return e >>>= 0, t || D(e, 4, this.length), this[e] * 16777216 + (this[e + 1] << 16 | this[e + 2] << 8 | this[e + 3]);
+		return e >>>= 0, t || O(e, 4, this.length), this[e] * 16777216 + (this[e + 1] << 16 | this[e + 2] << 8 | this[e + 3]);
 	}, u.prototype.readBigUInt64LE = R(function(e) {
-		e >>>= 0, P(e, "offset");
+		e >>>= 0, F(e, "offset");
 		let t = this[e], n = this[e + 7];
-		(t === void 0 || n === void 0) && F(e, this.length - 8);
+		(t === void 0 || n === void 0) && I(e, this.length - 8);
 		let r = t + this[++e] * 256 + this[++e] * 2 ** 16 + this[++e] * 2 ** 24, i = this[++e] + this[++e] * 256 + this[++e] * 2 ** 16 + n * 2 ** 24;
 		return BigInt(r) + (BigInt(i) << BigInt(32));
 	}), u.prototype.readBigUInt64BE = R(function(e) {
-		e >>>= 0, P(e, "offset");
+		e >>>= 0, F(e, "offset");
 		let t = this[e], n = this[e + 7];
-		(t === void 0 || n === void 0) && F(e, this.length - 8);
+		(t === void 0 || n === void 0) && I(e, this.length - 8);
 		let r = t * 2 ** 24 + this[++e] * 2 ** 16 + this[++e] * 256 + this[++e], i = this[++e] * 2 ** 24 + this[++e] * 2 ** 16 + this[++e] * 256 + n;
 		return (BigInt(r) << BigInt(32)) + BigInt(i);
 	}), u.prototype.readIntLE = function(e, t, n) {
-		e >>>= 0, t >>>= 0, n || D(e, t, this.length);
+		e >>>= 0, t >>>= 0, n || O(e, t, this.length);
 		let r = this[e], i = 1, a = 0;
 		for (; ++a < t && (i *= 256);) r += this[e + a] * i;
 		return i *= 128, r >= i && (r -= 2 ** (8 * t)), r;
 	}, u.prototype.readIntBE = function(e, t, n) {
-		e >>>= 0, t >>>= 0, n || D(e, t, this.length);
+		e >>>= 0, t >>>= 0, n || O(e, t, this.length);
 		let r = t, i = 1, a = this[e + --r];
 		for (; r > 0 && (i *= 256);) a += this[e + --r] * i;
 		return i *= 128, a >= i && (a -= 2 ** (8 * t)), a;
 	}, u.prototype.readInt8 = function(e, t) {
-		return e >>>= 0, t || D(e, 1, this.length), this[e] & 128 ? (255 - this[e] + 1) * -1 : this[e];
+		return e >>>= 0, t || O(e, 1, this.length), this[e] & 128 ? (255 - this[e] + 1) * -1 : this[e];
 	}, u.prototype.readInt16LE = function(e, t) {
-		e >>>= 0, t || D(e, 2, this.length);
+		e >>>= 0, t || O(e, 2, this.length);
 		let n = this[e] | this[e + 1] << 8;
 		return n & 32768 ? n | 4294901760 : n;
 	}, u.prototype.readInt16BE = function(e, t) {
-		e >>>= 0, t || D(e, 2, this.length);
+		e >>>= 0, t || O(e, 2, this.length);
 		let n = this[e + 1] | this[e] << 8;
 		return n & 32768 ? n | 4294901760 : n;
 	}, u.prototype.readInt32LE = function(e, t) {
-		return e >>>= 0, t || D(e, 4, this.length), this[e] | this[e + 1] << 8 | this[e + 2] << 16 | this[e + 3] << 24;
+		return e >>>= 0, t || O(e, 4, this.length), this[e] | this[e + 1] << 8 | this[e + 2] << 16 | this[e + 3] << 24;
 	}, u.prototype.readInt32BE = function(e, t) {
-		return e >>>= 0, t || D(e, 4, this.length), this[e] << 24 | this[e + 1] << 16 | this[e + 2] << 8 | this[e + 3];
+		return e >>>= 0, t || O(e, 4, this.length), this[e] << 24 | this[e + 1] << 16 | this[e + 2] << 8 | this[e + 3];
 	}, u.prototype.readBigInt64LE = R(function(e) {
-		e >>>= 0, P(e, "offset");
+		e >>>= 0, F(e, "offset");
 		let t = this[e], n = this[e + 7];
-		(t === void 0 || n === void 0) && F(e, this.length - 8);
+		(t === void 0 || n === void 0) && I(e, this.length - 8);
 		let r = this[e + 4] + this[e + 5] * 256 + this[e + 6] * 2 ** 16 + (n << 24);
 		return (BigInt(r) << BigInt(32)) + BigInt(t + this[++e] * 256 + this[++e] * 2 ** 16 + this[++e] * 2 ** 24);
 	}), u.prototype.readBigInt64BE = R(function(e) {
-		e >>>= 0, P(e, "offset");
+		e >>>= 0, F(e, "offset");
 		let t = this[e], n = this[e + 7];
-		(t === void 0 || n === void 0) && F(e, this.length - 8);
+		(t === void 0 || n === void 0) && I(e, this.length - 8);
 		let r = (t << 24) + this[++e] * 2 ** 16 + this[++e] * 256 + this[++e];
 		return (BigInt(r) << BigInt(32)) + BigInt(this[++e] * 2 ** 24 + this[++e] * 2 ** 16 + this[++e] * 256 + n);
 	}), u.prototype.readFloatLE = function(e, t) {
-		return e >>>= 0, t || D(e, 4, this.length), n.read(this, e, !0, 23, 4);
+		return e >>>= 0, t || O(e, 4, this.length), n.read(this, e, !0, 23, 4);
 	}, u.prototype.readFloatBE = function(e, t) {
-		return e >>>= 0, t || D(e, 4, this.length), n.read(this, e, !1, 23, 4);
+		return e >>>= 0, t || O(e, 4, this.length), n.read(this, e, !1, 23, 4);
 	}, u.prototype.readDoubleLE = function(e, t) {
-		return e >>>= 0, t || D(e, 8, this.length), n.read(this, e, !0, 52, 8);
+		return e >>>= 0, t || O(e, 8, this.length), n.read(this, e, !0, 52, 8);
 	}, u.prototype.readDoubleBE = function(e, t) {
-		return e >>>= 0, t || D(e, 8, this.length), n.read(this, e, !1, 52, 8);
+		return e >>>= 0, t || O(e, 8, this.length), n.read(this, e, !1, 52, 8);
 	};
-	function O(e, t, n, r, i, a) {
+	function k(e, t, n, r, i, a) {
 		if (!u.isBuffer(e)) throw TypeError("\"buffer\" argument must be a Buffer instance");
 		if (t > i || t < a) throw RangeError("\"value\" argument is out of bounds");
 		if (n + r > e.length) throw RangeError("Index out of range");
@@ -626,7 +626,7 @@ ue.read = function(e, t, n, r, i) {
 	u.prototype.writeUintLE = u.prototype.writeUIntLE = function(e, t, n, r) {
 		if (e = +e, t >>>= 0, n >>>= 0, !r) {
 			let r = 2 ** (8 * n) - 1;
-			O(this, e, t, n, r, 0);
+			k(this, e, t, n, r, 0);
 		}
 		let i = 1, a = 0;
 		for (this[t] = e & 255; ++a < n && (i *= 256);) this[t + a] = e / i & 255;
@@ -634,44 +634,44 @@ ue.read = function(e, t, n, r, i) {
 	}, u.prototype.writeUintBE = u.prototype.writeUIntBE = function(e, t, n, r) {
 		if (e = +e, t >>>= 0, n >>>= 0, !r) {
 			let r = 2 ** (8 * n) - 1;
-			O(this, e, t, n, r, 0);
+			k(this, e, t, n, r, 0);
 		}
 		let i = n - 1, a = 1;
 		for (this[t + i] = e & 255; --i >= 0 && (a *= 256);) this[t + i] = e / a & 255;
 		return t + n;
 	}, u.prototype.writeUint8 = u.prototype.writeUInt8 = function(e, t, n) {
-		return e = +e, t >>>= 0, n || O(this, e, t, 1, 255, 0), this[t] = e & 255, t + 1;
+		return e = +e, t >>>= 0, n || k(this, e, t, 1, 255, 0), this[t] = e & 255, t + 1;
 	}, u.prototype.writeUint16LE = u.prototype.writeUInt16LE = function(e, t, n) {
-		return e = +e, t >>>= 0, n || O(this, e, t, 2, 65535, 0), this[t] = e & 255, this[t + 1] = e >>> 8, t + 2;
+		return e = +e, t >>>= 0, n || k(this, e, t, 2, 65535, 0), this[t] = e & 255, this[t + 1] = e >>> 8, t + 2;
 	}, u.prototype.writeUint16BE = u.prototype.writeUInt16BE = function(e, t, n) {
-		return e = +e, t >>>= 0, n || O(this, e, t, 2, 65535, 0), this[t] = e >>> 8, this[t + 1] = e & 255, t + 2;
+		return e = +e, t >>>= 0, n || k(this, e, t, 2, 65535, 0), this[t] = e >>> 8, this[t + 1] = e & 255, t + 2;
 	}, u.prototype.writeUint32LE = u.prototype.writeUInt32LE = function(e, t, n) {
-		return e = +e, t >>>= 0, n || O(this, e, t, 4, 4294967295, 0), this[t + 3] = e >>> 24, this[t + 2] = e >>> 16, this[t + 1] = e >>> 8, this[t] = e & 255, t + 4;
+		return e = +e, t >>>= 0, n || k(this, e, t, 4, 4294967295, 0), this[t + 3] = e >>> 24, this[t + 2] = e >>> 16, this[t + 1] = e >>> 8, this[t] = e & 255, t + 4;
 	}, u.prototype.writeUint32BE = u.prototype.writeUInt32BE = function(e, t, n) {
-		return e = +e, t >>>= 0, n || O(this, e, t, 4, 4294967295, 0), this[t] = e >>> 24, this[t + 1] = e >>> 16, this[t + 2] = e >>> 8, this[t + 3] = e & 255, t + 4;
+		return e = +e, t >>>= 0, n || k(this, e, t, 4, 4294967295, 0), this[t] = e >>> 24, this[t + 1] = e >>> 16, this[t + 2] = e >>> 8, this[t + 3] = e & 255, t + 4;
 	};
-	function he(e, t, n, r, i) {
-		ye(t, r, i, e, n, 7);
+	function me(e, t, n, r, i) {
+		ve(t, r, i, e, n, 7);
 		let a = Number(t & BigInt(4294967295));
 		e[n++] = a, a >>= 8, e[n++] = a, a >>= 8, e[n++] = a, a >>= 8, e[n++] = a;
 		let o = Number(t >> BigInt(32) & BigInt(4294967295));
 		return e[n++] = o, o >>= 8, e[n++] = o, o >>= 8, e[n++] = o, o >>= 8, e[n++] = o, n;
 	}
-	function k(e, t, n, r, i) {
-		ye(t, r, i, e, n, 7);
+	function A(e, t, n, r, i) {
+		ve(t, r, i, e, n, 7);
 		let a = Number(t & BigInt(4294967295));
 		e[n + 7] = a, a >>= 8, e[n + 6] = a, a >>= 8, e[n + 5] = a, a >>= 8, e[n + 4] = a;
 		let o = Number(t >> BigInt(32) & BigInt(4294967295));
 		return e[n + 3] = o, o >>= 8, e[n + 2] = o, o >>= 8, e[n + 1] = o, o >>= 8, e[n] = o, n + 8;
 	}
 	u.prototype.writeBigUInt64LE = R(function(e, t = 0) {
-		return he(this, e, t, BigInt(0), BigInt("0xffffffffffffffff"));
+		return me(this, e, t, BigInt(0), BigInt("0xffffffffffffffff"));
 	}), u.prototype.writeBigUInt64BE = R(function(e, t = 0) {
-		return k(this, e, t, BigInt(0), BigInt("0xffffffffffffffff"));
+		return A(this, e, t, BigInt(0), BigInt("0xffffffffffffffff"));
 	}), u.prototype.writeIntLE = function(e, t, n, r) {
 		if (e = +e, t >>>= 0, !r) {
 			let r = 2 ** (8 * n - 1);
-			O(this, e, t, n, r - 1, -r);
+			k(this, e, t, n, r - 1, -r);
 		}
 		let i = 0, a = 1, o = 0;
 		for (this[t] = e & 255; ++i < n && (a *= 256);) e < 0 && o === 0 && this[t + i - 1] !== 0 && (o = 1), this[t + i] = (e / a >> 0) - o & 255;
@@ -679,44 +679,44 @@ ue.read = function(e, t, n, r, i) {
 	}, u.prototype.writeIntBE = function(e, t, n, r) {
 		if (e = +e, t >>>= 0, !r) {
 			let r = 2 ** (8 * n - 1);
-			O(this, e, t, n, r - 1, -r);
+			k(this, e, t, n, r - 1, -r);
 		}
 		let i = n - 1, a = 1, o = 0;
 		for (this[t + i] = e & 255; --i >= 0 && (a *= 256);) e < 0 && o === 0 && this[t + i + 1] !== 0 && (o = 1), this[t + i] = (e / a >> 0) - o & 255;
 		return t + n;
 	}, u.prototype.writeInt8 = function(e, t, n) {
-		return e = +e, t >>>= 0, n || O(this, e, t, 1, 127, -128), e < 0 && (e = 255 + e + 1), this[t] = e & 255, t + 1;
+		return e = +e, t >>>= 0, n || k(this, e, t, 1, 127, -128), e < 0 && (e = 255 + e + 1), this[t] = e & 255, t + 1;
 	}, u.prototype.writeInt16LE = function(e, t, n) {
-		return e = +e, t >>>= 0, n || O(this, e, t, 2, 32767, -32768), this[t] = e & 255, this[t + 1] = e >>> 8, t + 2;
+		return e = +e, t >>>= 0, n || k(this, e, t, 2, 32767, -32768), this[t] = e & 255, this[t + 1] = e >>> 8, t + 2;
 	}, u.prototype.writeInt16BE = function(e, t, n) {
-		return e = +e, t >>>= 0, n || O(this, e, t, 2, 32767, -32768), this[t] = e >>> 8, this[t + 1] = e & 255, t + 2;
+		return e = +e, t >>>= 0, n || k(this, e, t, 2, 32767, -32768), this[t] = e >>> 8, this[t + 1] = e & 255, t + 2;
 	}, u.prototype.writeInt32LE = function(e, t, n) {
-		return e = +e, t >>>= 0, n || O(this, e, t, 4, 2147483647, -2147483648), this[t] = e & 255, this[t + 1] = e >>> 8, this[t + 2] = e >>> 16, this[t + 3] = e >>> 24, t + 4;
+		return e = +e, t >>>= 0, n || k(this, e, t, 4, 2147483647, -2147483648), this[t] = e & 255, this[t + 1] = e >>> 8, this[t + 2] = e >>> 16, this[t + 3] = e >>> 24, t + 4;
 	}, u.prototype.writeInt32BE = function(e, t, n) {
-		return e = +e, t >>>= 0, n || O(this, e, t, 4, 2147483647, -2147483648), e < 0 && (e = 4294967295 + e + 1), this[t] = e >>> 24, this[t + 1] = e >>> 16, this[t + 2] = e >>> 8, this[t + 3] = e & 255, t + 4;
+		return e = +e, t >>>= 0, n || k(this, e, t, 4, 2147483647, -2147483648), e < 0 && (e = 4294967295 + e + 1), this[t] = e >>> 24, this[t + 1] = e >>> 16, this[t + 2] = e >>> 8, this[t + 3] = e & 255, t + 4;
 	}, u.prototype.writeBigInt64LE = R(function(e, t = 0) {
-		return he(this, e, t, -BigInt("0x8000000000000000"), BigInt("0x7fffffffffffffff"));
+		return me(this, e, t, -BigInt("0x8000000000000000"), BigInt("0x7fffffffffffffff"));
 	}), u.prototype.writeBigInt64BE = R(function(e, t = 0) {
-		return k(this, e, t, -BigInt("0x8000000000000000"), BigInt("0x7fffffffffffffff"));
+		return A(this, e, t, -BigInt("0x8000000000000000"), BigInt("0x7fffffffffffffff"));
 	});
-	function ge(e, t, n, r, i, a) {
+	function he(e, t, n, r, i, a) {
 		if (n + r > e.length || n < 0) throw RangeError("Index out of range");
 	}
-	function A(e, t, r, i, a) {
-		return t = +t, r >>>= 0, a || ge(e, t, r, 4), n.write(e, t, r, i, 23, 4), r + 4;
+	function j(e, t, r, i, a) {
+		return t = +t, r >>>= 0, a || he(e, t, r, 4), n.write(e, t, r, i, 23, 4), r + 4;
 	}
 	u.prototype.writeFloatLE = function(e, t, n) {
-		return A(this, e, t, !0, n);
+		return j(this, e, t, !0, n);
 	}, u.prototype.writeFloatBE = function(e, t, n) {
-		return A(this, e, t, !1, n);
+		return j(this, e, t, !1, n);
 	};
-	function j(e, t, r, i, a) {
-		return t = +t, r >>>= 0, a || ge(e, t, r, 8), n.write(e, t, r, i, 52, 8), r + 8;
+	function M(e, t, r, i, a) {
+		return t = +t, r >>>= 0, a || he(e, t, r, 8), n.write(e, t, r, i, 52, 8), r + 8;
 	}
 	u.prototype.writeDoubleLE = function(e, t, n) {
-		return j(this, e, t, !0, n);
+		return M(this, e, t, !0, n);
 	}, u.prototype.writeDoubleBE = function(e, t, n) {
-		return j(this, e, t, !1, n);
+		return M(this, e, t, !1, n);
 	}, u.prototype.copy = function(e, t, n, r) {
 		if (!u.isBuffer(e)) throw TypeError("argument should be a Buffer");
 		if (n ||= 0, !r && r !== 0 && (r = this.length), t >= e.length && (t = e.length), t ||= 0, r > 0 && r < n && (r = n), r === n || e.length === 0 || this.length === 0) return 0;
@@ -747,9 +747,9 @@ ue.read = function(e, t, n, r, i) {
 		}
 		return this;
 	};
-	let M = {};
-	function N(e, t, n) {
-		M[e] = class extends n {
+	let N = {};
+	function P(e, t, n) {
+		N[e] = class extends n {
 			constructor() {
 				super(), Object.defineProperty(this, "message", {
 					value: t.apply(this, arguments),
@@ -773,42 +773,42 @@ ue.read = function(e, t, n, r, i) {
 			}
 		};
 	}
-	N("ERR_BUFFER_OUT_OF_BOUNDS", function(e) {
+	P("ERR_BUFFER_OUT_OF_BOUNDS", function(e) {
 		return e ? `${e} is outside of buffer bounds` : "Attempt to access memory outside buffer bounds";
-	}, RangeError), N("ERR_INVALID_ARG_TYPE", function(e, t) {
+	}, RangeError), P("ERR_INVALID_ARG_TYPE", function(e, t) {
 		return `The "${e}" argument must be of type number. Received type ${typeof t}`;
-	}, TypeError), N("ERR_OUT_OF_RANGE", function(e, t, n) {
+	}, TypeError), P("ERR_OUT_OF_RANGE", function(e, t, n) {
 		let r = `The value of "${e}" is out of range.`, i = n;
-		return Number.isInteger(n) && Math.abs(n) > 2 ** 32 ? i = _e(String(n)) : typeof n == "bigint" && (i = String(n), (n > BigInt(2) ** BigInt(32) || n < -(BigInt(2) ** BigInt(32))) && (i = _e(i)), i += "n"), r += ` It must be ${t}. Received ${i}`, r;
+		return Number.isInteger(n) && Math.abs(n) > 2 ** 32 ? i = ge(String(n)) : typeof n == "bigint" && (i = String(n), (n > BigInt(2) ** BigInt(32) || n < -(BigInt(2) ** BigInt(32))) && (i = ge(i)), i += "n"), r += ` It must be ${t}. Received ${i}`, r;
 	}, RangeError);
-	function _e(e) {
+	function ge(e) {
 		let t = "", n = e.length, r = +(e[0] === "-");
 		for (; n >= r + 4; n -= 3) t = `_${e.slice(n - 3, n)}${t}`;
 		return `${e.slice(0, n)}${t}`;
 	}
-	function ve(e, t, n) {
-		P(t, "offset"), (e[t] === void 0 || e[t + n] === void 0) && F(t, e.length - (n + 1));
+	function _e(e, t, n) {
+		F(t, "offset"), (e[t] === void 0 || e[t + n] === void 0) && I(t, e.length - (n + 1));
 	}
-	function ye(e, t, n, r, i, a) {
+	function ve(e, t, n, r, i, a) {
 		if (e > n || e < t) {
 			let r = typeof t == "bigint" ? "n" : "", i;
-			throw i = a > 3 ? t === 0 || t === BigInt(0) ? `>= 0${r} and < 2${r} ** ${(a + 1) * 8}${r}` : `>= -(2${r} ** ${(a + 1) * 8 - 1}${r}) and < 2 ** ${(a + 1) * 8 - 1}${r}` : `>= ${t}${r} and <= ${n}${r}`, new M.ERR_OUT_OF_RANGE("value", i, e);
+			throw i = a > 3 ? t === 0 || t === BigInt(0) ? `>= 0${r} and < 2${r} ** ${(a + 1) * 8}${r}` : `>= -(2${r} ** ${(a + 1) * 8 - 1}${r}) and < 2 ** ${(a + 1) * 8 - 1}${r}` : `>= ${t}${r} and <= ${n}${r}`, new N.ERR_OUT_OF_RANGE("value", i, e);
 		}
-		ve(r, i, a);
+		_e(r, i, a);
 	}
-	function P(e, t) {
-		if (typeof e != "number") throw new M.ERR_INVALID_ARG_TYPE(t, "number", e);
+	function F(e, t) {
+		if (typeof e != "number") throw new N.ERR_INVALID_ARG_TYPE(t, "number", e);
 	}
-	function F(e, t, n) {
-		throw Math.floor(e) === e ? t < 0 ? new M.ERR_BUFFER_OUT_OF_BOUNDS() : new M.ERR_OUT_OF_RANGE(n || "offset", `>= ${+!!n} and <= ${t}`, e) : (P(e, n), new M.ERR_OUT_OF_RANGE(n || "offset", "an integer", e));
+	function I(e, t, n) {
+		throw Math.floor(e) === e ? t < 0 ? new N.ERR_BUFFER_OUT_OF_BOUNDS() : new N.ERR_OUT_OF_RANGE(n || "offset", `>= ${+!!n} and <= ${t}`, e) : (F(e, n), new N.ERR_OUT_OF_RANGE(n || "offset", "an integer", e));
 	}
-	let be = /[^+/0-9A-Za-z-_]/g;
-	function xe(e) {
-		if (e = e.split("=")[0], e = e.trim().replace(be, ""), e.length < 2) return "";
+	let ye = /[^+/0-9A-Za-z-_]/g;
+	function be(e) {
+		if (e = e.split("=")[0], e = e.trim().replace(ye, ""), e.length < 2) return "";
 		for (; e.length % 4 != 0;) e += "=";
 		return e;
 	}
-	function Se(e, t) {
+	function xe(e, t) {
 		t ||= Infinity;
 		let n, r = e.length, i = null, a = [];
 		for (let o = 0; o < r; ++o) {
@@ -847,7 +847,7 @@ ue.read = function(e, t, n, r, i) {
 		}
 		return a;
 	}
-	function I(e) {
+	function Se(e) {
 		let t = [];
 		for (let n = 0; n < e.length; ++n) t.push(e.charCodeAt(n) & 255);
 		return t;
@@ -858,7 +858,7 @@ ue.read = function(e, t, n, r, i) {
 		return a;
 	}
 	function we(e) {
-		return t.toByteArray(xe(e));
+		return t.toByteArray(be(e));
 	}
 	function Te(e, t, n, r) {
 		let i = 0;
@@ -899,61 +899,61 @@ function E(e, t = "") {
 	if (!Number.isSafeInteger(e) || e < 0) throw RangeError(pe(t) + "expected integer >= 0, got " + e);
 	return e;
 }
-function me(e, t, n = "") {
+function D(e, t, n = "") {
 	if (fe(e) && (t === void 0 || e.length === t)) return e;
 	t !== void 0 && E(t, "length");
 	let r = fe(e), i = t === void 0 ? "" : ` of length ${t}`, a = r ? `length=${e.length}` : `type=${typeof e}`, o = pe(n) + "expected Uint8Array" + i + ", got " + a;
 	throw r ? RangeError(o) : TypeError(o);
 }
-function D(e) {
+function O(e) {
 	if (typeof e != "function" || typeof e.create != "function") throw TypeError("expected hash wrapped by utils.createHasher");
 	if (E(e.outputLen), E(e.blockLen), e.outputLen < 1 || e.blockLen < 1) throw Error("hash blockLen / outputLen must be >= 1");
 }
-var O = (e, t) => {
+var k = (e, t) => {
 	if (typeof e != "object" || !e || Array.isArray(e)) throw TypeError((t === "object" ? "" : `"${t}" `) + "expected object, got type=" + typeof e);
-}, he = (e, t) => {
-	O(e, t);
+}, me = (e, t) => {
+	k(e, t);
 	let n = Object.getPrototypeOf(e);
 	if (n !== Object.prototype && n !== null) throw TypeError(`"${t}" expected plain object`);
 	if (Object.hasOwn(e, "__proto__")) throw TypeError(`"${t}.__proto__" is not allowed`);
 };
-function k(e, t = !0) {
+function A(e, t = !0) {
 	if (e.destroyed) throw Error("hash was destroyed");
 	if (t && e.finished) throw Error("digest() was already called");
 }
-function ge(e, t) {
-	me(e, void 0, "output");
+function he(e, t) {
+	D(e, void 0, "output");
 	let n = t.outputLen;
 	if (!(e.length >= n)) throw RangeError("\"output\" expected length >= " + n);
 }
-function A(...e) {
+function j(...e) {
 	for (let t = 0; t < e.length; t++) e[t].fill(0);
 }
-function j(e) {
+function M(e) {
 	return new DataView(e.buffer, e.byteOffset, e.byteLength);
 }
-function M(e) {
+function N(e) {
 	if (typeof e != "string") throw TypeError("string expected");
 	let t = new TextEncoder().encode(e);
 	try {
 		return new Uint8Array(t);
 	} finally {
-		A(t);
+		j(t);
 	}
 }
-function N(e, t = "") {
-	return typeof e == "string" ? M(e) : me(e, void 0, t);
+function P(e, t = "") {
+	return typeof e == "string" ? N(e) : D(e, void 0, t);
 }
-function _e(e, t, n = "opts") {
-	return he(e, "defaults"), t !== void 0 && he(t, n), Object.assign(Object.create(null), e, t);
+function ge(e, t, n = "opts") {
+	return me(e, "defaults"), t !== void 0 && me(t, n), Object.assign(Object.create(null), e, t);
 }
-function ve(e, t = {}) {
+function _e(e, t = {}) {
 	if (typeof e != "function") throw TypeError("\"hashCons\" expected function, got type=" + typeof e);
-	t = _e({}, t, "info");
+	t = ge({}, t, "info");
 	let n = (t, n) => e(n).update(t).digest(), r = e(void 0);
 	return n.outputLen = r.outputLen, n.blockLen = r.blockLen, n.canXOF = r.canXOF, n.create = (t) => e(t), Object.assign(n, t), Object.freeze(n);
 }
-var ye = (e) => ({ oid: Uint8Array.from([
+var ve = (e) => ({ oid: Uint8Array.from([
 	6,
 	9,
 	96,
@@ -965,7 +965,7 @@ var ye = (e) => ({ oid: Uint8Array.from([
 	4,
 	2,
 	e
-]) }), P = class {
+]) }), F = class {
 	oHash;
 	iHash;
 	blockLen;
@@ -974,20 +974,20 @@ var ye = (e) => ({ oid: Uint8Array.from([
 	finished = !1;
 	destroyed = !1;
 	constructor(e, t) {
-		if (D(e), me(t, void 0, "key"), this.iHash = e.create(), typeof this.iHash.update != "function") throw Error("expected Hash instance");
+		if (O(e), D(t, void 0, "key"), this.iHash = e.create(), typeof this.iHash.update != "function") throw Error("expected Hash instance");
 		this.blockLen = this.iHash.blockLen, this.outputLen = this.iHash.outputLen;
 		let n = this.blockLen, r = new Uint8Array(n);
 		r.set(t.length > n ? e.create().update(t).digest() : t);
 		for (let e = 0; e < r.length; e++) r[e] ^= 54;
 		this.iHash.update(r), this.oHash = e.create();
 		for (let e = 0; e < r.length; e++) r[e] ^= 106;
-		this.oHash.update(r), A(r);
+		this.oHash.update(r), j(r);
 	}
 	update(e) {
-		return k(this), this.iHash.update(e), this;
+		return A(this), this.iHash.update(e), this;
 	}
 	digestInto(e) {
-		k(this), ge(e, this), this.finished = !0;
+		A(this), he(e, this), this.finished = !0;
 		let t = e.subarray(0, this.outputLen);
 		this.iHash.digestInto(t), this.oHash.update(t), this.oHash.digestInto(t), this.destroy();
 	}
@@ -1006,43 +1006,43 @@ var ye = (e) => ({ oid: Uint8Array.from([
 	destroy() {
 		this.destroyed = !0, this.oHash.destroy(), this.iHash.destroy();
 	}
-}, F = /* @__PURE__ */ (() => {
-	let e = ((e, t, n) => new P(e, t).update(n).digest());
-	return e.create = (e, t) => new P(e, t), e;
+}, I = /* @__PURE__ */ (() => {
+	let e = ((e, t, n) => new F(e, t).update(n).digest());
+	return e.create = (e, t) => new F(e, t), e;
 })();
 //#endregion
 //#region ../../node_modules/.pnpm/@noble+hashes@2.4.0/node_modules/@noble/hashes/pbkdf2.js
-function be(e, t, n, r) {
-	D(e);
-	let { c: i, dkLen: a, asyncTick: o } = _e({
+function ye(e, t, n, r) {
+	O(e);
+	let { c: i, dkLen: a, asyncTick: o } = ge({
 		dkLen: 32,
 		asyncTick: 10
 	}, r);
 	if (E(i, "c"), E(a, "dkLen"), E(o, "asyncTick"), i < 1) throw Error("\"c\" (iterations) must be >= 1");
 	if (a < 1) throw Error("\"dkLen\" must be >= 1");
 	if (a > (2 ** 32 - 1) * e.outputLen) throw Error("derived key too long");
-	let s = N(t, "password");
+	let s = P(t, "password");
 	try {
-		let t = N(n, "salt");
+		let t = P(n, "salt");
 		try {
-			let n = new Uint8Array(a), { iHash: r, oHash: c, outputLen: l } = F.create(e, s);
+			let n = new Uint8Array(a), { iHash: r, oHash: c, outputLen: l } = I.create(e, s);
 			return {
 				c: i,
 				dkLen: a,
 				asyncTick: o,
 				DK: n,
 				outputLen: l,
-				eng: xe(r, c, t, new Uint8Array(l))
+				eng: be(r, c, t, new Uint8Array(l))
 			};
 		} finally {
-			typeof n == "string" && A(t);
+			typeof n == "string" && j(t);
 		}
 	} finally {
-		typeof t == "string" && A(s);
+		typeof t == "string" && j(s);
 	}
 }
-function xe(e, t, n, r) {
-	let i = /* @__PURE__ */ new Uint8Array(4), a = j(i), o = e._cloneInto().update(n), s = t._cloneInto(), c = e._cloneInto, l = t._cloneInto;
+function be(e, t, n, r) {
+	let i = /* @__PURE__ */ new Uint8Array(4), a = M(i), o = e._cloneInto().update(n), s = t._cloneInto(), c = e._cloneInto, l = t._cloneInto;
 	return {
 		u1: (e, n) => {
 			a.setInt32(0, e, !1), o._cloneInto(s).update(i).digestInto(r), t._cloneInto(s).update(r).digestInto(r), n.set(r.subarray(0, n.length));
@@ -1053,11 +1053,11 @@ function xe(e, t, n, r) {
 				for (let e = 0; e < i.length; e++) i[e] ^= r[e];
 			}
 		},
-		output: (n) => (e.destroy(), t.destroy(), o.destroy(), s.destroy(), A(r), n)
+		output: (n) => (e.destroy(), t.destroy(), o.destroy(), s.destroy(), j(r), n)
 	};
 }
-function Se(e, t, n, r) {
-	let { c: i, dkLen: a, DK: o, outputLen: s, eng: c } = be(e, t, n, r);
+function xe(e, t, n, r) {
+	let { c: i, dkLen: a, DK: o, outputLen: s, eng: c } = ye(e, t, n, r);
 	for (let e = 1, t = 0; t < a; e++, t += s) {
 		let n = o.subarray(t, t + s);
 		c.u1(e, n), c.rounds(i, n);
@@ -1066,14 +1066,14 @@ function Se(e, t, n, r) {
 }
 //#endregion
 //#region ../../node_modules/.pnpm/@noble+hashes@2.4.0/node_modules/@noble/hashes/_u64.js
-var I = /* @__PURE__ */ BigInt(2 ** 32 - 1), Ce = /* @__PURE__ */ BigInt(32);
+var Se = /* @__PURE__ */ BigInt(2 ** 32 - 1), Ce = /* @__PURE__ */ BigInt(32);
 function we(e, t = !1) {
 	return t ? {
-		h: Number(e & I),
-		l: Number(e >> Ce & I)
+		h: Number(e & Se),
+		l: Number(e >> Ce & Se)
 	} : {
-		h: Number(e >> Ce & I) | 0,
-		l: Number(e & I) | 0
+		h: Number(e >> Ce & Se) | 0,
+		l: Number(e & Se) | 0
 	};
 }
 function Te(e, t = !1) {
@@ -1110,15 +1110,15 @@ var je = (e, t, n) => (e >>> 0) + (t >>> 0) + (n >>> 0), Me = (e, t, n, r) => t
 	pos = 0;
 	destroyed = !1;
 	constructor(e, t, n, r) {
-		this.blockLen = e, this.outputLen = t, this.padOffset = n, this.isLE = r, this.buffer = new Uint8Array(e), this.view = j(this.buffer);
+		this.blockLen = e, this.outputLen = t, this.padOffset = n, this.isLE = r, this.buffer = new Uint8Array(e), this.view = M(this.buffer);
 	}
 	update(e) {
-		k(this), me(e);
+		A(this), D(e);
 		let { view: t, buffer: n, blockLen: r } = this, i = e.length, a = !1;
 		for (let o = 0; o < i;) {
 			let s = Math.min(r - this.pos, i - o);
 			if (s === r) {
-				let t = j(e);
+				let t = M(e);
 				for (; r <= i - o; o += r) this.process(t, o);
 				a = !0;
 				continue;
@@ -1128,10 +1128,10 @@ var je = (e, t, n) => (e >>> 0) + (t >>> 0) + (n >>> 0), Me = (e, t, n, r) => t
 		return this.length += e.length, a && this.roundClean(), this;
 	}
 	digestInto(e) {
-		k(this), ge(e, this), this.finished = !0;
+		A(this), he(e, this), this.finished = !0;
 		let { buffer: t, view: n, blockLen: r, isLE: i } = this, { pos: a } = this;
 		t[a++] = 128, t.fill(0, a), this.padOffset > r - a && (this.process(n, 0), t.fill(0)), De(n, r - 8, this.length * 8, i), this.process(n, 0), this.roundClean();
-		let o = e === t ? n : j(e), s = this.outputLen, c = s / 4, l = this.get();
+		let o = e === t ? n : M(e), s = this.outputLen, c = s / 4, l = this.get();
 		if (s % 4 || c > l.length) throw Error("invalid outputLen");
 		for (let e = 0; e < c; e++) o.setUint32(4 * e, l[e], i);
 	}
@@ -1228,16 +1228,16 @@ var je = (e, t, n) => (e >>> 0) + (t >>> 0) + (n >>> 0), Me = (e, t, n, r) => t
 		({h: n, l: r} = V(this.Ah | 0, this.Al | 0, n | 0, r | 0)), {h: i, l: a} = V(this.Bh | 0, this.Bl | 0, i | 0, a | 0), {h: o, l: s} = V(this.Ch | 0, this.Cl | 0, o | 0, s | 0), {h: c, l: l} = V(this.Dh | 0, this.Dl | 0, c | 0, l | 0), {h: u, l: d} = V(this.Eh | 0, this.El | 0, u | 0, d | 0), {h: f, l: p} = V(this.Fh | 0, this.Fl | 0, f | 0, p | 0), {h: m, l: h} = V(this.Gh | 0, this.Gl | 0, m | 0, h | 0), {h: g, l: _} = V(this.Hh | 0, this.Hl | 0, g | 0, _ | 0), this.set(n, r, i, a, o, s, c, l, u, d, f, p, m, h, g, _);
 	}
 	roundClean() {
-		A(H, U);
+		j(H, U);
 	}
 	destroy() {
-		this.destroyed = !0, A(this.buffer), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
+		this.destroyed = !0, j(this.buffer), this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
 	}
 }, Ue = class extends He {
 	constructor() {
 		super(64, Re);
 	}
-}, We = /* @__PURE__ */ ve(() => new Ue(), /* @__PURE__ */ ye(3)), Ge = (e, t, n, r) => de.from(Se(We, e, t, {
+}, We = /* @__PURE__ */ _e(() => new Ue(), /* @__PURE__ */ ve(3)), Ge = (e, t, n, r) => de.from(xe(We, e, t, {
 	c: n,
 	dkLen: r
 })), Ke = ":A-Za-z_\\u00C0-\\u00D6\\u00D8-\\u00F6\\u00F8-\\u02FF\\u0370-\\u037D\\u037F-\\u1FFF\\u200C-\\u200D\\u2070-\\u218F\\u2C00-\\u2FEF\\u3001-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFFD", qe = Ke + "\\-.\\d\\u00B7\\u0300-\\u036F\\u203F-\\u2040";
@@ -1484,7 +1484,7 @@ function pt(e) {
 	return e.startIndex + e[1].length;
 }
 //#endregion
-//#region ../../node_modules/.pnpm/@nodable+entities@3.0.0/node_modules/@nodable/entities/src/entities.js
+//#region ../../node_modules/.pnpm/@nodable+entities@3.1.0/node_modules/@nodable/entities/src/entities.js
 var mt = {
 	cent: "¢",
 	pound: "£",
@@ -2251,7 +2251,7 @@ function mn(e, t, n) {
 	}
 }
 //#endregion
-//#region ../../node_modules/.pnpm/fast-xml-parser@5.11.1/node_modules/fast-xml-parser/src/ignoreAttributes.js
+//#region ../../node_modules/.pnpm/fast-xml-parser@5.11.2/node_modules/fast-xml-parser/src/ignoreAttributes.js
 function hn(e) {
 	return typeof e == "function" ? e : Array.isArray(e) ? (t) => {
 		for (let n of e) if (typeof n == "string" && t === n || n instanceof RegExp && n.test(t)) return !0;
@@ -3221,7 +3221,7 @@ function Pn(e, t) {
 	return !1;
 }
 //#endregion
-//#region ../../node_modules/.pnpm/fast-xml-parser@5.11.1/node_modules/fast-xml-parser/src/xmlparser/OrderedObjParser.js
+//#region ../../node_modules/.pnpm/fast-xml-parser@5.11.2/node_modules/fast-xml-parser/src/xmlparser/OrderedObjParser.js
 function Fn(e, t) {
 	if (!e) return {};
 	let n = t.attributesGroupName ? e[t.attributesGroupName] : e;
@@ -3528,7 +3528,7 @@ function $n(e, t) {
 	return Qe.includes(e) ? t.onDangerousProperty(e) : e;
 }
 //#endregion
-//#region ../../node_modules/.pnpm/fast-xml-parser@5.11.1/node_modules/fast-xml-parser/src/xmlparser/node2json.js
+//#region ../../node_modules/.pnpm/fast-xml-parser@5.11.2/node_modules/fast-xml-parser/src/xmlparser/node2json.js
 var er = Y.getMetaDataSymbol();
 function tr(e, t) {
 	if (!e || typeof e != "object") return {};
@@ -3586,13 +3586,13 @@ function or(e, t) {
 	return !!(r === 0 || r === 1 && (e[n] || typeof e[n] == "boolean" || e[n] === 0));
 }
 //#endregion
-//#region ../../node_modules/.pnpm/fast-xml-parser@5.11.1/node_modules/fast-xml-parser/src/xmlparser/XMLParser.js
+//#region ../../node_modules/.pnpm/fast-xml-parser@5.11.2/node_modules/fast-xml-parser/src/xmlparser/XMLParser.js
 var sr = class {
 	constructor(e) {
 		this.externalEntities = {}, this.options = jt(e);
 	}
 	parse(e, t) {
-		if (typeof e != "string" && e.toString) e = e.toString();
+		if (typeof e != "string" && e.toString) e = e instanceof Uint8Array && !(de !== void 0 && de.isBuffer(e)) ? new TextDecoder("utf-8", { ignoreBOM: !0 }).decode(e) : e.toString();
 		else if (typeof e != "string") throw Error("XML data is accepted in String or Bytes[] form.");
 		if (t) {
 			t === !0 && (t = {});