bitz-react-admin-ui 2.9.0 → 2.9.1

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.
Files changed (50) hide show
  1. package/dist/_virtual/index.mjs +2 -2
  2. package/dist/_virtual/index2.mjs +2 -2
  3. package/dist/_virtual/lodash.mjs +4 -0
  4. package/dist/components/BitzTable/Store/utils/index.d.ts +3 -1
  5. package/dist/components/BitzTable/Store/utils/index.mjs +26 -38
  6. package/dist/components/BitzTable/ToolBar/ColConfigIcon/ColumnsSort/index.mjs +144 -142
  7. package/dist/components/BitzTable/ToolBar/ColConfigIcon/StylesConfig/index.mjs +55 -49
  8. package/dist/components/BitzTable/ToolBar/index.d.ts +3 -0
  9. package/dist/node_modules/classnames/index.mjs +1 -1
  10. package/dist/node_modules/lodash/lodash.mjs +3680 -0
  11. package/dist/node_modules/lodash-es/_SetCache.mjs +13 -0
  12. package/dist/node_modules/lodash-es/_arrayIncludes.mjs +8 -0
  13. package/dist/node_modules/lodash-es/_arrayIncludesWith.mjs +9 -0
  14. package/dist/node_modules/lodash-es/_arraySome.mjs +9 -0
  15. package/dist/node_modules/lodash-es/_baseFindIndex.mjs +9 -0
  16. package/dist/node_modules/lodash-es/_baseForOwn.mjs +8 -0
  17. package/dist/node_modules/lodash-es/_baseHasIn.mjs +6 -0
  18. package/dist/node_modules/lodash-es/_baseIndexOf.mjs +9 -0
  19. package/dist/node_modules/lodash-es/_baseIsEqual.mjs +8 -0
  20. package/dist/node_modules/lodash-es/_baseIsEqualDeep.mjs +32 -0
  21. package/dist/node_modules/lodash-es/_baseIsMatch.mjs +31 -0
  22. package/dist/node_modules/lodash-es/_baseIsNaN.mjs +6 -0
  23. package/dist/node_modules/lodash-es/_baseIteratee.mjs +11 -0
  24. package/dist/node_modules/lodash-es/_baseMatches.mjs +12 -0
  25. package/dist/node_modules/lodash-es/_baseMatchesProperty.mjs +17 -0
  26. package/dist/node_modules/lodash-es/_baseProperty.mjs +8 -0
  27. package/dist/node_modules/lodash-es/_basePropertyDeep.mjs +9 -0
  28. package/dist/node_modules/lodash-es/_baseUniq.mjs +34 -0
  29. package/dist/node_modules/lodash-es/_cacheHas.mjs +6 -0
  30. package/dist/node_modules/lodash-es/_createSet.mjs +10 -0
  31. package/dist/node_modules/lodash-es/_equalArrays.mjs +40 -0
  32. package/dist/node_modules/lodash-es/_equalByTag.mjs +45 -0
  33. package/dist/node_modules/lodash-es/_equalObjects.mjs +36 -0
  34. package/dist/node_modules/lodash-es/_getMatchData.mjs +12 -0
  35. package/dist/node_modules/lodash-es/_hasPath.mjs +19 -0
  36. package/dist/node_modules/lodash-es/_isStrictComparable.mjs +7 -0
  37. package/dist/node_modules/lodash-es/_mapToArray.mjs +9 -0
  38. package/dist/node_modules/lodash-es/_matchesStrictComparable.mjs +8 -0
  39. package/dist/node_modules/lodash-es/_setCacheAdd.mjs +7 -0
  40. package/dist/node_modules/lodash-es/_setCacheHas.mjs +6 -0
  41. package/dist/node_modules/lodash-es/_setToArray.mjs +9 -0
  42. package/dist/node_modules/lodash-es/_strictIndexOf.mjs +9 -0
  43. package/dist/node_modules/lodash-es/hasIn.mjs +8 -0
  44. package/dist/node_modules/lodash-es/mapValues.mjs +12 -0
  45. package/dist/node_modules/lodash-es/noop.mjs +5 -0
  46. package/dist/node_modules/lodash-es/property.mjs +10 -0
  47. package/dist/node_modules/lodash-es/uniq.mjs +7 -0
  48. package/dist/node_modules/prop-types/index.mjs +1 -1
  49. package/dist/style.css +1 -1
  50. package/package.json +1 -1
