@boxcustodia/library 0.2.5 → 0.2.6

package/dist/index.es257.js

@@ -1,134 +1,34 @@
-function d(n, t, e) {
-  return Math.max(Math.min(n, e), t);
-}
-function a(n) {
-  return n && n.isLeaf;
-}
-function h(n) {
-  return n && n.isInternal && !n.isOpen;
-}
-function p(n) {
-  var t;
-  return n && n.isOpen && !(!((t = n.children) === null || t === void 0) && t.length);
-}
-const m = (n, t) => {
-  let e = n;
-  for (; e; ) {
-    if (e.id === t.id)
-      return !0;
-    e = e.parent;
+import { NodeApi as s } from "./index.es256.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;
   }
-  return !1;
-}, v = (n) => {
-  if (!n.parent)
-    throw Error("Node does not have a parent");
-  return n.parent.children.findIndex((t) => t.id === n.id);
-};
-function b() {
-}
-function l(n, t) {
-  if (!n)
-    return null;
-  if (n.id === t)
-    return n;
-  if (n.children)
-    for (let e of n.children) {
-      const i = l(e, t);
-      if (i)
-        return i;
-    }
-  return null;
-}
-function f(n, t) {
-  if (t(n), n.children)
-    for (let e of n.children)
-      f(e, t);
-}
-function x(n) {
-  const t = u(n);
-  let e;
-  for (let i = 0; i < t.length; ++i)
-    if (t[i] === n) {
-      e = o(t, i);
-      break;
-    }
-  e == null || e.focus();
-}
-function y(n) {
-  const t = u(n);
-  let e;
-  for (let i = 0; i < t.length; ++i)
-    if (t[i] === n) {
-      e = c(t, i);
-      break;
-    }
-  e == null || e.focus();
-}
-function o(n, t) {
-  return t + 1 < n.length ? n[t + 1] : n[0];
-}
-function c(n, t) {
-  return t - 1 >= 0 ? n[t - 1] : n[n.length - 1];
-}
-function u(n) {
-  return Array.from(document.querySelectorAll('button:not([disabled]), [href], input:not([disabled]), select:not([disabled]), textarea:not([disabled]), [tabindex]:not([tabindex="-1"]):not([disabled]), details:not([disabled]), summary:not(:disabled)')).filter((t) => t === n || !n.contains(t));
-}
-function I(n, t) {
-  return typeof t == "boolean" ? t : typeof t == "string" ? n[t] : t(n);
-}
-function g(n) {
-  return n === null ? null : s(n);
-}
-function s(n) {
-  return typeof n == "string" ? n : n.id;
-}
-function O(...n) {
-  return (t) => {
-    n.forEach((e) => {
-      typeof e == "function" ? e(t) : e != null && (e.current = t);
-    });
-  };
-}
-function w(n, ...t) {
-  if (n)
-    return n(...t);
-}
-function E(n) {
-  return new Promise((t, e) => {
-    let i = 0;
-    function r() {
-      i += 1, i === 100 && e(), n() ? t() : setTimeout(r, 10);
-    }
-    r();
-  });
-}
-function N(n) {
-  var t, e;
-  const i = n.focusedNode;
-  return i ? i.isOpen ? 0 : i.parent ? i.childIndex + 1 : 0 : (e = (t = n.root.children) === null || t === void 0 ? void 0 : t.length) !== null && e !== void 0 ? e : 0;
-}
-function k(n) {
-  const t = n.focusedNode;
-  return t ? t.isOpen ? t.id : t.parent && !t.parent.isRoot ? t.parent.id : null : null;
+  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;
 }
 export {
-  I as access,
-  d as bound,
-  l as dfs,
-  x as focusNextElement,
-  y as focusPrevElement,
-  N as getInsertIndex,
-  k as getInsertParentId,
-  s as identify,
-  g as identifyNull,
-  v as indexOf,
-  h as isClosed,
-  m as isDescendant,
-  a as isItem,
-  p as isOpenWithEmptyChildren,
-  O as mergeRefs,
-  b as noop,
-  w as safeRun,
-  E as waitFor,
-  f as walk
+  a as ROOT_ID,
+  R as createRoot
 };

package/dist/index.es258.js

@@ -1,29 +1,465 @@
-import { j as e } from "./index.es83.js";
-import n from "react";
-const r = {
-  display: "flex",
-  alignItems: "center",
-  zIndex: 1
-}, l = {
-  flex: 1,
-  height: "2px",
-  background: "#4B91E2",
-  borderRadius: "1px"
-}, x = {
-  width: "4px",
-  height: "4px",
-  boxShadow: "0 0 0 3px #4B91E2",
-  borderRadius: "50%"
-}, d = n.memo(function({ top: t, left: s, indent: o }) {
-  const i = {
-    position: "absolute",
-    pointerEvents: "none",
-    top: t - 2 + "px",
-    left: s + "px",
-    right: o + "px"
-  };
-  return e.jsxs("div", { style: Object.assign(Object.assign({}, r), i), children: [e.jsx("div", { style: Object.assign({}, x) }), e.jsx("div", { style: Object.assign({}, l) })] });
-});
+import * as T from "./index.es259.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.es259.js";
+import { DefaultCursor as E } from "./index.es260.js";
+import { DefaultRow as M } from "./index.es261.js";
+import { DefaultNode as B } from "./index.es262.js";
+import { edit as m } from "./index.es263.js";
+import { focus as u, treeBlur as L } from "./index.es264.js";
+import { createRoot as I, ROOT_ID as k } from "./index.es257.js";
+import { actions as b } from "./index.es265.js";
+import { actions as d } from "./index.es266.js";
+import { actions as w } from "./index.es267.js";
+import { DefaultDragPreview as z } from "./index.es268.js";
+import { DefaultContainer as $ } from "./index.es269.js";
+import { createList as _ } from "./index.es270.js";
+import { createIndex as S } from "./index.es271.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);
+      }
+    }
+    function F(c) {
+      try {
+        g(s.throw(c));
+      } catch (v) {
+        r(v);
+      }
+    }
+    function g(c) {
+      c.done ? n(c.value) : i(c.value).then(h, F);
+    }
+    g((s = s.apply(y, t || [])).next());
+  });
+};
+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 {
-  d as DefaultCursor
+  f as TreeApi
 };