@anoki/fse-ui 2.3.0-12-SNAPSHOT2 → 2.3.0-12-SNAPSHOT4

package/dist/index.es660.js

@@ -1,49 +1,224 @@
-import r from "react";
-import { createContextScope as y } from "./index.es478.js";
-import { useComposedRefs as S } from "./index.es477.js";
-import { createSlot as M } from "./index.es489.js";
-import { j as d } from "./index.es248.js";
-function D(s) {
-  const m = s + "CollectionProvider", [A, E] = y(m), [N, f] = A(
-    m,
-    { collectionRef: { current: null }, itemMap: /* @__PURE__ */ new Map() }
-  ), p = (c) => {
-    const { scope: e, children: l } = c, o = r.useRef(null), t = r.useRef(/* @__PURE__ */ new Map()).current;
-    return /* @__PURE__ */ d.jsx(N, { scope: e, itemMap: t, collectionRef: o, children: l });
-  };
-  p.displayName = m;
-  const a = s + "CollectionSlot", _ = M(a), C = r.forwardRef(
-    (c, e) => {
-      const { scope: l, children: o } = c, t = f(a, l), n = S(e, t.collectionRef);
-      return /* @__PURE__ */ d.jsx(_, { ref: n, children: o });
-    }
-  );
-  C.displayName = a;
-  const u = s + "CollectionItemSlot", R = "data-radix-collection-item", T = M(u), x = r.forwardRef(
-    (c, e) => {
-      const { scope: l, children: o, ...t } = c, n = r.useRef(null), I = S(e, n), i = f(u, l);
-      return r.useEffect(() => (i.itemMap.set(n, { ref: n, ...t }), () => void i.itemMap.delete(n))), /* @__PURE__ */ d.jsx(T, { [R]: "", ref: I, children: o });
-    }
-  );
-  x.displayName = u;
-  function O(c) {
-    const e = f(s + "CollectionConsumer", c);
-    return r.useCallback(() => {
-      const o = e.collectionRef.current;
-      if (!o) return [];
-      const t = Array.from(o.querySelectorAll(`[${R}]`));
-      return Array.from(e.itemMap.values()).sort(
-        (i, v) => t.indexOf(i.ref.current) - t.indexOf(v.ref.current)
-      );
-    }, [e.collectionRef, e.itemMap]);
+import { __require as k } from "./index.es659.js";
+import { __require as D } from "./index.es662.js";
+import { __require as P } from "./index.es668.js";
+import { __require as q } from "./index.es722.js";
+var y, v;
+function j() {
+  if (v) return y;
+  v = 1;
+  let h = k(), p = D(), R = P(), { isClean: x, my: m } = q(), a, d, w, l;
+  function O(s) {
+    return s.map((e) => (e.nodes && (e.nodes = O(e.nodes)), delete e.source, e));
   }
-  return [
-    { Provider: p, Slot: C, ItemSlot: x },
-    O,
-    E
-  ];
+  function g(s) {
+    if (s[x] = !1, s.proxyOf.nodes)
+      for (let e of s.proxyOf.nodes)
+        g(e);
+  }
+  class f extends R {
+    get first() {
+      if (this.proxyOf.nodes)
+        return this.proxyOf.nodes[0];
+    }
+    get last() {
+      if (this.proxyOf.nodes)
+        return this.proxyOf.nodes[this.proxyOf.nodes.length - 1];
+    }
+    append(...e) {
+      for (let t of e) {
+        let r = this.normalize(t, this.last);
+        for (let i of r) this.proxyOf.nodes.push(i);
+      }
+      return this.markDirty(), this;
+    }
+    cleanRaws(e) {
+      if (super.cleanRaws(e), this.nodes)
+        for (let t of this.nodes) t.cleanRaws(e);
+    }
+    each(e) {
+      if (!this.proxyOf.nodes) return;
+      let t = this.getIterator(), r, i;
+      for (; this.indexes[t] < this.proxyOf.nodes.length && (r = this.indexes[t], i = e(this.proxyOf.nodes[r], r), i !== !1); )
+        this.indexes[t] += 1;
+      return delete this.indexes[t], i;
+    }
+    every(e) {
+      return this.nodes.every(e);
+    }
+    getIterator() {
+      this.lastEach || (this.lastEach = 0), this.indexes || (this.indexes = {}), this.lastEach += 1;
+      let e = this.lastEach;
+      return this.indexes[e] = 0, e;
+    }
+    getProxyProcessor() {
+      return {
+        get(e, t) {
+          return t === "proxyOf" ? e : e[t] ? t === "each" || typeof t == "string" && t.startsWith("walk") ? (...r) => e[t](
+            ...r.map((i) => typeof i == "function" ? (n, o) => i(n.toProxy(), o) : i)
+          ) : t === "every" || t === "some" ? (r) => e[t](
+            (i, ...n) => r(i.toProxy(), ...n)
+          ) : t === "root" ? () => e.root().toProxy() : t === "nodes" ? e.nodes.map((r) => r.toProxy()) : t === "first" || t === "last" ? e[t].toProxy() : e[t] : e[t];
+        },
+        set(e, t, r) {
+          return e[t] === r || (e[t] = r, (t === "name" || t === "params" || t === "selector") && e.markDirty()), !0;
+        }
+      };
+    }
+    index(e) {
+      return typeof e == "number" ? e : (e.proxyOf && (e = e.proxyOf), this.proxyOf.nodes.indexOf(e));
+    }
+    insertAfter(e, t) {
+      let r = this.index(e), i = this.normalize(t, this.proxyOf.nodes[r]).reverse();
+      r = this.index(e);
+      for (let o of i) this.proxyOf.nodes.splice(r + 1, 0, o);
+      let n;
+      for (let o in this.indexes)
+        n = this.indexes[o], r < n && (this.indexes[o] = n + i.length);
+      return this.markDirty(), this;
+    }
+    insertBefore(e, t) {
+      let r = this.index(e), i = r === 0 ? "prepend" : !1, n = this.normalize(
+        t,
+        this.proxyOf.nodes[r],
+        i
+      ).reverse();
+      r = this.index(e);
+      for (let u of n) this.proxyOf.nodes.splice(r, 0, u);
+      let o;
+      for (let u in this.indexes)
+        o = this.indexes[u], r <= o && (this.indexes[u] = o + n.length);
+      return this.markDirty(), this;
+    }
+    normalize(e, t) {
+      if (typeof e == "string")
+        e = O(d(e).nodes);
+      else if (typeof e > "u")
+        e = [];
+      else if (Array.isArray(e)) {
+        e = e.slice(0);
+        for (let i of e)
+          i.parent && i.parent.removeChild(i, "ignore");
+      } else if (e.type === "root" && this.type !== "document") {
+        e = e.nodes.slice(0);
+        for (let i of e)
+          i.parent && i.parent.removeChild(i, "ignore");
+      } else if (e.type)
+        e = [e];
+      else if (e.prop) {
+        if (typeof e.value > "u")
+          throw new Error("Value field is missed in node creation");
+        typeof e.value != "string" && (e.value = String(e.value)), e = [new p(e)];
+      } else if (e.selector || e.selectors)
+        e = [new l(e)];
+      else if (e.name)
+        e = [new a(e)];
+      else if (e.text)
+        e = [new h(e)];
+      else
+        throw new Error("Unknown node type in node creation");
+      return e.map((i) => (i[m] || f.rebuild(i), i = i.proxyOf, i.parent && i.parent.removeChild(i), i[x] && g(i), i.raws || (i.raws = {}), typeof i.raws.before > "u" && t && typeof t.raws.before < "u" && (i.raws.before = t.raws.before.replace(/\S/g, "")), i.parent = this.proxyOf, i));
+    }
+    prepend(...e) {
+      e = e.reverse();
+      for (let t of e) {
+        let r = this.normalize(t, this.first, "prepend").reverse();
+        for (let i of r) this.proxyOf.nodes.unshift(i);
+        for (let i in this.indexes)
+          this.indexes[i] = this.indexes[i] + r.length;
+      }
+      return this.markDirty(), this;
+    }
+    push(e) {
+      return e.parent = this, this.proxyOf.nodes.push(e), this;
+    }
+    removeAll() {
+      for (let e of this.proxyOf.nodes) e.parent = void 0;
+      return this.proxyOf.nodes = [], this.markDirty(), this;
+    }
+    removeChild(e) {
+      e = this.index(e), this.proxyOf.nodes[e].parent = void 0, this.proxyOf.nodes.splice(e, 1);
+      let t;
+      for (let r in this.indexes)
+        t = this.indexes[r], t >= e && (this.indexes[r] = t - 1);
+      return this.markDirty(), this;
+    }
+    replaceValues(e, t, r) {
+      return r || (r = t, t = {}), this.walkDecls((i) => {
+        t.props && !t.props.includes(i.prop) || t.fast && !i.value.includes(t.fast) || (i.value = i.value.replace(e, r));
+      }), this.markDirty(), this;
+    }
+    some(e) {
+      return this.nodes.some(e);
+    }
+    walk(e) {
+      return this.each((t, r) => {
+        let i;
+        try {
+          i = e(t, r);
+        } catch (n) {
+          throw t.addToError(n);
+        }
+        return i !== !1 && t.walk && (i = t.walk(e)), i;
+      });
+    }
+    walkAtRules(e, t) {
+      return t ? e instanceof RegExp ? this.walk((r, i) => {
+        if (r.type === "atrule" && e.test(r.name))
+          return t(r, i);
+      }) : this.walk((r, i) => {
+        if (r.type === "atrule" && r.name === e)
+          return t(r, i);
+      }) : (t = e, this.walk((r, i) => {
+        if (r.type === "atrule")
+          return t(r, i);
+      }));
+    }
+    walkComments(e) {
+      return this.walk((t, r) => {
+        if (t.type === "comment")
+          return e(t, r);
+      });
+    }
+    walkDecls(e, t) {
+      return t ? e instanceof RegExp ? this.walk((r, i) => {
+        if (r.type === "decl" && e.test(r.prop))
+          return t(r, i);
+      }) : this.walk((r, i) => {
+        if (r.type === "decl" && r.prop === e)
+          return t(r, i);
+      }) : (t = e, this.walk((r, i) => {
+        if (r.type === "decl")
+          return t(r, i);
+      }));
+    }
+    walkRules(e, t) {
+      return t ? e instanceof RegExp ? this.walk((r, i) => {
+        if (r.type === "rule" && e.test(r.selector))
+          return t(r, i);
+      }) : this.walk((r, i) => {
+        if (r.type === "rule" && r.selector === e)
+          return t(r, i);
+      }) : (t = e, this.walk((r, i) => {
+        if (r.type === "rule")
+          return t(r, i);
+      }));
+    }
+  }
+  return f.registerParse = (s) => {
+    d = s;
+  }, f.registerRule = (s) => {
+    l = s;
+  }, f.registerAtRule = (s) => {
+    a = s;
+  }, f.registerRoot = (s) => {
+    w = s;
+  }, y = f, f.default = f, f.rebuild = (s) => {
+    s.type === "atrule" ? Object.setPrototypeOf(s, a.prototype) : s.type === "rule" ? Object.setPrototypeOf(s, l.prototype) : s.type === "decl" ? Object.setPrototypeOf(s, p.prototype) : s.type === "comment" ? Object.setPrototypeOf(s, h.prototype) : s.type === "root" && Object.setPrototypeOf(s, w.prototype), s[m] = !0, s.nodes && s.nodes.forEach((e) => {
+      f.rebuild(e);
+    });
+  }, y;
 }
 export {
-  D as createCollection
+  j as __require
 };
 //# sourceMappingURL=index.es660.js.map

package/dist/index.es660.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es660.js","sources":["../node_modules/@radix-ui/react-collection/dist/index.mjs"],"sourcesContent":["\"use client\";\n\n// src/collection-legacy.tsx\nimport React from \"react\";\nimport { createContextScope } from \"@radix-ui/react-context\";\nimport { useComposedRefs } from \"@radix-ui/react-compose-refs\";\nimport { createSlot } from \"@radix-ui/react-slot\";\nimport { jsx } from \"react/jsx-runtime\";\nfunction createCollection(name) {\n  const PROVIDER_NAME = name + \"CollectionProvider\";\n  const [createCollectionContext, createCollectionScope] = createContextScope(PROVIDER_NAME);\n  const [CollectionProviderImpl, useCollectionContext] = createCollectionContext(\n    PROVIDER_NAME,\n    { collectionRef: { current: null }, itemMap: /* @__PURE__ */ new Map() }\n  );\n  const CollectionProvider = (props) => {\n    const { scope, children } = props;\n    const ref = React.useRef(null);\n    const itemMap = React.useRef(/* @__PURE__ */ new Map()).current;\n    return /* @__PURE__ */ jsx(CollectionProviderImpl, { scope, itemMap, collectionRef: ref, children });\n  };\n  CollectionProvider.displayName = PROVIDER_NAME;\n  const COLLECTION_SLOT_NAME = name + \"CollectionSlot\";\n  const CollectionSlotImpl = createSlot(COLLECTION_SLOT_NAME);\n  const CollectionSlot = React.forwardRef(\n    (props, forwardedRef) => {\n      const { scope, children } = props;\n      const context = useCollectionContext(COLLECTION_SLOT_NAME, scope);\n      const composedRefs = useComposedRefs(forwardedRef, context.collectionRef);\n      return /* @__PURE__ */ jsx(CollectionSlotImpl, { ref: composedRefs, children });\n    }\n  );\n  CollectionSlot.displayName = COLLECTION_SLOT_NAME;\n  const ITEM_SLOT_NAME = name + \"CollectionItemSlot\";\n  const ITEM_DATA_ATTR = \"data-radix-collection-item\";\n  const CollectionItemSlotImpl = createSlot(ITEM_SLOT_NAME);\n  const CollectionItemSlot = React.forwardRef(\n    (props, forwardedRef) => {\n      const { scope, children, ...itemData } = props;\n      const ref = React.useRef(null);\n      const composedRefs = useComposedRefs(forwardedRef, ref);\n      const context = useCollectionContext(ITEM_SLOT_NAME, scope);\n      React.useEffect(() => {\n        context.itemMap.set(ref, { ref, ...itemData });\n        return () => void context.itemMap.delete(ref);\n      });\n      return /* @__PURE__ */ jsx(CollectionItemSlotImpl, { ...{ [ITEM_DATA_ATTR]: \"\" }, ref: composedRefs, children });\n    }\n  );\n  CollectionItemSlot.displayName = ITEM_SLOT_NAME;\n  function useCollection(scope) {\n    const context = useCollectionContext(name + \"CollectionConsumer\", scope);\n    const getItems = React.useCallback(() => {\n      const collectionNode = context.collectionRef.current;\n      if (!collectionNode) return [];\n      const orderedNodes = Array.from(collectionNode.querySelectorAll(`[${ITEM_DATA_ATTR}]`));\n      const items = Array.from(context.itemMap.values());\n      const orderedItems = items.sort(\n        (a, b) => orderedNodes.indexOf(a.ref.current) - orderedNodes.indexOf(b.ref.current)\n      );\n      return orderedItems;\n    }, [context.collectionRef, context.itemMap]);\n    return getItems;\n  }\n  return [\n    { Provider: CollectionProvider, Slot: CollectionSlot, ItemSlot: CollectionItemSlot },\n    useCollection,\n    createCollectionScope\n  ];\n}\n\n// src/collection.tsx\nimport React2 from \"react\";\nimport { createContextScope as createContextScope2 } from \"@radix-ui/react-context\";\nimport { useComposedRefs as useComposedRefs2 } from \"@radix-ui/react-compose-refs\";\nimport { createSlot as createSlot2 } from \"@radix-ui/react-slot\";\n\n// src/ordered-dictionary.ts\nvar __instanciated = /* @__PURE__ */ new WeakMap();\nvar OrderedDict = class _OrderedDict extends Map {\n  #keys;\n  constructor(entries) {\n    super(entries);\n    this.#keys = [...super.keys()];\n    __instanciated.set(this, true);\n  }\n  set(key, value) {\n    if (__instanciated.get(this)) {\n      if (this.has(key)) {\n        this.#keys[this.#keys.indexOf(key)] = key;\n      } else {\n        this.#keys.push(key);\n      }\n    }\n    super.set(key, value);\n    return this;\n  }\n  insert(index, key, value) {\n    const has = this.has(key);\n    const length = this.#keys.length;\n    const relativeIndex = toSafeInteger(index);\n    let actualIndex = relativeIndex >= 0 ? relativeIndex : length + relativeIndex;\n    const safeIndex = actualIndex < 0 || actualIndex >= length ? -1 : actualIndex;\n    if (safeIndex === this.size || has && safeIndex === this.size - 1 || safeIndex === -1) {\n      this.set(key, value);\n      return this;\n    }\n    const size = this.size + (has ? 0 : 1);\n    if (relativeIndex < 0) {\n      actualIndex++;\n    }\n    const keys = [...this.#keys];\n    let nextValue;\n    let shouldSkip = false;\n    for (let i = actualIndex; i < size; i++) {\n      if (actualIndex === i) {\n        let nextKey = keys[i];\n        if (keys[i] === key) {\n          nextKey = keys[i + 1];\n        }\n        if (has) {\n          this.delete(key);\n        }\n        nextValue = this.get(nextKey);\n        this.set(key, value);\n      } else {\n        if (!shouldSkip && keys[i - 1] === key) {\n          shouldSkip = true;\n        }\n        const currentKey = keys[shouldSkip ? i : i - 1];\n        const currentValue = nextValue;\n        nextValue = this.get(currentKey);\n        this.delete(currentKey);\n        this.set(currentKey, currentValue);\n      }\n    }\n    return this;\n  }\n  with(index, key, value) {\n    const copy = new _OrderedDict(this);\n    copy.insert(index, key, value);\n    return copy;\n  }\n  before(key) {\n    const index = this.#keys.indexOf(key) - 1;\n    if (index < 0) {\n      return void 0;\n    }\n    return this.entryAt(index);\n  }\n  /**\n   * Sets a new key-value pair at the position before the given key.\n   */\n  setBefore(key, newKey, value) {\n    const index = this.#keys.indexOf(key);\n    if (index === -1) {\n      return this;\n    }\n    return this.insert(index, newKey, value);\n  }\n  after(key) {\n    let index = this.#keys.indexOf(key);\n    index = index === -1 || index === this.size - 1 ? -1 : index + 1;\n    if (index === -1) {\n      return void 0;\n    }\n    return this.entryAt(index);\n  }\n  /**\n   * Sets a new key-value pair at the position after the given key.\n   */\n  setAfter(key, newKey, value) {\n    const index = this.#keys.indexOf(key);\n    if (index === -1) {\n      return this;\n    }\n    return this.insert(index + 1, newKey, value);\n  }\n  first() {\n    return this.entryAt(0);\n  }\n  last() {\n    return this.entryAt(-1);\n  }\n  clear() {\n    this.#keys = [];\n    return super.clear();\n  }\n  delete(key) {\n    const deleted = super.delete(key);\n    if (deleted) {\n      this.#keys.splice(this.#keys.indexOf(key), 1);\n    }\n    return deleted;\n  }\n  deleteAt(index) {\n    const key = this.keyAt(index);\n    if (key !== void 0) {\n      return this.delete(key);\n    }\n    return false;\n  }\n  at(index) {\n    const key = at(this.#keys, index);\n    if (key !== void 0) {\n      return this.get(key);\n    }\n  }\n  entryAt(index) {\n    const key = at(this.#keys, index);\n    if (key !== void 0) {\n      return [key, this.get(key)];\n    }\n  }\n  indexOf(key) {\n    return this.#keys.indexOf(key);\n  }\n  keyAt(index) {\n    return at(this.#keys, index);\n  }\n  from(key, offset) {\n    const index = this.indexOf(key);\n    if (index === -1) {\n      return void 0;\n    }\n    let dest = index + offset;\n    if (dest < 0) dest = 0;\n    if (dest >= this.size) dest = this.size - 1;\n    return this.at(dest);\n  }\n  keyFrom(key, offset) {\n    const index = this.indexOf(key);\n    if (index === -1) {\n      return void 0;\n    }\n    let dest = index + offset;\n    if (dest < 0) dest = 0;\n    if (dest >= this.size) dest = this.size - 1;\n    return this.keyAt(dest);\n  }\n  find(predicate, thisArg) {\n    let index = 0;\n    for (const entry of this) {\n      if (Reflect.apply(predicate, thisArg, [entry, index, this])) {\n        return entry;\n      }\n      index++;\n    }\n    return void 0;\n  }\n  findIndex(predicate, thisArg) {\n    let index = 0;\n    for (const entry of this) {\n      if (Reflect.apply(predicate, thisArg, [entry, index, this])) {\n        return index;\n      }\n      index++;\n    }\n    return -1;\n  }\n  filter(predicate, thisArg) {\n    const entries = [];\n    let index = 0;\n    for (const entry of this) {\n      if (Reflect.apply(predicate, thisArg, [entry, index, this])) {\n        entries.push(entry);\n      }\n      index++;\n    }\n    return new _OrderedDict(entries);\n  }\n  map(callbackfn, thisArg) {\n    const entries = [];\n    let index = 0;\n    for (const entry of this) {\n      entries.push([entry[0], Reflect.apply(callbackfn, thisArg, [entry, index, this])]);\n      index++;\n    }\n    return new _OrderedDict(entries);\n  }\n  reduce(...args) {\n    const [callbackfn, initialValue] = args;\n    let index = 0;\n    let accumulator = initialValue ?? this.at(0);\n    for (const entry of this) {\n      if (index === 0 && args.length === 1) {\n        accumulator = entry;\n      } else {\n        accumulator = Reflect.apply(callbackfn, this, [accumulator, entry, index, this]);\n      }\n      index++;\n    }\n    return accumulator;\n  }\n  reduceRight(...args) {\n    const [callbackfn, initialValue] = args;\n    let accumulator = initialValue ?? this.at(-1);\n    for (let index = this.size - 1; index >= 0; index--) {\n      const entry = this.at(index);\n      if (index === this.size - 1 && args.length === 1) {\n        accumulator = entry;\n      } else {\n        accumulator = Reflect.apply(callbackfn, this, [accumulator, entry, index, this]);\n      }\n    }\n    return accumulator;\n  }\n  toSorted(compareFn) {\n    const entries = [...this.entries()].sort(compareFn);\n    return new _OrderedDict(entries);\n  }\n  toReversed() {\n    const reversed = new _OrderedDict();\n    for (let index = this.size - 1; index >= 0; index--) {\n      const key = this.keyAt(index);\n      const element = this.get(key);\n      reversed.set(key, element);\n    }\n    return reversed;\n  }\n  toSpliced(...args) {\n    const entries = [...this.entries()];\n    entries.splice(...args);\n    return new _OrderedDict(entries);\n  }\n  slice(start, end) {\n    const result = new _OrderedDict();\n    let stop = this.size - 1;\n    if (start === void 0) {\n      return result;\n    }\n    if (start < 0) {\n      start = start + this.size;\n    }\n    if (end !== void 0 && end > 0) {\n      stop = end - 1;\n    }\n    for (let index = start; index <= stop; index++) {\n      const key = this.keyAt(index);\n      const element = this.get(key);\n      result.set(key, element);\n    }\n    return result;\n  }\n  every(predicate, thisArg) {\n    let index = 0;\n    for (const entry of this) {\n      if (!Reflect.apply(predicate, thisArg, [entry, index, this])) {\n        return false;\n      }\n      index++;\n    }\n    return true;\n  }\n  some(predicate, thisArg) {\n    let index = 0;\n    for (const entry of this) {\n      if (Reflect.apply(predicate, thisArg, [entry, index, this])) {\n        return true;\n      }\n      index++;\n    }\n    return false;\n  }\n};\nfunction at(array, index) {\n  if (\"at\" in Array.prototype) {\n    return Array.prototype.at.call(array, index);\n  }\n  const actualIndex = toSafeIndex(array, index);\n  return actualIndex === -1 ? void 0 : array[actualIndex];\n}\nfunction toSafeIndex(array, index) {\n  const length = array.length;\n  const relativeIndex = toSafeInteger(index);\n  const actualIndex = relativeIndex >= 0 ? relativeIndex : length + relativeIndex;\n  return actualIndex < 0 || actualIndex >= length ? -1 : actualIndex;\n}\nfunction toSafeInteger(number) {\n  return number !== number || number === 0 ? 0 : Math.trunc(number);\n}\n\n// src/collection.tsx\nimport { jsx as jsx2 } from \"react/jsx-runtime\";\nfunction createCollection2(name) {\n  const PROVIDER_NAME = name + \"CollectionProvider\";\n  const [createCollectionContext, createCollectionScope] = createContextScope2(PROVIDER_NAME);\n  const [CollectionContextProvider, useCollectionContext] = createCollectionContext(\n    PROVIDER_NAME,\n    {\n      collectionElement: null,\n      collectionRef: { current: null },\n      collectionRefObject: { current: null },\n      itemMap: new OrderedDict(),\n      setItemMap: () => void 0\n    }\n  );\n  const CollectionProvider = ({ state, ...props }) => {\n    return state ? /* @__PURE__ */ jsx2(CollectionProviderImpl, { ...props, state }) : /* @__PURE__ */ jsx2(CollectionInit, { ...props });\n  };\n  CollectionProvider.displayName = PROVIDER_NAME;\n  const CollectionInit = (props) => {\n    const state = useInitCollection();\n    return /* @__PURE__ */ jsx2(CollectionProviderImpl, { ...props, state });\n  };\n  CollectionInit.displayName = PROVIDER_NAME + \"Init\";\n  const CollectionProviderImpl = (props) => {\n    const { scope, children, state } = props;\n    const ref = React2.useRef(null);\n    const [collectionElement, setCollectionElement] = React2.useState(\n      null\n    );\n    const composeRefs = useComposedRefs2(ref, setCollectionElement);\n    const [itemMap, setItemMap] = state;\n    React2.useEffect(() => {\n      if (!collectionElement) return;\n      const observer = getChildListObserver(() => {\n      });\n      observer.observe(collectionElement, {\n        childList: true,\n        subtree: true\n      });\n      return () => {\n        observer.disconnect();\n      };\n    }, [collectionElement]);\n    return /* @__PURE__ */ jsx2(\n      CollectionContextProvider,\n      {\n        scope,\n        itemMap,\n        setItemMap,\n        collectionRef: composeRefs,\n        collectionRefObject: ref,\n        collectionElement,\n        children\n      }\n    );\n  };\n  CollectionProviderImpl.displayName = PROVIDER_NAME + \"Impl\";\n  const COLLECTION_SLOT_NAME = name + \"CollectionSlot\";\n  const CollectionSlotImpl = createSlot2(COLLECTION_SLOT_NAME);\n  const CollectionSlot = React2.forwardRef(\n    (props, forwardedRef) => {\n      const { scope, children } = props;\n      const context = useCollectionContext(COLLECTION_SLOT_NAME, scope);\n      const composedRefs = useComposedRefs2(forwardedRef, context.collectionRef);\n      return /* @__PURE__ */ jsx2(CollectionSlotImpl, { ref: composedRefs, children });\n    }\n  );\n  CollectionSlot.displayName = COLLECTION_SLOT_NAME;\n  const ITEM_SLOT_NAME = name + \"CollectionItemSlot\";\n  const ITEM_DATA_ATTR = \"data-radix-collection-item\";\n  const CollectionItemSlotImpl = createSlot2(ITEM_SLOT_NAME);\n  const CollectionItemSlot = React2.forwardRef(\n    (props, forwardedRef) => {\n      const { scope, children, ...itemData } = props;\n      const ref = React2.useRef(null);\n      const [element, setElement] = React2.useState(null);\n      const composedRefs = useComposedRefs2(forwardedRef, ref, setElement);\n      const context = useCollectionContext(ITEM_SLOT_NAME, scope);\n      const { setItemMap } = context;\n      const itemDataRef = React2.useRef(itemData);\n      if (!shallowEqual(itemDataRef.current, itemData)) {\n        itemDataRef.current = itemData;\n      }\n      const memoizedItemData = itemDataRef.current;\n      React2.useEffect(() => {\n        const itemData2 = memoizedItemData;\n        setItemMap((map) => {\n          if (!element) {\n            return map;\n          }\n          if (!map.has(element)) {\n            map.set(element, { ...itemData2, element });\n            return map.toSorted(sortByDocumentPosition);\n          }\n          return map.set(element, { ...itemData2, element }).toSorted(sortByDocumentPosition);\n        });\n        return () => {\n          setItemMap((map) => {\n            if (!element || !map.has(element)) {\n              return map;\n            }\n            map.delete(element);\n            return new OrderedDict(map);\n          });\n        };\n      }, [element, memoizedItemData, setItemMap]);\n      return /* @__PURE__ */ jsx2(CollectionItemSlotImpl, { ...{ [ITEM_DATA_ATTR]: \"\" }, ref: composedRefs, children });\n    }\n  );\n  CollectionItemSlot.displayName = ITEM_SLOT_NAME;\n  function useInitCollection() {\n    return React2.useState(new OrderedDict());\n  }\n  function useCollection(scope) {\n    const { itemMap } = useCollectionContext(name + \"CollectionConsumer\", scope);\n    return itemMap;\n  }\n  const functions = {\n    createCollectionScope,\n    useCollection,\n    useInitCollection\n  };\n  return [\n    { Provider: CollectionProvider, Slot: CollectionSlot, ItemSlot: CollectionItemSlot },\n    functions\n  ];\n}\nfunction shallowEqual(a, b) {\n  if (a === b) return true;\n  if (typeof a !== \"object\" || typeof b !== \"object\") return false;\n  if (a == null || b == null) return false;\n  const keysA = Object.keys(a);\n  const keysB = Object.keys(b);\n  if (keysA.length !== keysB.length) return false;\n  for (const key of keysA) {\n    if (!Object.prototype.hasOwnProperty.call(b, key)) return false;\n    if (a[key] !== b[key]) return false;\n  }\n  return true;\n}\nfunction isElementPreceding(a, b) {\n  return !!(b.compareDocumentPosition(a) & Node.DOCUMENT_POSITION_PRECEDING);\n}\nfunction sortByDocumentPosition(a, b) {\n  return !a[1].element || !b[1].element ? 0 : isElementPreceding(a[1].element, b[1].element) ? -1 : 1;\n}\nfunction getChildListObserver(callback) {\n  const observer = new MutationObserver((mutationsList) => {\n    for (const mutation of mutationsList) {\n      if (mutation.type === \"childList\") {\n        callback();\n        return;\n      }\n    }\n  });\n  return observer;\n}\nexport {\n  createCollection,\n  createCollection2 as unstable_createCollection\n};\n//# sourceMappingURL=index.mjs.map\n"],"names":["createCollection","name","PROVIDER_NAME","createCollectionContext","createCollectionScope","createContextScope","CollectionProviderImpl","useCollectionContext","CollectionProvider","props","scope","children","ref","React","itemMap","jsx","COLLECTION_SLOT_NAME","CollectionSlotImpl","createSlot","CollectionSlot","forwardedRef","context","composedRefs","useComposedRefs","ITEM_SLOT_NAME","ITEM_DATA_ATTR","CollectionItemSlotImpl","CollectionItemSlot","itemData","useCollection","collectionNode","orderedNodes","a","b"],"mappings":";;;;;AAQA,SAASA,EAAiBC,GAAM;AAC9B,QAAMC,IAAgBD,IAAO,sBACvB,CAACE,GAAyBC,CAAqB,IAAIC,EAAmBH,CAAa,GACnF,CAACI,GAAwBC,CAAoB,IAAIJ;AAAA,IACrDD;AAAA,IACA,EAAE,eAAe,EAAE,SAAS,KAAI,GAAI,SAAyB,oBAAI,IAAG,EAAE;AAAA,EAC1E,GACQM,IAAqB,CAACC,MAAU;AACpC,UAAM,EAAE,OAAAC,GAAO,UAAAC,EAAQ,IAAKF,GACtBG,IAAMC,EAAM,OAAO,IAAI,GACvBC,IAAUD,EAAM,OAAuB,oBAAI,IAAG,CAAE,EAAE;AACxD,WAAuBE,gBAAAA,EAAAA,IAAIT,GAAwB,EAAE,OAAAI,GAAO,SAAAI,GAAS,eAAeF,GAAK,UAAAD,GAAU;AAAA,EACrG;AACA,EAAAH,EAAmB,cAAcN;AACjC,QAAMc,IAAuBf,IAAO,kBAC9BgB,IAAqBC,EAAWF,CAAoB,GACpDG,IAAiBN,EAAM;AAAA,IAC3B,CAACJ,GAAOW,MAAiB;AACvB,YAAM,EAAE,OAAAV,GAAO,UAAAC,EAAQ,IAAKF,GACtBY,IAAUd,EAAqBS,GAAsBN,CAAK,GAC1DY,IAAeC,EAAgBH,GAAcC,EAAQ,aAAa;AACxE,aAAuBN,gBAAAA,EAAAA,IAAIE,GAAoB,EAAE,KAAKK,GAAc,UAAAX,EAAQ,CAAE;AAAA,IAChF;AAAA,EACJ;AACE,EAAAQ,EAAe,cAAcH;AAC7B,QAAMQ,IAAiBvB,IAAO,sBACxBwB,IAAiB,8BACjBC,IAAyBR,EAAWM,CAAc,GAClDG,IAAqBd,EAAM;AAAA,IAC/B,CAACJ,GAAOW,MAAiB;AACvB,YAAM,EAAE,OAAAV,GAAO,UAAAC,GAAU,GAAGiB,EAAQ,IAAKnB,GACnCG,IAAMC,EAAM,OAAO,IAAI,GACvBS,IAAeC,EAAgBH,GAAcR,CAAG,GAChDS,IAAUd,EAAqBiB,GAAgBd,CAAK;AAC1DG,aAAAA,EAAM,UAAU,OACdQ,EAAQ,QAAQ,IAAIT,GAAK,EAAE,KAAAA,GAAK,GAAGgB,GAAU,GACtC,MAAM,KAAKP,EAAQ,QAAQ,OAAOT,CAAG,EAC7C,GACsBG,gBAAAA,MAAIW,GAAwB,EAAO,CAACD,CAAc,GAAG,IAAM,KAAKH,GAAc,UAAAX,GAAU;AAAA,IACjH;AAAA,EACJ;AACE,EAAAgB,EAAmB,cAAcH;AACjC,WAASK,EAAcnB,GAAO;AAC5B,UAAMW,IAAUd,EAAqBN,IAAO,sBAAsBS,CAAK;AAWvE,WAViBG,EAAM,YAAY,MAAM;AACvC,YAAMiB,IAAiBT,EAAQ,cAAc;AAC7C,UAAI,CAACS,EAAgB,QAAO,CAAA;AAC5B,YAAMC,IAAe,MAAM,KAAKD,EAAe,iBAAiB,IAAIL,CAAc,GAAG,CAAC;AAKtF,aAJc,MAAM,KAAKJ,EAAQ,QAAQ,QAAQ,EACtB;AAAA,QACzB,CAACW,GAAGC,MAAMF,EAAa,QAAQC,EAAE,IAAI,OAAO,IAAID,EAAa,QAAQE,EAAE,IAAI,OAAO;AAAA,MAC1F;AAAA,IAEI,GAAG,CAACZ,EAAQ,eAAeA,EAAQ,OAAO,CAAC;AAAA,EAE7C;AACA,SAAO;AAAA,IACL,EAAE,UAAUb,GAAoB,MAAMW,GAAgB,UAAUQ,EAAkB;AAAA,IAClFE;AAAA,IACAzB;AAAA,EACJ;AACA;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es660.js","sources":["../node_modules/postcss/lib/container.js"],"sourcesContent":["'use strict'\n\nlet Comment = require('./comment')\nlet Declaration = require('./declaration')\nlet Node = require('./node')\nlet { isClean, my } = require('./symbols')\n\nlet AtRule, parse, Root, Rule\n\nfunction cleanSource(nodes) {\n  return nodes.map(i => {\n    if (i.nodes) i.nodes = cleanSource(i.nodes)\n    delete i.source\n    return i\n  })\n}\n\nfunction markTreeDirty(node) {\n  node[isClean] = false\n  if (node.proxyOf.nodes) {\n    for (let i of node.proxyOf.nodes) {\n      markTreeDirty(i)\n    }\n  }\n}\n\nclass Container extends Node {\n  get first() {\n    if (!this.proxyOf.nodes) return undefined\n    return this.proxyOf.nodes[0]\n  }\n\n  get last() {\n    if (!this.proxyOf.nodes) return undefined\n    return this.proxyOf.nodes[this.proxyOf.nodes.length - 1]\n  }\n\n  append(...children) {\n    for (let child of children) {\n      let nodes = this.normalize(child, this.last)\n      for (let node of nodes) this.proxyOf.nodes.push(node)\n    }\n\n    this.markDirty()\n\n    return this\n  }\n\n  cleanRaws(keepBetween) {\n    super.cleanRaws(keepBetween)\n    if (this.nodes) {\n      for (let node of this.nodes) node.cleanRaws(keepBetween)\n    }\n  }\n\n  each(callback) {\n    if (!this.proxyOf.nodes) return undefined\n    let iterator = this.getIterator()\n\n    let index, result\n    while (this.indexes[iterator] < this.proxyOf.nodes.length) {\n      index = this.indexes[iterator]\n      result = callback(this.proxyOf.nodes[index], index)\n      if (result === false) break\n\n      this.indexes[iterator] += 1\n    }\n\n    delete this.indexes[iterator]\n    return result\n  }\n\n  every(condition) {\n    return this.nodes.every(condition)\n  }\n\n  getIterator() {\n    if (!this.lastEach) this.lastEach = 0\n    if (!this.indexes) this.indexes = {}\n\n    this.lastEach += 1\n    let iterator = this.lastEach\n    this.indexes[iterator] = 0\n\n    return iterator\n  }\n\n  getProxyProcessor() {\n    return {\n      get(node, prop) {\n        if (prop === 'proxyOf') {\n          return node\n        } else if (!node[prop]) {\n          return node[prop]\n        } else if (\n          prop === 'each' ||\n          (typeof prop === 'string' && prop.startsWith('walk'))\n        ) {\n          return (...args) => {\n            return node[prop](\n              ...args.map(i => {\n                if (typeof i === 'function') {\n                  return (child, index) => i(child.toProxy(), index)\n                } else {\n                  return i\n                }\n              })\n            )\n          }\n        } else if (prop === 'every' || prop === 'some') {\n          return cb => {\n            return node[prop]((child, ...other) =>\n              cb(child.toProxy(), ...other)\n            )\n          }\n        } else if (prop === 'root') {\n          return () => node.root().toProxy()\n        } else if (prop === 'nodes') {\n          return node.nodes.map(i => i.toProxy())\n        } else if (prop === 'first' || prop === 'last') {\n          return node[prop].toProxy()\n        } else {\n          return node[prop]\n        }\n      },\n\n      set(node, prop, value) {\n        if (node[prop] === value) return true\n        node[prop] = value\n        if (prop === 'name' || prop === 'params' || prop === 'selector') {\n          node.markDirty()\n        }\n        return true\n      }\n    }\n  }\n\n  index(child) {\n    if (typeof child === 'number') return child\n    if (child.proxyOf) child = child.proxyOf\n    return this.proxyOf.nodes.indexOf(child)\n  }\n\n  insertAfter(exist, add) {\n    let existIndex = this.index(exist)\n    let nodes = this.normalize(add, this.proxyOf.nodes[existIndex]).reverse()\n    existIndex = this.index(exist)\n    for (let node of nodes) this.proxyOf.nodes.splice(existIndex + 1, 0, node)\n\n    let index\n    for (let id in this.indexes) {\n      index = this.indexes[id]\n      if (existIndex < index) {\n        this.indexes[id] = index + nodes.length\n      }\n    }\n\n    this.markDirty()\n\n    return this\n  }\n\n  insertBefore(exist, add) {\n    let existIndex = this.index(exist)\n    let type = existIndex === 0 ? 'prepend' : false\n    let nodes = this.normalize(\n      add,\n      this.proxyOf.nodes[existIndex],\n      type\n    ).reverse()\n    existIndex = this.index(exist)\n    for (let node of nodes) this.proxyOf.nodes.splice(existIndex, 0, node)\n\n    let index\n    for (let id in this.indexes) {\n      index = this.indexes[id]\n      if (existIndex <= index) {\n        this.indexes[id] = index + nodes.length\n      }\n    }\n\n    this.markDirty()\n\n    return this\n  }\n\n  normalize(nodes, sample) {\n    if (typeof nodes === 'string') {\n      nodes = cleanSource(parse(nodes).nodes)\n    } else if (typeof nodes === 'undefined') {\n      nodes = []\n    } else if (Array.isArray(nodes)) {\n      nodes = nodes.slice(0)\n      for (let i of nodes) {\n        if (i.parent) i.parent.removeChild(i, 'ignore')\n      }\n    } else if (nodes.type === 'root' && this.type !== 'document') {\n      nodes = nodes.nodes.slice(0)\n      for (let i of nodes) {\n        if (i.parent) i.parent.removeChild(i, 'ignore')\n      }\n    } else if (nodes.type) {\n      nodes = [nodes]\n    } else if (nodes.prop) {\n      if (typeof nodes.value === 'undefined') {\n        throw new Error('Value field is missed in node creation')\n      } else if (typeof nodes.value !== 'string') {\n        nodes.value = String(nodes.value)\n      }\n      nodes = [new Declaration(nodes)]\n    } else if (nodes.selector || nodes.selectors) {\n      nodes = [new Rule(nodes)]\n    } else if (nodes.name) {\n      nodes = [new AtRule(nodes)]\n    } else if (nodes.text) {\n      nodes = [new Comment(nodes)]\n    } else {\n      throw new Error('Unknown node type in node creation')\n    }\n\n    let processed = nodes.map(i => {\n      /* c8 ignore next */\n      if (!i[my]) Container.rebuild(i)\n      i = i.proxyOf\n      if (i.parent) i.parent.removeChild(i)\n      if (i[isClean]) markTreeDirty(i)\n\n      if (!i.raws) i.raws = {}\n      if (typeof i.raws.before === 'undefined') {\n        if (sample && typeof sample.raws.before !== 'undefined') {\n          i.raws.before = sample.raws.before.replace(/\\S/g, '')\n        }\n      }\n      i.parent = this.proxyOf\n      return i\n    })\n\n    return processed\n  }\n\n  prepend(...children) {\n    children = children.reverse()\n    for (let child of children) {\n      let nodes = this.normalize(child, this.first, 'prepend').reverse()\n      for (let node of nodes) this.proxyOf.nodes.unshift(node)\n      for (let id in this.indexes) {\n        this.indexes[id] = this.indexes[id] + nodes.length\n      }\n    }\n\n    this.markDirty()\n\n    return this\n  }\n\n  push(child) {\n    child.parent = this\n    this.proxyOf.nodes.push(child)\n    return this\n  }\n\n  removeAll() {\n    for (let node of this.proxyOf.nodes) node.parent = undefined\n    this.proxyOf.nodes = []\n\n    this.markDirty()\n\n    return this\n  }\n\n  removeChild(child) {\n    child = this.index(child)\n    this.proxyOf.nodes[child].parent = undefined\n    this.proxyOf.nodes.splice(child, 1)\n\n    let index\n    for (let id in this.indexes) {\n      index = this.indexes[id]\n      if (index >= child) {\n        this.indexes[id] = index - 1\n      }\n    }\n\n    this.markDirty()\n\n    return this\n  }\n\n  replaceValues(pattern, opts, callback) {\n    if (!callback) {\n      callback = opts\n      opts = {}\n    }\n\n    this.walkDecls(decl => {\n      if (opts.props && !opts.props.includes(decl.prop)) return\n      if (opts.fast && !decl.value.includes(opts.fast)) return\n\n      decl.value = decl.value.replace(pattern, callback)\n    })\n\n    this.markDirty()\n\n    return this\n  }\n\n  some(condition) {\n    return this.nodes.some(condition)\n  }\n\n  walk(callback) {\n    return this.each((child, i) => {\n      let result\n      try {\n        result = callback(child, i)\n      } catch (e) {\n        throw child.addToError(e)\n      }\n      if (result !== false && child.walk) {\n        result = child.walk(callback)\n      }\n\n      return result\n    })\n  }\n\n  walkAtRules(name, callback) {\n    if (!callback) {\n      callback = name\n      return this.walk((child, i) => {\n        if (child.type === 'atrule') {\n          return callback(child, i)\n        }\n      })\n    }\n    if (name instanceof RegExp) {\n      return this.walk((child, i) => {\n        if (child.type === 'atrule' && name.test(child.name)) {\n          return callback(child, i)\n        }\n      })\n    }\n    return this.walk((child, i) => {\n      if (child.type === 'atrule' && child.name === name) {\n        return callback(child, i)\n      }\n    })\n  }\n\n  walkComments(callback) {\n    return this.walk((child, i) => {\n      if (child.type === 'comment') {\n        return callback(child, i)\n      }\n    })\n  }\n\n  walkDecls(prop, callback) {\n    if (!callback) {\n      callback = prop\n      return this.walk((child, i) => {\n        if (child.type === 'decl') {\n          return callback(child, i)\n        }\n      })\n    }\n    if (prop instanceof RegExp) {\n      return this.walk((child, i) => {\n        if (child.type === 'decl' && prop.test(child.prop)) {\n          return callback(child, i)\n        }\n      })\n    }\n    return this.walk((child, i) => {\n      if (child.type === 'decl' && child.prop === prop) {\n        return callback(child, i)\n      }\n    })\n  }\n\n  walkRules(selector, callback) {\n    if (!callback) {\n      callback = selector\n\n      return this.walk((child, i) => {\n        if (child.type === 'rule') {\n          return callback(child, i)\n        }\n      })\n    }\n    if (selector instanceof RegExp) {\n      return this.walk((child, i) => {\n        if (child.type === 'rule' && selector.test(child.selector)) {\n          return callback(child, i)\n        }\n      })\n    }\n    return this.walk((child, i) => {\n      if (child.type === 'rule' && child.selector === selector) {\n        return callback(child, i)\n      }\n    })\n  }\n}\n\nContainer.registerParse = dependant => {\n  parse = dependant\n}\n\nContainer.registerRule = dependant => {\n  Rule = dependant\n}\n\nContainer.registerAtRule = dependant => {\n  AtRule = dependant\n}\n\nContainer.registerRoot = dependant => {\n  Root = dependant\n}\n\nmodule.exports = Container\nContainer.default = Container\n\n/* c8 ignore start */\nContainer.rebuild = node => {\n  if (node.type === 'atrule') {\n    Object.setPrototypeOf(node, AtRule.prototype)\n  } else if (node.type === 'rule') {\n    Object.setPrototypeOf(node, Rule.prototype)\n  } else if (node.type === 'decl') {\n    Object.setPrototypeOf(node, Declaration.prototype)\n  } else if (node.type === 'comment') {\n    Object.setPrototypeOf(node, Comment.prototype)\n  } else if (node.type === 'root') {\n    Object.setPrototypeOf(node, Root.prototype)\n  }\n\n  node[my] = true\n\n  if (node.nodes) {\n    node.nodes.forEach(child => {\n      Container.rebuild(child)\n    })\n  }\n}\n/* c8 ignore stop */\n"],"names":["Comment","require$$0","Declaration","require$$1","Node","require$$2","isClean","my","require$$3","AtRule","parse","Root","Rule","cleanSource","nodes","i","markTreeDirty","node","Container","children","child","keepBetween","callback","iterator","index","result","condition","prop","args","cb","other","value","exist","add","existIndex","id","type","sample","pattern","opts","decl","e","name","selector","dependant","container"],"mappings":";;;;;;;;AAEA,MAAIA,IAAUC,EAAA,GACVC,IAAcC,EAAA,GACdC,IAAOC,EAAA,GACP,EAAE,SAAAC,GAAS,IAAAC,EAAE,IAAKC,EAAA,GAElBC,GAAQC,GAAOC,GAAMC;AAEzB,WAASC,EAAYC,GAAO;AAC1B,WAAOA,EAAM,IAAI,CAAAC,OACXA,EAAE,UAAOA,EAAE,QAAQF,EAAYE,EAAE,KAAK,IAC1C,OAAOA,EAAE,QACFA,EACR;AAAA,EACH;AAEA,WAASC,EAAcC,GAAM;AAE3B,QADAA,EAAKX,CAAO,IAAI,IACZW,EAAK,QAAQ;AACf,eAASF,KAAKE,EAAK,QAAQ;AACzB,QAAAD,EAAcD,CAAC;AAAA,EAGrB;AAAA,EAEA,MAAMG,UAAkBd,EAAK;AAAA,IAC3B,IAAI,QAAQ;AACV,UAAK,KAAK,QAAQ;AAClB,eAAO,KAAK,QAAQ,MAAM,CAAC;AAAA,IAC/B;AAAA,IAEE,IAAI,OAAO;AACT,UAAK,KAAK,QAAQ;AAClB,eAAO,KAAK,QAAQ,MAAM,KAAK,QAAQ,MAAM,SAAS,CAAC;AAAA,IAC3D;AAAA,IAEE,UAAUe,GAAU;AAClB,eAASC,KAASD,GAAU;AAC1B,YAAIL,IAAQ,KAAK,UAAUM,GAAO,KAAK,IAAI;AAC3C,iBAASH,KAAQH,EAAO,MAAK,QAAQ,MAAM,KAAKG,CAAI;AAAA,MAC1D;AAEI,kBAAK,UAAS,GAEP;AAAA,IACX;AAAA,IAEE,UAAUI,GAAa;AAErB,UADA,MAAM,UAAUA,CAAW,GACvB,KAAK;AACP,iBAASJ,KAAQ,KAAK,MAAO,CAAAA,EAAK,UAAUI,CAAW;AAAA,IAE7D;AAAA,IAEE,KAAKC,GAAU;AACb,UAAI,CAAC,KAAK,QAAQ,MAAO;AACzB,UAAIC,IAAW,KAAK,YAAW,GAE3BC,GAAOC;AACX,aAAO,KAAK,QAAQF,CAAQ,IAAI,KAAK,QAAQ,MAAM,WACjDC,IAAQ,KAAK,QAAQD,CAAQ,GAC7BE,IAASH,EAAS,KAAK,QAAQ,MAAME,CAAK,GAAGA,CAAK,GAC9CC,MAAW;AAEf,aAAK,QAAQF,CAAQ,KAAK;AAG5B,oBAAO,KAAK,QAAQA,CAAQ,GACrBE;AAAA,IACX;AAAA,IAEE,MAAMC,GAAW;AACf,aAAO,KAAK,MAAM,MAAMA,CAAS;AAAA,IACrC;AAAA,IAEE,cAAc;AACZ,MAAK,KAAK,aAAU,KAAK,WAAW,IAC/B,KAAK,YAAS,KAAK,UAAU,CAAA,IAElC,KAAK,YAAY;AACjB,UAAIH,IAAW,KAAK;AACpB,kBAAK,QAAQA,CAAQ,IAAI,GAElBA;AAAA,IACX;AAAA,IAEE,oBAAoB;AAClB,aAAO;AAAA,QACL,IAAIN,GAAMU,GAAM;AACd,iBAAIA,MAAS,YACJV,IACGA,EAAKU,CAAI,IAGnBA,MAAS,UACR,OAAOA,KAAS,YAAYA,EAAK,WAAW,MAAM,IAE5C,IAAIC,MACFX,EAAKU,CAAI;AAAA,YACd,GAAGC,EAAK,IAAI,OACN,OAAO,KAAM,aACR,CAACR,GAAOI,MAAU,EAAEJ,EAAM,QAAO,GAAII,CAAK,IAE1C,CAEV;AAAA,UACf,IAEmBG,MAAS,WAAWA,MAAS,SAC/B,CAAAE,MACEZ,EAAKU,CAAI;AAAA,YAAE,CAACP,MAAUU,MAC3BD,EAAGT,EAAM,QAAO,GAAI,GAAGU,CAAK;AAAA,UAC1C,IAEmBH,MAAS,SACX,MAAMV,EAAK,KAAI,EAAG,QAAO,IACvBU,MAAS,UACXV,EAAK,MAAM,IAAI,CAAAF,MAAKA,EAAE,QAAO,CAAE,IAC7BY,MAAS,WAAWA,MAAS,SAC/BV,EAAKU,CAAI,EAAE,QAAO,IAElBV,EAAKU,CAAI,IA7BTV,EAAKU,CAAI;AAAA,QA+B1B;AAAA,QAEM,IAAIV,GAAMU,GAAMI,GAAO;AACrB,iBAAId,EAAKU,CAAI,MAAMI,MACnBd,EAAKU,CAAI,IAAII,IACTJ,MAAS,UAAUA,MAAS,YAAYA,MAAS,eACnDV,EAAK,UAAS,IAET;AAAA,QACf;AAAA,MACA;AAAA,IACA;AAAA,IAEE,MAAMG,GAAO;AACX,aAAI,OAAOA,KAAU,WAAiBA,KAClCA,EAAM,YAASA,IAAQA,EAAM,UAC1B,KAAK,QAAQ,MAAM,QAAQA,CAAK;AAAA,IAC3C;AAAA,IAEE,YAAYY,GAAOC,GAAK;AACtB,UAAIC,IAAa,KAAK,MAAMF,CAAK,GAC7BlB,IAAQ,KAAK,UAAUmB,GAAK,KAAK,QAAQ,MAAMC,CAAU,CAAC,EAAE,QAAO;AACvE,MAAAA,IAAa,KAAK,MAAMF,CAAK;AAC7B,eAASf,KAAQH,EAAO,MAAK,QAAQ,MAAM,OAAOoB,IAAa,GAAG,GAAGjB,CAAI;AAEzE,UAAIO;AACJ,eAASW,KAAM,KAAK;AAClB,QAAAX,IAAQ,KAAK,QAAQW,CAAE,GACnBD,IAAaV,MACf,KAAK,QAAQW,CAAE,IAAIX,IAAQV,EAAM;AAIrC,kBAAK,UAAS,GAEP;AAAA,IACX;AAAA,IAEE,aAAakB,GAAOC,GAAK;AACvB,UAAIC,IAAa,KAAK,MAAMF,CAAK,GAC7BI,IAAOF,MAAe,IAAI,YAAY,IACtCpB,IAAQ,KAAK;AAAA,QACfmB;AAAA,QACA,KAAK,QAAQ,MAAMC,CAAU;AAAA,QAC7BE;AAAA,MACN,EAAM,QAAO;AACT,MAAAF,IAAa,KAAK,MAAMF,CAAK;AAC7B,eAASf,KAAQH,EAAO,MAAK,QAAQ,MAAM,OAAOoB,GAAY,GAAGjB,CAAI;AAErE,UAAIO;AACJ,eAASW,KAAM,KAAK;AAClB,QAAAX,IAAQ,KAAK,QAAQW,CAAE,GACnBD,KAAcV,MAChB,KAAK,QAAQW,CAAE,IAAIX,IAAQV,EAAM;AAIrC,kBAAK,UAAS,GAEP;AAAA,IACX;AAAA,IAEE,UAAUA,GAAOuB,GAAQ;AACvB,UAAI,OAAOvB,KAAU;AACnB,QAAAA,IAAQD,EAAYH,EAAMI,CAAK,EAAE,KAAK;AAAA,eAC7B,OAAOA,IAAU;AAC1B,QAAAA,IAAQ,CAAA;AAAA,eACC,MAAM,QAAQA,CAAK,GAAG;AAC/B,QAAAA,IAAQA,EAAM,MAAM,CAAC;AACrB,iBAAS,KAAKA;AACZ,UAAI,EAAE,UAAQ,EAAE,OAAO,YAAY,GAAG,QAAQ;AAAA,MAEtD,WAAeA,EAAM,SAAS,UAAU,KAAK,SAAS,YAAY;AAC5D,QAAAA,IAAQA,EAAM,MAAM,MAAM,CAAC;AAC3B,iBAAS,KAAKA;AACZ,UAAI,EAAE,UAAQ,EAAE,OAAO,YAAY,GAAG,QAAQ;AAAA,MAEtD,WAAeA,EAAM;AACf,QAAAA,IAAQ,CAACA,CAAK;AAAA,eACLA,EAAM,MAAM;AACrB,YAAI,OAAOA,EAAM,QAAU;AACzB,gBAAM,IAAI,MAAM,wCAAwC;AACnD,QAAI,OAAOA,EAAM,SAAU,aAChCA,EAAM,QAAQ,OAAOA,EAAM,KAAK,IAElCA,IAAQ,CAAC,IAAIZ,EAAYY,CAAK,CAAC;AAAA,MACrC,WAAeA,EAAM,YAAYA,EAAM;AACjC,QAAAA,IAAQ,CAAC,IAAIF,EAAKE,CAAK,CAAC;AAAA,eACfA,EAAM;AACf,QAAAA,IAAQ,CAAC,IAAIL,EAAOK,CAAK,CAAC;AAAA,eACjBA,EAAM;AACf,QAAAA,IAAQ,CAAC,IAAId,EAAQc,CAAK,CAAC;AAAA;AAE3B,cAAM,IAAI,MAAM,oCAAoC;AAoBtD,aAjBgBA,EAAM,IAAI,QAEnB,EAAEP,CAAE,KAAGW,EAAU,QAAQ,CAAC,GAC/B,IAAI,EAAE,SACF,EAAE,UAAQ,EAAE,OAAO,YAAY,CAAC,GAChC,EAAEZ,CAAO,KAAGU,EAAc,CAAC,GAE1B,EAAE,SAAM,EAAE,OAAO,CAAA,IAClB,OAAO,EAAE,KAAK,SAAW,OACvBqB,KAAU,OAAOA,EAAO,KAAK,SAAW,QAC1C,EAAE,KAAK,SAASA,EAAO,KAAK,OAAO,QAAQ,OAAO,EAAE,IAGxD,EAAE,SAAS,KAAK,SACT,EACR;AAAA,IAGL;AAAA,IAEE,WAAWlB,GAAU;AACnB,MAAAA,IAAWA,EAAS,QAAO;AAC3B,eAASC,KAASD,GAAU;AAC1B,YAAIL,IAAQ,KAAK,UAAUM,GAAO,KAAK,OAAO,SAAS,EAAE,QAAO;AAChE,iBAASH,KAAQH,EAAO,MAAK,QAAQ,MAAM,QAAQG,CAAI;AACvD,iBAASkB,KAAM,KAAK;AAClB,eAAK,QAAQA,CAAE,IAAI,KAAK,QAAQA,CAAE,IAAIrB,EAAM;AAAA,MAEpD;AAEI,kBAAK,UAAS,GAEP;AAAA,IACX;AAAA,IAEE,KAAKM,GAAO;AACV,aAAAA,EAAM,SAAS,MACf,KAAK,QAAQ,MAAM,KAAKA,CAAK,GACtB;AAAA,IACX;AAAA,IAEE,YAAY;AACV,eAASH,KAAQ,KAAK,QAAQ,MAAO,CAAAA,EAAK,SAAS;AACnD,kBAAK,QAAQ,QAAQ,CAAA,GAErB,KAAK,UAAS,GAEP;AAAA,IACX;AAAA,IAEE,YAAYG,GAAO;AACjB,MAAAA,IAAQ,KAAK,MAAMA,CAAK,GACxB,KAAK,QAAQ,MAAMA,CAAK,EAAE,SAAS,QACnC,KAAK,QAAQ,MAAM,OAAOA,GAAO,CAAC;AAElC,UAAII;AACJ,eAASW,KAAM,KAAK;AAClB,QAAAX,IAAQ,KAAK,QAAQW,CAAE,GACnBX,KAASJ,MACX,KAAK,QAAQe,CAAE,IAAIX,IAAQ;AAI/B,kBAAK,UAAS,GAEP;AAAA,IACX;AAAA,IAEE,cAAcc,GAASC,GAAMjB,GAAU;AACrC,aAAKA,MACHA,IAAWiB,GACXA,IAAO,CAAA,IAGT,KAAK,UAAU,CAAAC,MAAQ;AACrB,QAAID,EAAK,SAAS,CAACA,EAAK,MAAM,SAASC,EAAK,IAAI,KAC5CD,EAAK,QAAQ,CAACC,EAAK,MAAM,SAASD,EAAK,IAAI,MAE/CC,EAAK,QAAQA,EAAK,MAAM,QAAQF,GAAShB,CAAQ;AAAA,MACvD,CAAK,GAED,KAAK,UAAS,GAEP;AAAA,IACX;AAAA,IAEE,KAAKI,GAAW;AACd,aAAO,KAAK,MAAM,KAAKA,CAAS;AAAA,IACpC;AAAA,IAEE,KAAKJ,GAAU;AACb,aAAO,KAAK,KAAK,CAACF,GAAOL,MAAM;AAC7B,YAAIU;AACJ,YAAI;AACF,UAAAA,IAASH,EAASF,GAAOL,CAAC;AAAA,QAClC,SAAe0B,GAAG;AACV,gBAAMrB,EAAM,WAAWqB,CAAC;AAAA,QAChC;AACM,eAAIhB,MAAW,MAASL,EAAM,SAC5BK,IAASL,EAAM,KAAKE,CAAQ,IAGvBG;AAAA,MACb,CAAK;AAAA,IACL;AAAA,IAEE,YAAYiB,GAAMpB,GAAU;AAC1B,aAAKA,IAQDoB,aAAgB,SACX,KAAK,KAAK,CAACtB,GAAO,MAAM;AAC7B,YAAIA,EAAM,SAAS,YAAYsB,EAAK,KAAKtB,EAAM,IAAI;AACjD,iBAAOE,EAASF,GAAO,CAAC;AAAA,MAElC,CAAO,IAEI,KAAK,KAAK,CAACA,GAAO,MAAM;AAC7B,YAAIA,EAAM,SAAS,YAAYA,EAAM,SAASsB;AAC5C,iBAAOpB,EAASF,GAAO,CAAC;AAAA,MAEhC,CAAK,KAlBCE,IAAWoB,GACJ,KAAK,KAAK,CAACtB,GAAO,MAAM;AAC7B,YAAIA,EAAM,SAAS;AACjB,iBAAOE,EAASF,GAAO,CAAC;AAAA,MAElC,CAAO;AAAA,IAcP;AAAA,IAEE,aAAaE,GAAU;AACrB,aAAO,KAAK,KAAK,CAACF,GAAOL,MAAM;AAC7B,YAAIK,EAAM,SAAS;AACjB,iBAAOE,EAASF,GAAOL,CAAC;AAAA,MAEhC,CAAK;AAAA,IACL;AAAA,IAEE,UAAUY,GAAML,GAAU;AACxB,aAAKA,IAQDK,aAAgB,SACX,KAAK,KAAK,CAACP,GAAO,MAAM;AAC7B,YAAIA,EAAM,SAAS,UAAUO,EAAK,KAAKP,EAAM,IAAI;AAC/C,iBAAOE,EAASF,GAAO,CAAC;AAAA,MAElC,CAAO,IAEI,KAAK,KAAK,CAACA,GAAO,MAAM;AAC7B,YAAIA,EAAM,SAAS,UAAUA,EAAM,SAASO;AAC1C,iBAAOL,EAASF,GAAO,CAAC;AAAA,MAEhC,CAAK,KAlBCE,IAAWK,GACJ,KAAK,KAAK,CAACP,GAAO,MAAM;AAC7B,YAAIA,EAAM,SAAS;AACjB,iBAAOE,EAASF,GAAO,CAAC;AAAA,MAElC,CAAO;AAAA,IAcP;AAAA,IAEE,UAAUuB,GAAUrB,GAAU;AAC5B,aAAKA,IASDqB,aAAoB,SACf,KAAK,KAAK,CAACvB,GAAO,MAAM;AAC7B,YAAIA,EAAM,SAAS,UAAUuB,EAAS,KAAKvB,EAAM,QAAQ;AACvD,iBAAOE,EAASF,GAAO,CAAC;AAAA,MAElC,CAAO,IAEI,KAAK,KAAK,CAACA,GAAO,MAAM;AAC7B,YAAIA,EAAM,SAAS,UAAUA,EAAM,aAAauB;AAC9C,iBAAOrB,EAASF,GAAO,CAAC;AAAA,MAEhC,CAAK,KAnBCE,IAAWqB,GAEJ,KAAK,KAAK,CAACvB,GAAO,MAAM;AAC7B,YAAIA,EAAM,SAAS;AACjB,iBAAOE,EAASF,GAAO,CAAC;AAAA,MAElC,CAAO;AAAA,IAcP;AAAA,EACA;AAEA,SAAAF,EAAU,gBAAgB,CAAA0B,MAAa;AACrC,IAAAlC,IAAQkC;AAAA,EACV,GAEA1B,EAAU,eAAe,CAAA0B,MAAa;AACpC,IAAAhC,IAAOgC;AAAA,EACT,GAEA1B,EAAU,iBAAiB,CAAA0B,MAAa;AACtC,IAAAnC,IAASmC;AAAA,EACX,GAEA1B,EAAU,eAAe,CAAA0B,MAAa;AACpC,IAAAjC,IAAOiC;AAAA,EACT,GAEAC,IAAiB3B,GACjBA,EAAU,UAAUA,GAGpBA,EAAU,UAAU,CAAAD,MAAQ;AAC1B,IAAIA,EAAK,SAAS,WAChB,OAAO,eAAeA,GAAMR,EAAO,SAAS,IACnCQ,EAAK,SAAS,SACvB,OAAO,eAAeA,GAAML,EAAK,SAAS,IACjCK,EAAK,SAAS,SACvB,OAAO,eAAeA,GAAMf,EAAY,SAAS,IACxCe,EAAK,SAAS,YACvB,OAAO,eAAeA,GAAMjB,EAAQ,SAAS,IACpCiB,EAAK,SAAS,UACvB,OAAO,eAAeA,GAAMN,EAAK,SAAS,GAG5CM,EAAKV,CAAE,IAAI,IAEPU,EAAK,SACPA,EAAK,MAAM,QAAQ,CAAAG,MAAS;AAC1B,MAAAF,EAAU,QAAQE,CAAK;AAAA,IAC7B,CAAK;AAAA,EAEL;;","x_google_ignoreList":[0]}