@@ -0,0 +1,13 @@
1
+ import p from "./_MapCache.mjs";
2
+ import h from "./_setCacheAdd.mjs";
3
+ import r from "./_setCacheHas.mjs";
4
+ function e(t) {
5
+ var o = -1, a = t == null ? 0 : t.length;
6
+ for (this.__data__ = new p(); ++o < a; )
7
+ this.add(t[o]);
8
+ }
9
+ e.prototype.add = e.prototype.push = h;
10
+ e.prototype.has = r;
11
+ export {
12
+ e as default
13
+ };
@@ -0,0 +1,8 @@
1
+ import l from "./_baseIndexOf.mjs";
2
+ function f(e, n) {
3
+ var t = e == null ? 0 : e.length;
4
+ return !!t && l(e, n, 0) > -1;
5
+ }
6
+ export {
7
+ f as default
8
+ };
@@ -0,0 +1,9 @@
1
+ function i(e, t, l) {
2
+ for (var n = -1, u = e == null ? 0 : e.length; ++n < u; )
3
+ if (l(t, e[n]))
4
+ return !0;
5
+ return !1;
6
+ }
7
+ export {
8
+ i as default
9
+ };
@@ -0,0 +1,9 @@
1
+ function u(e, t) {
2
+ for (var n = -1, l = e == null ? 0 : e.length; ++n < l; )
3
+ if (t(e[n], n, e))
4
+ return !0;
5
+ return !1;
6
+ }
7
+ export {
8
+ u as default
9
+ };
@@ -0,0 +1,9 @@
1
+ function u(n, d, i, t) {
2
+ for (var l = n.length, e = i + (t ? 1 : -1); t ? e-- : ++e < l; )
3
+ if (d(n[e], e, n))
4
+ return e;
5
+ return -1;
6
+ }
7
+ export {
8
+ u as default
9
+ };
@@ -0,0 +1,8 @@
1
+ import e from "./_baseFor.mjs";
2
+ import t from "./keys.mjs";
3
+ function m(r, o) {
4
+ return r && e(r, o, t);
5
+ }
6
+ export {
7
+ m as default
8
+ };
@@ -0,0 +1,6 @@
1
+ function e(n, a) {
2
+ return n != null && a in Object(n);
3
+ }
4
+ export {
5
+ e as default
6
+ };
@@ -0,0 +1,9 @@
1
+ import e from "./_baseFindIndex.mjs";
2
+ import f from "./_baseIsNaN.mjs";
3
+ import i from "./_strictIndexOf.mjs";
4
+ function d(o, t, r) {
5
+ return t === t ? i(o, t, r) : e(o, f, r);
6
+ }
7
+ export {
8
+ d as default
9
+ };
@@ -0,0 +1,8 @@
1
+ import u from "./_baseIsEqualDeep.mjs";
2
+ import r from "./isObjectLike.mjs";
3
+ function m(i, n, f, s, t) {
4
+ return i === n ? !0 : i == null || n == null || !r(i) && !r(n) ? i !== i && n !== n : u(i, n, f, s, m, t);
5
+ }
6
+ export {
7
+ m as default
8
+ };
@@ -0,0 +1,32 @@
1
+ import v from "./_Stack.mjs";
2
+ import B from "./_equalArrays.mjs";
3
+ import E from "./_equalByTag.mjs";
4
+ import L from "./_equalObjects.mjs";
5
+ import _ from "./_getTag.mjs";
6
+ import O from "./isArray.mjs";
7
+ import u from "./isBuffer.mjs";
8
+ import R from "./isTypedArray.mjs";
9
+ var S = 1, w = "[object Arguments]", P = "[object Array]", l = "[object Object]", q = Object.prototype, I = q.hasOwnProperty;
10
+ function K(r, f, p, i, g, a) {
11
+ var m = O(r), j = O(f), e = m ? P : _(r), o = j ? P : _(f);
12
+ e = e == w ? l : e, o = o == w ? l : o;
13
+ var A = e == l, d = o == l, n = e == o;
14
+ if (n && u(r)) {
15
+ if (!u(f))
16
+ return !1;
17
+ m = !0, A = !1;
18
+ }
19
+ if (n && !A)
20
+ return a || (a = new v()), m || R(r) ? B(r, f, p, i, g, a) : E(r, f, e, p, i, g, a);
21
+ if (!(p & S)) {
22
+ var y = A && I.call(r, "__wrapped__"), T = d && I.call(f, "__wrapped__");
23
+ if (y || T) {
24
+ var s = y ? r.value() : r, t = T ? f.value() : f;
25
+ return a || (a = new v()), g(s, t, p, i, a);
26
+ }
27
+ }
28
+ return n ? (a || (a = new v()), L(r, f, p, i, g, a)) : !1;
29
+ }
30
+ export {
31
+ K as default
32
+ };
@@ -0,0 +1,31 @@
1
+ import _ from "./_Stack.mjs";
2
+ import h from "./_baseIsEqual.mjs";
3
+ var p = 1, w = 2;
4
+ function L(n, O, e, i) {
5
+ var f = e.length, v = f, A = !i;
6
+ if (n == null)
7
+ return !v;
8
+ for (n = Object(n); f--; ) {
9
+ var r = e[f];
10
+ if (A && r[2] ? r[1] !== n[r[0]] : !(r[0] in n))
11
+ return !1;
12
+ }
13
+ for (; ++f < v; ) {
14
+ r = e[f];
15
+ var l = r[0], u = n[l], E = r[1];
16
+ if (A && r[2]) {
17
+ if (u === void 0 && !(l in n))
18
+ return !1;
19
+ } else {
20
+ var R = new _();
21
+ if (i)
22
+ var s = i(u, E, l, n, O, R);
23
+ if (!(s === void 0 ? h(E, u, p | w, i, R) : s))
24
+ return !1;
25
+ }
26
+ }
27
+ return !0;
28
+ }
29
+ export {
30
+ L as default
31
+ };
@@ -0,0 +1,6 @@
1
+ function a(t) {
2
+ return t !== t;
3
+ }
4
+ export {
5
+ a as default
6
+ };
@@ -0,0 +1,11 @@
1
+ import t from "./_baseMatches.mjs";
2
+ import o from "./_baseMatchesProperty.mjs";
3
+ import f from "./identity.mjs";
4
+ import i from "./isArray.mjs";
5
+ import e from "./property.mjs";
6
+ function c(r) {
7
+ return typeof r == "function" ? r : r == null ? f : typeof r == "object" ? i(r) ? o(r[0], r[1]) : t(r) : e(r);
8
+ }
9
+ export {
10
+ c as default
11
+ };
@@ -0,0 +1,12 @@
1
+ import e from "./_baseIsMatch.mjs";
2
+ import m from "./_getMatchData.mjs";
3
+ import n from "./_matchesStrictComparable.mjs";
4
+ function h(a) {
5
+ var t = m(a);
6
+ return t.length == 1 && t[0][2] ? n(t[0][0], t[0][1]) : function(r) {
7
+ return r === a || e(r, a, t);
8
+ };
9
+ }
10
+ export {
11
+ h as default
12
+ };
@@ -0,0 +1,17 @@
1
+ import i from "./_baseIsEqual.mjs";
2
+ import e from "./get.mjs";
3
+ import f from "./hasIn.mjs";
4
+ import n from "./_isKey.mjs";
5
+ import a from "./_isStrictComparable.mjs";
6
+ import p from "./_matchesStrictComparable.mjs";
7
+ import s from "./_toKey.mjs";
8
+ var u = 1, A = 2;
9
+ function y(r, o) {
10
+ return n(r) && a(o) ? p(s(r), o) : function(m) {
11
+ var t = e(m, r);
12
+ return t === void 0 && t === o ? f(m, r) : i(o, t, u | A);
13
+ };
14
+ }
15
+ export {
16
+ y as default
17
+ };
@@ -0,0 +1,8 @@
1
+ function r(e) {
2
+ return function(n) {
3
+ return n == null ? void 0 : n[e];
4
+ };
5
+ }
6
+ export {
7
+ r as default
8
+ };
@@ -0,0 +1,9 @@
1
+ import t from "./_baseGet.mjs";
2
+ function o(e) {
3
+ return function(r) {
4
+ return t(r, e);
5
+ };
6
+ }
7
+ export {
8
+ o as default
9
+ };
@@ -0,0 +1,34 @@
1
+ import A from "./_SetCache.mjs";
2
+ import g from "./_arrayIncludes.mjs";
3
+ import w from "./_arrayIncludesWith.mjs";
4
+ import R from "./_cacheHas.mjs";
5
+ import S from "./_createSet.mjs";
6
+ import c from "./_setToArray.mjs";
7
+ var C = 200;
8
+ function x(h, n, l) {
9
+ var m = -1, o = g, t = h.length, e = !0, f = [], i = f;
10
+ if (l)
11
+ e = !1, o = w;
12
+ else if (t >= C) {
13
+ var p = n ? null : S(h);
14
+ if (p)
15
+ return c(p);
16
+ e = !1, o = R, i = new A();
17
+ } else
18
+ i = n ? [] : f;
19
+ i:
20
+ for (; ++m < t; ) {
21
+ var r = h[m], s = n ? n(r) : r;
22
+ if (r = l || r !== 0 ? r : 0, e && s === s) {
23
+ for (var u = i.length; u--; )
24
+ if (i[u] === s)
25
+ continue i;
26
+ n && i.push(s), f.push(r);
27
+ } else
28
+ o(i, s, l) || (i !== f && i.push(s), f.push(r));
29
+ }
30
+ return f;
31
+ }
32
+ export {
33
+ x as default
34
+ };
@@ -0,0 +1,6 @@
1
+ function t(a, e) {
2
+ return a.has(e);
3
+ }
4
+ export {
5
+ t as default
6
+ };
@@ -0,0 +1,10 @@
1
+ import r from "./_Set.mjs";
2
+ import e from "./noop.mjs";
3
+ import o from "./_setToArray.mjs";
4
+ var a = 1 / 0, n = r && 1 / o(new r([, -0]))[1] == a ? function(t) {
5
+ return new r(t);
6
+ } : e;
7
+ const c = n;
8
+ export {
9
+ c as default
10
+ };
@@ -0,0 +1,40 @@
1
+ import D from "./_SetCache.mjs";
2
+ import G from "./_arraySome.mjs";
3
+ import M from "./_cacheHas.mjs";
4
+ var x = 1, F = 2;
5
+ function U(n, e, A, d, p, f) {
6
+ var E = A & x, R = n.length, P = e.length;
7
+ if (R != P && !(E && P > R))
8
+ return !1;
9
+ var S = f.get(n), _ = f.get(e);
10
+ if (S && _)
11
+ return S == e && _ == n;
12
+ var v = -1, g = !0, l = A & F ? new D() : void 0;
13
+ for (f.set(n, e), f.set(e, n); ++v < R; ) {
14
+ var i = n[v], L = e[v];
15
+ if (d)
16
+ var C = E ? d(L, i, v, e, n, f) : d(i, L, v, n, e, f);
17
+ if (C !== void 0) {
18
+ if (C)
19
+ continue;
20
+ g = !1;
21
+ break;
22
+ }
23
+ if (l) {
24
+ if (!G(e, function(O, w) {
25
+ if (!M(l, w) && (i === O || p(i, O, A, d, f)))
26
+ return l.push(w);
27
+ })) {
28
+ g = !1;
29
+ break;
30
+ }
31
+ } else if (!(i === L || p(i, L, A, d, f))) {
32
+ g = !1;
33
+ break;
34
+ }
35
+ }
36
+ return f.delete(n), f.delete(e), g;
37
+ }
38
+ export {
39
+ U as default
40
+ };
@@ -0,0 +1,45 @@
1
+ import m from "./_Symbol.mjs";
2
+ import t from "./_Uint8Array.mjs";
3
+ import A from "./eq.mjs";
4
+ import b from "./_equalArrays.mjs";
5
+ import o from "./_mapToArray.mjs";
6
+ import d from "./_setToArray.mjs";
7
+ var L = 1, O = 2, v = "[object Boolean]", E = "[object Date]", R = "[object Error]", w = "[object Map]", B = "[object Number]", D = "[object RegExp]", P = "[object Set]", S = "[object String]", _ = "[object Symbol]", c = "[object ArrayBuffer]", x = "[object DataView]", i = m ? m.prototype : void 0, n = i ? i.valueOf : void 0;
8
+ function N(e, a, l, s, y, u, r) {
9
+ switch (l) {
10
+ case x:
11
+ if (e.byteLength != a.byteLength || e.byteOffset != a.byteOffset)
12
+ return !1;
13
+ e = e.buffer, a = a.buffer;
14
+ case c:
15
+ return !(e.byteLength != a.byteLength || !u(new t(e), new t(a)));
16
+ case v:
17
+ case E:
18
+ case B:
19
+ return A(+e, +a);
20
+ case R:
21
+ return e.name == a.name && e.message == a.message;
22
+ case D:
23
+ case S:
24
+ return e == a + "";
25
+ case w:
26
+ var f = o;
27
+ case P:
28
+ var T = s & L;
29
+ if (f || (f = d), e.size != a.size && !T)
30
+ return !1;
31
+ var g = r.get(e);
32
+ if (g)
33
+ return g == a;
34
+ s |= O, r.set(e, a);
35
+ var p = b(f(e), f(a), s, y, u, r);
36
+ return r.delete(e), p;
37
+ case _:
38
+ if (n)
39
+ return n.call(e) == n.call(a);
40
+ }
41
+ return !1;
42
+ }
43
+ export {
44
+ N as default
45
+ };
@@ -0,0 +1,36 @@
1
+ import x from "./_getAllKeys.mjs";
2
+ var q = 1, E = Object.prototype, F = E.hasOwnProperty;
3
+ function I(r, n, A, a, R, f) {
4
+ var v = A & q, d = x(r), g = d.length, S = x(n), _ = S.length;
5
+ if (g != _ && !v)
6
+ return !1;
7
+ for (var l = g; l--; ) {
8
+ var i = d[l];
9
+ if (!(v ? i in n : F.call(n, i)))
10
+ return !1;
11
+ }
12
+ var O = f.get(r), w = f.get(n);
13
+ if (O && w)
14
+ return O == n && w == r;
15
+ var s = !0;
16
+ f.set(r, n), f.set(n, r);
17
+ for (var t = v; ++l < g; ) {
18
+ i = d[l];
19
+ var p = r[i], e = n[i];
20
+ if (a)
21
+ var L = v ? a(e, p, i, n, r, f) : a(p, e, i, r, n, f);
22
+ if (!(L === void 0 ? p === e || R(p, e, A, a, f) : L)) {
23
+ s = !1;
24
+ break;
25
+ }
26
+ t || (t = i == "constructor");
27
+ }
28
+ if (s && !t) {
29
+ var u = r.constructor, P = n.constructor;
30
+ u != P && "constructor" in r && "constructor" in n && !(typeof u == "function" && u instanceof u && typeof P == "function" && P instanceof P) && (s = !1);
31
+ }
32
+ return f.delete(r), f.delete(n), s;
33
+ }
34
+ export {
35
+ I as default
36
+ };
@@ -0,0 +1,12 @@
1
+ import o from "./_isStrictComparable.mjs";
2
+ import l from "./keys.mjs";
3
+ function f(a) {
4
+ for (var t = l(a), r = t.length; r--; ) {
5
+ var e = t[r], i = a[e];
6
+ t[r] = [e, i, o(i)];
7
+ }
8
+ return t;
9
+ }
10
+ export {
11
+ f as default
12
+ };
@@ -0,0 +1,19 @@
1
+ import t from "./_castPath.mjs";
2
+ import a from "./isArguments.mjs";
3
+ import u from "./isArray.mjs";
4
+ import o from "./_isIndex.mjs";
5
+ import e from "./isLength.mjs";
6
+ import g from "./_toKey.mjs";
7
+ function P(r, m, s) {
8
+ m = t(m, r);
9
+ for (var n = -1, i = m.length, f = !1; ++n < i; ) {
10
+ var l = g(m[n]);
11
+ if (!(f = r != null && s(r, l)))
12
+ break;
13
+ r = r[l];
14
+ }
15
+ return f || ++n != i ? f : (i = r == null ? 0 : r.length, !!i && e(i) && o(l, i) && (u(r) || a(r)));
16
+ }
17
+ export {
18
+ P as default
19
+ };
@@ -0,0 +1,7 @@
1
+ import r from "./isObject.mjs";
2
+ function o(t) {
3
+ return t === t && !r(t);
4
+ }
5
+ export {
6
+ o as default
7
+ };
@@ -0,0 +1,9 @@
1
+ function o(r) {
2
+ var e = -1, a = Array(r.size);
3
+ return r.forEach(function(n, t) {
4
+ a[++e] = [t, n];
5
+ }), a;
6
+ }
7
+ export {
8
+ o as default
9
+ };
@@ -0,0 +1,8 @@
1
+ function e(t, r) {
2
+ return function(n) {
3
+ return n == null ? !1 : n[t] === r && (r !== void 0 || t in Object(n));
4
+ };
5
+ }
6
+ export {
7
+ e as default
8
+ };
@@ -0,0 +1,7 @@
1
+ var t = "__lodash_hash_undefined__";
2
+ function a(_) {
3
+ return this.__data__.set(_, t), this;
4
+ }
5
+ export {
6
+ a as default
7
+ };
@@ -0,0 +1,6 @@
1
+ function t(a) {
2
+ return this.__data__.has(a);
3
+ }
4
+ export {
5
+ t as default
6
+ };
@@ -0,0 +1,9 @@
1
+ function t(r) {
2
+ var e = -1, a = Array(r.size);
3
+ return r.forEach(function(n) {
4
+ a[++e] = n;
5
+ }), a;
6
+ }
7
+ export {
8
+ t as default
9
+ };
@@ -0,0 +1,9 @@
1
+ function f(t, n, i) {
2
+ for (var e = i - 1, r = t.length; ++e < r; )
3
+ if (t[e] === n)
4
+ return e;
5
+ return -1;
6
+ }
7
+ export {
8
+ f as default
9
+ };
@@ -0,0 +1,8 @@
1
+ import n from "./_baseHasIn.mjs";
2
+ import t from "./_hasPath.mjs";
3
+ function f(a, r) {
4
+ return a != null && t(a, r, n);
5
+ }
6
+ export {
7
+ f as default
8
+ };
@@ -0,0 +1,12 @@
1
+ import t from "./_baseAssignValue.mjs";
2
+ import u from "./_baseForOwn.mjs";
3
+ import f from "./_baseIteratee.mjs";
4
+ function l(s, r) {
5
+ var o = {};
6
+ return r = f(r), u(s, function(m, a, n) {
7
+ t(o, a, r(m, a, n));
8
+ }), o;
9
+ }
10
+ export {
11
+ l as default
12
+ };
@@ -0,0 +1,5 @@
1
+ function o() {
2
+ }
3
+ export {
4
+ o as default
5
+ };
@@ -0,0 +1,10 @@
1
+ import o from "./_baseProperty.mjs";
2
+ import e from "./_basePropertyDeep.mjs";
3
+ import t from "./_isKey.mjs";
4
+ import m from "./_toKey.mjs";
5
+ function s(r) {
6
+ return t(r) ? o(m(r)) : e(r);
7
+ }
8
+ export {
9
+ s as default
10
+ };
@@ -0,0 +1,7 @@
1
+ import t from "./_baseUniq.mjs";
2
+ function i(n) {
3
+ return n && n.length ? t(n) : [];
4
+ }
5
+ export {
6
+ i as default
7
+ };
@@ -1,5 +1,5 @@
1
1
  import { getDefaultExportFromCjs as e } from "../../_virtual/_commonjsHelpers.mjs";
2
- import { __module as r } from "../../_virtual/index.mjs";
2
+ import { __module as r } from "../../_virtual/index2.mjs";
3
3
  import { __require as o } from "../react-is/index.mjs";
4
4
  import { __require as p } from "./factoryWithTypeCheckers.mjs";
5
5
  import { __require as t } from "./factoryWithThrowingShims.mjs";