@mhmo91/schmancy 0.4.39 → 0.4.40

package/dist/{selector-hook-DPe2CGKx.js → selector-hook-CIpuCUbr.js}

@@ -1,56 +1,56 @@
-import { e as z, S as E, a as q, d as N } from "./context-object-CDDP4bTk.js";
-import { property as Z } from "lit/decorators.js";
-import { map as x, distinctUntilChanged as T, shareReplay as P, share as H, BehaviorSubject as W, combineLatest as J, Subject as K } from "rxjs";
-import { takeUntil as Q } from "rxjs/operators";
-function D(n, e, t) {
+import { e as E, S as q, a as N, d as W } from "./context-object-CDDP4bTk.js";
+import { property as H } from "lit/decorators.js";
+import { map as T, distinctUntilChanged as I, shareReplay as F, share as J, BehaviorSubject as D, combineLatest as K, Subject as Q } from "rxjs";
+import { takeUntil as X } from "rxjs/operators";
+function R(n, e, t) {
   try {
     e === "indexeddb" && (e = "local"), ((o = n) === null || typeof o != "object" || Array.isArray(o) || o instanceof Map || o instanceof Set || o instanceof Date || o instanceof RegExp || Object.getPrototypeOf(o) !== Object.prototype) && (n = { ...n });
-    const a = q.getInstance(e, t, n);
+    const a = N.getInstance(e, t, n);
     return typeof (r = a.value) == "object" && r !== null && Object.keys(r).length === 0 && a.set({ ...n }), a;
   } catch {
-    return q.getInstance("memory", `${t}-fallback`, n);
+    return N.getInstance("memory", `${t}-fallback`, n);
   }
   var r, o;
 }
-function I(n, e, t) {
+function z(n, e, t) {
   try {
-    const r = E.getInstance(e, t, n);
+    const r = q.getInstance(e, t, n);
     return r.value.length || r.replace([...n]), r;
   } catch {
-    return E.getInstance("memory", `${t}-fallback`, [...n]);
+    return q.getInstance("memory", `${t}-fallback`, [...n]);
   }
 }
-function F(n, e, t) {
+function G(n, e, t) {
   try {
     return n == null && (n = t.includes("collection") || t.includes("map") ? /* @__PURE__ */ new Map() : t.includes("array") || t.includes("list") ? [] : {}), n instanceof Map ? function(r, o, a) {
       try {
-        const f = z.getInstance(o, a, r);
+        const f = E.getInstance(o, a, r);
         return f.value.size || f.replace(new Map(r)), f;
       } catch {
-        return z.getInstance("memory", `${a}-fallback`, new Map(r));
+        return E.getInstance("memory", `${a}-fallback`, new Map(r));
       }
     }(n, e, t) : function(r) {
       return Array.isArray(r);
-    }(n) ? I(n, e, t) : D(typeof n == "object" ? n : { value: n }, e, t);
+    }(n) ? z(n, e, t) : R(typeof n == "object" ? n : { value: n }, e, t);
   } catch {
-    return D(typeof n == "object" && n !== null ? { ...n } : { value: n }, "memory", `emergency-fallback-${t}`);
+    return R(typeof n == "object" && n !== null ? { ...n } : { value: n }, "memory", `emergency-fallback-${t}`);
   }
 }
-function ae(n = [], e, t = "local") {
+function ie(n = [], e, t = "local") {
   try {
-    return F(n, t, e);
+    return G(n, t, e);
   } catch {
-    return I(n, "memory", `${e}-fallback`);
+    return z(n, "memory", `${e}-fallback`);
   }
 }
-function ie(n = [], e = "test-array") {
+function ce(n = [], e = "test-array") {
   try {
-    return F(n, "memory", e);
+    return G(n, "memory", e);
   } catch {
-    return I(n, "memory", `${e}-emergency-fallback`);
+    return z(n, "memory", `${e}-emergency-fallback`);
   }
 }
-const X = (n, e) => {
+const Y = (n, e) => {
   if (!e) return n;
   const t = e.split(".");
   let r = n;
@@ -59,12 +59,12 @@ const X = (n, e) => {
     r = r[o];
   }
   return r;
-}, R = (n) => {
+}, U = (n) => {
   if (!n || n.length < 2) return [];
   const e = [];
   for (let t = 0; t < n.length - 1; t++) e.push(n.substring(t, t + 2).toLowerCase());
   return e;
-}, U = (n, e) => {
+}, V = (n, e) => {
   if (!n || !e) return 0;
   const t = n.toLowerCase().trim(), r = e.toLowerCase().trim();
   if (t === r) return 1;
@@ -77,16 +77,16 @@ const X = (n, e) => {
   })(r, t) ? 0.8 : 0, f = ((i, u) => {
     if (!i) return !0;
     if (!u) return !1;
-    const l = (j) => j.toLowerCase().split("").reduce((k, v) => (k[v] = (k[v] || 0) + 1, k), {}), c = l(i), y = l(u);
-    return Object.keys(c).every((j) => (y[j] || 0) >= c[j]);
+    const l = (A) => A.toLowerCase().split("").reduce((j, b) => (j[b] = (j[b] || 0) + 1, j), {}), c = l(i), y = l(u);
+    return Object.keys(c).every((A) => (y[A] || 0) >= c[A]);
   })(r, t) ? 0.7 : 0, h = ((i, u) => {
     if (!i || !u || i.length < 2 || u.length < 2) return 0;
-    const l = R(i), c = R(u);
+    const l = U(i), c = U(u);
     if (l.length === 0 || c.length === 0) return 0;
     let y = 0;
-    const j = new Array(c.length).fill(!1);
-    for (const k of l) for (let v = 0; v < c.length; v++) if (!j[v] && c[v] === k) {
-      y++, j[v] = !0;
+    const A = new Array(c.length).fill(!1);
+    for (const j of l) for (let b = 0; b < c.length; b++) if (!A[b] && c[b] === j) {
+      y++, A[b] = !0;
       break;
     }
     return 2 * y / (l.length + c.length);
@@ -98,39 +98,39 @@ const X = (n, e) => {
     return l[u.length][i.length];
   })(t, r) / s : 0;
   return Math.max(o, a, f, h, p);
-}, V = (n) => n == null ? "" : String(n);
-function Y(n, e, t = 0.3) {
+}, B = (n) => n == null ? "" : String(n);
+function _(n, e, t = 0.3) {
   let r, o, a, f = !1;
-  if (Array.isArray(e) ? [r, o, a, f = !1] = e : (r = e.key, o = e.operator, a = e.value, f = e.strict || !1), !f && (a === "" || a == null || $(a) && a.length === 0)) return { valid: !0, score: 1 };
-  const h = X(n, r);
+  if (Array.isArray(e) ? [r, o, a, f = !1] = e : (r = e.key, o = e.operator, a = e.value, f = e.strict || !1), !f && (a === "" || a == null || S(a) && a.length === 0)) return { valid: !0, score: 1 };
+  const h = Y(n, r);
   if (f) {
     if (o === "any") {
       if (typeof h != "string" || typeof a != "string") return { valid: !1, score: 0 };
-      const s = U(h, a);
+      const s = V(h, a);
       return { valid: s >= t, score: s >= t ? s : 0 };
     }
     {
-      const s = B(o, h, a);
+      const s = P(o, h, a);
       return { valid: s, score: s ? 1 : 0 };
     }
   }
   if (o === "any") {
     if (typeof h != "string" || typeof a != "string") return { valid: !1, score: 0 };
-    const s = U(h, a);
+    const s = V(h, a);
     return s < t ? { valid: !1, score: 0 } : { valid: !0, score: s };
   }
   {
-    const s = B(o, h, a);
+    const s = P(o, h, a);
     return { valid: s, score: s ? 1 : 0 };
   }
 }
-function G(n, e = [], t = 0.3) {
+function Z(n, e = [], t = 0.3) {
   if (!e.length) return Array.from(n.values());
   const r = [];
   for (const [o, a] of n.entries()) {
     let f = 0, h = 0, s = !0;
     for (const p of e) {
-      const i = Y(a, p, t);
+      const i = _(a, p, t);
       if (!i.valid) {
         s = !1;
         break;
@@ -141,72 +141,72 @@ function G(n, e = [], t = 0.3) {
   }
   return r.sort((o, a) => a.score - o.score), r.map((o) => o.item);
 }
-function _(n, e = [], t = 0.3) {
+function ee(n, e = [], t = 0.3) {
   const r = /* @__PURE__ */ new Map();
-  return n.forEach((o, a) => r.set(String(a), o)), G(r, e, t);
+  return n.forEach((o, a) => r.set(String(a), o)), Z(r, e, t);
 }
-function $(n) {
+function S(n) {
   return Array.isArray(n);
 }
 function d(n) {
   return typeof n == "string";
 }
-function C(n) {
+function v(n) {
   return typeof n == "number" && !isNaN(n);
 }
-function w(n) {
+function C(n) {
   return n instanceof Date && !isNaN(n.getTime());
 }
-function ce(n) {
+function ue(n) {
   return n != null && typeof n == "object" && Symbol.iterator in Object(n) && typeof n[Symbol.iterator] == "function";
 }
-function S(n) {
+function L(n) {
   return n instanceof Map;
 }
-function L(n) {
+function M(n) {
   return n instanceof Set;
 }
-function ue(n) {
+function le(n) {
   if (n === null || typeof n != "object") return !1;
   const e = Object.getPrototypeOf(n);
   return e === Object.prototype || e === null;
 }
-function M(n) {
+function x(n) {
   return n == null;
 }
-function B(n, e, t) {
-  if (M(e) && M(t)) return !0;
-  if (M(e) || M(t)) return n === "==" ? e === t : n === "!=" && e !== t;
+function P(n, e, t) {
+  if (x(e) && x(t)) return !0;
+  if (x(e) || x(t)) return n === "==" ? e === t : n === "!=" && e !== t;
   switch (n) {
     case "==":
       return e === t;
     case "!=":
       return e !== t;
     case ">":
-      return C(e) && C(t) ? e > t : w(e) && w(t) ? e.getTime() > t.getTime() : !(!d(e) || !d(t)) && e.localeCompare(t) > 0;
+      return v(e) && v(t) ? e > t : C(e) && C(t) ? e.getTime() > t.getTime() : !(!d(e) || !d(t)) && e.localeCompare(t) > 0;
     case "<":
-      return C(e) && C(t) ? e < t : w(e) && w(t) ? e.getTime() < t.getTime() : !(!d(e) || !d(t)) && e.localeCompare(t) < 0;
+      return v(e) && v(t) ? e < t : C(e) && C(t) ? e.getTime() < t.getTime() : !(!d(e) || !d(t)) && e.localeCompare(t) < 0;
     case ">=":
-      return C(e) && C(t) ? e >= t : w(e) && w(t) ? e.getTime() >= t.getTime() : !(!d(e) || !d(t)) && e.localeCompare(t) >= 0;
+      return v(e) && v(t) ? e >= t : C(e) && C(t) ? e.getTime() >= t.getTime() : !(!d(e) || !d(t)) && e.localeCompare(t) >= 0;
     case "<=":
-      return C(e) && C(t) ? e <= t : w(e) && w(t) ? e.getTime() <= t.getTime() : !(!d(e) || !d(t)) && e.localeCompare(t) <= 0;
+      return v(e) && v(t) ? e <= t : C(e) && C(t) ? e.getTime() <= t.getTime() : !(!d(e) || !d(t)) && e.localeCompare(t) <= 0;
     case "includes":
-      return d(e) ? e.toLowerCase().includes(V(t).toLowerCase()) : $(e) ? e.includes(t) : L(e) ? e.has(t) : !!S(e) && Array.from(e.values()).includes(t);
+      return d(e) ? e.toLowerCase().includes(B(t).toLowerCase()) : S(e) ? e.includes(t) : M(e) ? e.has(t) : !!L(e) && Array.from(e.values()).includes(t);
     case "notIncludes":
-      return d(e) ? !e.toLowerCase().includes(V(t).toLowerCase()) : $(e) ? !e.includes(t) : L(e) ? !e.has(t) : !S(e) || !Array.from(e.values()).includes(t);
+      return d(e) ? !e.toLowerCase().includes(B(t).toLowerCase()) : S(e) ? !e.includes(t) : M(e) ? !e.has(t) : !L(e) || !Array.from(e.values()).includes(t);
     case "startsWith":
       return !(!d(e) || !d(t)) && e.toLowerCase().startsWith(t.toLowerCase());
     case "endsWith":
       return !(!d(e) || !d(t)) && e.toLowerCase().endsWith(t.toLowerCase());
     case "in":
-      return $(t) ? t.includes(e) : L(t) ? t.has(e) : !!S(t) && (t.has(e) || Array.from(t.values()).includes(e));
+      return S(t) ? t.includes(e) : M(t) ? t.has(e) : !!L(t) && (t.has(e) || Array.from(t.values()).includes(e));
     case "notIn":
-      return $(t) ? !t.includes(e) : L(t) ? !t.has(e) : !S(t) || !t.has(e) && !Array.from(t.values()).includes(e);
+      return S(t) ? !t.includes(e) : M(t) ? !t.has(e) : !L(t) || !t.has(e) && !Array.from(t.values()).includes(e);
     default:
       return !1;
   }
 }
-const le = G, fe = _;
+const fe = Z, he = ee;
 function O(n, e) {
   if (n === e) return !0;
   if (n instanceof Map && e instanceof Map) {
@@ -227,46 +227,46 @@ function O(n, e) {
   }
   return !1;
 }
-function ee(n, e) {
-  return n.$.pipe(x(e), T(O), P(1));
+function te(n, e) {
+  return n.$.pipe(T(e), I(O), F(1));
 }
 function g(n, e) {
-  return n.$.pipe(x(e), T(O), P(1));
+  return n.$.pipe(T(e), I(O), F(1));
 }
-function he(n) {
+function pe(n) {
   return g(n, (e) => Array.from(e.values()));
 }
-function pe(n, e) {
+function ye(n, e) {
   return g(n, (t) => t.get(e));
 }
-function ye(n) {
+function de(n) {
   return g(n, (e) => Array.from(e.keys()));
 }
-function de(n) {
+function me(n) {
   return g(n, (e) => Array.from(e.entries()));
 }
-function me(n, e) {
+function ge(n, e) {
   return g(n, (t) => Array.from(t.values()).sort(e));
 }
-function ge(n, e) {
+function be(n, e) {
   return g(n, (t) => {
     for (const [r, o] of t.entries()) if (e(o, r)) return o;
   });
 }
-function be(n, e) {
+function ve(n, e) {
   return g(n, (t) => Array.from(t.entries()).filter(([r, o]) => e(o, r)).map(([r, o]) => o));
 }
-function ve(n, e) {
+function Ce(n, e) {
   return g(n, (t) => Array.from(t.entries()).map(([r, o]) => e(o, r)));
 }
-function Ce(n, e) {
+function we(n, e) {
   return g(n, (t) => e ? Array.from(t.entries()).filter(([r, o]) => e(o, r)).length : t.size);
 }
-function we(n, e) {
-  return n.$.pipe(x(e), T(O), H({ resetOnRefCountZero: !0, resetOnError: !1, resetOnComplete: !1 }));
+function Ae(n, e) {
+  return n.$.pipe(T(e), I(O), J({ resetOnRefCountZero: !0, resetOnError: !1, resetOnComplete: !1 }));
 }
-function Ae(n, e, t) {
-  const r = n.map((p, i) => e[i](p.value)), o = t(...r), a = { $: new W(o), error$: new W(null), ready: !0, defaultValue: o, get value() {
+function ke(n, e, t) {
+  const r = n.map((p, i) => e[i](p.value)), o = t(...r), a = { $: new D(o), error$: new D(null), ready: !0, defaultValue: o, get value() {
     return this.$.getValue();
   }, set(p, i) {
   }, clear() {
@@ -275,37 +275,37 @@ function Ae(n, e, t) {
   }, delete(p) {
   }, destroy() {
     this.$.complete(), this.error$.complete();
-  } }, f = n.map((p, i) => p.$), h = J(f).subscribe({ next: (p) => {
+  } }, f = n.map((p, i) => p.$), h = K(f).subscribe({ next: (p) => {
     try {
       const i = p.map((l, c) => e[c](l)), u = t(...i);
       a.$.next(u);
     } catch (i) {
-      const u = new N("Error in compound selector", i);
+      const u = new W("Error in compound selector", i);
       a.error$.next(u);
     }
   }, error: (p) => {
-    const i = new N("Error in store subscription", p);
+    const i = new W("Error in store subscription", p);
     a.error$.next(i);
   } }), s = a.destroy;
   return a.destroy = function() {
     h.unsubscribe(), s.call(this);
   }, a;
 }
-const A = Symbol("selectorCleanup"), m = Symbol("selectorSubscriptions"), b = Symbol("selectorInitialized");
-function te(n, e = (r) => r, t = { required: !0 }) {
+const w = Symbol("selectorCleanup"), m = Symbol("selectorSubscriptions"), k = Symbol("selectorInitialized"), $ = Symbol("connectedCallbackCalled");
+function ne(n, e = (r) => r, t = { required: !0 }) {
   return function(r, o, a) {
-    Z({ attribute: !1, type: Object })(r, o);
+    H({ attribute: !1, type: Object })(r, o);
     const f = r.connectedCallback, h = r.disconnectedCallback;
     r.connectedCallback = function() {
       var s;
-      (s = this)[A] && !s[A].closed || (s[A] = new K()), s[m] || (s[m] = /* @__PURE__ */ new Map()), s[b] || (s[b] = /* @__PURE__ */ new Set());
+      (s = this)[w] && !s[w].closed || (s[w] = new Q()), s[m] || (s[m] = /* @__PURE__ */ new Map()), s[k] || (s[k] = /* @__PURE__ */ new Set());
       const p = function(u) {
         return "set" in u && typeof u.set == "function" && u.value instanceof Map;
-      }(n) ? g(n, e) : ee(n, e);
-      t.required || this[b].has(o) || (f?.call(this), this[b].add(o)), this[m].has(o) && (this[m].get(o)?.unsubscribe(), this[m].delete(o)), t.debug;
-      const i = p.pipe(Q(this[A])).subscribe({ next: (u) => {
+      }(n) ? g(n, e) : te(n, e);
+      t.required || this[$] || (f?.call(this), this[$] = !0), this[m].has(o) && (this[m].get(o)?.unsubscribe(), this[m].delete(o)), t.debug;
+      const i = p.pipe(X(this[w])).subscribe({ next: (u) => {
         const l = t.deepClone ? structuredClone(u) : u;
-        t.debug, t.updateOnly || (this[o] = l), this.requestUpdate?.(), t.required && !this[b].has(o) && l !== void 0 && (t.debug, f?.call(this), this[b].add(o));
+        t.debug, t.updateOnly || (this[o] = l), this.requestUpdate?.(), t.required && !this[k].has(o) && l !== void 0 && (this[k].add(o), this[$] || (t.debug, f?.call(this), this[$] = !0));
       }, error: (u) => {
         this.isConnected && setTimeout(() => {
           this.isConnected && (t.debug, this.connectedCallback?.());
@@ -314,51 +314,51 @@ function te(n, e = (r) => r, t = { required: !0 }) {
       this[m].set(o, i);
     }, r.disconnectedCallback = function() {
       var s;
-      h?.call(this), t.debug, (s = this)[A] && (s[A].next(), s[A].complete(), s[A] = void 0), s[m] && (s[m].forEach((p) => p.unsubscribe()), s[m].clear(), s[m] = void 0), s[b] && (s[b].clear(), s[b] = void 0);
+      h?.call(this), t.debug, (s = this)[w] && (s[w].next(), s[w].complete(), s[w] = void 0), s[m] && (s[m].forEach((p) => p.unsubscribe()), s[m].clear(), s[m] = void 0), s[k] && (s[k].clear(), s[k] = void 0), s[$] = void 0;
     };
   };
 }
 function je(n, e, t = { required: !0 }) {
   return function(r, o, a) {
-    te(n, function(f) {
+    ne(n, function(f) {
       const h = e(this);
       return h ? f.get(h) : void 0;
     }, t)(r, o);
   };
 }
 export {
-  me as A,
-  ge as B,
-  be as C,
-  ve as D,
-  Ce as E,
-  we as F,
-  Ae as G,
-  ae as a,
-  ie as b,
-  F as c,
-  _ as d,
+  ge as A,
+  be as B,
+  ve as C,
+  Ce as D,
+  we as E,
+  Ae as F,
+  ke as G,
+  ie as a,
+  ce as b,
+  G as c,
+  ee as d,
   d as e,
-  G as f,
-  X as g,
-  C as h,
-  $ as i,
-  w as j,
-  ce as k,
-  S as l,
-  L as m,
-  ue as n,
-  M as o,
-  B as p,
-  le as q,
-  fe as r,
-  te as s,
+  Z as f,
+  Y as g,
+  v as h,
+  S as i,
+  C as j,
+  ue as k,
+  L as l,
+  M as m,
+  le as n,
+  x as o,
+  P as p,
+  fe as q,
+  he as r,
+  ne as s,
   je as t,
-  ee as u,
+  te as u,
   g as v,
-  he as w,
-  pe as x,
-  ye as y,
-  de as z
+  pe as w,
+  ye as x,
+  de as y,
+  me as z
 };
-//# sourceMappingURL=selector-hook-DPe2CGKx.js.map
+//# sourceMappingURL=selector-hook-CIpuCUbr.js.map