package/dist/index.es661.js

@@ -1,222 +1,57 @@
-import * as c from "react";
-import { useFloating as xe, offset as Pe, shift as ye, flip as Ae, size as ve, arrow as Ce, hide as be, limitShift as Re } from "./index.es678.js";
-import { Root as Se } from "./index.es679.js";
-import { useComposedRefs as T } from "./index.es477.js";
-import { createContextScope as Oe } from "./index.es478.js";
-import { Primitive as z } from "./index.es485.js";
-import { useCallbackRef as Ee } from "./index.es514.js";
-import { useLayoutEffect as B } from "./index.es513.js";
-import { useSize as Ne } from "./index.es494.js";
-import { j as f } from "./index.es248.js";
-import { autoUpdate as _e } from "./index.es680.js";
-var N = "Popper", [L, Ue] = Oe(N), [$e, Z] = L(N), U = (e) => {
-  const { __scopePopper: s, children: a } = e, [t, i] = c.useState(null);
-  return /* @__PURE__ */ f.jsx($e, { scope: s, anchor: t, onAnchorChange: i, children: a });
-};
-U.displayName = N;
-var q = "PopperAnchor", G = c.forwardRef(
-  (e, s) => {
-    const { __scopePopper: a, virtualRef: t, ...i } = e, r = Z(q, a), o = c.useRef(null), w = T(s, o), n = c.useRef(null);
-    return c.useEffect(() => {
-      const p = n.current;
-      n.current = (t == null ? void 0 : t.current) || o.current, p !== n.current && r.onAnchorChange(n.current);
-    }), t ? null : /* @__PURE__ */ f.jsx(z.div, { ...i, ref: w });
-  }
-);
-G.displayName = q;
-var _ = "PopperContent", [je, He] = L(_), J = c.forwardRef(
-  (e, s) => {
-    var I, Y, M, X, D, F;
-    const {
-      __scopePopper: a,
-      side: t = "bottom",
-      sideOffset: i = 0,
-      align: r = "center",
-      alignOffset: o = 0,
-      arrowPadding: w = 0,
-      avoidCollisions: n = !0,
-      collisionBoundary: p = [],
-      collisionPadding: x = 0,
-      sticky: m = "partial",
-      hideWhenDetached: y = !1,
-      updatePositionStrategy: A = "optimized",
-      onPlaced: l,
-      ...d
-    } = e, v = Z(_, a), [h, C] = c.useState(null), ee = T(s, (P) => C(P)), [E, te] = c.useState(null), u = Ne(E), re = (u == null ? void 0 : u.width) ?? 0, $ = (u == null ? void 0 : u.height) ?? 0, oe = t + (r !== "center" ? "-" + r : ""), ne = typeof x == "number" ? x : { top: 0, right: 0, bottom: 0, left: 0, ...x }, j = Array.isArray(p) ? p : [p], ae = j.length > 0, b = {
-      padding: ne,
-      boundary: j.filter(Ie),
-      // with `strategy: 'fixed'`, this is the only way to get it to respect boundaries
-      altBoundary: ae
-    }, { refs: ie, floatingStyles: H, placement: se, isPositioned: R, middlewareData: g } = xe({
-      // default to `fixed` strategy so users don't have to pick and we also avoid focus scroll issues
-      strategy: "fixed",
-      placement: oe,
-      whileElementsMounted: (...P) => _e(...P, {
-        animationFrame: A === "always"
-      }),
-      elements: {
-        reference: v.anchor
-      },
-      middleware: [
-        Pe({ mainAxis: i + $, alignmentAxis: o }),
-        n && ye({
-          mainAxis: !0,
-          crossAxis: !1,
-          limiter: m === "partial" ? Re() : void 0,
-          ...b
-        }),
-        n && Ae({ ...b }),
-        ve({
-          ...b,
-          apply: ({ elements: P, rects: k, availableWidth: he, availableHeight: ue }) => {
-            const { width: ge, height: we } = k.reference, O = P.floating.style;
-            O.setProperty("--radix-popper-available-width", `${he}px`), O.setProperty("--radix-popper-available-height", `${ue}px`), O.setProperty("--radix-popper-anchor-width", `${ge}px`), O.setProperty("--radix-popper-anchor-height", `${we}px`);
-          }
-        }),
-        E && Ce({ element: E, padding: w }),
-        Ye({ arrowWidth: re, arrowHeight: $ }),
-        y && be({ strategy: "referenceHidden", ...b })
-      ]
-    }), [W, pe] = V(se), S = Ee(l);
-    B(() => {
-      R && (S == null || S());
-    }, [R, S]);
-    const ce = (I = g.arrow) == null ? void 0 : I.x, de = (Y = g.arrow) == null ? void 0 : Y.y, le = ((M = g.arrow) == null ? void 0 : M.centerOffset) !== 0, [fe, me] = c.useState();
-    return B(() => {
-      h && me(window.getComputedStyle(h).zIndex);
-    }, [h]), /* @__PURE__ */ f.jsx(
-      "div",
-      {
-        ref: ie.setFloating,
-        "data-radix-popper-content-wrapper": "",
-        style: {
-          ...H,
-          transform: R ? H.transform : "translate(0, -200%)",
-          // keep off the page when measuring
-          minWidth: "max-content",
-          zIndex: fe,
-          "--radix-popper-transform-origin": [
-            (X = g.transformOrigin) == null ? void 0 : X.x,
-            (D = g.transformOrigin) == null ? void 0 : D.y
-          ].join(" "),
-          // hide the content if using the hide middleware and should be hidden
-          // set visibility to hidden and disable pointer events so the UI behaves
-          // as if the PopperContent isn't there at all
-          ...((F = g.hide) == null ? void 0 : F.referenceHidden) && {
-            visibility: "hidden",
-            pointerEvents: "none"
-          }
-        },
-        dir: e.dir,
-        children: /* @__PURE__ */ f.jsx(
-          je,
-          {
-            scope: a,
-            placedSide: W,
-            onArrowChange: te,
-            arrowX: ce,
-            arrowY: de,
-            shouldHideArrow: le,
-            children: /* @__PURE__ */ f.jsx(
-              z.div,
-              {
-                "data-side": W,
-                "data-align": pe,
-                ...d,
-                ref: ee,
-                style: {
-                  ...d.style,
-                  // if the PopperContent hasn't been placed yet (not all measurements done)
-                  // we prevent animations so that users's animation don't kick in too early referring wrong sides
-                  animation: R ? void 0 : "none"
-                }
-              }
-            )
-          }
-        )
+import { __require as q } from "./index.es723.js";
+import L from "./index.es724.js";
+var m, S;
+function w() {
+  if (S) return m;
+  S = 1;
+  let f = /* @__PURE__ */ q(), d = L;
+  class h extends Error {
+    constructor(t, n, i, r, l, a) {
+      super(t), this.name = "CssSyntaxError", this.reason = t, l && (this.file = l), r && (this.source = r), a && (this.plugin = a), typeof n < "u" && typeof i < "u" && (typeof n == "number" ? (this.line = n, this.column = i) : (this.line = n.line, this.column = n.column, this.endLine = i.line, this.endColumn = i.column)), this.setMessage(), Error.captureStackTrace && Error.captureStackTrace(this, h);
+    }
+    setMessage() {
+      this.message = this.plugin ? this.plugin + ": " : "", this.message += this.file ? this.file : "<css input>", typeof this.line < "u" && (this.message += ":" + this.line + ":" + this.column), this.message += ": " + this.reason;
+    }
+    showSourceCode(t) {
+      if (!this.source) return "";
+      let n = this.source;
+      t == null && (t = f.isColorSupported);
+      let i = (e) => e, r = (e) => e, l = (e) => e;
+      if (t) {
+        let { bold: e, gray: c, red: o } = f.createColors(!0);
+        r = (s) => e(o(s)), i = (s) => c(s), d && (l = (s) => d(s));
       }
-    );
-  }
-);
-J.displayName = _;
-var K = "PopperArrow", We = {
-  top: "bottom",
-  right: "left",
-  bottom: "top",
-  left: "right"
-}, Q = c.forwardRef(function(s, a) {
-  const { __scopePopper: t, ...i } = s, r = He(K, t), o = We[r.placedSide];
-  return (
-    // we have to use an extra wrapper because `ResizeObserver` (used by `useSize`)
-    // doesn't report size as we'd expect on SVG elements.
-    // it reports their bounding box which is effectively the largest path inside the SVG.
-    /* @__PURE__ */ f.jsx(
-      "span",
-      {
-        ref: r.onArrowChange,
-        style: {
-          position: "absolute",
-          left: r.arrowX,
-          top: r.arrowY,
-          [o]: 0,
-          transformOrigin: {
-            top: "",
-            right: "0 0",
-            bottom: "center 0",
-            left: "100% 0"
-          }[r.placedSide],
-          transform: {
-            top: "translateY(100%)",
-            right: "translateY(50%) rotate(90deg) translateX(-50%)",
-            bottom: "rotate(180deg)",
-            left: "translateY(50%) rotate(-90deg) translateX(50%)"
-          }[r.placedSide],
-          visibility: r.shouldHideArrow ? "hidden" : void 0
-        },
-        children: /* @__PURE__ */ f.jsx(
-          Se,
-          {
-            ...i,
-            ref: a,
-            style: {
-              ...i.style,
-              // ensures the element can be measured correctly (mostly for if SVG)
-              display: "block"
-            }
+      let a = n.split(/\r?\n/), g = Math.max(this.line - 3, 0), p = Math.min(this.line + 2, a.length), x = String(p).length;
+      return a.slice(g, p).map((e, c) => {
+        let o = g + 1 + c, s = " " + (" " + o).slice(-x) + " | ";
+        if (o === this.line) {
+          if (e.length > 160) {
+            let u = 20, C = Math.max(0, this.column - u), E = Math.max(
+              this.column + u,
+              this.endColumn + u
+            ), b = e.slice(C, E), M = i(s.replace(/\d/g, " ")) + e.slice(0, Math.min(this.column - 1, u - 1)).replace(/[^\t]/g, " ");
+            return r(">") + i(s) + l(b) + `
+ ` + M + r("^");
           }
-        )
-      }
-    )
-  );
-});
-Q.displayName = K;
-function Ie(e) {
-  return e !== null;
-}
-var Ye = (e) => ({
-  name: "transformOrigin",
-  options: e,
-  fn(s) {
-    var v, h, C;
-    const { placement: a, rects: t, middlewareData: i } = s, o = ((v = i.arrow) == null ? void 0 : v.centerOffset) !== 0, w = o ? 0 : e.arrowWidth, n = o ? 0 : e.arrowHeight, [p, x] = V(a), m = { start: "0%", center: "50%", end: "100%" }[x], y = (((h = i.arrow) == null ? void 0 : h.x) ?? 0) + w / 2, A = (((C = i.arrow) == null ? void 0 : C.y) ?? 0) + n / 2;
-    let l = "", d = "";
-    return p === "bottom" ? (l = o ? m : `${y}px`, d = `${-n}px`) : p === "top" ? (l = o ? m : `${y}px`, d = `${t.floating.height + n}px`) : p === "right" ? (l = `${-n}px`, d = o ? m : `${A}px`) : p === "left" && (l = `${t.floating.width + n}px`, d = o ? m : `${A}px`), { data: { x: l, y: d } };
+          let y = i(s.replace(/\d/g, " ")) + e.slice(0, this.column - 1).replace(/[^\t]/g, " ");
+          return r(">") + i(s) + l(e) + `
+ ` + y + r("^");
+        }
+        return " " + i(s) + l(e);
+      }).join(`
+`);
+    }
+    toString() {
+      let t = this.showSourceCode();
+      return t && (t = `
+
+` + t + `
+`), this.name + ": " + this.message + t;
+    }
   }
-});
-function V(e) {
-  const [s, a = "center"] = e.split("-");
-  return [s, a];
+  return m = h, h.default = h, m;
 }
-var qe = U, Ge = G, Je = J, Ke = Q;
 export {
-  Ge as Anchor,
-  Ke as Arrow,
-  Je as Content,
-  U as Popper,
-  G as PopperAnchor,
-  Q as PopperArrow,
-  J as PopperContent,
-  qe as Root,
-  Ue as createPopperScope
+  w as __require
 };
 //# sourceMappingURL=index.es661.js.map