@boxcustodia/library 0.2.5 → 0.2.6

package/dist/index.es267.js

@@ -1,161 +1,33 @@
-import { j as l } from "./index.es83.js";
-import { FixedSizeList as c } from "./index.es346.js";
-import { useDataUpdates as d, useTreeApi as p } from "./index.es338.js";
-import { focusNextElement as m, focusPrevElement as y } from "./index.es257.js";
-import { ListOuterElement as g } from "./index.es347.js";
-import { ListInnerElement as h } from "./index.es348.js";
-import { RowContainer as v } from "./index.es349.js";
-let i = "", f = null;
-function C() {
-  d();
-  const e = p();
-  return l.jsx("div", { role: "tree", style: {
-    height: e.height,
-    width: e.width,
-    minHeight: 0,
-    minWidth: 0
-  }, onContextMenu: e.props.onContextMenu, onClick: e.props.onClick, tabIndex: 0, onFocus: (t) => {
-    t.currentTarget.contains(t.relatedTarget) || e.onFocus();
-  }, onBlur: (t) => {
-    t.currentTarget.contains(t.relatedTarget) || e.onBlur();
-  }, onKeyDown: (t) => {
-    var o;
-    if (e.isEditing)
-      return;
-    if (t.key === "Backspace") {
-      if (!e.props.onDelete)
-        return;
-      const r = Array.from(e.selectedIds);
-      if (r.length > 1) {
-        let n = e.mostRecentNode;
-        for (; n && n.isSelected; )
-          n = n.nextSibling;
-        n || (n = e.lastNode), e.focus(n, { scroll: !1 }), e.delete(Array.from(r));
-      } else {
-        const n = e.focusedNode;
-        if (n) {
-          const u = n.nextSibling, a = n.parent;
-          e.focus(u || a, { scroll: !1 }), e.delete(n);
-        }
-      }
-      return;
-    }
-    if (t.key === "Tab" && !t.shiftKey) {
-      t.preventDefault(), m(t.currentTarget);
-      return;
-    }
-    if (t.key === "Tab" && t.shiftKey) {
-      t.preventDefault(), y(t.currentTarget);
-      return;
-    }
-    if (t.key === "ArrowDown") {
-      t.preventDefault();
-      const r = e.nextNode;
-      if (t.metaKey) {
-        e.select(e.focusedNode), e.activate(e.focusedNode);
-        return;
-      } else if (!t.shiftKey || e.props.disableMultiSelection) {
-        e.focus(r);
-        return;
-      } else {
-        if (!r)
-          return;
-        const n = e.focusedNode;
-        n ? n.isSelected ? e.selectContiguous(r) : e.selectMulti(r) : e.focus(e.firstNode);
-        return;
-      }
-    }
-    if (t.key === "ArrowUp") {
-      t.preventDefault();
-      const r = e.prevNode;
-      if (!t.shiftKey || e.props.disableMultiSelection) {
-        e.focus(r);
-        return;
-      } else {
-        if (!r)
-          return;
-        const n = e.focusedNode;
-        n ? n.isSelected ? e.selectContiguous(r) : e.selectMulti(r) : e.focus(e.lastNode);
-        return;
-      }
-    }
-    if (t.key === "ArrowRight") {
-      const r = e.focusedNode;
-      if (!r)
-        return;
-      r.isInternal && r.isOpen ? e.focus(e.nextNode) : r.isInternal && e.open(r.id);
-      return;
-    }
-    if (t.key === "ArrowLeft") {
-      const r = e.focusedNode;
-      if (!r || r.isRoot)
-        return;
-      r.isInternal && r.isOpen ? e.close(r.id) : !((o = r.parent) === null || o === void 0) && o.isRoot || e.focus(r.parent);
-      return;
-    }
-    if (t.key === "a" && t.metaKey && !e.props.disableMultiSelection) {
-      t.preventDefault(), e.selectAll();
-      return;
-    }
-    if (t.key === "a" && !t.metaKey && e.props.onCreate) {
-      e.createLeaf();
-      return;
-    }
-    if (t.key === "A" && !t.metaKey) {
-      if (!e.props.onCreate)
-        return;
-      e.createInternal();
-      return;
-    }
-    if (t.key === "Home") {
-      t.preventDefault(), e.focus(e.firstNode);
-      return;
-    }
-    if (t.key === "End") {
-      t.preventDefault(), e.focus(e.lastNode);
-      return;
-    }
-    if (t.key === "Enter") {
-      const r = e.focusedNode;
-      if (!r || !r.isEditable || !e.props.onRename)
-        return;
-      setTimeout(() => {
-        r && e.edit(r);
-      });
-      return;
-    }
-    if (t.key === " ") {
-      t.preventDefault();
-      const r = e.focusedNode;
-      if (!r)
-        return;
-      r.isLeaf ? (r.select(), r.activate()) : r.toggle();
-      return;
-    }
-    if (t.key === "*") {
-      const r = e.focusedNode;
-      if (!r)
-        return;
-      e.openSiblings(r);
-      return;
-    }
-    if (t.key === "PageUp") {
-      t.preventDefault(), e.pageUp();
-      return;
-    }
-    t.key === "PageDown" && (t.preventDefault(), e.pageDown()), clearTimeout(f), i += t.key, f = setTimeout(() => {
-      i = "";
-    }, 600);
-    const s = e.visibleNodes.find((r) => {
-      const n = r.data.name;
-      return typeof n == "string" ? n.toLowerCase().startsWith(i) : !1;
-    });
-    s && e.focus(s.id);
-  }, children: l.jsx(c, { className: e.props.className, outerRef: e.listEl, itemCount: e.visibleNodes.length, height: e.height, width: e.width, itemSize: e.rowHeight, overscanCount: e.overscanCount, itemKey: (t) => {
-    var o;
-    return ((o = e.visibleNodes[t]) === null || o === void 0 ? void 0 : o.id) || t;
-  }, outerElementType: g, innerElementType: h, onScroll: e.props.onScroll, onItemsRendered: e.onItemsRendered.bind(e), ref: e.list, children: v }) });
+import { initialState as n } from "./index.es341.js";
+const D = {
+  cursor(r) {
+    return { type: "DND_CURSOR", cursor: r };
+  },
+  dragStart(r, e) {
+    return { type: "DND_DRAG_START", id: r, dragIds: e };
+  },
+  dragEnd() {
+    return { type: "DND_DRAG_END" };
+  },
+  hovering(r, e) {
+    return { type: "DND_HOVERING", parentId: r, index: e };
+  }
+};
+function s(r = n().dnd, e) {
+  switch (e.type) {
+    case "DND_CURSOR":
+      return Object.assign(Object.assign({}, r), { cursor: e.cursor });
+    case "DND_DRAG_START":
+      return Object.assign(Object.assign({}, r), { dragId: e.id, dragIds: e.dragIds });
+    case "DND_DRAG_END":
+      return n().dnd;
+    case "DND_HOVERING":
+      return Object.assign(Object.assign({}, r), { parentId: e.parentId, index: e.index });
+    default:
+      return r;
+  }
 }
 export {
-  C as DefaultContainer
+  D as actions,
+  s as reducer
 };

package/dist/index.es268.js

@@ -1,36 +1,46 @@
-function h(i) {
-  return i.isFiltered ? u(i.root, i.isMatch.bind(i)) : o(i.root);
-}
-function o(i) {
-  const c = [];
-  function n(r) {
-    var l;
-    r.level >= 0 && c.push(r), r.isOpen && ((l = r.children) === null || l === void 0 || l.forEach(n));
-  }
-  return n(i), c.forEach(a), c;
+import { j as r } from "./index.es84.js";
+import { memo as o } from "react";
+import { useTreeApi as l } from "./index.es340.js";
+const u = {
+  position: "fixed",
+  pointerEvents: "none",
+  zIndex: 100,
+  left: 0,
+  top: 0,
+  width: "100%",
+  height: "100%"
+}, c = (e) => {
+  if (!e)
+    return { display: "none" };
+  const { x: n, y: t } = e;
+  return { transform: `translate(${n}px, ${t}px)` };
+}, d = (e) => {
+  if (!e)
+    return { display: "none" };
+  const { x: n, y: t } = e;
+  return { transform: `translate(${n + 10}px, ${t + 10}px)` };
+};
+function v({ offset: e, mouse: n, id: t, dragIds: i, isDragging: s }) {
+  return r.jsxs(a, { isDragging: s, children: [r.jsx(f, { offset: e, children: r.jsx(p, { id: t, dragIds: i }) }), r.jsx(x, { mouse: n, count: i.length })] });
 }
-function u(i, c) {
-  const n = {}, r = [];
-  function l(t) {
-    if (!t.isRoot && c(t)) {
-      n[t.id] = !0;
-      let e = t.parent;
-      for (; e; )
-        n[e.id] = !0, e = e.parent;
-    }
-    if (t.children)
-      for (let e of t.children)
-        l(e);
-  }
-  function s(t) {
-    var f;
-    t.level >= 0 && n[t.id] && r.push(t), t.isOpen && ((f = t.children) === null || f === void 0 || f.forEach(s));
-  }
-  return l(i), s(i), r.forEach(a), r;
+const a = o(function(n) {
+  return n.isDragging ? r.jsx("div", { style: u, children: n.children }) : null;
+});
+function f(e) {
+  return r.jsx("div", { className: "row preview", style: c(e.offset), children: e.children });
 }
-function a(i, c) {
-  i.rowIndex = c;
+function x(e) {
+  const { count: n, mouse: t } = e;
+  return n > 1 ? r.jsx("div", { className: "selected-count", style: d(t), children: n }) : null;
 }
+const p = o(function(n) {
+  const t = l(), i = t.get(n.id);
+  return i ? r.jsx(t.renderNode, { preview: !0, node: i, style: {
+    paddingLeft: i.level * t.indent,
+    opacity: 0.2,
+    background: "transparent"
+  }, tree: t }) : null;
+});
 export {
-  h as createList
+  v as DefaultDragPreview
 };

package/dist/index.es269.js

@@ -1,4 +1,161 @@
-const c = (r) => r.reduce((e, t, n) => (e[t.id] = n, e), {});
+import { j as l } from "./index.es84.js";
+import { FixedSizeList as c } from "./index.es348.js";
+import { useDataUpdates as d, useTreeApi as p } from "./index.es340.js";
+import { focusNextElement as m, focusPrevElement as y } from "./index.es259.js";
+import { ListOuterElement as g } from "./index.es349.js";
+import { ListInnerElement as h } from "./index.es350.js";
+import { RowContainer as v } from "./index.es351.js";
+let i = "", f = null;
+function C() {
+  d();
+  const e = p();
+  return l.jsx("div", { role: "tree", style: {
+    height: e.height,
+    width: e.width,
+    minHeight: 0,
+    minWidth: 0
+  }, onContextMenu: e.props.onContextMenu, onClick: e.props.onClick, tabIndex: 0, onFocus: (t) => {
+    t.currentTarget.contains(t.relatedTarget) || e.onFocus();
+  }, onBlur: (t) => {
+    t.currentTarget.contains(t.relatedTarget) || e.onBlur();
+  }, onKeyDown: (t) => {
+    var o;
+    if (e.isEditing)
+      return;
+    if (t.key === "Backspace") {
+      if (!e.props.onDelete)
+        return;
+      const r = Array.from(e.selectedIds);
+      if (r.length > 1) {
+        let n = e.mostRecentNode;
+        for (; n && n.isSelected; )
+          n = n.nextSibling;
+        n || (n = e.lastNode), e.focus(n, { scroll: !1 }), e.delete(Array.from(r));
+      } else {
+        const n = e.focusedNode;
+        if (n) {
+          const u = n.nextSibling, a = n.parent;
+          e.focus(u || a, { scroll: !1 }), e.delete(n);
+        }
+      }
+      return;
+    }
+    if (t.key === "Tab" && !t.shiftKey) {
+      t.preventDefault(), m(t.currentTarget);
+      return;
+    }
+    if (t.key === "Tab" && t.shiftKey) {
+      t.preventDefault(), y(t.currentTarget);
+      return;
+    }
+    if (t.key === "ArrowDown") {
+      t.preventDefault();
+      const r = e.nextNode;
+      if (t.metaKey) {
+        e.select(e.focusedNode), e.activate(e.focusedNode);
+        return;
+      } else if (!t.shiftKey || e.props.disableMultiSelection) {
+        e.focus(r);
+        return;
+      } else {
+        if (!r)
+          return;
+        const n = e.focusedNode;
+        n ? n.isSelected ? e.selectContiguous(r) : e.selectMulti(r) : e.focus(e.firstNode);
+        return;
+      }
+    }
+    if (t.key === "ArrowUp") {
+      t.preventDefault();
+      const r = e.prevNode;
+      if (!t.shiftKey || e.props.disableMultiSelection) {
+        e.focus(r);
+        return;
+      } else {
+        if (!r)
+          return;
+        const n = e.focusedNode;
+        n ? n.isSelected ? e.selectContiguous(r) : e.selectMulti(r) : e.focus(e.lastNode);
+        return;
+      }
+    }
+    if (t.key === "ArrowRight") {
+      const r = e.focusedNode;
+      if (!r)
+        return;
+      r.isInternal && r.isOpen ? e.focus(e.nextNode) : r.isInternal && e.open(r.id);
+      return;
+    }
+    if (t.key === "ArrowLeft") {
+      const r = e.focusedNode;
+      if (!r || r.isRoot)
+        return;
+      r.isInternal && r.isOpen ? e.close(r.id) : !((o = r.parent) === null || o === void 0) && o.isRoot || e.focus(r.parent);
+      return;
+    }
+    if (t.key === "a" && t.metaKey && !e.props.disableMultiSelection) {
+      t.preventDefault(), e.selectAll();
+      return;
+    }
+    if (t.key === "a" && !t.metaKey && e.props.onCreate) {
+      e.createLeaf();
+      return;
+    }
+    if (t.key === "A" && !t.metaKey) {
+      if (!e.props.onCreate)
+        return;
+      e.createInternal();
+      return;
+    }
+    if (t.key === "Home") {
+      t.preventDefault(), e.focus(e.firstNode);
+      return;
+    }
+    if (t.key === "End") {
+      t.preventDefault(), e.focus(e.lastNode);
+      return;
+    }
+    if (t.key === "Enter") {
+      const r = e.focusedNode;
+      if (!r || !r.isEditable || !e.props.onRename)
+        return;
+      setTimeout(() => {
+        r && e.edit(r);
+      });
+      return;
+    }
+    if (t.key === " ") {
+      t.preventDefault();
+      const r = e.focusedNode;
+      if (!r)
+        return;
+      r.isLeaf ? (r.select(), r.activate()) : r.toggle();
+      return;
+    }
+    if (t.key === "*") {
+      const r = e.focusedNode;
+      if (!r)
+        return;
+      e.openSiblings(r);
+      return;
+    }
+    if (t.key === "PageUp") {
+      t.preventDefault(), e.pageUp();
+      return;
+    }
+    t.key === "PageDown" && (t.preventDefault(), e.pageDown()), clearTimeout(f), i += t.key, f = setTimeout(() => {
+      i = "";
+    }, 600);
+    const s = e.visibleNodes.find((r) => {
+      const n = r.data.name;
+      return typeof n == "string" ? n.toLowerCase().startsWith(i) : !1;
+    });
+    s && e.focus(s.id);
+  }, children: l.jsx(c, { className: e.props.className, outerRef: e.listEl, itemCount: e.visibleNodes.length, height: e.height, width: e.width, itemSize: e.rowHeight, overscanCount: e.overscanCount, itemKey: (t) => {
+    var o;
+    return ((o = e.visibleNodes[t]) === null || o === void 0 ? void 0 : o.id) || t;
+  }, outerElementType: g, innerElementType: h, onScroll: e.props.onScroll, onItemsRendered: e.onItemsRendered.bind(e), ref: e.list, children: v }) });
+}
 export {
-  c as createIndex
+  C as DefaultContainer
 };

package/dist/index.es27.js

@@ -1,4 +1,4 @@
-import { cva as r } from "./index.es86.js";
+import { cva as r } from "./index.es87.js";
 const e = r(
   "ui-inline-flex ui-items-center ui-rounded-full ui-border ui-gap-2 ui-px-2.5 ui-py-0.5 ui-text-xs ui-font-semibold ui-transition-colors focus:ui-outline-none focus:ui-ring-2 focus:ui-ring-ring focus:ui-ring-offset-2",
   {

package/dist/index.es270.js

@@ -1,82 +1,36 @@
-class o {
-  constructor(i) {
-    this.root = l(i);
-  }
-  get data() {
-    var i, t;
-    return (t = (i = this.root.children) === null || i === void 0 ? void 0 : i.map((n) => n.data)) !== null && t !== void 0 ? t : [];
-  }
-  create(i) {
-    const t = i.parentId ? this.find(i.parentId) : this.root;
-    if (!t)
-      return null;
-    t.addChild(i.data, i.index);
-  }
-  move(i) {
-    const t = this.find(i.id), n = i.parentId ? this.find(i.parentId) : this.root;
-    !t || !n || (n.addChild(t.data, i.index), t.drop());
-  }
-  update(i) {
-    const t = this.find(i.id);
-    t && t.update(i.changes);
-  }
-  drop(i) {
-    const t = this.find(i.id);
-    t && t.drop();
-  }
-  find(i, t = this.root) {
-    if (!t)
-      return null;
-    if (t.id === i)
-      return t;
-    if (t.children) {
-      for (let n of t.children) {
-        const e = this.find(i, n);
-        if (e)
-          return e;
-      }
-      return null;
-    }
-    return null;
-  }
+function h(i) {
+  return i.isFiltered ? u(i.root, i.isMatch.bind(i)) : o(i.root);
 }
-function l(d) {
-  const i = new h({ id: "ROOT" }, null);
-  return i.children = d.map((t) => r(t, i)), i;
-}
-function r(d, i) {
-  const t = new h(d, i);
-  return d.children && (t.children = d.children.map((n) => r(n, t))), t;
-}
-class h {
-  constructor(i, t) {
-    this.data = i, this.parent = t, this.id = i.id;
-  }
-  hasParent() {
-    return !!this.parent;
-  }
-  get childIndex() {
-    return this.hasParent() ? this.parent.children.indexOf(this) : -1;
+function o(i) {
+  const c = [];
+  function n(r) {
+    var l;
+    r.level >= 0 && c.push(r), r.isOpen && ((l = r.children) === null || l === void 0 || l.forEach(n));
   }
-  addChild(i, t) {
-    var n, e;
-    const s = r(i, this);
-    this.children = (n = this.children) !== null && n !== void 0 ? n : [], this.children.splice(t, 0, s), this.data.children = (e = this.data.children) !== null && e !== void 0 ? e : [], this.data.children.splice(t, 0, i);
-  }
-  removeChild(i) {
-    var t, n;
-    (t = this.children) === null || t === void 0 || t.splice(i, 1), (n = this.data.children) === null || n === void 0 || n.splice(i, 1);
-  }
-  update(i) {
-    if (this.hasParent()) {
-      const t = this.childIndex;
-      this.parent.addChild(Object.assign(Object.assign({}, this.data), i), t), this.drop();
+  return n(i), c.forEach(a), c;
+}
+function u(i, c) {
+  const n = {}, r = [];
+  function l(t) {
+    if (!t.isRoot && c(t)) {
+      n[t.id] = !0;
+      let e = t.parent;
+      for (; e; )
+        n[e.id] = !0, e = e.parent;
     }
+    if (t.children)
+      for (let e of t.children)
+        l(e);
   }
-  drop() {
-    this.hasParent() && this.parent.removeChild(this.childIndex);
+  function s(t) {
+    var f;
+    t.level >= 0 && n[t.id] && r.push(t), t.isOpen && ((f = t.children) === null || f === void 0 || f.forEach(s));
   }
+  return l(i), s(i), r.forEach(a), r;
+}
+function a(i, c) {
+  i.rowIndex = c;
 }
 export {
-  o as SimpleTree
+  h as createList
 };

package/dist/index.es271.js

@@ -1,21 +1,4 @@
-import { useState as i, useMemo as s } from "react";
-import { SimpleTree as l } from "./index.es270.js";
-let m = 0;
-function D(d) {
-  const [a, o] = i(d), t = s(() => new l(a), [a]);
-  return [a, { onMove: (e) => {
-    for (const n of e.dragIds)
-      t.move({ id: n, parentId: e.parentId, index: e.index });
-    o(t.data);
-  }, onRename: ({ name: e, id: n }) => {
-    t.update({ id: n, changes: { name: e } }), o(t.data);
-  }, onCreate: ({ parentId: e, index: n, type: c }) => {
-    const r = { id: `simple-tree-id-${m++}`, name: "" };
-    return c === "internal" && (r.children = []), t.create({ parentId: e, index: n, data: r }), o(t.data), r;
-  }, onDelete: (e) => {
-    e.ids.forEach((n) => t.drop({ id: n })), o(t.data);
-  } }];
-}
+const c = (r) => r.reduce((e, t, n) => (e[t.id] = n, e), {});
 export {
-  D as useSimpleTree
+  c as createIndex
 };

package/dist/index.es272.js

@@ -1,4 +1,82 @@
-var t = { exports: {} };
+class o {
+  constructor(i) {
+    this.root = l(i);
+  }
+  get data() {
+    var i, t;
+    return (t = (i = this.root.children) === null || i === void 0 ? void 0 : i.map((n) => n.data)) !== null && t !== void 0 ? t : [];
+  }
+  create(i) {
+    const t = i.parentId ? this.find(i.parentId) : this.root;
+    if (!t)
+      return null;
+    t.addChild(i.data, i.index);
+  }
+  move(i) {
+    const t = this.find(i.id), n = i.parentId ? this.find(i.parentId) : this.root;
+    !t || !n || (n.addChild(t.data, i.index), t.drop());
+  }
+  update(i) {
+    const t = this.find(i.id);
+    t && t.update(i.changes);
+  }
+  drop(i) {
+    const t = this.find(i.id);
+    t && t.drop();
+  }
+  find(i, t = this.root) {
+    if (!t)
+      return null;
+    if (t.id === i)
+      return t;
+    if (t.children) {
+      for (let n of t.children) {
+        const e = this.find(i, n);
+        if (e)
+          return e;
+      }
+      return null;
+    }
+    return null;
+  }
+}
+function l(d) {
+  const i = new h({ id: "ROOT" }, null);
+  return i.children = d.map((t) => r(t, i)), i;
+}
+function r(d, i) {
+  const t = new h(d, i);
+  return d.children && (t.children = d.children.map((n) => r(n, t))), t;
+}
+class h {
+  constructor(i, t) {
+    this.data = i, this.parent = t, this.id = i.id;
+  }
+  hasParent() {
+    return !!this.parent;
+  }
+  get childIndex() {
+    return this.hasParent() ? this.parent.children.indexOf(this) : -1;
+  }
+  addChild(i, t) {
+    var n, e;
+    const s = r(i, this);
+    this.children = (n = this.children) !== null && n !== void 0 ? n : [], this.children.splice(t, 0, s), this.data.children = (e = this.data.children) !== null && e !== void 0 ? e : [], this.data.children.splice(t, 0, i);
+  }
+  removeChild(i) {
+    var t, n;
+    (t = this.children) === null || t === void 0 || t.splice(i, 1), (n = this.data.children) === null || n === void 0 || n.splice(i, 1);
+  }
+  update(i) {
+    if (this.hasParent()) {
+      const t = this.childIndex;
+      this.parent.addChild(Object.assign(Object.assign({}, this.data), i), t), this.drop();
+    }
+  }
+  drop() {
+    this.hasParent() && this.parent.removeChild(this.childIndex);
+  }
+}
 export {
-  t as __module
+  o as SimpleTree
 };