npm - @manafishrov/ui - Versions diffs - 1.2.6 → 1.2.7 - Mend

@manafishrov/ui 1.2.6 → 1.2.7

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (1284) hide show

package/dist/node_modules/.bun/@zag-js_collection@1.35.2/node_modules/@zag-js/collection/dist/list-collection.js DELETED Viewed

@@ -1,221 +0,0 @@
-import { __publicField as r } from "./chunk-QZ7TP4HQ.js";
-import { isEqual as O } from "../../../../../@zag-js_utils@1.35.2/node_modules/@zag-js/utils/dist/equal.js";
-import { isObject as g, hasProp as p } from "../../../../../@zag-js_utils@1.35.2/node_modules/@zag-js/utils/dist/guard.js";
-var d = {
-  itemToValue(u) {
-    return typeof u == "string" ? u : g(u) && p(u, "value") ? u.value : "";
-  },
-  itemToString(u) {
-    return typeof u == "string" ? u : g(u) && p(u, "label") ? u.label : d.itemToValue(u);
-  },
-  isItemDisabled(u) {
-    return g(u) && p(u, "disabled") ? !!u.disabled : !1;
-  }
-}, B = class I {
-  constructor(l) {
-    this.options = l, r(this, "items"), r(this, "indexMap", null), r(this, "copy", (t) => new I({ ...this.options, items: t ?? [...this.items] })), r(this, "isEqual", (t) => O(this.items, t.items)), r(this, "setItems", (t) => this.copy(t)), r(this, "getValues", (t = this.items) => {
-      const e = [];
-      for (const i of t) {
-        const s = this.getItemValue(i);
-        s != null && e.push(s);
-      }
-      return e;
-    }), r(this, "find", (t) => {
-      if (t == null) return null;
-      const e = this.indexOf(t);
-      return e !== -1 ? this.at(e) : null;
-    }), r(this, "findMany", (t) => {
-      const e = [];
-      for (const i of t) {
-        const s = this.find(i);
-        s != null && e.push(s);
-      }
-      return e;
-    }), r(this, "at", (t) => {
-      if (!this.options.groupBy && !this.options.groupSort)
-        return this.items[t] ?? null;
-      let e = 0;
-      const i = this.group();
-      for (const [, s] of i)
-        for (const n of s) {
-          if (e === t) return n;
-          e++;
-        }
-      return null;
-    }), r(this, "sortFn", (t, e) => {
-      const i = this.indexOf(t), s = this.indexOf(e);
-      return (i ?? 0) - (s ?? 0);
-    }), r(this, "sort", (t) => [...t].sort(this.sortFn.bind(this))), r(this, "getItemValue", (t) => t == null ? null : this.options.itemToValue?.(t) ?? d.itemToValue(t)), r(this, "getItemDisabled", (t) => t == null ? !1 : this.options.isItemDisabled?.(t) ?? d.isItemDisabled(t)), r(this, "stringifyItem", (t) => t == null ? null : this.options.itemToString?.(t) ?? d.itemToString(t)), r(this, "stringify", (t) => t == null ? null : this.stringifyItem(this.find(t))), r(this, "stringifyItems", (t, e = ", ") => {
-      const i = [];
-      for (const s of t) {
-        const n = this.stringifyItem(s);
-        n != null && i.push(n);
-      }
-      return i.join(e);
-    }), r(this, "stringifyMany", (t, e) => this.stringifyItems(this.findMany(t), e)), r(this, "has", (t) => this.indexOf(t) !== -1), r(this, "hasItem", (t) => t == null ? !1 : this.has(this.getItemValue(t))), r(this, "group", () => {
-      const { groupBy: t, groupSort: e } = this.options;
-      if (!t) return [["", [...this.items]]];
-      const i = /* @__PURE__ */ new Map();
-      this.items.forEach((n, h) => {
-        const o = t(n, h);
-        i.has(o) || i.set(o, []), i.get(o).push(n);
-      });
-      let s = Array.from(i.entries());
-      return e && s.sort(([n], [h]) => {
-        if (typeof e == "function") return e(n, h);
-        if (Array.isArray(e)) {
-          const o = e.indexOf(n), a = e.indexOf(h);
-          return o === -1 ? 1 : a === -1 ? -1 : o - a;
-        }
-        return e === "asc" ? n.localeCompare(h) : e === "desc" ? h.localeCompare(n) : 0;
-      }), s;
-    }), r(this, "getNextValue", (t, e = 1, i = !1) => {
-      let s = this.indexOf(t);
-      if (s === -1) return null;
-      for (s = i ? Math.min(s + e, this.size - 1) : s + e; s <= this.size && this.getItemDisabled(this.at(s)); ) s++;
-      return this.getItemValue(this.at(s));
-    }), r(this, "getPreviousValue", (t, e = 1, i = !1) => {
-      let s = this.indexOf(t);
-      if (s === -1) return null;
-      for (s = i ? Math.max(s - e, 0) : s - e; s >= 0 && this.getItemDisabled(this.at(s)); ) s--;
-      return this.getItemValue(this.at(s));
-    }), r(this, "indexOf", (t) => {
-      if (t == null) return -1;
-      if (!this.options.groupBy && !this.options.groupSort)
-        return this.items.findIndex((e) => this.getItemValue(e) === t);
-      if (!this.indexMap) {
-        this.indexMap = /* @__PURE__ */ new Map();
-        let e = 0;
-        const i = this.group();
-        for (const [, s] of i)
-          for (const n of s) {
-            const h = this.getItemValue(n);
-            h != null && this.indexMap.set(h, e), e++;
-          }
-      }
-      return this.indexMap.get(t) ?? -1;
-    }), r(this, "getByText", (t, e) => {
-      const i = e != null ? this.indexOf(e) : -1, s = t.length === 1;
-      for (let n = 0; n < this.items.length; n++) {
-        const h = this.items[(i + n + 1) % this.items.length];
-        if (!(s && this.getItemValue(h) === e) && !this.getItemDisabled(h) && v(this.stringifyItem(h), t))
-          return h;
-      }
-    }), r(this, "search", (t, e) => {
-      const { state: i, currentValue: s, timeout: n = 350 } = e, h = i.keysSoFar + t, a = h.length > 1 && Array.from(h).every((m) => m === h[0]) ? h[0] : h, V = this.getByText(a, s), b = this.getItemValue(V);
-      function y() {
-        clearTimeout(i.timer), i.timer = -1;
-      }
-      function x(m) {
-        i.keysSoFar = m, y(), m !== "" && (i.timer = +setTimeout(() => {
-          x(""), y();
-        }, n));
-      }
-      return x(h), b;
-    }), r(this, "update", (t, e) => {
-      let i = this.indexOf(t);
-      return i === -1 ? this : this.copy([...this.items.slice(0, i), e, ...this.items.slice(i + 1)]);
-    }), r(this, "upsert", (t, e, i = "append") => {
-      let s = this.indexOf(t);
-      return s === -1 ? (i === "append" ? this.append : this.prepend)(e) : this.copy([...this.items.slice(0, s), e, ...this.items.slice(s + 1)]);
-    }), r(this, "insert", (t, ...e) => this.copy(f(this.items, t, ...e))), r(this, "insertBefore", (t, ...e) => {
-      let i = this.indexOf(t);
-      if (i === -1)
-        if (this.items.length === 0) i = 0;
-        else return this;
-      return this.copy(f(this.items, i, ...e));
-    }), r(this, "insertAfter", (t, ...e) => {
-      let i = this.indexOf(t);
-      if (i === -1)
-        if (this.items.length === 0) i = 0;
-        else return this;
-      return this.copy(f(this.items, i + 1, ...e));
-    }), r(this, "prepend", (...t) => this.copy(f(this.items, 0, ...t))), r(this, "append", (...t) => this.copy(f(this.items, this.items.length, ...t))), r(this, "filter", (t) => {
-      const e = this.items.filter((i, s) => t(this.stringifyItem(i), s, i));
-      return this.copy(e);
-    }), r(this, "remove", (...t) => {
-      const e = t.map(
-        (i) => typeof i == "string" ? i : this.getItemValue(i)
-      );
-      return this.copy(
-        this.items.filter((i) => {
-          const s = this.getItemValue(i);
-          return s == null ? !1 : !e.includes(s);
-        })
-      );
-    }), r(this, "move", (t, e) => {
-      const i = this.indexOf(t);
-      return i === -1 ? this : this.copy(c(this.items, [i], e));
-    }), r(this, "moveBefore", (t, ...e) => {
-      let i = this.items.findIndex((n) => this.getItemValue(n) === t);
-      if (i === -1) return this;
-      let s = e.map((n) => this.items.findIndex((h) => this.getItemValue(h) === n)).sort((n, h) => n - h);
-      return this.copy(c(this.items, s, i));
-    }), r(this, "moveAfter", (t, ...e) => {
-      let i = this.items.findIndex((n) => this.getItemValue(n) === t);
-      if (i === -1) return this;
-      let s = e.map((n) => this.items.findIndex((h) => this.getItemValue(h) === n)).sort((n, h) => n - h);
-      return this.copy(c(this.items, s, i + 1));
-    }), r(this, "reorder", (t, e) => this.copy(c(this.items, [t], e))), r(this, "compareValue", (t, e) => {
-      const i = this.indexOf(t), s = this.indexOf(e);
-      return i < s ? -1 : i > s ? 1 : 0;
-    }), r(this, "range", (t, e) => {
-      let i = [], s = t;
-      for (; s != null; ) {
-        if (this.find(s) && i.push(s), s === e) return i;
-        s = this.getNextValue(s);
-      }
-      return [];
-    }), r(this, "getValueRange", (t, e) => t && e ? this.compareValue(t, e) <= 0 ? this.range(t, e) : this.range(e, t) : []), r(this, "toString", () => {
-      let t = "";
-      for (const e of this.items) {
-        const i = this.getItemValue(e), s = this.stringifyItem(e), n = this.getItemDisabled(e), h = [i, s, n].filter(Boolean).join(":");
-        t += h + ",";
-      }
-      return t;
-    }), r(this, "toJSON", () => ({
-      size: this.size,
-      first: this.firstValue,
-      last: this.lastValue
-    })), this.items = [...l.items];
-  }
-  /**
-   * Returns the number of items in the collection
-   */
-  get size() {
-    return this.items.length;
-  }
-  /**
-   * Returns the first value in the collection
-   */
-  get firstValue() {
-    let l = 0;
-    for (; this.getItemDisabled(this.at(l)); ) l++;
-    return this.getItemValue(this.at(l));
-  }
-  /**
-   * Returns the last value in the collection
-   */
-  get lastValue() {
-    let l = this.size - 1;
-    for (; this.getItemDisabled(this.at(l)); ) l--;
-    return this.getItemValue(this.at(l));
-  }
-  *[Symbol.iterator]() {
-    yield* this.items;
-  }
-}, v = (u, l) => !!u?.toLowerCase().startsWith(l.toLowerCase());
-function f(u, l, ...t) {
-  return [...u.slice(0, l), ...t, ...u.slice(l)];
-}
-function c(u, l, t) {
-  l = [...l].sort((i, s) => i - s);
-  const e = l.map((i) => u[i]);
-  for (let i = l.length - 1; i >= 0; i--)
-    u = [...u.slice(0, l[i]), ...u.slice(l[i] + 1)];
-  return t = Math.max(0, t - l.filter((i) => i < t).length), [...u.slice(0, t), ...e, ...u.slice(t)];
-}
-export {
-  B as ListCollection
-};
-//# sourceMappingURL=list-collection.js.map

