@boxcustodia/library 0.0.6 → 0.0.7

package/dist/index.es256.js

@@ -1,34 +1,201 @@
-import { NodeApi as s } from "./index.es255.js";
-const a = "__REACT_ARBORIST_INTERNAL_ROOT__";
-function R(n) {
-  var r;
-  function c(l, d, u) {
-    const _ = n.accessId(l), o = new s({
-      tree: n,
-      data: l,
-      level: d,
-      parent: u,
-      id: _,
-      children: null,
-      isDraggable: n.isDraggable(l),
-      rowIndex: null
-    }), e = n.accessChildren(l);
-    return e && (o.children = e.map((p) => c(p, d + 1, o))), o;
-  }
-  const i = new s({
-    tree: n,
-    id: a,
-    // @ts-ignore
-    data: { id: a },
-    level: -1,
-    parent: null,
-    children: null,
-    isDraggable: !0,
-    rowIndex: null
-  }), t = (r = n.props.data) !== null && r !== void 0 ? r : [];
-  return i.children = t.map((l) => c(l, 0, i)), i;
-}
+import { getDefaultExportFromCjs as O } from "./index.es153.js";
+import { __module as y } from "./index.es376.js";
+y.exports;
+(function(m) {
+  var S = function() {
+    var A = String.fromCharCode, M = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=", g = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+-$", x = {};
+    function j(o, r) {
+      if (!x[o]) {
+        x[o] = {};
+        for (var s = 0; s < o.length; s++)
+          x[o][o.charAt(s)] = s;
+      }
+      return x[o][r];
+    }
+    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) {
+          default:
+          case 0:
+            return r;
+          case 1:
+            return r + "===";
+          case 2:
+            return r + "==";
+          case 3:
+            return r + "=";
+        }
+      },
+      decompressFromBase64: function(o) {
+        return o == null ? "" : o == "" ? null : d._decompress(o.length, 32, function(r) {
+          return j(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, i = r.length; e < i; e++) {
+          var p = r.charCodeAt(e);
+          s[e * 2] = p >>> 8, s[e * 2 + 1] = p % 256;
+        }
+        return s;
+      },
+      //decompress from uint8array (UCS-2 big endian format)
+      decompressFromUint8Array: function(o) {
+        if (o == null)
+          return d.decompress(o);
+        for (var r = new Array(o.length / 2), s = 0, e = r.length; s < e; s++)
+          r[s] = o[s * 2] * 256 + o[s * 2 + 1];
+        var i = [];
+        return r.forEach(function(p) {
+          i.push(A(p));
+        }), d.decompress(i.join(""));
+      },
+      //compress into a string that is already URI encoded
+      compressToEncodedURIComponent: function(o) {
+        return o == null ? "" : d._compress(o, 6, function(r) {
+          return 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 j(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, i, p = {}, v = {}, w = "", _ = "", u = "", h = 2, a = 3, c = 2, l = [], n = 0, f = 0, t;
+        for (t = 0; t < o.length; t += 1)
+          if (w = o.charAt(t), Object.prototype.hasOwnProperty.call(p, w) || (p[w] = a++, v[w] = !0), _ = u + w, Object.prototype.hasOwnProperty.call(p, _))
+            u = _;
+          else {
+            if (Object.prototype.hasOwnProperty.call(v, u)) {
+              if (u.charCodeAt(0) < 256) {
+                for (e = 0; e < c; e++)
+                  n = n << 1, f == r - 1 ? (f = 0, l.push(s(n)), n = 0) : f++;
+                for (i = u.charCodeAt(0), e = 0; e < 8; e++)
+                  n = n << 1 | i & 1, f == r - 1 ? (f = 0, l.push(s(n)), n = 0) : f++, i = i >> 1;
+              } else {
+                for (i = 1, e = 0; e < c; e++)
+                  n = n << 1 | i, f == r - 1 ? (f = 0, l.push(s(n)), n = 0) : f++, i = 0;
+                for (i = u.charCodeAt(0), e = 0; e < 16; e++)
+                  n = n << 1 | i & 1, f == r - 1 ? (f = 0, l.push(s(n)), n = 0) : f++, i = i >> 1;
+              }
+              h--, h == 0 && (h = Math.pow(2, c), c++), delete v[u];
+            } else
+              for (i = p[u], e = 0; e < c; e++)
+                n = n << 1 | i & 1, f == r - 1 ? (f = 0, l.push(s(n)), n = 0) : f++, i = i >> 1;
+            h--, h == 0 && (h = Math.pow(2, c), c++), p[_] = a++, u = String(w);
+          }
+        if (u !== "") {
+          if (Object.prototype.hasOwnProperty.call(v, u)) {
+            if (u.charCodeAt(0) < 256) {
+              for (e = 0; e < c; e++)
+                n = n << 1, f == r - 1 ? (f = 0, l.push(s(n)), n = 0) : f++;
+              for (i = u.charCodeAt(0), e = 0; e < 8; e++)
+                n = n << 1 | i & 1, f == r - 1 ? (f = 0, l.push(s(n)), n = 0) : f++, i = i >> 1;
+            } else {
+              for (i = 1, e = 0; e < c; e++)
+                n = n << 1 | i, f == r - 1 ? (f = 0, l.push(s(n)), n = 0) : f++, i = 0;
+              for (i = u.charCodeAt(0), e = 0; e < 16; e++)
+                n = n << 1 | i & 1, f == r - 1 ? (f = 0, l.push(s(n)), n = 0) : f++, i = i >> 1;
+            }
+            h--, h == 0 && (h = Math.pow(2, c), c++), delete v[u];
+          } else
+            for (i = p[u], e = 0; e < c; e++)
+              n = n << 1 | i & 1, f == r - 1 ? (f = 0, l.push(s(n)), n = 0) : f++, i = i >> 1;
+          h--, h == 0 && (h = Math.pow(2, c), c++);
+        }
+        for (i = 2, e = 0; e < c; e++)
+          n = n << 1 | i & 1, f == r - 1 ? (f = 0, l.push(s(n)), n = 0) : f++, i = i >> 1;
+        for (; ; )
+          if (n = n << 1, f == r - 1) {
+            l.push(s(n));
+            break;
+          } else f++;
+        return l.join("");
+      },
+      decompress: function(o) {
+        return o == null ? "" : o == "" ? null : d._decompress(o.length, 32768, function(r) {
+          return o.charCodeAt(r);
+        });
+      },
+      _decompress: function(o, r, s) {
+        var e = [], i = 4, p = 4, v = 3, w = "", _ = [], u, h, a, c, l, n, f, t = { val: s(0), position: r, index: 1 };
+        for (u = 0; u < 3; u += 1)
+          e[u] = u;
+        for (a = 0, l = Math.pow(2, 2), n = 1; n != l; )
+          c = t.val & t.position, t.position >>= 1, t.position == 0 && (t.position = r, t.val = s(t.index++)), a |= (c > 0 ? 1 : 0) * n, n <<= 1;
+        switch (a) {
+          case 0:
+            for (a = 0, l = Math.pow(2, 8), n = 1; n != l; )
+              c = t.val & t.position, t.position >>= 1, t.position == 0 && (t.position = r, t.val = s(t.index++)), a |= (c > 0 ? 1 : 0) * n, n <<= 1;
+            f = A(a);
+            break;
+          case 1:
+            for (a = 0, l = Math.pow(2, 16), n = 1; n != l; )
+              c = t.val & t.position, t.position >>= 1, t.position == 0 && (t.position = r, t.val = s(t.index++)), a |= (c > 0 ? 1 : 0) * n, n <<= 1;
+            f = A(a);
+            break;
+          case 2:
+            return "";
+        }
+        for (e[3] = f, h = f, _.push(f); ; ) {
+          if (t.index > o)
+            return "";
+          for (a = 0, l = Math.pow(2, v), n = 1; n != l; )
+            c = t.val & t.position, t.position >>= 1, t.position == 0 && (t.position = r, t.val = s(t.index++)), a |= (c > 0 ? 1 : 0) * n, n <<= 1;
+          switch (f = a) {
+            case 0:
+              for (a = 0, l = Math.pow(2, 8), n = 1; n != l; )
+                c = t.val & t.position, t.position >>= 1, t.position == 0 && (t.position = r, t.val = s(t.index++)), a |= (c > 0 ? 1 : 0) * n, n <<= 1;
+              e[p++] = A(a), f = p - 1, i--;
+              break;
+            case 1:
+              for (a = 0, l = Math.pow(2, 16), n = 1; n != l; )
+                c = t.val & t.position, t.position >>= 1, t.position == 0 && (t.position = r, t.val = s(t.index++)), a |= (c > 0 ? 1 : 0) * n, n <<= 1;
+              e[p++] = A(a), f = p - 1, i--;
+              break;
+            case 2:
+              return _.join("");
+          }
+          if (i == 0 && (i = Math.pow(2, v), v++), e[f])
+            w = e[f];
+          else if (f === p)
+            w = h + h.charAt(0);
+          else
+            return null;
+          _.push(w), e[p++] = h + w.charAt(0), i--, h = w, i == 0 && (i = Math.pow(2, v), v++);
+        }
+      }
+    };
+    return d;
+  }();
+  m != null ? m.exports = S : typeof angular < "u" && angular != null && angular.module("LZString", []).factory("LZString", function() {
+    return S;
+  });
+})(y);
+var U = y.exports;
+const B = /* @__PURE__ */ O(U);
 export {
-  a as ROOT_ID,
-  R as createRoot
+  B as default
 };