@burdenoff/microfe-devportal 2026.1108.1 → 2026.1109.1

package/dist/node_modules/fast-equals/dist/es/index.js

@@ -1,4 +1,4 @@
-//#region node_modules/fast-equals/dist/es/index.mjs
+// node_modules/fast-equals/dist/es/index.mjs
 var { getOwnPropertyNames: e, getOwnPropertySymbols: t } = Object, { hasOwnProperty: n } = Object.prototype;
 function r(e, t) {
 	return function(n, r, i) {
@@ -25,29 +25,45 @@ var s = Object.hasOwn || ((e, t) => n.call(e, t));
 function c(e, t) {
 	return e === t || !e && !t && e !== e && t !== t;
 }
-var l = "__v", u = "__o", d = "_owner", { getOwnPropertyDescriptor: f, keys: p } = Object;
-function m(e, t) {
-	return e.byteLength === t.byteLength && D(new Uint8Array(e), new Uint8Array(t));
+var l = "__v", u = "__o", d = "_owner", f = 64, { getOwnPropertyDescriptor: p, keys: m } = Object, { propertyIsEnumerable: h } = Object.prototype, g = p(Object.getPrototypeOf(Int8Array.prototype), Symbol.toStringTag).get;
+function _(e, t) {
+	return e.byteLength === t.byteLength && A(new Uint8Array(e), new Uint8Array(t));
 }
-function h(e, t, n) {
+function v(e, t, n) {
 	let r = e.length;
 	if (t.length !== r) return !1;
 	for (; r-- > 0;) if (!n.equals(e[r], t[r], r, r, e, t, n)) return !1;
 	return !0;
 }
-function g(e, t) {
-	return e.byteLength === t.byteLength && D(new Uint8Array(e.buffer, e.byteOffset, e.byteLength), new Uint8Array(t.buffer, t.byteOffset, t.byteLength));
+function y(e, t) {
+	return e.byteLength === t.byteLength && A(new Uint8Array(e.buffer, e.byteOffset, e.byteLength), new Uint8Array(t.buffer, t.byteOffset, t.byteLength));
 }
-function _(e, t) {
+function b(e, t) {
 	return c(e.getTime(), t.getTime());
 }
-function v(e, t) {
-	return e.name === t.name && e.message === t.message && e.cause === t.cause && e.stack === t.stack;
+function x(e, t, n) {
+	if (e.name !== t.name || e.message !== t.message || e.stack !== t.stack) return !1;
+	let r = e.cause, i = t.cause;
+	if (r !== i && !n.equals(r, i, "cause", "cause", e, t, n)) return !1;
+	let a = e.errors, o = t.errors;
+	if (a !== o && !n.equals(a, o, "errors", "errors", e, t, n)) return !1;
+	let s = m(e), c = m(t), l = s.length;
+	if (!l && !c.length) return !0;
+	let u = 0, d;
+	for (; l-- > 0;) if (d = s[l], d !== "cause" && d !== "errors") {
+		if (d !== c[l] && !h.call(t, d) || !n.equals(e[d], t[d], d, d, e, t, n)) return !1;
+		++u;
+	}
+	let f = c.length - u;
+	return !f || f === +!!h.call(t, "cause") + +!!h.call(t, "errors");
 }
-function y(e, t) {
+function S(e, t) {
 	return e === t;
 }
-function b(e, t, n) {
+function C(e, t, n) {
+	return e.name === t.name && e.message === t.message && e.stack === t.stack && D(e, t, n);
+}
+function w(e, t, n) {
 	let r = e.size;
 	if (r !== t.size) return !1;
 	if (!r) return !0;
@@ -71,27 +87,28 @@ function b(e, t, n) {
 	}
 	return !0;
 }
-var x = c;
-function S(e, t, n) {
-	let r = p(e), i = r.length;
-	if (p(t).length !== i) return !1;
-	for (; i-- > 0;) if (!k(e, t, n, r[i])) return !1;
+var T = c;
+function E(e, t, n) {
+	let r = m(e), i = m(t), a = r.length;
+	if (i.length !== a) return !1;
+	let o = a <= f, s;
+	for (; a-- > 0;) if (s = r[a], !P(e, t, s) && (s !== i[a] && !(o ? i.includes(s) : h.call(t, s)) || !n.equals(e[s], t[s], s, s, e, t, n))) return !1;
 	return !0;
 }
-function C(e, t, n) {
+function D(e, t, n) {
 	let r = o(e), i = r.length;
 	if (o(t).length !== i) return !1;
-	let a, s, c;
-	for (; i-- > 0;) if (a = r[i], !k(e, t, n, a) || (s = f(e, a), c = f(t, a), (s || c) && (!s || !c || s.configurable !== c.configurable || s.enumerable !== c.enumerable || s.writable !== c.writable))) return !1;
+	let a, c, l;
+	for (; i-- > 0;) if (a = r[i], !P(e, t, a) && (!s(t, a) || !n.equals(e[a], t[a], a, a, e, t, n)) || (c = p(e, a), l = p(t, a), (c || l) && (!c || !l || c.configurable !== l.configurable || c.enumerable !== l.enumerable || c.writable !== l.writable))) return !1;
 	return !0;
 }
-function w(e, t) {
+function O(e, t) {
 	return c(e.valueOf(), t.valueOf());
 }
-function T(e, t) {
+function ee(e, t) {
 	return e.source === t.source && e.flags === t.flags;
 }
-function E(e, t, n) {
+function k(e, t, n) {
 	let r = e.size;
 	if (r !== t.size) return !1;
 	if (!r) return !0;
@@ -109,19 +126,31 @@ function E(e, t, n) {
 	}
 	return !0;
 }
-function D(e, t) {
-	let n = e.byteLength;
-	if (t.byteLength !== n || e.byteOffset !== t.byteOffset) return !1;
+function A(e, t) {
+	let n = e.length;
+	if (t.length !== n || e.byteOffset !== t.byteOffset) return !1;
+	let r = g.call(e);
+	if (r === "Float64Array" || r === "Float32Array" || r === "Float16Array") {
+		for (; n-- > 0;) if (e[n] !== t[n] && (e[n] === e[n] || t[n] === t[n])) return !1;
+		return !0;
+	}
 	for (; n-- > 0;) if (e[n] !== t[n]) return !1;
 	return !0;
 }
-function O(e, t) {
-	return e.hostname === t.hostname && e.pathname === t.pathname && e.protocol === t.protocol && e.port === t.port && e.hash === t.hash && e.username === t.username && e.password === t.password;
+function j(e, t) {
+	return e.href === t.href || e.protocol === t.protocol && e.username === t.username && e.password === t.password && e.host === t.host && e.pathname === t.pathname && e.hash === t.hash && M(e.searchParams, t.searchParams);
+}
+function M(e, t) {
+	let n = e.toString(), r = t.toString();
+	return n === r || N(n) === N(r);
+}
+function N(e) {
+	return e.split("&").sort().join("&");
 }
-function k(e, t, n, r) {
-	return (r === d || r === u || r === l) && (e.$$typeof || t.$$typeof) ? !0 : s(t, r) && n.equals(e[r], t[r], r, r, e, t, n);
+function P(e, t, n) {
+	return (n === d || n === u || n === l) && !!(e.$$typeof || t.$$typeof);
 }
-var A = "[object ArrayBuffer]", j = "[object Arguments]", M = "[object Boolean]", N = "[object DataView]", P = "[object Date]", F = "[object Error]", I = "[object Map]", L = "[object Number]", R = "[object Object]", z = "[object RegExp]", B = "[object Set]", V = "[object String]", H = {
+var F = "[object ArrayBuffer]", I = "[object Arguments]", L = "[object Boolean]", R = "[object DataView]", z = "[object Date]", B = "[object Error]", V = "[object Map]", H = "[object Number]", U = "[object Object]", W = "[object RegExp]", G = "[object Set]", K = "[object String]", q = {
 	"[object Int8Array]": !0,
 	"[object Uint8Array]": !0,
 	"[object Uint8ClampedArray]": !0,
@@ -134,14 +163,14 @@ var A = "[object ArrayBuffer]", j = "[object Arguments]", M = "[object Boolean]"
 	"[object Float64Array]": !0,
 	"[object BigInt64Array]": !0,
 	"[object BigUint64Array]": !0
-}, U = "[object URL]", W = Object.prototype.toString;
-function G({ areArrayBuffersEqual: e, areArraysEqual: t, areDataViewsEqual: n, areDatesEqual: r, areErrorsEqual: i, areFunctionsEqual: o, areMapsEqual: s, areNumbersEqual: c, areObjectsEqual: l, arePrimitiveWrappersEqual: u, areRegExpsEqual: d, areSetsEqual: f, areTypedArraysEqual: p, areUrlsEqual: m, unknownTagComparators: h }) {
+}, J = "[object URL]", Y = Object.prototype.toString;
+function X({ areArrayBuffersEqual: e, areArraysEqual: t, areDataViewsEqual: n, areDatesEqual: r, areErrorsEqual: i, areFunctionsEqual: o, areMapsEqual: s, areNumbersEqual: c, areObjectsEqual: l, arePrimitiveWrappersEqual: u, areRegExpsEqual: d, areSetsEqual: f, areTypedArraysEqual: p, areUrlsEqual: m, unknownTagComparators: h }) {
 	return function(g, _, v) {
 		if (g === _) return !0;
 		if (g == null || _ == null) return !1;
 		let y = typeof g;
 		if (y !== typeof _) return !1;
-		if (y !== "object") return y === "number" ? c(g, _, v) : y === "function" ? o(g, _, v) : !1;
+		if (y !== "object") return y === "number" ? c(g, _, v) : y === "function" && o(g, _, v);
 		let b = g.constructor;
 		if (b !== _.constructor) return !1;
 		if (b === Object) return l(g, _, v);
@@ -150,19 +179,20 @@ function G({ areArrayBuffersEqual: e, areArraysEqual: t, areDataViewsEqual: n, a
 		if (b === RegExp) return d(g, _, v);
 		if (b === Map) return s(g, _, v);
 		if (b === Set) return f(g, _, v);
-		let x = W.call(g);
-		if (x === P) return r(g, _, v);
-		if (x === z) return d(g, _, v);
-		if (x === I) return s(g, _, v);
-		if (x === B) return f(g, _, v);
-		if (x === R) return typeof g.then != "function" && typeof _.then != "function" && l(g, _, v);
-		if (x === U) return m(g, _, v);
-		if (x === F) return i(g, _, v);
-		if (x === j) return l(g, _, v);
-		if (H[x]) return p(g, _, v);
-		if (x === A) return e(g, _, v);
-		if (x === N) return n(g, _, v);
-		if (x === M || x === L || x === V) return u(g, _, v);
+		if (b == null) return l(g, _, v);
+		let x = Y.call(g);
+		if (x === z) return r(g, _, v);
+		if (x === W) return d(g, _, v);
+		if (x === V) return s(g, _, v);
+		if (x === G) return f(g, _, v);
+		if (x === U) return typeof g.then != "function" && typeof _.then != "function" && l(g, _, v);
+		if (x === J) return m(g, _, v);
+		if (x === B) return i(g, _, v);
+		if (x === I) return l(g, _, v);
+		if (q[x]) return p(g, _, v);
+		if (x === F) return e(g, _, v);
+		if (x === R) return n(g, _, v);
+		if (x === L || x === H || x === K) return u(g, _, v);
 		if (h) {
 			let e = h[x];
 			if (!e) {
@@ -174,41 +204,42 @@ function G({ areArrayBuffersEqual: e, areArraysEqual: t, areDataViewsEqual: n, a
 		return !1;
 	};
 }
-function K({ circular: e, createCustomConfig: t, strict: n }) {
+function Z({ circular: e, createCustomConfig: t, strict: n }) {
 	let a = {
-		areArrayBuffersEqual: m,
-		areArraysEqual: n ? C : h,
-		areDataViewsEqual: g,
-		areDatesEqual: _,
-		areErrorsEqual: v,
-		areFunctionsEqual: y,
-		areMapsEqual: n ? r(b, C) : b,
-		areNumbersEqual: x,
-		areObjectsEqual: n ? C : S,
-		arePrimitiveWrappersEqual: w,
-		areRegExpsEqual: T,
-		areSetsEqual: n ? r(E, C) : E,
-		areTypedArraysEqual: n ? r(D, C) : D,
-		areUrlsEqual: O,
+		areArrayBuffersEqual: _,
+		areArraysEqual: n ? D : v,
+		areDataViewsEqual: y,
+		areDatesEqual: b,
+		areErrorsEqual: n ? C : x,
+		areFunctionsEqual: S,
+		areMapsEqual: n ? r(w, D) : w,
+		areNumbersEqual: T,
+		areObjectsEqual: n ? D : E,
+		arePrimitiveWrappersEqual: O,
+		areRegExpsEqual: ee,
+		areSetsEqual: n ? r(k, D) : k,
+		areTypedArraysEqual: n ? r(A, D) : A,
+		areUrlsEqual: j,
 		unknownTagComparators: void 0
 	};
 	if (t && (a = Object.assign({}, a, t(a))), e) {
-		let e = i(a.areArraysEqual), t = i(a.areMapsEqual), n = i(a.areObjectsEqual), r = i(a.areSetsEqual);
+		let e = i(a.areArraysEqual), t = i(a.areErrorsEqual), n = i(a.areMapsEqual), r = i(a.areObjectsEqual), o = i(a.areSetsEqual);
 		a = Object.assign({}, a, {
 			areArraysEqual: e,
-			areMapsEqual: t,
-			areObjectsEqual: n,
-			areSetsEqual: r
+			areErrorsEqual: t,
+			areMapsEqual: n,
+			areObjectsEqual: r,
+			areSetsEqual: o
 		});
 	}
 	return a;
 }
-function q(e) {
+function Q(e) {
 	return function(t, n, r, i, a, o, s) {
 		return e(t, n, s);
 	};
 }
-function J({ circular: e, comparator: t, createState: n, equals: r, strict: i }) {
+function te({ circular: e, comparator: t, createState: n, equals: r, strict: i }) {
 	if (n) return function(a, o) {
 		let { cache: s = e ? /* @__PURE__ */ new WeakMap() : void 0, meta: c } = n();
 		return t(a, o, {
@@ -236,32 +267,31 @@ function J({ circular: e, comparator: t, createState: n, equals: r, strict: i })
 		return t(e, n, a);
 	};
 }
-var Y = X();
-X({ strict: !0 }), X({ circular: !0 }), X({
+var ne = $();
+$({ strict: !0 }), $({ circular: !0 }), $({
 	circular: !0,
 	strict: !0
-}), X({ createInternalComparator: () => c }), X({
+}), $({ createInternalComparator: () => c }), $({
 	strict: !0,
 	createInternalComparator: () => c
-}), X({
+}), $({
 	circular: !0,
 	createInternalComparator: () => c
-}), X({
+}), $({
 	circular: !0,
 	createInternalComparator: () => c,
 	strict: !0
 });
-function X(e = {}) {
-	let { circular: t = !1, createInternalComparator: n, createState: r, strict: i = !1 } = e, a = G(K(e));
-	return J({
+function $(e = {}) {
+	let { circular: t = !1, createInternalComparator: n, createState: r, strict: i = !1 } = e, a = X(Z(e));
+	return te({
 		circular: t,
 		comparator: a,
 		createState: r,
-		equals: n ? n(a) : q(a),
+		equals: n ? n(a) : Q(a),
 		strict: i
 	});
 }
-//#endregion
-export { Y as deepEqual };
+export { $ as createCustomEqual, ne as deepEqual, c as sameValueZeroEqual };
 
 //# sourceMappingURL=index.js.map

package/dist/node_modules/fast-equals/dist/es/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","names":[],"sources":["../../../../../node_modules/fast-equals/dist/es/index.mjs"],"sourcesContent":["const { getOwnPropertyNames, getOwnPropertySymbols } = Object;\n// eslint-disable-next-line @typescript-eslint/unbound-method\nconst { hasOwnProperty } = Object.prototype;\n/**\n * Combine two comparators into a single comparators.\n */\nfunction combineComparators(comparatorA, comparatorB) {\n    return function isEqual(a, b, state) {\n        return comparatorA(a, b, state) && comparatorB(a, b, state);\n    };\n}\n/**\n * Wrap the provided `areItemsEqual` method to manage the circular state, allowing\n * for circular references to be safely included in the comparison without creating\n * stack overflows.\n */\nfunction createIsCircular(areItemsEqual) {\n    return function isCircular(a, b, state) {\n        if (!a || !b || typeof a !== 'object' || typeof b !== 'object') {\n            return areItemsEqual(a, b, state);\n        }\n        const { cache } = state;\n        const cachedA = cache.get(a);\n        const cachedB = cache.get(b);\n        if (cachedA && cachedB) {\n            return cachedA === b && cachedB === a;\n        }\n        cache.set(a, b);\n        cache.set(b, a);\n        const result = areItemsEqual(a, b, state);\n        cache.delete(a);\n        cache.delete(b);\n        return result;\n    };\n}\n/**\n * Get the `@@toStringTag` of the value, if it exists.\n */\nfunction getShortTag(value) {\n    return value != null ? value[Symbol.toStringTag] : undefined;\n}\n/**\n * Get the properties to strictly examine, which include both own properties that are\n * not enumerable and symbol properties.\n */\nfunction getStrictProperties(object) {\n    return getOwnPropertyNames(object).concat(getOwnPropertySymbols(object));\n}\n/**\n * Whether the object contains the property passed as an own property.\n */\nconst hasOwn = \n// eslint-disable-next-line @typescript-eslint/no-unnecessary-condition\nObject.hasOwn || ((object, property) => hasOwnProperty.call(object, property));\n/**\n * Whether the values passed are strictly equal or both NaN.\n */\nfunction sameValueZeroEqual(a, b) {\n    return a === b || (!a && !b && a !== a && b !== b);\n}\n\nconst PREACT_VNODE = '__v';\nconst PREACT_OWNER = '__o';\nconst REACT_OWNER = '_owner';\nconst { getOwnPropertyDescriptor, keys } = Object;\n/**\n * Whether the array buffers are equal in value.\n */\nfunction areArrayBuffersEqual(a, b) {\n    return a.byteLength === b.byteLength && areTypedArraysEqual(new Uint8Array(a), new Uint8Array(b));\n}\n/**\n * Whether the arrays are equal in value.\n */\nfunction areArraysEqual(a, b, state) {\n    let index = a.length;\n    if (b.length !== index) {\n        return false;\n    }\n    while (index-- > 0) {\n        if (!state.equals(a[index], b[index], index, index, a, b, state)) {\n            return false;\n        }\n    }\n    return true;\n}\n/**\n * Whether the dataviews are equal in value.\n */\nfunction areDataViewsEqual(a, b) {\n    return (a.byteLength === b.byteLength\n        && areTypedArraysEqual(new Uint8Array(a.buffer, a.byteOffset, a.byteLength), new Uint8Array(b.buffer, b.byteOffset, b.byteLength)));\n}\n/**\n * Whether the dates passed are equal in value.\n */\nfunction areDatesEqual(a, b) {\n    return sameValueZeroEqual(a.getTime(), b.getTime());\n}\n/**\n * Whether the errors passed are equal in value.\n */\nfunction areErrorsEqual(a, b) {\n    return a.name === b.name && a.message === b.message && a.cause === b.cause && a.stack === b.stack;\n}\n/**\n * Whether the functions passed are equal in value.\n */\nfunction areFunctionsEqual(a, b) {\n    return a === b;\n}\n/**\n * Whether the `Map`s are equal in value.\n */\nfunction areMapsEqual(a, b, state) {\n    const size = a.size;\n    if (size !== b.size) {\n        return false;\n    }\n    if (!size) {\n        return true;\n    }\n    const matchedIndices = new Array(size);\n    const aIterable = a.entries();\n    let aResult;\n    let bResult;\n    let index = 0;\n    // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition\n    while ((aResult = aIterable.next())) {\n        if (aResult.done) {\n            break;\n        }\n        const bIterable = b.entries();\n        let hasMatch = false;\n        let matchIndex = 0;\n        // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition\n        while ((bResult = bIterable.next())) {\n            if (bResult.done) {\n                break;\n            }\n            if (matchedIndices[matchIndex]) {\n                matchIndex++;\n                continue;\n            }\n            const aEntry = aResult.value;\n            const bEntry = bResult.value;\n            if (state.equals(aEntry[0], bEntry[0], index, matchIndex, a, b, state)\n                && state.equals(aEntry[1], bEntry[1], aEntry[0], bEntry[0], a, b, state)) {\n                hasMatch = matchedIndices[matchIndex] = true;\n                break;\n            }\n            matchIndex++;\n        }\n        if (!hasMatch) {\n            return false;\n        }\n        index++;\n    }\n    return true;\n}\n/**\n * Whether the numbers are equal in value.\n */\nconst areNumbersEqual = sameValueZeroEqual;\n/**\n * Whether the objects are equal in value.\n */\nfunction areObjectsEqual(a, b, state) {\n    const properties = keys(a);\n    let index = properties.length;\n    if (keys(b).length !== index) {\n        return false;\n    }\n    // Decrementing `while` showed faster results than either incrementing or\n    // decrementing `for` loop and than an incrementing `while` loop. Declarative\n    // methods like `some` / `every` were not used to avoid incurring the garbage\n    // cost of anonymous callbacks.\n    while (index-- > 0) {\n        if (!isPropertyEqual(a, b, state, properties[index])) {\n            return false;\n        }\n    }\n    return true;\n}\n/**\n * Whether the objects are equal in value with strict property checking.\n */\nfunction areObjectsEqualStrict(a, b, state) {\n    const properties = getStrictProperties(a);\n    let index = properties.length;\n    if (getStrictProperties(b).length !== index) {\n        return false;\n    }\n    let property;\n    let descriptorA;\n    let descriptorB;\n    // Decrementing `while` showed faster results than either incrementing or\n    // decrementing `for` loop and than an incrementing `while` loop. Declarative\n    // methods like `some` / `every` were not used to avoid incurring the garbage\n    // cost of anonymous callbacks.\n    while (index-- > 0) {\n        property = properties[index];\n        if (!isPropertyEqual(a, b, state, property)) {\n            return false;\n        }\n        descriptorA = getOwnPropertyDescriptor(a, property);\n        descriptorB = getOwnPropertyDescriptor(b, property);\n        if ((descriptorA || descriptorB)\n            && (!descriptorA\n                || !descriptorB\n                || descriptorA.configurable !== descriptorB.configurable\n                || descriptorA.enumerable !== descriptorB.enumerable\n                || descriptorA.writable !== descriptorB.writable)) {\n            return false;\n        }\n    }\n    return true;\n}\n/**\n * Whether the primitive wrappers passed are equal in value.\n */\nfunction arePrimitiveWrappersEqual(a, b) {\n    return sameValueZeroEqual(a.valueOf(), b.valueOf());\n}\n/**\n * Whether the regexps passed are equal in value.\n */\nfunction areRegExpsEqual(a, b) {\n    return a.source === b.source && a.flags === b.flags;\n}\n/**\n * Whether the `Set`s are equal in value.\n */\nfunction areSetsEqual(a, b, state) {\n    const size = a.size;\n    if (size !== b.size) {\n        return false;\n    }\n    if (!size) {\n        return true;\n    }\n    const matchedIndices = new Array(size);\n    const aIterable = a.values();\n    let aResult;\n    let bResult;\n    // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition\n    while ((aResult = aIterable.next())) {\n        if (aResult.done) {\n            break;\n        }\n        const bIterable = b.values();\n        let hasMatch = false;\n        let matchIndex = 0;\n        // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition\n        while ((bResult = bIterable.next())) {\n            if (bResult.done) {\n                break;\n            }\n            if (!matchedIndices[matchIndex]\n                && state.equals(aResult.value, bResult.value, aResult.value, bResult.value, a, b, state)) {\n                hasMatch = matchedIndices[matchIndex] = true;\n                break;\n            }\n            matchIndex++;\n        }\n        if (!hasMatch) {\n            return false;\n        }\n    }\n    return true;\n}\n/**\n * Whether the TypedArray instances are equal in value.\n */\nfunction areTypedArraysEqual(a, b) {\n    let index = a.byteLength;\n    if (b.byteLength !== index || a.byteOffset !== b.byteOffset) {\n        return false;\n    }\n    while (index-- > 0) {\n        if (a[index] !== b[index]) {\n            return false;\n        }\n    }\n    return true;\n}\n/**\n * Whether the URL instances are equal in value.\n */\nfunction areUrlsEqual(a, b) {\n    return (a.hostname === b.hostname\n        && a.pathname === b.pathname\n        && a.protocol === b.protocol\n        && a.port === b.port\n        && a.hash === b.hash\n        && a.username === b.username\n        && a.password === b.password);\n}\nfunction isPropertyEqual(a, b, state, property) {\n    if ((property === REACT_OWNER || property === PREACT_OWNER || property === PREACT_VNODE)\n        && (a.$$typeof || b.$$typeof)) {\n        return true;\n    }\n    return hasOwn(b, property) && state.equals(a[property], b[property], property, property, a, b, state);\n}\n\nconst ARRAY_BUFFER_TAG = '[object ArrayBuffer]';\nconst ARGUMENTS_TAG = '[object Arguments]';\nconst BOOLEAN_TAG = '[object Boolean]';\nconst DATA_VIEW_TAG = '[object DataView]';\nconst DATE_TAG = '[object Date]';\nconst ERROR_TAG = '[object Error]';\nconst MAP_TAG = '[object Map]';\nconst NUMBER_TAG = '[object Number]';\nconst OBJECT_TAG = '[object Object]';\nconst REG_EXP_TAG = '[object RegExp]';\nconst SET_TAG = '[object Set]';\nconst STRING_TAG = '[object String]';\nconst TYPED_ARRAY_TAGS = {\n    '[object Int8Array]': true,\n    '[object Uint8Array]': true,\n    '[object Uint8ClampedArray]': true,\n    '[object Int16Array]': true,\n    '[object Uint16Array]': true,\n    '[object Int32Array]': true,\n    '[object Uint32Array]': true,\n    '[object Float16Array]': true,\n    '[object Float32Array]': true,\n    '[object Float64Array]': true,\n    '[object BigInt64Array]': true,\n    '[object BigUint64Array]': true,\n};\nconst URL_TAG = '[object URL]';\n// eslint-disable-next-line @typescript-eslint/unbound-method\nconst toString = Object.prototype.toString;\n/**\n * Create a comparator method based on the type-specific equality comparators passed.\n */\nfunction createEqualityComparator({ areArrayBuffersEqual, areArraysEqual, areDataViewsEqual, areDatesEqual, areErrorsEqual, areFunctionsEqual, areMapsEqual, areNumbersEqual, areObjectsEqual, arePrimitiveWrappersEqual, areRegExpsEqual, areSetsEqual, areTypedArraysEqual, areUrlsEqual, unknownTagComparators, }) {\n    /**\n     * compare the value of the two objects and return true if they are equivalent in values\n     */\n    return function comparator(a, b, state) {\n        // If the items are strictly equal, no need to do a value comparison.\n        if (a === b) {\n            return true;\n        }\n        // If either of the items are nullish and fail the strictly equal check\n        // above, then they must be unequal.\n        if (a == null || b == null) {\n            return false;\n        }\n        const type = typeof a;\n        if (type !== typeof b) {\n            return false;\n        }\n        if (type !== 'object') {\n            if (type === 'number') {\n                return areNumbersEqual(a, b, state);\n            }\n            if (type === 'function') {\n                return areFunctionsEqual(a, b, state);\n            }\n            // If a primitive value that is not strictly equal, it must be unequal.\n            return false;\n        }\n        const constructor = a.constructor;\n        // Checks are listed in order of commonality of use-case:\n        //   1. Common complex object types (plain object, array)\n        //   2. Common data values (date, regexp)\n        //   3. Less-common complex object types (map, set)\n        //   4. Less-common data values (promise, primitive wrappers)\n        // Inherently this is both subjective and assumptive, however\n        // when reviewing comparable libraries in the wild this order\n        // appears to be generally consistent.\n        // Constructors should match, otherwise there is potential for false positives\n        // between class and subclass or custom object and POJO.\n        if (constructor !== b.constructor) {\n            return false;\n        }\n        // `isPlainObject` only checks against the object's own realm. Cross-realm\n        // comparisons are rare, and will be handled in the ultimate fallback, so\n        // we can avoid capturing the string tag.\n        if (constructor === Object) {\n            return areObjectsEqual(a, b, state);\n        }\n        // `isArray()` works on subclasses and is cross-realm, so we can avoid capturing\n        // the string tag or doing an `instanceof` check.\n        if (Array.isArray(a)) {\n            return areArraysEqual(a, b, state);\n        }\n        // Try to fast-path equality checks for other complex object types in the\n        // same realm to avoid capturing the string tag. Strict equality is used\n        // instead of `instanceof` because it is more performant for the common\n        // use-case. If someone is subclassing a native class, it will be handled\n        // with the string tag comparison.\n        if (constructor === Date) {\n            return areDatesEqual(a, b, state);\n        }\n        if (constructor === RegExp) {\n            return areRegExpsEqual(a, b, state);\n        }\n        if (constructor === Map) {\n            return areMapsEqual(a, b, state);\n        }\n        if (constructor === Set) {\n            return areSetsEqual(a, b, state);\n        }\n        // Since this is a custom object, capture the string tag to determing its type.\n        // This is reasonably performant in modern environments like v8 and SpiderMonkey.\n        const tag = toString.call(a);\n        if (tag === DATE_TAG) {\n            return areDatesEqual(a, b, state);\n        }\n        // For RegExp, the properties are not enumerable, and therefore will give false positives if\n        // tested like a standard object.\n        if (tag === REG_EXP_TAG) {\n            return areRegExpsEqual(a, b, state);\n        }\n        if (tag === MAP_TAG) {\n            return areMapsEqual(a, b, state);\n        }\n        if (tag === SET_TAG) {\n            return areSetsEqual(a, b, state);\n        }\n        if (tag === OBJECT_TAG) {\n            // The exception for value comparison is custom `Promise`-like class instances. These should\n            // be treated the same as standard `Promise` objects, which means strict equality, and if\n            // it reaches this point then that strict equality comparison has already failed.\n            return typeof a.then !== 'function' && typeof b.then !== 'function' && areObjectsEqual(a, b, state);\n        }\n        // If a URL tag, it should be tested explicitly. Like RegExp, the properties are not\n        // enumerable, and therefore will give false positives if tested like a standard object.\n        if (tag === URL_TAG) {\n            return areUrlsEqual(a, b, state);\n        }\n        // If an error tag, it should be tested explicitly. Like RegExp, the properties are not\n        // enumerable, and therefore will give false positives if tested like a standard object.\n        if (tag === ERROR_TAG) {\n            return areErrorsEqual(a, b, state);\n        }\n        // If an arguments tag, it should be treated as a standard object.\n        if (tag === ARGUMENTS_TAG) {\n            return areObjectsEqual(a, b, state);\n        }\n        if (TYPED_ARRAY_TAGS[tag]) {\n            return areTypedArraysEqual(a, b, state);\n        }\n        if (tag === ARRAY_BUFFER_TAG) {\n            return areArrayBuffersEqual(a, b, state);\n        }\n        if (tag === DATA_VIEW_TAG) {\n            return areDataViewsEqual(a, b, state);\n        }\n        // As the penultimate fallback, check if the values passed are primitive wrappers. This\n        // is very rare in modern JS, which is why it is deprioritized compared to all other object\n        // types.\n        if (tag === BOOLEAN_TAG || tag === NUMBER_TAG || tag === STRING_TAG) {\n            return arePrimitiveWrappersEqual(a, b, state);\n        }\n        if (unknownTagComparators) {\n            let unknownTagComparator = unknownTagComparators[tag];\n            if (!unknownTagComparator) {\n                const shortTag = getShortTag(a);\n                if (shortTag) {\n                    unknownTagComparator = unknownTagComparators[shortTag];\n                }\n            }\n            // If the custom config has an unknown tag comparator that matches the captured tag or the\n            // @@toStringTag, it is the source of truth for whether the values are equal.\n            if (unknownTagComparator) {\n                return unknownTagComparator(a, b, state);\n            }\n        }\n        // If not matching any tags that require a specific type of comparison, then we hard-code false because\n        // the only thing remaining is strict equality, which has already been compared. This is for a few reasons:\n        //   - Certain types that cannot be introspected (e.g., `WeakMap`). For these types, this is the only\n        //     comparison that can be made.\n        //   - For types that can be introspected, but rarely have requirements to be compared\n        //     (`ArrayBuffer`, `DataView`, etc.), the cost is avoided to prioritize the common\n        //     use-cases (may be included in a future release, if requested enough).\n        //   - For types that can be introspected but do not have an objective definition of what\n        //     equality is (`Error`, etc.), the subjective decision is to be conservative and strictly compare.\n        // In all cases, these decisions should be reevaluated based on changes to the language and\n        // common development practices.\n        return false;\n    };\n}\n/**\n * Create the configuration object used for building comparators.\n */\nfunction createEqualityComparatorConfig({ circular, createCustomConfig, strict, }) {\n    let config = {\n        areArrayBuffersEqual,\n        areArraysEqual: strict ? areObjectsEqualStrict : areArraysEqual,\n        areDataViewsEqual,\n        areDatesEqual: areDatesEqual,\n        areErrorsEqual: areErrorsEqual,\n        areFunctionsEqual: areFunctionsEqual,\n        areMapsEqual: strict ? combineComparators(areMapsEqual, areObjectsEqualStrict) : areMapsEqual,\n        areNumbersEqual: areNumbersEqual,\n        areObjectsEqual: strict ? areObjectsEqualStrict : areObjectsEqual,\n        arePrimitiveWrappersEqual: arePrimitiveWrappersEqual,\n        areRegExpsEqual: areRegExpsEqual,\n        areSetsEqual: strict ? combineComparators(areSetsEqual, areObjectsEqualStrict) : areSetsEqual,\n        areTypedArraysEqual: strict\n            ? combineComparators(areTypedArraysEqual, areObjectsEqualStrict)\n            : areTypedArraysEqual,\n        areUrlsEqual: areUrlsEqual,\n        unknownTagComparators: undefined,\n    };\n    if (createCustomConfig) {\n        config = Object.assign({}, config, createCustomConfig(config));\n    }\n    if (circular) {\n        const areArraysEqual = createIsCircular(config.areArraysEqual);\n        const areMapsEqual = createIsCircular(config.areMapsEqual);\n        const areObjectsEqual = createIsCircular(config.areObjectsEqual);\n        const areSetsEqual = createIsCircular(config.areSetsEqual);\n        config = Object.assign({}, config, {\n            areArraysEqual,\n            areMapsEqual,\n            areObjectsEqual,\n            areSetsEqual,\n        });\n    }\n    return config;\n}\n/**\n * Default equality comparator pass-through, used as the standard `isEqual` creator for\n * use inside the built comparator.\n */\nfunction createInternalEqualityComparator(compare) {\n    return function (a, b, _indexOrKeyA, _indexOrKeyB, _parentA, _parentB, state) {\n        return compare(a, b, state);\n    };\n}\n/**\n * Create the `isEqual` function used by the consuming application.\n */\nfunction createIsEqual({ circular, comparator, createState, equals, strict }) {\n    if (createState) {\n        return function isEqual(a, b) {\n            const { cache = circular ? new WeakMap() : undefined, meta } = createState();\n            return comparator(a, b, {\n                cache,\n                equals,\n                meta,\n                strict,\n            });\n        };\n    }\n    if (circular) {\n        return function isEqual(a, b) {\n            return comparator(a, b, {\n                cache: new WeakMap(),\n                equals,\n                meta: undefined,\n                strict,\n            });\n        };\n    }\n    const state = {\n        cache: undefined,\n        equals,\n        meta: undefined,\n        strict,\n    };\n    return function isEqual(a, b) {\n        return comparator(a, b, state);\n    };\n}\n\n/**\n * Whether the items passed are deeply-equal in value.\n */\nconst deepEqual = createCustomEqual();\n/**\n * Whether the items passed are deeply-equal in value based on strict comparison.\n */\nconst strictDeepEqual = createCustomEqual({ strict: true });\n/**\n * Whether the items passed are deeply-equal in value, including circular references.\n */\nconst circularDeepEqual = createCustomEqual({ circular: true });\n/**\n * Whether the items passed are deeply-equal in value, including circular references,\n * based on strict comparison.\n */\nconst strictCircularDeepEqual = createCustomEqual({\n    circular: true,\n    strict: true,\n});\n/**\n * Whether the items passed are shallowly-equal in value.\n */\nconst shallowEqual = createCustomEqual({\n    createInternalComparator: () => sameValueZeroEqual,\n});\n/**\n * Whether the items passed are shallowly-equal in value based on strict comparison\n */\nconst strictShallowEqual = createCustomEqual({\n    strict: true,\n    createInternalComparator: () => sameValueZeroEqual,\n});\n/**\n * Whether the items passed are shallowly-equal in value, including circular references.\n */\nconst circularShallowEqual = createCustomEqual({\n    circular: true,\n    createInternalComparator: () => sameValueZeroEqual,\n});\n/**\n * Whether the items passed are shallowly-equal in value, including circular references,\n * based on strict comparison.\n */\nconst strictCircularShallowEqual = createCustomEqual({\n    circular: true,\n    createInternalComparator: () => sameValueZeroEqual,\n    strict: true,\n});\n/**\n * Create a custom equality comparison method.\n *\n * This can be done to create very targeted comparisons in extreme hot-path scenarios\n * where the standard methods are not performant enough, but can also be used to provide\n * support for legacy environments that do not support expected features like\n * `RegExp.prototype.flags` out of the box.\n */\nfunction createCustomEqual(options = {}) {\n    const { circular = false, createInternalComparator: createCustomInternalComparator, createState, strict = false, } = options;\n    const config = createEqualityComparatorConfig(options);\n    const comparator = createEqualityComparator(config);\n    const equals = createCustomInternalComparator\n        ? createCustomInternalComparator(comparator)\n        : createInternalEqualityComparator(comparator);\n    return createIsEqual({ circular, comparator, createState, equals, strict });\n}\n\nexport { circularDeepEqual, circularShallowEqual, createCustomEqual, deepEqual, sameValueZeroEqual, shallowEqual, strictCircularDeepEqual, strictCircularShallowEqual, strictDeepEqual, strictShallowEqual };\n//# sourceMappingURL=index.mjs.map\n"],"x_google_ignoreList":[0],"mappings":";AAAA,IAAM,EAAE,wBAAqB,6BAA0B,QAEjD,EAAE,sBAAmB,OAAO;AAIlC,SAAS,EAAmB,GAAa,GAAa;AAClD,QAAO,SAAiB,GAAG,GAAG,GAAO;AACjC,SAAO,EAAY,GAAG,GAAG,EAAM,IAAI,EAAY,GAAG,GAAG,EAAM;;;AAQnE,SAAS,EAAiB,GAAe;AACrC,QAAO,SAAoB,GAAG,GAAG,GAAO;AACpC,MAAI,CAAC,KAAK,CAAC,KAAK,OAAO,KAAM,YAAY,OAAO,KAAM,SAClD,QAAO,EAAc,GAAG,GAAG,EAAM;EAErC,IAAM,EAAE,aAAU,GACZ,IAAU,EAAM,IAAI,EAAE,EACtB,IAAU,EAAM,IAAI,EAAE;AAC5B,MAAI,KAAW,EACX,QAAO,MAAY,KAAK,MAAY;AAGxC,EADA,EAAM,IAAI,GAAG,EAAE,EACf,EAAM,IAAI,GAAG,EAAE;EACf,IAAM,IAAS,EAAc,GAAG,GAAG,EAAM;AAGzC,SAFA,EAAM,OAAO,EAAE,EACf,EAAM,OAAO,EAAE,EACR;;;AAMf,SAAS,EAAY,GAAO;AACxB,QAAO,IAAsB,OAAO;;AAMxC,SAAS,EAAoB,GAAQ;AACjC,QAAO,EAAoB,EAAO,CAAC,OAAO,EAAsB,EAAO,CAAC;;AAK5E,IAAM,IAEN,OAAO,YAAY,GAAQ,MAAa,EAAe,KAAK,GAAQ,EAAS;AAI7E,SAAS,EAAmB,GAAG,GAAG;AAC9B,QAAO,MAAM,KAAM,CAAC,KAAK,CAAC,KAAK,MAAM,KAAK,MAAM;;AAGpD,IAAM,IAAe,OACf,IAAe,OACf,IAAc,UACd,EAAE,6BAA0B,YAAS;AAI3C,SAAS,EAAqB,GAAG,GAAG;AAChC,QAAO,EAAE,eAAe,EAAE,cAAc,EAAoB,IAAI,WAAW,EAAE,EAAE,IAAI,WAAW,EAAE,CAAC;;AAKrG,SAAS,EAAe,GAAG,GAAG,GAAO;CACjC,IAAI,IAAQ,EAAE;AACd,KAAI,EAAE,WAAW,EACb,QAAO;AAEX,QAAO,MAAU,GACb,KAAI,CAAC,EAAM,OAAO,EAAE,IAAQ,EAAE,IAAQ,GAAO,GAAO,GAAG,GAAG,EAAM,CAC5D,QAAO;AAGf,QAAO;;AAKX,SAAS,EAAkB,GAAG,GAAG;AAC7B,QAAQ,EAAE,eAAe,EAAE,cACpB,EAAoB,IAAI,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE,WAAW,EAAE,IAAI,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE,WAAW,CAAC;;AAK1I,SAAS,EAAc,GAAG,GAAG;AACzB,QAAO,EAAmB,EAAE,SAAS,EAAE,EAAE,SAAS,CAAC;;AAKvD,SAAS,EAAe,GAAG,GAAG;AAC1B,QAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,YAAY,EAAE,WAAW,EAAE,UAAU,EAAE,SAAS,EAAE,UAAU,EAAE;;AAKhG,SAAS,EAAkB,GAAG,GAAG;AAC7B,QAAO,MAAM;;AAKjB,SAAS,EAAa,GAAG,GAAG,GAAO;CAC/B,IAAM,IAAO,EAAE;AACf,KAAI,MAAS,EAAE,KACX,QAAO;AAEX,KAAI,CAAC,EACD,QAAO;CAEX,IAAM,IAAqB,MAAM,EAAK,EAChC,IAAY,EAAE,SAAS,EACzB,GACA,GACA,IAAQ;AAEZ,SAAQ,IAAU,EAAU,MAAM,KAC1B,GAAQ,OADqB;EAIjC,IAAM,IAAY,EAAE,SAAS,EACzB,IAAW,IACX,IAAa;AAEjB,UAAQ,IAAU,EAAU,MAAM,KAC1B,GAAQ,OADqB;AAIjC,OAAI,EAAe,IAAa;AAC5B;AACA;;GAEJ,IAAM,IAAS,EAAQ,OACjB,IAAS,EAAQ;AACvB,OAAI,EAAM,OAAO,EAAO,IAAI,EAAO,IAAI,GAAO,GAAY,GAAG,GAAG,EAAM,IAC/D,EAAM,OAAO,EAAO,IAAI,EAAO,IAAI,EAAO,IAAI,EAAO,IAAI,GAAG,GAAG,EAAM,EAAE;AAC1E,QAAW,EAAe,KAAc;AACxC;;AAEJ;;AAEJ,MAAI,CAAC,EACD,QAAO;AAEX;;AAEJ,QAAO;;AAKX,IAAM,IAAkB;AAIxB,SAAS,EAAgB,GAAG,GAAG,GAAO;CAClC,IAAM,IAAa,EAAK,EAAE,EACtB,IAAQ,EAAW;AACvB,KAAI,EAAK,EAAE,CAAC,WAAW,EACnB,QAAO;AAMX,QAAO,MAAU,GACb,KAAI,CAAC,EAAgB,GAAG,GAAG,GAAO,EAAW,GAAO,CAChD,QAAO;AAGf,QAAO;;AAKX,SAAS,EAAsB,GAAG,GAAG,GAAO;CACxC,IAAM,IAAa,EAAoB,EAAE,EACrC,IAAQ,EAAW;AACvB,KAAI,EAAoB,EAAE,CAAC,WAAW,EAClC,QAAO;CAEX,IAAI,GACA,GACA;AAKJ,QAAO,MAAU,GAOb,KANA,IAAW,EAAW,IAClB,CAAC,EAAgB,GAAG,GAAG,GAAO,EAAS,KAG3C,IAAc,EAAyB,GAAG,EAAS,EACnD,IAAc,EAAyB,GAAG,EAAS,GAC9C,KAAe,OACZ,CAAC,KACE,CAAC,KACD,EAAY,iBAAiB,EAAY,gBACzC,EAAY,eAAe,EAAY,cACvC,EAAY,aAAa,EAAY,WAC5C,QAAO;AAGf,QAAO;;AAKX,SAAS,EAA0B,GAAG,GAAG;AACrC,QAAO,EAAmB,EAAE,SAAS,EAAE,EAAE,SAAS,CAAC;;AAKvD,SAAS,EAAgB,GAAG,GAAG;AAC3B,QAAO,EAAE,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE;;AAKlD,SAAS,EAAa,GAAG,GAAG,GAAO;CAC/B,IAAM,IAAO,EAAE;AACf,KAAI,MAAS,EAAE,KACX,QAAO;AAEX,KAAI,CAAC,EACD,QAAO;CAEX,IAAM,IAAqB,MAAM,EAAK,EAChC,IAAY,EAAE,QAAQ,EACxB,GACA;AAEJ,SAAQ,IAAU,EAAU,MAAM,KAC1B,GAAQ,OADqB;EAIjC,IAAM,IAAY,EAAE,QAAQ,EACxB,IAAW,IACX,IAAa;AAEjB,UAAQ,IAAU,EAAU,MAAM,KAC1B,GAAQ,OADqB;AAIjC,OAAI,CAAC,EAAe,MACb,EAAM,OAAO,EAAQ,OAAO,EAAQ,OAAO,EAAQ,OAAO,EAAQ,OAAO,GAAG,GAAG,EAAM,EAAE;AAC1F,QAAW,EAAe,KAAc;AACxC;;AAEJ;;AAEJ,MAAI,CAAC,EACD,QAAO;;AAGf,QAAO;;AAKX,SAAS,EAAoB,GAAG,GAAG;CAC/B,IAAI,IAAQ,EAAE;AACd,KAAI,EAAE,eAAe,KAAS,EAAE,eAAe,EAAE,WAC7C,QAAO;AAEX,QAAO,MAAU,GACb,KAAI,EAAE,OAAW,EAAE,GACf,QAAO;AAGf,QAAO;;AAKX,SAAS,EAAa,GAAG,GAAG;AACxB,QAAQ,EAAE,aAAa,EAAE,YAClB,EAAE,aAAa,EAAE,YACjB,EAAE,aAAa,EAAE,YACjB,EAAE,SAAS,EAAE,QACb,EAAE,SAAS,EAAE,QACb,EAAE,aAAa,EAAE,YACjB,EAAE,aAAa,EAAE;;AAE5B,SAAS,EAAgB,GAAG,GAAG,GAAO,GAAU;AAK5C,SAJK,MAAa,KAAe,MAAa,KAAgB,MAAa,OACnE,EAAE,YAAY,EAAE,YACb,KAEJ,EAAO,GAAG,EAAS,IAAI,EAAM,OAAO,EAAE,IAAW,EAAE,IAAW,GAAU,GAAU,GAAG,GAAG,EAAM;;AAGzG,IAAM,IAAmB,wBACnB,IAAgB,sBAChB,IAAc,oBACd,IAAgB,qBAChB,IAAW,iBACX,IAAY,kBACZ,IAAU,gBACV,IAAa,mBACb,IAAa,mBACb,IAAc,mBACd,IAAU,gBACV,IAAa,mBACb,IAAmB;CACrB,sBAAsB;CACtB,uBAAuB;CACvB,8BAA8B;CAC9B,uBAAuB;CACvB,wBAAwB;CACxB,uBAAuB;CACvB,wBAAwB;CACxB,yBAAyB;CACzB,yBAAyB;CACzB,yBAAyB;CACzB,0BAA0B;CAC1B,2BAA2B;CAC9B,EACK,IAAU,gBAEV,IAAW,OAAO,UAAU;AAIlC,SAAS,EAAyB,EAAE,yBAAsB,mBAAgB,sBAAmB,kBAAe,mBAAgB,sBAAmB,iBAAc,oBAAiB,oBAAiB,8BAA2B,oBAAiB,iBAAc,wBAAqB,iBAAc,4BAA0B;AAIlT,QAAO,SAAoB,GAAG,GAAG,GAAO;AAEpC,MAAI,MAAM,EACN,QAAO;AAIX,MAAI,KAAK,QAAQ,KAAK,KAClB,QAAO;EAEX,IAAM,IAAO,OAAO;AACpB,MAAI,MAAS,OAAO,EAChB,QAAO;AAEX,MAAI,MAAS,SAQT,QAPI,MAAS,WACF,EAAgB,GAAG,GAAG,EAAM,GAEnC,MAAS,aACF,EAAkB,GAAG,GAAG,EAAM,GAGlC;EAEX,IAAM,IAAc,EAAE;AAWtB,MAAI,MAAgB,EAAE,YAClB,QAAO;AAKX,MAAI,MAAgB,OAChB,QAAO,EAAgB,GAAG,GAAG,EAAM;AAIvC,MAAI,MAAM,QAAQ,EAAE,CAChB,QAAO,EAAe,GAAG,GAAG,EAAM;AAOtC,MAAI,MAAgB,KAChB,QAAO,EAAc,GAAG,GAAG,EAAM;AAErC,MAAI,MAAgB,OAChB,QAAO,EAAgB,GAAG,GAAG,EAAM;AAEvC,MAAI,MAAgB,IAChB,QAAO,EAAa,GAAG,GAAG,EAAM;AAEpC,MAAI,MAAgB,IAChB,QAAO,EAAa,GAAG,GAAG,EAAM;EAIpC,IAAM,IAAM,EAAS,KAAK,EAAE;AAC5B,MAAI,MAAQ,EACR,QAAO,EAAc,GAAG,GAAG,EAAM;AAIrC,MAAI,MAAQ,EACR,QAAO,EAAgB,GAAG,GAAG,EAAM;AAEvC,MAAI,MAAQ,EACR,QAAO,EAAa,GAAG,GAAG,EAAM;AAEpC,MAAI,MAAQ,EACR,QAAO,EAAa,GAAG,GAAG,EAAM;AAEpC,MAAI,MAAQ,EAIR,QAAO,OAAO,EAAE,QAAS,cAAc,OAAO,EAAE,QAAS,cAAc,EAAgB,GAAG,GAAG,EAAM;AAIvG,MAAI,MAAQ,EACR,QAAO,EAAa,GAAG,GAAG,EAAM;AAIpC,MAAI,MAAQ,EACR,QAAO,EAAe,GAAG,GAAG,EAAM;AAGtC,MAAI,MAAQ,EACR,QAAO,EAAgB,GAAG,GAAG,EAAM;AAEvC,MAAI,EAAiB,GACjB,QAAO,EAAoB,GAAG,GAAG,EAAM;AAE3C,MAAI,MAAQ,EACR,QAAO,EAAqB,GAAG,GAAG,EAAM;AAE5C,MAAI,MAAQ,EACR,QAAO,EAAkB,GAAG,GAAG,EAAM;AAKzC,MAAI,MAAQ,KAAe,MAAQ,KAAc,MAAQ,EACrD,QAAO,EAA0B,GAAG,GAAG,EAAM;AAEjD,MAAI,GAAuB;GACvB,IAAI,IAAuB,EAAsB;AACjD,OAAI,CAAC,GAAsB;IACvB,IAAM,IAAW,EAAY,EAAE;AAC/B,IAAI,MACA,IAAuB,EAAsB;;AAKrD,OAAI,EACA,QAAO,EAAqB,GAAG,GAAG,EAAM;;AAchD,SAAO;;;AAMf,SAAS,EAA+B,EAAE,aAAU,uBAAoB,aAAW;CAC/E,IAAI,IAAS;EACT;EACA,gBAAgB,IAAS,IAAwB;EACjD;EACe;EACC;EACG;EACnB,cAAc,IAAS,EAAmB,GAAc,EAAsB,GAAG;EAChE;EACjB,iBAAiB,IAAS,IAAwB;EACvB;EACV;EACjB,cAAc,IAAS,EAAmB,GAAc,EAAsB,GAAG;EACjF,qBAAqB,IACf,EAAmB,GAAqB,EAAsB,GAC9D;EACQ;EACd,uBAAuB,KAAA;EAC1B;AAID,KAHI,MACA,IAAS,OAAO,OAAO,EAAE,EAAE,GAAQ,EAAmB,EAAO,CAAC,GAE9D,GAAU;EACV,IAAM,IAAiB,EAAiB,EAAO,eAAe,EACxD,IAAe,EAAiB,EAAO,aAAa,EACpD,IAAkB,EAAiB,EAAO,gBAAgB,EAC1D,IAAe,EAAiB,EAAO,aAAa;AAC1D,MAAS,OAAO,OAAO,EAAE,EAAE,GAAQ;GAC/B;GACA;GACA;GACA;GACH,CAAC;;AAEN,QAAO;;AAMX,SAAS,EAAiC,GAAS;AAC/C,QAAO,SAAU,GAAG,GAAG,GAAc,GAAc,GAAU,GAAU,GAAO;AAC1E,SAAO,EAAQ,GAAG,GAAG,EAAM;;;AAMnC,SAAS,EAAc,EAAE,aAAU,eAAY,gBAAa,WAAQ,aAAU;AAC1E,KAAI,EACA,QAAO,SAAiB,GAAG,GAAG;EAC1B,IAAM,EAAE,WAAQ,oBAAW,IAAI,SAAS,GAAG,KAAA,GAAW,YAAS,GAAa;AAC5E,SAAO,EAAW,GAAG,GAAG;GACpB;GACA;GACA;GACA;GACH,CAAC;;AAGV,KAAI,EACA,QAAO,SAAiB,GAAG,GAAG;AAC1B,SAAO,EAAW,GAAG,GAAG;GACpB,uBAAO,IAAI,SAAS;GACpB;GACA,MAAM,KAAA;GACN;GACH,CAAC;;CAGV,IAAM,IAAQ;EACV,OAAO,KAAA;EACP;EACA,MAAM,KAAA;EACN;EACH;AACD,QAAO,SAAiB,GAAG,GAAG;AAC1B,SAAO,EAAW,GAAG,GAAG,EAAM;;;AAOtC,IAAM,IAAY,GAAmB;AAIb,EAAkB,EAAE,QAAQ,IAAM,CAAC,EAIjC,EAAkB,EAAE,UAAU,IAAM,CAAC,EAK/B,EAAkB;CAC9C,UAAU;CACV,QAAQ;CACX,CAAC,EAImB,EAAkB,EACnC,gCAAgC,GACnC,CAAC,EAIyB,EAAkB;CACzC,QAAQ;CACR,gCAAgC;CACnC,CAAC,EAI2B,EAAkB;CAC3C,UAAU;CACV,gCAAgC;CACnC,CAAC,EAKiC,EAAkB;CACjD,UAAU;CACV,gCAAgC;CAChC,QAAQ;CACX,CAAC;AASF,SAAS,EAAkB,IAAU,EAAE,EAAE;CACrC,IAAM,EAAE,cAAW,IAAO,0BAA0B,GAAgC,gBAAa,YAAS,OAAW,GAE/G,IAAa,EADJ,EAA+B,EAAQ,CACH;AAInD,QAAO,EAAc;EAAE;EAAU;EAAY;EAAa,QAH3C,IACT,EAA+B,EAAW,GAC1C,EAAiC,EAAW;EACgB;EAAQ,CAAC"}
+{"version":3,"file":"index.js","names":["combineComparators","comparatorA","a","b","state","comparatorB","createIsCircular","areItemsEqual","cachedA","cache","cachedB","result","getShortTag","value","getStrictProperties","getOwnPropertyNames","object","getOwnPropertySymbols","hasOwn","hasOwnProperty","property","sameValueZeroEqual","PREACT_VNODE","PREACT_OWNER","REACT_OWNER","MAX_SCANNED_PROPERTIES","getTypedArrayTag","getOwnPropertyDescriptor","areArrayBuffersEqual","areTypedArraysEqual","areArraysEqual","index","areDataViewsEqual","areDatesEqual","areErrorsEqual","causeA","causeB","errorsA","errorsB","propertiesA","keys","propertiesB","compared","propertyIsEnumerable","remaining","areFunctionsEqual","areErrorsEqualStrict","areObjectsEqualStrict","areMapsEqual","size","matchedIndices","aIterable","aResult","bResult","bIterable","hasMatch","matchIndex","aEntry","bEntry","areNumbersEqual","areObjectsEqual","properties","isScannable","descriptorA","descriptorB","isReactProperty","arePrimitiveWrappersEqual","areRegExpsEqual","areSetsEqual","tag","areUrlsEqual","areSearchParamsEqual","serializedA","serializedB","sortSearchParams","serialized","ARRAY_BUFFER_TAG","ARGUMENTS_TAG","BOOLEAN_TAG","DATA_VIEW_TAG","DATE_TAG","ERROR_TAG","MAP_TAG","NUMBER_TAG","OBJECT_TAG","REG_EXP_TAG","SET_TAG","STRING_TAG","TYPED_ARRAY_TAGS","URL_TAG","toString","createEqualityComparator","type","constructor","unknownTagComparators","unknownTagComparator","shortTag","createEqualityComparatorConfig","config","strict","createCustomConfig","circular","createInternalEqualityComparator","compare","createIsEqual","createState","comparator","deepEqual","createCustomEqual","createCustomInternalComparator","options"],"sources":["../../../../../node_modules/fast-equals/dist/es/index.mjs"],"sourcesContent":["const { getOwnPropertyNames, getOwnPropertySymbols } = Object;\n// eslint-disable-next-line @typescript-eslint/unbound-method\nconst { hasOwnProperty } = Object.prototype;\n/**\n * Combine two comparators into a single comparators.\n */\nfunction combineComparators(comparatorA, comparatorB) {\n    return function isEqual(a, b, state) {\n        return comparatorA(a, b, state) && comparatorB(a, b, state);\n    };\n}\n/**\n * Wrap the provided `areItemsEqual` method to manage the circular state, allowing\n * for circular references to be safely included in the comparison without creating\n * stack overflows.\n */\nfunction createIsCircular(areItemsEqual) {\n    return function isCircular(a, b, state) {\n        if (!a || !b || typeof a !== 'object' || typeof b !== 'object') {\n            return areItemsEqual(a, b, state);\n        }\n        const { cache } = state;\n        const cachedA = cache.get(a);\n        const cachedB = cache.get(b);\n        if (cachedA && cachedB) {\n            return cachedA === b && cachedB === a;\n        }\n        cache.set(a, b);\n        cache.set(b, a);\n        const result = areItemsEqual(a, b, state);\n        cache.delete(a);\n        cache.delete(b);\n        return result;\n    };\n}\n/**\n * Get the `@@toStringTag` of the value, if it exists.\n */\nfunction getShortTag(value) {\n    return value != null ? value[Symbol.toStringTag] : undefined;\n}\n/**\n * Get the properties to strictly examine, which include both own properties that are\n * not enumerable and symbol properties.\n */\nfunction getStrictProperties(object) {\n    return getOwnPropertyNames(object).concat(getOwnPropertySymbols(object));\n}\n/**\n * Whether the object contains the property passed as an own property.\n */\nconst hasOwn = \n// eslint-disable-next-line @typescript-eslint/no-unnecessary-condition\nObject.hasOwn || ((object, property) => hasOwnProperty.call(object, property));\n/**\n * Whether the values passed are strictly equal or both NaN.\n */\nfunction sameValueZeroEqual(a, b) {\n    return a === b || (!a && !b && a !== a && b !== b);\n}\n\nconst PREACT_VNODE = '__v';\nconst PREACT_OWNER = '__o';\nconst REACT_OWNER = '_owner';\n/**\n * Above this many keys, out-of-position keys are checked with `propertyIsEnumerable` rather than by\n * scanning the other object's keys. Measured in V8: scanning wins up to 50 keys and loses from 100.\n */\nconst MAX_SCANNED_PROPERTIES = 64;\nconst { getOwnPropertyDescriptor, keys } = Object;\n// eslint-disable-next-line @typescript-eslint/unbound-method\nconst { propertyIsEnumerable } = Object.prototype;\n/**\n * Identify the element type of TypedArrays across realms and subclasses.\n */\n// eslint-disable-next-line @typescript-eslint/unbound-method\nconst getTypedArrayTag = getOwnPropertyDescriptor(Object.getPrototypeOf(Int8Array.prototype), Symbol.toStringTag).get;\n/**\n * Whether the array buffers are equal in value.\n */\nfunction areArrayBuffersEqual(a, b) {\n    return a.byteLength === b.byteLength && areTypedArraysEqual(new Uint8Array(a), new Uint8Array(b));\n}\n/**\n * Whether the arrays are equal in value.\n */\nfunction areArraysEqual(a, b, state) {\n    let index = a.length;\n    if (b.length !== index) {\n        return false;\n    }\n    while (index-- > 0) {\n        if (!state.equals(a[index], b[index], index, index, a, b, state)) {\n            return false;\n        }\n    }\n    return true;\n}\n/**\n * Whether the dataviews are equal in value.\n */\nfunction areDataViewsEqual(a, b) {\n    return (a.byteLength === b.byteLength\n        && areTypedArraysEqual(new Uint8Array(a.buffer, a.byteOffset, a.byteLength), new Uint8Array(b.buffer, b.byteOffset, b.byteLength)));\n}\n/**\n * Whether the dates passed are equal in value.\n */\nfunction areDatesEqual(a, b) {\n    return sameValueZeroEqual(a.getTime(), b.getTime());\n}\n/**\n * Whether the errors passed are equal in value.\n *\n * @note\n * `name`, `message` and `stack` are own properties but are not enumerable, so they are compared\n * explicitly. `cause` and `errors` are compared by value rather than by reference, matching how\n * every other nested value in the comparison is treated. They are compared exactly once, regardless\n * of whether they were assigned (enumerable) or set by the constructor (non-enumerable). Other own\n * enumerable properties (which custom `Error` subclasses commonly add) are compared afterward.\n *\n * The own property comparison is inlined rather than extracted, which measured faster in V8 when\n * recursing through `cause`. Keep the bytecode under V8's 460-byte TurboFan inlining limit (383 bytes\n * at time of writing; check with `node --print-bytecode --print-bytecode-filter=areErrorsEqual`), or\n * this stops being inlined into its callers.\n */\nfunction areErrorsEqual(a, b, state) {\n    if (a.name !== b.name || a.message !== b.message || a.stack !== b.stack) {\n        return false;\n    }\n    const causeA = a.cause;\n    const causeB = b.cause;\n    if (causeA !== causeB && !state.equals(causeA, causeB, 'cause', 'cause', a, b, state)) {\n        return false;\n    }\n    const errorsA = a.errors;\n    const errorsB = b.errors;\n    if (errorsA !== errorsB && !state.equals(errorsA, errorsB, 'errors', 'errors', a, b, state)) {\n        return false;\n    }\n    const propertiesA = keys(a);\n    const propertiesB = keys(b);\n    let index = propertiesA.length;\n    // Constructed errors rarely have enumerable own properties.\n    if (!index && !propertiesB.length) {\n        return true;\n    }\n    let compared = 0;\n    let property;\n    while (index-- > 0) {\n        property = propertiesA[index];\n        // Already compared above regardless of enumerability, so we can ignore them.\n        if (property === 'cause' || property === 'errors') {\n            continue;\n        }\n        // `propertyIsEnumerable` rather than `hasOwn`, so that a non-enumerable own property on `b` cannot\n        // stand in for an enumerable one. Keys in the same position are trivially enumerable on `b`.\n        if ((property !== propertiesB[index] && !propertyIsEnumerable.call(b, property))\n            || !state.equals(a[property], b[property], property, property, a, b, state)) {\n            return false;\n        }\n        ++compared;\n    }\n    // Every compared key is enumerable on `b`, so any of `b`'s keys left over must be `cause` / `errors`.\n    const remaining = propertiesB.length - compared;\n    return (!remaining\n        || remaining === (propertyIsEnumerable.call(b, 'cause') ? 1 : 0) + (propertyIsEnumerable.call(b, 'errors') ? 1 : 0));\n}\n/**\n * Whether the functions passed are equal in value.\n */\nfunction areFunctionsEqual(a, b) {\n    return a === b;\n}\n/**\n * Whether the errors passed are equal in value.\n *\n * @note\n * `name`, `message` and `stack` are own properties but are not enumerable, so they are compared\n * explicitly. `cause` and `errors` are own properties, so `areObjectsEqualStrict` compares them along\n * with every other own property; they are not compared explicitly to avoid comparing them twice.\n */\nfunction areErrorsEqualStrict(a, b, state) {\n    return a.name === b.name && a.message === b.message && a.stack === b.stack && areObjectsEqualStrict(a, b, state);\n}\n/**\n * Whether the `Map`s are equal in value.\n */\nfunction areMapsEqual(a, b, state) {\n    const size = a.size;\n    if (size !== b.size) {\n        return false;\n    }\n    if (!size) {\n        return true;\n    }\n    const matchedIndices = new Array(size);\n    const aIterable = a.entries();\n    let aResult;\n    let bResult;\n    let index = 0;\n    // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition\n    while ((aResult = aIterable.next())) {\n        if (aResult.done) {\n            break;\n        }\n        const bIterable = b.entries();\n        let hasMatch = false;\n        let matchIndex = 0;\n        // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition\n        while ((bResult = bIterable.next())) {\n            if (bResult.done) {\n                break;\n            }\n            if (matchedIndices[matchIndex]) {\n                matchIndex++;\n                continue;\n            }\n            const aEntry = aResult.value;\n            const bEntry = bResult.value;\n            if (state.equals(aEntry[0], bEntry[0], index, matchIndex, a, b, state)\n                && state.equals(aEntry[1], bEntry[1], aEntry[0], bEntry[0], a, b, state)) {\n                hasMatch = matchedIndices[matchIndex] = true;\n                break;\n            }\n            matchIndex++;\n        }\n        if (!hasMatch) {\n            return false;\n        }\n        index++;\n    }\n    return true;\n}\n/**\n * Whether the numbers are equal in value.\n */\nconst areNumbersEqual = sameValueZeroEqual;\n/**\n * Whether the objects are equal in value.\n */\nfunction areObjectsEqual(a, b, state) {\n    const properties = keys(a);\n    const propertiesB = keys(b);\n    let index = properties.length;\n    if (propertiesB.length !== index) {\n        return false;\n    }\n    const isScannable = index <= MAX_SCANNED_PROPERTIES;\n    let property;\n    // Decrementing `while` showed faster results than either incrementing or\n    // decrementing `for` loop and than an incrementing `while` loop. Declarative\n    // methods like `some` / `every` were not used to avoid incurring the garbage\n    // cost of anonymous callbacks.\n    while (index-- > 0) {\n        property = properties[index];\n        if (isReactProperty(a, b, property)) {\n            continue;\n        }\n        // Objects built the same way list their keys in the same order, in which case the key is\n        // already known to be an own enumerable property of `b` and the lookup can be skipped.\n        // Otherwise, `propertiesB` is exactly `b`'s own enumerable keys. Scanning it is faster than\n        // `propertyIsEnumerable` for smaller objects, but it is linear per key, so larger objects\n        // (where reordering would make it quadratic) use the lookup instead.\n        if ((property !== propertiesB[index]\n            && !(isScannable ? propertiesB.includes(property) : propertyIsEnumerable.call(b, property)))\n            || !state.equals(a[property], b[property], property, property, a, b, state)) {\n            return false;\n        }\n    }\n    return true;\n}\n/**\n * Whether the objects are equal in value with strict property checking.\n */\nfunction areObjectsEqualStrict(a, b, state) {\n    const properties = getStrictProperties(a);\n    let index = properties.length;\n    if (getStrictProperties(b).length !== index) {\n        return false;\n    }\n    let property;\n    let descriptorA;\n    let descriptorB;\n    // Decrementing `while` showed faster results than either incrementing or\n    // decrementing `for` loop and than an incrementing `while` loop. Declarative\n    // methods like `some` / `every` were not used to avoid incurring the garbage\n    // cost of anonymous callbacks.\n    while (index-- > 0) {\n        property = properties[index];\n        if (!isReactProperty(a, b, property)\n            && (!hasOwn(b, property) || !state.equals(a[property], b[property], property, property, a, b, state))) {\n            return false;\n        }\n        descriptorA = getOwnPropertyDescriptor(a, property);\n        descriptorB = getOwnPropertyDescriptor(b, property);\n        if ((descriptorA || descriptorB)\n            && (!descriptorA\n                || !descriptorB\n                || descriptorA.configurable !== descriptorB.configurable\n                || descriptorA.enumerable !== descriptorB.enumerable\n                || descriptorA.writable !== descriptorB.writable)) {\n            return false;\n        }\n    }\n    return true;\n}\n/**\n * Whether the primitive wrappers passed are equal in value.\n */\nfunction arePrimitiveWrappersEqual(a, b) {\n    return sameValueZeroEqual(a.valueOf(), b.valueOf());\n}\n/**\n * Whether the regexps passed are equal in value.\n */\nfunction areRegExpsEqual(a, b) {\n    return a.source === b.source && a.flags === b.flags;\n}\n/**\n * Whether the `Set`s are equal in value.\n */\nfunction areSetsEqual(a, b, state) {\n    const size = a.size;\n    if (size !== b.size) {\n        return false;\n    }\n    if (!size) {\n        return true;\n    }\n    const matchedIndices = new Array(size);\n    const aIterable = a.values();\n    let aResult;\n    let bResult;\n    // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition\n    while ((aResult = aIterable.next())) {\n        if (aResult.done) {\n            break;\n        }\n        const bIterable = b.values();\n        let hasMatch = false;\n        let matchIndex = 0;\n        // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition\n        while ((bResult = bIterable.next())) {\n            if (bResult.done) {\n                break;\n            }\n            if (!matchedIndices[matchIndex]\n                && state.equals(aResult.value, bResult.value, aResult.value, bResult.value, a, b, state)) {\n                hasMatch = matchedIndices[matchIndex] = true;\n                break;\n            }\n            matchIndex++;\n        }\n        if (!hasMatch) {\n            return false;\n        }\n    }\n    return true;\n}\n/**\n * Whether the TypedArray instances are equal in value.\n */\nfunction areTypedArraysEqual(a, b) {\n    let index = a.length;\n    if (b.length !== index || a.byteOffset !== b.byteOffset) {\n        return false;\n    }\n    // Only float-backed views can hold `NaN`, and the additional check needed to treat it as equal\n    // to itself measurably slows the loop, so integer views keep the plain comparison. This is\n    // hoisted out of the loop so the cost is paid once per call rather than once per element.\n    const tag = getTypedArrayTag.call(a);\n    if (tag === 'Float64Array' || tag === 'Float32Array' || tag === 'Float16Array') {\n        while (index-- > 0) {\n            // `NaN` is the only value not equal to itself, and it is treated as equal here to match\n            // the SameValueZero semantics used for every other numeric comparison in the library.\n            if (a[index] !== b[index] && (a[index] === a[index] || b[index] === b[index])) {\n                return false;\n            }\n        }\n        return true;\n    }\n    while (index-- > 0) {\n        if (a[index] !== b[index]) {\n            return false;\n        }\n    }\n    return true;\n}\n/**\n * Whether the URL instances are equal in value.\n */\nfunction areUrlsEqual(a, b) {\n    // `href` is the normalized serialization of every component, so matching hrefs are equal without\n    // any further work. Only a difference in query parameter ordering can survive a mismatch here.\n    if (a.href === b.href) {\n        return true;\n    }\n    return (a.protocol === b.protocol\n        && a.username === b.username\n        && a.password === b.password\n        // `host` covers both the hostname and the port.\n        && a.host === b.host\n        && a.pathname === b.pathname\n        && a.hash === b.hash\n        && areSearchParamsEqual(a.searchParams, b.searchParams));\n}\n/**\n * Whether the search params passed are equal in value.\n *\n * @note\n * Order is not significant, matching how the other unordered collections in the library are\n * compared. Repeated keys are, so this is a comparison of multisets rather than of sets:\n * `a=1&a=2` is equal to `a=2&a=1`, but not to `a=1&a=1`.\n */\nfunction areSearchParamsEqual(a, b) {\n    const serializedA = a.toString();\n    const serializedB = b.toString();\n    // Identical serializations are equal under any ordering, and this is by far the common case, so\n    // it is worth checking before sorting anything.\n    return serializedA === serializedB || sortSearchParams(serializedA) === sortSearchParams(serializedB);\n}\n/**\n * Reorder a serialized query string so that params holding the same pairs compare as equal\n * regardless of the order they appear in.\n *\n * @note\n * The serializer percent-encodes `&` and `=` wherever they appear inside a name or a value, so\n * splitting on `&` recovers exactly the pairs and nothing else.\n */\nfunction sortSearchParams(serialized) {\n    return serialized.split('&').sort().join('&');\n}\nfunction isReactProperty(a, b, property) {\n    return ((property === REACT_OWNER || property === PREACT_OWNER || property === PREACT_VNODE) && !!(a.$$typeof || b.$$typeof));\n}\n\nconst ARRAY_BUFFER_TAG = '[object ArrayBuffer]';\nconst ARGUMENTS_TAG = '[object Arguments]';\nconst BOOLEAN_TAG = '[object Boolean]';\nconst DATA_VIEW_TAG = '[object DataView]';\nconst DATE_TAG = '[object Date]';\nconst ERROR_TAG = '[object Error]';\nconst MAP_TAG = '[object Map]';\nconst NUMBER_TAG = '[object Number]';\nconst OBJECT_TAG = '[object Object]';\nconst REG_EXP_TAG = '[object RegExp]';\nconst SET_TAG = '[object Set]';\nconst STRING_TAG = '[object String]';\nconst TYPED_ARRAY_TAGS = {\n    '[object Int8Array]': true,\n    '[object Uint8Array]': true,\n    '[object Uint8ClampedArray]': true,\n    '[object Int16Array]': true,\n    '[object Uint16Array]': true,\n    '[object Int32Array]': true,\n    '[object Uint32Array]': true,\n    '[object Float16Array]': true,\n    '[object Float32Array]': true,\n    '[object Float64Array]': true,\n    '[object BigInt64Array]': true,\n    '[object BigUint64Array]': true,\n};\nconst URL_TAG = '[object URL]';\n// eslint-disable-next-line @typescript-eslint/unbound-method\nconst toString = Object.prototype.toString;\n/**\n * Create a comparator method based on the type-specific equality comparators passed.\n */\nfunction createEqualityComparator({ areArrayBuffersEqual, areArraysEqual, areDataViewsEqual, areDatesEqual, areErrorsEqual, areFunctionsEqual, areMapsEqual, areNumbersEqual, areObjectsEqual, arePrimitiveWrappersEqual, areRegExpsEqual, areSetsEqual, areTypedArraysEqual, areUrlsEqual, unknownTagComparators, }) {\n    /**\n     * compare the value of the two objects and return true if they are equivalent in values\n     */\n    return function comparator(a, b, state) {\n        // If the items are strictly equal, no need to do a value comparison.\n        if (a === b) {\n            return true;\n        }\n        // If either of the items are nullish and fail the strictly equal check\n        // above, then they must be unequal.\n        if (a == null || b == null) {\n            return false;\n        }\n        const type = typeof a;\n        if (type !== typeof b) {\n            return false;\n        }\n        if (type !== 'object') {\n            if (type === 'number') {\n                return areNumbersEqual(a, b, state);\n            }\n            if (type === 'function') {\n                return areFunctionsEqual(a, b, state);\n            }\n            // If a primitive value that is not strictly equal, it must be unequal.\n            return false;\n        }\n        const constructor = a.constructor;\n        // Checks are listed in order of commonality of use-case:\n        //   1. Common complex object types (plain object, array)\n        //   2. Common data values (date, regexp)\n        //   3. Less-common complex object types (map, set)\n        //   4. Less-common data values (promise, primitive wrappers)\n        // Inherently this is both subjective and assumptive, however\n        // when reviewing comparable libraries in the wild this order\n        // appears to be generally consistent.\n        // Constructors should match, otherwise there is potential for false positives\n        // between class and subclass or custom object and POJO.\n        if (constructor !== b.constructor) {\n            return false;\n        }\n        // `isPlainObject` only checks against the object's own realm. Cross-realm\n        // comparisons are rare, and will be handled in the ultimate fallback, so\n        // we can avoid capturing the string tag.\n        if (constructor === Object) {\n            return areObjectsEqual(a, b, state);\n        }\n        // `isArray()` works on subclasses and is cross-realm, so we can avoid capturing\n        // the string tag or doing an `instanceof` check.\n        if (Array.isArray(a)) {\n            return areArraysEqual(a, b, state);\n        }\n        // Try to fast-path equality checks for other complex object types in the\n        // same realm to avoid capturing the string tag. Strict equality is used\n        // instead of `instanceof` because it is more performant for the common\n        // use-case. If someone is subclassing a native class, it will be handled\n        // with the string tag comparison.\n        if (constructor === Date) {\n            return areDatesEqual(a, b, state);\n        }\n        if (constructor === RegExp) {\n            return areRegExpsEqual(a, b, state);\n        }\n        if (constructor === Map) {\n            return areMapsEqual(a, b, state);\n        }\n        if (constructor === Set) {\n            return areSetsEqual(a, b, state);\n        }\n        if (constructor == null) {\n            // Objects with a prototype of `null` are plain objects.\n            return areObjectsEqual(a, b, state);\n        }\n        // Since this is a custom object, capture the string tag to determing its type.\n        // This is reasonably performant in modern environments like v8 and SpiderMonkey.\n        const tag = toString.call(a);\n        if (tag === DATE_TAG) {\n            return areDatesEqual(a, b, state);\n        }\n        // For RegExp, the properties are not enumerable, and therefore will give false positives if\n        // tested like a standard object.\n        if (tag === REG_EXP_TAG) {\n            return areRegExpsEqual(a, b, state);\n        }\n        if (tag === MAP_TAG) {\n            return areMapsEqual(a, b, state);\n        }\n        if (tag === SET_TAG) {\n            return areSetsEqual(a, b, state);\n        }\n        if (tag === OBJECT_TAG) {\n            // The exception for value comparison is custom `Promise`-like class instances. These should\n            // be treated the same as standard `Promise` objects, which means strict equality, and if\n            // it reaches this point then that strict equality comparison has already failed.\n            return typeof a.then !== 'function' && typeof b.then !== 'function' && areObjectsEqual(a, b, state);\n        }\n        // If a URL tag, it should be tested explicitly. Like RegExp, the properties are not\n        // enumerable, and therefore will give false positives if tested like a standard object.\n        if (tag === URL_TAG) {\n            return areUrlsEqual(a, b, state);\n        }\n        // If an error tag, it should be tested explicitly. Like RegExp, the properties are not\n        // enumerable, and therefore will give false positives if tested like a standard object.\n        if (tag === ERROR_TAG) {\n            return areErrorsEqual(a, b, state);\n        }\n        // If an arguments tag, it should be treated as a standard object.\n        if (tag === ARGUMENTS_TAG) {\n            return areObjectsEqual(a, b, state);\n        }\n        if (TYPED_ARRAY_TAGS[tag]) {\n            return areTypedArraysEqual(a, b, state);\n        }\n        if (tag === ARRAY_BUFFER_TAG) {\n            return areArrayBuffersEqual(a, b, state);\n        }\n        if (tag === DATA_VIEW_TAG) {\n            return areDataViewsEqual(a, b, state);\n        }\n        // As the penultimate fallback, check if the values passed are primitive wrappers. This\n        // is very rare in modern JS, which is why it is deprioritized compared to all other object\n        // types.\n        if (tag === BOOLEAN_TAG || tag === NUMBER_TAG || tag === STRING_TAG) {\n            return arePrimitiveWrappersEqual(a, b, state);\n        }\n        if (unknownTagComparators) {\n            let unknownTagComparator = unknownTagComparators[tag];\n            if (!unknownTagComparator) {\n                const shortTag = getShortTag(a);\n                if (shortTag) {\n                    unknownTagComparator = unknownTagComparators[shortTag];\n                }\n            }\n            // If the custom config has an unknown tag comparator that matches the captured tag or the\n            // @@toStringTag, it is the source of truth for whether the values are equal.\n            if (unknownTagComparator) {\n                return unknownTagComparator(a, b, state);\n            }\n        }\n        // If not matching any tags that require a specific type of comparison, then we hard-code false because\n        // the only thing remaining is strict equality, which has already been compared. This is for a few reasons:\n        //   - Certain types that cannot be introspected (e.g., `WeakMap`). For these types, this is the only\n        //     comparison that can be made.\n        //   - For types that can be introspected, but rarely have requirements to be compared\n        //     (`ArrayBuffer`, `DataView`, etc.), the cost is avoided to prioritize the common\n        //     use-cases (may be included in a future release, if requested enough).\n        //   - For types that can be introspected but do not have an objective definition of what\n        //     equality is (`Error`, etc.), the subjective decision is to be conservative and strictly compare.\n        // In all cases, these decisions should be reevaluated based on changes to the language and\n        // common development practices.\n        return false;\n    };\n}\n/**\n * Create the configuration object used for building comparators.\n */\nfunction createEqualityComparatorConfig({ circular, createCustomConfig, strict, }) {\n    let config = {\n        areArrayBuffersEqual,\n        areArraysEqual: strict ? areObjectsEqualStrict : areArraysEqual,\n        areDataViewsEqual,\n        areDatesEqual: areDatesEqual,\n        // `name` / `message` / `stack` / `cause` / `errors` are not enumerable (unless assigned), which is why\n        // errors need a comparator of their own rather than being treated as plain objects. Each variant also\n        // compares the own properties that `Error` subclasses routinely carry (`status`, `code`, ...):\n        // enumerable ones in loose mode, and all of them (via `areObjectsEqualStrict`) in strict mode.\n        areErrorsEqual: strict ? areErrorsEqualStrict : areErrorsEqual,\n        areFunctionsEqual: areFunctionsEqual,\n        areMapsEqual: strict ? combineComparators(areMapsEqual, areObjectsEqualStrict) : areMapsEqual,\n        areNumbersEqual: areNumbersEqual,\n        areObjectsEqual: strict ? areObjectsEqualStrict : areObjectsEqual,\n        arePrimitiveWrappersEqual: arePrimitiveWrappersEqual,\n        areRegExpsEqual: areRegExpsEqual,\n        areSetsEqual: strict ? combineComparators(areSetsEqual, areObjectsEqualStrict) : areSetsEqual,\n        areTypedArraysEqual: strict\n            ? combineComparators(areTypedArraysEqual, areObjectsEqualStrict)\n            : areTypedArraysEqual,\n        areUrlsEqual: areUrlsEqual,\n        unknownTagComparators: undefined,\n    };\n    if (createCustomConfig) {\n        config = Object.assign({}, config, createCustomConfig(config));\n    }\n    if (circular) {\n        const areArraysEqual = createIsCircular(config.areArraysEqual);\n        // Errors are included because comparing `cause` and own properties by value means an error\n        // that references itself would otherwise recurse without bound.\n        const areErrorsEqual = createIsCircular(config.areErrorsEqual);\n        const areMapsEqual = createIsCircular(config.areMapsEqual);\n        const areObjectsEqual = createIsCircular(config.areObjectsEqual);\n        const areSetsEqual = createIsCircular(config.areSetsEqual);\n        config = Object.assign({}, config, {\n            areArraysEqual,\n            areErrorsEqual,\n            areMapsEqual,\n            areObjectsEqual,\n            areSetsEqual,\n        });\n    }\n    return config;\n}\n/**\n * Default equality comparator pass-through, used as the standard `isEqual` creator for\n * use inside the built comparator.\n */\nfunction createInternalEqualityComparator(compare) {\n    return function (a, b, _indexOrKeyA, _indexOrKeyB, _parentA, _parentB, state) {\n        return compare(a, b, state);\n    };\n}\n/**\n * Create the `isEqual` function used by the consuming application.\n */\nfunction createIsEqual({ circular, comparator, createState, equals, strict }) {\n    if (createState) {\n        return function isEqual(a, b) {\n            const { cache = circular ? new WeakMap() : undefined, meta } = createState();\n            return comparator(a, b, {\n                cache,\n                equals,\n                meta,\n                strict,\n            });\n        };\n    }\n    if (circular) {\n        return function isEqual(a, b) {\n            return comparator(a, b, {\n                cache: new WeakMap(),\n                equals,\n                meta: undefined,\n                strict,\n            });\n        };\n    }\n    const state = {\n        cache: undefined,\n        equals,\n        meta: undefined,\n        strict,\n    };\n    return function isEqual(a, b) {\n        return comparator(a, b, state);\n    };\n}\n\n/**\n * Whether the items passed are deeply-equal in value.\n */\nconst deepEqual = createCustomEqual();\n/**\n * Whether the items passed are deeply-equal in value based on strict comparison.\n */\nconst strictDeepEqual = createCustomEqual({ strict: true });\n/**\n * Whether the items passed are deeply-equal in value, including circular references.\n */\nconst circularDeepEqual = createCustomEqual({ circular: true });\n/**\n * Whether the items passed are deeply-equal in value, including circular references,\n * based on strict comparison.\n */\nconst strictCircularDeepEqual = createCustomEqual({\n    circular: true,\n    strict: true,\n});\n/**\n * Whether the items passed are shallowly-equal in value.\n */\nconst shallowEqual = createCustomEqual({\n    createInternalComparator: () => sameValueZeroEqual,\n});\n/**\n * Whether the items passed are shallowly-equal in value based on strict comparison\n */\nconst strictShallowEqual = createCustomEqual({\n    strict: true,\n    createInternalComparator: () => sameValueZeroEqual,\n});\n/**\n * Whether the items passed are shallowly-equal in value, including circular references.\n */\nconst circularShallowEqual = createCustomEqual({\n    circular: true,\n    createInternalComparator: () => sameValueZeroEqual,\n});\n/**\n * Whether the items passed are shallowly-equal in value, including circular references,\n * based on strict comparison.\n */\nconst strictCircularShallowEqual = createCustomEqual({\n    circular: true,\n    createInternalComparator: () => sameValueZeroEqual,\n    strict: true,\n});\n/**\n * Create a custom equality comparison method.\n *\n * This can be done to create very targeted comparisons in extreme hot-path scenarios\n * where the standard methods are not performant enough, but can also be used to provide\n * support for legacy environments that do not support expected features like\n * `RegExp.prototype.flags` out of the box.\n */\nfunction createCustomEqual(options = {}) {\n    const { circular = false, createInternalComparator: createCustomInternalComparator, createState, strict = false, } = options;\n    const config = createEqualityComparatorConfig(options);\n    const comparator = createEqualityComparator(config);\n    const equals = createCustomInternalComparator\n        ? createCustomInternalComparator(comparator)\n        : createInternalEqualityComparator(comparator);\n    return createIsEqual({ circular, comparator, createState, equals, strict });\n}\n\nexport { circularDeepEqual, circularShallowEqual, createCustomEqual, deepEqual, sameValueZeroEqual, shallowEqual, strictCircularDeepEqual, strictCircularShallowEqual, strictDeepEqual, strictShallowEqual };\n//# sourceMappingURL=index.mjs.map\n"],"ignoreList":[0],"mappings":";AAAA,IAAM,EAAE,wBAAqB,6BAA0B,QAEjD,EAAE,sBAAmB,OAAO;AAIlC,SAASA,EAAmB,GAAa,GAAa;CAClD,OAAO,SAAiB,GAAG,GAAG,GAAO;EACjC,OAAOC,EAAYC,GAAGC,GAAGC,CAAK,KAAKC,EAAYH,GAAGC,GAAGC,CAAK;CAC9D;AACJ;AAMA,SAASE,EAAiB,GAAe;CACrC,OAAO,SAAoB,GAAG,GAAG,GAAO;EACpC,IAAI,CAACJ,KAAK,CAACC,KAAK,OAAOD,KAAM,YAAY,OAAOC,KAAM,UAClD,OAAOI,EAAcL,GAAGC,GAAGC,CAAK;EAEpC,IAAM,EAAE,aAAUA,GACZI,IAAUC,EAAM,IAAIP,CAAC,GACrBQ,IAAUD,EAAM,IAAIN,CAAC;EAC3B,IAAIK,KAAWE,GACX,OAAOF,MAAYL,KAAKO,MAAYR;EAGxC,AADAO,EAAM,IAAIP,GAAGC,CAAC,GACdM,EAAM,IAAIN,GAAGD,CAAC;EACd,IAAMS,IAASJ,EAAcL,GAAGC,GAAGC,CAAK;EAGxC,OAFAK,EAAM,OAAOP,CAAC,GACdO,EAAM,OAAON,CAAC,GACPQ;CACX;AACJ;AAIA,SAASC,EAAY,GAAO;CACxB,OAAOC,IAAsB,OAAO;AACxC;AAKA,SAASC,EAAoB,GAAQ;CACjC,OAAOC,EAAoBC,CAAM,CAAC,CAAC,OAAOC,EAAsBD,CAAM,CAAC;AAC3E;AAIA,IAAME,IAEN,OAAO,YAAY,GAAQ,MAAaC,EAAe,KAAKH,GAAQI,CAAQ;AAI5E,SAASC,EAAmB,GAAG,GAAG;CAC9B,OAAOnB,MAAMC,KAAM,CAACD,KAAK,CAACC,KAAKD,MAAMA,KAAKC,MAAMA;AACpD;AAEA,IAAMmB,IAAe,OACfC,IAAe,OACfC,IAAc,UAKdC,IAAyB,IACzB,EAAE,6BAA0B,YAAS,QAErC,EAAE,4BAAyB,OAAO,WAKlCC,IAAmBC,EAAyB,OAAO,eAAe,UAAU,SAAS,GAAG,OAAO,WAAW,CAAC,CAAC;AAIlH,SAASC,EAAqB,GAAG,GAAG;CAChC,OAAO1B,EAAE,eAAeC,EAAE,cAAc0B,EAAoB,IAAI,WAAW3B,CAAC,GAAG,IAAI,WAAWC,CAAC,CAAC;AACpG;AAIA,SAAS2B,EAAe,GAAG,GAAG,GAAO;CACjC,IAAIC,IAAQ7B,EAAE;CACd,IAAIC,EAAE,WAAW4B,GACb,OAAO;CAEX,OAAO,MAAU,IACb,IAAI,CAAC3B,EAAM,OAAOF,EAAE6B,IAAQ5B,EAAE4B,IAAQA,GAAOA,GAAO7B,GAAGC,GAAGC,CAAK,GAC3D,OAAO;CAGf,OAAO;AACX;AAIA,SAAS4B,EAAkB,GAAG,GAAG;CAC7B,OAAQ9B,EAAE,eAAeC,EAAE,cACpB0B,EAAoB,IAAI,WAAW3B,EAAE,QAAQA,EAAE,YAAYA,EAAE,UAAU,GAAG,IAAI,WAAWC,EAAE,QAAQA,EAAE,YAAYA,EAAE,UAAU,CAAC;AACzI;AAIA,SAAS8B,EAAc,GAAG,GAAG;CACzB,OAAOZ,EAAmBnB,EAAE,QAAQ,GAAGC,EAAE,QAAQ,CAAC;AACtD;AAgBA,SAAS+B,EAAe,GAAG,GAAG,GAAO;CACjC,IAAIhC,EAAE,SAASC,EAAE,QAAQD,EAAE,YAAYC,EAAE,WAAWD,EAAE,UAAUC,EAAE,OAC9D,OAAO;CAEX,IAAMgC,IAASjC,EAAE,OACXkC,IAASjC,EAAE;CACjB,IAAIgC,MAAWC,KAAU,CAAChC,EAAM,OAAO+B,GAAQC,GAAQ,SAAS,SAASlC,GAAGC,GAAGC,CAAK,GAChF,OAAO;CAEX,IAAMiC,IAAUnC,EAAE,QACZoC,IAAUnC,EAAE;CAClB,IAAIkC,MAAYC,KAAW,CAAClC,EAAM,OAAOiC,GAASC,GAAS,UAAU,UAAUpC,GAAGC,GAAGC,CAAK,GACtF,OAAO;CAEX,IAAMmC,IAAcC,EAAKtC,CAAC,GACpBuC,IAAcD,EAAKrC,CAAC,GACtB4B,IAAQQ,EAAY;CAExB,IAAI,CAACR,KAAS,CAACU,EAAY,QACvB,OAAO;CAEX,IAAIC,IAAW,GACXtB;CACJ,OAAO,MAAU,IAGb,IAFA,IAAWmB,EAAYR,IAEnBX,MAAa,WAAWA,MAAa,UAKzC;MAAKA,MAAaqB,EAAYV,MAAU,CAACY,EAAqB,KAAKxC,GAAGiB,CAAQ,KACvE,CAAChB,EAAM,OAAOF,EAAEkB,IAAWjB,EAAEiB,IAAWA,GAAUA,GAAUlB,GAAGC,GAAGC,CAAK,GAC1E,OAAO;EAEX,EAAEsC;CAFS;CAKf,IAAME,IAAYH,EAAY,SAASC;CACvC,OAAQ,CAACE,KACFA,MAAe,KAAqB,KAAKzC,GAAG,OAAO,IAAc,KAAqB,KAAKA,GAAG,QAAQ;AACjH;AAIA,SAAS0C,EAAkB,GAAG,GAAG;CAC7B,OAAO3C,MAAMC;AACjB;AASA,SAAS2C,EAAqB,GAAG,GAAG,GAAO;CACvC,OAAO5C,EAAE,SAASC,EAAE,QAAQD,EAAE,YAAYC,EAAE,WAAWD,EAAE,UAAUC,EAAE,SAAS4C,EAAsB7C,GAAGC,GAAGC,CAAK;AACnH;AAIA,SAAS4C,EAAa,GAAG,GAAG,GAAO;CAC/B,IAAMC,IAAO/C,EAAE;CACf,IAAI+C,MAAS9C,EAAE,MACX,OAAO;CAEX,IAAI,CAAC8C,GACD,OAAO;CAEX,IAAMC,IAAqB,MAAMD,CAAI,GAC/BE,IAAYjD,EAAE,QAAQ,GACxBkD,GACAC,GACAtB,IAAQ;CAEZ,QAAQ,IAAUoB,EAAU,KAAK,MACzB,GAAQ,OADqB;EAIjC,IAAMG,IAAYnD,EAAE,QAAQ,GACxBoD,IAAW,IACXC,IAAa;EAEjB,QAAQ,IAAUF,EAAU,KAAK,MACzB,GAAQ,OADqB;GAIjC,IAAIJ,EAAeM,IAAa;IAC5B;IACA;GACJ;GACA,IAAMC,IAASL,EAAQ,OACjBM,IAASL,EAAQ;GACvB,IAAIjD,EAAM,OAAOqD,EAAO,IAAIC,EAAO,IAAI3B,GAAOyB,GAAYtD,GAAGC,GAAGC,CAAK,KAC9DA,EAAM,OAAOqD,EAAO,IAAIC,EAAO,IAAID,EAAO,IAAIC,EAAO,IAAIxD,GAAGC,GAAGC,CAAK,GAAG;IAC1E,IAAW,EAAeoD,KAAc;IACxC;GACJ;GACA;EACJ;EACA,IAAI,CAACD,GACD,OAAO;EAEX;CACJ;CACA,OAAO;AACX;AAIA,IAAMI,IAAkBtC;AAIxB,SAASuC,EAAgB,GAAG,GAAG,GAAO;CAClC,IAAMC,IAAarB,EAAKtC,CAAC,GACnBuC,IAAcD,EAAKrC,CAAC,GACtB4B,IAAQ8B,EAAW;CACvB,IAAIpB,EAAY,WAAWV,GACvB,OAAO;CAEX,IAAM+B,IAAc/B,KAASN,GACzBL;CAKJ,OAAO,MAAU,IAEb,IADA,IAAWyC,EAAW9B,IAClB,GAAgB7B,GAAGC,GAAGiB,CAAQ,MAQ7BA,MAAaqB,EAAYV,MACvB,EAAE+B,IAAcrB,EAAY,SAASrB,CAAQ,IAAIuB,EAAqB,KAAKxC,GAAGiB,CAAQ,MACtF,CAAChB,EAAM,OAAOF,EAAEkB,IAAWjB,EAAEiB,IAAWA,GAAUA,GAAUlB,GAAGC,GAAGC,CAAK,IAC1E,OAAO;CAGf,OAAO;AACX;AAIA,SAAS2C,EAAsB,GAAG,GAAG,GAAO;CACxC,IAAMc,IAAa/C,EAAoBZ,CAAC,GACpC6B,IAAQ8B,EAAW;CACvB,IAAI/C,EAAoBX,CAAC,CAAC,CAAC,WAAW4B,GAClC,OAAO;CAEX,IAAIX,GACA2C,GACAC;CAKJ,OAAO,MAAU,IAQb,IAPA,IAAWH,EAAW9B,IAClB,CAACkC,EAAgB/D,GAAGC,GAAGiB,CAAQ,MAC3B,CAACF,EAAOf,GAAGiB,CAAQ,KAAK,CAAChB,EAAM,OAAOF,EAAEkB,IAAWjB,EAAEiB,IAAWA,GAAUA,GAAUlB,GAAGC,GAAGC,CAAK,OAGvG,IAAcuB,EAAyBzB,GAAGkB,CAAQ,GAClD,IAAcO,EAAyBxB,GAAGiB,CAAQ,IAC7C2C,KAAeC,OACZ,CAACD,KACE,CAACC,KACDD,EAAY,iBAAiBC,EAAY,gBACzCD,EAAY,eAAeC,EAAY,cACvCD,EAAY,aAAaC,EAAY,YAC5C,OAAO;CAGf,OAAO;AACX;AAIA,SAASE,EAA0B,GAAG,GAAG;CACrC,OAAO7C,EAAmBnB,EAAE,QAAQ,GAAGC,EAAE,QAAQ,CAAC;AACtD;AAIA,SAASgE,GAAgB,GAAG,GAAG;CAC3B,OAAOjE,EAAE,WAAWC,EAAE,UAAUD,EAAE,UAAUC,EAAE;AAClD;AAIA,SAASiE,EAAa,GAAG,GAAG,GAAO;CAC/B,IAAMnB,IAAO/C,EAAE;CACf,IAAI+C,MAAS9C,EAAE,MACX,OAAO;CAEX,IAAI,CAAC8C,GACD,OAAO;CAEX,IAAMC,IAAqB,MAAMD,CAAI,GAC/BE,IAAYjD,EAAE,OAAO,GACvBkD,GACAC;CAEJ,QAAQ,IAAUF,EAAU,KAAK,MACzB,GAAQ,OADqB;EAIjC,IAAMG,IAAYnD,EAAE,OAAO,GACvBoD,IAAW,IACXC,IAAa;EAEjB,QAAQ,IAAUF,EAAU,KAAK,MACzB,GAAQ,OADqB;GAIjC,IAAI,CAACJ,EAAeM,MACbpD,EAAM,OAAOgD,EAAQ,OAAOC,EAAQ,OAAOD,EAAQ,OAAOC,EAAQ,OAAOnD,GAAGC,GAAGC,CAAK,GAAG;IAC1F,IAAW,EAAeoD,KAAc;IACxC;GACJ;GACA;EACJ;EACA,IAAI,CAACD,GACD,OAAO;CAEf;CACA,OAAO;AACX;AAIA,SAAS1B,EAAoB,GAAG,GAAG;CAC/B,IAAIE,IAAQ7B,EAAE;CACd,IAAIC,EAAE,WAAW4B,KAAS7B,EAAE,eAAeC,EAAE,YACzC,OAAO;CAKX,IAAMkE,IAAM3C,EAAiB,KAAKxB,CAAC;CACnC,IAAImE,MAAQ,kBAAkBA,MAAQ,kBAAkBA,MAAQ,gBAAgB;EAC5E,OAAO,MAAU,IAGb,IAAInE,EAAE6B,OAAW5B,EAAE4B,OAAW7B,EAAE6B,OAAW7B,EAAE6B,MAAU5B,EAAE4B,OAAW5B,EAAE4B,KAClE,OAAO;EAGf,OAAO;CACX;CACA,OAAO,MAAU,IACb,IAAI7B,EAAE6B,OAAW5B,EAAE4B,IACf,OAAO;CAGf,OAAO;AACX;AAIA,SAASuC,EAAa,GAAG,GAAG;CAMxB,OAHIpE,EAAE,SAASC,EAAE,QAGTD,EAAE,aAAaC,EAAE,YAClBD,EAAE,aAAaC,EAAE,YACjBD,EAAE,aAAaC,EAAE,YAEjBD,EAAE,SAASC,EAAE,QACbD,EAAE,aAAaC,EAAE,YACjBD,EAAE,SAASC,EAAE,QACboE,EAAqBrE,EAAE,cAAcC,EAAE,YAAY;AAC9D;AASA,SAASoE,EAAqB,GAAG,GAAG;CAChC,IAAMC,IAActE,EAAE,SAAS,GACzBuE,IAActE,EAAE,SAAS;CAG/B,OAAOqE,MAAgBC,KAAeC,EAAiBF,CAAW,MAAME,EAAiBD,CAAW;AACxG;AASA,SAASC,EAAiB,GAAY;CAClC,OAAOC,EAAW,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG;AAChD;AACA,SAASV,EAAgB,GAAG,GAAG,GAAU;CACrC,QAAS7C,MAAaI,KAAeJ,MAAaG,KAAgBH,MAAaE,MAAiB,CAAC,EAAEpB,EAAE,YAAYC,EAAE;AACvH;AAEA,IAAMyE,IAAmB,wBACnBC,IAAgB,sBAChBC,IAAc,oBACdC,IAAgB,qBAChBC,IAAW,iBACXC,IAAY,kBACZC,IAAU,gBACVC,IAAa,mBACbC,IAAa,mBACbC,IAAc,mBACdC,IAAU,gBACVC,IAAa,mBACbC,IAAmB;CACrB,sBAAsB;CACtB,uBAAuB;CACvB,8BAA8B;CAC9B,uBAAuB;CACvB,wBAAwB;CACxB,uBAAuB;CACvB,wBAAwB;CACxB,yBAAyB;CACzB,yBAAyB;CACzB,yBAAyB;CACzB,0BAA0B;CAC1B,2BAA2B;AAC/B,GACMC,IAAU,gBAEVC,IAAW,OAAO,UAAU;AAIlC,SAASC,EAAyB,EAAE,yBAAsB,mBAAgB,sBAAmB,kBAAe,mBAAgB,sBAAmB,iBAAc,oBAAiB,oBAAiB,8BAA2B,oBAAiB,iBAAc,wBAAqB,iBAAc,4BAA0B;CAIlT,OAAO,SAAoB,GAAG,GAAG,GAAO;EAEpC,IAAIzF,MAAMC,GACN,OAAO;EAIX,IAAID,KAAK,QAAQC,KAAK,MAClB,OAAO;EAEX,IAAMyF,IAAO,OAAO1F;EACpB,IAAI0F,MAAS,OAAOzF,GAChB,OAAO;EAEX,IAAIyF,MAAS,UAQT,OAPIA,MAAS,WACFjC,EAAgBzD,GAAGC,GAAGC,CAAK,IAElCwF,MAAS,cACF/C,EAAkB3C,GAAGC,GAAGC,CAAK;EAK5C,IAAMyF,IAAc3F,EAAE;EAWtB,IAAI2F,MAAgB1F,EAAE,aAClB,OAAO;EAKX,IAAI0F,MAAgB,QAChB,OAAOjC,EAAgB1D,GAAGC,GAAGC,CAAK;EAItC,IAAI,MAAM,QAAQF,CAAC,GACf,OAAO4B,EAAe5B,GAAGC,GAAGC,CAAK;EAOrC,IAAIyF,MAAgB,MAChB,OAAO5D,EAAc/B,GAAGC,GAAGC,CAAK;EAEpC,IAAIyF,MAAgB,QAChB,OAAO1B,EAAgBjE,GAAGC,GAAGC,CAAK;EAEtC,IAAIyF,MAAgB,KAChB,OAAO7C,EAAa9C,GAAGC,GAAGC,CAAK;EAEnC,IAAIyF,MAAgB,KAChB,OAAOzB,EAAalE,GAAGC,GAAGC,CAAK;EAEnC,IAAIyF,KAAe,MAEf,OAAOjC,EAAgB1D,GAAGC,GAAGC,CAAK;EAItC,IAAMiE,IAAMqB,EAAS,KAAKxF,CAAC;EAC3B,IAAImE,MAAQW,GACR,OAAO/C,EAAc/B,GAAGC,GAAGC,CAAK;EAIpC,IAAIiE,MAAQgB,GACR,OAAOlB,EAAgBjE,GAAGC,GAAGC,CAAK;EAEtC,IAAIiE,MAAQa,GACR,OAAOlC,EAAa9C,GAAGC,GAAGC,CAAK;EAEnC,IAAIiE,MAAQiB,GACR,OAAOlB,EAAalE,GAAGC,GAAGC,CAAK;EAEnC,IAAIiE,MAAQe,GAIR,OAAO,OAAOlF,EAAE,QAAS,cAAc,OAAOC,EAAE,QAAS,cAAcyD,EAAgB1D,GAAGC,GAAGC,CAAK;EAItG,IAAIiE,MAAQoB,GACR,OAAOnB,EAAapE,GAAGC,GAAGC,CAAK;EAInC,IAAIiE,MAAQY,GACR,OAAO/C,EAAehC,GAAGC,GAAGC,CAAK;EAGrC,IAAIiE,MAAQQ,GACR,OAAOjB,EAAgB1D,GAAGC,GAAGC,CAAK;EAEtC,IAAIoF,EAAiBnB,IACjB,OAAOxC,EAAoB3B,GAAGC,GAAGC,CAAK;EAE1C,IAAIiE,MAAQO,GACR,OAAOhD,EAAqB1B,GAAGC,GAAGC,CAAK;EAE3C,IAAIiE,MAAQU,GACR,OAAO/C,EAAkB9B,GAAGC,GAAGC,CAAK;EAKxC,IAAIiE,MAAQS,KAAeT,MAAQc,KAAcd,MAAQkB,GACrD,OAAOrB,EAA0BhE,GAAGC,GAAGC,CAAK;EAEhD,IAAI0F,GAAuB;GACvB,IAAIC,IAAuBD,EAAsBzB;GACjD,IAAI,CAAC0B,GAAsB;IACvB,IAAMC,IAAWpF,EAAYV,CAAC;IAC9B,AAAI8F,MACA,IAAuBF,EAAsBE;GAErD;GAGA,IAAID,GACA,OAAOA,EAAqB7F,GAAGC,GAAGC,CAAK;EAE/C;EAYA,OAAO;CACX;AACJ;AAIA,SAAS6F,EAA+B,EAAE,aAAU,uBAAoB,aAAW;CAC/E,IAAIC,IAAS;EACT;EACA,gBAAgBC,IAASpD,IAAwBjB;EACjD;EACe;EAKf,gBAAgBqE,IAASrD,IAAuBZ;EAC7B;EACnB,cAAciE,IAASnG,EAAmBgD,GAAcD,CAAqB,IAAIC;EAChE;EACjB,iBAAiBmD,IAASpD,IAAwBa;EACvB;EACV;EACjB,cAAcuC,IAASnG,EAAmBoE,GAAcrB,CAAqB,IAAIqB;EACjF,qBAAqB+B,IACfnG,EAAmB6B,GAAqBkB,CAAqB,IAC7DlB;EACQ;EACd,uBAAuB,KAAA;CAC3B;CAIA,IAHIuE,MACA,IAAS,OAAO,OAAO,CAAC,GAAGF,GAAQE,EAAmBF,CAAM,CAAC,IAE7DG,GAAU;EACV,IAAMvE,IAAiBxB,EAAiB4F,EAAO,cAAc,GAGvDhE,IAAiB5B,EAAiB4F,EAAO,cAAc,GACvDlD,IAAe1C,EAAiB4F,EAAO,YAAY,GACnDtC,IAAkBtD,EAAiB4F,EAAO,eAAe,GACzD9B,IAAe9D,EAAiB4F,EAAO,YAAY;EACzD,IAAS,OAAO,OAAO,CAAC,GAAGA,GAAQ;GAC/B;GACA;GACA;GACA;GACA;EACJ,CAAC;CACL;CACA,OAAOA;AACX;AAKA,SAASI,EAAiC,GAAS;CAC/C,OAAO,SAAU,GAAG,GAAG,GAAc,GAAc,GAAU,GAAU,GAAO;EAC1E,OAAOC,EAAQrG,GAAGC,GAAGC,CAAK;CAC9B;AACJ;AAIA,SAASoG,GAAc,EAAE,aAAU,eAAY,gBAAa,WAAQ,aAAU;CAC1E,IAAIC,GACA,OAAO,SAAiB,GAAG,GAAG;EAC1B,IAAM,EAAE,WAAQJ,oBAAW,IAAI,QAAQ,IAAI,KAAA,GAAW,YAASI,EAAY;EAC3E,OAAOC,EAAW,GAAGvG,GAAG;GACpB;GACA;GACA;GACA;EACJ,CAAC;CACL;CAEJ,IAAIkG,GACA,OAAO,SAAiB,GAAG,GAAG;EAC1B,OAAOK,EAAWxG,GAAGC,GAAG;GACpB,uBAAO,IAAI,QAAQ;GACnB;GACA,MAAM,KAAA;GACN;EACJ,CAAC;CACL;CAEJ,IAAMC,IAAQ;EACV,OAAO,KAAA;EACP;EACA,MAAM,KAAA;EACN;CACJ;CACA,OAAO,SAAiB,GAAG,GAAG;EAC1B,OAAOsG,EAAWxG,GAAGC,GAAGC,CAAK;CACjC;AACJ;AAKA,IAAMuG,KAAYC,EAAkB;AAIZA,EAAkB,EAAE,QAAQ,GAAK,CAAC,GAIhCA,EAAkB,EAAE,UAAU,GAAK,CAAC,GAK9BA,EAAkB;CAC9C,UAAU;CACV,QAAQ;AACZ,CAAC,GAIoBA,EAAkB,EACnC,gCAAgCvF,EACpC,CAAC,GAI0BuF,EAAkB;CACzC,QAAQ;CACR,gCAAgCvF;AACpC,CAAC,GAI4BuF,EAAkB;CAC3C,UAAU;CACV,gCAAgCvF;AACpC,CAAC,GAKkCuF,EAAkB;CACjD,UAAU;CACV,gCAAgCvF;CAChC,QAAQ;AACZ,CAAC;AASD,SAASuF,EAAkB,IAAU,CAAC,GAAG;CACrC,IAAM,EAAE,cAAW,IAAO,0BAA0BC,GAAgC,gBAAa,YAAS,OAAWC,GAE/GJ,IAAaf,EADJM,EAA+Ba,CACG,CAAC;CAIlD,OAAON,GAAc;EAAE;EAAU;EAAY;EAAa,QAH3CK,IACTA,EAA+BH,CAAU,IACzCJ,EAAiCI,CAAU;EACiB;CAAO,CAAC;AAC9E"}