@elliemae/ds-tree-model 3.16.0-next.1 → 3.16.0-next.10

package/dist/cjs/DSTree.js

@@ -28,7 +28,7 @@ __export(DSTree_exports, {
 });
 module.exports = __toCommonJS(DSTree_exports);
 var React = __toESM(require("react"));
-var import_Node = require("./Node");
+var import_Node = require("./Node.js");
 class DSTree {
   constructor(item, options) {
     this.getRoot = () => this.root;

package/dist/cjs/DSTree.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../src/DSTree.ts", "../../../../scripts/build/transpile/react-shim.js"],
-  "sourcesContent": ["import type { AddOptions, Item, MoveOptions, MutateOptions, RemoveOptions } from './types';\nimport { Node } from './Node';\n\nexport class DSTree<T extends Item> {\n  private root: Node<T>;\n\n  private _hash: number;\n\n  private nodes: Record<string, Node<T>>;\n\n  getUniqueId: (item: T) => string;\n\n  constructor(item: T, options: { getUniqueId: (item: T) => string }) {\n    this.getUniqueId = options.getUniqueId;\n    this.root = new Node(item, { childIndex: 0, depth: 0, tree: this });\n    this.nodes = {};\n    this._hash = 0;\n\n    // autocalculate a dictionary where dsId are keys and nodes are values\n    // and add the tree link to each node\n    this.root.walk((node) => {\n      this.nodes[node.dsId] = node;\n      return true;\n    });\n  }\n\n  addNodeToNodesDictionary(node: Node<T>): void {\n    // check that we have no repeated ids\n    if (this.nodes[node.dsId]) {\n      throw new Error(`DSTree: repeated dsId ${node.dsId}`);\n    }\n\n    this.nodes[node.dsId] = node;\n  }\n\n  removeNodeFromNodesDictionary(node: Node<T>): void {\n    delete this.nodes[node.dsId];\n  }\n\n  get hash(): number {\n    return this._hash;\n  }\n\n  getRoot = (): Node<T> => this.root;\n\n  getNode = (id: string): Node<T> => this.nodes[id];\n\n  getNodes = (): Record<string, Node<T>> => this.nodes;\n\n  walk = (callback: (node: Node<T>) => boolean): void => {\n    this.root.walk(callback);\n  };\n\n  walkParents = (callback: (node: Node<T>) => boolean): void => {\n    this.root.walkParents(callback);\n  };\n\n  findNode = (callback: (node: Node<T>) => boolean): Node<T> | null => this.root.findNode(callback);\n\n  findAllNodes = (callback: (node: Node<T>) => boolean): Node<T>[] => this.root.findAllNodes(callback);\n\n  flatten = (): Node<T>[] => this.root.flatten();\n\n  addNode = (item: T, options: AddOptions<T> = {}): Node<T> => {\n    const { position, parent, callback } = options;\n    const parentDefault = parent || this.root;\n    const positionDefault = position ?? parentDefault.children.length;\n\n    // create node and add it to the parent\n    const node = new Node(item, {\n      childIndex: positionDefault,\n      depth: parentDefault.depth + 1,\n      parent: parentDefault,\n      tree: this,\n    });\n    this.getNode(parentDefault.dsId).addNode(node);\n\n    // change hash\n    this._hash += 1;\n\n    // invoke the callback if present\n    callback?.(node, this);\n\n    return node;\n  };\n\n  removeNode = (id: string, options: RemoveOptions<T> = {}): Node<T> => {\n    const node = this.getNode(id);\n    if (!node) throw new Error(`Node with id ${id} not found`);\n\n    node.removeNode();\n\n    // change hash\n    this._hash += 1;\n\n    // invoke the callback if present\n    options.callback?.(node, this);\n\n    return node;\n  };\n\n  moveNode = (id: string, options: MoveOptions<T> = {}): Node<T> => {\n    const removedNode = this.removeNode(id);\n    const node = this.addNode(removedNode.getJson(), options);\n\n    this._hash += 1;\n\n    return node;\n  };\n\n  replaceNode = (id: string, item: T, options: MutateOptions<T> = {}): Node<T> => {\n    const removedNode = this.removeNode(id);\n    const node = this.addNode(item, { parent: removedNode.parent, position: removedNode.childIndex });\n\n    this._hash += 1;\n\n    // invoke the callback if present\n    options.callback?.(node, this);\n\n    return node;\n  };\n\n  getPath = (id: string): Node<T>[] => this.getRoot().getPath(id);\n\n  getPathIds = (id: string): string[] => this.getRoot().getPathIds(id);\n}\n", "import * as React from 'react';\nexport { React };\n"],
+  "sourcesContent": ["import type { AddOptions, Item, MoveOptions, MutateOptions, RemoveOptions } from './types.js';\nimport { Node } from './Node.js';\n\nexport class DSTree<T extends Item> {\n  private root: Node<T>;\n\n  private _hash: number;\n\n  private nodes: Record<string, Node<T>>;\n\n  getUniqueId: (item: T) => string;\n\n  constructor(item: T, options: { getUniqueId: (item: T) => string }) {\n    this.getUniqueId = options.getUniqueId;\n    this.root = new Node(item, { childIndex: 0, depth: 0, tree: this });\n    this.nodes = {};\n    this._hash = 0;\n\n    // autocalculate a dictionary where dsId are keys and nodes are values\n    // and add the tree link to each node\n    this.root.walk((node) => {\n      this.nodes[node.dsId] = node;\n      return true;\n    });\n  }\n\n  addNodeToNodesDictionary(node: Node<T>): void {\n    // check that we have no repeated ids\n    if (this.nodes[node.dsId]) {\n      throw new Error(`DSTree: repeated dsId ${node.dsId}`);\n    }\n\n    this.nodes[node.dsId] = node;\n  }\n\n  removeNodeFromNodesDictionary(node: Node<T>): void {\n    delete this.nodes[node.dsId];\n  }\n\n  get hash(): number {\n    return this._hash;\n  }\n\n  getRoot = (): Node<T> => this.root;\n\n  getNode = (id: string): Node<T> => this.nodes[id];\n\n  getNodes = (): Record<string, Node<T>> => this.nodes;\n\n  walk = (callback: (node: Node<T>) => boolean): void => {\n    this.root.walk(callback);\n  };\n\n  walkParents = (callback: (node: Node<T>) => boolean): void => {\n    this.root.walkParents(callback);\n  };\n\n  findNode = (callback: (node: Node<T>) => boolean): Node<T> | null => this.root.findNode(callback);\n\n  findAllNodes = (callback: (node: Node<T>) => boolean): Node<T>[] => this.root.findAllNodes(callback);\n\n  flatten = (): Node<T>[] => this.root.flatten();\n\n  addNode = (item: T, options: AddOptions<T> = {}): Node<T> => {\n    const { position, parent, callback } = options;\n    const parentDefault = parent || this.root;\n    const positionDefault = position ?? parentDefault.children.length;\n\n    // create node and add it to the parent\n    const node = new Node(item, {\n      childIndex: positionDefault,\n      depth: parentDefault.depth + 1,\n      parent: parentDefault,\n      tree: this,\n    });\n    this.getNode(parentDefault.dsId).addNode(node);\n\n    // change hash\n    this._hash += 1;\n\n    // invoke the callback if present\n    callback?.(node, this);\n\n    return node;\n  };\n\n  removeNode = (id: string, options: RemoveOptions<T> = {}): Node<T> => {\n    const node = this.getNode(id);\n    if (!node) throw new Error(`Node with id ${id} not found`);\n\n    node.removeNode();\n\n    // change hash\n    this._hash += 1;\n\n    // invoke the callback if present\n    options.callback?.(node, this);\n\n    return node;\n  };\n\n  moveNode = (id: string, options: MoveOptions<T> = {}): Node<T> => {\n    const removedNode = this.removeNode(id);\n    const node = this.addNode(removedNode.getJson(), options);\n\n    this._hash += 1;\n\n    return node;\n  };\n\n  replaceNode = (id: string, item: T, options: MutateOptions<T> = {}): Node<T> => {\n    const removedNode = this.removeNode(id);\n    const node = this.addNode(item, { parent: removedNode.parent, position: removedNode.childIndex });\n\n    this._hash += 1;\n\n    // invoke the callback if present\n    options.callback?.(node, this);\n\n    return node;\n  };\n\n  getPath = (id: string): Node<T>[] => this.getRoot().getPath(id);\n\n  getPathIds = (id: string): string[] => this.getRoot().getPathIds(id);\n}\n", "import * as React from 'react';\nexport { React };\n"],
   "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;ACAA,YAAuB;ADCvB,kBAAqB;AAEd,MAAM,OAAuB;AAAA,EASlC,YAAY,MAAS,SAA+C;AA+BpE,mBAAU,MAAe,KAAK;AAE9B,mBAAU,CAAC,OAAwB,KAAK,MAAM;AAE9C,oBAAW,MAA+B,KAAK;AAE/C,gBAAO,CAAC,aAA+C;AACrD,WAAK,KAAK,KAAK,QAAQ;AAAA,IACzB;AAEA,uBAAc,CAAC,aAA+C;AAC5D,WAAK,KAAK,YAAY,QAAQ;AAAA,IAChC;AAEA,oBAAW,CAAC,aAAyD,KAAK,KAAK,SAAS,QAAQ;AAEhG,wBAAe,CAAC,aAAoD,KAAK,KAAK,aAAa,QAAQ;AAEnG,mBAAU,MAAiB,KAAK,KAAK,QAAQ;AAE7C,mBAAU,CAAC,MAAS,UAAyB,CAAC,MAAe;AAC3D,YAAM,EAAE,UAAU,QAAQ,SAAS,IAAI;AACvC,YAAM,gBAAgB,UAAU,KAAK;AACrC,YAAM,kBAAkB,YAAY,cAAc,SAAS;AAG3D,YAAM,OAAO,IAAI,iBAAK,MAAM;AAAA,QAC1B,YAAY;AAAA,QACZ,OAAO,cAAc,QAAQ;AAAA,QAC7B,QAAQ;AAAA,QACR,MAAM;AAAA,MACR,CAAC;AACD,WAAK,QAAQ,cAAc,IAAI,EAAE,QAAQ,IAAI;AAG7C,WAAK,SAAS;AAGd,iBAAW,MAAM,IAAI;AAErB,aAAO;AAAA,IACT;AAEA,sBAAa,CAAC,IAAY,UAA4B,CAAC,MAAe;AACpE,YAAM,OAAO,KAAK,QAAQ,EAAE;AAC5B,UAAI,CAAC;AAAM,cAAM,IAAI,MAAM,gBAAgB,cAAc;AAEzD,WAAK,WAAW;AAGhB,WAAK,SAAS;AAGd,cAAQ,WAAW,MAAM,IAAI;AAE7B,aAAO;AAAA,IACT;AAEA,oBAAW,CAAC,IAAY,UAA0B,CAAC,MAAe;AAChE,YAAM,cAAc,KAAK,WAAW,EAAE;AACtC,YAAM,OAAO,KAAK,QAAQ,YAAY,QAAQ,GAAG,OAAO;AAExD,WAAK,SAAS;AAEd,aAAO;AAAA,IACT;AAEA,uBAAc,CAAC,IAAY,MAAS,UAA4B,CAAC,MAAe;AAC9E,YAAM,cAAc,KAAK,WAAW,EAAE;AACtC,YAAM,OAAO,KAAK,QAAQ,MAAM,EAAE,QAAQ,YAAY,QAAQ,UAAU,YAAY,WAAW,CAAC;AAEhG,WAAK,SAAS;AAGd,cAAQ,WAAW,MAAM,IAAI;AAE7B,aAAO;AAAA,IACT;AAEA,mBAAU,CAAC,OAA0B,KAAK,QAAQ,EAAE,QAAQ,EAAE;AAE9D,sBAAa,CAAC,OAAyB,KAAK,QAAQ,EAAE,WAAW,EAAE;AA/GjE,SAAK,cAAc,QAAQ;AAC3B,SAAK,OAAO,IAAI,iBAAK,MAAM,EAAE,YAAY,GAAG,OAAO,GAAG,MAAM,KAAK,CAAC;AAClE,SAAK,QAAQ,CAAC;AACd,SAAK,QAAQ;AAIb,SAAK,KAAK,KAAK,CAAC,SAAS;AACvB,WAAK,MAAM,KAAK,QAAQ;AACxB,aAAO;AAAA,IACT,CAAC;AAAA,EACH;AAAA,EAEA,yBAAyB,MAAqB;AAE5C,QAAI,KAAK,MAAM,KAAK,OAAO;AACzB,YAAM,IAAI,MAAM,yBAAyB,KAAK,MAAM;AAAA,IACtD;AAEA,SAAK,MAAM,KAAK,QAAQ;AAAA,EAC1B;AAAA,EAEA,8BAA8B,MAAqB;AACjD,WAAO,KAAK,MAAM,KAAK;AAAA,EACzB;AAAA,EAEA,IAAI,OAAe;AACjB,WAAO,KAAK;AAAA,EACd;AAoFF;",
   "names": []
 }

package/dist/cjs/Node.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../src/Node.ts", "../../../../scripts/build/transpile/react-shim.js"],
-  "sourcesContent": ["/* eslint-disable no-use-before-define */\n/* eslint-disable max-params */\nimport { cloneDeep, omit } from 'lodash';\nimport type { DSTree } from './DSTree';\nimport type { Item, NodeConstructorOptions } from './types';\n\nexport class Node<T extends Item> {\n  dsId: string;\n\n  plainItem: T;\n\n  childIndex: number;\n\n  depth: number;\n\n  parent: Node<T> | null;\n\n  children: Node<T>[];\n\n  private tree!: DSTree<T>;\n\n  private _hash: number;\n\n  constructor(item: T, { childIndex, depth, parent, tree }: NodeConstructorOptions<T>) {\n    this.dsId = tree.getUniqueId(item);\n    this.childIndex = childIndex;\n    this.depth = depth;\n    this.parent = parent ?? null;\n    this.tree = tree;\n    this._hash = 0;\n\n    this.children =\n      item.subitems?.map(\n        (subitem, index) => new Node(subitem as T, { childIndex: index, depth: depth + 1, parent: this, tree }),\n      ) ?? [];\n\n    // Save the item without the subitems\n    this.plainItem = this.getCleanItem(item);\n  }\n\n  // ===========================================================================\n  // INTERNAL METHODS\n  // ===========================================================================\n\n  fixChildIndexes = (): void => {\n    for (let i = 0; i < this.children.length; i++) {\n      this.children[i].childIndex = i;\n    }\n    this._hash += 1;\n  };\n\n  getCleanItem = (item: T): T => {\n    const plainItem = omit(item, ['subitems']);\n    return cloneDeep(plainItem as T);\n  };\n\n  // ===========================================================================\n  // READ METHODS\n  // ===========================================================================\n\n  get hash(): number {\n    return this._hash;\n  }\n\n  walk = (callback: (node: Node<T>) => boolean): void => {\n    const shouldContinueWalking = callback(this);\n    if (shouldContinueWalking) {\n      for (const child of this.children) {\n        child.walk(callback);\n      }\n    }\n  };\n\n  walkParents = (callback: (node: Node<T>) => boolean): void => {\n    const shouldContinueWalking = callback(this);\n    if (shouldContinueWalking && this.parent) {\n      this.parent.walkParents(callback);\n    }\n  };\n\n  findNode = (callback: (node: Node<T>) => boolean): Node<T> | null => {\n    // find first node using walk\n    let found: Node<T> | null = null;\n    this.walk((node) => {\n      // If we already found it, don't look anymore\n      if (found) return false;\n\n      // Otherwise keep looking\n      if (callback(node)) found = node;\n      return !found;\n    });\n\n    return found;\n  };\n\n  findAllNodes = (callback: (node: Node<T>) => boolean): Node<T>[] => {\n    const found: Node<T>[] = [];\n    this.walk((node) => {\n      if (callback(node)) found.push(node);\n      return true;\n    });\n    return found;\n  };\n\n  flatten = (): Node<T>[] => {\n    const flattened: Node<T>[] = [];\n    this.walk((node) => {\n      flattened.push(node);\n      return true;\n    });\n    return flattened;\n  };\n\n  getPath = (id: string): Node<T>[] => {\n    const path: Node<T>[] = [];\n    const node = this.tree.getNode(id);\n    if (!node) return path;\n    node.walkParents((parent) => {\n      path.push(parent);\n      return parent.dsId !== this.dsId;\n    });\n    return path.reverse();\n  };\n\n  getPathIds = (id: string): string[] => this.getPath(id).map((node) => node.dsId);\n\n  getJson = (): T => ({\n    ...this.plainItem,\n    subitems: this.children.map((child) => child.getJson()),\n  });\n\n  // ===========================================================================\n  // WRITE METHODS\n  // ===========================================================================\n\n  addNode = (node: Node<T>) => {\n    // check that the position is valid for that parent\n    const position = node.childIndex;\n    if (position < 0 || position > this.children.length) {\n      throw new Error(`Invalid position ${position} for parent ${this.dsId} with item ${node.dsId}`);\n    }\n\n    // add the new node\n    this.children.splice(position, 0, node);\n\n    // fix the childIndex of the nodes after the new one\n    this.fixChildIndexes();\n\n    // add subtree of the new node to the node dictionary\n    node.walk((child) => {\n      this.tree.addNodeToNodesDictionary(child);\n      return true;\n    });\n\n    this._hash += 1;\n  };\n\n  removeNode = () => {\n    // if no parent throw error\n    if (!this.parent) throw new Error(`Cannot remove root node with id ${this.dsId}`);\n\n    // remove from parent\n    this.parent.children.splice(this.childIndex, 1);\n\n    // fix the childIndex of the nodes of the parent\n    this.parent.fixChildIndexes();\n\n    // remove subtree from the node dictionary\n    this.walk((child) => {\n      this.tree.removeNodeFromNodesDictionary(child);\n      return true;\n    });\n\n    this._hash += 1;\n  };\n}\n", "import * as React from 'react';\nexport { React };\n"],
+  "sourcesContent": ["/* eslint-disable no-use-before-define */\n/* eslint-disable max-params */\nimport { cloneDeep, omit } from 'lodash';\nimport type { DSTree } from './DSTree.js';\nimport type { Item, NodeConstructorOptions } from './types.js';\n\nexport class Node<T extends Item> {\n  dsId: string;\n\n  plainItem: T;\n\n  childIndex: number;\n\n  depth: number;\n\n  parent: Node<T> | null;\n\n  children: Node<T>[];\n\n  private tree!: DSTree<T>;\n\n  private _hash: number;\n\n  constructor(item: T, { childIndex, depth, parent, tree }: NodeConstructorOptions<T>) {\n    this.dsId = tree.getUniqueId(item);\n    this.childIndex = childIndex;\n    this.depth = depth;\n    this.parent = parent ?? null;\n    this.tree = tree;\n    this._hash = 0;\n\n    this.children =\n      item.subitems?.map(\n        (subitem, index) => new Node(subitem as T, { childIndex: index, depth: depth + 1, parent: this, tree }),\n      ) ?? [];\n\n    // Save the item without the subitems\n    this.plainItem = this.getCleanItem(item);\n  }\n\n  // ===========================================================================\n  // INTERNAL METHODS\n  // ===========================================================================\n\n  fixChildIndexes = (): void => {\n    for (let i = 0; i < this.children.length; i++) {\n      this.children[i].childIndex = i;\n    }\n    this._hash += 1;\n  };\n\n  getCleanItem = (item: T): T => {\n    const plainItem = omit(item, ['subitems']);\n    return cloneDeep(plainItem as T);\n  };\n\n  // ===========================================================================\n  // READ METHODS\n  // ===========================================================================\n\n  get hash(): number {\n    return this._hash;\n  }\n\n  walk = (callback: (node: Node<T>) => boolean): void => {\n    const shouldContinueWalking = callback(this);\n    if (shouldContinueWalking) {\n      for (const child of this.children) {\n        child.walk(callback);\n      }\n    }\n  };\n\n  walkParents = (callback: (node: Node<T>) => boolean): void => {\n    const shouldContinueWalking = callback(this);\n    if (shouldContinueWalking && this.parent) {\n      this.parent.walkParents(callback);\n    }\n  };\n\n  findNode = (callback: (node: Node<T>) => boolean): Node<T> | null => {\n    // find first node using walk\n    let found: Node<T> | null = null;\n    this.walk((node) => {\n      // If we already found it, don't look anymore\n      if (found) return false;\n\n      // Otherwise keep looking\n      if (callback(node)) found = node;\n      return !found;\n    });\n\n    return found;\n  };\n\n  findAllNodes = (callback: (node: Node<T>) => boolean): Node<T>[] => {\n    const found: Node<T>[] = [];\n    this.walk((node) => {\n      if (callback(node)) found.push(node);\n      return true;\n    });\n    return found;\n  };\n\n  flatten = (): Node<T>[] => {\n    const flattened: Node<T>[] = [];\n    this.walk((node) => {\n      flattened.push(node);\n      return true;\n    });\n    return flattened;\n  };\n\n  getPath = (id: string): Node<T>[] => {\n    const path: Node<T>[] = [];\n    const node = this.tree.getNode(id);\n    if (!node) return path;\n    node.walkParents((parent) => {\n      path.push(parent);\n      return parent.dsId !== this.dsId;\n    });\n    return path.reverse();\n  };\n\n  getPathIds = (id: string): string[] => this.getPath(id).map((node) => node.dsId);\n\n  getJson = (): T => ({\n    ...this.plainItem,\n    subitems: this.children.map((child) => child.getJson()),\n  });\n\n  // ===========================================================================\n  // WRITE METHODS\n  // ===========================================================================\n\n  addNode = (node: Node<T>) => {\n    // check that the position is valid for that parent\n    const position = node.childIndex;\n    if (position < 0 || position > this.children.length) {\n      throw new Error(`Invalid position ${position} for parent ${this.dsId} with item ${node.dsId}`);\n    }\n\n    // add the new node\n    this.children.splice(position, 0, node);\n\n    // fix the childIndex of the nodes after the new one\n    this.fixChildIndexes();\n\n    // add subtree of the new node to the node dictionary\n    node.walk((child) => {\n      this.tree.addNodeToNodesDictionary(child);\n      return true;\n    });\n\n    this._hash += 1;\n  };\n\n  removeNode = () => {\n    // if no parent throw error\n    if (!this.parent) throw new Error(`Cannot remove root node with id ${this.dsId}`);\n\n    // remove from parent\n    this.parent.children.splice(this.childIndex, 1);\n\n    // fix the childIndex of the nodes of the parent\n    this.parent.fixChildIndexes();\n\n    // remove subtree from the node dictionary\n    this.walk((child) => {\n      this.tree.removeNodeFromNodesDictionary(child);\n      return true;\n    });\n\n    this._hash += 1;\n  };\n}\n", "import * as React from 'react';\nexport { React };\n"],
   "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;ACAA,YAAuB;ADEvB,oBAAgC;AAIzB,MAAM,KAAqB;AAAA,EAiBhC,YAAY,MAAS,EAAE,YAAY,OAAO,QAAQ,KAAK,GAA8B;AAqBrF,2BAAkB,MAAY;AAC5B,eAAS,IAAI,GAAG,IAAI,KAAK,SAAS,QAAQ,KAAK;AAC7C,aAAK,SAAS,GAAG,aAAa;AAAA,MAChC;AACA,WAAK,SAAS;AAAA,IAChB;AAEA,wBAAe,CAAC,SAAe;AAC7B,YAAM,gBAAY,oBAAK,MAAM,CAAC,UAAU,CAAC;AACzC,iBAAO,yBAAU,SAAc;AAAA,IACjC;AAUA,gBAAO,CAAC,aAA+C;AACrD,YAAM,wBAAwB,SAAS,IAAI;AAC3C,UAAI,uBAAuB;AACzB,mBAAW,SAAS,KAAK,UAAU;AACjC,gBAAM,KAAK,QAAQ;AAAA,QACrB;AAAA,MACF;AAAA,IACF;AAEA,uBAAc,CAAC,aAA+C;AAC5D,YAAM,wBAAwB,SAAS,IAAI;AAC3C,UAAI,yBAAyB,KAAK,QAAQ;AACxC,aAAK,OAAO,YAAY,QAAQ;AAAA,MAClC;AAAA,IACF;AAEA,oBAAW,CAAC,aAAyD;AAEnE,UAAI,QAAwB;AAC5B,WAAK,KAAK,CAAC,SAAS;AAElB,YAAI;AAAO,iBAAO;AAGlB,YAAI,SAAS,IAAI;AAAG,kBAAQ;AAC5B,eAAO,CAAC;AAAA,MACV,CAAC;AAED,aAAO;AAAA,IACT;AAEA,wBAAe,CAAC,aAAoD;AAClE,YAAM,QAAmB,CAAC;AAC1B,WAAK,KAAK,CAAC,SAAS;AAClB,YAAI,SAAS,IAAI;AAAG,gBAAM,KAAK,IAAI;AACnC,eAAO;AAAA,MACT,CAAC;AACD,aAAO;AAAA,IACT;AAEA,mBAAU,MAAiB;AACzB,YAAM,YAAuB,CAAC;AAC9B,WAAK,KAAK,CAAC,SAAS;AAClB,kBAAU,KAAK,IAAI;AACnB,eAAO;AAAA,MACT,CAAC;AACD,aAAO;AAAA,IACT;AAEA,mBAAU,CAAC,OAA0B;AACnC,YAAM,OAAkB,CAAC;AACzB,YAAM,OAAO,KAAK,KAAK,QAAQ,EAAE;AACjC,UAAI,CAAC;AAAM,eAAO;AAClB,WAAK,YAAY,CAAC,WAAW;AAC3B,aAAK,KAAK,MAAM;AAChB,eAAO,OAAO,SAAS,KAAK;AAAA,MAC9B,CAAC;AACD,aAAO,KAAK,QAAQ;AAAA,IACtB;AAEA,sBAAa,CAAC,OAAyB,KAAK,QAAQ,EAAE,EAAE,IAAI,CAAC,SAAS,KAAK,IAAI;AAE/E,mBAAU,OAAU;AAAA,MAClB,GAAG,KAAK;AAAA,MACR,UAAU,KAAK,SAAS,IAAI,CAAC,UAAU,MAAM,QAAQ,CAAC;AAAA,IACxD;AAMA,mBAAU,CAAC,SAAkB;AAE3B,YAAM,WAAW,KAAK;AACtB,UAAI,WAAW,KAAK,WAAW,KAAK,SAAS,QAAQ;AACnD,cAAM,IAAI,MAAM,oBAAoB,uBAAuB,KAAK,kBAAkB,KAAK,MAAM;AAAA,MAC/F;AAGA,WAAK,SAAS,OAAO,UAAU,GAAG,IAAI;AAGtC,WAAK,gBAAgB;AAGrB,WAAK,KAAK,CAAC,UAAU;AACnB,aAAK,KAAK,yBAAyB,KAAK;AACxC,eAAO;AAAA,MACT,CAAC;AAED,WAAK,SAAS;AAAA,IAChB;AAEA,sBAAa,MAAM;AAEjB,UAAI,CAAC,KAAK;AAAQ,cAAM,IAAI,MAAM,mCAAmC,KAAK,MAAM;AAGhF,WAAK,OAAO,SAAS,OAAO,KAAK,YAAY,CAAC;AAG9C,WAAK,OAAO,gBAAgB;AAG5B,WAAK,KAAK,CAAC,UAAU;AACnB,aAAK,KAAK,8BAA8B,KAAK;AAC7C,eAAO;AAAA,MACT,CAAC;AAED,WAAK,SAAS;AAAA,IAChB;AAtJE,SAAK,OAAO,KAAK,YAAY,IAAI;AACjC,SAAK,aAAa;AAClB,SAAK,QAAQ;AACb,SAAK,SAAS,UAAU;AACxB,SAAK,OAAO;AACZ,SAAK,QAAQ;AAEb,SAAK,WACH,KAAK,UAAU;AAAA,MACb,CAAC,SAAS,UAAU,IAAI,KAAK,SAAc,EAAE,YAAY,OAAO,OAAO,QAAQ,GAAG,QAAQ,MAAM,KAAK,CAAC;AAAA,IACxG,KAAK,CAAC;AAGR,SAAK,YAAY,KAAK,aAAa,IAAI;AAAA,EACzC;AAAA,EAsBA,IAAI,OAAe;AACjB,WAAO,KAAK;AAAA,EACd;AAiHF;",
   "names": []
 }

