laif-ds
Version:
Design System di Laif con componenti React basati su principi di Atomic Design
53 lines (52 loc) • 1.68 kB
JavaScript
"use client";
import { __require as V } from "./_Symbol.js";
import { __require as z } from "./_Uint8Array.js";
import { __require as C } from "./eq.js";
import { __require as G } from "./_equalArrays.js";
import { __require as N } from "./_mapToArray.js";
import { __require as F } from "./_setToArray.js";
var f, l;
function X() {
if (l) return f;
l = 1;
var n = V(), t = z(), m = C(), q = G(), T = N(), p = F(), A = 1, o = 2, b = "[object Boolean]", v = "[object Date]", d = "[object Error]", B = "[object Map]", E = "[object Number]", L = "[object RegExp]", O = "[object Set]", R = "[object String]", c = "[object Symbol]", w = "[object ArrayBuffer]", S = "[object DataView]", y = n ? n.prototype : void 0, i = y ? y.valueOf : void 0;
function D(r, e, P, s, x, g, a) {
switch (P) {
case S:
if (r.byteLength != e.byteLength || r.byteOffset != e.byteOffset)
return !1;
r = r.buffer, e = e.buffer;
case w:
return !(r.byteLength != e.byteLength || !g(new t(r), new t(e)));
case b:
case v:
case E:
return m(+r, +e);
case d:
return r.name == e.name && r.message == e.message;
case L:
case R:
return r == e + "";
case B:
var u = T;
case O:
var M = s & A;
if (u || (u = p), r.size != e.size && !M)
return !1;
var _ = a.get(r);
if (_)
return _ == e;
s |= o, a.set(r, e);
var U = q(u(r), u(e), s, x, g, a);
return a.delete(r), U;
case c:
if (i)
return i.call(r) == i.call(e);
}
return !1;
}
return f = D, f;
}
export {
X as __require
};