@boxcustodia/library 0.2.0 → 0.2.2

package/dist/index.es255.js

@@ -1,201 +1,465 @@
-import { getDefaultExportFromCjs as O } from "./index.es141.js";
-import { __module as y } from "./index.es374.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;
+import * as T from "./index.es256.js";
+import { access as p, identifyNull as D, getInsertParentId as R, getInsertIndex as O, isDescendant as C, dfs as P, walk as x, waitFor as A } from "./index.es256.js";
+import { DefaultCursor as E } from "./index.es257.js";
+import { DefaultRow as M } from "./index.es258.js";
+import { DefaultNode as B } from "./index.es259.js";
+import { edit as m } from "./index.es260.js";
+import { focus as u, treeBlur as L } from "./index.es261.js";
+import { createRoot as I, ROOT_ID as k } from "./index.es254.js";
+import { actions as b } from "./index.es262.js";
+import { actions as d } from "./index.es263.js";
+import { actions as w } from "./index.es264.js";
+import { DefaultDragPreview as z } from "./index.es265.js";
+import { DefaultContainer as $ } from "./index.es266.js";
+import { createList as _ } from "./index.es267.js";
+import { createIndex as S } from "./index.es268.js";
+var N = function(y, t, e, s) {
+  function i(n) {
+    return n instanceof e ? n : new e(function(r) {
+      r(n);
+    });
+  }
+  return new (e || (e = Promise))(function(n, r) {
+    function h(c) {
+      try {
+        g(s.next(c));
+      } catch (v) {
+        r(v);
       }
-      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++);
-        }
+    function F(c) {
+      try {
+        g(s.throw(c));
+      } catch (v) {
+        r(v);
       }
-    };
-    return d;
-  }();
-  m != null ? m.exports = S : typeof angular < "u" && angular != null && angular.module("LZString", []).factory("LZString", function() {
-    return S;
+    }
+    function g(c) {
+      c.done ? n(c.value) : i(c.value).then(h, F);
+    }
+    g((s = s.apply(y, t || [])).next());
   });