package/dist/cjs/index.js

@@ -29,6 +29,6 @@ __export(src_exports, {
 });
 module.exports = __toCommonJS(src_exports);
 var React = __toESM(require("react"));
-var import_DSTree = require("./DSTree");
-var import_useDSTree = require("./useDSTree");
+var import_DSTree = require("./DSTree.js");
+var import_useDSTree = require("./useDSTree.js");
 //# sourceMappingURL=index.js.map

package/dist/cjs/index.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../src/index.ts", "../../../../scripts/build/transpile/react-shim.js"],
-  "sourcesContent": ["export type { Item } from './types';\nexport { DSTree } from './DSTree';\nexport { useDSTree } from './useDSTree';\n", "import * as React from 'react';\nexport { React };\n"],
+  "sourcesContent": ["export type { Item } from './types.js';\nexport { DSTree } from './DSTree.js';\nexport { useDSTree } from './useDSTree.js';\n", "import * as React from 'react';\nexport { React };\n"],
   "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;ACAA,YAAuB;ADCvB,oBAAuB;AACvB,uBAA0B;",
   "names": []
 }

package/dist/cjs/package.json

@@ -0,0 +1,7 @@
+{
+  "type": "commonjs",
+  "sideEffects": [
+    "*.css",
+    "*.scss"
+  ]
+}

