@boxcustodia/library 1.7.0 → 1.7.1-canary.0

package/dist/index.es385.js

@@ -1,7 +1,155 @@
-function i(e) {
-  if (e === void 0) throw new ReferenceError("this hasn't been initialised - super() hasn't been called");
-  return e;
+import { __exports as s } from "./index.es446.js";
+import { __require as k } from "./index.es447.js";
+import { __require as D } from "./index.es439.js";
+import { __require as H } from "./index.es384.js";
+var S;
+function W() {
+  if (S) return s;
+  S = 1, Object.defineProperty(s, "__esModule", {
+    value: !0
+  }), s.default = void 0;
+  var h = k(), E = g(D()), b = g(H());
+  function g(r) {
+    return r && r.__esModule ? r : { default: r };
+  }
+  function v(r, t) {
+    return x(r) || T(r, t) || A(r, t) || R();
+  }
+  function R() {
+    throw new TypeError(`Invalid attempt to destructure non-iterable instance.
+In order to be iterable, non-array objects must have a [Symbol.iterator]() method.`);
+  }
+  function T(r, t) {
+    var e = r == null ? null : typeof Symbol < "u" && r[Symbol.iterator] || r["@@iterator"];
+    if (e != null) {
+      var n = [], a = !0, u = !1, f, l;
+      try {
+        for (e = e.call(r); !(a = (f = e.next()).done) && (n.push(f.value), !(t && n.length === t)); a = !0)
+          ;
+      } catch (i) {
+        u = !0, l = i;
+      } finally {
+        try {
+          !a && e.return != null && e.return();
+        } finally {
+          if (u) throw l;
+        }
+      }
+      return n;
+    }
+  }
+  function x(r) {
+    if (Array.isArray(r)) return r;
+  }
+  function C(r, t) {
+    var e = typeof Symbol < "u" && r[Symbol.iterator] || r["@@iterator"];
+    if (!e) {
+      if (Array.isArray(r) || (e = A(r)) || t) {
+        e && (r = e);
+        var n = 0, a = function() {
+        };
+        return { s: a, n: function() {
+          return n >= r.length ? { done: !0 } : { done: !1, value: r[n++] };
+        }, e: function(c) {
+          throw c;
+        }, f: a };
+      }
+      throw new TypeError(`Invalid attempt to iterate non-iterable instance.
+In order to be iterable, non-array objects must have a [Symbol.iterator]() method.`);
+    }
+    var u = !0, f = !1, l;
+    return { s: function() {
+      e = e.call(r);
+    }, n: function() {
+      var c = e.next();
+      return u = c.done, c;
+    }, e: function(c) {
+      f = !0, l = c;
+    }, f: function() {
+      try {
+        !u && e.return != null && e.return();
+      } finally {
+        if (f) throw l;
+      }
+    } };
+  }
+  function A(r, t) {
+    if (r) {
+      if (typeof r == "string") return q(r, t);
+      var e = Object.prototype.toString.call(r).slice(8, -1);
+      if (e === "Object" && r.constructor && (e = r.constructor.name), e === "Map" || e === "Set") return Array.from(r);
+      if (e === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(e)) return q(r, t);
+    }
+  }
+  function q(r, t) {
+    (t == null || t > r.length) && (t = r.length);
+    for (var e = 0, n = new Array(t); e < t; e++)
+      n[e] = r[e];
+    return n;
+  }
+  for (var o = [], M = b.default.keys(), d = 0; d < M.length; d++) {
+    var m = M[d], y = b.default.get(m);
+    if (y)
+      for (var I = [].concat(y.baseConcepts, y.relatedConcepts), p = 0; p < I.length; p++) {
+        var w = I[p];
+        w.module === "HTML" && function() {
+          var r = w.concept;
+          if (r) {
+            var t = o.find(function(u) {
+              return (0, h.dequal)(u, r);
+            }), e;
+            t ? e = t[1] : e = [];
+            for (var n = !0, a = 0; a < e.length; a++)
+              if (e[a] === m) {
+                n = !1;
+                break;
+              }
+            n && e.push(m), o.push([r, e]);
+          }
+        }();
+      }
+  }
+  var _ = {
+    entries: function() {
+      return o;
+    },
+    forEach: function(t) {
+      var e = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : null, n = C(o), a;
+      try {
+        for (n.s(); !(a = n.n()).done; ) {
+          var u = v(a.value, 2), f = u[0], l = u[1];
+          t.call(e, l, f, o);
+        }
+      } catch (i) {
+        n.e(i);
+      } finally {
+        n.f();
+      }
+    },
+    get: function(t) {
+      var e = o.find(function(n) {
+        return t.name === n[0].name && (0, h.dequal)(t.attributes, n[0].attributes);
+      });
+      return e && e[1];
+    },
+    has: function(t) {
+      return !!_.get(t);
+    },
+    keys: function() {
+      return o.map(function(t) {
+        var e = v(t, 1), n = e[0];
+        return n;
+      });
+    },
+    values: function() {
+      return o.map(function(t) {
+        var e = v(t, 2), n = e[1];
+        return n;
+      });
+    }
+  }, O = (0, E.default)(_, _.entries());
+  return s.default = O, s;
 }
 export {
-  i as default
+  W as __require
 };

package/dist/index.es386.js

@@ -1,5 +1,145 @@
-import t from "react";
-const o = t.createContext(null);
+import { __exports as c } from "./index.es448.js";
+import { __require as H } from "./index.es439.js";
+import { __require as j } from "./index.es384.js";
+var S;
+function P() {
+  if (S) return c;
+  S = 1, Object.defineProperty(c, "__esModule", {
+    value: !0
+  }), c.default = void 0;
+  var T = b(H()), h = b(j());
+  function b(r) {
+    return r && r.__esModule ? r : { default: r };
+  }
+  function v(r, t) {
+    return x(r) || k(r, t) || g(r, t) || R();
+  }
+  function R() {
+    throw new TypeError(`Invalid attempt to destructure non-iterable instance.
+In order to be iterable, non-array objects must have a [Symbol.iterator]() method.`);
+  }
+  function k(r, t) {
+    var e = r == null ? null : typeof Symbol < "u" && r[Symbol.iterator] || r["@@iterator"];
+    if (e != null) {
+      var n = [], u = !0, o = !1, f, l;
+      try {
+        for (e = e.call(r); !(u = (f = e.next()).done) && (n.push(f.value), !(t && n.length === t)); u = !0)
+          ;
+      } catch (a) {
+        o = !0, l = a;
+      } finally {
+        try {
+          !u && e.return != null && e.return();
+        } finally {
+          if (o) throw l;
+        }
+      }
+      return n;
+    }
+  }
+  function x(r) {
+    if (Array.isArray(r)) return r;
+  }
+  function O(r, t) {
+    var e = typeof Symbol < "u" && r[Symbol.iterator] || r["@@iterator"];
+    if (!e) {
+      if (Array.isArray(r) || (e = g(r)) || t) {
+        e && (r = e);
+        var n = 0, u = function() {
+        };
+        return { s: u, n: function() {
+          return n >= r.length ? { done: !0 } : { done: !1, value: r[n++] };
+        }, e: function(s) {
+          throw s;
+        }, f: u };
+      }
+      throw new TypeError(`Invalid attempt to iterate non-iterable instance.
+In order to be iterable, non-array objects must have a [Symbol.iterator]() method.`);
+    }
+    var o = !0, f = !1, l;
+    return { s: function() {
+      e = e.call(r);
+    }, n: function() {
+      var s = e.next();
+      return o = s.done, s;
+    }, e: function(s) {
+      f = !0, l = s;
+    }, f: function() {
+      try {
+        !o && e.return != null && e.return();
+      } finally {
+        if (f) throw l;
+      }
+    } };
+  }
+  function g(r, t) {
+    if (r) {
+      if (typeof r == "string") return A(r, t);
+      var e = Object.prototype.toString.call(r).slice(8, -1);
+      if (e === "Object" && r.constructor && (e = r.constructor.name), e === "Map" || e === "Set") return Array.from(r);
+      if (e === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(e)) return A(r, t);
+    }
+  }
+  function A(r, t) {
+    (t == null || t > r.length) && (t = r.length);
+    for (var e = 0, n = new Array(t); e < t; e++)
+      n[e] = r[e];
+    return n;
+  }
+  for (var i = [], E = h.default.keys(), y = 0; y < E.length; y++) {
+    var M = E[y], d = h.default.get(M), m = [];
+    if (d) {
+      for (var I = [].concat(d.baseConcepts, d.relatedConcepts), p = 0; p < I.length; p++) {
+        var q = I[p];
+        if (q.module === "HTML") {
+          var w = q.concept;
+          w != null && m.push(w);
+        }
+      }
+      m.length > 0 && i.push([M, m]);
+    }
+  }
+  var _ = {
+    entries: function() {
+      return i;
+    },
+    forEach: function(t) {
+      var e = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : null, n = O(i), u;
+      try {
+        for (n.s(); !(u = n.n()).done; ) {
+          var o = v(u.value, 2), f = o[0], l = o[1];
+          t.call(e, l, f, i);
+        }
+      } catch (a) {
+        n.e(a);
+      } finally {
+        n.f();
+      }
+    },
+    get: function(t) {
+      var e = i.find(function(n) {
+        return n[0] === t;
+      });
+      return e && e[1];
+    },
+    has: function(t) {
+      return !!_.get(t);
+    },
+    keys: function() {
+      return i.map(function(t) {
+        var e = v(t, 1), n = e[0];
+        return n;
+      });
+    },
+    values: function() {
+      return i.map(function(t) {
+        var e = v(t, 2), n = e[1];
+        return n;
+      });
+    }
+  }, D = (0, T.default)(_, _.entries());
+  return c.default = D, c;
+}
 export {
-  o as default
+  P as __require
 };

package/dist/index.es387.js

@@ -1,74 +1,202 @@
-import { isValidElement as v, cloneElement as d, Children as s } from "react";
-function h(i, e) {
-  var t = function(a) {
-    return e && v(a) ? e(a) : a;
-  }, u = /* @__PURE__ */ Object.create(null);
-  return i && s.map(i, function(r) {
-    return r;
-  }).forEach(function(r) {
-    u[r.key] = t(r);
-  }), u;
-}
-function m(i, e) {
-  i = i || {}, e = e || {};
-  function t(g) {
-    return g in e ? e[g] : i[g];
-  }
-  var u = /* @__PURE__ */ Object.create(null), r = [];
-  for (var a in i)
-    a in e ? r.length && (u[a] = r, r = []) : r.push(a);
-  var n, f = {};
-  for (var l in e) {
-    if (u[l])
-      for (n = 0; n < u[l].length; n++) {
-        var c = u[l][n];
-        f[u[l][n]] = t(c);
+import { __module as x } from "./index.es388.js";
+var U;
+function k() {
+  return U ? x.exports : (U = 1, function(S) {
+    var m = function() {
+      var A = String.fromCharCode, M = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=", g = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+-$", y = {};
+      function O(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];
       }
-    f[l] = t(l);
-  }
-  for (n = 0; n < r.length; n++)
-    f[r[n]] = t(r[n]);
-  return f;
-}
-function o(i, e, t) {
-  return t[e] != null ? t[e] : i.props[e];
-}
-function E(i, e) {
-  return h(i.children, function(t) {
-    return d(t, {
-      onExited: e.bind(null, t),
-      in: !0,
-      appear: o(t, "appear", i),
-      enter: o(t, "enter", i),
-      exit: o(t, "exit", i)
+      var d = {
+        compressToBase64: function(o) {
+          if (o == null) return "";
+          var r = d._compress(o, 6, function(s) {
+            return M.charAt(s);
+          });
+          switch (r.length % 4) {
+            // To produce valid Base64
+            default:
+            // When could this happen ?
+            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 O(M, 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, t = r.length; e < t; 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 t = [];
+          return r.forEach(function(p) {
+            t.push(A(p));
+          }), d.decompress(t.join(""));
+        },
+        //compress into a string that is already URI encoded
+        compressToEncodedURIComponent: function(o) {
+          return o == null ? "" : d._compress(o, 6, function(r) {
+            return g.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 O(g, 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, t, p = {}, v = {}, w = "", _ = "", l = "", h = 2, a = 3, c = 2, u = [], n = 0, f = 0, i;
+          for (i = 0; i < o.length; i += 1)
+            if (w = o.charAt(i), Object.prototype.hasOwnProperty.call(p, w) || (p[w] = a++, v[w] = !0), _ = l + w, Object.prototype.hasOwnProperty.call(p, _))
+              l = _;
+            else {
+              if (Object.prototype.hasOwnProperty.call(v, l)) {
+                if (l.charCodeAt(0) < 256) {
+                  for (e = 0; e < c; e++)
+                    n = n << 1, f == r - 1 ? (f = 0, u.push(s(n)), n = 0) : f++;
+                  for (t = l.charCodeAt(0), e = 0; e < 8; e++)
+                    n = n << 1 | t & 1, f == r - 1 ? (f = 0, u.push(s(n)), n = 0) : f++, t = t >> 1;
+                } else {
+                  for (t = 1, e = 0; e < c; e++)
+                    n = n << 1 | t, f == r - 1 ? (f = 0, u.push(s(n)), n = 0) : f++, t = 0;
+                  for (t = l.charCodeAt(0), e = 0; e < 16; e++)
+                    n = n << 1 | t & 1, f == r - 1 ? (f = 0, u.push(s(n)), n = 0) : f++, t = t >> 1;
+                }
+                h--, h == 0 && (h = Math.pow(2, c), c++), delete v[l];
+              } else
+                for (t = p[l], e = 0; e < c; e++)
+                  n = n << 1 | t & 1, f == r - 1 ? (f = 0, u.push(s(n)), n = 0) : f++, t = t >> 1;
+              h--, h == 0 && (h = Math.pow(2, c), c++), p[_] = a++, l = String(w);
+            }
+          if (l !== "") {
+            if (Object.prototype.hasOwnProperty.call(v, l)) {
+              if (l.charCodeAt(0) < 256) {
+                for (e = 0; e < c; e++)
+                  n = n << 1, f == r - 1 ? (f = 0, u.push(s(n)), n = 0) : f++;
+                for (t = l.charCodeAt(0), e = 0; e < 8; e++)
+                  n = n << 1 | t & 1, f == r - 1 ? (f = 0, u.push(s(n)), n = 0) : f++, t = t >> 1;
+              } else {
+                for (t = 1, e = 0; e < c; e++)
+                  n = n << 1 | t, f == r - 1 ? (f = 0, u.push(s(n)), n = 0) : f++, t = 0;
+                for (t = l.charCodeAt(0), e = 0; e < 16; e++)
+                  n = n << 1 | t & 1, f == r - 1 ? (f = 0, u.push(s(n)), n = 0) : f++, t = t >> 1;
+              }
+              h--, h == 0 && (h = Math.pow(2, c), c++), delete v[l];
+            } else
+              for (t = p[l], e = 0; e < c; e++)
+                n = n << 1 | t & 1, f == r - 1 ? (f = 0, u.push(s(n)), n = 0) : f++, t = t >> 1;
+            h--, h == 0 && (h = Math.pow(2, c), c++);
+          }
+          for (t = 2, e = 0; e < c; e++)
+            n = n << 1 | t & 1, f == r - 1 ? (f = 0, u.push(s(n)), n = 0) : f++, t = t >> 1;
+          for (; ; )
+            if (n = n << 1, f == r - 1) {
+              u.push(s(n));
+              break;
+            } else f++;
+          return u.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 = [], t = 4, p = 4, v = 3, w = "", _ = [], l, h, a, c, u, n, f, i = { val: s(0), position: r, index: 1 };
+          for (l = 0; l < 3; l += 1)
+            e[l] = l;
+          for (a = 0, u = Math.pow(2, 2), n = 1; n != u; )
+            c = i.val & i.position, i.position >>= 1, i.position == 0 && (i.position = r, i.val = s(i.index++)), a |= (c > 0 ? 1 : 0) * n, n <<= 1;
+          switch (a) {
+            case 0:
+              for (a = 0, u = Math.pow(2, 8), n = 1; n != u; )
+                c = i.val & i.position, i.position >>= 1, i.position == 0 && (i.position = r, i.val = s(i.index++)), a |= (c > 0 ? 1 : 0) * n, n <<= 1;
+              f = A(a);
+              break;
+            case 1:
+              for (a = 0, u = Math.pow(2, 16), n = 1; n != u; )
+                c = i.val & i.position, i.position >>= 1, i.position == 0 && (i.position = r, i.val = s(i.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 (i.index > o)
+              return "";
+            for (a = 0, u = Math.pow(2, v), n = 1; n != u; )
+              c = i.val & i.position, i.position >>= 1, i.position == 0 && (i.position = r, i.val = s(i.index++)), a |= (c > 0 ? 1 : 0) * n, n <<= 1;
+            switch (f = a) {
+              case 0:
+                for (a = 0, u = Math.pow(2, 8), n = 1; n != u; )
+                  c = i.val & i.position, i.position >>= 1, i.position == 0 && (i.position = r, i.val = s(i.index++)), a |= (c > 0 ? 1 : 0) * n, n <<= 1;
+                e[p++] = A(a), f = p - 1, t--;
+                break;
+              case 1:
+                for (a = 0, u = Math.pow(2, 16), n = 1; n != u; )
+                  c = i.val & i.position, i.position >>= 1, i.position == 0 && (i.position = r, i.val = s(i.index++)), a |= (c > 0 ? 1 : 0) * n, n <<= 1;
+                e[p++] = A(a), f = p - 1, t--;
+                break;
+              case 2:
+                return _.join("");
+            }
+            if (t == 0 && (t = 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), t--, h = w, t == 0 && (t = Math.pow(2, v), v++);
+          }
+        }
+      };
+      return d;
+    }();
+    S != null ? S.exports = m : typeof angular < "u" && angular != null && angular.module("LZString", []).factory("LZString", function() {
+      return m;
     });
-  });
-}
-function p(i, e, t) {
-  var u = h(i.children), r = m(e, u);
-  return Object.keys(r).forEach(function(a) {
-    var n = r[a];
-    if (v(n)) {
-      var f = a in e, l = a in u, c = e[a], g = v(c) && !c.props.in;
-      l && (!f || g) ? r[a] = d(n, {
-        onExited: t.bind(null, n),
-        in: !0,
-        exit: o(n, "exit", i),
-        enter: o(n, "enter", i)
-      }) : !l && f && !g ? r[a] = d(n, {
-        in: !1
-      }) : l && f && v(c) && (r[a] = d(n, {
-        onExited: t.bind(null, n),
-        in: c.props.in,
-        exit: o(n, "exit", i),
-        enter: o(n, "enter", i)
-      }));
-    }
-  }), r;
+  }(x), x.exports);
 }
 export {
-  h as getChildMapping,
-  E as getInitialChildMapping,
-  p as getNextChildMapping,
-  m as mergeChildMappings
+  k as __require
 };

package/dist/index.es388.js

@@ -1,6 +1,4 @@
-const a = {
-  disabled: !1
-};
+var r = { exports: {} };
 export {
-  a as default
+  r as __module
 };