laif-ds
Version:
Design System di Laif con componenti React basati su principi di Atomic Design
51 lines (50 loc) • 1.59 kB
JavaScript
"use client";
import o from "../../../../_virtual/get.js";
var l = (r) => r === 0 ? 0 : r > 0 ? 1 : -1, f = (r) => typeof r == "number" && r != +r, g = (r) => typeof r == "string" && r.indexOf("%") === r.length - 1, u = (r) => (typeof r == "number" || r instanceof Number) && !f(r), h = (r) => u(r) || typeof r == "string", c = 0, p = (r) => {
var n = ++c;
return "".concat(r || "").concat(n);
}, v = function(n, e) {
var t = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : 0, a = arguments.length > 3 && arguments[3] !== void 0 ? arguments[3] : !1;
if (!u(n) && typeof n != "string")
return t;
var i;
if (g(n)) {
if (e == null)
return t;
var s = n.indexOf("%");
i = e * parseFloat(n.slice(0, s)) / 100;
} else
i = +n;
return f(i) && (i = t), a && e != null && i > e && (i = e), i;
}, N = (r) => {
if (!Array.isArray(r))
return !1;
for (var n = r.length, e = {}, t = 0; t < n; t++)
if (!e[r[t]])
e[r[t]] = !0;
else
return !0;
return !1;
};
function b(r, n, e) {
return u(r) && u(n) ? r + e * (n - r) : n;
}
function A(r, n, e) {
if (!(!r || !r.length))
return r.find((t) => t && (typeof n == "function" ? n(t) : o(t, n)) === e);
}
var m = (r) => r === null || typeof r > "u", x = (r) => m(r) ? r : "".concat(r.charAt(0).toUpperCase()).concat(r.slice(1));
export {
A as findEntryInArray,
v as getPercentValue,
N as hasDuplicate,
b as interpolate,
f as isNan,
m as isNullish,
h as isNumOrStr,
u as isNumber,
g as isPercent,
l as mathSign,
p as uniqueId,
x as upperFirst
};