@boxcustodia/library 1.2.0 → 1.2.1

package/dist/index.es217.js

@@ -1,87 +1,200 @@
-import { constructFrom as i } from "./index.es241.js";
-import { getDefaultOptions as C } from "./index.es255.js";
-import { toDate as F } from "./index.es240.js";
-import { longFormatters as E } from "./index.es248.js";
-import { isProtectedWeekYearToken as $, warnOrThrowProtectedError as O, isProtectedDayOfYearToken as A } from "./index.es249.js";
-import { parsers as W } from "./index.es264.js";
-import { DateToSystemTimezoneSetter as L } from "./index.es265.js";
-import { enUS as Y } from "./index.es251.js";
-const j = /[yYQqMLwIdDecihHKkms]o|(\w)\1*|''|'(''|[^'])+('|$)|./g, q = /P+p+|P+|p+|''|'(''|[^'])+('|$)|./g, z = /^'([^]*?)'?$/, D = /''/g, Q = /\S/, v = /[a-zA-Z]/;
-function V(e, c, r, I) {
-  var h, k, T, w;
-  const a = C(), m = a.locale ?? Y, R = a.firstWeekContainsDate ?? ((k = (h = a.locale) == null ? void 0 : h.options) == null ? void 0 : k.firstWeekContainsDate) ?? 1, x = a.weekStartsOn ?? ((w = (T = a.locale) == null ? void 0 : T.options) == null ? void 0 : w.weekStartsOn) ?? 0, p = {
-    firstWeekContainsDate: R,
-    weekStartsOn: x,
-    locale: m
-  }, l = [new L()], P = c.match(q).map((t) => {
-    const o = t[0];
-    if (o in E) {
-      const n = E[o];
-      return n(t, m.formatLong);
+import { getDefaultExportFromCjs as O } from "./index.es165.js";
+import { __module as j } from "./index.es347.js";
+(function(x) {
+  var m = function() {
+    var A = String.fromCharCode, S = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=", M = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+-$", y = {};
+    function g(o, r) {
+      if (!y[o]) {
+        y[o] = {};
+        for (var s = 0; s < o.length; s++)
+          y[o][o.charAt(s)] = s;
+      }
+      return y[o][r];
     }
-    return t;
-  }).join("").match(j), f = [];
-  for (let t of P) {
-    $(t) && O(t, c, e), A(t) && O(t, c, e);
-    const o = t[0], n = W[o];
-    if (n) {
-      const { incompatibleTokens: y } = n;
-      if (Array.isArray(y)) {
-        const N = f.find(
-          (d) => y.includes(d.token) || d.token === o
-        );
-        if (N)
-          throw new RangeError(
-            `The format string mustn't contain \`${N.fullToken}\` and \`${t}\` at the same time`
-          );
-      } else if (n.incompatibleTokens === "*" && f.length > 0)
-        throw new RangeError(
-          `The format string mustn't contain \`${t}\` and any other token at the same time`
-        );
-      f.push({ token: o, fullToken: t });
-      const u = n.run(
-        e,
-        t,
-        m.match,
-        p
-      );
-      if (!u)
-        return i(r, NaN);
-      l.push(u.setter), e = u.rest;
-    } else {
-      if (o.match(v))
-        throw new RangeError(
-          "Format string contains an unescaped latin alphabet character `" + o + "`"
-        );
-      if (t === "''" ? t = "'" : o === "'" && (t = H(t)), e.indexOf(t) === 0)
-        e = e.slice(t.length);
-      else
-        return i(r, NaN);
-    }
-  }
-  if (e.length > 0 && Q.test(e))
-    return i(r, NaN);
-  const b = l.map((t) => t.priority).sort((t, o) => o - t).filter((t, o, n) => n.indexOf(t) === o).map(
-    (t) => l.filter((o) => o.priority === t).sort((o, n) => n.subPriority - o.subPriority)
-  ).map((t) => t[0]);
-  let s = F(r);
-  if (isNaN(s.getTime()))
-    return i(r, NaN);
-  const g = {};
-  for (const t of b) {
-    if (!t.validate(s, p))
-      return i(r, NaN);
-    const o = t.set(s, g, p);
-    Array.isArray(o) ? (s = o[0], Object.assign(g, o[1])) : s = o;
-  }
-  return i(r, s);
-}
-function H(e) {
-  return e.match(z)[1].replace(D, "'");
-}
+    var d = {
+      compressToBase64: function(o) {
+        if (o == null) return "";
+        var r = d._compress(o, 6, function(s) {
+          return S.charAt(s);
+        });
+        switch (r.length % 4) {
+          default:
+          case 0:
+            return r;
+          case 1:
+            return r + "===";
+          case 2:
+            return r + "==";
+          case 3:
+            return r + "=";
+        }
+      },
+      decompressFromBase64: function(o) {
+        return o == null ? "" : o == "" ? null : d._decompress(o.length, 32, function(r) {
+          return g(S, o.charAt(r));
+        });
+      },
+      compressToUTF16: function(o) {
+        return o == null ? "" : d._compress(o, 15, function(r) {
+          return A(r + 32);
+        }) + " ";
+      },
+      decompressFromUTF16: function(o) {
+        return o == null ? "" : o == "" ? null : d._decompress(o.length, 16384, function(r) {
+          return o.charCodeAt(r) - 32;
+        });
+      },
+      //compress into uint8array (UCS-2 big endian format)
+      compressToUint8Array: function(o) {
+        for (var r = d.compress(o), s = new Uint8Array(r.length * 2), e = 0, i = r.length; e < i; e++) {
+          var p = r.charCodeAt(e);
+          s[e * 2] = p >>> 8, s[e * 2 + 1] = p % 256;
+        }
+        return s;
+      },
+      //decompress from uint8array (UCS-2 big endian format)
+      decompressFromUint8Array: function(o) {
+        if (o == null)
+          return d.decompress(o);
+        for (var r = new Array(o.length / 2), s = 0, e = r.length; s < e; s++)
+          r[s] = o[s * 2] * 256 + o[s * 2 + 1];
+        var i = [];
+        return r.forEach(function(p) {
+          i.push(A(p));
+        }), d.decompress(i.join(""));
+      },
+      //compress into a string that is already URI encoded
+      compressToEncodedURIComponent: function(o) {
+        return o == null ? "" : d._compress(o, 6, function(r) {
+          return M.charAt(r);
+        });
+      },
+      //decompress from an output of compressToEncodedURIComponent
+      decompressFromEncodedURIComponent: function(o) {
+        return o == null ? "" : o == "" ? null : (o = o.replace(/ /g, "+"), d._decompress(o.length, 32, function(r) {
+          return g(M, o.charAt(r));
+        }));
+      },
+      compress: function(o) {
+        return d._compress(o, 16, function(r) {
+          return A(r);
+        });
+      },
+      _compress: function(o, r, s) {
+        if (o == null) return "";
+        var e, i, p = {}, v = {}, w = "", _ = "", u = "", h = 2, a = 3, c = 2, l = [], n = 0, f = 0, t;
+        for (t = 0; t < o.length; t += 1)
+          if (w = o.charAt(t), Object.prototype.hasOwnProperty.call(p, w) || (p[w] = a++, v[w] = !0), _ = u + w, Object.prototype.hasOwnProperty.call(p, _))
+            u = _;
+          else {
+            if (Object.prototype.hasOwnProperty.call(v, u)) {
+              if (u.charCodeAt(0) < 256) {
+                for (e = 0; e < c; e++)
+                  n = n << 1, f == r - 1 ? (f = 0, l.push(s(n)), n = 0) : f++;
+                for (i = u.charCodeAt(0), e = 0; e < 8; e++)
+                  n = n << 1 | i & 1, f == r - 1 ? (f = 0, l.push(s(n)), n = 0) : f++, i = i >> 1;
+              } else {
+                for (i = 1, e = 0; e < c; e++)
+                  n = n << 1 | i, f == r - 1 ? (f = 0, l.push(s(n)), n = 0) : f++, i = 0;
+                for (i = u.charCodeAt(0), e = 0; e < 16; e++)
+                  n = n << 1 | i & 1, f == r - 1 ? (f = 0, l.push(s(n)), n = 0) : f++, i = i >> 1;
+              }
+              h--, h == 0 && (h = Math.pow(2, c), c++), delete v[u];
+            } else
+              for (i = p[u], e = 0; e < c; e++)
+                n = n << 1 | i & 1, f == r - 1 ? (f = 0, l.push(s(n)), n = 0) : f++, i = i >> 1;
+            h--, h == 0 && (h = Math.pow(2, c), c++), p[_] = a++, u = String(w);
+          }
+        if (u !== "") {
+          if (Object.prototype.hasOwnProperty.call(v, u)) {
+            if (u.charCodeAt(0) < 256) {
+              for (e = 0; e < c; e++)
+                n = n << 1, f == r - 1 ? (f = 0, l.push(s(n)), n = 0) : f++;
+              for (i = u.charCodeAt(0), e = 0; e < 8; e++)
+                n = n << 1 | i & 1, f == r - 1 ? (f = 0, l.push(s(n)), n = 0) : f++, i = i >> 1;
+            } else {
+              for (i = 1, e = 0; e < c; e++)
+                n = n << 1 | i, f == r - 1 ? (f = 0, l.push(s(n)), n = 0) : f++, i = 0;
+              for (i = u.charCodeAt(0), e = 0; e < 16; e++)
+                n = n << 1 | i & 1, f == r - 1 ? (f = 0, l.push(s(n)), n = 0) : f++, i = i >> 1;
+            }
+            h--, h == 0 && (h = Math.pow(2, c), c++), delete v[u];
+          } else
+            for (i = p[u], e = 0; e < c; e++)
+              n = n << 1 | i & 1, f == r - 1 ? (f = 0, l.push(s(n)), n = 0) : f++, i = i >> 1;
+          h--, h == 0 && (h = Math.pow(2, c), c++);
+        }
+        for (i = 2, e = 0; e < c; e++)
+          n = n << 1 | i & 1, f == r - 1 ? (f = 0, l.push(s(n)), n = 0) : f++, i = i >> 1;
+        for (; ; )
+          if (n = n << 1, f == r - 1) {
+            l.push(s(n));
+            break;
+          } else f++;
+        return l.join("");
+      },
+      decompress: function(o) {
+        return o == null ? "" : o == "" ? null : d._decompress(o.length, 32768, function(r) {
+          return o.charCodeAt(r);
+        });
+      },
+      _decompress: function(o, r, s) {
+        var e = [], i = 4, p = 4, v = 3, w = "", _ = [], u, h, a, c, l, n, f, t = { val: s(0), position: r, index: 1 };
+        for (u = 0; u < 3; u += 1)
+          e[u] = u;
+        for (a = 0, l = Math.pow(2, 2), n = 1; n != l; )
+          c = t.val & t.position, t.position >>= 1, t.position == 0 && (t.position = r, t.val = s(t.index++)), a |= (c > 0 ? 1 : 0) * n, n <<= 1;
+        switch (a) {
+          case 0:
+            for (a = 0, l = Math.pow(2, 8), n = 1; n != l; )
+              c = t.val & t.position, t.position >>= 1, t.position == 0 && (t.position = r, t.val = s(t.index++)), a |= (c > 0 ? 1 : 0) * n, n <<= 1;
+            f = A(a);
+            break;
+          case 1:
+            for (a = 0, l = Math.pow(2, 16), n = 1; n != l; )
+              c = t.val & t.position, t.position >>= 1, t.position == 0 && (t.position = r, t.val = s(t.index++)), a |= (c > 0 ? 1 : 0) * n, n <<= 1;
+            f = A(a);
+            break;
+          case 2:
+            return "";
+        }
+        for (e[3] = f, h = f, _.push(f); ; ) {
+          if (t.index > o)
+            return "";
+          for (a = 0, l = Math.pow(2, v), n = 1; n != l; )
+            c = t.val & t.position, t.position >>= 1, t.position == 0 && (t.position = r, t.val = s(t.index++)), a |= (c > 0 ? 1 : 0) * n, n <<= 1;
+          switch (f = a) {
+            case 0:
+              for (a = 0, l = Math.pow(2, 8), n = 1; n != l; )
+                c = t.val & t.position, t.position >>= 1, t.position == 0 && (t.position = r, t.val = s(t.index++)), a |= (c > 0 ? 1 : 0) * n, n <<= 1;
+              e[p++] = A(a), f = p - 1, i--;
+              break;
+            case 1:
+              for (a = 0, l = Math.pow(2, 16), n = 1; n != l; )
+                c = t.val & t.position, t.position >>= 1, t.position == 0 && (t.position = r, t.val = s(t.index++)), a |= (c > 0 ? 1 : 0) * n, n <<= 1;
+              e[p++] = A(a), f = p - 1, i--;
+              break;
+            case 2:
+              return _.join("");
+          }
+          if (i == 0 && (i = Math.pow(2, v), v++), e[f])
+            w = e[f];
+          else if (f === p)
+            w = h + h.charAt(0);
+          else
+            return null;
+          _.push(w), e[p++] = h + w.charAt(0), i--, h = w, i == 0 && (i = Math.pow(2, v), v++);
+        }
+      }
+    };
+    return d;
+  }();
+  x != null ? x.exports = m : typeof angular < "u" && angular != null && angular.module("LZString", []).factory("LZString", function() {
+    return m;
+  });
+})(j);
+var U = j.exports;
+const B = /* @__PURE__ */ O(U);
 export {
-  V as default,
-  E as longFormatters,
-  V as parse,
-  W as parsers
+  B as default
 };

package/dist/index.es218.js

@@ -1,8 +1,23 @@
-import { addMonths as a } from "./index.es219.js";
-function o(r, t) {
-  return a(r, t * 12);
-}
+import { forwardRef as s, createElement as c } from "react";
+import { mergeClasses as n, toKebabCase as f } from "./index.es219.js";
+import l from "./index.es220.js";
+/**
+ * @license lucide-react v0.475.0 - ISC
+ *
+ * This source code is licensed under the ISC license.
+ * See the LICENSE file in the root directory of this source tree.
+ */
+const u = (e, r) => {
+  const o = s(
+    ({ className: t, ...a }, m) => c(l, {
+      ref: m,
+      iconNode: r,
+      className: n(`lucide-${f(e)}`, t),
+      ...a
+    })
+  );
+  return o.displayName = `${e}`, o;
+};
 export {
-  o as addYears,
-  o as default
+  u as default
 };

package/dist/index.es219.js

@@ -1,20 +1,11 @@
-import { toDate as f } from "./index.es240.js";
-import { constructFrom as s } from "./index.es241.js";
-function h(n, o) {
-  const t = f(n);
-  if (isNaN(o)) return s(n, NaN);
-  if (!o)
-    return t;
-  const r = t.getDate(), e = s(n, t.getTime());
-  e.setMonth(t.getMonth() + o + 1, 0);
-  const a = e.getDate();
-  return r >= a ? e : (t.setFullYear(
-    e.getFullYear(),
-    e.getMonth(),
-    r
-  ), t);
-}
+/**
+ * @license lucide-react v0.475.0 - ISC
+ *
+ * This source code is licensed under the ISC license.
+ * See the LICENSE file in the root directory of this source tree.
+ */
+const n = (e) => e.replace(/([a-z0-9])([A-Z])/g, "$1-$2").toLowerCase(), i = (...e) => e.filter((o, r, t) => !!o && o.trim() !== "" && t.indexOf(o) === r).join(" ").trim();
 export {
-  h as addMonths,
-  h as default
+  i as mergeClasses,
+  n as toKebabCase
 };

package/dist/index.es22.js

@@ -1,5 +1,5 @@
 import { useMemo as D } from "react";
-import { l as a } from "./index.es119.js";
+import { l as a } from "./index.es104.js";
 import h from "./index.es19.js";
 const s = "...", p = ({
   siblingCount: e = 1,

package/dist/index.es220.js

@@ -1,12 +1,40 @@
-import { toDate as t } from "./index.es240.js";
-function c(o, e) {
-  const n = +t(o), [r, i] = [
-    +t(e.start),
-    +t(e.end)
-  ].sort((s, a) => s - a);
-  return n >= r && n <= i;
-}
+import { forwardRef as i, createElement as o } from "react";
+import b from "./index.es221.js";
+import { mergeClasses as d } from "./index.es219.js";
+/**
+ * @license lucide-react v0.475.0 - ISC
+ *
+ * This source code is licensed under the ISC license.
+ * See the LICENSE file in the root directory of this source tree.
+ */
+const N = i(
+  ({
+    color: m = "currentColor",
+    size: r = 24,
+    strokeWidth: e = 2,
+    absoluteStrokeWidth: a,
+    className: s = "",
+    children: t,
+    iconNode: u,
+    ...f
+  }, l) => o(
+    "svg",
+    {
+      ref: l,
+      ...b,
+      width: r,
+      height: r,
+      stroke: m,
+      strokeWidth: a ? Number(e) * 24 / Number(r) : e,
+      className: d("lucide", s),
+      ...f
+    },
+    [
+      ...u.map(([p, c]) => o(p, c)),
+      ...Array.isArray(t) ? t : [t]
+    ]
+  )
+);
 export {
-  c as default,
-  c as isWithinInterval
+  N as default
 };

package/dist/index.es221.js

@@ -1,9 +1,20 @@
-import { toDate as r } from "./index.es240.js";
-function e(o) {
-  const t = r(o);
-  return t.setHours(0, 0, 0, 0), t;
-}
+/**
+ * @license lucide-react v0.475.0 - ISC
+ *
+ * This source code is licensed under the ISC license.
+ * See the LICENSE file in the root directory of this source tree.
+ */
+var t = {
+  xmlns: "http://www.w3.org/2000/svg",
+  width: 24,
+  height: 24,
+  viewBox: "0 0 24 24",
+  fill: "none",
+  stroke: "currentColor",
+  strokeWidth: 2,
+  strokeLinecap: "round",
+  strokeLinejoin: "round"
+};
 export {
-  e as default,
-  e as startOfDay
+  t as default
 };

package/dist/index.es222.js

@@ -1,9 +1,17 @@
-import { toDate as t } from "./index.es240.js";
-function f(o, e) {
-  const r = t(o), a = t(e);
-  return +r < +a;
-}
+const o = (t) => {
+  const s = t.toLowerCase().split("+");
+  return {
+    mainKey: s.pop(),
+    isShift: s.includes("shift"),
+    isCtrl: s.includes("ctrl"),
+    isAlt: s.includes("alt"),
+    isMeta: s.includes("meta")
+  };
+}, c = (t, s) => {
+  const { mainKey: i, isShift: e, isCtrl: r, isAlt: a, isMeta: l } = o(s);
+  return t.key.toLowerCase() === i && t.shiftKey === e && t.ctrlKey === r && t.altKey === a && t.metaKey === l;
+};
 export {
-  f as default,
-  f as isBefore
+  o as getKeyModifiers,
+  c as matchKeyModifiers
 };

package/dist/index.es223.js

@@ -1,16 +1,5 @@
-import { toDate as a } from "./index.es240.js";
-function p(n, D) {
-  const e = a(n.start), s = a(n.end);
-  let r = +e > +s;
-  const c = r ? +e : +s, t = r ? s : e;
-  t.setHours(0, 0, 0, 0);
-  let u = 1;
-  const o = [];
-  for (; +t <= c; )
-    o.push(a(t)), t.setDate(t.getDate() + u), t.setHours(0, 0, 0, 0);
-  return r ? o.reverse() : o;
-}
+const r = (t) => t.tagName === "INPUT" || t.tagName === "TEXTAREA" || t.isContentEditable, a = (t, n) => n && r(t.target);
 export {
-  p as default,
-  p as eachDayOfInterval
+  r as isInputField,
+  a as shouldIgnoreEvent
 };

package/dist/index.es224.js

@@ -1,9 +1,37 @@
-import { startOfDay as t } from "./index.es221.js";
-function n(a, r) {
-  const e = t(a), f = t(r);
-  return +e == +f;
-}
+import { cva as r } from "./index.es162.js";
+const e = r(
+  [
+    "flex justify-between items-center transition-all",
+    "text-primary-foreground",
+    "pointer-events-auto relative w-full rounded-xl p-3 shadow-lg"
+  ],
+  {
+    variants: {
+      variant: {
+        info: "bg-primary text-primary-foreground",
+        error: "bg-error text-error-foreground",
+        success: "bg-success text-success-foreground",
+        loading: "bg-background text-foreground"
+      }
+    },
+    defaultVariants: {
+      variant: "info"
+    }
+  }
+), o = r("", {
+  variants: {
+    variant: {
+      info: "text-primary-foreground",
+      error: "text-error-foreground",
+      success: "text-success-foreground",
+      loading: "text-foreground animate-spin"
+    }
+  },
+  defaultVariants: {
+    variant: "info"
+  }
+});
 export {
-  n as default,
-  n as isSameDay
+  o as toastIconVariants,
+  e as toastVariants
 };