package/dist/cjs/types.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../src/types.ts", "../../../../scripts/build/transpile/react-shim.js"],
-  "sourcesContent": ["import type { DSTree } from './DSTree';\nimport type { Node } from './Node';\n\nexport interface Item {\n  subitems?: Item[];\n}\n\nexport interface NodeConstructorOptions<T extends Item> {\n  childIndex: number;\n  depth: number;\n  tree: DSTree<T>;\n  parent?: Node<T> | null;\n}\n\nexport interface AddOptions<T extends Item> {\n  position?: number;\n  parent?: Node<T> | null;\n  callback?: (node: Node<T>, tree: DSTree<T>) => void;\n}\n\nexport interface RemoveOptions<T extends Item> {\n  callback?: (node: Node<T>, tree: DSTree<T>) => void;\n}\n\nexport interface MoveOptions<T extends Item> {\n  position?: number;\n  parent?: Node<T>;\n  callback?: (node: Node<T>, tree: DSTree<T>) => void;\n}\n\nexport interface MutateOptions<T extends Item> {\n  callback?: (node: Node<T>, tree: DSTree<T>) => void;\n}\n", "import * as React from 'react';\nexport { React };\n"],
+  "sourcesContent": ["import type { DSTree } from './DSTree.js';\nimport type { Node } from './Node.js';\n\nexport interface Item {\n  subitems?: Item[];\n}\n\nexport interface NodeConstructorOptions<T extends Item> {\n  childIndex: number;\n  depth: number;\n  tree: DSTree<T>;\n  parent?: Node<T> | null;\n}\n\nexport interface AddOptions<T extends Item> {\n  position?: number;\n  parent?: Node<T> | null;\n  callback?: (node: Node<T>, tree: DSTree<T>) => void;\n}\n\nexport interface RemoveOptions<T extends Item> {\n  callback?: (node: Node<T>, tree: DSTree<T>) => void;\n}\n\nexport interface MoveOptions<T extends Item> {\n  position?: number;\n  parent?: Node<T>;\n  callback?: (node: Node<T>, tree: DSTree<T>) => void;\n}\n\nexport interface MutateOptions<T extends Item> {\n  callback?: (node: Node<T>, tree: DSTree<T>) => void;\n}\n", "import * as React from 'react';\nexport { React };\n"],
   "mappings": ";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;ACAA,YAAuB;",
   "names": []
 }