-})(y);
-var U = y.exports;
-const B = /* @__PURE__ */ O(U);
+};
+const { safeRun: o, identify: a, identifyNull: l } = T;
+class f {
+  constructor(t, e, s, i) {
+    this.store = t, this.props = e, this.list = s, this.listEl = i, this.visibleStartIndex = 0, this.visibleStopIndex = 0, this.root = I(this), this.visibleNodes = _(this), this.idToIndex = S(this.visibleNodes);
+  }
+  /* Changes here must also be made in constructor() */
+  update(t) {
+    this.props = t, this.root = I(this), this.visibleNodes = _(this), this.idToIndex = S(this.visibleNodes);
+  }
+  /* Store helpers */
+  dispatch(t) {
+    return this.store.dispatch(t);
+  }
+  get state() {
+    return this.store.getState();
+  }
+  get openState() {
+    return this.state.nodes.open.unfiltered;
+  }
+  /* Tree Props */
+  get width() {
+    var t;
+    return (t = this.props.width) !== null && t !== void 0 ? t : 300;
+  }
+  get height() {
+    var t;
+    return (t = this.props.height) !== null && t !== void 0 ? t : 500;
+  }
+  get indent() {
+    var t;
+    return (t = this.props.indent) !== null && t !== void 0 ? t : 24;
+  }
+  get rowHeight() {
+    var t;
+    return (t = this.props.rowHeight) !== null && t !== void 0 ? t : 24;
+  }
+  get overscanCount() {
+    var t;
+    return (t = this.props.overscanCount) !== null && t !== void 0 ? t : 1;
+  }
+  get searchTerm() {
+    return (this.props.searchTerm || "").trim();
+  }
+  get matchFn() {
+    var t;
+    const e = (t = this.props.searchMatch) !== null && t !== void 0 ? t : (s, i) => JSON.stringify(Object.values(s.data)).toLocaleLowerCase().includes(i.toLocaleLowerCase());
+    return (s) => e(s, this.searchTerm);
+  }
+  accessChildren(t) {
+    var e;
+    const s = this.props.childrenAccessor || "children";
+    return (e = p(t, s)) !== null && e !== void 0 ? e : null;
+  }
+  accessId(t) {
+    const e = this.props.idAccessor || "id", s = p(t, e);
+    if (!s)
+      throw new Error("Data must contain an 'id' property or props.idAccessor must return a string");
+    return s;
+  }
+  /* Node Access */
+  get firstNode() {
+    var t;
+    return (t = this.visibleNodes[0]) !== null && t !== void 0 ? t : null;
+  }
+  get lastNode() {
+    var t;
+    return (t = this.visibleNodes[this.visibleNodes.length - 1]) !== null && t !== void 0 ? t : null;
+  }
+  get focusedNode() {
+    var t;
+    return (t = this.get(this.state.nodes.focus.id)) !== null && t !== void 0 ? t : null;
+  }
+  get mostRecentNode() {
+    var t;
+    return (t = this.get(this.state.nodes.selection.mostRecent)) !== null && t !== void 0 ? t : null;
+  }
+  get nextNode() {
+    const t = this.indexOf(this.focusedNode);
+    return t === null ? null : this.at(t + 1);
+  }
+  get prevNode() {
+    const t = this.indexOf(this.focusedNode);
+    return t === null ? null : this.at(t - 1);
+  }
+  get(t) {
+    return t && t in this.idToIndex && this.visibleNodes[this.idToIndex[t]] || null;
+  }
+  at(t) {
+    return this.visibleNodes[t] || null;
+  }
+  nodesBetween(t, e) {
+    var s;
+    if (t === null || e === null)
+      return [];
+    const i = (s = this.indexOf(t)) !== null && s !== void 0 ? s : 0, n = this.indexOf(e);
+    if (n === null)
+      return [];
+    const r = Math.min(i, n), h = Math.max(i, n);
+    return this.visibleNodes.slice(r, h + 1);
+  }
+  indexOf(t) {
+    const e = D(t);
+    return e ? this.idToIndex[e] : null;
+  }
+  /* Data Operations */
+  get editingId() {
+    return this.state.nodes.edit.id;
+  }
+  createInternal() {
+    return this.create({ type: "internal" });
+  }
+  createLeaf() {
+    return this.create({ type: "leaf" });
+  }
+  create(t = {}) {
+    var e, s;
+    return N(this, void 0, void 0, function* () {
+      const i = t.parentId === void 0 ? R(this) : t.parentId, n = (e = t.index) !== null && e !== void 0 ? e : O(this), r = (s = t.type) !== null && s !== void 0 ? s : "leaf", h = yield o(this.props.onCreate, {
+        type: r,
+        parentId: i,
+        index: n,
+        parentNode: this.get(i)
+      });
+      h && (this.focus(h), setTimeout(() => {
+        this.edit(h).then(() => {
+          this.select(h), this.activate(h);
+        });
+      }));
+    });
+  }
+  delete(t) {
+    return N(this, void 0, void 0, function* () {
+      if (!t)
+        return;
+      const s = (Array.isArray(t) ? t : [t]).map(a), i = s.map((n) => this.get(n)).filter((n) => !!n);
+      yield o(this.props.onDelete, { nodes: i, ids: s });
+    });
+  }
+  edit(t) {
+    const e = a(t);
+    return this.resolveEdit({ cancelled: !0 }), this.scrollTo(e), this.dispatch(m(e)), new Promise((s) => {
+      f.editPromise = s;
+    });
+  }
+  submit(t, e) {
+    return N(this, void 0, void 0, function* () {
+      if (!t)
+        return;
+      const s = a(t);
+      yield o(this.props.onRename, {
+        id: s,
+        name: e,
+        node: this.get(s)
+      }), this.dispatch(m(null)), this.resolveEdit({ cancelled: !1, value: e }), setTimeout(() => this.onFocus());
+    });
+  }
+  reset() {
+    this.dispatch(m(null)), this.resolveEdit({ cancelled: !0 }), setTimeout(() => this.onFocus());
+  }
+  activate(t) {
+    const e = this.get(l(t));
+    e && o(this.props.onActivate, e);
+  }
+  resolveEdit(t) {
+    const e = f.editPromise;
+    e && e(t), f.editPromise = null;
+  }
+  /* Focus and Selection */
+  get selectedIds() {
+    return this.state.nodes.selection.ids;
+  }
+  get selectedNodes() {
+    let t = [];
+    for (let e of Array.from(this.selectedIds)) {
+      const s = this.get(e);
+      s && t.push(s);
+    }
+    return t;
+  }
+  focus(t, e = {}) {
+    t && (this.props.selectionFollowsFocus ? this.select(t) : (this.dispatch(u(a(t))), e.scroll !== !1 && this.scrollTo(t), this.focusedNode && o(this.props.onFocus, this.focusedNode)));
+  }
+  pageUp() {
+    var t, e;
+    const s = this.visibleStartIndex, n = this.visibleStopIndex - s;
+    let r = (e = (t = this.focusedNode) === null || t === void 0 ? void 0 : t.rowIndex) !== null && e !== void 0 ? e : 0;
+    r > s ? r = s : r = Math.max(s - n, 0), this.focus(this.at(r));
+  }
+  pageDown() {
+    var t, e;
+    const s = this.visibleStartIndex, i = this.visibleStopIndex, n = i - s;
+    let r = (e = (t = this.focusedNode) === null || t === void 0 ? void 0 : t.rowIndex) !== null && e !== void 0 ? e : 0;
+    r < i ? r = i : r = Math.min(r + n, this.visibleNodes.length - 1), this.focus(this.at(r));
+  }
+  select(t, e = {}) {
+    if (!t)
+      return;
+    const s = e.focus !== !1, i = a(t);
+    s && this.dispatch(u(i)), this.dispatch(d.only(i)), this.dispatch(d.anchor(i)), this.dispatch(d.mostRecent(i)), this.scrollTo(i, e.align), this.focusedNode && s && o(this.props.onFocus, this.focusedNode), o(this.props.onSelect, this.selectedNodes);
+  }
+  deselect(t) {
+    if (!t)
+      return;
+    const e = a(t);
+    this.dispatch(d.remove(e));
+  }
+  selectMulti(t) {
+    const e = this.get(l(t));
+    e && (this.dispatch(u(e.id)), this.dispatch(d.add(e.id)), this.dispatch(d.anchor(e.id)), this.dispatch(d.mostRecent(e.id)), this.scrollTo(e), this.focusedNode && o(this.props.onFocus, this.focusedNode), o(this.props.onSelect, this.selectedNodes));
+  }
+  selectContiguous(t) {
+    if (!t)
+      return;
+    const e = a(t), { anchor: s, mostRecent: i } = this.state.nodes.selection;
+    this.dispatch(u(e)), this.dispatch(d.remove(this.nodesBetween(s, i))), this.dispatch(d.add(this.nodesBetween(s, l(e)))), this.dispatch(d.mostRecent(e)), this.scrollTo(e), this.focusedNode && o(this.props.onFocus, this.focusedNode), o(this.props.onSelect, this.selectedNodes);
+  }
+  deselectAll() {
+    this.setSelection({ ids: [], anchor: null, mostRecent: null }), o(this.props.onSelect, this.selectedNodes);
+  }
+  selectAll() {
+    var t;
+    this.setSelection({
+      ids: Object.keys(this.idToIndex),
+      anchor: this.firstNode,
+      mostRecent: this.lastNode
+    }), this.dispatch(u((t = this.lastNode) === null || t === void 0 ? void 0 : t.id)), this.focusedNode && o(this.props.onFocus, this.focusedNode), o(this.props.onSelect, this.selectedNodes);
+  }
+  setSelection(t) {
+    var e;
+    const s = new Set((e = t.ids) === null || e === void 0 ? void 0 : e.map(a)), i = l(t.anchor), n = l(t.mostRecent);
+    this.dispatch(d.set({ ids: s, anchor: i, mostRecent: n })), o(this.props.onSelect, this.selectedNodes);
+  }
+  /* Drag and Drop */
+  get cursorParentId() {
+    const { cursor: t } = this.state.dnd;
+    switch (t.type) {
+      case "highlight":
+        return t.id;
+      default:
+        return null;
+    }
+  }
+  get cursorOverFolder() {
+    return this.state.dnd.cursor.type === "highlight";
+  }
+  get dragNodes() {
+    return this.state.dnd.dragIds.map((t) => this.get(t)).filter((t) => !!t);
+  }
+  get dragNode() {
+    return this.get(this.state.nodes.drag.id);
+  }
+  get dragDestinationParent() {
+    return this.get(this.state.nodes.drag.destinationParentId);
+  }
+  get dragDestinationIndex() {
+    return this.state.nodes.drag.destinationIndex;
+  }
+  canDrop() {
+    var t;
+    if (this.isFiltered)
+      return !1;
+    const e = (t = this.get(this.state.dnd.parentId)) !== null && t !== void 0 ? t : this.root, s = this.dragNodes, i = this.props.disableDrop;
+    for (const n of s)
+      if (!n || !e || n.isInternal && C(e, n))
+        return !1;
+    return typeof i == "function" ? !i({
+      parentNode: e,
+      dragNodes: this.dragNodes,
+      index: this.state.dnd.index || 0
+    }) : typeof i == "string" ? !e.data[i] : typeof i == "boolean" ? !i : !0;
+  }
+  hideCursor() {
+    this.dispatch(w.cursor({ type: "none" }));
+  }
+  showCursor(t) {
+    this.dispatch(w.cursor(t));
+  }
+  /* Visibility */
+  open(t) {
+    const e = l(t);
+    e && (this.isOpen(e) || (this.dispatch(b.open(e, this.isFiltered)), o(this.props.onToggle, e)));
+  }
+  close(t) {
+    const e = l(t);
+    e && this.isOpen(e) && (this.dispatch(b.close(e, this.isFiltered)), o(this.props.onToggle, e));
+  }
+  toggle(t) {
+    const e = l(t);
+    if (e)
+      return this.isOpen(e) ? this.close(e) : this.open(e);
+  }
+  openParents(t) {
+    const e = l(t);
+    if (!e)
+      return;
+    const s = P(this.root, e);
+    let i = s == null ? void 0 : s.parent;
+    for (; i; )
+      this.open(i.id), i = i.parent;
+  }
+  openSiblings(t) {
+    const e = t.parent;
+    if (!e)
+      this.toggle(t.id);
+    else if (e.children) {
+      const s = t.isOpen;
+      for (let i of e.children)
+        i.isInternal && (s ? this.close(i.id) : this.open(i.id));
+      this.scrollTo(this.focusedNode);
+    }
+  }
+  openAll() {
+    x(this.root, (t) => {
+      t.isInternal && t.open();
+    });
+  }
+  closeAll() {
+    x(this.root, (t) => {
+      t.isInternal && t.close();
+    });
+  }
+  /* Scrolling */
+  scrollTo(t, e = "smart") {
+    if (!t)
+      return;
+    const s = a(t);
+    return this.openParents(s), A(() => s in this.idToIndex).then(() => {
+      var i;
+      const n = this.idToIndex[s];
+      n !== void 0 && ((i = this.list.current) === null || i === void 0 || i.scrollToItem(n, e));
+    }).catch(() => {
+    });
+  }
+  /* State Checks */
+  get isEditing() {
+    return this.state.nodes.edit.id !== null;
+  }
+  get isFiltered() {
+    var t;
+    return !!(!((t = this.props.searchTerm) === null || t === void 0) && t.trim());
+  }
+  get hasFocus() {
+    return this.state.nodes.focus.treeFocused;
+  }
+  get hasNoSelection() {
+    return this.state.nodes.selection.ids.size === 0;
+  }
+  get hasOneSelection() {
+    return this.state.nodes.selection.ids.size === 1;
+  }
+  get hasMultipleSelections() {
+    return this.state.nodes.selection.ids.size > 1;
+  }
+  isSelected(t) {
+    return t ? this.state.nodes.selection.ids.has(t) : !1;
+  }
+  isOpen(t) {
+    var e, s, i;
+    if (!t)
+      return !1;
+    if (t === k)
+      return !0;
+    const n = (e = this.props.openByDefault) !== null && e !== void 0 ? e : !0;
+    return this.isFiltered ? (s = this.state.nodes.open.filtered[t]) !== null && s !== void 0 ? s : !0 : (i = this.state.nodes.open.unfiltered[t]) !== null && i !== void 0 ? i : n;
+  }
+  isEditable(t) {
+    var e;
+    const s = this.props.disableEdit || (() => !1);
+    return (e = !p(t, s)) !== null && e !== void 0 ? e : !0;
+  }
+  isDraggable(t) {
+    var e;
+    const s = this.props.disableDrag || (() => !1);
+    return (e = !p(t, s)) !== null && e !== void 0 ? e : !0;
+  }
+  isDragging(t) {
+    const e = l(t);
+    return e ? this.state.nodes.drag.id === e : !1;
+  }
+  isFocused(t) {
+    return this.hasFocus && this.state.nodes.focus.id === t;
+  }
+  isMatch(t) {
+    return this.matchFn(t);
+  }
+  willReceiveDrop(t) {
+    const e = l(t);
+    if (!e)
+      return !1;
+    const { destinationParentId: s, destinationIndex: i } = this.state.nodes.drag;
+    return e === s && i === null;
+  }
+  /* Tree Event Handlers */
+  onFocus() {
+    const t = this.focusedNode || this.firstNode;
+    t && this.dispatch(u(t.id));
+  }
+  onBlur() {
+    this.dispatch(L());
+  }
+  onItemsRendered(t) {
+    this.visibleStartIndex = t.visibleStartIndex, this.visibleStopIndex = t.visibleStopIndex;
+  }
+  /* Get Renderers */
+  get renderContainer() {
+    return this.props.renderContainer || $;
+  }
+  get renderRow() {
+    return this.props.renderRow || M;
+  }
+  get renderNode() {
+    return this.props.children || B;
+  }
+  get renderDragPreview() {
+    return this.props.renderDragPreview || z;
+  }
+  get renderCursor() {
+    return this.props.renderCursor || E;
+  }
+}
 export {
-  B as default
+  f as TreeApi
 };