@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

@@ -1,238 +1,272 @@
-import { __publicField as s } from "./chunk-QZ7TP4HQ.js";
-import { findIndexPath as c, visit as u, access as p, find as C, findAll as v, compareIndexPaths as V, flatMap as b, flatten as m, insert as T, replace as _, move as y, remove as D, filter as k } from "./tree-visit.js";
-import { isEqual as E } from "../../../../../@zag-js_utils@1.35.3/node_modules/@zag-js/utils/dist/equal.js";
-import { isObject as N, hasProp as a } from "../../../../../@zag-js_utils@1.35.3/node_modules/@zag-js/utils/dist/guard.js";
-var S = class f {
-  constructor(l) {
-    this.options = l, s(this, "rootNode"), s(this, "isEqual", (e) => E(this.rootNode, e.rootNode)), s(this, "getNodeChildren", (e) => this.options.nodeToChildren?.(e) ?? g.nodeToChildren(e) ?? []), s(this, "resolveIndexPath", (e) => typeof e == "string" ? this.getIndexPath(e) : e), s(this, "resolveNode", (e) => {
-      const t = this.resolveIndexPath(e);
-      return t ? this.at(t) : void 0;
-    }), s(this, "getNodeChildrenCount", (e) => this.options.nodeToChildrenCount?.(e) ?? g.nodeToChildrenCount(e)), s(this, "getNodeValue", (e) => this.options.nodeToValue?.(e) ?? g.nodeToValue(e)), s(this, "getNodeDisabled", (e) => this.options.isNodeDisabled?.(e) ?? g.isNodeDisabled(e)), s(this, "stringify", (e) => {
-      const t = this.findNode(e);
-      return t ? this.stringifyNode(t) : null;
-    }), s(this, "stringifyNode", (e) => this.options.nodeToString?.(e) ?? g.nodeToString(e)), s(this, "getFirstNode", (e = this.rootNode, t = {}) => {
-      let i;
-      return u(e, {
-        getChildren: this.getNodeChildren,
-        onEnter: (r, o) => {
-          if (!this.isSameNode(r, e)) {
-            if (t.skip?.({ value: this.getNodeValue(r), node: r, indexPath: o })) return "skip";
-            if (!i && o.length > 0 && !this.getNodeDisabled(r))
-              return i = r, "stop";
-          }
-        }
-      }), i;
-    }), s(this, "getLastNode", (e = this.rootNode, t = {}) => {
-      let i;
-      return u(e, {
-        getChildren: this.getNodeChildren,
-        onEnter: (r, o) => {
-          if (!this.isSameNode(r, e)) {
-            if (t.skip?.({ value: this.getNodeValue(r), node: r, indexPath: o })) return "skip";
-            o.length > 0 && !this.getNodeDisabled(r) && (i = r);
-          }
-        }
-      }), i;
-    }), s(this, "at", (e) => p(this.rootNode, e, {
-      getChildren: this.getNodeChildren
-    })), s(this, "findNode", (e, t = this.rootNode) => C(t, {
-      getChildren: this.getNodeChildren,
-      predicate: (i) => this.getNodeValue(i) === e
-    })), s(this, "findNodes", (e, t = this.rootNode) => {
-      const i = new Set(e.filter((r) => r != null));
-      return v(t, {
-        getChildren: this.getNodeChildren,
-        predicate: (r) => i.has(this.getNodeValue(r))
-      });
-    }), s(this, "sort", (e) => e.reduce((t, i) => {
-      const r = this.getIndexPath(i);
-      return r && t.push({ value: i, indexPath: r }), t;
-    }, []).sort((t, i) => V(t.indexPath, i.indexPath)).map(({ value: t }) => t)), s(this, "getValue", (e) => {
-      const t = this.at(e);
-      return t ? this.getNodeValue(t) : void 0;
-    }), s(this, "getValuePath", (e) => {
-      if (!e) return [];
-      const t = [];
-      let i = [...e];
-      for (; i.length > 0; ) {
-        const r = this.at(i);
-        r && t.unshift(this.getNodeValue(r)), i.pop();
-      }
-      return t;
-    }), s(this, "getDepth", (e) => c(this.rootNode, {
-      getChildren: this.getNodeChildren,
-      predicate: (i) => this.getNodeValue(i) === e
-    })?.length ?? 0), s(this, "isSameNode", (e, t) => this.getNodeValue(e) === this.getNodeValue(t)), s(this, "isRootNode", (e) => this.isSameNode(e, this.rootNode)), s(this, "contains", (e, t) => !e || !t ? !1 : t.slice(0, e.length).every((i, r) => e[r] === t[r])), s(this, "getNextNode", (e, t = {}) => {
-      let i = !1, r;
-      return u(this.rootNode, {
-        getChildren: this.getNodeChildren,
-        onEnter: (o, h) => {
-          if (this.isRootNode(o)) return;
-          const d = this.getNodeValue(o);
-          if (t.skip?.({ value: d, node: o, indexPath: h }))
-            return d === e && (i = !0), "skip";
-          if (i && !this.getNodeDisabled(o))
-            return r = o, "stop";
-          d === e && (i = !0);
-        }
-      }), r;
-    }), s(this, "getPreviousNode", (e, t = {}) => {
-      let i, r = !1;
-      return u(this.rootNode, {
-        getChildren: this.getNodeChildren,
-        onEnter: (o, h) => {
-          if (this.isRootNode(o)) return;
-          const d = this.getNodeValue(o);
-          if (t.skip?.({ value: d, node: o, indexPath: h }))
-            return "skip";
-          if (d === e)
-            return r = !0, "stop";
-          this.getNodeDisabled(o) || (i = o);
-        }
-      }), r ? i : void 0;
-    }), s(this, "getParentNodes", (e) => {
-      const t = this.resolveIndexPath(e)?.slice();
-      if (!t) return [];
-      const i = [];
-      for (; t.length > 0; ) {
-        t.pop();
-        const r = this.at(t);
-        r && !this.isRootNode(r) && i.unshift(r);
-      }
-      return i;
-    }), s(this, "getDescendantNodes", (e, t) => {
-      const i = this.resolveNode(e);
-      if (!i) return [];
-      const r = [];
-      return u(i, {
-        getChildren: this.getNodeChildren,
-        onEnter: (o, h) => {
-          h.length !== 0 && (!t?.withBranch && this.isBranchNode(o) || r.push(o));
-        }
-      }), r;
-    }), s(this, "getDescendantValues", (e, t) => this.getDescendantNodes(e, t).map((r) => this.getNodeValue(r))), s(this, "getParentIndexPath", (e) => e.slice(0, -1)), s(this, "getParentNode", (e) => {
-      const t = this.resolveIndexPath(e);
-      return t ? this.at(this.getParentIndexPath(t)) : void 0;
-    }), s(this, "visit", (e) => {
-      const { skip: t, ...i } = e;
-      u(this.rootNode, {
-        ...i,
-        getChildren: this.getNodeChildren,
-        onEnter: (r, o) => {
-          if (!this.isRootNode(r))
-            return t?.({ value: this.getNodeValue(r), node: r, indexPath: o }) ? "skip" : i.onEnter?.(r, o);
-        }
-      });
-    }), s(this, "getPreviousSibling", (e) => {
-      const t = this.getParentNode(e);
-      if (!t) return;
-      const i = this.getNodeChildren(t);
-      let r = e[e.length - 1];
-      for (; --r >= 0; ) {
-        const o = i[r];
-        if (!this.getNodeDisabled(o)) return o;
-      }
-    }), s(this, "getNextSibling", (e) => {
-      const t = this.getParentNode(e);
-      if (!t) return;
-      const i = this.getNodeChildren(t);
-      let r = e[e.length - 1];
-      for (; ++r < i.length; ) {
-        const o = i[r];
-        if (!this.getNodeDisabled(o)) return o;
-      }
-    }), s(this, "getSiblingNodes", (e) => {
-      const t = this.getParentNode(e);
-      return t ? this.getNodeChildren(t) : [];
-    }), s(this, "getValues", (e = this.rootNode) => b(e, {
-      getChildren: this.getNodeChildren,
-      transform: (i) => [this.getNodeValue(i)]
-    }).slice(1)), s(this, "isValidDepth", (e, t) => t == null ? !0 : typeof t == "function" ? t(e.length) : e.length === t), s(this, "isBranchNode", (e) => this.getNodeChildren(e).length > 0 || this.getNodeChildrenCount(e) != null), s(this, "getBranchValues", (e = this.rootNode, t = {}) => {
-      let i = [];
-      return u(e, {
-        getChildren: this.getNodeChildren,
-        onEnter: (r, o) => {
-          if (o.length === 0) return;
-          const h = this.getNodeValue(r);
-          if (t.skip?.({ value: h, node: r, indexPath: o })) return "skip";
-          this.isBranchNode(r) && this.isValidDepth(o, t.depth) && i.push(this.getNodeValue(r));
-        }
-      }), i;
-    }), s(this, "flatten", (e = this.rootNode) => m(e, { getChildren: this.getNodeChildren })), s(this, "_create", (e, t) => this.getNodeChildren(e).length > 0 || t.length > 0 ? { ...e, children: t } : { ...e }), s(this, "_insert", (e, t, i) => this.copy(
-      T(e, { at: t, nodes: i, getChildren: this.getNodeChildren, create: this._create })
-    )), s(this, "copy", (e) => new f({ ...this.options, rootNode: e })), s(this, "_replace", (e, t, i) => this.copy(
-      _(e, { at: t, node: i, getChildren: this.getNodeChildren, create: this._create })
-    )), s(this, "_move", (e, t, i) => this.copy(y(e, { indexPaths: t, to: i, getChildren: this.getNodeChildren, create: this._create }))), s(this, "_remove", (e, t) => this.copy(D(e, { indexPaths: t, getChildren: this.getNodeChildren, create: this._create }))), s(this, "replace", (e, t) => this._replace(this.rootNode, e, t)), s(this, "remove", (e) => this._remove(this.rootNode, e)), s(this, "insertBefore", (e, t) => this.getParentNode(e) ? this._insert(this.rootNode, e, t) : void 0), s(this, "insertAfter", (e, t) => {
-      if (!this.getParentNode(e)) return;
-      const r = [...e.slice(0, -1), e[e.length - 1] + 1];
-      return this._insert(this.rootNode, r, t);
-    }), s(this, "move", (e, t) => this._move(this.rootNode, e, t)), s(this, "filter", (e) => {
-      const t = k(this.rootNode, {
-        predicate: e,
-        getChildren: this.getNodeChildren,
-        create: this._create
-      });
-      return this.copy(t);
-    }), s(this, "toJSON", () => this.getValues(this.rootNode)), this.rootNode = l.rootNode;
-  }
-  getIndexPath(l) {
-    if (Array.isArray(l)) {
-      if (l.length === 0) return [];
-      const e = [];
-      let t = this.getNodeChildren(this.rootNode);
-      for (let i = 0; i < l.length; i++) {
-        const r = l[i], o = t.findIndex((h) => this.getNodeValue(h) === r);
-        if (o === -1) break;
-        if (e.push(o), i < l.length - 1) {
-          const h = t[o];
-          t = this.getNodeChildren(h);
-        }
-      }
-      return e;
-    } else
-      return c(this.rootNode, {
-        getChildren: this.getNodeChildren,
-        predicate: (e) => this.getNodeValue(e) === l
-      });
-  }
+import { isEqual as e } from "../../../../../@zag-js_utils@1.35.3/node_modules/@zag-js/utils/dist/equal.js";
+import { hasProp as t, isObject as n } from "../../../../../@zag-js_utils@1.35.3/node_modules/@zag-js/utils/dist/guard.js";
+import { __publicField as r } from "./chunk-QZ7TP4HQ.js";
+import { access as i, compareIndexPaths as a, filter as o, find as s, findAll as c, findIndexPath as l, flatMap as u, flatten as d, insert as f, move as p, remove as m, replace as h, visit as g } from "./tree-visit.js";
+//#region ../../node_modules/.bun/@zag-js+collection@1.35.3/node_modules/@zag-js/collection/dist/tree-collection.mjs
+var _ = class t {
+	constructor(n) {
+		this.options = n, r(this, "rootNode"), r(this, "isEqual", (t) => e(this.rootNode, t.rootNode)), r(this, "getNodeChildren", (e) => this.options.nodeToChildren?.(e) ?? y.nodeToChildren(e) ?? []), r(this, "resolveIndexPath", (e) => typeof e == "string" ? this.getIndexPath(e) : e), r(this, "resolveNode", (e) => {
+			let t = this.resolveIndexPath(e);
+			return t ? this.at(t) : void 0;
+		}), r(this, "getNodeChildrenCount", (e) => this.options.nodeToChildrenCount?.(e) ?? y.nodeToChildrenCount(e)), r(this, "getNodeValue", (e) => this.options.nodeToValue?.(e) ?? y.nodeToValue(e)), r(this, "getNodeDisabled", (e) => this.options.isNodeDisabled?.(e) ?? y.isNodeDisabled(e)), r(this, "stringify", (e) => {
+			let t = this.findNode(e);
+			return t ? this.stringifyNode(t) : null;
+		}), r(this, "stringifyNode", (e) => this.options.nodeToString?.(e) ?? y.nodeToString(e)), r(this, "getFirstNode", (e = this.rootNode, t = {}) => {
+			let n;
+			return g(e, {
+				getChildren: this.getNodeChildren,
+				onEnter: (r, i) => {
+					if (!this.isSameNode(r, e)) {
+						if (t.skip?.({
+							value: this.getNodeValue(r),
+							node: r,
+							indexPath: i
+						})) return "skip";
+						if (!n && i.length > 0 && !this.getNodeDisabled(r)) return n = r, "stop";
+					}
+				}
+			}), n;
+		}), r(this, "getLastNode", (e = this.rootNode, t = {}) => {
+			let n;
+			return g(e, {
+				getChildren: this.getNodeChildren,
+				onEnter: (r, i) => {
+					if (!this.isSameNode(r, e)) {
+						if (t.skip?.({
+							value: this.getNodeValue(r),
+							node: r,
+							indexPath: i
+						})) return "skip";
+						i.length > 0 && !this.getNodeDisabled(r) && (n = r);
+					}
+				}
+			}), n;
+		}), r(this, "at", (e) => i(this.rootNode, e, { getChildren: this.getNodeChildren })), r(this, "findNode", (e, t = this.rootNode) => s(t, {
+			getChildren: this.getNodeChildren,
+			predicate: (t) => this.getNodeValue(t) === e
+		})), r(this, "findNodes", (e, t = this.rootNode) => {
+			let n = new Set(e.filter((e) => e != null));
+			return c(t, {
+				getChildren: this.getNodeChildren,
+				predicate: (e) => n.has(this.getNodeValue(e))
+			});
+		}), r(this, "sort", (e) => e.reduce((e, t) => {
+			let n = this.getIndexPath(t);
+			return n && e.push({
+				value: t,
+				indexPath: n
+			}), e;
+		}, []).sort((e, t) => a(e.indexPath, t.indexPath)).map(({ value: e }) => e)), r(this, "getValue", (e) => {
+			let t = this.at(e);
+			return t ? this.getNodeValue(t) : void 0;
+		}), r(this, "getValuePath", (e) => {
+			if (!e) return [];
+			let t = [], n = [...e];
+			for (; n.length > 0;) {
+				let e = this.at(n);
+				e && t.unshift(this.getNodeValue(e)), n.pop();
+			}
+			return t;
+		}), r(this, "getDepth", (e) => l(this.rootNode, {
+			getChildren: this.getNodeChildren,
+			predicate: (t) => this.getNodeValue(t) === e
+		})?.length ?? 0), r(this, "isSameNode", (e, t) => this.getNodeValue(e) === this.getNodeValue(t)), r(this, "isRootNode", (e) => this.isSameNode(e, this.rootNode)), r(this, "contains", (e, t) => !e || !t ? !1 : t.slice(0, e.length).every((n, r) => e[r] === t[r])), r(this, "getNextNode", (e, t = {}) => {
+			let n = !1, r;
+			return g(this.rootNode, {
+				getChildren: this.getNodeChildren,
+				onEnter: (i, a) => {
+					if (this.isRootNode(i)) return;
+					let o = this.getNodeValue(i);
+					if (t.skip?.({
+						value: o,
+						node: i,
+						indexPath: a
+					})) return o === e && (n = !0), "skip";
+					if (n && !this.getNodeDisabled(i)) return r = i, "stop";
+					o === e && (n = !0);
+				}
+			}), r;
+		}), r(this, "getPreviousNode", (e, t = {}) => {
+			let n, r = !1;
+			return g(this.rootNode, {
+				getChildren: this.getNodeChildren,
+				onEnter: (i, a) => {
+					if (this.isRootNode(i)) return;
+					let o = this.getNodeValue(i);
+					if (t.skip?.({
+						value: o,
+						node: i,
+						indexPath: a
+					})) return "skip";
+					if (o === e) return r = !0, "stop";
+					this.getNodeDisabled(i) || (n = i);
+				}
+			}), r ? n : void 0;
+		}), r(this, "getParentNodes", (e) => {
+			let t = this.resolveIndexPath(e)?.slice();
+			if (!t) return [];
+			let n = [];
+			for (; t.length > 0;) {
+				t.pop();
+				let e = this.at(t);
+				e && !this.isRootNode(e) && n.unshift(e);
+			}
+			return n;
+		}), r(this, "getDescendantNodes", (e, t) => {
+			let n = this.resolveNode(e);
+			if (!n) return [];
+			let r = [];
+			return g(n, {
+				getChildren: this.getNodeChildren,
+				onEnter: (e, n) => {
+					n.length !== 0 && (!t?.withBranch && this.isBranchNode(e) || r.push(e));
+				}
+			}), r;
+		}), r(this, "getDescendantValues", (e, t) => this.getDescendantNodes(e, t).map((e) => this.getNodeValue(e))), r(this, "getParentIndexPath", (e) => e.slice(0, -1)), r(this, "getParentNode", (e) => {
+			let t = this.resolveIndexPath(e);
+			return t ? this.at(this.getParentIndexPath(t)) : void 0;
+		}), r(this, "visit", (e) => {
+			let { skip: t, ...n } = e;
+			g(this.rootNode, {
+				...n,
+				getChildren: this.getNodeChildren,
+				onEnter: (e, r) => {
+					if (!this.isRootNode(e)) return t?.({
+						value: this.getNodeValue(e),
+						node: e,
+						indexPath: r
+					}) ? "skip" : n.onEnter?.(e, r);
+				}
+			});
+		}), r(this, "getPreviousSibling", (e) => {
+			let t = this.getParentNode(e);
+			if (!t) return;
+			let n = this.getNodeChildren(t), r = e[e.length - 1];
+			for (; --r >= 0;) {
+				let e = n[r];
+				if (!this.getNodeDisabled(e)) return e;
+			}
+		}), r(this, "getNextSibling", (e) => {
+			let t = this.getParentNode(e);
+			if (!t) return;
+			let n = this.getNodeChildren(t), r = e[e.length - 1];
+			for (; ++r < n.length;) {
+				let e = n[r];
+				if (!this.getNodeDisabled(e)) return e;
+			}
+		}), r(this, "getSiblingNodes", (e) => {
+			let t = this.getParentNode(e);
+			return t ? this.getNodeChildren(t) : [];
+		}), r(this, "getValues", (e = this.rootNode) => u(e, {
+			getChildren: this.getNodeChildren,
+			transform: (e) => [this.getNodeValue(e)]
+		}).slice(1)), r(this, "isValidDepth", (e, t) => t == null ? !0 : typeof t == "function" ? t(e.length) : e.length === t), r(this, "isBranchNode", (e) => this.getNodeChildren(e).length > 0 || this.getNodeChildrenCount(e) != null), r(this, "getBranchValues", (e = this.rootNode, t = {}) => {
+			let n = [];
+			return g(e, {
+				getChildren: this.getNodeChildren,
+				onEnter: (e, r) => {
+					if (r.length === 0) return;
+					let i = this.getNodeValue(e);
+					if (t.skip?.({
+						value: i,
+						node: e,
+						indexPath: r
+					})) return "skip";
+					this.isBranchNode(e) && this.isValidDepth(r, t.depth) && n.push(this.getNodeValue(e));
+				}
+			}), n;
+		}), r(this, "flatten", (e = this.rootNode) => d(e, { getChildren: this.getNodeChildren })), r(this, "_create", (e, t) => this.getNodeChildren(e).length > 0 || t.length > 0 ? {
+			...e,
+			children: t
+		} : { ...e }), r(this, "_insert", (e, t, n) => this.copy(f(e, {
+			at: t,
+			nodes: n,
+			getChildren: this.getNodeChildren,
+			create: this._create
+		}))), r(this, "copy", (e) => new t({
+			...this.options,
+			rootNode: e
+		})), r(this, "_replace", (e, t, n) => this.copy(h(e, {
+			at: t,
+			node: n,
+			getChildren: this.getNodeChildren,
+			create: this._create
+		}))), r(this, "_move", (e, t, n) => this.copy(p(e, {
+			indexPaths: t,
+			to: n,
+			getChildren: this.getNodeChildren,
+			create: this._create
+		}))), r(this, "_remove", (e, t) => this.copy(m(e, {
+			indexPaths: t,
+			getChildren: this.getNodeChildren,
+			create: this._create
+		}))), r(this, "replace", (e, t) => this._replace(this.rootNode, e, t)), r(this, "remove", (e) => this._remove(this.rootNode, e)), r(this, "insertBefore", (e, t) => this.getParentNode(e) ? this._insert(this.rootNode, e, t) : void 0), r(this, "insertAfter", (e, t) => {
+			if (!this.getParentNode(e)) return;
+			let n = [...e.slice(0, -1), e[e.length - 1] + 1];
+			return this._insert(this.rootNode, n, t);
+		}), r(this, "move", (e, t) => this._move(this.rootNode, e, t)), r(this, "filter", (e) => {
+			let t = o(this.rootNode, {
+				predicate: e,
+				getChildren: this.getNodeChildren,
+				create: this._create
+			});
+			return this.copy(t);
+		}), r(this, "toJSON", () => this.getValues(this.rootNode)), this.rootNode = n.rootNode;
+	}
+	getIndexPath(e) {
+		if (Array.isArray(e)) {
+			if (e.length === 0) return [];
+			let t = [], n = this.getNodeChildren(this.rootNode);
+			for (let r = 0; r < e.length; r++) {
+				let i = e[r], a = n.findIndex((e) => this.getNodeValue(e) === i);
+				if (a === -1) break;
+				if (t.push(a), r < e.length - 1) {
+					let e = n[a];
+					n = this.getNodeChildren(e);
+				}
+			}
+			return t;
+		} else return l(this.rootNode, {
+			getChildren: this.getNodeChildren,
+			predicate: (t) => this.getNodeValue(t) === e
+		});
+	}
 };
-function R(n) {
-  const l = {
-    label: "",
-    value: "ROOT",
-    children: []
-  };
-  return n.forEach((e) => {
-    const t = e.split("/");
-    let i = l;
-    t.forEach((r, o) => {
-      let h = i.children?.find((d) => d.label === r);
-      h || (h = {
-        value: t.slice(0, o + 1).join("/"),
-        label: r
-      }, i.children || (i.children = []), i.children.push(h)), i = h;
-    });
-  }), new S({ rootNode: l });
+function v(e) {
+	let t = {
+		label: "",
+		value: "ROOT",
+		children: []
+	};
+	return e.forEach((e) => {
+		let n = e.split("/"), r = t;
+		n.forEach((e, t) => {
+			let i = r.children?.find((t) => t.label === e);
+			i || (i = {
+				value: n.slice(0, t + 1).join("/"),
+				label: e
+			}, r.children ||= [], r.children.push(i)), r = i;
+		});
+	}), new _({ rootNode: t });
 }
-var g = {
-  nodeToValue(n) {
-    return typeof n == "string" ? n : N(n) && a(n, "value") ? n.value : "";
-  },
-  nodeToString(n) {
-    return typeof n == "string" ? n : N(n) && a(n, "label") ? n.label : g.nodeToValue(n);
-  },
-  isNodeDisabled(n) {
-    return N(n) && a(n, "disabled") ? !!n.disabled : !1;
-  },
-  nodeToChildren(n) {
-    return n.children;
-  },
-  nodeToChildrenCount(n) {
-    if (N(n) && a(n, "childrenCount")) return n.childrenCount;
-  }
+var y = {
+	nodeToValue(e) {
+		return typeof e == "string" ? e : n(e) && t(e, "value") ? e.value : "";
+	},
+	nodeToString(e) {
+		return typeof e == "string" ? e : n(e) && t(e, "label") ? e.label : y.nodeToValue(e);
+	},
+	isNodeDisabled(e) {
+		return n(e) && t(e, "disabled") ? !!e.disabled : !1;
+	},
+	nodeToChildren(e) {
+		return e.children;
+	},
+	nodeToChildrenCount(e) {
+		if (n(e) && t(e, "childrenCount")) return e.childrenCount;
+	}
 };
-export {
-  S as TreeCollection,
-  R as filePathToTree
-};
-//# sourceMappingURL=tree-collection.js.map
+//#endregion
+export { _ as TreeCollection, v as filePathToTree };
+
+//# sourceMappingURL=tree-collection.js.map