package/dist/node_modules/.bun/@zag-js_collection@1.35.2/node_modules/@zag-js/collection/dist/list-collection.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"list-collection.js","sources":["../../../../../../../../../../node_modules/.bun/@zag-js+collection@1.35.2/node_modules/@zag-js/collection/dist/list-collection.mjs"],"sourcesContent":["import {\n __publicField\n} from \"./chunk-QZ7TP4HQ.mjs\";\n\n// src/list-collection.ts\nimport { hasProp, isEqual, isObject } from \"@zag-js/utils\";\nvar fallback = {\n itemToValue(item) {\n if (typeof item === \"string\") return item;\n if (isObject(item) && hasProp(item, \"value\")) return item.value;\n return \"\";\n },\n itemToString(item) {\n if (typeof item === \"string\") return item;\n if (isObject(item) && hasProp(item, \"label\")) return item.label;\n return fallback.itemToValue(item);\n },\n isItemDisabled(item) {\n if (isObject(item) && hasProp(item, \"disabled\")) return !!item.disabled;\n return false;\n }\n};\nvar ListCollection = class _ListCollection {\n constructor(options) {\n this.options = options;\n /**\n * The items in the collection\n */\n __publicField(this, \"items\");\n __publicField(this, \"indexMap\", null);\n /**\n * Copy the collection\n */\n __publicField(this, \"copy\", (items) => {\n return new _ListCollection({ ...this.options, items: items ?? [...this.items] });\n });\n /**\n * Check if the collection is equal to another collection\n */\n __publicField(this, \"isEqual\", (other) => {\n return isEqual(this.items, other.items);\n });\n /**\n * Function to update the collection items\n */\n __publicField(this, \"setItems\", (items) => {\n return this.copy(items);\n });\n /**\n * Returns all the values in the collection\n */\n __publicField(this, \"getValues\", (items = this.items) => {\n const values = [];\n for (const item of items) {\n const value = this.getItemValue(item);\n if (value != null) values.push(value);\n }\n return values;\n });\n /**\n * Get the item based on its value\n */\n __publicField(this, \"find\", (value) => {\n if (value == null) return null;\n const index = this.indexOf(value);\n return index !== -1 ? this.at(index) : null;\n });\n /**\n * Get the items based on its values\n */\n __publicField(this, \"findMany\", (values) => {\n const result = [];\n for (const value of values) {\n const item = this.find(value);\n if (item != null) result.push(item);\n }\n return result;\n });\n /**\n * Get the item based on its index\n */\n __publicField(this, \"at\", (index) => {\n if (!this.options.groupBy && !this.options.groupSort) {\n return this.items[index] ?? null;\n }\n let idx = 0;\n const groups = this.group();\n for (const [, items] of groups) {\n for (const item of items) {\n if (idx === index) return item;\n idx++;\n }\n }\n return null;\n });\n __publicField(this, \"sortFn\", (valueA, valueB) => {\n const indexA = this.indexOf(valueA);\n const indexB = this.indexOf(valueB);\n return (indexA ?? 0) - (indexB ?? 0);\n });\n /**\n * Sort the values based on their index\n */\n __publicField(this, \"sort\", (values) => {\n return [...values].sort(this.sortFn.bind(this));\n });\n /**\n * Convert an item to a value\n */\n __publicField(this, \"getItemValue\", (item) => {\n if (item == null) return null;\n return this.options.itemToValue?.(item) ?? fallback.itemToValue(item);\n });\n /**\n * Whether an item is disabled\n */\n __publicField(this, \"getItemDisabled\", (item) => {\n if (item == null) return false;\n return this.options.isItemDisabled?.(item) ?? fallback.isItemDisabled(item);\n });\n /**\n * Convert an item to a string\n */\n __publicField(this, \"stringifyItem\", (item) => {\n if (item == null) return null;\n return this.options.itemToString?.(item) ?? fallback.itemToString(item);\n });\n /**\n * Convert a value to a string\n */\n __publicField(this, \"stringify\", (value) => {\n if (value == null) return null;\n return this.stringifyItem(this.find(value));\n });\n /**\n * Convert an array of items to a string\n */\n __publicField(this, \"stringifyItems\", (items, separator = \", \") => {\n const strs = [];\n for (const item of items) {\n const str = this.stringifyItem(item);\n if (str != null) strs.push(str);\n }\n return strs.join(separator);\n });\n /**\n * Convert an array of items to a string\n */\n __publicField(this, \"stringifyMany\", (value, separator) => {\n return this.stringifyItems(this.findMany(value), separator);\n });\n /**\n * Whether the collection has a value\n */\n __publicField(this, \"has\", (value) => {\n return this.indexOf(value) !== -1;\n });\n /**\n * Whether the collection has an item\n */\n __publicField(this, \"hasItem\", (item) => {\n if (item == null) return false;\n return this.has(this.getItemValue(item));\n });\n /**\n * Group items by the groupBy function provided in options\n * Returns an array of [groupKey, items] tuples\n */\n __publicField(this, \"group\", () => {\n const { groupBy, groupSort } = this.options;\n if (!groupBy) return [[\"\", [...this.items]]];\n const groups = /* @__PURE__ */ new Map();\n this.items.forEach((item, index) => {\n const groupKey = groupBy(item, index);\n if (!groups.has(groupKey)) {\n groups.set(groupKey, []);\n }\n groups.get(groupKey).push(item);\n });\n let entries = Array.from(groups.entries());\n if (groupSort) {\n entries.sort(([a], [b]) => {\n if (typeof groupSort === \"function\") return groupSort(a, b);\n if (Array.isArray(groupSort)) {\n const indexA = groupSort.indexOf(a);\n const indexB = groupSort.indexOf(b);\n if (indexA === -1) return 1;\n if (indexB === -1) return -1;\n return indexA - indexB;\n }\n if (groupSort === \"asc\") return a.localeCompare(b);\n if (groupSort === \"desc\") return b.localeCompare(a);\n return 0;\n });\n }\n return entries;\n });\n /**\n * Returns the next value in the collection\n */\n __publicField(this, \"getNextValue\", (value, step = 1, clamp = false) => {\n let index = this.indexOf(value);\n if (index === -1) return null;\n index = clamp ? Math.min(index + step, this.size - 1) : index + step;\n while (index <= this.size && this.getItemDisabled(this.at(index))) index++;\n return this.getItemValue(this.at(index));\n });\n /**\n * Returns the previous value in the collection\n */\n __publicField(this, \"getPreviousValue\", (value, step = 1, clamp = false) => {\n let index = this.indexOf(value);\n if (index === -1) return null;\n index = clamp ? Math.max(index - step, 0) : index - step;\n while (index >= 0 && this.getItemDisabled(this.at(index))) index--;\n return this.getItemValue(this.at(index));\n });\n /**\n * Get the index of an item based on its key\n */\n __publicField(this, \"indexOf\", (value) => {\n if (value == null) return -1;\n if (!this.options.groupBy && !this.options.groupSort) {\n return this.items.findIndex((item) => this.getItemValue(item) === value);\n }\n if (!this.indexMap) {\n this.indexMap = /* @__PURE__ */ new Map();\n let idx = 0;\n const groups = this.group();\n for (const [, items] of groups) {\n for (const item of items) {\n const itemValue = this.getItemValue(item);\n if (itemValue != null) {\n this.indexMap.set(itemValue, idx);\n }\n idx++;\n }\n }\n }\n return this.indexMap.get(value) ?? -1;\n });\n __publicField(this, \"getByText\", (text, current) => {\n const currentIndex = current != null ? this.indexOf(current) : -1;\n const isSingleKey = text.length === 1;\n for (let i = 0; i < this.items.length; i++) {\n const item = this.items[(currentIndex + i + 1) % this.items.length];\n if (isSingleKey && this.getItemValue(item) === current) continue;\n if (this.getItemDisabled(item)) continue;\n if (match(this.stringifyItem(item), text)) return item;\n }\n return void 0;\n });\n /**\n * Search for a value based on a query\n */\n __publicField(this, \"search\", (queryString, options) => {\n const { state, currentValue, timeout = 350 } = options;\n const search = state.keysSoFar + queryString;\n const isRepeated = search.length > 1 && Array.from(search).every((char) => char === search[0]);\n const query = isRepeated ? search[0] : search;\n const item = this.getByText(query, currentValue);\n const value = this.getItemValue(item);\n function cleanup() {\n clearTimeout(state.timer);\n state.timer = -1;\n }\n function update(value2) {\n state.keysSoFar = value2;\n cleanup();\n if (value2 !== \"\") {\n state.timer = +setTimeout(() => {\n update(\"\");\n cleanup();\n }, timeout);\n }\n }\n update(search);\n return value;\n });\n /**\n * Update an item in the collection\n */\n __publicField(this, \"update\", (value, item) => {\n let index = this.indexOf(value);\n if (index === -1) return this;\n return this.copy([...this.items.slice(0, index), item, ...this.items.slice(index + 1)]);\n });\n /**\n * Update an item in the collection if it exists, otherwise append it\n */\n __publicField(this, \"upsert\", (value, item, mode = \"append\") => {\n let index = this.indexOf(value);\n if (index === -1) {\n const fn = mode === \"append\" ? this.append : this.prepend;\n return fn(item);\n }\n return this.copy([...this.items.slice(0, index), item, ...this.items.slice(index + 1)]);\n });\n /**\n * Insert items at a specific index\n */\n __publicField(this, \"insert\", (index, ...items) => {\n return this.copy(insert(this.items, index, ...items));\n });\n /**\n * Insert items before a specific value\n */\n __publicField(this, \"insertBefore\", (value, ...items) => {\n let toIndex = this.indexOf(value);\n if (toIndex === -1) {\n if (this.items.length === 0) toIndex = 0;\n else return this;\n }\n return this.copy(insert(this.items, toIndex, ...items));\n });\n /**\n * Insert items after a specific value\n */\n __publicField(this, \"insertAfter\", (value, ...items) => {\n let toIndex = this.indexOf(value);\n if (toIndex === -1) {\n if (this.items.length === 0) toIndex = 0;\n else return this;\n }\n return this.copy(insert(this.items, toIndex + 1, ...items));\n });\n /**\n * Prepend items to the collection\n */\n __publicField(this, \"prepend\", (...items) => {\n return this.copy(insert(this.items, 0, ...items));\n });\n /**\n * Append items to the collection\n */\n __publicField(this, \"append\", (...items) => {\n return this.copy(insert(this.items, this.items.length, ...items));\n });\n /**\n * Filter the collection\n */\n __publicField(this, \"filter\", (fn) => {\n const filteredItems = this.items.filter((item, index) => fn(this.stringifyItem(item), index, item));\n return this.copy(filteredItems);\n });\n /**\n * Remove items from the collection\n */\n __publicField(this, \"remove\", (...itemsOrValues) => {\n const values = itemsOrValues.map(\n (itemOrValue) => typeof itemOrValue === \"string\" ? itemOrValue : this.getItemValue(itemOrValue)\n );\n return this.copy(\n this.items.filter((item) => {\n const value = this.getItemValue(item);\n if (value == null) return false;\n return !values.includes(value);\n })\n );\n });\n /**\n * Move an item to a specific index\n */\n __publicField(this, \"move\", (value, toIndex) => {\n const fromIndex = this.indexOf(value);\n if (fromIndex === -1) return this;\n return this.copy(move(this.items, [fromIndex], toIndex));\n });\n /**\n * Move items before a specific value\n */\n __publicField(this, \"moveBefore\", (value, ...values) => {\n let toIndex = this.items.findIndex((item) => this.getItemValue(item) === value);\n if (toIndex === -1) return this;\n let indices = values.map((value2) => this.items.findIndex((item) => this.getItemValue(item) === value2)).sort((a, b) => a - b);\n return this.copy(move(this.items, indices, toIndex));\n });\n /**\n * Move items after a specific value\n */\n __publicField(this, \"moveAfter\", (value, ...values) => {\n let toIndex = this.items.findIndex((item) => this.getItemValue(item) === value);\n if (toIndex === -1) return this;\n let indices = values.map((value2) => this.items.findIndex((item) => this.getItemValue(item) === value2)).sort((a, b) => a - b);\n return this.copy(move(this.items, indices, toIndex + 1));\n });\n /**\n * Reorder items\n */\n __publicField(this, \"reorder\", (fromIndex, toIndex) => {\n return this.copy(move(this.items, [fromIndex], toIndex));\n });\n /**\n * Compare two values\n */\n __publicField(this, \"compareValue\", (a, b) => {\n const indexA = this.indexOf(a);\n const indexB = this.indexOf(b);\n if (indexA < indexB) return -1;\n if (indexA > indexB) return 1;\n return 0;\n });\n /**\n * Get the range of values between two values\n */\n __publicField(this, \"range\", (from, to) => {\n let keys = [];\n let key = from;\n while (key != null) {\n let item = this.find(key);\n if (item) keys.push(key);\n if (key === to) return keys;\n key = this.getNextValue(key);\n }\n return [];\n });\n /**\n * Get the range of values between two values\n */\n __publicField(this, \"getValueRange\", (from, to) => {\n if (from && to) {\n if (this.compareValue(from, to) <= 0) {\n return this.range(from, to);\n }\n return this.range(to, from);\n }\n return [];\n });\n /**\n * Convert the collection to a string\n */\n __publicField(this, \"toString\", () => {\n let result = \"\";\n for (const item of this.items) {\n const value = this.getItemValue(item);\n const label = this.stringifyItem(item);\n const disabled = this.getItemDisabled(item);\n const itemString = [value, label, disabled].filter(Boolean).join(\":\");\n result += itemString + \",\";\n }\n return result;\n });\n /**\n * Convert the collection to a JSON object\n */\n __publicField(this, \"toJSON\", () => {\n return {\n size: this.size,\n first: this.firstValue,\n last: this.lastValue\n };\n });\n this.items = [...options.items];\n }\n /**\n * Returns the number of items in the collection\n */\n get size() {\n return this.items.length;\n }\n /**\n * Returns the first value in the collection\n */\n get firstValue() {\n let index = 0;\n while (this.getItemDisabled(this.at(index))) index++;\n return this.getItemValue(this.at(index));\n }\n /**\n * Returns the last value in the collection\n */\n get lastValue() {\n let index = this.size - 1;\n while (this.getItemDisabled(this.at(index))) index--;\n return this.getItemValue(this.at(index));\n }\n *[Symbol.iterator]() {\n yield* this.items;\n }\n};\nvar match = (label, query) => {\n return !!label?.toLowerCase().startsWith(query.toLowerCase());\n};\nfunction isListCollection(v) {\n return v instanceof ListCollection;\n}\nfunction insert(items, index, ...values) {\n return [...items.slice(0, index), ...values, ...items.slice(index)];\n}\nfunction move(items, indices, toIndex) {\n indices = [...indices].sort((a, b) => a - b);\n const itemsToMove = indices.map((i) => items[i]);\n for (let i = indices.length - 1; i >= 0; i--) {\n items = [...items.slice(0, indices[i]), ...items.slice(indices[i] + 1)];\n }\n toIndex = Math.max(0, toIndex - indices.filter((i) => i < toIndex).length);\n return [...items.slice(0, toIndex), ...itemsToMove, ...items.slice(toIndex)];\n}\nexport {\n ListCollection,\n isListCollection\n};\n"],"names":["fallback","item","isObject","hasProp","ListCollection","_ListCollection","options","__publicField","items","other","isEqual","values","value","index","result","idx","groups","valueA","valueB","indexA","indexB","separator","strs","str","groupBy","groupSort","groupKey","entries","a","b","step","clamp","itemValue","text","current","currentIndex","isSingleKey","i","match","queryString","state","currentValue","timeout","search","query","char","cleanup","update","value2","mode","insert","toIndex","fn","filteredItems","itemsOrValues","itemOrValue","fromIndex","move","indices","from","to","keys","key","label","disabled","itemString","itemsToMove"],"mappings":";;;AAMA,IAAIA,IAAW;AAAA,EACb,YAAYC,GAAM;AAChB,WAAI,OAAOA,KAAS,WAAiBA,IACjCC,EAASD,CAAI,KAAKE,EAAQF,GAAM,OAAO,IAAUA,EAAK,QACnD;AAAA,EACT;AAAA,EACA,aAAaA,GAAM;AACjB,WAAI,OAAOA,KAAS,WAAiBA,IACjCC,EAASD,CAAI,KAAKE,EAAQF,GAAM,OAAO,IAAUA,EAAK,QACnDD,EAAS,YAAYC,CAAI;AAAA,EAClC;AAAA,EACA,eAAeA,GAAM;AACnB,WAAIC,EAASD,CAAI,KAAKE,EAAQF,GAAM,UAAU,IAAU,CAAC,CAACA,EAAK,WACxD;AAAA,EACT;AACF,GACIG,IAAiB,MAAMC,EAAgB;AAAA,EACzC,YAAYC,GAAS;AACnB,SAAK,UAAUA,GAIfC,EAAc,MAAM,OAAO,GAC3BA,EAAc,MAAM,YAAY,IAAI,GAIpCA,EAAc,MAAM,QAAQ,CAACC,MACpB,IAAIH,EAAgB,EAAE,GAAG,KAAK,SAAS,OAAOG,KAAS,CAAC,GAAG,KAAK,KAAK,EAAC,CAAE,CAChF,GAIDD,EAAc,MAAM,WAAW,CAACE,MACvBC,EAAQ,KAAK,OAAOD,EAAM,KAAK,CACvC,GAIDF,EAAc,MAAM,YAAY,CAACC,MACxB,KAAK,KAAKA,CAAK,CACvB,GAIDD,EAAc,MAAM,aAAa,CAACC,IAAQ,KAAK,UAAU;AACvD,YAAMG,IAAS,CAAA;AACf,iBAAWV,KAAQO,GAAO;AACxB,cAAMI,IAAQ,KAAK,aAAaX,CAAI;AACpC,QAAIW,KAAS,QAAMD,EAAO,KAAKC,CAAK;AAAA,MACtC;AACA,aAAOD;AAAA,IACT,CAAC,GAIDJ,EAAc,MAAM,QAAQ,CAACK,MAAU;AACrC,UAAIA,KAAS,KAAM,QAAO;AAC1B,YAAMC,IAAQ,KAAK,QAAQD,CAAK;AAChC,aAAOC,MAAU,KAAK,KAAK,GAAGA,CAAK,IAAI;AAAA,IACzC,CAAC,GAIDN,EAAc,MAAM,YAAY,CAACI,MAAW;AAC1C,YAAMG,IAAS,CAAA;AACf,iBAAWF,KAASD,GAAQ;AAC1B,cAAMV,IAAO,KAAK,KAAKW,CAAK;AAC5B,QAAIX,KAAQ,QAAMa,EAAO,KAAKb,CAAI;AAAA,MACpC;AACA,aAAOa;AAAA,IACT,CAAC,GAIDP,EAAc,MAAM,MAAM,CAACM,MAAU;AACnC,UAAI,CAAC,KAAK,QAAQ,WAAW,CAAC,KAAK,QAAQ;AACzC,eAAO,KAAK,MAAMA,CAAK,KAAK;AAE9B,UAAIE,IAAM;AACV,YAAMC,IAAS,KAAK,MAAK;AACzB,iBAAW,CAAA,EAAGR,CAAK,KAAKQ;AACtB,mBAAWf,KAAQO,GAAO;AACxB,cAAIO,MAAQF,EAAO,QAAOZ;AAC1B,UAAAc;AAAA,QACF;AAEF,aAAO;AAAA,IACT,CAAC,GACDR,EAAc,MAAM,UAAU,CAACU,GAAQC,MAAW;AAChD,YAAMC,IAAS,KAAK,QAAQF,CAAM,GAC5BG,IAAS,KAAK,QAAQF,CAAM;AAClC,cAAQC,KAAU,MAAMC,KAAU;AAAA,IACpC,CAAC,GAIDb,EAAc,MAAM,QAAQ,CAACI,MACpB,CAAC,GAAGA,CAAM,EAAE,KAAK,KAAK,OAAO,KAAK,IAAI,CAAC,CAC/C,GAIDJ,EAAc,MAAM,gBAAgB,CAACN,MAC/BA,KAAQ,OAAa,OAClB,KAAK,QAAQ,cAAcA,CAAI,KAAKD,EAAS,YAAYC,CAAI,CACrE,GAIDM,EAAc,MAAM,mBAAmB,CAACN,MAClCA,KAAQ,OAAa,KAClB,KAAK,QAAQ,iBAAiBA,CAAI,KAAKD,EAAS,eAAeC,CAAI,CAC3E,GAIDM,EAAc,MAAM,iBAAiB,CAACN,MAChCA,KAAQ,OAAa,OAClB,KAAK,QAAQ,eAAeA,CAAI,KAAKD,EAAS,aAAaC,CAAI,CACvE,GAIDM,EAAc,MAAM,aAAa,CAACK,MAC5BA,KAAS,OAAa,OACnB,KAAK,cAAc,KAAK,KAAKA,CAAK,CAAC,CAC3C,GAIDL,EAAc,MAAM,kBAAkB,CAACC,GAAOa,IAAY,SAAS;AACjE,YAAMC,IAAO,CAAA;AACb,iBAAWrB,KAAQO,GAAO;AACxB,cAAMe,IAAM,KAAK,cAActB,CAAI;AACnC,QAAIsB,KAAO,QAAMD,EAAK,KAAKC,CAAG;AAAA,MAChC;AACA,aAAOD,EAAK,KAAKD,CAAS;AAAA,IAC5B,CAAC,GAIDd,EAAc,MAAM,iBAAiB,CAACK,GAAOS,MACpC,KAAK,eAAe,KAAK,SAAST,CAAK,GAAGS,CAAS,CAC3D,GAIDd,EAAc,MAAM,OAAO,CAACK,MACnB,KAAK,QAAQA,CAAK,MAAM,EAChC,GAIDL,EAAc,MAAM,WAAW,CAACN,MAC1BA,KAAQ,OAAa,KAClB,KAAK,IAAI,KAAK,aAAaA,CAAI,CAAC,CACxC,GAKDM,EAAc,MAAM,SAAS,MAAM;AACjC,YAAM,EAAE,SAAAiB,GAAS,WAAAC,EAAS,IAAK,KAAK;AACpC,UAAI,CAACD,EAAS,QAAO,CAAC,CAAC,IAAI,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC;AAC3C,YAAMR,IAAyB,oBAAI,IAAG;AACtC,WAAK,MAAM,QAAQ,CAACf,GAAMY,MAAU;AAClC,cAAMa,IAAWF,EAAQvB,GAAMY,CAAK;AACpC,QAAKG,EAAO,IAAIU,CAAQ,KACtBV,EAAO,IAAIU,GAAU,EAAE,GAEzBV,EAAO,IAAIU,CAAQ,EAAE,KAAKzB,CAAI;AAAA,MAChC,CAAC;AACD,UAAI0B,IAAU,MAAM,KAAKX,EAAO,QAAO,CAAE;AACzC,aAAIS,KACFE,EAAQ,KAAK,CAAC,CAACC,CAAC,GAAG,CAACC,CAAC,MAAM;AACzB,YAAI,OAAOJ,KAAc,WAAY,QAAOA,EAAUG,GAAGC,CAAC;AAC1D,YAAI,MAAM,QAAQJ,CAAS,GAAG;AAC5B,gBAAMN,IAASM,EAAU,QAAQG,CAAC,GAC5BR,IAASK,EAAU,QAAQI,CAAC;AAClC,iBAAIV,MAAW,KAAW,IACtBC,MAAW,KAAW,KACnBD,IAASC;AAAA,QAClB;AACA,eAAIK,MAAc,QAAcG,EAAE,cAAcC,CAAC,IAC7CJ,MAAc,SAAeI,EAAE,cAAcD,CAAC,IAC3C;AAAA,MACT,CAAC,GAEID;AAAA,IACT,CAAC,GAIDpB,EAAc,MAAM,gBAAgB,CAACK,GAAOkB,IAAO,GAAGC,IAAQ,OAAU;AACtE,UAAIlB,IAAQ,KAAK,QAAQD,CAAK;AAC9B,UAAIC,MAAU,GAAI,QAAO;AAEzB,WADAA,IAAQkB,IAAQ,KAAK,IAAIlB,IAAQiB,GAAM,KAAK,OAAO,CAAC,IAAIjB,IAAQiB,GACzDjB,KAAS,KAAK,QAAQ,KAAK,gBAAgB,KAAK,GAAGA,CAAK,CAAC,IAAG,CAAAA;AACnE,aAAO,KAAK,aAAa,KAAK,GAAGA,CAAK,CAAC;AAAA,IACzC,CAAC,GAIDN,EAAc,MAAM,oBAAoB,CAACK,GAAOkB,IAAO,GAAGC,IAAQ,OAAU;AAC1E,UAAIlB,IAAQ,KAAK,QAAQD,CAAK;AAC9B,UAAIC,MAAU,GAAI,QAAO;AAEzB,WADAA,IAAQkB,IAAQ,KAAK,IAAIlB,IAAQiB,GAAM,CAAC,IAAIjB,IAAQiB,GAC7CjB,KAAS,KAAK,KAAK,gBAAgB,KAAK,GAAGA,CAAK,CAAC,IAAG,CAAAA;AAC3D,aAAO,KAAK,aAAa,KAAK,GAAGA,CAAK,CAAC;AAAA,IACzC,CAAC,GAIDN,EAAc,MAAM,WAAW,CAACK,MAAU;AACxC,UAAIA,KAAS,KAAM,QAAO;AAC1B,UAAI,CAAC,KAAK,QAAQ,WAAW,CAAC,KAAK,QAAQ;AACzC,eAAO,KAAK,MAAM,UAAU,CAACX,MAAS,KAAK,aAAaA,CAAI,MAAMW,CAAK;AAEzE,UAAI,CAAC,KAAK,UAAU;AAClB,aAAK,WAA2B,oBAAI,IAAG;AACvC,YAAIG,IAAM;AACV,cAAMC,IAAS,KAAK,MAAK;AACzB,mBAAW,CAAA,EAAGR,CAAK,KAAKQ;AACtB,qBAAWf,KAAQO,GAAO;AACxB,kBAAMwB,IAAY,KAAK,aAAa/B,CAAI;AACxC,YAAI+B,KAAa,QACf,KAAK,SAAS,IAAIA,GAAWjB,CAAG,GAElCA;AAAA,UACF;AAAA,MAEJ;AACA,aAAO,KAAK,SAAS,IAAIH,CAAK,KAAK;AAAA,IACrC,CAAC,GACDL,EAAc,MAAM,aAAa,CAAC0B,GAAMC,MAAY;AAClD,YAAMC,IAAeD,KAAW,OAAO,KAAK,QAAQA,CAAO,IAAI,IACzDE,IAAcH,EAAK,WAAW;AACpC,eAASI,IAAI,GAAGA,IAAI,KAAK,MAAM,QAAQA,KAAK;AAC1C,cAAMpC,IAAO,KAAK,OAAOkC,IAAeE,IAAI,KAAK,KAAK,MAAM,MAAM;AAClE,YAAI,EAAAD,KAAe,KAAK,aAAanC,CAAI,MAAMiC,MAC3C,MAAK,gBAAgBjC,CAAI,KACzBqC,EAAM,KAAK,cAAcrC,CAAI,GAAGgC,CAAI;AAAG,iBAAOhC;AAAA,MACpD;AAAA,IAEF,CAAC,GAIDM,EAAc,MAAM,UAAU,CAACgC,GAAajC,MAAY;AACtD,YAAM,EAAE,OAAAkC,GAAO,cAAAC,GAAc,SAAAC,IAAU,IAAG,IAAKpC,GACzCqC,IAASH,EAAM,YAAYD,GAE3BK,IADaD,EAAO,SAAS,KAAK,MAAM,KAAKA,CAAM,EAAE,MAAM,CAACE,MAASA,MAASF,EAAO,CAAC,CAAC,IAClEA,EAAO,CAAC,IAAIA,GACjC1C,IAAO,KAAK,UAAU2C,GAAOH,CAAY,GACzC7B,IAAQ,KAAK,aAAaX,CAAI;AACpC,eAAS6C,IAAU;AACjB,qBAAaN,EAAM,KAAK,GACxBA,EAAM,QAAQ;AAAA,MAChB;AACA,eAASO,EAAOC,GAAQ;AACtB,QAAAR,EAAM,YAAYQ,GAClBF,EAAO,GACHE,MAAW,OACbR,EAAM,QAAQ,CAAC,WAAW,MAAM;AAC9B,UAAAO,EAAO,EAAE,GACTD,EAAO;AAAA,QACT,GAAGJ,CAAO;AAAA,MAEd;AACA,aAAAK,EAAOJ,CAAM,GACN/B;AAAA,IACT,CAAC,GAIDL,EAAc,MAAM,UAAU,CAACK,GAAOX,MAAS;AAC7C,UAAIY,IAAQ,KAAK,QAAQD,CAAK;AAC9B,aAAIC,MAAU,KAAW,OAClB,KAAK,KAAK,CAAC,GAAG,KAAK,MAAM,MAAM,GAAGA,CAAK,GAAGZ,GAAM,GAAG,KAAK,MAAM,MAAMY,IAAQ,CAAC,CAAC,CAAC;AAAA,IACxF,CAAC,GAIDN,EAAc,MAAM,UAAU,CAACK,GAAOX,GAAMgD,IAAO,aAAa;AAC9D,UAAIpC,IAAQ,KAAK,QAAQD,CAAK;AAC9B,aAAIC,MAAU,MACDoC,MAAS,WAAW,KAAK,SAAS,KAAK,SACxChD,CAAI,IAET,KAAK,KAAK,CAAC,GAAG,KAAK,MAAM,MAAM,GAAGY,CAAK,GAAGZ,GAAM,GAAG,KAAK,MAAM,MAAMY,IAAQ,CAAC,CAAC,CAAC;AAAA,IACxF,CAAC,GAIDN,EAAc,MAAM,UAAU,CAACM,MAAUL,MAChC,KAAK,KAAK0C,EAAO,KAAK,OAAOrC,GAAO,GAAGL,CAAK,CAAC,CACrD,GAIDD,EAAc,MAAM,gBAAgB,CAACK,MAAUJ,MAAU;AACvD,UAAI2C,IAAU,KAAK,QAAQvC,CAAK;AAChC,UAAIuC,MAAY;AACd,YAAI,KAAK,MAAM,WAAW,EAAG,CAAAA,IAAU;AAAA,YAClC,QAAO;AAEd,aAAO,KAAK,KAAKD,EAAO,KAAK,OAAOC,GAAS,GAAG3C,CAAK,CAAC;AAAA,IACxD,CAAC,GAIDD,EAAc,MAAM,eAAe,CAACK,MAAUJ,MAAU;AACtD,UAAI2C,IAAU,KAAK,QAAQvC,CAAK;AAChC,UAAIuC,MAAY;AACd,YAAI,KAAK,MAAM,WAAW,EAAG,CAAAA,IAAU;AAAA,YAClC,QAAO;AAEd,aAAO,KAAK,KAAKD,EAAO,KAAK,OAAOC,IAAU,GAAG,GAAG3C,CAAK,CAAC;AAAA,IAC5D,CAAC,GAIDD,EAAc,MAAM,WAAW,IAAIC,MAC1B,KAAK,KAAK0C,EAAO,KAAK,OAAO,GAAG,GAAG1C,CAAK,CAAC,CACjD,GAIDD,EAAc,MAAM,UAAU,IAAIC,MACzB,KAAK,KAAK0C,EAAO,KAAK,OAAO,KAAK,MAAM,QAAQ,GAAG1C,CAAK,CAAC,CACjE,GAIDD,EAAc,MAAM,UAAU,CAAC6C,MAAO;AACpC,YAAMC,IAAgB,KAAK,MAAM,OAAO,CAACpD,GAAMY,MAAUuC,EAAG,KAAK,cAAcnD,CAAI,GAAGY,GAAOZ,CAAI,CAAC;AAClG,aAAO,KAAK,KAAKoD,CAAa;AAAA,IAChC,CAAC,GAID9C,EAAc,MAAM,UAAU,IAAI+C,MAAkB;AAClD,YAAM3C,IAAS2C,EAAc;AAAA,QAC3B,CAACC,MAAgB,OAAOA,KAAgB,WAAWA,IAAc,KAAK,aAAaA,CAAW;AAAA,MACtG;AACM,aAAO,KAAK;AAAA,QACV,KAAK,MAAM,OAAO,CAACtD,MAAS;AAC1B,gBAAMW,IAAQ,KAAK,aAAaX,CAAI;AACpC,iBAAIW,KAAS,OAAa,KACnB,CAACD,EAAO,SAASC,CAAK;AAAA,QAC/B,CAAC;AAAA,MACT;AAAA,IACI,CAAC,GAIDL,EAAc,MAAM,QAAQ,CAACK,GAAOuC,MAAY;AAC9C,YAAMK,IAAY,KAAK,QAAQ5C,CAAK;AACpC,aAAI4C,MAAc,KAAW,OACtB,KAAK,KAAKC,EAAK,KAAK,OAAO,CAACD,CAAS,GAAGL,CAAO,CAAC;AAAA,IACzD,CAAC,GAID5C,EAAc,MAAM,cAAc,CAACK,MAAUD,MAAW;AACtD,UAAIwC,IAAU,KAAK,MAAM,UAAU,CAAClD,MAAS,KAAK,aAAaA,CAAI,MAAMW,CAAK;AAC9E,UAAIuC,MAAY,GAAI,QAAO;AAC3B,UAAIO,IAAU/C,EAAO,IAAI,CAACqC,MAAW,KAAK,MAAM,UAAU,CAAC/C,MAAS,KAAK,aAAaA,CAAI,MAAM+C,CAAM,CAAC,EAAE,KAAK,CAACpB,GAAGC,MAAMD,IAAIC,CAAC;AAC7H,aAAO,KAAK,KAAK4B,EAAK,KAAK,OAAOC,GAASP,CAAO,CAAC;AAAA,IACrD,CAAC,GAID5C,EAAc,MAAM,aAAa,CAACK,MAAUD,MAAW;AACrD,UAAIwC,IAAU,KAAK,MAAM,UAAU,CAAClD,MAAS,KAAK,aAAaA,CAAI,MAAMW,CAAK;AAC9E,UAAIuC,MAAY,GAAI,QAAO;AAC3B,UAAIO,IAAU/C,EAAO,IAAI,CAACqC,MAAW,KAAK,MAAM,UAAU,CAAC/C,MAAS,KAAK,aAAaA,CAAI,MAAM+C,CAAM,CAAC,EAAE,KAAK,CAACpB,GAAGC,MAAMD,IAAIC,CAAC;AAC7H,aAAO,KAAK,KAAK4B,EAAK,KAAK,OAAOC,GAASP,IAAU,CAAC,CAAC;AAAA,IACzD,CAAC,GAID5C,EAAc,MAAM,WAAW,CAACiD,GAAWL,MAClC,KAAK,KAAKM,EAAK,KAAK,OAAO,CAACD,CAAS,GAAGL,CAAO,CAAC,CACxD,GAID5C,EAAc,MAAM,gBAAgB,CAACqB,GAAGC,MAAM;AAC5C,YAAMV,IAAS,KAAK,QAAQS,CAAC,GACvBR,IAAS,KAAK,QAAQS,CAAC;AAC7B,aAAIV,IAASC,IAAe,KACxBD,IAASC,IAAe,IACrB;AAAA,IACT,CAAC,GAIDb,EAAc,MAAM,SAAS,CAACoD,GAAMC,MAAO;AACzC,UAAIC,IAAO,CAAA,GACPC,IAAMH;AACV,aAAOG,KAAO,QAAM;AAGlB,YAFW,KAAK,KAAKA,CAAG,KACdD,EAAK,KAAKC,CAAG,GACnBA,MAAQF,EAAI,QAAOC;AACvB,QAAAC,IAAM,KAAK,aAAaA,CAAG;AAAA,MAC7B;AACA,aAAO,CAAA;AAAA,IACT,CAAC,GAIDvD,EAAc,MAAM,iBAAiB,CAACoD,GAAMC,MACtCD,KAAQC,IACN,KAAK,aAAaD,GAAMC,CAAE,KAAK,IAC1B,KAAK,MAAMD,GAAMC,CAAE,IAErB,KAAK,MAAMA,GAAID,CAAI,IAErB,CAAA,CACR,GAIDpD,EAAc,MAAM,YAAY,MAAM;AACpC,UAAIO,IAAS;AACb,iBAAWb,KAAQ,KAAK,OAAO;AAC7B,cAAMW,IAAQ,KAAK,aAAaX,CAAI,GAC9B8D,IAAQ,KAAK,cAAc9D,CAAI,GAC/B+D,IAAW,KAAK,gBAAgB/D,CAAI,GACpCgE,IAAa,CAACrD,GAAOmD,GAAOC,CAAQ,EAAE,OAAO,OAAO,EAAE,KAAK,GAAG;AACpE,QAAAlD,KAAUmD,IAAa;AAAA,MACzB;AACA,aAAOnD;AAAA,IACT,CAAC,GAIDP,EAAc,MAAM,UAAU,OACrB;AAAA,MACL,MAAM,KAAK;AAAA,MACX,OAAO,KAAK;AAAA,MACZ,MAAM,KAAK;AAAA,IACnB,EACK,GACD,KAAK,QAAQ,CAAC,GAAGD,EAAQ,KAAK;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA,EAIA,IAAI,OAAO;AACT,WAAO,KAAK,MAAM;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA,EAIA,IAAI,aAAa;AACf,QAAIO,IAAQ;AACZ,WAAO,KAAK,gBAAgB,KAAK,GAAGA,CAAK,CAAC,IAAG,CAAAA;AAC7C,WAAO,KAAK,aAAa,KAAK,GAAGA,CAAK,CAAC;AAAA,EACzC;AAAA;AAAA;AAAA;AAAA,EAIA,IAAI,YAAY;AACd,QAAIA,IAAQ,KAAK,OAAO;AACxB,WAAO,KAAK,gBAAgB,KAAK,GAAGA,CAAK,CAAC,IAAG,CAAAA;AAC7C,WAAO,KAAK,aAAa,KAAK,GAAGA,CAAK,CAAC;AAAA,EACzC;AAAA,EACA,EAAE,OAAO,QAAQ,IAAI;AACnB,WAAO,KAAK;AAAA,EACd;AACF,GACIyB,IAAQ,CAACyB,GAAOnB,MACX,CAAC,CAACmB,GAAO,YAAW,EAAG,WAAWnB,EAAM,aAAa;AAK9D,SAASM,EAAO1C,GAAOK,MAAUF,GAAQ;AACvC,SAAO,CAAC,GAAGH,EAAM,MAAM,GAAGK,CAAK,GAAG,GAAGF,GAAQ,GAAGH,EAAM,MAAMK,CAAK,CAAC;AACpE;AACA,SAAS4C,EAAKjD,GAAOkD,GAASP,GAAS;AACrC,EAAAO,IAAU,CAAC,GAAGA,CAAO,EAAE,KAAK,CAAC9B,GAAGC,MAAMD,IAAIC,CAAC;AAC3C,QAAMqC,IAAcR,EAAQ,IAAI,CAAC,MAAMlD,EAAM,CAAC,CAAC;AAC/C,WAAS,IAAIkD,EAAQ,SAAS,GAAG,KAAK,GAAG;AACvC,IAAAlD,IAAQ,CAAC,GAAGA,EAAM,MAAM,GAAGkD,EAAQ,CAAC,CAAC,GAAG,GAAGlD,EAAM,MAAMkD,EAAQ,CAAC,IAAI,CAAC,CAAC;AAExE,SAAAP,IAAU,KAAK,IAAI,GAAGA,IAAUO,EAAQ,OAAO,CAAC,MAAM,IAAIP,CAAO,EAAE,MAAM,GAClE,CAAC,GAAG3C,EAAM,MAAM,GAAG2C,CAAO,GAAG,GAAGe,GAAa,GAAG1D,EAAM,MAAM2C,CAAO,CAAC;AAC7E;","x_google_ignoreList":[0]}

package/dist/node_modules/.bun/@zag-js_collection@1.35.2/node_modules/@zag-js/collection/dist/tree-collection.js DELETED Viewed

@@ -1,238 +0,0 @@
-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.2/node_modules/@zag-js/utils/dist/equal.js";
-import { isObject as N, hasProp as a } from "../../../../../@zag-js_utils@1.35.2/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
-      });
-  }
-};
-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 });
-}
-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;
-  }
-};
-export {
-  S as TreeCollection,
-  R as filePathToTree
-};
-//# sourceMappingURL=tree-collection.js.map

package/dist/node_modules/.bun/@zag-js_collection@1.35.2/node_modules/@zag-js/collection/dist/tree-collection.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"tree-collection.js","sources":["../../../../../../../../../../node_modules/.bun/@zag-js+collection@1.35.2/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]}