@boxcustodia/library 0.2.9 → 0.2.10

package/dist/index.es264.js

@@ -1,134 +1,137 @@
-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;
-  }
-  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);
+import { ROOT_ID as r } from "./index.es265.js";
+class i {
+  constructor(e) {
+    this.handleClick = (t) => {
+      t.metaKey && !this.tree.props.disableMultiSelection ? this.isSelected ? this.deselect() : this.selectMulti() : t.shiftKey && !this.tree.props.disableMultiSelection ? this.selectContiguous() : (this.select(), this.activate());
+    }, this.tree = e.tree, this.id = e.id, this.data = e.data, this.level = e.level, this.children = e.children, this.parent = e.parent, this.isDraggable = e.isDraggable, this.rowIndex = e.rowIndex;
+  }
+  get isRoot() {
+    return this.id === r;
+  }
+  get isLeaf() {
+    return !Array.isArray(this.children);
+  }
+  get isInternal() {
+    return !this.isLeaf;
+  }
+  get isOpen() {
+    return this.isLeaf ? !1 : this.tree.isOpen(this.id);
+  }
+  get isClosed() {
+    return this.isLeaf ? !1 : !this.tree.isOpen(this.id);
+  }
+  get isEditable() {
+    return this.tree.isEditable(this.data);
+  }
+  get isEditing() {
+    return this.tree.editingId === this.id;
+  }
+  get isSelected() {
+    return this.tree.isSelected(this.id);
+  }
+  get isOnlySelection() {
+    return this.isSelected && this.tree.hasOneSelection;
+  }
+  get isSelectedStart() {
+    var e;
+    return this.isSelected && !(!((e = this.prev) === null || e === void 0) && e.isSelected);
+  }
+  get isSelectedEnd() {
+    var e;
+    return this.isSelected && !(!((e = this.next) === null || e === void 0) && e.isSelected);
+  }
+  get isFocused() {
+    return this.tree.isFocused(this.id);
+  }
+  get isDragging() {
+    return this.tree.isDragging(this.id);
+  }
+  get willReceiveDrop() {
+    return this.tree.willReceiveDrop(this.id);
+  }
+  get state() {
+    return {
+      isClosed: this.isClosed,
+      isDragging: this.isDragging,
+      isEditing: this.isEditing,
+      isFocused: this.isFocused,
+      isInternal: this.isInternal,
+      isLeaf: this.isLeaf,
+      isOpen: this.isOpen,
+      isSelected: this.isSelected,
+      isSelectedEnd: this.isSelectedEnd,
+      isSelectedStart: this.isSelectedStart,
+      willReceiveDrop: this.willReceiveDrop
+    };
+  }
+  get childIndex() {
+    return this.parent && this.parent.children ? this.parent.children.findIndex((e) => e.id === this.id) : -1;
+  }
+  get next() {
+    return this.rowIndex === null ? null : this.tree.at(this.rowIndex + 1);
+  }
+  get prev() {
+    return this.rowIndex === null ? null : this.tree.at(this.rowIndex - 1);
+  }
+  get nextSibling() {
+    var e, t;
+    const s = this.childIndex;
+    return (t = (e = this.parent) === null || e === void 0 ? void 0 : e.children[s + 1]) !== null && t !== void 0 ? t : null;
+  }
+  isAncestorOf(e) {
+    if (!e)
+      return !1;
+    let t = e;
+    for (; t; ) {
+      if (t.id === this.id)
+        return !0;
+      t = t.parent;
     }
-    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;
+    return !1;
+  }
+  select() {
+    this.tree.select(this);
+  }
+  deselect() {
+    this.tree.deselect(this);
+  }
+  selectMulti() {
+    this.tree.selectMulti(this);
+  }
+  selectContiguous() {
+    this.tree.selectContiguous(this);
+  }
+  activate() {
+    this.tree.activate(this);
+  }
+  focus() {
+    this.tree.focus(this);
+  }
+  toggle() {
+    this.tree.toggle(this);
+  }
+  open() {
+    this.tree.open(this);
+  }
+  openParents() {
+    this.tree.openParents(this);
+  }
+  close() {
+    this.tree.close(this);
+  }
+  submit(e) {
+    this.tree.submit(this, e);
+  }
+  reset() {
+    this.tree.reset();
+  }
+  clone() {
+    return new i(Object.assign({}, this));
+  }
+  edit() {
+    return this.tree.edit(this);
+  }
 }
 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
+  i as NodeApi
 };

package/dist/index.es265.js

@@ -1,29 +1,34 @@
-import { j as e } from "./index.es86.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 { NodeApi as s } from "./index.es264.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;
+}
 export {
-  d as DefaultCursor
+  a as ROOT_ID,
+  R as createRoot
 };