@hitgrab/finder 0.1.3-alpha → 0.1.5-alpha
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/core/filters.d.ts +1 -1
- package/dist/core/finder-core.d.ts +1 -1
- package/dist/index.js +205 -203
- package/dist/index.umd.cjs +6 -6
- package/package.json +1 -1
package/dist/index.js
CHANGED
|
@@ -48,18 +48,18 @@ function Np() {
|
|
|
48
48
|
if (Ao) return rr;
|
|
49
49
|
Ao = 1;
|
|
50
50
|
var g = Symbol.for("react.transitional.element"), u = Symbol.for("react.fragment");
|
|
51
|
-
function i(l,
|
|
51
|
+
function i(l, p, R) {
|
|
52
52
|
var T = null;
|
|
53
|
-
if (R !== void 0 && (T = "" + R),
|
|
53
|
+
if (R !== void 0 && (T = "" + R), p.key !== void 0 && (T = "" + p.key), "key" in p) {
|
|
54
54
|
R = {};
|
|
55
|
-
for (var y in
|
|
56
|
-
y !== "key" && (R[y] =
|
|
57
|
-
} else R =
|
|
58
|
-
return
|
|
55
|
+
for (var y in p)
|
|
56
|
+
y !== "key" && (R[y] = p[y]);
|
|
57
|
+
} else R = p;
|
|
58
|
+
return p = R.ref, {
|
|
59
59
|
$$typeof: g,
|
|
60
60
|
type: l,
|
|
61
61
|
key: T,
|
|
62
|
-
ref:
|
|
62
|
+
ref: p !== void 0 ? p : null,
|
|
63
63
|
props: R
|
|
64
64
|
};
|
|
65
65
|
}
|
|
@@ -152,7 +152,7 @@ function Fp() {
|
|
|
152
152
|
return "<...>";
|
|
153
153
|
}
|
|
154
154
|
}
|
|
155
|
-
function
|
|
155
|
+
function p() {
|
|
156
156
|
var x = Nn.A;
|
|
157
157
|
return x === null ? null : x.getOwner();
|
|
158
158
|
}
|
|
@@ -260,7 +260,7 @@ React keys must be passed directly to JSX without using spread:
|
|
|
260
260
|
se,
|
|
261
261
|
Re,
|
|
262
262
|
vt,
|
|
263
|
-
|
|
263
|
+
p(),
|
|
264
264
|
ee,
|
|
265
265
|
Ut,
|
|
266
266
|
Fn
|
|
@@ -362,7 +362,7 @@ var Mp = ur.exports, bo;
|
|
|
362
362
|
function Up() {
|
|
363
363
|
return bo || (bo = 1, function(g, u) {
|
|
364
364
|
(function() {
|
|
365
|
-
var i, l = "4.17.21",
|
|
365
|
+
var i, l = "4.17.21", p = 200, R = "Unsupported core-js use. Try https://npms.io/search?q=ponyfill.", T = "Expected a function", y = "Invalid `variable` option passed into `_.template`", M = "__lodash_hash_undefined__", Y = 500, z = "__lodash_placeholder__", W = 1, ue = 2, me = 4, ge = 1, ye = 2, de = 1, Oe = 2, _t = 4, xe = 8, ft = 16, le = 32, Q = 64, be = 128, pt = 256, Qt = 512, gi = 30, Nn = "...", dr = 800, di = 16, gn = 1, _r = 2, pr = 3, jt = 1 / 0, Tt = 9007199254740991, vr = 17976931348623157e292, x = NaN, L = 4294967295, ee = L - 1, _e = L >>> 1, vt = [
|
|
366
366
|
["ary", be],
|
|
367
367
|
["bind", de],
|
|
368
368
|
["bindKey", Oe],
|
|
@@ -635,84 +635,84 @@ function Up() {
|
|
|
635
635
|
} catch {
|
|
636
636
|
}
|
|
637
637
|
}(), vs = Ze && Ze.isArrayBuffer, ms = Ze && Ze.isDate, Rs = Ze && Ze.isMap, Ss = Ze && Ze.isRegExp, Es = Ze && Ze.isSet, Is = Ze && Ze.isTypedArray;
|
|
638
|
-
function qe(h, m,
|
|
639
|
-
switch (
|
|
638
|
+
function qe(h, m, v) {
|
|
639
|
+
switch (v.length) {
|
|
640
640
|
case 0:
|
|
641
641
|
return h.call(m);
|
|
642
642
|
case 1:
|
|
643
|
-
return h.call(m,
|
|
643
|
+
return h.call(m, v[0]);
|
|
644
644
|
case 2:
|
|
645
|
-
return h.call(m,
|
|
645
|
+
return h.call(m, v[0], v[1]);
|
|
646
646
|
case 3:
|
|
647
|
-
return h.call(m,
|
|
647
|
+
return h.call(m, v[0], v[1], v[2]);
|
|
648
648
|
}
|
|
649
|
-
return h.apply(m,
|
|
649
|
+
return h.apply(m, v);
|
|
650
650
|
}
|
|
651
|
-
function Va(h, m,
|
|
651
|
+
function Va(h, m, v, A) {
|
|
652
652
|
for (var D = -1, k = h == null ? 0 : h.length; ++D < k; ) {
|
|
653
653
|
var ce = h[D];
|
|
654
|
-
m(A, ce,
|
|
654
|
+
m(A, ce, v(ce), h);
|
|
655
655
|
}
|
|
656
656
|
return A;
|
|
657
657
|
}
|
|
658
658
|
function Je(h, m) {
|
|
659
|
-
for (var
|
|
659
|
+
for (var v = -1, A = h == null ? 0 : h.length; ++v < A && m(h[v], v, h) !== !1; )
|
|
660
660
|
;
|
|
661
661
|
return h;
|
|
662
662
|
}
|
|
663
663
|
function Qa(h, m) {
|
|
664
|
-
for (var
|
|
664
|
+
for (var v = h == null ? 0 : h.length; v-- && m(h[v], v, h) !== !1; )
|
|
665
665
|
;
|
|
666
666
|
return h;
|
|
667
667
|
}
|
|
668
668
|
function xs(h, m) {
|
|
669
|
-
for (var
|
|
670
|
-
if (!m(h[
|
|
669
|
+
for (var v = -1, A = h == null ? 0 : h.length; ++v < A; )
|
|
670
|
+
if (!m(h[v], v, h))
|
|
671
671
|
return !1;
|
|
672
672
|
return !0;
|
|
673
673
|
}
|
|
674
674
|
function Wt(h, m) {
|
|
675
|
-
for (var
|
|
676
|
-
var ce = h[
|
|
677
|
-
m(ce,
|
|
675
|
+
for (var v = -1, A = h == null ? 0 : h.length, D = 0, k = []; ++v < A; ) {
|
|
676
|
+
var ce = h[v];
|
|
677
|
+
m(ce, v, h) && (k[D++] = ce);
|
|
678
678
|
}
|
|
679
679
|
return k;
|
|
680
680
|
}
|
|
681
681
|
function xr(h, m) {
|
|
682
|
-
var
|
|
683
|
-
return !!
|
|
682
|
+
var v = h == null ? 0 : h.length;
|
|
683
|
+
return !!v && vn(h, m, 0) > -1;
|
|
684
684
|
}
|
|
685
|
-
function Di(h, m,
|
|
685
|
+
function Di(h, m, v) {
|
|
686
686
|
for (var A = -1, D = h == null ? 0 : h.length; ++A < D; )
|
|
687
|
-
if (
|
|
687
|
+
if (v(m, h[A]))
|
|
688
688
|
return !0;
|
|
689
689
|
return !1;
|
|
690
690
|
}
|
|
691
691
|
function ne(h, m) {
|
|
692
|
-
for (var
|
|
693
|
-
D[
|
|
692
|
+
for (var v = -1, A = h == null ? 0 : h.length, D = Array(A); ++v < A; )
|
|
693
|
+
D[v] = m(h[v], v, h);
|
|
694
694
|
return D;
|
|
695
695
|
}
|
|
696
696
|
function Gt(h, m) {
|
|
697
|
-
for (var
|
|
698
|
-
h[D +
|
|
697
|
+
for (var v = -1, A = m.length, D = h.length; ++v < A; )
|
|
698
|
+
h[D + v] = m[v];
|
|
699
699
|
return h;
|
|
700
700
|
}
|
|
701
|
-
function Ni(h, m,
|
|
701
|
+
function Ni(h, m, v, A) {
|
|
702
702
|
var D = -1, k = h == null ? 0 : h.length;
|
|
703
|
-
for (A && k && (
|
|
704
|
-
|
|
705
|
-
return
|
|
703
|
+
for (A && k && (v = h[++D]); ++D < k; )
|
|
704
|
+
v = m(v, h[D], D, h);
|
|
705
|
+
return v;
|
|
706
706
|
}
|
|
707
|
-
function ja(h, m,
|
|
707
|
+
function ja(h, m, v, A) {
|
|
708
708
|
var D = h == null ? 0 : h.length;
|
|
709
|
-
for (A && D && (
|
|
710
|
-
|
|
711
|
-
return
|
|
709
|
+
for (A && D && (v = h[--D]); D--; )
|
|
710
|
+
v = m(v, h[D], D, h);
|
|
711
|
+
return v;
|
|
712
712
|
}
|
|
713
713
|
function Fi(h, m) {
|
|
714
|
-
for (var
|
|
715
|
-
if (m(h[
|
|
714
|
+
for (var v = -1, A = h == null ? 0 : h.length; ++v < A; )
|
|
715
|
+
if (m(h[v], v, h))
|
|
716
716
|
return !0;
|
|
717
717
|
return !1;
|
|
718
718
|
}
|
|
@@ -723,24 +723,24 @@ function Up() {
|
|
|
723
723
|
function nl(h) {
|
|
724
724
|
return h.match(la) || [];
|
|
725
725
|
}
|
|
726
|
-
function Ts(h, m,
|
|
726
|
+
function Ts(h, m, v) {
|
|
727
727
|
var A;
|
|
728
|
-
return
|
|
728
|
+
return v(h, function(D, k, ce) {
|
|
729
729
|
if (m(D, k, ce))
|
|
730
730
|
return A = k, !1;
|
|
731
731
|
}), A;
|
|
732
732
|
}
|
|
733
|
-
function Tr(h, m,
|
|
734
|
-
for (var D = h.length, k =
|
|
733
|
+
function Tr(h, m, v, A) {
|
|
734
|
+
for (var D = h.length, k = v + (A ? 1 : -1); A ? k-- : ++k < D; )
|
|
735
735
|
if (m(h[k], k, h))
|
|
736
736
|
return k;
|
|
737
737
|
return -1;
|
|
738
738
|
}
|
|
739
|
-
function vn(h, m,
|
|
740
|
-
return m === m ? dl(h, m,
|
|
739
|
+
function vn(h, m, v) {
|
|
740
|
+
return m === m ? dl(h, m, v) : Tr(h, ws, v);
|
|
741
741
|
}
|
|
742
|
-
function rl(h, m,
|
|
743
|
-
for (var D =
|
|
742
|
+
function rl(h, m, v, A) {
|
|
743
|
+
for (var D = v - 1, k = h.length; ++D < k; )
|
|
744
744
|
if (A(h[D], m))
|
|
745
745
|
return D;
|
|
746
746
|
return -1;
|
|
@@ -749,8 +749,8 @@ function Up() {
|
|
|
749
749
|
return h !== h;
|
|
750
750
|
}
|
|
751
751
|
function As(h, m) {
|
|
752
|
-
var
|
|
753
|
-
return
|
|
752
|
+
var v = h == null ? 0 : h.length;
|
|
753
|
+
return v ? Ui(h, m) / v : x;
|
|
754
754
|
}
|
|
755
755
|
function Bi(h) {
|
|
756
756
|
return function(m) {
|
|
@@ -762,32 +762,32 @@ function Up() {
|
|
|
762
762
|
return h == null ? i : h[m];
|
|
763
763
|
};
|
|
764
764
|
}
|
|
765
|
-
function ys(h, m,
|
|
765
|
+
function ys(h, m, v, A, D) {
|
|
766
766
|
return D(h, function(k, ce, J) {
|
|
767
|
-
|
|
768
|
-
}),
|
|
767
|
+
v = A ? (A = !1, k) : m(v, k, ce, J);
|
|
768
|
+
}), v;
|
|
769
769
|
}
|
|
770
770
|
function il(h, m) {
|
|
771
|
-
var
|
|
772
|
-
for (h.sort(m);
|
|
773
|
-
h[
|
|
771
|
+
var v = h.length;
|
|
772
|
+
for (h.sort(m); v--; )
|
|
773
|
+
h[v] = h[v].value;
|
|
774
774
|
return h;
|
|
775
775
|
}
|
|
776
776
|
function Ui(h, m) {
|
|
777
|
-
for (var
|
|
777
|
+
for (var v, A = -1, D = h.length; ++A < D; ) {
|
|
778
778
|
var k = m(h[A]);
|
|
779
|
-
k !== i && (
|
|
779
|
+
k !== i && (v = v === i ? k : v + k);
|
|
780
780
|
}
|
|
781
|
-
return
|
|
781
|
+
return v;
|
|
782
782
|
}
|
|
783
783
|
function Wi(h, m) {
|
|
784
|
-
for (var
|
|
785
|
-
A[
|
|
784
|
+
for (var v = -1, A = Array(h); ++v < h; )
|
|
785
|
+
A[v] = m(v);
|
|
786
786
|
return A;
|
|
787
787
|
}
|
|
788
788
|
function ul(h, m) {
|
|
789
|
-
return ne(m, function(
|
|
790
|
-
return [
|
|
789
|
+
return ne(m, function(v) {
|
|
790
|
+
return [v, h[v]];
|
|
791
791
|
});
|
|
792
792
|
}
|
|
793
793
|
function Os(h) {
|
|
@@ -799,26 +799,26 @@ function Up() {
|
|
|
799
799
|
};
|
|
800
800
|
}
|
|
801
801
|
function Gi(h, m) {
|
|
802
|
-
return ne(m, function(
|
|
803
|
-
return h[
|
|
802
|
+
return ne(m, function(v) {
|
|
803
|
+
return h[v];
|
|
804
804
|
});
|
|
805
805
|
}
|
|
806
806
|
function qn(h, m) {
|
|
807
807
|
return h.has(m);
|
|
808
808
|
}
|
|
809
809
|
function bs(h, m) {
|
|
810
|
-
for (var
|
|
810
|
+
for (var v = -1, A = h.length; ++v < A && vn(m, h[v], 0) > -1; )
|
|
811
811
|
;
|
|
812
|
-
return
|
|
812
|
+
return v;
|
|
813
813
|
}
|
|
814
814
|
function Cs(h, m) {
|
|
815
|
-
for (var
|
|
815
|
+
for (var v = h.length; v-- && vn(m, h[v], 0) > -1; )
|
|
816
816
|
;
|
|
817
|
-
return
|
|
817
|
+
return v;
|
|
818
818
|
}
|
|
819
819
|
function sl(h, m) {
|
|
820
|
-
for (var
|
|
821
|
-
h[
|
|
820
|
+
for (var v = h.length, A = 0; v--; )
|
|
821
|
+
h[v] === m && ++A;
|
|
822
822
|
return A;
|
|
823
823
|
}
|
|
824
824
|
var fl = Mi($a), ol = Mi(ka);
|
|
@@ -835,48 +835,48 @@ function Up() {
|
|
|
835
835
|
return Ha.test(h);
|
|
836
836
|
}
|
|
837
837
|
function hl(h) {
|
|
838
|
-
for (var m,
|
|
839
|
-
|
|
840
|
-
return
|
|
838
|
+
for (var m, v = []; !(m = h.next()).done; )
|
|
839
|
+
v.push(m.value);
|
|
840
|
+
return v;
|
|
841
841
|
}
|
|
842
842
|
function Hi(h) {
|
|
843
|
-
var m = -1,
|
|
843
|
+
var m = -1, v = Array(h.size);
|
|
844
844
|
return h.forEach(function(A, D) {
|
|
845
|
-
|
|
846
|
-
}),
|
|
845
|
+
v[++m] = [D, A];
|
|
846
|
+
}), v;
|
|
847
847
|
}
|
|
848
848
|
function Ps(h, m) {
|
|
849
|
-
return function(
|
|
850
|
-
return h(m(
|
|
849
|
+
return function(v) {
|
|
850
|
+
return h(m(v));
|
|
851
851
|
};
|
|
852
852
|
}
|
|
853
853
|
function Ht(h, m) {
|
|
854
|
-
for (var
|
|
855
|
-
var ce = h[
|
|
856
|
-
(ce === m || ce === z) && (h[
|
|
854
|
+
for (var v = -1, A = h.length, D = 0, k = []; ++v < A; ) {
|
|
855
|
+
var ce = h[v];
|
|
856
|
+
(ce === m || ce === z) && (h[v] = z, k[D++] = v);
|
|
857
857
|
}
|
|
858
858
|
return k;
|
|
859
859
|
}
|
|
860
860
|
function wr(h) {
|
|
861
|
-
var m = -1,
|
|
861
|
+
var m = -1, v = Array(h.size);
|
|
862
862
|
return h.forEach(function(A) {
|
|
863
|
-
|
|
864
|
-
}),
|
|
863
|
+
v[++m] = A;
|
|
864
|
+
}), v;
|
|
865
865
|
}
|
|
866
866
|
function gl(h) {
|
|
867
|
-
var m = -1,
|
|
867
|
+
var m = -1, v = Array(h.size);
|
|
868
868
|
return h.forEach(function(A) {
|
|
869
|
-
|
|
870
|
-
}),
|
|
869
|
+
v[++m] = [A, A];
|
|
870
|
+
}), v;
|
|
871
871
|
}
|
|
872
|
-
function dl(h, m,
|
|
873
|
-
for (var A =
|
|
872
|
+
function dl(h, m, v) {
|
|
873
|
+
for (var A = v - 1, D = h.length; ++A < D; )
|
|
874
874
|
if (h[A] === m)
|
|
875
875
|
return A;
|
|
876
876
|
return -1;
|
|
877
877
|
}
|
|
878
|
-
function _l(h, m,
|
|
879
|
-
for (var A =
|
|
878
|
+
function _l(h, m, v) {
|
|
879
|
+
for (var A = v + 1; A--; )
|
|
880
880
|
if (h[A] === m)
|
|
881
881
|
return A;
|
|
882
882
|
return A;
|
|
@@ -906,7 +906,7 @@ function Up() {
|
|
|
906
906
|
}
|
|
907
907
|
var Sl = function h(m) {
|
|
908
908
|
m = m == null ? Se : Sn.defaults(Se.Object(), m, Sn.pick(Se, qa));
|
|
909
|
-
var
|
|
909
|
+
var v = m.Array, A = m.Date, D = m.Error, k = m.Function, ce = m.Math, J = m.Object, qi = m.RegExp, El = m.String, Ve = m.TypeError, Ar = v.prototype, Il = k.prototype, En = J.prototype, yr = m["__core-js_shared__"], Or = Il.toString, X = En.hasOwnProperty, xl = 0, Ds = function() {
|
|
910
910
|
var e = /[^.]+$/.exec(yr && yr.keys && yr.keys.IE_PROTO || "");
|
|
911
911
|
return e ? "Symbol(src)_1." + e : "";
|
|
912
912
|
}(), br = En.toString, Tl = Or.call(J), wl = Se._, Al = qi(
|
|
@@ -1150,7 +1150,7 @@ function Up() {
|
|
|
1150
1150
|
var n = this.__data__;
|
|
1151
1151
|
if (n instanceof At) {
|
|
1152
1152
|
var r = n.__data__;
|
|
1153
|
-
if (!$n || r.length <
|
|
1153
|
+
if (!$n || r.length < p - 1)
|
|
1154
1154
|
return r.push([e, t]), this.size = ++n.size, this;
|
|
1155
1155
|
n = this.__data__ = new yt(r);
|
|
1156
1156
|
}
|
|
@@ -1210,7 +1210,7 @@ function Up() {
|
|
|
1210
1210
|
}) : e[t] = n;
|
|
1211
1211
|
}
|
|
1212
1212
|
function Ki(e, t) {
|
|
1213
|
-
for (var n = -1, r = t.length, s =
|
|
1213
|
+
for (var n = -1, r = t.length, s = v(r), o = e == null; ++n < r; )
|
|
1214
1214
|
s[n] = o ? i : yu(e, t[n]);
|
|
1215
1215
|
return s;
|
|
1216
1216
|
}
|
|
@@ -1282,7 +1282,7 @@ function Up() {
|
|
|
1282
1282
|
var s = -1, o = xr, a = !0, c = e.length, d = [], S = t.length;
|
|
1283
1283
|
if (!c)
|
|
1284
1284
|
return d;
|
|
1285
|
-
n && (t = ne(t, Ye(n))), r ? (o = Di, a = !1) : t.length >=
|
|
1285
|
+
n && (t = ne(t, Ye(n))), r ? (o = Di, a = !1) : t.length >= p && (o = qn, a = !1, t = new rn(t));
|
|
1286
1286
|
e:
|
|
1287
1287
|
for (; ++s < c; ) {
|
|
1288
1288
|
var E = e[s], I = n == null ? E : n(E);
|
|
@@ -1368,7 +1368,7 @@ function Up() {
|
|
|
1368
1368
|
return e >= Te(t, n) && e < he(t, n);
|
|
1369
1369
|
}
|
|
1370
1370
|
function Vi(e, t, n) {
|
|
1371
|
-
for (var r = n ? Di : xr, s = e[0].length, o = e.length, a = o, c =
|
|
1371
|
+
for (var r = n ? Di : xr, s = e[0].length, o = e.length, a = o, c = v(o), d = 1 / 0, S = []; a--; ) {
|
|
1372
1372
|
var E = e[a];
|
|
1373
1373
|
a && t && (E = ne(E, Ye(t))), d = Te(E.length, d), c[a] = !n && (t || s >= 120 && E.length >= 120) ? new rn(a && E) : i;
|
|
1374
1374
|
}
|
|
@@ -1496,7 +1496,7 @@ function Up() {
|
|
|
1496
1496
|
return e < t;
|
|
1497
1497
|
}
|
|
1498
1498
|
function js(e, t) {
|
|
1499
|
-
var n = -1, r = Fe(e) ?
|
|
1499
|
+
var n = -1, r = Fe(e) ? v(e.length) : [];
|
|
1500
1500
|
return Yt(e, function(s, o, a) {
|
|
1501
1501
|
r[++n] = t(s, o, a);
|
|
1502
1502
|
}), r;
|
|
@@ -1597,7 +1597,7 @@ function Up() {
|
|
|
1597
1597
|
return e + Br(Ws() * (t - e + 1));
|
|
1598
1598
|
}
|
|
1599
1599
|
function Nc(e, t, n, r) {
|
|
1600
|
-
for (var s = -1, o = he(Fr((t - e) / (n || 1)), 0), a =
|
|
1600
|
+
for (var s = -1, o = he(Fr((t - e) / (n || 1)), 0), a = v(o); o--; )
|
|
1601
1601
|
a[r ? o : ++s] = e, e += n;
|
|
1602
1602
|
return a;
|
|
1603
1603
|
}
|
|
@@ -1652,7 +1652,7 @@ function Up() {
|
|
|
1652
1652
|
function et(e, t, n) {
|
|
1653
1653
|
var r = -1, s = e.length;
|
|
1654
1654
|
t < 0 && (t = -t > s ? 0 : s + t), n = n > s ? s : n, n < 0 && (n += s), s = t > n ? 0 : n - t >>> 0, t >>>= 0;
|
|
1655
|
-
for (var o =
|
|
1655
|
+
for (var o = v(s); ++r < s; )
|
|
1656
1656
|
o[r] = e[r + t];
|
|
1657
1657
|
return o;
|
|
1658
1658
|
}
|
|
@@ -1714,7 +1714,7 @@ function Up() {
|
|
|
1714
1714
|
var r = -1, s = xr, o = e.length, a = !0, c = [], d = c;
|
|
1715
1715
|
if (n)
|
|
1716
1716
|
a = !1, s = Di;
|
|
1717
|
-
else if (o >=
|
|
1717
|
+
else if (o >= p) {
|
|
1718
1718
|
var S = t ? null : Jc(e);
|
|
1719
1719
|
if (S)
|
|
1720
1720
|
return wr(S);
|
|
@@ -1754,7 +1754,7 @@ function Up() {
|
|
|
1754
1754
|
var r = e.length;
|
|
1755
1755
|
if (r < 2)
|
|
1756
1756
|
return r ? $t(e[0]) : [];
|
|
1757
|
-
for (var s = -1, o =
|
|
1757
|
+
for (var s = -1, o = v(r); ++s < r; )
|
|
1758
1758
|
for (var a = e[s], c = -1; ++c < r; )
|
|
1759
1759
|
c != s && (o[s] = Zn(o[s] || a, e[c], t, n));
|
|
1760
1760
|
return $t(Ee(o, 1), t, n);
|
|
@@ -1831,7 +1831,7 @@ function Up() {
|
|
|
1831
1831
|
return e.index - t.index;
|
|
1832
1832
|
}
|
|
1833
1833
|
function vf(e, t, n, r) {
|
|
1834
|
-
for (var s = -1, o = e.length, a = n.length, c = -1, d = t.length, S = he(o - a, 0), E =
|
|
1834
|
+
for (var s = -1, o = e.length, a = n.length, c = -1, d = t.length, S = he(o - a, 0), E = v(d + S), I = !r; ++c < d; )
|
|
1835
1835
|
E[c] = t[c];
|
|
1836
1836
|
for (; ++s < a; )
|
|
1837
1837
|
(I || s < o) && (E[n[s]] = e[s]);
|
|
@@ -1840,7 +1840,7 @@ function Up() {
|
|
|
1840
1840
|
return E;
|
|
1841
1841
|
}
|
|
1842
1842
|
function mf(e, t, n, r) {
|
|
1843
|
-
for (var s = -1, o = e.length, a = -1, c = n.length, d = -1, S = t.length, E = he(o - c, 0), I =
|
|
1843
|
+
for (var s = -1, o = e.length, a = -1, c = n.length, d = -1, S = t.length, E = he(o - c, 0), I = v(E + S), w = !r; ++s < E; )
|
|
1844
1844
|
I[s] = e[s];
|
|
1845
1845
|
for (var O = s; ++d < S; )
|
|
1846
1846
|
I[O + d] = t[d];
|
|
@@ -1850,7 +1850,7 @@ function Up() {
|
|
|
1850
1850
|
}
|
|
1851
1851
|
function Ne(e, t) {
|
|
1852
1852
|
var n = -1, r = e.length;
|
|
1853
|
-
for (t || (t =
|
|
1853
|
+
for (t || (t = v(r)); ++n < r; )
|
|
1854
1854
|
t[n] = e[n];
|
|
1855
1855
|
return t;
|
|
1856
1856
|
}
|
|
@@ -1954,7 +1954,7 @@ function Up() {
|
|
|
1954
1954
|
function Xc(e, t, n) {
|
|
1955
1955
|
var r = jn(e);
|
|
1956
1956
|
function s() {
|
|
1957
|
-
for (var o = arguments.length, a =
|
|
1957
|
+
for (var o = arguments.length, a = v(o), c = o, d = yn(s); c--; )
|
|
1958
1958
|
a[c] = arguments[c];
|
|
1959
1959
|
var S = o < 3 && a[0] !== d && a[o - 1] !== d ? [] : Ht(a, d);
|
|
1960
1960
|
if (o -= S.length, o < n)
|
|
@@ -2016,7 +2016,7 @@ function Up() {
|
|
|
2016
2016
|
function Kr(e, t, n, r, s, o, a, c, d, S) {
|
|
2017
2017
|
var E = t & be, I = t & de, w = t & Oe, O = t & (xe | ft), C = t & Qt, B = w ? i : jn(e);
|
|
2018
2018
|
function P() {
|
|
2019
|
-
for (var G = arguments.length, $ =
|
|
2019
|
+
for (var G = arguments.length, $ = v(G), ze = G; ze--; )
|
|
2020
2020
|
$[ze] = arguments[ze];
|
|
2021
2021
|
if (O)
|
|
2022
2022
|
var Le = yn(P), Ke = sl($, Le);
|
|
@@ -2079,7 +2079,7 @@ function Up() {
|
|
|
2079
2079
|
function Zc(e, t, n, r) {
|
|
2080
2080
|
var s = t & de, o = jn(e);
|
|
2081
2081
|
function a() {
|
|
2082
|
-
for (var c = -1, d = arguments.length, S = -1, E = r.length, I =
|
|
2082
|
+
for (var c = -1, d = arguments.length, S = -1, E = r.length, I = v(E + d), w = this && this !== Se && this instanceof a ? o : e; ++S < E; )
|
|
2083
2083
|
I[S] = r[S];
|
|
2084
2084
|
for (; d--; )
|
|
2085
2085
|
I[S++] = arguments[++c];
|
|
@@ -2508,10 +2508,10 @@ function Up() {
|
|
|
2508
2508
|
}
|
|
2509
2509
|
function Bf(e, t, n) {
|
|
2510
2510
|
return t = he(t === i ? e.length - 1 : t, 0), function() {
|
|
2511
|
-
for (var r = arguments, s = -1, o = he(r.length - t, 0), a =
|
|
2511
|
+
for (var r = arguments, s = -1, o = he(r.length - t, 0), a = v(o); ++s < o; )
|
|
2512
2512
|
a[s] = r[t + s];
|
|
2513
2513
|
s = -1;
|
|
2514
|
-
for (var c =
|
|
2514
|
+
for (var c = v(t + 1); ++s < t; )
|
|
2515
2515
|
c[s] = r[s];
|
|
2516
2516
|
return c[t] = n(a), qe(e, this, c);
|
|
2517
2517
|
};
|
|
@@ -2599,7 +2599,7 @@ function Up() {
|
|
|
2599
2599
|
var r = e == null ? 0 : e.length;
|
|
2600
2600
|
if (!r || t < 1)
|
|
2601
2601
|
return [];
|
|
2602
|
-
for (var s = 0, o = 0, a =
|
|
2602
|
+
for (var s = 0, o = 0, a = v(Fr(r / t)); s < r; )
|
|
2603
2603
|
a[o++] = et(e, s, s += t);
|
|
2604
2604
|
return a;
|
|
2605
2605
|
}
|
|
@@ -2614,7 +2614,7 @@ function Up() {
|
|
|
2614
2614
|
var e = arguments.length;
|
|
2615
2615
|
if (!e)
|
|
2616
2616
|
return [];
|
|
2617
|
-
for (var t =
|
|
2617
|
+
for (var t = v(e - 1), n = arguments[0], r = e; r--; )
|
|
2618
2618
|
t[r - 1] = arguments[r];
|
|
2619
2619
|
return Gt(N(n) ? Ne(n) : [n], Ee(t, 1));
|
|
2620
2620
|
}
|
|
@@ -2962,7 +2962,7 @@ function Up() {
|
|
|
2962
2962
|
return n < 0 && (n = he(s + n, 0)), si(e) ? n <= s && e.indexOf(t, n) > -1 : !!s && vn(e, t, n) > -1;
|
|
2963
2963
|
}
|
|
2964
2964
|
var Bg = U(function(e, t, n) {
|
|
2965
|
-
var r = -1, s = typeof t == "function", o = Fe(e) ?
|
|
2965
|
+
var r = -1, s = typeof t == "function", o = Fe(e) ? v(e.length) : [];
|
|
2966
2966
|
return Yt(e, function(a) {
|
|
2967
2967
|
o[++r] = s ? qe(t, a, n) : Jn(a, t, n);
|
|
2968
2968
|
}), o;
|
|
@@ -3235,7 +3235,7 @@ function Up() {
|
|
|
3235
3235
|
return arguments;
|
|
3236
3236
|
}()) ? Js : function(e) {
|
|
3237
3237
|
return fe(e) && X.call(e, "callee") && !Bs.call(e, "callee");
|
|
3238
|
-
}, N =
|
|
3238
|
+
}, N = v.isArray, _d = vs ? Ye(vs) : xc;
|
|
3239
3239
|
function Fe(e) {
|
|
3240
3240
|
return e != null && ui(e.length) && !Lt(e);
|
|
3241
3241
|
}
|
|
@@ -4028,15 +4028,15 @@ function ar(g) {
|
|
|
4028
4028
|
}
|
|
4029
4029
|
function Yu(g, u) {
|
|
4030
4030
|
const i = new RegExp(/"(.*?)"/g);
|
|
4031
|
-
let l = u,
|
|
4031
|
+
let l = u, p = [], R, T = !1;
|
|
4032
4032
|
for (; (R = i.exec(u)) !== null && T === !1; ) {
|
|
4033
4033
|
const z = ar(String(R[1])), W = Wp(g, z);
|
|
4034
|
-
W === void 0 ? T = !0 : (
|
|
4034
|
+
W === void 0 ? T = !0 : (p = p.concat(W), l = l.replace(R[0], ""));
|
|
4035
4035
|
}
|
|
4036
4036
|
if (T)
|
|
4037
4037
|
return;
|
|
4038
4038
|
const y = ar(l), M = Gp(g, y);
|
|
4039
|
-
return M === void 0 ? void 0 : (
|
|
4039
|
+
return M === void 0 ? void 0 : (p = p.concat(M), p.sort((z, W) => z - W));
|
|
4040
4040
|
}
|
|
4041
4041
|
function Wp(g, u) {
|
|
4042
4042
|
const i = g.indexOf(u);
|
|
@@ -4045,13 +4045,13 @@ function Wp(g, u) {
|
|
|
4045
4045
|
}
|
|
4046
4046
|
function Gp(g, u) {
|
|
4047
4047
|
const i = Array.from(u), l = [];
|
|
4048
|
-
let
|
|
4048
|
+
let p = g, R = 0, T = !1;
|
|
4049
4049
|
for (const y of i) {
|
|
4050
|
-
const M =
|
|
4050
|
+
const M = p.indexOf(y);
|
|
4051
4051
|
if (M === -1 && (T = !0), T === !1) {
|
|
4052
4052
|
l.push(R + M);
|
|
4053
4053
|
const Y = M + 1;
|
|
4054
|
-
R += Y,
|
|
4054
|
+
R += Y, p = p.substring(Y);
|
|
4055
4055
|
}
|
|
4056
4056
|
}
|
|
4057
4057
|
if (!T)
|
|
@@ -4067,15 +4067,15 @@ const $u = class $u {
|
|
|
4067
4067
|
}
|
|
4068
4068
|
getSourceCharacterIndex(u) {
|
|
4069
4069
|
let i = 0;
|
|
4070
|
-
return _(this, lr).reduce((l,
|
|
4070
|
+
return _(this, lr).reduce((l, p) => {
|
|
4071
4071
|
if (l !== 1 / 0)
|
|
4072
4072
|
return l;
|
|
4073
|
-
const R = i +
|
|
4073
|
+
const R = i + p.value.length;
|
|
4074
4074
|
if (u >= i && u <= R) {
|
|
4075
4075
|
const T = u - i;
|
|
4076
|
-
l =
|
|
4076
|
+
l = p.index + T;
|
|
4077
4077
|
}
|
|
4078
|
-
return i +=
|
|
4078
|
+
return i += p.value.length, l;
|
|
4079
4079
|
}, 1 / 0);
|
|
4080
4080
|
}
|
|
4081
4081
|
/**
|
|
@@ -4083,28 +4083,28 @@ const $u = class $u {
|
|
|
4083
4083
|
*/
|
|
4084
4084
|
static composeTransformedHaystackSegments(u) {
|
|
4085
4085
|
const i = u.matchAll(/[\w\d]+/g), l = [];
|
|
4086
|
-
for (const
|
|
4087
|
-
l.push({ value:
|
|
4086
|
+
for (const p of i)
|
|
4087
|
+
l.push({ value: p[0], index: p.index, length: p[0].length });
|
|
4088
4088
|
return l;
|
|
4089
4089
|
}
|
|
4090
4090
|
};
|
|
4091
4091
|
lr = new WeakMap();
|
|
4092
4092
|
let Uu = $u;
|
|
4093
4093
|
function Hp(g, u) {
|
|
4094
|
-
return (Array.isArray(g) ? g : [g]).map((
|
|
4095
|
-
if (
|
|
4096
|
-
return
|
|
4094
|
+
return (Array.isArray(g) ? g : [g]).map((p) => new Uu(p)).reduce((p, R) => {
|
|
4095
|
+
if (p !== void 0)
|
|
4096
|
+
return p;
|
|
4097
4097
|
const T = Yu(R.transformed, u);
|
|
4098
4098
|
if (T === void 0)
|
|
4099
|
-
return
|
|
4099
|
+
return p;
|
|
4100
4100
|
const y = qp(T, R.transformed), M = Yp(R, y);
|
|
4101
4101
|
return $p(M);
|
|
4102
4102
|
}, void 0);
|
|
4103
4103
|
}
|
|
4104
4104
|
function qp(g, u) {
|
|
4105
4105
|
const i = [...g], l = [];
|
|
4106
|
-
let
|
|
4107
|
-
for (; i.length > 0 &&
|
|
4106
|
+
let p = 0;
|
|
4107
|
+
for (; i.length > 0 && p < 100; ) {
|
|
4108
4108
|
const R = i.at(0);
|
|
4109
4109
|
if (R === void 0)
|
|
4110
4110
|
throw new Error("Should never get here");
|
|
@@ -4119,13 +4119,13 @@ function qp(g, u) {
|
|
|
4119
4119
|
value: Y,
|
|
4120
4120
|
is_match: !0,
|
|
4121
4121
|
length: Y.length
|
|
4122
|
-
}), i.splice(0, T),
|
|
4122
|
+
}), i.splice(0, T), p += 1;
|
|
4123
4123
|
}
|
|
4124
4124
|
return l;
|
|
4125
4125
|
}
|
|
4126
4126
|
function Yp(g, u) {
|
|
4127
|
-
return u.reduce((i, l,
|
|
4128
|
-
if (
|
|
4127
|
+
return u.reduce((i, l, p) => {
|
|
4128
|
+
if (p === 0 && l.index !== 0) {
|
|
4129
4129
|
const Y = g.source.substring(0, g.getSourceCharacterIndex(l.index));
|
|
4130
4130
|
i.push({
|
|
4131
4131
|
index: 0,
|
|
@@ -4141,7 +4141,7 @@ function Yp(g, u) {
|
|
|
4141
4141
|
is_match: !0,
|
|
4142
4142
|
length: y.length
|
|
4143
4143
|
});
|
|
4144
|
-
const M = u.at(
|
|
4144
|
+
const M = u.at(p + 1);
|
|
4145
4145
|
if (M) {
|
|
4146
4146
|
const Y = g.getSourceCharacterIndex(l.index + l.length), z = g.getSourceCharacterIndex(M.index), W = g.source.substring(Y, z);
|
|
4147
4147
|
i.push({
|
|
@@ -4164,11 +4164,11 @@ function Yp(g, u) {
|
|
|
4164
4164
|
}
|
|
4165
4165
|
function $p(g) {
|
|
4166
4166
|
const u = /\S/, i = [...g];
|
|
4167
|
-
return i.forEach((l,
|
|
4167
|
+
return i.forEach((l, p) => {
|
|
4168
4168
|
if (l.is_match) {
|
|
4169
4169
|
const R = l.value.search(u);
|
|
4170
4170
|
if (R !== 0) {
|
|
4171
|
-
const T = i.at(
|
|
4171
|
+
const T = i.at(p - 1);
|
|
4172
4172
|
T && (T.length += R, T.value += l.value.substring(0, R), l.value = l.value.substring(R), l.index = l.index + R);
|
|
4173
4173
|
}
|
|
4174
4174
|
}
|
|
@@ -4176,13 +4176,13 @@ function $p(g) {
|
|
|
4176
4176
|
}
|
|
4177
4177
|
function kp(g, u) {
|
|
4178
4178
|
return (Array.isArray(g) ? g : [g]).some((l) => {
|
|
4179
|
-
const
|
|
4180
|
-
return Yu(
|
|
4179
|
+
const p = ar(l);
|
|
4180
|
+
return Yu(p, u) !== void 0;
|
|
4181
4181
|
});
|
|
4182
4182
|
}
|
|
4183
4183
|
function zp({ needle: g, haystack: u, Match: i, Miss: l }) {
|
|
4184
|
-
const
|
|
4185
|
-
return
|
|
4184
|
+
const p = Pp(() => Hp(u, g), [u, g]);
|
|
4185
|
+
return p === void 0 ? u : p.map((R, T) => {
|
|
4186
4186
|
const y = [R.value, T].join();
|
|
4187
4187
|
return i !== void 0 && R.is_match ? typeof i == "string" ? /* @__PURE__ */ Ae.jsx(i, { "data-is-match": R.is_match, children: R.value }, y) : /* @__PURE__ */ Ae.jsx(i, { "data-is-match": R.is_match, segment: R, segmentIndex: T }, y) : l !== void 0 ? typeof l == "string" ? /* @__PURE__ */ Ae.jsx(l, { "data-is-match": R.is_match, children: R.value }, y) : /* @__PURE__ */ Ae.jsx(l, { "data-is-match": R.is_match, segment: R, segmentIndex: T }, y) : R.value;
|
|
4188
4188
|
});
|
|
@@ -4257,9 +4257,9 @@ class st extends Error {
|
|
|
4257
4257
|
}
|
|
4258
4258
|
function Jp(g, u) {
|
|
4259
4259
|
const i = g.length / u.length;
|
|
4260
|
-
let l = 1,
|
|
4260
|
+
let l = 1, p = 1, R = 0;
|
|
4261
4261
|
for (let T = 0; T < g.length; T += 1)
|
|
4262
|
-
R !== void 0 && g.at(T) === R + 1 && (
|
|
4262
|
+
R !== void 0 && g.at(T) === R + 1 && (p += 1, p >= l && (l = p)), R = g.at(T);
|
|
4263
4263
|
return { percentOfHaystackMatched: i, longestSequentialSequence: l };
|
|
4264
4264
|
}
|
|
4265
4265
|
var Ue;
|
|
@@ -4318,7 +4318,7 @@ class Uo {
|
|
|
4318
4318
|
static process(u, i, l) {
|
|
4319
4319
|
if (u.rule === void 0 || u.searchTerm === "")
|
|
4320
4320
|
return i;
|
|
4321
|
-
const
|
|
4321
|
+
const p = i.reduce((y, M) => {
|
|
4322
4322
|
var ue;
|
|
4323
4323
|
if (((ue = u.rule) == null ? void 0 : ue.searchFn) === void 0)
|
|
4324
4324
|
return y;
|
|
@@ -4331,9 +4331,9 @@ class Uo {
|
|
|
4331
4331
|
ge && y.push({ item: M, score: ge });
|
|
4332
4332
|
}
|
|
4333
4333
|
return y;
|
|
4334
|
-
}, []), R =
|
|
4334
|
+
}, []), R = p.reduce((y, M) => (M.score.longestSequentialSequence > y && (y = M.score.longestSequentialSequence), y), 0);
|
|
4335
4335
|
return He.orderBy(
|
|
4336
|
-
|
|
4336
|
+
p,
|
|
4337
4337
|
[
|
|
4338
4338
|
(y) => {
|
|
4339
4339
|
const M = y.score.percentOfHaystackMatched * 100, Y = y.score.longestSequentialSequence / R * 100;
|
|
@@ -4353,7 +4353,7 @@ const or = class or {
|
|
|
4353
4353
|
q(this, We, u ?? {}), q(this, De, i);
|
|
4354
4354
|
}
|
|
4355
4355
|
set(u, i) {
|
|
4356
|
-
const l = this.getRule(u),
|
|
4356
|
+
const l = this.getRule(u), p = this.get(u);
|
|
4357
4357
|
_(this, De).debouncer.has(l.id) === !1 && _(this, De).debouncer.register(l.id, l.debounceMilliseconds), _(this, De).debouncer.call(l.id, () => {
|
|
4358
4358
|
if (_(this, De).isDisabled())
|
|
4359
4359
|
return;
|
|
@@ -4362,7 +4362,7 @@ const or = class or {
|
|
|
4362
4362
|
source: Ie.FILTERS,
|
|
4363
4363
|
event: ie.SET_FILTER,
|
|
4364
4364
|
current: i,
|
|
4365
|
-
initial:
|
|
4365
|
+
initial: p,
|
|
4366
4366
|
rule: l
|
|
4367
4367
|
}));
|
|
4368
4368
|
});
|
|
@@ -4374,7 +4374,7 @@ const or = class or {
|
|
|
4374
4374
|
return this.rules.filter((u) => or.isRuleActive(u, _(this, We)[u.id]));
|
|
4375
4375
|
}
|
|
4376
4376
|
get(u) {
|
|
4377
|
-
var
|
|
4377
|
+
var p;
|
|
4378
4378
|
const i = this.getRule(u), l = _(this, We)[i.id];
|
|
4379
4379
|
if (l === void 0) {
|
|
4380
4380
|
if (i.defaultValue)
|
|
@@ -4383,7 +4383,7 @@ const or = class or {
|
|
|
4383
4383
|
if (i.boolean)
|
|
4384
4384
|
return !0;
|
|
4385
4385
|
if (Array.isArray(i.options) && i.options.length > 0)
|
|
4386
|
-
return (
|
|
4386
|
+
return (p = i.options.at(0)) == null ? void 0 : p.value;
|
|
4387
4387
|
}
|
|
4388
4388
|
if (i.multiple)
|
|
4389
4389
|
return [];
|
|
@@ -4394,11 +4394,13 @@ const or = class or {
|
|
|
4394
4394
|
}
|
|
4395
4395
|
has(u, i) {
|
|
4396
4396
|
var T;
|
|
4397
|
-
const l = this.getRule(u),
|
|
4397
|
+
const l = this.getRule(u), p = this.get(l);
|
|
4398
|
+
if (l.boolean)
|
|
4399
|
+
return p;
|
|
4398
4400
|
if (i === void 0)
|
|
4399
|
-
return
|
|
4401
|
+
return p !== void 0;
|
|
4400
4402
|
const R = (T = l.options) == null ? void 0 : T.find((y) => typeof i == "object" && "value" in i ? y.value === i.value : y.value === i);
|
|
4401
|
-
return R === void 0 ? !1 : l.multiple && Array.isArray(
|
|
4403
|
+
return R === void 0 ? !1 : l.multiple && Array.isArray(p) ? p.includes(R.value) : p === R.value;
|
|
4402
4404
|
}
|
|
4403
4405
|
getRule(u) {
|
|
4404
4406
|
const i = _(this, De).getRuleBook().getRule(u);
|
|
@@ -4425,15 +4427,15 @@ const or = class or {
|
|
|
4425
4427
|
throw new st(ut.TOGGLING_OPTION_ON_RULE_WITH_NO_OPTIONS, { identifier: u, optionValue: i });
|
|
4426
4428
|
if (l.multiple === !1)
|
|
4427
4429
|
throw new st(ut.TOGGLING_OPTION_ON_RULE_WITH_SINGLE_VALUE, { identifier: u, optionValue: i });
|
|
4428
|
-
const
|
|
4429
|
-
if (
|
|
4430
|
+
const p = l.options.find((T) => typeof i == "object" && "value" in i ? T.value === i.value : T.value === i);
|
|
4431
|
+
if (p === void 0)
|
|
4430
4432
|
throw new st(ut.TOGGLING_OPTION_THAT_DOES_NOT_EXIST, { identifier: u, optionValue: i });
|
|
4431
4433
|
const R = _(this, We)[l.id] ?? [];
|
|
4432
|
-
if (R.includes(
|
|
4433
|
-
this.set(l, [...R.filter((T) => T !==
|
|
4434
|
+
if (R.includes(p.value)) {
|
|
4435
|
+
this.set(l, [...R.filter((T) => T !== p.value)]);
|
|
4434
4436
|
return;
|
|
4435
4437
|
}
|
|
4436
|
-
this.set(l, [...R,
|
|
4438
|
+
this.set(l, [...R, p.value]);
|
|
4437
4439
|
}
|
|
4438
4440
|
test(u) {
|
|
4439
4441
|
if (_(this, De).isLoading())
|
|
@@ -4445,10 +4447,10 @@ const or = class or {
|
|
|
4445
4447
|
return _(this, De).test({ filters: { rules: u.rules, values: u.values ?? {} } });
|
|
4446
4448
|
}
|
|
4447
4449
|
testRule({ rule: u, value: i, ...l }) {
|
|
4448
|
-
const
|
|
4450
|
+
const p = this.getRule(u);
|
|
4449
4451
|
return this.test({
|
|
4450
|
-
rules: [
|
|
4451
|
-
values: { [
|
|
4452
|
+
rules: [p],
|
|
4453
|
+
values: { [p.id]: i },
|
|
4452
4454
|
...l
|
|
4453
4455
|
});
|
|
4454
4456
|
}
|
|
@@ -4457,11 +4459,11 @@ const or = class or {
|
|
|
4457
4459
|
return /* @__PURE__ */ new Map();
|
|
4458
4460
|
const l = this.getRule(u);
|
|
4459
4461
|
if (l.boolean === !0) {
|
|
4460
|
-
const
|
|
4461
|
-
return
|
|
4462
|
+
const p = /* @__PURE__ */ new Map();
|
|
4463
|
+
return p.set(!0, this.testRule({ rule: l, value: !0, ...i })), p.set(!1, this.testRule({ rule: l, value: !1, ...i })), p;
|
|
4462
4464
|
}
|
|
4463
4465
|
if (Array.isArray(l.options)) {
|
|
4464
|
-
const
|
|
4466
|
+
const p = /* @__PURE__ */ new Map();
|
|
4465
4467
|
return l.options.forEach((R) => {
|
|
4466
4468
|
let T;
|
|
4467
4469
|
if (i.mergeExistingValue) {
|
|
@@ -4469,8 +4471,8 @@ const or = class or {
|
|
|
4469
4471
|
l.multiple && (T = [...y, R.value]);
|
|
4470
4472
|
} else
|
|
4471
4473
|
l.multiple ? T = [R.value] : T = R.value;
|
|
4472
|
-
|
|
4473
|
-
}),
|
|
4474
|
+
p.set(R, this.testRule({ rule: l, value: T, ...i }));
|
|
4475
|
+
}), p;
|
|
4474
4476
|
}
|
|
4475
4477
|
throw new st(ut.TESTING_OPTIONS_ON_RULE_WITH_NO_OPTIONS, l);
|
|
4476
4478
|
}
|
|
@@ -4488,8 +4490,8 @@ const or = class or {
|
|
|
4488
4490
|
};
|
|
4489
4491
|
}
|
|
4490
4492
|
static process(u, i, l) {
|
|
4491
|
-
const
|
|
4492
|
-
return
|
|
4493
|
+
const p = u.rules.filter((R) => or.isRuleActive(R, u.values[R.id]));
|
|
4494
|
+
return p.length === 0 ? i : i.filter((R) => p.every((T) => T.filterFn(R, u.values[T.id], l)));
|
|
4493
4495
|
}
|
|
4494
4496
|
static isRuleActive(u, i) {
|
|
4495
4497
|
return u.required ? !0 : !(i === void 0 || u.multiple && Array.isArray(i) && i.length === 0 || u.boolean && i === !1 || typeof i == "string" && i.trim() === "");
|
|
@@ -4556,12 +4558,12 @@ class Wo {
|
|
|
4556
4558
|
set(u, i) {
|
|
4557
4559
|
if (_(this, Et).isDisabled() || !this.activeRule)
|
|
4558
4560
|
return;
|
|
4559
|
-
const l = _(this, rt),
|
|
4561
|
+
const l = _(this, rt), p = _(this, ln), R = u ? this.getRule(u) : void 0;
|
|
4560
4562
|
q(this, ln, R), q(this, rt, i), _(this, Et).touch({
|
|
4561
4563
|
source: Ie.SORT_BY,
|
|
4562
4564
|
event: ie.SET_SORT_BY,
|
|
4563
4565
|
current: { rule: R == null ? void 0 : R.id, sortDirection: i },
|
|
4564
|
-
initial: { rule:
|
|
4566
|
+
initial: { rule: p == null ? void 0 : p.id, sortDirection: l },
|
|
4565
4567
|
rule: this.activeRule
|
|
4566
4568
|
});
|
|
4567
4569
|
}
|
|
@@ -4577,9 +4579,9 @@ class Wo {
|
|
|
4577
4579
|
static process(u, i, l) {
|
|
4578
4580
|
return u.rule === void 0 ? i : He.orderBy(
|
|
4579
4581
|
i,
|
|
4580
|
-
(
|
|
4582
|
+
(p) => {
|
|
4581
4583
|
var R;
|
|
4582
|
-
return typeof ((R = u.rule) == null ? void 0 : R.sortFn) == "function" ? u.rule.sortFn(
|
|
4584
|
+
return typeof ((R = u.rule) == null ? void 0 : R.sortFn) == "function" ? u.rule.sortFn(p, l) : Number.NEGATIVE_INFINITY;
|
|
4583
4585
|
},
|
|
4584
4586
|
u.sortDirection
|
|
4585
4587
|
);
|
|
@@ -4619,8 +4621,8 @@ class Go {
|
|
|
4619
4621
|
return;
|
|
4620
4622
|
const i = _(this, Xt);
|
|
4621
4623
|
let l;
|
|
4622
|
-
const
|
|
4623
|
-
|
|
4624
|
+
const p = typeof u == "string" && u.trim() === "";
|
|
4625
|
+
p && (l = void 0), p === !1 && u !== void 0 && (l = this.getRule(u)), _(this, Xt) !== l && (q(this, Xt, l), q(this, Zt, void 0), _(this, Bt).touch({
|
|
4624
4626
|
source: Ie.GROUP_BY,
|
|
4625
4627
|
event: ie.SET_GROUP_BY,
|
|
4626
4628
|
current: l == null ? void 0 : l.id,
|
|
@@ -4657,10 +4659,10 @@ class Go {
|
|
|
4657
4659
|
}
|
|
4658
4660
|
static process(u, i, l) {
|
|
4659
4661
|
var Y, z;
|
|
4660
|
-
const
|
|
4662
|
+
const p = He.groupBy(i, (W) => {
|
|
4661
4663
|
var ue;
|
|
4662
4664
|
return (ue = u.rule) == null ? void 0 : ue.groupFn(W, l);
|
|
4663
|
-
}), R = Object.entries(
|
|
4665
|
+
}), R = Object.entries(p).map(([W, ue]) => ({
|
|
4664
4666
|
id: W,
|
|
4665
4667
|
items: ue
|
|
4666
4668
|
})), T = ((Y = u.rule) == null ? void 0 : Y.sticky) !== void 0, y = [], M = [];
|
|
@@ -4673,11 +4675,11 @@ class Go {
|
|
|
4673
4675
|
}
|
|
4674
4676
|
Xt = new WeakMap(), Zt = new WeakMap(), Bt = new WeakMap();
|
|
4675
4677
|
function Vp(g) {
|
|
4676
|
-
var l,
|
|
4678
|
+
var l, p;
|
|
4677
4679
|
let u = [];
|
|
4678
4680
|
((l = g.sticky) == null ? void 0 : l.header) !== void 0 && (Array.isArray(g.sticky.header) && (u = g.sticky.header), typeof g.sticky.header == "string" && (u = [g.sticky.header]));
|
|
4679
4681
|
let i = [];
|
|
4680
|
-
return ((
|
|
4682
|
+
return ((p = g.sticky) == null ? void 0 : p.footer) !== void 0 && (Array.isArray(g.sticky.footer) && (i = g.sticky.footer), typeof g.sticky.footer == "string" && (i = [g.sticky.footer])), (R) => {
|
|
4681
4683
|
if (u.includes(R.id)) {
|
|
4682
4684
|
const T = u.findIndex((M) => R.id === M);
|
|
4683
4685
|
return (u.length - T) * -1;
|
|
@@ -4771,10 +4773,10 @@ class jp {
|
|
|
4771
4773
|
}
|
|
4772
4774
|
hydrateDefinitions(u, i) {
|
|
4773
4775
|
this.ruleEffects = _(this, cr).map((l) => {
|
|
4774
|
-
const
|
|
4776
|
+
const p = typeof l.rules == "function" ? l.rules(u, i) : l.rules, R = Array.isArray(p) ? p : [p];
|
|
4775
4777
|
return { ...l, rules: R, _isHydrated: !0 };
|
|
4776
4778
|
}), this.searchEffects = _(this, hr).map((l) => {
|
|
4777
|
-
const
|
|
4779
|
+
const p = typeof l.haystack == "function" ? l.haystack(u, i) : l.haystack, R = Array.isArray(p) ? p : [p];
|
|
4778
4780
|
return { ...l, haystack: R, _isHydrated: !0 };
|
|
4779
4781
|
});
|
|
4780
4782
|
}
|
|
@@ -4815,8 +4817,8 @@ class ev {
|
|
|
4815
4817
|
if (_(this, cn))
|
|
4816
4818
|
return;
|
|
4817
4819
|
const l = _(this, It).get(u);
|
|
4818
|
-
l == null || l.forEach((
|
|
4819
|
-
|
|
4820
|
+
l == null || l.forEach((p) => {
|
|
4821
|
+
p(i);
|
|
4820
4822
|
});
|
|
4821
4823
|
}
|
|
4822
4824
|
silently(u) {
|
|
@@ -4862,15 +4864,15 @@ const hi = class hi {
|
|
|
4862
4864
|
if (u.length === 0)
|
|
4863
4865
|
return !1;
|
|
4864
4866
|
const i = [li, Co, Wu, Gu], l = /* @__PURE__ */ new Set();
|
|
4865
|
-
return u.forEach((
|
|
4866
|
-
if (
|
|
4867
|
-
throw new st(ut.INVALID_RULE_WITHOUT_ID,
|
|
4868
|
-
if (i.some((R) => R(
|
|
4869
|
-
throw new st(ut.INVALID_RULE_SHAPE,
|
|
4870
|
-
if (
|
|
4871
|
-
if (l.has(
|
|
4872
|
-
throw new st(ut.INVALID_RULE_DUPLICATE,
|
|
4873
|
-
l.add(
|
|
4867
|
+
return u.forEach((p) => {
|
|
4868
|
+
if (p.id === void 0 && !li(p))
|
|
4869
|
+
throw new st(ut.INVALID_RULE_WITHOUT_ID, p);
|
|
4870
|
+
if (i.some((R) => R(p)) === !1)
|
|
4871
|
+
throw new st(ut.INVALID_RULE_SHAPE, p);
|
|
4872
|
+
if (p.id) {
|
|
4873
|
+
if (l.has(p.id))
|
|
4874
|
+
throw new st(ut.INVALID_RULE_DUPLICATE, p);
|
|
4875
|
+
l.add(p.id);
|
|
4874
4876
|
}
|
|
4875
4877
|
}), !0;
|
|
4876
4878
|
}
|
|
@@ -4885,20 +4887,20 @@ class fr {
|
|
|
4885
4887
|
this.isStale = u;
|
|
4886
4888
|
}
|
|
4887
4889
|
takeSnapshot({ items: u, context: i, mixins: l }) {
|
|
4888
|
-
const
|
|
4890
|
+
const p = fr.test({ mixins: l, items: u, context: i }), R = l.pagination ? Ho.process(l.pagination, p) : p;
|
|
4889
4891
|
let T = [];
|
|
4890
4892
|
const y = l.groupBy !== void 0;
|
|
4891
4893
|
l.groupBy && (T = Go.process(l.groupBy, R, i)), this.snapshot = {
|
|
4892
4894
|
items: y ? void 0 : R,
|
|
4893
4895
|
groups: y ? T : void 0,
|
|
4894
|
-
numMatchedItems:
|
|
4896
|
+
numMatchedItems: p.length,
|
|
4895
4897
|
numTotalItems: u.length,
|
|
4896
4898
|
hasGroupByRule: y
|
|
4897
4899
|
};
|
|
4898
4900
|
}
|
|
4899
4901
|
static test({ mixins: u, items: i, context: l }) {
|
|
4900
|
-
let
|
|
4901
|
-
return u.search && (
|
|
4902
|
+
let p = [...i];
|
|
4903
|
+
return u.search && (p = Uo.process(u.search, p, l)), u.filters && (p = ci.process(u.filters, p, l)), u.sortBy && (p = Wo.process(u.sortBy, p, l)), p;
|
|
4902
4904
|
}
|
|
4903
4905
|
}
|
|
4904
4906
|
var Mt, Pn, gr, ve, xt, dt, Vt, Ge, qo, sr, Yo, qu;
|
|
@@ -4906,7 +4908,7 @@ class tv {
|
|
|
4906
4908
|
constructor(u, {
|
|
4907
4909
|
rules: i,
|
|
4908
4910
|
effects: l,
|
|
4909
|
-
initialSearchTerm:
|
|
4911
|
+
initialSearchTerm: p,
|
|
4910
4912
|
initialSortBy: R,
|
|
4911
4913
|
initialSortDirection: T,
|
|
4912
4914
|
initialGroupBy: y,
|
|
@@ -4941,7 +4943,7 @@ class tv {
|
|
|
4941
4943
|
touch: (Q) => Ft(this, Ge, qo).call(this, Q),
|
|
4942
4944
|
debouncer: new Qp()
|
|
4943
4945
|
};
|
|
4944
|
-
this.search = new Uo({ initialSearchTerm:
|
|
4946
|
+
this.search = new Uo({ initialSearchTerm: p }, le), this.filters = new ci({ initialFilters: M }, le), this.sortBy = new Wo({ initialSortBy: R, initialSortDirection: T }, le), this.groupBy = new Go({ initialGroupBy: y, requireGroup: !!ge }, le), this.pagination = new Ho({ page: z, numItemsPerPage: W }, le), this.updatedAt = Date.now(), q(this, xt, new fr()), this.context = Y, q(this, gr, ye), _(this, ve).silently(() => {
|
|
4945
4947
|
const Q = {
|
|
4946
4948
|
source: Ie.CORE,
|
|
4947
4949
|
event: ie.INIT,
|
|
@@ -5219,7 +5221,7 @@ function $o({
|
|
|
5219
5221
|
rules: u,
|
|
5220
5222
|
effects: i,
|
|
5221
5223
|
initialSearchTerm: l,
|
|
5222
|
-
initialSortBy:
|
|
5224
|
+
initialSortBy: p,
|
|
5223
5225
|
initialSortDirection: R,
|
|
5224
5226
|
initialGroupBy: T,
|
|
5225
5227
|
initialFilters: y,
|
|
@@ -5245,7 +5247,7 @@ function $o({
|
|
|
5245
5247
|
rules: u,
|
|
5246
5248
|
effects: i,
|
|
5247
5249
|
initialSearchTerm: l,
|
|
5248
|
-
initialSortBy:
|
|
5250
|
+
initialSortBy: p,
|
|
5249
5251
|
initialSortDirection: R,
|
|
5250
5252
|
initialGroupBy: T,
|
|
5251
5253
|
initialFilters: y,
|