bruh 2.0.0-beta.4 → 2.0.0-beta.5

package/dist/types/reactive/index.d.mts

@@ -1,63 +1,81 @@
-export declare const isReactiveSymbol: unique symbol;
-export declare const isReactive: (x: unknown) => x is Reactive<unknown>;
-type Reaction = () => void;
-type StopReacting = () => void;
-export interface Reactive<T> {
-    [isReactiveSymbol]: true;
-    value: T;
-    addReaction(reaction: Reaction): StopReacting;
-}
-export type Unreactive<T = unknown> = Exclude<T, {
-    [isReactiveSymbol]: true;
-}>;
-export type MaybeReactive<T> = Reactive<T> | Unreactive<T>;
-export type NestedReactive<T extends Unreactive> = Reactive<T | NestedReactive<T>>;
-/**
- * A super simple and performant reactive value implementation
- */
-export declare class SimpleReactive<T> implements Reactive<T> {
-    #private;
-    [isReactiveSymbol]: true;
-    constructor(value: T);
-    get value(): T;
-    set value(newValue: T);
-    /**
-     * @param reaction called every time that the value changes
-     * @returns a function that stops the reactions
-     */
-    addReaction(reaction: Reaction): () => boolean;
+interface Observer {
+    weakRef: WeakRef<Observer>;
+    dependencies: Set<Reactive<unknown>>;
+    isDisposed: boolean;
+    markDirty: () => void;
 }
+export declare const untrack: <T extends unknown>(f: () => T) => T;
+export declare const flush: () => void;
+type StopReacting = () => void;
+export type NonReactive<T = unknown> = T extends Reactive<any> ? never : T;
+export type MaybeReactive<T> = Reactive<T> | NonReactive<T>;
+export type NestedReactive<T extends NonReactive> = Reactive<T | NestedReactive<T>>;
 export type IsEqual<T> = {
     bivarianceHack(a: T, b: T): boolean;
 }["bivarianceHack"];
-export type ReactiveOptions<T> = {
+export type SourceOptions<T> = {
     isEqual?: IsEqual<T>;
 };
-export type SourceNode<T> = FunctionalReactive<T, "source">;
-export type DerivativeNode<T> = FunctionalReactive<T, "derivative">;
-/**
- * A reactive implementation for building functional reactive graphs.
- * Ensures state consistency, minimal node updates, and transparent update batching.
- */
-export declare class FunctionalReactive<T, U extends "source" | "derivative" = any> implements Reactive<T> {
-    #private;
-    [isReactiveSymbol]: true;
+export type DerivativeOptions<T> = {
+    memoKey?: () => unknown;
     isEqual?: IsEqual<T>;
-    constructor(value: T, options?: ReactiveOptions<T>);
-    constructor(dependencies: ReadonlyArray<FunctionalReactive<unknown>>, f: () => T, options?: ReactiveOptions<T>);
+};
+export type ReadonlyReactive<T> = {
+    readonly value: T;
+    peek(): T;
+};
+export type WritableReactive<T> = {
+    value: T;
+    peek(): T;
+};
+export type SourceNode<T> = Reactive<T> & WritableReactive<T>;
+export type DerivativeNode<T> = Reactive<T> & ReadonlyReactive<T>;
+export type ReactiveContext = {
+    readonly isTracking: boolean;
+    readonly dependencies: ReadonlyArray<Reactive<unknown>>;
+    readonly stackDepth: number;
+};
+export declare class Reactive<T> {
+    #private;
+    static get context(): ReactiveContext;
+    private constructor();
+    static source<T>(value: T, options?: SourceOptions<T>): SourceNode<T>;
+    static derived<T>(getter: () => T, options?: DerivativeOptions<T>): DerivativeNode<T>;
+    peek(): T;
     get value(): T;
-    set value(newValue: T);
+    set value(next: T);
     /**
-     * @param reaction called every time that the value changes
-     * @returns a function that stops the reactions
+     * @internal
      */
-    addReaction(reaction: Reaction): () => boolean;
+    removeObserver(observer: Observer): void;
+}
+type Cleanup = () => void;
+type WatchOptionsAuto = {};
+type WatchOptionsExplicit = {
+    skipFirst?: boolean;
+};
+type Watch = {
     /**
-     * Apply pending updates from actually changed source nodes
+     * Auto-tracking effect: tracks all .value reads in the callback
      */
-    static applyUpdates(): void;
-}
+    (f: () => void | Cleanup, options?: WatchOptionsAuto): StopReacting;
+    /**
+     * Explicit dependency effect: tracks only the specified dependencies,
+     * runs the callback untracked when any dependency changes
+     */
+    <Dependencies extends ReadonlyArray<Reactive<unknown>>>(dependencies: Dependencies | (() => Dependencies), f: () => void | Cleanup, options?: WatchOptionsExplicit): StopReacting;
+};
+export declare const watch: Watch;
 type R = {
+    /**
+     * A derived node with auto-tracking
+     */
+    <T>(f: () => T, options?: DerivativeOptions<T>): DerivativeNode<T>;
+    /**
+     * A derived node with explicit dependencies:
+     * tracks only the specified dependencies, runs the getter untracked
+     */
+    <T, Dependencies extends ReadonlyArray<Reactive<unknown>>>(dependencies: Dependencies | (() => Dependencies), f: () => T, options?: DerivativeOptions<T>): DerivativeNode<T>;
     /**
      * An initially undefined source node
      */
@@ -65,16 +83,13 @@ type R = {
     /**
      * A source node
      */
-    <T>(value: T, options?: ReactiveOptions<T>): SourceNode<T>;
-    /**
-     * A derived node
-     */
-    <T>(dependencies: ReadonlyArray<FunctionalReactive<unknown>>, f: () => T, options?: ReactiveOptions<T>): DerivativeNode<T>;
+    <T>(value: T, options?: SourceOptions<T>): SourceNode<T>;
 };
 /**
- * A convenient wrapper for FunctionalReactive
+ * A convenient wrapper for Reactive
  */
 export declare const r: R;
+export declare const getValue: <T extends unknown>(x: MaybeReactive<T>) => T;
 type ReactiveDo = {
     /**
      * Calls the given function with the reactive's value whenever it changes
@@ -84,7 +99,7 @@ type ReactiveDo = {
     /**
      * Calls the given function with the value once
      */
-    <T>(value: Unreactive<T>, f: (value: Unreactive<T>) => unknown): undefined;
+    <T>(value: NonReactive<T>, f: (value: NonReactive<T>) => unknown): undefined;
     /**
      * If the value is not reactive, it calls the given function with that value once.
      * If it is a reactive value, it calls the given function with the reactive's value whenever it changes.
@@ -96,5 +111,5 @@ type ReactiveDo = {
  * Do something with a value, updating if it is reactive
  */
 export declare const reactiveDo: ReactiveDo;
-export declare const flat: <T extends Unreactive>(source: NestedReactive<T>) => FunctionalReactive<T>;
+export declare const flat: <T extends unknown>(nested: NestedReactive<T>) => Reactive<T>;
 export {};

package/dist/types/utils/index.d.mts

@@ -1,4 +1,5 @@
 import { LikelyAsString } from '../dom/types.mts';
+export declare const isSameValueZero: (a: unknown, b: unknown) => boolean;
 /**
  * Dispatch a custom event to (capturing) and from (bubbling) a target (usually a DOM node).
  * Returns false if the event was cancelled (preventDefault()) and true otherwise.
@@ -47,11 +48,12 @@ export declare const functionAsObject: <T extends {
 }>(f: <K extends keyof T>(property: K) => T[K]) => T;
 export declare const pick: <T, K extends keyof T>(t: T, ...keys: ReadonlyArray<K>) => Pick<T, K>;
 export declare const omit: <T, K extends keyof T>(t: T, ...keys: ReadonlyArray<K>) => Omit<T, K>;
-export declare const mapObject: <const O extends {}, const K extends keyof O, const V extends O[K], const RK extends PropertyKey, const RV>(o: O, f: ([k, v]: [K, V]) => [RK, RV]) => { [Entry in { [Key in keyof O]: [RK, RV]; }[keyof O] as Entry[0]]: Entry[1]; };
+export declare const mapObject: <O extends Record<PropertyKey, unknown>, RK extends PropertyKey, RV>(o: O, f: (entry: [keyof O, O[keyof O]]) => readonly [RK, RV]) => Record<RK, RV>;
+export declare const mapValues: <O extends Record<PropertyKey, unknown>, RV>(o: O, f: (value: O[keyof O], key: keyof O) => RV) => { [K in keyof O]: RV; };
 export type InvertObject<O extends Record<PropertyKey, PropertyKey>> = {
-    [Entry in {
-        [Key in keyof O]: [O[Key], Key];
-    }[keyof O] as Entry[0]]: Entry[1];
+    [K in O[keyof O]]: {
+        [Key in keyof O]: O[Key] extends K ? Key : never;
+    }[keyof O];
 };
 export declare const invertObject: <const O extends Record<PropertyKey, PropertyKey>>(o: O) => InvertObject<O>;
 export declare const camelToDashCase: (s: string) => string;
@@ -119,4 +121,23 @@ export declare const recursivelySearchFor: <T extends unknown>(x: unknown, f: (v
     path: SearchPath;
     value: T;
 }>;
+export declare const canBeHeldWeakly: (x: unknown) => x is WeakKey;
+/**
+ * A cache that supports nested scope paths with mixed weak/strong segments.
+ * Object/function segments use WeakMap (GC-able), primitives use Map.
+ */
+export declare class NestedCache {
+    #private;
+    get<T>(path: ReadonlyArray<unknown>, compute: () => T): T;
+}
+export declare const memo: <In extends unknown, Out extends unknown>(f: (x: In) => Out, { scope, getKey }?: {
+    /**
+     * Defaults to [f]. Use e.g. [globalThis] to never GC memoized inputs and outputs.
+     */
+    scope?: ReadonlyArray<unknown>;
+    /**
+     * Defaults to the input itself
+     */
+    getKey?: (x: In) => unknown;
+}) => (x: In) => Out;
 export {};

package/dist/utils.mjs

@@ -1,3 +1,8 @@
+const isSameValueZero = (a, b) => {
+  if (typeof a === "number" && typeof b === "number")
+    return a === b || a !== a && b !== b;
+  return a === b;
+};
 const dispatch = (target, type, detail, options) => target.dispatchEvent(
   // Default to behave like most DOM events
   new CustomEvent(type, {
@@ -36,9 +41,12 @@ const omit = (t, ...keys) => {
 const mapObject = (o, f) => Object.fromEntries(
   Object.entries(o).map(f)
 );
-const invertObject = (o) => mapObject(o, ([key, value]) => [value, key]);
-invertObject({ a: 1, b: 2, c: 3 });
-mapObject({ a: 1, b: 2, c: 3 }, ([key, value]) => [value, key]);
+const mapValues = (o, f) => Object.fromEntries(
+  Object.entries(o).map(([k, v]) => [k, f(v, k)])
+);
+const invertObject = (o) => Object.fromEntries(
+  Object.entries(o).map(([k, v]) => [v, k])
+);
 const camelToDashCase = (s) => s.replace(/[A-Z]/g, (c) => "-" + c.toLowerCase());
 const dashToCamelCase = (s) => s.replace(/-[a-z]/g, (dc) => dc[1].toUpperCase());
 const unique = (values, getKey) => {
@@ -270,18 +278,55 @@ const makeFlatRange = (firstNode, isLastNode) => {
   range2.setEndAfter(lastNode);
   return range2;
 };
-const recursivelySearchFor = (x3, f, path = []) => {
-  if (f(x3)) return [{ path, value: x3 }];
-  if (Array.isArray(x3))
-    return x3.flatMap(
-      (y, i) => recursivelySearchFor(y, f, [...path, { parent: x3, key: i, value: y }])
+const recursivelySearchFor = (x, f, path = []) => {
+  if (f(x)) return [{ path, value: x }];
+  if (Array.isArray(x))
+    return x.flatMap(
+      (y, i) => recursivelySearchFor(y, f, [...path, { parent: x, key: i, value: y }])
     );
-  if (x3 !== null && typeof x3 === "object")
-    return Object.entries(x3).flatMap(
-      ([k, v]) => recursivelySearchFor(v, f, [...path, { parent: x3, key: k, value: v }])
+  if (x !== null && typeof x === "object")
+    return Object.entries(x).flatMap(
+      ([k, v]) => recursivelySearchFor(v, f, [...path, { parent: x, key: k, value: v }])
     );
   return [];
 };
+const canBeHeldWeakly = (x) => typeof x === "object" && x !== null || typeof x === "function" || typeof x === "symbol" && Symbol.keyFor(x) === void 0;
+class NestedCache {
+  #root = {};
+  #getOrCreateNode(path) {
+    let node = this.#root;
+    for (const segment of path) {
+      if (canBeHeldWeakly(segment)) {
+        node.weakChildren ??= /* @__PURE__ */ new WeakMap();
+        let child = node.weakChildren.get(segment);
+        if (!child)
+          node.weakChildren.set(segment, child = {});
+        node = child;
+      } else {
+        node.children ??= /* @__PURE__ */ new Map();
+        let child = node.children.get(segment);
+        if (!child)
+          node.children.set(segment, child = {});
+        node = child;
+      }
+    }
+    return node;
+  }
+  get(path, compute) {
+    const node = this.#getOrCreateNode(path);
+    if (!Object.hasOwn(node, "value"))
+      node.value = compute();
+    return node.value;
+  }
+}
+const memoCache = new NestedCache();
+const memo = (f, {
+  scope = [f],
+  getKey
+} = {}) => (x) => memoCache.get(
+  [...scope, getKey ? getKey(x) : x],
+  () => f(x)
+);
 
-export { NodeTreeIterator, attempt, basicLatin, camelToDashCase, concatenateStreams, createDestructable, dashToCamelCase, dispatch, functionAsObject, hash, invertObject, makeFlatRange, makePromiseQueue, makeRandomPassword, mapObject, modifyUrl, omit, originLock, pick, randomId, range, recursivelySearchFor, regexEscape, regexTag, unique, urlTag, urlWithParams };
+export { NestedCache, NodeTreeIterator, attempt, basicLatin, camelToDashCase, canBeHeldWeakly, concatenateStreams, createDestructable, dashToCamelCase, dispatch, functionAsObject, hash, invertObject, isSameValueZero, makeFlatRange, makePromiseQueue, makeRandomPassword, mapObject, mapValues, memo, modifyUrl, omit, originLock, pick, randomId, range, recursivelySearchFor, regexEscape, regexTag, unique, urlTag, urlWithParams };
 //# sourceMappingURL=utils.mjs.map

package/dist/utils.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"utils.mjs","sources":["../src/utils/index.mts"],"sourcesContent":["import type { LikelyAsString } from \"../dom/types.mts\"\n\n/**\n * Dispatch a custom event to (capturing) and from (bubbling) a target (usually a DOM node).\n * Returns false if the event was cancelled (preventDefault()) and true otherwise.\n *\n * Note that this is synchronous\n */\nexport const dispatch = (\n  target: EventTarget,\n  type: string,\n  detail: unknown,\n  options: CustomEventInit\n) =>\n  target.dispatchEvent(\n    // Default to behave like most DOM events\n    new CustomEvent(type, {\n      detail,\n      bubbles: true,\n      cancelable: true,\n      composed: true,\n      ...options\n    })\n  )\n\n/**\n * Inspired by https://antfu.me/posts/destructuring-with-object-or-array#take-away\n *\n * Creates an object that is both destructable with {...} and [...]\n *\n * Useful for writing library functions à la react-use & vueuse\n *\n * @example\n * ```typescript\n * const useExample = () => {\n *   const a = \"a\"\n *   const b = \"b\"\n *   return createDestructable(\n *     { a, b },\n *     [ a, b ]\n *   )\n * }\n *\n * const { a, b } = useExample()\n * // or\n * const [ a, b ] = useExample()\n * ```\n */\nexport const createDestructable = <\n  const T extends {},\n  const U extends Iterable<unknown>\n>(\n  object: T,\n  iterable: U\n) => {\n  const destructable = {\n    ...object,\n    [Symbol.iterator]: () => iterable[Symbol.iterator]()\n  }\n\n  Object.defineProperty(destructable, Symbol.iterator, {\n    enumerable: false\n  })\n\n  return destructable as T & U\n}\n\n/**\n * Creates an object (as a Proxy) that acts as a function\n *\n * So functionAsObject(f).property is equivalent to f(\"property\")\n *\n * This is can be useful when combined with destructuring syntax\n *\n * @example\n * ```typescript\n * const { html, head, title, body, main, h1, p } = functionAsObject(e)\n * ```\n */\nexport const functionAsObject = <T extends { [input: PropertyKey]: any }>(\n  f: <K extends keyof T>(property: K) => T[K]\n) =>\n  new Proxy({}, {\n    get: (_, property) => f(property)\n  }) as T\n\nexport const pick = <T, K extends keyof T>(t: T, ...keys: ReadonlyArray<K>) => {\n  const picked = {} as Pick<T, K>\n\n  for (const key of keys)\n    picked[key] = t[key]\n\n  return picked\n}\n\nexport const omit = <T, K extends keyof T>(t: T, ...keys: ReadonlyArray<K>) => {\n  const unomitted: Partial<T> = { ...t }\n\n  for (const key of keys)\n    delete unomitted[key]\n\n  return unomitted as Omit<T, K>\n}\n\nexport const mapObject = <\n  const O extends {},\n  const K extends keyof O,\n  const V extends O[K],\n  const RK extends PropertyKey,\n  const RV\n>(\n  o: O,\n  f: ([k, v]: [K, V]) => [RK, RV]\n): {\n  [\n    Entry in\n    { [Key in keyof O]: [RK, RV] }[keyof O]\n    as Entry[0]\n  ]: Entry[1]\n} =>\n  Object.fromEntries(\n    Object.entries(o).map(f as any) as any\n  ) as any\n\nexport type InvertObject<O extends Record<PropertyKey, PropertyKey>> = {\n  [\n    Entry in\n    { [Key in keyof O]: [O[Key], Key] }[keyof O]\n    as Entry[0]\n  ]: Entry[1]\n}\n\nexport const invertObject = <const O extends Record<PropertyKey, PropertyKey>>(o: O): InvertObject<O> =>\n  mapObject(o, ([key, value]) => [value, key] as const)\n\nconst x = invertObject({ a: 1, b: 2, c: 3 })\ntype X = typeof x\n\nconst x2 = mapObject({ a: 1, b: 2, c: 3 }, ([key, value]) => [value, key] as const)\ntype X2 = typeof x2\n\nexport const camelToDashCase = (s: string) =>\n  s.replace(/[A-Z]/g, c => \"-\" + c.toLowerCase())\n\nexport const dashToCamelCase = (s: string) =>\n  s.replace(/-[a-z]/g, dc => dc[1].toUpperCase())\n\nexport const unique = <T, K>(\n  values: Iterable<T>,\n  getKey?: (value: T) => K\n) => {\n  if (!getKey)\n    return [...new Set(values)]\n\n  const seen = new Map<K, T>()\n  for (const value of values) {\n    const key = getKey(value)\n    if (!seen.has(key))\n      seen.set(key, value)\n  }\n  return [...seen.values()]\n}\n\nconst report = (e: unknown) => {\n  console.error(e)\n}\nexport const attempt: {\n  <T, R = undefined>(f: () => T, recover?: (e: unknown) => R): T | R,\n  <T, R = undefined>(f: () => Promise<T>, recover?: (e: unknown) => R): Promise<T | R>\n} = <T extends unknown>(f: () => T | Promise<T>, recover = report) => {\n  try {\n    const result = f()\n\n    if (result instanceof Promise)\n      return result.catch(recover)\n\n    return result\n  }\n  catch (e) {\n    return recover(e)\n  }\n}\n\ntype FulfilledSelfReferencingPromise<T extends unknown> =\n  Promise<\n    {\n      promise: FulfilledSelfReferencingPromise<T>,\n      settled: {\n        status: \"fulfilled\",\n        value: T\n      }\n    }\n  >\n\ntype RejectedSelfReferencingPromise<E extends unknown> =\n  Promise<\n    {\n      promise: RejectedSelfReferencingPromise<E>,\n      settled: {\n        status: \"rejected\",\n        reason: E\n      }\n    }\n  >\n\ntype SelfReferencingPromise<T extends unknown, E extends unknown> =\n  | FulfilledSelfReferencingPromise<T>\n  | RejectedSelfReferencingPromise<E>\n\nexport const makePromiseQueue = <T extends unknown, E extends unknown>() => {\n  const queue = new Set<SelfReferencingPromise<T, E>>()\n\n  const enqueue = (promise: Promise<T>) => {\n    const recursivePromise = promise\n      .then(resolved => ({\n        promise: recursivePromise,\n        settled: {\n          status: \"fulfilled\",\n          value: resolved\n        }\n      }))\n      .catch(rejected => ({\n        promise: recursivePromise,\n        settled: {\n          status: \"rejected\",\n          reason: rejected as E\n        }\n      })) as SelfReferencingPromise<T, E>\n\n    queue.add(recursivePromise)\n  }\n\n  const dequeue = async () => {\n    const { promise, settled } = await Promise.race<SelfReferencingPromise<T, E>>(queue)\n    queue.delete(promise)\n    return settled\n  }\n\n  return {\n    enqueue,\n\n    async * [Symbol.asyncIterator]() {\n      while (queue.size)\n        yield await dequeue()\n    }\n  }\n}\n\nexport const concatenateStreams = async <T extends any>(streams: ReadonlyArray<ReadableStream<T>>) => {\n  const { readable, writable } = new TransformStream<T, T>()\n\n  for (let i = 0; i < streams.length; i++)\n    await streams[i].pipeTo(writable, { preventClose: i + 1 !== streams.length })\n\n  return readable\n}\n\nexport const originLock = async (name: string, options: LockOptions = {}) => {\n  const { promise: lockAquiredPromise,  resolve: lockAquired } = Promise.withResolvers<void>()\n  const { promise: lockReleasedPromise, resolve: releaseLock } = Promise.withResolvers<void>()\n\n  try {\n    navigator.locks.request(name, options, () => {\n      lockAquired()\n      return lockReleasedPromise\n    })\n  } catch {}\n\n  await lockAquiredPromise\n\n  return () => {\n    releaseLock()\n  }\n}\n\nexport const range = (from: number, to: number, stepSize = 1) => {\n  const sign = Math.sign(to - from)\n  if (sign === 0)\n    return []\n\n  const result: number[] = []\n  for (let n = from; n < to; n += sign * stepSize)\n    result.push(n)\n  return result\n}\n\nexport const randomId = () =>\n  Math.random().toString(36).slice(2)\n\nexport const basicLatin = String.fromCharCode(...range(32, 127))\n\nexport const makeRandomPassword = ({\n  length = 32,\n  characters = basicLatin\n}: {\n  /** Max 256 */\n  length?: number,\n  characters?: string | ReadonlyArray<string>\n} = {}) => {\n  const entropyPerCharacter = 8\n  const statesPerCharacter = 2 ** entropyPerCharacter\n\n  if (characters.length > statesPerCharacter)\n    throw new Error(`Character count (${characters.length}) must not exceed 2^8 (256)`)\n\n  const limit = statesPerCharacter - (statesPerCharacter % characters.length)\n\n  const randomValuesUnderLimit: number[] = []\n  while (randomValuesUnderLimit.length < length) {\n    const randomValues = crypto.getRandomValues(\n      new Uint8Array(length - randomValuesUnderLimit.length)\n    )\n    for (const randomValue of randomValues)\n      if (randomValue < limit)\n        randomValuesUnderLimit.push(randomValue)\n  }\n\n  let result = \"\"\n  for (const n of randomValuesUnderLimit)\n    result += characters[n % characters.length]\n  return result\n}\n\nexport const hash = async (\n  data: string | BufferSource,\n  algorithm: AlgorithmIdentifier = \"SHA-256\"\n) => {\n  if (typeof data === \"string\")\n    data = new TextEncoder().encode(data)\n\n  const bytes = new Uint8Array(\n    await crypto.subtle.digest(algorithm, data)\n  )\n\n  let result = \"\"\n  for (const byte of bytes)\n    result += byte.toString(16).padStart(2, \"0\")\n  return result\n}\n\n/**\n * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Regular_expressions#escaping\n */\nexport const regexEscape = (s: string) => s.replace(/[.*+?^${}()|[\\]\\\\]/g, \"\\\\$&\")\n\nexport const regexTag = (\n\tstrings: TemplateStringsArray,\n\t...substitutions: ReadonlyArray<unknown>\n) => {\n\tlet result = \"\"\n\tfor (let i = 0; i < strings.length; i++)\n\t\tresult += strings.raw[i] + regexEscape((substitutions[i] ?? \"\") + \"\")\n\treturn (flags?: string) => new RegExp(result, flags)\n}\n\nexport const urlTag = (strings: TemplateStringsArray, ...substitutions: ReadonlyArray<unknown>) => {\n\tlet result = \"\"\n\tfor (let i = 0; i < strings.length; i++)\n\t\tresult += strings[i] + encodeURIComponent((substitutions[i] ?? \"\") + \"\")\n\treturn result\n}\n\ntype UrlParts = {\n\tpathname: string\n\tsearch: string\n\thash: string\n}\nexport const modifyUrl = (url: URL | string, f: (parts: UrlParts) => Partial<UrlParts>) => {\n\ttry {\n\t\tconst result = new URL(url)\n\t\tObject.assign(result, f(result))\n\t\treturn result.href\n\t} catch {}\n\n\tconst match = (url as string).match(/(.*?)(\\?[^#\\n]*)?(#.*)?$/m)\n\tif (!match)\n    return url as string\n\n\tconst [, pathname = \"\", search = \"\", hash = \"\"] = match\n\n\tconst inputParts = { pathname, search, hash }\n\tconst parts = { ...inputParts, ...f(inputParts) }\n\treturn (\n\t\tparts.pathname +\n\t\t(parts.search ? \"?\" + parts.search.replace(/^\\?/m, \"\") : \"\") +\n\t\t(parts.hash ? \"#\" + encodeURIComponent(parts.hash.replace(/^#/m, \"\")) : \"\")\n\t)\n}\n\nexport const urlWithParams = (\n\turl: URL | string,\n\tsearchParameters?: Record<string, LikelyAsString | ReadonlyArray<LikelyAsString> | undefined>\n) =>\n\tmodifyUrl(url, ({ search }) => {\n\t\tconst searchParams = new URLSearchParams(search)\n\n\t\tfor (const key in searchParameters) {\n\t\t\tsearchParams.delete(key)\n\t\t\tconst valueOrValues = searchParameters[key]\n\t\t\tif (valueOrValues === undefined) continue\n\n\t\t\tif (Array.isArray(valueOrValues))\n\t\t\t\tfor (const value of valueOrValues as ReadonlyArray<LikelyAsString>)\n\t\t\t\t\tsearchParams.append(key, value + \"\")\n\t\t\telse\n        searchParams.append(key, (valueOrValues as LikelyAsString) + \"\")\n\t\t}\n\t\tsearchParams.sort()\n\n\t\treturn { search: searchParams.toString() }\n\t})\n\nexport class NodeTreeIterator implements IterableIterator<Node> {\n  #root: ParentNode\n  #current: Node\n  #filter?: (node: Node) => boolean\n\n  constructor(root: ParentNode, filter?: (node: Node) => boolean) {\n    this.#current = this.#root = root\n    this.#filter = filter\n  }\n\n  #isSkipping = false\n  /** Skip descendents of the current node */\n  skip() {\n    this.#isSkipping = true\n  }\n\n  #next() {\n    let current = this.#current\n    while (true) {\n      const isSkipping = this.#isSkipping\n      this.#isSkipping = false\n\n      if (!isSkipping && current.firstChild) {\n        current = current.firstChild\n      }\n      else if (current.nextSibling) {\n        if (current === this.#root)\n          return\n\n        current = current.nextSibling\n      }\n      else {\n        while (true) {\n          if (!current.parentNode || current === this.#root)\n            return\n\n          const parent = current.parentNode\n          if (parent === this.#root)\n            return\n\n          if (parent.nextSibling) {\n            current = parent.nextSibling\n            break\n          }\n          else {\n            current = parent\n          }\n        }\n      }\n\n      if (!this.#filter || this.#filter(current))\n        return this.#current = current\n    }\n  }\n\n  next() {\n    const value = this.#next()\n    return { done: !value, value } as\n      | { done: false, value: Node }\n      | { done: true,  value: undefined }\n  }\n\n  [Symbol.iterator]() {\n    return this\n  }\n}\n\nexport const makeFlatRange = (firstNode: ChildNode, isLastNode: (node: ChildNode) => boolean) => {\n\tconst range = firstNode.ownerDocument!.createRange()\n\n\trange.setStartBefore(firstNode)\n\n\tlet lastNode: ChildNode\n\tfor (\n\t\tlet currentNode: ChildNode | null = firstNode;\n\t\t(currentNode = currentNode.nextSibling);\n\t\tcurrentNode\n\t) {\n\t\tif (isLastNode(currentNode)) {\n\t\t\tlastNode = currentNode\n\t\t\tbreak\n\t\t}\n\t}\n\tlastNode ??= firstNode.parentNode!.lastChild!\n\n\trange.setEndAfter(lastNode)\n\n\treturn range\n}\n\ntype SearchPath = ReadonlyArray<{\n  parent: {},\n  key: PropertyKey,\n  value: unknown\n}>\n\nexport const recursivelySearchFor = <T extends unknown>(\n\tx: unknown,\n\tf: (value: unknown) => value is T,\n\tpath: SearchPath = []\n): ReadonlyArray<{ path: SearchPath, value: T }> => {\n\tif (f(x)) return [{ path, value: x }]\n\n\tif (Array.isArray(x))\n\t\treturn x.flatMap((y, i) =>\n\t\t\trecursivelySearchFor(y, f, [...path, { parent: x, key: i, value: y }])\n\t\t)\n\n\tif (x !== null && typeof x === \"object\")\n\t\treturn Object.entries(x).flatMap(([k, v]) =>\n\t\t\trecursivelySearchFor(v, f, [...path, { parent: x, key: k, value: v }])\n\t\t)\n\n\treturn []\n}\n"],"names":["hash","range","x"],"mappings":"AAQO,MAAM,WAAW,CACtB,MAAA,EACA,IACA,EAAA,MAAA,EACA,YAEA,MAAO,CAAA,aAAA;AAAA;AAAA,EAEL,IAAI,YAAY,IAAM,EAAA;AAAA,IACpB,MAAA;AAAA,IACA,OAAS,EAAA,IAAA;AAAA,IACT,UAAY,EAAA,IAAA;AAAA,IACZ,QAAU,EAAA,IAAA;AAAA,IACV,GAAG;AAAA,GACJ;AACH;AAyBW,MAAA,kBAAA,GAAqB,CAIhC,MAAA,EACA,QACG,KAAA;AACH,EAAA,MAAM,YAAe,GAAA;AAAA,IACnB,GAAG,MAAA;AAAA,IACH,CAAC,OAAO,QAAQ,GAAG,MAAM,QAAS,CAAA,MAAA,CAAO,QAAQ,CAAE;AAAA,GACrD;AAEA,EAAO,MAAA,CAAA,cAAA,CAAe,YAAc,EAAA,MAAA,CAAO,QAAU,EAAA;AAAA,IACnD,UAAY,EAAA;AAAA,GACb,CAAA;AAED,EAAO,OAAA,YAAA;AACT;AAcO,MAAM,mBAAmB,CAC9B,CAAA,KAEA,IAAI,KAAA,CAAM,EAAI,EAAA;AAAA,EACZ,GAAK,EAAA,CAAC,CAAG,EAAA,QAAA,KAAa,EAAE,QAAQ;AAClC,CAAC;AAEU,MAAA,IAAA,GAAO,CAAuB,CAAA,EAAA,GAAS,IAA2B,KAAA;AAC7E,EAAA,MAAM,SAAS,EAAC;AAEhB,EAAA,KAAA,MAAW,GAAO,IAAA,IAAA;AAChB,IAAO,MAAA,CAAA,GAAG,CAAI,GAAA,CAAA,CAAE,GAAG,CAAA;AAErB,EAAO,OAAA,MAAA;AACT;AAEa,MAAA,IAAA,GAAO,CAAuB,CAAA,EAAA,GAAS,IAA2B,KAAA;AAC7E,EAAM,MAAA,SAAA,GAAwB,EAAE,GAAG,CAAE,EAAA;AAErC,EAAA,KAAA,MAAW,GAAO,IAAA,IAAA;AAChB,IAAA,OAAO,UAAU,GAAG,CAAA;AAEtB,EAAO,OAAA,SAAA;AACT;AAEO,MAAM,SAAY,GAAA,CAOvB,CACA,EAAA,CAAA,KAQA,MAAO,CAAA,WAAA;AAAA,EACL,MAAO,CAAA,OAAA,CAAQ,CAAC,CAAA,CAAE,IAAI,CAAQ;AAChC;AAUK,MAAM,YAAe,GAAA,CAAmD,CAC7E,KAAA,SAAA,CAAU,CAAG,EAAA,CAAC,CAAC,GAAA,EAAK,KAAK,CAAA,KAAM,CAAC,KAAA,EAAO,GAAG,CAAU;AAE5C,aAAa,EAAE,CAAA,EAAG,GAAG,CAAG,EAAA,CAAA,EAAG,CAAG,EAAA,CAAA,EAAG;AAGhC,SAAU,CAAA,EAAE,GAAG,CAAG,EAAA,CAAA,EAAG,GAAG,CAAG,EAAA,CAAA,EAAK,EAAA,CAAC,CAAC,GAAK,EAAA,KAAK,MAAM,CAAC,KAAA,EAAO,GAAG,CAAU;AAGrE,MAAA,eAAA,GAAkB,CAAC,CAAA,KAC9B,CAAE,CAAA,OAAA,CAAQ,UAAU,CAAK,CAAA,KAAA,GAAA,GAAM,CAAE,CAAA,WAAA,EAAa;AAEnC,MAAA,eAAA,GAAkB,CAAC,CAAA,KAC9B,CAAE,CAAA,OAAA,CAAQ,SAAW,EAAA,CAAA,EAAA,KAAM,EAAG,CAAA,CAAC,CAAE,CAAA,WAAA,EAAa;AAEnC,MAAA,MAAA,GAAS,CACpB,MAAA,EACA,MACG,KAAA;AACH,EAAA,IAAI,CAAC,MAAA;AACH,IAAA,OAAO,CAAC,GAAG,IAAI,GAAA,CAAI,MAAM,CAAC,CAAA;AAE5B,EAAM,MAAA,IAAA,uBAAW,GAAU,EAAA;AAC3B,EAAA,KAAA,MAAW,SAAS,MAAQ,EAAA;AAC1B,IAAM,MAAA,GAAA,GAAM,OAAO,KAAK,CAAA;AACxB,IAAI,IAAA,CAAC,IAAK,CAAA,GAAA,CAAI,GAAG,CAAA;AACf,MAAK,IAAA,CAAA,GAAA,CAAI,KAAK,KAAK,CAAA;AAAA;AAEvB,EAAA,OAAO,CAAC,GAAG,IAAK,CAAA,MAAA,EAAQ,CAAA;AAC1B;AAEA,MAAM,MAAA,GAAS,CAAC,CAAe,KAAA;AAC7B,EAAA,OAAA,CAAQ,MAAM,CAAC,CAAA;AACjB,CAAA;AACO,MAAM,OAGT,GAAA,CAAoB,CAAyB,EAAA,OAAA,GAAU,MAAW,KAAA;AACpE,EAAI,IAAA;AACF,IAAA,MAAM,SAAS,CAAE,EAAA;AAEjB,IAAA,IAAI,MAAkB,YAAA,OAAA;AACpB,MAAO,OAAA,MAAA,CAAO,MAAM,OAAO,CAAA;AAE7B,IAAO,OAAA,MAAA;AAAA,WAEF,CAAG,EAAA;AACR,IAAA,OAAO,QAAQ,CAAC,CAAA;AAAA;AAEpB;AA4BO,MAAM,mBAAmB,MAA4C;AAC1E,EAAM,MAAA,KAAA,uBAAY,GAAkC,EAAA;AAEpD,EAAM,MAAA,OAAA,GAAU,CAAC,OAAwB,KAAA;AACvC,IAAM,MAAA,gBAAA,GAAmB,OACtB,CAAA,IAAA,CAAK,CAAa,QAAA,MAAA;AAAA,MACjB,OAAS,EAAA,gBAAA;AAAA,MACT,OAAS,EAAA;AAAA,QACP,MAAQ,EAAA,WAAA;AAAA,QACR,KAAO,EAAA;AAAA;AACT,KACF,CAAE,CACD,CAAA,KAAA,CAAM,CAAa,QAAA,MAAA;AAAA,MAClB,OAAS,EAAA,gBAAA;AAAA,MACT,OAAS,EAAA;AAAA,QACP,MAAQ,EAAA,UAAA;AAAA,QACR,MAAQ,EAAA;AAAA;AACV,KACA,CAAA,CAAA;AAEJ,IAAA,KAAA,CAAM,IAAI,gBAAgB,CAAA;AAAA,GAC5B;AAEA,EAAA,MAAM,UAAU,YAAY;AAC1B,IAAA,MAAM,EAAE,OAAS,EAAA,OAAA,KAAY,MAAM,OAAA,CAAQ,KAAmC,KAAK,CAAA;AACnF,IAAA,KAAA,CAAM,OAAO,OAAO,CAAA;AACpB,IAAO,OAAA,OAAA;AAAA,GACT;AAEA,EAAO,OAAA;AAAA,IACL,OAAA;AAAA,IAEA,QAAS,MAAO,CAAA,aAAa,CAAI,GAAA;AAC/B,MAAA,OAAO,KAAM,CAAA,IAAA;AACX,QAAA,MAAM,MAAM,OAAQ,EAAA;AAAA;AACxB,GACF;AACF;AAEa,MAAA,kBAAA,GAAqB,OAAsB,OAA8C,KAAA;AACpG,EAAA,MAAM,EAAE,QAAA,EAAU,QAAS,EAAA,GAAI,IAAI,eAAsB,EAAA;AAEzD,EAAA,KAAA,IAAS,CAAI,GAAA,CAAA,EAAG,CAAI,GAAA,OAAA,CAAQ,MAAQ,EAAA,CAAA,EAAA;AAClC,IAAM,MAAA,OAAA,CAAQ,CAAC,CAAA,CAAE,MAAO,CAAA,QAAA,EAAU,EAAE,YAAA,EAAc,CAAI,GAAA,CAAA,KAAM,OAAQ,CAAA,MAAA,EAAQ,CAAA;AAE9E,EAAO,OAAA,QAAA;AACT;AAEO,MAAM,UAAa,GAAA,OAAO,IAAc,EAAA,OAAA,GAAuB,EAAO,KAAA;AAC3E,EAAA,MAAM,EAAE,OAAS,EAAA,kBAAA,EAAqB,SAAS,WAAY,EAAA,GAAI,QAAQ,aAAoB,EAAA;AAC3F,EAAA,MAAM,EAAE,OAAS,EAAA,mBAAA,EAAqB,SAAS,WAAY,EAAA,GAAI,QAAQ,aAAoB,EAAA;AAE3F,EAAI,IAAA;AACF,IAAA,SAAA,CAAU,KAAM,CAAA,OAAA,CAAQ,IAAM,EAAA,OAAA,EAAS,MAAM;AAC3C,MAAY,WAAA,EAAA;AACZ,MAAO,OAAA,mBAAA;AAAA,KACR,CAAA;AAAA,GACK,CAAA,MAAA;AAAA;AAER,EAAM,MAAA,kBAAA;AAEN,EAAA,OAAO,MAAM;AACX,IAAY,WAAA,EAAA;AAAA,GACd;AACF;AAEO,MAAM,KAAQ,GAAA,CAAC,IAAc,EAAA,EAAA,EAAY,WAAW,CAAM,KAAA;AAC/D,EAAA,MAAM,IAAO,GAAA,IAAA,CAAK,IAAK,CAAA,EAAA,GAAK,IAAI,CAAA;AAChC,EAAA,IAAI,IAAS,KAAA,CAAA;AACX,IAAA,OAAO,EAAC;AAEV,EAAA,MAAM,SAAmB,EAAC;AAC1B,EAAA,KAAA,IAAS,CAAI,GAAA,IAAA,EAAM,CAAI,GAAA,EAAA,EAAI,KAAK,IAAO,GAAA,QAAA;AACrC,IAAA,MAAA,CAAO,KAAK,CAAC,CAAA;AACf,EAAO,OAAA,MAAA;AACT;AAEa,MAAA,QAAA,GAAW,MACtB,IAAK,CAAA,MAAA,GAAS,QAAS,CAAA,EAAE,CAAE,CAAA,KAAA,CAAM,CAAC;AAE7B,MAAM,aAAa,MAAO,CAAA,YAAA,CAAa,GAAG,KAAM,CAAA,EAAA,EAAI,GAAG,CAAC;AAExD,MAAM,qBAAqB,CAAC;AAAA,EACjC,MAAS,GAAA,EAAA;AAAA,EACT,UAAa,GAAA;AACf,CAAA,GAII,EAAO,KAAA;AACT,EAAA,MAAM,mBAAsB,GAAA,CAAA;AAC5B,EAAA,MAAM,qBAAqB,CAAK,IAAA,mBAAA;AAEhC,EAAA,IAAI,WAAW,MAAS,GAAA,kBAAA;AACtB,IAAA,MAAM,IAAI,KAAA,CAAM,CAAoB,iBAAA,EAAA,UAAA,CAAW,MAAM,CAA6B,2BAAA,CAAA,CAAA;AAEpF,EAAM,MAAA,KAAA,GAAQ,kBAAsB,GAAA,kBAAA,GAAqB,UAAW,CAAA,MAAA;AAEpE,EAAA,MAAM,yBAAmC,EAAC;AAC1C,EAAO,OAAA,sBAAA,CAAuB,SAAS,MAAQ,EAAA;AAC7C,IAAA,MAAM,eAAe,MAAO,CAAA,eAAA;AAAA,MAC1B,IAAI,UAAA,CAAW,MAAS,GAAA,sBAAA,CAAuB,MAAM;AAAA,KACvD;AACA,IAAA,KAAA,MAAW,WAAe,IAAA,YAAA;AACxB,MAAA,IAAI,WAAc,GAAA,KAAA;AAChB,QAAA,sBAAA,CAAuB,KAAK,WAAW,CAAA;AAAA;AAG7C,EAAA,IAAI,MAAS,GAAA,EAAA;AACb,EAAA,KAAA,MAAW,CAAK,IAAA,sBAAA;AACd,IAAU,MAAA,IAAA,UAAA,CAAW,CAAI,GAAA,UAAA,CAAW,MAAM,CAAA;AAC5C,EAAO,OAAA,MAAA;AACT;AAEO,MAAM,IAAO,GAAA,OAClB,IACA,EAAA,SAAA,GAAiC,SAC9B,KAAA;AACH,EAAA,IAAI,OAAO,IAAS,KAAA,QAAA;AAClB,IAAA,IAAA,GAAO,IAAI,WAAA,EAAc,CAAA,MAAA,CAAO,IAAI,CAAA;AAEtC,EAAA,MAAM,QAAQ,IAAI,UAAA;AAAA,IAChB,MAAM,MAAA,CAAO,MAAO,CAAA,MAAA,CAAO,WAAW,IAAI;AAAA,GAC5C;AAEA,EAAA,IAAI,MAAS,GAAA,EAAA;AACb,EAAA,KAAA,MAAW,IAAQ,IAAA,KAAA;AACjB,IAAA,MAAA,IAAU,KAAK,QAAS,CAAA,EAAE,CAAE,CAAA,QAAA,CAAS,GAAG,GAAG,CAAA;AAC7C,EAAO,OAAA,MAAA;AACT;AAKO,MAAM,cAAc,CAAC,CAAA,KAAc,CAAE,CAAA,OAAA,CAAQ,uBAAuB,MAAM;AAEpE,MAAA,QAAA,GAAW,CACvB,OAAA,EAAA,GACG,aACC,KAAA;AACJ,EAAA,IAAI,MAAS,GAAA,EAAA;AACb,EAAA,KAAA,IAAS,CAAI,GAAA,CAAA,EAAG,CAAI,GAAA,OAAA,CAAQ,MAAQ,EAAA,CAAA,EAAA;AACnC,IAAU,MAAA,IAAA,OAAA,CAAQ,IAAI,CAAC,CAAA,GAAI,aAAa,aAAc,CAAA,CAAC,CAAK,IAAA,EAAA,IAAM,EAAE,CAAA;AACrE,EAAA,OAAO,CAAC,KAAA,KAAmB,IAAI,MAAA,CAAO,QAAQ,KAAK,CAAA;AACpD;AAEa,MAAA,MAAA,GAAS,CAAC,OAAA,EAAA,GAAkC,aAA0C,KAAA;AAClG,EAAA,IAAI,MAAS,GAAA,EAAA;AACb,EAAA,KAAA,IAAS,CAAI,GAAA,CAAA,EAAG,CAAI,GAAA,OAAA,CAAQ,MAAQ,EAAA,CAAA,EAAA;AACnC,IAAU,MAAA,IAAA,OAAA,CAAQ,CAAC,CAAI,GAAA,kBAAA,CAAA,CAAoB,cAAc,CAAC,CAAA,IAAK,MAAM,EAAE,CAAA;AACxE,EAAO,OAAA,MAAA;AACR;AAOa,MAAA,SAAA,GAAY,CAAC,GAAA,EAAmB,CAA8C,KAAA;AAC1F,EAAI,IAAA;AACH,IAAM,MAAA,MAAA,GAAS,IAAI,GAAA,CAAI,GAAG,CAAA;AAC1B,IAAA,MAAA,CAAO,MAAO,CAAA,MAAA,EAAQ,CAAE,CAAA,MAAM,CAAC,CAAA;AAC/B,IAAA,OAAO,MAAO,CAAA,IAAA;AAAA,GACP,CAAA,MAAA;AAAA;AAER,EAAM,MAAA,KAAA,GAAS,GAAe,CAAA,KAAA,CAAM,2BAA2B,CAAA;AAC/D,EAAA,IAAI,CAAC,KAAA;AACF,IAAO,OAAA,GAAA;AAEV,EAAM,MAAA,GAAG,QAAW,GAAA,EAAA,EAAI,SAAS,EAAIA,EAAAA,KAAAA,GAAO,EAAE,CAAI,GAAA,KAAA;AAElD,EAAA,MAAM,UAAa,GAAA,EAAE,QAAU,EAAA,MAAA,EAAQ,MAAAA,KAAK,EAAA;AAC5C,EAAA,MAAM,QAAQ,EAAE,GAAG,YAAY,GAAG,CAAA,CAAE,UAAU,CAAE,EAAA;AAChD,EACC,OAAA,KAAA,CAAM,YACL,KAAM,CAAA,MAAA,GAAS,MAAM,KAAM,CAAA,MAAA,CAAO,OAAQ,CAAA,MAAA,EAAQ,EAAE,CAAA,GAAI,OACxD,KAAM,CAAA,IAAA,GAAO,MAAM,kBAAmB,CAAA,KAAA,CAAM,KAAK,OAAQ,CAAA,KAAA,EAAO,EAAE,CAAC,CAAI,GAAA,EAAA,CAAA;AAE1E;AAEa,MAAA,aAAA,GAAgB,CAC5B,GACA,EAAA,gBAAA,KAEA,UAAU,GAAK,EAAA,CAAC,EAAE,MAAA,EAAa,KAAA;AAC9B,EAAM,MAAA,YAAA,GAAe,IAAI,eAAA,CAAgB,MAAM,CAAA;AAE/C,EAAA,KAAA,MAAW,OAAO,gBAAkB,EAAA;AACnC,IAAA,YAAA,CAAa,OAAO,GAAG,CAAA;AACvB,IAAM,MAAA,aAAA,GAAgB,iBAAiB,GAAG,CAAA;AAC1C,IAAA,IAAI,kBAAkB,MAAW,EAAA;AAEjC,IAAI,IAAA,KAAA,CAAM,QAAQ,aAAa,CAAA;AAC9B,MAAA,KAAA,MAAW,KAAS,IAAA,aAAA;AACnB,QAAa,YAAA,CAAA,MAAA,CAAO,GAAK,EAAA,KAAA,GAAQ,EAAE,CAAA;AAAA;AAEhC,MAAa,YAAA,CAAA,MAAA,CAAO,GAAM,EAAA,aAAA,GAAmC,EAAE,CAAA;AAAA;AAErE,EAAA,YAAA,CAAa,IAAK,EAAA;AAElB,EAAA,OAAO,EAAE,MAAA,EAAQ,YAAa,CAAA,QAAA,EAAW,EAAA;AAC1C,CAAC;AAEK,MAAM,gBAAmD,CAAA;AAAA,EAC9D,KAAA;AAAA,EACA,QAAA;AAAA,EACA,OAAA;AAAA,EAEA,WAAA,CAAY,MAAkB,MAAkC,EAAA;AAC9D,IAAK,IAAA,CAAA,QAAA,GAAW,KAAK,KAAQ,GAAA,IAAA;AAC7B,IAAA,IAAA,CAAK,OAAU,GAAA,MAAA;AAAA;AACjB,EAEA,WAAc,GAAA,KAAA;AAAA;AAAA,EAEd,IAAO,GAAA;AACL,IAAA,IAAA,CAAK,WAAc,GAAA,IAAA;AAAA;AACrB,EAEA,KAAQ,GAAA;AACN,IAAA,IAAI,UAAU,IAAK,CAAA,QAAA;AACnB,IAAA,OAAO,IAAM,EAAA;AACX,MAAA,MAAM,aAAa,IAAK,CAAA,WAAA;AACxB,MAAA,IAAA,CAAK,WAAc,GAAA,KAAA;AAEnB,MAAI,IAAA,CAAC,UAAc,IAAA,OAAA,CAAQ,UAAY,EAAA;AACrC,QAAA,OAAA,GAAU,OAAQ,CAAA,UAAA;AAAA,OACpB,MAAA,IACS,QAAQ,WAAa,EAAA;AAC5B,QAAA,IAAI,YAAY,IAAK,CAAA,KAAA;AACnB,UAAA;AAEF,QAAA,OAAA,GAAU,OAAQ,CAAA,WAAA;AAAA,OAEf,MAAA;AACH,QAAA,OAAO,IAAM,EAAA;AACX,UAAA,IAAI,CAAC,OAAA,CAAQ,UAAc,IAAA,OAAA,KAAY,IAAK,CAAA,KAAA;AAC1C,YAAA;AAEF,UAAA,MAAM,SAAS,OAAQ,CAAA,UAAA;AACvB,UAAA,IAAI,WAAW,IAAK,CAAA,KAAA;AAClB,YAAA;AAEF,UAAA,IAAI,OAAO,WAAa,EAAA;AACtB,YAAA,OAAA,GAAU,MAAO,CAAA,WAAA;AACjB,YAAA;AAAA,WAEG,MAAA;AACH,YAAU,OAAA,GAAA,MAAA;AAAA;AACZ;AACF;AAGF,MAAA,IAAI,CAAC,IAAA,CAAK,OAAW,IAAA,IAAA,CAAK,QAAQ,OAAO,CAAA;AACvC,QAAA,OAAO,KAAK,QAAW,GAAA,OAAA;AAAA;AAC3B;AACF,EAEA,IAAO,GAAA;AACL,IAAM,MAAA,KAAA,GAAQ,KAAK,KAAM,EAAA;AACzB,IAAA,OAAO,EAAE,IAAA,EAAM,CAAC,KAAA,EAAO,KAAM,EAAA;AAAA;AAG/B,EAEA,CAAC,MAAO,CAAA,QAAQ,CAAI,GAAA;AAClB,IAAO,OAAA,IAAA;AAAA;AAEX;AAEa,MAAA,aAAA,GAAgB,CAAC,SAAA,EAAsB,UAA6C,KAAA;AAChG,EAAMC,MAAAA,MAAAA,GAAQ,SAAU,CAAA,aAAA,CAAe,WAAY,EAAA;AAEnD,EAAAA,MAAAA,CAAM,eAAe,SAAS,CAAA;AAE9B,EAAI,IAAA,QAAA;AACJ,EAAA,KAAA,IACK,WAAgC,GAAA,SAAA,EACnC,WAAc,GAAA,WAAA,CAAY,aAC3B,WACC,EAAA;AACD,IAAI,IAAA,UAAA,CAAW,WAAW,CAAG,EAAA;AAC5B,MAAW,QAAA,GAAA,WAAA;AACX,MAAA;AAAA;AACD;AAED,EAAA,QAAA,KAAa,UAAU,UAAY,CAAA,SAAA;AAEnC,EAAAA,MAAAA,CAAM,YAAY,QAAQ,CAAA;AAE1B,EAAOA,OAAAA,MAAAA;AACR;AAQO,MAAM,uBAAuB,CACnCC,EAAAA,EACA,CACA,EAAA,IAAA,GAAmB,EACgC,KAAA;AACnD,EAAI,IAAA,CAAA,CAAEA,EAAC,CAAG,EAAA,OAAO,CAAC,EAAE,IAAA,EAAM,KAAOA,EAAAA,EAAAA,EAAG,CAAA;AAEpC,EAAI,IAAA,KAAA,CAAM,QAAQA,EAAC,CAAA;AAClB,IAAA,OAAOA,EAAE,CAAA,OAAA;AAAA,MAAQ,CAAC,CAAG,EAAA,CAAA,KACpB,oBAAqB,CAAA,CAAA,EAAG,GAAG,CAAC,GAAG,IAAM,EAAA,EAAE,QAAQA,EAAG,EAAA,GAAA,EAAK,GAAG,KAAO,EAAA,CAAA,EAAG,CAAC;AAAA,KACtE;AAED,EAAIA,IAAAA,EAAAA,KAAM,IAAQ,IAAA,OAAOA,EAAM,KAAA,QAAA;AAC9B,IAAO,OAAA,MAAA,CAAO,OAAQA,CAAAA,EAAC,CAAE,CAAA,OAAA;AAAA,MAAQ,CAAC,CAAC,CAAA,EAAG,CAAC,CACtC,KAAA,oBAAA,CAAqB,GAAG,CAAG,EAAA,CAAC,GAAG,IAAM,EAAA,EAAE,QAAQA,EAAG,EAAA,GAAA,EAAK,GAAG,KAAO,EAAA,CAAA,EAAG,CAAC;AAAA,KACtE;AAED,EAAA,OAAO,EAAC;AACT;;;;"}
+{"version":3,"file":"utils.mjs","sources":["../src/utils/index.mts"],"sourcesContent":["import type { LikelyAsString } from \"../dom/types.mts\"\n\n// https://tc39.es/ecma262/multipage/abstract-operations.html#sec-samevaluezero\nexport const isSameValueZero = (a: unknown, b: unknown) => {\n  // fix NaN !== NaN\n  if (\n    typeof a === \"number\" &&\n    typeof b === \"number\"\n  )\n    return (\n      a === b ||\n      (\n        a !== a &&\n        b !== b\n      )\n    )\n\n  return a === b\n}\n\n/**\n * Dispatch a custom event to (capturing) and from (bubbling) a target (usually a DOM node).\n * Returns false if the event was cancelled (preventDefault()) and true otherwise.\n *\n * Note that this is synchronous\n */\nexport const dispatch = (\n  target: EventTarget,\n  type: string,\n  detail: unknown,\n  options: CustomEventInit\n) =>\n  target.dispatchEvent(\n    // Default to behave like most DOM events\n    new CustomEvent(type, {\n      detail,\n      bubbles: true,\n      cancelable: true,\n      composed: true,\n      ...options\n    })\n  )\n\n/**\n * Inspired by https://antfu.me/posts/destructuring-with-object-or-array#take-away\n *\n * Creates an object that is both destructable with {...} and [...]\n *\n * Useful for writing library functions à la react-use & vueuse\n *\n * @example\n * ```typescript\n * const useExample = () => {\n *   const a = \"a\"\n *   const b = \"b\"\n *   return createDestructable(\n *     { a, b },\n *     [ a, b ]\n *   )\n * }\n *\n * const { a, b } = useExample()\n * // or\n * const [ a, b ] = useExample()\n * ```\n */\nexport const createDestructable = <\n  const T extends {},\n  const U extends Iterable<unknown>\n>(\n  object: T,\n  iterable: U\n) => {\n  const destructable = {\n    ...object,\n    [Symbol.iterator]: () => iterable[Symbol.iterator]()\n  }\n\n  Object.defineProperty(destructable, Symbol.iterator, {\n    enumerable: false\n  })\n\n  return destructable as T & U\n}\n\n/**\n * Creates an object (as a Proxy) that acts as a function\n *\n * So functionAsObject(f).property is equivalent to f(\"property\")\n *\n * This is can be useful when combined with destructuring syntax\n *\n * @example\n * ```typescript\n * const { html, head, title, body, main, h1, p } = functionAsObject(e)\n * ```\n */\nexport const functionAsObject = <T extends { [input: PropertyKey]: any }>(\n  f: <K extends keyof T>(property: K) => T[K]\n) =>\n  new Proxy({}, {\n    get: (_, property) => f(property)\n  }) as T\n\nexport const pick = <T, K extends keyof T>(t: T, ...keys: ReadonlyArray<K>) => {\n  const picked = {} as Pick<T, K>\n\n  for (const key of keys)\n    picked[key] = t[key]\n\n  return picked\n}\n\nexport const omit = <T, K extends keyof T>(t: T, ...keys: ReadonlyArray<K>) => {\n  const unomitted: Partial<T> = { ...t }\n\n  for (const key of keys)\n    delete unomitted[key]\n\n  return unomitted as Omit<T, K>\n}\n\nexport const mapObject = <\n  O extends Record<PropertyKey, unknown>,\n  RK extends PropertyKey,\n  RV\n>(\n  o: O,\n  f: (entry: [keyof O, O[keyof O]]) => readonly [RK, RV]\n): Record<RK, RV> =>\n  Object.fromEntries(\n    (Object.entries(o) as [keyof O, O[keyof O]][]).map(f)\n  ) as Record<RK, RV>\n\nexport const mapValues = <\n  O extends Record<PropertyKey, unknown>,\n  RV\n>(\n  o: O,\n  f: (value: O[keyof O], key: keyof O) => RV\n): { [K in keyof O]: RV } =>\n  Object.fromEntries(\n    Object.entries(o).map(([k, v]) => [k, f(v as O[keyof O], k as keyof O)])\n  ) as { [K in keyof O]: RV }\n\nexport type InvertObject<O extends Record<PropertyKey, PropertyKey>> = {\n  [K in O[keyof O]]: {\n    [Key in keyof O]: O[Key] extends K ? Key : never\n  }[keyof O]\n}\n\nexport const invertObject = <const O extends Record<PropertyKey, PropertyKey>>(o: O): InvertObject<O> =>\n  Object.fromEntries(\n    Object.entries(o).map(([k, v]) => [v, k])\n  ) as InvertObject<O>\n\n\nexport const camelToDashCase = (s: string) =>\n  s.replace(/[A-Z]/g, c => \"-\" + c.toLowerCase())\n\nexport const dashToCamelCase = (s: string) =>\n  s.replace(/-[a-z]/g, dc => dc[1].toUpperCase())\n\nexport const unique = <T, K>(\n  values: Iterable<T>,\n  getKey?: (value: T) => K\n) => {\n  if (!getKey)\n    return [...new Set(values)]\n\n  const seen = new Map<K, T>()\n  for (const value of values) {\n    const key = getKey(value)\n    if (!seen.has(key))\n      seen.set(key, value)\n  }\n  return [...seen.values()]\n}\n\nconst report = (e: unknown) => {\n  console.error(e)\n}\nexport const attempt: {\n  <T, R = undefined>(f: () => T, recover?: (e: unknown) => R): T | R,\n  <T, R = undefined>(f: () => Promise<T>, recover?: (e: unknown) => R): Promise<T | R>\n} = <T extends unknown>(f: () => T | Promise<T>, recover = report) => {\n  try {\n    const result = f()\n\n    if (result instanceof Promise)\n      return result.catch(recover)\n\n    return result\n  }\n  catch (e) {\n    return recover(e)\n  }\n}\n\ntype FulfilledSelfReferencingPromise<T extends unknown> =\n  Promise<\n    {\n      promise: FulfilledSelfReferencingPromise<T>,\n      settled: {\n        status: \"fulfilled\",\n        value: T\n      }\n    }\n  >\n\ntype RejectedSelfReferencingPromise<E extends unknown> =\n  Promise<\n    {\n      promise: RejectedSelfReferencingPromise<E>,\n      settled: {\n        status: \"rejected\",\n        reason: E\n      }\n    }\n  >\n\ntype SelfReferencingPromise<T extends unknown, E extends unknown> =\n  | FulfilledSelfReferencingPromise<T>\n  | RejectedSelfReferencingPromise<E>\n\nexport const makePromiseQueue = <T extends unknown, E extends unknown>() => {\n  const queue = new Set<SelfReferencingPromise<T, E>>()\n\n  const enqueue = (promise: Promise<T>) => {\n    const recursivePromise = promise\n      .then(resolved => ({\n        promise: recursivePromise,\n        settled: {\n          status: \"fulfilled\",\n          value: resolved\n        }\n      }))\n      .catch(rejected => ({\n        promise: recursivePromise,\n        settled: {\n          status: \"rejected\",\n          reason: rejected as E\n        }\n      })) as SelfReferencingPromise<T, E>\n\n    queue.add(recursivePromise)\n  }\n\n  const dequeue = async () => {\n    const { promise, settled } = await Promise.race<SelfReferencingPromise<T, E>>(queue)\n    queue.delete(promise)\n    return settled\n  }\n\n  return {\n    enqueue,\n\n    async * [Symbol.asyncIterator]() {\n      while (queue.size)\n        yield await dequeue()\n    }\n  }\n}\n\nexport const concatenateStreams = async <T extends any>(streams: ReadonlyArray<ReadableStream<T>>) => {\n  const { readable, writable } = new TransformStream<T, T>()\n\n  for (let i = 0; i < streams.length; i++)\n    await streams[i].pipeTo(writable, { preventClose: i + 1 !== streams.length })\n\n  return readable\n}\n\nexport const originLock = async (name: string, options: LockOptions = {}) => {\n  const { promise: lockAquiredPromise,  resolve: lockAquired } = Promise.withResolvers<void>()\n  const { promise: lockReleasedPromise, resolve: releaseLock } = Promise.withResolvers<void>()\n\n  try {\n    navigator.locks.request(name, options, () => {\n      lockAquired()\n      return lockReleasedPromise\n    })\n  } catch {}\n\n  await lockAquiredPromise\n\n  return () => {\n    releaseLock()\n  }\n}\n\nexport const range = (from: number, to: number, stepSize = 1) => {\n  const sign = Math.sign(to - from)\n  if (sign === 0)\n    return []\n\n  const result: number[] = []\n  for (let n = from; n < to; n += sign * stepSize)\n    result.push(n)\n  return result\n}\n\nexport const randomId = () =>\n  Math.random().toString(36).slice(2)\n\nexport const basicLatin = String.fromCharCode(...range(32, 127))\n\nexport const makeRandomPassword = ({\n  length = 32,\n  characters = basicLatin\n}: {\n  /** Max 256 */\n  length?: number,\n  characters?: string | ReadonlyArray<string>\n} = {}) => {\n  const entropyPerCharacter = 8\n  const statesPerCharacter = 2 ** entropyPerCharacter\n\n  if (characters.length > statesPerCharacter)\n    throw new Error(`Character count (${characters.length}) must not exceed 2^8 (256)`)\n\n  const limit = statesPerCharacter - (statesPerCharacter % characters.length)\n\n  const randomValuesUnderLimit: number[] = []\n  while (randomValuesUnderLimit.length < length) {\n    const randomValues = crypto.getRandomValues(\n      new Uint8Array(length - randomValuesUnderLimit.length)\n    )\n    for (const randomValue of randomValues)\n      if (randomValue < limit)\n        randomValuesUnderLimit.push(randomValue)\n  }\n\n  let result = \"\"\n  for (const n of randomValuesUnderLimit)\n    result += characters[n % characters.length]\n  return result\n}\n\nexport const hash = async (\n  data: string | BufferSource,\n  algorithm: AlgorithmIdentifier = \"SHA-256\"\n) => {\n  if (typeof data === \"string\")\n    data = new TextEncoder().encode(data)\n\n  const bytes = new Uint8Array(\n    await crypto.subtle.digest(algorithm, data)\n  )\n\n  let result = \"\"\n  for (const byte of bytes)\n    result += byte.toString(16).padStart(2, \"0\")\n  return result\n}\n\n/**\n * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Guide/Regular_expressions#escaping\n */\nexport const regexEscape = (s: string) => s.replace(/[.*+?^${}()|[\\]\\\\]/g, \"\\\\$&\")\n\nexport const regexTag = (\n\tstrings: TemplateStringsArray,\n\t...substitutions: ReadonlyArray<unknown>\n) => {\n\tlet result = \"\"\n\tfor (let i = 0; i < strings.length; i++)\n\t\tresult += strings.raw[i] + regexEscape((substitutions[i] ?? \"\") + \"\")\n\treturn (flags?: string) => new RegExp(result, flags)\n}\n\nexport const urlTag = (strings: TemplateStringsArray, ...substitutions: ReadonlyArray<unknown>) => {\n\tlet result = \"\"\n\tfor (let i = 0; i < strings.length; i++)\n\t\tresult += strings[i] + encodeURIComponent((substitutions[i] ?? \"\") + \"\")\n\treturn result\n}\n\ntype UrlParts = {\n\tpathname: string\n\tsearch: string\n\thash: string\n}\nexport const modifyUrl = (url: URL | string, f: (parts: UrlParts) => Partial<UrlParts>) => {\n\ttry {\n\t\tconst result = new URL(url)\n\t\tObject.assign(result, f(result))\n\t\treturn result.href\n\t} catch {}\n\n\tconst match = (url as string).match(/(.*?)(\\?[^#\\n]*)?(#.*)?$/m)\n\tif (!match)\n    return url as string\n\n\tconst [, pathname = \"\", search = \"\", hash = \"\"] = match\n\n\tconst inputParts = { pathname, search, hash }\n\tconst parts = { ...inputParts, ...f(inputParts) }\n\treturn (\n\t\tparts.pathname +\n\t\t(parts.search ? \"?\" + parts.search.replace(/^\\?/m, \"\") : \"\") +\n\t\t(parts.hash ? \"#\" + encodeURIComponent(parts.hash.replace(/^#/m, \"\")) : \"\")\n\t)\n}\n\nexport const urlWithParams = (\n\turl: URL | string,\n\tsearchParameters?: Record<string, LikelyAsString | ReadonlyArray<LikelyAsString> | undefined>\n) =>\n\tmodifyUrl(url, ({ search }) => {\n\t\tconst searchParams = new URLSearchParams(search)\n\n\t\tfor (const key in searchParameters) {\n\t\t\tsearchParams.delete(key)\n\t\t\tconst valueOrValues = searchParameters[key]\n\t\t\tif (valueOrValues === undefined) continue\n\n\t\t\tif (Array.isArray(valueOrValues))\n\t\t\t\tfor (const value of valueOrValues as ReadonlyArray<LikelyAsString>)\n\t\t\t\t\tsearchParams.append(key, value + \"\")\n\t\t\telse\n        searchParams.append(key, (valueOrValues as LikelyAsString) + \"\")\n\t\t}\n\t\tsearchParams.sort()\n\n\t\treturn { search: searchParams.toString() }\n\t})\n\nexport class NodeTreeIterator implements IterableIterator<Node> {\n  #root: ParentNode\n  #current: Node\n  #filter?: (node: Node) => boolean\n\n  constructor(root: ParentNode, filter?: (node: Node) => boolean) {\n    this.#current = this.#root = root\n    this.#filter = filter\n  }\n\n  #isSkipping = false\n  /** Skip descendents of the current node */\n  skip() {\n    this.#isSkipping = true\n  }\n\n  #next() {\n    let current = this.#current\n    while (true) {\n      const isSkipping = this.#isSkipping\n      this.#isSkipping = false\n\n      if (!isSkipping && current.firstChild) {\n        current = current.firstChild\n      }\n      else if (current.nextSibling) {\n        if (current === this.#root)\n          return\n\n        current = current.nextSibling\n      }\n      else {\n        while (true) {\n          if (!current.parentNode || current === this.#root)\n            return\n\n          const parent = current.parentNode\n          if (parent === this.#root)\n            return\n\n          if (parent.nextSibling) {\n            current = parent.nextSibling\n            break\n          }\n          else {\n            current = parent\n          }\n        }\n      }\n\n      if (!this.#filter || this.#filter(current))\n        return this.#current = current\n    }\n  }\n\n  next() {\n    const value = this.#next()\n    return { done: !value, value } as\n      | { done: false, value: Node }\n      | { done: true,  value: undefined }\n  }\n\n  [Symbol.iterator]() {\n    return this\n  }\n}\n\nexport const makeFlatRange = (firstNode: ChildNode, isLastNode: (node: ChildNode) => boolean) => {\n\tconst range = firstNode.ownerDocument!.createRange()\n\n\trange.setStartBefore(firstNode)\n\n\tlet lastNode: ChildNode\n\tfor (\n\t\tlet currentNode: ChildNode | null = firstNode;\n\t\t(currentNode = currentNode.nextSibling);\n\t\tcurrentNode\n\t) {\n\t\tif (isLastNode(currentNode)) {\n\t\t\tlastNode = currentNode\n\t\t\tbreak\n\t\t}\n\t}\n\tlastNode ??= firstNode.parentNode!.lastChild!\n\n\trange.setEndAfter(lastNode)\n\n\treturn range\n}\n\ntype SearchPath = ReadonlyArray<{\n  parent: {},\n  key: PropertyKey,\n  value: unknown\n}>\n\nexport const recursivelySearchFor = <T extends unknown>(\n\tx: unknown,\n\tf: (value: unknown) => value is T,\n\tpath: SearchPath = []\n): ReadonlyArray<{ path: SearchPath, value: T }> => {\n\tif (f(x)) return [{ path, value: x }]\n\n\tif (Array.isArray(x))\n\t\treturn x.flatMap((y, i) =>\n\t\t\trecursivelySearchFor(y, f, [...path, { parent: x, key: i, value: y }])\n\t\t)\n\n\tif (x !== null && typeof x === \"object\")\n\t\treturn Object.entries(x).flatMap(([k, v]) =>\n\t\t\trecursivelySearchFor(v, f, [...path, { parent: x, key: k, value: v }])\n\t\t)\n\n\treturn []\n}\n\n// https://tc39.es/ecma262/multipage/executable-code-and-execution-contexts.html#sec-canbeheldweakly\nexport const canBeHeldWeakly = (x: unknown): x is WeakKey =>\n  (typeof x === \"object\" && x !== null)\n  || typeof x === \"function\"\n  || (typeof x === \"symbol\" && Symbol.keyFor(x) === undefined)\n\ntype ScopeNode<T = unknown> = {\n  value?: T,\n  weakChildren?: WeakMap<WeakKey, ScopeNode<T>>,\n  children?: Map<unknown, ScopeNode<T>>\n}\n\n/**\n * A cache that supports nested scope paths with mixed weak/strong segments.\n * Object/function segments use WeakMap (GC-able), primitives use Map.\n */\nexport class NestedCache {\n  #root: ScopeNode = {}\n\n  #getOrCreateNode(path: ReadonlyArray<unknown>): ScopeNode {\n    let node = this.#root\n    for (const segment of path) {\n      if (canBeHeldWeakly(segment)) {\n        node.weakChildren ??= new WeakMap()\n        let child = node.weakChildren.get(segment)\n        if (!child)\n          node.weakChildren.set(segment, child = {})\n        node = child\n      }\n      else {\n        node.children ??= new Map()\n        let child = node.children.get(segment)\n        if (!child)\n          node.children.set(segment, child = {})\n        node = child\n      }\n    }\n    return node\n  }\n\n  get<T>(path: ReadonlyArray<unknown>, compute: () => T) {\n    const node = this.#getOrCreateNode(path)\n    if (!Object.hasOwn(node, \"value\"))\n      node.value = compute()\n    return node.value as T\n  }\n}\n\nconst memoCache = new NestedCache()\n\nexport const memo = <\n  In  extends unknown,\n  Out extends unknown\n>(\n  f: (x: In) => Out,\n  {\n    scope = [f],\n    getKey\n  }: {\n    /**\n     * Defaults to [f]. Use e.g. [globalThis] to never GC memoized inputs and outputs.\n     */\n    scope?: ReadonlyArray<unknown>,\n    /**\n     * Defaults to the input itself\n     */\n    getKey?: (x: In) => unknown\n  } = {}\n) => (x: In) =>\n  memoCache.get(\n    [...scope, getKey ? getKey(x) : x],\n    () => f(x)\n  )\n"],"names":["hash","range"],"mappings":"AAGa,MAAA,eAAA,GAAkB,CAAC,CAAA,EAAY,CAAe,KAAA;AAEzD,EAAA,IACE,OAAO,CAAA,KAAM,QACb,IAAA,OAAO,CAAM,KAAA,QAAA;AAEb,IAAA,OACE,CAAM,KAAA,CAAA,IAEJ,CAAM,KAAA,CAAA,IACN,CAAM,KAAA,CAAA;AAIZ,EAAA,OAAO,CAAM,KAAA,CAAA;AACf;AAQO,MAAM,WAAW,CACtB,MAAA,EACA,IACA,EAAA,MAAA,EACA,YAEA,MAAO,CAAA,aAAA;AAAA;AAAA,EAEL,IAAI,YAAY,IAAM,EAAA;AAAA,IACpB,MAAA;AAAA,IACA,OAAS,EAAA,IAAA;AAAA,IACT,UAAY,EAAA,IAAA;AAAA,IACZ,QAAU,EAAA,IAAA;AAAA,IACV,GAAG;AAAA,GACJ;AACH;AAyBW,MAAA,kBAAA,GAAqB,CAIhC,MAAA,EACA,QACG,KAAA;AACH,EAAA,MAAM,YAAe,GAAA;AAAA,IACnB,GAAG,MAAA;AAAA,IACH,CAAC,OAAO,QAAQ,GAAG,MAAM,QAAS,CAAA,MAAA,CAAO,QAAQ,CAAE;AAAA,GACrD;AAEA,EAAO,MAAA,CAAA,cAAA,CAAe,YAAc,EAAA,MAAA,CAAO,QAAU,EAAA;AAAA,IACnD,UAAY,EAAA;AAAA,GACb,CAAA;AAED,EAAO,OAAA,YAAA;AACT;AAcO,MAAM,mBAAmB,CAC9B,CAAA,KAEA,IAAI,KAAA,CAAM,EAAI,EAAA;AAAA,EACZ,GAAK,EAAA,CAAC,CAAG,EAAA,QAAA,KAAa,EAAE,QAAQ;AAClC,CAAC;AAEU,MAAA,IAAA,GAAO,CAAuB,CAAA,EAAA,GAAS,IAA2B,KAAA;AAC7E,EAAA,MAAM,SAAS,EAAC;AAEhB,EAAA,KAAA,MAAW,GAAO,IAAA,IAAA;AAChB,IAAO,MAAA,CAAA,GAAG,CAAI,GAAA,CAAA,CAAE,GAAG,CAAA;AAErB,EAAO,OAAA,MAAA;AACT;AAEa,MAAA,IAAA,GAAO,CAAuB,CAAA,EAAA,GAAS,IAA2B,KAAA;AAC7E,EAAM,MAAA,SAAA,GAAwB,EAAE,GAAG,CAAE,EAAA;AAErC,EAAA,KAAA,MAAW,GAAO,IAAA,IAAA;AAChB,IAAA,OAAO,UAAU,GAAG,CAAA;AAEtB,EAAO,OAAA,SAAA;AACT;AAEO,MAAM,SAAY,GAAA,CAKvB,CACA,EAAA,CAAA,KAEA,MAAO,CAAA,WAAA;AAAA,EACJ,MAAO,CAAA,OAAA,CAAQ,CAAC,CAAA,CAA8B,IAAI,CAAC;AACtD;AAEK,MAAM,SAAY,GAAA,CAIvB,CACA,EAAA,CAAA,KAEA,MAAO,CAAA,WAAA;AAAA,EACL,OAAO,OAAQ,CAAA,CAAC,CAAE,CAAA,GAAA,CAAI,CAAC,CAAC,CAAA,EAAG,CAAC,CAAA,KAAM,CAAC,CAAG,EAAA,CAAA,CAAE,CAAiB,EAAA,CAAY,CAAC,CAAC;AACzE;AAQW,MAAA,YAAA,GAAe,CAAmD,CAAA,KAC7E,MAAO,CAAA,WAAA;AAAA,EACL,MAAO,CAAA,OAAA,CAAQ,CAAC,CAAA,CAAE,GAAI,CAAA,CAAC,CAAC,CAAA,EAAG,CAAC,CAAA,KAAM,CAAC,CAAA,EAAG,CAAC,CAAC;AAC1C;AAGW,MAAA,eAAA,GAAkB,CAAC,CAAA,KAC9B,CAAE,CAAA,OAAA,CAAQ,UAAU,CAAK,CAAA,KAAA,GAAA,GAAM,CAAE,CAAA,WAAA,EAAa;AAEnC,MAAA,eAAA,GAAkB,CAAC,CAAA,KAC9B,CAAE,CAAA,OAAA,CAAQ,SAAW,EAAA,CAAA,EAAA,KAAM,EAAG,CAAA,CAAC,CAAE,CAAA,WAAA,EAAa;AAEnC,MAAA,MAAA,GAAS,CACpB,MAAA,EACA,MACG,KAAA;AACH,EAAA,IAAI,CAAC,MAAA;AACH,IAAA,OAAO,CAAC,GAAG,IAAI,GAAA,CAAI,MAAM,CAAC,CAAA;AAE5B,EAAM,MAAA,IAAA,uBAAW,GAAU,EAAA;AAC3B,EAAA,KAAA,MAAW,SAAS,MAAQ,EAAA;AAC1B,IAAM,MAAA,GAAA,GAAM,OAAO,KAAK,CAAA;AACxB,IAAI,IAAA,CAAC,IAAK,CAAA,GAAA,CAAI,GAAG,CAAA;AACf,MAAK,IAAA,CAAA,GAAA,CAAI,KAAK,KAAK,CAAA;AAAA;AAEvB,EAAA,OAAO,CAAC,GAAG,IAAK,CAAA,MAAA,EAAQ,CAAA;AAC1B;AAEA,MAAM,MAAA,GAAS,CAAC,CAAe,KAAA;AAC7B,EAAA,OAAA,CAAQ,MAAM,CAAC,CAAA;AACjB,CAAA;AACO,MAAM,OAGT,GAAA,CAAoB,CAAyB,EAAA,OAAA,GAAU,MAAW,KAAA;AACpE,EAAI,IAAA;AACF,IAAA,MAAM,SAAS,CAAE,EAAA;AAEjB,IAAA,IAAI,MAAkB,YAAA,OAAA;AACpB,MAAO,OAAA,MAAA,CAAO,MAAM,OAAO,CAAA;AAE7B,IAAO,OAAA,MAAA;AAAA,WAEF,CAAG,EAAA;AACR,IAAA,OAAO,QAAQ,CAAC,CAAA;AAAA;AAEpB;AA4BO,MAAM,mBAAmB,MAA4C;AAC1E,EAAM,MAAA,KAAA,uBAAY,GAAkC,EAAA;AAEpD,EAAM,MAAA,OAAA,GAAU,CAAC,OAAwB,KAAA;AACvC,IAAM,MAAA,gBAAA,GAAmB,OACtB,CAAA,IAAA,CAAK,CAAa,QAAA,MAAA;AAAA,MACjB,OAAS,EAAA,gBAAA;AAAA,MACT,OAAS,EAAA;AAAA,QACP,MAAQ,EAAA,WAAA;AAAA,QACR,KAAO,EAAA;AAAA;AACT,KACF,CAAE,CACD,CAAA,KAAA,CAAM,CAAa,QAAA,MAAA;AAAA,MAClB,OAAS,EAAA,gBAAA;AAAA,MACT,OAAS,EAAA;AAAA,QACP,MAAQ,EAAA,UAAA;AAAA,QACR,MAAQ,EAAA;AAAA;AACV,KACA,CAAA,CAAA;AAEJ,IAAA,KAAA,CAAM,IAAI,gBAAgB,CAAA;AAAA,GAC5B;AAEA,EAAA,MAAM,UAAU,YAAY;AAC1B,IAAA,MAAM,EAAE,OAAS,EAAA,OAAA,KAAY,MAAM,OAAA,CAAQ,KAAmC,KAAK,CAAA;AACnF,IAAA,KAAA,CAAM,OAAO,OAAO,CAAA;AACpB,IAAO,OAAA,OAAA;AAAA,GACT;AAEA,EAAO,OAAA;AAAA,IACL,OAAA;AAAA,IAEA,QAAS,MAAO,CAAA,aAAa,CAAI,GAAA;AAC/B,MAAA,OAAO,KAAM,CAAA,IAAA;AACX,QAAA,MAAM,MAAM,OAAQ,EAAA;AAAA;AACxB,GACF;AACF;AAEa,MAAA,kBAAA,GAAqB,OAAsB,OAA8C,KAAA;AACpG,EAAA,MAAM,EAAE,QAAA,EAAU,QAAS,EAAA,GAAI,IAAI,eAAsB,EAAA;AAEzD,EAAA,KAAA,IAAS,CAAI,GAAA,CAAA,EAAG,CAAI,GAAA,OAAA,CAAQ,MAAQ,EAAA,CAAA,EAAA;AAClC,IAAM,MAAA,OAAA,CAAQ,CAAC,CAAA,CAAE,MAAO,CAAA,QAAA,EAAU,EAAE,YAAA,EAAc,CAAI,GAAA,CAAA,KAAM,OAAQ,CAAA,MAAA,EAAQ,CAAA;AAE9E,EAAO,OAAA,QAAA;AACT;AAEO,MAAM,UAAa,GAAA,OAAO,IAAc,EAAA,OAAA,GAAuB,EAAO,KAAA;AAC3E,EAAA,MAAM,EAAE,OAAS,EAAA,kBAAA,EAAqB,SAAS,WAAY,EAAA,GAAI,QAAQ,aAAoB,EAAA;AAC3F,EAAA,MAAM,EAAE,OAAS,EAAA,mBAAA,EAAqB,SAAS,WAAY,EAAA,GAAI,QAAQ,aAAoB,EAAA;AAE3F,EAAI,IAAA;AACF,IAAA,SAAA,CAAU,KAAM,CAAA,OAAA,CAAQ,IAAM,EAAA,OAAA,EAAS,MAAM;AAC3C,MAAY,WAAA,EAAA;AACZ,MAAO,OAAA,mBAAA;AAAA,KACR,CAAA;AAAA,GACK,CAAA,MAAA;AAAA;AAER,EAAM,MAAA,kBAAA;AAEN,EAAA,OAAO,MAAM;AACX,IAAY,WAAA,EAAA;AAAA,GACd;AACF;AAEO,MAAM,KAAQ,GAAA,CAAC,IAAc,EAAA,EAAA,EAAY,WAAW,CAAM,KAAA;AAC/D,EAAA,MAAM,IAAO,GAAA,IAAA,CAAK,IAAK,CAAA,EAAA,GAAK,IAAI,CAAA;AAChC,EAAA,IAAI,IAAS,KAAA,CAAA;AACX,IAAA,OAAO,EAAC;AAEV,EAAA,MAAM,SAAmB,EAAC;AAC1B,EAAA,KAAA,IAAS,CAAI,GAAA,IAAA,EAAM,CAAI,GAAA,EAAA,EAAI,KAAK,IAAO,GAAA,QAAA;AACrC,IAAA,MAAA,CAAO,KAAK,CAAC,CAAA;AACf,EAAO,OAAA,MAAA;AACT;AAEa,MAAA,QAAA,GAAW,MACtB,IAAK,CAAA,MAAA,GAAS,QAAS,CAAA,EAAE,CAAE,CAAA,KAAA,CAAM,CAAC;AAE7B,MAAM,aAAa,MAAO,CAAA,YAAA,CAAa,GAAG,KAAM,CAAA,EAAA,EAAI,GAAG,CAAC;AAExD,MAAM,qBAAqB,CAAC;AAAA,EACjC,MAAS,GAAA,EAAA;AAAA,EACT,UAAa,GAAA;AACf,CAAA,GAII,EAAO,KAAA;AACT,EAAA,MAAM,mBAAsB,GAAA,CAAA;AAC5B,EAAA,MAAM,qBAAqB,CAAK,IAAA,mBAAA;AAEhC,EAAA,IAAI,WAAW,MAAS,GAAA,kBAAA;AACtB,IAAA,MAAM,IAAI,KAAA,CAAM,CAAoB,iBAAA,EAAA,UAAA,CAAW,MAAM,CAA6B,2BAAA,CAAA,CAAA;AAEpF,EAAM,MAAA,KAAA,GAAQ,kBAAsB,GAAA,kBAAA,GAAqB,UAAW,CAAA,MAAA;AAEpE,EAAA,MAAM,yBAAmC,EAAC;AAC1C,EAAO,OAAA,sBAAA,CAAuB,SAAS,MAAQ,EAAA;AAC7C,IAAA,MAAM,eAAe,MAAO,CAAA,eAAA;AAAA,MAC1B,IAAI,UAAA,CAAW,MAAS,GAAA,sBAAA,CAAuB,MAAM;AAAA,KACvD;AACA,IAAA,KAAA,MAAW,WAAe,IAAA,YAAA;AACxB,MAAA,IAAI,WAAc,GAAA,KAAA;AAChB,QAAA,sBAAA,CAAuB,KAAK,WAAW,CAAA;AAAA;AAG7C,EAAA,IAAI,MAAS,GAAA,EAAA;AACb,EAAA,KAAA,MAAW,CAAK,IAAA,sBAAA;AACd,IAAU,MAAA,IAAA,UAAA,CAAW,CAAI,GAAA,UAAA,CAAW,MAAM,CAAA;AAC5C,EAAO,OAAA,MAAA;AACT;AAEO,MAAM,IAAO,GAAA,OAClB,IACA,EAAA,SAAA,GAAiC,SAC9B,KAAA;AACH,EAAA,IAAI,OAAO,IAAS,KAAA,QAAA;AAClB,IAAA,IAAA,GAAO,IAAI,WAAA,EAAc,CAAA,MAAA,CAAO,IAAI,CAAA;AAEtC,EAAA,MAAM,QAAQ,IAAI,UAAA;AAAA,IAChB,MAAM,MAAA,CAAO,MAAO,CAAA,MAAA,CAAO,WAAW,IAAI;AAAA,GAC5C;AAEA,EAAA,IAAI,MAAS,GAAA,EAAA;AACb,EAAA,KAAA,MAAW,IAAQ,IAAA,KAAA;AACjB,IAAA,MAAA,IAAU,KAAK,QAAS,CAAA,EAAE,CAAE,CAAA,QAAA,CAAS,GAAG,GAAG,CAAA;AAC7C,EAAO,OAAA,MAAA;AACT;AAKO,MAAM,cAAc,CAAC,CAAA,KAAc,CAAE,CAAA,OAAA,CAAQ,uBAAuB,MAAM;AAEpE,MAAA,QAAA,GAAW,CACvB,OAAA,EAAA,GACG,aACC,KAAA;AACJ,EAAA,IAAI,MAAS,GAAA,EAAA;AACb,EAAA,KAAA,IAAS,CAAI,GAAA,CAAA,EAAG,CAAI,GAAA,OAAA,CAAQ,MAAQ,EAAA,CAAA,EAAA;AACnC,IAAU,MAAA,IAAA,OAAA,CAAQ,IAAI,CAAC,CAAA,GAAI,aAAa,aAAc,CAAA,CAAC,CAAK,IAAA,EAAA,IAAM,EAAE,CAAA;AACrE,EAAA,OAAO,CAAC,KAAA,KAAmB,IAAI,MAAA,CAAO,QAAQ,KAAK,CAAA;AACpD;AAEa,MAAA,MAAA,GAAS,CAAC,OAAA,EAAA,GAAkC,aAA0C,KAAA;AAClG,EAAA,IAAI,MAAS,GAAA,EAAA;AACb,EAAA,KAAA,IAAS,CAAI,GAAA,CAAA,EAAG,CAAI,GAAA,OAAA,CAAQ,MAAQ,EAAA,CAAA,EAAA;AACnC,IAAU,MAAA,IAAA,OAAA,CAAQ,CAAC,CAAI,GAAA,kBAAA,CAAA,CAAoB,cAAc,CAAC,CAAA,IAAK,MAAM,EAAE,CAAA;AACxE,EAAO,OAAA,MAAA;AACR;AAOa,MAAA,SAAA,GAAY,CAAC,GAAA,EAAmB,CAA8C,KAAA;AAC1F,EAAI,IAAA;AACH,IAAM,MAAA,MAAA,GAAS,IAAI,GAAA,CAAI,GAAG,CAAA;AAC1B,IAAA,MAAA,CAAO,MAAO,CAAA,MAAA,EAAQ,CAAE,CAAA,MAAM,CAAC,CAAA;AAC/B,IAAA,OAAO,MAAO,CAAA,IAAA;AAAA,GACP,CAAA,MAAA;AAAA;AAER,EAAM,MAAA,KAAA,GAAS,GAAe,CAAA,KAAA,CAAM,2BAA2B,CAAA;AAC/D,EAAA,IAAI,CAAC,KAAA;AACF,IAAO,OAAA,GAAA;AAEV,EAAM,MAAA,GAAG,QAAW,GAAA,EAAA,EAAI,SAAS,EAAIA,EAAAA,KAAAA,GAAO,EAAE,CAAI,GAAA,KAAA;AAElD,EAAA,MAAM,UAAa,GAAA,EAAE,QAAU,EAAA,MAAA,EAAQ,MAAAA,KAAK,EAAA;AAC5C,EAAA,MAAM,QAAQ,EAAE,GAAG,YAAY,GAAG,CAAA,CAAE,UAAU,CAAE,EAAA;AAChD,EACC,OAAA,KAAA,CAAM,YACL,KAAM,CAAA,MAAA,GAAS,MAAM,KAAM,CAAA,MAAA,CAAO,OAAQ,CAAA,MAAA,EAAQ,EAAE,CAAA,GAAI,OACxD,KAAM,CAAA,IAAA,GAAO,MAAM,kBAAmB,CAAA,KAAA,CAAM,KAAK,OAAQ,CAAA,KAAA,EAAO,EAAE,CAAC,CAAI,GAAA,EAAA,CAAA;AAE1E;AAEa,MAAA,aAAA,GAAgB,CAC5B,GACA,EAAA,gBAAA,KAEA,UAAU,GAAK,EAAA,CAAC,EAAE,MAAA,EAAa,KAAA;AAC9B,EAAM,MAAA,YAAA,GAAe,IAAI,eAAA,CAAgB,MAAM,CAAA;AAE/C,EAAA,KAAA,MAAW,OAAO,gBAAkB,EAAA;AACnC,IAAA,YAAA,CAAa,OAAO,GAAG,CAAA;AACvB,IAAM,MAAA,aAAA,GAAgB,iBAAiB,GAAG,CAAA;AAC1C,IAAA,IAAI,kBAAkB,MAAW,EAAA;AAEjC,IAAI,IAAA,KAAA,CAAM,QAAQ,aAAa,CAAA;AAC9B,MAAA,KAAA,MAAW,KAAS,IAAA,aAAA;AACnB,QAAa,YAAA,CAAA,MAAA,CAAO,GAAK,EAAA,KAAA,GAAQ,EAAE,CAAA;AAAA;AAEhC,MAAa,YAAA,CAAA,MAAA,CAAO,GAAM,EAAA,aAAA,GAAmC,EAAE,CAAA;AAAA;AAErE,EAAA,YAAA,CAAa,IAAK,EAAA;AAElB,EAAA,OAAO,EAAE,MAAA,EAAQ,YAAa,CAAA,QAAA,EAAW,EAAA;AAC1C,CAAC;AAEK,MAAM,gBAAmD,CAAA;AAAA,EAC9D,KAAA;AAAA,EACA,QAAA;AAAA,EACA,OAAA;AAAA,EAEA,WAAA,CAAY,MAAkB,MAAkC,EAAA;AAC9D,IAAK,IAAA,CAAA,QAAA,GAAW,KAAK,KAAQ,GAAA,IAAA;AAC7B,IAAA,IAAA,CAAK,OAAU,GAAA,MAAA;AAAA;AACjB,EAEA,WAAc,GAAA,KAAA;AAAA;AAAA,EAEd,IAAO,GAAA;AACL,IAAA,IAAA,CAAK,WAAc,GAAA,IAAA;AAAA;AACrB,EAEA,KAAQ,GAAA;AACN,IAAA,IAAI,UAAU,IAAK,CAAA,QAAA;AACnB,IAAA,OAAO,IAAM,EAAA;AACX,MAAA,MAAM,aAAa,IAAK,CAAA,WAAA;AACxB,MAAA,IAAA,CAAK,WAAc,GAAA,KAAA;AAEnB,MAAI,IAAA,CAAC,UAAc,IAAA,OAAA,CAAQ,UAAY,EAAA;AACrC,QAAA,OAAA,GAAU,OAAQ,CAAA,UAAA;AAAA,OACpB,MAAA,IACS,QAAQ,WAAa,EAAA;AAC5B,QAAA,IAAI,YAAY,IAAK,CAAA,KAAA;AACnB,UAAA;AAEF,QAAA,OAAA,GAAU,OAAQ,CAAA,WAAA;AAAA,OAEf,MAAA;AACH,QAAA,OAAO,IAAM,EAAA;AACX,UAAA,IAAI,CAAC,OAAA,CAAQ,UAAc,IAAA,OAAA,KAAY,IAAK,CAAA,KAAA;AAC1C,YAAA;AAEF,UAAA,MAAM,SAAS,OAAQ,CAAA,UAAA;AACvB,UAAA,IAAI,WAAW,IAAK,CAAA,KAAA;AAClB,YAAA;AAEF,UAAA,IAAI,OAAO,WAAa,EAAA;AACtB,YAAA,OAAA,GAAU,MAAO,CAAA,WAAA;AACjB,YAAA;AAAA,WAEG,MAAA;AACH,YAAU,OAAA,GAAA,MAAA;AAAA;AACZ;AACF;AAGF,MAAA,IAAI,CAAC,IAAA,CAAK,OAAW,IAAA,IAAA,CAAK,QAAQ,OAAO,CAAA;AACvC,QAAA,OAAO,KAAK,QAAW,GAAA,OAAA;AAAA;AAC3B;AACF,EAEA,IAAO,GAAA;AACL,IAAM,MAAA,KAAA,GAAQ,KAAK,KAAM,EAAA;AACzB,IAAA,OAAO,EAAE,IAAA,EAAM,CAAC,KAAA,EAAO,KAAM,EAAA;AAAA;AAG/B,EAEA,CAAC,MAAO,CAAA,QAAQ,CAAI,GAAA;AAClB,IAAO,OAAA,IAAA;AAAA;AAEX;AAEa,MAAA,aAAA,GAAgB,CAAC,SAAA,EAAsB,UAA6C,KAAA;AAChG,EAAMC,MAAAA,MAAAA,GAAQ,SAAU,CAAA,aAAA,CAAe,WAAY,EAAA;AAEnD,EAAAA,MAAAA,CAAM,eAAe,SAAS,CAAA;AAE9B,EAAI,IAAA,QAAA;AACJ,EAAA,KAAA,IACK,WAAgC,GAAA,SAAA,EACnC,WAAc,GAAA,WAAA,CAAY,aAC3B,WACC,EAAA;AACD,IAAI,IAAA,UAAA,CAAW,WAAW,CAAG,EAAA;AAC5B,MAAW,QAAA,GAAA,WAAA;AACX,MAAA;AAAA;AACD;AAED,EAAA,QAAA,KAAa,UAAU,UAAY,CAAA,SAAA;AAEnC,EAAAA,MAAAA,CAAM,YAAY,QAAQ,CAAA;AAE1B,EAAOA,OAAAA,MAAAA;AACR;AAQO,MAAM,uBAAuB,CACnC,CAAA,EACA,CACA,EAAA,IAAA,GAAmB,EACgC,KAAA;AACnD,EAAI,IAAA,CAAA,CAAE,CAAC,CAAG,EAAA,OAAO,CAAC,EAAE,IAAA,EAAM,KAAO,EAAA,CAAA,EAAG,CAAA;AAEpC,EAAI,IAAA,KAAA,CAAM,QAAQ,CAAC,CAAA;AAClB,IAAA,OAAO,CAAE,CAAA,OAAA;AAAA,MAAQ,CAAC,CAAG,EAAA,CAAA,KACpB,oBAAqB,CAAA,CAAA,EAAG,GAAG,CAAC,GAAG,IAAM,EAAA,EAAE,QAAQ,CAAG,EAAA,GAAA,EAAK,GAAG,KAAO,EAAA,CAAA,EAAG,CAAC;AAAA,KACtE;AAED,EAAI,IAAA,CAAA,KAAM,IAAQ,IAAA,OAAO,CAAM,KAAA,QAAA;AAC9B,IAAO,OAAA,MAAA,CAAO,OAAQ,CAAA,CAAC,CAAE,CAAA,OAAA;AAAA,MAAQ,CAAC,CAAC,CAAA,EAAG,CAAC,CACtC,KAAA,oBAAA,CAAqB,GAAG,CAAG,EAAA,CAAC,GAAG,IAAM,EAAA,EAAE,QAAQ,CAAG,EAAA,GAAA,EAAK,GAAG,KAAO,EAAA,CAAA,EAAG,CAAC;AAAA,KACtE;AAED,EAAA,OAAO,EAAC;AACT;AAGO,MAAM,kBAAkB,CAAC,CAAA,KAC7B,OAAO,CAAA,KAAM,YAAY,CAAM,KAAA,IAAA,IAC7B,OAAO,CAAA,KAAM,cACZ,OAAO,CAAA,KAAM,YAAY,MAAO,CAAA,MAAA,CAAO,CAAC,CAAM,KAAA;AAY7C,MAAM,WAAY,CAAA;AAAA,EACvB,QAAmB,EAAC;AAAA,EAEpB,iBAAiB,IAAyC,EAAA;AACxD,IAAA,IAAI,OAAO,IAAK,CAAA,KAAA;AAChB,IAAA,KAAA,MAAW,WAAW,IAAM,EAAA;AAC1B,MAAI,IAAA,eAAA,CAAgB,OAAO,CAAG,EAAA;AAC5B,QAAK,IAAA,CAAA,YAAA,yBAAqB,OAAQ,EAAA;AAClC,QAAA,IAAI,KAAQ,GAAA,IAAA,CAAK,YAAa,CAAA,GAAA,CAAI,OAAO,CAAA;AACzC,QAAA,IAAI,CAAC,KAAA;AACH,UAAA,IAAA,CAAK,YAAa,CAAA,GAAA,CAAI,OAAS,EAAA,KAAA,GAAQ,EAAE,CAAA;AAC3C,QAAO,IAAA,GAAA,KAAA;AAAA,OAEJ,MAAA;AACH,QAAK,IAAA,CAAA,QAAA,yBAAiB,GAAI,EAAA;AAC1B,QAAA,IAAI,KAAQ,GAAA,IAAA,CAAK,QAAS,CAAA,GAAA,CAAI,OAAO,CAAA;AACrC,QAAA,IAAI,CAAC,KAAA;AACH,UAAA,IAAA,CAAK,QAAS,CAAA,GAAA,CAAI,OAAS,EAAA,KAAA,GAAQ,EAAE,CAAA;AACvC,QAAO,IAAA,GAAA,KAAA;AAAA;AACT;AAEF,IAAO,OAAA,IAAA;AAAA;AACT,EAEA,GAAA,CAAO,MAA8B,OAAkB,EAAA;AACrD,IAAM,MAAA,IAAA,GAAO,IAAK,CAAA,gBAAA,CAAiB,IAAI,CAAA;AACvC,IAAA,IAAI,CAAC,MAAA,CAAO,MAAO,CAAA,IAAA,EAAM,OAAO,CAAA;AAC9B,MAAA,IAAA,CAAK,QAAQ,OAAQ,EAAA;AACvB,IAAA,OAAO,IAAK,CAAA,KAAA;AAAA;AAEhB;AAEA,MAAM,SAAA,GAAY,IAAI,WAAY,EAAA;AAErB,MAAA,IAAA,GAAO,CAIlB,CACA,EAAA;AAAA,EACE,KAAA,GAAQ,CAAC,CAAC,CAAA;AAAA,EACV;AACF,CAAA,GASI,EAAC,KACF,CAAC,CAAA,KACJ,SAAU,CAAA,GAAA;AAAA,EACR,CAAC,GAAG,KAAA,EAAO,SAAS,MAAO,CAAA,CAAC,IAAI,CAAC,CAAA;AAAA,EACjC,MAAM,EAAE,CAAC;AACX;;;;"}

package/package.json

@@ -10,7 +10,7 @@
     "library",
     "modern"
   ],
-  "version": "2.0.0-beta.4",
+  "version": "2.0.0-beta.5",
   "license": "MIT",
   "author": {
     "name": "Daniel Ethridge",
@@ -90,6 +90,10 @@
       "types": "./dist/types/components/utils.d.mts",
       "default": "./dist/components/utils.mjs"
     },
+    "./components/misc": {
+      "types": "./dist/types/components/misc.d.mts",
+      "default": "./dist/components/misc.mjs"
+    },
     "./components/custom-elements": {
       "types": "./dist/types/components/custom-elements.d.mts",
       "default": "./dist/components/custom-elements.mjs"