@dxos/plugin-explorer 0.8.4-main.c1de068 → 0.8.4-main.f5c0578

package/dist/lib/node-esm/{chunk-S5A2EUSJ.mjs → chunk-W4ZNCGOD.mjs}

@@ -10978,7 +10978,6 @@ var TidyTree_default = TidyTree;
 import { Schema } from "effect";
 import { Key, Obj, Type } from "@dxos/echo";
 import { invariant } from "@dxos/invariant";
-var __dxlog_file = "/__w/dxos/dxos/packages/plugins/plugin-explorer/src/components/Tree/types/tree.ts";
 var TreeNodeType = Schema.Struct({
   id: Key.ObjectId,
   children: Schema.mutable(Schema.Array(Key.ObjectId)),
@@ -10998,245 +10997,6 @@ var TreeType = Schema.Struct({
   typename: "dxos.org/type/Tree",
   version: "0.1.0"
 }));
-var Tree = class _Tree {
-  static {
-    this.create = () => {
-      const id = Key.ObjectId.random();
-      return Obj.make(TreeType, {
-        root: id,
-        nodes: {
-          [id]: {
-            id,
-            children: [],
-            data: {
-              text: ""
-            }
-          }
-        }
-      });
-    };
-  }
-  constructor(tree3) {
-    this._tree = tree3 ?? _Tree.create();
-  }
-  get tree() {
-    return this._tree;
-  }
-  // TODO(burdon): Make reactive.
-  get size() {
-    return Object.keys(this._tree.nodes).length;
-  }
-  get root() {
-    return this.getNode(this._tree.root);
-  }
-  //
-  // Traversal
-  //
-  /**
-  * Recursively traverse the tree until the callback returns a value.
-  */
-  tranverse(callback, root = this._tree.root, depth = 0) {
-    const node = this._tree.nodes[root];
-    const result = callback(node, depth);
-    if (result !== void 0) {
-      return result;
-    }
-    for (const childId of node.children) {
-      const result2 = this.tranverse(callback, childId, depth + 1);
-      if (result2 !== void 0) {
-        return result2;
-      }
-    }
-  }
-  getNode(id) {
-    const node = this._tree.nodes[id];
-    invariant(node, void 0, {
-      F: __dxlog_file,
-      L: 98,
-      S: this,
-      A: [
-        "node",
-        ""
-      ]
-    });
-    return node;
-  }
-  /**
-  * Get the children of a node.
-  */
-  getChildNodes(node) {
-    return node.children.map((id) => this.getNode(id));
-  }
-  /**
-  * Get the parent of a node.
-  */
-  getParent(node) {
-    const parent = this.tranverse((n) => {
-      if (n.children.includes(node.id)) {
-        return n;
-      }
-    });
-    return parent ?? null;
-  }
-  /**
-  * Get the next node in the tree.
-  */
-  getNext(node, hierarchical = true) {
-    if (hierarchical && node.children.length) {
-      return this.getChildNodes(node)[0];
-    } else {
-      const parent = this.getParent(node);
-      if (parent) {
-        const idx = this.getChildNodes(parent).findIndex(({ id }) => id === node.id);
-        if (idx < parent.children.length - 1) {
-          return this.getNode(parent.children[idx + 1]);
-        } else {
-          return this.getNext(parent, false);
-        }
-      }
-    }
-  }
-  /**
-  * Get the previous node in the tree.
-  */
-  getPrevious(node, hierarchical = true) {
-    const parent = this.getParent(node);
-    const idx = this.getChildNodes(parent).findIndex(({ id }) => id === node.id);
-    if (idx === 0) {
-      if (hierarchical) {
-        return parent;
-      }
-    } else {
-      const previous = this.getNode(parent.children[idx - 1]);
-      if (hierarchical && previous.children.length) {
-        return this.getLastDescendent(previous);
-      }
-      return previous;
-    }
-  }
-  /**
-  * Get the last descendent of a node.
-  */
-  getLastDescendent(node) {
-    const children = this.getChildNodes(node);
-    const last = children.length ? children[children.length - 1] : void 0;
-    if (last) {
-      return this.getLastDescendent(last);
-    }
-    return node;
-  }
-  //
-  // Mutations
-  //
-  /**
-  * Clear tree.
-  */
-  clear() {
-    const root = this._tree.nodes[this._tree.root];
-    root.children.length = 0;
-    this._tree.nodes = {
-      [root.id]: root
-    };
-  }
-  /**
-  * Add node.
-  */
-  addNode(parent, node, index) {
-    if (!node) {
-      const id = Key.ObjectId.random();
-      node = {
-        id,
-        children: [],
-        data: {
-          text: ""
-        }
-      };
-    }
-    this._tree.nodes[node.id] = node;
-    parent.children.splice(index ?? parent.children.length, 0, node.id);
-    return node;
-  }
-  /**
-  * Delete node.
-  */
-  deleteNode(parent, id) {
-    const node = this._tree.nodes[id];
-    if (!node) {
-      return void 0;
-    }
-    delete this._tree.nodes[node.id];
-    const idx = parent.children.findIndex((child) => child === id);
-    if (idx !== -1) {
-      parent.children.splice(idx, 1);
-    }
-    return node;
-  }
-  /**
-  * Move child node.
-  */
-  moveNode(node, from, to) {
-    invariant(from >= 0 && from < node.children.length, void 0, {
-      F: __dxlog_file,
-      L: 228,
-      S: this,
-      A: [
-        "from >= 0 && from < node.children.length",
-        ""
-      ]
-    });
-    invariant(to >= 0 && to < node.children.length, void 0, {
-      F: __dxlog_file,
-      L: 229,
-      S: this,
-      A: [
-        "to >= 0 && to < node.children.length",
-        ""
-      ]
-    });
-    if (from === to) {
-      return null;
-    }
-    const child = node.children[from];
-    node.children.splice(from, 1);
-    node.children.splice(to, 0, child);
-    return this.getNode(child);
-  }
-  /**
-  * Indent node.
-  */
-  indentNode(node) {
-    const parent = this.getParent(node);
-    if (!parent) {
-      return;
-    }
-    const idx = parent.children.findIndex((child) => child === node.id);
-    if (idx < 1 || idx >= parent.children.length) {
-      return;
-    }
-    const previous = this.getNode(parent.children[idx - 1]);
-    parent.children.splice(idx, 1);
-    previous.children.push(node.id);
-  }
-  /**
-  * Unindent node.
-  */
-  unindentNode(node) {
-    const parent = this.getParent(node);
-    if (!parent) {
-      return;
-    }
-    const ancestor = this.getParent(parent);
-    if (!ancestor) {
-      return;
-    }
-    const nodeIdx = parent.children.findIndex((id) => id === node.id);
-    const [_, ...rest] = parent.children.splice(nodeIdx, parent.children.length - nodeIdx);
-    parent.children.splice(nodeIdx, parent.children.length - nodeIdx);
-    const parentIdx = this.getChildNodes(ancestor).findIndex((n) => n.id === parent.id);
-    ancestor.children.splice(parentIdx + 1, 0, node.id);
-    node.children.push(...rest);
-  }
-};
 
 // src/components/Tree/types/types.ts
 var mapGraphToTreeData = (model, maxDepth = 8) => {
@@ -11264,7 +11024,7 @@ var renderers = /* @__PURE__ */ new Map([
     HierarchicalEdgeBundling_default
   ]
 ]);
-var Tree2 = ({ space, selected, variant = "tidy", onNodeClick }) => {
+var Tree = ({ space, selected, variant = "tidy", onNodeClick }) => {
   var _effect = _useSignals3();
   try {
     const [model] = useAsyncState(async () => space ? new SpaceGraphModel().open(space) : void 0, [
@@ -11319,13 +11079,13 @@ var Tree2 = ({ space, selected, variant = "tidy", onNodeClick }) => {
 
 // src/components/index.ts
 import { lazy } from "react";
-var ExplorerContainer = lazy(() => import("./ExplorerContainer-6ON5NA2P.mjs"));
+var ExplorerContainer = lazy(() => import("./ExplorerContainer-AMYAVLO4.mjs"));
 
 export {
   Chart,
   Globe,
   defaultTreeLayoutSlots,
-  Tree2 as Tree,
+  Tree,
   ExplorerContainer
 };
-//# sourceMappingURL=chunk-S5A2EUSJ.mjs.map
+//# sourceMappingURL=chunk-W4ZNCGOD.mjs.map