package/dist/cjs/useDSTree.js

@@ -29,7 +29,7 @@ __export(useDSTree_exports, {
 module.exports = __toCommonJS(useDSTree_exports);
 var React = __toESM(require("react"));
 var import_react = require("react");
-var import_DSTree = require("./DSTree");
+var import_DSTree = require("./DSTree.js");
 const useDSTree = (rootItem, opts) => {
   const tree = (0, import_react.useMemo)(() => new import_DSTree.DSTree(rootItem, opts), [opts, rootItem]);
   const [hash, setHash] = (0, import_react.useState)(tree.hash);

package/dist/cjs/useDSTree.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../src/useDSTree.ts", "../../../../scripts/build/transpile/react-shim.js"],
-  "sourcesContent": ["import { useCallback, useMemo, useState } from 'react';\nimport { DSTree } from './DSTree';\nimport type { AddOptions, Item, MoveOptions, MutateOptions, RemoveOptions } from './types';\n\nexport const useDSTree = <T extends Item>(rootItem: T, opts: { getUniqueId: (item: T) => string }) => {\n  const tree = useMemo(() => new DSTree(rootItem, opts), [opts, rootItem]);\n  const [hash, setHash] = useState(tree.hash);\n\n  const addNode = useCallback(\n    (item: T, options?: AddOptions<T>) => {\n      const cb: AddOptions<T>['callback'] = (node, treecb) => {\n        options?.callback?.(node, treecb);\n        setHash(treecb.hash);\n      };\n      return tree.addNode(item, { ...options, callback: cb });\n    },\n    [tree],\n  );\n\n  const removeNode = useCallback(\n    (id: string, options?: RemoveOptions<T>) => {\n      const cb: RemoveOptions<T>['callback'] = (node, treecb) => {\n        options?.callback?.(node, treecb);\n        setHash(treecb.hash);\n      };\n      return tree.removeNode(id, { ...options, callback: cb });\n    },\n    [tree],\n  );\n\n  const moveNode = useCallback(\n    (id: string, options?: MoveOptions<T>) => {\n      const cb: MoveOptions<T>['callback'] = (node, treecb) => {\n        options?.callback?.(node, treecb);\n        setHash(treecb.hash);\n      };\n      return tree.moveNode(id, { ...options, callback: cb });\n    },\n    [tree],\n  );\n\n  const replaceNode = useCallback(\n    (id: string, item: T, options?: MutateOptions<T>) => {\n      const cb: MutateOptions<T>['callback'] = (node, treecb) => {\n        options?.callback?.(node, treecb);\n        setHash(treecb.hash);\n      };\n      return tree.replaceNode(id, item, { ...options, callback: cb });\n    },\n    [tree],\n  );\n\n  return {\n    hash,\n    getRoot: tree.getRoot,\n    getNode: tree.getNode,\n    walk: tree.walk,\n    walkParents: tree.walkParents,\n    findNode: tree.findNode,\n    findAllNodes: tree.findAllNodes,\n    flatten: tree.flatten,\n    addNode,\n    removeNode,\n    moveNode,\n    replaceNode,\n    getPath: tree.getPath,\n    getPathIds: tree.getPathIds,\n  };\n};\n", "import * as React from 'react';\nexport { React };\n"],
+  "sourcesContent": ["import { useCallback, useMemo, useState } from 'react';\nimport { DSTree } from './DSTree.js';\nimport type { AddOptions, Item, MoveOptions, MutateOptions, RemoveOptions } from './types.js';\n\nexport const useDSTree = <T extends Item>(rootItem: T, opts: { getUniqueId: (item: T) => string }) => {\n  const tree = useMemo(() => new DSTree(rootItem, opts), [opts, rootItem]);\n  const [hash, setHash] = useState(tree.hash);\n\n  const addNode = useCallback(\n    (item: T, options?: AddOptions<T>) => {\n      const cb: AddOptions<T>['callback'] = (node, treecb) => {\n        options?.callback?.(node, treecb);\n        setHash(treecb.hash);\n      };\n      return tree.addNode(item, { ...options, callback: cb });\n    },\n    [tree],\n  );\n\n  const removeNode = useCallback(\n    (id: string, options?: RemoveOptions<T>) => {\n      const cb: RemoveOptions<T>['callback'] = (node, treecb) => {\n        options?.callback?.(node, treecb);\n        setHash(treecb.hash);\n      };\n      return tree.removeNode(id, { ...options, callback: cb });\n    },\n    [tree],\n  );\n\n  const moveNode = useCallback(\n    (id: string, options?: MoveOptions<T>) => {\n      const cb: MoveOptions<T>['callback'] = (node, treecb) => {\n        options?.callback?.(node, treecb);\n        setHash(treecb.hash);\n      };\n      return tree.moveNode(id, { ...options, callback: cb });\n    },\n    [tree],\n  );\n\n  const replaceNode = useCallback(\n    (id: string, item: T, options?: MutateOptions<T>) => {\n      const cb: MutateOptions<T>['callback'] = (node, treecb) => {\n        options?.callback?.(node, treecb);\n        setHash(treecb.hash);\n      };\n      return tree.replaceNode(id, item, { ...options, callback: cb });\n    },\n    [tree],\n  );\n\n  return {\n    hash,\n    getRoot: tree.getRoot,\n    getNode: tree.getNode,\n    walk: tree.walk,\n    walkParents: tree.walkParents,\n    findNode: tree.findNode,\n    findAllNodes: tree.findAllNodes,\n    flatten: tree.flatten,\n    addNode,\n    removeNode,\n    moveNode,\n    replaceNode,\n    getPath: tree.getPath,\n    getPathIds: tree.getPathIds,\n  };\n};\n", "import * as React from 'react';\nexport { React };\n"],
   "mappings": ";;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;ACAA,YAAuB;ADAvB,mBAA+C;AAC/C,oBAAuB;AAGhB,MAAM,YAAY,CAAiB,UAAa,SAA+C;AACpG,QAAM,WAAO,sBAAQ,MAAM,IAAI,qBAAO,UAAU,IAAI,GAAG,CAAC,MAAM,QAAQ,CAAC;AACvE,QAAM,CAAC,MAAM,OAAO,QAAI,uBAAS,KAAK,IAAI;AAE1C,QAAM,cAAU;AAAA,IACd,CAAC,MAAS,YAA4B;AACpC,YAAM,KAAgC,CAAC,MAAM,WAAW;AACtD,iBAAS,WAAW,MAAM,MAAM;AAChC,gBAAQ,OAAO,IAAI;AAAA,MACrB;AACA,aAAO,KAAK,QAAQ,MAAM,EAAE,GAAG,SAAS,UAAU,GAAG,CAAC;AAAA,IACxD;AAAA,IACA,CAAC,IAAI;AAAA,EACP;AAEA,QAAM,iBAAa;AAAA,IACjB,CAAC,IAAY,YAA+B;AAC1C,YAAM,KAAmC,CAAC,MAAM,WAAW;AACzD,iBAAS,WAAW,MAAM,MAAM;AAChC,gBAAQ,OAAO,IAAI;AAAA,MACrB;AACA,aAAO,KAAK,WAAW,IAAI,EAAE,GAAG,SAAS,UAAU,GAAG,CAAC;AAAA,IACzD;AAAA,IACA,CAAC,IAAI;AAAA,EACP;AAEA,QAAM,eAAW;AAAA,IACf,CAAC,IAAY,YAA6B;AACxC,YAAM,KAAiC,CAAC,MAAM,WAAW;AACvD,iBAAS,WAAW,MAAM,MAAM;AAChC,gBAAQ,OAAO,IAAI;AAAA,MACrB;AACA,aAAO,KAAK,SAAS,IAAI,EAAE,GAAG,SAAS,UAAU,GAAG,CAAC;AAAA,IACvD;AAAA,IACA,CAAC,IAAI;AAAA,EACP;AAEA,QAAM,kBAAc;AAAA,IAClB,CAAC,IAAY,MAAS,YAA+B;AACnD,YAAM,KAAmC,CAAC,MAAM,WAAW;AACzD,iBAAS,WAAW,MAAM,MAAM;AAChC,gBAAQ,OAAO,IAAI;AAAA,MACrB;AACA,aAAO,KAAK,YAAY,IAAI,MAAM,EAAE,GAAG,SAAS,UAAU,GAAG,CAAC;AAAA,IAChE;AAAA,IACA,CAAC,IAAI;AAAA,EACP;AAEA,SAAO;AAAA,IACL;AAAA,IACA,SAAS,KAAK;AAAA,IACd,SAAS,KAAK;AAAA,IACd,MAAM,KAAK;AAAA,IACX,aAAa,KAAK;AAAA,IAClB,UAAU,KAAK;AAAA,IACf,cAAc,KAAK;AAAA,IACnB,SAAS,KAAK;AAAA,IACd;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,SAAS,KAAK;AAAA,IACd,YAAY,KAAK;AAAA,EACnB;AACF;",
   "names": []
 }

package/dist/esm/DSTree.js

@@ -1,5 +1,5 @@
 import * as React from "react";
-import { Node } from "./Node";
+import { Node } from "./Node.js";
 class DSTree {
   constructor(item, options) {
     this.getRoot = () => this.root;

package/dist/esm/DSTree.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../scripts/build/transpile/react-shim.js", "../../src/DSTree.ts"],
-  "sourcesContent": ["import * as React from 'react';\nexport { React };\n", "import type { AddOptions, Item, MoveOptions, MutateOptions, RemoveOptions } from './types';\nimport { Node } from './Node';\n\nexport class DSTree<T extends Item> {\n  private root: Node<T>;\n\n  private _hash: number;\n\n  private nodes: Record<string, Node<T>>;\n\n  getUniqueId: (item: T) => string;\n\n  constructor(item: T, options: { getUniqueId: (item: T) => string }) {\n    this.getUniqueId = options.getUniqueId;\n    this.root = new Node(item, { childIndex: 0, depth: 0, tree: this });\n    this.nodes = {};\n    this._hash = 0;\n\n    // autocalculate a dictionary where dsId are keys and nodes are values\n    // and add the tree link to each node\n    this.root.walk((node) => {\n      this.nodes[node.dsId] = node;\n      return true;\n    });\n  }\n\n  addNodeToNodesDictionary(node: Node<T>): void {\n    // check that we have no repeated ids\n    if (this.nodes[node.dsId]) {\n      throw new Error(`DSTree: repeated dsId ${node.dsId}`);\n    }\n\n    this.nodes[node.dsId] = node;\n  }\n\n  removeNodeFromNodesDictionary(node: Node<T>): void {\n    delete this.nodes[node.dsId];\n  }\n\n  get hash(): number {\n    return this._hash;\n  }\n\n  getRoot = (): Node<T> => this.root;\n\n  getNode = (id: string): Node<T> => this.nodes[id];\n\n  getNodes = (): Record<string, Node<T>> => this.nodes;\n\n  walk = (callback: (node: Node<T>) => boolean): void => {\n    this.root.walk(callback);\n  };\n\n  walkParents = (callback: (node: Node<T>) => boolean): void => {\n    this.root.walkParents(callback);\n  };\n\n  findNode = (callback: (node: Node<T>) => boolean): Node<T> | null => this.root.findNode(callback);\n\n  findAllNodes = (callback: (node: Node<T>) => boolean): Node<T>[] => this.root.findAllNodes(callback);\n\n  flatten = (): Node<T>[] => this.root.flatten();\n\n  addNode = (item: T, options: AddOptions<T> = {}): Node<T> => {\n    const { position, parent, callback } = options;\n    const parentDefault = parent || this.root;\n    const positionDefault = position ?? parentDefault.children.length;\n\n    // create node and add it to the parent\n    const node = new Node(item, {\n      childIndex: positionDefault,\n      depth: parentDefault.depth + 1,\n      parent: parentDefault,\n      tree: this,\n    });\n    this.getNode(parentDefault.dsId).addNode(node);\n\n    // change hash\n    this._hash += 1;\n\n    // invoke the callback if present\n    callback?.(node, this);\n\n    return node;\n  };\n\n  removeNode = (id: string, options: RemoveOptions<T> = {}): Node<T> => {\n    const node = this.getNode(id);\n    if (!node) throw new Error(`Node with id ${id} not found`);\n\n    node.removeNode();\n\n    // change hash\n    this._hash += 1;\n\n    // invoke the callback if present\n    options.callback?.(node, this);\n\n    return node;\n  };\n\n  moveNode = (id: string, options: MoveOptions<T> = {}): Node<T> => {\n    const removedNode = this.removeNode(id);\n    const node = this.addNode(removedNode.getJson(), options);\n\n    this._hash += 1;\n\n    return node;\n  };\n\n  replaceNode = (id: string, item: T, options: MutateOptions<T> = {}): Node<T> => {\n    const removedNode = this.removeNode(id);\n    const node = this.addNode(item, { parent: removedNode.parent, position: removedNode.childIndex });\n\n    this._hash += 1;\n\n    // invoke the callback if present\n    options.callback?.(node, this);\n\n    return node;\n  };\n\n  getPath = (id: string): Node<T>[] => this.getRoot().getPath(id);\n\n  getPathIds = (id: string): string[] => this.getRoot().getPathIds(id);\n}\n"],
+  "sourcesContent": ["import * as React from 'react';\nexport { React };\n", "import type { AddOptions, Item, MoveOptions, MutateOptions, RemoveOptions } from './types.js';\nimport { Node } from './Node.js';\n\nexport class DSTree<T extends Item> {\n  private root: Node<T>;\n\n  private _hash: number;\n\n  private nodes: Record<string, Node<T>>;\n\n  getUniqueId: (item: T) => string;\n\n  constructor(item: T, options: { getUniqueId: (item: T) => string }) {\n    this.getUniqueId = options.getUniqueId;\n    this.root = new Node(item, { childIndex: 0, depth: 0, tree: this });\n    this.nodes = {};\n    this._hash = 0;\n\n    // autocalculate a dictionary where dsId are keys and nodes are values\n    // and add the tree link to each node\n    this.root.walk((node) => {\n      this.nodes[node.dsId] = node;\n      return true;\n    });\n  }\n\n  addNodeToNodesDictionary(node: Node<T>): void {\n    // check that we have no repeated ids\n    if (this.nodes[node.dsId]) {\n      throw new Error(`DSTree: repeated dsId ${node.dsId}`);\n    }\n\n    this.nodes[node.dsId] = node;\n  }\n\n  removeNodeFromNodesDictionary(node: Node<T>): void {\n    delete this.nodes[node.dsId];\n  }\n\n  get hash(): number {\n    return this._hash;\n  }\n\n  getRoot = (): Node<T> => this.root;\n\n  getNode = (id: string): Node<T> => this.nodes[id];\n\n  getNodes = (): Record<string, Node<T>> => this.nodes;\n\n  walk = (callback: (node: Node<T>) => boolean): void => {\n    this.root.walk(callback);\n  };\n\n  walkParents = (callback: (node: Node<T>) => boolean): void => {\n    this.root.walkParents(callback);\n  };\n\n  findNode = (callback: (node: Node<T>) => boolean): Node<T> | null => this.root.findNode(callback);\n\n  findAllNodes = (callback: (node: Node<T>) => boolean): Node<T>[] => this.root.findAllNodes(callback);\n\n  flatten = (): Node<T>[] => this.root.flatten();\n\n  addNode = (item: T, options: AddOptions<T> = {}): Node<T> => {\n    const { position, parent, callback } = options;\n    const parentDefault = parent || this.root;\n    const positionDefault = position ?? parentDefault.children.length;\n\n    // create node and add it to the parent\n    const node = new Node(item, {\n      childIndex: positionDefault,\n      depth: parentDefault.depth + 1,\n      parent: parentDefault,\n      tree: this,\n    });\n    this.getNode(parentDefault.dsId).addNode(node);\n\n    // change hash\n    this._hash += 1;\n\n    // invoke the callback if present\n    callback?.(node, this);\n\n    return node;\n  };\n\n  removeNode = (id: string, options: RemoveOptions<T> = {}): Node<T> => {\n    const node = this.getNode(id);\n    if (!node) throw new Error(`Node with id ${id} not found`);\n\n    node.removeNode();\n\n    // change hash\n    this._hash += 1;\n\n    // invoke the callback if present\n    options.callback?.(node, this);\n\n    return node;\n  };\n\n  moveNode = (id: string, options: MoveOptions<T> = {}): Node<T> => {\n    const removedNode = this.removeNode(id);\n    const node = this.addNode(removedNode.getJson(), options);\n\n    this._hash += 1;\n\n    return node;\n  };\n\n  replaceNode = (id: string, item: T, options: MutateOptions<T> = {}): Node<T> => {\n    const removedNode = this.removeNode(id);\n    const node = this.addNode(item, { parent: removedNode.parent, position: removedNode.childIndex });\n\n    this._hash += 1;\n\n    // invoke the callback if present\n    options.callback?.(node, this);\n\n    return node;\n  };\n\n  getPath = (id: string): Node<T>[] => this.getRoot().getPath(id);\n\n  getPathIds = (id: string): string[] => this.getRoot().getPathIds(id);\n}\n"],
   "mappings": "AAAA,YAAY,WAAW;ACCvB,SAAS,YAAY;AAEd,MAAM,OAAuB;AAAA,EASlC,YAAY,MAAS,SAA+C;AA+BpE,mBAAU,MAAe,KAAK;AAE9B,mBAAU,CAAC,OAAwB,KAAK,MAAM;AAE9C,oBAAW,MAA+B,KAAK;AAE/C,gBAAO,CAAC,aAA+C;AACrD,WAAK,KAAK,KAAK,QAAQ;AAAA,IACzB;AAEA,uBAAc,CAAC,aAA+C;AAC5D,WAAK,KAAK,YAAY,QAAQ;AAAA,IAChC;AAEA,oBAAW,CAAC,aAAyD,KAAK,KAAK,SAAS,QAAQ;AAEhG,wBAAe,CAAC,aAAoD,KAAK,KAAK,aAAa,QAAQ;AAEnG,mBAAU,MAAiB,KAAK,KAAK,QAAQ;AAE7C,mBAAU,CAAC,MAAS,UAAyB,CAAC,MAAe;AAC3D,YAAM,EAAE,UAAU,QAAQ,SAAS,IAAI;AACvC,YAAM,gBAAgB,UAAU,KAAK;AACrC,YAAM,kBAAkB,YAAY,cAAc,SAAS;AAG3D,YAAM,OAAO,IAAI,KAAK,MAAM;AAAA,QAC1B,YAAY;AAAA,QACZ,OAAO,cAAc,QAAQ;AAAA,QAC7B,QAAQ;AAAA,QACR,MAAM;AAAA,MACR,CAAC;AACD,WAAK,QAAQ,cAAc,IAAI,EAAE,QAAQ,IAAI;AAG7C,WAAK,SAAS;AAGd,iBAAW,MAAM,IAAI;AAErB,aAAO;AAAA,IACT;AAEA,sBAAa,CAAC,IAAY,UAA4B,CAAC,MAAe;AACpE,YAAM,OAAO,KAAK,QAAQ,EAAE;AAC5B,UAAI,CAAC;AAAM,cAAM,IAAI,MAAM,gBAAgB,cAAc;AAEzD,WAAK,WAAW;AAGhB,WAAK,SAAS;AAGd,cAAQ,WAAW,MAAM,IAAI;AAE7B,aAAO;AAAA,IACT;AAEA,oBAAW,CAAC,IAAY,UAA0B,CAAC,MAAe;AAChE,YAAM,cAAc,KAAK,WAAW,EAAE;AACtC,YAAM,OAAO,KAAK,QAAQ,YAAY,QAAQ,GAAG,OAAO;AAExD,WAAK,SAAS;AAEd,aAAO;AAAA,IACT;AAEA,uBAAc,CAAC,IAAY,MAAS,UAA4B,CAAC,MAAe;AAC9E,YAAM,cAAc,KAAK,WAAW,EAAE;AACtC,YAAM,OAAO,KAAK,QAAQ,MAAM,EAAE,QAAQ,YAAY,QAAQ,UAAU,YAAY,WAAW,CAAC;AAEhG,WAAK,SAAS;AAGd,cAAQ,WAAW,MAAM,IAAI;AAE7B,aAAO;AAAA,IACT;AAEA,mBAAU,CAAC,OAA0B,KAAK,QAAQ,EAAE,QAAQ,EAAE;AAE9D,sBAAa,CAAC,OAAyB,KAAK,QAAQ,EAAE,WAAW,EAAE;AA/GjE,SAAK,cAAc,QAAQ;AAC3B,SAAK,OAAO,IAAI,KAAK,MAAM,EAAE,YAAY,GAAG,OAAO,GAAG,MAAM,KAAK,CAAC;AAClE,SAAK,QAAQ,CAAC;AACd,SAAK,QAAQ;AAIb,SAAK,KAAK,KAAK,CAAC,SAAS;AACvB,WAAK,MAAM,KAAK,QAAQ;AACxB,aAAO;AAAA,IACT,CAAC;AAAA,EACH;AAAA,EAEA,yBAAyB,MAAqB;AAE5C,QAAI,KAAK,MAAM,KAAK,OAAO;AACzB,YAAM,IAAI,MAAM,yBAAyB,KAAK,MAAM;AAAA,IACtD;AAEA,SAAK,MAAM,KAAK,QAAQ;AAAA,EAC1B;AAAA,EAEA,8BAA8B,MAAqB;AACjD,WAAO,KAAK,MAAM,KAAK;AAAA,EACzB;AAAA,EAEA,IAAI,OAAe;AACjB,WAAO,KAAK;AAAA,EACd;AAoFF;",
   "names": []
 }

package/dist/esm/Node.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../scripts/build/transpile/react-shim.js", "../../src/Node.ts"],
-  "sourcesContent": ["import * as React from 'react';\nexport { React };\n", "/* eslint-disable no-use-before-define */\n/* eslint-disable max-params */\nimport { cloneDeep, omit } from 'lodash';\nimport type { DSTree } from './DSTree';\nimport type { Item, NodeConstructorOptions } from './types';\n\nexport class Node<T extends Item> {\n  dsId: string;\n\n  plainItem: T;\n\n  childIndex: number;\n\n  depth: number;\n\n  parent: Node<T> | null;\n\n  children: Node<T>[];\n\n  private tree!: DSTree<T>;\n\n  private _hash: number;\n\n  constructor(item: T, { childIndex, depth, parent, tree }: NodeConstructorOptions<T>) {\n    this.dsId = tree.getUniqueId(item);\n    this.childIndex = childIndex;\n    this.depth = depth;\n    this.parent = parent ?? null;\n    this.tree = tree;\n    this._hash = 0;\n\n    this.children =\n      item.subitems?.map(\n        (subitem, index) => new Node(subitem as T, { childIndex: index, depth: depth + 1, parent: this, tree }),\n      ) ?? [];\n\n    // Save the item without the subitems\n    this.plainItem = this.getCleanItem(item);\n  }\n\n  // ===========================================================================\n  // INTERNAL METHODS\n  // ===========================================================================\n\n  fixChildIndexes = (): void => {\n    for (let i = 0; i < this.children.length; i++) {\n      this.children[i].childIndex = i;\n    }\n    this._hash += 1;\n  };\n\n  getCleanItem = (item: T): T => {\n    const plainItem = omit(item, ['subitems']);\n    return cloneDeep(plainItem as T);\n  };\n\n  // ===========================================================================\n  // READ METHODS\n  // ===========================================================================\n\n  get hash(): number {\n    return this._hash;\n  }\n\n  walk = (callback: (node: Node<T>) => boolean): void => {\n    const shouldContinueWalking = callback(this);\n    if (shouldContinueWalking) {\n      for (const child of this.children) {\n        child.walk(callback);\n      }\n    }\n  };\n\n  walkParents = (callback: (node: Node<T>) => boolean): void => {\n    const shouldContinueWalking = callback(this);\n    if (shouldContinueWalking && this.parent) {\n      this.parent.walkParents(callback);\n    }\n  };\n\n  findNode = (callback: (node: Node<T>) => boolean): Node<T> | null => {\n    // find first node using walk\n    let found: Node<T> | null = null;\n    this.walk((node) => {\n      // If we already found it, don't look anymore\n      if (found) return false;\n\n      // Otherwise keep looking\n      if (callback(node)) found = node;\n      return !found;\n    });\n\n    return found;\n  };\n\n  findAllNodes = (callback: (node: Node<T>) => boolean): Node<T>[] => {\n    const found: Node<T>[] = [];\n    this.walk((node) => {\n      if (callback(node)) found.push(node);\n      return true;\n    });\n    return found;\n  };\n\n  flatten = (): Node<T>[] => {\n    const flattened: Node<T>[] = [];\n    this.walk((node) => {\n      flattened.push(node);\n      return true;\n    });\n    return flattened;\n  };\n\n  getPath = (id: string): Node<T>[] => {\n    const path: Node<T>[] = [];\n    const node = this.tree.getNode(id);\n    if (!node) return path;\n    node.walkParents((parent) => {\n      path.push(parent);\n      return parent.dsId !== this.dsId;\n    });\n    return path.reverse();\n  };\n\n  getPathIds = (id: string): string[] => this.getPath(id).map((node) => node.dsId);\n\n  getJson = (): T => ({\n    ...this.plainItem,\n    subitems: this.children.map((child) => child.getJson()),\n  });\n\n  // ===========================================================================\n  // WRITE METHODS\n  // ===========================================================================\n\n  addNode = (node: Node<T>) => {\n    // check that the position is valid for that parent\n    const position = node.childIndex;\n    if (position < 0 || position > this.children.length) {\n      throw new Error(`Invalid position ${position} for parent ${this.dsId} with item ${node.dsId}`);\n    }\n\n    // add the new node\n    this.children.splice(position, 0, node);\n\n    // fix the childIndex of the nodes after the new one\n    this.fixChildIndexes();\n\n    // add subtree of the new node to the node dictionary\n    node.walk((child) => {\n      this.tree.addNodeToNodesDictionary(child);\n      return true;\n    });\n\n    this._hash += 1;\n  };\n\n  removeNode = () => {\n    // if no parent throw error\n    if (!this.parent) throw new Error(`Cannot remove root node with id ${this.dsId}`);\n\n    // remove from parent\n    this.parent.children.splice(this.childIndex, 1);\n\n    // fix the childIndex of the nodes of the parent\n    this.parent.fixChildIndexes();\n\n    // remove subtree from the node dictionary\n    this.walk((child) => {\n      this.tree.removeNodeFromNodesDictionary(child);\n      return true;\n    });\n\n    this._hash += 1;\n  };\n}\n"],
+  "sourcesContent": ["import * as React from 'react';\nexport { React };\n", "/* eslint-disable no-use-before-define */\n/* eslint-disable max-params */\nimport { cloneDeep, omit } from 'lodash';\nimport type { DSTree } from './DSTree.js';\nimport type { Item, NodeConstructorOptions } from './types.js';\n\nexport class Node<T extends Item> {\n  dsId: string;\n\n  plainItem: T;\n\n  childIndex: number;\n\n  depth: number;\n\n  parent: Node<T> | null;\n\n  children: Node<T>[];\n\n  private tree!: DSTree<T>;\n\n  private _hash: number;\n\n  constructor(item: T, { childIndex, depth, parent, tree }: NodeConstructorOptions<T>) {\n    this.dsId = tree.getUniqueId(item);\n    this.childIndex = childIndex;\n    this.depth = depth;\n    this.parent = parent ?? null;\n    this.tree = tree;\n    this._hash = 0;\n\n    this.children =\n      item.subitems?.map(\n        (subitem, index) => new Node(subitem as T, { childIndex: index, depth: depth + 1, parent: this, tree }),\n      ) ?? [];\n\n    // Save the item without the subitems\n    this.plainItem = this.getCleanItem(item);\n  }\n\n  // ===========================================================================\n  // INTERNAL METHODS\n  // ===========================================================================\n\n  fixChildIndexes = (): void => {\n    for (let i = 0; i < this.children.length; i++) {\n      this.children[i].childIndex = i;\n    }\n    this._hash += 1;\n  };\n\n  getCleanItem = (item: T): T => {\n    const plainItem = omit(item, ['subitems']);\n    return cloneDeep(plainItem as T);\n  };\n\n  // ===========================================================================\n  // READ METHODS\n  // ===========================================================================\n\n  get hash(): number {\n    return this._hash;\n  }\n\n  walk = (callback: (node: Node<T>) => boolean): void => {\n    const shouldContinueWalking = callback(this);\n    if (shouldContinueWalking) {\n      for (const child of this.children) {\n        child.walk(callback);\n      }\n    }\n  };\n\n  walkParents = (callback: (node: Node<T>) => boolean): void => {\n    const shouldContinueWalking = callback(this);\n    if (shouldContinueWalking && this.parent) {\n      this.parent.walkParents(callback);\n    }\n  };\n\n  findNode = (callback: (node: Node<T>) => boolean): Node<T> | null => {\n    // find first node using walk\n    let found: Node<T> | null = null;\n    this.walk((node) => {\n      // If we already found it, don't look anymore\n      if (found) return false;\n\n      // Otherwise keep looking\n      if (callback(node)) found = node;\n      return !found;\n    });\n\n    return found;\n  };\n\n  findAllNodes = (callback: (node: Node<T>) => boolean): Node<T>[] => {\n    const found: Node<T>[] = [];\n    this.walk((node) => {\n      if (callback(node)) found.push(node);\n      return true;\n    });\n    return found;\n  };\n\n  flatten = (): Node<T>[] => {\n    const flattened: Node<T>[] = [];\n    this.walk((node) => {\n      flattened.push(node);\n      return true;\n    });\n    return flattened;\n  };\n\n  getPath = (id: string): Node<T>[] => {\n    const path: Node<T>[] = [];\n    const node = this.tree.getNode(id);\n    if (!node) return path;\n    node.walkParents((parent) => {\n      path.push(parent);\n      return parent.dsId !== this.dsId;\n    });\n    return path.reverse();\n  };\n\n  getPathIds = (id: string): string[] => this.getPath(id).map((node) => node.dsId);\n\n  getJson = (): T => ({\n    ...this.plainItem,\n    subitems: this.children.map((child) => child.getJson()),\n  });\n\n  // ===========================================================================\n  // WRITE METHODS\n  // ===========================================================================\n\n  addNode = (node: Node<T>) => {\n    // check that the position is valid for that parent\n    const position = node.childIndex;\n    if (position < 0 || position > this.children.length) {\n      throw new Error(`Invalid position ${position} for parent ${this.dsId} with item ${node.dsId}`);\n    }\n\n    // add the new node\n    this.children.splice(position, 0, node);\n\n    // fix the childIndex of the nodes after the new one\n    this.fixChildIndexes();\n\n    // add subtree of the new node to the node dictionary\n    node.walk((child) => {\n      this.tree.addNodeToNodesDictionary(child);\n      return true;\n    });\n\n    this._hash += 1;\n  };\n\n  removeNode = () => {\n    // if no parent throw error\n    if (!this.parent) throw new Error(`Cannot remove root node with id ${this.dsId}`);\n\n    // remove from parent\n    this.parent.children.splice(this.childIndex, 1);\n\n    // fix the childIndex of the nodes of the parent\n    this.parent.fixChildIndexes();\n\n    // remove subtree from the node dictionary\n    this.walk((child) => {\n      this.tree.removeNodeFromNodesDictionary(child);\n      return true;\n    });\n\n    this._hash += 1;\n  };\n}\n"],
   "mappings": "AAAA,YAAY,WAAW;ACEvB,SAAS,WAAW,YAAY;AAIzB,MAAM,KAAqB;AAAA,EAiBhC,YAAY,MAAS,EAAE,YAAY,OAAO,QAAQ,KAAK,GAA8B;AAqBrF,2BAAkB,MAAY;AAC5B,eAAS,IAAI,GAAG,IAAI,KAAK,SAAS,QAAQ,KAAK;AAC7C,aAAK,SAAS,GAAG,aAAa;AAAA,MAChC;AACA,WAAK,SAAS;AAAA,IAChB;AAEA,wBAAe,CAAC,SAAe;AAC7B,YAAM,YAAY,KAAK,MAAM,CAAC,UAAU,CAAC;AACzC,aAAO,UAAU,SAAc;AAAA,IACjC;AAUA,gBAAO,CAAC,aAA+C;AACrD,YAAM,wBAAwB,SAAS,IAAI;AAC3C,UAAI,uBAAuB;AACzB,mBAAW,SAAS,KAAK,UAAU;AACjC,gBAAM,KAAK,QAAQ;AAAA,QACrB;AAAA,MACF;AAAA,IACF;AAEA,uBAAc,CAAC,aAA+C;AAC5D,YAAM,wBAAwB,SAAS,IAAI;AAC3C,UAAI,yBAAyB,KAAK,QAAQ;AACxC,aAAK,OAAO,YAAY,QAAQ;AAAA,MAClC;AAAA,IACF;AAEA,oBAAW,CAAC,aAAyD;AAEnE,UAAI,QAAwB;AAC5B,WAAK,KAAK,CAAC,SAAS;AAElB,YAAI;AAAO,iBAAO;AAGlB,YAAI,SAAS,IAAI;AAAG,kBAAQ;AAC5B,eAAO,CAAC;AAAA,MACV,CAAC;AAED,aAAO;AAAA,IACT;AAEA,wBAAe,CAAC,aAAoD;AAClE,YAAM,QAAmB,CAAC;AAC1B,WAAK,KAAK,CAAC,SAAS;AAClB,YAAI,SAAS,IAAI;AAAG,gBAAM,KAAK,IAAI;AACnC,eAAO;AAAA,MACT,CAAC;AACD,aAAO;AAAA,IACT;AAEA,mBAAU,MAAiB;AACzB,YAAM,YAAuB,CAAC;AAC9B,WAAK,KAAK,CAAC,SAAS;AAClB,kBAAU,KAAK,IAAI;AACnB,eAAO;AAAA,MACT,CAAC;AACD,aAAO;AAAA,IACT;AAEA,mBAAU,CAAC,OAA0B;AACnC,YAAM,OAAkB,CAAC;AACzB,YAAM,OAAO,KAAK,KAAK,QAAQ,EAAE;AACjC,UAAI,CAAC;AAAM,eAAO;AAClB,WAAK,YAAY,CAAC,WAAW;AAC3B,aAAK,KAAK,MAAM;AAChB,eAAO,OAAO,SAAS,KAAK;AAAA,MAC9B,CAAC;AACD,aAAO,KAAK,QAAQ;AAAA,IACtB;AAEA,sBAAa,CAAC,OAAyB,KAAK,QAAQ,EAAE,EAAE,IAAI,CAAC,SAAS,KAAK,IAAI;AAE/E,mBAAU,OAAU;AAAA,MAClB,GAAG,KAAK;AAAA,MACR,UAAU,KAAK,SAAS,IAAI,CAAC,UAAU,MAAM,QAAQ,CAAC;AAAA,IACxD;AAMA,mBAAU,CAAC,SAAkB;AAE3B,YAAM,WAAW,KAAK;AACtB,UAAI,WAAW,KAAK,WAAW,KAAK,SAAS,QAAQ;AACnD,cAAM,IAAI,MAAM,oBAAoB,uBAAuB,KAAK,kBAAkB,KAAK,MAAM;AAAA,MAC/F;AAGA,WAAK,SAAS,OAAO,UAAU,GAAG,IAAI;AAGtC,WAAK,gBAAgB;AAGrB,WAAK,KAAK,CAAC,UAAU;AACnB,aAAK,KAAK,yBAAyB,KAAK;AACxC,eAAO;AAAA,MACT,CAAC;AAED,WAAK,SAAS;AAAA,IAChB;AAEA,sBAAa,MAAM;AAEjB,UAAI,CAAC,KAAK;AAAQ,cAAM,IAAI,MAAM,mCAAmC,KAAK,MAAM;AAGhF,WAAK,OAAO,SAAS,OAAO,KAAK,YAAY,CAAC;AAG9C,WAAK,OAAO,gBAAgB;AAG5B,WAAK,KAAK,CAAC,UAAU;AACnB,aAAK,KAAK,8BAA8B,KAAK;AAC7C,eAAO;AAAA,MACT,CAAC;AAED,WAAK,SAAS;AAAA,IAChB;AAtJE,SAAK,OAAO,KAAK,YAAY,IAAI;AACjC,SAAK,aAAa;AAClB,SAAK,QAAQ;AACb,SAAK,SAAS,UAAU;AACxB,SAAK,OAAO;AACZ,SAAK,QAAQ;AAEb,SAAK,WACH,KAAK,UAAU;AAAA,MACb,CAAC,SAAS,UAAU,IAAI,KAAK,SAAc,EAAE,YAAY,OAAO,OAAO,QAAQ,GAAG,QAAQ,MAAM,KAAK,CAAC;AAAA,IACxG,KAAK,CAAC;AAGR,SAAK,YAAY,KAAK,aAAa,IAAI;AAAA,EACzC;AAAA,EAsBA,IAAI,OAAe;AACjB,WAAO,KAAK;AAAA,EACd;AAiHF;",
   "names": []
 }

package/dist/esm/index.js

@@ -1,6 +1,6 @@
 import * as React from "react";
-import { DSTree } from "./DSTree";
-import { useDSTree } from "./useDSTree";
+import { DSTree } from "./DSTree.js";
+import { useDSTree } from "./useDSTree.js";
 export {
   DSTree,
   useDSTree

package/dist/esm/index.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../scripts/build/transpile/react-shim.js", "../../src/index.ts"],
-  "sourcesContent": ["import * as React from 'react';\nexport { React };\n", "export type { Item } from './types';\nexport { DSTree } from './DSTree';\nexport { useDSTree } from './useDSTree';\n"],
+  "sourcesContent": ["import * as React from 'react';\nexport { React };\n", "export type { Item } from './types.js';\nexport { DSTree } from './DSTree.js';\nexport { useDSTree } from './useDSTree.js';\n"],
   "mappings": "AAAA,YAAY,WAAW;ACCvB,SAAS,cAAc;AACvB,SAAS,iBAAiB;",
   "names": []
 }

package/dist/esm/package.json

@@ -0,0 +1,7 @@
+{
+  "type": "module",
+  "sideEffects": [
+    "*.css",
+    "*.scss"
+  ]
+}

package/dist/esm/useDSTree.js

@@ -1,6 +1,6 @@
 import * as React from "react";
 import { useCallback, useMemo, useState } from "react";
-import { DSTree } from "./DSTree";
+import { DSTree } from "./DSTree.js";
 const useDSTree = (rootItem, opts) => {
   const tree = useMemo(() => new DSTree(rootItem, opts), [opts, rootItem]);
   const [hash, setHash] = useState(tree.hash);

package/dist/esm/useDSTree.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../../../../scripts/build/transpile/react-shim.js", "../../src/useDSTree.ts"],
-  "sourcesContent": ["import * as React from 'react';\nexport { React };\n", "import { useCallback, useMemo, useState } from 'react';\nimport { DSTree } from './DSTree';\nimport type { AddOptions, Item, MoveOptions, MutateOptions, RemoveOptions } from './types';\n\nexport const useDSTree = <T extends Item>(rootItem: T, opts: { getUniqueId: (item: T) => string }) => {\n  const tree = useMemo(() => new DSTree(rootItem, opts), [opts, rootItem]);\n  const [hash, setHash] = useState(tree.hash);\n\n  const addNode = useCallback(\n    (item: T, options?: AddOptions<T>) => {\n      const cb: AddOptions<T>['callback'] = (node, treecb) => {\n        options?.callback?.(node, treecb);\n        setHash(treecb.hash);\n      };\n      return tree.addNode(item, { ...options, callback: cb });\n    },\n    [tree],\n  );\n\n  const removeNode = useCallback(\n    (id: string, options?: RemoveOptions<T>) => {\n      const cb: RemoveOptions<T>['callback'] = (node, treecb) => {\n        options?.callback?.(node, treecb);\n        setHash(treecb.hash);\n      };\n      return tree.removeNode(id, { ...options, callback: cb });\n    },\n    [tree],\n  );\n\n  const moveNode = useCallback(\n    (id: string, options?: MoveOptions<T>) => {\n      const cb: MoveOptions<T>['callback'] = (node, treecb) => {\n        options?.callback?.(node, treecb);\n        setHash(treecb.hash);\n      };\n      return tree.moveNode(id, { ...options, callback: cb });\n    },\n    [tree],\n  );\n\n  const replaceNode = useCallback(\n    (id: string, item: T, options?: MutateOptions<T>) => {\n      const cb: MutateOptions<T>['callback'] = (node, treecb) => {\n        options?.callback?.(node, treecb);\n        setHash(treecb.hash);\n      };\n      return tree.replaceNode(id, item, { ...options, callback: cb });\n    },\n    [tree],\n  );\n\n  return {\n    hash,\n    getRoot: tree.getRoot,\n    getNode: tree.getNode,\n    walk: tree.walk,\n    walkParents: tree.walkParents,\n    findNode: tree.findNode,\n    findAllNodes: tree.findAllNodes,\n    flatten: tree.flatten,\n    addNode,\n    removeNode,\n    moveNode,\n    replaceNode,\n    getPath: tree.getPath,\n    getPathIds: tree.getPathIds,\n  };\n};\n"],
+  "sourcesContent": ["import * as React from 'react';\nexport { React };\n", "import { useCallback, useMemo, useState } from 'react';\nimport { DSTree } from './DSTree.js';\nimport type { AddOptions, Item, MoveOptions, MutateOptions, RemoveOptions } from './types.js';\n\nexport const useDSTree = <T extends Item>(rootItem: T, opts: { getUniqueId: (item: T) => string }) => {\n  const tree = useMemo(() => new DSTree(rootItem, opts), [opts, rootItem]);\n  const [hash, setHash] = useState(tree.hash);\n\n  const addNode = useCallback(\n    (item: T, options?: AddOptions<T>) => {\n      const cb: AddOptions<T>['callback'] = (node, treecb) => {\n        options?.callback?.(node, treecb);\n        setHash(treecb.hash);\n      };\n      return tree.addNode(item, { ...options, callback: cb });\n    },\n    [tree],\n  );\n\n  const removeNode = useCallback(\n    (id: string, options?: RemoveOptions<T>) => {\n      const cb: RemoveOptions<T>['callback'] = (node, treecb) => {\n        options?.callback?.(node, treecb);\n        setHash(treecb.hash);\n      };\n      return tree.removeNode(id, { ...options, callback: cb });\n    },\n    [tree],\n  );\n\n  const moveNode = useCallback(\n    (id: string, options?: MoveOptions<T>) => {\n      const cb: MoveOptions<T>['callback'] = (node, treecb) => {\n        options?.callback?.(node, treecb);\n        setHash(treecb.hash);\n      };\n      return tree.moveNode(id, { ...options, callback: cb });\n    },\n    [tree],\n  );\n\n  const replaceNode = useCallback(\n    (id: string, item: T, options?: MutateOptions<T>) => {\n      const cb: MutateOptions<T>['callback'] = (node, treecb) => {\n        options?.callback?.(node, treecb);\n        setHash(treecb.hash);\n      };\n      return tree.replaceNode(id, item, { ...options, callback: cb });\n    },\n    [tree],\n  );\n\n  return {\n    hash,\n    getRoot: tree.getRoot,\n    getNode: tree.getNode,\n    walk: tree.walk,\n    walkParents: tree.walkParents,\n    findNode: tree.findNode,\n    findAllNodes: tree.findAllNodes,\n    flatten: tree.flatten,\n    addNode,\n    removeNode,\n    moveNode,\n    replaceNode,\n    getPath: tree.getPath,\n    getPathIds: tree.getPathIds,\n  };\n};\n"],
   "mappings": "AAAA,YAAY,WAAW;ACAvB,SAAS,aAAa,SAAS,gBAAgB;AAC/C,SAAS,cAAc;AAGhB,MAAM,YAAY,CAAiB,UAAa,SAA+C;AACpG,QAAM,OAAO,QAAQ,MAAM,IAAI,OAAO,UAAU,IAAI,GAAG,CAAC,MAAM,QAAQ,CAAC;AACvE,QAAM,CAAC,MAAM,OAAO,IAAI,SAAS,KAAK,IAAI;AAE1C,QAAM,UAAU;AAAA,IACd,CAAC,MAAS,YAA4B;AACpC,YAAM,KAAgC,CAAC,MAAM,WAAW;AACtD,iBAAS,WAAW,MAAM,MAAM;AAChC,gBAAQ,OAAO,IAAI;AAAA,MACrB;AACA,aAAO,KAAK,QAAQ,MAAM,EAAE,GAAG,SAAS,UAAU,GAAG,CAAC;AAAA,IACxD;AAAA,IACA,CAAC,IAAI;AAAA,EACP;AAEA,QAAM,aAAa;AAAA,IACjB,CAAC,IAAY,YAA+B;AAC1C,YAAM,KAAmC,CAAC,MAAM,WAAW;AACzD,iBAAS,WAAW,MAAM,MAAM;AAChC,gBAAQ,OAAO,IAAI;AAAA,MACrB;AACA,aAAO,KAAK,WAAW,IAAI,EAAE,GAAG,SAAS,UAAU,GAAG,CAAC;AAAA,IACzD;AAAA,IACA,CAAC,IAAI;AAAA,EACP;AAEA,QAAM,WAAW;AAAA,IACf,CAAC,IAAY,YAA6B;AACxC,YAAM,KAAiC,CAAC,MAAM,WAAW;AACvD,iBAAS,WAAW,MAAM,MAAM;AAChC,gBAAQ,OAAO,IAAI;AAAA,MACrB;AACA,aAAO,KAAK,SAAS,IAAI,EAAE,GAAG,SAAS,UAAU,GAAG,CAAC;AAAA,IACvD;AAAA,IACA,CAAC,IAAI;AAAA,EACP;AAEA,QAAM,cAAc;AAAA,IAClB,CAAC,IAAY,MAAS,YAA+B;AACnD,YAAM,KAAmC,CAAC,MAAM,WAAW;AACzD,iBAAS,WAAW,MAAM,MAAM;AAChC,gBAAQ,OAAO,IAAI;AAAA,MACrB;AACA,aAAO,KAAK,YAAY,IAAI,MAAM,EAAE,GAAG,SAAS,UAAU,GAAG,CAAC;AAAA,IAChE;AAAA,IACA,CAAC,IAAI;AAAA,EACP;AAEA,SAAO;AAAA,IACL;AAAA,IACA,SAAS,KAAK;AAAA,IACd,SAAS,KAAK;AAAA,IACd,MAAM,KAAK;AAAA,IACX,aAAa,KAAK;AAAA,IAClB,UAAU,KAAK;AAAA,IACf,cAAc,KAAK;AAAA,IACnB,SAAS,KAAK;AAAA,IACd;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,SAAS,KAAK;AAAA,IACd,YAAY,KAAK;AAAA,EACnB;AACF;",
   "names": []
 }

package/dist/types/DSTree.d.ts

@@ -1,5 +1,5 @@
-import type { AddOptions, Item, MoveOptions, MutateOptions, RemoveOptions } from './types';
-import { Node } from './Node';
+import type { AddOptions, Item, MoveOptions, MutateOptions, RemoveOptions } from './types.js';
+import { Node } from './Node.js';
 export declare class DSTree<T extends Item> {
     private root;
     private _hash;

package/dist/types/Node.d.ts

@@ -1,4 +1,4 @@
-import type { Item, NodeConstructorOptions } from './types';
+import type { Item, NodeConstructorOptions } from './types.js';
 export declare class Node<T extends Item> {
     dsId: string;
     plainItem: T;

package/dist/types/index.d.ts

@@ -1,3 +1,3 @@
-export type { Item } from './types';
-export { DSTree } from './DSTree';
-export { useDSTree } from './useDSTree';
+export type { Item } from './types.js';
+export { DSTree } from './DSTree.js';
+export { useDSTree } from './useDSTree.js';

package/dist/types/types.d.ts

@@ -1,5 +1,5 @@
-import type { DSTree } from './DSTree';
-import type { Node } from './Node';
+import type { DSTree } from './DSTree.js';
+import type { Node } from './Node.js';
 export interface Item {
     subitems?: Item[];
 }

package/dist/types/useDSTree.d.ts

@@ -1,19 +1,19 @@
-import type { AddOptions, Item, MoveOptions, MutateOptions, RemoveOptions } from './types';
+import type { AddOptions, Item, MoveOptions, MutateOptions, RemoveOptions } from './types.js';
 export declare const useDSTree: <T extends Item>(rootItem: T, opts: {
     getUniqueId: (item: T) => string;
 }) => {
     hash: number;
-    getRoot: () => import("./Node").Node<T>;
-    getNode: (id: string) => import("./Node").Node<T>;
-    walk: (callback: (node: import("./Node").Node<T>) => boolean) => void;
-    walkParents: (callback: (node: import("./Node").Node<T>) => boolean) => void;
-    findNode: (callback: (node: import("./Node").Node<T>) => boolean) => import("./Node").Node<T> | null;
-    findAllNodes: (callback: (node: import("./Node").Node<T>) => boolean) => import("./Node").Node<T>[];
-    flatten: () => import("./Node").Node<T>[];
-    addNode: (item: T, options?: AddOptions<T> | undefined) => import("./Node").Node<T>;
-    removeNode: (id: string, options?: RemoveOptions<T> | undefined) => import("./Node").Node<T>;
-    moveNode: (id: string, options?: MoveOptions<T> | undefined) => import("./Node").Node<T>;
-    replaceNode: (id: string, item: T, options?: MutateOptions<T> | undefined) => import("./Node").Node<T>;
-    getPath: (id: string) => import("./Node").Node<T>[];
+    getRoot: () => import("./Node.js").Node<T>;
+    getNode: (id: string) => import("./Node.js").Node<T>;
+    walk: (callback: (node: import("./Node.js").Node<T>) => boolean) => void;
+    walkParents: (callback: (node: import("./Node.js").Node<T>) => boolean) => void;
+    findNode: (callback: (node: import("./Node.js").Node<T>) => boolean) => import("./Node.js").Node<T> | null;
+    findAllNodes: (callback: (node: import("./Node.js").Node<T>) => boolean) => import("./Node.js").Node<T>[];
+    flatten: () => import("./Node.js").Node<T>[];
+    addNode: (item: T, options?: AddOptions<T> | undefined) => import("./Node.js").Node<T>;
+    removeNode: (id: string, options?: RemoveOptions<T> | undefined) => import("./Node.js").Node<T>;
+    moveNode: (id: string, options?: MoveOptions<T> | undefined) => import("./Node.js").Node<T>;
+    replaceNode: (id: string, item: T, options?: MutateOptions<T> | undefined) => import("./Node.js").Node<T>;
+    getPath: (id: string) => import("./Node.js").Node<T>[];
     getPathIds: (id: string) => string[];
 };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@elliemae/ds-tree-model",
-  "version": "3.16.0-next.1",
+  "version": "3.16.0-next.10",
   "license": "MIT",
   "description": "ICE MT - Dimsum - Tree Model",
   "files": [
@@ -52,7 +52,7 @@
     "eslint:fix": "eslint --ext='.js,.jsx,.test.js,.ts,.tsx' --fix --config='../../.eslintrc.js' src/",
     "dts": "node ../../scripts/dts.mjs",
     "build": "cross-env NODE_ENV=production node ../../scripts/build/build.mjs",
-    "dev:build": "pnpm --filter {.}... build && pnpm --filter {.}... dts",
+    "dev:build": "pnpm --filter {.}... build",
     "dev:install": "pnpm --filter {.}... i --no-lockfile && pnpm run dev:build",
     "checkDeps": "npx -yes ../ds-codemods check-missing-packages --projectFolderPath=\"./\" --ignorePackagesGlobPattern=\"\" --ignoreFilesGlobPattern=\"**/test-ables/*,**/tests/*\"",
     "dev": "cross-env NODE_ENV=development node ../../scripts/build/build.mjs --watch"