tree-element 0.2.0 → 0.3.0

package/lib/node.js

@@ -26,38 +26,62 @@ prefix-private-members: all
  * :::
  */
 class Node {
-  /** @hidden */
+  /**
+  @hidden
+  */
 
-  /** The child nodes. */
+  /**
+  The child nodes.
+  */
   children;
   /** The `li` element, once the node is rendered. Nodes inside a closed
    * folder are rendered when the folder is opened. */
   element;
-  /** The id from the node data. */
+  /**
+  The id from the node data.
+  */
   id;
-  /** @hidden */
+  /**
+  @hidden
+  */
   idMapping;
-  /** Whether the node's children are being fetched. */
+  /**
+  Whether the node's children are being fetched.
+  */
   is_loading;
-  /** Whether the folder is open. */
+  /**
+  Whether the folder is open.
+  */
   is_open;
-  /** Whether the node data had an empty `children` array. */
+  /**
+  Whether the node data had an empty `children` array.
+  */
   isEmptyFolder;
-  /** Whether the children still have to be fetched. */
-  load_on_demand;
-  /** The label. Also settable from the `label` key in node data. */
-  name;
-  /** @hidden */
+  /**
+  Whether the children still have to be fetched.
+  */
+  load_on_demand = false;
+  /**
+  The label. Also settable from the `label` key in node data.
+  */
+  name = "";
+  /**
+  @hidden
+  */
   nodeClass;
-  /** The parent; `null` for the root node. */
+  /**
+  The parent; `null` for the root node.
+  */
   parent;
-  /** The root node. */
+  /**
+  The root node.
+  */
   tree;
 
-  /** @hidden */
+  /**
+  @hidden
+  */
   constructor(nodeData = null, isRoot = false, nodeClass = Node) {
-    this.name = "";
-    this.load_on_demand = false;
     this.isEmptyFolder = nodeData != null && isNodeRecordWithChildren(nodeData) && nodeData.children.length === 0;
     this.setData(nodeData);
     this.children = [];
@@ -80,15 +104,14 @@ class Node {
    * @group Changing the tree
    */
   addAfter(nodeInfo) {
-    if (!this.parent) {
-      return null;
-    } else {
+    if (this.parent) {
       let node = this._createNode(nodeInfo);
       let childIndex = this.parent.getChildIndex(this);
       this.parent.addChildAtPosition(node, childIndex + 1);
       node._loadChildrenFromData(nodeInfo);
       return node;
     }
+    return null;
   }
 
   /**
@@ -98,15 +121,14 @@ class Node {
    * @group Changing the tree
    */
   addBefore(nodeInfo) {
-    if (!this.parent) {
-      return null;
-    } else {
+    if (this.parent) {
       let node = this._createNode(nodeInfo);
       let childIndex = this.parent.getChildIndex(this);
       this.parent.addChildAtPosition(node, childIndex);
       node._loadChildrenFromData(nodeInfo);
       return node;
     }
+    return null;
   }
 
   /**
@@ -130,7 +152,9 @@ class Node {
     node._setParent(this);
   }
 
-  /** @hidden */
+  /**
+  @hidden
+  */
   addNodeToIndex(node) {
     if (node.id != null) {
       this.idMapping?.set(node.id, node);
@@ -144,9 +168,7 @@ class Node {
    * @group Changing the tree
    */
   addParent(nodeInfo) {
-    if (!this.parent) {
-      return null;
-    } else {
+    if (this.parent) {
       let newParent = this._createNode(nodeInfo);
       if (this.tree) {
         newParent._setParent(this.tree);
@@ -159,6 +181,7 @@ class Node {
       originalParent.addChild(newParent);
       return newParent;
     }
+    return null;
   }
 
   /**
@@ -225,10 +248,11 @@ class Node {
       return nodes.map(node => {
         let tmpNode = {};
         for (let k in node) {
-          if (["parent", "children", "element", "idMapping", "load_on_demand", "nodeClass", "tree", "isEmptyFolder"].indexOf(k) === -1 && Object.prototype.hasOwnProperty.call(node, k)) {
-            let v = node[k];
-            tmpNode[k] = v;
+          if (["children", "element", "idMapping", "isEmptyFolder", "load_on_demand", "nodeClass", "parent", "tree"].includes(k) || !Object.prototype.hasOwnProperty.call(node, k)) {
+            continue;
           }
+          let v = node[k];
+          tmpNode[k] = v;
         }
         if (node.hasChildren()) {
           tmpNode.children = getDataFromNodes(node.children);
@@ -236,11 +260,7 @@ class Node {
         return tmpNode;
       });
     };
-    if (includeParent) {
-      return getDataFromNodes([this]);
-    } else {
-      return getDataFromNodes(this.children);
-    }
+    return getDataFromNodes(includeParent ? [this] : this.children);
   }
 
   /**
@@ -250,16 +270,11 @@ class Node {
    * @group Moving around the tree
    */
   getLastChild() {
-    if (!this.hasChildren()) {
-      return null;
-    } else {
+    if (this.hasChildren()) {
       let lastChild = this.children[this.children.length - 1];
-      if (!(lastChild.hasChildren() && lastChild.is_open)) {
-        return lastChild;
-      } else {
-        return lastChild.getLastChild();
-      }
+      return lastChild.hasChildren() && lastChild.is_open ? lastChild.getLastChild() : lastChild;
     }
+    return null;
   }
 
   /**
@@ -269,7 +284,7 @@ class Node {
    */
   getLevel() {
     let level = 0;
-    let node = this; // eslint-disable-line @typescript-eslint/no-this-alias
+    let node = this; // eslint-disable-line @typescript-eslint/no-this-alias, unicorn/no-this-assignment
 
     while (node.parent) {
       level += 1;
@@ -287,16 +302,12 @@ class Node {
   getNextNode(includeChildren = true) {
     if (includeChildren && this.hasChildren()) {
       return this.children[0] ?? null;
-    } else if (!this.parent) {
-      return null;
-    } else {
+    }
+    if (this.parent) {
       let nextSibling = this.getNextSibling();
-      if (nextSibling) {
-        return nextSibling;
-      } else {
-        return this.parent.getNextNode(false);
-      }
+      return nextSibling ?? this.parent.getNextNode(false);
     }
+    return null;
   }
 
   /**
@@ -305,16 +316,11 @@ class Node {
    * @group Moving around the tree
    */
   getNextSibling() {
-    if (!this.parent) {
-      return null;
-    } else {
+    if (this.parent) {
       let nextIndex = this.parent.getChildIndex(this) + 1;
-      if (nextIndex < this.parent.children.length) {
-        return this.parent.children[nextIndex] ?? null;
-      } else {
-        return null;
-      }
+      return nextIndex < this.parent.children.length ? this.parent.children[nextIndex] ?? null : null;
     }
+    return null;
   }
 
   /**
@@ -327,20 +333,17 @@ class Node {
     if (this.hasChildren() && this.is_open) {
       // First child
       return this.children[0] ?? null;
-    } else {
-      if (!this.parent) {
-        return null;
-      } else {
-        let nextSibling = this.getNextSibling();
-        if (nextSibling) {
-          // Next sibling
-          return nextSibling;
-        } else {
-          // Next node of parent
-          return this.parent.getNextNode(false);
-        }
+    }
+    if (this.parent) {
+      let nextSibling = this.getNextSibling();
+      if (nextSibling) {
+        // Next sibling
+        return nextSibling;
       }
+      // Next node of parent
+      return this.parent.getNextNode(false);
     }
+    return null;
   }
 
   /**
@@ -353,12 +356,12 @@ class Node {
     this.iterate(node => {
       if (result) {
         return false;
-      } else if (callback(node)) {
+      }
+      if (callback(node)) {
         result = node;
         return false;
-      } else {
-        return true;
       }
+      return true;
     });
     return result;
   }
@@ -414,12 +417,12 @@ class Node {
     // Return parent except if it is the root node
     if (!this.parent) {
       return null;
-    } else if (!this.parent.parent) {
-      // Root node -> null
-      return null;
-    } else {
+    }
+    if (this.parent.parent) {
       return this.parent;
     }
+    // Root node -> null
+    return null;
   }
 
   /**
@@ -429,18 +432,14 @@ class Node {
    * @group Moving around the tree
    */
   getPreviousNode() {
-    if (!this.parent) {
-      return null;
-    } else {
+    if (this.parent) {
       let previousSibling = this.getPreviousSibling();
       if (!previousSibling) {
         return this.getParent();
-      } else if (previousSibling.hasChildren()) {
-        return previousSibling.getLastChild();
-      } else {
-        return previousSibling;
       }
+      return previousSibling.hasChildren() ? previousSibling.getLastChild() : previousSibling;
     }
+    return null;
   }
 
   /**
@@ -449,16 +448,11 @@ class Node {
    * @group Moving around the tree
    */
   getPreviousSibling() {
-    if (!this.parent) {
-      return null;
-    } else {
+    if (this.parent) {
       let previousIndex = this.parent.getChildIndex(this) - 1;
-      if (previousIndex >= 0) {
-        return this.parent.children[previousIndex] ?? null;
-      } else {
-        return null;
-      }
+      return previousIndex >= 0 ? this.parent.children[previousIndex] ?? null : null;
     }
+    return null;
   }
 
   /**
@@ -468,20 +462,19 @@ class Node {
    * @group Moving around the tree
    */
   getPreviousVisibleNode() {
-    if (!this.parent) {
-      return null;
-    } else {
+    if (this.parent) {
       let previousSibling = this.getPreviousSibling();
       if (!previousSibling) {
         return this.getParent();
-      } else if (!previousSibling.hasChildren() || !previousSibling.is_open) {
+      }
+      if (!previousSibling.hasChildren() || !previousSibling.is_open) {
         // Previous sibling
         return previousSibling;
-      } else {
-        // Last child of previous sibling
-        return previousSibling.getLastChild();
       }
+      // Last child of previous sibling
+      return previousSibling.getLastChild();
     }
+    return null;
   }
 
   /**
@@ -595,32 +588,31 @@ class Node {
       // - Node is parent of target node
       // - Or, parent is empty
       return false;
-    } else {
-      movedNode.parent._doRemoveChild(movedNode);
-      switch (position) {
-        case "after":
-          {
-            if (targetNode.parent) {
-              targetNode.parent.addChildAtPosition(movedNode, targetNode.parent.getChildIndex(targetNode) + 1);
-              return true;
-            }
-            return false;
-          }
-        case "before":
-          {
-            if (targetNode.parent) {
-              targetNode.parent.addChildAtPosition(movedNode, targetNode.parent.getChildIndex(targetNode));
-              return true;
-            }
-            return false;
+    }
+    movedNode.parent._doRemoveChild(movedNode);
+    switch (position) {
+      case "after":
+        {
+          if (targetNode.parent) {
+            targetNode.parent.addChildAtPosition(movedNode, targetNode.parent.getChildIndex(targetNode) + 1);
+            return true;
           }
-        case "inside":
-          {
-            // move inside as first child
-            targetNode.addChildAtPosition(movedNode, 0);
+          return false;
+        }
+      case "before":
+        {
+          if (targetNode.parent) {
+            targetNode.parent.addChildAtPosition(movedNode, targetNode.parent.getChildIndex(targetNode));
             return true;
           }
-      }
+          return false;
+        }
+      case "inside":
+        {
+          // move inside as first child
+          targetNode.addChildAtPosition(movedNode, 0);
+          return true;
+        }
     }
   }
 
@@ -643,10 +635,11 @@ class Node {
    * @group Changing the tree
    */
   remove() {
-    if (this.parent) {
-      this.parent.removeChild(this);
-      this.parent = null;
+    if (!this.parent) {
+      return;
     }
+    this.parent.removeChild(this);
+    this.parent = null;
   }
 
   /**
@@ -673,7 +666,9 @@ class Node {
     this.children = [];
   }
 
-  /** @hidden */
+  /**
+  @hidden
+  */
   removeNodeFromIndex(node) {
     if (node.id != null) {
       this.idMapping?.delete(node.id);
@@ -690,21 +685,23 @@ class Node {
   setData(o) {
     if (!o) {
       return;
-    } else if (typeof o === "string") {
+    }
+    if (typeof o === "string") {
       this.name = o;
     } else if (typeof o === "object") {
       for (let key in o) {
-        if (Object.prototype.hasOwnProperty.call(o, key)) {
-          let value = o[key];
-          if (key === "label" || key === "name") {
-            // You can use the 'label' key instead of 'name'; this is a legacy feature
-            if (typeof value === "string") {
-              this.name = value;
-            }
-          } else if (key !== "children" && key !== "parent") {
-            // You can't update the children or the parent using this function
-            this[key] = value;
+        if (!Object.prototype.hasOwnProperty.call(o, key)) {
+          continue;
+        }
+        let value = o[key];
+        if (key === "label" || key === "name") {
+          // You can use the 'label' key instead of 'name'; this is a legacy feature
+          if (typeof value === "string") {
+            this.name = value;
           }
+        } else if (key !== "children" && key !== "parent") {
+          // You can't update the children or the parent using this function
+          this[key] = value;
         }
       }
     }

package/lib/node.js.map

@@ -1 +1 @@
-{"version":3,"file":"node.js","sources":["../src/node.ts"],"sourcesContent":["/*\nA node reads and writes the private members of other nodes (node.setParent),\nso the `_` prefix that the build adds cannot be limited to `this.`:\n\nprefix-private-members: all\n*/\n\nimport { isNodeRecordWithChildren } from \"./nodeUtils\";\n\nexport type NodeData = NodeRecord | string;\n\nexport type NodeId = number | string;\n\nexport interface NodeRecord {\n  [key: string]: unknown;\n  children?: NodeData[];\n  id?: NodeId;\n}\n\nexport type Position = \"after\" | \"before\" | \"inside\";\n\ntype IterateCallback = (node: Node, level: number) => boolean;\n\n/**\n * @groupDescription Properties\n * Any other key in the node data is copied onto the node, so\n * `{ name: \"node1\", color: \"green\" }` gives you `node.color`.\n *\n * @groupDescription Searching\n * These work on any node, and search that node's subtree. Called on the root\n * node, they search the whole tree — which is what the tree's own methods of\n * the same name do.\n *\n * @groupDescription Changing the tree\n * ::: warning\n * These methods change the data without re-rendering. The tree's\n * [methods](/reference/methods) — `appendNode`, `removeNode`, `moveNode` and\n * friends — do the same and refresh the display, so prefer those. If you do\n * use these, call `tree.refresh()` afterwards.\n * :::\n */\nexport class Node {\n  /** @hidden */\n  [key: string]: unknown;\n\n  /** The child nodes. */\n  public children: Node[];\n  /** The `li` element, once the node is rendered. Nodes inside a closed\n   * folder are rendered when the folder is opened. */\n  public element?: HTMLElement;\n  /** The id from the node data. */\n  public id?: NodeId;\n  /** @hidden */\n  public idMapping?: Map<NodeId, Node>;\n  /** Whether the node's children are being fetched. */\n  public is_loading?: boolean;\n  /** Whether the folder is open. */\n  public is_open?: boolean;\n  /** Whether the node data had an empty `children` array. */\n  public isEmptyFolder: boolean;\n  /** Whether the children still have to be fetched. */\n  public load_on_demand: boolean;\n  /** The label. Also settable from the `label` key in node data. */\n  public name: string;\n  /** @hidden */\n  public nodeClass?: typeof Node;\n  /** The parent; `null` for the root node. */\n  public parent: Node | null;\n  /** The root node. */\n  public tree?: Node;\n\n  /** @hidden */\n  constructor(\n    nodeData: NodeData | null = null,\n    isRoot = false,\n    nodeClass = Node,\n  ) {\n    this.name = \"\";\n    this.load_on_demand = false;\n\n    this.isEmptyFolder =\n      nodeData != null &&\n      isNodeRecordWithChildren(nodeData) &&\n      nodeData.children.length === 0;\n\n    this.setData(nodeData);\n\n    this.children = [];\n    this.parent = null;\n    this.is_loading = undefined;\n    this.is_open ??= undefined;\n\n    if (isRoot) {\n      this.idMapping = new Map<NodeId, Node>();\n      this.tree = this;\n      this.nodeClass = nodeClass;\n    } else {\n      this.idMapping = undefined;\n    }\n  }\n\n  /**\n   * Adds a sibling after this node.\n   *\n   * @returns The new node, or `null` when the node has no parent.\n   * @group Changing the tree\n   */\n  public addAfter(nodeInfo: NodeData): Node | null {\n    if (!this.parent) {\n      return null;\n    } else {\n      const node = this.createNode(nodeInfo);\n\n      const childIndex = this.parent.getChildIndex(this);\n      this.parent.addChildAtPosition(node, childIndex + 1);\n\n      node.loadChildrenFromData(nodeInfo);\n      return node;\n    }\n  }\n\n  /**\n   * Adds a sibling before this node.\n   *\n   * @returns The new node, or `null` when the node has no parent.\n   * @group Changing the tree\n   */\n  public addBefore(nodeInfo: NodeData): Node | null {\n    if (!this.parent) {\n      return null;\n    } else {\n      const node = this.createNode(nodeInfo);\n\n      const childIndex = this.parent.getChildIndex(this);\n      this.parent.addChildAtPosition(node, childIndex);\n\n      node.loadChildrenFromData(nodeInfo);\n      return node;\n    }\n  }\n\n  /**\n   * Adds an existing `Node` object as the last child.\n   *\n   * @group Changing the tree\n   */\n  public addChild(node: Node): void {\n    this.children.push(node);\n    node.setParent(this);\n  }\n\n  /**\n   * Adds an existing `Node` object as a child, at this position in\n   * `children`. The index starts at `0`.\n   *\n   * @group Changing the tree\n   */\n  public addChildAtPosition(node: Node, index: number): void {\n    this.children.splice(index, 0, node);\n    node.setParent(this);\n  }\n\n  /** @hidden */\n  public addNodeToIndex(node: Node): void {\n    if (node.id != null) {\n      this.idMapping?.set(node.id, node);\n    }\n  }\n\n  /**\n   * Inserts a new parent between this node and its current parent.\n   *\n   * @returns The new node, or `null` when the node has no parent.\n   * @group Changing the tree\n   */\n  public addParent(nodeInfo: NodeData): Node | null {\n    if (!this.parent) {\n      return null;\n    } else {\n      const newParent = this.createNode(nodeInfo);\n\n      if (this.tree) {\n        newParent.setParent(this.tree);\n      }\n      const originalParent = this.parent;\n\n      for (const child of originalParent.children) {\n        newParent.addChild(child);\n      }\n\n      originalParent.children = [];\n      originalParent.addChild(newParent);\n      return newParent;\n    }\n  }\n\n  /**\n   * Adds a child at the end.\n   *\n   * @returns The new node.\n   * @group Changing the tree\n   */\n  public append(nodeInfo: NodeData): Node {\n    const node = this.createNode(nodeInfo);\n    this.addChild(node);\n\n    node.loadChildrenFromData(nodeInfo);\n    return node;\n  }\n\n  /**\n   * Returns all nodes in the subtree for which the callback returns\n   * `true`.\n   *\n   * @example\n   * ```js\n   * const folders = tree.getTree().filter((node) => node.isFolder());\n   * ```\n   *\n   * @group Searching\n   */\n  public filter(f: (node: Node) => boolean): Node[] {\n    const result: Node[] = [];\n\n    this.iterate((node: Node) => {\n      if (f(node)) {\n        result.push(node);\n      }\n\n      return true;\n    });\n\n    return result;\n  }\n\n  /**\n   * Returns the position of a child in `children`, or `-1`.\n   *\n   * @group Inspecting a node\n   */\n  public getChildIndex(node: Node): number {\n    return this.children.indexOf(node);\n  }\n\n  /**\n   * Returns the subtree as plain data, ready for `JSON.stringify`.\n   * Internal properties (`parent`, `children`, `element`, `tree`,\n   * `idMapping`, `nodeClass`, `load_on_demand`, `isEmptyFolder`) are left\n   * out; your own properties are kept.\n   *\n   * ```js\n   * tree.getTree().getData();\n   * // [{ name: \"node1\", id: 1, children: [{ name: \"child1\", id: 2 }] }]\n   * ```\n   *\n   * @param includeParent - Make the result the node itself rather than its\n   * children. Default `false`.\n   * @group Reading data back\n   */\n  public getData(includeParent = false): NodeRecord[] {\n    const getDataFromNodes = (nodes: Node[]): Record<string, unknown>[] => {\n      return nodes.map((node) => {\n        const tmpNode: Record<string, unknown> = {};\n\n        for (const k in node) {\n          if (\n            [\n              \"parent\",\n              \"children\",\n              \"element\",\n              \"idMapping\",\n              \"load_on_demand\",\n              \"nodeClass\",\n              \"tree\",\n              \"isEmptyFolder\",\n            ].indexOf(k) === -1 &&\n            Object.prototype.hasOwnProperty.call(node, k)\n          ) {\n            const v = node[k];\n            tmpNode[k] = v;\n          }\n        }\n\n        if (node.hasChildren()) {\n          tmpNode.children = getDataFromNodes(node.children);\n        }\n\n        return tmpNode;\n      });\n    };\n\n    if (includeParent) {\n      return getDataFromNodes([this]);\n    } else {\n      return getDataFromNodes(this.children);\n    }\n  }\n\n  /**\n   * Returns the last child, or `null`. When that child is an open folder,\n   * its own last child, and so on.\n   *\n   * @group Moving around the tree\n   */\n  public getLastChild(): Node | null {\n    if (!this.hasChildren()) {\n      return null;\n    } else {\n      const lastChild = this.children[this.children.length - 1] as Node;\n\n      if (!(lastChild.hasChildren() && lastChild.is_open)) {\n        return lastChild;\n      } else {\n        return lastChild.getLastChild();\n      }\n    }\n  }\n\n  /**\n   * Returns the depth of the node, counting the top level as `1`.\n   *\n   * @group Inspecting a node\n   */\n  public getLevel(): number {\n    let level = 0;\n    let node: Node = this; // eslint-disable-line @typescript-eslint/no-this-alias\n\n    while (node.parent) {\n      level += 1;\n      node = node.parent;\n    }\n\n    return level;\n  }\n\n  /**\n   * Returns the next node in the tree, regardless of whether it is\n   * visible. `getNextNode(false)` skips the node's own children.\n   *\n   * @group Moving around the tree\n   */\n  public getNextNode(includeChildren = true): Node | null {\n    if (includeChildren && this.hasChildren()) {\n      return this.children[0] ?? null;\n    } else if (!this.parent) {\n      return null;\n    } else {\n      const nextSibling = this.getNextSibling();\n\n      if (nextSibling) {\n        return nextSibling;\n      } else {\n        return this.parent.getNextNode(false);\n      }\n    }\n  }\n\n  /**\n   * Returns the next sibling, or `null`.\n   *\n   * @group Moving around the tree\n   */\n  public getNextSibling(): Node | null {\n    if (!this.parent) {\n      return null;\n    } else {\n      const nextIndex = this.parent.getChildIndex(this) + 1;\n      if (nextIndex < this.parent.children.length) {\n        return this.parent.children[nextIndex] ?? null;\n      } else {\n        return null;\n      }\n    }\n  }\n\n  /**\n   * Like `getNextNode`, but skipping nodes inside closed folders — this is\n   * what the arrow keys use.\n   *\n   * @group Moving around the tree\n   */\n  public getNextVisibleNode(): Node | null {\n    if (this.hasChildren() && this.is_open) {\n      // First child\n      return this.children[0] ?? null;\n    } else {\n      if (!this.parent) {\n        return null;\n      } else {\n        const nextSibling = this.getNextSibling();\n        if (nextSibling) {\n          // Next sibling\n          return nextSibling;\n        } else {\n          // Next node of parent\n          return this.parent.getNextNode(false);\n        }\n      }\n    }\n  }\n\n  /**\n   * Returns the first node for which the callback returns `true`.\n   *\n   * @group Searching\n   */\n  public getNodeByCallback(callback: (node: Node) => boolean): Node | null {\n    let result: Node | null = null;\n\n    this.iterate((node: Node) => {\n      if (result) {\n        return false;\n      } else if (callback(node)) {\n        result = node;\n        return false;\n      } else {\n        return true;\n      }\n    });\n\n    return result;\n  }\n\n  /**\n   * Returns the node with this id. Only available on the root node, which\n   * keeps the id index.\n   *\n   * @group Searching\n   */\n  public getNodeById(nodeId: NodeId): Node | null {\n    return this.idMapping?.get(nodeId) ?? null;\n  }\n\n  /**\n   * Returns the first node with this name.\n   *\n   * @group Searching\n   */\n  public getNodeByName(name: string): Node | null {\n    return this.getNodeByCallback((node: Node) => node.name === name);\n  }\n\n  /**\n   * Like `getNodeByName`, but throws when there is no such node.\n   *\n   * @group Searching\n   */\n  public getNodeByNameMustExist(name: string): Node {\n    const node = this.getNodeByCallback((n: Node) => n.name === name);\n\n    if (!node) {\n      throw new Error(`Node with name ${name} not found`);\n    }\n\n    return node;\n  }\n\n  /**\n   * Returns all nodes with this property value.\n   *\n   * @group Searching\n   */\n  public getNodesByProperty(key: string, value: unknown): Node[] {\n    return this.filter((node: Node) => node[key] === value);\n  }\n\n  /**\n   * Returns the parent: `null` for a top-level node — the root node is not\n   * returned.\n   *\n   * @group Moving around the tree\n   */\n  public getParent(): Node | null {\n    // Return parent except if it is the root node\n    if (!this.parent) {\n      return null;\n    } else if (!this.parent.parent) {\n      // Root node -> null\n      return null;\n    } else {\n      return this.parent;\n    }\n  }\n\n  /**\n   * Returns the previous node in the tree, regardless of whether it is\n   * visible.\n   *\n   * @group Moving around the tree\n   */\n  public getPreviousNode(): Node | null {\n    if (!this.parent) {\n      return null;\n    } else {\n      const previousSibling = this.getPreviousSibling();\n\n      if (!previousSibling) {\n        return this.getParent();\n      } else if (previousSibling.hasChildren()) {\n        return previousSibling.getLastChild();\n      } else {\n        return previousSibling;\n      }\n    }\n  }\n\n  /**\n   * Returns the previous sibling, or `null`.\n   *\n   * @group Moving around the tree\n   */\n  public getPreviousSibling(): Node | null {\n    if (!this.parent) {\n      return null;\n    } else {\n      const previousIndex = this.parent.getChildIndex(this) - 1;\n      if (previousIndex >= 0) {\n        return this.parent.children[previousIndex] ?? null;\n      } else {\n        return null;\n      }\n    }\n  }\n\n  /**\n   * Like `getPreviousNode`, but skipping nodes inside closed folders —\n   * this is what the arrow keys use.\n   *\n   * @group Moving around the tree\n   */\n  public getPreviousVisibleNode(): Node | null {\n    if (!this.parent) {\n      return null;\n    } else {\n      const previousSibling = this.getPreviousSibling();\n\n      if (!previousSibling) {\n        return this.getParent();\n      } else if (!previousSibling.hasChildren() || !previousSibling.is_open) {\n        // Previous sibling\n        return previousSibling;\n      } else {\n        // Last child of previous sibling\n        return previousSibling.getLastChild();\n      }\n    }\n  }\n\n  /**\n   * Whether the node has children.\n   *\n   * @group Inspecting a node\n   */\n  public hasChildren(): boolean {\n    return this.children.length !== 0;\n  }\n\n  /**\n   * Init Node from data without making it the root of the tree.\n   *\n   * @hidden\n   */\n  public initFromData(data: NodeData): void {\n    const addNode = (nodeData: NodeData): void => {\n      this.setData(nodeData);\n\n      if (isNodeRecordWithChildren(nodeData) && nodeData.children.length) {\n        addChildren(nodeData.children);\n      }\n    };\n\n    const addChildren = (childrenData: NodeData[]): void => {\n      for (const child of childrenData) {\n        const node = this.createNode();\n        node.initFromData(child);\n        this.addChild(node);\n      }\n    };\n\n    addNode(data);\n  }\n\n  /**\n   * `true` when the node has children, or is marked `load_on_demand`.\n   *\n   * @group Inspecting a node\n   */\n  public isFolder(): boolean {\n    return this.hasChildren() || this.load_on_demand;\n  }\n\n  /**\n   * Whether this node is an ancestor of the other node.\n   *\n   * @group Inspecting a node\n   */\n  public isParentOf(node: Node): boolean {\n    let parent = node.parent;\n\n    while (parent) {\n      if (parent === this) {\n        return true;\n      }\n\n      parent = parent.parent;\n    }\n\n    return false;\n  }\n\n  /**\n   * Walks the subtree, calling the callback with `(node, level)`. Return\n   * `false` from the callback to stop descending into that node:\n   *\n   * ```js\n   * tree.getTree().iterate((node, level) => {\n   *   console.log(\" \".repeat(level) + node.name);\n   *   return level <= 2; // don't go deeper than level 2\n   * });\n   * ```\n   *\n   * @group Searching\n   */\n  public iterate(callback: IterateCallback): void {\n    const _iterate = (node: Node, level: number): void => {\n      for (const child of node.children) {\n        const result = callback(child, level);\n\n        if (result && child.hasChildren()) {\n          _iterate(child, level + 1);\n        }\n      }\n    };\n\n    _iterate(this, 0);\n  }\n\n  /**\n   * Replaces the children with new node data.\n   *\n   * @group Changing the tree\n   */\n  public loadFromData(data: NodeData[]): this {\n    this.removeChildren();\n\n    for (const childData of data) {\n      const node = this.createNode(childData);\n      this.addChild(node);\n\n      if (isNodeRecordWithChildren(childData)) {\n        node.loadFromData(childData.children);\n      }\n    }\n\n    return this;\n  }\n\n  /**\n   * Moves a node relative to another node. Called on the root node.\n   *\n   * @param position - `\"before\"`, `\"after\"` or `\"inside\"`.\n   * @returns `false` when the move is impossible, for instance moving a\n   * node into its own subtree.\n   * @group Changing the tree\n   */\n  public moveNode(\n    movedNode: Node,\n    targetNode: Node,\n    position: Position,\n  ): boolean {\n    if (!movedNode.parent || movedNode.isParentOf(targetNode)) {\n      // - Node is parent of target node\n      // - Or, parent is empty\n      return false;\n    } else {\n      movedNode.parent.doRemoveChild(movedNode);\n\n      switch (position) {\n        case \"after\": {\n          if (targetNode.parent) {\n            targetNode.parent.addChildAtPosition(\n              movedNode,\n              targetNode.parent.getChildIndex(targetNode) + 1,\n            );\n            return true;\n          }\n          return false;\n        }\n\n        case \"before\": {\n          if (targetNode.parent) {\n            targetNode.parent.addChildAtPosition(\n              movedNode,\n              targetNode.parent.getChildIndex(targetNode),\n            );\n            return true;\n          }\n          return false;\n        }\n\n        case \"inside\": {\n          // move inside as first child\n          targetNode.addChildAtPosition(movedNode, 0);\n          return true;\n        }\n      }\n    }\n  }\n\n  /**\n   * Adds a child at the start.\n   *\n   * @returns The new node.\n   * @group Changing the tree\n   */\n  public prepend(nodeInfo: NodeData): Node {\n    const node = this.createNode(nodeInfo);\n    this.addChildAtPosition(node, 0);\n\n    node.loadChildrenFromData(nodeInfo);\n    return node;\n  }\n\n  /**\n   * Removes this node from its parent.\n   *\n   * @group Changing the tree\n   */\n  public remove(): void {\n    if (this.parent) {\n      this.parent.removeChild(this);\n      this.parent = null;\n    }\n  }\n\n  /**\n   * Removes a child and its children.\n   *\n   * @group Changing the tree\n   */\n  public removeChild(node: Node): void {\n    // remove children from the index\n    node.removeChildren();\n\n    this.doRemoveChild(node);\n  }\n\n  /**\n   * Removes all children.\n   *\n   * @group Changing the tree\n   */\n  public removeChildren(): void {\n    this.iterate((child: Node) => {\n      this.tree?.removeNodeFromIndex(child);\n      return true;\n    });\n\n    this.children = [];\n  }\n\n  /** @hidden */\n  public removeNodeFromIndex(node: Node): void {\n    if (node.id != null) {\n      this.idMapping?.delete(node.id);\n    }\n  }\n\n  /**\n   * Updates the node's properties from node data. `children` and `parent`\n   * are ignored. A string sets the name. Existing node values are not\n   * removed.\n   *\n   * @group Changing the tree\n   */\n  public setData(o: NodeData | null): void {\n    if (!o) {\n      return;\n    } else if (typeof o === \"string\") {\n      this.name = o;\n    } else if (typeof o === \"object\") {\n      for (const key in o) {\n        if (Object.prototype.hasOwnProperty.call(o, key)) {\n          const value = o[key];\n\n          if (key === \"label\" || key === \"name\") {\n            // You can use the 'label' key instead of 'name'; this is a legacy feature\n            if (typeof value === \"string\") {\n              this.name = value;\n            }\n          } else if (key !== \"children\" && key !== \"parent\") {\n            // You can't update the children or the parent using this function\n            this[key] = value;\n          }\n        }\n      }\n    }\n  }\n\n  private createNode(nodeData?: NodeData): Node {\n    const nodeClass = this.getNodeClass();\n    return new nodeClass(nodeData);\n  }\n\n  private doRemoveChild(node: Node): void {\n    this.children.splice(this.getChildIndex(node), 1);\n    this.tree?.removeNodeFromIndex(node);\n  }\n\n  private getNodeClass(): typeof Node {\n    return this.nodeClass ?? this.tree?.nodeClass ?? Node;\n  }\n\n  // Load children data from nodeInfo if it has children\n  private loadChildrenFromData(nodeInfo: NodeData) {\n    if (isNodeRecordWithChildren(nodeInfo) && nodeInfo.children.length) {\n      this.loadFromData(nodeInfo.children);\n    }\n  }\n\n  private setParent(parent: Node): void {\n    this.parent = parent;\n    this.tree = parent.tree;\n    this.tree?.addNodeToIndex(this);\n  }\n}\n"],"names":["createNode","loadChildrenFromData","setParent","doRemoveChild","getNodeClass"],"mappings":";;AAAA;AACA;AACA;;AAEA;AACA;;AAkBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,MAAM,IAAI,CAAC;AAChB;;AAGA;EACO,QAAQ;AACf;AACF;EACS,OAAO;AACd;EACO,EAAE;AACT;EACO,SAAS;AAChB;EACO,UAAU;AACjB;EACO,OAAO;AACd;EACO,aAAa;AACpB;EACO,cAAc;AACrB;EACO,IAAI;AACX;EACO,SAAS;AAChB;EACO,MAAM;AACb;EACO,IAAI;;AAEX;AACA,EAAA,WAAW,CACT,QAAyB,GAAG,IAAI,EAChC,MAAM,GAAG,KAAK,EACd,SAAS,GAAG,IAAI,EAChB;IACA,IAAI,CAAC,IAAI,GAAG,EAAE;IACd,IAAI,CAAC,cAAc,GAAG,KAAK;AAE3B,IAAA,IAAI,CAAC,aAAa,GAChB,QAAQ,IAAI,IAAI,IAChB,wBAAwB,CAAC,QAAQ,CAAC,IAClC,QAAQ,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;AAEhC,IAAA,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;IAEtB,IAAI,CAAC,QAAQ,GAAG,EAAE;IAClB,IAAI,CAAC,MAAM,GAAG,IAAI;IAClB,IAAI,CAAC,UAAU,GAAG,SAAS;IAC3B,IAAI,CAAC,OAAO,KAAK,SAAS;AAE1B,IAAA,IAAI,MAAM,EAAE;AACV,MAAA,IAAI,CAAC,SAAS,GAAG,IAAI,GAAG,EAAgB;MACxC,IAAI,CAAC,IAAI,GAAG,IAAI;MAChB,IAAI,CAAC,SAAS,GAAG,SAAS;AAC5B,IAAA,CAAC,MAAM;MACL,IAAI,CAAC,SAAS,GAAG,SAAS;AAC5B,IAAA;AACF,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACS,QAAQ,CAAC,QAAkB,EAAe;AAC/C,IAAA,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;AAChB,MAAA,OAAO,IAAI;AACb,IAAA,CAAC,MAAM;AACL,MAAA,IAAM,IAAI,GAAG,IAAI,CAACA,WAAU,CAAC,QAAQ,CAAC;MAEtC,IAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC;MAClD,IAAI,CAAC,MAAM,CAAC,kBAAkB,CAAC,IAAI,EAAE,UAAU,GAAG,CAAC,CAAC;AAEpD,MAAA,IAAI,CAACC,qBAAoB,CAAC,QAAQ,CAAC;AACnC,MAAA,OAAO,IAAI;AACb,IAAA;AACF,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACS,SAAS,CAAC,QAAkB,EAAe;AAChD,IAAA,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;AAChB,MAAA,OAAO,IAAI;AACb,IAAA,CAAC,MAAM;AACL,MAAA,IAAM,IAAI,GAAG,IAAI,CAACD,WAAU,CAAC,QAAQ,CAAC;MAEtC,IAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC;MAClD,IAAI,CAAC,MAAM,CAAC,kBAAkB,CAAC,IAAI,EAAE,UAAU,CAAC;AAEhD,MAAA,IAAI,CAACC,qBAAoB,CAAC,QAAQ,CAAC;AACnC,MAAA,OAAO,IAAI;AACb,IAAA;AACF,EAAA;;AAEA;AACF;AACA;AACA;AACA;EACS,QAAQ,CAAC,IAAU,EAAQ;AAChC,IAAA,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;AACxB,IAAA,IAAI,CAACC,UAAS,CAAC,IAAI,CAAC;AACtB,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACS,EAAA,kBAAkB,CAAC,IAAU,EAAE,KAAa,EAAQ;IACzD,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC;AACpC,IAAA,IAAI,CAACA,UAAS,CAAC,IAAI,CAAC;AACtB,EAAA;;AAEA;EACO,cAAc,CAAC,IAAU,EAAQ;AACtC,IAAA,IAAI,IAAI,CAAC,EAAE,IAAI,IAAI,EAAE;MACnB,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC;AACpC,IAAA;AACF,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACS,SAAS,CAAC,QAAkB,EAAe;AAChD,IAAA,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;AAChB,MAAA,OAAO,IAAI;AACb,IAAA,CAAC,MAAM;AACL,MAAA,IAAM,SAAS,GAAG,IAAI,CAACF,WAAU,CAAC,QAAQ,CAAC;MAE3C,IAAI,IAAI,CAAC,IAAI,EAAE;AACb,QAAA,SAAS,CAACE,UAAS,CAAC,IAAI,CAAC,IAAI,CAAC;AAChC,MAAA;AACA,MAAA,IAAM,cAAc,GAAG,IAAI,CAAC,MAAM;AAElC,MAAA,KAAK,IAAM,KAAK,IAAI,cAAc,CAAC,QAAQ,EAAE;AAC3C,QAAA,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC;AAC3B,MAAA;MAEA,cAAc,CAAC,QAAQ,GAAG,EAAE;AAC5B,MAAA,cAAc,CAAC,QAAQ,CAAC,SAAS,CAAC;AAClC,MAAA,OAAO,SAAS;AAClB,IAAA;AACF,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACS,MAAM,CAAC,QAAkB,EAAQ;AACtC,IAAA,IAAM,IAAI,GAAG,IAAI,CAACF,WAAU,CAAC,QAAQ,CAAC;AACtC,IAAA,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;AAEnB,IAAA,IAAI,CAACC,qBAAoB,CAAC,QAAQ,CAAC;AACnC,IAAA,OAAO,IAAI;AACb,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACS,MAAM,CAAC,CAA0B,EAAU;IAChD,IAAM,MAAc,GAAG,EAAE;AAEzB,IAAA,IAAI,CAAC,OAAO,CAAE,IAAU,IAAK;AAC3B,MAAA,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE;AACX,QAAA,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;AACnB,MAAA;AAEA,MAAA,OAAO,IAAI;AACb,IAAA,CAAC,CAAC;AAEF,IAAA,OAAO,MAAM;AACf,EAAA;;AAEA;AACF;AACA;AACA;AACA;EACS,aAAa,CAAC,IAAU,EAAU;AACvC,IAAA,OAAO,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC;AACpC,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACS,EAAA,OAAO,CAAC,aAAa,GAAG,KAAK,EAAgB;IAClD,IAAM,gBAAgB,GAAI,KAAa,IAAgC;AACrE,MAAA,OAAO,KAAK,CAAC,GAAG,CAAE,IAAI,IAAK;QACzB,IAAM,OAAgC,GAAG,EAAE;AAE3C,QAAA,KAAK,IAAM,CAAC,IAAI,IAAI,EAAE;AACpB,UAAA,IACE,CACE,QAAQ,EACR,UAAU,EACV,SAAS,EACT,WAAW,EACX,gBAAgB,EAChB,WAAW,EACX,MAAM,EACN,eAAe,CAChB,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,IACnB,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,EAC7C;AACA,YAAA,IAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;AACjB,YAAA,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC;AAChB,UAAA;AACF,QAAA;AAEA,QAAA,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE;UACtB,OAAO,CAAC,QAAQ,GAAG,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC;AACpD,QAAA;AAEA,QAAA,OAAO,OAAO;AAChB,MAAA,CAAC,CAAC;IACJ,CAAC;AAED,IAAA,IAAI,aAAa,EAAE;AACjB,MAAA,OAAO,gBAAgB,CAAC,CAAC,IAAI,CAAC,CAAC;AACjC,IAAA,CAAC,MAAM;AACL,MAAA,OAAO,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC;AACxC,IAAA;AACF,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACS,EAAA,YAAY,GAAgB;AACjC,IAAA,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE;AACvB,MAAA,OAAO,IAAI;AACb,IAAA,CAAC,MAAM;AACL,MAAA,IAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAS;MAEjE,IAAI,EAAE,SAAS,CAAC,WAAW,EAAE,IAAI,SAAS,CAAC,OAAO,CAAC,EAAE;AACnD,QAAA,OAAO,SAAS;AAClB,MAAA,CAAC,MAAM;AACL,QAAA,OAAO,SAAS,CAAC,YAAY,EAAE;AACjC,MAAA;AACF,IAAA;AACF,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACS,EAAA,QAAQ,GAAW;IACxB,IAAI,KAAK,GAAG,CAAC;AACb,IAAA,IAAI,IAAU,GAAG,IAAI,CAAC;;IAEtB,OAAO,IAAI,CAAC,MAAM,EAAE;AAClB,MAAA,KAAK,IAAI,CAAC;MACV,IAAI,GAAG,IAAI,CAAC,MAAM;AACpB,IAAA;AAEA,IAAA,OAAO,KAAK;AACd,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACS,EAAA,WAAW,CAAC,eAAe,GAAG,IAAI,EAAe;AACtD,IAAA,IAAI,eAAe,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE;AACzC,MAAA,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,IAAI;AACjC,IAAA,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;AACvB,MAAA,OAAO,IAAI;AACb,IAAA,CAAC,MAAM;AACL,MAAA,IAAM,WAAW,GAAG,IAAI,CAAC,cAAc,EAAE;AAEzC,MAAA,IAAI,WAAW,EAAE;AACf,QAAA,OAAO,WAAW;AACpB,MAAA,CAAC,MAAM;AACL,QAAA,OAAO,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC;AACvC,MAAA;AACF,IAAA;AACF,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACS,EAAA,cAAc,GAAgB;AACnC,IAAA,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;AAChB,MAAA,OAAO,IAAI;AACb,IAAA,CAAC,MAAM;MACL,IAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC;MACrD,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE;QAC3C,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,IAAI;AAChD,MAAA,CAAC,MAAM;AACL,QAAA,OAAO,IAAI;AACb,MAAA;AACF,IAAA;AACF,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACS,EAAA,kBAAkB,GAAgB;IACvC,IAAI,IAAI,CAAC,WAAW,EAAE,IAAI,IAAI,CAAC,OAAO,EAAE;AACtC;AACA,MAAA,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,IAAI;AACjC,IAAA,CAAC,MAAM;AACL,MAAA,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;AAChB,QAAA,OAAO,IAAI;AACb,MAAA,CAAC,MAAM;AACL,QAAA,IAAM,WAAW,GAAG,IAAI,CAAC,cAAc,EAAE;AACzC,QAAA,IAAI,WAAW,EAAE;AACf;AACA,UAAA,OAAO,WAAW;AACpB,QAAA,CAAC,MAAM;AACL;AACA,UAAA,OAAO,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC;AACvC,QAAA;AACF,MAAA;AACF,IAAA;AACF,EAAA;;AAEA;AACF;AACA;AACA;AACA;EACS,iBAAiB,CAAC,QAAiC,EAAe;IACvE,IAAI,MAAmB,GAAG,IAAI;AAE9B,IAAA,IAAI,CAAC,OAAO,CAAE,IAAU,IAAK;AAC3B,MAAA,IAAI,MAAM,EAAE;AACV,QAAA,OAAO,KAAK;AACd,MAAA,CAAC,MAAM,IAAI,QAAQ,CAAC,IAAI,CAAC,EAAE;AACzB,QAAA,MAAM,GAAG,IAAI;AACb,QAAA,OAAO,KAAK;AACd,MAAA,CAAC,MAAM;AACL,QAAA,OAAO,IAAI;AACb,MAAA;AACF,IAAA,CAAC,CAAC;AAEF,IAAA,OAAO,MAAM;AACf,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACS,WAAW,CAAC,MAAc,EAAe;IAC9C,OAAO,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI;AAC5C,EAAA;;AAEA;AACF;AACA;AACA;AACA;EACS,aAAa,CAAC,IAAY,EAAe;IAC9C,OAAO,IAAI,CAAC,iBAAiB,CAAE,IAAU,IAAK,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC;AACnE,EAAA;;AAEA;AACF;AACA;AACA;AACA;EACS,sBAAsB,CAAC,IAAY,EAAQ;AAChD,IAAA,IAAM,IAAI,GAAG,IAAI,CAAC,iBAAiB,CAAE,CAAO,IAAK,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC;IAEjE,IAAI,CAAC,IAAI,EAAE;AACT,MAAA,MAAM,IAAI,KAAK,CAAC,CAAA,eAAA,EAAkB,IAAI,YAAY,CAAC;AACrD,IAAA;AAEA,IAAA,OAAO,IAAI;AACb,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACS,EAAA,kBAAkB,CAAC,GAAW,EAAE,KAAc,EAAU;AAC7D,IAAA,OAAO,IAAI,CAAC,MAAM,CAAE,IAAU,IAAK,IAAI,CAAC,GAAG,CAAC,KAAK,KAAK,CAAC;AACzD,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACS,EAAA,SAAS,GAAgB;AAC9B;AACA,IAAA,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;AAChB,MAAA,OAAO,IAAI;IACb,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE;AAC9B;AACA,MAAA,OAAO,IAAI;AACb,IAAA,CAAC,MAAM;MACL,OAAO,IAAI,CAAC,MAAM;AACpB,IAAA;AACF,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACS,EAAA,eAAe,GAAgB;AACpC,IAAA,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;AAChB,MAAA,OAAO,IAAI;AACb,IAAA,CAAC,MAAM;AACL,MAAA,IAAM,eAAe,GAAG,IAAI,CAAC,kBAAkB,EAAE;MAEjD,IAAI,CAAC,eAAe,EAAE;AACpB,QAAA,OAAO,IAAI,CAAC,SAAS,EAAE;AACzB,MAAA,CAAC,MAAM,IAAI,eAAe,CAAC,WAAW,EAAE,EAAE;AACxC,QAAA,OAAO,eAAe,CAAC,YAAY,EAAE;AACvC,MAAA,CAAC,MAAM;AACL,QAAA,OAAO,eAAe;AACxB,MAAA;AACF,IAAA;AACF,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACS,EAAA,kBAAkB,GAAgB;AACvC,IAAA,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;AAChB,MAAA,OAAO,IAAI;AACb,IAAA,CAAC,MAAM;MACL,IAAM,aAAa,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC;MACzD,IAAI,aAAa,IAAI,CAAC,EAAE;QACtB,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,aAAa,CAAC,IAAI,IAAI;AACpD,MAAA,CAAC,MAAM;AACL,QAAA,OAAO,IAAI;AACb,MAAA;AACF,IAAA;AACF,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACS,EAAA,sBAAsB,GAAgB;AAC3C,IAAA,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;AAChB,MAAA,OAAO,IAAI;AACb,IAAA,CAAC,MAAM;AACL,MAAA,IAAM,eAAe,GAAG,IAAI,CAAC,kBAAkB,EAAE;MAEjD,IAAI,CAAC,eAAe,EAAE;AACpB,QAAA,OAAO,IAAI,CAAC,SAAS,EAAE;AACzB,MAAA,CAAC,MAAM,IAAI,CAAC,eAAe,CAAC,WAAW,EAAE,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE;AACrE;AACA,QAAA,OAAO,eAAe;AACxB,MAAA,CAAC,MAAM;AACL;AACA,QAAA,OAAO,eAAe,CAAC,YAAY,EAAE;AACvC,MAAA;AACF,IAAA;AACF,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACS,EAAA,WAAW,GAAY;AAC5B,IAAA,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;AACnC,EAAA;;AAEA;AACF;AACA;AACA;AACA;EACS,YAAY,CAAC,IAAc,EAAQ;IACxC,IAAM,OAAO,GAAI,QAAkB,IAAW;AAC5C,MAAA,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;MAEtB,IAAI,wBAAwB,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,QAAQ,CAAC,MAAM,EAAE;AAClE,QAAA,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC;AAChC,MAAA;IACF,CAAC;IAED,IAAM,WAAW,GAAI,YAAwB,IAAW;AACtD,MAAA,KAAK,IAAM,KAAK,IAAI,YAAY,EAAE;AAChC,QAAA,IAAM,IAAI,GAAG,IAAI,CAACD,WAAU,EAAE;AAC9B,QAAA,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;AACxB,QAAA,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;AACrB,MAAA;IACF,CAAC;IAED,OAAO,CAAC,IAAI,CAAC;AACf,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACS,EAAA,QAAQ,GAAY;IACzB,OAAO,IAAI,CAAC,WAAW,EAAE,IAAI,IAAI,CAAC,cAAc;AAClD,EAAA;;AAEA;AACF;AACA;AACA;AACA;EACS,UAAU,CAAC,IAAU,EAAW;AACrC,IAAA,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM;AAExB,IAAA,OAAO,MAAM,EAAE;MACb,IAAI,MAAM,KAAK,IAAI,EAAE;AACnB,QAAA,OAAO,IAAI;AACb,MAAA;MAEA,MAAM,GAAG,MAAM,CAAC,MAAM;AACxB,IAAA;AAEA,IAAA,OAAO,KAAK;AACd,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACS,OAAO,CAAC,QAAyB,EAAQ;AAC9C,IAAA,IAAM,QAAQ,GAAG,CAAC,IAAU,EAAE,KAAa,KAAW;AACpD,MAAA,KAAK,IAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;AACjC,QAAA,IAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC;AAErC,QAAA,IAAI,MAAM,IAAI,KAAK,CAAC,WAAW,EAAE,EAAE;AACjC,UAAA,QAAQ,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC;AAC5B,QAAA;AACF,MAAA;IACF,CAAC;AAED,IAAA,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;AACnB,EAAA;;AAEA;AACF;AACA;AACA;AACA;EACS,YAAY,CAAC,IAAgB,EAAQ;IAC1C,IAAI,CAAC,cAAc,EAAE;AAErB,IAAA,KAAK,IAAM,SAAS,IAAI,IAAI,EAAE;AAC5B,MAAA,IAAM,IAAI,GAAG,IAAI,CAACA,WAAU,CAAC,SAAS,CAAC;AACvC,MAAA,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;AAEnB,MAAA,IAAI,wBAAwB,CAAC,SAAS,CAAC,EAAE;AACvC,QAAA,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,QAAQ,CAAC;AACvC,MAAA;AACF,IAAA;AAEA,IAAA,OAAO,IAAI;AACb,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACS,EAAA,QAAQ,CACb,SAAe,EACf,UAAgB,EAChB,QAAkB,EACT;IACT,IAAI,CAAC,SAAS,CAAC,MAAM,IAAI,SAAS,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE;AACzD;AACA;AACA,MAAA,OAAO,KAAK;AACd,IAAA,CAAC,MAAM;AACL,MAAA,SAAS,CAAC,MAAM,CAACG,cAAa,CAAC,SAAS,CAAC;AAEzC,MAAA,QAAQ,QAAQ;AACd,QAAA,KAAK,OAAO;AAAE,UAAA;YACZ,IAAI,UAAU,CAAC,MAAM,EAAE;AACrB,cAAA,UAAU,CAAC,MAAM,CAAC,kBAAkB,CAClC,SAAS,EACT,UAAU,CAAC,MAAM,CAAC,aAAa,CAAC,UAAU,CAAC,GAAG,CAChD,CAAC;AACD,cAAA,OAAO,IAAI;AACb,YAAA;AACA,YAAA,OAAO,KAAK;AACd,UAAA;AAEA,QAAA,KAAK,QAAQ;AAAE,UAAA;YACb,IAAI,UAAU,CAAC,MAAM,EAAE;AACrB,cAAA,UAAU,CAAC,MAAM,CAAC,kBAAkB,CAClC,SAAS,EACT,UAAU,CAAC,MAAM,CAAC,aAAa,CAAC,UAAU,CAC5C,CAAC;AACD,cAAA,OAAO,IAAI;AACb,YAAA;AACA,YAAA,OAAO,KAAK;AACd,UAAA;AAEA,QAAA,KAAK,QAAQ;AAAE,UAAA;AACb;AACA,YAAA,UAAU,CAAC,kBAAkB,CAAC,SAAS,EAAE,CAAC,CAAC;AAC3C,YAAA,OAAO,IAAI;AACb,UAAA;AACF;AACF,IAAA;AACF,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACS,OAAO,CAAC,QAAkB,EAAQ;AACvC,IAAA,IAAM,IAAI,GAAG,IAAI,CAACH,WAAU,CAAC,QAAQ,CAAC;AACtC,IAAA,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,CAAC,CAAC;AAEhC,IAAA,IAAI,CAACC,qBAAoB,CAAC,QAAQ,CAAC;AACnC,IAAA,OAAO,IAAI;AACb,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACS,EAAA,MAAM,GAAS;IACpB,IAAI,IAAI,CAAC,MAAM,EAAE;AACf,MAAA,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC;MAC7B,IAAI,CAAC,MAAM,GAAG,IAAI;AACpB,IAAA;AACF,EAAA;;AAEA;AACF;AACA;AACA;AACA;EACS,WAAW,CAAC,IAAU,EAAQ;AACnC;IACA,IAAI,CAAC,cAAc,EAAE;AAErB,IAAA,IAAI,CAACE,cAAa,CAAC,IAAI,CAAC;AAC1B,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACS,EAAA,cAAc,GAAS;AAC5B,IAAA,IAAI,CAAC,OAAO,CAAE,KAAW,IAAK;AAC5B,MAAA,IAAI,CAAC,IAAI,EAAE,mBAAmB,CAAC,KAAK,CAAC;AACrC,MAAA,OAAO,IAAI;AACb,IAAA,CAAC,CAAC;IAEF,IAAI,CAAC,QAAQ,GAAG,EAAE;AACpB,EAAA;;AAEA;EACO,mBAAmB,CAAC,IAAU,EAAQ;AAC3C,IAAA,IAAI,IAAI,CAAC,EAAE,IAAI,IAAI,EAAE;MACnB,IAAI,CAAC,SAAS,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;AACjC,IAAA;AACF,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;EACS,OAAO,CAAC,CAAkB,EAAQ;IACvC,IAAI,CAAC,CAAC,EAAE;AACN,MAAA;AACF,IAAA,CAAC,MAAM,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE;MAChC,IAAI,CAAC,IAAI,GAAG,CAAC;AACf,IAAA,CAAC,MAAM,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE;AAChC,MAAA,KAAK,IAAM,GAAG,IAAI,CAAC,EAAE;AACnB,QAAA,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE;AAChD,UAAA,IAAM,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC;AAEpB,UAAA,IAAI,GAAG,KAAK,OAAO,IAAI,GAAG,KAAK,MAAM,EAAE;AACrC;AACA,YAAA,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;cAC7B,IAAI,CAAC,IAAI,GAAG,KAAK;AACnB,YAAA;UACF,CAAC,MAAM,IAAI,GAAG,KAAK,UAAU,IAAI,GAAG,KAAK,QAAQ,EAAE;AACjD;AACA,YAAA,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK;AACnB,UAAA;AACF,QAAA;AACF,MAAA;AACF,IAAA;AACF,EAAA;EAEQH,WAAUA,CAAC,QAAmB,EAAQ;AAC5C,IAAA,IAAM,SAAS,GAAG,IAAI,CAACI,aAAY,EAAE;AACrC,IAAA,OAAO,IAAI,SAAS,CAAC,QAAQ,CAAC;AAChC,EAAA;EAEQD,cAAaA,CAAC,IAAU,EAAQ;AACtC,IAAA,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AACjD,IAAA,IAAI,CAAC,IAAI,EAAE,mBAAmB,CAAC,IAAI,CAAC;AACtC,EAAA;AAEQC,EAAAA,aAAYA,GAAgB;IAClC,OAAO,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,IAAI,EAAE,SAAS,IAAI,IAAI;AACvD,EAAA;;AAEA;EACQH,qBAAoBA,CAAC,QAAkB,EAAE;IAC/C,IAAI,wBAAwB,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,QAAQ,CAAC,MAAM,EAAE;AAClE,MAAA,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,QAAQ,CAAC;AACtC,IAAA;AACF,EAAA;EAEQC,UAASA,CAAC,MAAY,EAAQ;IACpC,IAAI,CAAC,MAAM,GAAG,MAAM;AACpB,IAAA,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI;AACvB,IAAA,IAAI,CAAC,IAAI,EAAE,cAAc,CAAC,IAAI,CAAC;AACjC,EAAA;AACF;;"}
+{"version":3,"file":"node.js","sources":["../src/node.ts"],"sourcesContent":["/*\nA node reads and writes the private members of other nodes (node.setParent),\nso the `_` prefix that the build adds cannot be limited to `this.`:\n\nprefix-private-members: all\n*/\n\nimport { isNodeRecordWithChildren } from \"./nodeUtils\";\n\nexport type NodeData = NodeRecord | string;\n\nexport type NodeId = number | string;\n\nexport interface NodeRecord {\n  [key: string]: unknown;\n  children?: NodeData[];\n  id?: NodeId;\n}\n\nexport type Position = \"after\" | \"before\" | \"inside\";\n\ntype IterateCallback = (node: Node, level: number) => boolean;\n\n/**\n * @groupDescription Properties\n * Any other key in the node data is copied onto the node, so\n * `{ name: \"node1\", color: \"green\" }` gives you `node.color`.\n *\n * @groupDescription Searching\n * These work on any node, and search that node's subtree. Called on the root\n * node, they search the whole tree — which is what the tree's own methods of\n * the same name do.\n *\n * @groupDescription Changing the tree\n * ::: warning\n * These methods change the data without re-rendering. The tree's\n * [methods](/reference/methods) — `appendNode`, `removeNode`, `moveNode` and\n * friends — do the same and refresh the display, so prefer those. If you do\n * use these, call `tree.refresh()` afterwards.\n * :::\n */\nexport class Node {\n  /**\n  @hidden\n  */\n  [key: string]: unknown;\n\n  /**\n  The child nodes.\n  */\n  public children: Node[];\n  /** The `li` element, once the node is rendered. Nodes inside a closed\n   * folder are rendered when the folder is opened. */\n  public element?: HTMLElement;\n  /**\n  The id from the node data.\n  */\n  public id?: NodeId;\n  /**\n  @hidden\n  */\n  public idMapping?: Map<NodeId, Node>;\n  /**\n  Whether the node's children are being fetched.\n  */\n  public is_loading?: boolean;\n  /**\n  Whether the folder is open.\n  */\n  public is_open?: boolean;\n  /**\n  Whether the node data had an empty `children` array.\n  */\n  public isEmptyFolder: boolean;\n  /**\n  Whether the children still have to be fetched.\n  */\n  public load_on_demand = false;\n  /**\n  The label. Also settable from the `label` key in node data.\n  */\n  public name = \"\";\n  /**\n  @hidden\n  */\n  public nodeClass?: typeof Node;\n  /**\n  The parent; `null` for the root node.\n  */\n  public parent: Node | null;\n  /**\n  The root node.\n  */\n  public tree?: Node;\n\n  /**\n  @hidden\n  */\n  constructor(\n    nodeData: NodeData | null = null,\n    isRoot = false,\n    nodeClass = Node,\n  ) {\n    this.isEmptyFolder =\n      nodeData != null &&\n      isNodeRecordWithChildren(nodeData) &&\n      nodeData.children.length === 0;\n\n    this.setData(nodeData);\n\n    this.children = [];\n    this.parent = null;\n    this.is_loading = undefined;\n    this.is_open ??= undefined;\n\n    if (isRoot) {\n      this.idMapping = new Map<NodeId, Node>();\n      this.tree = this;\n      this.nodeClass = nodeClass;\n    } else {\n      this.idMapping = undefined;\n    }\n  }\n\n  /**\n   * Adds a sibling after this node.\n   *\n   * @returns The new node, or `null` when the node has no parent.\n   * @group Changing the tree\n   */\n  public addAfter(nodeInfo: NodeData): Node | null {\n    if (this.parent) {\n      const node = this.createNode(nodeInfo);\n\n      const childIndex = this.parent.getChildIndex(this);\n      this.parent.addChildAtPosition(node, childIndex + 1);\n\n      node.loadChildrenFromData(nodeInfo);\n      return node;\n    }\n    return null;\n  }\n\n  /**\n   * Adds a sibling before this node.\n   *\n   * @returns The new node, or `null` when the node has no parent.\n   * @group Changing the tree\n   */\n  public addBefore(nodeInfo: NodeData): Node | null {\n    if (this.parent) {\n      const node = this.createNode(nodeInfo);\n\n      const childIndex = this.parent.getChildIndex(this);\n      this.parent.addChildAtPosition(node, childIndex);\n\n      node.loadChildrenFromData(nodeInfo);\n      return node;\n    }\n    return null;\n  }\n\n  /**\n   * Adds an existing `Node` object as the last child.\n   *\n   * @group Changing the tree\n   */\n  public addChild(node: Node): void {\n    this.children.push(node);\n    node.setParent(this);\n  }\n\n  /**\n   * Adds an existing `Node` object as a child, at this position in\n   * `children`. The index starts at `0`.\n   *\n   * @group Changing the tree\n   */\n  public addChildAtPosition(node: Node, index: number): void {\n    this.children.splice(index, 0, node);\n    node.setParent(this);\n  }\n\n  /**\n  @hidden\n  */\n  public addNodeToIndex(node: Node): void {\n    if (node.id != null) {\n      this.idMapping?.set(node.id, node);\n    }\n  }\n\n  /**\n   * Inserts a new parent between this node and its current parent.\n   *\n   * @returns The new node, or `null` when the node has no parent.\n   * @group Changing the tree\n   */\n  public addParent(nodeInfo: NodeData): Node | null {\n    if (this.parent) {\n      const newParent = this.createNode(nodeInfo);\n\n      if (this.tree) {\n        newParent.setParent(this.tree);\n      }\n      const originalParent = this.parent;\n\n      for (const child of originalParent.children) {\n        newParent.addChild(child);\n      }\n\n      originalParent.children = [];\n      originalParent.addChild(newParent);\n      return newParent;\n    }\n    return null;\n  }\n\n  /**\n   * Adds a child at the end.\n   *\n   * @returns The new node.\n   * @group Changing the tree\n   */\n  public append(nodeInfo: NodeData): Node {\n    const node = this.createNode(nodeInfo);\n    this.addChild(node);\n\n    node.loadChildrenFromData(nodeInfo);\n    return node;\n  }\n\n  /**\n   * Returns all nodes in the subtree for which the callback returns\n   * `true`.\n   *\n   * @example\n   * ```js\n   * const folders = tree.getTree().filter((node) => node.isFolder());\n   * ```\n   *\n   * @group Searching\n   */\n  public filter(f: (node: Node) => boolean): Node[] {\n    const result: Node[] = [];\n\n    this.iterate((node: Node) => {\n      if (f(node)) {\n        result.push(node);\n      }\n\n      return true;\n    });\n\n    return result;\n  }\n\n  /**\n   * Returns the position of a child in `children`, or `-1`.\n   *\n   * @group Inspecting a node\n   */\n  public getChildIndex(node: Node): number {\n    return this.children.indexOf(node);\n  }\n\n  /**\n   * Returns the subtree as plain data, ready for `JSON.stringify`.\n   * Internal properties (`parent`, `children`, `element`, `tree`,\n   * `idMapping`, `nodeClass`, `load_on_demand`, `isEmptyFolder`) are left\n   * out; your own properties are kept.\n   *\n   * ```js\n   * tree.getTree().getData();\n   * // [{ name: \"node1\", id: 1, children: [{ name: \"child1\", id: 2 }] }]\n   * ```\n   *\n   * @param includeParent - Make the result the node itself rather than its\n   * children. Default `false`.\n   * @group Reading data back\n   */\n  public getData(includeParent = false): NodeRecord[] {\n    const getDataFromNodes = (nodes: Node[]): Record<string, unknown>[] => {\n      return nodes.map((node) => {\n        const tmpNode: Record<string, unknown> = {};\n\n        for (const k in node) {\n          if (\n            [\n              \"children\",\n              \"element\",\n              \"idMapping\",\n              \"isEmptyFolder\",\n              \"load_on_demand\",\n              \"nodeClass\",\n              \"parent\",\n              \"tree\",\n            ].includes(k) ||\n            !Object.prototype.hasOwnProperty.call(node, k)\n          ) {\n            continue;\n          }\n\n          const v = node[k];\n          tmpNode[k] = v;\n        }\n\n        if (node.hasChildren()) {\n          tmpNode.children = getDataFromNodes(node.children);\n        }\n\n        return tmpNode;\n      });\n    };\n\n    return getDataFromNodes(includeParent ? [this] : this.children);\n  }\n\n  /**\n   * Returns the last child, or `null`. When that child is an open folder,\n   * its own last child, and so on.\n   *\n   * @group Moving around the tree\n   */\n  public getLastChild(): Node | null {\n    if (this.hasChildren()) {\n      const lastChild = this.children[this.children.length - 1] as Node;\n\n      return lastChild.hasChildren() && lastChild.is_open\n        ? lastChild.getLastChild()\n        : lastChild;\n    }\n    return null;\n  }\n\n  /**\n   * Returns the depth of the node, counting the top level as `1`.\n   *\n   * @group Inspecting a node\n   */\n  public getLevel(): number {\n    let level = 0;\n    let node: Node = this; // eslint-disable-line @typescript-eslint/no-this-alias, unicorn/no-this-assignment\n\n    while (node.parent) {\n      level += 1;\n      node = node.parent;\n    }\n\n    return level;\n  }\n\n  /**\n   * Returns the next node in the tree, regardless of whether it is\n   * visible. `getNextNode(false)` skips the node's own children.\n   *\n   * @group Moving around the tree\n   */\n  public getNextNode(includeChildren = true): Node | null {\n    if (includeChildren && this.hasChildren()) {\n      return this.children[0] ?? null;\n    }\n    if (this.parent) {\n      const nextSibling = this.getNextSibling();\n\n      return nextSibling ?? this.parent.getNextNode(false);\n    }\n    return null;\n  }\n\n  /**\n   * Returns the next sibling, or `null`.\n   *\n   * @group Moving around the tree\n   */\n  public getNextSibling(): Node | null {\n    if (this.parent) {\n      const nextIndex = this.parent.getChildIndex(this) + 1;\n      return nextIndex < this.parent.children.length\n        ? (this.parent.children[nextIndex] ?? null)\n        : null;\n    }\n    return null;\n  }\n\n  /**\n   * Like `getNextNode`, but skipping nodes inside closed folders — this is\n   * what the arrow keys use.\n   *\n   * @group Moving around the tree\n   */\n  public getNextVisibleNode(): Node | null {\n    if (this.hasChildren() && this.is_open) {\n      // First child\n      return this.children[0] ?? null;\n    }\n    if (this.parent) {\n      const nextSibling = this.getNextSibling();\n      if (nextSibling) {\n        // Next sibling\n        return nextSibling;\n      }\n      // Next node of parent\n      return this.parent.getNextNode(false);\n    }\n    return null;\n  }\n\n  /**\n   * Returns the first node for which the callback returns `true`.\n   *\n   * @group Searching\n   */\n  public getNodeByCallback(callback: (node: Node) => boolean): Node | null {\n    let result: Node | null = null;\n\n    this.iterate((node: Node) => {\n      if (result) {\n        return false;\n      }\n      if (callback(node)) {\n        result = node;\n        return false;\n      }\n      return true;\n    });\n\n    return result;\n  }\n\n  /**\n   * Returns the node with this id. Only available on the root node, which\n   * keeps the id index.\n   *\n   * @group Searching\n   */\n  public getNodeById(nodeId: NodeId): Node | null {\n    return this.idMapping?.get(nodeId) ?? null;\n  }\n\n  /**\n   * Returns the first node with this name.\n   *\n   * @group Searching\n   */\n  public getNodeByName(name: string): Node | null {\n    return this.getNodeByCallback((node: Node) => node.name === name);\n  }\n\n  /**\n   * Like `getNodeByName`, but throws when there is no such node.\n   *\n   * @group Searching\n   */\n  public getNodeByNameMustExist(name: string): Node {\n    const node = this.getNodeByCallback((n: Node) => n.name === name);\n\n    if (!node) {\n      throw new Error(`Node with name ${name} not found`);\n    }\n\n    return node;\n  }\n\n  /**\n   * Returns all nodes with this property value.\n   *\n   * @group Searching\n   */\n  public getNodesByProperty(key: string, value: unknown): Node[] {\n    return this.filter((node: Node) => node[key] === value);\n  }\n\n  /**\n   * Returns the parent: `null` for a top-level node — the root node is not\n   * returned.\n   *\n   * @group Moving around the tree\n   */\n  public getParent(): Node | null {\n    // Return parent except if it is the root node\n    if (!this.parent) {\n      return null;\n    }\n    if (this.parent.parent) {\n      return this.parent;\n    }\n    // Root node -> null\n    return null;\n  }\n\n  /**\n   * Returns the previous node in the tree, regardless of whether it is\n   * visible.\n   *\n   * @group Moving around the tree\n   */\n  public getPreviousNode(): Node | null {\n    if (this.parent) {\n      const previousSibling = this.getPreviousSibling();\n\n      if (!previousSibling) {\n        return this.getParent();\n      }\n      return previousSibling.hasChildren()\n        ? previousSibling.getLastChild()\n        : previousSibling;\n    }\n    return null;\n  }\n\n  /**\n   * Returns the previous sibling, or `null`.\n   *\n   * @group Moving around the tree\n   */\n  public getPreviousSibling(): Node | null {\n    if (this.parent) {\n      const previousIndex = this.parent.getChildIndex(this) - 1;\n      return previousIndex >= 0\n        ? (this.parent.children[previousIndex] ?? null)\n        : null;\n    }\n    return null;\n  }\n\n  /**\n   * Like `getPreviousNode`, but skipping nodes inside closed folders —\n   * this is what the arrow keys use.\n   *\n   * @group Moving around the tree\n   */\n  public getPreviousVisibleNode(): Node | null {\n    if (this.parent) {\n      const previousSibling = this.getPreviousSibling();\n\n      if (!previousSibling) {\n        return this.getParent();\n      }\n      if (!previousSibling.hasChildren() || !previousSibling.is_open) {\n        // Previous sibling\n        return previousSibling;\n      }\n      // Last child of previous sibling\n      return previousSibling.getLastChild();\n    }\n    return null;\n  }\n\n  /**\n   * Whether the node has children.\n   *\n   * @group Inspecting a node\n   */\n  public hasChildren(): boolean {\n    return this.children.length !== 0;\n  }\n\n  /**\n   * Init Node from data without making it the root of the tree.\n   *\n   * @hidden\n   */\n  public initFromData(data: NodeData): void {\n    const addNode = (nodeData: NodeData): void => {\n      this.setData(nodeData);\n\n      if (isNodeRecordWithChildren(nodeData) && nodeData.children.length) {\n        addChildren(nodeData.children);\n      }\n    };\n\n    const addChildren = (childrenData: NodeData[]): void => {\n      for (const child of childrenData) {\n        const node = this.createNode();\n        node.initFromData(child);\n        this.addChild(node);\n      }\n    };\n\n    addNode(data);\n  }\n\n  /**\n   * `true` when the node has children, or is marked `load_on_demand`.\n   *\n   * @group Inspecting a node\n   */\n  public isFolder(): boolean {\n    return this.hasChildren() || this.load_on_demand;\n  }\n\n  /**\n   * Whether this node is an ancestor of the other node.\n   *\n   * @group Inspecting a node\n   */\n  public isParentOf(node: Node): boolean {\n    let parent = node.parent;\n\n    while (parent) {\n      if (parent === this) {\n        return true;\n      }\n\n      parent = parent.parent;\n    }\n\n    return false;\n  }\n\n  /**\n   * Walks the subtree, calling the callback with `(node, level)`. Return\n   * `false` from the callback to stop descending into that node:\n   *\n   * ```js\n   * tree.getTree().iterate((node, level) => {\n   *   console.log(\" \".repeat(level) + node.name);\n   *   return level <= 2; // don't go deeper than level 2\n   * });\n   * ```\n   *\n   * @group Searching\n   */\n  public iterate(callback: IterateCallback): void {\n    const _iterate = (node: Node, level: number): void => {\n      for (const child of node.children) {\n        const result = callback(child, level);\n\n        if (result && child.hasChildren()) {\n          _iterate(child, level + 1);\n        }\n      }\n    };\n\n    _iterate(this, 0);\n  }\n\n  /**\n   * Replaces the children with new node data.\n   *\n   * @group Changing the tree\n   */\n  public loadFromData(data: NodeData[]): this {\n    this.removeChildren();\n\n    for (const childData of data) {\n      const node = this.createNode(childData);\n      this.addChild(node);\n\n      if (isNodeRecordWithChildren(childData)) {\n        node.loadFromData(childData.children);\n      }\n    }\n\n    return this;\n  }\n\n  /**\n   * Moves a node relative to another node. Called on the root node.\n   *\n   * @param position - `\"before\"`, `\"after\"` or `\"inside\"`.\n   * @returns `false` when the move is impossible, for instance moving a\n   * node into its own subtree.\n   * @group Changing the tree\n   */\n  public moveNode(\n    movedNode: Node,\n    targetNode: Node,\n    position: Position,\n  ): boolean {\n    if (!movedNode.parent || movedNode.isParentOf(targetNode)) {\n      // - Node is parent of target node\n      // - Or, parent is empty\n      return false;\n    }\n    movedNode.parent.doRemoveChild(movedNode);\n\n    switch (position) {\n      case \"after\": {\n        if (targetNode.parent) {\n          targetNode.parent.addChildAtPosition(\n            movedNode,\n            targetNode.parent.getChildIndex(targetNode) + 1,\n          );\n          return true;\n        }\n        return false;\n      }\n\n      case \"before\": {\n        if (targetNode.parent) {\n          targetNode.parent.addChildAtPosition(\n            movedNode,\n            targetNode.parent.getChildIndex(targetNode),\n          );\n          return true;\n        }\n        return false;\n      }\n\n      case \"inside\": {\n        // move inside as first child\n        targetNode.addChildAtPosition(movedNode, 0);\n        return true;\n      }\n    }\n  }\n\n  /**\n   * Adds a child at the start.\n   *\n   * @returns The new node.\n   * @group Changing the tree\n   */\n  public prepend(nodeInfo: NodeData): Node {\n    const node = this.createNode(nodeInfo);\n    this.addChildAtPosition(node, 0);\n\n    node.loadChildrenFromData(nodeInfo);\n    return node;\n  }\n\n  /**\n   * Removes this node from its parent.\n   *\n   * @group Changing the tree\n   */\n  public remove(): void {\n    if (!this.parent) {\n      return;\n    }\n\n    this.parent.removeChild(this);\n    this.parent = null;\n  }\n\n  /**\n   * Removes a child and its children.\n   *\n   * @group Changing the tree\n   */\n  public removeChild(node: Node): void {\n    // remove children from the index\n    node.removeChildren();\n\n    this.doRemoveChild(node);\n  }\n\n  /**\n   * Removes all children.\n   *\n   * @group Changing the tree\n   */\n  public removeChildren(): void {\n    this.iterate((child: Node) => {\n      this.tree?.removeNodeFromIndex(child);\n      return true;\n    });\n\n    this.children = [];\n  }\n\n  /**\n  @hidden\n  */\n  public removeNodeFromIndex(node: Node): void {\n    if (node.id != null) {\n      this.idMapping?.delete(node.id);\n    }\n  }\n\n  /**\n   * Updates the node's properties from node data. `children` and `parent`\n   * are ignored. A string sets the name. Existing node values are not\n   * removed.\n   *\n   * @group Changing the tree\n   */\n  public setData(o: NodeData | null): void {\n    if (!o) {\n      return;\n    }\n    if (typeof o === \"string\") {\n      this.name = o;\n    } else if (typeof o === \"object\") {\n      for (const key in o) {\n        if (!Object.prototype.hasOwnProperty.call(o, key)) {\n          continue;\n        }\n\n        const value = o[key];\n\n        if (key === \"label\" || key === \"name\") {\n          // You can use the 'label' key instead of 'name'; this is a legacy feature\n          if (typeof value === \"string\") {\n            this.name = value;\n          }\n        } else if (key !== \"children\" && key !== \"parent\") {\n          // You can't update the children or the parent using this function\n          this[key] = value;\n        }\n      }\n    }\n  }\n\n  private createNode(nodeData?: NodeData): Node {\n    const nodeClass = this.getNodeClass();\n    return new nodeClass(nodeData);\n  }\n\n  private doRemoveChild(node: Node): void {\n    this.children.splice(this.getChildIndex(node), 1);\n    this.tree?.removeNodeFromIndex(node);\n  }\n\n  private getNodeClass(): typeof Node {\n    return this.nodeClass ?? this.tree?.nodeClass ?? Node;\n  }\n\n  // Load children data from nodeInfo if it has children\n  private loadChildrenFromData(nodeInfo: NodeData) {\n    if (isNodeRecordWithChildren(nodeInfo) && nodeInfo.children.length) {\n      this.loadFromData(nodeInfo.children);\n    }\n  }\n\n  private setParent(parent: Node): void {\n    this.parent = parent;\n    this.tree = parent.tree;\n    this.tree?.addNodeToIndex(this);\n  }\n}\n"],"names":["createNode","loadChildrenFromData","setParent","doRemoveChild","getNodeClass"],"mappings":";;AAAA;AACA;AACA;;AAEA;AACA;;AAkBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,MAAM,IAAI,CAAC;AAChB;AACF;AACA;;AAGE;AACF;AACA;EACS,QAAQ;AACf;AACF;EACS,OAAO;AACd;AACF;AACA;EACS,EAAE;AACT;AACF;AACA;EACS,SAAS;AAChB;AACF;AACA;EACS,UAAU;AACjB;AACF;AACA;EACS,OAAO;AACd;AACF;AACA;EACS,aAAa;AACpB;AACF;AACA;AACS,EAAA,cAAc,GAAG,KAAK;AAC7B;AACF;AACA;AACS,EAAA,IAAI,GAAG,EAAE;AAChB;AACF;AACA;EACS,SAAS;AAChB;AACF;AACA;EACS,MAAM;AACb;AACF;AACA;EACS,IAAI;;AAEX;AACF;AACA;AACE,EAAA,WAAW,CACT,QAAyB,GAAG,IAAI,EAChC,MAAM,GAAG,KAAK,EACd,SAAS,GAAG,IAAI,EAChB;AACA,IAAA,IAAI,CAAC,aAAa,GAChB,QAAQ,IAAI,IAAI,IAChB,wBAAwB,CAAC,QAAQ,CAAC,IAClC,QAAQ,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;AAEhC,IAAA,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;IAEtB,IAAI,CAAC,QAAQ,GAAG,EAAE;IAClB,IAAI,CAAC,MAAM,GAAG,IAAI;IAClB,IAAI,CAAC,UAAU,GAAG,SAAS;IAC3B,IAAI,CAAC,OAAO,KAAK,SAAS;AAE1B,IAAA,IAAI,MAAM,EAAE;AACV,MAAA,IAAI,CAAC,SAAS,GAAG,IAAI,GAAG,EAAgB;MACxC,IAAI,CAAC,IAAI,GAAG,IAAI;MAChB,IAAI,CAAC,SAAS,GAAG,SAAS;AAC5B,IAAA,CAAC,MAAM;MACL,IAAI,CAAC,SAAS,GAAG,SAAS;AAC5B,IAAA;AACF,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACS,QAAQ,CAAC,QAAkB,EAAe;IAC/C,IAAI,IAAI,CAAC,MAAM,EAAE;AACf,MAAA,IAAM,IAAI,GAAG,IAAI,CAACA,WAAU,CAAC,QAAQ,CAAC;MAEtC,IAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC;MAClD,IAAI,CAAC,MAAM,CAAC,kBAAkB,CAAC,IAAI,EAAE,UAAU,GAAG,CAAC,CAAC;AAEpD,MAAA,IAAI,CAACC,qBAAoB,CAAC,QAAQ,CAAC;AACnC,MAAA,OAAO,IAAI;AACb,IAAA;AACA,IAAA,OAAO,IAAI;AACb,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACS,SAAS,CAAC,QAAkB,EAAe;IAChD,IAAI,IAAI,CAAC,MAAM,EAAE;AACf,MAAA,IAAM,IAAI,GAAG,IAAI,CAACD,WAAU,CAAC,QAAQ,CAAC;MAEtC,IAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC;MAClD,IAAI,CAAC,MAAM,CAAC,kBAAkB,CAAC,IAAI,EAAE,UAAU,CAAC;AAEhD,MAAA,IAAI,CAACC,qBAAoB,CAAC,QAAQ,CAAC;AACnC,MAAA,OAAO,IAAI;AACb,IAAA;AACA,IAAA,OAAO,IAAI;AACb,EAAA;;AAEA;AACF;AACA;AACA;AACA;EACS,QAAQ,CAAC,IAAU,EAAQ;AAChC,IAAA,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;AACxB,IAAA,IAAI,CAACC,UAAS,CAAC,IAAI,CAAC;AACtB,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACS,EAAA,kBAAkB,CAAC,IAAU,EAAE,KAAa,EAAQ;IACzD,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC;AACpC,IAAA,IAAI,CAACA,UAAS,CAAC,IAAI,CAAC;AACtB,EAAA;;AAEA;AACF;AACA;EACS,cAAc,CAAC,IAAU,EAAQ;AACtC,IAAA,IAAI,IAAI,CAAC,EAAE,IAAI,IAAI,EAAE;MACnB,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC;AACpC,IAAA;AACF,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACS,SAAS,CAAC,QAAkB,EAAe;IAChD,IAAI,IAAI,CAAC,MAAM,EAAE;AACf,MAAA,IAAM,SAAS,GAAG,IAAI,CAACF,WAAU,CAAC,QAAQ,CAAC;MAE3C,IAAI,IAAI,CAAC,IAAI,EAAE;AACb,QAAA,SAAS,CAACE,UAAS,CAAC,IAAI,CAAC,IAAI,CAAC;AAChC,MAAA;AACA,MAAA,IAAM,cAAc,GAAG,IAAI,CAAC,MAAM;AAElC,MAAA,KAAK,IAAM,KAAK,IAAI,cAAc,CAAC,QAAQ,EAAE;AAC3C,QAAA,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC;AAC3B,MAAA;MAEA,cAAc,CAAC,QAAQ,GAAG,EAAE;AAC5B,MAAA,cAAc,CAAC,QAAQ,CAAC,SAAS,CAAC;AAClC,MAAA,OAAO,SAAS;AAClB,IAAA;AACA,IAAA,OAAO,IAAI;AACb,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACS,MAAM,CAAC,QAAkB,EAAQ;AACtC,IAAA,IAAM,IAAI,GAAG,IAAI,CAACF,WAAU,CAAC,QAAQ,CAAC;AACtC,IAAA,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;AAEnB,IAAA,IAAI,CAACC,qBAAoB,CAAC,QAAQ,CAAC;AACnC,IAAA,OAAO,IAAI;AACb,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACS,MAAM,CAAC,CAA0B,EAAU;IAChD,IAAM,MAAc,GAAG,EAAE;AAEzB,IAAA,IAAI,CAAC,OAAO,CAAE,IAAU,IAAK;AAC3B,MAAA,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE;AACX,QAAA,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;AACnB,MAAA;AAEA,MAAA,OAAO,IAAI;AACb,IAAA,CAAC,CAAC;AAEF,IAAA,OAAO,MAAM;AACf,EAAA;;AAEA;AACF;AACA;AACA;AACA;EACS,aAAa,CAAC,IAAU,EAAU;AACvC,IAAA,OAAO,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC;AACpC,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACS,EAAA,OAAO,CAAC,aAAa,GAAG,KAAK,EAAgB;IAClD,IAAM,gBAAgB,GAAI,KAAa,IAAgC;AACrE,MAAA,OAAO,KAAK,CAAC,GAAG,CAAE,IAAI,IAAK;QACzB,IAAM,OAAgC,GAAG,EAAE;AAE3C,QAAA,KAAK,IAAM,CAAC,IAAI,IAAI,EAAE;AACpB,UAAA,IACE,CACE,UAAU,EACV,SAAS,EACT,WAAW,EACX,eAAe,EACf,gBAAgB,EAChB,WAAW,EACX,QAAQ,EACR,MAAM,CACP,CAAC,QAAQ,CAAC,CAAC,CAAC,IACb,CAAC,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,EAC9C;AACA,YAAA;AACF,UAAA;AAEA,UAAA,IAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;AACjB,UAAA,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC;AAChB,QAAA;AAEA,QAAA,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE;UACtB,OAAO,CAAC,QAAQ,GAAG,gBAAgB,CAAC,IAAI,CAAC,QAAQ,CAAC;AACpD,QAAA;AAEA,QAAA,OAAO,OAAO;AAChB,MAAA,CAAC,CAAC;IACJ,CAAC;IAED,OAAO,gBAAgB,CAAC,aAAa,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;AACjE,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACS,EAAA,YAAY,GAAgB;AACjC,IAAA,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE;AACtB,MAAA,IAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAS;AAEjE,MAAA,OAAO,SAAS,CAAC,WAAW,EAAE,IAAI,SAAS,CAAC,OAAO,GAC/C,SAAS,CAAC,YAAY,EAAE,GACxB,SAAS;AACf,IAAA;AACA,IAAA,OAAO,IAAI;AACb,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACS,EAAA,QAAQ,GAAW;IACxB,IAAI,KAAK,GAAG,CAAC;AACb,IAAA,IAAI,IAAU,GAAG,IAAI,CAAC;;IAEtB,OAAO,IAAI,CAAC,MAAM,EAAE;AAClB,MAAA,KAAK,IAAI,CAAC;MACV,IAAI,GAAG,IAAI,CAAC,MAAM;AACpB,IAAA;AAEA,IAAA,OAAO,KAAK;AACd,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACS,EAAA,WAAW,CAAC,eAAe,GAAG,IAAI,EAAe;AACtD,IAAA,IAAI,eAAe,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE;AACzC,MAAA,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,IAAI;AACjC,IAAA;IACA,IAAI,IAAI,CAAC,MAAM,EAAE;AACf,MAAA,IAAM,WAAW,GAAG,IAAI,CAAC,cAAc,EAAE;MAEzC,OAAO,WAAW,IAAI,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC;AACtD,IAAA;AACA,IAAA,OAAO,IAAI;AACb,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACS,EAAA,cAAc,GAAgB;IACnC,IAAI,IAAI,CAAC,MAAM,EAAE;MACf,IAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC;MACrD,OAAO,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,GACzC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,IAAI,GACxC,IAAI;AACV,IAAA;AACA,IAAA,OAAO,IAAI;AACb,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACS,EAAA,kBAAkB,GAAgB;IACvC,IAAI,IAAI,CAAC,WAAW,EAAE,IAAI,IAAI,CAAC,OAAO,EAAE;AACtC;AACA,MAAA,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,IAAI;AACjC,IAAA;IACA,IAAI,IAAI,CAAC,MAAM,EAAE;AACf,MAAA,IAAM,WAAW,GAAG,IAAI,CAAC,cAAc,EAAE;AACzC,MAAA,IAAI,WAAW,EAAE;AACf;AACA,QAAA,OAAO,WAAW;AACpB,MAAA;AACA;AACA,MAAA,OAAO,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC;AACvC,IAAA;AACA,IAAA,OAAO,IAAI;AACb,EAAA;;AAEA;AACF;AACA;AACA;AACA;EACS,iBAAiB,CAAC,QAAiC,EAAe;IACvE,IAAI,MAAmB,GAAG,IAAI;AAE9B,IAAA,IAAI,CAAC,OAAO,CAAE,IAAU,IAAK;AAC3B,MAAA,IAAI,MAAM,EAAE;AACV,QAAA,OAAO,KAAK;AACd,MAAA;AACA,MAAA,IAAI,QAAQ,CAAC,IAAI,CAAC,EAAE;AAClB,QAAA,MAAM,GAAG,IAAI;AACb,QAAA,OAAO,KAAK;AACd,MAAA;AACA,MAAA,OAAO,IAAI;AACb,IAAA,CAAC,CAAC;AAEF,IAAA,OAAO,MAAM;AACf,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACS,WAAW,CAAC,MAAc,EAAe;IAC9C,OAAO,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI;AAC5C,EAAA;;AAEA;AACF;AACA;AACA;AACA;EACS,aAAa,CAAC,IAAY,EAAe;IAC9C,OAAO,IAAI,CAAC,iBAAiB,CAAE,IAAU,IAAK,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC;AACnE,EAAA;;AAEA;AACF;AACA;AACA;AACA;EACS,sBAAsB,CAAC,IAAY,EAAQ;AAChD,IAAA,IAAM,IAAI,GAAG,IAAI,CAAC,iBAAiB,CAAE,CAAO,IAAK,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC;IAEjE,IAAI,CAAC,IAAI,EAAE;AACT,MAAA,MAAM,IAAI,KAAK,CAAC,CAAA,eAAA,EAAkB,IAAI,YAAY,CAAC;AACrD,IAAA;AAEA,IAAA,OAAO,IAAI;AACb,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACS,EAAA,kBAAkB,CAAC,GAAW,EAAE,KAAc,EAAU;AAC7D,IAAA,OAAO,IAAI,CAAC,MAAM,CAAE,IAAU,IAAK,IAAI,CAAC,GAAG,CAAC,KAAK,KAAK,CAAC;AACzD,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACS,EAAA,SAAS,GAAgB;AAC9B;AACA,IAAA,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;AAChB,MAAA,OAAO,IAAI;AACb,IAAA;AACA,IAAA,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE;MACtB,OAAO,IAAI,CAAC,MAAM;AACpB,IAAA;AACA;AACA,IAAA,OAAO,IAAI;AACb,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACS,EAAA,eAAe,GAAgB;IACpC,IAAI,IAAI,CAAC,MAAM,EAAE;AACf,MAAA,IAAM,eAAe,GAAG,IAAI,CAAC,kBAAkB,EAAE;MAEjD,IAAI,CAAC,eAAe,EAAE;AACpB,QAAA,OAAO,IAAI,CAAC,SAAS,EAAE;AACzB,MAAA;AACA,MAAA,OAAO,eAAe,CAAC,WAAW,EAAE,GAChC,eAAe,CAAC,YAAY,EAAE,GAC9B,eAAe;AACrB,IAAA;AACA,IAAA,OAAO,IAAI;AACb,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACS,EAAA,kBAAkB,GAAgB;IACvC,IAAI,IAAI,CAAC,MAAM,EAAE;MACf,IAAM,aAAa,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC;AACzD,MAAA,OAAO,aAAa,IAAI,CAAC,GACpB,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,aAAa,CAAC,IAAI,IAAI,GAC5C,IAAI;AACV,IAAA;AACA,IAAA,OAAO,IAAI;AACb,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACS,EAAA,sBAAsB,GAAgB;IAC3C,IAAI,IAAI,CAAC,MAAM,EAAE;AACf,MAAA,IAAM,eAAe,GAAG,IAAI,CAAC,kBAAkB,EAAE;MAEjD,IAAI,CAAC,eAAe,EAAE;AACpB,QAAA,OAAO,IAAI,CAAC,SAAS,EAAE;AACzB,MAAA;MACA,IAAI,CAAC,eAAe,CAAC,WAAW,EAAE,IAAI,CAAC,eAAe,CAAC,OAAO,EAAE;AAC9D;AACA,QAAA,OAAO,eAAe;AACxB,MAAA;AACA;AACA,MAAA,OAAO,eAAe,CAAC,YAAY,EAAE;AACvC,IAAA;AACA,IAAA,OAAO,IAAI;AACb,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACS,EAAA,WAAW,GAAY;AAC5B,IAAA,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;AACnC,EAAA;;AAEA;AACF;AACA;AACA;AACA;EACS,YAAY,CAAC,IAAc,EAAQ;IACxC,IAAM,OAAO,GAAI,QAAkB,IAAW;AAC5C,MAAA,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;MAEtB,IAAI,wBAAwB,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,QAAQ,CAAC,MAAM,EAAE;AAClE,QAAA,WAAW,CAAC,QAAQ,CAAC,QAAQ,CAAC;AAChC,MAAA;IACF,CAAC;IAED,IAAM,WAAW,GAAI,YAAwB,IAAW;AACtD,MAAA,KAAK,IAAM,KAAK,IAAI,YAAY,EAAE;AAChC,QAAA,IAAM,IAAI,GAAG,IAAI,CAACD,WAAU,EAAE;AAC9B,QAAA,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;AACxB,QAAA,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;AACrB,MAAA;IACF,CAAC;IAED,OAAO,CAAC,IAAI,CAAC;AACf,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACS,EAAA,QAAQ,GAAY;IACzB,OAAO,IAAI,CAAC,WAAW,EAAE,IAAI,IAAI,CAAC,cAAc;AAClD,EAAA;;AAEA;AACF;AACA;AACA;AACA;EACS,UAAU,CAAC,IAAU,EAAW;AACrC,IAAA,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM;AAExB,IAAA,OAAO,MAAM,EAAE;MACb,IAAI,MAAM,KAAK,IAAI,EAAE;AACnB,QAAA,OAAO,IAAI;AACb,MAAA;MAEA,MAAM,GAAG,MAAM,CAAC,MAAM;AACxB,IAAA;AAEA,IAAA,OAAO,KAAK;AACd,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACS,OAAO,CAAC,QAAyB,EAAQ;AAC9C,IAAA,IAAM,QAAQ,GAAG,CAAC,IAAU,EAAE,KAAa,KAAW;AACpD,MAAA,KAAK,IAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;AACjC,QAAA,IAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC;AAErC,QAAA,IAAI,MAAM,IAAI,KAAK,CAAC,WAAW,EAAE,EAAE;AACjC,UAAA,QAAQ,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC;AAC5B,QAAA;AACF,MAAA;IACF,CAAC;AAED,IAAA,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC;AACnB,EAAA;;AAEA;AACF;AACA;AACA;AACA;EACS,YAAY,CAAC,IAAgB,EAAQ;IAC1C,IAAI,CAAC,cAAc,EAAE;AAErB,IAAA,KAAK,IAAM,SAAS,IAAI,IAAI,EAAE;AAC5B,MAAA,IAAM,IAAI,GAAG,IAAI,CAACA,WAAU,CAAC,SAAS,CAAC;AACvC,MAAA,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;AAEnB,MAAA,IAAI,wBAAwB,CAAC,SAAS,CAAC,EAAE;AACvC,QAAA,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC,QAAQ,CAAC;AACvC,MAAA;AACF,IAAA;AAEA,IAAA,OAAO,IAAI;AACb,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACS,EAAA,QAAQ,CACb,SAAe,EACf,UAAgB,EAChB,QAAkB,EACT;IACT,IAAI,CAAC,SAAS,CAAC,MAAM,IAAI,SAAS,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE;AACzD;AACA;AACA,MAAA,OAAO,KAAK;AACd,IAAA;AACA,IAAA,SAAS,CAAC,MAAM,CAACG,cAAa,CAAC,SAAS,CAAC;AAEzC,IAAA,QAAQ,QAAQ;AACd,MAAA,KAAK,OAAO;AAAE,QAAA;UACZ,IAAI,UAAU,CAAC,MAAM,EAAE;AACrB,YAAA,UAAU,CAAC,MAAM,CAAC,kBAAkB,CAClC,SAAS,EACT,UAAU,CAAC,MAAM,CAAC,aAAa,CAAC,UAAU,CAAC,GAAG,CAChD,CAAC;AACD,YAAA,OAAO,IAAI;AACb,UAAA;AACA,UAAA,OAAO,KAAK;AACd,QAAA;AAEA,MAAA,KAAK,QAAQ;AAAE,QAAA;UACb,IAAI,UAAU,CAAC,MAAM,EAAE;AACrB,YAAA,UAAU,CAAC,MAAM,CAAC,kBAAkB,CAClC,SAAS,EACT,UAAU,CAAC,MAAM,CAAC,aAAa,CAAC,UAAU,CAC5C,CAAC;AACD,YAAA,OAAO,IAAI;AACb,UAAA;AACA,UAAA,OAAO,KAAK;AACd,QAAA;AAEA,MAAA,KAAK,QAAQ;AAAE,QAAA;AACb;AACA,UAAA,UAAU,CAAC,kBAAkB,CAAC,SAAS,EAAE,CAAC,CAAC;AAC3C,UAAA,OAAO,IAAI;AACb,QAAA;AACF;AACF,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;EACS,OAAO,CAAC,QAAkB,EAAQ;AACvC,IAAA,IAAM,IAAI,GAAG,IAAI,CAACH,WAAU,CAAC,QAAQ,CAAC;AACtC,IAAA,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,CAAC,CAAC;AAEhC,IAAA,IAAI,CAACC,qBAAoB,CAAC,QAAQ,CAAC;AACnC,IAAA,OAAO,IAAI;AACb,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACS,EAAA,MAAM,GAAS;AACpB,IAAA,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;AAChB,MAAA;AACF,IAAA;AAEA,IAAA,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC;IAC7B,IAAI,CAAC,MAAM,GAAG,IAAI;AACpB,EAAA;;AAEA;AACF;AACA;AACA;AACA;EACS,WAAW,CAAC,IAAU,EAAQ;AACnC;IACA,IAAI,CAAC,cAAc,EAAE;AAErB,IAAA,IAAI,CAACE,cAAa,CAAC,IAAI,CAAC;AAC1B,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACS,EAAA,cAAc,GAAS;AAC5B,IAAA,IAAI,CAAC,OAAO,CAAE,KAAW,IAAK;AAC5B,MAAA,IAAI,CAAC,IAAI,EAAE,mBAAmB,CAAC,KAAK,CAAC;AACrC,MAAA,OAAO,IAAI;AACb,IAAA,CAAC,CAAC;IAEF,IAAI,CAAC,QAAQ,GAAG,EAAE;AACpB,EAAA;;AAEA;AACF;AACA;EACS,mBAAmB,CAAC,IAAU,EAAQ;AAC3C,IAAA,IAAI,IAAI,CAAC,EAAE,IAAI,IAAI,EAAE;MACnB,IAAI,CAAC,SAAS,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;AACjC,IAAA;AACF,EAAA;;AAEA;AACF;AACA;AACA;AACA;AACA;AACA;EACS,OAAO,CAAC,CAAkB,EAAQ;IACvC,IAAI,CAAC,CAAC,EAAE;AACN,MAAA;AACF,IAAA;AACA,IAAA,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE;MACzB,IAAI,CAAC,IAAI,GAAG,CAAC;AACf,IAAA,CAAC,MAAM,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE;AAChC,MAAA,KAAK,IAAM,GAAG,IAAI,CAAC,EAAE;AACnB,QAAA,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE;AACjD,UAAA;AACF,QAAA;AAEA,QAAA,IAAM,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC;AAEpB,QAAA,IAAI,GAAG,KAAK,OAAO,IAAI,GAAG,KAAK,MAAM,EAAE;AACrC;AACA,UAAA,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE;YAC7B,IAAI,CAAC,IAAI,GAAG,KAAK;AACnB,UAAA;QACF,CAAC,MAAM,IAAI,GAAG,KAAK,UAAU,IAAI,GAAG,KAAK,QAAQ,EAAE;AACjD;AACA,UAAA,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK;AACnB,QAAA;AACF,MAAA;AACF,IAAA;AACF,EAAA;EAEQH,WAAUA,CAAC,QAAmB,EAAQ;AAC5C,IAAA,IAAM,SAAS,GAAG,IAAI,CAACI,aAAY,EAAE;AACrC,IAAA,OAAO,IAAI,SAAS,CAAC,QAAQ,CAAC;AAChC,EAAA;EAEQD,cAAaA,CAAC,IAAU,EAAQ;AACtC,IAAA,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AACjD,IAAA,IAAI,CAAC,IAAI,EAAE,mBAAmB,CAAC,IAAI,CAAC;AACtC,EAAA;AAEQC,EAAAA,aAAYA,GAAgB;IAClC,OAAO,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,IAAI,EAAE,SAAS,IAAI,IAAI;AACvD,EAAA;;AAEA;EACQH,qBAAoBA,CAAC,QAAkB,EAAE;IAC/C,IAAI,wBAAwB,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,QAAQ,CAAC,MAAM,EAAE;AAClE,MAAA,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,QAAQ,CAAC;AACtC,IAAA;AACF,EAAA;EAEQC,UAASA,CAAC,MAAY,EAAQ;IACpC,IAAI,CAAC,MAAM,GAAG,MAAM;AACpB,IAAA,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI;AACvB,IAAA,IAAI,CAAC,IAAI,EAAE,cAAc,CAAC,IAAI,CAAC;AACjC,EAAA;AACF;;"}

package/lib/nodeElement/folderElement.d.ts

@@ -16,7 +16,7 @@ declare class FolderElement extends NodeElement {
     private renderChildren;
     private triggerEvent;
     constructor({ classNames, closedIconElement, getScrollLeft, node, openedIconElement, renderChildren, tabIndex, treeElement, triggerEvent, }: FolderElementParams);
-    close(slide: boolean, animationSpeed: AnimationSpeed): void;
+    close(slide: boolean, animationSpeed: AnimationSpeed): Promise<void>;
     open(slide: boolean, animationSpeed: AnimationSpeed): Promise<void>;
     protected mustShowBorderDropHint(position: Position): boolean;
     private getButton;

package/lib/nodeElement/folderElement.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"folderElement.d.ts","sourceRoot":"","sources":["../../src/nodeElement/folderElement.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AACnD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AACnD,OAAO,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAC9C,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,SAAS,CAAC;AAGjD,OAAO,WAAW,MAAM,SAAS,CAAC;AAElC,MAAM,MAAM,cAAc,GAAG,CAAC,IAAI,EAAE,IAAI,KAAK,gBAAgB,GAAG,IAAI,CAAC;AAErE,UAAU,mBAAoB,SAAQ,iBAAiB;IACrD,iBAAiB,CAAC,EAAE,UAAU,CAAC,IAAI,CAAC;IACpC,iBAAiB,CAAC,EAAE,UAAU,CAAC,IAAI,CAAC;IACpC,cAAc,EAAE,cAAc,CAAC;IAC/B,YAAY,EAAE,YAAY,CAAC;CAC5B;AAED,cAAM,aAAc,SAAQ,WAAW;IACrC,OAAO,CAAC,iBAAiB,CAAC,CAAkB;IAC5C,OAAO,CAAC,iBAAiB,CAAC,CAAkB;IAC5C,OAAO,CAAC,cAAc,CAAiB;IACvC,OAAO,CAAC,YAAY,CAAe;gBAEvB,EACV,UAAU,EACV,iBAAiB,EACjB,aAAa,EACb,IAAI,EACJ,iBAAiB,EACjB,cAAc,EACd,QAAQ,EACR,WAAW,EACX,YAAY,GACb,EAAE,mBAAmB;IAef,KAAK,CAAC,KAAK,EAAE,OAAO,EAAE,cAAc,EAAE,cAAc,GAAG,IAAI;IA8CrD,IAAI,CACf,KAAK,EAAE,OAAO,EACd,cAAc,EAAE,cAAc,GAC7B,OAAO,CAAC,IAAI,CAAC;IAsDhB,SAAS,CAAC,sBAAsB,CAAC,QAAQ,EAAE,QAAQ,GAAG,OAAO;IAI7D,OAAO,CAAC,SAAS;CAKlB;AAED,eAAe,aAAa,CAAC"}
+{"version":3,"file":"folderElement.d.ts","sourceRoot":"","sources":["../../src/nodeElement/folderElement.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AACnD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AACnD,OAAO,KAAK,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAC9C,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,SAAS,CAAC;AAGjD,OAAO,WAAW,MAAM,SAAS,CAAC;AAElC,MAAM,MAAM,cAAc,GAAG,CAAC,IAAI,EAAE,IAAI,KAAK,gBAAgB,GAAG,IAAI,CAAC;AAErE,UAAU,mBAAoB,SAAQ,iBAAiB;IACrD,iBAAiB,CAAC,EAAE,UAAU,CAAC,IAAI,CAAC;IACpC,iBAAiB,CAAC,EAAE,UAAU,CAAC,IAAI,CAAC;IACpC,cAAc,EAAE,cAAc,CAAC;IAC/B,YAAY,EAAE,YAAY,CAAC;CAC5B;AAED,cAAM,aAAc,SAAQ,WAAW;IACrC,OAAO,CAAC,iBAAiB,CAAC,CAAkB;IAC5C,OAAO,CAAC,iBAAiB,CAAC,CAAkB;IAC5C,OAAO,CAAC,cAAc,CAAiB;IACvC,OAAO,CAAC,YAAY,CAAe;gBAEvB,EACV,UAAU,EACV,iBAAiB,EACjB,aAAa,EACb,IAAI,EACJ,iBAAiB,EACjB,cAAc,EACd,QAAQ,EACR,WAAW,EACX,YAAY,GACb,EAAE,mBAAmB;IAeT,KAAK,CAChB,KAAK,EAAE,OAAO,EACd,cAAc,EAAE,cAAc,GAC7B,OAAO,CAAC,IAAI,CAAC;IA2CH,IAAI,CACf,KAAK,EAAE,OAAO,EACd,cAAc,EAAE,cAAc,GAC7B,OAAO,CAAC,IAAI,CAAC;IA6ChB,SAAS,CAAC,sBAAsB,CAAC,QAAQ,EAAE,QAAQ,GAAG,OAAO;IAI7D,OAAO,CAAC,SAAS;CAKlB;AAED,eAAe,aAAa,CAAC"}