@manafishrov/ui 1.4.5 → 1.4.6

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

@@ -1,275 +1,255 @@
-function E(r, e, t) {
-  for (let n = 0; n < e.length; n++) r = t.getChildren(r, e.slice(n + 1))[e[n]];
-  return r;
-}
-function M(r) {
-  const e = P(r), t = [], n = /* @__PURE__ */ new Set();
-  for (const s of e) {
-    const o = s.join();
-    n.has(o) || (n.add(o), t.push(s));
-  }
-  return t;
-}
-function R(r, e) {
-  for (let t = 0; t < Math.min(r.length, e.length); t++) {
-    if (r[t] < e[t]) return -1;
-    if (r[t] > e[t]) return 1;
-  }
-  return r.length - e.length;
-}
-function P(r) {
-  return r.sort(R);
-}
-function N(r, e) {
-  let t;
-  return d(r, {
-    ...e,
-    onEnter: (n, s) => {
-      if (e.predicate(n, s))
-        return t = n, "stop";
-    }
-  }), t;
-}
-function L(r, e) {
-  const t = [];
-  return d(r, {
-    onEnter: (n, s) => {
-      e.predicate(n, s) && t.push(n);
-    },
-    getChildren: e.getChildren
-  }), t;
-}
-function A(r, e) {
-  let t;
-  return d(r, {
-    onEnter: (n, s) => {
-      if (e.predicate(n, s))
-        return t = [...s], "stop";
-    },
-    getChildren: e.getChildren
-  }), t;
-}
-function k(r, e) {
-  let t = e.initialResult;
-  return d(r, {
-    ...e,
-    onEnter: (n, s) => {
-      t = e.nextResult(t, n, s);
-    }
-  }), t;
-}
-function F(r, e) {
-  return k(r, {
-    ...e,
-    initialResult: [],
-    nextResult: (t, n, s) => (t.push(...e.transform(n, s)), t)
-  });
-}
-function S(r, e) {
-  const { predicate: t, create: n, getChildren: s } = e, o = (c, i) => {
-    const a = s(c, i), u = [];
-    a.forEach((h, y) => {
-      const j = [...i, y], v = o(h, j);
-      v && u.push(v);
-    });
-    const l = i.length === 0, f = t(c, i), g = u.length > 0;
-    return l || f || g ? n(c, u, i) : null;
-  };
-  return o(r, []) || n(r, [], []);
-}
-function q(r, e) {
-  const t = [];
-  let n = 0;
-  const s = /* @__PURE__ */ new Map(), o = /* @__PURE__ */ new Map();
-  return d(r, {
-    getChildren: e.getChildren,
-    onEnter: (c, i) => {
-      s.has(c) || s.set(c, n++);
-      const a = e.getChildren(c, i);
-      a.forEach((h) => {
-        o.has(h) || o.set(h, c), s.has(h) || s.set(h, n++);
-      });
-      const u = a.length > 0 ? a.map((h) => s.get(h)) : void 0, l = o.get(c), f = l ? s.get(l) : void 0, g = s.get(c);
-      t.push({ ...c, _children: u, _parent: f, _index: g });
-    }
-  }), t;
-}
-function K(r, e) {
-  return { type: "insert", index: r, nodes: e };
-}
-function O(r) {
-  return { type: "remove", indexes: r };
-}
-function m() {
-  return { type: "replace" };
-}
-function I(r) {
-  return [r.slice(0, -1), r[r.length - 1]];
-}
-function w(r, e, t = /* @__PURE__ */ new Map()) {
-  const [n, s] = I(r);
-  for (let c = n.length - 1; c >= 0; c--) {
-    const i = n.slice(0, c).join();
-    t.get(i)?.type !== "remove" && t.set(i, m());
-  }
-  const o = t.get(n.join());
-  return o?.type === "remove" ? t.set(n.join(), {
-    type: "removeThenInsert",
-    removeIndexes: o.indexes,
-    insertIndex: s,
-    insertNodes: e
-  }) : t.set(n.join(), K(s, e)), t;
-}
-function C(r) {
-  const e = /* @__PURE__ */ new Map(), t = /* @__PURE__ */ new Map();
-  for (const n of r) {
-    const s = n.slice(0, -1).join(), o = t.get(s) ?? [];
-    o.push(n[n.length - 1]), t.set(
-      s,
-      o.sort((c, i) => c - i)
-    );
-  }
-  for (const n of r)
-    for (let s = n.length - 2; s >= 0; s--) {
-      const o = n.slice(0, s).join();
-      e.has(o) || e.set(o, m());
-    }
-  for (const [n, s] of t)
-    e.set(n, O(s));
-  return e;
-}
-function T(r, e) {
-  const t = /* @__PURE__ */ new Map(), [n, s] = I(r);
-  for (let o = n.length - 1; o >= 0; o--) {
-    const c = n.slice(0, o).join();
-    t.set(c, m());
-  }
-  return t.set(n.join(), {
-    type: "removeThenInsert",
-    removeIndexes: [s],
-    insertIndex: s,
-    insertNodes: [e]
-  }), t;
-}
-function p(r, e, t) {
-  return _(r, {
-    ...t,
-    getChildren: (n, s) => {
-      const o = s.join();
-      switch (e.get(o)?.type) {
-        case "replace":
-        case "remove":
-        case "removeThenInsert":
-        case "insert":
-          return t.getChildren(n, s);
-        default:
-          return [];
-      }
-    },
-    transform: (n, s, o) => {
-      const c = o.join(), i = e.get(c);
-      switch (i?.type) {
-        case "remove":
-          return t.create(
-            n,
-            s.filter((l, f) => !i.indexes.includes(f)),
-            o
-          );
-        case "removeThenInsert":
-          const a = s.filter((l, f) => !i.removeIndexes.includes(f)), u = i.removeIndexes.reduce(
-            (l, f) => f < l ? l - 1 : l,
-            i.insertIndex
-          );
-          return t.create(n, x(a, u, 0, ...i.insertNodes), o);
-        case "insert":
-          return t.create(n, x(s, i.index, 0, ...i.nodes), o);
-        case "replace":
-          return t.create(n, s, o);
-        default:
-          return n;
-      }
-    }
-  });
-}
-function x(r, e, t, ...n) {
-  return [...r.slice(0, e), ...n, ...r.slice(e + t)];
-}
-function _(r, e) {
-  const t = {};
-  return d(r, {
-    ...e,
-    onLeave: (n, s) => {
-      const o = [0, ...s], c = o.join(), i = e.transform(n, t[c] ?? [], s), a = o.slice(0, -1).join(), u = t[a] ?? [];
-      u.push(i), t[a] = u;
-    }
-  }), t[""][0];
-}
-function z(r, e) {
-  const { nodes: t, at: n } = e;
-  if (n.length === 0) throw new Error("Can't insert nodes at the root");
-  const s = w(n, t);
-  return p(r, s, e);
-}
-function B(r, e) {
-  if (e.at.length === 0) return e.node;
-  const t = T(e.at, e.node);
-  return p(r, t, e);
-}
-function D(r, e) {
-  if (e.indexPaths.length === 0) return r;
-  for (const n of e.indexPaths)
-    if (n.length === 0) throw new Error("Can't remove the root node");
-  const t = C(e.indexPaths);
-  return p(r, t, e);
-}
-function G(r, e) {
-  if (e.indexPaths.length === 0) return r;
-  for (const o of e.indexPaths)
-    if (o.length === 0) throw new Error("Can't move the root node");
-  if (e.to.length === 0) throw new Error("Can't move nodes to the root");
-  const t = M(e.indexPaths), n = t.map((o) => E(r, o, e)), s = w(e.to, n, C(t));
-  return p(r, s, e);
-}
-function d(r, e) {
-  const { onEnter: t, onLeave: n, getChildren: s } = e;
-  let o = [], c = [{ node: r }];
-  const i = e.reuseIndexPath ? () => o : () => o.slice();
-  for (; c.length > 0; ) {
-    let a = c[c.length - 1];
-    if (a.state === void 0) {
-      const l = t?.(a.node, i());
-      if (l === "stop") return;
-      a.state = l === "skip" ? -1 : 0;
-    }
-    const u = a.children || s(a.node, i());
-    if (a.children || (a.children = u), a.state !== -1) {
-      if (a.state < u.length) {
-        let f = a.state;
-        o.push(f), c.push({ node: u[f] }), a.state = f + 1;
-        continue;
-      }
-      if (n?.(a.node, i()) === "stop") return;
-    }
-    o.pop(), c.pop();
-  }
-}
-export {
-  E as access,
-  M as ancestorIndexPaths,
-  R as compareIndexPaths,
-  S as filter,
-  N as find,
-  L as findAll,
-  A as findIndexPath,
-  F as flatMap,
-  q as flatten,
-  z as insert,
-  _ as map,
-  G as move,
-  k as reduce,
-  D as remove,
-  B as replace,
-  P as sortIndexPaths,
-  d as visit
-};
-//# sourceMappingURL=tree-visit.js.map
+//#region ../../node_modules/.bun/@zag-js+collection@1.35.3/node_modules/@zag-js/collection/dist/tree-visit.mjs
+function e(e, t, n) {
+	for (let r = 0; r < t.length; r++) e = n.getChildren(e, t.slice(r + 1))[t[r]];
+	return e;
+}
+function t(e) {
+	let t = r(e), n = [], i = /* @__PURE__ */ new Set();
+	for (let e of t) {
+		let t = e.join();
+		i.has(t) || (i.add(t), n.push(e));
+	}
+	return n;
+}
+function n(e, t) {
+	for (let n = 0; n < Math.min(e.length, t.length); n++) {
+		if (e[n] < t[n]) return -1;
+		if (e[n] > t[n]) return 1;
+	}
+	return e.length - t.length;
+}
+function r(e) {
+	return e.sort(n);
+}
+function i(e, t) {
+	let n;
+	return T(e, {
+		...t,
+		onEnter: (e, r) => {
+			if (t.predicate(e, r)) return n = e, "stop";
+		}
+	}), n;
+}
+function a(e, t) {
+	let n = [];
+	return T(e, {
+		onEnter: (e, r) => {
+			t.predicate(e, r) && n.push(e);
+		},
+		getChildren: t.getChildren
+	}), n;
+}
+function o(e, t) {
+	let n;
+	return T(e, {
+		onEnter: (e, r) => {
+			if (t.predicate(e, r)) return n = [...r], "stop";
+		},
+		getChildren: t.getChildren
+	}), n;
+}
+function s(e, t) {
+	let n = t.initialResult;
+	return T(e, {
+		...t,
+		onEnter: (e, r) => {
+			n = t.nextResult(n, e, r);
+		}
+	}), n;
+}
+function c(e, t) {
+	return s(e, {
+		...t,
+		initialResult: [],
+		nextResult: (e, n, r) => (e.push(...t.transform(n, r)), e)
+	});
+}
+function l(e, t) {
+	let { predicate: n, create: r, getChildren: i } = t, a = (e, t) => {
+		let o = i(e, t), s = [];
+		o.forEach((e, n) => {
+			let r = a(e, [...t, n]);
+			r && s.push(r);
+		});
+		let c = t.length === 0, l = n(e, t), u = s.length > 0;
+		return c || l || u ? r(e, s, t) : null;
+	};
+	return a(e, []) || r(e, [], []);
+}
+function u(e, t) {
+	let n = [], r = 0, i = /* @__PURE__ */ new Map(), a = /* @__PURE__ */ new Map();
+	return T(e, {
+		getChildren: t.getChildren,
+		onEnter: (e, o) => {
+			i.has(e) || i.set(e, r++);
+			let s = t.getChildren(e, o);
+			s.forEach((t) => {
+				a.has(t) || a.set(t, e), i.has(t) || i.set(t, r++);
+			});
+			let c = s.length > 0 ? s.map((e) => i.get(e)) : void 0, l = a.get(e), u = l ? i.get(l) : void 0, d = i.get(e);
+			n.push({
+				...e,
+				_children: c,
+				_parent: u,
+				_index: d
+			});
+		}
+	}), n;
+}
+function d(e, t) {
+	return {
+		type: "insert",
+		index: e,
+		nodes: t
+	};
+}
+function f(e) {
+	return {
+		type: "remove",
+		indexes: e
+	};
+}
+function p() {
+	return { type: "replace" };
+}
+function m(e) {
+	return [e.slice(0, -1), e[e.length - 1]];
+}
+function h(e, t, n = /* @__PURE__ */ new Map()) {
+	let [r, i] = m(e);
+	for (let e = r.length - 1; e >= 0; e--) {
+		let t = r.slice(0, e).join();
+		switch (n.get(t)?.type) {
+			case "remove": continue;
+		}
+		n.set(t, p());
+	}
+	let a = n.get(r.join());
+	switch (a?.type) {
+		case "remove":
+			n.set(r.join(), {
+				type: "removeThenInsert",
+				removeIndexes: a.indexes,
+				insertIndex: i,
+				insertNodes: t
+			});
+			break;
+		default: n.set(r.join(), d(i, t));
+	}
+	return n;
+}
+function g(e) {
+	let t = /* @__PURE__ */ new Map(), n = /* @__PURE__ */ new Map();
+	for (let t of e) {
+		let e = t.slice(0, -1).join(), r = n.get(e) ?? [];
+		r.push(t[t.length - 1]), n.set(e, r.sort((e, t) => e - t));
+	}
+	for (let n of e) for (let e = n.length - 2; e >= 0; e--) {
+		let r = n.slice(0, e).join();
+		t.has(r) || t.set(r, p());
+	}
+	for (let [e, r] of n) t.set(e, f(r));
+	return t;
+}
+function _(e, t) {
+	let n = /* @__PURE__ */ new Map(), [r, i] = m(e);
+	for (let e = r.length - 1; e >= 0; e--) {
+		let t = r.slice(0, e).join();
+		n.set(t, p());
+	}
+	return n.set(r.join(), {
+		type: "removeThenInsert",
+		removeIndexes: [i],
+		insertIndex: i,
+		insertNodes: [t]
+	}), n;
+}
+function v(e, t, n) {
+	return b(e, {
+		...n,
+		getChildren: (e, r) => {
+			let i = r.join();
+			switch (t.get(i)?.type) {
+				case "replace":
+				case "remove":
+				case "removeThenInsert":
+				case "insert": return n.getChildren(e, r);
+				default: return [];
+			}
+		},
+		transform: (e, r, i) => {
+			let a = i.join(), o = t.get(a);
+			switch (o?.type) {
+				case "remove": return n.create(e, r.filter((e, t) => !o.indexes.includes(t)), i);
+				case "removeThenInsert":
+					let t = r.filter((e, t) => !o.removeIndexes.includes(t)), a = o.removeIndexes.reduce((e, t) => t < e ? e - 1 : e, o.insertIndex);
+					return n.create(e, y(t, a, 0, ...o.insertNodes), i);
+				case "insert": return n.create(e, y(r, o.index, 0, ...o.nodes), i);
+				case "replace": return n.create(e, r, i);
+				default: return e;
+			}
+		}
+	});
+}
+function y(e, t, n, ...r) {
+	return [
+		...e.slice(0, t),
+		...r,
+		...e.slice(t + n)
+	];
+}
+function b(e, t) {
+	let n = {};
+	return T(e, {
+		...t,
+		onLeave: (e, r) => {
+			let i = [0, ...r], a = i.join(), o = t.transform(e, n[a] ?? [], r), s = i.slice(0, -1).join(), c = n[s] ?? [];
+			c.push(o), n[s] = c;
+		}
+	}), n[""][0];
+}
+function x(e, t) {
+	let { nodes: n, at: r } = t;
+	if (r.length === 0) throw Error("Can't insert nodes at the root");
+	return v(e, h(r, n), t);
+}
+function S(e, t) {
+	return t.at.length === 0 ? t.node : v(e, _(t.at, t.node), t);
+}
+function C(e, t) {
+	if (t.indexPaths.length === 0) return e;
+	for (let e of t.indexPaths) if (e.length === 0) throw Error("Can't remove the root node");
+	return v(e, g(t.indexPaths), t);
+}
+function w(n, r) {
+	if (r.indexPaths.length === 0) return n;
+	for (let e of r.indexPaths) if (e.length === 0) throw Error("Can't move the root node");
+	if (r.to.length === 0) throw Error("Can't move nodes to the root");
+	let i = t(r.indexPaths), a = i.map((t) => e(n, t, r));
+	return v(n, h(r.to, a, g(i)), r);
+}
+function T(e, t) {
+	let { onEnter: n, onLeave: r, getChildren: i } = t, a = [], o = [{ node: e }], s = t.reuseIndexPath ? () => a : () => a.slice();
+	for (; o.length > 0;) {
+		let e = o[o.length - 1];
+		if (e.state === void 0) {
+			let t = n?.(e.node, s());
+			if (t === "stop") return;
+			e.state = t === "skip" ? -1 : 0;
+		}
+		let t = e.children || i(e.node, s());
+		if (e.children ||= t, e.state !== -1) {
+			if (e.state < t.length) {
+				let n = e.state;
+				a.push(n), o.push({ node: t[n] }), e.state = n + 1;
+				continue;
+			}
+			if (r?.(e.node, s()) === "stop") return;
+		}
+		a.pop(), o.pop();
+	}
+}
+//#endregion
+export { e as access, n as compareIndexPaths, l as filter, i as find, a as findAll, o as findIndexPath, c as flatMap, u as flatten, x as insert, w as move, C as remove, S as replace, T as visit };
+
+//# sourceMappingURL=tree-visit.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"tree-visit.js","sources":["../../../../../../../../../../node_modules/.bun/@zag-js+collection@1.35.3/node_modules/@zag-js/collection/dist/tree-visit.mjs"],"sourcesContent":["import \"./chunk-QZ7TP4HQ.mjs\";\n\n// src/tree-visit.ts\nfunction access(node, indexPath, options) {\n  for (let i = 0; i < indexPath.length; i++) node = options.getChildren(node, indexPath.slice(i + 1))[indexPath[i]];\n  return node;\n}\nfunction accessPath(node, indexPath, options) {\n  const result = [node];\n  for (let i = 0; i < indexPath.length; i++) {\n    node = options.getChildren(node, indexPath.slice(i + 1))[indexPath[i]];\n    result.push(node);\n  }\n  return result;\n}\nfunction ancestorIndexPaths(indexPaths) {\n  const sortedPaths = sortIndexPaths(indexPaths);\n  const result = [];\n  const seen = /* @__PURE__ */ new Set();\n  for (const indexPath of sortedPaths) {\n    const key = indexPath.join();\n    if (!seen.has(key)) {\n      seen.add(key);\n      result.push(indexPath);\n    }\n  }\n  return result;\n}\nfunction compareIndexPaths(a, b) {\n  for (let i = 0; i < Math.min(a.length, b.length); i++) {\n    if (a[i] < b[i]) return -1;\n    if (a[i] > b[i]) return 1;\n  }\n  return a.length - b.length;\n}\nfunction sortIndexPaths(indexPaths) {\n  return indexPaths.sort(compareIndexPaths);\n}\nfunction find(node, options) {\n  let found;\n  visit(node, {\n    ...options,\n    onEnter: (child, indexPath) => {\n      if (options.predicate(child, indexPath)) {\n        found = child;\n        return \"stop\";\n      }\n    }\n  });\n  return found;\n}\nfunction findAll(node, options) {\n  const found = [];\n  visit(node, {\n    onEnter: (child, indexPath) => {\n      if (options.predicate(child, indexPath)) found.push(child);\n    },\n    getChildren: options.getChildren\n  });\n  return found;\n}\nfunction findIndexPath(node, options) {\n  let found;\n  visit(node, {\n    onEnter: (child, indexPath) => {\n      if (options.predicate(child, indexPath)) {\n        found = [...indexPath];\n        return \"stop\";\n      }\n    },\n    getChildren: options.getChildren\n  });\n  return found;\n}\nfunction findAllIndexPaths(node, options) {\n  let found = [];\n  visit(node, {\n    onEnter: (child, indexPath) => {\n      if (options.predicate(child, indexPath)) found.push([...indexPath]);\n    },\n    getChildren: options.getChildren\n  });\n  return found;\n}\nfunction reduce(node, options) {\n  let result = options.initialResult;\n  visit(node, {\n    ...options,\n    onEnter: (child, indexPath) => {\n      result = options.nextResult(result, child, indexPath);\n    }\n  });\n  return result;\n}\nfunction flat(node, options) {\n  return reduce(node, {\n    ...options,\n    initialResult: [],\n    nextResult: (result, child) => {\n      result.push(child);\n      return result;\n    }\n  });\n}\nfunction flatMap(node, options) {\n  return reduce(node, {\n    ...options,\n    initialResult: [],\n    nextResult: (result, child, indexPath) => {\n      result.push(...options.transform(child, indexPath));\n      return result;\n    }\n  });\n}\nfunction filter(node, options) {\n  const { predicate, create, getChildren } = options;\n  const filterRecursive = (node2, indexPath) => {\n    const children = getChildren(node2, indexPath);\n    const filteredChildren = [];\n    children.forEach((child, index) => {\n      const childIndexPath = [...indexPath, index];\n      const filteredChild = filterRecursive(child, childIndexPath);\n      if (filteredChild) filteredChildren.push(filteredChild);\n    });\n    const isRoot = indexPath.length === 0;\n    const nodeMatches = predicate(node2, indexPath);\n    const hasFilteredChildren = filteredChildren.length > 0;\n    if (isRoot || nodeMatches || hasFilteredChildren) {\n      return create(node2, filteredChildren, indexPath);\n    }\n    return null;\n  };\n  return filterRecursive(node, []) || create(node, [], []);\n}\nfunction flatten(rootNode, options) {\n  const nodes = [];\n  let idx = 0;\n  const idxMap = /* @__PURE__ */ new Map();\n  const parentMap = /* @__PURE__ */ new Map();\n  visit(rootNode, {\n    getChildren: options.getChildren,\n    onEnter: (node, indexPath) => {\n      if (!idxMap.has(node)) {\n        idxMap.set(node, idx++);\n      }\n      const children = options.getChildren(node, indexPath);\n      children.forEach((child) => {\n        if (!parentMap.has(child)) {\n          parentMap.set(child, node);\n        }\n        if (!idxMap.has(child)) {\n          idxMap.set(child, idx++);\n        }\n      });\n      const _children = children.length > 0 ? children.map((child) => idxMap.get(child)) : void 0;\n      const parent = parentMap.get(node);\n      const _parent = parent ? idxMap.get(parent) : void 0;\n      const _index = idxMap.get(node);\n      nodes.push({ ...node, _children, _parent, _index });\n    }\n  });\n  return nodes;\n}\nfunction insertOperation(index, nodes) {\n  return { type: \"insert\", index, nodes };\n}\nfunction removeOperation(indexes) {\n  return { type: \"remove\", indexes };\n}\nfunction replaceOperation() {\n  return { type: \"replace\" };\n}\nfunction splitIndexPath(indexPath) {\n  return [indexPath.slice(0, -1), indexPath[indexPath.length - 1]];\n}\nfunction getInsertionOperations(indexPath, nodes, operations = /* @__PURE__ */ new Map()) {\n  const [parentIndexPath, index] = splitIndexPath(indexPath);\n  for (let i = parentIndexPath.length - 1; i >= 0; i--) {\n    const parentKey = parentIndexPath.slice(0, i).join();\n    switch (operations.get(parentKey)?.type) {\n      case \"remove\":\n        continue;\n    }\n    operations.set(parentKey, replaceOperation());\n  }\n  const operation = operations.get(parentIndexPath.join());\n  switch (operation?.type) {\n    case \"remove\":\n      operations.set(parentIndexPath.join(), {\n        type: \"removeThenInsert\",\n        removeIndexes: operation.indexes,\n        insertIndex: index,\n        insertNodes: nodes\n      });\n      break;\n    default:\n      operations.set(parentIndexPath.join(), insertOperation(index, nodes));\n  }\n  return operations;\n}\nfunction getRemovalOperations(indexPaths) {\n  const operations = /* @__PURE__ */ new Map();\n  const indexesToRemove = /* @__PURE__ */ new Map();\n  for (const indexPath of indexPaths) {\n    const parentKey = indexPath.slice(0, -1).join();\n    const value = indexesToRemove.get(parentKey) ?? [];\n    value.push(indexPath[indexPath.length - 1]);\n    indexesToRemove.set(\n      parentKey,\n      value.sort((a, b) => a - b)\n    );\n  }\n  for (const indexPath of indexPaths) {\n    for (let i = indexPath.length - 2; i >= 0; i--) {\n      const parentKey = indexPath.slice(0, i).join();\n      if (!operations.has(parentKey)) {\n        operations.set(parentKey, replaceOperation());\n      }\n    }\n  }\n  for (const [parentKey, indexes] of indexesToRemove) {\n    operations.set(parentKey, removeOperation(indexes));\n  }\n  return operations;\n}\nfunction getReplaceOperations(indexPath, node) {\n  const operations = /* @__PURE__ */ new Map();\n  const [parentIndexPath, index] = splitIndexPath(indexPath);\n  for (let i = parentIndexPath.length - 1; i >= 0; i--) {\n    const parentKey = parentIndexPath.slice(0, i).join();\n    operations.set(parentKey, replaceOperation());\n  }\n  operations.set(parentIndexPath.join(), {\n    type: \"removeThenInsert\",\n    removeIndexes: [index],\n    insertIndex: index,\n    insertNodes: [node]\n  });\n  return operations;\n}\nfunction mutate(node, operations, options) {\n  return map(node, {\n    ...options,\n    getChildren: (node2, indexPath) => {\n      const key = indexPath.join();\n      const operation = operations.get(key);\n      switch (operation?.type) {\n        case \"replace\":\n        case \"remove\":\n        case \"removeThenInsert\":\n        case \"insert\":\n          return options.getChildren(node2, indexPath);\n        default:\n          return [];\n      }\n    },\n    transform: (node2, children, indexPath) => {\n      const key = indexPath.join();\n      const operation = operations.get(key);\n      switch (operation?.type) {\n        case \"remove\":\n          return options.create(\n            node2,\n            children.filter((_, index) => !operation.indexes.includes(index)),\n            indexPath\n          );\n        case \"removeThenInsert\":\n          const updatedChildren = children.filter((_, index) => !operation.removeIndexes.includes(index));\n          const adjustedIndex = operation.removeIndexes.reduce(\n            (index, removedIndex) => removedIndex < index ? index - 1 : index,\n            operation.insertIndex\n          );\n          return options.create(node2, splice(updatedChildren, adjustedIndex, 0, ...operation.insertNodes), indexPath);\n        case \"insert\":\n          return options.create(node2, splice(children, operation.index, 0, ...operation.nodes), indexPath);\n        case \"replace\":\n          return options.create(node2, children, indexPath);\n        default:\n          return node2;\n      }\n    }\n  });\n}\nfunction splice(array, start, deleteCount, ...items) {\n  return [...array.slice(0, start), ...items, ...array.slice(start + deleteCount)];\n}\nfunction map(node, options) {\n  const childrenMap = {};\n  visit(node, {\n    ...options,\n    onLeave: (child, indexPath) => {\n      const keyIndexPath = [0, ...indexPath];\n      const key = keyIndexPath.join();\n      const transformed = options.transform(child, childrenMap[key] ?? [], indexPath);\n      const parentKey = keyIndexPath.slice(0, -1).join();\n      const parentChildren = childrenMap[parentKey] ?? [];\n      parentChildren.push(transformed);\n      childrenMap[parentKey] = parentChildren;\n    }\n  });\n  return childrenMap[\"\"][0];\n}\nfunction insert(node, options) {\n  const { nodes, at } = options;\n  if (at.length === 0) throw new Error(`Can't insert nodes at the root`);\n  const state = getInsertionOperations(at, nodes);\n  return mutate(node, state, options);\n}\nfunction replace(node, options) {\n  if (options.at.length === 0) return options.node;\n  const operations = getReplaceOperations(options.at, options.node);\n  return mutate(node, operations, options);\n}\nfunction remove(node, options) {\n  if (options.indexPaths.length === 0) return node;\n  for (const indexPath of options.indexPaths) {\n    if (indexPath.length === 0) throw new Error(`Can't remove the root node`);\n  }\n  const operations = getRemovalOperations(options.indexPaths);\n  return mutate(node, operations, options);\n}\nfunction move(node, options) {\n  if (options.indexPaths.length === 0) return node;\n  for (const indexPath of options.indexPaths) {\n    if (indexPath.length === 0) throw new Error(`Can't move the root node`);\n  }\n  if (options.to.length === 0) throw new Error(`Can't move nodes to the root`);\n  const _ancestorIndexPaths = ancestorIndexPaths(options.indexPaths);\n  const nodesToInsert = _ancestorIndexPaths.map((indexPath) => access(node, indexPath, options));\n  const operations = getInsertionOperations(options.to, nodesToInsert, getRemovalOperations(_ancestorIndexPaths));\n  return mutate(node, operations, options);\n}\nfunction visit(node, options) {\n  const { onEnter, onLeave, getChildren } = options;\n  let indexPath = [];\n  let stack = [{ node }];\n  const getIndexPath = options.reuseIndexPath ? () => indexPath : () => indexPath.slice();\n  while (stack.length > 0) {\n    let wrapper = stack[stack.length - 1];\n    if (wrapper.state === void 0) {\n      const enterResult = onEnter?.(wrapper.node, getIndexPath());\n      if (enterResult === \"stop\") return;\n      wrapper.state = enterResult === \"skip\" ? -1 : 0;\n    }\n    const children = wrapper.children || getChildren(wrapper.node, getIndexPath());\n    wrapper.children || (wrapper.children = children);\n    if (wrapper.state !== -1) {\n      if (wrapper.state < children.length) {\n        let currentIndex = wrapper.state;\n        indexPath.push(currentIndex);\n        stack.push({ node: children[currentIndex] });\n        wrapper.state = currentIndex + 1;\n        continue;\n      }\n      const leaveResult = onLeave?.(wrapper.node, getIndexPath());\n      if (leaveResult === \"stop\") return;\n    }\n    indexPath.pop();\n    stack.pop();\n  }\n}\nexport {\n  access,\n  accessPath,\n  ancestorIndexPaths,\n  compareIndexPaths,\n  filter,\n  find,\n  findAll,\n  findAllIndexPaths,\n  findIndexPath,\n  flat,\n  flatMap,\n  flatten,\n  insert,\n  map,\n  move,\n  reduce,\n  remove,\n  replace,\n  sortIndexPaths,\n  visit\n};\n"],"names":["access","node","indexPath","options","i","ancestorIndexPaths","indexPaths","sortedPaths","sortIndexPaths","result","seen","key","compareIndexPaths","a","b","find","found","visit","child","findAll","findIndexPath","reduce","flatMap","filter","predicate","create","getChildren","filterRecursive","node2","children","filteredChildren","index","childIndexPath","filteredChild","isRoot","nodeMatches","hasFilteredChildren","flatten","rootNode","nodes","idx","idxMap","parentMap","_children","parent","_parent","_index","insertOperation","removeOperation","indexes","replaceOperation","splitIndexPath","getInsertionOperations","operations","parentIndexPath","parentKey","operation","getRemovalOperations","indexesToRemove","value","getReplaceOperations","mutate","map","_","updatedChildren","adjustedIndex","removedIndex","splice","array","start","deleteCount","items","childrenMap","keyIndexPath","transformed","parentChildren","insert","at","state","replace","remove","move","_ancestorIndexPaths","nodesToInsert","onEnter","onLeave","stack","getIndexPath","wrapper","enterResult","currentIndex"],"mappings":"AAGA,SAASA,EAAOC,GAAMC,GAAWC,GAAS;AACxC,WAASC,IAAI,GAAGA,IAAIF,EAAU,QAAQE,IAAK,CAAAH,IAAOE,EAAQ,YAAYF,GAAMC,EAAU,MAAME,IAAI,CAAC,CAAC,EAAEF,EAAUE,CAAC,CAAC;AAChH,SAAOH;AACT;AASA,SAASI,EAAmBC,GAAY;AACtC,QAAMC,IAAcC,EAAeF,CAAU,GACvCG,IAAS,CAAA,GACTC,IAAuB,oBAAI,IAAG;AACpC,aAAWR,KAAaK,GAAa;AACnC,UAAMI,IAAMT,EAAU,KAAI;AAC1B,IAAKQ,EAAK,IAAIC,CAAG,MACfD,EAAK,IAAIC,CAAG,GACZF,EAAO,KAAKP,CAAS;AAAA,EAEzB;AACA,SAAOO;AACT;AACA,SAASG,EAAkBC,GAAGC,GAAG;AAC/B,WAASV,IAAI,GAAGA,IAAI,KAAK,IAAIS,EAAE,QAAQC,EAAE,MAAM,GAAGV,KAAK;AACrD,QAAIS,EAAET,CAAC,IAAIU,EAAEV,CAAC,EAAG,QAAO;AACxB,QAAIS,EAAET,CAAC,IAAIU,EAAEV,CAAC,EAAG,QAAO;AAAA,EAC1B;AACA,SAAOS,EAAE,SAASC,EAAE;AACtB;AACA,SAASN,EAAeF,GAAY;AAClC,SAAOA,EAAW,KAAKM,CAAiB;AAC1C;AACA,SAASG,EAAKd,GAAME,GAAS;AAC3B,MAAIa;AACJ,SAAAC,EAAMhB,GAAM;AAAA,IACV,GAAGE;AAAA,IACH,SAAS,CAACe,GAAOhB,MAAc;AAC7B,UAAIC,EAAQ,UAAUe,GAAOhB,CAAS;AACpC,eAAAc,IAAQE,GACD;AAAA,IAEX;AAAA,EACJ,CAAG,GACMF;AACT;AACA,SAASG,EAAQlB,GAAME,GAAS;AAC9B,QAAMa,IAAQ,CAAA;AACd,SAAAC,EAAMhB,GAAM;AAAA,IACV,SAAS,CAACiB,GAAOhB,MAAc;AAC7B,MAAIC,EAAQ,UAAUe,GAAOhB,CAAS,KAAGc,EAAM,KAAKE,CAAK;AAAA,IAC3D;AAAA,IACA,aAAaf,EAAQ;AAAA,EACzB,CAAG,GACMa;AACT;AACA,SAASI,EAAcnB,GAAME,GAAS;AACpC,MAAIa;AACJ,SAAAC,EAAMhB,GAAM;AAAA,IACV,SAAS,CAACiB,GAAOhB,MAAc;AAC7B,UAAIC,EAAQ,UAAUe,GAAOhB,CAAS;AACpC,eAAAc,IAAQ,CAAC,GAAGd,CAAS,GACd;AAAA,IAEX;AAAA,IACA,aAAaC,EAAQ;AAAA,EACzB,CAAG,GACMa;AACT;AAWA,SAASK,EAAOpB,GAAME,GAAS;AAC7B,MAAIM,IAASN,EAAQ;AACrB,SAAAc,EAAMhB,GAAM;AAAA,IACV,GAAGE;AAAA,IACH,SAAS,CAACe,GAAOhB,MAAc;AAC7B,MAAAO,IAASN,EAAQ,WAAWM,GAAQS,GAAOhB,CAAS;AAAA,IACtD;AAAA,EACJ,CAAG,GACMO;AACT;AAWA,SAASa,EAAQrB,GAAME,GAAS;AAC9B,SAAOkB,EAAOpB,GAAM;AAAA,IAClB,GAAGE;AAAA,IACH,eAAe,CAAA;AAAA,IACf,YAAY,CAACM,GAAQS,GAAOhB,OAC1BO,EAAO,KAAK,GAAGN,EAAQ,UAAUe,GAAOhB,CAAS,CAAC,GAC3CO;AAAA,EAEb,CAAG;AACH;AACA,SAASc,EAAOtB,GAAME,GAAS;AAC7B,QAAM,EAAE,WAAAqB,GAAW,QAAAC,GAAQ,aAAAC,EAAW,IAAKvB,GACrCwB,IAAkB,CAACC,GAAO1B,MAAc;AAC5C,UAAM2B,IAAWH,EAAYE,GAAO1B,CAAS,GACvC4B,IAAmB,CAAA;AACzB,IAAAD,EAAS,QAAQ,CAACX,GAAOa,MAAU;AACjC,YAAMC,IAAiB,CAAC,GAAG9B,GAAW6B,CAAK,GACrCE,IAAgBN,EAAgBT,GAAOc,CAAc;AAC3D,MAAIC,KAAeH,EAAiB,KAAKG,CAAa;AAAA,IACxD,CAAC;AACD,UAAMC,IAAShC,EAAU,WAAW,GAC9BiC,IAAcX,EAAUI,GAAO1B,CAAS,GACxCkC,IAAsBN,EAAiB,SAAS;AACtD,WAAII,KAAUC,KAAeC,IACpBX,EAAOG,GAAOE,GAAkB5B,CAAS,IAE3C;AAAA,EACT;AACA,SAAOyB,EAAgB1B,GAAM,CAAA,CAAE,KAAKwB,EAAOxB,GAAM,CAAA,GAAI,EAAE;AACzD;AACA,SAASoC,EAAQC,GAAUnC,GAAS;AAClC,QAAMoC,IAAQ,CAAA;AACd,MAAIC,IAAM;AACV,QAAMC,IAAyB,oBAAI,IAAG,GAChCC,IAA4B,oBAAI,IAAG;AACzC,SAAAzB,EAAMqB,GAAU;AAAA,IACd,aAAanC,EAAQ;AAAA,IACrB,SAAS,CAACF,GAAMC,MAAc;AAC5B,MAAKuC,EAAO,IAAIxC,CAAI,KAClBwC,EAAO,IAAIxC,GAAMuC,GAAK;AAExB,YAAMX,IAAW1B,EAAQ,YAAYF,GAAMC,CAAS;AACpD,MAAA2B,EAAS,QAAQ,CAACX,MAAU;AAC1B,QAAKwB,EAAU,IAAIxB,CAAK,KACtBwB,EAAU,IAAIxB,GAAOjB,CAAI,GAEtBwC,EAAO,IAAIvB,CAAK,KACnBuB,EAAO,IAAIvB,GAAOsB,GAAK;AAAA,MAE3B,CAAC;AACD,YAAMG,IAAYd,EAAS,SAAS,IAAIA,EAAS,IAAI,CAACX,MAAUuB,EAAO,IAAIvB,CAAK,CAAC,IAAI,QAC/E0B,IAASF,EAAU,IAAIzC,CAAI,GAC3B4C,IAAUD,IAASH,EAAO,IAAIG,CAAM,IAAI,QACxCE,IAASL,EAAO,IAAIxC,CAAI;AAC9B,MAAAsC,EAAM,KAAK,EAAE,GAAGtC,GAAM,WAAA0C,GAAW,SAAAE,GAAS,QAAAC,GAAQ;AAAA,IACpD;AAAA,EACJ,CAAG,GACMP;AACT;AACA,SAASQ,EAAgBhB,GAAOQ,GAAO;AACrC,SAAO,EAAE,MAAM,UAAU,OAAAR,GAAO,OAAAQ,EAAK;AACvC;AACA,SAASS,EAAgBC,GAAS;AAChC,SAAO,EAAE,MAAM,UAAU,SAAAA,EAAO;AAClC;AACA,SAASC,IAAmB;AAC1B,SAAO,EAAE,MAAM,UAAS;AAC1B;AACA,SAASC,EAAejD,GAAW;AACjC,SAAO,CAACA,EAAU,MAAM,GAAG,EAAE,GAAGA,EAAUA,EAAU,SAAS,CAAC,CAAC;AACjE;AACA,SAASkD,EAAuBlD,GAAWqC,GAAOc,IAA6B,oBAAI,IAAG,GAAI;AACxF,QAAM,CAACC,GAAiBvB,CAAK,IAAIoB,EAAejD,CAAS;AACzD,WAASE,IAAIkD,EAAgB,SAAS,GAAGlD,KAAK,GAAGA,KAAK;AACpD,UAAMmD,IAAYD,EAAgB,MAAM,GAAGlD,CAAC,EAAE,KAAI;AAClD,IAAQiD,EAAW,IAAIE,CAAS,GAAG,SAC5B,YAGPF,EAAW,IAAIE,GAAWL,GAAkB;AAAA,EAC9C;AACA,QAAMM,IAAYH,EAAW,IAAIC,EAAgB,KAAI,CAAE;AACvD,SAAQE,GAAW,SACZ,WACHH,EAAW,IAAIC,EAAgB,QAAQ;AAAA,IACrC,MAAM;AAAA,IACN,eAAeE,EAAU;AAAA,IACzB,aAAazB;AAAA,IACb,aAAaQ;AAAA,EACrB,CAAO,IAGDc,EAAW,IAAIC,EAAgB,KAAI,GAAIP,EAAgBhB,GAAOQ,CAAK,CAAC,GAEjEc;AACT;AACA,SAASI,EAAqBnD,GAAY;AACxC,QAAM+C,IAA6B,oBAAI,IAAG,GACpCK,IAAkC,oBAAI,IAAG;AAC/C,aAAWxD,KAAaI,GAAY;AAClC,UAAMiD,IAAYrD,EAAU,MAAM,GAAG,EAAE,EAAE,KAAI,GACvCyD,IAAQD,EAAgB,IAAIH,CAAS,KAAK,CAAA;AAChD,IAAAI,EAAM,KAAKzD,EAAUA,EAAU,SAAS,CAAC,CAAC,GAC1CwD,EAAgB;AAAA,MACdH;AAAA,MACAI,EAAM,KAAK,CAAC9C,GAAGC,MAAMD,IAAIC,CAAC;AAAA,IAChC;AAAA,EACE;AACA,aAAWZ,KAAaI;AACtB,aAASF,IAAIF,EAAU,SAAS,GAAGE,KAAK,GAAGA,KAAK;AAC9C,YAAMmD,IAAYrD,EAAU,MAAM,GAAGE,CAAC,EAAE,KAAI;AAC5C,MAAKiD,EAAW,IAAIE,CAAS,KAC3BF,EAAW,IAAIE,GAAWL,GAAkB;AAAA,IAEhD;AAEF,aAAW,CAACK,GAAWN,CAAO,KAAKS;AACjC,IAAAL,EAAW,IAAIE,GAAWP,EAAgBC,CAAO,CAAC;AAEpD,SAAOI;AACT;AACA,SAASO,EAAqB1D,GAAWD,GAAM;AAC7C,QAAMoD,IAA6B,oBAAI,IAAG,GACpC,CAACC,GAAiBvB,CAAK,IAAIoB,EAAejD,CAAS;AACzD,WAASE,IAAIkD,EAAgB,SAAS,GAAGlD,KAAK,GAAGA,KAAK;AACpD,UAAMmD,IAAYD,EAAgB,MAAM,GAAGlD,CAAC,EAAE,KAAI;AAClD,IAAAiD,EAAW,IAAIE,GAAWL,GAAkB;AAAA,EAC9C;AACA,SAAAG,EAAW,IAAIC,EAAgB,QAAQ;AAAA,IACrC,MAAM;AAAA,IACN,eAAe,CAACvB,CAAK;AAAA,IACrB,aAAaA;AAAA,IACb,aAAa,CAAC9B,CAAI;AAAA,EACtB,CAAG,GACMoD;AACT;AACA,SAASQ,EAAO5D,GAAMoD,GAAYlD,GAAS;AACzC,SAAO2D,EAAI7D,GAAM;AAAA,IACf,GAAGE;AAAA,IACH,aAAa,CAACyB,GAAO1B,MAAc;AACjC,YAAMS,IAAMT,EAAU,KAAI;AAE1B,cADkBmD,EAAW,IAAI1C,CAAG,GACjB,MAAI;AAAA,QACrB,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AACH,iBAAOR,EAAQ,YAAYyB,GAAO1B,CAAS;AAAA,QAC7C;AACE,iBAAO,CAAA;AAAA,MACjB;AAAA,IACI;AAAA,IACA,WAAW,CAAC0B,GAAOC,GAAU3B,MAAc;AACzC,YAAMS,IAAMT,EAAU,KAAI,GACpBsD,IAAYH,EAAW,IAAI1C,CAAG;AACpC,cAAQ6C,GAAW,MAAI;AAAA,QACrB,KAAK;AACH,iBAAOrD,EAAQ;AAAA,YACbyB;AAAA,YACAC,EAAS,OAAO,CAACkC,GAAGhC,MAAU,CAACyB,EAAU,QAAQ,SAASzB,CAAK,CAAC;AAAA,YAChE7B;AAAA,UACZ;AAAA,QACQ,KAAK;AACH,gBAAM8D,IAAkBnC,EAAS,OAAO,CAACkC,GAAGhC,MAAU,CAACyB,EAAU,cAAc,SAASzB,CAAK,CAAC,GACxFkC,IAAgBT,EAAU,cAAc;AAAA,YAC5C,CAACzB,GAAOmC,MAAiBA,IAAenC,IAAQA,IAAQ,IAAIA;AAAA,YAC5DyB,EAAU;AAAA,UACtB;AACU,iBAAOrD,EAAQ,OAAOyB,GAAOuC,EAAOH,GAAiBC,GAAe,GAAG,GAAGT,EAAU,WAAW,GAAGtD,CAAS;AAAA,QAC7G,KAAK;AACH,iBAAOC,EAAQ,OAAOyB,GAAOuC,EAAOtC,GAAU2B,EAAU,OAAO,GAAG,GAAGA,EAAU,KAAK,GAAGtD,CAAS;AAAA,QAClG,KAAK;AACH,iBAAOC,EAAQ,OAAOyB,GAAOC,GAAU3B,CAAS;AAAA,QAClD;AACE,iBAAO0B;AAAA,MACjB;AAAA,IACI;AAAA,EACJ,CAAG;AACH;AACA,SAASuC,EAAOC,GAAOC,GAAOC,MAAgBC,GAAO;AACnD,SAAO,CAAC,GAAGH,EAAM,MAAM,GAAGC,CAAK,GAAG,GAAGE,GAAO,GAAGH,EAAM,MAAMC,IAAQC,CAAW,CAAC;AACjF;AACA,SAASR,EAAI7D,GAAME,GAAS;AAC1B,QAAMqE,IAAc,CAAA;AACpB,SAAAvD,EAAMhB,GAAM;AAAA,IACV,GAAGE;AAAA,IACH,SAAS,CAACe,GAAOhB,MAAc;AAC7B,YAAMuE,IAAe,CAAC,GAAG,GAAGvE,CAAS,GAC/BS,IAAM8D,EAAa,KAAI,GACvBC,IAAcvE,EAAQ,UAAUe,GAAOsD,EAAY7D,CAAG,KAAK,CAAA,GAAIT,CAAS,GACxEqD,IAAYkB,EAAa,MAAM,GAAG,EAAE,EAAE,KAAI,GAC1CE,IAAiBH,EAAYjB,CAAS,KAAK,CAAA;AACjD,MAAAoB,EAAe,KAAKD,CAAW,GAC/BF,EAAYjB,CAAS,IAAIoB;AAAA,IAC3B;AAAA,EACJ,CAAG,GACMH,EAAY,EAAE,EAAE,CAAC;AAC1B;AACA,SAASI,EAAO3E,GAAME,GAAS;AAC7B,QAAM,EAAE,OAAAoC,GAAO,IAAAsC,EAAE,IAAK1E;AACtB,MAAI0E,EAAG,WAAW,EAAG,OAAM,IAAI,MAAM,gCAAgC;AACrE,QAAMC,IAAQ1B,EAAuByB,GAAItC,CAAK;AAC9C,SAAOsB,EAAO5D,GAAM6E,GAAO3E,CAAO;AACpC;AACA,SAAS4E,EAAQ9E,GAAME,GAAS;AAC9B,MAAIA,EAAQ,GAAG,WAAW,EAAG,QAAOA,EAAQ;AAC5C,QAAMkD,IAAaO,EAAqBzD,EAAQ,IAAIA,EAAQ,IAAI;AAChE,SAAO0D,EAAO5D,GAAMoD,GAAYlD,CAAO;AACzC;AACA,SAAS6E,EAAO/E,GAAME,GAAS;AAC7B,MAAIA,EAAQ,WAAW,WAAW,EAAG,QAAOF;AAC5C,aAAWC,KAAaC,EAAQ;AAC9B,QAAID,EAAU,WAAW,EAAG,OAAM,IAAI,MAAM,4BAA4B;AAE1E,QAAMmD,IAAaI,EAAqBtD,EAAQ,UAAU;AAC1D,SAAO0D,EAAO5D,GAAMoD,GAAYlD,CAAO;AACzC;AACA,SAAS8E,EAAKhF,GAAME,GAAS;AAC3B,MAAIA,EAAQ,WAAW,WAAW,EAAG,QAAOF;AAC5C,aAAWC,KAAaC,EAAQ;AAC9B,QAAID,EAAU,WAAW,EAAG,OAAM,IAAI,MAAM,0BAA0B;AAExE,MAAIC,EAAQ,GAAG,WAAW,EAAG,OAAM,IAAI,MAAM,8BAA8B;AAC3E,QAAM+E,IAAsB7E,EAAmBF,EAAQ,UAAU,GAC3DgF,IAAgBD,EAAoB,IAAI,CAAChF,MAAcF,EAAOC,GAAMC,GAAWC,CAAO,CAAC,GACvFkD,IAAaD,EAAuBjD,EAAQ,IAAIgF,GAAe1B,EAAqByB,CAAmB,CAAC;AAC9G,SAAOrB,EAAO5D,GAAMoD,GAAYlD,CAAO;AACzC;AACA,SAASc,EAAMhB,GAAME,GAAS;AAC5B,QAAM,EAAE,SAAAiF,GAAS,SAAAC,GAAS,aAAA3D,EAAW,IAAKvB;AAC1C,MAAID,IAAY,CAAA,GACZoF,IAAQ,CAAC,EAAE,MAAArF,GAAM;AACrB,QAAMsF,IAAepF,EAAQ,iBAAiB,MAAMD,IAAY,MAAMA,EAAU,MAAK;AACrF,SAAOoF,EAAM,SAAS,KAAG;AACvB,QAAIE,IAAUF,EAAMA,EAAM,SAAS,CAAC;AACpC,QAAIE,EAAQ,UAAU,QAAQ;AAC5B,YAAMC,IAAcL,IAAUI,EAAQ,MAAMD,EAAY,CAAE;AAC1D,UAAIE,MAAgB,OAAQ;AAC5B,MAAAD,EAAQ,QAAQC,MAAgB,SAAS,KAAK;AAAA,IAChD;AACA,UAAM5D,IAAW2D,EAAQ,YAAY9D,EAAY8D,EAAQ,MAAMD,GAAc;AAE7E,QADAC,EAAQ,aAAaA,EAAQ,WAAW3D,IACpC2D,EAAQ,UAAU,IAAI;AACxB,UAAIA,EAAQ,QAAQ3D,EAAS,QAAQ;AACnC,YAAI6D,IAAeF,EAAQ;AAC3B,QAAAtF,EAAU,KAAKwF,CAAY,GAC3BJ,EAAM,KAAK,EAAE,MAAMzD,EAAS6D,CAAY,EAAC,CAAE,GAC3CF,EAAQ,QAAQE,IAAe;AAC/B;AAAA,MACF;AAEA,UADoBL,IAAUG,EAAQ,MAAMD,EAAY,CAAE,MACtC,OAAQ;AAAA,IAC9B;AACA,IAAArF,EAAU,IAAG,GACboF,EAAM,IAAG;AAAA,EACX;AACF;","x_google_ignoreList":[0]}
+{"version":3,"file":"tree-visit.js","names":[],"sources":["../../../../../../../../../../node_modules/.bun/@zag-js+collection@1.35.3/node_modules/@zag-js/collection/dist/tree-visit.mjs"],"sourcesContent":["import \"./chunk-QZ7TP4HQ.mjs\";\n\n// src/tree-visit.ts\nfunction access(node, indexPath, options) {\n  for (let i = 0; i < indexPath.length; i++) node = options.getChildren(node, indexPath.slice(i + 1))[indexPath[i]];\n  return node;\n}\nfunction accessPath(node, indexPath, options) {\n  const result = [node];\n  for (let i = 0; i < indexPath.length; i++) {\n    node = options.getChildren(node, indexPath.slice(i + 1))[indexPath[i]];\n    result.push(node);\n  }\n  return result;\n}\nfunction ancestorIndexPaths(indexPaths) {\n  const sortedPaths = sortIndexPaths(indexPaths);\n  const result = [];\n  const seen = /* @__PURE__ */ new Set();\n  for (const indexPath of sortedPaths) {\n    const key = indexPath.join();\n    if (!seen.has(key)) {\n      seen.add(key);\n      result.push(indexPath);\n    }\n  }\n  return result;\n}\nfunction compareIndexPaths(a, b) {\n  for (let i = 0; i < Math.min(a.length, b.length); i++) {\n    if (a[i] < b[i]) return -1;\n    if (a[i] > b[i]) return 1;\n  }\n  return a.length - b.length;\n}\nfunction sortIndexPaths(indexPaths) {\n  return indexPaths.sort(compareIndexPaths);\n}\nfunction find(node, options) {\n  let found;\n  visit(node, {\n    ...options,\n    onEnter: (child, indexPath) => {\n      if (options.predicate(child, indexPath)) {\n        found = child;\n        return \"stop\";\n      }\n    }\n  });\n  return found;\n}\nfunction findAll(node, options) {\n  const found = [];\n  visit(node, {\n    onEnter: (child, indexPath) => {\n      if (options.predicate(child, indexPath)) found.push(child);\n    },\n    getChildren: options.getChildren\n  });\n  return found;\n}\nfunction findIndexPath(node, options) {\n  let found;\n  visit(node, {\n    onEnter: (child, indexPath) => {\n      if (options.predicate(child, indexPath)) {\n        found = [...indexPath];\n        return \"stop\";\n      }\n    },\n    getChildren: options.getChildren\n  });\n  return found;\n}\nfunction findAllIndexPaths(node, options) {\n  let found = [];\n  visit(node, {\n    onEnter: (child, indexPath) => {\n      if (options.predicate(child, indexPath)) found.push([...indexPath]);\n    },\n    getChildren: options.getChildren\n  });\n  return found;\n}\nfunction reduce(node, options) {\n  let result = options.initialResult;\n  visit(node, {\n    ...options,\n    onEnter: (child, indexPath) => {\n      result = options.nextResult(result, child, indexPath);\n    }\n  });\n  return result;\n}\nfunction flat(node, options) {\n  return reduce(node, {\n    ...options,\n    initialResult: [],\n    nextResult: (result, child) => {\n      result.push(child);\n      return result;\n    }\n  });\n}\nfunction flatMap(node, options) {\n  return reduce(node, {\n    ...options,\n    initialResult: [],\n    nextResult: (result, child, indexPath) => {\n      result.push(...options.transform(child, indexPath));\n      return result;\n    }\n  });\n}\nfunction filter(node, options) {\n  const { predicate, create, getChildren } = options;\n  const filterRecursive = (node2, indexPath) => {\n    const children = getChildren(node2, indexPath);\n    const filteredChildren = [];\n    children.forEach((child, index) => {\n      const childIndexPath = [...indexPath, index];\n      const filteredChild = filterRecursive(child, childIndexPath);\n      if (filteredChild) filteredChildren.push(filteredChild);\n    });\n    const isRoot = indexPath.length === 0;\n    const nodeMatches = predicate(node2, indexPath);\n    const hasFilteredChildren = filteredChildren.length > 0;\n    if (isRoot || nodeMatches || hasFilteredChildren) {\n      return create(node2, filteredChildren, indexPath);\n    }\n    return null;\n  };\n  return filterRecursive(node, []) || create(node, [], []);\n}\nfunction flatten(rootNode, options) {\n  const nodes = [];\n  let idx = 0;\n  const idxMap = /* @__PURE__ */ new Map();\n  const parentMap = /* @__PURE__ */ new Map();\n  visit(rootNode, {\n    getChildren: options.getChildren,\n    onEnter: (node, indexPath) => {\n      if (!idxMap.has(node)) {\n        idxMap.set(node, idx++);\n      }\n      const children = options.getChildren(node, indexPath);\n      children.forEach((child) => {\n        if (!parentMap.has(child)) {\n          parentMap.set(child, node);\n        }\n        if (!idxMap.has(child)) {\n          idxMap.set(child, idx++);\n        }\n      });\n      const _children = children.length > 0 ? children.map((child) => idxMap.get(child)) : void 0;\n      const parent = parentMap.get(node);\n      const _parent = parent ? idxMap.get(parent) : void 0;\n      const _index = idxMap.get(node);\n      nodes.push({ ...node, _children, _parent, _index });\n    }\n  });\n  return nodes;\n}\nfunction insertOperation(index, nodes) {\n  return { type: \"insert\", index, nodes };\n}\nfunction removeOperation(indexes) {\n  return { type: \"remove\", indexes };\n}\nfunction replaceOperation() {\n  return { type: \"replace\" };\n}\nfunction splitIndexPath(indexPath) {\n  return [indexPath.slice(0, -1), indexPath[indexPath.length - 1]];\n}\nfunction getInsertionOperations(indexPath, nodes, operations = /* @__PURE__ */ new Map()) {\n  const [parentIndexPath, index] = splitIndexPath(indexPath);\n  for (let i = parentIndexPath.length - 1; i >= 0; i--) {\n    const parentKey = parentIndexPath.slice(0, i).join();\n    switch (operations.get(parentKey)?.type) {\n      case \"remove\":\n        continue;\n    }\n    operations.set(parentKey, replaceOperation());\n  }\n  const operation = operations.get(parentIndexPath.join());\n  switch (operation?.type) {\n    case \"remove\":\n      operations.set(parentIndexPath.join(), {\n        type: \"removeThenInsert\",\n        removeIndexes: operation.indexes,\n        insertIndex: index,\n        insertNodes: nodes\n      });\n      break;\n    default:\n      operations.set(parentIndexPath.join(), insertOperation(index, nodes));\n  }\n  return operations;\n}\nfunction getRemovalOperations(indexPaths) {\n  const operations = /* @__PURE__ */ new Map();\n  const indexesToRemove = /* @__PURE__ */ new Map();\n  for (const indexPath of indexPaths) {\n    const parentKey = indexPath.slice(0, -1).join();\n    const value = indexesToRemove.get(parentKey) ?? [];\n    value.push(indexPath[indexPath.length - 1]);\n    indexesToRemove.set(\n      parentKey,\n      value.sort((a, b) => a - b)\n    );\n  }\n  for (const indexPath of indexPaths) {\n    for (let i = indexPath.length - 2; i >= 0; i--) {\n      const parentKey = indexPath.slice(0, i).join();\n      if (!operations.has(parentKey)) {\n        operations.set(parentKey, replaceOperation());\n      }\n    }\n  }\n  for (const [parentKey, indexes] of indexesToRemove) {\n    operations.set(parentKey, removeOperation(indexes));\n  }\n  return operations;\n}\nfunction getReplaceOperations(indexPath, node) {\n  const operations = /* @__PURE__ */ new Map();\n  const [parentIndexPath, index] = splitIndexPath(indexPath);\n  for (let i = parentIndexPath.length - 1; i >= 0; i--) {\n    const parentKey = parentIndexPath.slice(0, i).join();\n    operations.set(parentKey, replaceOperation());\n  }\n  operations.set(parentIndexPath.join(), {\n    type: \"removeThenInsert\",\n    removeIndexes: [index],\n    insertIndex: index,\n    insertNodes: [node]\n  });\n  return operations;\n}\nfunction mutate(node, operations, options) {\n  return map(node, {\n    ...options,\n    getChildren: (node2, indexPath) => {\n      const key = indexPath.join();\n      const operation = operations.get(key);\n      switch (operation?.type) {\n        case \"replace\":\n        case \"remove\":\n        case \"removeThenInsert\":\n        case \"insert\":\n          return options.getChildren(node2, indexPath);\n        default:\n          return [];\n      }\n    },\n    transform: (node2, children, indexPath) => {\n      const key = indexPath.join();\n      const operation = operations.get(key);\n      switch (operation?.type) {\n        case \"remove\":\n          return options.create(\n            node2,\n            children.filter((_, index) => !operation.indexes.includes(index)),\n            indexPath\n          );\n        case \"removeThenInsert\":\n          const updatedChildren = children.filter((_, index) => !operation.removeIndexes.includes(index));\n          const adjustedIndex = operation.removeIndexes.reduce(\n            (index, removedIndex) => removedIndex < index ? index - 1 : index,\n            operation.insertIndex\n          );\n          return options.create(node2, splice(updatedChildren, adjustedIndex, 0, ...operation.insertNodes), indexPath);\n        case \"insert\":\n          return options.create(node2, splice(children, operation.index, 0, ...operation.nodes), indexPath);\n        case \"replace\":\n          return options.create(node2, children, indexPath);\n        default:\n          return node2;\n      }\n    }\n  });\n}\nfunction splice(array, start, deleteCount, ...items) {\n  return [...array.slice(0, start), ...items, ...array.slice(start + deleteCount)];\n}\nfunction map(node, options) {\n  const childrenMap = {};\n  visit(node, {\n    ...options,\n    onLeave: (child, indexPath) => {\n      const keyIndexPath = [0, ...indexPath];\n      const key = keyIndexPath.join();\n      const transformed = options.transform(child, childrenMap[key] ?? [], indexPath);\n      const parentKey = keyIndexPath.slice(0, -1).join();\n      const parentChildren = childrenMap[parentKey] ?? [];\n      parentChildren.push(transformed);\n      childrenMap[parentKey] = parentChildren;\n    }\n  });\n  return childrenMap[\"\"][0];\n}\nfunction insert(node, options) {\n  const { nodes, at } = options;\n  if (at.length === 0) throw new Error(`Can't insert nodes at the root`);\n  const state = getInsertionOperations(at, nodes);\n  return mutate(node, state, options);\n}\nfunction replace(node, options) {\n  if (options.at.length === 0) return options.node;\n  const operations = getReplaceOperations(options.at, options.node);\n  return mutate(node, operations, options);\n}\nfunction remove(node, options) {\n  if (options.indexPaths.length === 0) return node;\n  for (const indexPath of options.indexPaths) {\n    if (indexPath.length === 0) throw new Error(`Can't remove the root node`);\n  }\n  const operations = getRemovalOperations(options.indexPaths);\n  return mutate(node, operations, options);\n}\nfunction move(node, options) {\n  if (options.indexPaths.length === 0) return node;\n  for (const indexPath of options.indexPaths) {\n    if (indexPath.length === 0) throw new Error(`Can't move the root node`);\n  }\n  if (options.to.length === 0) throw new Error(`Can't move nodes to the root`);\n  const _ancestorIndexPaths = ancestorIndexPaths(options.indexPaths);\n  const nodesToInsert = _ancestorIndexPaths.map((indexPath) => access(node, indexPath, options));\n  const operations = getInsertionOperations(options.to, nodesToInsert, getRemovalOperations(_ancestorIndexPaths));\n  return mutate(node, operations, options);\n}\nfunction visit(node, options) {\n  const { onEnter, onLeave, getChildren } = options;\n  let indexPath = [];\n  let stack = [{ node }];\n  const getIndexPath = options.reuseIndexPath ? () => indexPath : () => indexPath.slice();\n  while (stack.length > 0) {\n    let wrapper = stack[stack.length - 1];\n    if (wrapper.state === void 0) {\n      const enterResult = onEnter?.(wrapper.node, getIndexPath());\n      if (enterResult === \"stop\") return;\n      wrapper.state = enterResult === \"skip\" ? -1 : 0;\n    }\n    const children = wrapper.children || getChildren(wrapper.node, getIndexPath());\n    wrapper.children || (wrapper.children = children);\n    if (wrapper.state !== -1) {\n      if (wrapper.state < children.length) {\n        let currentIndex = wrapper.state;\n        indexPath.push(currentIndex);\n        stack.push({ node: children[currentIndex] });\n        wrapper.state = currentIndex + 1;\n        continue;\n      }\n      const leaveResult = onLeave?.(wrapper.node, getIndexPath());\n      if (leaveResult === \"stop\") return;\n    }\n    indexPath.pop();\n    stack.pop();\n  }\n}\nexport {\n  access,\n  accessPath,\n  ancestorIndexPaths,\n  compareIndexPaths,\n  filter,\n  find,\n  findAll,\n  findAllIndexPaths,\n  findIndexPath,\n  flat,\n  flatMap,\n  flatten,\n  insert,\n  map,\n  move,\n  reduce,\n  remove,\n  replace,\n  sortIndexPaths,\n  visit\n};\n"],"x_google_ignoreList":[0],"mappings":";AAGA,SAAS,EAAO,GAAM,GAAW,GAAS;AACxC,MAAK,IAAI,IAAI,GAAG,IAAI,EAAU,QAAQ,IAAK,KAAO,EAAQ,YAAY,GAAM,EAAU,MAAM,IAAI,EAAE,CAAC,CAAC,EAAU;AAC9G,QAAO;;AAUT,SAAS,EAAmB,GAAY;CACtC,IAAM,IAAc,EAAe,EAAW,EACxC,IAAS,EAAE,EACX,oBAAuB,IAAI,KAAK;AACtC,MAAK,IAAM,KAAa,GAAa;EACnC,IAAM,IAAM,EAAU,MAAM;AAC5B,EAAK,EAAK,IAAI,EAAI,KAChB,EAAK,IAAI,EAAI,EACb,EAAO,KAAK,EAAU;;AAG1B,QAAO;;AAET,SAAS,EAAkB,GAAG,GAAG;AAC/B,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK;AACrD,MAAI,EAAE,KAAK,EAAE,GAAI,QAAO;AACxB,MAAI,EAAE,KAAK,EAAE,GAAI,QAAO;;AAE1B,QAAO,EAAE,SAAS,EAAE;;AAEtB,SAAS,EAAe,GAAY;AAClC,QAAO,EAAW,KAAK,EAAkB;;AAE3C,SAAS,EAAK,GAAM,GAAS;CAC3B,IAAI;AAUJ,QATA,EAAM,GAAM;EACV,GAAG;EACH,UAAU,GAAO,MAAc;AAC7B,OAAI,EAAQ,UAAU,GAAO,EAAU,CAErC,QADA,IAAQ,GACD;;EAGZ,CAAC,EACK;;AAET,SAAS,EAAQ,GAAM,GAAS;CAC9B,IAAM,IAAQ,EAAE;AAOhB,QANA,EAAM,GAAM;EACV,UAAU,GAAO,MAAc;AAC7B,GAAI,EAAQ,UAAU,GAAO,EAAU,IAAE,EAAM,KAAK,EAAM;;EAE5D,aAAa,EAAQ;EACtB,CAAC,EACK;;AAET,SAAS,EAAc,GAAM,GAAS;CACpC,IAAI;AAUJ,QATA,EAAM,GAAM;EACV,UAAU,GAAO,MAAc;AAC7B,OAAI,EAAQ,UAAU,GAAO,EAAU,CAErC,QADA,IAAQ,CAAC,GAAG,EAAU,EACf;;EAGX,aAAa,EAAQ;EACtB,CAAC,EACK;;AAYT,SAAS,EAAO,GAAM,GAAS;CAC7B,IAAI,IAAS,EAAQ;AAOrB,QANA,EAAM,GAAM;EACV,GAAG;EACH,UAAU,GAAO,MAAc;AAC7B,OAAS,EAAQ,WAAW,GAAQ,GAAO,EAAU;;EAExD,CAAC,EACK;;AAYT,SAAS,EAAQ,GAAM,GAAS;AAC9B,QAAO,EAAO,GAAM;EAClB,GAAG;EACH,eAAe,EAAE;EACjB,aAAa,GAAQ,GAAO,OAC1B,EAAO,KAAK,GAAG,EAAQ,UAAU,GAAO,EAAU,CAAC,EAC5C;EAEV,CAAC;;AAEJ,SAAS,EAAO,GAAM,GAAS;CAC7B,IAAM,EAAE,cAAW,WAAQ,mBAAgB,GACrC,KAAmB,GAAO,MAAc;EAC5C,IAAM,IAAW,EAAY,GAAO,EAAU,EACxC,IAAmB,EAAE;AAC3B,IAAS,SAAS,GAAO,MAAU;GAEjC,IAAM,IAAgB,EAAgB,GADf,CAAC,GAAG,GAAW,EAAM,CACgB;AAC5D,GAAI,KAAe,EAAiB,KAAK,EAAc;IACvD;EACF,IAAM,IAAS,EAAU,WAAW,GAC9B,IAAc,EAAU,GAAO,EAAU,EACzC,IAAsB,EAAiB,SAAS;AAItD,SAHI,KAAU,KAAe,IACpB,EAAO,GAAO,GAAkB,EAAU,GAE5C;;AAET,QAAO,EAAgB,GAAM,EAAE,CAAC,IAAI,EAAO,GAAM,EAAE,EAAE,EAAE,CAAC;;AAE1D,SAAS,EAAQ,GAAU,GAAS;CAClC,IAAM,IAAQ,EAAE,EACZ,IAAM,GACJ,oBAAyB,IAAI,KAAK,EAClC,oBAA4B,IAAI,KAAK;AAuB3C,QAtBA,EAAM,GAAU;EACd,aAAa,EAAQ;EACrB,UAAU,GAAM,MAAc;AAC5B,GAAK,EAAO,IAAI,EAAK,IACnB,EAAO,IAAI,GAAM,IAAM;GAEzB,IAAM,IAAW,EAAQ,YAAY,GAAM,EAAU;AACrD,KAAS,SAAS,MAAU;AAI1B,IAHK,EAAU,IAAI,EAAM,IACvB,EAAU,IAAI,GAAO,EAAK,EAEvB,EAAO,IAAI,EAAM,IACpB,EAAO,IAAI,GAAO,IAAM;KAE1B;GACF,IAAM,IAAY,EAAS,SAAS,IAAI,EAAS,KAAK,MAAU,EAAO,IAAI,EAAM,CAAC,GAAG,KAAK,GACpF,IAAS,EAAU,IAAI,EAAK,EAC5B,IAAU,IAAS,EAAO,IAAI,EAAO,GAAG,KAAK,GAC7C,IAAS,EAAO,IAAI,EAAK;AAC/B,KAAM,KAAK;IAAE,GAAG;IAAM;IAAW;IAAS;IAAQ,CAAC;;EAEtD,CAAC,EACK;;AAET,SAAS,EAAgB,GAAO,GAAO;AACrC,QAAO;EAAE,MAAM;EAAU;EAAO;EAAO;;AAEzC,SAAS,EAAgB,GAAS;AAChC,QAAO;EAAE,MAAM;EAAU;EAAS;;AAEpC,SAAS,IAAmB;AAC1B,QAAO,EAAE,MAAM,WAAW;;AAE5B,SAAS,EAAe,GAAW;AACjC,QAAO,CAAC,EAAU,MAAM,GAAG,GAAG,EAAE,EAAU,EAAU,SAAS,GAAG;;AAElE,SAAS,EAAuB,GAAW,GAAO,oBAA6B,IAAI,KAAK,EAAE;CACxF,IAAM,CAAC,GAAiB,KAAS,EAAe,EAAU;AAC1D,MAAK,IAAI,IAAI,EAAgB,SAAS,GAAG,KAAK,GAAG,KAAK;EACpD,IAAM,IAAY,EAAgB,MAAM,GAAG,EAAE,CAAC,MAAM;AACpD,UAAQ,EAAW,IAAI,EAAU,EAAE,MAAnC;GACE,KAAK,SACH;;AAEJ,IAAW,IAAI,GAAW,GAAkB,CAAC;;CAE/C,IAAM,IAAY,EAAW,IAAI,EAAgB,MAAM,CAAC;AACxD,SAAQ,GAAW,MAAnB;EACE,KAAK;AACH,KAAW,IAAI,EAAgB,MAAM,EAAE;IACrC,MAAM;IACN,eAAe,EAAU;IACzB,aAAa;IACb,aAAa;IACd,CAAC;AACF;EACF,QACE,GAAW,IAAI,EAAgB,MAAM,EAAE,EAAgB,GAAO,EAAM,CAAC;;AAEzE,QAAO;;AAET,SAAS,EAAqB,GAAY;CACxC,IAAM,oBAA6B,IAAI,KAAK,EACtC,oBAAkC,IAAI,KAAK;AACjD,MAAK,IAAM,KAAa,GAAY;EAClC,IAAM,IAAY,EAAU,MAAM,GAAG,GAAG,CAAC,MAAM,EACzC,IAAQ,EAAgB,IAAI,EAAU,IAAI,EAAE;AAElD,EADA,EAAM,KAAK,EAAU,EAAU,SAAS,GAAG,EAC3C,EAAgB,IACd,GACA,EAAM,MAAM,GAAG,MAAM,IAAI,EAAE,CAC5B;;AAEH,MAAK,IAAM,KAAa,EACtB,MAAK,IAAI,IAAI,EAAU,SAAS,GAAG,KAAK,GAAG,KAAK;EAC9C,IAAM,IAAY,EAAU,MAAM,GAAG,EAAE,CAAC,MAAM;AAC9C,EAAK,EAAW,IAAI,EAAU,IAC5B,EAAW,IAAI,GAAW,GAAkB,CAAC;;AAInD,MAAK,IAAM,CAAC,GAAW,MAAY,EACjC,GAAW,IAAI,GAAW,EAAgB,EAAQ,CAAC;AAErD,QAAO;;AAET,SAAS,EAAqB,GAAW,GAAM;CAC7C,IAAM,oBAA6B,IAAI,KAAK,EACtC,CAAC,GAAiB,KAAS,EAAe,EAAU;AAC1D,MAAK,IAAI,IAAI,EAAgB,SAAS,GAAG,KAAK,GAAG,KAAK;EACpD,IAAM,IAAY,EAAgB,MAAM,GAAG,EAAE,CAAC,MAAM;AACpD,IAAW,IAAI,GAAW,GAAkB,CAAC;;AAQ/C,QANA,EAAW,IAAI,EAAgB,MAAM,EAAE;EACrC,MAAM;EACN,eAAe,CAAC,EAAM;EACtB,aAAa;EACb,aAAa,CAAC,EAAK;EACpB,CAAC,EACK;;AAET,SAAS,EAAO,GAAM,GAAY,GAAS;AACzC,QAAO,EAAI,GAAM;EACf,GAAG;EACH,cAAc,GAAO,MAAc;GACjC,IAAM,IAAM,EAAU,MAAM;AAE5B,WADkB,EAAW,IAAI,EAAI,EAClB,MAAnB;IACE,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK,SACH,QAAO,EAAQ,YAAY,GAAO,EAAU;IAC9C,QACE,QAAO,EAAE;;;EAGf,YAAY,GAAO,GAAU,MAAc;GACzC,IAAM,IAAM,EAAU,MAAM,EACtB,IAAY,EAAW,IAAI,EAAI;AACrC,WAAQ,GAAW,MAAnB;IACE,KAAK,SACH,QAAO,EAAQ,OACb,GACA,EAAS,QAAQ,GAAG,MAAU,CAAC,EAAU,QAAQ,SAAS,EAAM,CAAC,EACjE,EACD;IACH,KAAK;KACH,IAAM,IAAkB,EAAS,QAAQ,GAAG,MAAU,CAAC,EAAU,cAAc,SAAS,EAAM,CAAC,EACzF,IAAgB,EAAU,cAAc,QAC3C,GAAO,MAAiB,IAAe,IAAQ,IAAQ,IAAI,GAC5D,EAAU,YACX;AACD,YAAO,EAAQ,OAAO,GAAO,EAAO,GAAiB,GAAe,GAAG,GAAG,EAAU,YAAY,EAAE,EAAU;IAC9G,KAAK,SACH,QAAO,EAAQ,OAAO,GAAO,EAAO,GAAU,EAAU,OAAO,GAAG,GAAG,EAAU,MAAM,EAAE,EAAU;IACnG,KAAK,UACH,QAAO,EAAQ,OAAO,GAAO,GAAU,EAAU;IACnD,QACE,QAAO;;;EAGd,CAAC;;AAEJ,SAAS,EAAO,GAAO,GAAO,GAAa,GAAG,GAAO;AACnD,QAAO;EAAC,GAAG,EAAM,MAAM,GAAG,EAAM;EAAE,GAAG;EAAO,GAAG,EAAM,MAAM,IAAQ,EAAY;EAAC;;AAElF,SAAS,EAAI,GAAM,GAAS;CAC1B,IAAM,IAAc,EAAE;AAatB,QAZA,EAAM,GAAM;EACV,GAAG;EACH,UAAU,GAAO,MAAc;GAC7B,IAAM,IAAe,CAAC,GAAG,GAAG,EAAU,EAChC,IAAM,EAAa,MAAM,EACzB,IAAc,EAAQ,UAAU,GAAO,EAAY,MAAQ,EAAE,EAAE,EAAU,EACzE,IAAY,EAAa,MAAM,GAAG,GAAG,CAAC,MAAM,EAC5C,IAAiB,EAAY,MAAc,EAAE;AAEnD,GADA,EAAe,KAAK,EAAY,EAChC,EAAY,KAAa;;EAE5B,CAAC,EACK,EAAY,IAAI;;AAEzB,SAAS,EAAO,GAAM,GAAS;CAC7B,IAAM,EAAE,UAAO,UAAO;AACtB,KAAI,EAAG,WAAW,EAAG,OAAU,MAAM,iCAAiC;AAEtE,QAAO,EAAO,GADA,EAAuB,GAAI,EAAM,EACpB,EAAQ;;AAErC,SAAS,EAAQ,GAAM,GAAS;AAG9B,QAFI,EAAQ,GAAG,WAAW,IAAU,EAAQ,OAErC,EAAO,GADK,EAAqB,EAAQ,IAAI,EAAQ,KAAK,EACjC,EAAQ;;AAE1C,SAAS,EAAO,GAAM,GAAS;AAC7B,KAAI,EAAQ,WAAW,WAAW,EAAG,QAAO;AAC5C,MAAK,IAAM,KAAa,EAAQ,WAC9B,KAAI,EAAU,WAAW,EAAG,OAAU,MAAM,6BAA6B;AAG3E,QAAO,EAAO,GADK,EAAqB,EAAQ,WAAW,EAC3B,EAAQ;;AAE1C,SAAS,EAAK,GAAM,GAAS;AAC3B,KAAI,EAAQ,WAAW,WAAW,EAAG,QAAO;AAC5C,MAAK,IAAM,KAAa,EAAQ,WAC9B,KAAI,EAAU,WAAW,EAAG,OAAU,MAAM,2BAA2B;AAEzE,KAAI,EAAQ,GAAG,WAAW,EAAG,OAAU,MAAM,+BAA+B;CAC5E,IAAM,IAAsB,EAAmB,EAAQ,WAAW,EAC5D,IAAgB,EAAoB,KAAK,MAAc,EAAO,GAAM,GAAW,EAAQ,CAAC;AAE9F,QAAO,EAAO,GADK,EAAuB,EAAQ,IAAI,GAAe,EAAqB,EAAoB,CAAC,EAC/E,EAAQ;;AAE1C,SAAS,EAAM,GAAM,GAAS;CAC5B,IAAM,EAAE,YAAS,YAAS,mBAAgB,GACtC,IAAY,EAAE,EACd,IAAQ,CAAC,EAAE,SAAM,CAAC,EAChB,IAAe,EAAQ,uBAAuB,UAAkB,EAAU,OAAO;AACvF,QAAO,EAAM,SAAS,IAAG;EACvB,IAAI,IAAU,EAAM,EAAM,SAAS;AACnC,MAAI,EAAQ,UAAU,KAAK,GAAG;GAC5B,IAAM,IAAc,IAAU,EAAQ,MAAM,GAAc,CAAC;AAC3D,OAAI,MAAgB,OAAQ;AAC5B,KAAQ,QAAQ,MAAgB,SAAS,KAAK;;EAEhD,IAAM,IAAW,EAAQ,YAAY,EAAY,EAAQ,MAAM,GAAc,CAAC;AAE9E,MADA,AAAqB,EAAQ,aAAW,GACpC,EAAQ,UAAU,IAAI;AACxB,OAAI,EAAQ,QAAQ,EAAS,QAAQ;IACnC,IAAI,IAAe,EAAQ;AAG3B,IAFA,EAAU,KAAK,EAAa,EAC5B,EAAM,KAAK,EAAE,MAAM,EAAS,IAAe,CAAC,EAC5C,EAAQ,QAAQ,IAAe;AAC/B;;AAGF,OADoB,IAAU,EAAQ,MAAM,GAAc,CAAC,KACvC,OAAQ;;AAG9B,EADA,EAAU,KAAK,EACf,EAAM,KAAK"}