@manafishrov/ui 1.4.4 → 1.4.6

package/dist/node_modules/.bun/@zag-js_collection@1.35.3/node_modules/@zag-js/collection/dist/tree-collection.js.map

@@ -1 +1 @@
-{"version":3,"file":"tree-collection.js","sources":["../../../../../../../../../../node_modules/.bun/@zag-js+collection@1.35.3/node_modules/@zag-js/collection/dist/tree-collection.mjs"],"sourcesContent":["import {\n  __publicField\n} from \"./chunk-QZ7TP4HQ.mjs\";\n\n// src/tree-collection.ts\nimport { hasProp, isEqual, isObject } from \"@zag-js/utils\";\nimport {\n  access,\n  compareIndexPaths,\n  filter,\n  find,\n  findAll,\n  findIndexPath,\n  flatMap,\n  flatten,\n  insert,\n  move,\n  remove,\n  replace,\n  visit\n} from \"./tree-visit.mjs\";\nvar TreeCollection = class _TreeCollection {\n  constructor(options) {\n    this.options = options;\n    __publicField(this, \"rootNode\");\n    __publicField(this, \"isEqual\", (other) => {\n      return isEqual(this.rootNode, other.rootNode);\n    });\n    __publicField(this, \"getNodeChildren\", (node) => {\n      return this.options.nodeToChildren?.(node) ?? fallbackMethods.nodeToChildren(node) ?? [];\n    });\n    __publicField(this, \"resolveIndexPath\", (valueOrIndexPath) => {\n      return typeof valueOrIndexPath === \"string\" ? this.getIndexPath(valueOrIndexPath) : valueOrIndexPath;\n    });\n    __publicField(this, \"resolveNode\", (valueOrIndexPath) => {\n      const indexPath = this.resolveIndexPath(valueOrIndexPath);\n      return indexPath ? this.at(indexPath) : void 0;\n    });\n    __publicField(this, \"getNodeChildrenCount\", (node) => {\n      return this.options.nodeToChildrenCount?.(node) ?? fallbackMethods.nodeToChildrenCount(node);\n    });\n    __publicField(this, \"getNodeValue\", (node) => {\n      return this.options.nodeToValue?.(node) ?? fallbackMethods.nodeToValue(node);\n    });\n    __publicField(this, \"getNodeDisabled\", (node) => {\n      return this.options.isNodeDisabled?.(node) ?? fallbackMethods.isNodeDisabled(node);\n    });\n    __publicField(this, \"stringify\", (value) => {\n      const node = this.findNode(value);\n      if (!node) return null;\n      return this.stringifyNode(node);\n    });\n    __publicField(this, \"stringifyNode\", (node) => {\n      return this.options.nodeToString?.(node) ?? fallbackMethods.nodeToString(node);\n    });\n    __publicField(this, \"getFirstNode\", (rootNode = this.rootNode, opts = {}) => {\n      let firstChild;\n      visit(rootNode, {\n        getChildren: this.getNodeChildren,\n        onEnter: (node, indexPath) => {\n          if (this.isSameNode(node, rootNode)) return;\n          if (opts.skip?.({ value: this.getNodeValue(node), node, indexPath })) return \"skip\";\n          if (!firstChild && indexPath.length > 0 && !this.getNodeDisabled(node)) {\n            firstChild = node;\n            return \"stop\";\n          }\n        }\n      });\n      return firstChild;\n    });\n    __publicField(this, \"getLastNode\", (rootNode = this.rootNode, opts = {}) => {\n      let lastChild;\n      visit(rootNode, {\n        getChildren: this.getNodeChildren,\n        onEnter: (node, indexPath) => {\n          if (this.isSameNode(node, rootNode)) return;\n          if (opts.skip?.({ value: this.getNodeValue(node), node, indexPath })) return \"skip\";\n          if (indexPath.length > 0 && !this.getNodeDisabled(node)) {\n            lastChild = node;\n          }\n        }\n      });\n      return lastChild;\n    });\n    __publicField(this, \"at\", (indexPath) => {\n      return access(this.rootNode, indexPath, {\n        getChildren: this.getNodeChildren\n      });\n    });\n    __publicField(this, \"findNode\", (value, rootNode = this.rootNode) => {\n      return find(rootNode, {\n        getChildren: this.getNodeChildren,\n        predicate: (node) => this.getNodeValue(node) === value\n      });\n    });\n    __publicField(this, \"findNodes\", (values, rootNode = this.rootNode) => {\n      const v = new Set(values.filter((v2) => v2 != null));\n      return findAll(rootNode, {\n        getChildren: this.getNodeChildren,\n        predicate: (node) => v.has(this.getNodeValue(node))\n      });\n    });\n    __publicField(this, \"sort\", (values) => {\n      return values.reduce((acc, value) => {\n        const indexPath = this.getIndexPath(value);\n        if (indexPath) acc.push({ value, indexPath });\n        return acc;\n      }, []).sort((a, b) => compareIndexPaths(a.indexPath, b.indexPath)).map(({ value }) => value);\n    });\n    __publicField(this, \"getValue\", (indexPath) => {\n      const node = this.at(indexPath);\n      return node ? this.getNodeValue(node) : void 0;\n    });\n    __publicField(this, \"getValuePath\", (indexPath) => {\n      if (!indexPath) return [];\n      const valuePath = [];\n      let currentPath = [...indexPath];\n      while (currentPath.length > 0) {\n        const node = this.at(currentPath);\n        if (node) valuePath.unshift(this.getNodeValue(node));\n        currentPath.pop();\n      }\n      return valuePath;\n    });\n    __publicField(this, \"getDepth\", (value) => {\n      const indexPath = findIndexPath(this.rootNode, {\n        getChildren: this.getNodeChildren,\n        predicate: (node) => this.getNodeValue(node) === value\n      });\n      return indexPath?.length ?? 0;\n    });\n    __publicField(this, \"isSameNode\", (node, other) => {\n      return this.getNodeValue(node) === this.getNodeValue(other);\n    });\n    __publicField(this, \"isRootNode\", (node) => {\n      return this.isSameNode(node, this.rootNode);\n    });\n    __publicField(this, \"contains\", (parentIndexPath, valueIndexPath) => {\n      if (!parentIndexPath || !valueIndexPath) return false;\n      return valueIndexPath.slice(0, parentIndexPath.length).every((_, i) => parentIndexPath[i] === valueIndexPath[i]);\n    });\n    __publicField(this, \"getNextNode\", (value, opts = {}) => {\n      let found = false;\n      let nextNode;\n      visit(this.rootNode, {\n        getChildren: this.getNodeChildren,\n        onEnter: (node, indexPath) => {\n          if (this.isRootNode(node)) return;\n          const nodeValue = this.getNodeValue(node);\n          if (opts.skip?.({ value: nodeValue, node, indexPath })) {\n            if (nodeValue === value) {\n              found = true;\n            }\n            return \"skip\";\n          }\n          if (found && !this.getNodeDisabled(node)) {\n            nextNode = node;\n            return \"stop\";\n          }\n          if (nodeValue === value) {\n            found = true;\n          }\n        }\n      });\n      return nextNode;\n    });\n    __publicField(this, \"getPreviousNode\", (value, opts = {}) => {\n      let previousNode;\n      let found = false;\n      visit(this.rootNode, {\n        getChildren: this.getNodeChildren,\n        onEnter: (node, indexPath) => {\n          if (this.isRootNode(node)) return;\n          const nodeValue = this.getNodeValue(node);\n          if (opts.skip?.({ value: nodeValue, node, indexPath })) {\n            return \"skip\";\n          }\n          if (nodeValue === value) {\n            found = true;\n            return \"stop\";\n          }\n          if (!this.getNodeDisabled(node)) {\n            previousNode = node;\n          }\n        }\n      });\n      return found ? previousNode : void 0;\n    });\n    __publicField(this, \"getParentNodes\", (valueOrIndexPath) => {\n      const indexPath = this.resolveIndexPath(valueOrIndexPath)?.slice();\n      if (!indexPath) return [];\n      const result = [];\n      while (indexPath.length > 0) {\n        indexPath.pop();\n        const parentNode = this.at(indexPath);\n        if (parentNode && !this.isRootNode(parentNode)) {\n          result.unshift(parentNode);\n        }\n      }\n      return result;\n    });\n    __publicField(this, \"getDescendantNodes\", (valueOrIndexPath, options) => {\n      const parentNode = this.resolveNode(valueOrIndexPath);\n      if (!parentNode) return [];\n      const result = [];\n      visit(parentNode, {\n        getChildren: this.getNodeChildren,\n        onEnter: (node, nodeIndexPath) => {\n          if (nodeIndexPath.length === 0) return;\n          if (!options?.withBranch && this.isBranchNode(node)) return;\n          result.push(node);\n        }\n      });\n      return result;\n    });\n    __publicField(this, \"getDescendantValues\", (valueOrIndexPath, options) => {\n      const children = this.getDescendantNodes(valueOrIndexPath, options);\n      return children.map((child) => this.getNodeValue(child));\n    });\n    __publicField(this, \"getParentIndexPath\", (indexPath) => {\n      return indexPath.slice(0, -1);\n    });\n    __publicField(this, \"getParentNode\", (valueOrIndexPath) => {\n      const indexPath = this.resolveIndexPath(valueOrIndexPath);\n      return indexPath ? this.at(this.getParentIndexPath(indexPath)) : void 0;\n    });\n    __publicField(this, \"visit\", (opts) => {\n      const { skip, ...rest } = opts;\n      visit(this.rootNode, {\n        ...rest,\n        getChildren: this.getNodeChildren,\n        onEnter: (node, indexPath) => {\n          if (this.isRootNode(node)) return;\n          if (skip?.({ value: this.getNodeValue(node), node, indexPath })) return \"skip\";\n          return rest.onEnter?.(node, indexPath);\n        }\n      });\n    });\n    __publicField(this, \"getPreviousSibling\", (indexPath) => {\n      const parentNode = this.getParentNode(indexPath);\n      if (!parentNode) return;\n      const siblings = this.getNodeChildren(parentNode);\n      let idx = indexPath[indexPath.length - 1];\n      while (--idx >= 0) {\n        const sibling = siblings[idx];\n        if (!this.getNodeDisabled(sibling)) return sibling;\n      }\n      return;\n    });\n    __publicField(this, \"getNextSibling\", (indexPath) => {\n      const parentNode = this.getParentNode(indexPath);\n      if (!parentNode) return;\n      const siblings = this.getNodeChildren(parentNode);\n      let idx = indexPath[indexPath.length - 1];\n      while (++idx < siblings.length) {\n        const sibling = siblings[idx];\n        if (!this.getNodeDisabled(sibling)) return sibling;\n      }\n      return;\n    });\n    __publicField(this, \"getSiblingNodes\", (indexPath) => {\n      const parentNode = this.getParentNode(indexPath);\n      return parentNode ? this.getNodeChildren(parentNode) : [];\n    });\n    __publicField(this, \"getValues\", (rootNode = this.rootNode) => {\n      const values = flatMap(rootNode, {\n        getChildren: this.getNodeChildren,\n        transform: (node) => [this.getNodeValue(node)]\n      });\n      return values.slice(1);\n    });\n    __publicField(this, \"isValidDepth\", (indexPath, depth) => {\n      if (depth == null) return true;\n      if (typeof depth === \"function\") return depth(indexPath.length);\n      return indexPath.length === depth;\n    });\n    __publicField(this, \"isBranchNode\", (node) => {\n      return this.getNodeChildren(node).length > 0 || this.getNodeChildrenCount(node) != null;\n    });\n    __publicField(this, \"getBranchValues\", (rootNode = this.rootNode, opts = {}) => {\n      let values = [];\n      visit(rootNode, {\n        getChildren: this.getNodeChildren,\n        onEnter: (node, indexPath) => {\n          if (indexPath.length === 0) return;\n          const nodeValue = this.getNodeValue(node);\n          if (opts.skip?.({ value: nodeValue, node, indexPath })) return \"skip\";\n          if (this.isBranchNode(node) && this.isValidDepth(indexPath, opts.depth)) {\n            values.push(this.getNodeValue(node));\n          }\n        }\n      });\n      return values;\n    });\n    __publicField(this, \"flatten\", (rootNode = this.rootNode) => {\n      return flatten(rootNode, { getChildren: this.getNodeChildren });\n    });\n    __publicField(this, \"_create\", (node, children) => {\n      if (this.getNodeChildren(node).length > 0 || children.length > 0) {\n        return { ...node, children };\n      }\n      return { ...node };\n    });\n    __publicField(this, \"_insert\", (rootNode, indexPath, nodes) => {\n      return this.copy(\n        insert(rootNode, { at: indexPath, nodes, getChildren: this.getNodeChildren, create: this._create })\n      );\n    });\n    __publicField(this, \"copy\", (rootNode) => {\n      return new _TreeCollection({ ...this.options, rootNode });\n    });\n    __publicField(this, \"_replace\", (rootNode, indexPath, node) => {\n      return this.copy(\n        replace(rootNode, { at: indexPath, node, getChildren: this.getNodeChildren, create: this._create })\n      );\n    });\n    __publicField(this, \"_move\", (rootNode, indexPaths, to) => {\n      return this.copy(move(rootNode, { indexPaths, to, getChildren: this.getNodeChildren, create: this._create }));\n    });\n    __publicField(this, \"_remove\", (rootNode, indexPaths) => {\n      return this.copy(remove(rootNode, { indexPaths, getChildren: this.getNodeChildren, create: this._create }));\n    });\n    __publicField(this, \"replace\", (indexPath, node) => {\n      return this._replace(this.rootNode, indexPath, node);\n    });\n    __publicField(this, \"remove\", (indexPaths) => {\n      return this._remove(this.rootNode, indexPaths);\n    });\n    __publicField(this, \"insertBefore\", (indexPath, nodes) => {\n      const parentNode = this.getParentNode(indexPath);\n      return parentNode ? this._insert(this.rootNode, indexPath, nodes) : void 0;\n    });\n    __publicField(this, \"insertAfter\", (indexPath, nodes) => {\n      const parentNode = this.getParentNode(indexPath);\n      if (!parentNode) return;\n      const nextIndex = [...indexPath.slice(0, -1), indexPath[indexPath.length - 1] + 1];\n      return this._insert(this.rootNode, nextIndex, nodes);\n    });\n    __publicField(this, \"move\", (fromIndexPaths, toIndexPath) => {\n      return this._move(this.rootNode, fromIndexPaths, toIndexPath);\n    });\n    __publicField(this, \"filter\", (predicate) => {\n      const filteredRoot = filter(this.rootNode, {\n        predicate,\n        getChildren: this.getNodeChildren,\n        create: this._create\n      });\n      return this.copy(filteredRoot);\n    });\n    __publicField(this, \"toJSON\", () => {\n      return this.getValues(this.rootNode);\n    });\n    this.rootNode = options.rootNode;\n  }\n  getIndexPath(valueOrValuePath) {\n    if (Array.isArray(valueOrValuePath)) {\n      if (valueOrValuePath.length === 0) return [];\n      const indexPath = [];\n      let currentChildren = this.getNodeChildren(this.rootNode);\n      for (let i = 0; i < valueOrValuePath.length; i++) {\n        const currentValue = valueOrValuePath[i];\n        const matchingChildIndex = currentChildren.findIndex((child) => this.getNodeValue(child) === currentValue);\n        if (matchingChildIndex === -1) break;\n        indexPath.push(matchingChildIndex);\n        if (i < valueOrValuePath.length - 1) {\n          const currentNode = currentChildren[matchingChildIndex];\n          currentChildren = this.getNodeChildren(currentNode);\n        }\n      }\n      return indexPath;\n    } else {\n      return findIndexPath(this.rootNode, {\n        getChildren: this.getNodeChildren,\n        predicate: (node) => this.getNodeValue(node) === valueOrValuePath\n      });\n    }\n  }\n};\nfunction flattenedToTree(nodes, options = fallbackMethods) {\n  if (nodes.length === 0) {\n    throw new Error(\"[zag-js/tree] Cannot create tree from empty flattened array\");\n  }\n  const rootFlatNode = nodes.find((node) => node._parent === void 0);\n  if (!rootFlatNode) {\n    throw new Error(\"[zag-js/tree] No root node found in flattened data\");\n  }\n  const nodeMap = /* @__PURE__ */ new Map();\n  nodes.forEach((node) => {\n    nodeMap.set(node._index, node);\n  });\n  const buildNode = (idx) => {\n    const flatNode = nodeMap.get(idx);\n    if (!flatNode) return {};\n    const { _children, _parent, _index, ...cleanNode } = flatNode;\n    const children = [];\n    _children?.forEach((childIndex) => {\n      children.push(buildNode(childIndex));\n    });\n    return {\n      ...cleanNode,\n      ...children.length > 0 && { children }\n    };\n  };\n  const rootNode = buildNode(rootFlatNode._index);\n  return new TreeCollection({ ...options, rootNode });\n}\nfunction filePathToTree(paths) {\n  const rootNode = {\n    label: \"\",\n    value: \"ROOT\",\n    children: []\n  };\n  paths.forEach((path) => {\n    const parts = path.split(\"/\");\n    let currentNode = rootNode;\n    parts.forEach((part, index) => {\n      let childNode = currentNode.children?.find((child) => child.label === part);\n      if (!childNode) {\n        childNode = {\n          value: parts.slice(0, index + 1).join(\"/\"),\n          label: part\n        };\n        currentNode.children || (currentNode.children = []);\n        currentNode.children.push(childNode);\n      }\n      currentNode = childNode;\n    });\n  });\n  return new TreeCollection({ rootNode });\n}\nvar fallbackMethods = {\n  nodeToValue(node) {\n    if (typeof node === \"string\") return node;\n    if (isObject(node) && hasProp(node, \"value\")) return node.value;\n    return \"\";\n  },\n  nodeToString(node) {\n    if (typeof node === \"string\") return node;\n    if (isObject(node) && hasProp(node, \"label\")) return node.label;\n    return fallbackMethods.nodeToValue(node);\n  },\n  isNodeDisabled(node) {\n    if (isObject(node) && hasProp(node, \"disabled\")) return !!node.disabled;\n    return false;\n  },\n  nodeToChildren(node) {\n    return node.children;\n  },\n  nodeToChildrenCount(node) {\n    if (isObject(node) && hasProp(node, \"childrenCount\")) return node.childrenCount;\n  }\n};\nexport {\n  TreeCollection,\n  filePathToTree,\n  flattenedToTree\n};\n"],"names":["TreeCollection","_TreeCollection","options","__publicField","other","isEqual","node","fallbackMethods","valueOrIndexPath","indexPath","value","rootNode","opts","firstChild","visit","lastChild","access","find","values","v","v2","findAll","acc","a","b","compareIndexPaths","valuePath","currentPath","findIndexPath","parentIndexPath","valueIndexPath","_","i","found","nextNode","nodeValue","previousNode","result","parentNode","nodeIndexPath","child","skip","rest","siblings","idx","sibling","flatMap","depth","flatten","children","nodes","insert","replace","indexPaths","to","move","remove","nextIndex","fromIndexPaths","toIndexPath","predicate","filteredRoot","filter","valueOrValuePath","currentChildren","currentValue","matchingChildIndex","currentNode","filePathToTree","paths","path","parts","part","index","childNode","isObject","hasProp"],"mappings":";;;;AAqBG,IAACA,IAAiB,MAAMC,EAAgB;AAAA,EACzC,YAAYC,GAAS;AACnB,SAAK,UAAUA,GACfC,EAAc,MAAM,UAAU,GAC9BA,EAAc,MAAM,WAAW,CAACC,MACvBC,EAAQ,KAAK,UAAUD,EAAM,QAAQ,CAC7C,GACDD,EAAc,MAAM,mBAAmB,CAACG,MAC/B,KAAK,QAAQ,iBAAiBA,CAAI,KAAKC,EAAgB,eAAeD,CAAI,KAAK,CAAA,CACvF,GACDH,EAAc,MAAM,oBAAoB,CAACK,MAChC,OAAOA,KAAqB,WAAW,KAAK,aAAaA,CAAgB,IAAIA,CACrF,GACDL,EAAc,MAAM,eAAe,CAACK,MAAqB;AACvD,YAAMC,IAAY,KAAK,iBAAiBD,CAAgB;AACxD,aAAOC,IAAY,KAAK,GAAGA,CAAS,IAAI;AAAA,IAC1C,CAAC,GACDN,EAAc,MAAM,wBAAwB,CAACG,MACpC,KAAK,QAAQ,sBAAsBA,CAAI,KAAKC,EAAgB,oBAAoBD,CAAI,CAC5F,GACDH,EAAc,MAAM,gBAAgB,CAACG,MAC5B,KAAK,QAAQ,cAAcA,CAAI,KAAKC,EAAgB,YAAYD,CAAI,CAC5E,GACDH,EAAc,MAAM,mBAAmB,CAACG,MAC/B,KAAK,QAAQ,iBAAiBA,CAAI,KAAKC,EAAgB,eAAeD,CAAI,CAClF,GACDH,EAAc,MAAM,aAAa,CAACO,MAAU;AAC1C,YAAMJ,IAAO,KAAK,SAASI,CAAK;AAChC,aAAKJ,IACE,KAAK,cAAcA,CAAI,IADZ;AAAA,IAEpB,CAAC,GACDH,EAAc,MAAM,iBAAiB,CAACG,MAC7B,KAAK,QAAQ,eAAeA,CAAI,KAAKC,EAAgB,aAAaD,CAAI,CAC9E,GACDH,EAAc,MAAM,gBAAgB,CAACQ,IAAW,KAAK,UAAUC,IAAO,OAAO;AAC3E,UAAIC;AACJ,aAAAC,EAAMH,GAAU;AAAA,QACd,aAAa,KAAK;AAAA,QAClB,SAAS,CAACL,GAAMG,MAAc;AAC5B,cAAI,MAAK,WAAWH,GAAMK,CAAQ,GAClC;AAAA,gBAAIC,EAAK,OAAO,EAAE,OAAO,KAAK,aAAaN,CAAI,GAAG,MAAAA,GAAM,WAAAG,EAAS,CAAE,EAAG,QAAO;AAC7E,gBAAI,CAACI,KAAcJ,EAAU,SAAS,KAAK,CAAC,KAAK,gBAAgBH,CAAI;AACnE,qBAAAO,IAAaP,GACN;AAAA;AAAA,QAEX;AAAA,MACR,CAAO,GACMO;AAAA,IACT,CAAC,GACDV,EAAc,MAAM,eAAe,CAACQ,IAAW,KAAK,UAAUC,IAAO,OAAO;AAC1E,UAAIG;AACJ,aAAAD,EAAMH,GAAU;AAAA,QACd,aAAa,KAAK;AAAA,QAClB,SAAS,CAACL,GAAMG,MAAc;AAC5B,cAAI,MAAK,WAAWH,GAAMK,CAAQ,GAClC;AAAA,gBAAIC,EAAK,OAAO,EAAE,OAAO,KAAK,aAAaN,CAAI,GAAG,MAAAA,GAAM,WAAAG,EAAS,CAAE,EAAG,QAAO;AAC7E,YAAIA,EAAU,SAAS,KAAK,CAAC,KAAK,gBAAgBH,CAAI,MACpDS,IAAYT;AAAA;AAAA,QAEhB;AAAA,MACR,CAAO,GACMS;AAAA,IACT,CAAC,GACDZ,EAAc,MAAM,MAAM,CAACM,MAClBO,EAAO,KAAK,UAAUP,GAAW;AAAA,MACtC,aAAa,KAAK;AAAA,IAC1B,CAAO,CACF,GACDN,EAAc,MAAM,YAAY,CAACO,GAAOC,IAAW,KAAK,aAC/CM,EAAKN,GAAU;AAAA,MACpB,aAAa,KAAK;AAAA,MAClB,WAAW,CAACL,MAAS,KAAK,aAAaA,CAAI,MAAMI;AAAA,IACzD,CAAO,CACF,GACDP,EAAc,MAAM,aAAa,CAACe,GAAQP,IAAW,KAAK,aAAa;AACrE,YAAMQ,IAAI,IAAI,IAAID,EAAO,OAAO,CAACE,MAAOA,KAAM,IAAI,CAAC;AACnD,aAAOC,EAAQV,GAAU;AAAA,QACvB,aAAa,KAAK;AAAA,QAClB,WAAW,CAACL,MAASa,EAAE,IAAI,KAAK,aAAab,CAAI,CAAC;AAAA,MAC1D,CAAO;AAAA,IACH,CAAC,GACDH,EAAc,MAAM,QAAQ,CAACe,MACpBA,EAAO,OAAO,CAACI,GAAKZ,MAAU;AACnC,YAAMD,IAAY,KAAK,aAAaC,CAAK;AACzC,aAAID,KAAWa,EAAI,KAAK,EAAE,OAAAZ,GAAO,WAAAD,EAAS,CAAE,GACrCa;AAAA,IACT,GAAG,CAAA,CAAE,EAAE,KAAK,CAACC,GAAGC,MAAMC,EAAkBF,EAAE,WAAWC,EAAE,SAAS,CAAC,EAAE,IAAI,CAAC,EAAE,OAAAd,EAAK,MAAOA,CAAK,CAC5F,GACDP,EAAc,MAAM,YAAY,CAACM,MAAc;AAC7C,YAAMH,IAAO,KAAK,GAAGG,CAAS;AAC9B,aAAOH,IAAO,KAAK,aAAaA,CAAI,IAAI;AAAA,IAC1C,CAAC,GACDH,EAAc,MAAM,gBAAgB,CAACM,MAAc;AACjD,UAAI,CAACA,EAAW,QAAO,CAAA;AACvB,YAAMiB,IAAY,CAAA;AAClB,UAAIC,IAAc,CAAC,GAAGlB,CAAS;AAC/B,aAAOkB,EAAY,SAAS,KAAG;AAC7B,cAAMrB,IAAO,KAAK,GAAGqB,CAAW;AAChC,QAAIrB,KAAMoB,EAAU,QAAQ,KAAK,aAAapB,CAAI,CAAC,GACnDqB,EAAY,IAAG;AAAA,MACjB;AACA,aAAOD;AAAA,IACT,CAAC,GACDvB,EAAc,MAAM,YAAY,CAACO,MACbkB,EAAc,KAAK,UAAU;AAAA,MAC7C,aAAa,KAAK;AAAA,MAClB,WAAW,CAACtB,MAAS,KAAK,aAAaA,CAAI,MAAMI;AAAA,IACzD,CAAO,GACiB,UAAU,CAC7B,GACDP,EAAc,MAAM,cAAc,CAACG,GAAMF,MAChC,KAAK,aAAaE,CAAI,MAAM,KAAK,aAAaF,CAAK,CAC3D,GACDD,EAAc,MAAM,cAAc,CAACG,MAC1B,KAAK,WAAWA,GAAM,KAAK,QAAQ,CAC3C,GACDH,EAAc,MAAM,YAAY,CAAC0B,GAAiBC,MAC5C,CAACD,KAAmB,CAACC,IAAuB,KACzCA,EAAe,MAAM,GAAGD,EAAgB,MAAM,EAAE,MAAM,CAACE,GAAGC,MAAMH,EAAgBG,CAAC,MAAMF,EAAeE,CAAC,CAAC,CAChH,GACD7B,EAAc,MAAM,eAAe,CAACO,GAAOE,IAAO,CAAA,MAAO;AACvD,UAAIqB,IAAQ,IACRC;AACJ,aAAApB,EAAM,KAAK,UAAU;AAAA,QACnB,aAAa,KAAK;AAAA,QAClB,SAAS,CAACR,GAAMG,MAAc;AAC5B,cAAI,KAAK,WAAWH,CAAI,EAAG;AAC3B,gBAAM6B,IAAY,KAAK,aAAa7B,CAAI;AACxC,cAAIM,EAAK,OAAO,EAAE,OAAOuB,GAAW,MAAA7B,GAAM,WAAAG,EAAS,CAAE;AACnD,mBAAI0B,MAAczB,MAChBuB,IAAQ,KAEH;AAET,cAAIA,KAAS,CAAC,KAAK,gBAAgB3B,CAAI;AACrC,mBAAA4B,IAAW5B,GACJ;AAET,UAAI6B,MAAczB,MAChBuB,IAAQ;AAAA,QAEZ;AAAA,MACR,CAAO,GACMC;AAAA,IACT,CAAC,GACD/B,EAAc,MAAM,mBAAmB,CAACO,GAAOE,IAAO,CAAA,MAAO;AAC3D,UAAIwB,GACAH,IAAQ;AACZ,aAAAnB,EAAM,KAAK,UAAU;AAAA,QACnB,aAAa,KAAK;AAAA,QAClB,SAAS,CAACR,GAAMG,MAAc;AAC5B,cAAI,KAAK,WAAWH,CAAI,EAAG;AAC3B,gBAAM6B,IAAY,KAAK,aAAa7B,CAAI;AACxC,cAAIM,EAAK,OAAO,EAAE,OAAOuB,GAAW,MAAA7B,GAAM,WAAAG,EAAS,CAAE;AACnD,mBAAO;AAET,cAAI0B,MAAczB;AAChB,mBAAAuB,IAAQ,IACD;AAET,UAAK,KAAK,gBAAgB3B,CAAI,MAC5B8B,IAAe9B;AAAA,QAEnB;AAAA,MACR,CAAO,GACM2B,IAAQG,IAAe;AAAA,IAChC,CAAC,GACDjC,EAAc,MAAM,kBAAkB,CAACK,MAAqB;AAC1D,YAAMC,IAAY,KAAK,iBAAiBD,CAAgB,GAAG,MAAK;AAChE,UAAI,CAACC,EAAW,QAAO,CAAA;AACvB,YAAM4B,IAAS,CAAA;AACf,aAAO5B,EAAU,SAAS,KAAG;AAC3B,QAAAA,EAAU,IAAG;AACb,cAAM6B,IAAa,KAAK,GAAG7B,CAAS;AACpC,QAAI6B,KAAc,CAAC,KAAK,WAAWA,CAAU,KAC3CD,EAAO,QAAQC,CAAU;AAAA,MAE7B;AACA,aAAOD;AAAA,IACT,CAAC,GACDlC,EAAc,MAAM,sBAAsB,CAACK,GAAkBN,MAAY;AACvE,YAAMoC,IAAa,KAAK,YAAY9B,CAAgB;AACpD,UAAI,CAAC8B,EAAY,QAAO,CAAA;AACxB,YAAMD,IAAS,CAAA;AACf,aAAAvB,EAAMwB,GAAY;AAAA,QAChB,aAAa,KAAK;AAAA,QAClB,SAAS,CAAChC,GAAMiC,MAAkB;AAChC,UAAIA,EAAc,WAAW,MACzB,CAACrC,GAAS,cAAc,KAAK,aAAaI,CAAI,KAClD+B,EAAO,KAAK/B,CAAI;AAAA,QAClB;AAAA,MACR,CAAO,GACM+B;AAAA,IACT,CAAC,GACDlC,EAAc,MAAM,uBAAuB,CAACK,GAAkBN,MAC3C,KAAK,mBAAmBM,GAAkBN,CAAO,EAClD,IAAI,CAACsC,MAAU,KAAK,aAAaA,CAAK,CAAC,CACxD,GACDrC,EAAc,MAAM,sBAAsB,CAACM,MAClCA,EAAU,MAAM,GAAG,EAAE,CAC7B,GACDN,EAAc,MAAM,iBAAiB,CAACK,MAAqB;AACzD,YAAMC,IAAY,KAAK,iBAAiBD,CAAgB;AACxD,aAAOC,IAAY,KAAK,GAAG,KAAK,mBAAmBA,CAAS,CAAC,IAAI;AAAA,IACnE,CAAC,GACDN,EAAc,MAAM,SAAS,CAACS,MAAS;AACrC,YAAM,EAAE,MAAA6B,GAAM,GAAGC,EAAI,IAAK9B;AAC1B,MAAAE,EAAM,KAAK,UAAU;AAAA,QACnB,GAAG4B;AAAA,QACH,aAAa,KAAK;AAAA,QAClB,SAAS,CAACpC,GAAMG,MAAc;AAC5B,cAAI,MAAK,WAAWH,CAAI;AACxB,mBAAImC,IAAO,EAAE,OAAO,KAAK,aAAanC,CAAI,GAAG,MAAAA,GAAM,WAAAG,GAAW,IAAU,SACjEiC,EAAK,UAAUpC,GAAMG,CAAS;AAAA,QACvC;AAAA,MACR,CAAO;AAAA,IACH,CAAC,GACDN,EAAc,MAAM,sBAAsB,CAACM,MAAc;AACvD,YAAM6B,IAAa,KAAK,cAAc7B,CAAS;AAC/C,UAAI,CAAC6B,EAAY;AACjB,YAAMK,IAAW,KAAK,gBAAgBL,CAAU;AAChD,UAAIM,IAAMnC,EAAUA,EAAU,SAAS,CAAC;AACxC,aAAO,EAAEmC,KAAO,KAAG;AACjB,cAAMC,IAAUF,EAASC,CAAG;AAC5B,YAAI,CAAC,KAAK,gBAAgBC,CAAO,EAAG,QAAOA;AAAA,MAC7C;AAAA,IAEF,CAAC,GACD1C,EAAc,MAAM,kBAAkB,CAACM,MAAc;AACnD,YAAM6B,IAAa,KAAK,cAAc7B,CAAS;AAC/C,UAAI,CAAC6B,EAAY;AACjB,YAAMK,IAAW,KAAK,gBAAgBL,CAAU;AAChD,UAAIM,IAAMnC,EAAUA,EAAU,SAAS,CAAC;AACxC,aAAO,EAAEmC,IAAMD,EAAS,UAAQ;AAC9B,cAAME,IAAUF,EAASC,CAAG;AAC5B,YAAI,CAAC,KAAK,gBAAgBC,CAAO,EAAG,QAAOA;AAAA,MAC7C;AAAA,IAEF,CAAC,GACD1C,EAAc,MAAM,mBAAmB,CAACM,MAAc;AACpD,YAAM6B,IAAa,KAAK,cAAc7B,CAAS;AAC/C,aAAO6B,IAAa,KAAK,gBAAgBA,CAAU,IAAI,CAAA;AAAA,IACzD,CAAC,GACDnC,EAAc,MAAM,aAAa,CAACQ,IAAW,KAAK,aACjCmC,EAAQnC,GAAU;AAAA,MAC/B,aAAa,KAAK;AAAA,MAClB,WAAW,CAACL,MAAS,CAAC,KAAK,aAAaA,CAAI,CAAC;AAAA,IACrD,CAAO,EACa,MAAM,CAAC,CACtB,GACDH,EAAc,MAAM,gBAAgB,CAACM,GAAWsC,MAC1CA,KAAS,OAAa,KACtB,OAAOA,KAAU,aAAmBA,EAAMtC,EAAU,MAAM,IACvDA,EAAU,WAAWsC,CAC7B,GACD5C,EAAc,MAAM,gBAAgB,CAACG,MAC5B,KAAK,gBAAgBA,CAAI,EAAE,SAAS,KAAK,KAAK,qBAAqBA,CAAI,KAAK,IACpF,GACDH,EAAc,MAAM,mBAAmB,CAACQ,IAAW,KAAK,UAAUC,IAAO,OAAO;AAC9E,UAAIM,IAAS,CAAA;AACb,aAAAJ,EAAMH,GAAU;AAAA,QACd,aAAa,KAAK;AAAA,QAClB,SAAS,CAACL,GAAMG,MAAc;AAC5B,cAAIA,EAAU,WAAW,EAAG;AAC5B,gBAAM0B,IAAY,KAAK,aAAa7B,CAAI;AACxC,cAAIM,EAAK,OAAO,EAAE,OAAOuB,GAAW,MAAA7B,GAAM,WAAAG,GAAW,EAAG,QAAO;AAC/D,UAAI,KAAK,aAAaH,CAAI,KAAK,KAAK,aAAaG,GAAWG,EAAK,KAAK,KACpEM,EAAO,KAAK,KAAK,aAAaZ,CAAI,CAAC;AAAA,QAEvC;AAAA,MACR,CAAO,GACMY;AAAA,IACT,CAAC,GACDf,EAAc,MAAM,WAAW,CAACQ,IAAW,KAAK,aACvCqC,EAAQrC,GAAU,EAAE,aAAa,KAAK,gBAAe,CAAE,CAC/D,GACDR,EAAc,MAAM,WAAW,CAACG,GAAM2C,MAChC,KAAK,gBAAgB3C,CAAI,EAAE,SAAS,KAAK2C,EAAS,SAAS,IACtD,EAAE,GAAG3C,GAAM,UAAA2C,EAAQ,IAErB,EAAE,GAAG3C,EAAI,CACjB,GACDH,EAAc,MAAM,WAAW,CAACQ,GAAUF,GAAWyC,MAC5C,KAAK;AAAA,MACVC,EAAOxC,GAAU,EAAE,IAAIF,GAAW,OAAAyC,GAAO,aAAa,KAAK,iBAAiB,QAAQ,KAAK,QAAO,CAAE;AAAA,IAC1G,CACK,GACD/C,EAAc,MAAM,QAAQ,CAACQ,MACpB,IAAIV,EAAgB,EAAE,GAAG,KAAK,SAAS,UAAAU,EAAQ,CAAE,CACzD,GACDR,EAAc,MAAM,YAAY,CAACQ,GAAUF,GAAWH,MAC7C,KAAK;AAAA,MACV8C,EAAQzC,GAAU,EAAE,IAAIF,GAAW,MAAAH,GAAM,aAAa,KAAK,iBAAiB,QAAQ,KAAK,QAAO,CAAE;AAAA,IAC1G,CACK,GACDH,EAAc,MAAM,SAAS,CAACQ,GAAU0C,GAAYC,MAC3C,KAAK,KAAKC,EAAK5C,GAAU,EAAE,YAAA0C,GAAY,IAAAC,GAAI,aAAa,KAAK,iBAAiB,QAAQ,KAAK,QAAO,CAAE,CAAC,CAC7G,GACDnD,EAAc,MAAM,WAAW,CAACQ,GAAU0C,MACjC,KAAK,KAAKG,EAAO7C,GAAU,EAAE,YAAA0C,GAAY,aAAa,KAAK,iBAAiB,QAAQ,KAAK,QAAO,CAAE,CAAC,CAC3G,GACDlD,EAAc,MAAM,WAAW,CAACM,GAAWH,MAClC,KAAK,SAAS,KAAK,UAAUG,GAAWH,CAAI,CACpD,GACDH,EAAc,MAAM,UAAU,CAACkD,MACtB,KAAK,QAAQ,KAAK,UAAUA,CAAU,CAC9C,GACDlD,EAAc,MAAM,gBAAgB,CAACM,GAAWyC,MAC3B,KAAK,cAAczC,CAAS,IAC3B,KAAK,QAAQ,KAAK,UAAUA,GAAWyC,CAAK,IAAI,MACrE,GACD/C,EAAc,MAAM,eAAe,CAACM,GAAWyC,MAAU;AAEvD,UAAI,CADe,KAAK,cAAczC,CAAS,EAC9B;AACjB,YAAMgD,IAAY,CAAC,GAAGhD,EAAU,MAAM,GAAG,EAAE,GAAGA,EAAUA,EAAU,SAAS,CAAC,IAAI,CAAC;AACjF,aAAO,KAAK,QAAQ,KAAK,UAAUgD,GAAWP,CAAK;AAAA,IACrD,CAAC,GACD/C,EAAc,MAAM,QAAQ,CAACuD,GAAgBC,MACpC,KAAK,MAAM,KAAK,UAAUD,GAAgBC,CAAW,CAC7D,GACDxD,EAAc,MAAM,UAAU,CAACyD,MAAc;AAC3C,YAAMC,IAAeC,EAAO,KAAK,UAAU;AAAA,QACzC,WAAAF;AAAA,QACA,aAAa,KAAK;AAAA,QAClB,QAAQ,KAAK;AAAA,MACrB,CAAO;AACD,aAAO,KAAK,KAAKC,CAAY;AAAA,IAC/B,CAAC,GACD1D,EAAc,MAAM,UAAU,MACrB,KAAK,UAAU,KAAK,QAAQ,CACpC,GACD,KAAK,WAAWD,EAAQ;AAAA,EAC1B;AAAA,EACA,aAAa6D,GAAkB;AAC7B,QAAI,MAAM,QAAQA,CAAgB,GAAG;AACnC,UAAIA,EAAiB,WAAW,EAAG,QAAO,CAAA;AAC1C,YAAMtD,IAAY,CAAA;AAClB,UAAIuD,IAAkB,KAAK,gBAAgB,KAAK,QAAQ;AACxD,eAAS,IAAI,GAAG,IAAID,EAAiB,QAAQ,KAAK;AAChD,cAAME,IAAeF,EAAiB,CAAC,GACjCG,IAAqBF,EAAgB,UAAU,CAACxB,MAAU,KAAK,aAAaA,CAAK,MAAMyB,CAAY;AACzG,YAAIC,MAAuB,GAAI;AAE/B,YADAzD,EAAU,KAAKyD,CAAkB,GAC7B,IAAIH,EAAiB,SAAS,GAAG;AACnC,gBAAMI,IAAcH,EAAgBE,CAAkB;AACtD,UAAAF,IAAkB,KAAK,gBAAgBG,CAAW;AAAA,QACpD;AAAA,MACF;AACA,aAAO1D;AAAA,IACT;AACE,aAAOmB,EAAc,KAAK,UAAU;AAAA,QAClC,aAAa,KAAK;AAAA,QAClB,WAAW,CAACtB,MAAS,KAAK,aAAaA,CAAI,MAAMyD;AAAA,MACzD,CAAO;AAAA,EAEL;AACF;AA6BA,SAASK,EAAeC,GAAO;AAC7B,QAAM1D,IAAW;AAAA,IACf,OAAO;AAAA,IACP,OAAO;AAAA,IACP,UAAU,CAAA;AAAA,EACd;AACE,SAAA0D,EAAM,QAAQ,CAACC,MAAS;AACtB,UAAMC,IAAQD,EAAK,MAAM,GAAG;AAC5B,QAAIH,IAAcxD;AAClB,IAAA4D,EAAM,QAAQ,CAACC,GAAMC,MAAU;AAC7B,UAAIC,IAAYP,EAAY,UAAU,KAAK,CAAC3B,MAAUA,EAAM,UAAUgC,CAAI;AAC1E,MAAKE,MACHA,IAAY;AAAA,QACV,OAAOH,EAAM,MAAM,GAAGE,IAAQ,CAAC,EAAE,KAAK,GAAG;AAAA,QACzC,OAAOD;AAAA,MACjB,GACQL,EAAY,aAAaA,EAAY,WAAW,CAAA,IAChDA,EAAY,SAAS,KAAKO,CAAS,IAErCP,IAAcO;AAAA,IAChB,CAAC;AAAA,EACH,CAAC,GACM,IAAI1E,EAAe,EAAE,UAAAW,GAAU;AACxC;AACA,IAAIJ,IAAkB;AAAA,EACpB,YAAYD,GAAM;AAChB,WAAI,OAAOA,KAAS,WAAiBA,IACjCqE,EAASrE,CAAI,KAAKsE,EAAQtE,GAAM,OAAO,IAAUA,EAAK,QACnD;AAAA,EACT;AAAA,EACA,aAAaA,GAAM;AACjB,WAAI,OAAOA,KAAS,WAAiBA,IACjCqE,EAASrE,CAAI,KAAKsE,EAAQtE,GAAM,OAAO,IAAUA,EAAK,QACnDC,EAAgB,YAAYD,CAAI;AAAA,EACzC;AAAA,EACA,eAAeA,GAAM;AACnB,WAAIqE,EAASrE,CAAI,KAAKsE,EAAQtE,GAAM,UAAU,IAAU,CAAC,CAACA,EAAK,WACxD;AAAA,EACT;AAAA,EACA,eAAeA,GAAM;AACnB,WAAOA,EAAK;AAAA,EACd;AAAA,EACA,oBAAoBA,GAAM;AACxB,QAAIqE,EAASrE,CAAI,KAAKsE,EAAQtE,GAAM,eAAe,EAAG,QAAOA,EAAK;AAAA,EACpE;AACF;","x_google_ignoreList":[0]}
+{"version":3,"file":"tree-collection.js","names":[],"sources":["../../../../../../../../../../node_modules/.bun/@zag-js+collection@1.35.3/node_modules/@zag-js/collection/dist/tree-collection.mjs"],"sourcesContent":["import {\n  __publicField\n} from \"./chunk-QZ7TP4HQ.mjs\";\n\n// src/tree-collection.ts\nimport { hasProp, isEqual, isObject } from \"@zag-js/utils\";\nimport {\n  access,\n  compareIndexPaths,\n  filter,\n  find,\n  findAll,\n  findIndexPath,\n  flatMap,\n  flatten,\n  insert,\n  move,\n  remove,\n  replace,\n  visit\n} from \"./tree-visit.mjs\";\nvar TreeCollection = class _TreeCollection {\n  constructor(options) {\n    this.options = options;\n    __publicField(this, \"rootNode\");\n    __publicField(this, \"isEqual\", (other) => {\n      return isEqual(this.rootNode, other.rootNode);\n    });\n    __publicField(this, \"getNodeChildren\", (node) => {\n      return this.options.nodeToChildren?.(node) ?? fallbackMethods.nodeToChildren(node) ?? [];\n    });\n    __publicField(this, \"resolveIndexPath\", (valueOrIndexPath) => {\n      return typeof valueOrIndexPath === \"string\" ? this.getIndexPath(valueOrIndexPath) : valueOrIndexPath;\n    });\n    __publicField(this, \"resolveNode\", (valueOrIndexPath) => {\n      const indexPath = this.resolveIndexPath(valueOrIndexPath);\n      return indexPath ? this.at(indexPath) : void 0;\n    });\n    __publicField(this, \"getNodeChildrenCount\", (node) => {\n      return this.options.nodeToChildrenCount?.(node) ?? fallbackMethods.nodeToChildrenCount(node);\n    });\n    __publicField(this, \"getNodeValue\", (node) => {\n      return this.options.nodeToValue?.(node) ?? fallbackMethods.nodeToValue(node);\n    });\n    __publicField(this, \"getNodeDisabled\", (node) => {\n      return this.options.isNodeDisabled?.(node) ?? fallbackMethods.isNodeDisabled(node);\n    });\n    __publicField(this, \"stringify\", (value) => {\n      const node = this.findNode(value);\n      if (!node) return null;\n      return this.stringifyNode(node);\n    });\n    __publicField(this, \"stringifyNode\", (node) => {\n      return this.options.nodeToString?.(node) ?? fallbackMethods.nodeToString(node);\n    });\n    __publicField(this, \"getFirstNode\", (rootNode = this.rootNode, opts = {}) => {\n      let firstChild;\n      visit(rootNode, {\n        getChildren: this.getNodeChildren,\n        onEnter: (node, indexPath) => {\n          if (this.isSameNode(node, rootNode)) return;\n          if (opts.skip?.({ value: this.getNodeValue(node), node, indexPath })) return \"skip\";\n          if (!firstChild && indexPath.length > 0 && !this.getNodeDisabled(node)) {\n            firstChild = node;\n            return \"stop\";\n          }\n        }\n      });\n      return firstChild;\n    });\n    __publicField(this, \"getLastNode\", (rootNode = this.rootNode, opts = {}) => {\n      let lastChild;\n      visit(rootNode, {\n        getChildren: this.getNodeChildren,\n        onEnter: (node, indexPath) => {\n          if (this.isSameNode(node, rootNode)) return;\n          if (opts.skip?.({ value: this.getNodeValue(node), node, indexPath })) return \"skip\";\n          if (indexPath.length > 0 && !this.getNodeDisabled(node)) {\n            lastChild = node;\n          }\n        }\n      });\n      return lastChild;\n    });\n    __publicField(this, \"at\", (indexPath) => {\n      return access(this.rootNode, indexPath, {\n        getChildren: this.getNodeChildren\n      });\n    });\n    __publicField(this, \"findNode\", (value, rootNode = this.rootNode) => {\n      return find(rootNode, {\n        getChildren: this.getNodeChildren,\n        predicate: (node) => this.getNodeValue(node) === value\n      });\n    });\n    __publicField(this, \"findNodes\", (values, rootNode = this.rootNode) => {\n      const v = new Set(values.filter((v2) => v2 != null));\n      return findAll(rootNode, {\n        getChildren: this.getNodeChildren,\n        predicate: (node) => v.has(this.getNodeValue(node))\n      });\n    });\n    __publicField(this, \"sort\", (values) => {\n      return values.reduce((acc, value) => {\n        const indexPath = this.getIndexPath(value);\n        if (indexPath) acc.push({ value, indexPath });\n        return acc;\n      }, []).sort((a, b) => compareIndexPaths(a.indexPath, b.indexPath)).map(({ value }) => value);\n    });\n    __publicField(this, \"getValue\", (indexPath) => {\n      const node = this.at(indexPath);\n      return node ? this.getNodeValue(node) : void 0;\n    });\n    __publicField(this, \"getValuePath\", (indexPath) => {\n      if (!indexPath) return [];\n      const valuePath = [];\n      let currentPath = [...indexPath];\n      while (currentPath.length > 0) {\n        const node = this.at(currentPath);\n        if (node) valuePath.unshift(this.getNodeValue(node));\n        currentPath.pop();\n      }\n      return valuePath;\n    });\n    __publicField(this, \"getDepth\", (value) => {\n      const indexPath = findIndexPath(this.rootNode, {\n        getChildren: this.getNodeChildren,\n        predicate: (node) => this.getNodeValue(node) === value\n      });\n      return indexPath?.length ?? 0;\n    });\n    __publicField(this, \"isSameNode\", (node, other) => {\n      return this.getNodeValue(node) === this.getNodeValue(other);\n    });\n    __publicField(this, \"isRootNode\", (node) => {\n      return this.isSameNode(node, this.rootNode);\n    });\n    __publicField(this, \"contains\", (parentIndexPath, valueIndexPath) => {\n      if (!parentIndexPath || !valueIndexPath) return false;\n      return valueIndexPath.slice(0, parentIndexPath.length).every((_, i) => parentIndexPath[i] === valueIndexPath[i]);\n    });\n    __publicField(this, \"getNextNode\", (value, opts = {}) => {\n      let found = false;\n      let nextNode;\n      visit(this.rootNode, {\n        getChildren: this.getNodeChildren,\n        onEnter: (node, indexPath) => {\n          if (this.isRootNode(node)) return;\n          const nodeValue = this.getNodeValue(node);\n          if (opts.skip?.({ value: nodeValue, node, indexPath })) {\n            if (nodeValue === value) {\n              found = true;\n            }\n            return \"skip\";\n          }\n          if (found && !this.getNodeDisabled(node)) {\n            nextNode = node;\n            return \"stop\";\n          }\n          if (nodeValue === value) {\n            found = true;\n          }\n        }\n      });\n      return nextNode;\n    });\n    __publicField(this, \"getPreviousNode\", (value, opts = {}) => {\n      let previousNode;\n      let found = false;\n      visit(this.rootNode, {\n        getChildren: this.getNodeChildren,\n        onEnter: (node, indexPath) => {\n          if (this.isRootNode(node)) return;\n          const nodeValue = this.getNodeValue(node);\n          if (opts.skip?.({ value: nodeValue, node, indexPath })) {\n            return \"skip\";\n          }\n          if (nodeValue === value) {\n            found = true;\n            return \"stop\";\n          }\n          if (!this.getNodeDisabled(node)) {\n            previousNode = node;\n          }\n        }\n      });\n      return found ? previousNode : void 0;\n    });\n    __publicField(this, \"getParentNodes\", (valueOrIndexPath) => {\n      const indexPath = this.resolveIndexPath(valueOrIndexPath)?.slice();\n      if (!indexPath) return [];\n      const result = [];\n      while (indexPath.length > 0) {\n        indexPath.pop();\n        const parentNode = this.at(indexPath);\n        if (parentNode && !this.isRootNode(parentNode)) {\n          result.unshift(parentNode);\n        }\n      }\n      return result;\n    });\n    __publicField(this, \"getDescendantNodes\", (valueOrIndexPath, options) => {\n      const parentNode = this.resolveNode(valueOrIndexPath);\n      if (!parentNode) return [];\n      const result = [];\n      visit(parentNode, {\n        getChildren: this.getNodeChildren,\n        onEnter: (node, nodeIndexPath) => {\n          if (nodeIndexPath.length === 0) return;\n          if (!options?.withBranch && this.isBranchNode(node)) return;\n          result.push(node);\n        }\n      });\n      return result;\n    });\n    __publicField(this, \"getDescendantValues\", (valueOrIndexPath, options) => {\n      const children = this.getDescendantNodes(valueOrIndexPath, options);\n      return children.map((child) => this.getNodeValue(child));\n    });\n    __publicField(this, \"getParentIndexPath\", (indexPath) => {\n      return indexPath.slice(0, -1);\n    });\n    __publicField(this, \"getParentNode\", (valueOrIndexPath) => {\n      const indexPath = this.resolveIndexPath(valueOrIndexPath);\n      return indexPath ? this.at(this.getParentIndexPath(indexPath)) : void 0;\n    });\n    __publicField(this, \"visit\", (opts) => {\n      const { skip, ...rest } = opts;\n      visit(this.rootNode, {\n        ...rest,\n        getChildren: this.getNodeChildren,\n        onEnter: (node, indexPath) => {\n          if (this.isRootNode(node)) return;\n          if (skip?.({ value: this.getNodeValue(node), node, indexPath })) return \"skip\";\n          return rest.onEnter?.(node, indexPath);\n        }\n      });\n    });\n    __publicField(this, \"getPreviousSibling\", (indexPath) => {\n      const parentNode = this.getParentNode(indexPath);\n      if (!parentNode) return;\n      const siblings = this.getNodeChildren(parentNode);\n      let idx = indexPath[indexPath.length - 1];\n      while (--idx >= 0) {\n        const sibling = siblings[idx];\n        if (!this.getNodeDisabled(sibling)) return sibling;\n      }\n      return;\n    });\n    __publicField(this, \"getNextSibling\", (indexPath) => {\n      const parentNode = this.getParentNode(indexPath);\n      if (!parentNode) return;\n      const siblings = this.getNodeChildren(parentNode);\n      let idx = indexPath[indexPath.length - 1];\n      while (++idx < siblings.length) {\n        const sibling = siblings[idx];\n        if (!this.getNodeDisabled(sibling)) return sibling;\n      }\n      return;\n    });\n    __publicField(this, \"getSiblingNodes\", (indexPath) => {\n      const parentNode = this.getParentNode(indexPath);\n      return parentNode ? this.getNodeChildren(parentNode) : [];\n    });\n    __publicField(this, \"getValues\", (rootNode = this.rootNode) => {\n      const values = flatMap(rootNode, {\n        getChildren: this.getNodeChildren,\n        transform: (node) => [this.getNodeValue(node)]\n      });\n      return values.slice(1);\n    });\n    __publicField(this, \"isValidDepth\", (indexPath, depth) => {\n      if (depth == null) return true;\n      if (typeof depth === \"function\") return depth(indexPath.length);\n      return indexPath.length === depth;\n    });\n    __publicField(this, \"isBranchNode\", (node) => {\n      return this.getNodeChildren(node).length > 0 || this.getNodeChildrenCount(node) != null;\n    });\n    __publicField(this, \"getBranchValues\", (rootNode = this.rootNode, opts = {}) => {\n      let values = [];\n      visit(rootNode, {\n        getChildren: this.getNodeChildren,\n        onEnter: (node, indexPath) => {\n          if (indexPath.length === 0) return;\n          const nodeValue = this.getNodeValue(node);\n          if (opts.skip?.({ value: nodeValue, node, indexPath })) return \"skip\";\n          if (this.isBranchNode(node) && this.isValidDepth(indexPath, opts.depth)) {\n            values.push(this.getNodeValue(node));\n          }\n        }\n      });\n      return values;\n    });\n    __publicField(this, \"flatten\", (rootNode = this.rootNode) => {\n      return flatten(rootNode, { getChildren: this.getNodeChildren });\n    });\n    __publicField(this, \"_create\", (node, children) => {\n      if (this.getNodeChildren(node).length > 0 || children.length > 0) {\n        return { ...node, children };\n      }\n      return { ...node };\n    });\n    __publicField(this, \"_insert\", (rootNode, indexPath, nodes) => {\n      return this.copy(\n        insert(rootNode, { at: indexPath, nodes, getChildren: this.getNodeChildren, create: this._create })\n      );\n    });\n    __publicField(this, \"copy\", (rootNode) => {\n      return new _TreeCollection({ ...this.options, rootNode });\n    });\n    __publicField(this, \"_replace\", (rootNode, indexPath, node) => {\n      return this.copy(\n        replace(rootNode, { at: indexPath, node, getChildren: this.getNodeChildren, create: this._create })\n      );\n    });\n    __publicField(this, \"_move\", (rootNode, indexPaths, to) => {\n      return this.copy(move(rootNode, { indexPaths, to, getChildren: this.getNodeChildren, create: this._create }));\n    });\n    __publicField(this, \"_remove\", (rootNode, indexPaths) => {\n      return this.copy(remove(rootNode, { indexPaths, getChildren: this.getNodeChildren, create: this._create }));\n    });\n    __publicField(this, \"replace\", (indexPath, node) => {\n      return this._replace(this.rootNode, indexPath, node);\n    });\n    __publicField(this, \"remove\", (indexPaths) => {\n      return this._remove(this.rootNode, indexPaths);\n    });\n    __publicField(this, \"insertBefore\", (indexPath, nodes) => {\n      const parentNode = this.getParentNode(indexPath);\n      return parentNode ? this._insert(this.rootNode, indexPath, nodes) : void 0;\n    });\n    __publicField(this, \"insertAfter\", (indexPath, nodes) => {\n      const parentNode = this.getParentNode(indexPath);\n      if (!parentNode) return;\n      const nextIndex = [...indexPath.slice(0, -1), indexPath[indexPath.length - 1] + 1];\n      return this._insert(this.rootNode, nextIndex, nodes);\n    });\n    __publicField(this, \"move\", (fromIndexPaths, toIndexPath) => {\n      return this._move(this.rootNode, fromIndexPaths, toIndexPath);\n    });\n    __publicField(this, \"filter\", (predicate) => {\n      const filteredRoot = filter(this.rootNode, {\n        predicate,\n        getChildren: this.getNodeChildren,\n        create: this._create\n      });\n      return this.copy(filteredRoot);\n    });\n    __publicField(this, \"toJSON\", () => {\n      return this.getValues(this.rootNode);\n    });\n    this.rootNode = options.rootNode;\n  }\n  getIndexPath(valueOrValuePath) {\n    if (Array.isArray(valueOrValuePath)) {\n      if (valueOrValuePath.length === 0) return [];\n      const indexPath = [];\n      let currentChildren = this.getNodeChildren(this.rootNode);\n      for (let i = 0; i < valueOrValuePath.length; i++) {\n        const currentValue = valueOrValuePath[i];\n        const matchingChildIndex = currentChildren.findIndex((child) => this.getNodeValue(child) === currentValue);\n        if (matchingChildIndex === -1) break;\n        indexPath.push(matchingChildIndex);\n        if (i < valueOrValuePath.length - 1) {\n          const currentNode = currentChildren[matchingChildIndex];\n          currentChildren = this.getNodeChildren(currentNode);\n        }\n      }\n      return indexPath;\n    } else {\n      return findIndexPath(this.rootNode, {\n        getChildren: this.getNodeChildren,\n        predicate: (node) => this.getNodeValue(node) === valueOrValuePath\n      });\n    }\n  }\n};\nfunction flattenedToTree(nodes, options = fallbackMethods) {\n  if (nodes.length === 0) {\n    throw new Error(\"[zag-js/tree] Cannot create tree from empty flattened array\");\n  }\n  const rootFlatNode = nodes.find((node) => node._parent === void 0);\n  if (!rootFlatNode) {\n    throw new Error(\"[zag-js/tree] No root node found in flattened data\");\n  }\n  const nodeMap = /* @__PURE__ */ new Map();\n  nodes.forEach((node) => {\n    nodeMap.set(node._index, node);\n  });\n  const buildNode = (idx) => {\n    const flatNode = nodeMap.get(idx);\n    if (!flatNode) return {};\n    const { _children, _parent, _index, ...cleanNode } = flatNode;\n    const children = [];\n    _children?.forEach((childIndex) => {\n      children.push(buildNode(childIndex));\n    });\n    return {\n      ...cleanNode,\n      ...children.length > 0 && { children }\n    };\n  };\n  const rootNode = buildNode(rootFlatNode._index);\n  return new TreeCollection({ ...options, rootNode });\n}\nfunction filePathToTree(paths) {\n  const rootNode = {\n    label: \"\",\n    value: \"ROOT\",\n    children: []\n  };\n  paths.forEach((path) => {\n    const parts = path.split(\"/\");\n    let currentNode = rootNode;\n    parts.forEach((part, index) => {\n      let childNode = currentNode.children?.find((child) => child.label === part);\n      if (!childNode) {\n        childNode = {\n          value: parts.slice(0, index + 1).join(\"/\"),\n          label: part\n        };\n        currentNode.children || (currentNode.children = []);\n        currentNode.children.push(childNode);\n      }\n      currentNode = childNode;\n    });\n  });\n  return new TreeCollection({ rootNode });\n}\nvar fallbackMethods = {\n  nodeToValue(node) {\n    if (typeof node === \"string\") return node;\n    if (isObject(node) && hasProp(node, \"value\")) return node.value;\n    return \"\";\n  },\n  nodeToString(node) {\n    if (typeof node === \"string\") return node;\n    if (isObject(node) && hasProp(node, \"label\")) return node.label;\n    return fallbackMethods.nodeToValue(node);\n  },\n  isNodeDisabled(node) {\n    if (isObject(node) && hasProp(node, \"disabled\")) return !!node.disabled;\n    return false;\n  },\n  nodeToChildren(node) {\n    return node.children;\n  },\n  nodeToChildrenCount(node) {\n    if (isObject(node) && hasProp(node, \"childrenCount\")) return node.childrenCount;\n  }\n};\nexport {\n  TreeCollection,\n  filePathToTree,\n  flattenedToTree\n};\n"],"x_google_ignoreList":[0],"mappings":";;;;;AAqBA,IAAI,IAAiB,MAAM,EAAgB;CACzC,YAAY,GAAS;AA0UnB,EAzUA,KAAK,UAAU,GACf,EAAc,MAAM,WAAW,EAC/B,EAAc,MAAM,YAAY,MACvB,EAAQ,KAAK,UAAU,EAAM,SAAS,CAC7C,EACF,EAAc,MAAM,oBAAoB,MAC/B,KAAK,QAAQ,iBAAiB,EAAK,IAAI,EAAgB,eAAe,EAAK,IAAI,EAAE,CACxF,EACF,EAAc,MAAM,qBAAqB,MAChC,OAAO,KAAqB,WAAW,KAAK,aAAa,EAAiB,GAAG,EACpF,EACF,EAAc,MAAM,gBAAgB,MAAqB;GACvD,IAAM,IAAY,KAAK,iBAAiB,EAAiB;AACzD,UAAO,IAAY,KAAK,GAAG,EAAU,GAAG,KAAK;IAC7C,EACF,EAAc,MAAM,yBAAyB,MACpC,KAAK,QAAQ,sBAAsB,EAAK,IAAI,EAAgB,oBAAoB,EAAK,CAC5F,EACF,EAAc,MAAM,iBAAiB,MAC5B,KAAK,QAAQ,cAAc,EAAK,IAAI,EAAgB,YAAY,EAAK,CAC5E,EACF,EAAc,MAAM,oBAAoB,MAC/B,KAAK,QAAQ,iBAAiB,EAAK,IAAI,EAAgB,eAAe,EAAK,CAClF,EACF,EAAc,MAAM,cAAc,MAAU;GAC1C,IAAM,IAAO,KAAK,SAAS,EAAM;AAEjC,UADK,IACE,KAAK,cAAc,EAAK,GADb;IAElB,EACF,EAAc,MAAM,kBAAkB,MAC7B,KAAK,QAAQ,eAAe,EAAK,IAAI,EAAgB,aAAa,EAAK,CAC9E,EACF,EAAc,MAAM,iBAAiB,IAAW,KAAK,UAAU,IAAO,EAAE,KAAK;GAC3E,IAAI;AAYJ,UAXA,EAAM,GAAU;IACd,aAAa,KAAK;IAClB,UAAU,GAAM,MAAc;AACxB,eAAK,WAAW,GAAM,EAAS,EACnC;UAAI,EAAK,OAAO;OAAE,OAAO,KAAK,aAAa,EAAK;OAAE;OAAM;OAAW,CAAC,CAAE,QAAO;AAC7E,UAAI,CAAC,KAAc,EAAU,SAAS,KAAK,CAAC,KAAK,gBAAgB,EAAK,CAEpE,QADA,IAAa,GACN;;;IAGZ,CAAC,EACK;IACP,EACF,EAAc,MAAM,gBAAgB,IAAW,KAAK,UAAU,IAAO,EAAE,KAAK;GAC1E,IAAI;AAWJ,UAVA,EAAM,GAAU;IACd,aAAa,KAAK;IAClB,UAAU,GAAM,MAAc;AACxB,eAAK,WAAW,GAAM,EAAS,EACnC;UAAI,EAAK,OAAO;OAAE,OAAO,KAAK,aAAa,EAAK;OAAE;OAAM;OAAW,CAAC,CAAE,QAAO;AAC7E,MAAI,EAAU,SAAS,KAAK,CAAC,KAAK,gBAAgB,EAAK,KACrD,IAAY;;;IAGjB,CAAC,EACK;IACP,EACF,EAAc,MAAM,OAAO,MAClB,EAAO,KAAK,UAAU,GAAW,EACtC,aAAa,KAAK,iBACnB,CAAC,CACF,EACF,EAAc,MAAM,aAAa,GAAO,IAAW,KAAK,aAC/C,EAAK,GAAU;GACpB,aAAa,KAAK;GAClB,YAAY,MAAS,KAAK,aAAa,EAAK,KAAK;GAClD,CAAC,CACF,EACF,EAAc,MAAM,cAAc,GAAQ,IAAW,KAAK,aAAa;GACrE,IAAM,IAAI,IAAI,IAAI,EAAO,QAAQ,MAAO,KAAM,KAAK,CAAC;AACpD,UAAO,EAAQ,GAAU;IACvB,aAAa,KAAK;IAClB,YAAY,MAAS,EAAE,IAAI,KAAK,aAAa,EAAK,CAAC;IACpD,CAAC;IACF,EACF,EAAc,MAAM,SAAS,MACpB,EAAO,QAAQ,GAAK,MAAU;GACnC,IAAM,IAAY,KAAK,aAAa,EAAM;AAE1C,UADI,KAAW,EAAI,KAAK;IAAE;IAAO;IAAW,CAAC,EACtC;KACN,EAAE,CAAC,CAAC,MAAM,GAAG,MAAM,EAAkB,EAAE,WAAW,EAAE,UAAU,CAAC,CAAC,KAAK,EAAE,eAAY,EAAM,CAC5F,EACF,EAAc,MAAM,aAAa,MAAc;GAC7C,IAAM,IAAO,KAAK,GAAG,EAAU;AAC/B,UAAO,IAAO,KAAK,aAAa,EAAK,GAAG,KAAK;IAC7C,EACF,EAAc,MAAM,iBAAiB,MAAc;AACjD,OAAI,CAAC,EAAW,QAAO,EAAE;GACzB,IAAM,IAAY,EAAE,EAChB,IAAc,CAAC,GAAG,EAAU;AAChC,UAAO,EAAY,SAAS,IAAG;IAC7B,IAAM,IAAO,KAAK,GAAG,EAAY;AAEjC,IADI,KAAM,EAAU,QAAQ,KAAK,aAAa,EAAK,CAAC,EACpD,EAAY,KAAK;;AAEnB,UAAO;IACP,EACF,EAAc,MAAM,aAAa,MACb,EAAc,KAAK,UAAU;GAC7C,aAAa,KAAK;GAClB,YAAY,MAAS,KAAK,aAAa,EAAK,KAAK;GAClD,CAAC,EACgB,UAAU,EAC5B,EACF,EAAc,MAAM,eAAe,GAAM,MAChC,KAAK,aAAa,EAAK,KAAK,KAAK,aAAa,EAAM,CAC3D,EACF,EAAc,MAAM,eAAe,MAC1B,KAAK,WAAW,GAAM,KAAK,SAAS,CAC3C,EACF,EAAc,MAAM,aAAa,GAAiB,MAC5C,CAAC,KAAmB,CAAC,IAAuB,KACzC,EAAe,MAAM,GAAG,EAAgB,OAAO,CAAC,OAAO,GAAG,MAAM,EAAgB,OAAO,EAAe,GAAG,CAChH,EACF,EAAc,MAAM,gBAAgB,GAAO,IAAO,EAAE,KAAK;GACvD,IAAI,IAAQ,IACR;AAqBJ,UApBA,EAAM,KAAK,UAAU;IACnB,aAAa,KAAK;IAClB,UAAU,GAAM,MAAc;AAC5B,SAAI,KAAK,WAAW,EAAK,CAAE;KAC3B,IAAM,IAAY,KAAK,aAAa,EAAK;AACzC,SAAI,EAAK,OAAO;MAAE,OAAO;MAAW;MAAM;MAAW,CAAC,CAIpD,QAHI,MAAc,MAChB,IAAQ,KAEH;AAET,SAAI,KAAS,CAAC,KAAK,gBAAgB,EAAK,CAEtC,QADA,IAAW,GACJ;AAET,KAAI,MAAc,MAChB,IAAQ;;IAGb,CAAC,EACK;IACP,EACF,EAAc,MAAM,oBAAoB,GAAO,IAAO,EAAE,KAAK;GAC3D,IAAI,GACA,IAAQ;AAkBZ,UAjBA,EAAM,KAAK,UAAU;IACnB,aAAa,KAAK;IAClB,UAAU,GAAM,MAAc;AAC5B,SAAI,KAAK,WAAW,EAAK,CAAE;KAC3B,IAAM,IAAY,KAAK,aAAa,EAAK;AACzC,SAAI,EAAK,OAAO;MAAE,OAAO;MAAW;MAAM;MAAW,CAAC,CACpD,QAAO;AAET,SAAI,MAAc,EAEhB,QADA,IAAQ,IACD;AAET,KAAK,KAAK,gBAAgB,EAAK,KAC7B,IAAe;;IAGpB,CAAC,EACK,IAAQ,IAAe,KAAK;IACnC,EACF,EAAc,MAAM,mBAAmB,MAAqB;GAC1D,IAAM,IAAY,KAAK,iBAAiB,EAAiB,EAAE,OAAO;AAClE,OAAI,CAAC,EAAW,QAAO,EAAE;GACzB,IAAM,IAAS,EAAE;AACjB,UAAO,EAAU,SAAS,IAAG;AAC3B,MAAU,KAAK;IACf,IAAM,IAAa,KAAK,GAAG,EAAU;AACrC,IAAI,KAAc,CAAC,KAAK,WAAW,EAAW,IAC5C,EAAO,QAAQ,EAAW;;AAG9B,UAAO;IACP,EACF,EAAc,MAAM,uBAAuB,GAAkB,MAAY;GACvE,IAAM,IAAa,KAAK,YAAY,EAAiB;AACrD,OAAI,CAAC,EAAY,QAAO,EAAE;GAC1B,IAAM,IAAS,EAAE;AASjB,UARA,EAAM,GAAY;IAChB,aAAa,KAAK;IAClB,UAAU,GAAM,MAAkB;AAC5B,OAAc,WAAW,MACzB,CAAC,GAAS,cAAc,KAAK,aAAa,EAAK,IACnD,EAAO,KAAK,EAAK;;IAEpB,CAAC,EACK;IACP,EACF,EAAc,MAAM,wBAAwB,GAAkB,MAC3C,KAAK,mBAAmB,GAAkB,EAAQ,CACnD,KAAK,MAAU,KAAK,aAAa,EAAM,CAAC,CACxD,EACF,EAAc,MAAM,uBAAuB,MAClC,EAAU,MAAM,GAAG,GAAG,CAC7B,EACF,EAAc,MAAM,kBAAkB,MAAqB;GACzD,IAAM,IAAY,KAAK,iBAAiB,EAAiB;AACzD,UAAO,IAAY,KAAK,GAAG,KAAK,mBAAmB,EAAU,CAAC,GAAG,KAAK;IACtE,EACF,EAAc,MAAM,UAAU,MAAS;GACrC,IAAM,EAAE,SAAM,GAAG,MAAS;AAC1B,KAAM,KAAK,UAAU;IACnB,GAAG;IACH,aAAa,KAAK;IAClB,UAAU,GAAM,MAAc;AACxB,eAAK,WAAW,EAAK,CAEzB,QADI,IAAO;MAAE,OAAO,KAAK,aAAa,EAAK;MAAE;MAAM;MAAW,CAAC,GAAS,SACjE,EAAK,UAAU,GAAM,EAAU;;IAEzC,CAAC;IACF,EACF,EAAc,MAAM,uBAAuB,MAAc;GACvD,IAAM,IAAa,KAAK,cAAc,EAAU;AAChD,OAAI,CAAC,EAAY;GACjB,IAAM,IAAW,KAAK,gBAAgB,EAAW,EAC7C,IAAM,EAAU,EAAU,SAAS;AACvC,UAAO,EAAE,KAAO,IAAG;IACjB,IAAM,IAAU,EAAS;AACzB,QAAI,CAAC,KAAK,gBAAgB,EAAQ,CAAE,QAAO;;IAG7C,EACF,EAAc,MAAM,mBAAmB,MAAc;GACnD,IAAM,IAAa,KAAK,cAAc,EAAU;AAChD,OAAI,CAAC,EAAY;GACjB,IAAM,IAAW,KAAK,gBAAgB,EAAW,EAC7C,IAAM,EAAU,EAAU,SAAS;AACvC,UAAO,EAAE,IAAM,EAAS,SAAQ;IAC9B,IAAM,IAAU,EAAS;AACzB,QAAI,CAAC,KAAK,gBAAgB,EAAQ,CAAE,QAAO;;IAG7C,EACF,EAAc,MAAM,oBAAoB,MAAc;GACpD,IAAM,IAAa,KAAK,cAAc,EAAU;AAChD,UAAO,IAAa,KAAK,gBAAgB,EAAW,GAAG,EAAE;IACzD,EACF,EAAc,MAAM,cAAc,IAAW,KAAK,aACjC,EAAQ,GAAU;GAC/B,aAAa,KAAK;GAClB,YAAY,MAAS,CAAC,KAAK,aAAa,EAAK,CAAC;GAC/C,CAAC,CACY,MAAM,EAAE,CACtB,EACF,EAAc,MAAM,iBAAiB,GAAW,MAC1C,KAAS,OAAa,KACtB,OAAO,KAAU,aAAmB,EAAM,EAAU,OAAO,GACxD,EAAU,WAAW,EAC5B,EACF,EAAc,MAAM,iBAAiB,MAC5B,KAAK,gBAAgB,EAAK,CAAC,SAAS,KAAK,KAAK,qBAAqB,EAAK,IAAI,KACnF,EACF,EAAc,MAAM,oBAAoB,IAAW,KAAK,UAAU,IAAO,EAAE,KAAK;GAC9E,IAAI,IAAS,EAAE;AAYf,UAXA,EAAM,GAAU;IACd,aAAa,KAAK;IAClB,UAAU,GAAM,MAAc;AAC5B,SAAI,EAAU,WAAW,EAAG;KAC5B,IAAM,IAAY,KAAK,aAAa,EAAK;AACzC,SAAI,EAAK,OAAO;MAAE,OAAO;MAAW;MAAM;MAAW,CAAC,CAAE,QAAO;AAC/D,KAAI,KAAK,aAAa,EAAK,IAAI,KAAK,aAAa,GAAW,EAAK,MAAM,IACrE,EAAO,KAAK,KAAK,aAAa,EAAK,CAAC;;IAGzC,CAAC,EACK;IACP,EACF,EAAc,MAAM,YAAY,IAAW,KAAK,aACvC,EAAQ,GAAU,EAAE,aAAa,KAAK,iBAAiB,CAAC,CAC/D,EACF,EAAc,MAAM,YAAY,GAAM,MAChC,KAAK,gBAAgB,EAAK,CAAC,SAAS,KAAK,EAAS,SAAS,IACtD;GAAE,GAAG;GAAM;GAAU,GAEvB,EAAE,GAAG,GAAM,CAClB,EACF,EAAc,MAAM,YAAY,GAAU,GAAW,MAC5C,KAAK,KACV,EAAO,GAAU;GAAE,IAAI;GAAW;GAAO,aAAa,KAAK;GAAiB,QAAQ,KAAK;GAAS,CAAC,CACpG,CACD,EACF,EAAc,MAAM,SAAS,MACpB,IAAI,EAAgB;GAAE,GAAG,KAAK;GAAS;GAAU,CAAC,CACzD,EACF,EAAc,MAAM,aAAa,GAAU,GAAW,MAC7C,KAAK,KACV,EAAQ,GAAU;GAAE,IAAI;GAAW;GAAM,aAAa,KAAK;GAAiB,QAAQ,KAAK;GAAS,CAAC,CACpG,CACD,EACF,EAAc,MAAM,UAAU,GAAU,GAAY,MAC3C,KAAK,KAAK,EAAK,GAAU;GAAE;GAAY;GAAI,aAAa,KAAK;GAAiB,QAAQ,KAAK;GAAS,CAAC,CAAC,CAC7G,EACF,EAAc,MAAM,YAAY,GAAU,MACjC,KAAK,KAAK,EAAO,GAAU;GAAE;GAAY,aAAa,KAAK;GAAiB,QAAQ,KAAK;GAAS,CAAC,CAAC,CAC3G,EACF,EAAc,MAAM,YAAY,GAAW,MAClC,KAAK,SAAS,KAAK,UAAU,GAAW,EAAK,CACpD,EACF,EAAc,MAAM,WAAW,MACtB,KAAK,QAAQ,KAAK,UAAU,EAAW,CAC9C,EACF,EAAc,MAAM,iBAAiB,GAAW,MAC3B,KAAK,cAAc,EAAU,GAC5B,KAAK,QAAQ,KAAK,UAAU,GAAW,EAAM,GAAG,KAAK,EACzE,EACF,EAAc,MAAM,gBAAgB,GAAW,MAAU;AAEvD,OAAI,CADe,KAAK,cAAc,EAAU,CAC/B;GACjB,IAAM,IAAY,CAAC,GAAG,EAAU,MAAM,GAAG,GAAG,EAAE,EAAU,EAAU,SAAS,KAAK,EAAE;AAClF,UAAO,KAAK,QAAQ,KAAK,UAAU,GAAW,EAAM;IACpD,EACF,EAAc,MAAM,SAAS,GAAgB,MACpC,KAAK,MAAM,KAAK,UAAU,GAAgB,EAAY,CAC7D,EACF,EAAc,MAAM,WAAW,MAAc;GAC3C,IAAM,IAAe,EAAO,KAAK,UAAU;IACzC;IACA,aAAa,KAAK;IAClB,QAAQ,KAAK;IACd,CAAC;AACF,UAAO,KAAK,KAAK,EAAa;IAC9B,EACF,EAAc,MAAM,gBACX,KAAK,UAAU,KAAK,SAAS,CACpC,EACF,KAAK,WAAW,EAAQ;;CAE1B,aAAa,GAAkB;AAC7B,MAAI,MAAM,QAAQ,EAAiB,EAAE;AACnC,OAAI,EAAiB,WAAW,EAAG,QAAO,EAAE;GAC5C,IAAM,IAAY,EAAE,EAChB,IAAkB,KAAK,gBAAgB,KAAK,SAAS;AACzD,QAAK,IAAI,IAAI,GAAG,IAAI,EAAiB,QAAQ,KAAK;IAChD,IAAM,IAAe,EAAiB,IAChC,IAAqB,EAAgB,WAAW,MAAU,KAAK,aAAa,EAAM,KAAK,EAAa;AAC1G,QAAI,MAAuB,GAAI;AAE/B,QADA,EAAU,KAAK,EAAmB,EAC9B,IAAI,EAAiB,SAAS,GAAG;KACnC,IAAM,IAAc,EAAgB;AACpC,SAAkB,KAAK,gBAAgB,EAAY;;;AAGvD,UAAO;QAEP,QAAO,EAAc,KAAK,UAAU;GAClC,aAAa,KAAK;GAClB,YAAY,MAAS,KAAK,aAAa,EAAK,KAAK;GAClD,CAAC;;;AAgCR,SAAS,EAAe,GAAO;CAC7B,IAAM,IAAW;EACf,OAAO;EACP,OAAO;EACP,UAAU,EAAE;EACb;AAiBD,QAhBA,EAAM,SAAS,MAAS;EACtB,IAAM,IAAQ,EAAK,MAAM,IAAI,EACzB,IAAc;AAClB,IAAM,SAAS,GAAM,MAAU;GAC7B,IAAI,IAAY,EAAY,UAAU,MAAM,MAAU,EAAM,UAAU,EAAK;AAS3E,GARK,MACH,IAAY;IACV,OAAO,EAAM,MAAM,GAAG,IAAQ,EAAE,CAAC,KAAK,IAAI;IAC1C,OAAO;IACR,EACD,AAAyB,EAAY,aAAW,EAAE,EAClD,EAAY,SAAS,KAAK,EAAU,GAEtC,IAAc;IACd;GACF,EACK,IAAI,EAAe,EAAE,aAAU,CAAC;;AAEzC,IAAI,IAAkB;CACpB,YAAY,GAAM;AAGhB,SAFI,OAAO,KAAS,WAAiB,IACjC,EAAS,EAAK,IAAI,EAAQ,GAAM,QAAQ,GAAS,EAAK,QACnD;;CAET,aAAa,GAAM;AAGjB,SAFI,OAAO,KAAS,WAAiB,IACjC,EAAS,EAAK,IAAI,EAAQ,GAAM,QAAQ,GAAS,EAAK,QACnD,EAAgB,YAAY,EAAK;;CAE1C,eAAe,GAAM;AAEnB,SADI,EAAS,EAAK,IAAI,EAAQ,GAAM,WAAW,GAAS,CAAC,CAAC,EAAK,WACxD;;CAET,eAAe,GAAM;AACnB,SAAO,EAAK;;CAEd,oBAAoB,GAAM;AACxB,MAAI,EAAS,EAAK,IAAI,EAAQ,GAAM,gBAAgB,CAAE,QAAO,EAAK;;CAErE"}