@mark1russell7/collections 0.4.0 → 0.6.0

package/build/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","names":["fold","PRESENT","clamp","toArray","toSet","toMap","toList","toMap"],"sources":["../src/core/effects.ts","../src/core/policies.ts","../src/core/middleware.ts","../src/core/events.ts","../src/storage/listeners.ts","../src/order/rank.ts","../src/utils/defaults.ts","../src/impl/array-list.ts","../src/impl/array-deque.ts","../src/impl/hash-map.ts","../src/impl/linked-hash-map.ts","../src/impl/tree-map.ts","../src/impl/tree-set.ts","../src/impl/linked-list.ts","../src/impl/hash-set.ts","../src/impl/priority-queue.ts","../src/impl/summary-tree.ts","../src/behaviors/bounded.ts","../src/behaviors/readonly.ts","../src/behaviors/safe.ts","../src/behaviors/evented.ts","../src/behaviors/synchronized.ts","../src/behaviors/composite.ts","../src/behaviors/lru.ts","../src/behaviors/ttl.ts","../src/async/async-queue.ts","../src/async/channels.ts","../src/async/settled.ts","../src/fx/iter.ts","../src/fx/collectors.ts","../src/utils/factories.ts","../src/utils/helpers.ts"],"sourcesContent":["/**\n * Functional effect types for error handling and optional values.\n *\n * This module gives Option<T> and Result<T,E> types for explicit, type-safe\n * error handling without exceptions. This module includes async variants.\n */\n\n// ============================================================================\n// Option<T> - represents optional values\n// ============================================================================\n\n/**\n * This type represents the absence of a value.\n */\nexport interface None {\n  readonly _tag: \"None\";\n}\n\n/**\n * This type represents the presence of a value.\n */\nexport interface Some<T> {\n  readonly _tag: \"Some\";\n  readonly value: T;\n}\n\n/**\n * Option<T> represents a value that is present or absent.\n * This is a type-safe alternative to null/undefined.\n *\n * @example\n * function findUser(id: string): Option<User> {\n *   const user = db.get(id);\n *   return user ? Some(user) : None;\n * }\n */\nexport type Option<T> = None | Some<T>;\n\n/**\n * The singleton None value.\n */\nexport const None: None = Object.freeze({ _tag: \"None\" });\n\n/**\n * This function constructs a Some value containing the given value.\n */\nexport const Some = <T>(value: T): Some<T> =>\n  Object.freeze({ _tag: \"Some\", value });\n\n/**\n * Type guard to check if an Option is None.\n */\nexport const isNone = <T>(opt: Option<T>): opt is None => opt._tag === \"None\";\n\n/**\n * Type guard to check if an Option is Some.\n */\nexport const isSome = <T>(opt: Option<T>): opt is Some<T> =>\n  opt._tag === \"Some\";\n\n/**\n * This function extracts the value from a Some, or gives the default value if None.\n */\nexport const getOrElse = <T>(opt: Option<T>, defaultValue: T): T =>\n  isSome(opt) ? opt.value : defaultValue;\n\n/**\n * This function extracts the value from a Some, or throws an error if None.\n */\nexport const unwrap = <T>(opt: Option<T>): T => {\n  if (isSome(opt)) return opt.value;\n  throw new Error(\"Called unwrap on None\");\n};\n\n/**\n * This function maps a function over the value in a Some, or gives None.\n */\nexport const mapOption = <T, U>(\n  opt: Option<T>,\n  f: (value: T) => U\n): Option<U> => (isSome(opt) ? Some(f(opt.value)) : None);\n\n/**\n * Chains Option-returning operations.\n */\nexport const flatMapOption = <T, U>(\n  opt: Option<T>,\n  f: (value: T) => Option<U>\n): Option<U> => (isSome(opt) ? f(opt.value) : None);\n\n/**\n * This function converts a nullable value to an Option.\n */\nexport const fromNullable = <T>(value: T | null | undefined): Option<T> =>\n  value == null ? None : Some(value);\n\n/**\n * This function converts an Option to a nullable value.\n */\nexport const toNullable = <T>(opt: Option<T>): T | undefined =>\n  isSome(opt) ? opt.value : undefined;\n\n// ============================================================================\n// Result<T, E> - represents success or failure\n// ============================================================================\n\n/**\n * This type represents a successful result containing a value.\n */\nexport interface Ok<T> {\n  readonly _tag: \"Ok\";\n  readonly value: T;\n  /** This method calls the `Ok` case with the value. */\n  match<U>(cases: { Ok: (value: T) => U; Err: (error: never) => U }): U;\n}\n\n/**\n * This type represents a failed result containing an error.\n */\nexport interface Err<E> {\n  readonly _tag: \"Err\";\n  readonly error: E;\n  /** This method calls the `Err` case with the error. */\n  match<U>(cases: { Ok: (value: never) => U; Err: (error: E) => U }): U;\n}\n\n/**\n * Result<T, E> represents the result of an operation that can fail.\n * It contains either a success value (Ok) or an error value (Err).\n *\n * @example\n * function divide(a: number, b: number): Result<number, string> {\n *   if (b === 0) return Err(\"Division by zero\");\n *   return Ok(a / b);\n * }\n */\nexport type Result<T, E> = Ok<T> | Err<E>;\n\n/**\n * This function constructs an Ok result containing the given value.\n */\nexport const Ok = <T>(value: T): Ok<T> =>\n  Object.freeze({\n    _tag: \"Ok\",\n    value,\n    match: <U>(f: { Ok: (value: T) => U; Err: (error: unknown) => U }) =>\n      f.Ok(value),\n  });\n\n/**\n * This function constructs an Err result containing the given error.\n */\nexport const Err = <E>(error: E): Err<E> =>\n  Object.freeze({\n    _tag: \"Err\",\n    error,\n    match: <U>(f: { Ok: (value: unknown) => U; Err: (error: E) => U }) =>\n      f.Err(error),\n  });\n\n/**\n * Type guard to check if a Result is Ok.\n */\nexport const isOk = <T, E>(result: Result<T, E>): result is Ok<T> =>\n  result._tag === \"Ok\";\n\n/**\n * Type guard to check if a Result is Err.\n */\nexport const isErr = <T, E>(result: Result<T, E>): result is Err<E> =>\n  result._tag === \"Err\";\n\n/**\n * This function extracts the value from an Ok, or gives the default value if Err.\n */\nexport const getOrElseResult = <T, E>(\n  result: Result<T, E>,\n  defaultValue: T\n): T => (isOk(result) ? result.value : defaultValue);\n\n/**\n * This function extracts the value from an Ok, or throws the error if Err.\n */\nexport const unwrapResult = <T, E>(result: Result<T, E>): T => {\n  if (isOk(result)) return result.value;\n  throw result.error;\n};\n\n/**\n * This function maps a function over the value in an Ok, or gives the Err unchanged.\n */\nexport const mapResult = <T, U, E>(\n  result: Result<T, E>,\n  f: (value: T) => U\n): Result<U, E> => (isOk(result) ? Ok(f(result.value)) : result);\n\n/**\n * This function maps a function over the error in an Err, or gives the Ok unchanged.\n */\nexport const mapError = <T, E, F>(\n  result: Result<T, E>,\n  f: (error: E) => F\n): Result<T, F> => (isErr(result) ? Err(f(result.error)) : result);\n\n/**\n * Chains Result-returning operations.\n */\nexport const flatMapResult = <T, U, E>(\n  result: Result<T, E>,\n  f: (value: T) => Result<U, E>\n): Result<U, E> => (isOk(result) ? f(result.value) : result);\n\n/**\n * This function converts a throwing function into a Result-returning function.\n */\nexport const tryCatch = <T, E = unknown>(\n  fn: () => T,\n  onError?: (error: unknown) => E\n): Result<T, E> => {\n  try {\n    return Ok(fn());\n  } catch (error) {\n    return Err((onError ? onError(error) : error) as E);\n  }\n};\n\n/**\n * This function converts an async throwing function into a Result-returning async function.\n */\nexport const tryCatchAsync = async <T, E = unknown>(\n  fn: () => Promise<T>,\n  onError?: (error: unknown) => E\n): Promise<Result<T, E>> => {\n  try {\n    return Ok(await fn());\n  } catch (error) {\n    return Err((onError ? onError(error) : error) as E);\n  }\n};\n\n// ============================================================================\n// Async variants\n// ============================================================================\n\n/**\n * Async variant of Option<T>.\n */\nexport type AsyncOption<T> = Promise<Option<T>>;\n\n/**\n * Async variant of Result<T, E>.\n */\nexport type AsyncResult<T, E> = Promise<Result<T, E>>;\n\n/**\n * This function maps a function over an async Option.\n */\nexport const mapAsyncOption = async <T, U>(\n  opt: AsyncOption<T>,\n  f: (value: T) => U | Promise<U>\n): AsyncOption<U> => {\n  const resolved = await opt;\n  if (isSome(resolved)) {\n    return Some(await f(resolved.value));\n  }\n  return None;\n};\n\n/**\n * This function maps a function over an async Result.\n */\nexport const mapAsyncResult = async <T, U, E>(\n  result: AsyncResult<T, E>,\n  f: (value: T) => U | Promise<U>\n): AsyncResult<U, E> => {\n  const resolved = await result;\n  if (isOk(resolved)) {\n    return Ok(await f(resolved.value));\n  }\n  return resolved;\n};\n\n// ============================================================================\n// Conversion utilities\n// ============================================================================\n\n/**\n * This function converts an Option to a Result.\n * None becomes Err with the given error.\n */\nexport const optionToResult = <T, E>(opt: Option<T>, error: E): Result<T, E> =>\n  isSome(opt) ? Ok(opt.value) : Err(error);\n\n/**\n * This function converts a Result to an Option.\n * Err becomes None, discarding the error.\n */\nexport const resultToOption = <T, E>(result: Result<T, E>): Option<T> =>\n  isOk(result) ? Some(result.value) : None;\n\n/**\n * This function combines multiple Options into an Option of an array.\n * This function gives None if any input is None.\n */\nexport const sequence = <T>(opts: Option<T>[]): Option<T[]> => {\n  const values: T[] = [];\n  for (const opt of opts) {\n    if (isNone(opt)) return None;\n    values.push(opt.value);\n  }\n  return Some(values);\n};\n\n/**\n * This function combines multiple Results into a Result of an array.\n * This function gives the first Err encountered, or Ok with all values.\n */\nexport const sequenceResults = <T, E>(\n  results: Result<T, E>[]\n): Result<T[], E> => {\n  const values: T[] = [];\n  for (const result of results) {\n    if (isErr(result)) return result;\n    values.push(result.value);\n  }\n  return Ok(values);\n};\n","/**\n * Policy types for configurable collection behaviors.\n *\n * Policies define how collections handle edge cases like overflow,\n * underflow, and eviction. These are used by behavior decorators\n * to give flexible, composable behavior.\n */\n\n// ============================================================================\n// Overflow Policies - what to do when a bounded collection is full\n// ============================================================================\n\n/**\n * Policy for handling overflow when adding to a full bounded collection.\n *\n * - 'throw': Throw an error when trying to add to a full collection\n * - 'drop-oldest': Remove the oldest element and add the new one\n * - 'drop-newest': Ignore the new element (don't add it)\n * - 'reject': Return false/None but don't throw (graceful failure)\n * - 'grow': Automatically increase capacity (becomes unbounded)\n * - 'block': For async collections, wait until space is available\n */\nexport type OverflowPolicy =\n  | \"throw\"\n  | \"drop-oldest\"\n  | \"drop-newest\"\n  | \"reject\"\n  | \"grow\"\n  | \"block\";\n\n/**\n * Context information given when overflow occurs.\n */\nexport interface OverflowContext<T> {\n  /** The element that triggered the overflow. */\n  readonly newElement: T;\n  /** Current size of the collection. */\n  readonly currentSize: number;\n  /** Maximum capacity of the collection. */\n  readonly capacity: number;\n  /** Timestamp when overflow occurred. */\n  readonly timestamp: number;\n}\n\n/**\n * Callback invoked when overflow occurs.\n * This function can log, record metrics or do custom handling.\n */\nexport type OverflowHandler<T> = (context: OverflowContext<T>) => void;\n\n// ============================================================================\n// Underflow Policies - what to do when removing from an empty collection\n// ============================================================================\n\n/**\n * Policy for handling underflow when removing from an empty collection.\n *\n * - 'throw': Throw an error when trying to remove from empty collection\n * - 'return-none': Return None/undefined (graceful failure)\n * - 'return-default': Give a default value given by user\n * - 'block': For async collections, wait until an element is available\n */\nexport type UnderflowPolicy =\n  | \"throw\"\n  | \"return-none\"\n  | \"return-default\"\n  | \"block\";\n\n/**\n * Context information given when underflow occurs.\n */\nexport interface UnderflowContext {\n  /** The operation that triggered the underflow. */\n  readonly operation: string;\n  /** Timestamp when underflow occurred. */\n  readonly timestamp: number;\n}\n\n/**\n * Callback invoked when underflow occurs.\n */\nexport type UnderflowHandler = (context: UnderflowContext) => void;\n\n// ============================================================================\n// Eviction Policies - how to choose which element to remove\n// ============================================================================\n\n/**\n * Policy for choosing which element to evict from a bounded collection.\n *\n * - 'lru': Least Recently Used - evict element not accessed for longest time\n * - 'lfu': Least Frequently Used - evict element accessed least often\n * - 'fifo': First In First Out - evict oldest inserted element\n * - 'lifo': Last In First Out - evict newest inserted element (stack-like)\n * - 'random': Evict a random element\n * - 'ttl': Time To Live - evict elements that have expired\n * - 'priority': Evict element with lowest priority\n * - 'custom': User-provided eviction function\n */\nexport type EvictionPolicy =\n  | \"lru\"\n  | \"lfu\"\n  | \"fifo\"\n  | \"lifo\"\n  | \"random\"\n  | \"ttl\"\n  | \"priority\"\n  | \"custom\";\n\n/**\n * Metadata tracked for eviction decisions.\n */\nexport interface EvictionMetadata {\n  /** When the element was inserted. */\n  readonly insertedAt: number;\n  /** When the element was last accessed. */\n  lastAccessedAt: number;\n  /** How many times the element has been accessed. */\n  accessCount: number;\n  /** Time-to-live expiration timestamp (if applicable). */\n  readonly expiresAt?: number;\n  /** Priority value (higher = more important, if applicable). */\n  readonly priority?: number;\n}\n\n/**\n * Information about an element that can be evicted.\n */\nexport interface EvictionCandidate<T> {\n  /** The element value. */\n  readonly element: T;\n  /** Eviction metadata for this element. */\n  readonly metadata: EvictionMetadata;\n}\n\n/**\n * Custom eviction function.\n * Given candidates, gives the element to evict.\n */\nexport type EvictionSelector<T> = (\n  candidates: EvictionCandidate<T>[]\n) => T | undefined;\n\n// ============================================================================\n// Retry Policies - for async operations\n// ============================================================================\n\n/**\n * Policy for retrying failed async operations.\n */\nexport interface RetryPolicy {\n  /** Maximum number of retry tries. */\n  readonly maxAttempts: number;\n  /** Initial delay in milliseconds. */\n  readonly initialDelay: number;\n  /** Backoff strategy. */\n  readonly backoff: \"none\" | \"linear\" | \"exponential\";\n  /** Maximum delay cap (for backoff). */\n  readonly maxDelay?: number;\n  /** Jitter to add randomness and avoid thundering herd. */\n  readonly jitter?: boolean;\n}\n\n/**\n * Context for retry decisions.\n */\nexport interface RetryContext {\n  /** Current try number (1-indexed). */\n  readonly attempt: number;\n  /** The error that caused the retry. */\n  readonly error: unknown;\n  /** Elapsed time since first try. */\n  readonly elapsedMs: number;\n}\n\n/**\n * Callback to determine if an error is retryable.\n */\nexport type RetryPredicate = (context: RetryContext) => boolean;\n\n// ============================================================================\n// Conflict Resolution Policies - for concurrent modifications\n// ============================================================================\n\n/**\n * Policy for resolving conflicts when same key is changed concurrently.\n *\n * - 'last-write-wins': Most recent write takes precedence\n * - 'first-write-wins': First write takes precedence\n * - 'merge': Call merge function to combine values\n * - 'throw': Throw an error on conflict\n */\nexport type ConflictResolutionPolicy =\n  | \"last-write-wins\"\n  | \"first-write-wins\"\n  | \"merge\"\n  | \"throw\";\n\n/**\n * Function to merge conflicting values.\n */\nexport type MergeFunction<T> = (current: T, incoming: T) => T;\n\n// ============================================================================\n// Compaction Policies - for memory management\n// ============================================================================\n\n/**\n * Policy for when to compact internal storage.\n */\nexport interface CompactionPolicy {\n  /** Compact when the used part of the capacity drops below this ratio (0-1). */\n  readonly minLoadFactor?: number;\n  /** Compact when wasted space exceeds this many elements. */\n  readonly maxWastedSpace?: number;\n  /** Automatically compact on every removal. */\n  readonly autoCompact?: boolean;\n}\n\n// ============================================================================\n// Growth Policies - for dynamic capacity\n// ============================================================================\n\n/**\n * Policy for how to grow capacity when needed.\n */\nexport interface GrowthPolicy {\n  /** Growth strategy. */\n  readonly strategy: \"double\" | \"linear\" | \"golden-ratio\" | \"custom\";\n  /** For linear growth, how many elements to add. */\n  readonly linearIncrement?: number;\n  /** For custom growth, a function to calculate new capacity. */\n  readonly customGrowth?: (currentCapacity: number) => number;\n  /** Maximum capacity limit (prevent unbounded growth). */\n  readonly maxCapacity?: number;\n}\n\n// ============================================================================\n// Validation Policies - for type checking\n// ============================================================================\n\n/**\n * Validation action when an invalid element is encountered.\n *\n * - 'throw': Throw an error\n * - 'drop': Silently drop the invalid element\n * - 'coerce': Try to coerce to valid type\n * - 'log': Log a warning and continue\n */\nexport type ValidationPolicy = \"throw\" | \"drop\" | \"coerce\" | \"log\";\n\n/**\n * Context for validation failures.\n */\nexport interface ValidationContext<T> {\n  /** The invalid element. */\n  readonly element: T;\n  /** Validation error message/details. */\n  readonly error: unknown;\n  /** The operation that triggered validation. */\n  readonly operation: string;\n}\n\n/**\n * Callback invoked on validation failures.\n */\nexport type ValidationHandler<T> = (context: ValidationContext<T>) => void;\n\n// ============================================================================\n// Default policies\n// ============================================================================\n\n/**\n * Default overflow policy: throw an error.\n */\nexport const DEFAULT_OVERFLOW_POLICY: OverflowPolicy = \"throw\";\n\n/**\n * Default underflow policy: throw an error.\n */\nexport const DEFAULT_UNDERFLOW_POLICY: UnderflowPolicy = \"throw\";\n\n/**\n * Default eviction policy: FIFO (oldest first).\n */\nexport const DEFAULT_EVICTION_POLICY: EvictionPolicy = \"fifo\";\n\n/**\n * Default retry policy: 3 tries with exponential backoff.\n */\nexport const DEFAULT_RETRY_POLICY: RetryPolicy = {\n  maxAttempts: 3,\n  initialDelay: 100,\n  backoff: \"exponential\",\n  maxDelay: 5000,\n  jitter: true,\n};\n\n/**\n * Default conflict resolution: last write wins.\n */\nexport const DEFAULT_CONFLICT_POLICY: ConflictResolutionPolicy =\n  \"last-write-wins\";\n\n/**\n * Default growth policy: double capacity.\n */\nexport const DEFAULT_GROWTH_POLICY: GrowthPolicy = {\n  strategy: \"double\",\n  maxCapacity: Number.MAX_SAFE_INTEGER,\n};\n\n/**\n * Default validation policy: throw on invalid.\n */\nexport const DEFAULT_VALIDATION_POLICY: ValidationPolicy = \"throw\";\n","/**\n * Middleware composition system for collections.\n *\n * This module gives the core composition mechanism. With it, behaviors go in layers\n * on top of collections with the decorator pattern.\n *\n * The mechanism is for synchronous collection operations. The collection instance itself\n * is the context, so a behavior needs no explicit context object.\n *\n * @example\n * const list = compose(\n *   safeList<number>(),\n *   eventedList<number>(),\n *   boundedList<number>({ capacity: 100 })\n * )(arrayList<number>())\n */\n\nimport type { Collection } from \"../interfaces/collection.js\";\nimport { compose as fold, type Chain, type Layer, type Stacked } from \"./layers.js\";\n\n/**\n * A middleware is a function that takes a collection and gives\n * an enhanced version of that collection.\n *\n * This maps to the unified middleware pattern where:\n * - The \"context\" is the collection itself (passed directly, not in a context object)\n * - Execution is synchronous (no Promises)\n * - Type transformation is tracked through In -> Out\n *\n * Middleware can:\n * - Intercept method calls\n * - Add new capabilities\n * - Transform inputs/outputs\n * - Delegate to the next layer\n *\n * @template In The input collection type\n * @template Out The output collection type (defaults to In if not specified)\n */\nexport type Middleware<In = any, Out extends In = In> = (next: In) => Out;\n\n/**\n * Composes multiple middleware layers into a single enhancer function.\n *\n * This function uses reduceRight to make an \"onion\" pattern where the first middleware\n * is the outermost layer (runs first when calling into the collection).\n *\n * The type system properly tracks capability additions through composition.\n *\n * @example\n * // Layer order (outer to inner):\n * // 1. safe - converts throws to Option/Result\n * // 2. evented - emits events on mutations\n * // 3. bounded - enforces capacity limits\n * // 4. base - the underlying ArrayList\n * const enhancer = compose(\n *   safeList<number>(),\n *   eventedList<number>(),\n *   boundedList<number>({ capacity: 100 })\n * )\n * const list = enhancer(arrayList<number>())\n * // Type: List<number> & SafeCollection & EventedCollection & BoundedCollection\n *\n * @param layers The middleware layers to compose\n * @returns A function that applies all layers to a base collection\n */\nexport function compose<const L extends readonly Layer[]>(...layers: L & Chain<L>): Stacked<L> {\n  return fold(...(layers as readonly Layer[])) as unknown as Stacked<L>;\n}\n\n/**\n * Utility to check if a collection has a specific capability.\n * Useful for middleware that wants to conditionally enhance behavior.\n *\n * @example\n * if (hasCapability(collection, 'on')) {\n *   // Collection supports events\n *   collection.on('add', handler)\n * }\n */\nexport const hasCapability = <C extends Collection<any>, K extends keyof any>(\n  collection: C,\n  capability: K\n): collection is C & Record<K, unknown> => {\n  return capability in collection;\n};\n\n/**\n * Marker interface for collections that support events.\n * Middleware can use this to detect event capability.\n */\nexport interface Evented<E extends Record<string, any>> {\n  /**\n   * Subscribe to an event.\n   * @returns Unsubscribe function\n   */\n  on<K extends keyof E>(event: K, handler: (payload: E[K]) => void): () => void;\n\n  /**\n   * Emit an event (internal use by middleware).\n   * @internal\n   */\n  emit?<K extends keyof E>(event: K, payload: E[K]): void;\n}\n\n/**\n * Marker interface for collections that support async operations.\n */\nexport interface Async<T> {\n  /**\n   * Async iterator for consuming elements.\n   */\n  [Symbol.asyncIterator](): AsyncIterator<T>;\n}\n\n/**\n * Marker interface for collections that are bounded.\n */\nexport interface BoundedCollection {\n  /** Maximum capacity */\n  readonly capacity: number;\n  /** If collection is at capacity */\n  readonly isFull: boolean;\n  /** Remaining space */\n  readonly remainingCapacity: number;\n}\n\n/**\n * Marker interface for collections that support safe (Option/Result) operations.\n */\nexport interface SafeCollection {\n  /**\n   * Namespace for safe operations that return Option/Result instead of throwing.\n   */\n  readonly safe: unknown;\n}\n\n/**\n * Type helper to extract the element type from a collection.\n */\nexport type ElementType<C> = C extends {\n  [Symbol.iterator](): Iterator<infer T>;\n}\n  ? T\n  : C extends { get(index: number): infer T }\n  ? T\n  : C extends { peek(): infer T }\n  ? T\n  : never;\n\n/**\n * Type helper to make all methods of a type return their async equivalents.\n */\nexport type Asyncify<C> = {\n  [K in keyof C]: C[K] extends (...args: infer Args) => infer R\n    ? (...args: Args) => Promise<R>\n    : C[K];\n};\n\n/**\n * Helper to make a proxy that intercepts method calls.\n * Useful for implementing middleware that needs to wrap method invocations.\n *\n * @example\n * const logged = interceptMethods(collection, (target, method, args) => {\n *   console.log(`Calling ${String(method)} with`, args)\n *   const result = Reflect.apply(target[method], target, args)\n *   console.log(`Result:`, result)\n *   return result\n * })\n */\nexport const interceptMethods = <C extends object>(\n  target: C,\n  interceptor: (target: C, method: keyof C, args: unknown[]) => unknown\n): C => {\n  return new Proxy(target, {\n    get(t, prop, receiver) {\n      const value = Reflect.get(t, prop, receiver);\n      if (typeof value === \"function\" && typeof prop === \"string\") {\n        return function (this: unknown, ...args: unknown[]) {\n          return interceptor(t, prop as keyof C, args);\n        };\n      }\n      return value;\n    },\n  });\n};\n\n/**\n * Helper to make a readonly view of a collection by blocking mutating methods.\n *\n * @param mutatingMethods Set of method names that the middleware blocks\n * @param errorMessage Custom error message to throw\n */\nexport const blockMethods = <C extends object>(\n  target: C,\n  mutatingMethods: Set<string | symbol>,\n  errorMessage: string = \"Operation not allowed\"\n): C => {\n  return new Proxy(target, {\n    get(t, prop, receiver) {\n      const value = Reflect.get(t, prop, receiver);\n      if (typeof value === \"function\" && mutatingMethods.has(prop)) {\n        return () => {\n          throw new Error(errorMessage);\n        };\n      }\n      return value;\n    },\n  });\n};\n\n/**\n * Helper to delegate method calls to a target while maintaining correct context.\n * Useful when wrapping collections.\n */\nexport const delegate = <C extends object, T extends C>(\n  target: T,\n  wrapper: Partial<C>\n): C => {\n  return new Proxy(target, {\n    get(t, prop, receiver) {\n      // If wrapper has the property, use it\n      if (prop in wrapper) {\n        return Reflect.get(wrapper, prop, receiver);\n      }\n      // Otherwise delegate to target\n      const value = Reflect.get(t, prop, receiver);\n      // Bind methods to maintain correct 'this' context\n      if (typeof value === \"function\") {\n        return value.bind(t);\n      }\n      return value;\n    },\n  }) as C;\n};\n\n/**\n * Utility type to add optional capabilities to a collection type.\n */\nexport type WithCapability<C, Cap> = C & Cap;\n\n/**\n * Builder pattern helper for fluent API construction.\n *\n * @example\n * class ListBuilder<T> {\n *   private middleware: Middleware<List<T>>[] = []\n *\n *   bounded(capacity: number) {\n *     this.middleware.push(boundedList({ capacity }))\n *     return this\n *   }\n *\n *   evented() {\n *     this.middleware.push(eventedList())\n *     return this\n *   }\n *\n *   build(): List<T> {\n *     return compose(...this.middleware)(arrayList<T>())\n *   }\n * }\n */\nexport abstract class CollectionBuilder<C> {\n  protected middleware: Middleware<C>[] = [];\n\n  /**\n   * Apply a custom middleware.\n   */\n  use(middleware: Middleware<C>): this {\n    this.middleware.push(middleware);\n    return this;\n  }\n\n  /**\n   * Build the final collection by composing all middleware with the base.\n   */\n  abstract build(): C;\n}\n\n/**\n * Utility to make a middleware that only enhances specific methods.\n *\n * @example\n * const logAdd = enhanceMethod('add', (original, args) => {\n *   console.log('Adding:', args[0])\n *   return original(...args)\n * })\n */\nexport const enhanceMethod = <C extends object, K extends keyof C & string>(\n  methodName: K,\n  enhancer: (\n    original: C[K] extends (...args: infer Args) => infer R\n      ? (...args: Args) => R\n      : never,\n    args: C[K] extends (...args: infer Args) => any ? Args : never\n  ) => C[K] extends (...args: any[]) => infer R ? R : never\n): Middleware<C> => {\n  return (next: C): C => {\n    type MethodArgs = C[K] extends (...args: infer Args) => any ? Args : never;\n    return new Proxy(next, {\n      get(target, prop, receiver) {\n        const value = Reflect.get(target, prop, receiver);\n        if (prop === methodName && typeof value === \"function\") {\n          return function (this: unknown, ...args: unknown[]) {\n            return enhancer(value.bind(target), args as MethodArgs);\n          };\n        }\n        return value;\n      },\n    });\n  };\n};\n\n/**\n * This function combines multiple middleware into a single middleware.\n * Useful for making reusable middleware bundles.\n *\n * Bundle has the same composition semantics as compose - the first middleware\n * is the outermost layer, and types are tracked through the chain.\n *\n * @example\n * const standardBehaviors = bundle(\n *   boundedList<number>({ capacity: 1000 }),\n *   eventedList<number>(),\n *   safeList<number>()\n * )\n *\n * const list = compose(standardBehaviors)(arrayList<number>())\n */\nexport const bundle: typeof compose = compose;\n","/**\n * Typed event emitter system for collections.\n *\n * This function gives a lightweight, type-safe event system for mutation events\n * and other observable behavior. Events are strongly typed using\n * TypeScript's mapped types.\n */\n\n/**\n * A listener function that receives an event payload.\n */\nexport type Listener<P> = (payload: P) => void;\n\n/**\n * A function to unsubscribe from an event.\n */\nexport type Unsubscribe = () => void;\n\n/**\n * Event map defining event names and their payload types.\n *\n * @example\n * interface MyEvents {\n *   add: { value: number; index: number }\n *   remove: { value: number }\n *   clear: {}\n * }\n */\nexport type EventMap = Record<string, any>;\n\n/**\n * Type-safe event emitter.\n *\n * This class supports subscribing to events, emitting events, and managing listeners.\n * All event names and payloads are type-checked at compile time.\n *\n * @example\n * interface ListEvents<T> {\n *   add: { value: T; index: number }\n *   remove: { value: T; index: number }\n *   clear: {}\n * }\n *\n * const emitter = new Emitter<ListEvents<number>>()\n *\n * const unsub = emitter.on('add', ({ value, index }) => {\n *   console.log(`Added ${value} at ${index}`)\n * })\n *\n * emitter.emit('add', { value: 42, index: 0 })\n * unsub() // Unsubscribe\n */\nexport class Emitter<E extends EventMap> {\n  private listeners = new Map<keyof E, Set<Listener<any>>>();\n\n  /**\n   * Subscribe to an event.\n   *\n   * @param event The event name\n   * @param listener The callback to invoke when event is emitted\n   * @returns A function to unsubscribe\n   */\n  on<K extends keyof E>(event: K, listener: Listener<E[K]>): Unsubscribe {\n    let listeners = this.listeners.get(event);\n    if (!listeners) {\n      listeners = new Set();\n      this.listeners.set(event, listeners);\n    }\n    listeners.add(listener);\n\n    // Return unsubscribe function\n    return () => {\n      listeners!.delete(listener);\n      // Clean up empty sets\n      if (listeners!.size === 0) {\n        this.listeners.delete(event);\n      }\n    };\n  }\n\n  /**\n   * Subscribe to an event, but automatically unsubscribe after first emission.\n   *\n   * @param event The event name\n   * @param listener The callback to invoke once\n   * @returns A function to unsubscribe (in case you want to cancel before emission)\n   */\n  once<K extends keyof E>(event: K, listener: Listener<E[K]>): Unsubscribe {\n    const wrappedListener: Listener<E[K]> = (payload) => {\n      unsubscribe();\n      listener(payload);\n    };\n\n    const unsubscribe = this.on(event, wrappedListener);\n    return unsubscribe;\n  }\n\n  /**\n   * Emit an event to all registered listeners.\n   *\n   * @param event The event name\n   * @param payload The event payload\n   */\n  emit<K extends keyof E>(event: K, payload: E[K]): void {\n    const listeners = this.listeners.get(event);\n    if (listeners) {\n      // Create a snapshot to avoid issues if listeners modify the set\n      const snapshot = Array.from(listeners);\n      for (const listener of snapshot) {\n        try {\n          listener(payload);\n        } catch (error) {\n          // Log error but don't stop other listeners\n          console.error(\n            `Error in event listener for '${String(event)}':`,\n            error\n          );\n        }\n      }\n    }\n  }\n\n  /**\n   * Remove all listeners for a specific event, or all events if no event specified.\n   *\n   * @param event Optional event name to clear listeners for\n   */\n  off<K extends keyof E>(event?: K): void {\n    if (event !== undefined) {\n      this.listeners.delete(event);\n    } else {\n      this.listeners.clear();\n    }\n  }\n\n  /**\n   * Get the number of listeners for a specific event.\n   *\n   * @param event The event name\n   * @returns Number of registered listeners\n   */\n  listenerCount<K extends keyof E>(event: K): number {\n    return this.listeners.get(event)?.size ?? 0;\n  }\n\n  /**\n   * Get all event names that have at least one listener.\n   */\n  eventNames(): (keyof E)[] {\n    return Array.from(this.listeners.keys());\n  }\n\n  /**\n   * Check if there are any listeners for a specific event.\n   */\n  hasListeners<K extends keyof E>(event: K): boolean {\n    return this.listenerCount(event) > 0;\n  }\n\n  /**\n   * Remove all listeners and clean up resources.\n   */\n  dispose(): void {\n    this.listeners.clear();\n  }\n}\n\n/**\n * Make an event emitter for a specific event map.\n *\n * This is a convenience factory function.\n *\n * @example\n * const events = createEmitter<ListEvents<number>>()\n */\nexport const createEmitter = <E extends EventMap>(): Emitter<E> => {\n  return new Emitter<E>();\n};\n\n/**\n * Event batching utility for reducing event noise.\n * This class collects events and emits them in batches.\n *\n * @example\n * const batcher = new EventBatcher(emitter, 'add', 100)\n * batcher.queue({ value: 1, index: 0 })\n * batcher.queue({ value: 2, index: 1 })\n * // After 100ms or flush(), emits single 'batch-add' event with both items\n */\nexport class EventBatcher<E extends EventMap, K extends keyof E> {\n  private emitter: Emitter<E & { [P in `batch-${K & string}`]: E[K][] }>;\n  private event: K;\n  private delayMs: number;\n  private batch: E[K][] = [];\n  private timer: ReturnType<typeof setTimeout> | null = null;\n\n  constructor(\n    emitter: Emitter<E & { [P in `batch-${K & string}`]: E[K][] }>,\n    event: K,\n    delayMs: number\n  ) {\n    this.emitter = emitter;\n    this.event = event;\n    this.delayMs = delayMs;\n  }\n\n  /**\n   * Add an event to the current batch.\n   */\n  queue(payload: E[K]): void {\n    this.batch.push(payload);\n\n    if (this.timer === null) {\n      this.timer = setTimeout(() => this.flush(), this.delayMs);\n    }\n  }\n\n  /**\n   * Immediately emit all batched events.\n   */\n  flush(): void {\n    if (this.timer !== null) {\n      clearTimeout(this.timer);\n      this.timer = null;\n    }\n\n    if (this.batch.length > 0) {\n      const batchEvent = `batch-${String(this.event)}` as keyof (E & { [P in `batch-${K & string}`]: E[K][] });\n      this.emitter.emit(batchEvent, this.batch as any);\n      this.batch = [];\n    }\n  }\n\n  /**\n   * Clean up resources.\n   */\n  dispose(): void {\n    this.flush();\n  }\n}\n\n/**\n * Async event emitter that gives promises.\n * This class waits for all async listeners to complete.\n *\n * @example\n * const emitter = new AsyncEmitter<{ save: { data: string } }>()\n *\n * emitter.on('save', async ({ data }) => {\n *   await database.save(data)\n * })\n *\n * await emitter.emit('save', { data: 'test' }) // Waits for save\n */\nexport class AsyncEmitter<E extends EventMap> {\n  private listeners = new Map<keyof E, Set<Listener<any>>>();\n\n  on<K extends keyof E>(event: K, listener: Listener<E[K]>): Unsubscribe {\n    let listeners = this.listeners.get(event);\n    if (!listeners) {\n      listeners = new Set();\n      this.listeners.set(event, listeners);\n    }\n    listeners.add(listener);\n\n    return () => {\n      listeners!.delete(listener);\n      if (listeners!.size === 0) {\n        this.listeners.delete(event);\n      }\n    };\n  }\n\n  /**\n   * Emit an event and wait for all async listeners to complete.\n   *\n   * @param event The event name\n   * @param payload The event payload\n   * @returns Promise that resolves when all listeners complete\n   */\n  async emit<K extends keyof E>(event: K, payload: E[K]): Promise<void> {\n    const listeners = this.listeners.get(event);\n    if (listeners) {\n      const promises = Array.from(listeners).map((listener) =>\n        Promise.resolve().then(() => listener(payload))\n      );\n      await Promise.all(promises);\n    }\n  }\n\n  off<K extends keyof E>(event?: K): void {\n    if (event !== undefined) {\n      this.listeners.delete(event);\n    } else {\n      this.listeners.clear();\n    }\n  }\n\n  listenerCount<K extends keyof E>(event: K): number {\n    return this.listeners.get(event)?.size ?? 0;\n  }\n\n  eventNames(): (keyof E)[] {\n    return Array.from(this.listeners.keys());\n  }\n\n  dispose(): void {\n    this.listeners.clear();\n  }\n}\n\n/**\n * Utility to forward events from one emitter to another.\n * Useful for composing event sources.\n *\n * @example\n * const child = new Emitter<ChildEvents>()\n * const parent = new Emitter<ParentEvents>()\n *\n * forwardEvent(child, parent, 'childEvent', 'parentEvent')\n */\nexport const forwardEvent = <\n  E1 extends EventMap,\n  E2 extends EventMap,\n  K1 extends keyof E1,\n  K2 extends keyof E2\n>(\n  source: Emitter<E1>,\n  target: Emitter<E2>,\n  sourceEvent: K1,\n  targetEvent: K2,\n  transform?: (payload: E1[K1]) => E2[K2]\n): Unsubscribe => {\n  return source.on(sourceEvent, (payload) => {\n    const transformedPayload = transform\n      ? transform(payload)\n      : (payload as any);\n    target.emit(targetEvent, transformedPayload);\n  });\n};\n\n/**\n * Make a filtered event subscription that only fires when predicate is true.\n *\n * @example\n * const emitter = new Emitter<{ change: { value: number } }>()\n *\n * onWhen(emitter, 'change', ({ value }) => value > 10, ({ value }) => {\n *   console.log('Value exceeded 10:', value)\n * })\n */\nexport const onWhen = <E extends EventMap, K extends keyof E>(\n  emitter: Emitter<E>,\n  event: K,\n  predicate: (payload: E[K]) => boolean,\n  listener: Listener<E[K]>\n): Unsubscribe => {\n  return emitter.on(event, (payload) => {\n    if (predicate(payload)) {\n      listener(payload);\n    }\n  });\n};\n","/**\n * A set of listeners for the events of a storage: the change batches of `observe()`, or the status\n * of a sync. A storage package uses it, so each storage treats its listeners in the same way.\n */\n\n/** The function that gets the error of a listener. */\nexport type ListenerErrorHandler = (error: unknown) => void;\n\n/**\n * The default handler of the error of a listener. It throws the error again in a microtask, as an\n * `EventTarget` reports the error of a listener. Thus the error is not lost, and the write that\n * sent the event does not fail.\n */\nexport const reportListenerError: ListenerErrorHandler = (error) => {\n  queueMicrotask(() => {\n    throw error;\n  });\n};\n\n/**\n * The listeners of one kind of event.\n *\n * - `emit()` gives the event to each listener, in the order of `add()`.\n * - A listener that `add()` gets during an `emit()` gets the next event, not this one.\n * - The error of a listener goes to the error handler. The other listeners get the event.\n * - The same function can be added two times. Each `add()` gives its own function that removes it.\n */\nexport class StorageListeners<E> {\n  private readonly listeners = new Set<{ readonly listener: (event: E) => void }>();\n  private readonly onError: ListenerErrorHandler;\n\n  /** @param onError - The function that gets the error of a listener. The default is `reportListenerError`. */\n  constructor(onError: ListenerErrorHandler = reportListenerError) {\n    this.onError = onError;\n  }\n\n  /** The number of listeners. */\n  get size(): number {\n    return this.listeners.size;\n  }\n\n  /**\n   * This method adds a listener.\n   *\n   * @returns The function that removes the listener. A second use of it does nothing.\n   */\n  add(listener: (event: E) => void): () => void {\n    const entry = { listener };\n    this.listeners.add(entry);\n    return () => {\n      this.listeners.delete(entry);\n    };\n  }\n\n  /** This method gives the event to each listener. */\n  emit(event: E): void {\n    for (const entry of [...this.listeners]) {\n      // A listener that a listener before it removed gets no event\n      if (!this.listeners.has(entry)) continue;\n      try {\n        entry.listener(event);\n      } catch (error) {\n        this.onError(error);\n      }\n    }\n  }\n\n  /** This method removes each listener. */\n  clear(): void {\n    this.listeners.clear();\n  }\n}\n","/**\n * The keys of an ordered list: fractional indexing with base-62 keys. A\n * key is a string. Each item of the list keeps one, and the list sorts by it. An item that moves\n * between two others gets a key between theirs, so a move writes one item and no other.\n *\n * - A key has an integer part and a fraction part. The first character of the integer part gives its\n *   length. An insertion at an end changes the integer part, so the keys stay short.\n * - An insertion between two keys uses the fraction part, which can grow without a limit. Thus the keys\n *   do not run out, and the list needs no rebalance.\n * - Compare two keys by the code units of the strings (`a < b`), not with `localeCompare`.\n * - Two writers that move items into the same gap at the same time can get the same key. Sort by the\n *   key, then by the id of the item, so each reader sees one order.\n *\n * The algorithm is the one of the `fractional-indexing` package of Rocicorp (CC0), after the article\n * \"Implementing Fractional Indexing\" of David Greenspan.\n */\n\n/** The digits of a key, in ascending order of their code units. */\nexport const KEY_DIGITS = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\";\n\nconst ZERO = KEY_DIGITS[0]!;\nconst LAST = KEY_DIGITS[KEY_DIGITS.length - 1]!;\n/** The smallest integer part. No key comes before it. */\nconst SMALLEST_INTEGER = `A${ZERO.repeat(26)}`;\n\nfunction invalid(message: string): RangeError {\n  return new RangeError(message);\n}\n\n/** This function gives the length of an integer part from its head character: a to z and Z to A give 2 to 27. */\nfunction integerLength(head: string): number {\n  if (head >= \"a\" && head <= \"z\") return head.charCodeAt(0) - \"a\".charCodeAt(0) + 2;\n  if (head >= \"A\" && head <= \"Z\") return \"Z\".charCodeAt(0) - head.charCodeAt(0) + 2;\n  throw invalid(`A key cannot start with \"${head}\"`);\n}\n\nfunction integerPart(key: string): string {\n  const length = integerLength(key[0] ?? \"\");\n  if (length > key.length) throw invalid(`The key \"${key}\" is too short for its integer part`);\n  return key.slice(0, length);\n}\n\nfunction validateKey(key: string): void {\n  if (typeof key !== \"string\" || key === \"\") throw invalid(\"A key is a string that is not empty\");\n  for (const c of key) if (!KEY_DIGITS.includes(c)) throw invalid(`The key \"${key}\" has a character that is no digit of a key`);\n  if (key === SMALLEST_INTEGER) throw invalid(`The key \"${key}\" is reserved`);\n  const fraction = key.slice(integerPart(key).length);\n  if (fraction.endsWith(ZERO)) throw invalid(`The fraction part of the key \"${key}\" ends with ${ZERO}`);\n}\n\n/** A fraction strictly between two fractions. `b` null is the end. Neither one ends with the zero digit. */\nfunction midpoint(a: string, b: string | null): string {\n  if (b !== null) {\n    let n = 0;\n    while ((a[n] ?? ZERO) === b[n]) n++;\n    if (n > 0) return b.slice(0, n) + midpoint(a.slice(n), b.slice(n));\n  }\n  const digitA = a ? KEY_DIGITS.indexOf(a[0]!) : 0;\n  const digitB = b !== null ? KEY_DIGITS.indexOf(b[0]!) : KEY_DIGITS.length;\n  if (digitB - digitA > 1) return KEY_DIGITS[Math.round((digitA + digitB) / 2)]!;\n  // The first digits are next to each other\n  if (b !== null && b.length > 1) return b.slice(0, 1);\n  return KEY_DIGITS[digitA]! + midpoint(a.slice(1), null);\n}\n\nfunction incrementInteger(x: string): string | null {\n  const [head, ...digits] = x.split(\"\") as [string, ...string[]];\n  let carry = true;\n  for (let i = digits.length - 1; carry && i >= 0; i--) {\n    const d = KEY_DIGITS.indexOf(digits[i]!) + 1;\n    if (d === KEY_DIGITS.length) digits[i] = ZERO;\n    else {\n      digits[i] = KEY_DIGITS[d]!;\n      carry = false;\n    }\n  }\n  if (!carry) return head + digits.join(\"\");\n  if (head === \"Z\") return `a${ZERO}`;\n  if (head === \"z\") return null;\n  const next = String.fromCharCode(head.charCodeAt(0) + 1);\n  if (next > \"a\") digits.push(ZERO);\n  else digits.pop();\n  return next + digits.join(\"\");\n}\n\nfunction decrementInteger(x: string): string | null {\n  const [head, ...digits] = x.split(\"\") as [string, ...string[]];\n  let borrow = true;\n  for (let i = digits.length - 1; borrow && i >= 0; i--) {\n    const d = KEY_DIGITS.indexOf(digits[i]!) - 1;\n    if (d === -1) digits[i] = LAST;\n    else {\n      digits[i] = KEY_DIGITS[d]!;\n      borrow = false;\n    }\n  }\n  if (!borrow) return head + digits.join(\"\");\n  if (head === \"a\") return `Z${LAST}`;\n  if (head === \"A\") return null;\n  const next = String.fromCharCode(head.charCodeAt(0) - 1);\n  if (next < \"Z\") digits.push(LAST);\n  else digits.pop();\n  return next + digits.join(\"\");\n}\n\n/**\n * This function gives a key strictly between two keys. Without `prev`, the key comes before `next`.\n * Without `next`, it comes after `prev`. Without both, it gives the first key of a list (\"a0\").\n *\n * @throws RangeError when a key is not valid, or when `prev` is not before `next`\n *\n * @example\n * ```ts\n * keyBetween(undefined, undefined); // \"a0\"\n * keyBetween(\"a0\", undefined); // \"a1\", after a0\n * keyBetween(\"a0\", \"a1\"); // \"a0V\"\n * ```\n */\nexport function keyBetween(prev: string | null | undefined, next: string | null | undefined): string {\n  const a = prev ?? null;\n  const b = next ?? null;\n  if (a !== null) validateKey(a);\n  if (b !== null) validateKey(b);\n  if (a !== null && b !== null && a >= b) throw invalid(`The key \"${a}\" is not before the key \"${b}\"`);\n  if (a === null) {\n    if (b === null) return `a${ZERO}`;\n    const ib = integerPart(b);\n    const fb = b.slice(ib.length);\n    if (ib === SMALLEST_INTEGER) return ib + midpoint(\"\", fb);\n    if (ib < b) return ib;\n    const decremented = decrementInteger(ib);\n    if (decremented === null) throw invalid(\"No key comes before this one\");\n    return decremented;\n  }\n  const ia = integerPart(a);\n  const fa = a.slice(ia.length);\n  if (b === null) {\n    const incremented = incrementInteger(ia);\n    return incremented === null ? ia + midpoint(fa, null) : incremented;\n  }\n  const ib = integerPart(b);\n  const fb = b.slice(ib.length);\n  if (ia === ib) return ia + midpoint(fa, fb);\n  const incremented = incrementInteger(ia);\n  if (incremented === null) throw invalid(\"No key comes after this one\");\n  if (incremented < b) return incremented;\n  return ia + midpoint(fa, null);\n}\n\n/**\n * This function gives `count` keys in ascending order, strictly between two keys.\n * Use it to put several items at one place, or to give keys to a new list.\n *\n * @throws RangeError as `keyBetween`, or when `count` is not an integer of 0 or more\n */\nexport function keysBetween(prev: string | null | undefined, next: string | null | undefined, count: number): string[] {\n  if (!Number.isInteger(count) || count < 0) throw invalid(`A count of keys is an integer of 0 or more, not ${count}`);\n  const a = prev ?? null;\n  const b = next ?? null;\n  if (count === 0) return [];\n  if (count === 1) return [keyBetween(a, b)];\n  if (b === null) {\n    const keys = [keyBetween(a, null)];\n    for (let i = 1; i < count; i++) keys.push(keyBetween(keys[i - 1]!, null));\n    return keys;\n  }\n  if (a === null) {\n    const keys = [keyBetween(null, b)];\n    for (let i = 1; i < count; i++) keys.push(keyBetween(null, keys[i - 1]!));\n    return keys.reverse();\n  }\n  const half = Math.floor(count / 2);\n  const middle = keyBetween(a, b);\n  return [...keysBetween(a, middle, half), middle, ...keysBetween(middle, b, count - half - 1)];\n}\n\n/** The options of `isValidKey`. */\nexport interface KeyCheckOptions {\n  /** The longest key that the check accepts. The default is 1024 characters. */\n  readonly maxLength?: number;\n}\n\n/**\n * This function tells if a value is a valid key, for example a key that a client writes. A key that\n * is longer than `maxLength` is not valid.\n */\nexport function isValidKey(key: unknown, options: KeyCheckOptions = {}): key is string {\n  if (typeof key !== \"string\" || key.length > (options.maxLength ?? 1024)) return false;\n  try {\n    validateKey(key);\n    return true;\n  } catch {\n    return false;\n  }\n}\n\n/** An item of an ordered list: its id and its key. */\nexport interface KeyedItem {\n  readonly id: string;\n  readonly key: string;\n}\n\n/**\n * This function gives the writes of a move: the new key of the item that moves, and new keys for the\n * neighbors that need them. Give the other items of the list in order (by key, then by id), without\n * the item that moves. Also give the index of the drop, from 0 to their number (`dropIndex`).\n *\n * Two writers can give two items one key. A drop between two such items has no key between them.\n * So the helper first gives new keys to the items after the drop that have the key of the item before\n * it. Each write is `{ id, key }`. The writes of the neighbors come first, and the write of the item\n * that moves comes last.\n *\n * @throws RangeError when the index is outside the list, when the list holds the item that moves, or\n * when a key is not valid\n *\n * @example\n * ```ts\n * const index = dropIndex(pointer, others.map(centerOf));\n * for (const { id, key } of keysForDrop(others, index, dragged.id)) await save(id, { rank: key });\n * ```\n */\nexport function keysForDrop(items: readonly KeyedItem[], index: number, movingId: string): Array<{ id: string; key: string }> {\n  if (!Number.isInteger(index) || index < 0 || index > items.length) throw invalid(`The index ${index} is outside the list of ${items.length} items`);\n  if (items.some((item) => item.id === movingId)) throw invalid(`The list holds the item that moves (${movingId})`);\n  const prev = items[index - 1]?.key ?? null;\n  // The items from the index on that do not come after the item before the drop need new keys\n  let end = index;\n  while (end < items.length && prev !== null && items[end]!.key <= prev) end++;\n  const writes: Array<{ id: string; key: string }> = [];\n  if (end > index) {\n    const keys = keysBetween(prev, items[end]?.key ?? null, end - index);\n    for (let i = index; i < end; i++) writes.push({ id: items[i]!.id, key: keys[i - index]! });\n  }\n  const next = writes.length > 0 ? writes[0]!.key : (items[index]?.key ?? null);\n  writes.push({ id: movingId, key: keyBetween(prev, next) });\n  return writes;\n}\n\n/** The order of two keys: the code units of the strings, as the keys need (not `localeCompare`). */\nexport function compareKeys(a: string, b: string): number {\n  return a < b ? -1 : a > b ? 1 : 0;\n}\n\n/** A point, for example the center of an item on the screen. */\nexport interface Point {\n  readonly x: number;\n  readonly y: number;\n}\n\n/**\n * This function gives the index at which a point goes among the items of a list on the screen.\n * The reading order is the rows from top to bottom, and each row from left to right.\n * The index is that of the first item whose center comes after the point, from 0 to the number of items. A center within\n * `rowTolerance` of the point on the vertical axis is in the row of the point.\n *\n * Give the centers in reading order, the same order as the keys, and without the item that moves.\n *\n * @example\n * ```ts\n * const index = dropIndex(pointer, others.map(centerOf));\n * const key = keyBetween(keys[index - 1], keys[index]);\n * ```\n */\nexport function dropIndex(point: Point, centers: readonly Point[], rowTolerance = 24): number {\n  for (let i = 0; i < centers.length; i++) {\n    const c = centers[i]!;\n    if (point.y < c.y - rowTolerance) return i;\n    if (Math.abs(point.y - c.y) <= rowTolerance && point.x < c.x) return i;\n  }\n  return centers.length;\n}\n","/**\n * Default implementations of equality, hashing, and comparison functions.\n *\n * This module gives sensible defaults for primitive types and utilities for\n * making custom comparators.\n */\n\nimport type { Eq, Hash, Compare } from \"../core/traits.js\";\n\n// ============================================================================\n// Default Equality\n// ============================================================================\n\n/**\n * Default equality using strict equality (===).\n * Works for primitives and reference equality for objects.\n */\nexport const defaultEq: Eq<any> = (a, b) => a === b;\n\n/**\n * Structural equality for objects (shallow comparison of properties).\n * This function compares own enumerable properties using ===.\n */\nexport const shallowEq: Eq<any> = (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\n  const keysA = Object.keys(a);\n  const keysB = Object.keys(b);\n\n  if (keysA.length !== keysB.length) return false;\n\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\n  return true;\n};\n\n/** SameValueZero: the meaning of `===`, and NaN equals NaN. */\nconst sameValueZero = (a: unknown, b: unknown): boolean => a === b || (Number.isNaN(a) && Number.isNaN(b));\n\nconst isObject = (value: unknown): value is object => typeof value === \"object\" && value !== null;\n\n/** The pairs that one comparison holds equal. The log lets a failed try remove its pairs. */\ninterface HeldPairs {\n  readonly partners: Map<object, Set<object>>;\n  readonly log: [object, object][];\n}\n\nfunction releasePairs(held: HeldPairs, mark: number): void {\n  while (held.log.length > mark) {\n    const [a, b] = held.log.pop()!;\n    held.partners.get(a)?.delete(b);\n  }\n}\n\nfunction equalElements(a: ArrayLike<unknown>, b: ArrayLike<unknown>): boolean {\n  if (a.length !== b.length) return false;\n  for (let i = 0; i < a.length; i++) {\n    if (!sameValueZero(a[i], b[i])) return false;\n  }\n  return true;\n}\n\n/** The kinds of `equalObjects` and `hashFields`, so that the relation and its hash stay in step. */\nconst isBinary = (value: object): value is ArrayBufferLike | DataView =>\n  value instanceof DataView || value instanceof ArrayBuffer || (typeof SharedArrayBuffer !== \"undefined\" && value instanceof SharedArrayBuffer);\n\nconst isOpaque = (value: object): boolean => value instanceof Promise || value instanceof WeakMap || value instanceof WeakSet || value instanceof WeakRef;\n\nconst isBoxed = (value: object): boolean =>\n  value instanceof Number || value instanceof String || value instanceof Boolean || value instanceof BigInt || value instanceof Symbol;\n\nfunction bytesOf(value: ArrayBufferLike | DataView): Uint8Array {\n  return ArrayBuffer.isView(value) ? new Uint8Array(value.buffer, value.byteOffset, value.byteLength) : new Uint8Array(value);\n}\n\nfunction enumerableKeys(value: object): (string | symbol)[] {\n  return Reflect.ownKeys(value).filter((key) => Object.prototype.propertyIsEnumerable.call(value, key));\n}\n\nfunction equalKeys(a: any, b: any, held: HeldPairs): boolean {\n  const keys = enumerableKeys(a);\n  if (keys.length !== enumerableKeys(b).length) return false;\n  return keys.every((key) => Object.prototype.propertyIsEnumerable.call(b, key) && equalValues(a[key], b[key], held));\n}\n\n/**\n * The comparison of the entries of two maps, or of the members of two sets. A primitive key finds\n * its partner by `has`. An object key tries each object key of `b` that is not taken yet. The first\n * partner is correct, because the relation is an equivalence.\n */\nfunction equalEntries(a: Map<unknown, unknown> | Set<unknown>, b: Map<unknown, unknown> | Set<unknown>, held: HeldPairs): boolean {\n  if (a.size !== b.size) return false;\n  const valueAt = (key: unknown): unknown => (b instanceof Map ? b.get(key) : key);\n  const free = [...b.entries()].filter(([key]) => isObject(key));\n  for (const [key, value] of a.entries()) {\n    if (!isObject(key)) {\n      if (!b.has(key) || !equalValues(value, valueAt(key), held)) return false;\n      continue;\n    }\n    const at = free.findIndex(([otherKey, otherValue]) => {\n      const mark = held.log.length;\n      if (equalValues(key, otherKey, held) && equalValues(value, otherValue, held)) return true;\n      releasePairs(held, mark);\n      return false;\n    });\n    if (at < 0) return false;\n    free.splice(at, 1);\n  }\n  return true;\n}\n\n/** The comparison of two objects with the same prototype. */\nfunction equalObjects(a: any, b: any, held: HeldPairs): boolean {\n  if (Array.isArray(a) || Array.isArray(b)) {\n    if (!Array.isArray(a) || !Array.isArray(b) || a.length !== b.length) return false;\n    for (let i = 0; i < a.length; i++) {\n      if (!equalValues(a[i], b[i], held)) return false;\n    }\n    return true;\n  }\n  if (isBinary(a)) return equalElements(bytesOf(a), bytesOf(b));\n  if (ArrayBuffer.isView(a)) return equalElements(a as unknown as ArrayLike<unknown>, b);\n  if (isOpaque(a)) return false;\n  if (a instanceof Date && !sameValueZero(a.getTime(), b.getTime())) return false;\n  if (a instanceof RegExp && (a.source !== b.source || a.flags !== b.flags)) return false;\n  if (a instanceof Error && !(a.name === b.name && a.message === b.message && equalValues(a.cause, b.cause, held))) return false;\n  if (isBoxed(a) && !sameValueZero(a.valueOf(), b.valueOf())) return false;\n  if ((a instanceof Map || a instanceof Set) && !equalEntries(a, b, held)) return false;\n  return equalKeys(a, b, held);\n}\n\n/**\n * The comparison of two values. A pair stays held after it passes, so a shared or cyclic part\n * costs one visit. A failure ends the whole comparison, or the try in `equalEntries`, which\n * releases its pairs.\n */\nfunction equalValues(a: unknown, b: unknown, held: HeldPairs): boolean {\n  if (sameValueZero(a, b)) return true;\n  if (!isObject(a) || !isObject(b)) return false;\n  if (Object.getPrototypeOf(a) !== Object.getPrototypeOf(b)) return false;\n  let partners = held.partners.get(a);\n  if (partners?.has(b)) return true;\n  if (partners === undefined) {\n    partners = new Set();\n    held.partners.set(a, partners);\n  }\n  partners.add(b);\n  held.log.push([a, b]);\n  return equalObjects(a, b, held);\n}\n\n/**\n * Deep structural equality. This relation is an equivalence: it is reflexive, symmetric and\n * transitive, for each value.\n *\n * - Primitives compare by SameValueZero: NaN equals NaN, and 0 equals -0.\n * - Two objects must have the same prototype. So `{}` differs from `Object.create(null)`, from an\n *   instance of a class with the same keys, and from an object of another realm.\n * - Arrays compare by length and by index. A hole equals `undefined`.\n * - Typed arrays compare by element. `ArrayBuffer`, `SharedArrayBuffer` and `DataView` compare by byte.\n * - `Date` compares by time, `RegExp` by source and flags, and `Error` by name, message and cause.\n * - A boxed primitive compares by its value. `Map` and `Set` compare by entries, in any order. An object key\n *   matches a deep-equal key.\n * - Each other object compares by its own enumerable keys, strings and symbols, in any order. The objects above do too,\n *   except arrays and binary data.\n * - Functions, `Promise`, `WeakMap`, `WeakSet` and `WeakRef` compare by identity.\n * - Cycles are safe: two cyclic values are equal when they unfold to the same infinite tree.\n *\n * The recursion follows the depth of the data, so a very deep value can exhaust the stack.\n * `defaultHash` agrees with this relation: two equal values have one hash.\n */\nexport const deepEq: Eq<any> = (a, b): boolean => equalValues(a, b, { partners: new Map(), log: [] });\n\n/**\n * Equality by comparing a specific property.\n *\n * @example\n * const userEq = eqBy<User, 'id'>('id')\n * // or with accessor function:\n * const userEq = eqBy<User>((u) => u.id)\n */\nexport const eqBy = <T, K extends keyof T = keyof T>(\n  keyOrFn: K | ((value: T) => any)\n): Eq<T> => {\n  const accessor = typeof keyOrFn === \"function\" ? keyOrFn : (v: T) => v[keyOrFn];\n  return (a, b) => accessor(a) === accessor(b);\n};\n\n// ============================================================================\n// Default Hashing\n// ============================================================================\n\n/** The hash of one primitive or function. */\nfunction hashPrimitive(value: unknown): number {\n  if (value === null) return 0;\n  if (value === undefined) return 1;\n  switch (typeof value) {\n    case \"boolean\":\n      return value ? 1 : 0;\n    case \"number\":\n      return hashNumber(value);\n    case \"string\":\n      return hashString(value);\n    case \"symbol\":\n      return hashString(value.toString());\n    case \"bigint\":\n      return hashString(value.toString());\n    default:\n      return 2;\n  }\n}\n\n/** The levels of an object that `defaultHash` reads. A cyclic value unfolds to this depth and stops. */\nconst HASH_DEPTH = 16;\n\n/** The hashes of one call, by object and by remaining depth. A shared part costs one visit per depth. */\ntype HashMemo = Map<object, number[]>;\n\n/** This function adds one hash to a running hash. The result depends on the order. */\nconst mix = (hash: number, part: number): number => (Math.imul(hash, 31) + part) | 0;\n\n/** The finalizer of MurmurHash3. It makes a sum of entries depend on each pair, not on each half. */\nfunction scramble(hash: number): number {\n  let mixed = hash ^ (hash >>> 16);\n  mixed = Math.imul(mixed, 0x85ebca6b);\n  mixed ^= mixed >>> 13;\n  mixed = Math.imul(mixed, 0xc2b2ae35);\n  return mixed ^ (mixed >>> 16);\n}\n\n/** The start values of the kinds. Two kinds do not compare equal, so their hashes can differ. */\nconst KIND = { array: 3, binary: 5, elements: 7, opaque: 11, record: 13 } as const;\n\nconst hashAt = (value: unknown, depth: number, memo: HashMemo): number =>\n  isObject(value) ? hashObject(value, depth, memo) : hashPrimitive(value);\n\nfunction hashElements(start: number, elements: ArrayLike<unknown>): number {\n  let hash = start;\n  for (let i = 0; i < elements.length; i++) hash = mix(hash, hashPrimitive(elements[i]));\n  return hash;\n}\n\n/** The sum of the entries of a map or a set. A sum does not depend on the order of the entries. */\nfunction hashEntries(value: Map<unknown, unknown> | Set<unknown>, depth: number, memo: HashMemo): number {\n  let sum = 0;\n  for (const [key, entry] of value.entries()) sum = (sum + scramble(mix(hashAt(key, depth, memo), hashAt(entry, depth, memo)))) | 0;\n  return sum;\n}\n\n/** The sum of the own enumerable keys and their values, as `equalKeys` reads them. */\nfunction hashKeys(value: any, depth: number, memo: HashMemo): number {\n  let sum = 0;\n  for (const key of enumerableKeys(value)) sum = (sum + scramble(mix(hashPrimitive(key), hashAt(value[key], depth, memo)))) | 0;\n  return sum;\n}\n\n/** The hash of the fields of one object. This function reads only what `equalObjects` reads. */\nfunction hashFields(value: any, depth: number, memo: HashMemo): number {\n  if (Array.isArray(value)) {\n    let hash: number = KIND.array;\n    for (let i = 0; i < value.length; i++) hash = mix(hash, hashAt(value[i], depth, memo));\n    return hash;\n  }\n  if (isBinary(value)) return hashElements(KIND.binary, bytesOf(value));\n  if (ArrayBuffer.isView(value)) return hashElements(KIND.elements, value as unknown as ArrayLike<unknown>);\n  if (isOpaque(value)) return KIND.opaque;\n  let hash: number = KIND.record;\n  if (value instanceof Date) hash = mix(hash, hashNumber(value.getTime()));\n  if (value instanceof RegExp) hash = mix(mix(hash, hashString(value.source)), hashString(value.flags));\n  if (value instanceof Error) {\n    hash = mix(mix(mix(hash, hashAt(value.name, depth, memo)), hashAt(value.message, depth, memo)), hashAt(value.cause, depth, memo));\n  }\n  if (isBoxed(value)) hash = mix(hash, hashPrimitive(value.valueOf()));\n  if (value instanceof Map || value instanceof Set) hash = mix(hash, hashEntries(value, depth, memo));\n  return mix(hash, hashKeys(value, depth, memo));\n}\n\n/** The hash of one object at one depth. The depth falls with each level, so a cycle ends. */\nfunction hashObject(value: object, depth: number, memo: HashMemo): number {\n  if (depth === 0) return 0;\n  let byDepth = memo.get(value);\n  if (byDepth === undefined) {\n    byDepth = [];\n    memo.set(value, byDepth);\n  }\n  const known = byDepth[depth];\n  if (known !== undefined) return known;\n  const hash = hashFields(value, depth - 1, memo);\n  byDepth[depth] = hash;\n  return hash;\n}\n\n/**\n * This function is the default hash of a key. It agrees with `deepEq`: when `deepEq(a, b)` is true,\n * `defaultHash(a)` equals `defaultHash(b)`. So a hash map with `deepEq` finds an equal key.\n *\n * - The hash of an object reads the same fields as `deepEq`. The order of the keys of an object,\n *   and of the entries of a `Map` or a `Set`, has no effect.\n * - The hash reads 16 levels, so a cyclic or very deep value ends. Two values that differ only\n *   below that depth have one hash, and `deepEq` then tells them apart.\n * - A shared part costs one visit per level, so a dense graph ends.\n * - The hash of an object can change in a new version. Do not store it.\n */\nexport const defaultHash: Hash<any> = (value: any): number =>\n  isObject(value) ? hashObject(value, HASH_DEPTH, new Map()) : hashPrimitive(value);\n\n/**\n * Hash function for strings using djb2 algorithm.\n */\nexport const hashString = (str: string): number => {\n  let hash = 5381;\n  for (let i = 0; i < str.length; i++) {\n    hash = ((hash << 5) + hash) + str.charCodeAt(i); // hash * 33 + c\n    hash = hash & hash; // Convert to 32-bit integer\n  }\n  return hash >>> 0; // Convert to unsigned\n};\n\n/**\n * Hash function for numbers.\n */\nexport const hashNumber = (num: number): number => {\n  if (Number.isNaN(num)) return 0;\n  if (!Number.isFinite(num)) return num > 0 ? 1 : -1;\n\n  // For integers, use the number itself\n  if (Number.isInteger(num)) {\n    return num | 0; // Convert to 32-bit int\n  }\n\n  // For floats, hash the string representation\n  return hashString(num.toString());\n};\n\n/**\n * Combine multiple hash values.\n * Useful for hashing objects with multiple fields.\n *\n * @example\n * const pointHash: Hash<Point> = (p) =>\n *   combineHashes(hashNumber(p.x), hashNumber(p.y))\n */\nexport const combineHashes = (...hashes: number[]): number => {\n  let combined = 0;\n  for (const hash of hashes) {\n    combined = ((combined << 5) - combined) + hash;\n    combined = combined & combined; // Convert to 32-bit int\n  }\n  return combined >>> 0; // Convert to unsigned\n};\n\n/**\n * Make a hash function that hashes by a specific property.\n *\n * @example\n * const userHash = hashBy<User>((u) => u.id)\n */\nexport const hashBy = <T>(accessor: (value: T) => any): Hash<T> => {\n  return (value) => defaultHash(accessor(value));\n};\n\n// ============================================================================\n// Default Comparison\n// ============================================================================\n\n/**\n * Natural ordering comparison for primitives.\n * Numbers, strings, booleans, dates are compared naturally.\n */\nexport const defaultCompare: Compare<any> = (a, b) => {\n  if (a === b) return 0;\n  if (a === null || a === undefined) return -1;\n  if (b === null || b === undefined) return 1;\n\n  // Handle dates\n  if (a instanceof Date && b instanceof Date) {\n    return a.getTime() - b.getTime();\n  }\n\n  // Handle numbers\n  if (typeof a === \"number\" && typeof b === \"number\") {\n    if (Number.isNaN(a)) return Number.isNaN(b) ? 0 : -1;\n    if (Number.isNaN(b)) return 1;\n    return a - b;\n  }\n\n  // Handle strings\n  if (typeof a === \"string\" && typeof b === \"string\") {\n    return a.localeCompare(b);\n  }\n\n  // Handle booleans\n  if (typeof a === \"boolean\" && typeof b === \"boolean\") {\n    return a === b ? 0 : a ? 1 : -1;\n  }\n\n  // Fallback: convert to string and compare\n  return String(a).localeCompare(String(b));\n};\n\n/**\n * Numeric comparison (for numbers).\n */\nexport const numberCompare: Compare<number> = (a, b) => {\n  if (Number.isNaN(a)) return Number.isNaN(b) ? 0 : -1;\n  if (Number.isNaN(b)) return 1;\n  return a - b;\n};\n\n/**\n * String comparison using locale-aware sorting.\n */\nexport const stringCompare: Compare<string> = (a, b) => a.localeCompare(b);\n\n/**\n * Case-insensitive string comparison.\n */\nexport const stringCompareIgnoreCase: Compare<string> = (a, b) =>\n  a.toLowerCase().localeCompare(b.toLowerCase());\n\n/**\n * Date comparison.\n */\nexport const dateCompare: Compare<Date> = (a, b) =>\n  a.getTime() - b.getTime();\n\n/**\n * Boolean comparison (false < true).\n */\nexport const booleanCompare: Compare<boolean> = (a, b) =>\n  a === b ? 0 : a ? 1 : -1;\n\n// ============================================================================\n// Comparator Combinators\n// ============================================================================\n\n/**\n * This function reverses a comparator.\n *\n * @example\n * const descending = reversed(numberCompare)\n */\nexport const reversed = <T>(compare: Compare<T>): Compare<T> =>\n  (a, b) => compare(b, a);\n\n/**\n * This function makes a comparator that compares by a specific property or function.\n *\n * @example\n * const byAge = comparing<Person>((p) => p.age)\n * const byName = comparing<Person, 'name'>('name')\n */\nexport const comparing = <T, K extends keyof T = keyof T>(\n  keyOrFn: K | ((value: T) => any),\n  compare: Compare<any> = defaultCompare\n): Compare<T> => {\n  const accessor = typeof keyOrFn === \"function\" ? keyOrFn : (v: T) => v[keyOrFn];\n  return (a, b) => compare(accessor(a), accessor(b));\n};\n\n/**\n * Chains comparators. If the first comparator gives 0 (equal),\n * tries the next comparator, and so on.\n *\n * @example\n * const userCompare = thenComparing(\n *   comparing<User>('lastName'),\n *   comparing<User>('firstName'),\n *   comparing<User>('age')\n * )\n */\nexport const thenComparing = <T>(...comparators: Compare<T>[]): Compare<T> => {\n  return (a, b) => {\n    for (const compare of comparators) {\n      const result = compare(a, b);\n      if (result !== 0) return result;\n    }\n    return 0;\n  };\n};\n\n/**\n * This function makes a comparator that treats null/undefined as less than all other values.\n *\n * @example\n * const compare = nullsFirst(numberCompare)\n */\nexport const nullsFirst = <T>(compare: Compare<T>): Compare<T | null | undefined> => {\n  return (a, b) => {\n    if (a == null && b == null) return 0;\n    if (a == null) return -1;\n    if (b == null) return 1;\n    return compare(a, b);\n  };\n};\n\n/**\n * This function makes a comparator that treats null/undefined as greater than all other values.\n *\n * @example\n * const compare = nullsLast(numberCompare)\n */\nexport const nullsLast = <T>(compare: Compare<T>): Compare<T | null | undefined> => {\n  return (a, b) => {\n    if (a == null && b == null) return 0;\n    if (a == null) return 1;\n    if (b == null) return -1;\n    return compare(a, b);\n  };\n};\n\n/**\n * This function makes a comparator from a key extraction function.\n * Elements are compared by their extracted keys.\n *\n * @example\n * const byLength = comparingKey<string>((s) => s.length)\n */\nexport const comparingKey = <T, K>(\n  keyExtractor: (value: T) => K,\n  keyCompare: Compare<K> = defaultCompare\n): Compare<T> => {\n  return (a, b) => keyCompare(keyExtractor(a), keyExtractor(b));\n};\n","/**\n * ArrayList implementation - A dynamic array-backed list.\n *\n * This module gives O(1) indexed access and amortized O(1) append.\n * Mirrors java.util.ArrayList.\n *\n * @example\n * const list = arrayList<number>()\n * list.add(1)\n * list.add(2)\n * list.add(3)\n * console.log(list.get(1)) // 2\n */\n\nimport type { List, RandomAccess } from \"../interfaces/list.js\";\nimport type { Eq, Compare } from \"../core/traits.js\";\nimport { defaultEq, defaultCompare } from \"../utils/defaults.js\";\n\n/**\n * Options for making an ArrayList.\n */\nexport interface ArrayListOptions<T> {\n  /**\n   * Initial capacity of the underlying array.\n   * @default 10\n   */\n  initialCapacity?: number;\n\n  /**\n   * Equality function for comparing elements.\n   * @default defaultEq (===)\n   */\n  eq?: Eq<T>;\n}\n\n/**\n * ArrayList<T> - Resizable array implementation of the List interface.\n *\n * This class gives fast random access (O(1)) and fast append (amortized O(1)).\n * Insertion and removal in the middle shift elements (O(n)).\n *\n * This is the most commonly used list implementation.\n */\nexport class ArrayList<T> implements List<T>, RandomAccess {\n  private _array: T[];\n  private _size: number;\n  private readonly _eq: Eq<T>;\n\n  readonly supportsRandomAccess = true as const;\n\n  constructor(options: ArrayListOptions<T> = {}) {\n    const { initialCapacity = 10, eq = defaultEq } = options;\n    this._array = new Array(initialCapacity);\n    this._size = 0;\n    this._eq = eq;\n  }\n\n  // ========================================================================\n  // Size and capacity\n  // ========================================================================\n\n  get size(): number {\n    return this._size;\n  }\n\n  get isEmpty(): boolean {\n    return this._size === 0;\n  }\n\n  /**\n   * Current capacity of the underlying array.\n   */\n  get capacity(): number {\n    return this._array.length;\n  }\n\n  get eq(): Eq<T> {\n    return this._eq;\n  }\n\n  // ========================================================================\n  // Indexed access\n  // ========================================================================\n\n  get(index: number): T {\n    this.checkIndex(index);\n    return this._array[index]!;\n  }\n\n  set(index: number, element: T): T {\n    this.checkIndex(index);\n    const old = this._array[index]!;\n    this._array[index] = element;\n    return old!;\n  }\n\n  // ========================================================================\n  // Search\n  // ========================================================================\n\n  contains(element: T): boolean {\n    return this.indexOf(element) !== -1;\n  }\n\n  indexOf(element: T, fromIndex: number = 0): number {\n    if (fromIndex < 0) fromIndex = 0;\n    for (let i = fromIndex; i < this._size; i++) {\n      if (this._eq(this._array[i]!, element)) {\n        return i;\n      }\n    }\n    return -1;\n  }\n\n  lastIndexOf(element: T, fromIndex?: number): number {\n    const start =\n      fromIndex !== undefined\n        ? Math.min(fromIndex, this._size - 1)\n        : this._size - 1;\n    for (let i = start; i >= 0; i--) {\n      if (this._eq(this._array[i]!, element)) {\n        return i;\n      }\n    }\n    return -1;\n  }\n\n  containsAll(other: Iterable<T>): boolean {\n    for (const element of other) {\n      if (!this.contains(element)) return false;\n    }\n    return true;\n  }\n\n  // ========================================================================\n  // Addition\n  // ========================================================================\n\n  add(element: T): boolean {\n    this.ensureCapacity(this._size + 1);\n    this._array[this._size++] = element;\n    return true;\n  }\n\n  push(element: T): void {\n    this.add(element);\n  }\n\n  unshift(element: T): void {\n    this.insert(0, element);\n  }\n\n  insert(index: number, element: T): void {\n    this.checkInsertIndex(index);\n    this.ensureCapacity(this._size + 1);\n\n    // Shift elements to the right\n    for (let i = this._size; i > index; i--) {\n      this._array[i] = this._array[i - 1]!;\n    }\n\n    this._array[index] = element;\n    this._size++;\n  }\n\n  insertAll(index: number, other: Iterable<T>): boolean {\n    this.checkInsertIndex(index);\n    const elements = Array.isArray(other) ? other : Array.from(other);\n    if (elements.length === 0) return false;\n\n    this.ensureCapacity(this._size + elements.length);\n\n    // Shift existing elements to the right\n    for (let i = this._size - 1; i >= index; i--) {\n      this._array[i + elements.length] = this._array[i]!;\n    }\n\n    // Insert new elements\n    for (let i = 0; i < elements.length; i++) {\n      this._array[index + i] = elements[i];\n    }\n\n    this._size += elements.length;\n    return true;\n  }\n\n  addAll(other: Iterable<T>): boolean {\n    const elements = Array.isArray(other) ? other : Array.from(other);\n    if (elements.length === 0) return false;\n\n    this.ensureCapacity(this._size + elements.length);\n\n    for (const element of elements) {\n      this._array[this._size++] = element;\n    }\n\n    return true;\n  }\n\n  // ========================================================================\n  // Removal\n  // ========================================================================\n\n  remove(element: T): boolean {\n    const index = this.indexOf(element);\n    if (index === -1) return false;\n    this.removeAt(index);\n    return true;\n  }\n\n  removeAt(index: number): T {\n    this.checkIndex(index);\n    const old = this._array[index]!;\n\n    // Shift elements to the left\n    for (let i = index; i < this._size - 1; i++) {\n      this._array[i] = this._array[i + 1]!;\n    }\n\n    this._size--;\n    // Clear the last element to allow GC\n    this._array[this._size] = undefined as any;\n\n    return old;\n  }\n\n  pop(): T {\n    if (this.isEmpty) {\n      throw new Error(\"Cannot pop from empty list\");\n    }\n    return this.removeAt(this._size - 1);\n  }\n\n  shift(): T {\n    if (this.isEmpty) {\n      throw new Error(\"Cannot shift from empty list\");\n    }\n    return this.removeAt(0);\n  }\n\n  removeRange(fromIndex: number, toIndex: number): void {\n    this.checkRange(fromIndex, toIndex);\n    const numToRemove = toIndex - fromIndex;\n    if (numToRemove === 0) return;\n\n    // Shift elements to the left\n    for (let i = toIndex; i < this._size; i++) {\n      this._array[i - numToRemove] = this._array[i]!;\n    }\n\n    // Clear removed elements\n    for (let i = this._size - numToRemove; i < this._size; i++) {\n      this._array[i] = undefined as any;\n    }\n\n    this._size -= numToRemove;\n  }\n\n  removeAll(other: Iterable<T>): boolean {\n    const toRemove = new Set<T>();\n    for (const element of other) {\n      toRemove.add(element);\n    }\n\n    let writeIndex = 0;\n    let modified = false;\n\n    for (let readIndex = 0; readIndex < this._size; readIndex++) {\n      const element = this._array[readIndex]!;\n      let shouldRemove = false;\n\n      // Check if element matches any in toRemove using custom equality\n      for (const removeElement of toRemove) {\n        if (this._eq(element, removeElement)) {\n          shouldRemove = true;\n          modified = true;\n          break;\n        }\n      }\n\n      if (!shouldRemove) {\n        this._array[writeIndex++] = element;\n      }\n    }\n\n    // Clear remaining elements\n    for (let i = writeIndex; i < this._size; i++) {\n      this._array[i] = undefined as any;\n    }\n\n    this._size = writeIndex;\n    return modified;\n  }\n\n  retainAll(other: Iterable<T>): boolean {\n    const toRetain = Array.from(other);\n    let writeIndex = 0;\n    let modified = false;\n\n    for (let readIndex = 0; readIndex < this._size; readIndex++) {\n      const element = this._array[readIndex]!;\n      let shouldRetain = false;\n\n      // Check if element matches any in toRetain using custom equality\n      for (const retainElement of toRetain) {\n        if (this._eq(element, retainElement)) {\n          shouldRetain = true;\n          break;\n        }\n      }\n\n      if (shouldRetain) {\n        this._array[writeIndex++] = element;\n      } else {\n        modified = true;\n      }\n    }\n\n    // Clear remaining elements\n    for (let i = writeIndex; i < this._size; i++) {\n      this._array[i] = undefined as any;\n    }\n\n    this._size = writeIndex;\n    return modified;\n  }\n\n  clear(): void {\n    // Clear all elements to allow GC\n    for (let i = 0; i < this._size; i++) {\n      this._array[i] = undefined as any;\n    }\n    this._size = 0;\n  }\n\n  // ========================================================================\n  // Ordering\n  // ========================================================================\n\n  sort(compare: Compare<T> = defaultCompare): void {\n    // Sort only the used portion of the array\n    const slice = this._array.slice(0, this._size);\n    slice.sort(compare);\n    for (let i = 0; i < this._size; i++) {\n      this._array[i] = slice[i]!;\n    }\n  }\n\n  reverse(): void {\n    let left = 0;\n    let right = this._size - 1;\n    while (left < right) {\n      const temp = this._array[left]!;\n      this._array[left] = this._array[right]!;\n      this._array[right] = temp;\n      left++;\n      right--;\n    }\n  }\n\n  // ========================================================================\n  // Views\n  // ========================================================================\n\n  first(): T {\n    if (this.isEmpty) {\n      throw new Error(\"List is empty\");\n    }\n    return this._array[0]!;\n  }\n\n  last(): T {\n    if (this.isEmpty) {\n      throw new Error(\"List is empty\");\n    }\n    return this._array[this._size - 1]!;\n  }\n\n  subList(fromIndex: number, toIndex: number): List<T> {\n    this.checkRange(fromIndex, toIndex);\n    // For now, return a copy. Later we can implement a view.\n    const sub = new ArrayList<T>({ eq: this._eq });\n    for (let i = fromIndex; i < toIndex; i++) {\n      sub.add(this._array[i]!);\n    }\n    return sub;\n  }\n\n  // ========================================================================\n  // Iteration\n  // ========================================================================\n\n  *[Symbol.iterator](): Iterator<T> {\n    for (let i = 0; i < this._size; i++) {\n      yield this._array[i]!;\n    }\n  }\n\n  forEach(action: (element: T, index: number) => void): void {\n    for (let i = 0; i < this._size; i++) {\n      action(this._array[i]!, i);\n    }\n  }\n\n  toArray(): T[] {\n    return this._array.slice(0, this._size);\n  }\n\n  // ========================================================================\n  // Capacity management\n  // ========================================================================\n\n  /**\n   * This method makes sure that the capacity is at least the specified minimum.\n   */\n  ensureCapacity(minCapacity: number): void {\n    if (minCapacity <= this._array.length) return;\n\n    // Grow by 1.5x or to minCapacity, whichever is larger\n    const newCapacity = Math.max(\n      minCapacity,\n      Math.floor(this._array.length * 1.5) + 1\n    );\n\n    const newArray = new Array(newCapacity);\n    for (let i = 0; i < this._size; i++) {\n      newArray[i] = this._array[i];\n    }\n    this._array = newArray;\n  }\n\n  /**\n   * This method trims the capacity to the current size to minimize memory usage.\n   */\n  trimToSize(): void {\n    if (this._size < this._array.length) {\n      this._array = this._array.slice(0, this._size);\n    }\n  }\n\n  // ========================================================================\n  // Private helpers\n  // ========================================================================\n\n  private checkIndex(index: number): void {\n    if (index < 0 || index >= this._size) {\n      throw new RangeError(\n        `Index ${index} out of bounds for size ${this._size}`\n      );\n    }\n  }\n\n  private checkInsertIndex(index: number): void {\n    if (index < 0 || index > this._size) {\n      throw new RangeError(\n        `Index ${index} out of bounds for insert (size ${this._size})`\n      );\n    }\n  }\n\n  private checkRange(fromIndex: number, toIndex: number): void {\n    if (fromIndex < 0 || toIndex > this._size || fromIndex > toIndex) {\n      throw new RangeError(\n        `Invalid range [${fromIndex}, ${toIndex}) for size ${this._size}`\n      );\n    }\n  }\n}\n\n/**\n * Factory function to make an ArrayList.\n *\n * @example\n * const list = arrayList<number>()\n * const listWithEq = arrayList<User>({ eq: (a, b) => a.id === b.id })\n * const listFromArray = arrayList([1, 2, 3])\n */\nexport function arrayList<T>(\n  optionsOrElements?: ArrayListOptions<T> | Iterable<T>\n): ArrayList<T> {\n  // Check if it's an iterable (not options)\n  if (optionsOrElements && Symbol.iterator in optionsOrElements) {\n    const list = new ArrayList<T>();\n    list.addAll(optionsOrElements as Iterable<T>);\n    return list;\n  }\n\n  const list = new ArrayList<T>(optionsOrElements as ArrayListOptions<T>);\n  return list;\n}\n","/**\n * ArrayDeque implementation - A ring buffer backed double-ended queue.\n *\n * This module gives O(1) insertion and removal at both ends.\n * More efficient than ArrayList for queue/stack operations.\n * Mirrors java.util.ArrayDeque.\n *\n * @example\n * const deque = arrayDeque<number>()\n * deque.addFirst(1)\n * deque.addLast(2)\n * deque.removeFirst() // 1\n */\n\nimport type { Deque } from \"../interfaces/queue.js\";\nimport type { Eq } from \"../core/traits.js\";\nimport { defaultEq } from \"../utils/defaults.js\";\n\n/**\n * Options for making an ArrayDeque.\n */\nexport interface ArrayDequeOptions<T> {\n  /**\n   * Initial capacity of the underlying array.\n   * This value must be a power of 2 for efficient modulo operations.\n   * @default 16\n   */\n  initialCapacity?: number;\n\n  /**\n   * Equality function for comparing elements.\n   * @default defaultEq (===)\n   */\n  eq?: Eq<T>;\n}\n\n/**\n * ArrayDeque<T> - Ring buffer implementation of Deque.\n *\n * This class uses a circular array to give O(1) operations at both ends.\n * The array grows automatically when full.\n *\n * Not thread-safe. Use synchronized() behavior for concurrent access.\n */\nexport class ArrayDeque<T> implements Deque<T> {\n  private _elements: (T | undefined)[];\n  private _head: number; // Index of first element\n  private _tail: number; // Index where next element will be added\n  private readonly _eq: Eq<T>;\n\n  constructor(options: ArrayDequeOptions<T> = {}) {\n    const { initialCapacity = 16, eq = defaultEq } = options;\n    // Ensure capacity is a power of 2 for efficient modulo using bitwise AND\n    const capacity = this.nextPowerOfTwo(Math.max(8, initialCapacity));\n    this._elements = new Array(capacity);\n    this._head = 0;\n    this._tail = 0;\n    this._eq = eq;\n  }\n\n  // ========================================================================\n  // Size\n  // ========================================================================\n\n  get size(): number {\n    // Handle wraparound: (tail - head) & mask\n    return (this._tail - this._head) & (this._elements.length - 1);\n  }\n\n  get isEmpty(): boolean {\n    return this._head === this._tail;\n  }\n\n  get eq(): Eq<T> {\n    return this._eq;\n  }\n\n  // ========================================================================\n  // Front operations (head)\n  // ========================================================================\n\n  addFirst(element: T): void {\n    this._head = (this._head - 1) & (this._elements.length - 1);\n    this._elements[this._head] = element;\n    if (this._head === this._tail) {\n      this.grow();\n    }\n  }\n\n  offerFirst(element: T): boolean {\n    this.addFirst(element);\n    return true;\n  }\n\n  removeFirst(): T {\n    if (this.isEmpty) {\n      throw new Error(\"Deque is empty\");\n    }\n    return this.pollFirst()!;\n  }\n\n  pollFirst(): T | undefined {\n    if (this.isEmpty) {\n      return undefined;\n    }\n    const element = this._elements[this._head];\n    this._elements[this._head] = undefined;\n    this._head = (this._head + 1) & (this._elements.length - 1);\n    return element;\n  }\n\n  peekFirst(): T {\n    if (this.isEmpty) {\n      throw new Error(\"Deque is empty\");\n    }\n    return this._elements[this._head]!;\n  }\n\n  peekFirstOrUndefined(): T | undefined {\n    return this.isEmpty ? undefined : this._elements[this._head];\n  }\n\n  // ========================================================================\n  // Back operations (tail)\n  // ========================================================================\n\n  addLast(element: T): void {\n    this._elements[this._tail] = element;\n    this._tail = (this._tail + 1) & (this._elements.length - 1);\n    if (this._tail === this._head) {\n      this.grow();\n    }\n  }\n\n  offerLast(element: T): boolean {\n    this.addLast(element);\n    return true;\n  }\n\n  removeLast(): T {\n    if (this.isEmpty) {\n      throw new Error(\"Deque is empty\");\n    }\n    return this.pollLast()!;\n  }\n\n  pollLast(): T | undefined {\n    if (this.isEmpty) {\n      return undefined;\n    }\n    this._tail = (this._tail - 1) & (this._elements.length - 1);\n    const element = this._elements[this._tail];\n    this._elements[this._tail] = undefined;\n    return element;\n  }\n\n  peekLast(): T {\n    if (this.isEmpty) {\n      throw new Error(\"Deque is empty\");\n    }\n    const lastIndex = (this._tail - 1) & (this._elements.length - 1);\n    return this._elements[lastIndex]!;\n  }\n\n  peekLastOrUndefined(): T | undefined {\n    if (this.isEmpty) {\n      return undefined;\n    }\n    const lastIndex = (this._tail - 1) & (this._elements.length - 1);\n    return this._elements[lastIndex];\n  }\n\n  // ========================================================================\n  // Stack operations (LIFO at the end, as on a JavaScript array)\n  // ========================================================================\n\n  // push and pop work at the end, and shift/unshift at the front, in every collection of this\n  // package. Before, they worked at the front here (the Java Deque rule), so a LinkedList used\n  // as a List reversed the pushed elements (ARCHITECTURE-PROPOSALS P8).\n  push(element: T): void {\n    this.addLast(element);\n  }\n\n  pop(): T {\n    return this.removeLast();\n  }\n\n  // ========================================================================\n  // Queue operations (FIFO - add last, remove first)\n  // ========================================================================\n\n  offer(element: T): boolean {\n    return this.offerLast(element);\n  }\n\n  poll(): T {\n    return this.removeFirst();\n  }\n\n  peek(): T {\n    return this.peekFirst();\n  }\n\n  peekOrUndefined(): T | undefined {\n    return this.peekFirstOrUndefined();\n  }\n\n  pollOrUndefined(): T | undefined {\n    return this.pollFirst();\n  }\n\n  enqueue(element: T): boolean {\n    return this.offer(element);\n  }\n\n  dequeue(): T {\n    return this.poll();\n  }\n\n  // ========================================================================\n  // Collection operations\n  // ========================================================================\n\n  add(element: T): boolean {\n    this.addLast(element);\n    return true;\n  }\n\n  addAll(other: Iterable<T>): boolean {\n    let modified = false;\n    for (const element of other) {\n      this.addLast(element);\n      modified = true;\n    }\n    return modified;\n  }\n\n  contains(element: T): boolean {\n    for (const item of this) {\n      if (this._eq(item, element)) {\n        return true;\n      }\n    }\n    return false;\n  }\n\n  containsAll(other: Iterable<T>): boolean {\n    for (const element of other) {\n      if (!this.contains(element)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  remove(element: T): boolean {\n    // Linear search for the first occurrence\n    const mask = this._elements.length - 1;\n    const size = this.size;\n    for (let offset = 0; offset < size; offset++) {\n      if (this._eq(this._elements[(this._head + offset) & mask]!, element)) {\n        this.removeAtOffset(offset);\n        return true;\n      }\n    }\n    return false;\n  }\n\n  /**\n   * This method removes the element at a position from the head. The shorter side moves one place.\n   * (Before, a bitwise expression chose the side, and it was not a valid test.)\n   */\n  private removeAtOffset(offset: number): void {\n    const mask = this._elements.length - 1;\n    const size = this.size;\n    if (offset < size / 2) {\n      // Move the elements before it one place toward the tail\n      for (let i = offset; i > 0; i--) {\n        this._elements[(this._head + i) & mask] = this._elements[(this._head + i - 1) & mask];\n      }\n      this._elements[this._head] = undefined;\n      this._head = (this._head + 1) & mask;\n    } else {\n      // Move the elements after it one place toward the head\n      for (let i = offset; i < size - 1; i++) {\n        this._elements[(this._head + i) & mask] = this._elements[(this._head + i + 1) & mask];\n      }\n      this._tail = (this._tail - 1) & mask;\n      this._elements[this._tail] = undefined;\n    }\n  }\n\n\n  removeAll(other: Iterable<T>): boolean {\n    const toRemove = new Set<T>();\n    for (const element of other) {\n      toRemove.add(element);\n    }\n\n    let modified = false;\n    for (const element of toRemove) {\n      while (this.remove(element)) {\n        modified = true;\n      }\n    }\n    return modified;\n  }\n\n  retainAll(other: Iterable<T>): boolean {\n    const toRetain = new Set(other);\n    const newDeque = new ArrayDeque<T>({ eq: this._eq });\n\n    for (const element of this) {\n      let shouldRetain = false;\n      for (const retainElement of toRetain) {\n        if (this._eq(element, retainElement)) {\n          shouldRetain = true;\n          break;\n        }\n      }\n      if (shouldRetain) {\n        newDeque.addLast(element);\n      }\n    }\n\n    const modified = newDeque.size !== this.size;\n    this._elements = newDeque._elements;\n    this._head = newDeque._head;\n    this._tail = newDeque._tail;\n\n    return modified;\n  }\n\n  clear(): void {\n    // Clear all elements for GC\n    let index = this._head;\n    while (index !== this._tail) {\n      this._elements[index] = undefined;\n      index = (index + 1) & (this._elements.length - 1);\n    }\n    this._head = 0;\n    this._tail = 0;\n  }\n\n  // ========================================================================\n  // Iteration\n  // ========================================================================\n\n  *[Symbol.iterator](): Iterator<T> {\n    let index = this._head;\n    while (index !== this._tail) {\n      yield this._elements[index]!;\n      index = (index + 1) & (this._elements.length - 1);\n    }\n  }\n\n  forEach(action: (element: T, index: number) => void): void {\n    let arrayIndex = this._head;\n    let logicalIndex = 0;\n    while (arrayIndex !== this._tail) {\n      action(this._elements[arrayIndex]!, logicalIndex);\n      arrayIndex = (arrayIndex + 1) & (this._elements.length - 1);\n      logicalIndex++;\n    }\n  }\n\n  toArray(): T[] {\n    const result: T[] = [];\n    for (const element of this) {\n      result.push(element);\n    }\n    return result;\n  }\n\n  // ========================================================================\n  // Capacity management\n  // ========================================================================\n\n  /**\n   * This method doubles the capacity of the deque.\n   */\n  private grow(): void {\n    const oldCapacity = this._elements.length;\n    const newCapacity = oldCapacity << 1; // Double capacity\n\n    if (newCapacity < 0) {\n      throw new Error(\"Deque too large\");\n    }\n\n    const newElements = new Array(newCapacity);\n\n    // Copy elements from head to end of old array\n    const rightSize = oldCapacity - this._head;\n    for (let i = 0; i < rightSize; i++) {\n      newElements[i] = this._elements[this._head + i];\n    }\n\n    // Copy wrapped elements from start of old array\n    const leftSize = this._head;\n    for (let i = 0; i < leftSize; i++) {\n      newElements[rightSize + i] = this._elements[i];\n    }\n\n    // grow() runs when the array is full: head === tail and every slot holds an element. Then\n    // `size` computes 0, so the old `this._tail = size` lost every element (BUGS-2026-07 C8).\n    this._elements = newElements;\n    this._head = 0;\n    this._tail = oldCapacity;\n  }\n\n  /**\n   * This method gives the next power of 2 >= n.\n   */\n  private nextPowerOfTwo(n: number): number {\n    if (n <= 0) return 1;\n    n--;\n    n |= n >> 1;\n    n |= n >> 2;\n    n |= n >> 4;\n    n |= n >> 8;\n    n |= n >> 16;\n    return n + 1;\n  }\n\n  // ========================================================================\n  // Inspection\n  // ========================================================================\n\n  /**\n   * This value is the current capacity of the underlying array.\n   */\n  get capacity(): number {\n    return this._elements.length;\n  }\n\n  /**\n   * This method gives a string representation for debugging.\n   */\n  toString(): string {\n    return `ArrayDeque[${this.toArray().join(\", \")}]`;\n  }\n}\n\n/**\n * Factory function to make an ArrayDeque.\n *\n * @example\n * const deque = arrayDeque<number>()\n * const dequeFromArray = arrayDeque([1, 2, 3])\n * const dequeWithOptions = arrayDeque<string>({ initialCapacity: 32 })\n */\nexport function arrayDeque<T>(\n  optionsOrElements?: ArrayDequeOptions<T> | Iterable<T>\n): ArrayDeque<T> {\n  // Check if it's an iterable (not options)\n  if (optionsOrElements && Symbol.iterator in optionsOrElements) {\n    const deque = new ArrayDeque<T>();\n    deque.addAll(optionsOrElements as Iterable<T>);\n    return deque;\n  }\n\n  return new ArrayDeque<T>(optionsOrElements as ArrayDequeOptions<T>);\n}\n","/**\n * HashMap implementation - A hash table with custom equality and hashing.\n *\n * This module gives O(1) average case lookup, insertion, and deletion.\n * This module supports custom equality and hash functions for keys.\n * Mirrors java.util.HashMap.\n *\n * @example\n * const map = hashMap<string, number>()\n * map.set('one', 1)\n * map.set('two', 2)\n * console.log(map.get('one')) // 1\n *\n * // Custom equality for object keys\n * const userMap = hashMap<User, Data>({\n *   keyEq: (a, b) => a.id === b.id,\n *   keyHash: (u) => hashString(u.id)\n * })\n */\n\nimport type { MapLike, Entry } from \"../interfaces/map.js\";\nimport type { Eq, Hash } from \"../core/traits.js\";\nimport { defaultEq, defaultHash } from \"../utils/defaults.js\";\n\n/**\n * Internal entry node for hash buckets.\n */\ninterface Node<K, V> {\n  key: K;\n  value: V;\n  hash: number;\n  next: Node<K, V> | null;\n}\n\n/**\n * Options for making a HashMap.\n */\nexport interface HashMapOptions<K, V> {\n  /**\n   * Initial capacity (number of buckets).\n   * This value must be a power of 2.\n   * @default 16\n   */\n  initialCapacity?: number;\n\n  /**\n   * Load factor threshold for resizing (0-1).\n   * When size > capacity * loadFactor, the map resizes.\n   * @default 0.75\n   */\n  loadFactor?: number;\n\n  /**\n   * Equality function for keys.\n   * @default defaultEq (===)\n   */\n  keyEq?: Eq<K>;\n\n  /**\n   * Hash function for keys.\n   * @default defaultHash\n   */\n  keyHash?: Hash<K>;\n\n  /**\n   * Equality function for values (used in containsValue).\n   * @default defaultEq (===)\n   */\n  valueEq?: Eq<V>;\n}\n\n/**\n * HashMap<K, V> - Hash table implementation with custom equality/hashing.\n *\n * This class uses separate chaining for collision resolution.\n * Automatically resizes when load factor is exceeded.\n *\n * Not thread-safe. Use synchronized() behavior for concurrent access.\n */\nexport class HashMap<K, V> implements MapLike<K, V> {\n  private _buckets: (Node<K, V> | null)[];\n  private _size: number;\n  private readonly _loadFactor: number;\n  private readonly _keyEq: Eq<K>;\n  private readonly _keyHash: Hash<K>;\n  private readonly _valueEq: Eq<V>;\n  private _threshold: number;\n  /**\n   * The count of structural changes (a key added or removed, a clear, a resize). An iterator\n   * records it at its start and throws when it changes. Before, a resize during iteration made\n   * the iterator skip or repeat entries (BUGS-2026-07 L15).\n   */\n  private _modCount = 0;\n\n  constructor(options: HashMapOptions<K, V> = {}) {\n    const {\n      initialCapacity = 16,\n      loadFactor = 0.75,\n      keyEq = defaultEq,\n      keyHash = defaultHash,\n      valueEq = defaultEq,\n    } = options;\n\n    const capacity = this.nextPowerOfTwo(Math.max(4, initialCapacity));\n    this._buckets = new Array(capacity).fill(null);\n    this._size = 0;\n    this._loadFactor = loadFactor;\n    this._keyEq = keyEq;\n    this._keyHash = keyHash;\n    this._valueEq = valueEq;\n    this._threshold = Math.floor(capacity * loadFactor);\n  }\n\n  // ========================================================================\n  // Size\n  // ========================================================================\n\n  get size(): number {\n    return this._size;\n  }\n\n  get isEmpty(): boolean {\n    return this._size === 0;\n  }\n\n  get keyEq(): Eq<K> {\n    return this._keyEq;\n  }\n\n  get valueEq(): Eq<V> {\n    return this._valueEq;\n  }\n\n  // ========================================================================\n  // Lookup\n  // ========================================================================\n\n  has(key: K): boolean {\n    const hash = this._keyHash(key);\n    const index = this.bucketIndex(hash);\n    let node = this._buckets[index] ?? null;\n\n    while (node !== null) {\n      if (node.hash === hash && this._keyEq(node.key, key)) {\n        return true;\n      }\n      node = node.next;\n    }\n\n    return false;\n  }\n\n  get(key: K): V {\n    const value = this.getOrUndefined(key);\n    if (value === undefined) {\n      throw new Error(`Key not found: ${key}`);\n    }\n    return value;\n  }\n\n  getOrUndefined(key: K): V | undefined {\n    const hash = this._keyHash(key);\n    const index = this.bucketIndex(hash);\n    let node = this._buckets[index] ?? null;\n\n    while (node !== null) {\n      if (node.hash === hash && this._keyEq(node.key, key)) {\n        return node.value;\n      }\n      node = node.next;\n    }\n\n    return undefined;\n  }\n\n  getOrDefault(key: K, defaultValue: V): V {\n    const value = this.getOrUndefined(key);\n    return value !== undefined ? value : defaultValue;\n  }\n\n  containsValue(value: V): boolean {\n    for (const bucket of this._buckets) {\n      let node = bucket;\n      while (node !== null) {\n        if (this._valueEq(node.value, value)) {\n          return true;\n        }\n        node = node.next;\n      }\n    }\n    return false;\n  }\n\n  // ========================================================================\n  // Modification\n  // ========================================================================\n\n  set(key: K, value: V): V | undefined {\n    const hash = this._keyHash(key);\n    const index = this.bucketIndex(hash);\n    let node = this._buckets[index] ?? null;\n\n    // Check if key already exists\n    while (node !== null) {\n      if (node.hash === hash && this._keyEq(node.key, key)) {\n        const oldValue = node.value;\n        node.value = value;\n        return oldValue;\n      }\n      node = node.next;\n    }\n\n    // Key doesn't exist, add new entry\n    const newNode: Node<K, V> = {\n      key,\n      value,\n      hash,\n      next: this._buckets[index] ?? null,\n    };\n    this._buckets[index] = newNode;\n    this._size++;\n    this._modCount++;\n\n    // Check if resize is needed\n    if (this._size > this._threshold) {\n      this.resize();\n    }\n\n    return undefined;\n  }\n\n  setIfAbsent(key: K, value: V): V {\n    const existing = this.getOrUndefined(key);\n    if (existing !== undefined) {\n      return existing;\n    }\n    this.set(key, value);\n    return value;\n  }\n\n  delete(key: K): V | undefined {\n    const hash = this._keyHash(key);\n    const index = this.bucketIndex(hash);\n    let node = this._buckets[index] ?? null;\n    let prev: Node<K, V> | null = null;\n\n    while (node !== null) {\n      if (node.hash === hash && this._keyEq(node.key, key)) {\n        // Found the node to delete\n        if (prev === null) {\n          // Node is at head of bucket\n          this._buckets[index] = node.next;\n        } else {\n          // Node is in middle or end\n          prev.next = node.next;\n        }\n        this._size--;\n        this._modCount++;\n        return node.value;\n      }\n      prev = node;\n      node = node.next;\n    }\n\n    return undefined;\n  }\n\n  deleteEntry(key: K, value: V): boolean {\n    const hash = this._keyHash(key);\n    const index = this.bucketIndex(hash);\n    let node = this._buckets[index] ?? null;\n    let prev: Node<K, V> | null = null;\n\n    while (node !== null) {\n      if (\n        node.hash === hash &&\n        this._keyEq(node.key, key) &&\n        this._valueEq(node.value, value)\n      ) {\n        // Found the entry to delete\n        if (prev === null) {\n          this._buckets[index] = node.next;\n        } else {\n          prev.next = node.next;\n        }\n        this._size--;\n        this._modCount++;\n        return true;\n      }\n      prev = node;\n      node = node.next;\n    }\n\n    return false;\n  }\n\n  replace(key: K, value: V): V | undefined {\n    const hash = this._keyHash(key);\n    const index = this.bucketIndex(hash);\n    let node = this._buckets[index] ?? null;\n\n    while (node !== null) {\n      if (node.hash === hash && this._keyEq(node.key, key)) {\n        const oldValue = node.value;\n        node.value = value;\n        return oldValue;\n      }\n      node = node.next;\n    }\n\n    return undefined;\n  }\n\n  replaceEntry(key: K, oldValue: V, newValue: V): boolean {\n    const hash = this._keyHash(key);\n    const index = this.bucketIndex(hash);\n    let node = this._buckets[index] ?? null;\n\n    while (node !== null) {\n      if (\n        node.hash === hash &&\n        this._keyEq(node.key, key) &&\n        this._valueEq(node.value, oldValue)\n      ) {\n        node.value = newValue;\n        return true;\n      }\n      node = node.next;\n    }\n\n    return false;\n  }\n\n  // ========================================================================\n  // Compute operations\n  // ========================================================================\n\n  computeIfAbsent(key: K, mappingFunction: (key: K) => V): V {\n    const existing = this.getOrUndefined(key);\n    if (existing !== undefined) {\n      return existing;\n    }\n\n    const newValue = mappingFunction(key);\n    this.set(key, newValue);\n    return newValue;\n  }\n\n  computeIfPresent(\n    key: K,\n    remappingFunction: (key: K, value: V) => V | undefined\n  ): V | undefined {\n    const existing = this.getOrUndefined(key);\n    if (existing === undefined) {\n      return undefined;\n    }\n\n    const newValue = remappingFunction(key, existing);\n    if (newValue === undefined) {\n      this.delete(key);\n      return undefined;\n    }\n\n    this.set(key, newValue);\n    return newValue;\n  }\n\n  compute(\n    key: K,\n    remappingFunction: (key: K, value: V | undefined) => V | undefined\n  ): V | undefined {\n    const existing = this.getOrUndefined(key);\n    const newValue = remappingFunction(key, existing);\n\n    if (newValue === undefined) {\n      if (existing !== undefined) {\n        this.delete(key);\n      }\n      return undefined;\n    }\n\n    this.set(key, newValue);\n    return newValue;\n  }\n\n  merge(\n    key: K,\n    value: V,\n    remappingFunction: (oldValue: V, newValue: V) => V | undefined\n  ): V | undefined {\n    const existing = this.getOrUndefined(key);\n\n    if (existing === undefined) {\n      this.set(key, value);\n      return value;\n    }\n\n    const merged = remappingFunction(existing, value);\n    if (merged === undefined) {\n      this.delete(key);\n      return undefined;\n    }\n\n    this.set(key, merged);\n    return merged;\n  }\n\n  // ========================================================================\n  // Bulk operations\n  // ========================================================================\n\n  putAll(other: MapLike<K, V> | Iterable<Entry<K, V>>): void {\n    for (const entry of other) {\n      this.set(entry.key, entry.value);\n    }\n  }\n\n  clear(): void {\n    this._buckets.fill(null);\n    this._size = 0;\n    this._modCount++;\n  }\n\n  // ========================================================================\n  // Views\n  // ========================================================================\n\n  *keys(): IterableIterator<K> {\n    const expected = this._modCount;\n    for (const bucket of this._buckets) {\n      let node = bucket;\n      while (node !== null) {\n        yield node.key;\n        this.checkUnchanged(expected);\n        node = node.next;\n      }\n    }\n  }\n\n  *values(): IterableIterator<V> {\n    const expected = this._modCount;\n    for (const bucket of this._buckets) {\n      let node = bucket;\n      while (node !== null) {\n        yield node.value;\n        this.checkUnchanged(expected);\n        node = node.next;\n      }\n    }\n  }\n\n  *entries(): IterableIterator<Entry<K, V>> {\n    const expected = this._modCount;\n    for (const bucket of this._buckets) {\n      let node = bucket;\n      while (node !== null) {\n        yield { key: node.key, value: node.value };\n        this.checkUnchanged(expected);\n        node = node.next;\n      }\n    }\n  }\n\n  // ========================================================================\n  // Iteration\n  // ========================================================================\n\n  *[Symbol.iterator](): Iterator<Entry<K, V>> {\n    yield* this.entries();\n  }\n\n  forEach(action: (value: V, key: K, map: this) => void): void {\n    for (const entry of this.entries()) {\n      action(entry.value, entry.key, this);\n    }\n  }\n\n  // ========================================================================\n  // Internal helpers\n  // ========================================================================\n\n  /** This method throws when the map changed structurally after an iterator started. */\n  private checkUnchanged(expected: number): void {\n    if (this._modCount !== expected) {\n      throw new Error(\"HashMap changed during iteration\");\n    }\n  }\n\n  /**\n   * This method gives the bucket index for a given hash.\n   */\n  private bucketIndex(hash: number): number {\n    // Use bitwise AND with (length - 1) for efficient modulo\n    // This works because length is always a power of 2\n    return hash & (this._buckets.length - 1);\n  }\n\n  /**\n   * This method resizes the hash table to double its current capacity.\n   */\n  private resize(): void {\n    const oldBuckets = this._buckets;\n    const newCapacity = oldBuckets.length << 1; // Double capacity\n\n    if (newCapacity < 0) {\n      throw new Error(\"Map too large\");\n    }\n\n    this._buckets = new Array(newCapacity).fill(null);\n    this._threshold = Math.floor(newCapacity * this._loadFactor);\n    this._modCount++;\n\n    // Rehash all entries\n    for (const bucket of oldBuckets) {\n      let node = bucket;\n      while (node !== null) {\n        const next = node.next;\n        const index = this.bucketIndex(node.hash);\n        node.next = this._buckets[index] ?? null;\n        this._buckets[index] = node;\n        node = next;\n      }\n    }\n  }\n\n  /**\n   * This method gives the next power of 2 >= n.\n   */\n  private nextPowerOfTwo(n: number): number {\n    if (n <= 0) return 1;\n    n--;\n    n |= n >> 1;\n    n |= n >> 2;\n    n |= n >> 4;\n    n |= n >> 8;\n    n |= n >> 16;\n    return n + 1;\n  }\n\n  // ========================================================================\n  // Inspection\n  // ========================================================================\n\n  /**\n   * This value is the current number of buckets.\n   */\n  get capacity(): number {\n    return this._buckets.length;\n  }\n\n  /**\n   * This value is the current load factor (size / capacity).\n   */\n  get loadFactor(): number {\n    return this._size / this._buckets.length;\n  }\n\n  /**\n   * This method gives statistics about bucket distribution (for debugging).\n   */\n  getStats(): {\n    size: number;\n    capacity: number;\n    loadFactor: number;\n    avgChainLength: number;\n    maxChainLength: number;\n    emptyBuckets: number;\n  } {\n    let maxChainLength = 0;\n    let totalChainLength = 0;\n    let emptyBuckets = 0;\n\n    for (const bucket of this._buckets) {\n      if (bucket === null) {\n        emptyBuckets++;\n      } else {\n        let length = 0;\n        let node: Node<K, V> | null = bucket;\n        while (node !== null) {\n          length++;\n          node = node.next;\n        }\n        totalChainLength += length;\n        maxChainLength = Math.max(maxChainLength, length);\n      }\n    }\n\n    return {\n      size: this._size,\n      capacity: this._buckets.length,\n      loadFactor: this.loadFactor,\n      avgChainLength: this._size > 0 ? totalChainLength / (this._buckets.length - emptyBuckets) : 0,\n      maxChainLength,\n      emptyBuckets,\n    };\n  }\n}\n\n/**\n * Factory function to make a HashMap.\n *\n * @example\n * const map = hashMap<string, number>()\n * const mapWithOptions = hashMap<User, Data>({\n *   keyEq: (a, b) => a.id === b.id,\n *   keyHash: (u) => hashString(u.id)\n * })\n * const mapFromEntries = hashMap([['a', 1], ['b', 2]])\n */\nexport function hashMap<K, V>(\n  optionsOrEntries?: HashMapOptions<K, V> | Iterable<readonly [K, V]>\n): HashMap<K, V> {\n  // Check if it's an iterable of entries\n  if (optionsOrEntries && Symbol.iterator in optionsOrEntries) {\n    const map = new HashMap<K, V>();\n    for (const [key, value] of optionsOrEntries as Iterable<readonly [K, V]>) {\n      map.set(key, value);\n    }\n    return map;\n  }\n\n  return new HashMap<K, V>(optionsOrEntries as HashMapOptions<K, V>);\n}\n","/**\n * LinkedHashMap - HashMap that maintains insertion order.\n *\n * This module combines a hash table with a doubly-linked list to maintain predictable\n * iteration order. Mirrors java.util.LinkedHashMap.\n *\n * Key features:\n * - O(1) access, insert, delete (like HashMap)\n * - Predictable iteration order (insertion order or access order)\n * - Perfect for LRU caches when accessOrder is true\n *\n * @example\n * const map = linkedHashMap<string, number>()\n * map.set('a', 1)\n * map.set('b', 2)\n * map.set('c', 3)\n * // Iteration order: a, b, c (insertion order)\n *\n * @example\n * // LRU cache with access order\n * const lru = linkedHashMap<string, number>({ accessOrder: true })\n * lru.set('a', 1)\n * lru.set('b', 2)\n * lru.get('a') // Moves 'a' to end\n * // Iteration order: b, a (access order)\n */\n\nimport type { MapLike, Entry } from \"../interfaces/map.js\";\nimport type { Eq, Hash } from \"../core/traits.js\";\nimport { defaultEq, defaultHash } from \"../utils/defaults.js\";\n\n/**\n * An entry. It is in two lists: the chain of its hash bucket (`next`) and the order list\n * (`before`, `after`). Before, one `next` field served both lists, so the first collision or\n * resize corrupted the map (BUGS-2026-07 C10).\n */\ninterface LinkedNode<K, V> {\n  key: K;\n  value: V;\n  hash: number;\n  /** The next entry of the same hash bucket */\n  next: LinkedNode<K, V> | null;\n  /** The entry before this one in the iteration order */\n  before: LinkedNode<K, V> | null;\n  /** The entry after this one in the iteration order */\n  after: LinkedNode<K, V> | null;\n}\n\n/**\n * Options for making a LinkedHashMap.\n */\nexport interface LinkedHashMapOptions<K, V> {\n  /**\n   * Initial capacity of the hash table.\n   * @default 16\n   */\n  initialCapacity?: number;\n\n  /**\n   * Load factor before resizing.\n   * @default 0.75\n   */\n  loadFactor?: number;\n\n  /**\n   * Equality function for keys.\n   * @default defaultEq\n   */\n  eq?: Eq<K>;\n\n  /**\n   * Hash function for keys.\n   * @default defaultHash\n   */\n  hash?: Hash<K>;\n\n  /**\n   * Equality function for values.\n   * @default defaultEq\n   */\n  valueEq?: Eq<V>;\n\n  /**\n   * If true, maintain access order instead of insertion order.\n   * Useful for LRU caches.\n   * @default false\n   */\n  accessOrder?: boolean;\n}\n\n/**\n * LinkedHashMap<K, V> - Hash map with predictable iteration order.\n *\n * This class maintains a doubly-linked list of entries to preserve insertion order\n * (or access order if accessOrder is true).\n */\nexport class LinkedHashMap<K, V> implements MapLike<K, V> {\n  private _buckets: (LinkedNode<K, V> | null)[];\n  private _size: number = 0;\n  private readonly _loadFactor: number;\n  private readonly _eq: Eq<K>;\n  private readonly _hash: Hash<K>;\n  private readonly _valueEq: Eq<V>;\n  private readonly _accessOrder: boolean;\n\n  // Doubly-linked list sentinels\n  private _head: LinkedNode<K, V> | null = null;\n  private _tail: LinkedNode<K, V> | null = null;\n\n  constructor(options: LinkedHashMapOptions<K, V> = {}) {\n    const {\n      initialCapacity = 16,\n      loadFactor = 0.75,\n      eq = defaultEq,\n      hash = defaultHash,\n      valueEq = defaultEq,\n      accessOrder = false,\n    } = options;\n\n    this._buckets = new Array(Math.max(1, initialCapacity)).fill(null);\n    this._loadFactor = loadFactor;\n    this._eq = eq;\n    this._hash = hash;\n    this._valueEq = valueEq;\n    this._accessOrder = accessOrder;\n  }\n\n  // ========================================================================\n  // Size and state\n  // ========================================================================\n\n  get size(): number {\n    return this._size;\n  }\n\n  get isEmpty(): boolean {\n    return this._size === 0;\n  }\n\n  get eq(): Eq<K> {\n    return this._eq;\n  }\n\n  get keyEq(): Eq<K> {\n    return this._eq;\n  }\n\n  get valueEq(): Eq<V> {\n    return this._valueEq;\n  }\n\n  get hash(): Hash<K> {\n    return this._hash;\n  }\n\n  // ========================================================================\n  // Lookup operations\n  // ========================================================================\n\n  has(key: K): boolean {\n    return this.getNode(key) !== null;\n  }\n\n  containsKey(key: K): boolean {\n    return this.has(key);\n  }\n\n  containsValue(value: V): boolean {\n    let node = this._head;\n    while (node !== null) {\n      if (this._valueEq(node.value, value)) {\n        return true;\n      }\n      node = node.after;\n    }\n    return false;\n  }\n\n  get(key: K): V {\n    const node = this.getNode(key);\n    if (node === null) {\n      throw new Error(\"Key not found\");\n    }\n    if (this._accessOrder) {\n      this.moveToEnd(node);\n    }\n    return node.value;\n  }\n\n  getOrUndefined(key: K): V | undefined {\n    const node = this.getNode(key);\n    if (node === null) return undefined;\n    if (this._accessOrder) {\n      this.moveToEnd(node);\n    }\n    return node.value;\n  }\n\n  getOrDefault(key: K, defaultValue: V): V {\n    const node = this.getNode(key);\n    if (node === null) return defaultValue;\n    if (this._accessOrder) {\n      this.moveToEnd(node);\n    }\n    return node.value;\n  }\n\n  // ========================================================================\n  // Modification operations\n  // ========================================================================\n\n  set(key: K, value: V): V | undefined {\n    const hashCode = this._hash(key);\n    const index = this.getBucketIndex(hashCode);\n    let node = this._buckets[index] ?? null;\n\n    // Check if key already exists\n    while (node !== null) {\n      if (node.hash === hashCode && this._eq(node.key, key)) {\n        const oldValue = node.value;\n        node.value = value;\n        if (this._accessOrder) {\n          this.moveToEnd(node);\n        }\n        return oldValue;\n      }\n      node = node.next;\n    }\n\n    // Key doesn't exist, add new entry\n    const newNode: LinkedNode<K, V> = {\n      key,\n      value,\n      hash: hashCode,\n      next: this._buckets[index] ?? null,\n      before: null,\n      after: null,\n    };\n\n    this._buckets[index] = newNode;\n    this._size++;\n\n    // Add to linked list\n    this.addToEnd(newNode);\n\n    // Resize if needed\n    if (this._size > this._buckets.length * this._loadFactor) {\n      this.resize();\n    }\n\n    return undefined;\n  }\n\n  setIfAbsent(key: K, value: V): V {\n    const existing = this.getNode(key);\n    if (existing !== null) {\n      if (this._accessOrder) {\n        this.moveToEnd(existing);\n      }\n      return existing.value;\n    }\n    this.set(key, value);\n    return value;\n  }\n\n  replace(key: K, value: V): V | undefined {\n    const node = this.getNode(key);\n    if (node === null) return undefined;\n    const oldValue = node.value;\n    node.value = value;\n    if (this._accessOrder) {\n      this.moveToEnd(node);\n    }\n    return oldValue;\n  }\n\n  replaceEntry(key: K, oldValue: V, newValue: V): boolean {\n    const node = this.getNode(key);\n    if (node === null || !this._valueEq(node.value, oldValue)) {\n      return false;\n    }\n    node.value = newValue;\n    if (this._accessOrder) {\n      this.moveToEnd(node);\n    }\n    return true;\n  }\n\n  delete(key: K): V | undefined {\n    const node = this.getNode(key);\n    if (node === null) return undefined;\n\n    const oldValue = node.value;\n\n    // Remove from bucket\n    this.removeFromBucket(node);\n\n    // Remove from linked list\n    this.removeFromList(node);\n\n    this._size--;\n    return oldValue;\n  }\n\n  deleteEntry(key: K, value: V): boolean {\n    const node = this.getNode(key);\n    if (node === null || !this._valueEq(node.value, value)) {\n      return false;\n    }\n\n    // Remove from bucket\n    this.removeFromBucket(node);\n\n    // Remove from linked list\n    this.removeFromList(node);\n\n    this._size--;\n    return true;\n  }\n\n  clear(): void {\n    this._buckets = new Array(this._buckets.length).fill(null);\n    this._size = 0;\n    this._head = null;\n    this._tail = null;\n  }\n\n  // ========================================================================\n  // Bulk operations\n  // ========================================================================\n\n  putAll(other: MapLike<K, V> | Iterable<Entry<K, V>>): void {\n    if ('entries' in other && typeof other.entries === 'function') {\n      for (const entry of other.entries()) {\n        this.set(entry.key, entry.value);\n      }\n    } else {\n      for (const entry of other as Iterable<Entry<K, V>>) {\n        this.set(entry.key, entry.value);\n      }\n    }\n  }\n\n  // ========================================================================\n  // Computed operations\n  // ========================================================================\n\n  computeIfAbsent(key: K, mappingFunction: (key: K) => V): V {\n    const existing = this.getNode(key);\n    if (existing !== null) {\n      if (this._accessOrder) {\n        this.moveToEnd(existing);\n      }\n      return existing.value;\n    }\n    const value = mappingFunction(key);\n    this.set(key, value);\n    return value;\n  }\n\n  computeIfPresent(key: K, remappingFunction: (key: K, value: V) => V | undefined): V | undefined {\n    const existing = this.getNode(key);\n    if (existing === null) return undefined;\n\n    const newValue = remappingFunction(key, existing.value);\n    if (newValue === undefined) {\n      this.delete(key);\n      return undefined;\n    }\n    existing.value = newValue;\n    if (this._accessOrder) {\n      this.moveToEnd(existing);\n    }\n    return newValue;\n  }\n\n  compute(key: K, remappingFunction: (key: K, value: V | undefined) => V | undefined): V | undefined {\n    const existing = this.getNode(key);\n    const newValue = remappingFunction(key, existing?.value);\n\n    if (newValue === undefined) {\n      if (existing !== null) {\n        this.delete(key);\n      }\n      return undefined;\n    }\n\n    this.set(key, newValue);\n    return newValue;\n  }\n\n  merge(key: K, value: V, remappingFunction: (oldValue: V, newValue: V) => V | undefined): V | undefined {\n    const existing = this.getNode(key);\n\n    if (existing === null) {\n      this.set(key, value);\n      return value;\n    }\n\n    const merged = remappingFunction(existing.value, value);\n    if (merged === undefined) {\n      this.delete(key);\n      return undefined;\n    }\n\n    existing.value = merged;\n    if (this._accessOrder) {\n      this.moveToEnd(existing);\n    }\n    return merged;\n  }\n\n  // ========================================================================\n  // View operations\n  // ========================================================================\n\n  *keys(): IterableIterator<K> {\n    let node = this._head;\n    while (node !== null) {\n      yield node.key;\n      node = node.after;\n    }\n  }\n\n  *values(): IterableIterator<V> {\n    let node = this._head;\n    while (node !== null) {\n      yield node.value;\n      node = node.after;\n    }\n  }\n\n  *entries(): IterableIterator<Entry<K, V>> {\n    let node = this._head;\n    while (node !== null) {\n      yield { key: node.key, value: node.value };\n      node = node.after;\n    }\n  }\n\n  *[Symbol.iterator](): Iterator<Entry<K, V>> {\n    yield* this.entries();\n  }\n\n  forEach(action: (value: V, key: K, map: this) => void): void {\n    for (const entry of this.entries()) {\n      action(entry.value, entry.key, this);\n    }\n  }\n\n  toArray(): Entry<K, V>[] {\n    return Array.from(this.entries());\n  }\n\n  // ========================================================================\n  // Private helpers\n  // ========================================================================\n\n  private getNode(key: K): LinkedNode<K, V> | null {\n    const hashCode = this._hash(key);\n    const index = this.getBucketIndex(hashCode);\n    let node = this._buckets[index] ?? null;\n\n    while (node !== null) {\n      if (node.hash === hashCode && this._eq(node.key, key)) {\n        return node;\n      }\n      node = node.next;\n    }\n\n    return null;\n  }\n\n  private getBucketIndex(hashCode: number): number {\n    return Math.abs(hashCode) % this._buckets.length;\n  }\n\n  private removeFromBucket(node: LinkedNode<K, V>): void {\n    const index = this.getBucketIndex(node.hash);\n    let current = this._buckets[index] ?? null;\n    let prev: LinkedNode<K, V> | null = null;\n\n    while (current !== null) {\n      if (current === node) {\n        if (prev === null) {\n          this._buckets[index] = current.next;\n        } else {\n          prev.next = current.next;\n        }\n        return;\n      }\n      prev = current;\n      current = current.next;\n    }\n  }\n\n  private addToEnd(node: LinkedNode<K, V>): void {\n    node.before = this._tail;\n    node.after = null;\n    if (this._tail === null) this._head = node;\n    else this._tail.after = node;\n    this._tail = node;\n  }\n\n  private removeFromList(node: LinkedNode<K, V>): void {\n    if (node.before !== null) node.before.after = node.after;\n    else this._head = node.after;\n    if (node.after !== null) node.after.before = node.before;\n    else this._tail = node.before;\n    node.before = node.after = null;\n  }\n\n  private moveToEnd(node: LinkedNode<K, V>): void {\n    if (node === this._tail) return; // Already at end\n    this.removeFromList(node);\n    this.addToEnd(node);\n  }\n\n  private resize(): void {\n    this._buckets = new Array(this._buckets.length * 2).fill(null);\n    // Rebuild the bucket chains (`next`) from the order list (`after`)\n    for (let node = this._head; node !== null; node = node.after) {\n      const index = this.getBucketIndex(node.hash);\n      node.next = this._buckets[index] ?? null;\n      this._buckets[index] = node;\n    }\n  }\n\n  // ========================================================================\n  // Utility methods\n  // ========================================================================\n\n  toString(): string {\n    const entries = Array.from(this.entries())\n      .map(({ key, value }) => `${key}=${value}`)\n      .join(', ');\n    return `LinkedHashMap{${entries}}`;\n  }\n}\n\n/**\n * Factory function to make a LinkedHashMap.\n *\n * @example\n * const map = linkedHashMap<string, number>()\n * map.set('a', 1)\n * map.set('b', 2)\n *\n * @example\n * // With initial entries\n * const map = linkedHashMap<string, number>([\n *   ['a', 1],\n *   ['b', 2]\n * ])\n *\n * @example\n * // LRU cache with access order\n * const lru = linkedHashMap<string, number>({ accessOrder: true })\n */\nexport function linkedHashMap<K, V>(\n  optionsOrEntries?: LinkedHashMapOptions<K, V> | Iterable<[K, V]>\n): LinkedHashMap<K, V> {\n  if (optionsOrEntries && Symbol.iterator in optionsOrEntries) {\n    const map = new LinkedHashMap<K, V>();\n    for (const [key, value] of optionsOrEntries as Iterable<[K, V]>) {\n      map.set(key, value);\n    }\n    return map;\n  }\n\n  return new LinkedHashMap<K, V>(optionsOrEntries as LinkedHashMapOptions<K, V>);\n}\n","/**\n * TreeMap - Red-black tree based sorted map implementation.\n *\n * This module implements a self-balancing binary search tree that maintains keys in sorted\n * order. Mirrors java.util.TreeMap.\n *\n * Key features:\n * - O(log n) access, insert, delete\n * - Keys maintained in sorted order (natural or custom comparator)\n * - Navigation methods (floor, ceiling, lower, higher)\n * - Range view operations (subMap, headMap, tailMap)\n *\n * @example\n * const map = treeMap<string, number>()\n * map.set('c', 3)\n * map.set('a', 1)\n * map.set('b', 2)\n * // Iteration order: a, b, c (sorted)\n *\n * @example\n * // Custom comparator for descending order\n * const map = treeMap<number, string>({\n *   compare: (a, b) => b - a\n * })\n */\n\nimport type { NavigableMap, SortedMap, Entry } from \"../interfaces/map.js\";\nimport type { Eq, Compare } from \"../core/traits.js\";\nimport { defaultEq, defaultCompare } from \"../utils/defaults.js\";\n\n/**\n * Node color in red-black tree.\n */\nconst Color = {\n  RED: \"RED\",\n  BLACK: \"BLACK\",\n} as const;\ntype Color = (typeof Color)[keyof typeof Color];\n\n/**\n * Node in the red-black tree.\n */\ninterface TreeNode<K, V> {\n  key: K;\n  value: V;\n  color: Color;\n  left: TreeNode<K, V> | null;\n  right: TreeNode<K, V> | null;\n  parent: TreeNode<K, V> | null;\n}\n\n// Null-safe helpers of the red-black algorithms: a null leaf is black\nfunction colorOf<K, V>(node: TreeNode<K, V> | null): Color {\n  return node === null ? Color.BLACK : node.color;\n}\nfunction parentOf<K, V>(node: TreeNode<K, V> | null): TreeNode<K, V> | null {\n  return node === null ? null : node.parent;\n}\nfunction leftOf<K, V>(node: TreeNode<K, V> | null): TreeNode<K, V> | null {\n  return node === null ? null : node.left;\n}\nfunction rightOf<K, V>(node: TreeNode<K, V> | null): TreeNode<K, V> | null {\n  return node === null ? null : node.right;\n}\nfunction setColor<K, V>(node: TreeNode<K, V> | null, color: Color): void {\n  if (node !== null) node.color = color;\n}\n\n/**\n * Options for making a TreeMap.\n */\nexport interface TreeMapOptions<K, V> {\n  /**\n   * Comparison function for keys.\n   * @default defaultCompare\n   */\n  compare?: Compare<K>;\n\n  /**\n   * Equality function for keys.\n   * @default defaultEq\n   */\n  eq?: Eq<K>;\n\n  /**\n   * Equality function for values.\n   * @default defaultEq\n   */\n  valueEq?: Eq<V>;\n}\n\n/**\n * TreeMap<K, V> - Red-black tree based sorted map.\n *\n * Maintains keys in sorted order using a self-balancing binary search tree.\n * This class gives O(log n) operations and navigation methods.\n */\nexport class TreeMap<K, V> implements NavigableMap<K, V> {\n  private _root: TreeNode<K, V> | null = null;\n  private _size: number = 0;\n  private readonly _compare: Compare<K>;\n  private readonly _eq: Eq<K>;\n  private readonly _valueEq: Eq<V>;\n\n  constructor(options: TreeMapOptions<K, V> = {}) {\n    const {\n      compare = defaultCompare,\n      eq = defaultEq,\n      valueEq = defaultEq,\n    } = options;\n\n    this._compare = compare;\n    this._eq = eq;\n    this._valueEq = valueEq;\n  }\n\n  // ========================================================================\n  // Size and state\n  // ========================================================================\n\n  get size(): number {\n    return this._size;\n  }\n\n  get isEmpty(): boolean {\n    return this._size === 0;\n  }\n\n  get comparator(): Compare<K> {\n    return this._compare;\n  }\n\n  get keyEq(): Eq<K> {\n    return this._eq;\n  }\n\n  get valueEq(): Eq<V> {\n    return this._valueEq;\n  }\n\n  // ========================================================================\n  // Lookup operations\n  // ========================================================================\n\n  has(key: K): boolean {\n    return this.getNode(key) !== null;\n  }\n\n  containsKey(key: K): boolean {\n    return this.has(key);\n  }\n\n  containsValue(value: V): boolean {\n    return this.findValue(this._root, value);\n  }\n\n  get(key: K): V {\n    const node = this.getNode(key);\n    if (node === null) {\n      throw new Error(\"Key not found\");\n    }\n    return node.value;\n  }\n\n  getOrUndefined(key: K): V | undefined {\n    const node = this.getNode(key);\n    return node?.value;\n  }\n\n  getOrDefault(key: K, defaultValue: V): V {\n    const node = this.getNode(key);\n    return node !== null ? node.value : defaultValue;\n  }\n\n  // ========================================================================\n  // Modification operations\n  // ========================================================================\n\n  set(key: K, value: V): V | undefined {\n    if (this._root === null) {\n      this._root = this.createNode(key, value, Color.BLACK);\n      this._size++;\n      return undefined;\n    }\n\n    // Find insertion point\n    let node: TreeNode<K, V> | null = this._root;\n    let parent: TreeNode<K, V> | null = null;\n\n    while (node !== null) {\n      parent = node;\n      const cmp = this._compare(key, node.key);\n\n      if (cmp === 0) {\n        // Key exists, replace value\n        const oldValue = node.value;\n        node.value = value;\n        return oldValue;\n      } else if (cmp < 0) {\n        node = node.left;\n      } else {\n        node = node.right;\n      }\n    }\n\n    // Insert new node\n    const newNode = this.createNode(key, value, Color.RED);\n    newNode.parent = parent;\n\n    if (parent !== null) {\n      const cmp = this._compare(key, parent.key);\n      if (cmp < 0) {\n        parent.left = newNode;\n      } else {\n        parent.right = newNode;\n      }\n    }\n\n    this._size++;\n    this.fixAfterInsertion(newNode);\n    return undefined;\n  }\n\n  setIfAbsent(key: K, value: V): V {\n    const existing = this.getNode(key);\n    if (existing !== null) {\n      return existing.value;\n    }\n    this.set(key, value);\n    return value;\n  }\n\n  replace(key: K, value: V): V | undefined {\n    const node = this.getNode(key);\n    if (node === null) return undefined;\n    const oldValue = node.value;\n    node.value = value;\n    return oldValue;\n  }\n\n  replaceEntry(key: K, oldValue: V, newValue: V): boolean {\n    const node = this.getNode(key);\n    if (node === null || !this._valueEq(node.value, oldValue)) {\n      return false;\n    }\n    node.value = newValue;\n    return true;\n  }\n\n  delete(key: K): V | undefined {\n    const node = this.getNode(key);\n    if (node === null) return undefined;\n\n    const oldValue = node.value;\n    this.deleteNode(node);\n    this._size--;\n    return oldValue;\n  }\n\n  deleteEntry(key: K, value: V): boolean {\n    const node = this.getNode(key);\n    if (node === null || !this._valueEq(node.value, value)) {\n      return false;\n    }\n    this.deleteNode(node);\n    this._size--;\n    return true;\n  }\n\n  clear(): void {\n    this._root = null;\n    this._size = 0;\n  }\n\n  // ========================================================================\n  // Bulk operations\n  // ========================================================================\n\n  putAll(other: NavigableMap<K, V> | Iterable<Entry<K, V>>): void {\n    if ('entries' in other && typeof other.entries === 'function') {\n      for (const entry of other.entries()) {\n        this.set(entry.key, entry.value);\n      }\n    } else {\n      for (const entry of other as Iterable<Entry<K, V>>) {\n        this.set(entry.key, entry.value);\n      }\n    }\n  }\n\n  // ========================================================================\n  // Computed operations\n  // ========================================================================\n\n  computeIfAbsent(key: K, mappingFunction: (key: K) => V): V {\n    const existing = this.getNode(key);\n    if (existing !== null) {\n      return existing.value;\n    }\n    const value = mappingFunction(key);\n    this.set(key, value);\n    return value;\n  }\n\n  computeIfPresent(key: K, remappingFunction: (key: K, value: V) => V | undefined): V | undefined {\n    const existing = this.getNode(key);\n    if (existing === null) return undefined;\n\n    const newValue = remappingFunction(key, existing.value);\n    if (newValue === undefined) {\n      this.delete(key);\n      return undefined;\n    }\n    existing.value = newValue;\n    return newValue;\n  }\n\n  compute(key: K, remappingFunction: (key: K, value: V | undefined) => V | undefined): V | undefined {\n    const existing = this.getNode(key);\n    const newValue = remappingFunction(key, existing?.value);\n\n    if (newValue === undefined) {\n      if (existing !== null) {\n        this.delete(key);\n      }\n      return undefined;\n    }\n\n    this.set(key, newValue);\n    return newValue;\n  }\n\n  merge(key: K, value: V, remappingFunction: (oldValue: V, newValue: V) => V | undefined): V | undefined {\n    const existing = this.getNode(key);\n\n    if (existing === null) {\n      this.set(key, value);\n      return value;\n    }\n\n    const merged = remappingFunction(existing.value, value);\n    if (merged === undefined) {\n      this.delete(key);\n      return undefined;\n    }\n\n    existing.value = merged;\n    return merged;\n  }\n\n  // ========================================================================\n  // SortedMap operations\n  // ========================================================================\n\n  firstKey(): K {\n    if (this._root === null) {\n      throw new Error(\"Map is empty\");\n    }\n    return this.getFirstNode(this._root).key;\n  }\n\n  lastKey(): K {\n    if (this._root === null) {\n      throw new Error(\"Map is empty\");\n    }\n    return this.getLastNode(this._root).key;\n  }\n\n  headMap(toKey: K): SortedMap<K, V> {\n    // Return a view (simplified: create new map with filtered entries)\n    const result = new TreeMap<K, V>({\n      compare: this._compare,\n      eq: this._eq,\n      valueEq: this._valueEq,\n    });\n\n    for (const entry of this.entries()) {\n      if (this._compare(entry.key, toKey) < 0) {\n        result.set(entry.key, entry.value);\n      } else {\n        break; // Keys are sorted, so we can stop\n      }\n    }\n\n    return result;\n  }\n\n  tailMap(fromKey: K): SortedMap<K, V> {\n    const result = new TreeMap<K, V>({\n      compare: this._compare,\n      eq: this._eq,\n      valueEq: this._valueEq,\n    });\n\n    let started = false;\n    for (const entry of this.entries()) {\n      if (!started && this._compare(entry.key, fromKey) < 0) {\n        continue;\n      }\n      started = true;\n      result.set(entry.key, entry.value);\n    }\n\n    return result;\n  }\n\n  subMap(fromKey: K, toKey: K): SortedMap<K, V> {\n    const result = new TreeMap<K, V>({\n      compare: this._compare,\n      eq: this._eq,\n      valueEq: this._valueEq,\n    });\n\n    for (const entry of this.entries()) {\n      const cmpFrom = this._compare(entry.key, fromKey);\n      const cmpTo = this._compare(entry.key, toKey);\n\n      if (cmpFrom >= 0 && cmpTo < 0) {\n        result.set(entry.key, entry.value);\n      } else if (cmpTo >= 0) {\n        break; // Past the range\n      }\n    }\n\n    return result;\n  }\n\n  // ========================================================================\n  // NavigableMap operations\n  // ========================================================================\n\n  floorKey(key: K): K | undefined {\n    return this.floorEntry(key)?.key;\n  }\n\n  ceilingKey(key: K): K | undefined {\n    return this.ceilingEntry(key)?.key;\n  }\n\n  lowerKey(key: K): K | undefined {\n    return this.lowerEntry(key)?.key;\n  }\n\n  higherKey(key: K): K | undefined {\n    return this.higherEntry(key)?.key;\n  }\n\n  floorEntry(key: K): Entry<K, V> | undefined {\n    let node = this._root;\n    let result: TreeNode<K, V> | null = null;\n\n    while (node !== null) {\n      const cmp = this._compare(key, node.key);\n      if (cmp === 0) {\n        return { key: node.key, value: node.value };\n      } else if (cmp < 0) {\n        node = node.left;\n      } else {\n        result = node; // This node is <= key\n        node = node.right;\n      }\n    }\n\n    return result ? { key: result.key, value: result.value } : undefined;\n  }\n\n  ceilingEntry(key: K): Entry<K, V> | undefined {\n    let node = this._root;\n    let result: TreeNode<K, V> | null = null;\n\n    while (node !== null) {\n      const cmp = this._compare(key, node.key);\n      if (cmp === 0) {\n        return { key: node.key, value: node.value };\n      } else if (cmp > 0) {\n        node = node.right;\n      } else {\n        result = node; // This node is >= key\n        node = node.left;\n      }\n    }\n\n    return result ? { key: result.key, value: result.value } : undefined;\n  }\n\n  lowerEntry(key: K): Entry<K, V> | undefined {\n    let node = this._root;\n    let result: TreeNode<K, V> | null = null;\n\n    while (node !== null) {\n      const cmp = this._compare(key, node.key);\n      if (cmp <= 0) {\n        node = node.left;\n      } else {\n        result = node; // This node is < key\n        node = node.right;\n      }\n    }\n\n    return result ? { key: result.key, value: result.value } : undefined;\n  }\n\n  higherEntry(key: K): Entry<K, V> | undefined {\n    let node = this._root;\n    let result: TreeNode<K, V> | null = null;\n\n    while (node !== null) {\n      const cmp = this._compare(key, node.key);\n      if (cmp >= 0) {\n        node = node.right;\n      } else {\n        result = node; // This node is > key\n        node = node.left;\n      }\n    }\n\n    return result ? { key: result.key, value: result.value } : undefined;\n  }\n\n  firstEntry(): Entry<K, V> | undefined {\n    if (this._root === null) return undefined;\n    const node = this.getFirstNode(this._root);\n    return { key: node.key, value: node.value };\n  }\n\n  lastEntry(): Entry<K, V> | undefined {\n    if (this._root === null) return undefined;\n    const node = this.getLastNode(this._root);\n    return { key: node.key, value: node.value };\n  }\n\n  pollFirstEntry(): Entry<K, V> | undefined {\n    if (this._root === null) return undefined;\n    const node = this.getFirstNode(this._root);\n    const entry = { key: node.key, value: node.value };\n    this.deleteNode(node);\n    this._size--;\n    return entry;\n  }\n\n  pollLastEntry(): Entry<K, V> | undefined {\n    if (this._root === null) return undefined;\n    const node = this.getLastNode(this._root);\n    const entry = { key: node.key, value: node.value };\n    this.deleteNode(node);\n    this._size--;\n    return entry;\n  }\n\n  descendingMap(): NavigableMap<K, V> {\n    // Create a new TreeMap with reversed comparator\n    const reversed = new TreeMap<K, V>({\n      compare: (a, b) => this._compare(b, a),\n      eq: this._eq,\n      valueEq: this._valueEq,\n    });\n\n    for (const entry of this.entries()) {\n      reversed.set(entry.key, entry.value);\n    }\n\n    return reversed;\n  }\n\n  *descendingKeys(): IterableIterator<K> {\n    yield* this.reverseInOrderTraversal(this._root, (node) => node.key);\n  }\n\n  // ========================================================================\n  // View operations\n  // ========================================================================\n\n  *keys(): IterableIterator<K> {\n    yield* this.inOrderTraversal(this._root, (node) => node.key);\n  }\n\n  *values(): IterableIterator<V> {\n    yield* this.inOrderTraversal(this._root, (node) => node.value);\n  }\n\n  *entries(): IterableIterator<Entry<K, V>> {\n    yield* this.inOrderTraversal(this._root, (node) => ({\n      key: node.key,\n      value: node.value,\n    }));\n  }\n\n  *[Symbol.iterator](): Iterator<Entry<K, V>> {\n    yield* this.entries();\n  }\n\n  forEach(action: (value: V, key: K, map: this) => void): void {\n    for (const entry of this.entries()) {\n      action(entry.value, entry.key, this);\n    }\n  }\n\n  toArray(): Entry<K, V>[] {\n    return Array.from(this.entries());\n  }\n\n  // ========================================================================\n  // Private helpers - Tree operations\n  // ========================================================================\n\n  private createNode(key: K, value: V, color: Color): TreeNode<K, V> {\n    return {\n      key,\n      value,\n      color,\n      left: null,\n      right: null,\n      parent: null,\n    };\n  }\n\n  private getNode(key: K): TreeNode<K, V> | null {\n    let node = this._root;\n\n    while (node !== null) {\n      const cmp = this._compare(key, node.key);\n      if (cmp === 0) {\n        return node;\n      } else if (cmp < 0) {\n        node = node.left;\n      } else {\n        node = node.right;\n      }\n    }\n\n    return null;\n  }\n\n  private getFirstNode(node: TreeNode<K, V>): TreeNode<K, V> {\n    while (node.left !== null) {\n      node = node.left;\n    }\n    return node;\n  }\n\n  private getLastNode(node: TreeNode<K, V>): TreeNode<K, V> {\n    while (node.right !== null) {\n      node = node.right;\n    }\n    return node;\n  }\n\n  private findValue(node: TreeNode<K, V> | null, value: V): boolean {\n    if (node === null) return false;\n    if (this._valueEq(node.value, value)) return true;\n    return this.findValue(node.left, value) || this.findValue(node.right, value);\n  }\n\n  private *inOrderTraversal<T>(\n    node: TreeNode<K, V> | null,\n    mapper: (node: TreeNode<K, V>) => T\n  ): IterableIterator<T> {\n    if (node === null) return;\n    yield* this.inOrderTraversal(node.left, mapper);\n    yield mapper(node);\n    yield* this.inOrderTraversal(node.right, mapper);\n  }\n\n  private *reverseInOrderTraversal<T>(\n    node: TreeNode<K, V> | null,\n    mapper: (node: TreeNode<K, V>) => T\n  ): IterableIterator<T> {\n    if (node === null) return;\n    yield* this.reverseInOrderTraversal(node.right, mapper);\n    yield mapper(node);\n    yield* this.reverseInOrderTraversal(node.left, mapper);\n  }\n\n  // ========================================================================\n  // Private helpers - Red-black tree balancing\n  // ========================================================================\n\n  private rotateLeft(node: TreeNode<K, V> | null): void {\n    if (node === null || node.right === null) return;\n    const right = node.right;\n    node.right = right.left;\n\n    if (right.left !== null) {\n      right.left.parent = node;\n    }\n\n    right.parent = node.parent;\n\n    if (node.parent === null) {\n      this._root = right;\n    } else if (node === node.parent.left) {\n      node.parent.left = right;\n    } else {\n      node.parent.right = right;\n    }\n\n    right.left = node;\n    node.parent = right;\n  }\n\n  private rotateRight(node: TreeNode<K, V> | null): void {\n    if (node === null || node.left === null) return;\n    const left = node.left;\n    node.left = left.right;\n\n    if (left.right !== null) {\n      left.right.parent = node;\n    }\n\n    left.parent = node.parent;\n\n    if (node.parent === null) {\n      this._root = left;\n    } else if (node === node.parent.right) {\n      node.parent.right = left;\n    } else {\n      node.parent.left = left;\n    }\n\n    left.right = node;\n    node.parent = left;\n  }\n\n  private fixAfterInsertion(node: TreeNode<K, V>): void {\n    while (node.parent !== null && node.parent.color === Color.RED) {\n      if (node.parent === node.parent.parent?.left) {\n        const uncle = node.parent.parent.right;\n\n        if (uncle?.color === Color.RED) {\n          // Case 1: Uncle is red\n          node.parent.color = Color.BLACK;\n          uncle.color = Color.BLACK;\n          node.parent.parent.color = Color.RED;\n          node = node.parent.parent;\n        } else {\n          if (node === node.parent.right) {\n            // Case 2: Node is right child\n            node = node.parent;\n            this.rotateLeft(node);\n          }\n          // Case 3: Node is left child\n          node.parent!.color = Color.BLACK;\n          node.parent!.parent!.color = Color.RED;\n          this.rotateRight(node.parent!.parent!);\n        }\n      } else {\n        const uncle = node.parent.parent?.left ?? null;\n\n        if (uncle?.color === Color.RED) {\n          // Case 1: Uncle is red\n          node.parent.color = Color.BLACK;\n          uncle.color = Color.BLACK;\n          node.parent.parent!.color = Color.RED;\n          node = node.parent.parent!;\n        } else {\n          if (node === node.parent.left) {\n            // Case 2: Node is left child\n            node = node.parent;\n            this.rotateRight(node);\n          }\n          // Case 3: Node is right child\n          node.parent!.color = Color.BLACK;\n          node.parent!.parent!.color = Color.RED;\n          this.rotateLeft(node.parent!.parent!);\n        }\n      }\n    }\n\n    this._root!.color = Color.BLACK;\n  }\n\n  /**\n   * This method deletes a node (the CLRS algorithm, as in java.util.TreeMap). A null leaf counts as black.\n   *\n   * Before (BUGS-2026-07 L10): the deletion of a black leaf skipped the fix-up, so the black\n   * heights drifted and the tree became unbalanced. Also, the fix-up treated a null leaf as\n   * \"not black\", so it chose the wrong case and rotated at null (a TypeError).\n   */\n  private deleteNode(target: TreeNode<K, V>): void {\n    let node = target;\n    // A node with two children takes the key and value of its successor, then the successor goes\n    if (node.left !== null && node.right !== null) {\n      const successor = this.getFirstNode(node.right);\n      node.key = successor.key;\n      node.value = successor.value;\n      node = successor;\n    }\n\n    const replacement = node.left ?? node.right;\n    if (replacement !== null) {\n      replacement.parent = node.parent;\n      if (node.parent === null) this._root = replacement;\n      else if (node === node.parent.left) node.parent.left = replacement;\n      else node.parent.right = replacement;\n      node.left = node.right = node.parent = null;\n      if (node.color === Color.BLACK) this.fixAfterDeletion(replacement);\n    } else if (node.parent === null) {\n      // The only node\n      this._root = null;\n    } else {\n      // A leaf: it is its own phantom replacement during the fix-up, then it goes\n      if (node.color === Color.BLACK) this.fixAfterDeletion(node);\n      if (node.parent !== null) {\n        if (node === node.parent.left) node.parent.left = null;\n        else if (node === node.parent.right) node.parent.right = null;\n        node.parent = null;\n      }\n    }\n  }\n\n  private fixAfterDeletion(start: TreeNode<K, V>): void {\n    let x: TreeNode<K, V> | null = start;\n    while (x !== this._root && colorOf(x) === Color.BLACK) {\n      if (x === leftOf(parentOf(x))) {\n        let sibling = rightOf(parentOf(x));\n        if (colorOf(sibling) === Color.RED) {\n          setColor(sibling, Color.BLACK);\n          setColor(parentOf(x), Color.RED);\n          this.rotateLeft(parentOf(x));\n          sibling = rightOf(parentOf(x));\n        }\n        if (colorOf(leftOf(sibling)) === Color.BLACK && colorOf(rightOf(sibling)) === Color.BLACK) {\n          setColor(sibling, Color.RED);\n          x = parentOf(x);\n        } else {\n          if (colorOf(rightOf(sibling)) === Color.BLACK) {\n            setColor(leftOf(sibling), Color.BLACK);\n            setColor(sibling, Color.RED);\n            this.rotateRight(sibling);\n            sibling = rightOf(parentOf(x));\n          }\n          setColor(sibling, colorOf(parentOf(x)));\n          setColor(parentOf(x), Color.BLACK);\n          setColor(rightOf(sibling), Color.BLACK);\n          this.rotateLeft(parentOf(x));\n          x = this._root;\n        }\n      } else {\n        let sibling = leftOf(parentOf(x));\n        if (colorOf(sibling) === Color.RED) {\n          setColor(sibling, Color.BLACK);\n          setColor(parentOf(x), Color.RED);\n          this.rotateRight(parentOf(x));\n          sibling = leftOf(parentOf(x));\n        }\n        if (colorOf(rightOf(sibling)) === Color.BLACK && colorOf(leftOf(sibling)) === Color.BLACK) {\n          setColor(sibling, Color.RED);\n          x = parentOf(x);\n        } else {\n          if (colorOf(leftOf(sibling)) === Color.BLACK) {\n            setColor(rightOf(sibling), Color.BLACK);\n            setColor(sibling, Color.RED);\n            this.rotateLeft(sibling);\n            sibling = leftOf(parentOf(x));\n          }\n          setColor(sibling, colorOf(parentOf(x)));\n          setColor(parentOf(x), Color.BLACK);\n          setColor(leftOf(sibling), Color.BLACK);\n          this.rotateRight(parentOf(x));\n          x = this._root;\n        }\n      }\n    }\n    setColor(x, Color.BLACK);\n  }\n\n  // ========================================================================\n  // Utility methods\n  // ========================================================================\n\n  toString(): string {\n    const entries = Array.from(this.entries())\n      .map(({ key, value }) => `${key}=${value}`)\n      .join(', ');\n    return `TreeMap{${entries}}`;\n  }\n}\n\n/**\n * Factory function to make a TreeMap.\n *\n * @example\n * const map = treeMap<string, number>()\n * map.set('c', 3)\n * map.set('a', 1)\n * map.set('b', 2)\n * // Iteration order: a, b, c\n *\n * @example\n * // With initial entries\n * const map = treeMap<string, number>([\n *   ['c', 3],\n *   ['a', 1],\n *   ['b', 2]\n * ])\n *\n * @example\n * // Custom comparator for descending order\n * const map = treeMap<number, string>({ compare: (a, b) => b - a })\n */\nexport function treeMap<K, V>(\n  optionsOrEntries?: TreeMapOptions<K, V> | Iterable<[K, V]>\n): TreeMap<K, V> {\n  if (optionsOrEntries && Symbol.iterator in optionsOrEntries) {\n    const map = new TreeMap<K, V>();\n    for (const [key, value] of optionsOrEntries as Iterable<[K, V]>) {\n      map.set(key, value);\n    }\n    return map;\n  }\n\n  return new TreeMap<K, V>(optionsOrEntries as TreeMapOptions<K, V>);\n}\n","/**\n * TreeSet - Red-black tree based sorted set implementation.\n *\n * This module implements a sorted set using TreeMap as the backing structure.\n * Mirrors java.util.TreeSet.\n *\n * Key features:\n * - O(log n) add, remove, contains\n * - Elements maintained in sorted order (natural or custom comparator)\n * - Navigation methods (floor, ceiling, lower, higher)\n * - Range view operations (subSet, headSet, tailSet)\n *\n * @example\n * const set = treeSet<string>()\n * set.add('c')\n * set.add('a')\n * set.add('b')\n * // Iteration order: a, b, c (sorted)\n *\n * @example\n * // Custom comparator for descending order\n * const set = treeSet<number>({\n *   compare: (a, b) => b - a\n * })\n */\n\nimport type { SortedSet, NavigableSet } from \"../interfaces/set.js\";\nimport type { Eq, Compare } from \"../core/traits.js\";\nimport { TreeMap } from \"./tree-map.js\";\nimport { defaultEq, defaultCompare } from \"../utils/defaults.js\";\n\n/**\n * Dummy value used for TreeMap backing.\n */\nconst PRESENT = true;\n\n/**\n * Options for making a TreeSet.\n */\nexport interface TreeSetOptions<T> {\n  /**\n   * Comparison function for elements.\n   * @default defaultCompare\n   */\n  compare?: Compare<T>;\n\n  /**\n   * Equality function for elements.\n   * @default defaultEq\n   */\n  eq?: Eq<T>;\n}\n\n/**\n * TreeSet<T> - Red-black tree based sorted set.\n *\n * Maintains elements in sorted order using a TreeMap as backing structure.\n * This class gives O(log n) operations and navigation methods.\n */\nexport class TreeSet<T> implements NavigableSet<T> {\n  private readonly _map: TreeMap<T, boolean>;\n  private readonly _compare: Compare<T>;\n  private readonly _eq: Eq<T>;\n\n  constructor(options: TreeSetOptions<T> = {}) {\n    const {\n      compare = defaultCompare,\n      eq = defaultEq,\n    } = options;\n\n    this._compare = compare;\n    this._eq = eq;\n    this._map = new TreeMap<T, boolean>({\n      compare,\n      eq,\n    });\n  }\n\n  // ========================================================================\n  // Size and state\n  // ========================================================================\n\n  get size(): number {\n    return this._map.size;\n  }\n\n  get isEmpty(): boolean {\n    return this._map.isEmpty;\n  }\n\n  get comparator(): Compare<T> {\n    return this._compare;\n  }\n\n  get eq(): Eq<T> {\n    return this._eq;\n  }\n\n  // ========================================================================\n  // Membership operations\n  // ========================================================================\n\n  has(element: T): boolean {\n    return this._map.has(element);\n  }\n\n  contains(element: T): boolean {\n    return this.has(element);\n  }\n\n  containsAll(other: Iterable<T>): boolean {\n    for (const element of other) {\n      if (!this.has(element)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  // ========================================================================\n  // Modification operations\n  // ========================================================================\n\n  add(element: T): boolean {\n    const oldValue = this._map.set(element, PRESENT);\n    return oldValue === undefined; // Returns true if element was added (not already present)\n  }\n\n  remove(element: T): boolean {\n    const removed = this._map.delete(element);\n    return removed !== undefined;\n  }\n\n  clear(): void {\n    this._map.clear();\n  }\n\n  // ========================================================================\n  // Bulk operations\n  // ========================================================================\n\n  addAll(elements: Iterable<T>): boolean {\n    let modified = false;\n    for (const element of elements) {\n      if (this.add(element)) {\n        modified = true;\n      }\n    }\n    return modified;\n  }\n\n  removeAll(elements: Iterable<T>): boolean {\n    let modified = false;\n    for (const element of elements) {\n      if (this.remove(element)) {\n        modified = true;\n      }\n    }\n    return modified;\n  }\n\n  retainAll(elements: Iterable<T>): boolean {\n    const toRetain = new Set<T>();\n    for (const element of elements) {\n      toRetain.add(element);\n    }\n\n    let modified = false;\n    for (const element of Array.from(this)) {\n      if (!toRetain.has(element)) {\n        this.remove(element);\n        modified = true;\n      }\n    }\n    return modified;\n  }\n\n  // ========================================================================\n  // Set operations\n  // ========================================================================\n\n  union(other: Iterable<T>): TreeSet<T> {\n    const result = new TreeSet<T>({\n      compare: this._compare,\n      eq: this._eq,\n    });\n\n    for (const element of this) {\n      result.add(element);\n    }\n    for (const element of other) {\n      result.add(element);\n    }\n\n    return result;\n  }\n\n  intersection(other: Iterable<T>): TreeSet<T> {\n    const result = new TreeSet<T>({\n      compare: this._compare,\n      eq: this._eq,\n    });\n\n    const otherSet = new Set<T>();\n    for (const element of other) {\n      otherSet.add(element);\n    }\n\n    for (const element of this) {\n      if (otherSet.has(element)) {\n        result.add(element);\n      }\n    }\n\n    return result;\n  }\n\n  difference(other: Iterable<T>): TreeSet<T> {\n    const result = new TreeSet<T>({\n      compare: this._compare,\n      eq: this._eq,\n    });\n\n    const otherSet = new Set<T>();\n    for (const element of other) {\n      otherSet.add(element);\n    }\n\n    for (const element of this) {\n      if (!otherSet.has(element)) {\n        result.add(element);\n      }\n    }\n\n    return result;\n  }\n\n  symmetricDifference(other: Iterable<T>): TreeSet<T> {\n    const result = new TreeSet<T>({\n      compare: this._compare,\n      eq: this._eq,\n    });\n\n    // Add all elements from this set\n    for (const element of this) {\n      result.add(element);\n    }\n\n    // Toggle elements from other set\n    for (const element of other) {\n      if (result.has(element)) {\n        result.remove(element);\n      } else {\n        result.add(element);\n      }\n    }\n\n    return result;\n  }\n\n  isSubsetOf(other: Iterable<T>): boolean {\n    const otherSet = new Set<T>();\n    for (const element of other) {\n      otherSet.add(element);\n    }\n\n    for (const element of this) {\n      if (!otherSet.has(element)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  isSupersetOf(other: Iterable<T>): boolean {\n    for (const element of other) {\n      if (!this.has(element)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  isDisjointFrom(other: Iterable<T>): boolean {\n    for (const element of other) {\n      if (this.has(element)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  // ========================================================================\n  // SortedSet operations\n  // ========================================================================\n\n  first(): T {\n    const key = this._map.firstKey();\n    return key;\n  }\n\n  last(): T {\n    const key = this._map.lastKey();\n    return key;\n  }\n\n  headSet(toElement: T): SortedSet<T> {\n    const result = new TreeSet<T>({\n      compare: this._compare,\n      eq: this._eq,\n    });\n\n    for (const element of this) {\n      if (this._compare(element, toElement) < 0) {\n        result.add(element);\n      } else {\n        break; // Elements are sorted\n      }\n    }\n\n    return result;\n  }\n\n  tailSet(fromElement: T): SortedSet<T> {\n    const result = new TreeSet<T>({\n      compare: this._compare,\n      eq: this._eq,\n    });\n\n    let started = false;\n    for (const element of this) {\n      if (!started && this._compare(element, fromElement) < 0) {\n        continue;\n      }\n      started = true;\n      result.add(element);\n    }\n\n    return result;\n  }\n\n  subSet(fromElement: T, toElement: T): SortedSet<T> {\n    const result = new TreeSet<T>({\n      compare: this._compare,\n      eq: this._eq,\n    });\n\n    for (const element of this) {\n      const cmpFrom = this._compare(element, fromElement);\n      const cmpTo = this._compare(element, toElement);\n\n      if (cmpFrom >= 0 && cmpTo < 0) {\n        result.add(element);\n      } else if (cmpTo >= 0) {\n        break; // Past the range\n      }\n    }\n\n    return result;\n  }\n\n  // ========================================================================\n  // NavigableSet operations\n  // ========================================================================\n\n  floor(element: T): T | undefined {\n    return this._map.floorKey(element);\n  }\n\n  ceiling(element: T): T | undefined {\n    return this._map.ceilingKey(element);\n  }\n\n  lower(element: T): T | undefined {\n    return this._map.lowerKey(element);\n  }\n\n  higher(element: T): T | undefined {\n    return this._map.higherKey(element);\n  }\n\n  pollFirst(): T | undefined {\n    const entry = this._map.pollFirstEntry();\n    return entry?.key;\n  }\n\n  pollLast(): T | undefined {\n    const entry = this._map.pollLastEntry();\n    return entry?.key;\n  }\n\n  descendingSet(): NavigableSet<T> {\n    const reversed = new TreeSet<T>({\n      compare: (a, b) => this._compare(b, a),\n      eq: this._eq,\n    });\n\n    for (const element of this) {\n      reversed.add(element);\n    }\n\n    return reversed;\n  }\n\n  *descendingIterator(): IterableIterator<T> {\n    yield* this._map.descendingKeys();\n  }\n\n  // ========================================================================\n  // View operations\n  // ========================================================================\n\n  *[Symbol.iterator](): Iterator<T> {\n    yield* this._map.keys();\n  }\n\n  forEach(action: (element: T, index: number) => void): void {\n    let index = 0;\n    for (const element of this) {\n      action(element, index++);\n    }\n  }\n\n  toArray(): T[] {\n    return Array.from(this);\n  }\n\n  // ========================================================================\n  // Utility methods\n  // ========================================================================\n\n  toString(): string {\n    const elements = Array.from(this).join(', ');\n    return `TreeSet{${elements}}`;\n  }\n}\n\n/**\n * Factory function to make a TreeSet.\n *\n * @example\n * const set = treeSet<string>()\n * set.add('c')\n * set.add('a')\n * set.add('b')\n * // Iteration order: a, b, c\n *\n * @example\n * // With initial elements\n * const set = treeSet(['c', 'a', 'b'])\n * // Iteration order: a, b, c\n *\n * @example\n * // Custom comparator for descending order\n * const set = treeSet<number>({ compare: (a, b) => b - a })\n */\nexport function treeSet<T>(\n  optionsOrElements?: TreeSetOptions<T> | Iterable<T>\n): TreeSet<T> {\n  if (optionsOrElements && Symbol.iterator in optionsOrElements) {\n    const set = new TreeSet<T>();\n    for (const element of optionsOrElements as Iterable<T>) {\n      set.add(element);\n    }\n    return set;\n  }\n\n  return new TreeSet<T>(optionsOrElements as TreeSetOptions<T>);\n}\n","/**\n * LinkedList implementation - A doubly-linked list.\n *\n * This module gives O(1) insertion/removal at both ends and at known positions.\n * Slower random access O(n) compared to ArrayList.\n * Mirrors java.util.LinkedList.\n *\n * @example\n * const list = linkedList<number>()\n * list.addFirst(1)\n * list.addLast(2)\n * list.add(3)\n */\n\nimport type { List } from \"../interfaces/list.js\";\nimport type { Deque } from \"../interfaces/queue.js\";\nimport type { Eq, Compare } from \"../core/traits.js\";\nimport { defaultEq, defaultCompare } from \"../utils/defaults.js\";\n\n/**\n * Internal node structure for the linked list.\n */\nclass Node<T> {\n  value: T;\n  prev: Node<T> | null;\n  next: Node<T> | null;\n\n  constructor(value: T, prev: Node<T> | null = null, next: Node<T> | null = null) {\n    this.value = value;\n    this.prev = prev;\n    this.next = next;\n  }\n}\n\n/**\n * Options for making a LinkedList.\n */\nexport interface LinkedListOptions<T> {\n  /**\n   * Equality function for comparing elements.\n   * @default defaultEq (===)\n   */\n  eq?: Eq<T>;\n}\n\n/**\n * LinkedList<T> - Doubly-linked list implementation.\n *\n * Efficient for:\n * - Insertion/removal at ends: O(1)\n * - Insertion/removal at known position: O(1)\n * - Sequential iteration: O(n)\n *\n * Not efficient for:\n * - Random access by index: O(n)\n * - Search: O(n)\n *\n * This class implements both List and Deque interfaces.\n */\nexport class LinkedList<T> implements List<T>, Deque<T> {\n  private _head: Node<T> | null = null;\n  private _tail: Node<T> | null = null;\n  private _size: number = 0;\n  private readonly _eq: Eq<T>;\n\n  constructor(options: LinkedListOptions<T> = {}) {\n    const { eq = defaultEq } = options;\n    this._eq = eq;\n  }\n\n  // ========================================================================\n  // Size\n  // ========================================================================\n\n  get size(): number {\n    return this._size;\n  }\n\n  get isEmpty(): boolean {\n    return this._size === 0;\n  }\n\n  get eq(): Eq<T> {\n    return this._eq;\n  }\n\n  // ========================================================================\n  // Deque operations (both ends)\n  // ========================================================================\n\n  addFirst(element: T): void {\n    const newNode = new Node(element, null, this._head);\n    if (this._head) {\n      this._head.prev = newNode;\n    }\n    this._head = newNode;\n    if (!this._tail) {\n      this._tail = newNode;\n    }\n    this._size++;\n  }\n\n  addLast(element: T): void {\n    const newNode = new Node(element, this._tail, null);\n    if (this._tail) {\n      this._tail.next = newNode;\n    }\n    this._tail = newNode;\n    if (!this._head) {\n      this._head = newNode;\n    }\n    this._size++;\n  }\n\n  removeFirst(): T {\n    if (!this._head) {\n      throw new Error(\"List is empty\");\n    }\n    return this.pollFirst()!;\n  }\n\n  removeLast(): T {\n    if (!this._tail) {\n      throw new Error(\"List is empty\");\n    }\n    return this.pollLast()!;\n  }\n\n  pollFirst(): T | undefined {\n    if (!this._head) return undefined;\n\n    const value = this._head.value;\n    this._head = this._head.next;\n\n    if (this._head) {\n      this._head.prev = null;\n    } else {\n      this._tail = null;\n    }\n\n    this._size--;\n    return value;\n  }\n\n  pollLast(): T | undefined {\n    if (!this._tail) return undefined;\n\n    const value = this._tail.value;\n    this._tail = this._tail.prev;\n\n    if (this._tail) {\n      this._tail.next = null;\n    } else {\n      this._head = null;\n    }\n\n    this._size--;\n    return value;\n  }\n\n  peekFirst(): T {\n    if (!this._head) {\n      throw new Error(\"List is empty\");\n    }\n    return this._head.value;\n  }\n\n  peekLast(): T {\n    if (!this._tail) {\n      throw new Error(\"List is empty\");\n    }\n    return this._tail.value;\n  }\n\n  peekFirstOrUndefined(): T | undefined {\n    return this._head?.value;\n  }\n\n  peekLastOrUndefined(): T | undefined {\n    return this._tail?.value;\n  }\n\n  offerFirst(element: T): boolean {\n    this.addFirst(element);\n    return true;\n  }\n\n  offerLast(element: T): boolean {\n    this.addLast(element);\n    return true;\n  }\n\n  // ========================================================================\n  // Stack operations (LIFO at the end, as on a JavaScript array)\n  // ========================================================================\n\n  // push and pop work at the end, and shift/unshift at the front, in every collection of this\n  // package. Before, they worked at the front here (the Java Deque rule), so a LinkedList used\n  // as a List reversed the pushed elements (ARCHITECTURE-PROPOSALS P8).\n  push(element: T): void {\n    this.addLast(element);\n  }\n\n  pop(): T {\n    return this.removeLast();\n  }\n\n  // ========================================================================\n  // Queue operations (FIFO)\n  // ========================================================================\n\n  offer(element: T): boolean {\n    return this.offerLast(element);\n  }\n\n  poll(): T {\n    return this.removeFirst();\n  }\n\n  peek(): T {\n    return this.peekFirst();\n  }\n\n  peekOrUndefined(): T | undefined {\n    return this.peekFirstOrUndefined();\n  }\n\n  pollOrUndefined(): T | undefined {\n    return this.pollFirst();\n  }\n\n  enqueue(element: T): boolean {\n    return this.offer(element);\n  }\n\n  dequeue(): T {\n    return this.poll();\n  }\n\n  // ========================================================================\n  // List operations\n  // ========================================================================\n\n  get(index: number): T {\n    const node = this.getNode(index);\n    return node.value;\n  }\n\n  set(index: number, element: T): T {\n    const node = this.getNode(index);\n    const old = node.value;\n    node.value = element;\n    return old;\n  }\n\n  insert(index: number, element: T): void {\n    if (index < 0 || index > this._size) {\n      throw new RangeError(`Index ${index} out of bounds for size ${this._size}`);\n    }\n\n    if (index === 0) {\n      this.addFirst(element);\n      return;\n    }\n\n    if (index === this._size) {\n      this.addLast(element);\n      return;\n    }\n\n    const nextNode = this.getNode(index);\n    const prevNode = nextNode.prev!;\n    const newNode = new Node(element, prevNode, nextNode);\n\n    prevNode.next = newNode;\n    nextNode.prev = newNode;\n    this._size++;\n  }\n\n  insertAll(index: number, other: Iterable<T>): boolean {\n    if (index < 0 || index > this._size) {\n      throw new RangeError(`Index ${index} out of bounds for size ${this._size}`);\n    }\n\n    const elements = Array.from(other);\n    if (elements.length === 0) return false;\n\n    for (let i = 0; i < elements.length; i++) {\n      this.insert(index + i, elements[i]!);\n    }\n\n    return true;\n  }\n\n  removeAt(index: number): T {\n    const node = this.getNode(index);\n    return this.unlinkNode(node);\n  }\n\n  removeRange(fromIndex: number, toIndex: number): void {\n    if (fromIndex < 0 || toIndex > this._size || fromIndex > toIndex) {\n      throw new RangeError(`Invalid range [${fromIndex}, ${toIndex})`);\n    }\n\n    for (let i = fromIndex; i < toIndex; i++) {\n      this.removeAt(fromIndex);\n    }\n  }\n\n  indexOf(element: T, fromIndex: number = 0): number {\n    let index = 0;\n    let node = this._head;\n\n    while (node) {\n      if (index >= fromIndex && this._eq(node.value, element)) {\n        return index;\n      }\n      node = node.next;\n      index++;\n    }\n\n    return -1;\n  }\n\n  lastIndexOf(element: T, fromIndex?: number): number {\n    const start = fromIndex !== undefined ? fromIndex : this._size - 1;\n    let index = this._size - 1;\n    let node = this._tail;\n\n    while (node && index >= 0) {\n      if (index <= start && this._eq(node.value, element)) {\n        return index;\n      }\n      node = node.prev;\n      index--;\n    }\n\n    return -1;\n  }\n\n  first(): T {\n    return this.peekFirst();\n  }\n\n  last(): T {\n    return this.peekLast();\n  }\n\n  shift(): T {\n    return this.removeFirst();\n  }\n\n  unshift(element: T): void {\n    this.addFirst(element);\n  }\n\n  // ========================================================================\n  // Collection operations\n  // ========================================================================\n\n  add(element: T): boolean {\n    this.addLast(element);\n    return true;\n  }\n\n  addAll(other: Iterable<T>): boolean {\n    let modified = false;\n    for (const element of other) {\n      this.addLast(element);\n      modified = true;\n    }\n    return modified;\n  }\n\n  contains(element: T): boolean {\n    return this.indexOf(element) !== -1;\n  }\n\n  containsAll(other: Iterable<T>): boolean {\n    for (const element of other) {\n      if (!this.contains(element)) return false;\n    }\n    return true;\n  }\n\n  remove(element: T): boolean {\n    let node = this._head;\n\n    while (node) {\n      if (this._eq(node.value, element)) {\n        this.unlinkNode(node);\n        return true;\n      }\n      node = node.next;\n    }\n\n    return false;\n  }\n\n  removeAll(other: Iterable<T>): boolean {\n    const toRemove = new Set(other);\n    let modified = false;\n\n    for (const element of toRemove) {\n      while (this.remove(element)) {\n        modified = true;\n      }\n    }\n\n    return modified;\n  }\n\n  retainAll(other: Iterable<T>): boolean {\n    const toRetain = new Set(other);\n    let node = this._head;\n    let modified = false;\n\n    while (node) {\n      const next = node.next;\n      let shouldRetain = false;\n\n      for (const retainElement of toRetain) {\n        if (this._eq(node.value, retainElement)) {\n          shouldRetain = true;\n          break;\n        }\n      }\n\n      if (!shouldRetain) {\n        this.unlinkNode(node);\n        modified = true;\n      }\n\n      node = next;\n    }\n\n    return modified;\n  }\n\n  clear(): void {\n    this._head = null;\n    this._tail = null;\n    this._size = 0;\n  }\n\n  // ========================================================================\n  // Sorting and reversing\n  // ========================================================================\n\n  sort(compare: Compare<T> = defaultCompare): void {\n    if (this._size <= 1) return;\n\n    // Convert to array, sort, rebuild list\n    const array = this.toArray();\n    array.sort(compare);\n\n    this.clear();\n    for (const element of array) {\n      this.addLast(element);\n    }\n  }\n\n  reverse(): void {\n    if (this._size <= 1) return;\n\n    let node = this._head;\n    this._head = this._tail;\n    this._tail = node;\n\n    while (node) {\n      const next = node.next;\n      node.next = node.prev;\n      node.prev = next;\n      node = next;\n    }\n  }\n\n  // ========================================================================\n  // Views\n  // ========================================================================\n\n  subList(fromIndex: number, toIndex: number): List<T> {\n    if (fromIndex < 0 || toIndex > this._size || fromIndex > toIndex) {\n      throw new RangeError(`Invalid range [${fromIndex}, ${toIndex})`);\n    }\n\n    const sub = new LinkedList<T>({ eq: this._eq });\n    let index = 0;\n    let node = this._head;\n\n    while (node && index < toIndex) {\n      if (index >= fromIndex) {\n        sub.addLast(node.value);\n      }\n      node = node.next;\n      index++;\n    }\n\n    return sub;\n  }\n\n  // ========================================================================\n  // Iteration\n  // ========================================================================\n\n  *[Symbol.iterator](): Iterator<T> {\n    let node = this._head;\n    while (node) {\n      yield node.value;\n      node = node.next;\n    }\n  }\n\n  forEach(action: (element: T, index: number) => void): void {\n    let index = 0;\n    let node = this._head;\n\n    while (node) {\n      action(node.value, index);\n      node = node.next;\n      index++;\n    }\n  }\n\n  toArray(): T[] {\n    const result: T[] = [];\n    let node = this._head;\n\n    while (node) {\n      result.push(node.value);\n      node = node.next;\n    }\n\n    return result;\n  }\n\n  // ========================================================================\n  // Private helpers\n  // ========================================================================\n\n  private getNode(index: number): Node<T> {\n    if (index < 0 || index >= this._size) {\n      throw new RangeError(`Index ${index} out of bounds for size ${this._size}`);\n    }\n\n    // Optimize: start from head or tail depending on index\n    if (index < this._size / 2) {\n      // Start from head\n      let node = this._head!;\n      for (let i = 0; i < index; i++) {\n        node = node.next!;\n      }\n      return node;\n    } else {\n      // Start from tail\n      let node = this._tail!;\n      for (let i = this._size - 1; i > index; i--) {\n        node = node.prev!;\n      }\n      return node;\n    }\n  }\n\n  private unlinkNode(node: Node<T>): T {\n    const value = node.value;\n\n    if (node.prev) {\n      node.prev.next = node.next;\n    } else {\n      this._head = node.next;\n    }\n\n    if (node.next) {\n      node.next.prev = node.prev;\n    } else {\n      this._tail = node.prev;\n    }\n\n    this._size--;\n    return value;\n  }\n\n  // ========================================================================\n  // Inspection\n  // ========================================================================\n\n  toString(): string {\n    return `LinkedList[${this.toArray().join(\", \")}]`;\n  }\n}\n\n/**\n * Factory function to make a LinkedList.\n *\n * @example\n * const list = linkedList<number>()\n * const listFromArray = linkedList([1, 2, 3])\n */\nexport function linkedList<T>(\n  optionsOrElements?: LinkedListOptions<T> | Iterable<T>\n): LinkedList<T> {\n  // Check if it's an iterable (not options)\n  if (optionsOrElements && Symbol.iterator in optionsOrElements) {\n    const list = new LinkedList<T>();\n    list.addAll(optionsOrElements as Iterable<T>);\n    return list;\n  }\n\n  return new LinkedList<T>(optionsOrElements as LinkedListOptions<T>);\n}\n","/**\n * HashSet implementation - A set backed by a HashMap.\n *\n * This module gives O(1) average case for add, remove, and contains operations.\n * Elements are unique based on custom equality and hash functions.\n * Mirrors java.util.HashSet.\n *\n * @example\n * const set = hashSet<number>()\n * set.add(1)\n * set.add(2)\n * set.add(1) // Returns false, already present\n * set.size // 2\n */\n\nimport type { Set } from \"../interfaces/set.js\";\nimport type { Eq, Hash } from \"../core/traits.js\";\nimport { HashMap } from \"./hash-map.js\";\nimport { defaultEq, defaultHash } from \"../utils/defaults.js\";\n\n/**\n * Dummy value used for the HashMap backing the set.\n */\nconst PRESENT = Symbol(\"PRESENT\");\n\n/**\n * Options for making a HashSet.\n */\nexport interface HashSetOptions<T> {\n  /**\n   * Initial capacity.\n   * @default 16\n   */\n  initialCapacity?: number;\n\n  /**\n   * Load factor threshold for resizing.\n   * @default 0.75\n   */\n  loadFactor?: number;\n\n  /**\n   * Equality function for elements.\n   * @default defaultEq (===)\n   */\n  eq?: Eq<T>;\n\n  /**\n   * Hash function for elements.\n   * @default defaultHash\n   */\n  hash?: Hash<T>;\n}\n\n/**\n * HashSet<T> - Hash table implementation of the Set interface.\n *\n * A HashMap holds the elements. Its values are a dummy constant.\n * This class gives constant-time performance for basic operations.\n *\n * Not thread-safe. Use synchronized() behavior for concurrent access.\n */\nexport class HashSet<T> implements Set<T> {\n  private readonly _map: HashMap<T, symbol>;\n  private readonly _eq: Eq<T>;\n\n  constructor(options: HashSetOptions<T> = {}) {\n    const {\n      initialCapacity = 16,\n      loadFactor = 0.75,\n      eq = defaultEq,\n      hash = defaultHash,\n    } = options;\n\n    this._eq = eq;\n    this._map = new HashMap<T, symbol>({\n      initialCapacity,\n      loadFactor,\n      keyEq: eq,\n      keyHash: hash,\n    });\n  }\n\n  // ========================================================================\n  // Size\n  // ========================================================================\n\n  get size(): number {\n    return this._map.size;\n  }\n\n  get isEmpty(): boolean {\n    return this._map.isEmpty;\n  }\n\n  get eq(): Eq<T> {\n    return this._eq;\n  }\n\n  // ========================================================================\n  // Core set operations\n  // ========================================================================\n\n  add(element: T): boolean {\n    const hadElement = this._map.has(element);\n    this._map.set(element, PRESENT);\n    return !hadElement;\n  }\n\n  remove(element: T): boolean {\n    return this._map.delete(element) !== undefined;\n  }\n\n  contains(element: T): boolean {\n    return this._map.has(element);\n  }\n\n  // ========================================================================\n  // Bulk operations\n  // ========================================================================\n\n  addAll(other: Iterable<T>): boolean {\n    let modified = false;\n    for (const element of other) {\n      if (this.add(element)) {\n        modified = true;\n      }\n    }\n    return modified;\n  }\n\n  removeAll(other: Iterable<T>): boolean {\n    let modified = false;\n    for (const element of other) {\n      if (this.remove(element)) {\n        modified = true;\n      }\n    }\n    return modified;\n  }\n\n  retainAll(other: Iterable<T>): boolean {\n    const toRetain = new globalThis.Set(other);\n    const toRemove: T[] = [];\n\n    for (const element of this) {\n      let shouldRetain = false;\n      for (const retainElement of toRetain) {\n        if (this._eq(element, retainElement)) {\n          shouldRetain = true;\n          break;\n        }\n      }\n      if (!shouldRetain) {\n        toRemove.push(element);\n      }\n    }\n\n    let modified = false;\n    for (const element of toRemove) {\n      this.remove(element);\n      modified = true;\n    }\n\n    return modified;\n  }\n\n  containsAll(other: Iterable<T>): boolean {\n    for (const element of other) {\n      if (!this.contains(element)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  clear(): void {\n    this._map.clear();\n  }\n\n  // ========================================================================\n  // Set operations (mathematical)\n  // ========================================================================\n\n  /**\n   * This method gives a new set that is the union of this set and the other set.\n   * The new set contains all elements from both sets.\n   */\n  union(other: Iterable<T>): HashSet<T> {\n    const result = this.clone();\n    result.addAll(other);\n    return result;\n  }\n\n  /**\n   * This method gives a new set that is the intersection of this set and the other set.\n   * The new set contains only elements present in both sets.\n   */\n  intersection(other: Iterable<T>): HashSet<T> {\n    const result = new HashSet<T>({ eq: this._eq });\n    for (const element of this) {\n      for (const otherElement of other) {\n        if (this._eq(element, otherElement)) {\n          result.add(element);\n          break;\n        }\n      }\n    }\n    return result;\n  }\n\n  /**\n   * This method gives a new set that is the difference of this set and the other set.\n   * The new set contains elements in this set but not in the other set.\n   */\n  difference(other: Iterable<T>): HashSet<T> {\n    const result = this.clone();\n    result.removeAll(other);\n    return result;\n  }\n\n  /**\n   * This method gives a new set that is the symmetric difference of this set and the other set.\n   * The new set contains elements in either set but not in both.\n   */\n  symmetricDifference(other: Iterable<T>): HashSet<T> {\n    const result = this.union(other);\n    const inter = this.intersection(other);\n    result.removeAll(inter);\n    return result;\n  }\n\n  /**\n   * This method gives true if this set is a subset of the other set.\n   * All elements in this set are also in the other set.\n   */\n  isSubsetOf(other: Iterable<T>): boolean {\n    const otherSet = new HashSet<T>({ eq: this._eq });\n    otherSet.addAll(other);\n\n    for (const element of this) {\n      if (!otherSet.contains(element)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  /**\n   * This method gives true if this set is a superset of the other set.\n   * All elements in the other set are also in this set.\n   */\n  isSupersetOf(other: Iterable<T>): boolean {\n    for (const element of other) {\n      if (!this.contains(element)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  /**\n   * This method gives true if this set and the other set have no elements in common.\n   */\n  isDisjointFrom(other: Iterable<T>): boolean {\n    for (const element of other) {\n      if (this.contains(element)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  // ========================================================================\n  // Iteration\n  // ========================================================================\n\n  *[Symbol.iterator](): Iterator<T> {\n    for (const entry of this._map) {\n      yield entry.key;\n    }\n  }\n\n  forEach(action: (element: T, index: number) => void): void {\n    let index = 0;\n    for (const element of this) {\n      action(element, index++);\n    }\n  }\n\n  toArray(): T[] {\n    return Array.from(this);\n  }\n\n  // ========================================================================\n  // Utility methods\n  // ========================================================================\n\n  /**\n   * This method makes a shallow copy of this set.\n   */\n  clone(): HashSet<T> {\n    const clone = new HashSet<T>({ eq: this._eq });\n    clone.addAll(this);\n    return clone;\n  }\n\n  /**\n   * This method gives statistics about the underlying hash table.\n   */\n  getStats(): ReturnType<HashMap<T, symbol>[\"getStats\"]> {\n    return this._map.getStats();\n  }\n\n  /**\n   * This method gives a string representation for debugging.\n   */\n  toString(): string {\n    return `HashSet{${this.toArray().join(\", \")}}`;\n  }\n}\n\n/**\n * Factory function to make a HashSet.\n *\n * @example\n * const set = hashSet<number>()\n * const setFromArray = hashSet([1, 2, 3, 2, 1]) // {1, 2, 3}\n * const setWithOptions = hashSet<string>({ initialCapacity: 32 })\n */\nexport function hashSet<T>(\n  optionsOrElements?: HashSetOptions<T> | Iterable<T>\n): HashSet<T> {\n  // Check if it's an iterable (not options)\n  if (optionsOrElements && Symbol.iterator in optionsOrElements) {\n    const set = new HashSet<T>();\n    set.addAll(optionsOrElements as Iterable<T>);\n    return set;\n  }\n\n  return new HashSet<T>(optionsOrElements as HashSetOptions<T>);\n}\n","/**\n * PriorityQueue implementation - A binary heap-based priority queue.\n *\n * Elements are ordered according to their natural ordering (through a comparator).\n * The head of the queue is the least element according to the comparator.\n * This module gives O(log n) enqueue and O(log n) dequeue operations.\n * Mirrors java.util.PriorityQueue.\n *\n * @example\n * const pq = priorityQueue<number>((a, b) => a - b) // Min heap\n * pq.offer(5)\n * pq.offer(2)\n * pq.offer(8)\n * pq.poll() // 2 (smallest element)\n */\n\nimport type { PriorityQueue as IPriorityQueue } from \"../interfaces/queue.js\";\nimport type { Eq, Compare } from \"../core/traits.js\";\nimport { defaultEq, defaultCompare } from \"../utils/defaults.js\";\n\n/**\n * Options for making a PriorityQueue.\n */\nexport interface PriorityQueueOptions<T> {\n  /**\n   * Initial capacity of the heap.\n   * @default 11\n   */\n  initialCapacity?: number;\n\n  /**\n   * Comparator for ordering elements.\n   * Lower values have higher priority (min heap).\n   * @default defaultCompare\n   */\n  compare?: Compare<T>;\n\n  /**\n   * Equality function for elements.\n   * @default defaultEq\n   */\n  eq?: Eq<T>;\n}\n\n/**\n * PriorityQueue<T> - Binary heap implementation of priority queue.\n *\n * Elements are always retrieved in priority order (according to comparator).\n * Not a FIFO queue - order depends on priority, not insertion order.\n *\n * The heap is a min heap by default (smallest element has highest priority).\n * For max heap, use reversed comparator: (a, b) => compare(b, a)\n *\n * Not thread-safe. Use synchronized() behavior for concurrent access.\n */\nexport class PriorityQueue<T> implements IPriorityQueue<T> {\n  private _heap: T[];\n  private readonly _compare: Compare<T>;\n  private readonly _eq: Eq<T>;\n\n  constructor(options: PriorityQueueOptions<T> = {}) {\n    const {\n      compare = defaultCompare,\n      eq = defaultEq,\n    } = options;\n\n    // The heap starts empty: a JavaScript array grows by itself, so initialCapacity is only a\n    // hint. (Before, `new Array(initialCapacity)` made 11 holes: an empty queue had size 11,\n    // and the heap compared holes. BUGS-2026-07 C9.)\n    this._heap = [];\n    this._compare = compare;\n    this._eq = eq;\n  }\n\n  // ========================================================================\n  // Size\n  // ========================================================================\n\n  get size(): number {\n    return this._heap.length;\n  }\n\n  get isEmpty(): boolean {\n    return this._heap.length === 0;\n  }\n\n  get eq(): Eq<T> {\n    return this._eq;\n  }\n\n  get compare(): Compare<T> {\n    return this._compare;\n  }\n\n  get comparator(): Compare<T> {\n    return this._compare;\n  }\n\n  // ========================================================================\n  // Priority queue operations\n  // ========================================================================\n\n  offer(element: T): boolean {\n    this._heap.push(element);\n    this.bubbleUp(this._heap.length - 1);\n    return true;\n  }\n\n  poll(): T {\n    if (this.isEmpty) {\n      throw new Error(\"Priority queue is empty\");\n    }\n    return this.pollOrUndefined()!;\n  }\n\n  pollOrUndefined(): T | undefined {\n    if (this.isEmpty) {\n      return undefined;\n    }\n\n    const result = this._heap[0];\n\n    if (this._heap.length === 1) {\n      this._heap.pop();\n    } else {\n      this._heap[0] = this._heap.pop()!;\n      this.bubbleDown(0);\n    }\n\n    return result;\n  }\n\n  peek(): T {\n    if (this.isEmpty) {\n      throw new Error(\"Priority queue is empty\");\n    }\n    return this._heap[0]!;\n  }\n\n  peekOrUndefined(): T | undefined {\n    return this.isEmpty ? undefined : this._heap[0];\n  }\n\n  // ========================================================================\n  // Queue interface compatibility\n  // ========================================================================\n\n  enqueue(element: T): boolean {\n    return this.offer(element);\n  }\n\n  dequeue(): T {\n    return this.poll();\n  }\n\n  // ========================================================================\n  // Collection operations\n  // ========================================================================\n\n  add(element: T): boolean {\n    return this.offer(element);\n  }\n\n  addAll(other: Iterable<T>): boolean {\n    let modified = false;\n    for (const element of other) {\n      this.offer(element);\n      modified = true;\n    }\n    return modified;\n  }\n\n  contains(element: T): boolean {\n    for (const item of this._heap) {\n      if (this._eq(item, element)) {\n        return true;\n      }\n    }\n    return false;\n  }\n\n  containsAll(other: Iterable<T>): boolean {\n    for (const element of other) {\n      if (!this.contains(element)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  remove(element: T): boolean {\n    const index = this._heap.findIndex((item) => this._eq(item, element));\n    if (index === -1) {\n      return false;\n    }\n\n    if (index === this._heap.length - 1) {\n      this._heap.pop();\n    } else {\n      this._heap[index] = this._heap.pop()!;\n      this.bubbleDown(index);\n      this.bubbleUp(index);\n    }\n\n    return true;\n  }\n\n  removeAll(other: Iterable<T>): boolean {\n    let modified = false;\n    for (const element of other) {\n      while (this.remove(element)) {\n        modified = true;\n      }\n    }\n    return modified;\n  }\n\n  retainAll(other: Iterable<T>): boolean {\n    const toRetain = new Set(other);\n    const newHeap: T[] = [];\n\n    for (const element of this._heap) {\n      let shouldRetain = false;\n      for (const retainElement of toRetain) {\n        if (this._eq(element, retainElement)) {\n          shouldRetain = true;\n          break;\n        }\n      }\n      if (shouldRetain) {\n        newHeap.push(element);\n      }\n    }\n\n    const modified = newHeap.length !== this._heap.length;\n    this._heap = newHeap;\n    this.heapify();\n\n    return modified;\n  }\n\n  clear(): void {\n    this._heap = [];\n  }\n\n  // ========================================================================\n  // Iteration\n  // ========================================================================\n\n  /**\n   * Iterator gives elements in arbitrary order (not priority order).\n   * To get elements in priority order, repeatedly call poll().\n   */\n  *[Symbol.iterator](): Iterator<T> {\n    yield* this._heap;\n  }\n\n  forEach(action: (element: T, index: number) => void): void {\n    this._heap.forEach((element, index) => action(element, index));\n  }\n\n  /**\n   * This method gives elements in arbitrary heap order (not sorted).\n   */\n  toArray(): T[] {\n    return this._heap.slice();\n  }\n\n  /**\n   * This method gives elements in priority order (sorted).\n   * This is a destructive operation that drains the queue.\n   */\n  toSortedArray(): T[] {\n    const result: T[] = [];\n    const clone = this.clone();\n\n    while (!clone.isEmpty) {\n      result.push(clone.poll());\n    }\n\n    return result;\n  }\n\n  // ========================================================================\n  // Heap operations\n  // ========================================================================\n\n  /**\n   * This method bubbles an element up the heap to maintain heap property.\n   */\n  private bubbleUp(index: number): void {\n    const element = this._heap[index]!;\n\n    while (index > 0) {\n      const parentIndex = Math.floor((index - 1) / 2);\n      const parent = this._heap[parentIndex]!;\n\n      if (this._compare(element, parent) >= 0) {\n        break;\n      }\n\n      this._heap[index] = parent;\n      index = parentIndex;\n    }\n\n    this._heap[index] = element;\n  }\n\n  /**\n   * This method bubbles an element down the heap to maintain heap property.\n   *\n   * The element moves down through a hole: a smaller child moves up into the hole, and the\n   * element goes into the last hole. The children are compared with the element.\n   * Before, they were compared with `_heap[index]`. After the first step, that value is a copy of\n   * the child that moved up. Thus a poll could leave a larger element above a smaller one.\n   */\n  private bubbleDown(index: number): void {\n    const length = this._heap.length;\n    const element = this._heap[index]!;\n\n    while (true) {\n      const leftChildIndex = 2 * index + 1;\n      const rightChildIndex = 2 * index + 2;\n      if (leftChildIndex >= length) {\n        break;\n      }\n\n      let childIndex = leftChildIndex;\n      if (\n        rightChildIndex < length &&\n        this._compare(this._heap[rightChildIndex]!, this._heap[leftChildIndex]!) < 0\n      ) {\n        childIndex = rightChildIndex;\n      }\n\n      if (this._compare(this._heap[childIndex]!, element) >= 0) {\n        break;\n      }\n\n      this._heap[index] = this._heap[childIndex]!;\n      index = childIndex;\n    }\n\n    this._heap[index] = element;\n  }\n\n  /**\n   * This method rebuilds the heap from an arbitrary array.\n   * This method uses Floyd's algorithm (O(n) time).\n   */\n  private heapify(): void {\n    // Start from last non-leaf node and bubble down\n    for (let i = Math.floor(this._heap.length / 2) - 1; i >= 0; i--) {\n      this.bubbleDown(i);\n    }\n  }\n\n  // ========================================================================\n  // Utility methods\n  // ========================================================================\n\n  /**\n   * This method makes a shallow copy of this priority queue.\n   */\n  clone(): PriorityQueue<T> {\n    const clone = new PriorityQueue<T>({\n      compare: this._compare,\n      eq: this._eq,\n    });\n    clone._heap = this._heap.slice();\n    return clone;\n  }\n\n  /**\n   * This method validates the heap property (for debugging).\n   * This method gives true if the heap is valid.\n   */\n  validate(): boolean {\n    for (let i = 0; i < this._heap.length; i++) {\n      const leftChildIndex = 2 * i + 1;\n      const rightChildIndex = 2 * i + 2;\n\n      if (\n        leftChildIndex < this._heap.length &&\n        this._compare(this._heap[i]!, this._heap[leftChildIndex]!) > 0\n      ) {\n        return false;\n      }\n\n      if (\n        rightChildIndex < this._heap.length &&\n        this._compare(this._heap[i]!, this._heap[rightChildIndex]!) > 0\n      ) {\n        return false;\n      }\n    }\n\n    return true;\n  }\n\n  /**\n   * This method gives a string representation for debugging.\n   */\n  toString(): string {\n    return `PriorityQueue[${this._heap.join(\", \")}]`;\n  }\n}\n\n/**\n * Factory function to make a PriorityQueue.\n *\n * @example\n * // Min heap (default)\n * const minHeap = priorityQueue<number>()\n *\n * // Max heap\n * const maxHeap = priorityQueue<number>((a, b) => b - a)\n *\n * // From array\n * const pq = priorityQueue([5, 2, 8, 1, 9])\n *\n * // With custom comparator\n * const pq = priorityQueue<Task>((a, b) => a.priority - b.priority)\n */\nexport function priorityQueue<T>(\n  optionsOrElementsOrComparator?:\n    | PriorityQueueOptions<T>\n    | Iterable<T>\n    | Compare<T>\n): PriorityQueue<T> {\n  // If it's a function, treat it as a comparator\n  if (typeof optionsOrElementsOrComparator === \"function\") {\n    return new PriorityQueue<T>({\n      compare: optionsOrElementsOrComparator as Compare<T>,\n    });\n  }\n\n  // Check if it's an iterable (not options)\n  if (optionsOrElementsOrComparator && Symbol.iterator in optionsOrElementsOrComparator) {\n    const pq = new PriorityQueue<T>();\n    pq.addAll(optionsOrElementsOrComparator as Iterable<T>);\n    return pq;\n  }\n\n  return new PriorityQueue<T>(\n    optionsOrElementsOrComparator as PriorityQueueOptions<T>\n  );\n}\n","/**\n * SummaryTree: a persistent sequence of leaves with a summary of each part.\n *\n * The tree is a balanced binary tree (AVL) with one leaf in each node. Each node keeps the summary of its subtree.\n * A summary is a value of a monoid: the caller gives the monoid as data, with `empty` and `combine`. The order of the\n * leaves is kept, so `combine` must be associative, but it can be non-commutative.\n *\n * Each operation gives a new tree and keeps the old tree. The two trees share the nodes that did not change.\n * Concatenation, a split at an index or at a summary search, an edit and a lookup are O(log n).\n *\n * The algorithms are the \"join\" algorithms of Blelloch, Ferizovic and Sun, \"Just Join for Parallel Ordered Sets\"\n * (SPAA 2016).\n *\n * @example\n * // The number of leaves and the total length of the strings\n * const spec = {\n *   monoid: { empty: { count: 0, length: 0 }, combine: (a, b) => ({ count: a.count + b.count, length: a.length + b.length }) },\n *   measure: (leaf: string) => ({ count: 1, length: leaf.length }),\n * };\n * const tree = summaryTree(spec, [\"ab\", \"cde\", \"f\"]);\n * tree.summary; // { count: 3, length: 6 }\n * const [left, right] = tree.split((prefix) => prefix.length > 2); // left: [\"ab\"], right: [\"cde\", \"f\"]\n */\n\n/** A monoid as data: the identity value `empty` and an associative operation `combine`. */\nexport interface SummaryMonoid<Summary> {\n  /** The summary of a sequence with no leaf. `combine(empty, s)` and `combine(s, empty)` are equal to `s`. */\n  readonly empty: Summary;\n  /** This function gives the summary of a sequence from the summaries of its two parts, left first. */\n  readonly combine: (left: Summary, right: Summary) => Summary;\n}\n\n/** The data that a tree needs: the monoid of the summaries and the summary of one leaf. */\nexport interface SummarySpec<Leaf, Summary> {\n  readonly monoid: SummaryMonoid<Summary>;\n  /** This function gives the summary of one leaf. */\n  readonly measure: (leaf: Leaf) => Summary;\n  /**\n   * This optional function joins two neighbor leaves at a seam into one leaf, or gives `undefined` to keep both. A seam\n   * is the place where `concat`, `append`, `prepend`, `splice`, `insert` or `remove` puts two leaves next to each other.\n   * The tree calls it once at each seam, and not between the leaves that one call inserts. `set` does not call it.\n   */\n  readonly merge?: (left: Leaf, right: Leaf) => Leaf | undefined;\n}\n\n/** The result of a summary search: the first leaf whose prefix summary satisfies the predicate. */\nexport interface SummarySearch<Leaf, Summary> {\n  /** The index of the leaf. */\n  readonly index: number;\n  readonly leaf: Leaf;\n  /** The summary of the leaves before the leaf. */\n  readonly before: Summary;\n  /** The summary of the leaves before the leaf, and of the leaf. */\n  readonly through: Summary;\n}\n\n/** The result of `locate`: the leaf that holds a position of an additive key, and the position in that leaf. */\nexport interface SummaryLocation<Leaf> {\n  /** The index of the leaf. */\n  readonly index: number;\n  readonly leaf: Leaf;\n  /** The position in the leaf: the target minus the key of the leaves before the leaf. */\n  readonly offset: number;\n}\n\n/** One node of the tree. The tree does not change a node after it makes it. */\ninterface Node<Leaf, Summary> {\n  readonly left: Node<Leaf, Summary> | null;\n  readonly leaf: Leaf;\n  /** The summary of the leaf of this node only. */\n  readonly own: Summary;\n  /** The summary of the leaves of the left subtree and the leaf of this node. A copy with the same left subtree and leaf keeps it. */\n  readonly inner: Summary;\n  readonly right: Node<Leaf, Summary> | null;\n  readonly height: number;\n  readonly size: number;\n  /** The summary of all the leaves of this subtree. */\n  readonly summary: Summary;\n}\n\ntype Tree<Leaf, Summary> = Node<Leaf, Summary> | null;\n\nfunction heightOf<L, S>(tree: Tree<L, S>): number {\n  return tree === null ? 0 : tree.height;\n}\n\nfunction sizeOf<L, S>(tree: Tree<L, S>): number {\n  return tree === null ? 0 : tree.size;\n}\n\n/** The functions that make and join nodes for one monoid. */\nclass Builder<L, S> {\n  readonly spec: SummarySpec<L, S>;\n\n  constructor(spec: SummarySpec<L, S>) {\n    this.spec = spec;\n  }\n\n  summaryOf(tree: Tree<L, S>): S {\n    return tree === null ? this.spec.monoid.empty : tree.summary;\n  }\n\n  /** This function makes a node. Give `inner` only when it is the summary of `left` and `own`, to save one `combine`. */\n  node(left: Tree<L, S>, leaf: L, own: S, right: Tree<L, S>, inner?: S): Node<L, S> {\n    if (inner === undefined) inner = left === null ? own : this.spec.monoid.combine(left.summary, own);\n    return {\n      left,\n      leaf,\n      own,\n      inner,\n      right,\n      height: 1 + Math.max(heightOf(left), heightOf(right)),\n      size: sizeOf(left) + 1 + sizeOf(right),\n      summary: right === null ? inner : this.spec.monoid.combine(inner, right.summary),\n    };\n  }\n\n  /** This function copies a node with a new right subtree. It keeps the summary `inner`, so it calls `combine` once at most. */\n  withRight(n: Node<L, S>, right: Tree<L, S>): Node<L, S> {\n    return this.node(n.left, n.leaf, n.own, right, n.inner);\n  }\n\n  rotateLeft(n: Node<L, S>): Node<L, S> {\n    const r = n.right!;\n    return this.node(this.withRight(n, r.left), r.leaf, r.own, r.right);\n  }\n\n  rotateRight(n: Node<L, S>): Node<L, S> {\n    const l = n.left!;\n    return this.withRight(l, this.node(l.right, n.leaf, n.own, n.right));\n  }\n\n  /** This function joins a tree that is higher by more than 1 with a leaf and a lower tree on its right. */\n  joinRight(left: Node<L, S>, leaf: L, own: S, right: Tree<L, S>): Node<L, S> {\n    const c = left.right;\n    if (heightOf(c) <= heightOf(right) + 1) {\n      const t = this.node(c, leaf, own, right);\n      if (t.height <= heightOf(left.left) + 1) return this.withRight(left, t);\n      return this.rotateLeft(this.withRight(left, this.rotateRight(t)));\n    }\n    const t = this.joinRight(c!, leaf, own, right);\n    const joined = this.withRight(left, t);\n    return t.height <= heightOf(left.left) + 1 ? joined : this.rotateLeft(joined);\n  }\n\n  /** This function joins a lower tree on the left with a leaf and a tree that is higher by more than 1. */\n  joinLeft(left: Tree<L, S>, leaf: L, own: S, right: Node<L, S>, inner?: S): Node<L, S> {\n    const c = right.left;\n    if (heightOf(c) <= heightOf(left) + 1) {\n      const t = this.node(left, leaf, own, c, inner);\n      if (t.height <= heightOf(right.right) + 1) return this.node(t, right.leaf, right.own, right.right);\n      return this.rotateRight(this.node(this.rotateLeft(t), right.leaf, right.own, right.right));\n    }\n    const t = this.joinLeft(left, leaf, own, c!, inner);\n    const joined = this.node(t, right.leaf, right.own, right.right);\n    return t.height <= heightOf(right.right) + 1 ? joined : this.rotateRight(joined);\n  }\n\n  /**\n   * This function gives the tree of the leaves of `left`, then `leaf`, then the leaves of `right`. Give `inner` only\n   * when it is the summary of `left` and `own`.\n   */\n  join(left: Tree<L, S>, leaf: L, own: S, right: Tree<L, S>, inner?: S): Node<L, S> {\n    if (heightOf(left) > heightOf(right) + 1) return this.joinRight(left!, leaf, own, right);\n    if (heightOf(right) > heightOf(left) + 1) return this.joinLeft(left, leaf, own, right!, inner);\n    return this.node(left, leaf, own, right, inner);\n  }\n\n  /** This function removes the last leaf of a tree, and gives the rest and the node of that leaf. */\n  splitLast(tree: Node<L, S>): [Tree<L, S>, Node<L, S>] {\n    if (tree.right === null) return [tree.left, tree];\n    const [rest, last] = this.splitLast(tree.right);\n    return [this.join(tree.left, tree.leaf, tree.own, rest, tree.inner), last];\n  }\n\n  concat(left: Tree<L, S>, right: Tree<L, S>): Tree<L, S> {\n    if (left === null) return right;\n    if (right === null) return left;\n    const [rest, last] = this.splitLast(left);\n    return this.join(rest, last.leaf, last.own, right);\n  }\n\n  /** This function splits a tree into its first `index` leaves and the other leaves. */\n  splitAt(tree: Tree<L, S>, index: number): [Tree<L, S>, Tree<L, S>] {\n    if (tree === null) return [null, null];\n    const before = sizeOf(tree.left);\n    if (index <= before) {\n      const [a, b] = this.splitAt(tree.left, index);\n      return [a, this.join(b, tree.leaf, tree.own, tree.right)];\n    }\n    const [a, b] = this.splitAt(tree.right, index - before - 1);\n    return [this.join(tree.left, tree.leaf, tree.own, a, tree.inner), b];\n  }\n\n  /** This function splits a tree before the first leaf whose prefix summary, after `acc`, satisfies the predicate. */\n  splitBy(tree: Tree<L, S>, predicate: (prefix: S) => boolean, acc: S): [Tree<L, S>, Tree<L, S>] {\n    if (tree === null) return [null, null];\n    const { combine } = this.spec.monoid;\n    const throughLeft = tree.left === null ? acc : combine(acc, tree.left.summary);\n    if (tree.left !== null && predicate(throughLeft)) {\n      const [a, b] = this.splitBy(tree.left, predicate, acc);\n      return [a, this.join(b, tree.leaf, tree.own, tree.right)];\n    }\n    const throughLeaf = combine(throughLeft, tree.own);\n    if (predicate(throughLeaf)) return [tree.left, this.join(null, tree.leaf, tree.own, tree.right)];\n    const [a, b] = this.splitBy(tree.right, predicate, throughLeaf);\n    return [this.join(tree.left, tree.leaf, tree.own, a, tree.inner), b];\n  }\n\n  /** This function replaces the leaf at an index in the tree. It copies only the path to the leaf. */\n  replaceAt(tree: Node<L, S>, index: number, leaf: L, own: S): Node<L, S> {\n    const before = sizeOf(tree.left);\n    if (index === before) return this.node(tree.left, leaf, own, tree.right);\n    if (index < before) return this.node(this.replaceAt(tree.left!, index, leaf, own), tree.leaf, tree.own, tree.right);\n    return this.withRight(tree, this.replaceAt(tree.right!, index - before - 1, leaf, own));\n  }\n\n  /** This function puts one leaf before the leaf at an index. It copies only the path, and `join` keeps the balance. */\n  insertAt(tree: Tree<L, S>, index: number, leaf: L, own: S): Node<L, S> {\n    if (tree === null) return this.node(null, leaf, own, null);\n    const before = sizeOf(tree.left);\n    if (index <= before) return this.join(this.insertAt(tree.left, index, leaf, own), tree.leaf, tree.own, tree.right);\n    return this.join(tree.left, tree.leaf, tree.own, this.insertAt(tree.right, index - before - 1, leaf, own), tree.inner);\n  }\n\n  /**\n   * This function replaces the leaf at an index with one or more leaves. It descends once.\n   * At the node of the leaf, it puts the first new leaf in the node.\n   * It puts the other new leaves at the start of the right subtree of that node.\n   */\n  replaceSpan(tree: Node<L, S>, index: number, leaves: readonly L[]): Node<L, S> {\n    const before = sizeOf(tree.left);\n    if (index < before) return this.join(this.replaceSpan(tree.left!, index, leaves), tree.leaf, tree.own, tree.right);\n    if (index > before) return this.join(tree.left, tree.leaf, tree.own, this.replaceSpan(tree.right!, index - before - 1, leaves), tree.inner);\n    let right = tree.right;\n    for (let i = 1; i < leaves.length; i++) right = this.insertAt(right, i - 1, leaves[i]!, this.spec.measure(leaves[i]!));\n    return this.join(tree.left, leaves[0]!, this.spec.measure(leaves[0]!), right);\n  }\n\n  /** This function removes the leaf at an index. It copies only the path, and `join` keeps the balance. */\n  removeAt(tree: Node<L, S>, index: number): Tree<L, S> {\n    const before = sizeOf(tree.left);\n    if (index === before) return this.concat(tree.left, tree.right);\n    if (index < before) return this.join(this.removeAt(tree.left!, index), tree.leaf, tree.own, tree.right);\n    return this.join(tree.left, tree.leaf, tree.own, this.removeAt(tree.right!, index - before - 1), tree.inner);\n  }\n\n  /** This function gives the leaf at an index of the tree. The index must be in the tree. */\n  leafAt(tree: Node<L, S>, index: number): L {\n    let node = tree;\n    for (;;) {\n      const before = sizeOf(node.left);\n      if (index === before) return node.leaf;\n      if (index < before) node = node.left!;\n      else {\n        index -= before + 1;\n        node = node.right!;\n      }\n    }\n  }\n\n  /** This function joins the leaves at `index` and `index + 1` when `spec.merge` gives one leaf for them. */\n  seam(tree: Tree<L, S>, index: number): Tree<L, S> {\n    const { merge } = this.spec;\n    if (merge === undefined || tree === null || index < 0 || index + 1 >= tree.size) return tree;\n    const merged = merge(this.leafAt(tree, index), this.leafAt(tree, index + 1));\n    if (merged === undefined) return tree;\n    return this.removeAt(this.replaceAt(tree, index, merged, this.spec.measure(merged)), index + 1);\n  }\n\n  /** This function makes a balanced tree of the leaves `items[lo]` to `items[hi - 1]`. */\n  build(items: readonly L[], lo: number, hi: number): Tree<L, S> {\n    if (lo >= hi) return null;\n    const mid = (lo + hi) >>> 1;\n    const leaf = items[mid]!;\n    return this.node(this.build(items, lo, mid), leaf, this.spec.measure(leaf), this.build(items, mid + 1, hi));\n  }\n}\n\n/** The largest number of removed and inserted leaves for which `splice` copies paths instead of splitting the tree. */\nconst SMALL_EDIT = 8;\n\n/** The builders of each spec. Each spec has one builder, so that two trees of the same spec can be joined. */\nconst builders = new WeakMap<object, Builder<unknown, unknown>>();\n\nfunction builderOf<L, S>(spec: SummarySpec<L, S>): Builder<L, S> {\n  let builder = builders.get(spec) as Builder<L, S> | undefined;\n  if (builder === undefined) {\n    builder = new Builder(spec);\n    builders.set(spec, builder as Builder<unknown, unknown>);\n  }\n  return builder;\n}\n\nfunction* walk<L, S>(tree: Tree<L, S>): Generator<L, void, undefined> {\n  // An explicit stack: the depth of the tree is O(log n), so the stack stays small\n  const stack: Node<L, S>[] = [];\n  let node = tree;\n  while (node !== null || stack.length > 0) {\n    while (node !== null) {\n      stack.push(node);\n      node = node.left;\n    }\n    const top = stack.pop()!;\n    yield top.leaf;\n    node = top.right;\n  }\n}\n\n/** This function gives the index of a leaf, with a negative index counted from the end, or -1 when it is not in the tree. */\nfunction indexOf(index: number, size: number): number {\n  if (!Number.isInteger(index)) return -1;\n  const at = index < 0 ? size + index : index;\n  return at >= 0 && at < size ? at : -1;\n}\n\nfunction clamp(value: number, size: number): number {\n  if (Number.isNaN(value)) return 0;\n  const whole = Math.trunc(value);\n  return whole < 0 ? Math.max(0, size + whole) : Math.min(whole, size);\n}\n\n/**\n * A persistent sequence of leaves with a summary of each part. Make one with `summaryTree`. Each method that changes\n * the sequence gives a new tree.\n */\nexport class SummaryTree<Leaf, Summary> implements Iterable<Leaf> {\n  private readonly builder: Builder<Leaf, Summary>;\n  private readonly root: Tree<Leaf, Summary>;\n\n  private constructor(builder: Builder<Leaf, Summary>, root: Tree<Leaf, Summary>) {\n    this.builder = builder;\n    this.root = root;\n  }\n\n  /** This function makes a tree of a spec from leaves, as `summaryTree` does. */\n  static of<Leaf, Summary>(spec: SummarySpec<Leaf, Summary>, leaves: Iterable<Leaf> = []): SummaryTree<Leaf, Summary> {\n    const builder = builderOf(spec);\n    const items = [...leaves];\n    return new SummaryTree(builder, builder.build(items, 0, items.length));\n  }\n\n  private wrap(root: Tree<Leaf, Summary>): SummaryTree<Leaf, Summary> {\n    return root === this.root ? this : new SummaryTree(this.builder, root);\n  }\n\n  private treeOf(leaves: Iterable<Leaf> | SummaryTree<Leaf, Summary>): Tree<Leaf, Summary> {\n    if (leaves instanceof SummaryTree) {\n      if (leaves.builder !== this.builder) throw new TypeError(\"SummaryTree: the two trees have different specs\");\n      return leaves.root;\n    }\n    const items = [...leaves];\n    return this.builder.build(items, 0, items.length);\n  }\n\n  /** The spec of the tree: its monoid and its measure. */\n  get spec(): SummarySpec<Leaf, Summary> {\n    return this.builder.spec;\n  }\n\n  /** The number of leaves. */\n  get size(): number {\n    return sizeOf(this.root);\n  }\n\n  get isEmpty(): boolean {\n    return this.root === null;\n  }\n\n  /** The summary of all the leaves, in their order. An empty tree has the summary `monoid.empty`. */\n  get summary(): Summary {\n    return this.builder.summaryOf(this.root);\n  }\n\n  /** The height of the tree: 0 for an empty tree. The height is at most 1.45 log2(size + 2). */\n  get height(): number {\n    return heightOf(this.root);\n  }\n\n  /**\n   * This function gives the leaf at an index, or `undefined` when the index is not in the tree. A negative index counts\n   * from the end, as `Array.prototype.at` does.\n   */\n  at(index: number): Leaf | undefined {\n    index = indexOf(index, this.size);\n    return index === -1 ? undefined : this.builder.leafAt(this.root!, index);\n  }\n\n  /** This function gives the summary of the leaves from `start` to `end`, with `end` not included. */\n  summaryOf(start = 0, end: number = this.size): Summary {\n    return this.slice(start, end).summary;\n  }\n\n  /** This function gives the tree of the leaves of this tree, then the leaves of `other`. The two trees must have the same spec. */\n  concat(other: SummaryTree<Leaf, Summary> | Iterable<Leaf>): SummaryTree<Leaf, Summary> {\n    const joined = this.builder.concat(this.root, this.treeOf(other));\n    return this.wrap(this.builder.seam(joined, this.size - 1));\n  }\n\n  /** This function splits the tree into its first `index` leaves and the other leaves. */\n  splitAt(index: number): [SummaryTree<Leaf, Summary>, SummaryTree<Leaf, Summary>] {\n    const [left, right] = this.builder.splitAt(this.root, clamp(index, this.size));\n    return [this.wrap(left), this.wrap(right)];\n  }\n\n  /**\n   * This function splits the tree before the first leaf whose prefix summary satisfies the predicate. The prefix of a\n   * leaf includes the leaf. The predicate must be monotone: after it is true for a prefix, it is true for each longer\n   * prefix. When no prefix satisfies it, the right tree is empty.\n   */\n  split(predicate: (prefix: Summary) => boolean): [SummaryTree<Leaf, Summary>, SummaryTree<Leaf, Summary>] {\n    const [left, right] = this.builder.splitBy(this.root, predicate, this.builder.spec.monoid.empty);\n    return [this.wrap(left), this.wrap(right)];\n  }\n\n  /**\n   * This function finds the first leaf whose prefix summary satisfies a monotone predicate, as `split` does. It changes\n   * nothing. It gives `undefined` when no prefix satisfies the predicate.\n   */\n  search(predicate: (prefix: Summary) => boolean): SummarySearch<Leaf, Summary> | undefined {\n    const { combine } = this.builder.spec.monoid;\n    let node = this.root;\n    let acc = this.builder.spec.monoid.empty;\n    let index = 0;\n    while (node !== null) {\n      const throughLeft = node.left === null ? acc : combine(acc, node.left.summary);\n      if (node.left !== null && predicate(throughLeft)) {\n        node = node.left;\n        continue;\n      }\n      const through = combine(throughLeft, node.own);\n      if (predicate(through)) return { index: index + sizeOf(node.left), leaf: node.leaf, before: throughLeft, through };\n      index += sizeOf(node.left) + 1;\n      acc = through;\n      node = node.right;\n    }\n    return undefined;\n  }\n\n  /**\n   * This function finds the leaf that holds a position of an additive key, and it calls no `combine`. The key must be\n   * additive and not negative: `key(combine(a, b))` is `key(a) + key(b)`. The function descends by the key of each left\n   * subtree and of each leaf, and subtracts it from the target. It gives the first leaf whose prefix key is more than\n   * the target, or `undefined` when the target is not in `[0, key(summary))`.\n   *\n   * @example\n   * // The leaf and the offset in it of the code unit at position 1000 of a rope\n   * const at = rope.locate((s) => s.length, 1000);\n   */\n  locate(key: (summary: Summary) => number, target: number): SummaryLocation<Leaf> | undefined {\n    if (!(target >= 0)) return undefined;\n    let node = this.root;\n    let index = 0;\n    let rest = target;\n    while (node !== null) {\n      if (node.left !== null) {\n        const left = key(node.left.summary);\n        if (rest < left) {\n          node = node.left;\n          continue;\n        }\n        rest -= left;\n        index += node.left.size;\n      }\n      const own = key(node.own);\n      if (rest < own) return { index, leaf: node.leaf, offset: rest };\n      rest -= own;\n      index += 1;\n      node = node.right;\n    }\n    return undefined;\n  }\n\n  /** This function gives the tree of the leaves from `start` to `end`, with `end` not included. A negative index counts from the end. */\n  slice(start = 0, end: number = this.size): SummaryTree<Leaf, Summary> {\n    const from = clamp(start, this.size);\n    const to = clamp(end, this.size);\n    if (to <= from) return this.wrap(null);\n    const [, rest] = this.builder.splitAt(this.root, from);\n    const [middle] = this.builder.splitAt(rest, to - from);\n    return this.wrap(middle);\n  }\n\n  /**\n   * This function removes `deleteCount` leaves at `start` and puts the leaves of `inserted` there, as\n   * `Array.prototype.splice` does. It gives the new tree, not the removed leaves.\n   */\n  splice(start: number, deleteCount: number = this.size, inserted: SummaryTree<Leaf, Summary> | Iterable<Leaf> = []): SummaryTree<Leaf, Summary> {\n    const from = clamp(start, this.size);\n    const count = Math.max(0, Math.min(Number.isNaN(deleteCount) ? 0 : Math.trunc(deleteCount), this.size - from));\n    const builder = this.builder;\n    const leaves = inserted instanceof SummaryTree ? undefined : [...inserted];\n    const added = leaves === undefined ? (inserted as SummaryTree<Leaf, Summary>).size : leaves.length;\n    if (count === 0 && added === 0) return this;\n    let root = this.root;\n    if (leaves !== undefined && count + added <= SMALL_EDIT) {\n      // A small edit copies only the paths to its leaves: 1 or 2 combines for each level of each path\n      const replaced = Math.min(count, added);\n      if (count > 0 && added > count) {\n        // The last removed leaf takes all the extra leaves in one descent\n        for (let i = 0; i < count - 1; i++) root = builder.replaceAt(root!, from + i, leaves[i]!, builder.spec.measure(leaves[i]!));\n        root = builder.replaceSpan(root!, from + count - 1, leaves.slice(count - 1));\n      } else for (let i = 0; i < added; i++) {\n        const leaf = leaves[i]!;\n        const own = builder.spec.measure(leaf);\n        root = i < replaced ? builder.replaceAt(root!, from + i, leaf, own) : builder.insertAt(root, from + i, leaf, own);\n      }\n      for (let i = replaced; i < count; i++) root = builder.removeAt(root!, from + added);\n    } else {\n      const middle = leaves === undefined ? this.treeOf(inserted) : builder.build(leaves, 0, leaves.length);\n      const [left, rest] = builder.splitAt(root, from);\n      const [, right] = builder.splitAt(rest, count);\n      root = builder.concat(builder.concat(left, middle), right);\n    }\n    // The right seam first, so that a merge there does not move the index of the left seam\n    if (added > 0) root = builder.seam(root, from + added - 1);\n    return this.wrap(builder.seam(root, from - 1));\n  }\n\n  /** This function puts the leaves of `inserted` before the leaf at `index`. */\n  insert(index: number, inserted: SummaryTree<Leaf, Summary> | Iterable<Leaf>): SummaryTree<Leaf, Summary> {\n    return this.splice(index, 0, inserted);\n  }\n\n  /** This function removes the leaves from `start` to `end`, with `end` not included. */\n  remove(start: number, end: number = this.size): SummaryTree<Leaf, Summary> {\n    const from = clamp(start, this.size);\n    return this.splice(from, Math.max(0, clamp(end, this.size) - from));\n  }\n\n  /**\n   * This function replaces the leaf at an index. A negative index counts from the end, as `Array.prototype.with` does.\n   * An index that is not in the tree changes nothing. It copies only the path to the leaf, and it does not call\n   * `spec.merge`.\n   */\n  set(index: number, leaf: Leaf): SummaryTree<Leaf, Summary> {\n    const at = indexOf(index, this.size);\n    return at === -1 ? this : this.wrap(this.builder.replaceAt(this.root!, at, leaf, this.builder.spec.measure(leaf)));\n  }\n\n  /** This function adds leaves after the last leaf. */\n  append(...leaves: Leaf[]): SummaryTree<Leaf, Summary> {\n    return this.concat(leaves);\n  }\n\n  /** This function adds leaves before the first leaf. */\n  prepend(...leaves: Leaf[]): SummaryTree<Leaf, Summary> {\n    const joined = this.builder.concat(this.treeOf(leaves), this.root);\n    return this.wrap(this.builder.seam(joined, leaves.length - 1));\n  }\n\n  /** This function gives the leaves in their order. */\n  [Symbol.iterator](): Iterator<Leaf> {\n    return walk(this.root);\n  }\n\n  /** This function gives the leaves in an array. */\n  toArray(): Leaf[] {\n    return [...walk(this.root)];\n  }\n}\n\n/**\n * This function makes a persistent tree of leaves with a summary of each part. Use the same `spec` object for each\n * tree that `concat` or `splice` joins.\n */\nexport function summaryTree<Leaf, Summary>(spec: SummarySpec<Leaf, Summary>, leaves: Iterable<Leaf> = []): SummaryTree<Leaf, Summary> {\n  return SummaryTree.of(spec, leaves);\n}\n\n/**\n * @internal This function examines the invariants of a tree: the AVL balance, the heights, the sizes and the\n * summaries. It gives a list of the faults, empty when there is no fault. The tests use it.\n */\nexport function summaryTreeFaults<Leaf, Summary>(tree: SummaryTree<Leaf, Summary>, equal: (a: Summary, b: Summary) => boolean): string[] {\n  const builder = tree[\"builder\"];\n  const faults: string[] = [];\n  const visit = (node: Tree<Leaf, Summary>, path: string): void => {\n    if (node === null) return;\n    visit(node.left, `${path}L`);\n    visit(node.right, `${path}R`);\n    const hl = heightOf(node.left);\n    const hr = heightOf(node.right);\n    if (Math.abs(hl - hr) > 1) faults.push(`${path}: balance ${hl - hr}`);\n    if (node.height !== 1 + Math.max(hl, hr)) faults.push(`${path}: height ${node.height}`);\n    if (node.size !== sizeOf(node.left) + 1 + sizeOf(node.right)) faults.push(`${path}: size ${node.size}`);\n    const { combine } = builder.spec.monoid;\n    const inner = combine(builder.summaryOf(node.left), builder.spec.measure(node.leaf));\n    if (!equal(node.inner, inner)) faults.push(`${path}: inner`);\n    if (!equal(node.summary, combine(inner, builder.summaryOf(node.right)))) faults.push(`${path}: summary`);\n  };\n  visit(tree[\"root\"], \"^\");\n  return faults;\n}\n","/**\n * Bounded behavior - Enforces capacity limits on collections.\n *\n * This module wraps collections to prevent them from exceeding a maximum size.\n * This module gives various overflow policies to handle full collections.\n *\n * @example\n * const list = compose(\n *   boundedList<number>({ capacity: 100, policy: 'drop-oldest' })\n * )(arrayList<number>())\n *\n * // Add 101 elements - first element will be dropped\n * for (let i = 0; i < 101; i++) {\n *   list.add(i)\n * }\n */\n\nimport type { Middleware } from \"../core/middleware.js\";\nimport type { List } from \"../interfaces/list.js\";\nimport type { Queue, Deque } from \"../interfaces/queue.js\";\nimport type { MapLike } from \"../interfaces/map.js\";\nimport type { Collection } from \"../interfaces/collection.js\";\nimport type {\n  OverflowPolicy,\n  OverflowHandler,\n  OverflowContext,\n} from \"../core/policies.js\";\n\n/**\n * Options for bounded behavior.\n */\nexport interface BoundedOptions<T> {\n  /**\n   * Maximum number of elements the collection can hold.\n   */\n  capacity: number;\n\n  /**\n   * Policy for handling overflow when collection is full.\n   * @default 'throw'\n   */\n  policy?: OverflowPolicy;\n\n  /**\n   * Optional callback invoked when overflow occurs.\n   * The behavior calls this function before it applies the policy.\n   */\n  onOverflow?: OverflowHandler<T>;\n}\n\n/**\n * Marker interface for bounded collections.\n */\nexport interface BoundedCollection {\n  readonly capacity: number;\n  readonly isFull: boolean;\n  readonly remainingCapacity: number;\n}\n\n/**\n * This function makes a bounded List middleware.\n *\n * Intercepts add operations to enforce capacity limits.\n * This function supports multiple overflow policies.\n */\nexport function boundedList<T>(\n  options: BoundedOptions<T>\n): Middleware<List<T>, List<T> & BoundedCollection> {\n  const { capacity, policy = \"throw\", onOverflow } = options;\n\n  return (next: List<T>): List<T> & BoundedCollection => {\n    // An unshift puts the element at the front, so drop-oldest drops the last element for it\n    const handleOverflow = (element: T, dropFrom: \"first\" | \"last\" = \"first\"): void => {\n      // Call overflow handler if provided\n      if (onOverflow) {\n        const context: OverflowContext<T> = {\n          newElement: element,\n          currentSize: next.size,\n          capacity,\n          timestamp: Date.now(),\n        };\n        onOverflow(context);\n      }\n\n      // Apply policy\n      switch (policy) {\n        case \"throw\":\n          throw new Error(`List is full (capacity: ${capacity})`);\n\n        case \"drop-oldest\":\n          // Remove one element: the first, or the last for an unshift\n          if (!next.isEmpty) {\n            if (dropFrom === \"last\") next.pop();\n            else next.shift();\n          }\n          break;\n\n        case \"drop-newest\":\n          // Don't add the new element (do nothing)\n          return;\n\n        case \"reject\":\n          // Silently reject (return false for add operations)\n          return;\n\n        case \"grow\":\n          // Allow growth (do nothing, element will be added)\n          return;\n\n        case \"block\":\n          throw new Error(\"Block policy not supported for sync collections\");\n\n        default:\n          throw new Error(`Unknown overflow policy: ${policy}`);\n      }\n    };\n\n    // After drop-oldest removed the first element, an index of the caller is one place lower\n    const shifted = (index: number): number => (policy === \"drop-oldest\" ? Math.max(0, index - 1) : index);\n\n    return new Proxy(next, {\n      get(target, prop, receiver) {\n        // Capacity property\n        if (prop === \"capacity\") {\n          return capacity;\n        }\n\n        // isFull property\n        if (prop === \"isFull\") {\n          return target.size >= capacity;\n        }\n\n        // remainingCapacity property\n        if (prop === \"remainingCapacity\") {\n          return Math.max(0, capacity - target.size);\n        }\n\n        const value = Reflect.get(target, prop, receiver);\n\n        // Intercept methods that add elements\n        if (typeof value === \"function\") {\n          switch (prop) {\n            case \"add\":\n              return function (element: T): boolean {\n                if (target.size >= capacity && policy !== \"grow\") {\n                  handleOverflow(element);\n                  if (policy === \"reject\" || policy === \"drop-newest\") {\n                    return false;\n                  }\n                }\n                return (value as Function).call(target, element);\n              };\n\n            case \"push\":\n              return function (element: T): void {\n                if (target.size >= capacity && policy !== \"grow\") {\n                  handleOverflow(element);\n                  if (policy === \"reject\" || policy === \"drop-newest\") {\n                    return;\n                  }\n                }\n                (value as Function).call(target, element);\n              };\n\n            case \"unshift\":\n              return function (element: T): void {\n                if (target.size >= capacity && policy !== \"grow\") {\n                  // One element goes: the last one (before, the first and the last went: audit pass 2)\n                  handleOverflow(element, \"last\");\n                  if (policy === \"reject\" || policy === \"drop-newest\") {\n                    return;\n                  }\n                }\n                (value as Function).call(target, element);\n              };\n\n            case \"insert\":\n              return function (index: number, element: T): void {\n                let at = index;\n                if (target.size >= capacity && policy !== \"grow\") {\n                  handleOverflow(element);\n                  if (policy === \"reject\" || policy === \"drop-newest\") {\n                    return;\n                  }\n                  at = shifted(at);\n                }\n                (value as Function).call(target, at, element);\n              };\n\n            case \"addAll\":\n            case \"insertAll\":\n              return function (...args: any[]): boolean {\n                const elements = args[args.length - 1] as Iterable<T>;\n                const elementsArray = Array.from(elements);\n\n                // Check if adding all elements would exceed capacity\n                if (target.size + elementsArray.length > capacity && policy !== \"grow\") {\n                  // Add elements one by one with overflow handling. An insert keeps the order of\n                  // the elements, at an index that follows each drop.\n                  let added = false;\n                  let at = args[0] as number;\n                  for (const element of elementsArray) {\n                    if (target.size >= capacity) {\n                      handleOverflow(element);\n                      if (policy === \"reject\" || policy === \"drop-newest\") {\n                        break;\n                      }\n                      at = shifted(at);\n                    }\n                    if (prop === \"addAll\") {\n                      target.add(element);\n                    } else {\n                      target.insert(at, element);\n                      at++;\n                    }\n                    added = true;\n                  }\n                  return added;\n                }\n\n                return (value as Function).apply(target, args);\n              };\n          }\n        }\n\n        return value;\n      },\n    }) as List<T> & BoundedCollection;\n  };\n}\n\n/**\n * This function makes a bounded Queue middleware.\n */\nexport function boundedQueue<T>(\n  options: BoundedOptions<T>\n): Middleware<Queue<T>, Queue<T> & BoundedCollection> {\n  const { capacity, policy = \"throw\", onOverflow } = options;\n\n  return (next: Queue<T>): Queue<T> & BoundedCollection => {\n    const handleOverflow = (element: T): void => {\n      if (onOverflow) {\n        const context: OverflowContext<T> = {\n          newElement: element,\n          currentSize: next.size,\n          capacity,\n          timestamp: Date.now(),\n        };\n        onOverflow(context);\n      }\n\n      switch (policy) {\n        case \"throw\":\n          throw new Error(`Queue is full (capacity: ${capacity})`);\n        case \"drop-oldest\":\n          if (!next.isEmpty) {\n            next.poll();\n          }\n          break;\n        case \"drop-newest\":\n        case \"reject\":\n          return;\n        case \"grow\":\n          return;\n        case \"block\":\n          throw new Error(\"Block policy not supported for sync collections\");\n        default:\n          throw new Error(`Unknown overflow policy: ${policy}`);\n      }\n    };\n\n    return new Proxy(next, {\n      get(target, prop, receiver) {\n        if (prop === \"capacity\") return capacity;\n        if (prop === \"isFull\") return target.size >= capacity;\n        if (prop === \"remainingCapacity\") return Math.max(0, capacity - target.size);\n\n        const value = Reflect.get(target, prop, receiver);\n\n        if (typeof value === \"function\") {\n          switch (prop) {\n            case \"offer\":\n            case \"enqueue\":\n            case \"add\":\n              return function (element: T): boolean {\n                if (target.size >= capacity && policy !== \"grow\") {\n                  handleOverflow(element);\n                  if (policy === \"reject\" || policy === \"drop-newest\") {\n                    return false;\n                  }\n                }\n                return (value as Function).call(target, element);\n              };\n          }\n        }\n\n        return value;\n      },\n    }) as Queue<T> & BoundedCollection;\n  };\n}\n\n/**\n * This function makes a bounded Deque middleware.\n */\nexport function boundedDeque<T>(\n  options: BoundedOptions<T>\n): Middleware<Deque<T>, Deque<T> & BoundedCollection> {\n  const { capacity, policy = \"throw\", onOverflow } = options;\n\n  return (next: Deque<T>): Deque<T> & BoundedCollection => {\n    const handleOverflow = (element: T): void => {\n      if (onOverflow) {\n        const context: OverflowContext<T> = {\n          newElement: element,\n          currentSize: next.size,\n          capacity,\n          timestamp: Date.now(),\n        };\n        onOverflow(context);\n      }\n\n      switch (policy) {\n        case \"throw\":\n          throw new Error(`Deque is full (capacity: ${capacity})`);\n        case \"drop-oldest\":\n          if (!next.isEmpty) {\n            next.removeFirst();\n          }\n          break;\n        case \"drop-newest\":\n        case \"reject\":\n          return;\n        case \"grow\":\n          return;\n        case \"block\":\n          throw new Error(\"Block policy not supported for sync collections\");\n        default:\n          throw new Error(`Unknown overflow policy: ${policy}`);\n      }\n    };\n\n    return new Proxy(next, {\n      get(target, prop, receiver) {\n        if (prop === \"capacity\") return capacity;\n        if (prop === \"isFull\") return target.size >= capacity;\n        if (prop === \"remainingCapacity\") return Math.max(0, capacity - target.size);\n\n        const value = Reflect.get(target, prop, receiver);\n\n        if (typeof value === \"function\") {\n          switch (prop) {\n            case \"addFirst\":\n            case \"addLast\":\n            case \"offerFirst\":\n            case \"offerLast\":\n            case \"push\":\n            case \"offer\":\n            case \"add\":\n              return function (element: T): any {\n                if (target.size >= capacity && policy !== \"grow\") {\n                  handleOverflow(element);\n                  if (policy === \"reject\" || policy === \"drop-newest\") {\n                    return prop.startsWith(\"offer\") || prop === \"add\" ? false : undefined;\n                  }\n                }\n                return (value as Function).call(target, element);\n              };\n          }\n        }\n\n        return value;\n      },\n    }) as Deque<T> & BoundedCollection;\n  };\n}\n\n/**\n * This function makes a bounded Map middleware.\n */\nexport function boundedMap<K, V>(\n  options: Omit<BoundedOptions<V>, \"onOverflow\"> & {\n    onOverflow?: (context: Omit<OverflowContext<V>, \"newElement\"> & { key: K; value: V }) => void;\n  }\n): Middleware<MapLike<K, V>, MapLike<K, V> & BoundedCollection> {\n  const { capacity, policy = \"throw\", onOverflow } = options;\n\n  return (next: MapLike<K, V>): MapLike<K, V> & BoundedCollection => {\n    let insertionOrder: K[] = []; // Track insertion order for drop-oldest\n\n    const handleOverflow = (key: K, value: V): void => {\n      if (onOverflow) {\n        onOverflow({\n          key,\n          value,\n          currentSize: next.size,\n          capacity,\n          timestamp: Date.now(),\n        });\n      }\n\n      switch (policy) {\n        case \"throw\":\n          throw new Error(`Map is full (capacity: ${capacity})`);\n        case \"drop-oldest\":\n          // Remove oldest key\n          if (insertionOrder.length > 0) {\n            const oldestKey = insertionOrder.shift()!;\n            next.delete(oldestKey);\n          }\n          break;\n        case \"drop-newest\":\n        case \"reject\":\n          return;\n        case \"grow\":\n          return;\n        case \"block\":\n          throw new Error(\"Block policy not supported for sync collections\");\n        default:\n          throw new Error(`Unknown overflow policy: ${policy}`);\n      }\n    };\n\n    return new Proxy(next, {\n      get(target, prop, receiver) {\n        if (prop === \"capacity\") return capacity;\n        if (prop === \"isFull\") return target.size >= capacity;\n        if (prop === \"remainingCapacity\") return Math.max(0, capacity - target.size);\n\n        const value = Reflect.get(target, prop, receiver);\n\n        if (typeof value === \"function\") {\n          switch (prop) {\n            case \"set\":\n              return function (key: K, val: V): V | undefined {\n                const hadKey = target.has(key);\n\n                if (!hadKey && target.size >= capacity && policy !== \"grow\") {\n                  handleOverflow(key, val);\n                  if (policy === \"reject\" || policy === \"drop-newest\") {\n                    return undefined;\n                  }\n                }\n\n                const result = (value as Function).call(target, key, val);\n\n                // Track insertion order\n                if (!hadKey) {\n                  insertionOrder.push(key);\n                }\n\n                return result;\n              };\n\n            case \"delete\":\n              return function (key: K): V | undefined {\n                const result = (value as Function).call(target, key);\n                // Remove from insertion order tracking\n                insertionOrder = insertionOrder.filter((k) => !target.keyEq(k, key));\n                return result;\n              };\n\n            case \"clear\":\n              return function (): void {\n                (value as Function).call(target);\n                insertionOrder = [];\n              };\n          }\n        }\n\n        return value;\n      },\n    }) as MapLike<K, V> & BoundedCollection;\n  };\n}\n\n/**\n * Generic bounded collection middleware.\n * Works with any collection type.\n */\nexport function bounded<C extends Collection<any>>(\n  options: BoundedOptions<any>\n): Middleware<C, C & BoundedCollection> {\n  return boundedList(options) as any;\n}\n","/**\n * Readonly behavior - Makes immutable views of collections.\n *\n * This module wraps collections to prevent modifications by throwing errors\n * on any mutation try. Mirrors Java's Collections.unmodifiable*() methods.\n *\n * @example\n * const list = compose(\n *   readonlyList()\n * )(arrayList([1, 2, 3]))\n *\n * list.get(0) // OK: 1\n * list.add(4) // Error: Cannot modify readonly list\n */\n\nimport type { Middleware } from \"../core/middleware.js\";\nimport type { ReadonlyList } from \"../interfaces/list.js\";\nimport type { ReadonlyQueue } from \"../interfaces/queue.js\";\nimport type { ReadonlyMapLike } from \"../interfaces/map.js\";\nimport type { ReadonlyCollection } from \"../interfaces/collection.js\";\n\n/**\n * Options for readonly behavior.\n */\nexport interface ReadonlyOptions {\n  /**\n   * Custom error message to throw on mutation tries.\n   * @default 'Cannot modify readonly collection'\n   */\n  errorMessage?: string;\n}\n\n/**\n * This set holds the names of the methods that mutate collections.\n */\nconst MUTATING_METHODS = new Set([\n  // Collection mutations\n  \"add\",\n  \"addAll\",\n  \"remove\",\n  \"removeAll\",\n  \"retainAll\",\n  \"clear\",\n\n  // List mutations\n  \"set\",\n  \"insert\",\n  \"insertAll\",\n  \"removeAt\",\n  \"removeRange\",\n  \"push\",\n  \"pop\",\n  \"shift\",\n  \"unshift\",\n  \"sort\",\n  \"reverse\",\n\n  // Queue/Deque mutations\n  \"offer\",\n  \"offerFirst\",\n  \"offerLast\",\n  \"poll\",\n  \"pollFirst\",\n  \"pollLast\",\n  \"enqueue\",\n  \"dequeue\",\n  \"addFirst\",\n  \"addLast\",\n  \"removeFirst\",\n  \"removeLast\",\n\n  // Map mutations\n  \"set\",\n  \"setIfAbsent\",\n  \"forcePut\",\n  \"pollFirstEntry\",\n  \"pollLastEntry\",\n  \"delete\",\n  \"deleteEntry\",\n  \"replace\",\n  \"replaceEntry\",\n  \"computeIfAbsent\",\n  \"computeIfPresent\",\n  \"compute\",\n  \"merge\",\n  \"putAll\",\n]);\n\n/** Methods that return a view of the collection: the view is readonly too. */\nconst VIEW_METHODS = new Set([\n  \"subList\",\n  \"subMap\",\n  \"subSet\",\n  \"headMap\",\n  \"tailMap\",\n  \"headSet\",\n  \"tailSet\",\n  \"descendingMap\",\n  \"descendingSet\",\n  \"inverse\",\n]);\n\n/**\n * This function makes a readonly middleware for any collection type.\n */\nfunction createReadonly<C extends object>(\n  errorMessage: string = \"Cannot modify readonly collection\"\n): Middleware<C> {\n  return (next: C): C => {\n    // The read methods, bound to the collection: one function for each name\n    const bound = new Map<PropertyKey, { value: Function; method: Function }>();\n    return new Proxy(next, {\n      get(target, prop) {\n        // A read runs on the collection itself, not on the proxy: a read that changes internal\n        // state (a LinkedHashMap with accessOrder moves the entry) does not hit the set trap\n        const value = Reflect.get(target, prop, target);\n\n        // Block mutating methods\n        if (typeof prop === \"string\" && MUTATING_METHODS.has(prop)) {\n          if (typeof value === \"function\") {\n            return () => {\n              throw new Error(errorMessage);\n            };\n          }\n        }\n\n        // A view (a sublist, a submap, a head or tail set, a descending map) is readonly too.\n        // Before, only subList and subMap were wrapped, and setIfAbsent, pollFirstEntry and\n        // pollLastEntry were not blocked (BUGS-2026-07 L14).\n        if (typeof value === \"function\" && typeof prop === \"string\" && VIEW_METHODS.has(prop)) {\n          return function (this: any, ...args: any[]) {\n            const result = value.apply(target, args);\n            // Recursively apply readonly to the result\n            return createReadonly<typeof result>(errorMessage)(result);\n          };\n        }\n\n        if (typeof value === \"function\") {\n          const known = bound.get(prop);\n          if (known !== undefined && known.value === value) return known.method;\n          const method = (value as Function).bind(target) as Function;\n          bound.set(prop, { value, method });\n          return method;\n        }\n\n        return value;\n      },\n\n      set(_target, _prop, _value, _receiver) {\n        // Block property assignments\n        throw new Error(errorMessage);\n      },\n\n      deleteProperty(_target, _prop) {\n        // Block property deletions\n        throw new Error(errorMessage);\n      },\n    });\n  };\n}\n\n/**\n * This function makes a readonly List middleware.\n *\n * All mutation methods will throw an error.\n * Read operations work normally.\n *\n * @example\n * const readonlyNumbers = compose(\n *   readonlyList()\n * )(arrayList([1, 2, 3]))\n */\nexport function readonlyList<T>(\n  options: ReadonlyOptions = {}\n): Middleware<ReadonlyList<T>> {\n  const errorMessage = options.errorMessage ?? \"Cannot modify readonly list\";\n  return createReadonly<any>(errorMessage);\n}\n\n/**\n * This function makes a readonly Queue middleware.\n */\nexport function readonlyQueue<T>(\n  options: ReadonlyOptions = {}\n): Middleware<ReadonlyQueue<T>> {\n  const errorMessage = options.errorMessage ?? \"Cannot modify readonly queue\";\n  return createReadonly<any>(errorMessage);\n}\n\n/**\n * This function makes a readonly Map middleware.\n */\nexport function readonlyMap<K, V>(\n  options: ReadonlyOptions = {}\n): Middleware<ReadonlyMapLike<K, V>> {\n  const errorMessage = options.errorMessage ?? \"Cannot modify readonly map\";\n  return createReadonly<any>(errorMessage);\n}\n\n/**\n * This function makes a readonly Collection middleware.\n *\n * Generic version that works with any collection type.\n */\nexport function readonlyCollection<T>(\n  options: ReadonlyOptions = {}\n): Middleware<ReadonlyCollection<T>> {\n  const errorMessage = options.errorMessage ?? \"Cannot modify readonly collection\";\n  return createReadonly<any>(errorMessage);\n}\n\n/**\n * Generic readonly middleware.\n * Alias for readonlyCollection.\n */\nexport function readonly<C extends object>(\n  options: ReadonlyOptions = {}\n): Middleware<C> {\n  const errorMessage = options.errorMessage ?? \"Cannot modify readonly collection\";\n  return createReadonly<C>(errorMessage);\n}\n\n/**\n * Alias for Java compatibility: unmodifiableList\n */\nexport const unmodifiableList : typeof readonlyList = readonlyList;\n\n/**\n * Alias for Java compatibility: unmodifiableMap\n */\nexport const unmodifiableMap : typeof readonlyMap = readonlyMap;\n\n/**\n * Alias for Java compatibility: unmodifiableCollection\n */\nexport const unmodifiableCollection : typeof readonlyCollection = readonlyCollection;\n","/**\n * Safe behavior - Gives Option/Result-based error handling.\n *\n * This module wraps collection operations that throw errors to instead return\n * Option<T> or Result<T, E>, enabling functional error handling.\n *\n * @example\n * const list = compose(\n *   safeList<number>()\n * )(arrayList<number>())\n *\n * const value = list.safe.get(10) // Option<number> instead of throwing\n * if (isSome(value)) {\n *   console.log(value.value)\n * }\n */\n\nimport type { Middleware } from \"../core/middleware.js\";\nimport type { List } from \"../interfaces/list.js\";\nimport type { Queue, Deque } from \"../interfaces/queue.js\";\nimport type { MapLike } from \"../interfaces/map.js\";\nimport { type Option, type Result } from \"../core/effects.js\";\nimport { None, Some, tryCatch } from \"../core/effects.js\";\n\n/**\n * Safe operations for List.\n */\nexport interface SafeListOperations<T> {\n  /**\n   * Get element at index, giving Option.\n   */\n  get(index: number): Option<T>;\n\n  /**\n   * Set element at index, giving Result with old value or error.\n   */\n  set(index: number, element: T): Result<T, string>;\n\n  /**\n   * Remove element at index, giving Result with removed value or error.\n   */\n  removeAt(index: number): Result<T, string>;\n\n  /**\n   * Get first element as Option.\n   */\n  first(): Option<T>;\n\n  /**\n   * Get last element as Option.\n   */\n  last(): Option<T>;\n\n  /**\n   * Pop element, giving Option.\n   */\n  pop(): Option<T>;\n\n  /**\n   * Shift element, giving Option.\n   */\n  shift(): Option<T>;\n}\n\n/**\n * Safe operations for Queue.\n */\nexport interface SafeQueueOperations<T> {\n  /**\n   * Peek at head element as Option.\n   */\n  peek(): Option<T>;\n\n  /**\n   * Poll element as Option.\n   */\n  poll(): Option<T>;\n\n  /**\n   * Dequeue element as Option.\n   */\n  dequeue(): Option<T>;\n}\n\n/**\n * Safe operations for Deque.\n */\nexport interface SafeDequeOperations<T> extends SafeQueueOperations<T> {\n  /**\n   * Peek at first element as Option.\n   */\n  peekFirst(): Option<T>;\n\n  /**\n   * Peek at last element as Option.\n   */\n  peekLast(): Option<T>;\n\n  /**\n   * Poll first element as Option.\n   */\n  pollFirst(): Option<T>;\n\n  /**\n   * Poll last element as Option.\n   */\n  pollLast(): Option<T>;\n\n  /**\n   * Pop element as Option.\n   */\n  pop(): Option<T>;\n}\n\n/**\n * Safe operations for Map.\n */\nexport interface SafeMapOperations<K, V> {\n  /**\n   * Get value for key as Option.\n   */\n  get(key: K): Option<V>;\n\n  /**\n   * Set value for key, giving Result with old value or success.\n   */\n  set(key: K, value: V): Result<V | undefined, string>;\n\n  /**\n   * Delete key, giving Result with deleted value or error.\n   */\n  delete(key: K): Result<V | undefined, string>;\n}\n\n/**\n * This function makes a safe List middleware.\n *\n * This function exposes a `safe` property with Option/Result-based operations.\n */\nexport function safeList<T>(): Middleware<\n  List<T>,\n  List<T> & { safe: SafeListOperations<T> }\n> {\n  return (next: List<T>): List<T> & { safe: SafeListOperations<T> } => {\n    const safe: SafeListOperations<T> = {\n      get(index: number): Option<T> {\n        return tryCatch(\n          () => next.get(index),\n          () => \"Index out of bounds\"\n        ).match<Option<T>>({\n          Ok: (value) => Some(value),\n          Err: () => None,\n        }) as Option<T>;\n      },\n\n      set(index: number, element: T): Result<T, string> {\n        return tryCatch(\n          () => next.set(index, element),\n          (error) => String(error)\n        );\n      },\n\n      removeAt(index: number): Result<T, string> {\n        return tryCatch(\n          () => next.removeAt(index),\n          (error) => String(error)\n        );\n      },\n\n      first(): Option<T> {\n        return next.isEmpty ? None : Some(next.first());\n      },\n\n      last(): Option<T> {\n        return next.isEmpty ? None : Some(next.last());\n      },\n\n      pop(): Option<T> {\n        if (next.isEmpty) return None;\n        return tryCatch(\n          () => next.pop(),\n          () => \"List is empty\"\n        ).match<Option<T>>({\n          Ok: (value) => Some(value),\n          Err: () => None,\n        }) as Option<T>;\n      },\n\n      shift(): Option<T> {\n        if (next.isEmpty) return None;\n        return tryCatch(\n          () => next.shift(),\n          () => \"List is empty\"\n        ).match<Option<T>>({\n          Ok: (value) => Some(value),\n          Err: () => None,\n        }) as Option<T>;\n      },\n    };\n\n    // Extend next with safe property\n    return Object.assign(next, { safe });\n  };\n}\n\n/**\n * This function makes a safe Queue middleware.\n */\nexport function safeQueue<T>(): Middleware<\n  Queue<T>,\n  Queue<T> & { safe: SafeQueueOperations<T> }\n> {\n  return (next: Queue<T>): Queue<T> & { safe: SafeQueueOperations<T> } => {\n    const safe: SafeQueueOperations<T> = {\n      peek(): Option<T> {\n        if (next.isEmpty) return None;\n        return tryCatch(\n          () => next.peek(),\n          () => \"Queue is empty\"\n        ).match<Option<T>>({\n          Ok: (value) => Some(value),\n          Err: () => None,\n        }) as Option<T>;\n      },\n\n      poll(): Option<T> {\n        if (next.isEmpty) return None;\n        return tryCatch(\n          () => next.poll(),\n          () => \"Queue is empty\"\n        ).match<Option<T>>({\n          Ok: (value) => Some(value),\n          Err: () => None,\n        }) as Option<T>;\n      },\n\n      dequeue(): Option<T> {\n        if (next.isEmpty) return None;\n        return tryCatch(\n          () => next.dequeue(),\n          () => \"Queue is empty\"\n        ).match<Option<T>>({\n          Ok: (value) => Some(value),\n          Err: () => None,\n        }) as Option<T>;\n      },\n    };\n\n    return Object.assign(next, { safe });\n  };\n}\n\n/**\n * This function makes a safe Deque middleware.\n */\nexport function safeDeque<T>(): Middleware<\n  Deque<T>,\n  Deque<T> & { safe: SafeDequeOperations<T> }\n> {\n  return (next: Deque<T>): Deque<T> & { safe: SafeDequeOperations<T> } => {\n    const safe: SafeDequeOperations<T> = {\n      peek(): Option<T> {\n        return next.isEmpty ? None : Some(next.peekFirst());\n      },\n\n      poll(): Option<T> {\n        // One poll: before, the test and the result each called pollFirst(), so poll() removed\n        // two elements and returned the second (BUGS-2026-07 L12)\n        if (next.isEmpty) return None;\n        return Some(next.pollFirst() as T);\n      },\n\n      dequeue(): Option<T> {\n        if (next.isEmpty) return None;\n        return tryCatch(\n          () => next.dequeue(),\n          () => \"Deque is empty\"\n        ).match<Option<T>>({\n          Ok: (value) => Some(value),\n          Err: () => None,\n        }) as Option<T>;\n      },\n\n      peekFirst(): Option<T> {\n        return next.isEmpty ? None : Some(next.peekFirst());\n      },\n\n      peekLast(): Option<T> {\n        return next.isEmpty ? None : Some(next.peekLast());\n      },\n\n      pollFirst(): Option<T> {\n        const result = next.pollFirst();\n        return result !== undefined ? Some(result) : None;\n      },\n\n      pollLast(): Option<T> {\n        const result = next.pollLast();\n        return result !== undefined ? Some(result) : None;\n      },\n\n      pop(): Option<T> {\n        if (next.isEmpty) return None;\n        return tryCatch(\n          () => next.pop(),\n          () => \"Deque is empty\"\n        ).match<Option<T>>({\n          Ok: (value) => Some(value),\n          Err: () => None,\n        }) as Option<T>;\n      },\n    };\n\n    return Object.assign(next, { safe });\n  };\n}\n\n/**\n * This function makes a safe Map middleware.\n */\nexport function safeMap<K, V>(): Middleware<\n  MapLike<K, V>,\n  MapLike<K, V> & { safe: SafeMapOperations<K, V> }\n> {\n  return (\n    next: MapLike<K, V>\n  ): MapLike<K, V> & { safe: SafeMapOperations<K, V> } => {\n    const safe: SafeMapOperations<K, V> = {\n      get(key: K): Option<V> {\n        return next.has(key) ? Some(next.get(key)) : None;\n      },\n\n      set(key: K, value: V): Result<V | undefined, string> {\n        return tryCatch(\n          () => next.set(key, value),\n          (error) => String(error)\n        );\n      },\n\n      delete(key: K): Result<V | undefined, string> {\n        return tryCatch(\n          () => next.delete(key),\n          (error) => String(error)\n        );\n      },\n    };\n\n    return Object.assign(next, { safe });\n  };\n}\n\n/**\n * Generic safe middleware that works with any collection.\n */\nexport function safe<C extends object>(): Middleware<C> {\n  // Return as-is for now; specialized versions handle specific types\n  return (next: C): C => next;\n}\n","/**\n * Evented behavior - Emits typed events on collection mutations.\n *\n * This module wraps collections to emit events whenever elements are added, removed,\n * or the collection is cleared. This module enables reactive programming patterns.\n *\n * @example\n * const list = compose(\n *   eventedList<number>()\n * )(arrayList<number>())\n *\n * list.on('add', ({ value, index }) => {\n *   console.log(`Added ${value} at index ${index}`)\n * })\n *\n * list.add(42) // Triggers 'add' event\n */\n\nimport type { Middleware } from \"../core/middleware.js\";\nimport type { List } from \"../interfaces/list.js\";\nimport type { Queue, Deque } from \"../interfaces/queue.js\";\nimport type { MapLike } from \"../interfaces/map.js\";\nimport type { Collection } from \"../interfaces/collection.js\";\nimport { Emitter, type Unsubscribe } from \"../core/events.js\";\n\n// ============================================================================\n// Event type definitions\n// ============================================================================\n\n/**\n * Events emitted by List collections.\n */\nexport interface ListEvents<T> {\n  /** Element was added */\n  add: { value: T; index?: number };\n  /** Element was removed */\n  remove: { value: T; index?: number };\n  /** Element was replaced */\n  set: { oldValue: T; newValue: T; index: number };\n  /** Collection was cleared */\n  clear: {};\n  /** Collection was sorted */\n  sort: {};\n  /** Collection was reversed */\n  reverse: {};\n}\n\n/**\n * Events emitted by Queue collections.\n */\nexport interface QueueEvents<T> {\n  /** Element was added to queue */\n  enqueue: { value: T };\n  /** Element was removed from queue */\n  dequeue: { value: T };\n  /** Collection was cleared */\n  clear: {};\n}\n\n/**\n * Events emitted by Deque collections.\n */\nexport interface DequeEvents<T> {\n  /** Element was added to front */\n  addFirst: { value: T };\n  /** Element was added to back */\n  addLast: { value: T };\n  /** Element was removed from front */\n  removeFirst: { value: T };\n  /** Element was removed from back */\n  removeLast: { value: T };\n  /** Collection was cleared */\n  clear: {};\n}\n\n/**\n * Events emitted by Map collections.\n */\nexport interface MapEvents<K, V> {\n  /** Key-value pair was set */\n  set: { key: K; value: V; oldValue?: V };\n  /** Key was deleted */\n  delete: { key: K; value: V };\n  /** Collection was cleared */\n  clear: {};\n}\n\n/**\n * Generic collection events.\n */\nexport interface CollectionEvents<T> {\n  /** Element was added */\n  add: { value: T };\n  /** Element was removed */\n  remove: { value: T };\n  /** Collection was cleared */\n  clear: {};\n}\n\n// ============================================================================\n// Evented middleware implementations\n// ============================================================================\n\n/**\n * This function makes an evented List middleware.\n *\n * This function emits events for add, remove, set, clear, sort, and reverse operations.\n */\nexport function eventedList<T>(): Middleware<\n  List<T>,\n  List<T> & {\n    on<E extends keyof ListEvents<T>>(\n      event: E,\n      listener: (payload: ListEvents<T>[E]) => void\n    ): Unsubscribe;\n  }\n> {\n  return (next: List<T>) => {\n    const emitter = new Emitter<ListEvents<T>>();\n\n    return new Proxy(next, {\n      get(target, prop, receiver) {\n        // Expose event subscription\n        if (prop === \"on\") {\n          return emitter.on.bind(emitter);\n        }\n\n        const value = Reflect.get(target, prop, receiver);\n\n        if (typeof value === \"function\") {\n          switch (prop) {\n            case \"add\":\n            case \"push\":\n              return function (element: T): any {\n                const result = (value as Function).call(target, element);\n                emitter.emit(\"add\", { value: element });\n                return result;\n              };\n\n            case \"unshift\":\n              return function (element: T): void {\n                (value as Function).call(target, element);\n                emitter.emit(\"add\", { value: element, index: 0 });\n              };\n\n            case \"insert\":\n              return function (index: number, element: T): void {\n                (value as Function).call(target, index, element);\n                emitter.emit(\"add\", { value: element, index });\n              };\n\n            case \"set\":\n              return function (index: number, element: T): T {\n                const oldValue = (value as Function).call(target, index, element);\n                emitter.emit(\"set\", { oldValue, newValue: element, index });\n                return oldValue;\n              };\n\n            case \"remove\":\n              return function (element: T): boolean {\n                const result = (value as Function).call(target, element);\n                if (result) {\n                  emitter.emit(\"remove\", { value: element });\n                }\n                return result;\n              };\n\n            case \"removeAt\":\n              return function (index: number): T {\n                const removed = (value as Function).call(target, index);\n                emitter.emit(\"remove\", { value: removed, index });\n                return removed;\n              };\n\n            case \"pop\":\n              return function (): T {\n                const removed = (value as Function).call(target);\n                emitter.emit(\"remove\", { value: removed });\n                return removed;\n              };\n\n            case \"shift\":\n              return function (): T {\n                const removed = (value as Function).call(target);\n                emitter.emit(\"remove\", { value: removed, index: 0 });\n                return removed;\n              };\n\n            case \"clear\":\n              return function (): void {\n                (value as Function).call(target);\n                emitter.emit(\"clear\", {});\n              };\n\n            case \"sort\":\n              return function (...args: any[]): void {\n                (value as Function).apply(target, args);\n                emitter.emit(\"sort\", {});\n              };\n\n            case \"reverse\":\n              return function (): void {\n                (value as Function).call(target);\n                emitter.emit(\"reverse\", {});\n              };\n          }\n        }\n\n        return value;\n      },\n    }) as any;\n  };\n}\n\n/**\n * This function makes an evented Queue middleware.\n */\nexport function eventedQueue<T>(): Middleware<\n  Queue<T>,\n  Queue<T> & {\n    on<E extends keyof QueueEvents<T>>(\n      event: E,\n      listener: (payload: QueueEvents<T>[E]) => void\n    ): Unsubscribe;\n  }\n> {\n  return (next: Queue<T>) => {\n    const emitter = new Emitter<QueueEvents<T>>();\n\n    return new Proxy(next, {\n      get(target, prop, receiver) {\n        if (prop === \"on\") {\n          return emitter.on.bind(emitter);\n        }\n\n        const value = Reflect.get(target, prop, receiver);\n\n        if (typeof value === \"function\") {\n          switch (prop) {\n            case \"offer\":\n            case \"enqueue\":\n            case \"add\":\n              return function (element: T): any {\n                const result = (value as Function).call(target, element);\n                if (result !== false) {\n                  emitter.emit(\"enqueue\", { value: element });\n                }\n                return result;\n              };\n\n            case \"poll\":\n            case \"dequeue\":\n              return function (): T {\n                const removed = (value as Function).call(target);\n                emitter.emit(\"dequeue\", { value: removed });\n                return removed;\n              };\n\n            case \"clear\":\n              return function (): void {\n                (value as Function).call(target);\n                emitter.emit(\"clear\", {});\n              };\n          }\n        }\n\n        return value;\n      },\n    }) as any;\n  };\n}\n\n/**\n * This function makes an evented Deque middleware.\n */\nexport function eventedDeque<T>(): Middleware<\n  Deque<T>,\n  Deque<T> & {\n    on<E extends keyof DequeEvents<T>>(\n      event: E,\n      listener: (payload: DequeEvents<T>[E]) => void\n    ): Unsubscribe;\n  }\n> {\n  return (next: Deque<T>) => {\n    const emitter = new Emitter<DequeEvents<T>>();\n\n    return new Proxy(next, {\n      get(target, prop, receiver) {\n        if (prop === \"on\") {\n          return emitter.on.bind(emitter);\n        }\n\n        const value = Reflect.get(target, prop, receiver);\n\n        if (typeof value === \"function\") {\n          switch (prop) {\n            case \"addFirst\":\n            case \"offerFirst\":\n            case \"push\":\n              return function (element: T): any {\n                const result = (value as Function).call(target, element);\n                emitter.emit(\"addFirst\", { value: element });\n                return result;\n              };\n\n            case \"addLast\":\n            case \"offerLast\":\n            case \"offer\":\n            case \"add\":\n              return function (element: T): any {\n                const result = (value as Function).call(target, element);\n                emitter.emit(\"addLast\", { value: element });\n                return result;\n              };\n\n            case \"removeFirst\":\n            case \"pollFirst\":\n            case \"poll\":\n            case \"dequeue\":\n              return function (): T {\n                const removed = (value as Function).call(target);\n                if (removed !== undefined) {\n                  emitter.emit(\"removeFirst\", { value: removed });\n                }\n                return removed;\n              };\n\n            case \"removeLast\":\n            case \"pollLast\":\n            case \"pop\":\n              return function (): T {\n                const removed = (value as Function).call(target);\n                if (removed !== undefined) {\n                  emitter.emit(\"removeLast\", { value: removed });\n                }\n                return removed;\n              };\n\n            case \"clear\":\n              return function (): void {\n                (value as Function).call(target);\n                emitter.emit(\"clear\", {});\n              };\n          }\n        }\n\n        return value;\n      },\n    }) as any;\n  };\n}\n\n/**\n * This function makes an evented Map middleware.\n */\nexport function eventedMap<K, V>(): Middleware<\n  MapLike<K, V>,\n  MapLike<K, V> & {\n    on<E extends keyof MapEvents<K, V>>(\n      event: E,\n      listener: (payload: MapEvents<K, V>[E]) => void\n    ): Unsubscribe;\n  }\n> {\n  return (next: MapLike<K, V>) => {\n    const emitter = new Emitter<MapEvents<K, V>>();\n\n    return new Proxy(next, {\n      get(target, prop, receiver) {\n        if (prop === \"on\") {\n          return emitter.on.bind(emitter);\n        }\n\n        const value = Reflect.get(target, prop, receiver);\n\n        if (typeof value === \"function\") {\n          switch (prop) {\n            case \"set\":\n              return function (key: K, val: V): V | undefined {\n                const oldValue = (value as Function).call(target, key, val);\n                emitter.emit(\"set\", { key, value: val, oldValue });\n                return oldValue;\n              };\n\n            case \"delete\":\n              return function (key: K): V | undefined {\n                const deletedValue = (value as Function).call(target, key);\n                if (deletedValue !== undefined) {\n                  emitter.emit(\"delete\", { key, value: deletedValue });\n                }\n                return deletedValue;\n              };\n\n            case \"clear\":\n              return function (): void {\n                (value as Function).call(target);\n                emitter.emit(\"clear\", {});\n              };\n          }\n        }\n\n        return value;\n      },\n    }) as any;\n  };\n}\n\n/**\n * Generic evented collection middleware.\n */\nexport function evented<T>(): Middleware<\n  Collection<T>,\n  Collection<T> & {\n    on<E extends keyof CollectionEvents<T>>(\n      event: E,\n      listener: (payload: CollectionEvents<T>[E]) => void\n    ): Unsubscribe;\n  }\n> {\n  return (next: Collection<T>) => {\n    const emitter = new Emitter<CollectionEvents<T>>();\n\n    return new Proxy(next, {\n      get(target, prop, receiver) {\n        if (prop === \"on\") {\n          return emitter.on.bind(emitter);\n        }\n\n        const value = Reflect.get(target, prop, receiver);\n\n        if (typeof value === \"function\") {\n          switch (prop) {\n            case \"add\":\n              return function (element: T): boolean {\n                const result = (value as Function).call(target, element);\n                if (result) {\n                  emitter.emit(\"add\", { value: element });\n                }\n                return result;\n              };\n\n            case \"remove\":\n              return function (element: T): boolean {\n                const result = (value as Function).call(target, element);\n                if (result) {\n                  emitter.emit(\"remove\", { value: element });\n                }\n                return result;\n              };\n\n            case \"clear\":\n              return function (): void {\n                (value as Function).call(target);\n                emitter.emit(\"clear\", {});\n              };\n          }\n        }\n\n        return value;\n      },\n    }) as any;\n  };\n}\n","/**\n * Synchronized behavior - Gives thread-safe access with mutex locking.\n *\n * This module wraps collections to serialize all operations using a mutex, making sure that\n * thread-safe access in concurrent environments. Mirrors Java's\n * Collections.synchronizedList() and related methods.\n *\n * Note: JavaScript is single-threaded, but async operations can interleave.\n * This middleware makes sure that atomic operations across async boundaries.\n *\n * @example\n * const list = compose(\n *   synchronized()\n * )(arrayList<number>())\n *\n * // All operations are now serialized\n * await Promise.all([\n *   list.add(1),\n *   list.add(2),\n *   list.add(3)\n * ])\n */\n\nimport type { Middleware } from \"../core/middleware.js\";\n\n/**\n * Simple mutex implementation for JavaScript async operations.\n *\n * This middleware makes sure that only one operation starts at a time, even if\n * multiple async operations are started concurrently.\n */\n/** True for an `async` function or method. */\nfunction isAsyncFunction(value: unknown): boolean {\n  return typeof value === \"function\" && (value as { [Symbol.toStringTag]?: string })[Symbol.toStringTag] === \"AsyncFunction\";\n}\n\nclass Mutex {\n  private queue: Promise<void> = Promise.resolve();\n\n  /**\n   * This method acquires the lock and starts the function.\n   * Other operations wait until this completes.\n   */\n  async lock<T>(fn: () => T | Promise<T>): Promise<T> {\n    const run = this.queue.then(() => fn());\n    this.queue = run.then(\n      () => undefined,\n      () => undefined\n    );\n    return run;\n  }\n\n  /**\n   * Synchronous version that starts immediately.\n   * Still queues to prevent interleaving with async operations.\n   */\n\n}\n\n/**\n * This function makes a synchronized middleware that locks all method calls.\n *\n * Every method call on the collection is wrapped with a mutex,\n * making sure that atomic execution even in concurrent async scenarios.\n *\n * @example\n * const syncList = compose(\n *   synchronized()\n * )(arrayList<number>())\n *\n * // These additions are guaranteed to execute in order\n * await Promise.all([\n *   syncList.add(1),\n *   syncList.add(2),\n *   syncList.add(3)\n * ])\n */\nexport function synchronized<C extends object>(): Middleware<C> {\n  return (next: C): C => {\n    const mutex = new Mutex();\n\n    return new Proxy(next, {\n      get(target, prop, receiver) {\n        const value = Reflect.get(target, prop, receiver);\n\n        // Don't wrap non-functions\n        if (typeof value !== \"function\") {\n          return value;\n        }\n\n        // An async method runs inside the lock: it starts after the earlier async calls end.\n        // (Before, every method ran first and took the lock after, so nothing was excluded:\n        // BUGS-2026-07 L11.) A plain method runs at once: JavaScript does not interrupt it.\n        // When a plain method returns a promise anyway, the lock waits for that promise.\n        if (isAsyncFunction(value)) {\n          return function (this: unknown, ...args: unknown[]) {\n            return mutex.lock(() => (value as Function).apply(target, args));\n          };\n        }\n        return function (this: unknown, ...args: unknown[]) {\n          const result = (value as Function).apply(target, args);\n          if (result instanceof Promise) {\n            return mutex.lock(() => result);\n          }\n          return result;\n        };\n      },\n    }) as C;\n  };\n}\n\n/**\n * Alias for Java compatibility: synchronizedList\n */\nexport const synchronizedList : typeof synchronized = synchronized;\n\n/**\n * Alias for Java compatibility: synchronizedMap\n */\nexport const synchronizedMap : typeof synchronized = synchronized;\n\n/**\n * Alias for Java compatibility: synchronizedCollection\n */\nexport const synchronizedCollection : typeof synchronized = synchronized;\n\n/**\n * Alias for Java compatibility: synchronizedSet\n */\nexport const synchronizedSet : typeof synchronized = synchronized;\n\n/**\n * Advanced synchronized middleware with reentrant locking.\n *\n * With this function, the same \"thread\" (async context) can acquire the lock multiple times.\n * Useful for methods that call other synchronized methods internally.\n *\n * Note: JavaScript has no true thread IDs. This function uses async context\n * tracking if available. If not, the behavior is non-reentrant.\n */\nexport function reentrantSynchronized<C extends object>(): Middleware<C> {\n  return (next: C): C => {\n    const mutex = new Mutex();\n    let lockHolder: symbol | null = null;\n    let lockCount = 0;\n\n    return new Proxy(next, {\n      get(target, prop, receiver) {\n        const value = Reflect.get(target, prop, receiver);\n\n        if (typeof value !== \"function\") {\n          return value;\n        }\n\n        return async function (this: any, ...args: any[]) {\n          // Generate a unique ID for this call context\n          const callerId = Symbol(\"caller\");\n\n          // If we already hold the lock, execute directly (reentrant)\n          if (lockHolder === callerId) {\n            lockCount++;\n            try {\n              const result = (value as Function).apply(target, args);\n              return result instanceof Promise ? await result : result;\n            } finally {\n              lockCount--;\n            }\n          }\n\n          // Otherwise, acquire the lock\n          return mutex.lock(async () => {\n            lockHolder = callerId;\n            lockCount = 1;\n            try {\n              const result = (value as Function).apply(target, args);\n              return result instanceof Promise ? await result : result;\n            } finally {\n              lockCount--;\n              if (lockCount === 0) {\n                lockHolder = null;\n              }\n            }\n          });\n        };\n      },\n    }) as C;\n  };\n}\n\n/**\n * Read-write lock implementation for collections.\n *\n * With this function, multiple concurrent readers can read, but a writer is exclusive.\n * More efficient than full synchronization for read-heavy workloads.\n *\n * @example\n * const list = compose(\n *   readWriteLock()\n * )(arrayList<number>())\n *\n * // Multiple reads can happen concurrently\n * await Promise.all([\n *   list.get(0),\n *   list.get(1),\n *   list.get(2)\n * ])\n */\nexport function readWriteLock<C extends object>(): Middleware<C> {\n  return (next: C): C => {\n    let readers = 0;\n    let writer = false;\n    let waitingReaders: (() => void)[] = [];\n    let waitingWriters: (() => void)[] = [];\n\n    // Hand-off rule: the releaser counts the waiters it wakes (readers += n, or writer = true),\n    // so a woken waiter does not count itself again. (Before, releaseWrite set readers = n and\n    // each woken reader added 1, so the count never came back to 0 and writers waited forever:\n    // BUGS-2026-07 L11.)\n    const acquireRead = async (): Promise<void> => {\n      if (writer || waitingWriters.length > 0) {\n        await new Promise<void>((resolve) => waitingReaders.push(resolve));\n        return;\n      }\n      readers++;\n    };\n\n    const releaseRead = (): void => {\n      readers--;\n      if (readers === 0 && waitingWriters.length > 0) {\n        writer = true;\n        const next = waitingWriters.shift()!;\n        next();\n      }\n    };\n\n    const acquireWrite = async (): Promise<void> => {\n      if (writer || readers > 0) {\n        await new Promise<void>((resolve) => waitingWriters.push(resolve));\n        return;\n      }\n      writer = true;\n    };\n\n    const releaseWrite = (): void => {\n      writer = false;\n      if (waitingWriters.length > 0) {\n        writer = true;\n        const next = waitingWriters.shift()!;\n        next();\n      } else if (waitingReaders.length > 0) {\n        const allReaders = waitingReaders.splice(0);\n        readers += allReaders.length;\n        allReaders.forEach((resolve) => resolve());\n      }\n    };\n\n    // Methods that only read (don't mutate)\n    const READ_METHODS = new Set([\n      \"get\",\n      \"has\",\n      \"contains\",\n      \"containsAll\",\n      \"containsValue\",\n      \"indexOf\",\n      \"lastIndexOf\",\n      \"peek\",\n      \"peekFirst\",\n      \"peekLast\",\n      \"first\",\n      \"last\",\n      \"isEmpty\",\n      \"size\",\n      \"toArray\",\n      \"keys\",\n      \"values\",\n      \"entries\",\n      \"forEach\",\n      \"getOrDefault\",\n      \"getOrUndefined\",\n    ]);\n\n    return new Proxy(next, {\n      get(target, prop, receiver) {\n        const value = Reflect.get(target, prop, receiver);\n\n        if (typeof value !== \"function\") {\n          return value;\n        }\n\n        const isReadMethod = typeof prop === \"string\" && READ_METHODS.has(prop);\n\n        return async function (this: any, ...args: any[]) {\n          if (isReadMethod) {\n            // Acquire read lock\n            await acquireRead();\n            try {\n              const result = (value as Function).apply(target, args);\n              return result instanceof Promise ? await result : result;\n            } finally {\n              releaseRead();\n            }\n          } else {\n            // Acquire write lock\n            await acquireWrite();\n            try {\n              const result = (value as Function).apply(target, args);\n              return result instanceof Promise ? await result : result;\n            } finally {\n              releaseWrite();\n            }\n          }\n        };\n      },\n    }) as C;\n  };\n}\n","/**\n * Composite map methods built on `has`, `get`, `set` and `delete`.\n *\n * A map behavior (lruMap, ttlMap) intercepts the primitive methods. It gives these\n * implementations for the composite methods, bound to the behavior's own proxy.\n * Thus a call like `setIfAbsent` goes through the behavior's `set` and keeps its rules:\n * capacity and recency for LRU, expiry for TTL. (BUGS-2026-07 L13: the composite methods\n * went straight to the map below, so they bypassed the behavior.)\n *\n * The semantics follow HashMap. One difference: `replaceEntry` and `deleteEntry` compare\n * values with Object.is, not with a map's custom value equality.\n */\n\nimport type { Entry, MapLike } from \"../interfaces/map.js\";\n\ntype AnyFn = (...args: never[]) => unknown;\n\nexport function compositeMapMethod<K, V>(map: MapLike<K, V>, name: PropertyKey): AnyFn | undefined {\n  switch (name) {\n    case \"setIfAbsent\":\n      return ((key: K, value: V): V => {\n        if (map.has(key)) return map.get(key);\n        map.set(key, value);\n        return value;\n      }) as AnyFn;\n\n    case \"replace\":\n      return ((key: K, value: V): V | undefined => (map.has(key) ? map.set(key, value) : undefined)) as AnyFn;\n\n    case \"replaceEntry\":\n      return ((key: K, oldValue: V, newValue: V): boolean => {\n        if (!map.has(key) || !Object.is(map.get(key), oldValue)) return false;\n        map.set(key, newValue);\n        return true;\n      }) as AnyFn;\n\n    case \"deleteEntry\":\n      return ((key: K, value: V): boolean => {\n        if (!map.has(key) || !Object.is(map.get(key), value)) return false;\n        map.delete(key);\n        return true;\n      }) as AnyFn;\n\n    case \"computeIfAbsent\":\n      return ((key: K, mappingFunction: (key: K) => V): V => {\n        if (map.has(key)) return map.get(key);\n        const value = mappingFunction(key);\n        map.set(key, value);\n        return value;\n      }) as AnyFn;\n\n    case \"computeIfPresent\":\n      return ((key: K, remapping: (key: K, value: V) => V | undefined): V | undefined => {\n        if (!map.has(key)) return undefined;\n        const value = remapping(key, map.get(key));\n        if (value === undefined) {\n          map.delete(key);\n          return undefined;\n        }\n        map.set(key, value);\n        return value;\n      }) as AnyFn;\n\n    case \"compute\":\n      return ((key: K, remapping: (key: K, value: V | undefined) => V | undefined): V | undefined => {\n        const present = map.has(key);\n        const value = remapping(key, present ? map.get(key) : undefined);\n        if (value === undefined) {\n          if (present) map.delete(key);\n          return undefined;\n        }\n        map.set(key, value);\n        return value;\n      }) as AnyFn;\n\n    case \"merge\":\n      return ((key: K, value: V, remapping: (oldValue: V, newValue: V) => V | undefined): V | undefined => {\n        if (!map.has(key)) {\n          map.set(key, value);\n          return value;\n        }\n        const merged = remapping(map.get(key), value);\n        if (merged === undefined) {\n          map.delete(key);\n          return undefined;\n        }\n        map.set(key, merged);\n        return merged;\n      }) as AnyFn;\n\n    case \"putAll\":\n      return ((other: Iterable<Entry<K, V>>): void => {\n        for (const entry of other) {\n          map.set(entry.key, entry.value);\n        }\n      }) as AnyFn;\n  }\n  return undefined;\n}\n","/**\n * LRU (Least Recently Used) eviction behavior.\n *\n * This module tracks access times and automatically evicts the least recently used\n * elements when capacity is reached. Perfect for caching.\n *\n * @example\n * const cache = compose(\n *   lruMap<string, Data>({ capacity: 100 })\n * )(hashMap<string, Data>())\n *\n * cache.set('key1', data1) // Accessed\n * cache.get('key1')        // Accessed again (moves to front)\n * // When full, least recently accessed keys are evicted\n */\n\nimport type { Middleware } from \"../core/middleware.js\";\nimport type { MapLike } from \"../interfaces/map.js\";\nimport { compositeMapMethod } from \"./composite.js\";\n\n/**\n * Options for LRU behavior.\n */\nexport interface LRUOptions {\n  /**\n   * Maximum capacity. When exceeded, least recently used items are evicted.\n   */\n  capacity: number;\n\n  /**\n   * Optional callback invoked when an item is evicted.\n   */\n  onEvict?: (info: { key: any; value: any; timestamp: number }) => void;\n}\n\n/**\n * Metadata for tracking LRU access.\n */\ninterface LRUNode<K, V> {\n  key: K;\n  value: V;\n  lastAccessed: number;\n  prev: LRUNode<K, V> | null;\n  next: LRUNode<K, V> | null;\n}\n\n/**\n * This function makes an LRU Map middleware.\n *\n * This function maintains a doubly-linked list to track access order.\n * Most recently accessed items are at the head.\n * When capacity is exceeded, items at the tail are evicted.\n */\nexport function lruMap<K, V>(\n  options: LRUOptions\n): Middleware<MapLike<K, V>, MapLike<K, V> & { readonly isFull: boolean }> {\n  const { capacity, onEvict } = options;\n\n  return (next: MapLike<K, V>): MapLike<K, V> & { readonly isFull: boolean } => {\n    // Doubly-linked list for LRU tracking\n    let head: LRUNode<K, V> | null = null;\n    let tail: LRUNode<K, V> | null = null;\n    const nodeMap = new Map<K, LRUNode<K, V>>();\n\n    const moveToHead = (node: LRUNode<K, V>): void => {\n      // Remove from current position\n      if (node.prev) {\n        node.prev.next = node.next;\n      } else {\n        head = node.next;\n      }\n\n      if (node.next) {\n        node.next.prev = node.prev;\n      } else {\n        tail = node.prev;\n      }\n\n      // Add to head\n      node.prev = null;\n      node.next = head;\n      if (head) {\n        head.prev = node;\n      }\n      head = node;\n\n      if (!tail) {\n        tail = node;\n      }\n\n      node.lastAccessed = Date.now();\n    };\n\n    const addNode = (key: K, value: V): void => {\n      const node: LRUNode<K, V> = {\n        key,\n        value,\n        lastAccessed: Date.now(),\n        prev: null,\n        next: head,\n      };\n\n      if (head) {\n        head.prev = node;\n      }\n      head = node;\n\n      if (!tail) {\n        tail = node;\n      }\n\n      nodeMap.set(key, node);\n    };\n\n    const removeNode = (node: LRUNode<K, V>): void => {\n      if (node.prev) {\n        node.prev.next = node.next;\n      } else {\n        head = node.next;\n      }\n\n      if (node.next) {\n        node.next.prev = node.prev;\n      } else {\n        tail = node.prev;\n      }\n\n      nodeMap.delete(node.key);\n    };\n\n    // A layer below this one (for example ttlMap, in compose(lruMap, ttlMap)) can remove an\n    // entry without this layer seeing it. Its node is then stale: the list must not keep it\n    // (it holds the value, and it would grow without bound) and evicting it is not an eviction.\n    const dropStaleNodes = (): void => {\n      for (const node of [...nodeMap.values()]) {\n        if (!next.has(node.key)) {\n          removeNode(node);\n        }\n      }\n    };\n\n    const evictLRU = (): void => {\n      while (tail) {\n        const candidate = tail;\n        removeNode(candidate);\n        if (!next.has(candidate.key)) {\n          // Already removed below: skip it and evict the next least recently used entry\n          continue;\n        }\n        next.delete(candidate.key);\n\n        if (onEvict) {\n          onEvict({\n            key: candidate.key,\n            value: candidate.value,\n            timestamp: candidate.lastAccessed,\n          });\n        }\n        return;\n      }\n    };\n\n    return new Proxy(next, {\n      get(target, prop, receiver) {\n        // Add isFull property\n        if (prop === \"isFull\") {\n          return target.size >= capacity;\n        }\n\n        // Composite methods (setIfAbsent, compute, merge, putAll and others) go through this\n        // proxy's own primitives, so they keep this behavior's rules (BUGS-2026-07 L13)\n        const composite = compositeMapMethod(receiver as MapLike<K, V>, prop);\n        if (composite) {\n          return composite;\n        }\n\n        const value = Reflect.get(target, prop, receiver);\n\n        if (typeof value === \"function\") {\n          switch (prop) {\n            case \"get\":\n              return function (key: K): V {\n                let result: V;\n                try {\n                  result = (value as Function).call(target, key);\n                } catch (error) {\n                  // The entry is gone below (for example expired): forget its node\n                  const stale = nodeMap.get(key);\n                  if (stale) {\n                    removeNode(stale);\n                  }\n                  throw error;\n                }\n                // Update access time\n                const node = nodeMap.get(key);\n                if (node) {\n                  moveToHead(node);\n                }\n                return result;\n              };\n\n            case \"has\":\n              return function (key: K): boolean {\n                const result = (value as Function).call(target, key);\n                const node = nodeMap.get(key);\n                if (node) {\n                  if (result) {\n                    // Update access time\n                    moveToHead(node);\n                  } else {\n                    // The entry is gone below (for example expired): forget its node\n                    removeNode(node);\n                  }\n                }\n                return result;\n              };\n\n            case \"set\":\n              return function (key: K, val: V): V | undefined {\n                const hadKey = target.has(key);\n\n                if (hadKey) {\n                  // Update existing\n                  const oldValue = (value as Function).call(target, key, val);\n                  const node = nodeMap.get(key);\n                  if (node) {\n                    node.value = val;\n                    moveToHead(node);\n                  }\n                  return oldValue;\n                } else {\n                  // Add new. A stale node for this key (its entry was removed below) must not\n                  // stay in the list: evicting it later would delete the new node's map entry.\n                  const stale = nodeMap.get(key);\n                  if (stale) {\n                    removeNode(stale);\n                  }\n                  // Keep the node list bounded: when it reaches capacity, drop stale nodes first\n                  if (nodeMap.size >= capacity) {\n                    dropStaleNodes();\n                  }\n                  if (target.size >= capacity) {\n                    evictLRU();\n                  }\n                  const result = (value as Function).call(target, key, val);\n                  addNode(key, val);\n                  return result;\n                }\n              };\n\n            case \"delete\":\n              return function (key: K): V | undefined {\n                const result = (value as Function).call(target, key);\n                const node = nodeMap.get(key);\n                if (node) {\n                  removeNode(node);\n                }\n                return result;\n              };\n\n            case \"clear\":\n              return function (): void {\n                (value as Function).call(target);\n                head = null;\n                tail = null;\n                nodeMap.clear();\n              };\n          }\n        }\n\n        return value;\n      },\n    }) as MapLike<K, V> & { readonly isFull: boolean };\n  };\n}\n\n/**\n * This class makes an LRU cache with a simpler API.\n * This is a standalone LRU cache implementation.\n *\n * @example\n * const cache = lruCache<string, Data>(100)\n * cache.set('key', value)\n * cache.get('key') // Moves to front\n */\nexport class LRUCache<K, V> {\n  private readonly capacity: number;\n  private readonly onEvict: ((key: K, value: V) => void) | undefined;\n  private map: Map<K, { value: V; node: LRUNode<K, V> }> = new Map();\n  private head: LRUNode<K, V> | null = null;\n  private tail: LRUNode<K, V> | null = null;\n\n  constructor(capacity: number, onEvict?: ((key: K, value: V) => void) | undefined) {\n    this.capacity = capacity;\n    this.onEvict = onEvict;\n  }\n\n  get size(): number {\n    return this.map.size;\n  }\n\n  get isFull(): boolean {\n    return this.map.size >= this.capacity;\n  }\n\n  get(key: K): V | undefined {\n    const entry = this.map.get(key);\n    if (!entry) return undefined;\n\n    this.moveToHead(entry.node);\n    return entry.value;\n  }\n\n  set(key: K, value: V): void {\n    const entry = this.map.get(key);\n\n    if (entry) {\n      // Update existing\n      entry.value = value;\n      entry.node.value = value;\n      this.moveToHead(entry.node);\n    } else {\n      // Add new\n      if (this.map.size >= this.capacity) {\n        this.evictLRU();\n      }\n\n      const node: LRUNode<K, V> = {\n        key,\n        value,\n        lastAccessed: Date.now(),\n        prev: null,\n        next: this.head,\n      };\n\n      if (this.head) {\n        this.head.prev = node;\n      }\n      this.head = node;\n\n      if (!this.tail) {\n        this.tail = node;\n      }\n\n      this.map.set(key, { value, node });\n    }\n  }\n\n  has(key: K): boolean {\n    return this.map.has(key);\n  }\n\n  delete(key: K): boolean {\n    const entry = this.map.get(key);\n    if (!entry) return false;\n\n    this.removeNode(entry.node);\n    this.map.delete(key);\n    return true;\n  }\n\n  clear(): void {\n    this.map.clear();\n    this.head = null;\n    this.tail = null;\n  }\n\n  private moveToHead(node: LRUNode<K, V>): void {\n    if (node === this.head) return;\n\n    // Remove from current position\n    if (node.prev) {\n      node.prev.next = node.next;\n    }\n    if (node.next) {\n      node.next.prev = node.prev;\n    } else {\n      this.tail = node.prev;\n    }\n\n    // Add to head\n    node.prev = null;\n    node.next = this.head;\n    if (this.head) {\n      this.head.prev = node;\n    }\n    this.head = node;\n\n    node.lastAccessed = Date.now();\n  }\n\n  private removeNode(node: LRUNode<K, V>): void {\n    if (node.prev) {\n      node.prev.next = node.next;\n    } else {\n      this.head = node.next;\n    }\n\n    if (node.next) {\n      node.next.prev = node.prev;\n    } else {\n      this.tail = node.prev;\n    }\n  }\n\n  private evictLRU(): void {\n    if (!this.tail) return;\n\n    const evicted = this.tail;\n    this.removeNode(evicted);\n    this.map.delete(evicted.key);\n\n    if (this.onEvict) {\n      this.onEvict(evicted.key, evicted.value);\n    }\n  }\n\n  /**\n   * This method gives keys in LRU order (most recent first).\n   */\n  *keys(): IterableIterator<K> {\n    let node = this.head;\n    while (node) {\n      yield node.key;\n      node = node.next;\n    }\n  }\n\n  /**\n   * This method gives entries in LRU order (most recent first).\n   */\n  *entries(): IterableIterator<[K, V]> {\n    let node = this.head;\n    while (node) {\n      yield [node.key, node.value];\n      node = node.next;\n    }\n  }\n}\n\n/**\n * Factory function to make an LRU cache.\n */\nexport function lruCache<K, V>(\n  capacity: number,\n  onEvict?: (key: K, value: V) => void\n): LRUCache<K, V> {\n  return new LRUCache(capacity, onEvict);\n}\n","/**\n * TTL (Time-To-Live) expiration behavior.\n *\n * Automatically expires elements after a specified time period.\n * Perfect for temporary caches and time-limited data.\n *\n * @example\n * const cache = compose(\n *   ttlMap<string, Data>({ ttl: 60000 }) // 60 seconds\n * )(hashMap<string, Data>())\n *\n * cache.set('key', data)\n * // After 60 seconds, 'key' is automatically removed\n */\n\nimport type { Middleware } from \"../core/middleware.js\";\nimport type { MapLike } from \"../interfaces/map.js\";\nimport { compositeMapMethod } from \"./composite.js\";\nimport type { Collection } from \"../interfaces/collection.js\";\n\n/**\n * Start the background expiration checker without keeping a Node.js process alive.\n * (In a browser, setInterval gives a number and there is nothing to unref.)\n */\nfunction startExpirationTimer(check: () => void, interval: number): ReturnType<typeof setInterval> {\n  const timer = setInterval(check, interval);\n  (timer as unknown as { unref?: () => void }).unref?.();\n  return timer;\n}\n\n/**\n * Options for TTL behavior.\n */\nexport interface TTLOptions {\n  /**\n   * Time-to-live in milliseconds.\n   * Elements expire after this duration.\n   */\n  ttl: number;\n\n  /**\n   * Interval for checking expired elements (in milliseconds).\n   * @default 1000 (check every second)\n   */\n  checkInterval?: number;\n\n  /**\n   * Optional callback invoked when an element expires.\n   */\n  onExpire?: (info: { key: any; value: any; createdAt: number; expiredAt: number }) => void;\n}\n\n/**\n * Metadata for TTL tracking.\n */\ninterface TTLEntry<V> {\n  value: V;\n  expiresAt: number;\n  createdAt: number;\n}\n\n/**\n * This function makes a TTL Map middleware.\n *\n * Automatically removes entries after TTL expires.\n * This function uses a background interval to check for expired entries.\n */\nexport function ttlMap<K, V>(\n  options: TTLOptions\n): Middleware<MapLike<K, V>, MapLike<K, V> & { readonly dispose: () => void }> {\n  const { ttl, checkInterval = 1000, onExpire } = options;\n\n  return (\n    next: MapLike<K, V>\n  ): MapLike<K, V> & { readonly dispose: () => void } => {\n    const metadata = new Map<K, TTLEntry<V>>();\n    let intervalId: ReturnType<typeof setInterval> | null = null;\n\n    const checkExpired = (): void => {\n      const now = Date.now();\n      const expired: K[] = [];\n\n      for (const [key, entry] of metadata) {\n        if (now >= entry.expiresAt) {\n          expired.push(key);\n        }\n      }\n\n      for (const key of expired) {\n        const entry = metadata.get(key);\n        if (entry) {\n          next.delete(key);\n          metadata.delete(key);\n\n          if (onExpire) {\n            onExpire({\n              key,\n              value: entry.value,\n              createdAt: entry.createdAt,\n              expiredAt: now,\n            });\n          }\n        }\n      }\n    };\n\n    // Start background expiration checker\n    intervalId = startExpirationTimer(checkExpired, checkInterval);\n\n    const dispose = (): void => {\n      if (intervalId) {\n        clearInterval(intervalId);\n        intervalId = null;\n      }\n    };\n\n    return new Proxy(next, {\n      get(target, prop, receiver) {\n        // Add dispose method\n        if (prop === \"dispose\") {\n          return dispose;\n        }\n\n        // Composite methods (setIfAbsent, compute, merge, putAll and others) go through this\n        // proxy's own primitives, so they keep the expiry rules (BUGS-2026-07 L13)\n        const composite = compositeMapMethod(receiver as MapLike<K, V>, prop);\n        if (composite) {\n          return composite;\n        }\n\n        const value = Reflect.get(target, prop, receiver);\n\n        if (typeof value === \"function\") {\n          switch (prop) {\n            case \"get\":\n              return function (key: K): V {\n                // Check if expired before returning\n                const entry = metadata.get(key);\n                if (entry && Date.now() >= entry.expiresAt) {\n                  target.delete(key);\n                  metadata.delete(key);\n                  throw new Error(`Key expired: ${key}`);\n                }\n                return (value as Function).call(target, key);\n              };\n\n            case \"has\":\n              return function (key: K): boolean {\n                // Check if expired\n                const entry = metadata.get(key);\n                if (entry && Date.now() >= entry.expiresAt) {\n                  target.delete(key);\n                  metadata.delete(key);\n                  return false;\n                }\n                return (value as Function).call(target, key);\n              };\n\n            case \"set\":\n              return function (key: K, val: V): V | undefined {\n                const now = Date.now();\n                const result = (value as Function).call(target, key, val);\n\n                metadata.set(key, {\n                  value: val,\n                  expiresAt: now + ttl,\n                  createdAt: now,\n                });\n\n                return result;\n              };\n\n            case \"delete\":\n              return function (key: K): V | undefined {\n                const result = (value as Function).call(target, key);\n                metadata.delete(key);\n                return result;\n              };\n\n            case \"clear\":\n              return function (): void {\n                (value as Function).call(target);\n                metadata.clear();\n              };\n          }\n        }\n\n        return value;\n      },\n    }) as MapLike<K, V> & { readonly dispose: () => void };\n  };\n}\n\n/**\n * This function makes a TTL Collection middleware.\n *\n * Note: This is less precise than TTL map because collections don't have keys.\n * Elements are tracked by reference, which can fail for primitive types.\n */\nexport function ttlCollection<T>(\n  options: Omit<TTLOptions, \"onExpire\"> & {\n    onExpire?: (info: { element: T; createdAt: number; expiredAt: number }) => void;\n  }\n): Middleware<Collection<T>, Collection<T> & { readonly dispose: () => void }> {\n  const { ttl, checkInterval = 1000, onExpire } = options;\n\n  return (\n    next: Collection<T>\n  ): Collection<T> & { readonly dispose: () => void } => {\n    const metadata = new Map<T, { expiresAt: number; createdAt: number }>();\n    let intervalId: ReturnType<typeof setInterval> | null = null;\n\n    const checkExpired = (): void => {\n      const now = Date.now();\n      const expired: T[] = [];\n\n      for (const [element, entry] of metadata) {\n        if (now >= entry.expiresAt) {\n          expired.push(element);\n        }\n      }\n\n      for (const element of expired) {\n        const entry = metadata.get(element);\n        if (entry) {\n          next.remove(element);\n          metadata.delete(element);\n\n          if (onExpire) {\n            onExpire({\n              element,\n              createdAt: entry.createdAt,\n              expiredAt: now,\n            });\n          }\n        }\n      }\n    };\n\n    intervalId = startExpirationTimer(checkExpired, checkInterval);\n\n    const dispose = (): void => {\n      if (intervalId) {\n        clearInterval(intervalId);\n        intervalId = null;\n      }\n    };\n\n    return new Proxy(next, {\n      get(target, prop, receiver) {\n        if (prop === \"dispose\") {\n          return dispose;\n        }\n\n        const value = Reflect.get(target, prop, receiver);\n\n        if (typeof value === \"function\") {\n          switch (prop) {\n            case \"add\":\n              return function (element: T): boolean {\n                const result = (value as Function).call(target, element);\n                if (result) {\n                  const now = Date.now();\n                  metadata.set(element, {\n                    expiresAt: now + ttl,\n                    createdAt: now,\n                  });\n                }\n                return result;\n              };\n\n            case \"remove\":\n              return function (element: T): boolean {\n                const result = (value as Function).call(target, element);\n                if (result) {\n                  metadata.delete(element);\n                }\n                return result;\n              };\n\n            case \"clear\":\n              return function (): void {\n                (value as Function).call(target);\n                metadata.clear();\n              };\n          }\n        }\n\n        return value;\n      },\n    }) as Collection<T> & { readonly dispose: () => void };\n  };\n}\n\n/**\n * Standalone TTL cache with Map-like API.\n *\n * @example\n * const cache = new TTLCache<string, number>(60000) // 60 second TTL\n * cache.set('key', 42)\n * setTimeout(() => {\n *   cache.get('key') // undefined (expired)\n * }, 61000)\n */\nexport class TTLCache<K, V> {\n  private readonly ttl: number;\n  private readonly checkInterval: number;\n  private readonly onExpire: ((key: K, value: V) => void) | undefined;\n  private map = new Map<K, TTLEntry<V>>();\n  private intervalId: ReturnType<typeof setInterval> | null = null;\n\n  constructor(ttl: number, checkInterval: number = 1000, onExpire?: ((key: K, value: V) => void) | undefined) {\n    this.ttl = ttl;\n    this.checkInterval = checkInterval;\n    this.onExpire = onExpire;\n    this.startExpirationCheck();\n  }\n\n  get size(): number {\n    this.cleanup();\n    return this.map.size;\n  }\n\n  get(key: K): V | undefined {\n    const entry = this.map.get(key);\n    if (!entry) return undefined;\n\n    if (Date.now() >= entry.expiresAt) {\n      this.map.delete(key);\n      if (this.onExpire) {\n        this.onExpire(key, entry.value);\n      }\n      return undefined;\n    }\n\n    return entry.value;\n  }\n\n  set(key: K, value: V, customTTL?: number): void {\n    const now = Date.now();\n    const ttlToUse = customTTL !== undefined ? customTTL : this.ttl;\n\n    this.map.set(key, {\n      value,\n      expiresAt: now + ttlToUse,\n      createdAt: now,\n    });\n  }\n\n  has(key: K): boolean {\n    return this.get(key) !== undefined;\n  }\n\n  delete(key: K): boolean {\n    return this.map.delete(key);\n  }\n\n  clear(): void {\n    this.map.clear();\n  }\n\n  /**\n   * Manually trigger cleanup of expired entries.\n   */\n  cleanup(): void {\n    const now = Date.now();\n    const expired: K[] = [];\n\n    for (const [key, entry] of this.map) {\n      if (now >= entry.expiresAt) {\n        expired.push(key);\n      }\n    }\n\n    for (const key of expired) {\n      const entry = this.map.get(key);\n      if (entry) {\n        this.map.delete(key);\n        if (this.onExpire) {\n          this.onExpire(key, entry.value);\n        }\n      }\n    }\n  }\n\n  /**\n   * Get remaining TTL for a key in milliseconds.\n   * This method gives undefined if key doesn't exist or is expired.\n   */\n  getTTL(key: K): number | undefined {\n    const entry = this.map.get(key);\n    if (!entry) return undefined;\n\n    const remaining = entry.expiresAt - Date.now();\n    return remaining > 0 ? remaining : undefined;\n  }\n\n  /**\n   * Update TTL for an existing key.\n   */\n  touch(key: K, customTTL?: number): boolean {\n    const entry = this.map.get(key);\n    if (!entry) return false;\n\n    if (Date.now() >= entry.expiresAt) {\n      this.map.delete(key);\n      return false;\n    }\n\n    const ttlToUse = customTTL !== undefined ? customTTL : this.ttl;\n    entry.expiresAt = Date.now() + ttlToUse;\n    return true;\n  }\n\n  private startExpirationCheck(): void {\n    this.intervalId = startExpirationTimer(() => this.cleanup(), this.checkInterval);\n  }\n\n  /**\n   * Stop the background expiration checker and clean up.\n   */\n  dispose(): void {\n    if (this.intervalId) {\n      clearInterval(this.intervalId);\n      this.intervalId = null;\n    }\n  }\n\n  *keys(): IterableIterator<K> {\n    this.cleanup();\n    yield* this.map.keys();\n  }\n\n  *values(): IterableIterator<V> {\n    this.cleanup();\n    for (const entry of this.map.values()) {\n      yield entry.value;\n    }\n  }\n\n  *entries(): IterableIterator<[K, V]> {\n    this.cleanup();\n    for (const [key, entry] of this.map) {\n      yield [key, entry.value];\n    }\n  }\n}\n\n/**\n * Factory function to make a TTL cache.\n */\nexport function ttlCache<K, V>(\n  ttl: number,\n  options?: {\n    checkInterval?: number;\n    onExpire?: (key: K, value: V) => void;\n  }\n): TTLCache<K, V> {\n  return new TTLCache(\n    ttl,\n    options?.checkInterval,\n    options?.onExpire\n  );\n}\n","/**\n * AsyncQueue - An async iterable queue with backpressure support.\n *\n * The queue is for producer-consumer patterns where producers can wait when\n * the queue is full and consumers can wait when the queue is empty.\n * This module implements AsyncIterable for use with for-await-of loops.\n *\n * @example\n * const queue = asyncQueue<number>({ capacity: 10 })\n *\n * // Producer\n * await queue.put(42) // Waits if queue is full\n *\n * // Consumer\n * const value = await queue.take() // Waits if queue is empty\n *\n * // Async iteration\n * for await (const value of queue) {\n *   console.log(value)\n * }\n */\n\nimport type { AsyncQueue as IAsyncQueue } from \"../interfaces/queue.js\";\n\n/**\n * Options for making an AsyncQueue.\n */\nexport interface AsyncQueueOptions {\n  /**\n   * Maximum capacity. Infinity for unbounded queue.\n   * @default Infinity\n   */\n  capacity?: number;\n\n  /**\n   * Timeout for put/take operations in milliseconds.\n   * @default undefined (no timeout)\n   */\n  timeout?: number;\n}\n\n/**\n * Resolver for waiting operations.\n */\ninterface Resolver<T> {\n  resolve: (value: T) => void;\n  reject: (reason: any) => void;\n  timeoutId?: ReturnType<typeof setTimeout>;\n}\n\n/** A waiting put: it keeps its element until the queue takes it. */\ninterface Putter<T> extends Resolver<void> {\n  element: T;\n}\n\n/**\n * AsyncQueue<T> - Thread-safe async queue with backpressure.\n *\n * Features:\n * - Blocking put() when full (backpressure)\n * - Blocking take() when empty\n * - AsyncIterable support\n * - Graceful closing\n * - Timeouts\n *\n * Perfect for:\n * - Producer-consumer patterns\n * - Rate limiting\n * - Task queues\n * - Stream processing\n */\nexport class AsyncQueue<T> implements IAsyncQueue<T> {\n  private buffer: T[] = [];\n  private putters: Putter<T>[] = [];\n  private takers: Resolver<T>[] = [];\n  /** The calls of `peek` that wait: they see the next element, but they do not take it. */\n  private peekers: Resolver<T>[] = [];\n  private _isClosed = false;\n  private readonly capacity: number;\n  private readonly defaultTimeout?: number;\n\n  constructor(options: AsyncQueueOptions = {}) {\n    this.capacity = options.capacity ?? Infinity;\n    if (options.timeout !== undefined) {\n      this.defaultTimeout = options.timeout;\n    }\n  }\n\n  // ========================================================================\n  // Size and state\n  // ========================================================================\n\n  get size(): number {\n    return this.buffer.length;\n  }\n\n  get isEmpty(): boolean {\n    return this.buffer.length === 0;\n  }\n\n  get isFull(): boolean {\n    return this.buffer.length >= this.capacity;\n  }\n\n  get isClosed(): boolean {\n    return this._isClosed;\n  }\n\n  get remainingCapacity(): number {\n    return this.capacity === Infinity ? Infinity : this.capacity - this.buffer.length;\n  }\n\n  // ========================================================================\n  // Blocking operations\n  // ========================================================================\n\n  /**\n   * This method adds an element to the queue.\n   * If the queue is full, waits until space is available. With a capacity of 0, it waits until\n   * a taker takes the element (a rendezvous).\n   *\n   * @throws Error if queue is closed\n   * @throws Error if timeout expires\n   */\n  async put(element: T, timeout?: number): Promise<void> {\n    if (this._isClosed) {\n      throw new Error(\"Queue is closed\");\n    }\n    if (this.tryPutNow(element)) {\n      return;\n    }\n\n    // A waiting peek sees the element of a waiting put (a capacity of 0)\n    this.wakePeekers(element);\n\n    // Queue is full: wait with the element. (Before, a waiting putter kept only its resolve\n    // function, so its element was dropped when space came: BUGS-2026-07 C11.)\n    return new Promise<void>((resolve, reject) => {\n      const putter: Putter<T> = { element, resolve, reject };\n      const timeoutMs = timeout ?? this.defaultTimeout;\n      if (timeoutMs !== undefined) {\n        putter.timeoutId = setTimeout(() => {\n          const index = this.putters.indexOf(putter);\n          if (index !== -1) {\n            this.putters.splice(index, 1);\n          }\n          reject(new Error(`Put timeout after ${timeoutMs}ms`));\n        }, timeoutMs);\n      }\n      this.putters.push(putter);\n    });\n  }\n\n  /**\n   * Removes and gives an element from the queue.\n   * If the queue is empty, waits until an element is available.\n   *\n   * @throws Error if queue is closed and empty\n   * @throws Error if timeout expires\n   */\n  async take(timeout?: number): Promise<T> {\n    const next = this.takeNow();\n    if (next.found) {\n      return next.element;\n    }\n\n    // If closed and empty, throw\n    if (this._isClosed) {\n      throw new Error(\"Queue is closed and empty\");\n    }\n\n    // Wait for an element\n    return new Promise<T>((resolve, reject) => {\n      const taker: Resolver<T> = { resolve, reject };\n      const timeoutMs = timeout ?? this.defaultTimeout;\n      if (timeoutMs !== undefined) {\n        taker.timeoutId = setTimeout(() => {\n          const index = this.takers.indexOf(taker);\n          if (index !== -1) {\n            this.takers.splice(index, 1);\n          }\n          reject(new Error(`Take timeout after ${timeoutMs}ms`));\n        }, timeoutMs);\n      }\n      this.takers.push(taker);\n    });\n  }\n\n  /**\n   * This method waits for the next element, as `take` does, but it gives the element to\n   * `onElement` and the closure of the queue to `onClosed`. These calls are synchronous: they\n   * occur in the call that adds the element or closes the queue. The method has no timeout.\n   *\n   * The function that it gives withdraws the wait. A withdrawn wait gets no element, so no\n   * element goes to a taker that left. `select` races its cases with this method.\n   *\n   * @returns A function that withdraws the wait. It gives true when the wait had no element yet.\n   */\n  waitTake(onElement: (element: T) => void, onClosed: (error: Error) => void): () => boolean {\n    const next = this.takeNow();\n    if (next.found) {\n      onElement(next.element);\n      return () => false;\n    }\n    if (this._isClosed) {\n      onClosed(new Error(\"Queue is closed and empty\"));\n      return () => false;\n    }\n    const taker: Resolver<T> = { resolve: onElement, reject: onClosed };\n    this.takers.push(taker);\n    return () => {\n      const index = this.takers.indexOf(taker);\n      if (index === -1) return false;\n      this.takers.splice(index, 1);\n      return true;\n    };\n  }\n\n  // ========================================================================\n  // Non-blocking operations\n  // ========================================================================\n\n  /**\n   * This method tries to add an element without waiting.\n   * This method gives false if queue is full (with a capacity of 0: if no taker waits).\n   */\n  tryPut(element: T): boolean {\n    if (this._isClosed) {\n      return false;\n    }\n    return this.tryPutNow(element);\n  }\n\n  /**\n   * This method tries to remove an element without waiting.\n   * This method gives undefined if queue is empty.\n   */\n  tryTake(): T | undefined {\n    const next = this.takeNow();\n    return next.found ? next.element : undefined;\n  }\n\n  /** This method gives the element to a waiting taker, or puts it in the buffer when there is space. */\n  private tryPutNow(element: T): boolean {\n    // A waiting taker gets the element directly (the buffer is empty when a taker waits)\n    const taker = this.takers.shift();\n    if (taker) {\n      this.wakePeekers(element);\n      this.clearTimeout(taker);\n      taker.resolve(element);\n      return true;\n    }\n    if (this.buffer.length < this.capacity) {\n      this.buffer.push(element);\n      this.wakePeekers(element);\n      return true;\n    }\n    return false;\n  }\n\n  /** Each waiting peek gets the element, which stays where it is. */\n  private wakePeekers(element: T): void {\n    const peekers = this.peekers;\n    this.peekers = [];\n    for (const peeker of peekers) {\n      this.clearTimeout(peeker);\n      peeker.resolve(element);\n    }\n  }\n\n  /**\n   * This method takes the next element: from the buffer (then a waiting putter moves its element into the\n   * buffer), or directly from a waiting putter (a capacity of 0). (Before, the direct path\n   * released the putter but did not give its element to the taker, so the taker waited forever:\n   * BUGS-2026-07 C11.)\n   */\n  private takeNow(): { found: true; element: T } | { found: false } {\n    if (this.buffer.length > 0) {\n      const element = this.buffer.shift()!;\n      this.admitPutter();\n      return { found: true, element };\n    }\n    const putter = this.putters.shift();\n    if (putter) {\n      this.clearTimeout(putter);\n      putter.resolve();\n      return { found: true, element: putter.element };\n    }\n    return { found: false };\n  }\n\n  // ========================================================================\n  // Peeking\n  // ========================================================================\n\n  /**\n   * This method gives the next element without removing it.\n   * Waits if queue is empty.\n   */\n  async peek(): Promise<T> {\n    if (this.buffer.length > 0) {\n      return this.buffer[0]!;\n    }\n    if (this.putters.length > 0) {\n      return this.putters[0]!.element;\n    }\n\n    if (this._isClosed) {\n      throw new Error(\"Queue is closed and empty\");\n    }\n\n    // Wait for the next element without a take. (Before, peek took the element and put it back\n    // at the front: a take that waited after it kept waiting, and the order changed: audit pass 2.)\n    return new Promise<T>((resolve, reject) => {\n      const peeker: Resolver<T> = { resolve, reject };\n      const timeoutMs = this.defaultTimeout;\n      if (timeoutMs !== undefined) {\n        peeker.timeoutId = setTimeout(() => {\n          const index = this.peekers.indexOf(peeker);\n          if (index !== -1) {\n            this.peekers.splice(index, 1);\n          }\n          reject(new Error(`Peek timeout after ${timeoutMs}ms`));\n        }, timeoutMs);\n      }\n      this.peekers.push(peeker);\n    });\n  }\n\n  /**\n   * This method gives the next element without waiting.\n   * This method gives undefined if queue is empty.\n   */\n  tryPeek(): T | undefined {\n    return this.buffer.length > 0 ? this.buffer[0] : this.putters[0]?.element;\n  }\n\n  // ========================================================================\n  // Closing and draining\n  // ========================================================================\n\n  /**\n   * This method closes the queue. No more elements can be added.\n   * Existing elements can still be consumed.\n   */\n  close(): void {\n    this._isClosed = true;\n\n    // Reject all waiting putters\n    for (const putter of this.putters) {\n      this.clearTimeout(putter);\n      putter.reject(new Error(\"Queue closed\"));\n    }\n    this.putters = [];\n\n    // Wake up takers if queue is empty\n    if (this.buffer.length === 0) {\n      for (const taker of this.takers) {\n        this.clearTimeout(taker);\n        taker.reject(new Error(\"Queue closed and empty\"));\n      }\n      this.takers = [];\n      for (const peeker of this.peekers) {\n        this.clearTimeout(peeker);\n        peeker.reject(new Error(\"Queue closed and empty\"));\n      }\n      this.peekers = [];\n    }\n  }\n\n  /**\n   * This method drains all elements into an array.\n   * This method gives immediately with current elements.\n   */\n  drain(): T[] {\n    // The buffer, then the elements of the waiting putters, in order. (Before, the waiting\n    // putters were released but their elements were dropped.)\n    const elements = this.buffer.slice();\n    this.buffer = [];\n    for (const putter of this.putters.splice(0)) {\n      this.clearTimeout(putter);\n      putter.resolve();\n      elements.push(putter.element);\n    }\n    return elements;\n  }\n\n  // ========================================================================\n  // Async iteration\n  // ========================================================================\n\n  /**\n   * Async iterator that yields elements as they become available.\n   * Stops when queue is closed and empty.\n   */\n  async *[Symbol.asyncIterator](): AsyncIterator<T> {\n    while (true) {\n      const next = this.takeNow();\n      if (next.found) {\n        yield next.element;\n      } else if (this._isClosed) {\n        break;\n      } else {\n        let element: T;\n        try {\n          element = await this.take();\n        } catch (error) {\n          // The queue was closed while the iterator waited\n          if (this._isClosed) break;\n          throw error;\n        }\n        yield element;\n      }\n    }\n  }\n\n  // ========================================================================\n  // Private helpers\n  // ========================================================================\n\n  /** When the buffer has space, the first waiting putter moves its element into it. */\n  private admitPutter(): void {\n    if (this.putters.length > 0 && this.buffer.length < this.capacity) {\n      const putter = this.putters.shift()!;\n      this.clearTimeout(putter);\n      this.buffer.push(putter.element);\n      putter.resolve();\n    }\n  }\n\n  private clearTimeout(resolver: Resolver<any>): void {\n    if (resolver.timeoutId) {\n      clearTimeout(resolver.timeoutId);\n    }\n  }\n\n  // ========================================================================\n  // Utility methods\n  // ========================================================================\n\n  /**\n   * This method gives statistics about the queue.\n   */\n  getStats() : {\n    size: number;\n    capacity: number;\n    isEmpty: boolean;\n    isFull: boolean;\n    isClosed: boolean;\n    waitingPutters: number;\n    waitingTakers: number;\n    remainingCapacity: number;\n  } {\n    return {\n      size: this.size,\n      capacity: this.capacity,\n      isEmpty: this.isEmpty,\n      isFull: this.isFull,\n      isClosed: this._isClosed,\n      waitingPutters: this.putters.length,\n      waitingTakers: this.takers.length,\n      remainingCapacity: this.remainingCapacity,\n    };\n  }\n\n  toString(): string {\n    return `AsyncQueue[size=${this.size}, capacity=${this.capacity}, closed=${this._isClosed}]`;\n  }\n}\n\n/**\n * Factory function to make an AsyncQueue.\n *\n * @example\n * const queue = asyncQueue<number>({ capacity: 100 })\n * await queue.put(42)\n * const value = await queue.take()\n */\nexport function asyncQueue<T>(options?: AsyncQueueOptions): AsyncQueue<T> {\n  return new AsyncQueue<T>(options);\n}\n","/**\n * Go-style channels for CSP (Communicating Sequential Processes).\n *\n * This module gives typed, bidirectional communication channels inspired by Go.\n * Perfect for coordinating async operations and implementing concurrent patterns.\n *\n * @example\n * const ch = channel<number>()\n *\n * // Sender\n * await ch.send(42)\n *\n * // Receiver\n * const value = await ch.receive()\n *\n * // Select from multiple channels\n * const result = await select(\n *   ch1.case((v) => console.log('ch1:', v)),\n *   ch2.case((v) => console.log('ch2:', v))\n * )\n */\n\nimport { asyncQueue, type AsyncQueue } from \"./async-queue.js\";\n\n/**\n * Channel<T> - Bidirectional communication channel.\n *\n * The channels of Go are the model. This class gives send/receive operations\n * that can block until the other side is ready.\n */\nexport class Channel<T> {\n  private queue: AsyncQueue<T>;\n  private _isClosed = false;\n\n  constructor(bufferSize: number = 0) {\n    // A buffer size of 0 is an unbuffered channel: send waits for a receiver (a rendezvous).\n    // (Before, `bufferSize || 1` gave it a buffer of 1: BUGS-2026-07 L17.)\n    this.queue = asyncQueue<T>({ capacity: bufferSize });\n  }\n\n  /**\n   * This method sends a value through the channel.\n   * Blocks if channel buffer is full.\n   *\n   * @throws Error if channel is closed\n   */\n  async send(value: T): Promise<void> {\n    if (this._isClosed) {\n      throw new Error(\"Cannot send on closed channel\");\n    }\n    await this.queue.put(value);\n  }\n\n  /**\n   * This method receives a value from the channel.\n   * Blocks if no value is available.\n   *\n   * @throws Error if channel is closed and empty\n   */\n  async receive(): Promise<T> {\n    return await this.queue.take();\n  }\n\n  /**\n   * This method waits for one value, as `receive` does, and gives it to `onValue`. When the\n   * channel is closed and empty, it calls `onClosed`. These calls are synchronous: they occur in\n   * the call that sends the value or closes the channel.\n   *\n   * The function that it gives withdraws the wait, so no later value goes to it.\n   *\n   * @returns A function that withdraws the wait. It gives true when the wait had no value yet.\n   */\n  waitReceive(onValue: (value: T) => void, onClosed: (error: Error) => void): () => boolean {\n    return this.queue.waitTake(onValue, onClosed);\n  }\n\n  /**\n   * This method tries to send without blocking.\n   * This method gives false if channel is full.\n   */\n  trySend(value: T): boolean {\n    if (this._isClosed) return false;\n    return this.queue.tryPut(value);\n  }\n\n  /**\n   * This method tries to receive without blocking.\n   * This method gives undefined if no value is available.\n   */\n  tryReceive(): T | undefined {\n    return this.queue.tryTake();\n  }\n\n  /**\n   * This method closes the channel. No more values can be sent.\n   * Receivers can still drain remaining values.\n   */\n  close(): void {\n    this._isClosed = true;\n    this.queue.close();\n  }\n\n  get isClosed(): boolean {\n    return this._isClosed;\n  }\n\n  get size(): number {\n    return this.queue.size;\n  }\n\n  /**\n   * This method makes a select case for this channel.\n   * The select() function uses this value for multiplexing.\n   */\n  case<R>(handler: (value: T) => R): SelectCase<R> {\n    return {\n      channel: this,\n      handler,\n      tryReceive: () => this.tryReceive(),\n      receive: () => this.receive(),\n      wait: (onValue, onClosed) => this.waitReceive(onValue, onClosed),\n    };\n  }\n\n  /**\n   * Async iteration over channel values.\n   * Stops when channel is closed and empty.\n   */\n  async *[Symbol.asyncIterator](): AsyncIterator<T> {\n    while (true) {\n      try {\n        yield await this.receive();\n      } catch (e) {\n        // Channel closed\n        break;\n      }\n    }\n  }\n}\n\n/**\n * SelectCase represents a case in a select statement.\n */\nexport interface SelectCase<R> {\n  channel: Channel<any>;\n  handler: (value: any) => R;\n  tryReceive: () => any;\n  receive: () => Promise<any>;\n  /**\n   * A wait for one value that `select` can withdraw: `Channel.waitReceive`. A case without it\n   * uses the `waitReceive` method of its channel.\n   */\n  wait?: (onValue: (value: any) => void, onClosed: (error: Error) => void) => () => boolean;\n}\n\n/** A wait for one value that can be withdrawn, as `Channel.waitReceive` gives it. */\ntype Wait = (onValue: (value: unknown) => void, onClosed: (error: Error) => void) => () => boolean;\n\n/**\n * This function gives the first value of the waits, with the index of its wait. It rejects with\n * the error of the first wait whose channel is closed and empty. It withdraws each other wait in\n * the same call, so a later value stays in its channel. (Before, the receives of the cases that\n * lost stayed in their channels and dropped the next value of each: audit O56.)\n */\nfunction firstOf(waits: readonly Wait[]): Promise<{ index: number; value: unknown }> {\n  return new Promise((resolve, reject) => {\n    const withdraws: Array<() => boolean> = [];\n    let settled = false;\n    const end = (): void => {\n      settled = true;\n      for (const withdraw of withdraws) withdraw();\n    };\n    // A wait can call back at once, in its own call, when its channel has a value or is closed\n    try {\n      for (let index = 0; index < waits.length && !settled; index++) {\n        withdraws.push(\n          waits[index]!(\n            (value) => {\n              if (settled) return;\n              end();\n              resolve({ index, value });\n            },\n            (error) => {\n              if (settled) return;\n              end();\n              reject(error);\n            },\n          ),\n        );\n      }\n    } catch (error) {\n      // A wait that throws: the waits before it are withdrawn\n      if (!settled) end();\n      reject(error);\n    }\n  });\n}\n\n/**\n * Selects from multiple channels (like Go's select statement).\n *\n * This function waits for the first channel to have a value available,\n * then calls its handler and gives the result.\n *\n * The first case with a value at once wins. The cases that lose keep no receive: a value that\n * comes later stays in its channel for the next receiver. When the channel of a case is closed\n * and empty, the given promise rejects.\n *\n * @example\n * const result = await select(\n *   ch1.case((v) => `ch1: ${v}`),\n *   ch2.case((v) => `ch2: ${v}`),\n *   timeout(1000).case(() => 'timeout')\n * )\n */\nexport async function select<R>(...cases: SelectCase<R>[]): Promise<R> {\n  const { index, value } = await firstOf(\n    cases.map((c): Wait => c.wait ?? ((onValue, onClosed) => c.channel.waitReceive(onValue, onClosed))),\n  );\n  // The handler runs after the race, not in the call of the sender\n  return cases[index]!.handler(value);\n}\n\n/**\n * This function makes a timeout channel that sends after the specified duration.\n *\n * @example\n * const result = await select(\n *   dataChannel.case((v) => v),\n *   timeout(5000).case(() => 'timeout!')\n * )\n */\nexport function timeout(ms: number): Channel<void> {\n  const ch = new Channel<void>();\n  setTimeout(() => {\n    ch.send(undefined).catch(() => {}); // Ignore if closed\n    ch.close();\n  }, ms);\n  return ch;\n}\n\n/**\n * This function makes a ticker channel that sends at regular intervals.\n *\n * @example\n * const tick = ticker(1000) // Every second\n * for await (const t of tick) {\n *   console.log('Tick:', t)\n * }\n */\nexport function ticker(ms: number): Channel<number> & { stop: () => void } {\n  const ch = new Channel<number>(1);\n  let count = 0;\n\n  const intervalId = setInterval(() => {\n    ch.trySend(count++);\n  }, ms);\n\n  return Object.assign(ch, {\n    stop: () => {\n      clearInterval(intervalId);\n      ch.close();\n    },\n  });\n}\n\n/**\n * Pipeline: pipes values from input channel through transform to output channel.\n *\n * @example\n * const input = channel<number>()\n * const output = pipeline(input, (x) => x * 2)\n *\n * await input.send(5)\n * const result = await output.receive() // 10\n */\nexport function pipeline<T, U>(\n  input: Channel<T>,\n  transform: (value: T) => U | Promise<U>,\n  bufferSize: number = 0\n): Channel<U> {\n  const output = new Channel<U>(bufferSize);\n\n  // The output closes also when the transform fails, so its reader does not wait forever. The\n  // error goes to the console, as in workerPool. (Before, it was an unhandled rejection: audit pass 2.)\n  (async () => {\n    try {\n      for await (const value of input) {\n        const transformed = await transform(value);\n        await output.send(transformed);\n      }\n    } finally {\n      output.close();\n    }\n  })().catch((error: unknown) => console.error(\"pipeline error:\", error));\n\n  return output;\n}\n\n/**\n * Fan-out: distributes values from one input channel to multiple output channels.\n *\n * @example\n * const input = channel<number>()\n * const [out1, out2, out3] = fanOut(input, 3)\n *\n * // Each output gets a copy of every input value\n */\nexport function fanOut<T>(input: Channel<T>, count: number, bufferSize: number = 0): Channel<T>[] {\n  const outputs = Array.from({ length: count }, () => new Channel<T>(bufferSize));\n\n  (async () => {\n    try {\n      for await (const value of input) {\n        await Promise.all(outputs.map((ch) => ch.send(value)));\n      }\n    } finally {\n      outputs.forEach((ch) => ch.close());\n    }\n  })().catch((error: unknown) => console.error(\"fanOut error:\", error));\n\n  return outputs;\n}\n\n/**\n * Fan-in: merges multiple input channels into one output channel.\n *\n * @example\n * const ch1 = channel<number>()\n * const ch2 = channel<number>()\n * const merged = fanIn(ch1, ch2)\n *\n * // merged receives values from both ch1 and ch2\n */\nexport function fanIn<T>(...inputs: Channel<T>[]): Channel<T> {\n  const output = new Channel<T>();\n\n  const workers = inputs.map(async (input) => {\n    for await (const value of input) {\n      await output.send(value);\n    }\n  });\n\n  // All the workers settle, then the output closes, also after a failed send\n  Promise.allSettled(workers).then((results) => {\n    output.close();\n    for (const result of results) if (result.status === \"rejected\") console.error(\"fanIn error:\", result.reason);\n  });\n\n  return output;\n}\n\n/**\n * Merge: like fanIn but closes output when first input closes.\n *\n * It takes one value at a time, from the inputs in turn. It keeps no receive on an input while\n * it waits for the reader of the output. Thus each value of each input reaches the output one\n * time, in the order of its input, or stays in its input.\n */\nexport function merge<T>(...inputs: Channel<T>[]): Channel<T> {\n  const output = new Channel<T>();\n\n  (async () => {\n    // The input after the input of the last value comes first, so a busy input starves no other\n    let start = 0;\n    while (true) {\n      const order = inputs.map((_, offset) => (start + offset) % inputs.length);\n      let next: { index: number; value: unknown };\n      try {\n        next = await firstOf(order.map((index): Wait => (onValue, onClosed) => inputs[index]!.waitReceive(onValue, onClosed)));\n      } catch {\n        // An input is closed and empty\n        break;\n      }\n      const index = order[next.index]!;\n      start = (index + 1) % inputs.length;\n      try {\n        await output.send(next.value as T);\n      } catch {\n        // The reader closed the output\n        break;\n      }\n    }\n    output.close();\n  })();\n\n  return output;\n}\n\n/**\n * Buffered channel with specified capacity.\n */\nexport function buffered<T>(capacity: number): Channel<T> {\n  return new Channel<T>(capacity);\n}\n\n/**\n * Unbuffered channel (rendezvous point).\n * Sends block until receiver is ready.\n */\nexport function unbuffered<T>(): Channel<T> {\n  return new Channel<T>(0);\n}\n\n/**\n * Factory function to make a channel.\n *\n * @example\n * const ch = channel<number>()\n * const bufferedCh = channel<string>(10)\n */\nexport function channel<T>(bufferSize: number = 0): Channel<T> {\n  return new Channel<T>(bufferSize);\n}\n\n/**\n * WorkerPool: distributes work across multiple workers.\n *\n * @example\n * const pool = workerPool(\n *   jobChannel,\n *   async (job) => await processJob(job),\n *   { workers: 4 }\n * )\n *\n * // 4 workers concurrently process jobs from jobChannel\n */\nexport function workerPool<T, R>(\n  jobs: Channel<T>,\n  worker: (job: T) => Promise<R>,\n  options: { workers: number; bufferSize?: number } = { workers: 1 }\n): Channel<R> {\n  const results = new Channel<R>(options.bufferSize || 0);\n  const { workers: workerCount } = options;\n\n  const workers = Array.from({ length: workerCount }, async () => {\n    for await (const job of jobs) {\n      try {\n        const result = await worker(job);\n        await results.send(result);\n      } catch (error) {\n        console.error(\"Worker error:\", error);\n      }\n    }\n  });\n\n  Promise.all(workers).then(() => results.close());\n\n  return results;\n}\n","/**\n * asSettled - The results of running promises, in the order that they settle.\n *\n * @example\n * const pages = urls.map((url) => fetch(url));\n * for await (const result of asSettled(pages)) {\n *   if (result.status === \"fulfilled\") show(result.index, result.value);\n *   else report(result.index, result.reason);\n * }\n */\n\n/** One result of `asSettled`: the index of its promise in the input, and how the promise settled. */\nexport type Settled<T> = { readonly index: number } & PromiseSettledResult<T>;\n\n/**\n * This function gives the result of each promise when it settles, in settle order, not in input\n * order. The promises run already: this function starts nothing. Each result has the index of its\n * promise in the input. A rejected promise gives `status: \"rejected\"` and its reason: the\n * generator does not throw it. When the consumer stops early, the other promises continue, and\n * their rejections are not reported as unhandled.\n */\nexport async function* asSettled<T>(promises: Iterable<Promise<T>>): AsyncGenerator<Settled<T>, void, undefined> {\n  const pending = new Map<number, Promise<Settled<T>>>();\n  let next = 0;\n  for (const promise of promises) {\n    const index = next;\n    next += 1;\n    pending.set(\n      index,\n      Promise.resolve(promise).then(\n        (value): Settled<T> => ({ index, status: \"fulfilled\", value }),\n        (reason: unknown): Settled<T> => ({ index, status: \"rejected\", reason })\n      )\n    );\n  }\n  while (pending.size > 0) {\n    const settled = await Promise.race(pending.values());\n    pending.delete(settled.index);\n    yield settled;\n  }\n}\n","/**\n * Functional operations for iterables (lazy sync transforms).\n *\n * This module gives Stream-like operations with lazy evaluation.\n * All operations return generators for composability.\n *\n * @example\n * const result = pipe(\n *   [1, 2, 3, 4, 5],\n *   map(x => x * 2),\n *   filter(x => x > 5),\n *   take(2),\n *   toArray\n * ) // [6, 8]\n */\n\n// ============================================================================\n// Mapping and transformation\n// ============================================================================\n\n/**\n * This function maps each element through a function.\n *\n * @example\n * const doubled = map([1, 2, 3], x => x * 2) // [2, 4, 6]\n */\nexport function* map<T, U>(\n  iterable: Iterable<T>,\n  fn: (value: T, index: number) => U\n): Generator<U> {\n  let index = 0;\n  for (const value of iterable) {\n    yield fn(value, index++);\n  }\n}\n\n/**\n * This function filters elements based on a predicate.\n */\nexport function* filter<T>(\n  iterable: Iterable<T>,\n  predicate: (value: T, index: number) => boolean\n): Generator<T> {\n  let index = 0;\n  for (const value of iterable) {\n    if (predicate(value, index++)) {\n      yield value;\n    }\n  }\n}\n\n/**\n * This function flatMaps each element to an iterable and flattens.\n */\nexport function* flatMap<T, U>(\n  iterable: Iterable<T>,\n  fn: (value: T, index: number) => Iterable<U>\n): Generator<U> {\n  let index = 0;\n  for (const value of iterable) {\n    yield* fn(value, index++);\n  }\n}\n\n/**\n * This function flattens a nested iterable.\n */\nexport function* flatten<T>(iterable: Iterable<Iterable<T>>): Generator<T> {\n  for (const inner of iterable) {\n    yield* inner;\n  }\n}\n\n// ============================================================================\n// Limiting and skipping\n// ============================================================================\n\n/**\n * This function takes the first n elements.\n */\nexport function* take<T>(iterable: Iterable<T>, n: number): Generator<T> {\n  let count = 0;\n  for (const value of iterable) {\n    if (count++ >= n) break;\n    yield value;\n  }\n}\n\n/**\n * This function skips the first n elements.\n */\nexport function* skip<T>(iterable: Iterable<T>, n: number): Generator<T> {\n  let count = 0;\n  for (const value of iterable) {\n    if (count++ >= n) {\n      yield value;\n    }\n  }\n}\n\n/**\n * This function takes elements while predicate is true.\n */\nexport function* takeWhile<T>(\n  iterable: Iterable<T>,\n  predicate: (value: T) => boolean\n): Generator<T> {\n  for (const value of iterable) {\n    if (!predicate(value)) break;\n    yield value;\n  }\n}\n\n/**\n * This function skips elements while predicate is true.\n */\nexport function* skipWhile<T>(\n  iterable: Iterable<T>,\n  predicate: (value: T) => boolean\n): Generator<T> {\n  let skipping = true;\n  for (const value of iterable) {\n    if (skipping && predicate(value)) continue;\n    skipping = false;\n    yield value;\n  }\n}\n\n// ============================================================================\n// Combining\n// ============================================================================\n\n/**\n * Concatenates multiple iterables.\n */\nexport function* concat<T>(...iterables: Iterable<T>[]): Generator<T> {\n  for (const iterable of iterables) {\n    yield* iterable;\n  }\n}\n\n/**\n * Zips multiple iterables together.\n */\nexport function* zip<T extends any[]>(\n  ...iterables: { [K in keyof T]: Iterable<T[K]> }\n): Generator<T> {\n  const iterators = iterables.map((it) => it[Symbol.iterator]());\n\n  while (true) {\n    const results = iterators.map((it) => it.next());\n    if (results.some((r) => r.done)) break;\n    yield results.map((r) => r.value) as T;\n  }\n}\n\n/**\n * Zips with index.\n */\nexport function* enumerate<T>(iterable: Iterable<T>): Generator<[number, T]> {\n  let index = 0;\n  for (const value of iterable) {\n    yield [index++, value];\n  }\n}\n\n// ============================================================================\n// Partitioning\n// ============================================================================\n\n/**\n * Chunks elements into arrays of specified size.\n */\nexport function* chunk<T>(iterable: Iterable<T>, size: number): Generator<T[]> {\n  let chunk: T[] = [];\n  for (const value of iterable) {\n    chunk.push(value);\n    if (chunk.length === size) {\n      yield chunk;\n      chunk = [];\n    }\n  }\n  if (chunk.length > 0) {\n    yield chunk;\n  }\n}\n\n/**\n * This function makes a sliding window of specified size.\n */\nexport function* window<T>(iterable: Iterable<T>, size: number): Generator<T[]> {\n  const window: T[] = [];\n  for (const value of iterable) {\n    window.push(value);\n    if (window.length > size) {\n      window.shift();\n    }\n    if (window.length === size) {\n      yield [...window];\n    }\n  }\n}\n\n/**\n * Partitions elements into two arrays based on predicate.\n */\nexport function partition<T>(\n  iterable: Iterable<T>,\n  predicate: (value: T) => boolean\n): [T[], T[]] {\n  const truthy: T[] = [];\n  const falsy: T[] = [];\n\n  for (const value of iterable) {\n    if (predicate(value)) {\n      truthy.push(value);\n    } else {\n      falsy.push(value);\n    }\n  }\n\n  return [truthy, falsy];\n}\n\n// ============================================================================\n// Reducing and folding\n// ============================================================================\n\n/**\n * This function reduces iterable to a single value.\n */\nexport function reduce<T, U>(\n  iterable: Iterable<T>,\n  fn: (acc: U, value: T, index: number) => U,\n  initial: U\n): U {\n  let acc = initial;\n  let index = 0;\n  for (const value of iterable) {\n    acc = fn(acc, value, index++);\n  }\n  return acc;\n}\n\n/**\n * Scans (like reduce but emits intermediate results).\n */\nexport function* scan<T, U>(\n  iterable: Iterable<T>,\n  fn: (acc: U, value: T) => U,\n  initial: U\n): Generator<U> {\n  let acc = initial;\n  yield acc;\n  for (const value of iterable) {\n    acc = fn(acc, value);\n    yield acc;\n  }\n}\n\n// ============================================================================\n// Sorting and ordering\n// ============================================================================\n\n/**\n * This function sorts elements (materializes the iterable).\n */\nexport function* sort<T>(\n  iterable: Iterable<T>,\n  compare?: (a: T, b: T) => number\n): Generator<T> {\n  const array = Array.from(iterable);\n  array.sort(compare);\n  yield* array;\n}\n\n/**\n * Reverses elements (materializes the iterable).\n */\nexport function* reverse<T>(iterable: Iterable<T>): Generator<T> {\n  const array = Array.from(iterable);\n  array.reverse();\n  yield* array;\n}\n\n// ============================================================================\n// Distinct and uniqueness\n// ============================================================================\n\n/**\n * This function removes duplicate elements (by reference or key function).\n */\nexport function* distinct<T, K = T>(\n  iterable: Iterable<T>,\n  keyFn?: (value: T) => K\n): Generator<T> {\n  const seen = new Set<K>();\n  for (const value of iterable) {\n    const key = (keyFn ? keyFn(value) : value) as K;\n    if (!seen.has(key)) {\n      seen.add(key);\n      yield value;\n    }\n  }\n}\n\n/**\n * This function removes consecutive duplicates.\n */\nexport function* distinctConsecutive<T, K = T>(\n  iterable: Iterable<T>,\n  keyFn?: (value: T) => K\n): Generator<T> {\n  let lastKey: K | undefined;\n  let first = true;\n\n  for (const value of iterable) {\n    const key = (keyFn ? keyFn(value) : value) as K;\n    if (first || key !== lastKey) {\n      yield value;\n      lastKey = key;\n      first = false;\n    }\n  }\n}\n\n// ============================================================================\n// Peeking and side effects\n// ============================================================================\n\n/**\n * This function does a side effect for each element. The stream does not change.\n */\nexport function* tap<T>(\n  iterable: Iterable<T>,\n  fn: (value: T, index: number) => void\n): Generator<T> {\n  let index = 0;\n  for (const value of iterable) {\n    fn(value, index++);\n    yield value;\n  }\n}\n\n// ============================================================================\n// Predicates and checks\n// ============================================================================\n\n/**\n * This function gives true if any element matches the predicate.\n */\nexport function some<T>(\n  iterable: Iterable<T>,\n  predicate: (value: T) => boolean\n): boolean {\n  for (const value of iterable) {\n    if (predicate(value)) return true;\n  }\n  return false;\n}\n\n/**\n * This function gives true if all elements match the predicate.\n */\nexport function every<T>(\n  iterable: Iterable<T>,\n  predicate: (value: T) => boolean\n): boolean {\n  for (const value of iterable) {\n    if (!predicate(value)) return false;\n  }\n  return true;\n}\n\n/**\n * This function gives true if no elements match the predicate.\n */\nexport function none<T>(\n  iterable: Iterable<T>,\n  predicate: (value: T) => boolean\n): boolean {\n  return !some(iterable, predicate);\n}\n\n/**\n * This function finds the first element matching the predicate.\n */\nexport function find<T>(\n  iterable: Iterable<T>,\n  predicate: (value: T) => boolean\n): T | undefined {\n  for (const value of iterable) {\n    if (predicate(value)) return value;\n  }\n  return undefined;\n}\n\n/**\n * This function counts elements (optionally matching a predicate).\n */\nexport function count<T>(\n  iterable: Iterable<T>,\n  predicate?: (value: T) => boolean\n): number {\n  let count = 0;\n  for (const value of iterable) {\n    if (!predicate || predicate(value)) {\n      count++;\n    }\n  }\n  return count;\n}\n\n// ============================================================================\n// Min/Max\n// ============================================================================\n\n/**\n * This function gives the minimum element.\n */\nexport function min<T>(\n  iterable: Iterable<T>,\n  compare?: (a: T, b: T) => number\n): T | undefined {\n  const cmp = compare || ((a: any, b: any) => a - b);\n  let minValue: T | undefined;\n\n  for (const value of iterable) {\n    if (minValue === undefined || cmp(value, minValue) < 0) {\n      minValue = value;\n    }\n  }\n\n  return minValue;\n}\n\n/**\n * This function gives the maximum element.\n */\nexport function max<T>(\n  iterable: Iterable<T>,\n  compare?: (a: T, b: T) => number\n): T | undefined {\n  const cmp = compare || ((a: any, b: any) => a - b);\n  let maxValue: T | undefined;\n\n  for (const value of iterable) {\n    if (maxValue === undefined || cmp(value, maxValue) > 0) {\n      maxValue = value;\n    }\n  }\n\n  return maxValue;\n}\n\n/**\n * This function gives the sum of elements.\n */\nexport function sum(iterable: Iterable<number>): number {\n  let total = 0;\n  for (const value of iterable) {\n    total += value;\n  }\n  return total;\n}\n\n/**\n * This function gives the average of elements.\n */\nexport function average(iterable: Iterable<number>): number | undefined {\n  let total = 0;\n  let count = 0;\n\n  for (const value of iterable) {\n    total += value;\n    count++;\n  }\n\n  return count === 0 ? undefined : total / count;\n}\n\n// ============================================================================\n// Terminal operations (materialization)\n// ============================================================================\n\n/**\n * This function collects elements into an array.\n */\nexport function toArray<T>(iterable: Iterable<T>): T[] {\n  return Array.from(iterable);\n}\n\n/**\n * This function collects elements into a Set.\n */\nexport function toSet<T>(iterable: Iterable<T>): Set<T> {\n  return new Set(iterable);\n}\n\n/**\n * This function collects elements into a Map.\n */\nexport function toMap<T, K, V>(\n  iterable: Iterable<T>,\n  keyFn: (value: T) => K,\n  valueFn: (value: T) => V\n): Map<K, V> {\n  const map = new Map<K, V>();\n  for (const value of iterable) {\n    map.set(keyFn(value), valueFn(value));\n  }\n  return map;\n}\n\n// ============================================================================\n// Pipe utility for composition\n// ============================================================================\n\n/**\n * This function pipes a value through a series of transformations.\n *\n * @example\n * const result = pipe(\n *   [1, 2, 3, 4, 5],\n *   (it) => map(it, x => x * 2),\n *   (it) => filter(it, x => x > 5),\n *   (it) => take(it, 2),\n *   toArray\n * ) // [6, 8]\n */\nexport function pipe<T>(\n  value: T,\n  ...fns: Array<(value: any) => any>\n): any {\n  return fns.reduce((acc, fn) => fn(acc), value);\n}\n","/**\n * Collectors for Stream-style collection operations.\n *\n * This module gives Java Stream API-style collectors for transforming iterables\n * into various collection types. The model is java.util.stream.Collectors.\n *\n * @example\n * import { collect, toList, groupingBy } from './collectors'\n *\n * const grouped = collect(users, groupingBy(u => u.age))\n */\n\nimport { arrayList, type ArrayList } from \"../impl/array-list.js\";\nimport { hashMap, type HashMap } from \"../impl/hash-map.js\";\nimport { hashSet, type HashSet } from \"../impl/hash-set.js\";\n\n// ============================================================================\n// Collector interface\n// ============================================================================\n\n/**\n * A Collector represents a mutable reduction operation.\n *\n * @template T - The type of input elements\n * @template A - The mutable accumulation type\n * @template R - The final result type\n */\nexport interface Collector<T, A, R> {\n  /**\n   * This value makes the initial accumulator.\n   */\n  supplier: () => A;\n\n  /**\n   * This value incorporates an element into the accumulator and gives the next accumulator. A mutable\n   * accumulator (a list, a map) gives itself. An immutable one (a count, a sum) gives the\n   * new value. (Before, the result was ignored, so every immutable collector - counting,\n   * summing, minBy, maxBy, reducing, first, last - given its seed: BUGS-2026-07 C12.)\n   */\n  accumulator: (acc: A, element: T) => A;\n\n  /**\n   * This value combines two accumulators (for parallel streams).\n   */\n  combiner?: (acc1: A, acc2: A) => A;\n\n  /**\n   * This value transforms the accumulator into the final result.\n   */\n  finisher: (acc: A) => R;\n}\n\n/**\n * This function collects elements using a collector.\n *\n * @example\n * const list = collect([1, 2, 3], toList())\n * const set = collect([1, 2, 2, 3], toSet())\n */\nexport function collect<T, A, R>(\n  iterable: Iterable<T>,\n  collector: Collector<T, A, R>\n): R {\n  let acc = collector.supplier();\n  for (const element of iterable) {\n    acc = collector.accumulator(acc, element);\n  }\n  return collector.finisher(acc);\n}\n\n// ============================================================================\n// Basic collectors\n// ============================================================================\n\n/**\n * This function collects elements into an ArrayList.\n */\nexport function toList<T>(): Collector<T, ArrayList<T>, ArrayList<T>> {\n  return {\n    supplier: () => arrayList<T>(),\n    accumulator: (list, element) => (list.add(element), list),\n    finisher: (list) => list,\n  };\n}\n\n/**\n * This function collects elements into a HashSet.\n */\nexport function toSet<T>(): Collector<T, HashSet<T>, HashSet<T>> {\n  return {\n    supplier: () => hashSet<T>(),\n    accumulator: (set, element) => (set.add(element), set),\n    finisher: (set) => set,\n  };\n}\n\n/**\n * This function collects elements into a native Array.\n */\nexport function toArray<T>(): Collector<T, T[], T[]> {\n  return {\n    supplier: () => [],\n    accumulator: (arr, element) => (arr.push(element), arr),\n    finisher: (arr) => arr,\n  };\n}\n\n/**\n * This function collects elements into a HashMap using key and value extractors.\n */\nexport function toMap<T, K, V>(\n  keyExtractor: (element: T) => K,\n  valueExtractor: (element: T) => V\n): Collector<T, HashMap<K, V>, HashMap<K, V>> {\n  return {\n    supplier: () => hashMap<K, V>(),\n    accumulator: (map, element) => {\n      map.set(keyExtractor(element), valueExtractor(element));\n      return map;\n    },\n    finisher: (map) => map,\n  };\n}\n\n// ============================================================================\n// Grouping collectors\n// ============================================================================\n\n/**\n * This function groups elements by a classifier function.\n *\n * @example\n * const byAge = collect(users, groupingBy(u => u.age))\n * // Map<number, ArrayList<User>>\n */\nexport function groupingBy<T, K>(\n  classifier: (element: T) => K\n): Collector<T, HashMap<K, ArrayList<T>>, HashMap<K, ArrayList<T>>> {\n  return {\n    supplier: () => hashMap<K, ArrayList<T>>(),\n    accumulator: (map, element) => {\n      const key = classifier(element);\n      const list = map.computeIfAbsent(key, () => arrayList<T>());\n      list.add(element);\n      return map;\n    },\n    finisher: (map) => map,\n  };\n}\n\n/**\n * Groups and transforms with a downstream collector.\n *\n * @example\n * const countByAge = collect(\n *   users,\n *   groupingBy(u => u.age, counting())\n * )\n * // Map<number, number>\n */\nexport function groupingByWith<T, K, A, D>(\n  classifier: (element: T) => K,\n  downstream: Collector<T, A, D>\n): Collector<T, HashMap<K, A>, HashMap<K, D>> {\n  return {\n    supplier: () => hashMap<K, A>(),\n    accumulator: (map, element) => {\n      const key = classifier(element);\n      const acc = map.has(key) ? map.get(key) : downstream.supplier();\n      map.set(key, downstream.accumulator(acc, element));\n      return map;\n    },\n    finisher: (map) => {\n      const result = hashMap<K, D>();\n      for (const entry of map.entries()) {\n        result.set(entry.key, downstream.finisher(entry.value));\n      }\n      return result;\n    },\n  };\n}\n\n/**\n * Partitions elements into two groups based on a predicate.\n *\n * @example\n * const partitioned = collect(\n *   numbers,\n *   partitioningBy(n => n % 2 === 0)\n * )\n * // Map<boolean, ArrayList<number>>\n */\nexport function partitioningBy<T>(\n  predicate: (element: T) => boolean\n): Collector<T, HashMap<boolean, ArrayList<T>>, HashMap<boolean, ArrayList<T>>> {\n  return groupingBy((element) => predicate(element));\n}\n\n// ============================================================================\n// Aggregation collectors\n// ============================================================================\n\n/**\n * This function counts the number of elements.\n */\nexport function counting<T>(): Collector<T, number, number> {\n  return {\n    supplier: () => 0,\n    accumulator: (count) => count + 1,\n    finisher: (count) => count,\n  };\n}\n\n/**\n * Sums numeric elements.\n */\nexport function summingNumber<T>(\n  mapper: (element: T) => number\n): Collector<T, number, number> {\n  return {\n    supplier: () => 0,\n    accumulator: (sum, element) => sum + mapper(element),\n    finisher: (sum) => sum,\n  };\n}\n\n/**\n * Averages numeric elements.\n */\nexport function averagingNumber<T>(\n  mapper: (element: T) => number\n): Collector<T, { sum: number; count: number }, number> {\n  return {\n    supplier: () => ({ sum: 0, count: 0 }),\n    accumulator: (acc, element) => {\n      acc.sum += mapper(element);\n      acc.count++;\n      return acc;\n    },\n    finisher: (acc) => (acc.count === 0 ? 0 : acc.sum / acc.count),\n  };\n}\n\n/**\n * This function finds the minimum element.\n */\nexport function minBy<T>(\n  comparator: (a: T, b: T) => number\n): Collector<T, T | undefined, T | undefined> {\n  return {\n    supplier: () => undefined,\n    accumulator: (min, element) => {\n      if (min === undefined || comparator(element, min) < 0) {\n        return element;\n      }\n      return min;\n    },\n    finisher: (min) => min,\n  };\n}\n\n/**\n * This function finds the maximum element.\n */\nexport function maxBy<T>(\n  comparator: (a: T, b: T) => number\n): Collector<T, T | undefined, T | undefined> {\n  return {\n    supplier: () => undefined,\n    accumulator: (max, element) => {\n      if (max === undefined || comparator(element, max) > 0) {\n        return element;\n      }\n      return max;\n    },\n    finisher: (max) => max,\n  };\n}\n\n// ============================================================================\n// String collectors\n// ============================================================================\n\n/**\n * Joins elements into a string.\n *\n * @example\n * const csv = collect(['a', 'b', 'c'], joining(', '))\n * // \"a, b, c\"\n *\n * const bracketed = collect(\n *   ['a', 'b', 'c'],\n *   joining(', ', '[', ']')\n * )\n * // \"[a, b, c]\"\n */\nexport function joining<T>(\n  delimiter: string = \"\",\n  prefix: string = \"\",\n  suffix: string = \"\"\n): Collector<T, string[], string> {\n  return {\n    supplier: () => [],\n    accumulator: (parts, element) => (parts.push(String(element)), parts),\n    finisher: (parts) => prefix + parts.join(delimiter) + suffix,\n  };\n}\n\n// ============================================================================\n// Mapping collectors\n// ============================================================================\n\n/**\n * This function applies a mapping function before collecting.\n *\n * @example\n * const names = collect(\n *   users,\n *   mapping(u => u.name, toList())\n * )\n */\nexport function mapping<T, U, A, R>(\n  mapper: (element: T) => U,\n  downstream: Collector<U, A, R>\n): Collector<T, A, R> {\n  return {\n    supplier: downstream.supplier,\n    accumulator: (acc, element) => downstream.accumulator(acc, mapper(element)),\n    finisher: downstream.finisher,\n  };\n}\n\n/**\n * This function filters elements before collecting.\n */\nexport function filtering<T, A, R>(\n  predicate: (element: T) => boolean,\n  downstream: Collector<T, A, R>\n): Collector<T, A, R> {\n  return {\n    supplier: downstream.supplier,\n    accumulator: (acc, element) => {\n      return predicate(element) ? downstream.accumulator(acc, element) : acc;\n    },\n    finisher: downstream.finisher,\n  };\n}\n\n/**\n * FlatMaps elements before collecting.\n */\nexport function flatMapping<T, U, A, R>(\n  mapper: (element: T) => Iterable<U>,\n  downstream: Collector<U, A, R>\n): Collector<T, A, R> {\n  return {\n    supplier: downstream.supplier,\n    accumulator: (acc, element) => {\n      for (const mapped of mapper(element)) {\n        acc = downstream.accumulator(acc, mapped);\n      }\n      return acc;\n    },\n    finisher: downstream.finisher,\n  };\n}\n\n// ============================================================================\n// Reducing collectors\n// ============================================================================\n\n/**\n * General reduction collector.\n */\nexport function reducing<T>(\n  identity: T,\n  reducer: (acc: T, element: T) => T\n): Collector<T, T, T> {\n  return {\n    supplier: () => identity,\n    accumulator: (acc, element) => reducer(acc, element),\n    finisher: (acc) => acc,\n  };\n}\n\n/**\n * Reducing with mapper.\n */\nexport function reducingWith<T, U>(\n  identity: U,\n  mapper: (element: T) => U,\n  reducer: (acc: U, mapped: U) => U\n): Collector<T, U, U> {\n  return {\n    supplier: () => identity,\n    accumulator: (acc, element) => reducer(acc, mapper(element)),\n    finisher: (acc) => acc,\n  };\n}\n\n// ============================================================================\n// Composite collectors\n// ============================================================================\n\n/**\n * This function collects with two collectors and combines results.\n *\n * @example\n * const stats = collect(\n *   numbers,\n *   teeing(\n *     summingNumber(n => n),\n *     counting(),\n *     (sum, count) => ({ sum, count, avg: sum / count })\n *   )\n * )\n */\nexport function teeing<T, A1, A2, R1, R2, R>(\n  collector1: Collector<T, A1, R1>,\n  collector2: Collector<T, A2, R2>,\n  combiner: (r1: R1, r2: R2) => R\n): Collector<T, [A1, A2], R> {\n  return {\n    supplier: () => [collector1.supplier(), collector2.supplier()] as [A1, A2],\n    accumulator: ([acc1, acc2], element) => [\n      collector1.accumulator(acc1, element),\n      collector2.accumulator(acc2, element),\n    ],\n    finisher: ([acc1, acc2]) => {\n      return combiner(collector1.finisher(acc1), collector2.finisher(acc2));\n    },\n  };\n}\n\n// ============================================================================\n// Utility collectors\n// ============================================================================\n\n/**\n * This function collects the first element.\n */\nexport function first<T>(): Collector<T, T | undefined, T | undefined> {\n  return {\n    supplier: () => undefined,\n    accumulator: (first, element) => (first === undefined ? element : first),\n    finisher: (first) => first,\n  };\n}\n\n/**\n * This function collects the last element.\n */\nexport function last<T>(): Collector<T, T | undefined, T | undefined> {\n  return {\n    supplier: () => undefined,\n    accumulator: (_last, element) => element,\n    finisher: (last) => last,\n  };\n}\n\n/**\n * This type makes summary statistics.\n */\nexport interface SummaryStatistics {\n  count: number;\n  sum: number;\n  min: number;\n  max: number;\n  average: number;\n}\n\nexport function summarizingNumber<T>(\n  mapper: (element: T) => number\n): Collector<T, Partial<SummaryStatistics>, SummaryStatistics> {\n  return {\n    supplier: () => ({\n      count: 0,\n      sum: 0,\n      min: Infinity,\n      max: -Infinity,\n    }),\n    accumulator: (stats, element) => {\n      const value = mapper(element);\n      // The supplier sets every field. (Before, `stats.min || Infinity` treated a minimum of 0\n      // as missing: BUGS-2026-07 L16.)\n      stats.count = stats.count! + 1;\n      stats.sum = stats.sum! + value;\n      stats.min = Math.min(stats.min!, value);\n      stats.max = Math.max(stats.max!, value);\n      return stats;\n    },\n    finisher: (stats) => ({\n      count: stats.count!,\n      sum: stats.sum!,\n      min: stats.min!,\n      max: stats.max!,\n      average: stats.count! === 0 ? 0 : stats.sum! / stats.count!,\n    }),\n  };\n}\n","/**\n * Factory utilities for making collections.\n *\n * This module gives convenient factory methods similar to Java's Collections class.\n * These functions mirror Java methods like Collections.emptyList() and singletonList().\n */\n\nimport { arrayList, ArrayList } from \"../impl/array-list.js\";\nimport { arrayDeque, ArrayDeque } from \"../impl/array-deque.js\";\nimport { hashMap, HashMap } from \"../impl/hash-map.js\";\nimport type { List } from \"../interfaces/list.js\";\nimport type { Queue } from \"../interfaces/queue.js\";\nimport type { MapLike } from \"../interfaces/map.js\";\nimport { readonly } from \"../behaviors/readonly.js\";\nimport { compose } from \"../core/middleware.js\";\n\n// ============================================================================\n// Empty collections\n// ============================================================================\n\n/**\n * This value is an empty, immutable list.\n * Multiple calls return the same instance (singleton pattern).\n *\n * @example\n * const list = emptyList<number>()\n * list.size // 0\n * list.add(1) // Error: Cannot modify readonly collection\n */\nconst EMPTY_LIST_CACHE = new Map<any, any>();\n\nexport function emptyList<T>(): List<T> {\n  const key = \"list\";\n  if (!EMPTY_LIST_CACHE.has(key)) {\n    const list = compose(readonly<List<T>>())(arrayList<T>());\n    EMPTY_LIST_CACHE.set(key, list);\n  }\n  return EMPTY_LIST_CACHE.get(key);\n}\n\n/**\n * This value is an empty, immutable queue.\n */\nconst EMPTY_QUEUE_CACHE = new Map<any, any>();\n\nexport function emptyQueue<T>(): Queue<T> {\n  const key = \"queue\";\n  if (!EMPTY_QUEUE_CACHE.has(key)) {\n    const queue = compose(readonly<Queue<T>>())(arrayDeque<T>() as Queue<T>);\n    EMPTY_QUEUE_CACHE.set(key, queue);\n  }\n  return EMPTY_QUEUE_CACHE.get(key);\n}\n\n/**\n * This value is an empty, immutable map.\n */\nconst EMPTY_MAP_CACHE = new Map<any, any>();\n\nexport function emptyMap<K, V>(): MapLike<K, V> {\n  const key = \"map\";\n  if (!EMPTY_MAP_CACHE.has(key)) {\n    const map = compose(readonly<MapLike<K, V>>())(hashMap<K, V>());\n    EMPTY_MAP_CACHE.set(key, map);\n  }\n  return EMPTY_MAP_CACHE.get(key);\n}\n\n// ============================================================================\n// Singleton collections (single element)\n// ============================================================================\n\n/**\n * This function gives an immutable list containing only the specified element.\n *\n * @example\n * const list = singletonList(42)\n * list.size // 1\n * list.get(0) // 42\n * list.add(2) // Error: Cannot modify readonly collection\n */\nexport function singletonList<T>(element: T): List<T> {\n  const list = arrayList<T>();\n  list.add(element);\n  return compose(readonly<List<T>>())(list);\n}\n\n/**\n * This function gives an immutable map containing only the specified key-value mapping.\n */\nexport function singletonMap<K, V>(key: K, value: V): MapLike<K, V> {\n  const map = hashMap<K, V>();\n  map.set(key, value);\n  return compose(readonly<MapLike<K, V>>())(map);\n}\n\n// ============================================================================\n// N-copies collections\n// ============================================================================\n\n/**\n * This function gives an immutable list consisting of n copies of the specified element.\n *\n * @example\n * const list = nCopies(5, 'hello')\n * list.size // 5\n * list.get(2) // 'hello'\n */\nexport function nCopies<T>(n: number, element: T): List<T> {\n  if (n < 0) {\n    throw new Error(`n must be non-negative, got ${n}`);\n  }\n\n  const list = arrayList<T>();\n  for (let i = 0; i < n; i++) {\n    list.add(element);\n  }\n  return compose(readonly<List<T>>())(list);\n}\n\n// ============================================================================\n// Collection creation from iterables\n// ============================================================================\n\n/**\n * This function makes a new ArrayList from the given elements.\n *\n * @example\n * const list = listOf(1, 2, 3, 4, 5)\n */\nexport function listOf<T>(...elements: T[]): ArrayList<T> {\n  return arrayList(elements);\n}\n\n/**\n * This function makes a new ArrayDeque from the given elements.\n */\nexport function queueOf<T>(...elements: T[]): ArrayDeque<T> {\n  return arrayDeque(elements);\n}\n\n/**\n * This function makes a new HashMap from the given key-value pairs.\n *\n * @example\n * const map = mapOf(['a', 1], ['b', 2], ['c', 3])\n */\nexport function mapOf<K, V>(...entries: [K, V][]): HashMap<K, V> {\n  return hashMap(entries);\n}\n\n// ============================================================================\n// Mutable collection factories\n// ============================================================================\n\n/**\n * This function makes a new mutable ArrayList with optional initial elements.\n *\n * @example\n * const list = mutableListOf(1, 2, 3)\n * list.add(4)\n */\nexport function mutableListOf<T>(...elements: T[]): ArrayList<T> {\n  return arrayList(elements);\n}\n\n/**\n * This function makes a new mutable HashMap with optional initial entries.\n */\nexport function mutableMapOf<K, V>(...entries: [K, V][]): HashMap<K, V> {\n  return hashMap(entries);\n}\n\n// ============================================================================\n// Immutable collection factories\n// ============================================================================\n\n/**\n * This function makes an immutable List from the given elements.\n *\n * @example\n * const list = immutableListOf(1, 2, 3)\n * list.get(0) // 1\n * list.add(4) // Error: Cannot modify readonly collection\n */\nexport function immutableListOf<T>(...elements: T[]): List<T> {\n  if (elements.length === 0) {\n    return emptyList<T>();\n  }\n  if (elements.length === 1) {\n    return singletonList(elements[0]! as T);\n  }\n  const list = arrayList(elements);\n  return compose(readonly<List<T>>())(list);\n}\n\n/**\n * This function makes an immutable Map from the given entries.\n */\nexport function immutableMapOf<K, V>(...entries: [K, V][]): MapLike<K, V> {\n  if (entries.length === 0) {\n    return emptyMap<K, V>();\n  }\n  if (entries.length === 1) {\n    return singletonMap(entries[0]![0], entries[0]![1]);\n  }\n  const map = hashMap(entries);\n  return compose(readonly<MapLike<K, V>>())(map);\n}\n\n// ============================================================================\n// Range factories\n// ============================================================================\n\n/**\n * This function makes a list containing integers from start (inclusive) to end (exclusive).\n *\n * @example\n * const list = range(0, 5) // [0, 1, 2, 3, 4]\n * const list2 = range(10, 15) // [10, 11, 12, 13, 14]\n */\nexport function range(start: number, end: number, step: number = 1): ArrayList<number> {\n  if (step === 0) {\n    throw new Error(\"step cannot be zero\");\n  }\n\n  const list = arrayList<number>();\n\n  if (step > 0) {\n    for (let i = start; i < end; i += step) {\n      list.add(i);\n    }\n  } else {\n    for (let i = start; i > end; i += step) {\n      list.add(i);\n    }\n  }\n\n  return list;\n}\n\n/**\n * This function makes a list containing integers from 0 to n (exclusive).\n *\n * @example\n * const list = rangeTo(5) // [0, 1, 2, 3, 4]\n */\nexport function rangeTo(n: number): ArrayList<number> {\n  return range(0, n);\n}\n\n// ============================================================================\n// Collection builders\n// ============================================================================\n\n/**\n * Builder for constructing lists with a fluent API.\n *\n * @example\n * const list = buildList<number>((builder) => {\n *   builder.add(1)\n *   builder.add(2)\n *   if (someCondition) {\n *     builder.add(3)\n *   }\n * })\n */\nexport function buildList<T>(builder: (list: ArrayList<T>) => void): ArrayList<T> {\n  const list = arrayList<T>();\n  builder(list);\n  return list;\n}\n\n/**\n * Builder for constructing maps with a fluent API.\n */\nexport function buildMap<K, V>(builder: (map: HashMap<K, V>) => void): HashMap<K, V> {\n  const map = hashMap<K, V>();\n  builder(map);\n  return map;\n}\n\n// ============================================================================\n// Conversion utilities\n// ============================================================================\n\n/**\n * This function converts an iterable to an ArrayList.\n *\n * @example\n * const set = new Set([1, 2, 3])\n * const list = toList(set)\n */\nexport function toList<T>(iterable: Iterable<T>): ArrayList<T> {\n  return arrayList(iterable);\n}\n\n/**\n * This function converts an iterable to a HashMap using a key extractor function.\n *\n * @example\n * const users = [{ id: 1, name: 'Alice' }, { id: 2, name: 'Bob' }]\n * const userMap = toMap(users, u => u.id)\n */\nexport function toMap<T, K>(\n  iterable: Iterable<T>,\n  keyExtractor: (value: T) => K\n): HashMap<K, T>;\nexport function toMap<T, K, V>(\n  iterable: Iterable<T>,\n  keyExtractor: (value: T) => K,\n  valueExtractor: (value: T) => V\n): HashMap<K, V>;\nexport function toMap<T, K, V>(\n  iterable: Iterable<T>,\n  keyExtractor: (value: T) => K,\n  valueExtractor?: (value: T) => V\n): HashMap<K, any> {\n  const map = hashMap<K, any>();\n  for (const item of iterable) {\n    const key = keyExtractor(item);\n    const value = valueExtractor ? valueExtractor(item) : item;\n    map.set(key, value);\n  }\n  return map;\n}\n\n// ============================================================================\n// Grouping utilities\n// ============================================================================\n\n/**\n * This function groups elements by a key extractor function.\n *\n * @example\n * const users = [\n *   { age: 25, name: 'Alice' },\n *   { age: 30, name: 'Bob' },\n *   { age: 25, name: 'Charlie' }\n * ]\n * const byAge = groupBy(users, u => u.age)\n * // Map { 25 => [Alice, Charlie], 30 => [Bob] }\n */\nexport function groupBy<T, K>(\n  iterable: Iterable<T>,\n  keyExtractor: (value: T) => K\n): HashMap<K, ArrayList<T>> {\n  const map = hashMap<K, ArrayList<T>>();\n\n  for (const item of iterable) {\n    const key = keyExtractor(item);\n    const list = map.computeIfAbsent(key, () => arrayList<T>());\n    list.add(item);\n  }\n\n  return map;\n}\n","/**\n * Common helper utilities for collections.\n *\n * This module gives shared functionality to reduce code duplication across implementations.\n */\n\nimport type { Eq } from \"../core/traits.js\";\n\n// ============================================================================\n// Bounds checking utilities\n// ============================================================================\n\n/**\n * Checks if an index is within valid bounds [0, size).\n * This function throws RangeError if out of bounds.\n *\n * @param index The index to check\n * @param size The size of the collection\n * @param collectionName Optional name for error message\n * @throws RangeError if index is out of bounds\n */\nexport function checkBounds(index: number, size: number, collectionName: string = \"Collection\"): void {\n  if (index < 0 || index >= size) {\n    throw new RangeError(`${collectionName}: Index ${index} out of bounds [0, ${size})`);\n  }\n}\n\n/**\n * Checks if an index is valid for insertion [0, size].\n * In this function, index === size is correct for append operations.\n *\n * @param index The index to check\n * @param size The size of the collection\n * @param collectionName Optional name for error message\n * @throws RangeError if index is out of bounds\n */\nexport function checkInsertBounds(index: number, size: number, collectionName: string = \"Collection\"): void {\n  if (index < 0 || index > size) {\n    throw new RangeError(`${collectionName}: Index ${index} out of bounds [0, ${size}]`);\n  }\n}\n\n/**\n * Checks if a range [start, end) is valid.\n *\n * @param start Start index (inclusive)\n * @param end End index (exclusive)\n * @param size The size of the collection\n * @param collectionName Optional name for error message\n * @throws RangeError if range is invalid\n */\nexport function checkRangeBounds(\n  start: number,\n  end: number,\n  size: number,\n  collectionName: string = \"Collection\"\n): void {\n  if (start < 0 || end > size || start > end) {\n    throw new RangeError(\n      `${collectionName}: Invalid range [${start}, ${end}) for size ${size}`\n    );\n  }\n}\n\n// ============================================================================\n// Equality and search utilities\n// ============================================================================\n\n/**\n * This function finds the index of an element in an array using custom equality.\n *\n * @param array The array to search\n * @param element The element to find\n * @param eq Equality function\n * @returns Index of element, or -1 if not found\n */\nexport function findIndex<T>(array: T[], element: T, eq: Eq<T>): number {\n  for (let i = 0; i < array.length; i++) {\n    if (eq(array[i]!, element)) {\n      return i;\n    }\n  }\n  return -1;\n}\n\n/**\n * This function finds the last index of an element in an array using custom equality.\n *\n * @param array The array to search\n * @param element The element to find\n * @param eq Equality function\n * @returns Last index of element, or -1 if not found\n */\nexport function findLastIndex<T>(array: T[], element: T, eq: Eq<T>): number {\n  for (let i = array.length - 1; i >= 0; i--) {\n    if (eq(array[i]!, element)) {\n      return i;\n    }\n  }\n  return -1;\n}\n\n/**\n * Checks if an array contains an element using custom equality.\n *\n * @param array The array to search\n * @param element The element to find\n * @param eq Equality function\n * @returns true if element is found\n */\nexport function arrayContains<T>(array: T[], element: T, eq: Eq<T>): boolean {\n  return findIndex(array, element, eq) !== -1;\n}\n\n/**\n * This function removes the first occurrence of an element from an array.\n *\n * @param array The array to change\n * @param element The element to remove\n * @param eq Equality function\n * @returns true if element was found and removed\n */\nexport function arrayRemove<T>(array: T[], element: T, eq: Eq<T>): boolean {\n  const index = findIndex(array, element, eq);\n  if (index === -1) return false;\n  array.splice(index, 1);\n  return true;\n}\n\n/**\n * This function removes all occurrences of an element from an array.\n *\n * @param array The array to change\n * @param element The element to remove\n * @param eq Equality function\n * @returns Number of elements removed\n */\nexport function arrayRemoveAll<T>(array: T[], element: T, eq: Eq<T>): number {\n  let count = 0;\n  for (let i = array.length - 1; i >= 0; i--) {\n    if (eq(array[i]!, element)) {\n      array.splice(i, 1);\n      count++;\n    }\n  }\n  return count;\n}\n\n// ============================================================================\n// Iterator utilities\n// ============================================================================\n\n/**\n * This function makes a simple iterator for an array.\n *\n * @param array The array to iterate\n * @returns Iterator over the array\n */\nexport function* arrayIterator<T>(array: T[]): Iterator<T> {\n  yield* array;\n}\n\n/**\n * This function makes a reversed iterator for an array.\n *\n * @param array The array to iterate\n * @returns Reversed iterator over the array\n */\nexport function* reverseArrayIterator<T>(array: T[]): Iterator<T> {\n  for (let i = array.length - 1; i >= 0; i--) {\n    yield array[i]!;\n  }\n}\n\n/**\n * This function converts an iterable to an array.\n *\n * @param iterable The iterable to convert\n * @returns Array containing all elements\n */\nexport function toArray<T>(iterable: Iterable<T>): T[] {\n  return Array.from(iterable);\n}\n\n// ============================================================================\n// Validation utilities\n// ============================================================================\n\n/**\n * This function makes sure that a value is not null or undefined.\n *\n * @param value The value to check\n * @param message Error message\n * @returns The non-null value\n * @throws Error if value is null or undefined\n */\nexport function requireNonNull<T>(value: T | null | undefined, message: string = \"Value cannot be null or undefined\"): T {\n  if (value === null || value === undefined) {\n    throw new Error(message);\n  }\n  return value;\n}\n\n/**\n * This function makes sure that a collection is not empty.\n *\n * @param size Current size\n * @param collectionName Optional name for error message\n * @throws Error if collection is empty\n */\nexport function requireNonEmpty(size: number, collectionName: string = \"Collection\"): void {\n  if (size === 0) {\n    throw new Error(`${collectionName} is empty`);\n  }\n}\n\n// ============================================================================\n// Math utilities\n// ============================================================================\n\n/**\n * This function clamps a value between min and max.\n *\n * @param value The value to clamp\n * @param min Minimum value\n * @param max Maximum value\n * @returns Clamped value\n */\nexport function clamp(value: number, min: number, max: number): number {\n  return Math.max(min, Math.min(max, value));\n}\n\n/**\n * This function calculates hash code for a string.\n * This function uses Java's String.hashCode() algorithm.\n *\n * @param str The string to hash\n * @returns Hash code\n */\nexport function stringHashCode(str: string): number {\n  let hash = 0;\n  for (let i = 0; i < str.length; i++) {\n    const char = str.charCodeAt(i);\n    hash = ((hash << 5) - hash) + char;\n    hash = hash & hash; // Convert to 32-bit integer\n  }\n  return hash;\n}\n"],"mappings":";;;;;AAyCA,MAAa,OAAa,OAAO,OAAO,EAAE,MAAM,OAAO,CAAC;;;;AAKxD,MAAa,QAAW,UACtB,OAAO,OAAO;CAAE,MAAM;CAAQ;AAAM,CAAC;;;;AAKvC,MAAa,UAAa,QAAgC,IAAI,SAAS;;;;AAKvE,MAAa,UAAa,QACxB,IAAI,SAAS;;;;AAKf,MAAa,aAAgB,KAAgB,iBAC3C,OAAO,GAAG,IAAI,IAAI,QAAQ;;;;AAK5B,MAAa,UAAa,QAAsB;CAC9C,IAAI,OAAO,GAAG,GAAG,OAAO,IAAI;CAC5B,MAAM,IAAI,MAAM,uBAAuB;AACzC;;;;AAKA,MAAa,aACX,KACA,MACe,OAAO,GAAG,IAAI,KAAK,EAAE,IAAI,KAAK,CAAC,IAAI;;;;AAKpD,MAAa,iBACX,KACA,MACe,OAAO,GAAG,IAAI,EAAE,IAAI,KAAK,IAAI;;;;AAK9C,MAAa,gBAAmB,UAC9B,SAAS,OAAO,OAAO,KAAK,KAAK;;;;AAKnC,MAAa,cAAiB,QAC5B,OAAO,GAAG,IAAI,IAAI,QAAQ,KAAA;;;;AAyC5B,MAAa,MAAS,UACpB,OAAO,OAAO;CACZ,MAAM;CACN;CACA,QAAW,MACT,EAAE,GAAG,KAAK;AACd,CAAC;;;;AAKH,MAAa,OAAU,UACrB,OAAO,OAAO;CACZ,MAAM;CACN;CACA,QAAW,MACT,EAAE,IAAI,KAAK;AACf,CAAC;;;;AAKH,MAAa,QAAc,WACzB,OAAO,SAAS;;;;AAKlB,MAAa,SAAe,WAC1B,OAAO,SAAS;;;;AAKlB,MAAa,mBACX,QACA,iBACO,KAAK,MAAM,IAAI,OAAO,QAAQ;;;;AAKvC,MAAa,gBAAsB,WAA4B;CAC7D,IAAI,KAAK,MAAM,GAAG,OAAO,OAAO;CAChC,MAAM,OAAO;AACf;;;;AAKA,MAAa,aACX,QACA,MACkB,KAAK,MAAM,IAAI,GAAG,EAAE,OAAO,KAAK,CAAC,IAAI;;;;AAKzD,MAAa,YACX,QACA,MACkB,MAAM,MAAM,IAAI,IAAI,EAAE,OAAO,KAAK,CAAC,IAAI;;;;AAK3D,MAAa,iBACX,QACA,MACkB,KAAK,MAAM,IAAI,EAAE,OAAO,KAAK,IAAI;;;;AAKrD,MAAa,YACX,IACA,YACiB;CACjB,IAAI;EACF,OAAO,GAAG,GAAG,CAAC;CAChB,SAAS,OAAO;EACd,OAAO,IAAK,UAAU,QAAQ,KAAK,IAAI,KAAW;CACpD;AACF;;;;AAKA,MAAa,gBAAgB,OAC3B,IACA,YAC0B;CAC1B,IAAI;EACF,OAAO,GAAG,MAAM,GAAG,CAAC;CACtB,SAAS,OAAO;EACd,OAAO,IAAK,UAAU,QAAQ,KAAK,IAAI,KAAW;CACpD;AACF;;;;AAmBA,MAAa,iBAAiB,OAC5B,KACA,MACmB;CACnB,MAAM,WAAW,MAAM;CACvB,IAAI,OAAO,QAAQ,GACjB,OAAO,KAAK,MAAM,EAAE,SAAS,KAAK,CAAC;CAErC,OAAO;AACT;;;;AAKA,MAAa,iBAAiB,OAC5B,QACA,MACsB;CACtB,MAAM,WAAW,MAAM;CACvB,IAAI,KAAK,QAAQ,GACf,OAAO,GAAG,MAAM,EAAE,SAAS,KAAK,CAAC;CAEnC,OAAO;AACT;;;;;AAUA,MAAa,kBAAwB,KAAgB,UACnD,OAAO,GAAG,IAAI,GAAG,IAAI,KAAK,IAAI,IAAI,KAAK;;;;;AAMzC,MAAa,kBAAwB,WACnC,KAAK,MAAM,IAAI,KAAK,OAAO,KAAK,IAAI;;;;;AAMtC,MAAa,YAAe,SAAmC;CAC7D,MAAM,SAAc,CAAC;CACrB,KAAK,MAAM,OAAO,MAAM;EACtB,IAAI,OAAO,GAAG,GAAG,OAAO;EACxB,OAAO,KAAK,IAAI,KAAK;CACvB;CACA,OAAO,KAAK,MAAM;AACpB;;;;;AAMA,MAAa,mBACX,YACmB;CACnB,MAAM,SAAc,CAAC;CACrB,KAAK,MAAM,UAAU,SAAS;EAC5B,IAAI,MAAM,MAAM,GAAG,OAAO;EAC1B,OAAO,KAAK,OAAO,KAAK;CAC1B;CACA,OAAO,GAAG,MAAM;AAClB;;;;;ACnDA,MAAa,0BAA0C;;;;AAKvD,MAAa,2BAA4C;;;;AAKzD,MAAa,0BAA0C;;;;AAKvD,MAAa,uBAAoC;CAC/C,aAAa;CACb,cAAc;CACd,SAAS;CACT,UAAU;CACV,QAAQ;AACV;;;;AAKA,MAAa,0BACX;;;;AAKF,MAAa,wBAAsC;CACjD,UAAU;CACV,aAAa,OAAO;AACtB;;;;AAKA,MAAa,4BAA8C;;;;;;;;;;;;;;;;;;;;;;;;;;;AC1P3D,SAAgB,QAA0C,GAAG,QAAkC;CAC7F,OAAOA,UAAK,GAAI,MAA2B;AAC7C;;;;;;;;;;;AAYA,MAAa,iBACX,YACA,eACyC;CACzC,OAAO,cAAc;AACvB;;;;;;;;;;;;;AAsFA,MAAa,oBACX,QACA,gBACM;CACN,OAAO,IAAI,MAAM,QAAQ,EACvB,IAAI,GAAG,MAAM,UAAU;EACrB,MAAM,QAAQ,QAAQ,IAAI,GAAG,MAAM,QAAQ;EAC3C,IAAI,OAAO,UAAU,cAAc,OAAO,SAAS,UACjD,OAAO,SAAyB,GAAG,MAAiB;GAClD,OAAO,YAAY,GAAG,MAAiB,IAAI;EAC7C;EAEF,OAAO;CACT,EACF,CAAC;AACH;;;;;;;AAQA,MAAa,gBACX,QACA,iBACA,eAAuB,4BACjB;CACN,OAAO,IAAI,MAAM,QAAQ,EACvB,IAAI,GAAG,MAAM,UAAU;EACrB,MAAM,QAAQ,QAAQ,IAAI,GAAG,MAAM,QAAQ;EAC3C,IAAI,OAAO,UAAU,cAAc,gBAAgB,IAAI,IAAI,GACzD,aAAa;GACX,MAAM,IAAI,MAAM,YAAY;EAC9B;EAEF,OAAO;CACT,EACF,CAAC;AACH;;;;;AAMA,MAAa,YACX,QACA,YACM;CACN,OAAO,IAAI,MAAM,QAAQ,EACvB,IAAI,GAAG,MAAM,UAAU;EAErB,IAAI,QAAQ,SACV,OAAO,QAAQ,IAAI,SAAS,MAAM,QAAQ;EAG5C,MAAM,QAAQ,QAAQ,IAAI,GAAG,MAAM,QAAQ;EAE3C,IAAI,OAAO,UAAU,YACnB,OAAO,MAAM,KAAK,CAAC;EAErB,OAAO;CACT,EACF,CAAC;AACH;;;;;;;;;;;;;;;;;;;;;;;AA6BA,IAAsB,oBAAtB,MAA2C;CACzC,aAAwC,CAAC;;;;CAKzC,IAAI,YAAiC;EACnC,KAAK,WAAW,KAAK,UAAU;EAC/B,OAAO;CACT;AAMF;;;;;;;;;;AAWA,MAAa,iBACX,YACA,aAMkB;CAClB,QAAQ,SAAe;EAErB,OAAO,IAAI,MAAM,MAAM,EACrB,IAAI,QAAQ,MAAM,UAAU;GAC1B,MAAM,QAAQ,QAAQ,IAAI,QAAQ,MAAM,QAAQ;GAChD,IAAI,SAAS,cAAc,OAAO,UAAU,YAC1C,OAAO,SAAyB,GAAG,MAAiB;IAClD,OAAO,SAAS,MAAM,KAAK,MAAM,GAAG,IAAkB;GACxD;GAEF,OAAO;EACT,EACF,CAAC;CACH;AACF;;;;;;;;;;;;;;;;;AAkBA,MAAa,SAAyB;;;;;;;;;;;;;;;;;;;;;;;;ACtRtC,IAAa,UAAb,MAAyC;CACvC,4BAAoB,IAAI,IAAiC;;;;;;;;CASzD,GAAsB,OAAU,UAAuC;EACrE,IAAI,YAAY,KAAK,UAAU,IAAI,KAAK;EACxC,IAAI,CAAC,WAAW;GACd,4BAAY,IAAI,IAAI;GACpB,KAAK,UAAU,IAAI,OAAO,SAAS;EACrC;EACA,UAAU,IAAI,QAAQ;EAGtB,aAAa;GACX,UAAW,OAAO,QAAQ;GAE1B,IAAI,UAAW,SAAS,GACtB,KAAK,UAAU,OAAO,KAAK;EAE/B;CACF;;;;;;;;CASA,KAAwB,OAAU,UAAuC;EACvE,MAAM,mBAAmC,YAAY;GACnD,YAAY;GACZ,SAAS,OAAO;EAClB;EAEA,MAAM,cAAc,KAAK,GAAG,OAAO,eAAe;EAClD,OAAO;CACT;;;;;;;CAQA,KAAwB,OAAU,SAAqB;EACrD,MAAM,YAAY,KAAK,UAAU,IAAI,KAAK;EAC1C,IAAI,WAAW;GAEb,MAAM,WAAW,MAAM,KAAK,SAAS;GACrC,KAAK,MAAM,YAAY,UACrB,IAAI;IACF,SAAS,OAAO;GAClB,SAAS,OAAO;IAEd,QAAQ,MACN,gCAAgC,OAAO,KAAK,EAAE,KAC9C,KACF;GACF;EAEJ;CACF;;;;;;CAOA,IAAuB,OAAiB;EACtC,IAAI,UAAU,KAAA,GACZ,KAAK,UAAU,OAAO,KAAK;OAE3B,KAAK,UAAU,MAAM;CAEzB;;;;;;;CAQA,cAAiC,OAAkB;EACjD,OAAO,KAAK,UAAU,IAAI,KAAK,CAAC,EAAE,QAAQ;CAC5C;;;;CAKA,aAA0B;EACxB,OAAO,MAAM,KAAK,KAAK,UAAU,KAAK,CAAC;CACzC;;;;CAKA,aAAgC,OAAmB;EACjD,OAAO,KAAK,cAAc,KAAK,IAAI;CACrC;;;;CAKA,UAAgB;EACd,KAAK,UAAU,MAAM;CACvB;AACF;;;;;;;;;AAUA,MAAa,sBAAsD;CACjE,OAAO,IAAI,QAAW;AACxB;;;;;;;;;;;AAYA,IAAa,eAAb,MAAiE;CAC/D;CACA;CACA;CACA,QAAwB,CAAC;CACzB,QAAsD;CAEtD,YACE,SACA,OACA,SACA;EACA,KAAK,UAAU;EACf,KAAK,QAAQ;EACb,KAAK,UAAU;CACjB;;;;CAKA,MAAM,SAAqB;EACzB,KAAK,MAAM,KAAK,OAAO;EAEvB,IAAI,KAAK,UAAU,MACjB,KAAK,QAAQ,iBAAiB,KAAK,MAAM,GAAG,KAAK,OAAO;CAE5D;;;;CAKA,QAAc;EACZ,IAAI,KAAK,UAAU,MAAM;GACvB,aAAa,KAAK,KAAK;GACvB,KAAK,QAAQ;EACf;EAEA,IAAI,KAAK,MAAM,SAAS,GAAG;GACzB,MAAM,aAAa,SAAS,OAAO,KAAK,KAAK;GAC7C,KAAK,QAAQ,KAAK,YAAY,KAAK,KAAY;GAC/C,KAAK,QAAQ,CAAC;EAChB;CACF;;;;CAKA,UAAgB;EACd,KAAK,MAAM;CACb;AACF;;;;;;;;;;;;;;AAeA,IAAa,eAAb,MAA8C;CAC5C,4BAAoB,IAAI,IAAiC;CAEzD,GAAsB,OAAU,UAAuC;EACrE,IAAI,YAAY,KAAK,UAAU,IAAI,KAAK;EACxC,IAAI,CAAC,WAAW;GACd,4BAAY,IAAI,IAAI;GACpB,KAAK,UAAU,IAAI,OAAO,SAAS;EACrC;EACA,UAAU,IAAI,QAAQ;EAEtB,aAAa;GACX,UAAW,OAAO,QAAQ;GAC1B,IAAI,UAAW,SAAS,GACtB,KAAK,UAAU,OAAO,KAAK;EAE/B;CACF;;;;;;;;CASA,MAAM,KAAwB,OAAU,SAA8B;EACpE,MAAM,YAAY,KAAK,UAAU,IAAI,KAAK;EAC1C,IAAI,WAAW;GACb,MAAM,WAAW,MAAM,KAAK,SAAS,CAAC,CAAC,KAAK,aAC1C,QAAQ,QAAQ,CAAC,CAAC,WAAW,SAAS,OAAO,CAAC,CAChD;GACA,MAAM,QAAQ,IAAI,QAAQ;EAC5B;CACF;CAEA,IAAuB,OAAiB;EACtC,IAAI,UAAU,KAAA,GACZ,KAAK,UAAU,OAAO,KAAK;OAE3B,KAAK,UAAU,MAAM;CAEzB;CAEA,cAAiC,OAAkB;EACjD,OAAO,KAAK,UAAU,IAAI,KAAK,CAAC,EAAE,QAAQ;CAC5C;CAEA,aAA0B;EACxB,OAAO,MAAM,KAAK,KAAK,UAAU,KAAK,CAAC;CACzC;CAEA,UAAgB;EACd,KAAK,UAAU,MAAM;CACvB;AACF;;;;;;;;;;;AAYA,MAAa,gBAMX,QACA,QACA,aACA,aACA,cACgB;CAChB,OAAO,OAAO,GAAG,cAAc,YAAY;EACzC,MAAM,qBAAqB,YACvB,UAAU,OAAO,IAChB;EACL,OAAO,KAAK,aAAa,kBAAkB;CAC7C,CAAC;AACH;;;;;;;;;;;AAYA,MAAa,UACX,SACA,OACA,WACA,aACgB;CAChB,OAAO,QAAQ,GAAG,QAAQ,YAAY;EACpC,IAAI,UAAU,OAAO,GACnB,SAAS,OAAO;CAEpB,CAAC;AACH;;;;;;;AC7VA,MAAa,uBAA6C,UAAU;CAClE,qBAAqB;EACnB,MAAM;CACR,CAAC;AACH;;;;;;;;;AAUA,IAAa,mBAAb,MAAiC;CAC/B,4BAA6B,IAAI,IAA+C;CAChF;;CAGA,YAAY,UAAgC,qBAAqB;EAC/D,KAAK,UAAU;CACjB;;CAGA,IAAI,OAAe;EACjB,OAAO,KAAK,UAAU;CACxB;;;;;;CAOA,IAAI,UAA0C;EAC5C,MAAM,QAAQ,EAAE,SAAS;EACzB,KAAK,UAAU,IAAI,KAAK;EACxB,aAAa;GACX,KAAK,UAAU,OAAO,KAAK;EAC7B;CACF;;CAGA,KAAK,OAAgB;EACnB,KAAK,MAAM,SAAS,CAAC,GAAG,KAAK,SAAS,GAAG;GAEvC,IAAI,CAAC,KAAK,UAAU,IAAI,KAAK,GAAG;GAChC,IAAI;IACF,MAAM,SAAS,KAAK;GACtB,SAAS,OAAO;IACd,KAAK,QAAQ,KAAK;GACpB;EACF;CACF;;CAGA,QAAc;EACZ,KAAK,UAAU,MAAM;CACvB;AACF;;;;;;;;;;;;;;;;;;;ACrDA,MAAa,aAAa;AAE1B,MAAM,OAAO,WAAW;AACxB,MAAM,OAAO,WAAW;;AAExB,MAAM,mBAAmB,IAAI,KAAK,OAAO,EAAE;AAE3C,SAAS,QAAQ,SAA6B;CAC5C,OAAO,IAAI,WAAW,OAAO;AAC/B;;AAGA,SAAS,cAAc,MAAsB;CAC3C,IAAI,QAAQ,OAAO,QAAQ,KAAK,OAAO,KAAK,WAAW,CAAC,IAAI,IAAI,WAAW,CAAC,IAAI;CAChF,IAAI,QAAQ,OAAO,QAAQ,KAAK,OAAO,IAAI,WAAW,CAAC,IAAI,KAAK,WAAW,CAAC,IAAI;CAChF,MAAM,QAAQ,4BAA4B,KAAK,EAAE;AACnD;AAEA,SAAS,YAAY,KAAqB;CACxC,MAAM,SAAS,cAAc,IAAI,MAAM,EAAE;CACzC,IAAI,SAAS,IAAI,QAAQ,MAAM,QAAQ,YAAY,IAAI,oCAAoC;CAC3F,OAAO,IAAI,MAAM,GAAG,MAAM;AAC5B;AAEA,SAAS,YAAY,KAAmB;CACtC,IAAI,OAAO,QAAQ,YAAY,QAAQ,IAAI,MAAM,QAAQ,qCAAqC;CAC9F,KAAK,MAAM,KAAK,KAAK,IAAI,CAAA,iEAAY,SAAS,CAAC,GAAG,MAAM,QAAQ,YAAY,IAAI,4CAA4C;CAC5H,IAAI,QAAQ,kBAAkB,MAAM,QAAQ,YAAY,IAAI,cAAc;CAE1E,IADiB,IAAI,MAAM,YAAY,GAAG,CAAC,CAAC,MACjC,CAAC,CAAC,SAAS,IAAI,GAAG,MAAM,QAAQ,iCAAiC,IAAI,cAAc,MAAM;AACtG;;AAGA,SAAS,SAAS,GAAW,GAA0B;CACrD,IAAI,MAAM,MAAM;EACd,IAAI,IAAI;EACR,QAAQ,EAAE,MAAM,UAAU,EAAE,IAAI;EAChC,IAAI,IAAI,GAAG,OAAO,EAAE,MAAM,GAAG,CAAC,IAAI,SAAS,EAAE,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;CACnE;CACA,MAAM,SAAS,IAAI,WAAW,QAAQ,EAAE,EAAG,IAAI;CAC/C,MAAM,SAAS,MAAM,OAAO,WAAW,QAAQ,EAAE,EAAG,IAAI;CACxD,IAAI,SAAS,SAAS,GAAG,OAAO,WAAW,KAAK,OAAO,SAAS,UAAU,CAAC;CAE3E,IAAI,MAAM,QAAQ,EAAE,SAAS,GAAG,OAAO,EAAE,MAAM,GAAG,CAAC;CACnD,OAAO,WAAW,UAAW,SAAS,EAAE,MAAM,CAAC,GAAG,IAAI;AACxD;AAEA,SAAS,iBAAiB,GAA0B;CAClD,MAAM,CAAC,MAAM,GAAG,UAAU,EAAE,MAAM,EAAE;CACpC,IAAI,QAAQ;CACZ,KAAK,IAAI,IAAI,OAAO,SAAS,GAAG,SAAS,KAAK,GAAG,KAAK;EACpD,MAAM,IAAI,WAAW,QAAQ,OAAO,EAAG,IAAI;EAC3C,IAAI,MAAM,IAAmB,OAAO,KAAK;OACpC;GACH,OAAO,KAAK,WAAW;GACvB,QAAQ;EACV;CACF;CACA,IAAI,CAAC,OAAO,OAAO,OAAO,OAAO,KAAK,EAAE;CACxC,IAAI,SAAS,KAAK,OAAO,IAAI;CAC7B,IAAI,SAAS,KAAK,OAAO;CACzB,MAAM,OAAO,OAAO,aAAa,KAAK,WAAW,CAAC,IAAI,CAAC;CACvD,IAAI,OAAO,KAAK,OAAO,KAAK,IAAI;MAC3B,OAAO,IAAI;CAChB,OAAO,OAAO,OAAO,KAAK,EAAE;AAC9B;AAEA,SAAS,iBAAiB,GAA0B;CAClD,MAAM,CAAC,MAAM,GAAG,UAAU,EAAE,MAAM,EAAE;CACpC,IAAI,SAAS;CACb,KAAK,IAAI,IAAI,OAAO,SAAS,GAAG,UAAU,KAAK,GAAG,KAAK;EACrD,MAAM,IAAI,WAAW,QAAQ,OAAO,EAAG,IAAI;EAC3C,IAAI,MAAM,IAAI,OAAO,KAAK;OACrB;GACH,OAAO,KAAK,WAAW;GACvB,SAAS;EACX;CACF;CACA,IAAI,CAAC,QAAQ,OAAO,OAAO,OAAO,KAAK,EAAE;CACzC,IAAI,SAAS,KAAK,OAAO,IAAI;CAC7B,IAAI,SAAS,KAAK,OAAO;CACzB,MAAM,OAAO,OAAO,aAAa,KAAK,WAAW,CAAC,IAAI,CAAC;CACvD,IAAI,OAAO,KAAK,OAAO,KAAK,IAAI;MAC3B,OAAO,IAAI;CAChB,OAAO,OAAO,OAAO,KAAK,EAAE;AAC9B;;;;;;;;;;;;;;AAeA,SAAgB,WAAW,MAAiC,MAAyC;CACnG,MAAM,IAAI,QAAQ;CAClB,MAAM,IAAI,QAAQ;CAClB,IAAI,MAAM,MAAM,YAAY,CAAC;CAC7B,IAAI,MAAM,MAAM,YAAY,CAAC;CAC7B,IAAI,MAAM,QAAQ,MAAM,QAAQ,KAAK,GAAG,MAAM,QAAQ,YAAY,EAAE,2BAA2B,EAAE,EAAE;CACnG,IAAI,MAAM,MAAM;EACd,IAAI,MAAM,MAAM,OAAO,IAAI;EAC3B,MAAM,KAAK,YAAY,CAAC;EACxB,MAAM,KAAK,EAAE,MAAM,GAAG,MAAM;EAC5B,IAAI,OAAO,kBAAkB,OAAO,KAAK,SAAS,IAAI,EAAE;EACxD,IAAI,KAAK,GAAG,OAAO;EACnB,MAAM,cAAc,iBAAiB,EAAE;EACvC,IAAI,gBAAgB,MAAM,MAAM,QAAQ,8BAA8B;EACtE,OAAO;CACT;CACA,MAAM,KAAK,YAAY,CAAC;CACxB,MAAM,KAAK,EAAE,MAAM,GAAG,MAAM;CAC5B,IAAI,MAAM,MAAM;EACd,MAAM,cAAc,iBAAiB,EAAE;EACvC,OAAO,gBAAgB,OAAO,KAAK,SAAS,IAAI,IAAI,IAAI;CAC1D;CACA,MAAM,KAAK,YAAY,CAAC;CACxB,MAAM,KAAK,EAAE,MAAM,GAAG,MAAM;CAC5B,IAAI,OAAO,IAAI,OAAO,KAAK,SAAS,IAAI,EAAE;CAC1C,MAAM,cAAc,iBAAiB,EAAE;CACvC,IAAI,gBAAgB,MAAM,MAAM,QAAQ,6BAA6B;CACrE,IAAI,cAAc,GAAG,OAAO;CAC5B,OAAO,KAAK,SAAS,IAAI,IAAI;AAC/B;;;;;;;AAQA,SAAgB,YAAY,MAAiC,MAAiC,OAAyB;CACrH,IAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,GAAG,MAAM,QAAQ,mDAAmD,OAAO;CACnH,MAAM,IAAI,QAAQ;CAClB,MAAM,IAAI,QAAQ;CAClB,IAAI,UAAU,GAAG,OAAO,CAAC;CACzB,IAAI,UAAU,GAAG,OAAO,CAAC,WAAW,GAAG,CAAC,CAAC;CACzC,IAAI,MAAM,MAAM;EACd,MAAM,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC;EACjC,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK,KAAK,KAAK,WAAW,KAAK,IAAI,IAAK,IAAI,CAAC;EACxE,OAAO;CACT;CACA,IAAI,MAAM,MAAM;EACd,MAAM,OAAO,CAAC,WAAW,MAAM,CAAC,CAAC;EACjC,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK,KAAK,KAAK,WAAW,MAAM,KAAK,IAAI,EAAG,CAAC;EACxE,OAAO,KAAK,QAAQ;CACtB;CACA,MAAM,OAAO,KAAK,MAAM,QAAQ,CAAC;CACjC,MAAM,SAAS,WAAW,GAAG,CAAC;CAC9B,OAAO;EAAC,GAAG,YAAY,GAAG,QAAQ,IAAI;EAAG;EAAQ,GAAG,YAAY,QAAQ,GAAG,QAAQ,OAAO,CAAC;CAAC;AAC9F;;;;;AAYA,SAAgB,WAAW,KAAc,UAA2B,CAAC,GAAkB;CACrF,IAAI,OAAO,QAAQ,YAAY,IAAI,UAAU,QAAQ,aAAa,OAAO,OAAO;CAChF,IAAI;EACF,YAAY,GAAG;EACf,OAAO;CACT,QAAQ;EACN,OAAO;CACT;AACF;;;;;;;;;;;;;;;;;;;;AA2BA,SAAgB,YAAY,OAA6B,OAAe,UAAsD;CAC5H,IAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,KAAK,QAAQ,MAAM,QAAQ,MAAM,QAAQ,aAAa,MAAM,0BAA0B,MAAM,OAAO,OAAO;CAClJ,IAAI,MAAM,MAAM,SAAS,KAAK,OAAO,QAAQ,GAAG,MAAM,QAAQ,uCAAuC,SAAS,EAAE;CAChH,MAAM,OAAO,MAAM,QAAQ,EAAE,EAAE,OAAO;CAEtC,IAAI,MAAM;CACV,OAAO,MAAM,MAAM,UAAU,SAAS,QAAQ,MAAM,IAAI,CAAE,OAAO,MAAM;CACvE,MAAM,SAA6C,CAAC;CACpD,IAAI,MAAM,OAAO;EACf,MAAM,OAAO,YAAY,MAAM,MAAM,IAAI,EAAE,OAAO,MAAM,MAAM,KAAK;EACnE,KAAK,IAAI,IAAI,OAAO,IAAI,KAAK,KAAK,OAAO,KAAK;GAAE,IAAI,MAAM,EAAE,CAAE;GAAI,KAAK,KAAK,IAAI;EAAQ,CAAC;CAC3F;CACA,MAAM,OAAO,OAAO,SAAS,IAAI,OAAO,EAAE,CAAE,MAAO,MAAM,MAAM,EAAE,OAAO;CACxE,OAAO,KAAK;EAAE,IAAI;EAAU,KAAK,WAAW,MAAM,IAAI;CAAE,CAAC;CACzD,OAAO;AACT;;AAGA,SAAgB,YAAY,GAAW,GAAmB;CACxD,OAAO,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI;AAClC;;;;;;;;;;;;;;;AAsBA,SAAgB,UAAU,OAAc,SAA2B,eAAe,IAAY;CAC5F,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;EACvC,MAAM,IAAI,QAAQ;EAClB,IAAI,MAAM,IAAI,EAAE,IAAI,cAAc,OAAO;EACzC,IAAI,KAAK,IAAI,MAAM,IAAI,EAAE,CAAC,KAAK,gBAAgB,MAAM,IAAI,EAAE,GAAG,OAAO;CACvE;CACA,OAAO,QAAQ;AACjB;;;;;;AC7PA,MAAa,aAAsB,GAAG,MAAM,MAAM;;;;;AAMlD,MAAa,aAAsB,GAAG,MAAM;CAC1C,IAAI,MAAM,GAAG,OAAO;CACpB,IAAI,OAAO,MAAM,YAAY,OAAO,MAAM,UAAU,OAAO;CAC3D,IAAI,MAAM,QAAQ,MAAM,MAAM,OAAO;CAErC,MAAM,QAAQ,OAAO,KAAK,CAAC;CAC3B,MAAM,QAAQ,OAAO,KAAK,CAAC;CAE3B,IAAI,MAAM,WAAW,MAAM,QAAQ,OAAO;CAE1C,KAAK,MAAM,OAAO,OAAO;EACvB,IAAI,CAAC,OAAO,UAAU,eAAe,KAAK,GAAG,GAAG,GAAG,OAAO;EAC1D,IAAI,EAAE,SAAS,EAAE,MAAM,OAAO;CAChC;CAEA,OAAO;AACT;;AAGA,MAAM,iBAAiB,GAAY,MAAwB,MAAM,KAAM,OAAO,MAAM,CAAC,KAAK,OAAO,MAAM,CAAC;AAExG,MAAM,YAAY,UAAoC,OAAO,UAAU,YAAY,UAAU;AAQ7F,SAAS,aAAa,MAAiB,MAAoB;CACzD,OAAO,KAAK,IAAI,SAAS,MAAM;EAC7B,MAAM,CAAC,GAAG,KAAK,KAAK,IAAI,IAAI;EAC5B,KAAK,SAAS,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC;CAChC;AACF;AAEA,SAAS,cAAc,GAAuB,GAAgC;CAC5E,IAAI,EAAE,WAAW,EAAE,QAAQ,OAAO;CAClC,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAC5B,IAAI,CAAC,cAAc,EAAE,IAAI,EAAE,EAAE,GAAG,OAAO;CAEzC,OAAO;AACT;;AAGA,MAAM,YAAY,UAChB,iBAAiB,YAAY,iBAAiB,eAAgB,OAAO,sBAAsB,eAAe,iBAAiB;AAE7H,MAAM,YAAY,UAA2B,iBAAiB,WAAW,iBAAiB,WAAW,iBAAiB,WAAW,iBAAiB;AAElJ,MAAM,WAAW,UACf,iBAAiB,UAAU,iBAAiB,UAAU,iBAAiB,WAAW,iBAAiB,UAAU,iBAAiB;AAEhI,SAAS,QAAQ,OAA+C;CAC9D,OAAO,YAAY,OAAO,KAAK,IAAI,IAAI,WAAW,MAAM,QAAQ,MAAM,YAAY,MAAM,UAAU,IAAI,IAAI,WAAW,KAAK;AAC5H;AAEA,SAAS,eAAe,OAAoC;CAC1D,OAAO,QAAQ,QAAQ,KAAK,CAAC,CAAC,QAAQ,QAAQ,OAAO,UAAU,qBAAqB,KAAK,OAAO,GAAG,CAAC;AACtG;AAEA,SAAS,UAAU,GAAQ,GAAQ,MAA0B;CAC3D,MAAM,OAAO,eAAe,CAAC;CAC7B,IAAI,KAAK,WAAW,eAAe,CAAC,CAAC,CAAC,QAAQ,OAAO;CACrD,OAAO,KAAK,OAAO,QAAQ,OAAO,UAAU,qBAAqB,KAAK,GAAG,GAAG,KAAK,YAAY,EAAE,MAAM,EAAE,MAAM,IAAI,CAAC;AACpH;;;;;;AAOA,SAAS,aAAa,GAAyC,GAAyC,MAA0B;CAChI,IAAI,EAAE,SAAS,EAAE,MAAM,OAAO;CAC9B,MAAM,WAAW,QAA2B,aAAa,MAAM,EAAE,IAAI,GAAG,IAAI;CAC5E,MAAM,OAAO,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,SAAS,GAAG,CAAC;CAC7D,KAAK,MAAM,CAAC,KAAK,UAAU,EAAE,QAAQ,GAAG;EACtC,IAAI,CAAC,SAAS,GAAG,GAAG;GAClB,IAAI,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,YAAY,OAAO,QAAQ,GAAG,GAAG,IAAI,GAAG,OAAO;GACnE;EACF;EACA,MAAM,KAAK,KAAK,WAAW,CAAC,UAAU,gBAAgB;GACpD,MAAM,OAAO,KAAK,IAAI;GACtB,IAAI,YAAY,KAAK,UAAU,IAAI,KAAK,YAAY,OAAO,YAAY,IAAI,GAAG,OAAO;GACrF,aAAa,MAAM,IAAI;GACvB,OAAO;EACT,CAAC;EACD,IAAI,KAAK,GAAG,OAAO;EACnB,KAAK,OAAO,IAAI,CAAC;CACnB;CACA,OAAO;AACT;;AAGA,SAAS,aAAa,GAAQ,GAAQ,MAA0B;CAC9D,IAAI,MAAM,QAAQ,CAAC,KAAK,MAAM,QAAQ,CAAC,GAAG;EACxC,IAAI,CAAC,MAAM,QAAQ,CAAC,KAAK,CAAC,MAAM,QAAQ,CAAC,KAAK,EAAE,WAAW,EAAE,QAAQ,OAAO;EAC5E,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAC5B,IAAI,CAAC,YAAY,EAAE,IAAI,EAAE,IAAI,IAAI,GAAG,OAAO;EAE7C,OAAO;CACT;CACA,IAAI,SAAS,CAAC,GAAG,OAAO,cAAc,QAAQ,CAAC,GAAG,QAAQ,CAAC,CAAC;CAC5D,IAAI,YAAY,OAAO,CAAC,GAAG,OAAO,cAAc,GAAoC,CAAC;CACrF,IAAI,SAAS,CAAC,GAAG,OAAO;CACxB,IAAI,aAAa,QAAQ,CAAC,cAAc,EAAE,QAAQ,GAAG,EAAE,QAAQ,CAAC,GAAG,OAAO;CAC1E,IAAI,aAAa,WAAW,EAAE,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE,QAAQ,OAAO;CAClF,IAAI,aAAa,SAAS,EAAE,EAAE,SAAS,EAAE,QAAQ,EAAE,YAAY,EAAE,WAAW,YAAY,EAAE,OAAO,EAAE,OAAO,IAAI,IAAI,OAAO;CACzH,IAAI,QAAQ,CAAC,KAAK,CAAC,cAAc,EAAE,QAAQ,GAAG,EAAE,QAAQ,CAAC,GAAG,OAAO;CACnE,KAAK,aAAa,OAAO,aAAa,QAAQ,CAAC,aAAa,GAAG,GAAG,IAAI,GAAG,OAAO;CAChF,OAAO,UAAU,GAAG,GAAG,IAAI;AAC7B;;;;;;AAOA,SAAS,YAAY,GAAY,GAAY,MAA0B;CACrE,IAAI,cAAc,GAAG,CAAC,GAAG,OAAO;CAChC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,OAAO;CACzC,IAAI,OAAO,eAAe,CAAC,MAAM,OAAO,eAAe,CAAC,GAAG,OAAO;CAClE,IAAI,WAAW,KAAK,SAAS,IAAI,CAAC;CAClC,IAAI,UAAU,IAAI,CAAC,GAAG,OAAO;CAC7B,IAAI,aAAa,KAAA,GAAW;EAC1B,2BAAW,IAAI,IAAI;EACnB,KAAK,SAAS,IAAI,GAAG,QAAQ;CAC/B;CACA,SAAS,IAAI,CAAC;CACd,KAAK,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC;CACpB,OAAO,aAAa,GAAG,GAAG,IAAI;AAChC;;;;;;;;;;;;;;;;;;;;;AAsBA,MAAa,UAAmB,GAAG,MAAe,YAAY,GAAG,GAAG;CAAE,0BAAU,IAAI,IAAI;CAAG,KAAK,CAAC;AAAE,CAAC;;;;;;;;;AAUpG,MAAa,QACX,YACU;CACV,MAAM,WAAW,OAAO,YAAY,aAAa,WAAW,MAAS,EAAE;CACvE,QAAQ,GAAG,MAAM,SAAS,CAAC,MAAM,SAAS,CAAC;AAC7C;;AAOA,SAAS,cAAc,OAAwB;CAC7C,IAAI,UAAU,MAAM,OAAO;CAC3B,IAAI,UAAU,KAAA,GAAW,OAAO;CAChC,QAAQ,OAAO,OAAf;EACE,KAAK,WACH,OAAO,QAAQ,IAAI;EACrB,KAAK,UACH,OAAO,WAAW,KAAK;EACzB,KAAK,UACH,OAAO,WAAW,KAAK;EACzB,KAAK,UACH,OAAO,WAAW,MAAM,SAAS,CAAC;EACpC,KAAK,UACH,OAAO,WAAW,MAAM,SAAS,CAAC;EACpC,SACE,OAAO;CACX;AACF;;AAGA,MAAM,aAAa;;AAMnB,MAAM,OAAO,MAAc,SAA0B,KAAK,KAAK,MAAM,EAAE,IAAI,OAAQ;;AAGnF,SAAS,SAAS,MAAsB;CACtC,IAAI,QAAQ,OAAQ,SAAS;CAC7B,QAAQ,KAAK,KAAK,OAAO,UAAU;CACnC,SAAS,UAAU;CACnB,QAAQ,KAAK,KAAK,OAAO,UAAU;CACnC,OAAO,QAAS,UAAU;AAC5B;;AAGA,MAAM,OAAO;CAAE,OAAO;CAAG,QAAQ;CAAG,UAAU;CAAG,QAAQ;CAAI,QAAQ;AAAG;AAExE,MAAM,UAAU,OAAgB,OAAe,SAC7C,SAAS,KAAK,IAAI,WAAW,OAAO,OAAO,IAAI,IAAI,cAAc,KAAK;AAExE,SAAS,aAAa,OAAe,UAAsC;CACzE,IAAI,OAAO;CACX,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK,OAAO,IAAI,MAAM,cAAc,SAAS,EAAE,CAAC;CACrF,OAAO;AACT;;AAGA,SAAS,YAAY,OAA6C,OAAe,MAAwB;CACvG,IAAI,MAAM;CACV,KAAK,MAAM,CAAC,KAAK,UAAU,MAAM,QAAQ,GAAG,MAAO,MAAM,SAAS,IAAI,OAAO,KAAK,OAAO,IAAI,GAAG,OAAO,OAAO,OAAO,IAAI,CAAC,CAAC,IAAK;CAChI,OAAO;AACT;;AAGA,SAAS,SAAS,OAAY,OAAe,MAAwB;CACnE,IAAI,MAAM;CACV,KAAK,MAAM,OAAO,eAAe,KAAK,GAAG,MAAO,MAAM,SAAS,IAAI,cAAc,GAAG,GAAG,OAAO,MAAM,MAAM,OAAO,IAAI,CAAC,CAAC,IAAK;CAC5H,OAAO;AACT;;AAGA,SAAS,WAAW,OAAY,OAAe,MAAwB;CACrE,IAAI,MAAM,QAAQ,KAAK,GAAG;EACxB,IAAI,OAAe,KAAK;EACxB,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,OAAO,IAAI,MAAM,OAAO,MAAM,IAAI,OAAO,IAAI,CAAC;EACrF,OAAO;CACT;CACA,IAAI,SAAS,KAAK,GAAG,OAAO,aAAa,KAAK,QAAQ,QAAQ,KAAK,CAAC;CACpE,IAAI,YAAY,OAAO,KAAK,GAAG,OAAO,aAAa,KAAK,UAAU,KAAsC;CACxG,IAAI,SAAS,KAAK,GAAG,OAAO,KAAK;CACjC,IAAI,OAAe,KAAK;CACxB,IAAI,iBAAiB,MAAM,OAAO,IAAI,MAAM,WAAW,MAAM,QAAQ,CAAC,CAAC;CACvE,IAAI,iBAAiB,QAAQ,OAAO,IAAI,IAAI,MAAM,WAAW,MAAM,MAAM,CAAC,GAAG,WAAW,MAAM,KAAK,CAAC;CACpG,IAAI,iBAAiB,OACnB,OAAO,IAAI,IAAI,IAAI,MAAM,OAAO,MAAM,MAAM,OAAO,IAAI,CAAC,GAAG,OAAO,MAAM,SAAS,OAAO,IAAI,CAAC,GAAG,OAAO,MAAM,OAAO,OAAO,IAAI,CAAC;CAElI,IAAI,QAAQ,KAAK,GAAG,OAAO,IAAI,MAAM,cAAc,MAAM,QAAQ,CAAC,CAAC;CACnE,IAAI,iBAAiB,OAAO,iBAAiB,KAAK,OAAO,IAAI,MAAM,YAAY,OAAO,OAAO,IAAI,CAAC;CAClG,OAAO,IAAI,MAAM,SAAS,OAAO,OAAO,IAAI,CAAC;AAC/C;;AAGA,SAAS,WAAW,OAAe,OAAe,MAAwB;CACxE,IAAI,UAAU,GAAG,OAAO;CACxB,IAAI,UAAU,KAAK,IAAI,KAAK;CAC5B,IAAI,YAAY,KAAA,GAAW;EACzB,UAAU,CAAC;EACX,KAAK,IAAI,OAAO,OAAO;CACzB;CACA,MAAM,QAAQ,QAAQ;CACtB,IAAI,UAAU,KAAA,GAAW,OAAO;CAChC,MAAM,OAAO,WAAW,OAAO,QAAQ,GAAG,IAAI;CAC9C,QAAQ,SAAS;CACjB,OAAO;AACT;;;;;;;;;;;;AAaA,MAAa,eAA0B,UACrC,SAAS,KAAK,IAAI,WAAW,OAAO,4BAAY,IAAI,IAAI,CAAC,IAAI,cAAc,KAAK;;;;AAKlF,MAAa,cAAc,QAAwB;CACjD,IAAI,OAAO;CACX,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;EACnC,QAAS,QAAQ,KAAK,OAAQ,IAAI,WAAW,CAAC;EAC9C,OAAO,OAAO;CAChB;CACA,OAAO,SAAS;AAClB;;;;AAKA,MAAa,cAAc,QAAwB;CACjD,IAAI,OAAO,MAAM,GAAG,GAAG,OAAO;CAC9B,IAAI,CAAC,OAAO,SAAS,GAAG,GAAG,OAAO,MAAM,IAAI,IAAI;CAGhD,IAAI,OAAO,UAAU,GAAG,GACtB,OAAO,MAAM;CAIf,OAAO,WAAW,IAAI,SAAS,CAAC;AAClC;;;;;;;;;AAUA,MAAa,iBAAiB,GAAG,WAA6B;CAC5D,IAAI,WAAW;CACf,KAAK,MAAM,QAAQ,QAAQ;EACzB,YAAa,YAAY,KAAK,WAAY;EAC1C,WAAW,WAAW;CACxB;CACA,OAAO,aAAa;AACtB;;;;;;;AAQA,MAAa,UAAa,aAAyC;CACjE,QAAQ,UAAU,YAAY,SAAS,KAAK,CAAC;AAC/C;;;;;AAUA,MAAa,kBAAgC,GAAG,MAAM;CACpD,IAAI,MAAM,GAAG,OAAO;CACpB,IAAI,MAAM,QAAQ,MAAM,KAAA,GAAW,OAAO;CAC1C,IAAI,MAAM,QAAQ,MAAM,KAAA,GAAW,OAAO;CAG1C,IAAI,aAAa,QAAQ,aAAa,MACpC,OAAO,EAAE,QAAQ,IAAI,EAAE,QAAQ;CAIjC,IAAI,OAAO,MAAM,YAAY,OAAO,MAAM,UAAU;EAClD,IAAI,OAAO,MAAM,CAAC,GAAG,OAAO,OAAO,MAAM,CAAC,IAAI,IAAI;EAClD,IAAI,OAAO,MAAM,CAAC,GAAG,OAAO;EAC5B,OAAO,IAAI;CACb;CAGA,IAAI,OAAO,MAAM,YAAY,OAAO,MAAM,UACxC,OAAO,EAAE,cAAc,CAAC;CAI1B,IAAI,OAAO,MAAM,aAAa,OAAO,MAAM,WACzC,OAAO,MAAM,IAAI,IAAI,IAAI,IAAI;CAI/B,OAAO,OAAO,CAAC,CAAC,CAAC,cAAc,OAAO,CAAC,CAAC;AAC1C;;;;AAKA,MAAa,iBAAkC,GAAG,MAAM;CACtD,IAAI,OAAO,MAAM,CAAC,GAAG,OAAO,OAAO,MAAM,CAAC,IAAI,IAAI;CAClD,IAAI,OAAO,MAAM,CAAC,GAAG,OAAO;CAC5B,OAAO,IAAI;AACb;;;;AAKA,MAAa,iBAAkC,GAAG,MAAM,EAAE,cAAc,CAAC;;;;AAKzE,MAAa,2BAA4C,GAAG,MAC1D,EAAE,YAAY,CAAC,CAAC,cAAc,EAAE,YAAY,CAAC;;;;AAK/C,MAAa,eAA8B,GAAG,MAC5C,EAAE,QAAQ,IAAI,EAAE,QAAQ;;;;AAK1B,MAAa,kBAAoC,GAAG,MAClD,MAAM,IAAI,IAAI,IAAI,IAAI;;;;;;;AAYxB,MAAa,YAAe,aACzB,GAAG,MAAM,QAAQ,GAAG,CAAC;;;;;;;;AASxB,MAAa,aACX,SACA,UAAwB,mBACT;CACf,MAAM,WAAW,OAAO,YAAY,aAAa,WAAW,MAAS,EAAE;CACvE,QAAQ,GAAG,MAAM,QAAQ,SAAS,CAAC,GAAG,SAAS,CAAC,CAAC;AACnD;;;;;;;;;;;;AAaA,MAAa,iBAAoB,GAAG,gBAA0C;CAC5E,QAAQ,GAAG,MAAM;EACf,KAAK,MAAM,WAAW,aAAa;GACjC,MAAM,SAAS,QAAQ,GAAG,CAAC;GAC3B,IAAI,WAAW,GAAG,OAAO;EAC3B;EACA,OAAO;CACT;AACF;;;;;;;AAQA,MAAa,cAAiB,YAAuD;CACnF,QAAQ,GAAG,MAAM;EACf,IAAI,KAAK,QAAQ,KAAK,MAAM,OAAO;EACnC,IAAI,KAAK,MAAM,OAAO;EACtB,IAAI,KAAK,MAAM,OAAO;EACtB,OAAO,QAAQ,GAAG,CAAC;CACrB;AACF;;;;;;;AAQA,MAAa,aAAgB,YAAuD;CAClF,QAAQ,GAAG,MAAM;EACf,IAAI,KAAK,QAAQ,KAAK,MAAM,OAAO;EACnC,IAAI,KAAK,MAAM,OAAO;EACtB,IAAI,KAAK,MAAM,OAAO;EACtB,OAAO,QAAQ,GAAG,CAAC;CACrB;AACF;;;;;;;;AASA,MAAa,gBACX,cACA,aAAyB,mBACV;CACf,QAAQ,GAAG,MAAM,WAAW,aAAa,CAAC,GAAG,aAAa,CAAC,CAAC;AAC9D;;;;;;;;;;ACreA,IAAa,YAAb,MAAa,UAA8C;CACzD;CACA;CACA;CAEA,uBAAgC;CAEhC,YAAY,UAA+B,CAAC,GAAG;EAC7C,MAAM,EAAE,kBAAkB,IAAI,KAAK,cAAc;EACjD,KAAK,SAAS,IAAI,MAAM,eAAe;EACvC,KAAK,QAAQ;EACb,KAAK,MAAM;CACb;CAMA,IAAI,OAAe;EACjB,OAAO,KAAK;CACd;CAEA,IAAI,UAAmB;EACrB,OAAO,KAAK,UAAU;CACxB;;;;CAKA,IAAI,WAAmB;EACrB,OAAO,KAAK,OAAO;CACrB;CAEA,IAAI,KAAY;EACd,OAAO,KAAK;CACd;CAMA,IAAI,OAAkB;EACpB,KAAK,WAAW,KAAK;EACrB,OAAO,KAAK,OAAO;CACrB;CAEA,IAAI,OAAe,SAAe;EAChC,KAAK,WAAW,KAAK;EACrB,MAAM,MAAM,KAAK,OAAO;EACxB,KAAK,OAAO,SAAS;EACrB,OAAO;CACT;CAMA,SAAS,SAAqB;EAC5B,OAAO,KAAK,QAAQ,OAAO,MAAM;CACnC;CAEA,QAAQ,SAAY,YAAoB,GAAW;EACjD,IAAI,YAAY,GAAG,YAAY;EAC/B,KAAK,IAAI,IAAI,WAAW,IAAI,KAAK,OAAO,KACtC,IAAI,KAAK,IAAI,KAAK,OAAO,IAAK,OAAO,GACnC,OAAO;EAGX,OAAO;CACT;CAEA,YAAY,SAAY,WAA4B;EAClD,MAAM,QACJ,cAAc,KAAA,IACV,KAAK,IAAI,WAAW,KAAK,QAAQ,CAAC,IAClC,KAAK,QAAQ;EACnB,KAAK,IAAI,IAAI,OAAO,KAAK,GAAG,KAC1B,IAAI,KAAK,IAAI,KAAK,OAAO,IAAK,OAAO,GACnC,OAAO;EAGX,OAAO;CACT;CAEA,YAAY,OAA6B;EACvC,KAAK,MAAM,WAAW,OACpB,IAAI,CAAC,KAAK,SAAS,OAAO,GAAG,OAAO;EAEtC,OAAO;CACT;CAMA,IAAI,SAAqB;EACvB,KAAK,eAAe,KAAK,QAAQ,CAAC;EAClC,KAAK,OAAO,KAAK,WAAW;EAC5B,OAAO;CACT;CAEA,KAAK,SAAkB;EACrB,KAAK,IAAI,OAAO;CAClB;CAEA,QAAQ,SAAkB;EACxB,KAAK,OAAO,GAAG,OAAO;CACxB;CAEA,OAAO,OAAe,SAAkB;EACtC,KAAK,iBAAiB,KAAK;EAC3B,KAAK,eAAe,KAAK,QAAQ,CAAC;EAGlC,KAAK,IAAI,IAAI,KAAK,OAAO,IAAI,OAAO,KAClC,KAAK,OAAO,KAAK,KAAK,OAAO,IAAI;EAGnC,KAAK,OAAO,SAAS;EACrB,KAAK;CACP;CAEA,UAAU,OAAe,OAA6B;EACpD,KAAK,iBAAiB,KAAK;EAC3B,MAAM,WAAW,MAAM,QAAQ,KAAK,IAAI,QAAQ,MAAM,KAAK,KAAK;EAChE,IAAI,SAAS,WAAW,GAAG,OAAO;EAElC,KAAK,eAAe,KAAK,QAAQ,SAAS,MAAM;EAGhD,KAAK,IAAI,IAAI,KAAK,QAAQ,GAAG,KAAK,OAAO,KACvC,KAAK,OAAO,IAAI,SAAS,UAAU,KAAK,OAAO;EAIjD,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KACnC,KAAK,OAAO,QAAQ,KAAK,SAAS;EAGpC,KAAK,SAAS,SAAS;EACvB,OAAO;CACT;CAEA,OAAO,OAA6B;EAClC,MAAM,WAAW,MAAM,QAAQ,KAAK,IAAI,QAAQ,MAAM,KAAK,KAAK;EAChE,IAAI,SAAS,WAAW,GAAG,OAAO;EAElC,KAAK,eAAe,KAAK,QAAQ,SAAS,MAAM;EAEhD,KAAK,MAAM,WAAW,UACpB,KAAK,OAAO,KAAK,WAAW;EAG9B,OAAO;CACT;CAMA,OAAO,SAAqB;EAC1B,MAAM,QAAQ,KAAK,QAAQ,OAAO;EAClC,IAAI,UAAU,IAAI,OAAO;EACzB,KAAK,SAAS,KAAK;EACnB,OAAO;CACT;CAEA,SAAS,OAAkB;EACzB,KAAK,WAAW,KAAK;EACrB,MAAM,MAAM,KAAK,OAAO;EAGxB,KAAK,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ,GAAG,KACtC,KAAK,OAAO,KAAK,KAAK,OAAO,IAAI;EAGnC,KAAK;EAEL,KAAK,OAAO,KAAK,SAAS,KAAA;EAE1B,OAAO;CACT;CAEA,MAAS;EACP,IAAI,KAAK,SACP,MAAM,IAAI,MAAM,4BAA4B;EAE9C,OAAO,KAAK,SAAS,KAAK,QAAQ,CAAC;CACrC;CAEA,QAAW;EACT,IAAI,KAAK,SACP,MAAM,IAAI,MAAM,8BAA8B;EAEhD,OAAO,KAAK,SAAS,CAAC;CACxB;CAEA,YAAY,WAAmB,SAAuB;EACpD,KAAK,WAAW,WAAW,OAAO;EAClC,MAAM,cAAc,UAAU;EAC9B,IAAI,gBAAgB,GAAG;EAGvB,KAAK,IAAI,IAAI,SAAS,IAAI,KAAK,OAAO,KACpC,KAAK,OAAO,IAAI,eAAe,KAAK,OAAO;EAI7C,KAAK,IAAI,IAAI,KAAK,QAAQ,aAAa,IAAI,KAAK,OAAO,KACrD,KAAK,OAAO,KAAK,KAAA;EAGnB,KAAK,SAAS;CAChB;CAEA,UAAU,OAA6B;EACrC,MAAM,2BAAW,IAAI,IAAO;EAC5B,KAAK,MAAM,WAAW,OACpB,SAAS,IAAI,OAAO;EAGtB,IAAI,aAAa;EACjB,IAAI,WAAW;EAEf,KAAK,IAAI,YAAY,GAAG,YAAY,KAAK,OAAO,aAAa;GAC3D,MAAM,UAAU,KAAK,OAAO;GAC5B,IAAI,eAAe;GAGnB,KAAK,MAAM,iBAAiB,UAC1B,IAAI,KAAK,IAAI,SAAS,aAAa,GAAG;IACpC,eAAe;IACf,WAAW;IACX;GACF;GAGF,IAAI,CAAC,cACH,KAAK,OAAO,gBAAgB;EAEhC;EAGA,KAAK,IAAI,IAAI,YAAY,IAAI,KAAK,OAAO,KACvC,KAAK,OAAO,KAAK,KAAA;EAGnB,KAAK,QAAQ;EACb,OAAO;CACT;CAEA,UAAU,OAA6B;EACrC,MAAM,WAAW,MAAM,KAAK,KAAK;EACjC,IAAI,aAAa;EACjB,IAAI,WAAW;EAEf,KAAK,IAAI,YAAY,GAAG,YAAY,KAAK,OAAO,aAAa;GAC3D,MAAM,UAAU,KAAK,OAAO;GAC5B,IAAI,eAAe;GAGnB,KAAK,MAAM,iBAAiB,UAC1B,IAAI,KAAK,IAAI,SAAS,aAAa,GAAG;IACpC,eAAe;IACf;GACF;GAGF,IAAI,cACF,KAAK,OAAO,gBAAgB;QAE5B,WAAW;EAEf;EAGA,KAAK,IAAI,IAAI,YAAY,IAAI,KAAK,OAAO,KACvC,KAAK,OAAO,KAAK,KAAA;EAGnB,KAAK,QAAQ;EACb,OAAO;CACT;CAEA,QAAc;EAEZ,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,KAC9B,KAAK,OAAO,KAAK,KAAA;EAEnB,KAAK,QAAQ;CACf;CAMA,KAAK,UAAsB,gBAAsB;EAE/C,MAAM,QAAQ,KAAK,OAAO,MAAM,GAAG,KAAK,KAAK;EAC7C,MAAM,KAAK,OAAO;EAClB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,KAC9B,KAAK,OAAO,KAAK,MAAM;CAE3B;CAEA,UAAgB;EACd,IAAI,OAAO;EACX,IAAI,QAAQ,KAAK,QAAQ;EACzB,OAAO,OAAO,OAAO;GACnB,MAAM,OAAO,KAAK,OAAO;GACzB,KAAK,OAAO,QAAQ,KAAK,OAAO;GAChC,KAAK,OAAO,SAAS;GACrB;GACA;EACF;CACF;CAMA,QAAW;EACT,IAAI,KAAK,SACP,MAAM,IAAI,MAAM,eAAe;EAEjC,OAAO,KAAK,OAAO;CACrB;CAEA,OAAU;EACR,IAAI,KAAK,SACP,MAAM,IAAI,MAAM,eAAe;EAEjC,OAAO,KAAK,OAAO,KAAK,QAAQ;CAClC;CAEA,QAAQ,WAAmB,SAA0B;EACnD,KAAK,WAAW,WAAW,OAAO;EAElC,MAAM,MAAM,IAAI,UAAa,EAAE,IAAI,KAAK,IAAI,CAAC;EAC7C,KAAK,IAAI,IAAI,WAAW,IAAI,SAAS,KACnC,IAAI,IAAI,KAAK,OAAO,EAAG;EAEzB,OAAO;CACT;CAMA,EAAE,OAAO,YAAyB;EAChC,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,KAC9B,MAAM,KAAK,OAAO;CAEtB;CAEA,QAAQ,QAAmD;EACzD,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,KAC9B,OAAO,KAAK,OAAO,IAAK,CAAC;CAE7B;CAEA,UAAe;EACb,OAAO,KAAK,OAAO,MAAM,GAAG,KAAK,KAAK;CACxC;;;;CASA,eAAe,aAA2B;EACxC,IAAI,eAAe,KAAK,OAAO,QAAQ;EAGvC,MAAM,cAAc,KAAK,IACvB,aACA,KAAK,MAAM,KAAK,OAAO,SAAS,GAAG,IAAI,CACzC;EAEA,MAAM,WAAW,IAAI,MAAM,WAAW;EACtC,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,KAC9B,SAAS,KAAK,KAAK,OAAO;EAE5B,KAAK,SAAS;CAChB;;;;CAKA,aAAmB;EACjB,IAAI,KAAK,QAAQ,KAAK,OAAO,QAC3B,KAAK,SAAS,KAAK,OAAO,MAAM,GAAG,KAAK,KAAK;CAEjD;CAMA,WAAmB,OAAqB;EACtC,IAAI,QAAQ,KAAK,SAAS,KAAK,OAC7B,MAAM,IAAI,WACR,SAAS,MAAM,0BAA0B,KAAK,OAChD;CAEJ;CAEA,iBAAyB,OAAqB;EAC5C,IAAI,QAAQ,KAAK,QAAQ,KAAK,OAC5B,MAAM,IAAI,WACR,SAAS,MAAM,kCAAkC,KAAK,MAAM,EAC9D;CAEJ;CAEA,WAAmB,WAAmB,SAAuB;EAC3D,IAAI,YAAY,KAAK,UAAU,KAAK,SAAS,YAAY,SACvD,MAAM,IAAI,WACR,kBAAkB,UAAU,IAAI,QAAQ,aAAa,KAAK,OAC5D;CAEJ;AACF;;;;;;;;;AAUA,SAAgB,UACd,mBACc;CAEd,IAAI,qBAAqB,OAAO,YAAY,mBAAmB;EAC7D,MAAM,OAAO,IAAI,UAAa;EAC9B,KAAK,OAAO,iBAAgC;EAC5C,OAAO;CACT;CAGA,OAAO,IADU,UAAa,iBACpB;AACZ;;;;;;;;;;AC7bA,IAAa,aAAb,MAAa,WAAkC;CAC7C;CACA;CACA;CACA;CAEA,YAAY,UAAgC,CAAC,GAAG;EAC9C,MAAM,EAAE,kBAAkB,IAAI,KAAK,cAAc;EAEjD,MAAM,WAAW,KAAK,eAAe,KAAK,IAAI,GAAG,eAAe,CAAC;EACjE,KAAK,YAAY,IAAI,MAAM,QAAQ;EACnC,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,MAAM;CACb;CAMA,IAAI,OAAe;EAEjB,OAAQ,KAAK,QAAQ,KAAK,QAAU,KAAK,UAAU,SAAS;CAC9D;CAEA,IAAI,UAAmB;EACrB,OAAO,KAAK,UAAU,KAAK;CAC7B;CAEA,IAAI,KAAY;EACd,OAAO,KAAK;CACd;CAMA,SAAS,SAAkB;EACzB,KAAK,QAAS,KAAK,QAAQ,IAAM,KAAK,UAAU,SAAS;EACzD,KAAK,UAAU,KAAK,SAAS;EAC7B,IAAI,KAAK,UAAU,KAAK,OACtB,KAAK,KAAK;CAEd;CAEA,WAAW,SAAqB;EAC9B,KAAK,SAAS,OAAO;EACrB,OAAO;CACT;CAEA,cAAiB;EACf,IAAI,KAAK,SACP,MAAM,IAAI,MAAM,gBAAgB;EAElC,OAAO,KAAK,UAAU;CACxB;CAEA,YAA2B;EACzB,IAAI,KAAK,SACP;EAEF,MAAM,UAAU,KAAK,UAAU,KAAK;EACpC,KAAK,UAAU,KAAK,SAAS,KAAA;EAC7B,KAAK,QAAS,KAAK,QAAQ,IAAM,KAAK,UAAU,SAAS;EACzD,OAAO;CACT;CAEA,YAAe;EACb,IAAI,KAAK,SACP,MAAM,IAAI,MAAM,gBAAgB;EAElC,OAAO,KAAK,UAAU,KAAK;CAC7B;CAEA,uBAAsC;EACpC,OAAO,KAAK,UAAU,KAAA,IAAY,KAAK,UAAU,KAAK;CACxD;CAMA,QAAQ,SAAkB;EACxB,KAAK,UAAU,KAAK,SAAS;EAC7B,KAAK,QAAS,KAAK,QAAQ,IAAM,KAAK,UAAU,SAAS;EACzD,IAAI,KAAK,UAAU,KAAK,OACtB,KAAK,KAAK;CAEd;CAEA,UAAU,SAAqB;EAC7B,KAAK,QAAQ,OAAO;EACpB,OAAO;CACT;CAEA,aAAgB;EACd,IAAI,KAAK,SACP,MAAM,IAAI,MAAM,gBAAgB;EAElC,OAAO,KAAK,SAAS;CACvB;CAEA,WAA0B;EACxB,IAAI,KAAK,SACP;EAEF,KAAK,QAAS,KAAK,QAAQ,IAAM,KAAK,UAAU,SAAS;EACzD,MAAM,UAAU,KAAK,UAAU,KAAK;EACpC,KAAK,UAAU,KAAK,SAAS,KAAA;EAC7B,OAAO;CACT;CAEA,WAAc;EACZ,IAAI,KAAK,SACP,MAAM,IAAI,MAAM,gBAAgB;EAElC,MAAM,YAAa,KAAK,QAAQ,IAAM,KAAK,UAAU,SAAS;EAC9D,OAAO,KAAK,UAAU;CACxB;CAEA,sBAAqC;EACnC,IAAI,KAAK,SACP;EAEF,MAAM,YAAa,KAAK,QAAQ,IAAM,KAAK,UAAU,SAAS;EAC9D,OAAO,KAAK,UAAU;CACxB;CASA,KAAK,SAAkB;EACrB,KAAK,QAAQ,OAAO;CACtB;CAEA,MAAS;EACP,OAAO,KAAK,WAAW;CACzB;CAMA,MAAM,SAAqB;EACzB,OAAO,KAAK,UAAU,OAAO;CAC/B;CAEA,OAAU;EACR,OAAO,KAAK,YAAY;CAC1B;CAEA,OAAU;EACR,OAAO,KAAK,UAAU;CACxB;CAEA,kBAAiC;EAC/B,OAAO,KAAK,qBAAqB;CACnC;CAEA,kBAAiC;EAC/B,OAAO,KAAK,UAAU;CACxB;CAEA,QAAQ,SAAqB;EAC3B,OAAO,KAAK,MAAM,OAAO;CAC3B;CAEA,UAAa;EACX,OAAO,KAAK,KAAK;CACnB;CAMA,IAAI,SAAqB;EACvB,KAAK,QAAQ,OAAO;EACpB,OAAO;CACT;CAEA,OAAO,OAA6B;EAClC,IAAI,WAAW;EACf,KAAK,MAAM,WAAW,OAAO;GAC3B,KAAK,QAAQ,OAAO;GACpB,WAAW;EACb;EACA,OAAO;CACT;CAEA,SAAS,SAAqB;EAC5B,KAAK,MAAM,QAAQ,MACjB,IAAI,KAAK,IAAI,MAAM,OAAO,GACxB,OAAO;EAGX,OAAO;CACT;CAEA,YAAY,OAA6B;EACvC,KAAK,MAAM,WAAW,OACpB,IAAI,CAAC,KAAK,SAAS,OAAO,GACxB,OAAO;EAGX,OAAO;CACT;CAEA,OAAO,SAAqB;EAE1B,MAAM,OAAO,KAAK,UAAU,SAAS;EACrC,MAAM,OAAO,KAAK;EAClB,KAAK,IAAI,SAAS,GAAG,SAAS,MAAM,UAClC,IAAI,KAAK,IAAI,KAAK,UAAW,KAAK,QAAQ,SAAU,OAAQ,OAAO,GAAG;GACpE,KAAK,eAAe,MAAM;GAC1B,OAAO;EACT;EAEF,OAAO;CACT;;;;;CAMA,eAAuB,QAAsB;EAC3C,MAAM,OAAO,KAAK,UAAU,SAAS;EACrC,MAAM,OAAO,KAAK;EAClB,IAAI,SAAS,OAAO,GAAG;GAErB,KAAK,IAAI,IAAI,QAAQ,IAAI,GAAG,KAC1B,KAAK,UAAW,KAAK,QAAQ,IAAK,QAAQ,KAAK,UAAW,KAAK,QAAQ,IAAI,IAAK;GAElF,KAAK,UAAU,KAAK,SAAS,KAAA;GAC7B,KAAK,QAAS,KAAK,QAAQ,IAAK;EAClC,OAAO;GAEL,KAAK,IAAI,IAAI,QAAQ,IAAI,OAAO,GAAG,KACjC,KAAK,UAAW,KAAK,QAAQ,IAAK,QAAQ,KAAK,UAAW,KAAK,QAAQ,IAAI,IAAK;GAElF,KAAK,QAAS,KAAK,QAAQ,IAAK;GAChC,KAAK,UAAU,KAAK,SAAS,KAAA;EAC/B;CACF;CAGA,UAAU,OAA6B;EACrC,MAAM,2BAAW,IAAI,IAAO;EAC5B,KAAK,MAAM,WAAW,OACpB,SAAS,IAAI,OAAO;EAGtB,IAAI,WAAW;EACf,KAAK,MAAM,WAAW,UACpB,OAAO,KAAK,OAAO,OAAO,GACxB,WAAW;EAGf,OAAO;CACT;CAEA,UAAU,OAA6B;EACrC,MAAM,WAAW,IAAI,IAAI,KAAK;EAC9B,MAAM,WAAW,IAAI,WAAc,EAAE,IAAI,KAAK,IAAI,CAAC;EAEnD,KAAK,MAAM,WAAW,MAAM;GAC1B,IAAI,eAAe;GACnB,KAAK,MAAM,iBAAiB,UAC1B,IAAI,KAAK,IAAI,SAAS,aAAa,GAAG;IACpC,eAAe;IACf;GACF;GAEF,IAAI,cACF,SAAS,QAAQ,OAAO;EAE5B;EAEA,MAAM,WAAW,SAAS,SAAS,KAAK;EACxC,KAAK,YAAY,SAAS;EAC1B,KAAK,QAAQ,SAAS;EACtB,KAAK,QAAQ,SAAS;EAEtB,OAAO;CACT;CAEA,QAAc;EAEZ,IAAI,QAAQ,KAAK;EACjB,OAAO,UAAU,KAAK,OAAO;GAC3B,KAAK,UAAU,SAAS,KAAA;GACxB,QAAS,QAAQ,IAAM,KAAK,UAAU,SAAS;EACjD;EACA,KAAK,QAAQ;EACb,KAAK,QAAQ;CACf;CAMA,EAAE,OAAO,YAAyB;EAChC,IAAI,QAAQ,KAAK;EACjB,OAAO,UAAU,KAAK,OAAO;GAC3B,MAAM,KAAK,UAAU;GACrB,QAAS,QAAQ,IAAM,KAAK,UAAU,SAAS;EACjD;CACF;CAEA,QAAQ,QAAmD;EACzD,IAAI,aAAa,KAAK;EACtB,IAAI,eAAe;EACnB,OAAO,eAAe,KAAK,OAAO;GAChC,OAAO,KAAK,UAAU,aAAc,YAAY;GAChD,aAAc,aAAa,IAAM,KAAK,UAAU,SAAS;GACzD;EACF;CACF;CAEA,UAAe;EACb,MAAM,SAAc,CAAC;EACrB,KAAK,MAAM,WAAW,MACpB,OAAO,KAAK,OAAO;EAErB,OAAO;CACT;;;;CASA,OAAqB;EACnB,MAAM,cAAc,KAAK,UAAU;EACnC,MAAM,cAAc,eAAe;EAEnC,IAAI,cAAc,GAChB,MAAM,IAAI,MAAM,iBAAiB;EAGnC,MAAM,cAAc,IAAI,MAAM,WAAW;EAGzC,MAAM,YAAY,cAAc,KAAK;EACrC,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,KAC7B,YAAY,KAAK,KAAK,UAAU,KAAK,QAAQ;EAI/C,MAAM,WAAW,KAAK;EACtB,KAAK,IAAI,IAAI,GAAG,IAAI,UAAU,KAC5B,YAAY,YAAY,KAAK,KAAK,UAAU;EAK9C,KAAK,YAAY;EACjB,KAAK,QAAQ;EACb,KAAK,QAAQ;CACf;;;;CAKA,eAAuB,GAAmB;EACxC,IAAI,KAAK,GAAG,OAAO;EACnB;EACA,KAAK,KAAK;EACV,KAAK,KAAK;EACV,KAAK,KAAK;EACV,KAAK,KAAK;EACV,KAAK,KAAK;EACV,OAAO,IAAI;CACb;;;;CASA,IAAI,WAAmB;EACrB,OAAO,KAAK,UAAU;CACxB;;;;CAKA,WAAmB;EACjB,OAAO,cAAc,KAAK,QAAQ,CAAC,CAAC,KAAK,IAAI,EAAE;CACjD;AACF;;;;;;;;;AAUA,SAAgB,WACd,mBACe;CAEf,IAAI,qBAAqB,OAAO,YAAY,mBAAmB;EAC7D,MAAM,QAAQ,IAAI,WAAc;EAChC,MAAM,OAAO,iBAAgC;EAC7C,OAAO;CACT;CAEA,OAAO,IAAI,WAAc,iBAAyC;AACpE;;;;;;;;;;AC/XA,IAAa,UAAb,MAAoD;CAClD;CACA;CACA;CACA;CACA;CACA;CACA;;;;;;CAMA,YAAoB;CAEpB,YAAY,UAAgC,CAAC,GAAG;EAC9C,MAAM,EACJ,kBAAkB,IAClB,aAAa,KACb,QAAQ,WACR,UAAU,aACV,UAAU,cACR;EAEJ,MAAM,WAAW,KAAK,eAAe,KAAK,IAAI,GAAG,eAAe,CAAC;EACjE,KAAK,WAAW,IAAI,MAAM,QAAQ,CAAC,CAAC,KAAK,IAAI;EAC7C,KAAK,QAAQ;EACb,KAAK,cAAc;EACnB,KAAK,SAAS;EACd,KAAK,WAAW;EAChB,KAAK,WAAW;EAChB,KAAK,aAAa,KAAK,MAAM,WAAW,UAAU;CACpD;CAMA,IAAI,OAAe;EACjB,OAAO,KAAK;CACd;CAEA,IAAI,UAAmB;EACrB,OAAO,KAAK,UAAU;CACxB;CAEA,IAAI,QAAe;EACjB,OAAO,KAAK;CACd;CAEA,IAAI,UAAiB;EACnB,OAAO,KAAK;CACd;CAMA,IAAI,KAAiB;EACnB,MAAM,OAAO,KAAK,SAAS,GAAG;EAC9B,MAAM,QAAQ,KAAK,YAAY,IAAI;EACnC,IAAI,OAAO,KAAK,SAAS,UAAU;EAEnC,OAAO,SAAS,MAAM;GACpB,IAAI,KAAK,SAAS,QAAQ,KAAK,OAAO,KAAK,KAAK,GAAG,GACjD,OAAO;GAET,OAAO,KAAK;EACd;EAEA,OAAO;CACT;CAEA,IAAI,KAAW;EACb,MAAM,QAAQ,KAAK,eAAe,GAAG;EACrC,IAAI,UAAU,KAAA,GACZ,MAAM,IAAI,MAAM,kBAAkB,KAAK;EAEzC,OAAO;CACT;CAEA,eAAe,KAAuB;EACpC,MAAM,OAAO,KAAK,SAAS,GAAG;EAC9B,MAAM,QAAQ,KAAK,YAAY,IAAI;EACnC,IAAI,OAAO,KAAK,SAAS,UAAU;EAEnC,OAAO,SAAS,MAAM;GACpB,IAAI,KAAK,SAAS,QAAQ,KAAK,OAAO,KAAK,KAAK,GAAG,GACjD,OAAO,KAAK;GAEd,OAAO,KAAK;EACd;CAGF;CAEA,aAAa,KAAQ,cAAoB;EACvC,MAAM,QAAQ,KAAK,eAAe,GAAG;EACrC,OAAO,UAAU,KAAA,IAAY,QAAQ;CACvC;CAEA,cAAc,OAAmB;EAC/B,KAAK,MAAM,UAAU,KAAK,UAAU;GAClC,IAAI,OAAO;GACX,OAAO,SAAS,MAAM;IACpB,IAAI,KAAK,SAAS,KAAK,OAAO,KAAK,GACjC,OAAO;IAET,OAAO,KAAK;GACd;EACF;EACA,OAAO;CACT;CAMA,IAAI,KAAQ,OAAyB;EACnC,MAAM,OAAO,KAAK,SAAS,GAAG;EAC9B,MAAM,QAAQ,KAAK,YAAY,IAAI;EACnC,IAAI,OAAO,KAAK,SAAS,UAAU;EAGnC,OAAO,SAAS,MAAM;GACpB,IAAI,KAAK,SAAS,QAAQ,KAAK,OAAO,KAAK,KAAK,GAAG,GAAG;IACpD,MAAM,WAAW,KAAK;IACtB,KAAK,QAAQ;IACb,OAAO;GACT;GACA,OAAO,KAAK;EACd;EAGA,MAAM,UAAsB;GAC1B;GACA;GACA;GACA,MAAM,KAAK,SAAS,UAAU;EAChC;EACA,KAAK,SAAS,SAAS;EACvB,KAAK;EACL,KAAK;EAGL,IAAI,KAAK,QAAQ,KAAK,YACpB,KAAK,OAAO;CAIhB;CAEA,YAAY,KAAQ,OAAa;EAC/B,MAAM,WAAW,KAAK,eAAe,GAAG;EACxC,IAAI,aAAa,KAAA,GACf,OAAO;EAET,KAAK,IAAI,KAAK,KAAK;EACnB,OAAO;CACT;CAEA,OAAO,KAAuB;EAC5B,MAAM,OAAO,KAAK,SAAS,GAAG;EAC9B,MAAM,QAAQ,KAAK,YAAY,IAAI;EACnC,IAAI,OAAO,KAAK,SAAS,UAAU;EACnC,IAAI,OAA0B;EAE9B,OAAO,SAAS,MAAM;GACpB,IAAI,KAAK,SAAS,QAAQ,KAAK,OAAO,KAAK,KAAK,GAAG,GAAG;IAEpD,IAAI,SAAS,MAEX,KAAK,SAAS,SAAS,KAAK;SAG5B,KAAK,OAAO,KAAK;IAEnB,KAAK;IACL,KAAK;IACL,OAAO,KAAK;GACd;GACA,OAAO;GACP,OAAO,KAAK;EACd;CAGF;CAEA,YAAY,KAAQ,OAAmB;EACrC,MAAM,OAAO,KAAK,SAAS,GAAG;EAC9B,MAAM,QAAQ,KAAK,YAAY,IAAI;EACnC,IAAI,OAAO,KAAK,SAAS,UAAU;EACnC,IAAI,OAA0B;EAE9B,OAAO,SAAS,MAAM;GACpB,IACE,KAAK,SAAS,QACd,KAAK,OAAO,KAAK,KAAK,GAAG,KACzB,KAAK,SAAS,KAAK,OAAO,KAAK,GAC/B;IAEA,IAAI,SAAS,MACX,KAAK,SAAS,SAAS,KAAK;SAE5B,KAAK,OAAO,KAAK;IAEnB,KAAK;IACL,KAAK;IACL,OAAO;GACT;GACA,OAAO;GACP,OAAO,KAAK;EACd;EAEA,OAAO;CACT;CAEA,QAAQ,KAAQ,OAAyB;EACvC,MAAM,OAAO,KAAK,SAAS,GAAG;EAC9B,MAAM,QAAQ,KAAK,YAAY,IAAI;EACnC,IAAI,OAAO,KAAK,SAAS,UAAU;EAEnC,OAAO,SAAS,MAAM;GACpB,IAAI,KAAK,SAAS,QAAQ,KAAK,OAAO,KAAK,KAAK,GAAG,GAAG;IACpD,MAAM,WAAW,KAAK;IACtB,KAAK,QAAQ;IACb,OAAO;GACT;GACA,OAAO,KAAK;EACd;CAGF;CAEA,aAAa,KAAQ,UAAa,UAAsB;EACtD,MAAM,OAAO,KAAK,SAAS,GAAG;EAC9B,MAAM,QAAQ,KAAK,YAAY,IAAI;EACnC,IAAI,OAAO,KAAK,SAAS,UAAU;EAEnC,OAAO,SAAS,MAAM;GACpB,IACE,KAAK,SAAS,QACd,KAAK,OAAO,KAAK,KAAK,GAAG,KACzB,KAAK,SAAS,KAAK,OAAO,QAAQ,GAClC;IACA,KAAK,QAAQ;IACb,OAAO;GACT;GACA,OAAO,KAAK;EACd;EAEA,OAAO;CACT;CAMA,gBAAgB,KAAQ,iBAAmC;EACzD,MAAM,WAAW,KAAK,eAAe,GAAG;EACxC,IAAI,aAAa,KAAA,GACf,OAAO;EAGT,MAAM,WAAW,gBAAgB,GAAG;EACpC,KAAK,IAAI,KAAK,QAAQ;EACtB,OAAO;CACT;CAEA,iBACE,KACA,mBACe;EACf,MAAM,WAAW,KAAK,eAAe,GAAG;EACxC,IAAI,aAAa,KAAA,GACf;EAGF,MAAM,WAAW,kBAAkB,KAAK,QAAQ;EAChD,IAAI,aAAa,KAAA,GAAW;GAC1B,KAAK,OAAO,GAAG;GACf;EACF;EAEA,KAAK,IAAI,KAAK,QAAQ;EACtB,OAAO;CACT;CAEA,QACE,KACA,mBACe;EACf,MAAM,WAAW,KAAK,eAAe,GAAG;EACxC,MAAM,WAAW,kBAAkB,KAAK,QAAQ;EAEhD,IAAI,aAAa,KAAA,GAAW;GAC1B,IAAI,aAAa,KAAA,GACf,KAAK,OAAO,GAAG;GAEjB;EACF;EAEA,KAAK,IAAI,KAAK,QAAQ;EACtB,OAAO;CACT;CAEA,MACE,KACA,OACA,mBACe;EACf,MAAM,WAAW,KAAK,eAAe,GAAG;EAExC,IAAI,aAAa,KAAA,GAAW;GAC1B,KAAK,IAAI,KAAK,KAAK;GACnB,OAAO;EACT;EAEA,MAAM,SAAS,kBAAkB,UAAU,KAAK;EAChD,IAAI,WAAW,KAAA,GAAW;GACxB,KAAK,OAAO,GAAG;GACf;EACF;EAEA,KAAK,IAAI,KAAK,MAAM;EACpB,OAAO;CACT;CAMA,OAAO,OAAoD;EACzD,KAAK,MAAM,SAAS,OAClB,KAAK,IAAI,MAAM,KAAK,MAAM,KAAK;CAEnC;CAEA,QAAc;EACZ,KAAK,SAAS,KAAK,IAAI;EACvB,KAAK,QAAQ;EACb,KAAK;CACP;CAMA,CAAC,OAA4B;EAC3B,MAAM,WAAW,KAAK;EACtB,KAAK,MAAM,UAAU,KAAK,UAAU;GAClC,IAAI,OAAO;GACX,OAAO,SAAS,MAAM;IACpB,MAAM,KAAK;IACX,KAAK,eAAe,QAAQ;IAC5B,OAAO,KAAK;GACd;EACF;CACF;CAEA,CAAC,SAA8B;EAC7B,MAAM,WAAW,KAAK;EACtB,KAAK,MAAM,UAAU,KAAK,UAAU;GAClC,IAAI,OAAO;GACX,OAAO,SAAS,MAAM;IACpB,MAAM,KAAK;IACX,KAAK,eAAe,QAAQ;IAC5B,OAAO,KAAK;GACd;EACF;CACF;CAEA,CAAC,UAAyC;EACxC,MAAM,WAAW,KAAK;EACtB,KAAK,MAAM,UAAU,KAAK,UAAU;GAClC,IAAI,OAAO;GACX,OAAO,SAAS,MAAM;IACpB,MAAM;KAAE,KAAK,KAAK;KAAK,OAAO,KAAK;IAAM;IACzC,KAAK,eAAe,QAAQ;IAC5B,OAAO,KAAK;GACd;EACF;CACF;CAMA,EAAE,OAAO,YAAmC;EAC1C,OAAO,KAAK,QAAQ;CACtB;CAEA,QAAQ,QAAqD;EAC3D,KAAK,MAAM,SAAS,KAAK,QAAQ,GAC/B,OAAO,MAAM,OAAO,MAAM,KAAK,IAAI;CAEvC;;CAOA,eAAuB,UAAwB;EAC7C,IAAI,KAAK,cAAc,UACrB,MAAM,IAAI,MAAM,kCAAkC;CAEtD;;;;CAKA,YAAoB,MAAsB;EAGxC,OAAO,OAAQ,KAAK,SAAS,SAAS;CACxC;;;;CAKA,SAAuB;EACrB,MAAM,aAAa,KAAK;EACxB,MAAM,cAAc,WAAW,UAAU;EAEzC,IAAI,cAAc,GAChB,MAAM,IAAI,MAAM,eAAe;EAGjC,KAAK,WAAW,IAAI,MAAM,WAAW,CAAC,CAAC,KAAK,IAAI;EAChD,KAAK,aAAa,KAAK,MAAM,cAAc,KAAK,WAAW;EAC3D,KAAK;EAGL,KAAK,MAAM,UAAU,YAAY;GAC/B,IAAI,OAAO;GACX,OAAO,SAAS,MAAM;IACpB,MAAM,OAAO,KAAK;IAClB,MAAM,QAAQ,KAAK,YAAY,KAAK,IAAI;IACxC,KAAK,OAAO,KAAK,SAAS,UAAU;IACpC,KAAK,SAAS,SAAS;IACvB,OAAO;GACT;EACF;CACF;;;;CAKA,eAAuB,GAAmB;EACxC,IAAI,KAAK,GAAG,OAAO;EACnB;EACA,KAAK,KAAK;EACV,KAAK,KAAK;EACV,KAAK,KAAK;EACV,KAAK,KAAK;EACV,KAAK,KAAK;EACV,OAAO,IAAI;CACb;;;;CASA,IAAI,WAAmB;EACrB,OAAO,KAAK,SAAS;CACvB;;;;CAKA,IAAI,aAAqB;EACvB,OAAO,KAAK,QAAQ,KAAK,SAAS;CACpC;;;;CAKA,WAOE;EACA,IAAI,iBAAiB;EACrB,IAAI,mBAAmB;EACvB,IAAI,eAAe;EAEnB,KAAK,MAAM,UAAU,KAAK,UACxB,IAAI,WAAW,MACb;OACK;GACL,IAAI,SAAS;GACb,IAAI,OAA0B;GAC9B,OAAO,SAAS,MAAM;IACpB;IACA,OAAO,KAAK;GACd;GACA,oBAAoB;GACpB,iBAAiB,KAAK,IAAI,gBAAgB,MAAM;EAClD;EAGF,OAAO;GACL,MAAM,KAAK;GACX,UAAU,KAAK,SAAS;GACxB,YAAY,KAAK;GACjB,gBAAgB,KAAK,QAAQ,IAAI,oBAAoB,KAAK,SAAS,SAAS,gBAAgB;GAC5F;GACA;EACF;CACF;AACF;;;;;;;;;;;;AAaA,SAAgB,QACd,kBACe;CAEf,IAAI,oBAAoB,OAAO,YAAY,kBAAkB;EAC3D,MAAM,MAAM,IAAI,QAAc;EAC9B,KAAK,MAAM,CAAC,KAAK,UAAU,kBACzB,IAAI,IAAI,KAAK,KAAK;EAEpB,OAAO;CACT;CAEA,OAAO,IAAI,QAAc,gBAAwC;AACnE;;;;;;;;AC9gBA,IAAa,gBAAb,MAA0D;CACxD;CACA,QAAwB;CACxB;CACA;CACA;CACA;CACA;CAGA,QAAyC;CACzC,QAAyC;CAEzC,YAAY,UAAsC,CAAC,GAAG;EACpD,MAAM,EACJ,kBAAkB,IAClB,aAAa,KACb,KAAK,WACL,OAAO,aACP,UAAU,WACV,cAAc,UACZ;EAEJ,KAAK,WAAW,IAAI,MAAM,KAAK,IAAI,GAAG,eAAe,CAAC,CAAC,CAAC,KAAK,IAAI;EACjE,KAAK,cAAc;EACnB,KAAK,MAAM;EACX,KAAK,QAAQ;EACb,KAAK,WAAW;EAChB,KAAK,eAAe;CACtB;CAMA,IAAI,OAAe;EACjB,OAAO,KAAK;CACd;CAEA,IAAI,UAAmB;EACrB,OAAO,KAAK,UAAU;CACxB;CAEA,IAAI,KAAY;EACd,OAAO,KAAK;CACd;CAEA,IAAI,QAAe;EACjB,OAAO,KAAK;CACd;CAEA,IAAI,UAAiB;EACnB,OAAO,KAAK;CACd;CAEA,IAAI,OAAgB;EAClB,OAAO,KAAK;CACd;CAMA,IAAI,KAAiB;EACnB,OAAO,KAAK,QAAQ,GAAG,MAAM;CAC/B;CAEA,YAAY,KAAiB;EAC3B,OAAO,KAAK,IAAI,GAAG;CACrB;CAEA,cAAc,OAAmB;EAC/B,IAAI,OAAO,KAAK;EAChB,OAAO,SAAS,MAAM;GACpB,IAAI,KAAK,SAAS,KAAK,OAAO,KAAK,GACjC,OAAO;GAET,OAAO,KAAK;EACd;EACA,OAAO;CACT;CAEA,IAAI,KAAW;EACb,MAAM,OAAO,KAAK,QAAQ,GAAG;EAC7B,IAAI,SAAS,MACX,MAAM,IAAI,MAAM,eAAe;EAEjC,IAAI,KAAK,cACP,KAAK,UAAU,IAAI;EAErB,OAAO,KAAK;CACd;CAEA,eAAe,KAAuB;EACpC,MAAM,OAAO,KAAK,QAAQ,GAAG;EAC7B,IAAI,SAAS,MAAM,OAAO,KAAA;EAC1B,IAAI,KAAK,cACP,KAAK,UAAU,IAAI;EAErB,OAAO,KAAK;CACd;CAEA,aAAa,KAAQ,cAAoB;EACvC,MAAM,OAAO,KAAK,QAAQ,GAAG;EAC7B,IAAI,SAAS,MAAM,OAAO;EAC1B,IAAI,KAAK,cACP,KAAK,UAAU,IAAI;EAErB,OAAO,KAAK;CACd;CAMA,IAAI,KAAQ,OAAyB;EACnC,MAAM,WAAW,KAAK,MAAM,GAAG;EAC/B,MAAM,QAAQ,KAAK,eAAe,QAAQ;EAC1C,IAAI,OAAO,KAAK,SAAS,UAAU;EAGnC,OAAO,SAAS,MAAM;GACpB,IAAI,KAAK,SAAS,YAAY,KAAK,IAAI,KAAK,KAAK,GAAG,GAAG;IACrD,MAAM,WAAW,KAAK;IACtB,KAAK,QAAQ;IACb,IAAI,KAAK,cACP,KAAK,UAAU,IAAI;IAErB,OAAO;GACT;GACA,OAAO,KAAK;EACd;EAGA,MAAM,UAA4B;GAChC;GACA;GACA,MAAM;GACN,MAAM,KAAK,SAAS,UAAU;GAC9B,QAAQ;GACR,OAAO;EACT;EAEA,KAAK,SAAS,SAAS;EACvB,KAAK;EAGL,KAAK,SAAS,OAAO;EAGrB,IAAI,KAAK,QAAQ,KAAK,SAAS,SAAS,KAAK,aAC3C,KAAK,OAAO;CAIhB;CAEA,YAAY,KAAQ,OAAa;EAC/B,MAAM,WAAW,KAAK,QAAQ,GAAG;EACjC,IAAI,aAAa,MAAM;GACrB,IAAI,KAAK,cACP,KAAK,UAAU,QAAQ;GAEzB,OAAO,SAAS;EAClB;EACA,KAAK,IAAI,KAAK,KAAK;EACnB,OAAO;CACT;CAEA,QAAQ,KAAQ,OAAyB;EACvC,MAAM,OAAO,KAAK,QAAQ,GAAG;EAC7B,IAAI,SAAS,MAAM,OAAO,KAAA;EAC1B,MAAM,WAAW,KAAK;EACtB,KAAK,QAAQ;EACb,IAAI,KAAK,cACP,KAAK,UAAU,IAAI;EAErB,OAAO;CACT;CAEA,aAAa,KAAQ,UAAa,UAAsB;EACtD,MAAM,OAAO,KAAK,QAAQ,GAAG;EAC7B,IAAI,SAAS,QAAQ,CAAC,KAAK,SAAS,KAAK,OAAO,QAAQ,GACtD,OAAO;EAET,KAAK,QAAQ;EACb,IAAI,KAAK,cACP,KAAK,UAAU,IAAI;EAErB,OAAO;CACT;CAEA,OAAO,KAAuB;EAC5B,MAAM,OAAO,KAAK,QAAQ,GAAG;EAC7B,IAAI,SAAS,MAAM,OAAO,KAAA;EAE1B,MAAM,WAAW,KAAK;EAGtB,KAAK,iBAAiB,IAAI;EAG1B,KAAK,eAAe,IAAI;EAExB,KAAK;EACL,OAAO;CACT;CAEA,YAAY,KAAQ,OAAmB;EACrC,MAAM,OAAO,KAAK,QAAQ,GAAG;EAC7B,IAAI,SAAS,QAAQ,CAAC,KAAK,SAAS,KAAK,OAAO,KAAK,GACnD,OAAO;EAIT,KAAK,iBAAiB,IAAI;EAG1B,KAAK,eAAe,IAAI;EAExB,KAAK;EACL,OAAO;CACT;CAEA,QAAc;EACZ,KAAK,WAAW,IAAI,MAAM,KAAK,SAAS,MAAM,CAAC,CAAC,KAAK,IAAI;EACzD,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;CACf;CAMA,OAAO,OAAoD;EACzD,IAAI,aAAa,SAAS,OAAO,MAAM,YAAY,YACjD,KAAK,MAAM,SAAS,MAAM,QAAQ,GAChC,KAAK,IAAI,MAAM,KAAK,MAAM,KAAK;OAGjC,KAAK,MAAM,SAAS,OAClB,KAAK,IAAI,MAAM,KAAK,MAAM,KAAK;CAGrC;CAMA,gBAAgB,KAAQ,iBAAmC;EACzD,MAAM,WAAW,KAAK,QAAQ,GAAG;EACjC,IAAI,aAAa,MAAM;GACrB,IAAI,KAAK,cACP,KAAK,UAAU,QAAQ;GAEzB,OAAO,SAAS;EAClB;EACA,MAAM,QAAQ,gBAAgB,GAAG;EACjC,KAAK,IAAI,KAAK,KAAK;EACnB,OAAO;CACT;CAEA,iBAAiB,KAAQ,mBAAuE;EAC9F,MAAM,WAAW,KAAK,QAAQ,GAAG;EACjC,IAAI,aAAa,MAAM,OAAO,KAAA;EAE9B,MAAM,WAAW,kBAAkB,KAAK,SAAS,KAAK;EACtD,IAAI,aAAa,KAAA,GAAW;GAC1B,KAAK,OAAO,GAAG;GACf;EACF;EACA,SAAS,QAAQ;EACjB,IAAI,KAAK,cACP,KAAK,UAAU,QAAQ;EAEzB,OAAO;CACT;CAEA,QAAQ,KAAQ,mBAAmF;EACjG,MAAM,WAAW,KAAK,QAAQ,GAAG;EACjC,MAAM,WAAW,kBAAkB,KAAK,UAAU,KAAK;EAEvD,IAAI,aAAa,KAAA,GAAW;GAC1B,IAAI,aAAa,MACf,KAAK,OAAO,GAAG;GAEjB;EACF;EAEA,KAAK,IAAI,KAAK,QAAQ;EACtB,OAAO;CACT;CAEA,MAAM,KAAQ,OAAU,mBAA+E;EACrG,MAAM,WAAW,KAAK,QAAQ,GAAG;EAEjC,IAAI,aAAa,MAAM;GACrB,KAAK,IAAI,KAAK,KAAK;GACnB,OAAO;EACT;EAEA,MAAM,SAAS,kBAAkB,SAAS,OAAO,KAAK;EACtD,IAAI,WAAW,KAAA,GAAW;GACxB,KAAK,OAAO,GAAG;GACf;EACF;EAEA,SAAS,QAAQ;EACjB,IAAI,KAAK,cACP,KAAK,UAAU,QAAQ;EAEzB,OAAO;CACT;CAMA,CAAC,OAA4B;EAC3B,IAAI,OAAO,KAAK;EAChB,OAAO,SAAS,MAAM;GACpB,MAAM,KAAK;GACX,OAAO,KAAK;EACd;CACF;CAEA,CAAC,SAA8B;EAC7B,IAAI,OAAO,KAAK;EAChB,OAAO,SAAS,MAAM;GACpB,MAAM,KAAK;GACX,OAAO,KAAK;EACd;CACF;CAEA,CAAC,UAAyC;EACxC,IAAI,OAAO,KAAK;EAChB,OAAO,SAAS,MAAM;GACpB,MAAM;IAAE,KAAK,KAAK;IAAK,OAAO,KAAK;GAAM;GACzC,OAAO,KAAK;EACd;CACF;CAEA,EAAE,OAAO,YAAmC;EAC1C,OAAO,KAAK,QAAQ;CACtB;CAEA,QAAQ,QAAqD;EAC3D,KAAK,MAAM,SAAS,KAAK,QAAQ,GAC/B,OAAO,MAAM,OAAO,MAAM,KAAK,IAAI;CAEvC;CAEA,UAAyB;EACvB,OAAO,MAAM,KAAK,KAAK,QAAQ,CAAC;CAClC;CAMA,QAAgB,KAAiC;EAC/C,MAAM,WAAW,KAAK,MAAM,GAAG;EAC/B,MAAM,QAAQ,KAAK,eAAe,QAAQ;EAC1C,IAAI,OAAO,KAAK,SAAS,UAAU;EAEnC,OAAO,SAAS,MAAM;GACpB,IAAI,KAAK,SAAS,YAAY,KAAK,IAAI,KAAK,KAAK,GAAG,GAClD,OAAO;GAET,OAAO,KAAK;EACd;EAEA,OAAO;CACT;CAEA,eAAuB,UAA0B;EAC/C,OAAO,KAAK,IAAI,QAAQ,IAAI,KAAK,SAAS;CAC5C;CAEA,iBAAyB,MAA8B;EACrD,MAAM,QAAQ,KAAK,eAAe,KAAK,IAAI;EAC3C,IAAI,UAAU,KAAK,SAAS,UAAU;EACtC,IAAI,OAAgC;EAEpC,OAAO,YAAY,MAAM;GACvB,IAAI,YAAY,MAAM;IACpB,IAAI,SAAS,MACX,KAAK,SAAS,SAAS,QAAQ;SAE/B,KAAK,OAAO,QAAQ;IAEtB;GACF;GACA,OAAO;GACP,UAAU,QAAQ;EACpB;CACF;CAEA,SAAiB,MAA8B;EAC7C,KAAK,SAAS,KAAK;EACnB,KAAK,QAAQ;EACb,IAAI,KAAK,UAAU,MAAM,KAAK,QAAQ;OACjC,KAAK,MAAM,QAAQ;EACxB,KAAK,QAAQ;CACf;CAEA,eAAuB,MAA8B;EACnD,IAAI,KAAK,WAAW,MAAM,KAAK,OAAO,QAAQ,KAAK;OAC9C,KAAK,QAAQ,KAAK;EACvB,IAAI,KAAK,UAAU,MAAM,KAAK,MAAM,SAAS,KAAK;OAC7C,KAAK,QAAQ,KAAK;EACvB,KAAK,SAAS,KAAK,QAAQ;CAC7B;CAEA,UAAkB,MAA8B;EAC9C,IAAI,SAAS,KAAK,OAAO;EACzB,KAAK,eAAe,IAAI;EACxB,KAAK,SAAS,IAAI;CACpB;CAEA,SAAuB;EACrB,KAAK,WAAW,IAAI,MAAM,KAAK,SAAS,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI;EAE7D,KAAK,IAAI,OAAO,KAAK,OAAO,SAAS,MAAM,OAAO,KAAK,OAAO;GAC5D,MAAM,QAAQ,KAAK,eAAe,KAAK,IAAI;GAC3C,KAAK,OAAO,KAAK,SAAS,UAAU;GACpC,KAAK,SAAS,SAAS;EACzB;CACF;CAMA,WAAmB;EAIjB,OAAO,iBAHS,MAAM,KAAK,KAAK,QAAQ,CAAC,CAAC,CACvC,KAAK,EAAE,KAAK,YAAY,GAAG,IAAI,GAAG,OAAO,CAAC,CAC1C,KAAK,IACsB,EAAE;CAClC;AACF;;;;;;;;;;;;;;;;;;;;AAqBA,SAAgB,cACd,kBACqB;CACrB,IAAI,oBAAoB,OAAO,YAAY,kBAAkB;EAC3D,MAAM,MAAM,IAAI,cAAoB;EACpC,KAAK,MAAM,CAAC,KAAK,UAAU,kBACzB,IAAI,IAAI,KAAK,KAAK;EAEpB,OAAO;CACT;CAEA,OAAO,IAAI,cAAoB,gBAA8C;AAC/E;;;;;AC1hBA,MAAM,QAAQ;CACZ,KAAK;CACL,OAAO;AACT;AAgBA,SAAS,QAAc,MAAoC;CACzD,OAAO,SAAS,OAAO,MAAM,QAAQ,KAAK;AAC5C;AACA,SAAS,SAAe,MAAoD;CAC1E,OAAO,SAAS,OAAO,OAAO,KAAK;AACrC;AACA,SAAS,OAAa,MAAoD;CACxE,OAAO,SAAS,OAAO,OAAO,KAAK;AACrC;AACA,SAAS,QAAc,MAAoD;CACzE,OAAO,SAAS,OAAO,OAAO,KAAK;AACrC;AACA,SAAS,SAAe,MAA6B,OAAoB;CACvE,IAAI,SAAS,MAAM,KAAK,QAAQ;AAClC;;;;;;;AA+BA,IAAa,UAAb,MAAa,QAA4C;CACvD,QAAuC;CACvC,QAAwB;CACxB;CACA;CACA;CAEA,YAAY,UAAgC,CAAC,GAAG;EAC9C,MAAM,EACJ,UAAU,gBACV,KAAK,WACL,UAAU,cACR;EAEJ,KAAK,WAAW;EAChB,KAAK,MAAM;EACX,KAAK,WAAW;CAClB;CAMA,IAAI,OAAe;EACjB,OAAO,KAAK;CACd;CAEA,IAAI,UAAmB;EACrB,OAAO,KAAK,UAAU;CACxB;CAEA,IAAI,aAAyB;EAC3B,OAAO,KAAK;CACd;CAEA,IAAI,QAAe;EACjB,OAAO,KAAK;CACd;CAEA,IAAI,UAAiB;EACnB,OAAO,KAAK;CACd;CAMA,IAAI,KAAiB;EACnB,OAAO,KAAK,QAAQ,GAAG,MAAM;CAC/B;CAEA,YAAY,KAAiB;EAC3B,OAAO,KAAK,IAAI,GAAG;CACrB;CAEA,cAAc,OAAmB;EAC/B,OAAO,KAAK,UAAU,KAAK,OAAO,KAAK;CACzC;CAEA,IAAI,KAAW;EACb,MAAM,OAAO,KAAK,QAAQ,GAAG;EAC7B,IAAI,SAAS,MACX,MAAM,IAAI,MAAM,eAAe;EAEjC,OAAO,KAAK;CACd;CAEA,eAAe,KAAuB;EAEpC,OADa,KAAK,QAAQ,GAChB,CAAC,EAAE;CACf;CAEA,aAAa,KAAQ,cAAoB;EACvC,MAAM,OAAO,KAAK,QAAQ,GAAG;EAC7B,OAAO,SAAS,OAAO,KAAK,QAAQ;CACtC;CAMA,IAAI,KAAQ,OAAyB;EACnC,IAAI,KAAK,UAAU,MAAM;GACvB,KAAK,QAAQ,KAAK,WAAW,KAAK,OAAO,MAAM,KAAK;GACpD,KAAK;GACL;EACF;EAGA,IAAI,OAA8B,KAAK;EACvC,IAAI,SAAgC;EAEpC,OAAO,SAAS,MAAM;GACpB,SAAS;GACT,MAAM,MAAM,KAAK,SAAS,KAAK,KAAK,GAAG;GAEvC,IAAI,QAAQ,GAAG;IAEb,MAAM,WAAW,KAAK;IACtB,KAAK,QAAQ;IACb,OAAO;GACT,OAAO,IAAI,MAAM,GACf,OAAO,KAAK;QAEZ,OAAO,KAAK;EAEhB;EAGA,MAAM,UAAU,KAAK,WAAW,KAAK,OAAO,MAAM,GAAG;EACrD,QAAQ,SAAS;EAEjB,IAAI,WAAW,MAAM;GAEnB,IADY,KAAK,SAAS,KAAK,OAAO,GAChC,IAAI,GACR,OAAO,OAAO;QAEd,OAAO,QAAQ;EAEnB;EAEA,KAAK;EACL,KAAK,kBAAkB,OAAO;CAEhC;CAEA,YAAY,KAAQ,OAAa;EAC/B,MAAM,WAAW,KAAK,QAAQ,GAAG;EACjC,IAAI,aAAa,MACf,OAAO,SAAS;EAElB,KAAK,IAAI,KAAK,KAAK;EACnB,OAAO;CACT;CAEA,QAAQ,KAAQ,OAAyB;EACvC,MAAM,OAAO,KAAK,QAAQ,GAAG;EAC7B,IAAI,SAAS,MAAM,OAAO,KAAA;EAC1B,MAAM,WAAW,KAAK;EACtB,KAAK,QAAQ;EACb,OAAO;CACT;CAEA,aAAa,KAAQ,UAAa,UAAsB;EACtD,MAAM,OAAO,KAAK,QAAQ,GAAG;EAC7B,IAAI,SAAS,QAAQ,CAAC,KAAK,SAAS,KAAK,OAAO,QAAQ,GACtD,OAAO;EAET,KAAK,QAAQ;EACb,OAAO;CACT;CAEA,OAAO,KAAuB;EAC5B,MAAM,OAAO,KAAK,QAAQ,GAAG;EAC7B,IAAI,SAAS,MAAM,OAAO,KAAA;EAE1B,MAAM,WAAW,KAAK;EACtB,KAAK,WAAW,IAAI;EACpB,KAAK;EACL,OAAO;CACT;CAEA,YAAY,KAAQ,OAAmB;EACrC,MAAM,OAAO,KAAK,QAAQ,GAAG;EAC7B,IAAI,SAAS,QAAQ,CAAC,KAAK,SAAS,KAAK,OAAO,KAAK,GACnD,OAAO;EAET,KAAK,WAAW,IAAI;EACpB,KAAK;EACL,OAAO;CACT;CAEA,QAAc;EACZ,KAAK,QAAQ;EACb,KAAK,QAAQ;CACf;CAMA,OAAO,OAAyD;EAC9D,IAAI,aAAa,SAAS,OAAO,MAAM,YAAY,YACjD,KAAK,MAAM,SAAS,MAAM,QAAQ,GAChC,KAAK,IAAI,MAAM,KAAK,MAAM,KAAK;OAGjC,KAAK,MAAM,SAAS,OAClB,KAAK,IAAI,MAAM,KAAK,MAAM,KAAK;CAGrC;CAMA,gBAAgB,KAAQ,iBAAmC;EACzD,MAAM,WAAW,KAAK,QAAQ,GAAG;EACjC,IAAI,aAAa,MACf,OAAO,SAAS;EAElB,MAAM,QAAQ,gBAAgB,GAAG;EACjC,KAAK,IAAI,KAAK,KAAK;EACnB,OAAO;CACT;CAEA,iBAAiB,KAAQ,mBAAuE;EAC9F,MAAM,WAAW,KAAK,QAAQ,GAAG;EACjC,IAAI,aAAa,MAAM,OAAO,KAAA;EAE9B,MAAM,WAAW,kBAAkB,KAAK,SAAS,KAAK;EACtD,IAAI,aAAa,KAAA,GAAW;GAC1B,KAAK,OAAO,GAAG;GACf;EACF;EACA,SAAS,QAAQ;EACjB,OAAO;CACT;CAEA,QAAQ,KAAQ,mBAAmF;EACjG,MAAM,WAAW,KAAK,QAAQ,GAAG;EACjC,MAAM,WAAW,kBAAkB,KAAK,UAAU,KAAK;EAEvD,IAAI,aAAa,KAAA,GAAW;GAC1B,IAAI,aAAa,MACf,KAAK,OAAO,GAAG;GAEjB;EACF;EAEA,KAAK,IAAI,KAAK,QAAQ;EACtB,OAAO;CACT;CAEA,MAAM,KAAQ,OAAU,mBAA+E;EACrG,MAAM,WAAW,KAAK,QAAQ,GAAG;EAEjC,IAAI,aAAa,MAAM;GACrB,KAAK,IAAI,KAAK,KAAK;GACnB,OAAO;EACT;EAEA,MAAM,SAAS,kBAAkB,SAAS,OAAO,KAAK;EACtD,IAAI,WAAW,KAAA,GAAW;GACxB,KAAK,OAAO,GAAG;GACf;EACF;EAEA,SAAS,QAAQ;EACjB,OAAO;CACT;CAMA,WAAc;EACZ,IAAI,KAAK,UAAU,MACjB,MAAM,IAAI,MAAM,cAAc;EAEhC,OAAO,KAAK,aAAa,KAAK,KAAK,CAAC,CAAC;CACvC;CAEA,UAAa;EACX,IAAI,KAAK,UAAU,MACjB,MAAM,IAAI,MAAM,cAAc;EAEhC,OAAO,KAAK,YAAY,KAAK,KAAK,CAAC,CAAC;CACtC;CAEA,QAAQ,OAA2B;EAEjC,MAAM,SAAS,IAAI,QAAc;GAC/B,SAAS,KAAK;GACd,IAAI,KAAK;GACT,SAAS,KAAK;EAChB,CAAC;EAED,KAAK,MAAM,SAAS,KAAK,QAAQ,GAC/B,IAAI,KAAK,SAAS,MAAM,KAAK,KAAK,IAAI,GACpC,OAAO,IAAI,MAAM,KAAK,MAAM,KAAK;OAEjC;EAIJ,OAAO;CACT;CAEA,QAAQ,SAA6B;EACnC,MAAM,SAAS,IAAI,QAAc;GAC/B,SAAS,KAAK;GACd,IAAI,KAAK;GACT,SAAS,KAAK;EAChB,CAAC;EAED,IAAI,UAAU;EACd,KAAK,MAAM,SAAS,KAAK,QAAQ,GAAG;GAClC,IAAI,CAAC,WAAW,KAAK,SAAS,MAAM,KAAK,OAAO,IAAI,GAClD;GAEF,UAAU;GACV,OAAO,IAAI,MAAM,KAAK,MAAM,KAAK;EACnC;EAEA,OAAO;CACT;CAEA,OAAO,SAAY,OAA2B;EAC5C,MAAM,SAAS,IAAI,QAAc;GAC/B,SAAS,KAAK;GACd,IAAI,KAAK;GACT,SAAS,KAAK;EAChB,CAAC;EAED,KAAK,MAAM,SAAS,KAAK,QAAQ,GAAG;GAClC,MAAM,UAAU,KAAK,SAAS,MAAM,KAAK,OAAO;GAChD,MAAM,QAAQ,KAAK,SAAS,MAAM,KAAK,KAAK;GAE5C,IAAI,WAAW,KAAK,QAAQ,GAC1B,OAAO,IAAI,MAAM,KAAK,MAAM,KAAK;QAC5B,IAAI,SAAS,GAClB;EAEJ;EAEA,OAAO;CACT;CAMA,SAAS,KAAuB;EAC9B,OAAO,KAAK,WAAW,GAAG,CAAC,EAAE;CAC/B;CAEA,WAAW,KAAuB;EAChC,OAAO,KAAK,aAAa,GAAG,CAAC,EAAE;CACjC;CAEA,SAAS,KAAuB;EAC9B,OAAO,KAAK,WAAW,GAAG,CAAC,EAAE;CAC/B;CAEA,UAAU,KAAuB;EAC/B,OAAO,KAAK,YAAY,GAAG,CAAC,EAAE;CAChC;CAEA,WAAW,KAAiC;EAC1C,IAAI,OAAO,KAAK;EAChB,IAAI,SAAgC;EAEpC,OAAO,SAAS,MAAM;GACpB,MAAM,MAAM,KAAK,SAAS,KAAK,KAAK,GAAG;GACvC,IAAI,QAAQ,GACV,OAAO;IAAE,KAAK,KAAK;IAAK,OAAO,KAAK;GAAM;QACrC,IAAI,MAAM,GACf,OAAO,KAAK;QACP;IACL,SAAS;IACT,OAAO,KAAK;GACd;EACF;EAEA,OAAO,SAAS;GAAE,KAAK,OAAO;GAAK,OAAO,OAAO;EAAM,IAAI,KAAA;CAC7D;CAEA,aAAa,KAAiC;EAC5C,IAAI,OAAO,KAAK;EAChB,IAAI,SAAgC;EAEpC,OAAO,SAAS,MAAM;GACpB,MAAM,MAAM,KAAK,SAAS,KAAK,KAAK,GAAG;GACvC,IAAI,QAAQ,GACV,OAAO;IAAE,KAAK,KAAK;IAAK,OAAO,KAAK;GAAM;QACrC,IAAI,MAAM,GACf,OAAO,KAAK;QACP;IACL,SAAS;IACT,OAAO,KAAK;GACd;EACF;EAEA,OAAO,SAAS;GAAE,KAAK,OAAO;GAAK,OAAO,OAAO;EAAM,IAAI,KAAA;CAC7D;CAEA,WAAW,KAAiC;EAC1C,IAAI,OAAO,KAAK;EAChB,IAAI,SAAgC;EAEpC,OAAO,SAAS,MAEd,IADY,KAAK,SAAS,KAAK,KAAK,GAC9B,KAAK,GACT,OAAO,KAAK;OACP;GACL,SAAS;GACT,OAAO,KAAK;EACd;EAGF,OAAO,SAAS;GAAE,KAAK,OAAO;GAAK,OAAO,OAAO;EAAM,IAAI,KAAA;CAC7D;CAEA,YAAY,KAAiC;EAC3C,IAAI,OAAO,KAAK;EAChB,IAAI,SAAgC;EAEpC,OAAO,SAAS,MAEd,IADY,KAAK,SAAS,KAAK,KAAK,GAC9B,KAAK,GACT,OAAO,KAAK;OACP;GACL,SAAS;GACT,OAAO,KAAK;EACd;EAGF,OAAO,SAAS;GAAE,KAAK,OAAO;GAAK,OAAO,OAAO;EAAM,IAAI,KAAA;CAC7D;CAEA,aAAsC;EACpC,IAAI,KAAK,UAAU,MAAM,OAAO,KAAA;EAChC,MAAM,OAAO,KAAK,aAAa,KAAK,KAAK;EACzC,OAAO;GAAE,KAAK,KAAK;GAAK,OAAO,KAAK;EAAM;CAC5C;CAEA,YAAqC;EACnC,IAAI,KAAK,UAAU,MAAM,OAAO,KAAA;EAChC,MAAM,OAAO,KAAK,YAAY,KAAK,KAAK;EACxC,OAAO;GAAE,KAAK,KAAK;GAAK,OAAO,KAAK;EAAM;CAC5C;CAEA,iBAA0C;EACxC,IAAI,KAAK,UAAU,MAAM,OAAO,KAAA;EAChC,MAAM,OAAO,KAAK,aAAa,KAAK,KAAK;EACzC,MAAM,QAAQ;GAAE,KAAK,KAAK;GAAK,OAAO,KAAK;EAAM;EACjD,KAAK,WAAW,IAAI;EACpB,KAAK;EACL,OAAO;CACT;CAEA,gBAAyC;EACvC,IAAI,KAAK,UAAU,MAAM,OAAO,KAAA;EAChC,MAAM,OAAO,KAAK,YAAY,KAAK,KAAK;EACxC,MAAM,QAAQ;GAAE,KAAK,KAAK;GAAK,OAAO,KAAK;EAAM;EACjD,KAAK,WAAW,IAAI;EACpB,KAAK;EACL,OAAO;CACT;CAEA,gBAAoC;EAElC,MAAM,WAAW,IAAI,QAAc;GACjC,UAAU,GAAG,MAAM,KAAK,SAAS,GAAG,CAAC;GACrC,IAAI,KAAK;GACT,SAAS,KAAK;EAChB,CAAC;EAED,KAAK,MAAM,SAAS,KAAK,QAAQ,GAC/B,SAAS,IAAI,MAAM,KAAK,MAAM,KAAK;EAGrC,OAAO;CACT;CAEA,CAAC,iBAAsC;EACrC,OAAO,KAAK,wBAAwB,KAAK,QAAQ,SAAS,KAAK,GAAG;CACpE;CAMA,CAAC,OAA4B;EAC3B,OAAO,KAAK,iBAAiB,KAAK,QAAQ,SAAS,KAAK,GAAG;CAC7D;CAEA,CAAC,SAA8B;EAC7B,OAAO,KAAK,iBAAiB,KAAK,QAAQ,SAAS,KAAK,KAAK;CAC/D;CAEA,CAAC,UAAyC;EACxC,OAAO,KAAK,iBAAiB,KAAK,QAAQ,UAAU;GAClD,KAAK,KAAK;GACV,OAAO,KAAK;EACd,EAAE;CACJ;CAEA,EAAE,OAAO,YAAmC;EAC1C,OAAO,KAAK,QAAQ;CACtB;CAEA,QAAQ,QAAqD;EAC3D,KAAK,MAAM,SAAS,KAAK,QAAQ,GAC/B,OAAO,MAAM,OAAO,MAAM,KAAK,IAAI;CAEvC;CAEA,UAAyB;EACvB,OAAO,MAAM,KAAK,KAAK,QAAQ,CAAC;CAClC;CAMA,WAAmB,KAAQ,OAAU,OAA8B;EACjE,OAAO;GACL;GACA;GACA;GACA,MAAM;GACN,OAAO;GACP,QAAQ;EACV;CACF;CAEA,QAAgB,KAA+B;EAC7C,IAAI,OAAO,KAAK;EAEhB,OAAO,SAAS,MAAM;GACpB,MAAM,MAAM,KAAK,SAAS,KAAK,KAAK,GAAG;GACvC,IAAI,QAAQ,GACV,OAAO;QACF,IAAI,MAAM,GACf,OAAO,KAAK;QAEZ,OAAO,KAAK;EAEhB;EAEA,OAAO;CACT;CAEA,aAAqB,MAAsC;EACzD,OAAO,KAAK,SAAS,MACnB,OAAO,KAAK;EAEd,OAAO;CACT;CAEA,YAAoB,MAAsC;EACxD,OAAO,KAAK,UAAU,MACpB,OAAO,KAAK;EAEd,OAAO;CACT;CAEA,UAAkB,MAA6B,OAAmB;EAChE,IAAI,SAAS,MAAM,OAAO;EAC1B,IAAI,KAAK,SAAS,KAAK,OAAO,KAAK,GAAG,OAAO;EAC7C,OAAO,KAAK,UAAU,KAAK,MAAM,KAAK,KAAK,KAAK,UAAU,KAAK,OAAO,KAAK;CAC7E;CAEA,CAAS,iBACP,MACA,QACqB;EACrB,IAAI,SAAS,MAAM;EACnB,OAAO,KAAK,iBAAiB,KAAK,MAAM,MAAM;EAC9C,MAAM,OAAO,IAAI;EACjB,OAAO,KAAK,iBAAiB,KAAK,OAAO,MAAM;CACjD;CAEA,CAAS,wBACP,MACA,QACqB;EACrB,IAAI,SAAS,MAAM;EACnB,OAAO,KAAK,wBAAwB,KAAK,OAAO,MAAM;EACtD,MAAM,OAAO,IAAI;EACjB,OAAO,KAAK,wBAAwB,KAAK,MAAM,MAAM;CACvD;CAMA,WAAmB,MAAmC;EACpD,IAAI,SAAS,QAAQ,KAAK,UAAU,MAAM;EAC1C,MAAM,QAAQ,KAAK;EACnB,KAAK,QAAQ,MAAM;EAEnB,IAAI,MAAM,SAAS,MACjB,MAAM,KAAK,SAAS;EAGtB,MAAM,SAAS,KAAK;EAEpB,IAAI,KAAK,WAAW,MAClB,KAAK,QAAQ;OACR,IAAI,SAAS,KAAK,OAAO,MAC9B,KAAK,OAAO,OAAO;OAEnB,KAAK,OAAO,QAAQ;EAGtB,MAAM,OAAO;EACb,KAAK,SAAS;CAChB;CAEA,YAAoB,MAAmC;EACrD,IAAI,SAAS,QAAQ,KAAK,SAAS,MAAM;EACzC,MAAM,OAAO,KAAK;EAClB,KAAK,OAAO,KAAK;EAEjB,IAAI,KAAK,UAAU,MACjB,KAAK,MAAM,SAAS;EAGtB,KAAK,SAAS,KAAK;EAEnB,IAAI,KAAK,WAAW,MAClB,KAAK,QAAQ;OACR,IAAI,SAAS,KAAK,OAAO,OAC9B,KAAK,OAAO,QAAQ;OAEpB,KAAK,OAAO,OAAO;EAGrB,KAAK,QAAQ;EACb,KAAK,SAAS;CAChB;CAEA,kBAA0B,MAA4B;EACpD,OAAO,KAAK,WAAW,QAAQ,KAAK,OAAO,UAAU,MAAM,KACzD,IAAI,KAAK,WAAW,KAAK,OAAO,QAAQ,MAAM;GAC5C,MAAM,QAAQ,KAAK,OAAO,OAAO;GAEjC,IAAI,OAAO,UAAU,MAAM,KAAK;IAE9B,KAAK,OAAO,QAAQ,MAAM;IAC1B,MAAM,QAAQ,MAAM;IACpB,KAAK,OAAO,OAAO,QAAQ,MAAM;IACjC,OAAO,KAAK,OAAO;GACrB,OAAO;IACL,IAAI,SAAS,KAAK,OAAO,OAAO;KAE9B,OAAO,KAAK;KACZ,KAAK,WAAW,IAAI;IACtB;IAEA,KAAK,OAAQ,QAAQ,MAAM;IAC3B,KAAK,OAAQ,OAAQ,QAAQ,MAAM;IACnC,KAAK,YAAY,KAAK,OAAQ,MAAO;GACvC;EACF,OAAO;GACL,MAAM,QAAQ,KAAK,OAAO,QAAQ,QAAQ;GAE1C,IAAI,OAAO,UAAU,MAAM,KAAK;IAE9B,KAAK,OAAO,QAAQ,MAAM;IAC1B,MAAM,QAAQ,MAAM;IACpB,KAAK,OAAO,OAAQ,QAAQ,MAAM;IAClC,OAAO,KAAK,OAAO;GACrB,OAAO;IACL,IAAI,SAAS,KAAK,OAAO,MAAM;KAE7B,OAAO,KAAK;KACZ,KAAK,YAAY,IAAI;IACvB;IAEA,KAAK,OAAQ,QAAQ,MAAM;IAC3B,KAAK,OAAQ,OAAQ,QAAQ,MAAM;IACnC,KAAK,WAAW,KAAK,OAAQ,MAAO;GACtC;EACF;EAGF,KAAK,MAAO,QAAQ,MAAM;CAC5B;;;;;;;;CASA,WAAmB,QAA8B;EAC/C,IAAI,OAAO;EAEX,IAAI,KAAK,SAAS,QAAQ,KAAK,UAAU,MAAM;GAC7C,MAAM,YAAY,KAAK,aAAa,KAAK,KAAK;GAC9C,KAAK,MAAM,UAAU;GACrB,KAAK,QAAQ,UAAU;GACvB,OAAO;EACT;EAEA,MAAM,cAAc,KAAK,QAAQ,KAAK;EACtC,IAAI,gBAAgB,MAAM;GACxB,YAAY,SAAS,KAAK;GAC1B,IAAI,KAAK,WAAW,MAAM,KAAK,QAAQ;QAClC,IAAI,SAAS,KAAK,OAAO,MAAM,KAAK,OAAO,OAAO;QAClD,KAAK,OAAO,QAAQ;GACzB,KAAK,OAAO,KAAK,QAAQ,KAAK,SAAS;GACvC,IAAI,KAAK,UAAU,MAAM,OAAO,KAAK,iBAAiB,WAAW;EACnE,OAAO,IAAI,KAAK,WAAW,MAEzB,KAAK,QAAQ;OACR;GAEL,IAAI,KAAK,UAAU,MAAM,OAAO,KAAK,iBAAiB,IAAI;GAC1D,IAAI,KAAK,WAAW,MAAM;IACxB,IAAI,SAAS,KAAK,OAAO,MAAM,KAAK,OAAO,OAAO;SAC7C,IAAI,SAAS,KAAK,OAAO,OAAO,KAAK,OAAO,QAAQ;IACzD,KAAK,SAAS;GAChB;EACF;CACF;CAEA,iBAAyB,OAA6B;EACpD,IAAI,IAA2B;EAC/B,OAAO,MAAM,KAAK,SAAS,QAAQ,CAAC,MAAM,MAAM,OAC9C,IAAI,MAAM,OAAO,SAAS,CAAC,CAAC,GAAG;GAC7B,IAAI,UAAU,QAAQ,SAAS,CAAC,CAAC;GACjC,IAAI,QAAQ,OAAO,MAAM,MAAM,KAAK;IAClC,SAAS,SAAS,MAAM,KAAK;IAC7B,SAAS,SAAS,CAAC,GAAG,MAAM,GAAG;IAC/B,KAAK,WAAW,SAAS,CAAC,CAAC;IAC3B,UAAU,QAAQ,SAAS,CAAC,CAAC;GAC/B;GACA,IAAI,QAAQ,OAAO,OAAO,CAAC,MAAM,MAAM,SAAS,QAAQ,QAAQ,OAAO,CAAC,MAAM,MAAM,OAAO;IACzF,SAAS,SAAS,MAAM,GAAG;IAC3B,IAAI,SAAS,CAAC;GAChB,OAAO;IACL,IAAI,QAAQ,QAAQ,OAAO,CAAC,MAAM,MAAM,OAAO;KAC7C,SAAS,OAAO,OAAO,GAAG,MAAM,KAAK;KACrC,SAAS,SAAS,MAAM,GAAG;KAC3B,KAAK,YAAY,OAAO;KACxB,UAAU,QAAQ,SAAS,CAAC,CAAC;IAC/B;IACA,SAAS,SAAS,QAAQ,SAAS,CAAC,CAAC,CAAC;IACtC,SAAS,SAAS,CAAC,GAAG,MAAM,KAAK;IACjC,SAAS,QAAQ,OAAO,GAAG,MAAM,KAAK;IACtC,KAAK,WAAW,SAAS,CAAC,CAAC;IAC3B,IAAI,KAAK;GACX;EACF,OAAO;GACL,IAAI,UAAU,OAAO,SAAS,CAAC,CAAC;GAChC,IAAI,QAAQ,OAAO,MAAM,MAAM,KAAK;IAClC,SAAS,SAAS,MAAM,KAAK;IAC7B,SAAS,SAAS,CAAC,GAAG,MAAM,GAAG;IAC/B,KAAK,YAAY,SAAS,CAAC,CAAC;IAC5B,UAAU,OAAO,SAAS,CAAC,CAAC;GAC9B;GACA,IAAI,QAAQ,QAAQ,OAAO,CAAC,MAAM,MAAM,SAAS,QAAQ,OAAO,OAAO,CAAC,MAAM,MAAM,OAAO;IACzF,SAAS,SAAS,MAAM,GAAG;IAC3B,IAAI,SAAS,CAAC;GAChB,OAAO;IACL,IAAI,QAAQ,OAAO,OAAO,CAAC,MAAM,MAAM,OAAO;KAC5C,SAAS,QAAQ,OAAO,GAAG,MAAM,KAAK;KACtC,SAAS,SAAS,MAAM,GAAG;KAC3B,KAAK,WAAW,OAAO;KACvB,UAAU,OAAO,SAAS,CAAC,CAAC;IAC9B;IACA,SAAS,SAAS,QAAQ,SAAS,CAAC,CAAC,CAAC;IACtC,SAAS,SAAS,CAAC,GAAG,MAAM,KAAK;IACjC,SAAS,OAAO,OAAO,GAAG,MAAM,KAAK;IACrC,KAAK,YAAY,SAAS,CAAC,CAAC;IAC5B,IAAI,KAAK;GACX;EACF;EAEF,SAAS,GAAG,MAAM,KAAK;CACzB;CAMA,WAAmB;EAIjB,OAAO,WAHS,MAAM,KAAK,KAAK,QAAQ,CAAC,CAAC,CACvC,KAAK,EAAE,KAAK,YAAY,GAAG,IAAI,GAAG,OAAO,CAAC,CAC1C,KAAK,IACgB,EAAE;CAC5B;AACF;;;;;;;;;;;;;;;;;;;;;;;AAwBA,SAAgB,QACd,kBACe;CACf,IAAI,oBAAoB,OAAO,YAAY,kBAAkB;EAC3D,MAAM,MAAM,IAAI,QAAc;EAC9B,KAAK,MAAM,CAAC,KAAK,UAAU,kBACzB,IAAI,IAAI,KAAK,KAAK;EAEpB,OAAO;CACT;CAEA,OAAO,IAAI,QAAc,gBAAwC;AACnE;;;;;AC92BA,MAAMC,YAAU;;;;;;;AAyBhB,IAAa,UAAb,MAAa,QAAsC;CACjD;CACA;CACA;CAEA,YAAY,UAA6B,CAAC,GAAG;EAC3C,MAAM,EACJ,UAAU,gBACV,KAAK,cACH;EAEJ,KAAK,WAAW;EAChB,KAAK,MAAM;EACX,KAAK,OAAO,IAAI,QAAoB;GAClC;GACA;EACF,CAAC;CACH;CAMA,IAAI,OAAe;EACjB,OAAO,KAAK,KAAK;CACnB;CAEA,IAAI,UAAmB;EACrB,OAAO,KAAK,KAAK;CACnB;CAEA,IAAI,aAAyB;EAC3B,OAAO,KAAK;CACd;CAEA,IAAI,KAAY;EACd,OAAO,KAAK;CACd;CAMA,IAAI,SAAqB;EACvB,OAAO,KAAK,KAAK,IAAI,OAAO;CAC9B;CAEA,SAAS,SAAqB;EAC5B,OAAO,KAAK,IAAI,OAAO;CACzB;CAEA,YAAY,OAA6B;EACvC,KAAK,MAAM,WAAW,OACpB,IAAI,CAAC,KAAK,IAAI,OAAO,GACnB,OAAO;EAGX,OAAO;CACT;CAMA,IAAI,SAAqB;EAEvB,OADiB,KAAK,KAAK,IAAI,SAASA,SAC1B,MAAM,KAAA;CACtB;CAEA,OAAO,SAAqB;EAE1B,OADgB,KAAK,KAAK,OAAO,OACpB,MAAM,KAAA;CACrB;CAEA,QAAc;EACZ,KAAK,KAAK,MAAM;CAClB;CAMA,OAAO,UAAgC;EACrC,IAAI,WAAW;EACf,KAAK,MAAM,WAAW,UACpB,IAAI,KAAK,IAAI,OAAO,GAClB,WAAW;EAGf,OAAO;CACT;CAEA,UAAU,UAAgC;EACxC,IAAI,WAAW;EACf,KAAK,MAAM,WAAW,UACpB,IAAI,KAAK,OAAO,OAAO,GACrB,WAAW;EAGf,OAAO;CACT;CAEA,UAAU,UAAgC;EACxC,MAAM,2BAAW,IAAI,IAAO;EAC5B,KAAK,MAAM,WAAW,UACpB,SAAS,IAAI,OAAO;EAGtB,IAAI,WAAW;EACf,KAAK,MAAM,WAAW,MAAM,KAAK,IAAI,GACnC,IAAI,CAAC,SAAS,IAAI,OAAO,GAAG;GAC1B,KAAK,OAAO,OAAO;GACnB,WAAW;EACb;EAEF,OAAO;CACT;CAMA,MAAM,OAAgC;EACpC,MAAM,SAAS,IAAI,QAAW;GAC5B,SAAS,KAAK;GACd,IAAI,KAAK;EACX,CAAC;EAED,KAAK,MAAM,WAAW,MACpB,OAAO,IAAI,OAAO;EAEpB,KAAK,MAAM,WAAW,OACpB,OAAO,IAAI,OAAO;EAGpB,OAAO;CACT;CAEA,aAAa,OAAgC;EAC3C,MAAM,SAAS,IAAI,QAAW;GAC5B,SAAS,KAAK;GACd,IAAI,KAAK;EACX,CAAC;EAED,MAAM,2BAAW,IAAI,IAAO;EAC5B,KAAK,MAAM,WAAW,OACpB,SAAS,IAAI,OAAO;EAGtB,KAAK,MAAM,WAAW,MACpB,IAAI,SAAS,IAAI,OAAO,GACtB,OAAO,IAAI,OAAO;EAItB,OAAO;CACT;CAEA,WAAW,OAAgC;EACzC,MAAM,SAAS,IAAI,QAAW;GAC5B,SAAS,KAAK;GACd,IAAI,KAAK;EACX,CAAC;EAED,MAAM,2BAAW,IAAI,IAAO;EAC5B,KAAK,MAAM,WAAW,OACpB,SAAS,IAAI,OAAO;EAGtB,KAAK,MAAM,WAAW,MACpB,IAAI,CAAC,SAAS,IAAI,OAAO,GACvB,OAAO,IAAI,OAAO;EAItB,OAAO;CACT;CAEA,oBAAoB,OAAgC;EAClD,MAAM,SAAS,IAAI,QAAW;GAC5B,SAAS,KAAK;GACd,IAAI,KAAK;EACX,CAAC;EAGD,KAAK,MAAM,WAAW,MACpB,OAAO,IAAI,OAAO;EAIpB,KAAK,MAAM,WAAW,OACpB,IAAI,OAAO,IAAI,OAAO,GACpB,OAAO,OAAO,OAAO;OAErB,OAAO,IAAI,OAAO;EAItB,OAAO;CACT;CAEA,WAAW,OAA6B;EACtC,MAAM,2BAAW,IAAI,IAAO;EAC5B,KAAK,MAAM,WAAW,OACpB,SAAS,IAAI,OAAO;EAGtB,KAAK,MAAM,WAAW,MACpB,IAAI,CAAC,SAAS,IAAI,OAAO,GACvB,OAAO;EAGX,OAAO;CACT;CAEA,aAAa,OAA6B;EACxC,KAAK,MAAM,WAAW,OACpB,IAAI,CAAC,KAAK,IAAI,OAAO,GACnB,OAAO;EAGX,OAAO;CACT;CAEA,eAAe,OAA6B;EAC1C,KAAK,MAAM,WAAW,OACpB,IAAI,KAAK,IAAI,OAAO,GAClB,OAAO;EAGX,OAAO;CACT;CAMA,QAAW;EAET,OADY,KAAK,KAAK,SACb;CACX;CAEA,OAAU;EAER,OADY,KAAK,KAAK,QACb;CACX;CAEA,QAAQ,WAA4B;EAClC,MAAM,SAAS,IAAI,QAAW;GAC5B,SAAS,KAAK;GACd,IAAI,KAAK;EACX,CAAC;EAED,KAAK,MAAM,WAAW,MACpB,IAAI,KAAK,SAAS,SAAS,SAAS,IAAI,GACtC,OAAO,IAAI,OAAO;OAElB;EAIJ,OAAO;CACT;CAEA,QAAQ,aAA8B;EACpC,MAAM,SAAS,IAAI,QAAW;GAC5B,SAAS,KAAK;GACd,IAAI,KAAK;EACX,CAAC;EAED,IAAI,UAAU;EACd,KAAK,MAAM,WAAW,MAAM;GAC1B,IAAI,CAAC,WAAW,KAAK,SAAS,SAAS,WAAW,IAAI,GACpD;GAEF,UAAU;GACV,OAAO,IAAI,OAAO;EACpB;EAEA,OAAO;CACT;CAEA,OAAO,aAAgB,WAA4B;EACjD,MAAM,SAAS,IAAI,QAAW;GAC5B,SAAS,KAAK;GACd,IAAI,KAAK;EACX,CAAC;EAED,KAAK,MAAM,WAAW,MAAM;GAC1B,MAAM,UAAU,KAAK,SAAS,SAAS,WAAW;GAClD,MAAM,QAAQ,KAAK,SAAS,SAAS,SAAS;GAE9C,IAAI,WAAW,KAAK,QAAQ,GAC1B,OAAO,IAAI,OAAO;QACb,IAAI,SAAS,GAClB;EAEJ;EAEA,OAAO;CACT;CAMA,MAAM,SAA2B;EAC/B,OAAO,KAAK,KAAK,SAAS,OAAO;CACnC;CAEA,QAAQ,SAA2B;EACjC,OAAO,KAAK,KAAK,WAAW,OAAO;CACrC;CAEA,MAAM,SAA2B;EAC/B,OAAO,KAAK,KAAK,SAAS,OAAO;CACnC;CAEA,OAAO,SAA2B;EAChC,OAAO,KAAK,KAAK,UAAU,OAAO;CACpC;CAEA,YAA2B;EAEzB,OADc,KAAK,KAAK,eACb,CAAC,EAAE;CAChB;CAEA,WAA0B;EAExB,OADc,KAAK,KAAK,cACb,CAAC,EAAE;CAChB;CAEA,gBAAiC;EAC/B,MAAM,WAAW,IAAI,QAAW;GAC9B,UAAU,GAAG,MAAM,KAAK,SAAS,GAAG,CAAC;GACrC,IAAI,KAAK;EACX,CAAC;EAED,KAAK,MAAM,WAAW,MACpB,SAAS,IAAI,OAAO;EAGtB,OAAO;CACT;CAEA,CAAC,qBAA0C;EACzC,OAAO,KAAK,KAAK,eAAe;CAClC;CAMA,EAAE,OAAO,YAAyB;EAChC,OAAO,KAAK,KAAK,KAAK;CACxB;CAEA,QAAQ,QAAmD;EACzD,IAAI,QAAQ;EACZ,KAAK,MAAM,WAAW,MACpB,OAAO,SAAS,OAAO;CAE3B;CAEA,UAAe;EACb,OAAO,MAAM,KAAK,IAAI;CACxB;CAMA,WAAmB;EAEjB,OAAO,WADU,MAAM,KAAK,IAAI,CAAC,CAAC,KAAK,IACd,EAAE;CAC7B;AACF;;;;;;;;;;;;;;;;;;;;AAqBA,SAAgB,QACd,mBACY;CACZ,IAAI,qBAAqB,OAAO,YAAY,mBAAmB;EAC7D,MAAM,MAAM,IAAI,QAAW;EAC3B,KAAK,MAAM,WAAW,mBACpB,IAAI,IAAI,OAAO;EAEjB,OAAO;CACT;CAEA,OAAO,IAAI,QAAW,iBAAsC;AAC9D;;;;;AC9bA,IAAM,OAAN,MAAc;CACZ;CACA;CACA;CAEA,YAAY,OAAU,OAAuB,MAAM,OAAuB,MAAM;EAC9E,KAAK,QAAQ;EACb,KAAK,OAAO;EACZ,KAAK,OAAO;CACd;AACF;;;;;;;;;;;;;;;AA2BA,IAAa,aAAb,MAAa,WAA2C;CACtD,QAAgC;CAChC,QAAgC;CAChC,QAAwB;CACxB;CAEA,YAAY,UAAgC,CAAC,GAAG;EAC9C,MAAM,EAAE,KAAK,cAAc;EAC3B,KAAK,MAAM;CACb;CAMA,IAAI,OAAe;EACjB,OAAO,KAAK;CACd;CAEA,IAAI,UAAmB;EACrB,OAAO,KAAK,UAAU;CACxB;CAEA,IAAI,KAAY;EACd,OAAO,KAAK;CACd;CAMA,SAAS,SAAkB;EACzB,MAAM,UAAU,IAAI,KAAK,SAAS,MAAM,KAAK,KAAK;EAClD,IAAI,KAAK,OACP,KAAK,MAAM,OAAO;EAEpB,KAAK,QAAQ;EACb,IAAI,CAAC,KAAK,OACR,KAAK,QAAQ;EAEf,KAAK;CACP;CAEA,QAAQ,SAAkB;EACxB,MAAM,UAAU,IAAI,KAAK,SAAS,KAAK,OAAO,IAAI;EAClD,IAAI,KAAK,OACP,KAAK,MAAM,OAAO;EAEpB,KAAK,QAAQ;EACb,IAAI,CAAC,KAAK,OACR,KAAK,QAAQ;EAEf,KAAK;CACP;CAEA,cAAiB;EACf,IAAI,CAAC,KAAK,OACR,MAAM,IAAI,MAAM,eAAe;EAEjC,OAAO,KAAK,UAAU;CACxB;CAEA,aAAgB;EACd,IAAI,CAAC,KAAK,OACR,MAAM,IAAI,MAAM,eAAe;EAEjC,OAAO,KAAK,SAAS;CACvB;CAEA,YAA2B;EACzB,IAAI,CAAC,KAAK,OAAO,OAAO,KAAA;EAExB,MAAM,QAAQ,KAAK,MAAM;EACzB,KAAK,QAAQ,KAAK,MAAM;EAExB,IAAI,KAAK,OACP,KAAK,MAAM,OAAO;OAElB,KAAK,QAAQ;EAGf,KAAK;EACL,OAAO;CACT;CAEA,WAA0B;EACxB,IAAI,CAAC,KAAK,OAAO,OAAO,KAAA;EAExB,MAAM,QAAQ,KAAK,MAAM;EACzB,KAAK,QAAQ,KAAK,MAAM;EAExB,IAAI,KAAK,OACP,KAAK,MAAM,OAAO;OAElB,KAAK,QAAQ;EAGf,KAAK;EACL,OAAO;CACT;CAEA,YAAe;EACb,IAAI,CAAC,KAAK,OACR,MAAM,IAAI,MAAM,eAAe;EAEjC,OAAO,KAAK,MAAM;CACpB;CAEA,WAAc;EACZ,IAAI,CAAC,KAAK,OACR,MAAM,IAAI,MAAM,eAAe;EAEjC,OAAO,KAAK,MAAM;CACpB;CAEA,uBAAsC;EACpC,OAAO,KAAK,OAAO;CACrB;CAEA,sBAAqC;EACnC,OAAO,KAAK,OAAO;CACrB;CAEA,WAAW,SAAqB;EAC9B,KAAK,SAAS,OAAO;EACrB,OAAO;CACT;CAEA,UAAU,SAAqB;EAC7B,KAAK,QAAQ,OAAO;EACpB,OAAO;CACT;CASA,KAAK,SAAkB;EACrB,KAAK,QAAQ,OAAO;CACtB;CAEA,MAAS;EACP,OAAO,KAAK,WAAW;CACzB;CAMA,MAAM,SAAqB;EACzB,OAAO,KAAK,UAAU,OAAO;CAC/B;CAEA,OAAU;EACR,OAAO,KAAK,YAAY;CAC1B;CAEA,OAAU;EACR,OAAO,KAAK,UAAU;CACxB;CAEA,kBAAiC;EAC/B,OAAO,KAAK,qBAAqB;CACnC;CAEA,kBAAiC;EAC/B,OAAO,KAAK,UAAU;CACxB;CAEA,QAAQ,SAAqB;EAC3B,OAAO,KAAK,MAAM,OAAO;CAC3B;CAEA,UAAa;EACX,OAAO,KAAK,KAAK;CACnB;CAMA,IAAI,OAAkB;EAEpB,OADa,KAAK,QAAQ,KAChB,CAAC,CAAC;CACd;CAEA,IAAI,OAAe,SAAe;EAChC,MAAM,OAAO,KAAK,QAAQ,KAAK;EAC/B,MAAM,MAAM,KAAK;EACjB,KAAK,QAAQ;EACb,OAAO;CACT;CAEA,OAAO,OAAe,SAAkB;EACtC,IAAI,QAAQ,KAAK,QAAQ,KAAK,OAC5B,MAAM,IAAI,WAAW,SAAS,MAAM,0BAA0B,KAAK,OAAO;EAG5E,IAAI,UAAU,GAAG;GACf,KAAK,SAAS,OAAO;GACrB;EACF;EAEA,IAAI,UAAU,KAAK,OAAO;GACxB,KAAK,QAAQ,OAAO;GACpB;EACF;EAEA,MAAM,WAAW,KAAK,QAAQ,KAAK;EACnC,MAAM,WAAW,SAAS;EAC1B,MAAM,UAAU,IAAI,KAAK,SAAS,UAAU,QAAQ;EAEpD,SAAS,OAAO;EAChB,SAAS,OAAO;EAChB,KAAK;CACP;CAEA,UAAU,OAAe,OAA6B;EACpD,IAAI,QAAQ,KAAK,QAAQ,KAAK,OAC5B,MAAM,IAAI,WAAW,SAAS,MAAM,0BAA0B,KAAK,OAAO;EAG5E,MAAM,WAAW,MAAM,KAAK,KAAK;EACjC,IAAI,SAAS,WAAW,GAAG,OAAO;EAElC,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KACnC,KAAK,OAAO,QAAQ,GAAG,SAAS,EAAG;EAGrC,OAAO;CACT;CAEA,SAAS,OAAkB;EACzB,MAAM,OAAO,KAAK,QAAQ,KAAK;EAC/B,OAAO,KAAK,WAAW,IAAI;CAC7B;CAEA,YAAY,WAAmB,SAAuB;EACpD,IAAI,YAAY,KAAK,UAAU,KAAK,SAAS,YAAY,SACvD,MAAM,IAAI,WAAW,kBAAkB,UAAU,IAAI,QAAQ,EAAE;EAGjE,KAAK,IAAI,IAAI,WAAW,IAAI,SAAS,KACnC,KAAK,SAAS,SAAS;CAE3B;CAEA,QAAQ,SAAY,YAAoB,GAAW;EACjD,IAAI,QAAQ;EACZ,IAAI,OAAO,KAAK;EAEhB,OAAO,MAAM;GACX,IAAI,SAAS,aAAa,KAAK,IAAI,KAAK,OAAO,OAAO,GACpD,OAAO;GAET,OAAO,KAAK;GACZ;EACF;EAEA,OAAO;CACT;CAEA,YAAY,SAAY,WAA4B;EAClD,MAAM,QAAQ,cAAc,KAAA,IAAY,YAAY,KAAK,QAAQ;EACjE,IAAI,QAAQ,KAAK,QAAQ;EACzB,IAAI,OAAO,KAAK;EAEhB,OAAO,QAAQ,SAAS,GAAG;GACzB,IAAI,SAAS,SAAS,KAAK,IAAI,KAAK,OAAO,OAAO,GAChD,OAAO;GAET,OAAO,KAAK;GACZ;EACF;EAEA,OAAO;CACT;CAEA,QAAW;EACT,OAAO,KAAK,UAAU;CACxB;CAEA,OAAU;EACR,OAAO,KAAK,SAAS;CACvB;CAEA,QAAW;EACT,OAAO,KAAK,YAAY;CAC1B;CAEA,QAAQ,SAAkB;EACxB,KAAK,SAAS,OAAO;CACvB;CAMA,IAAI,SAAqB;EACvB,KAAK,QAAQ,OAAO;EACpB,OAAO;CACT;CAEA,OAAO,OAA6B;EAClC,IAAI,WAAW;EACf,KAAK,MAAM,WAAW,OAAO;GAC3B,KAAK,QAAQ,OAAO;GACpB,WAAW;EACb;EACA,OAAO;CACT;CAEA,SAAS,SAAqB;EAC5B,OAAO,KAAK,QAAQ,OAAO,MAAM;CACnC;CAEA,YAAY,OAA6B;EACvC,KAAK,MAAM,WAAW,OACpB,IAAI,CAAC,KAAK,SAAS,OAAO,GAAG,OAAO;EAEtC,OAAO;CACT;CAEA,OAAO,SAAqB;EAC1B,IAAI,OAAO,KAAK;EAEhB,OAAO,MAAM;GACX,IAAI,KAAK,IAAI,KAAK,OAAO,OAAO,GAAG;IACjC,KAAK,WAAW,IAAI;IACpB,OAAO;GACT;GACA,OAAO,KAAK;EACd;EAEA,OAAO;CACT;CAEA,UAAU,OAA6B;EACrC,MAAM,WAAW,IAAI,IAAI,KAAK;EAC9B,IAAI,WAAW;EAEf,KAAK,MAAM,WAAW,UACpB,OAAO,KAAK,OAAO,OAAO,GACxB,WAAW;EAIf,OAAO;CACT;CAEA,UAAU,OAA6B;EACrC,MAAM,WAAW,IAAI,IAAI,KAAK;EAC9B,IAAI,OAAO,KAAK;EAChB,IAAI,WAAW;EAEf,OAAO,MAAM;GACX,MAAM,OAAO,KAAK;GAClB,IAAI,eAAe;GAEnB,KAAK,MAAM,iBAAiB,UAC1B,IAAI,KAAK,IAAI,KAAK,OAAO,aAAa,GAAG;IACvC,eAAe;IACf;GACF;GAGF,IAAI,CAAC,cAAc;IACjB,KAAK,WAAW,IAAI;IACpB,WAAW;GACb;GAEA,OAAO;EACT;EAEA,OAAO;CACT;CAEA,QAAc;EACZ,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;CACf;CAMA,KAAK,UAAsB,gBAAsB;EAC/C,IAAI,KAAK,SAAS,GAAG;EAGrB,MAAM,QAAQ,KAAK,QAAQ;EAC3B,MAAM,KAAK,OAAO;EAElB,KAAK,MAAM;EACX,KAAK,MAAM,WAAW,OACpB,KAAK,QAAQ,OAAO;CAExB;CAEA,UAAgB;EACd,IAAI,KAAK,SAAS,GAAG;EAErB,IAAI,OAAO,KAAK;EAChB,KAAK,QAAQ,KAAK;EAClB,KAAK,QAAQ;EAEb,OAAO,MAAM;GACX,MAAM,OAAO,KAAK;GAClB,KAAK,OAAO,KAAK;GACjB,KAAK,OAAO;GACZ,OAAO;EACT;CACF;CAMA,QAAQ,WAAmB,SAA0B;EACnD,IAAI,YAAY,KAAK,UAAU,KAAK,SAAS,YAAY,SACvD,MAAM,IAAI,WAAW,kBAAkB,UAAU,IAAI,QAAQ,EAAE;EAGjE,MAAM,MAAM,IAAI,WAAc,EAAE,IAAI,KAAK,IAAI,CAAC;EAC9C,IAAI,QAAQ;EACZ,IAAI,OAAO,KAAK;EAEhB,OAAO,QAAQ,QAAQ,SAAS;GAC9B,IAAI,SAAS,WACX,IAAI,QAAQ,KAAK,KAAK;GAExB,OAAO,KAAK;GACZ;EACF;EAEA,OAAO;CACT;CAMA,EAAE,OAAO,YAAyB;EAChC,IAAI,OAAO,KAAK;EAChB,OAAO,MAAM;GACX,MAAM,KAAK;GACX,OAAO,KAAK;EACd;CACF;CAEA,QAAQ,QAAmD;EACzD,IAAI,QAAQ;EACZ,IAAI,OAAO,KAAK;EAEhB,OAAO,MAAM;GACX,OAAO,KAAK,OAAO,KAAK;GACxB,OAAO,KAAK;GACZ;EACF;CACF;CAEA,UAAe;EACb,MAAM,SAAc,CAAC;EACrB,IAAI,OAAO,KAAK;EAEhB,OAAO,MAAM;GACX,OAAO,KAAK,KAAK,KAAK;GACtB,OAAO,KAAK;EACd;EAEA,OAAO;CACT;CAMA,QAAgB,OAAwB;EACtC,IAAI,QAAQ,KAAK,SAAS,KAAK,OAC7B,MAAM,IAAI,WAAW,SAAS,MAAM,0BAA0B,KAAK,OAAO;EAI5E,IAAI,QAAQ,KAAK,QAAQ,GAAG;GAE1B,IAAI,OAAO,KAAK;GAChB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KACzB,OAAO,KAAK;GAEd,OAAO;EACT,OAAO;GAEL,IAAI,OAAO,KAAK;GAChB,KAAK,IAAI,IAAI,KAAK,QAAQ,GAAG,IAAI,OAAO,KACtC,OAAO,KAAK;GAEd,OAAO;EACT;CACF;CAEA,WAAmB,MAAkB;EACnC,MAAM,QAAQ,KAAK;EAEnB,IAAI,KAAK,MACP,KAAK,KAAK,OAAO,KAAK;OAEtB,KAAK,QAAQ,KAAK;EAGpB,IAAI,KAAK,MACP,KAAK,KAAK,OAAO,KAAK;OAEtB,KAAK,QAAQ,KAAK;EAGpB,KAAK;EACL,OAAO;CACT;CAMA,WAAmB;EACjB,OAAO,cAAc,KAAK,QAAQ,CAAC,CAAC,KAAK,IAAI,EAAE;CACjD;AACF;;;;;;;;AASA,SAAgB,WACd,mBACe;CAEf,IAAI,qBAAqB,OAAO,YAAY,mBAAmB;EAC7D,MAAM,OAAO,IAAI,WAAc;EAC/B,KAAK,OAAO,iBAAgC;EAC5C,OAAO;CACT;CAEA,OAAO,IAAI,WAAc,iBAAyC;AACpE;;;;;AC1kBA,MAAM,UAAU,OAAO,SAAS;;;;;;;;;AAuChC,IAAa,UAAb,MAAa,QAA6B;CACxC;CACA;CAEA,YAAY,UAA6B,CAAC,GAAG;EAC3C,MAAM,EACJ,kBAAkB,IAClB,aAAa,KACb,KAAK,WACL,OAAO,gBACL;EAEJ,KAAK,MAAM;EACX,KAAK,OAAO,IAAI,QAAmB;GACjC;GACA;GACA,OAAO;GACP,SAAS;EACX,CAAC;CACH;CAMA,IAAI,OAAe;EACjB,OAAO,KAAK,KAAK;CACnB;CAEA,IAAI,UAAmB;EACrB,OAAO,KAAK,KAAK;CACnB;CAEA,IAAI,KAAY;EACd,OAAO,KAAK;CACd;CAMA,IAAI,SAAqB;EACvB,MAAM,aAAa,KAAK,KAAK,IAAI,OAAO;EACxC,KAAK,KAAK,IAAI,SAAS,OAAO;EAC9B,OAAO,CAAC;CACV;CAEA,OAAO,SAAqB;EAC1B,OAAO,KAAK,KAAK,OAAO,OAAO,MAAM,KAAA;CACvC;CAEA,SAAS,SAAqB;EAC5B,OAAO,KAAK,KAAK,IAAI,OAAO;CAC9B;CAMA,OAAO,OAA6B;EAClC,IAAI,WAAW;EACf,KAAK,MAAM,WAAW,OACpB,IAAI,KAAK,IAAI,OAAO,GAClB,WAAW;EAGf,OAAO;CACT;CAEA,UAAU,OAA6B;EACrC,IAAI,WAAW;EACf,KAAK,MAAM,WAAW,OACpB,IAAI,KAAK,OAAO,OAAO,GACrB,WAAW;EAGf,OAAO;CACT;CAEA,UAAU,OAA6B;EACrC,MAAM,WAAW,IAAI,WAAW,IAAI,KAAK;EACzC,MAAM,WAAgB,CAAC;EAEvB,KAAK,MAAM,WAAW,MAAM;GAC1B,IAAI,eAAe;GACnB,KAAK,MAAM,iBAAiB,UAC1B,IAAI,KAAK,IAAI,SAAS,aAAa,GAAG;IACpC,eAAe;IACf;GACF;GAEF,IAAI,CAAC,cACH,SAAS,KAAK,OAAO;EAEzB;EAEA,IAAI,WAAW;EACf,KAAK,MAAM,WAAW,UAAU;GAC9B,KAAK,OAAO,OAAO;GACnB,WAAW;EACb;EAEA,OAAO;CACT;CAEA,YAAY,OAA6B;EACvC,KAAK,MAAM,WAAW,OACpB,IAAI,CAAC,KAAK,SAAS,OAAO,GACxB,OAAO;EAGX,OAAO;CACT;CAEA,QAAc;EACZ,KAAK,KAAK,MAAM;CAClB;;;;;CAUA,MAAM,OAAgC;EACpC,MAAM,SAAS,KAAK,MAAM;EAC1B,OAAO,OAAO,KAAK;EACnB,OAAO;CACT;;;;;CAMA,aAAa,OAAgC;EAC3C,MAAM,SAAS,IAAI,QAAW,EAAE,IAAI,KAAK,IAAI,CAAC;EAC9C,KAAK,MAAM,WAAW,MACpB,KAAK,MAAM,gBAAgB,OACzB,IAAI,KAAK,IAAI,SAAS,YAAY,GAAG;GACnC,OAAO,IAAI,OAAO;GAClB;EACF;EAGJ,OAAO;CACT;;;;;CAMA,WAAW,OAAgC;EACzC,MAAM,SAAS,KAAK,MAAM;EAC1B,OAAO,UAAU,KAAK;EACtB,OAAO;CACT;;;;;CAMA,oBAAoB,OAAgC;EAClD,MAAM,SAAS,KAAK,MAAM,KAAK;EAC/B,MAAM,QAAQ,KAAK,aAAa,KAAK;EACrC,OAAO,UAAU,KAAK;EACtB,OAAO;CACT;;;;;CAMA,WAAW,OAA6B;EACtC,MAAM,WAAW,IAAI,QAAW,EAAE,IAAI,KAAK,IAAI,CAAC;EAChD,SAAS,OAAO,KAAK;EAErB,KAAK,MAAM,WAAW,MACpB,IAAI,CAAC,SAAS,SAAS,OAAO,GAC5B,OAAO;EAGX,OAAO;CACT;;;;;CAMA,aAAa,OAA6B;EACxC,KAAK,MAAM,WAAW,OACpB,IAAI,CAAC,KAAK,SAAS,OAAO,GACxB,OAAO;EAGX,OAAO;CACT;;;;CAKA,eAAe,OAA6B;EAC1C,KAAK,MAAM,WAAW,OACpB,IAAI,KAAK,SAAS,OAAO,GACvB,OAAO;EAGX,OAAO;CACT;CAMA,EAAE,OAAO,YAAyB;EAChC,KAAK,MAAM,SAAS,KAAK,MACvB,MAAM,MAAM;CAEhB;CAEA,QAAQ,QAAmD;EACzD,IAAI,QAAQ;EACZ,KAAK,MAAM,WAAW,MACpB,OAAO,SAAS,OAAO;CAE3B;CAEA,UAAe;EACb,OAAO,MAAM,KAAK,IAAI;CACxB;;;;CASA,QAAoB;EAClB,MAAM,QAAQ,IAAI,QAAW,EAAE,IAAI,KAAK,IAAI,CAAC;EAC7C,MAAM,OAAO,IAAI;EACjB,OAAO;CACT;;;;CAKA,WAAuD;EACrD,OAAO,KAAK,KAAK,SAAS;CAC5B;;;;CAKA,WAAmB;EACjB,OAAO,WAAW,KAAK,QAAQ,CAAC,CAAC,KAAK,IAAI,EAAE;CAC9C;AACF;;;;;;;;;AAUA,SAAgB,QACd,mBACY;CAEZ,IAAI,qBAAqB,OAAO,YAAY,mBAAmB;EAC7D,MAAM,MAAM,IAAI,QAAW;EAC3B,IAAI,OAAO,iBAAgC;EAC3C,OAAO;CACT;CAEA,OAAO,IAAI,QAAW,iBAAsC;AAC9D;;;;;;;;;;;;;AC9RA,IAAa,gBAAb,MAAa,cAA8C;CACzD;CACA;CACA;CAEA,YAAY,UAAmC,CAAC,GAAG;EACjD,MAAM,EACJ,UAAU,gBACV,KAAK,cACH;EAKJ,KAAK,QAAQ,CAAC;EACd,KAAK,WAAW;EAChB,KAAK,MAAM;CACb;CAMA,IAAI,OAAe;EACjB,OAAO,KAAK,MAAM;CACpB;CAEA,IAAI,UAAmB;EACrB,OAAO,KAAK,MAAM,WAAW;CAC/B;CAEA,IAAI,KAAY;EACd,OAAO,KAAK;CACd;CAEA,IAAI,UAAsB;EACxB,OAAO,KAAK;CACd;CAEA,IAAI,aAAyB;EAC3B,OAAO,KAAK;CACd;CAMA,MAAM,SAAqB;EACzB,KAAK,MAAM,KAAK,OAAO;EACvB,KAAK,SAAS,KAAK,MAAM,SAAS,CAAC;EACnC,OAAO;CACT;CAEA,OAAU;EACR,IAAI,KAAK,SACP,MAAM,IAAI,MAAM,yBAAyB;EAE3C,OAAO,KAAK,gBAAgB;CAC9B;CAEA,kBAAiC;EAC/B,IAAI,KAAK,SACP;EAGF,MAAM,SAAS,KAAK,MAAM;EAE1B,IAAI,KAAK,MAAM,WAAW,GACxB,KAAK,MAAM,IAAI;OACV;GACL,KAAK,MAAM,KAAK,KAAK,MAAM,IAAI;GAC/B,KAAK,WAAW,CAAC;EACnB;EAEA,OAAO;CACT;CAEA,OAAU;EACR,IAAI,KAAK,SACP,MAAM,IAAI,MAAM,yBAAyB;EAE3C,OAAO,KAAK,MAAM;CACpB;CAEA,kBAAiC;EAC/B,OAAO,KAAK,UAAU,KAAA,IAAY,KAAK,MAAM;CAC/C;CAMA,QAAQ,SAAqB;EAC3B,OAAO,KAAK,MAAM,OAAO;CAC3B;CAEA,UAAa;EACX,OAAO,KAAK,KAAK;CACnB;CAMA,IAAI,SAAqB;EACvB,OAAO,KAAK,MAAM,OAAO;CAC3B;CAEA,OAAO,OAA6B;EAClC,IAAI,WAAW;EACf,KAAK,MAAM,WAAW,OAAO;GAC3B,KAAK,MAAM,OAAO;GAClB,WAAW;EACb;EACA,OAAO;CACT;CAEA,SAAS,SAAqB;EAC5B,KAAK,MAAM,QAAQ,KAAK,OACtB,IAAI,KAAK,IAAI,MAAM,OAAO,GACxB,OAAO;EAGX,OAAO;CACT;CAEA,YAAY,OAA6B;EACvC,KAAK,MAAM,WAAW,OACpB,IAAI,CAAC,KAAK,SAAS,OAAO,GACxB,OAAO;EAGX,OAAO;CACT;CAEA,OAAO,SAAqB;EAC1B,MAAM,QAAQ,KAAK,MAAM,WAAW,SAAS,KAAK,IAAI,MAAM,OAAO,CAAC;EACpE,IAAI,UAAU,IACZ,OAAO;EAGT,IAAI,UAAU,KAAK,MAAM,SAAS,GAChC,KAAK,MAAM,IAAI;OACV;GACL,KAAK,MAAM,SAAS,KAAK,MAAM,IAAI;GACnC,KAAK,WAAW,KAAK;GACrB,KAAK,SAAS,KAAK;EACrB;EAEA,OAAO;CACT;CAEA,UAAU,OAA6B;EACrC,IAAI,WAAW;EACf,KAAK,MAAM,WAAW,OACpB,OAAO,KAAK,OAAO,OAAO,GACxB,WAAW;EAGf,OAAO;CACT;CAEA,UAAU,OAA6B;EACrC,MAAM,WAAW,IAAI,IAAI,KAAK;EAC9B,MAAM,UAAe,CAAC;EAEtB,KAAK,MAAM,WAAW,KAAK,OAAO;GAChC,IAAI,eAAe;GACnB,KAAK,MAAM,iBAAiB,UAC1B,IAAI,KAAK,IAAI,SAAS,aAAa,GAAG;IACpC,eAAe;IACf;GACF;GAEF,IAAI,cACF,QAAQ,KAAK,OAAO;EAExB;EAEA,MAAM,WAAW,QAAQ,WAAW,KAAK,MAAM;EAC/C,KAAK,QAAQ;EACb,KAAK,QAAQ;EAEb,OAAO;CACT;CAEA,QAAc;EACZ,KAAK,QAAQ,CAAC;CAChB;;;;;CAUA,EAAE,OAAO,YAAyB;EAChC,OAAO,KAAK;CACd;CAEA,QAAQ,QAAmD;EACzD,KAAK,MAAM,SAAS,SAAS,UAAU,OAAO,SAAS,KAAK,CAAC;CAC/D;;;;CAKA,UAAe;EACb,OAAO,KAAK,MAAM,MAAM;CAC1B;;;;;CAMA,gBAAqB;EACnB,MAAM,SAAc,CAAC;EACrB,MAAM,QAAQ,KAAK,MAAM;EAEzB,OAAO,CAAC,MAAM,SACZ,OAAO,KAAK,MAAM,KAAK,CAAC;EAG1B,OAAO;CACT;;;;CASA,SAAiB,OAAqB;EACpC,MAAM,UAAU,KAAK,MAAM;EAE3B,OAAO,QAAQ,GAAG;GAChB,MAAM,cAAc,KAAK,OAAO,QAAQ,KAAK,CAAC;GAC9C,MAAM,SAAS,KAAK,MAAM;GAE1B,IAAI,KAAK,SAAS,SAAS,MAAM,KAAK,GACpC;GAGF,KAAK,MAAM,SAAS;GACpB,QAAQ;EACV;EAEA,KAAK,MAAM,SAAS;CACtB;;;;;;;;;CAUA,WAAmB,OAAqB;EACtC,MAAM,SAAS,KAAK,MAAM;EAC1B,MAAM,UAAU,KAAK,MAAM;EAE3B,OAAO,MAAM;GACX,MAAM,iBAAiB,IAAI,QAAQ;GACnC,MAAM,kBAAkB,IAAI,QAAQ;GACpC,IAAI,kBAAkB,QACpB;GAGF,IAAI,aAAa;GACjB,IACE,kBAAkB,UAClB,KAAK,SAAS,KAAK,MAAM,kBAAmB,KAAK,MAAM,eAAgB,IAAI,GAE3E,aAAa;GAGf,IAAI,KAAK,SAAS,KAAK,MAAM,aAAc,OAAO,KAAK,GACrD;GAGF,KAAK,MAAM,SAAS,KAAK,MAAM;GAC/B,QAAQ;EACV;EAEA,KAAK,MAAM,SAAS;CACtB;;;;;CAMA,UAAwB;EAEtB,KAAK,IAAI,IAAI,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC,IAAI,GAAG,KAAK,GAAG,KAC1D,KAAK,WAAW,CAAC;CAErB;;;;CASA,QAA0B;EACxB,MAAM,QAAQ,IAAI,cAAiB;GACjC,SAAS,KAAK;GACd,IAAI,KAAK;EACX,CAAC;EACD,MAAM,QAAQ,KAAK,MAAM,MAAM;EAC/B,OAAO;CACT;;;;;CAMA,WAAoB;EAClB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,MAAM,QAAQ,KAAK;GAC1C,MAAM,iBAAiB,IAAI,IAAI;GAC/B,MAAM,kBAAkB,IAAI,IAAI;GAEhC,IACE,iBAAiB,KAAK,MAAM,UAC5B,KAAK,SAAS,KAAK,MAAM,IAAK,KAAK,MAAM,eAAgB,IAAI,GAE7D,OAAO;GAGT,IACE,kBAAkB,KAAK,MAAM,UAC7B,KAAK,SAAS,KAAK,MAAM,IAAK,KAAK,MAAM,gBAAiB,IAAI,GAE9D,OAAO;EAEX;EAEA,OAAO;CACT;;;;CAKA,WAAmB;EACjB,OAAO,iBAAiB,KAAK,MAAM,KAAK,IAAI,EAAE;CAChD;AACF;;;;;;;;;;;;;;;;;AAkBA,SAAgB,cACd,+BAIkB;CAElB,IAAI,OAAO,kCAAkC,YAC3C,OAAO,IAAI,cAAiB,EAC1B,SAAS,8BACX,CAAC;CAIH,IAAI,iCAAiC,OAAO,YAAY,+BAA+B;EACrF,MAAM,KAAK,IAAI,cAAiB;EAChC,GAAG,OAAO,6BAA4C;EACtD,OAAO;CACT;CAEA,OAAO,IAAI,cACT,6BACF;AACF;;AC7WA,SAAS,SAAe,MAA0B;CAChD,OAAO,SAAS,OAAO,IAAI,KAAK;AAClC;AAEA,SAAS,OAAa,MAA0B;CAC9C,OAAO,SAAS,OAAO,IAAI,KAAK;AAClC;;AAGA,IAAM,UAAN,MAAoB;CAClB;CAEA,YAAY,MAAyB;EACnC,KAAK,OAAO;CACd;CAEA,UAAU,MAAqB;EAC7B,OAAO,SAAS,OAAO,KAAK,KAAK,OAAO,QAAQ,KAAK;CACvD;;CAGA,KAAK,MAAkB,MAAS,KAAQ,OAAmB,OAAuB;EAChF,IAAI,UAAU,KAAA,GAAW,QAAQ,SAAS,OAAO,MAAM,KAAK,KAAK,OAAO,QAAQ,KAAK,SAAS,GAAG;EACjG,OAAO;GACL;GACA;GACA;GACA;GACA;GACA,QAAQ,IAAI,KAAK,IAAI,SAAS,IAAI,GAAG,SAAS,KAAK,CAAC;GACpD,MAAM,OAAO,IAAI,IAAI,IAAI,OAAO,KAAK;GACrC,SAAS,UAAU,OAAO,QAAQ,KAAK,KAAK,OAAO,QAAQ,OAAO,MAAM,OAAO;EACjF;CACF;;CAGA,UAAU,GAAe,OAA+B;EACtD,OAAO,KAAK,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,OAAO,EAAE,KAAK;CACxD;CAEA,WAAW,GAA2B;EACpC,MAAM,IAAI,EAAE;EACZ,OAAO,KAAK,KAAK,KAAK,UAAU,GAAG,EAAE,IAAI,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK;CACpE;CAEA,YAAY,GAA2B;EACrC,MAAM,IAAI,EAAE;EACZ,OAAO,KAAK,UAAU,GAAG,KAAK,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC;CACrE;;CAGA,UAAU,MAAkB,MAAS,KAAQ,OAA+B;EAC1E,MAAM,IAAI,KAAK;EACf,IAAI,SAAS,CAAC,KAAK,SAAS,KAAK,IAAI,GAAG;GACtC,MAAM,IAAI,KAAK,KAAK,GAAG,MAAM,KAAK,KAAK;GACvC,IAAI,EAAE,UAAU,SAAS,KAAK,IAAI,IAAI,GAAG,OAAO,KAAK,UAAU,MAAM,CAAC;GACtE,OAAO,KAAK,WAAW,KAAK,UAAU,MAAM,KAAK,YAAY,CAAC,CAAC,CAAC;EAClE;EACA,MAAM,IAAI,KAAK,UAAU,GAAI,MAAM,KAAK,KAAK;EAC7C,MAAM,SAAS,KAAK,UAAU,MAAM,CAAC;EACrC,OAAO,EAAE,UAAU,SAAS,KAAK,IAAI,IAAI,IAAI,SAAS,KAAK,WAAW,MAAM;CAC9E;;CAGA,SAAS,MAAkB,MAAS,KAAQ,OAAmB,OAAuB;EACpF,MAAM,IAAI,MAAM;EAChB,IAAI,SAAS,CAAC,KAAK,SAAS,IAAI,IAAI,GAAG;GACrC,MAAM,IAAI,KAAK,KAAK,MAAM,MAAM,KAAK,GAAG,KAAK;GAC7C,IAAI,EAAE,UAAU,SAAS,MAAM,KAAK,IAAI,GAAG,OAAO,KAAK,KAAK,GAAG,MAAM,MAAM,MAAM,KAAK,MAAM,KAAK;GACjG,OAAO,KAAK,YAAY,KAAK,KAAK,KAAK,WAAW,CAAC,GAAG,MAAM,MAAM,MAAM,KAAK,MAAM,KAAK,CAAC;EAC3F;EACA,MAAM,IAAI,KAAK,SAAS,MAAM,MAAM,KAAK,GAAI,KAAK;EAClD,MAAM,SAAS,KAAK,KAAK,GAAG,MAAM,MAAM,MAAM,KAAK,MAAM,KAAK;EAC9D,OAAO,EAAE,UAAU,SAAS,MAAM,KAAK,IAAI,IAAI,SAAS,KAAK,YAAY,MAAM;CACjF;;;;;CAMA,KAAK,MAAkB,MAAS,KAAQ,OAAmB,OAAuB;EAChF,IAAI,SAAS,IAAI,IAAI,SAAS,KAAK,IAAI,GAAG,OAAO,KAAK,UAAU,MAAO,MAAM,KAAK,KAAK;EACvF,IAAI,SAAS,KAAK,IAAI,SAAS,IAAI,IAAI,GAAG,OAAO,KAAK,SAAS,MAAM,MAAM,KAAK,OAAQ,KAAK;EAC7F,OAAO,KAAK,KAAK,MAAM,MAAM,KAAK,OAAO,KAAK;CAChD;;CAGA,UAAU,MAA4C;EACpD,IAAI,KAAK,UAAU,MAAM,OAAO,CAAC,KAAK,MAAM,IAAI;EAChD,MAAM,CAAC,MAAM,QAAQ,KAAK,UAAU,KAAK,KAAK;EAC9C,OAAO,CAAC,KAAK,KAAK,KAAK,MAAM,KAAK,MAAM,KAAK,KAAK,MAAM,KAAK,KAAK,GAAG,IAAI;CAC3E;CAEA,OAAO,MAAkB,OAA+B;EACtD,IAAI,SAAS,MAAM,OAAO;EAC1B,IAAI,UAAU,MAAM,OAAO;EAC3B,MAAM,CAAC,MAAM,QAAQ,KAAK,UAAU,IAAI;EACxC,OAAO,KAAK,KAAK,MAAM,KAAK,MAAM,KAAK,KAAK,KAAK;CACnD;;CAGA,QAAQ,MAAkB,OAAyC;EACjE,IAAI,SAAS,MAAM,OAAO,CAAC,MAAM,IAAI;EACrC,MAAM,SAAS,OAAO,KAAK,IAAI;EAC/B,IAAI,SAAS,QAAQ;GACnB,MAAM,CAAC,GAAG,KAAK,KAAK,QAAQ,KAAK,MAAM,KAAK;GAC5C,OAAO,CAAC,GAAG,KAAK,KAAK,GAAG,KAAK,MAAM,KAAK,KAAK,KAAK,KAAK,CAAC;EAC1D;EACA,MAAM,CAAC,GAAG,KAAK,KAAK,QAAQ,KAAK,OAAO,QAAQ,SAAS,CAAC;EAC1D,OAAO,CAAC,KAAK,KAAK,KAAK,MAAM,KAAK,MAAM,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,CAAC;CACrE;;CAGA,QAAQ,MAAkB,WAAmC,KAAkC;EAC7F,IAAI,SAAS,MAAM,OAAO,CAAC,MAAM,IAAI;EACrC,MAAM,EAAE,YAAY,KAAK,KAAK;EAC9B,MAAM,cAAc,KAAK,SAAS,OAAO,MAAM,QAAQ,KAAK,KAAK,KAAK,OAAO;EAC7E,IAAI,KAAK,SAAS,QAAQ,UAAU,WAAW,GAAG;GAChD,MAAM,CAAC,GAAG,KAAK,KAAK,QAAQ,KAAK,MAAM,WAAW,GAAG;GACrD,OAAO,CAAC,GAAG,KAAK,KAAK,GAAG,KAAK,MAAM,KAAK,KAAK,KAAK,KAAK,CAAC;EAC1D;EACA,MAAM,cAAc,QAAQ,aAAa,KAAK,GAAG;EACjD,IAAI,UAAU,WAAW,GAAG,OAAO,CAAC,KAAK,MAAM,KAAK,KAAK,MAAM,KAAK,MAAM,KAAK,KAAK,KAAK,KAAK,CAAC;EAC/F,MAAM,CAAC,GAAG,KAAK,KAAK,QAAQ,KAAK,OAAO,WAAW,WAAW;EAC9D,OAAO,CAAC,KAAK,KAAK,KAAK,MAAM,KAAK,MAAM,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,CAAC;CACrE;;CAGA,UAAU,MAAkB,OAAe,MAAS,KAAoB;EACtE,MAAM,SAAS,OAAO,KAAK,IAAI;EAC/B,IAAI,UAAU,QAAQ,OAAO,KAAK,KAAK,KAAK,MAAM,MAAM,KAAK,KAAK,KAAK;EACvE,IAAI,QAAQ,QAAQ,OAAO,KAAK,KAAK,KAAK,UAAU,KAAK,MAAO,OAAO,MAAM,GAAG,GAAG,KAAK,MAAM,KAAK,KAAK,KAAK,KAAK;EAClH,OAAO,KAAK,UAAU,MAAM,KAAK,UAAU,KAAK,OAAQ,QAAQ,SAAS,GAAG,MAAM,GAAG,CAAC;CACxF;;CAGA,SAAS,MAAkB,OAAe,MAAS,KAAoB;EACrE,IAAI,SAAS,MAAM,OAAO,KAAK,KAAK,MAAM,MAAM,KAAK,IAAI;EACzD,MAAM,SAAS,OAAO,KAAK,IAAI;EAC/B,IAAI,SAAS,QAAQ,OAAO,KAAK,KAAK,KAAK,SAAS,KAAK,MAAM,OAAO,MAAM,GAAG,GAAG,KAAK,MAAM,KAAK,KAAK,KAAK,KAAK;EACjH,OAAO,KAAK,KAAK,KAAK,MAAM,KAAK,MAAM,KAAK,KAAK,KAAK,SAAS,KAAK,OAAO,QAAQ,SAAS,GAAG,MAAM,GAAG,GAAG,KAAK,KAAK;CACvH;;;;;;CAOA,YAAY,MAAkB,OAAe,QAAkC;EAC7E,MAAM,SAAS,OAAO,KAAK,IAAI;EAC/B,IAAI,QAAQ,QAAQ,OAAO,KAAK,KAAK,KAAK,YAAY,KAAK,MAAO,OAAO,MAAM,GAAG,KAAK,MAAM,KAAK,KAAK,KAAK,KAAK;EACjH,IAAI,QAAQ,QAAQ,OAAO,KAAK,KAAK,KAAK,MAAM,KAAK,MAAM,KAAK,KAAK,KAAK,YAAY,KAAK,OAAQ,QAAQ,SAAS,GAAG,MAAM,GAAG,KAAK,KAAK;EAC1I,IAAI,QAAQ,KAAK;EACjB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,QAAQ,KAAK,SAAS,OAAO,IAAI,GAAG,OAAO,IAAK,KAAK,KAAK,QAAQ,OAAO,EAAG,CAAC;EACrH,OAAO,KAAK,KAAK,KAAK,MAAM,OAAO,IAAK,KAAK,KAAK,QAAQ,OAAO,EAAG,GAAG,KAAK;CAC9E;;CAGA,SAAS,MAAkB,OAA2B;EACpD,MAAM,SAAS,OAAO,KAAK,IAAI;EAC/B,IAAI,UAAU,QAAQ,OAAO,KAAK,OAAO,KAAK,MAAM,KAAK,KAAK;EAC9D,IAAI,QAAQ,QAAQ,OAAO,KAAK,KAAK,KAAK,SAAS,KAAK,MAAO,KAAK,GAAG,KAAK,MAAM,KAAK,KAAK,KAAK,KAAK;EACtG,OAAO,KAAK,KAAK,KAAK,MAAM,KAAK,MAAM,KAAK,KAAK,KAAK,SAAS,KAAK,OAAQ,QAAQ,SAAS,CAAC,GAAG,KAAK,KAAK;CAC7G;;CAGA,OAAO,MAAkB,OAAkB;EACzC,IAAI,OAAO;EACX,SAAS;GACP,MAAM,SAAS,OAAO,KAAK,IAAI;GAC/B,IAAI,UAAU,QAAQ,OAAO,KAAK;GAClC,IAAI,QAAQ,QAAQ,OAAO,KAAK;QAC3B;IACH,SAAS,SAAS;IAClB,OAAO,KAAK;GACd;EACF;CACF;;CAGA,KAAK,MAAkB,OAA2B;EAChD,MAAM,EAAE,UAAU,KAAK;EACvB,IAAI,UAAU,KAAA,KAAa,SAAS,QAAQ,QAAQ,KAAK,QAAQ,KAAK,KAAK,MAAM,OAAO;EACxF,MAAM,SAAS,MAAM,KAAK,OAAO,MAAM,KAAK,GAAG,KAAK,OAAO,MAAM,QAAQ,CAAC,CAAC;EAC3E,IAAI,WAAW,KAAA,GAAW,OAAO;EACjC,OAAO,KAAK,SAAS,KAAK,UAAU,MAAM,OAAO,QAAQ,KAAK,KAAK,QAAQ,MAAM,CAAC,GAAG,QAAQ,CAAC;CAChG;;CAGA,MAAM,OAAqB,IAAY,IAAwB;EAC7D,IAAI,MAAM,IAAI,OAAO;EACrB,MAAM,MAAO,KAAK,OAAQ;EAC1B,MAAM,OAAO,MAAM;EACnB,OAAO,KAAK,KAAK,KAAK,MAAM,OAAO,IAAI,GAAG,GAAG,MAAM,KAAK,KAAK,QAAQ,IAAI,GAAG,KAAK,MAAM,OAAO,MAAM,GAAG,EAAE,CAAC;CAC5G;AACF;;AAGA,MAAM,aAAa;;AAGnB,MAAM,2BAAW,IAAI,QAA2C;AAEhE,SAAS,UAAgB,MAAwC;CAC/D,IAAI,UAAU,SAAS,IAAI,IAAI;CAC/B,IAAI,YAAY,KAAA,GAAW;EACzB,UAAU,IAAI,QAAQ,IAAI;EAC1B,SAAS,IAAI,MAAM,OAAoC;CACzD;CACA,OAAO;AACT;AAEA,UAAU,KAAW,MAAiD;CAEpE,MAAM,QAAsB,CAAC;CAC7B,IAAI,OAAO;CACX,OAAO,SAAS,QAAQ,MAAM,SAAS,GAAG;EACxC,OAAO,SAAS,MAAM;GACpB,MAAM,KAAK,IAAI;GACf,OAAO,KAAK;EACd;EACA,MAAM,MAAM,MAAM,IAAI;EACtB,MAAM,IAAI;EACV,OAAO,IAAI;CACb;AACF;;AAGA,SAAS,QAAQ,OAAe,MAAsB;CACpD,IAAI,CAAC,OAAO,UAAU,KAAK,GAAG,OAAO;CACrC,MAAM,KAAK,QAAQ,IAAI,OAAO,QAAQ;CACtC,OAAO,MAAM,KAAK,KAAK,OAAO,KAAK;AACrC;AAEA,SAASC,QAAM,OAAe,MAAsB;CAClD,IAAI,OAAO,MAAM,KAAK,GAAG,OAAO;CAChC,MAAM,QAAQ,KAAK,MAAM,KAAK;CAC9B,OAAO,QAAQ,IAAI,KAAK,IAAI,GAAG,OAAO,KAAK,IAAI,KAAK,IAAI,OAAO,IAAI;AACrE;;;;;AAMA,IAAa,cAAb,MAAa,YAAqD;CAChE;CACA;CAEA,YAAoB,SAAiC,MAA2B;EAC9E,KAAK,UAAU;EACf,KAAK,OAAO;CACd;;CAGA,OAAO,GAAkB,MAAkC,SAAyB,CAAC,GAA+B;EAClH,MAAM,UAAU,UAAU,IAAI;EAC9B,MAAM,QAAQ,CAAC,GAAG,MAAM;EACxB,OAAO,IAAI,YAAY,SAAS,QAAQ,MAAM,OAAO,GAAG,MAAM,MAAM,CAAC;CACvE;CAEA,KAAa,MAAuD;EAClE,OAAO,SAAS,KAAK,OAAO,OAAO,IAAI,YAAY,KAAK,SAAS,IAAI;CACvE;CAEA,OAAe,QAA0E;EACvF,IAAI,kBAAkB,aAAa;GACjC,IAAI,OAAO,YAAY,KAAK,SAAS,MAAM,IAAI,UAAU,iDAAiD;GAC1G,OAAO,OAAO;EAChB;EACA,MAAM,QAAQ,CAAC,GAAG,MAAM;EACxB,OAAO,KAAK,QAAQ,MAAM,OAAO,GAAG,MAAM,MAAM;CAClD;;CAGA,IAAI,OAAmC;EACrC,OAAO,KAAK,QAAQ;CACtB;;CAGA,IAAI,OAAe;EACjB,OAAO,OAAO,KAAK,IAAI;CACzB;CAEA,IAAI,UAAmB;EACrB,OAAO,KAAK,SAAS;CACvB;;CAGA,IAAI,UAAmB;EACrB,OAAO,KAAK,QAAQ,UAAU,KAAK,IAAI;CACzC;;CAGA,IAAI,SAAiB;EACnB,OAAO,SAAS,KAAK,IAAI;CAC3B;;;;;CAMA,GAAG,OAAiC;EAClC,QAAQ,QAAQ,OAAO,KAAK,IAAI;EAChC,OAAO,UAAU,KAAK,KAAA,IAAY,KAAK,QAAQ,OAAO,KAAK,MAAO,KAAK;CACzE;;CAGA,UAAU,QAAQ,GAAG,MAAc,KAAK,MAAe;EACrD,OAAO,KAAK,MAAM,OAAO,GAAG,CAAC,CAAC;CAChC;;CAGA,OAAO,OAAgF;EACrF,MAAM,SAAS,KAAK,QAAQ,OAAO,KAAK,MAAM,KAAK,OAAO,KAAK,CAAC;EAChE,OAAO,KAAK,KAAK,KAAK,QAAQ,KAAK,QAAQ,KAAK,OAAO,CAAC,CAAC;CAC3D;;CAGA,QAAQ,OAAyE;EAC/E,MAAM,CAAC,MAAM,SAAS,KAAK,QAAQ,QAAQ,KAAK,MAAMA,QAAM,OAAO,KAAK,IAAI,CAAC;EAC7E,OAAO,CAAC,KAAK,KAAK,IAAI,GAAG,KAAK,KAAK,KAAK,CAAC;CAC3C;;;;;;CAOA,MAAM,WAAmG;EACvG,MAAM,CAAC,MAAM,SAAS,KAAK,QAAQ,QAAQ,KAAK,MAAM,WAAW,KAAK,QAAQ,KAAK,OAAO,KAAK;EAC/F,OAAO,CAAC,KAAK,KAAK,IAAI,GAAG,KAAK,KAAK,KAAK,CAAC;CAC3C;;;;;CAMA,OAAO,WAAmF;EACxF,MAAM,EAAE,YAAY,KAAK,QAAQ,KAAK;EACtC,IAAI,OAAO,KAAK;EAChB,IAAI,MAAM,KAAK,QAAQ,KAAK,OAAO;EACnC,IAAI,QAAQ;EACZ,OAAO,SAAS,MAAM;GACpB,MAAM,cAAc,KAAK,SAAS,OAAO,MAAM,QAAQ,KAAK,KAAK,KAAK,OAAO;GAC7E,IAAI,KAAK,SAAS,QAAQ,UAAU,WAAW,GAAG;IAChD,OAAO,KAAK;IACZ;GACF;GACA,MAAM,UAAU,QAAQ,aAAa,KAAK,GAAG;GAC7C,IAAI,UAAU,OAAO,GAAG,OAAO;IAAE,OAAO,QAAQ,OAAO,KAAK,IAAI;IAAG,MAAM,KAAK;IAAM,QAAQ;IAAa;GAAQ;GACjH,SAAS,OAAO,KAAK,IAAI,IAAI;GAC7B,MAAM;GACN,OAAO,KAAK;EACd;CAEF;;;;;;;;;;;CAYA,OAAO,KAAmC,QAAmD;EAC3F,IAAI,EAAE,UAAU,IAAI,OAAO,KAAA;EAC3B,IAAI,OAAO,KAAK;EAChB,IAAI,QAAQ;EACZ,IAAI,OAAO;EACX,OAAO,SAAS,MAAM;GACpB,IAAI,KAAK,SAAS,MAAM;IACtB,MAAM,OAAO,IAAI,KAAK,KAAK,OAAO;IAClC,IAAI,OAAO,MAAM;KACf,OAAO,KAAK;KACZ;IACF;IACA,QAAQ;IACR,SAAS,KAAK,KAAK;GACrB;GACA,MAAM,MAAM,IAAI,KAAK,GAAG;GACxB,IAAI,OAAO,KAAK,OAAO;IAAE;IAAO,MAAM,KAAK;IAAM,QAAQ;GAAK;GAC9D,QAAQ;GACR,SAAS;GACT,OAAO,KAAK;EACd;CAEF;;CAGA,MAAM,QAAQ,GAAG,MAAc,KAAK,MAAkC;EACpE,MAAM,OAAOA,QAAM,OAAO,KAAK,IAAI;EACnC,MAAM,KAAKA,QAAM,KAAK,KAAK,IAAI;EAC/B,IAAI,MAAM,MAAM,OAAO,KAAK,KAAK,IAAI;EACrC,MAAM,GAAG,QAAQ,KAAK,QAAQ,QAAQ,KAAK,MAAM,IAAI;EACrD,MAAM,CAAC,UAAU,KAAK,QAAQ,QAAQ,MAAM,KAAK,IAAI;EACrD,OAAO,KAAK,KAAK,MAAM;CACzB;;;;;CAMA,OAAO,OAAe,cAAsB,KAAK,MAAM,WAAwD,CAAC,GAA+B;EAC7I,MAAM,OAAOA,QAAM,OAAO,KAAK,IAAI;EACnC,MAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,IAAI,OAAO,MAAM,WAAW,IAAI,IAAI,KAAK,MAAM,WAAW,GAAG,KAAK,OAAO,IAAI,CAAC;EAC7G,MAAM,UAAU,KAAK;EACrB,MAAM,SAAS,oBAAoB,cAAc,KAAA,IAAY,CAAC,GAAG,QAAQ;EACzE,MAAM,QAAQ,WAAW,KAAA,IAAa,SAAwC,OAAO,OAAO;EAC5F,IAAI,UAAU,KAAK,UAAU,GAAG,OAAO;EACvC,IAAI,OAAO,KAAK;EAChB,IAAI,WAAW,KAAA,KAAa,QAAQ,SAAS,YAAY;GAEvD,MAAM,WAAW,KAAK,IAAI,OAAO,KAAK;GACtC,IAAI,QAAQ,KAAK,QAAQ,OAAO;IAE9B,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,GAAG,KAAK,OAAO,QAAQ,UAAU,MAAO,OAAO,GAAG,OAAO,IAAK,QAAQ,KAAK,QAAQ,OAAO,EAAG,CAAC;IAC1H,OAAO,QAAQ,YAAY,MAAO,OAAO,QAAQ,GAAG,OAAO,MAAM,QAAQ,CAAC,CAAC;GAC7E,OAAO,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;IACrC,MAAM,OAAO,OAAO;IACpB,MAAM,MAAM,QAAQ,KAAK,QAAQ,IAAI;IACrC,OAAO,IAAI,WAAW,QAAQ,UAAU,MAAO,OAAO,GAAG,MAAM,GAAG,IAAI,QAAQ,SAAS,MAAM,OAAO,GAAG,MAAM,GAAG;GAClH;GACA,KAAK,IAAI,IAAI,UAAU,IAAI,OAAO,KAAK,OAAO,QAAQ,SAAS,MAAO,OAAO,KAAK;EACpF,OAAO;GACL,MAAM,SAAS,WAAW,KAAA,IAAY,KAAK,OAAO,QAAQ,IAAI,QAAQ,MAAM,QAAQ,GAAG,OAAO,MAAM;GACpG,MAAM,CAAC,MAAM,QAAQ,QAAQ,QAAQ,MAAM,IAAI;GAC/C,MAAM,GAAG,SAAS,QAAQ,QAAQ,MAAM,KAAK;GAC7C,OAAO,QAAQ,OAAO,QAAQ,OAAO,MAAM,MAAM,GAAG,KAAK;EAC3D;EAEA,IAAI,QAAQ,GAAG,OAAO,QAAQ,KAAK,MAAM,OAAO,QAAQ,CAAC;EACzD,OAAO,KAAK,KAAK,QAAQ,KAAK,MAAM,OAAO,CAAC,CAAC;CAC/C;;CAGA,OAAO,OAAe,UAAmF;EACvG,OAAO,KAAK,OAAO,OAAO,GAAG,QAAQ;CACvC;;CAGA,OAAO,OAAe,MAAc,KAAK,MAAkC;EACzE,MAAM,OAAOA,QAAM,OAAO,KAAK,IAAI;EACnC,OAAO,KAAK,OAAO,MAAM,KAAK,IAAI,GAAGA,QAAM,KAAK,KAAK,IAAI,IAAI,IAAI,CAAC;CACpE;;;;;;CAOA,IAAI,OAAe,MAAwC;EACzD,MAAM,KAAK,QAAQ,OAAO,KAAK,IAAI;EACnC,OAAO,OAAO,KAAK,OAAO,KAAK,KAAK,KAAK,QAAQ,UAAU,KAAK,MAAO,IAAI,MAAM,KAAK,QAAQ,KAAK,QAAQ,IAAI,CAAC,CAAC;CACnH;;CAGA,OAAO,GAAG,QAA4C;EACpD,OAAO,KAAK,OAAO,MAAM;CAC3B;;CAGA,QAAQ,GAAG,QAA4C;EACrD,MAAM,SAAS,KAAK,QAAQ,OAAO,KAAK,OAAO,MAAM,GAAG,KAAK,IAAI;EACjE,OAAO,KAAK,KAAK,KAAK,QAAQ,KAAK,QAAQ,OAAO,SAAS,CAAC,CAAC;CAC/D;;CAGA,CAAC,OAAO,YAA4B;EAClC,OAAO,KAAK,KAAK,IAAI;CACvB;;CAGA,UAAkB;EAChB,OAAO,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC;CAC5B;AACF;;;;;AAMA,SAAgB,YAA2B,MAAkC,SAAyB,CAAC,GAA+B;CACpI,OAAO,YAAY,GAAG,MAAM,MAAM;AACpC;;;;;;;;ACvfA,SAAgB,YACd,SACkD;CAClD,MAAM,EAAE,UAAU,SAAS,SAAS,eAAe;CAEnD,QAAQ,SAA+C;EAErD,MAAM,kBAAkB,SAAY,WAA6B,YAAkB;GAEjF,IAAI,YAAY;IACd,MAAM,UAA8B;KAClC,YAAY;KACZ,aAAa,KAAK;KAClB;KACA,WAAW,KAAK,IAAI;IACtB;IACA,WAAW,OAAO;GACpB;GAGA,QAAQ,QAAR;IACE,KAAK,SACH,MAAM,IAAI,MAAM,2BAA2B,SAAS,EAAE;IAExD,KAAK;KAEH,IAAI,CAAC,KAAK,SAAS;MACjB,IAAI,aAAa,QAAQ,KAAK,IAAI;WAC7B,KAAK,MAAM;KAClB;KACA;IAEF,KAAK,eAEH;IAEF,KAAK,UAEH;IAEF,KAAK,QAEH;IAEF,KAAK,SACH,MAAM,IAAI,MAAM,iDAAiD;IAEnE,SACE,MAAM,IAAI,MAAM,4BAA4B,QAAQ;GACxD;EACF;EAGA,MAAM,WAAW,UAA2B,WAAW,gBAAgB,KAAK,IAAI,GAAG,QAAQ,CAAC,IAAI;EAEhG,OAAO,IAAI,MAAM,MAAM,EACrB,IAAI,QAAQ,MAAM,UAAU;GAE1B,IAAI,SAAS,YACX,OAAO;GAIT,IAAI,SAAS,UACX,OAAO,OAAO,QAAQ;GAIxB,IAAI,SAAS,qBACX,OAAO,KAAK,IAAI,GAAG,WAAW,OAAO,IAAI;GAG3C,MAAM,QAAQ,QAAQ,IAAI,QAAQ,MAAM,QAAQ;GAGhD,IAAI,OAAO,UAAU,YACnB,QAAQ,MAAR;IACE,KAAK,OACH,OAAO,SAAU,SAAqB;KACpC,IAAI,OAAO,QAAQ,YAAY,WAAW,QAAQ;MAChD,eAAe,OAAO;MACtB,IAAI,WAAW,YAAY,WAAW,eACpC,OAAO;KAEX;KACA,OAAQ,MAAmB,KAAK,QAAQ,OAAO;IACjD;IAEF,KAAK,QACH,OAAO,SAAU,SAAkB;KACjC,IAAI,OAAO,QAAQ,YAAY,WAAW,QAAQ;MAChD,eAAe,OAAO;MACtB,IAAI,WAAW,YAAY,WAAW,eACpC;KAEJ;KACA,MAAoB,KAAK,QAAQ,OAAO;IAC1C;IAEF,KAAK,WACH,OAAO,SAAU,SAAkB;KACjC,IAAI,OAAO,QAAQ,YAAY,WAAW,QAAQ;MAEhD,eAAe,SAAS,MAAM;MAC9B,IAAI,WAAW,YAAY,WAAW,eACpC;KAEJ;KACA,MAAoB,KAAK,QAAQ,OAAO;IAC1C;IAEF,KAAK,UACH,OAAO,SAAU,OAAe,SAAkB;KAChD,IAAI,KAAK;KACT,IAAI,OAAO,QAAQ,YAAY,WAAW,QAAQ;MAChD,eAAe,OAAO;MACtB,IAAI,WAAW,YAAY,WAAW,eACpC;MAEF,KAAK,QAAQ,EAAE;KACjB;KACA,MAAoB,KAAK,QAAQ,IAAI,OAAO;IAC9C;IAEF,KAAK;IACL,KAAK,aACH,OAAO,SAAU,GAAG,MAAsB;KACxC,MAAM,WAAW,KAAK,KAAK,SAAS;KACpC,MAAM,gBAAgB,MAAM,KAAK,QAAQ;KAGzC,IAAI,OAAO,OAAO,cAAc,SAAS,YAAY,WAAW,QAAQ;MAGtE,IAAI,QAAQ;MACZ,IAAI,KAAK,KAAK;MACd,KAAK,MAAM,WAAW,eAAe;OACnC,IAAI,OAAO,QAAQ,UAAU;QAC3B,eAAe,OAAO;QACtB,IAAI,WAAW,YAAY,WAAW,eACpC;QAEF,KAAK,QAAQ,EAAE;OACjB;OACA,IAAI,SAAS,UACX,OAAO,IAAI,OAAO;YACb;QACL,OAAO,OAAO,IAAI,OAAO;QACzB;OACF;OACA,QAAQ;MACV;MACA,OAAO;KACT;KAEA,OAAQ,MAAmB,MAAM,QAAQ,IAAI;IAC/C;GACJ;GAGF,OAAO;EACT,EACF,CAAC;CACH;AACF;;;;AAKA,SAAgB,aACd,SACoD;CACpD,MAAM,EAAE,UAAU,SAAS,SAAS,eAAe;CAEnD,QAAQ,SAAiD;EACvD,MAAM,kBAAkB,YAAqB;GAC3C,IAAI,YAAY;IACd,MAAM,UAA8B;KAClC,YAAY;KACZ,aAAa,KAAK;KAClB;KACA,WAAW,KAAK,IAAI;IACtB;IACA,WAAW,OAAO;GACpB;GAEA,QAAQ,QAAR;IACE,KAAK,SACH,MAAM,IAAI,MAAM,4BAA4B,SAAS,EAAE;IACzD,KAAK;KACH,IAAI,CAAC,KAAK,SACR,KAAK,KAAK;KAEZ;IACF,KAAK;IACL,KAAK,UACH;IACF,KAAK,QACH;IACF,KAAK,SACH,MAAM,IAAI,MAAM,iDAAiD;IACnE,SACE,MAAM,IAAI,MAAM,4BAA4B,QAAQ;GACxD;EACF;EAEA,OAAO,IAAI,MAAM,MAAM,EACrB,IAAI,QAAQ,MAAM,UAAU;GAC1B,IAAI,SAAS,YAAY,OAAO;GAChC,IAAI,SAAS,UAAU,OAAO,OAAO,QAAQ;GAC7C,IAAI,SAAS,qBAAqB,OAAO,KAAK,IAAI,GAAG,WAAW,OAAO,IAAI;GAE3E,MAAM,QAAQ,QAAQ,IAAI,QAAQ,MAAM,QAAQ;GAEhD,IAAI,OAAO,UAAU,YACnB,QAAQ,MAAR;IACE,KAAK;IACL,KAAK;IACL,KAAK,OACH,OAAO,SAAU,SAAqB;KACpC,IAAI,OAAO,QAAQ,YAAY,WAAW,QAAQ;MAChD,eAAe,OAAO;MACtB,IAAI,WAAW,YAAY,WAAW,eACpC,OAAO;KAEX;KACA,OAAQ,MAAmB,KAAK,QAAQ,OAAO;IACjD;GACJ;GAGF,OAAO;EACT,EACF,CAAC;CACH;AACF;;;;AAKA,SAAgB,aACd,SACoD;CACpD,MAAM,EAAE,UAAU,SAAS,SAAS,eAAe;CAEnD,QAAQ,SAAiD;EACvD,MAAM,kBAAkB,YAAqB;GAC3C,IAAI,YAAY;IACd,MAAM,UAA8B;KAClC,YAAY;KACZ,aAAa,KAAK;KAClB;KACA,WAAW,KAAK,IAAI;IACtB;IACA,WAAW,OAAO;GACpB;GAEA,QAAQ,QAAR;IACE,KAAK,SACH,MAAM,IAAI,MAAM,4BAA4B,SAAS,EAAE;IACzD,KAAK;KACH,IAAI,CAAC,KAAK,SACR,KAAK,YAAY;KAEnB;IACF,KAAK;IACL,KAAK,UACH;IACF,KAAK,QACH;IACF,KAAK,SACH,MAAM,IAAI,MAAM,iDAAiD;IACnE,SACE,MAAM,IAAI,MAAM,4BAA4B,QAAQ;GACxD;EACF;EAEA,OAAO,IAAI,MAAM,MAAM,EACrB,IAAI,QAAQ,MAAM,UAAU;GAC1B,IAAI,SAAS,YAAY,OAAO;GAChC,IAAI,SAAS,UAAU,OAAO,OAAO,QAAQ;GAC7C,IAAI,SAAS,qBAAqB,OAAO,KAAK,IAAI,GAAG,WAAW,OAAO,IAAI;GAE3E,MAAM,QAAQ,QAAQ,IAAI,QAAQ,MAAM,QAAQ;GAEhD,IAAI,OAAO,UAAU,YACnB,QAAQ,MAAR;IACE,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK,OACH,OAAO,SAAU,SAAiB;KAChC,IAAI,OAAO,QAAQ,YAAY,WAAW,QAAQ;MAChD,eAAe,OAAO;MACtB,IAAI,WAAW,YAAY,WAAW,eACpC,OAAO,KAAK,WAAW,OAAO,KAAK,SAAS,QAAQ,QAAQ,KAAA;KAEhE;KACA,OAAQ,MAAmB,KAAK,QAAQ,OAAO;IACjD;GACJ;GAGF,OAAO;EACT,EACF,CAAC;CACH;AACF;;;;AAKA,SAAgB,WACd,SAG8D;CAC9D,MAAM,EAAE,UAAU,SAAS,SAAS,eAAe;CAEnD,QAAQ,SAA2D;EACjE,IAAI,iBAAsB,CAAC;EAE3B,MAAM,kBAAkB,KAAQ,UAAmB;GACjD,IAAI,YACF,WAAW;IACT;IACA;IACA,aAAa,KAAK;IAClB;IACA,WAAW,KAAK,IAAI;GACtB,CAAC;GAGH,QAAQ,QAAR;IACE,KAAK,SACH,MAAM,IAAI,MAAM,0BAA0B,SAAS,EAAE;IACvD,KAAK;KAEH,IAAI,eAAe,SAAS,GAAG;MAC7B,MAAM,YAAY,eAAe,MAAM;MACvC,KAAK,OAAO,SAAS;KACvB;KACA;IACF,KAAK;IACL,KAAK,UACH;IACF,KAAK,QACH;IACF,KAAK,SACH,MAAM,IAAI,MAAM,iDAAiD;IACnE,SACE,MAAM,IAAI,MAAM,4BAA4B,QAAQ;GACxD;EACF;EAEA,OAAO,IAAI,MAAM,MAAM,EACrB,IAAI,QAAQ,MAAM,UAAU;GAC1B,IAAI,SAAS,YAAY,OAAO;GAChC,IAAI,SAAS,UAAU,OAAO,OAAO,QAAQ;GAC7C,IAAI,SAAS,qBAAqB,OAAO,KAAK,IAAI,GAAG,WAAW,OAAO,IAAI;GAE3E,MAAM,QAAQ,QAAQ,IAAI,QAAQ,MAAM,QAAQ;GAEhD,IAAI,OAAO,UAAU,YACnB,QAAQ,MAAR;IACE,KAAK,OACH,OAAO,SAAU,KAAQ,KAAuB;KAC9C,MAAM,SAAS,OAAO,IAAI,GAAG;KAE7B,IAAI,CAAC,UAAU,OAAO,QAAQ,YAAY,WAAW,QAAQ;MAC3D,eAAe,KAAK,GAAG;MACvB,IAAI,WAAW,YAAY,WAAW,eACpC;KAEJ;KAEA,MAAM,SAAU,MAAmB,KAAK,QAAQ,KAAK,GAAG;KAGxD,IAAI,CAAC,QACH,eAAe,KAAK,GAAG;KAGzB,OAAO;IACT;IAEF,KAAK,UACH,OAAO,SAAU,KAAuB;KACtC,MAAM,SAAU,MAAmB,KAAK,QAAQ,GAAG;KAEnD,iBAAiB,eAAe,QAAQ,MAAM,CAAC,OAAO,MAAM,GAAG,GAAG,CAAC;KACnE,OAAO;IACT;IAEF,KAAK,SACH,OAAO,WAAkB;KACvB,MAAoB,KAAK,MAAM;KAC/B,iBAAiB,CAAC;IACpB;GACJ;GAGF,OAAO;EACT,EACF,CAAC;CACH;AACF;;;;;AAMA,SAAgB,QACd,SACsC;CACtC,OAAO,YAAY,OAAO;AAC5B;;;;;ACjcA,MAAM,mCAAmB,IAAI,IAAI;CAE/B;CACA;CACA;CACA;CACA;CACA;CAGA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CAGA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CAGA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;;AAGD,MAAM,+BAAe,IAAI,IAAI;CAC3B;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;;;;AAKD,SAAS,eACP,eAAuB,qCACR;CACf,QAAQ,SAAe;EAErB,MAAM,wBAAQ,IAAI,IAAwD;EAC1E,OAAO,IAAI,MAAM,MAAM;GACrB,IAAI,QAAQ,MAAM;IAGhB,MAAM,QAAQ,QAAQ,IAAI,QAAQ,MAAM,MAAM;IAG9C,IAAI,OAAO,SAAS,YAAY,iBAAiB,IAAI,IAAI,GACnD;SAAA,OAAO,UAAU,YACnB,aAAa;MACX,MAAM,IAAI,MAAM,YAAY;KAC9B;IAAA;IAOJ,IAAI,OAAO,UAAU,cAAc,OAAO,SAAS,YAAY,aAAa,IAAI,IAAI,GAClF,OAAO,SAAqB,GAAG,MAAa;KAC1C,MAAM,SAAS,MAAM,MAAM,QAAQ,IAAI;KAEvC,OAAO,eAA8B,YAAY,CAAC,CAAC,MAAM;IAC3D;IAGF,IAAI,OAAO,UAAU,YAAY;KAC/B,MAAM,QAAQ,MAAM,IAAI,IAAI;KAC5B,IAAI,UAAU,KAAA,KAAa,MAAM,UAAU,OAAO,OAAO,MAAM;KAC/D,MAAM,SAAU,MAAmB,KAAK,MAAM;KAC9C,MAAM,IAAI,MAAM;MAAE;MAAO;KAAO,CAAC;KACjC,OAAO;IACT;IAEA,OAAO;GACT;GAEA,IAAI,SAAS,OAAO,QAAQ,WAAW;IAErC,MAAM,IAAI,MAAM,YAAY;GAC9B;GAEA,eAAe,SAAS,OAAO;IAE7B,MAAM,IAAI,MAAM,YAAY;GAC9B;EACF,CAAC;CACH;AACF;;;;;;;;;;;;AAaA,SAAgB,aACd,UAA2B,CAAC,GACC;CAE7B,OAAO,eADc,QAAQ,gBAAgB,6BACN;AACzC;;;;AAKA,SAAgB,cACd,UAA2B,CAAC,GACE;CAE9B,OAAO,eADc,QAAQ,gBAAgB,8BACN;AACzC;;;;AAKA,SAAgB,YACd,UAA2B,CAAC,GACO;CAEnC,OAAO,eADc,QAAQ,gBAAgB,4BACN;AACzC;;;;;;AAOA,SAAgB,mBACd,UAA2B,CAAC,GACO;CAEnC,OAAO,eADc,QAAQ,gBAAgB,mCACN;AACzC;;;;;AAMA,SAAgB,SACd,UAA2B,CAAC,GACb;CAEf,OAAO,eADc,QAAQ,gBAAgB,mCACR;AACvC;;;;AAKA,MAAa,mBAAyC;;;;AAKtD,MAAa,kBAAuC;;;;AAKpD,MAAa,yBAAqD;;;;;;;AChGlE,SAAgB,WAGd;CACA,QAAQ,SAA6D;EA0DnE,OAAO,OAAO,OAAO,MAAM,EAAE,MAAA;GAxD3B,IAAI,OAA0B;IAC5B,OAAO,eACC,KAAK,IAAI,KAAK,SACd,qBACR,CAAC,CAAC,MAAiB;KACjB,KAAK,UAAU,KAAK,KAAK;KACzB,WAAW;IACb,CAAC;GACH;GAEA,IAAI,OAAe,SAA+B;IAChD,OAAO,eACC,KAAK,IAAI,OAAO,OAAO,IAC5B,UAAU,OAAO,KAAK,CACzB;GACF;GAEA,SAAS,OAAkC;IACzC,OAAO,eACC,KAAK,SAAS,KAAK,IACxB,UAAU,OAAO,KAAK,CACzB;GACF;GAEA,QAAmB;IACjB,OAAO,KAAK,UAAU,OAAO,KAAK,KAAK,MAAM,CAAC;GAChD;GAEA,OAAkB;IAChB,OAAO,KAAK,UAAU,OAAO,KAAK,KAAK,KAAK,CAAC;GAC/C;GAEA,MAAiB;IACf,IAAI,KAAK,SAAS,OAAO;IACzB,OAAO,eACC,KAAK,IAAI,SACT,eACR,CAAC,CAAC,MAAiB;KACjB,KAAK,UAAU,KAAK,KAAK;KACzB,WAAW;IACb,CAAC;GACH;GAEA,QAAmB;IACjB,IAAI,KAAK,SAAS,OAAO;IACzB,OAAO,eACC,KAAK,MAAM,SACX,eACR,CAAC,CAAC,MAAiB;KACjB,KAAK,UAAU,KAAK,KAAK;KACzB,WAAW;IACb,CAAC;GACH;EAI8B,EAAE,CAAC;CACrC;AACF;;;;AAKA,SAAgB,YAGd;CACA,QAAQ,SAAgE;EAoCtE,OAAO,OAAO,OAAO,MAAM,EAAE,MAAA;GAlC3B,OAAkB;IAChB,IAAI,KAAK,SAAS,OAAO;IACzB,OAAO,eACC,KAAK,KAAK,SACV,gBACR,CAAC,CAAC,MAAiB;KACjB,KAAK,UAAU,KAAK,KAAK;KACzB,WAAW;IACb,CAAC;GACH;GAEA,OAAkB;IAChB,IAAI,KAAK,SAAS,OAAO;IACzB,OAAO,eACC,KAAK,KAAK,SACV,gBACR,CAAC,CAAC,MAAiB;KACjB,KAAK,UAAU,KAAK,KAAK;KACzB,WAAW;IACb,CAAC;GACH;GAEA,UAAqB;IACnB,IAAI,KAAK,SAAS,OAAO;IACzB,OAAO,eACC,KAAK,QAAQ,SACb,gBACR,CAAC,CAAC,MAAiB;KACjB,KAAK,UAAU,KAAK,KAAK;KACzB,WAAW;IACb,CAAC;GACH;EAG8B,EAAE,CAAC;CACrC;AACF;;;;AAKA,SAAgB,YAGd;CACA,QAAQ,SAAgE;EAsDtE,OAAO,OAAO,OAAO,MAAM,EAAE,MAAA;GApD3B,OAAkB;IAChB,OAAO,KAAK,UAAU,OAAO,KAAK,KAAK,UAAU,CAAC;GACpD;GAEA,OAAkB;IAGhB,IAAI,KAAK,SAAS,OAAO;IACzB,OAAO,KAAK,KAAK,UAAU,CAAM;GACnC;GAEA,UAAqB;IACnB,IAAI,KAAK,SAAS,OAAO;IACzB,OAAO,eACC,KAAK,QAAQ,SACb,gBACR,CAAC,CAAC,MAAiB;KACjB,KAAK,UAAU,KAAK,KAAK;KACzB,WAAW;IACb,CAAC;GACH;GAEA,YAAuB;IACrB,OAAO,KAAK,UAAU,OAAO,KAAK,KAAK,UAAU,CAAC;GACpD;GAEA,WAAsB;IACpB,OAAO,KAAK,UAAU,OAAO,KAAK,KAAK,SAAS,CAAC;GACnD;GAEA,YAAuB;IACrB,MAAM,SAAS,KAAK,UAAU;IAC9B,OAAO,WAAW,KAAA,IAAY,KAAK,MAAM,IAAI;GAC/C;GAEA,WAAsB;IACpB,MAAM,SAAS,KAAK,SAAS;IAC7B,OAAO,WAAW,KAAA,IAAY,KAAK,MAAM,IAAI;GAC/C;GAEA,MAAiB;IACf,IAAI,KAAK,SAAS,OAAO;IACzB,OAAO,eACC,KAAK,IAAI,SACT,gBACR,CAAC,CAAC,MAAiB;KACjB,KAAK,UAAU,KAAK,KAAK;KACzB,WAAW;IACb,CAAC;GACH;EAG8B,EAAE,CAAC;CACrC;AACF;;;;AAKA,SAAgB,UAGd;CACA,QACE,SACsD;EAqBtD,OAAO,OAAO,OAAO,MAAM,EAAE,MAAA;GAnB3B,IAAI,KAAmB;IACrB,OAAO,KAAK,IAAI,GAAG,IAAI,KAAK,KAAK,IAAI,GAAG,CAAC,IAAI;GAC/C;GAEA,IAAI,KAAQ,OAAyC;IACnD,OAAO,eACC,KAAK,IAAI,KAAK,KAAK,IACxB,UAAU,OAAO,KAAK,CACzB;GACF;GAEA,OAAO,KAAuC;IAC5C,OAAO,eACC,KAAK,OAAO,GAAG,IACpB,UAAU,OAAO,KAAK,CACzB;GACF;EAG8B,EAAE,CAAC;CACrC;AACF;;;;AAKA,SAAgB,OAAwC;CAEtD,QAAQ,SAAe;AACzB;;;;;;;ACzPA,SAAgB,cAQd;CACA,QAAQ,SAAkB;EACxB,MAAM,UAAU,IAAI,QAAuB;EAE3C,OAAO,IAAI,MAAM,MAAM,EACrB,IAAI,QAAQ,MAAM,UAAU;GAE1B,IAAI,SAAS,MACX,OAAO,QAAQ,GAAG,KAAK,OAAO;GAGhC,MAAM,QAAQ,QAAQ,IAAI,QAAQ,MAAM,QAAQ;GAEhD,IAAI,OAAO,UAAU,YACnB,QAAQ,MAAR;IACE,KAAK;IACL,KAAK,QACH,OAAO,SAAU,SAAiB;KAChC,MAAM,SAAU,MAAmB,KAAK,QAAQ,OAAO;KACvD,QAAQ,KAAK,OAAO,EAAE,OAAO,QAAQ,CAAC;KACtC,OAAO;IACT;IAEF,KAAK,WACH,OAAO,SAAU,SAAkB;KACjC,MAAoB,KAAK,QAAQ,OAAO;KACxC,QAAQ,KAAK,OAAO;MAAE,OAAO;MAAS,OAAO;KAAE,CAAC;IAClD;IAEF,KAAK,UACH,OAAO,SAAU,OAAe,SAAkB;KAChD,MAAoB,KAAK,QAAQ,OAAO,OAAO;KAC/C,QAAQ,KAAK,OAAO;MAAE,OAAO;MAAS;KAAM,CAAC;IAC/C;IAEF,KAAK,OACH,OAAO,SAAU,OAAe,SAAe;KAC7C,MAAM,WAAY,MAAmB,KAAK,QAAQ,OAAO,OAAO;KAChE,QAAQ,KAAK,OAAO;MAAE;MAAU,UAAU;MAAS;KAAM,CAAC;KAC1D,OAAO;IACT;IAEF,KAAK,UACH,OAAO,SAAU,SAAqB;KACpC,MAAM,SAAU,MAAmB,KAAK,QAAQ,OAAO;KACvD,IAAI,QACF,QAAQ,KAAK,UAAU,EAAE,OAAO,QAAQ,CAAC;KAE3C,OAAO;IACT;IAEF,KAAK,YACH,OAAO,SAAU,OAAkB;KACjC,MAAM,UAAW,MAAmB,KAAK,QAAQ,KAAK;KACtD,QAAQ,KAAK,UAAU;MAAE,OAAO;MAAS;KAAM,CAAC;KAChD,OAAO;IACT;IAEF,KAAK,OACH,OAAO,WAAe;KACpB,MAAM,UAAW,MAAmB,KAAK,MAAM;KAC/C,QAAQ,KAAK,UAAU,EAAE,OAAO,QAAQ,CAAC;KACzC,OAAO;IACT;IAEF,KAAK,SACH,OAAO,WAAe;KACpB,MAAM,UAAW,MAAmB,KAAK,MAAM;KAC/C,QAAQ,KAAK,UAAU;MAAE,OAAO;MAAS,OAAO;KAAE,CAAC;KACnD,OAAO;IACT;IAEF,KAAK,SACH,OAAO,WAAkB;KACvB,MAAoB,KAAK,MAAM;KAC/B,QAAQ,KAAK,SAAS,CAAC,CAAC;IAC1B;IAEF,KAAK,QACH,OAAO,SAAU,GAAG,MAAmB;KACrC,MAAoB,MAAM,QAAQ,IAAI;KACtC,QAAQ,KAAK,QAAQ,CAAC,CAAC;IACzB;IAEF,KAAK,WACH,OAAO,WAAkB;KACvB,MAAoB,KAAK,MAAM;KAC/B,QAAQ,KAAK,WAAW,CAAC,CAAC;IAC5B;GACJ;GAGF,OAAO;EACT,EACF,CAAC;CACH;AACF;;;;AAKA,SAAgB,eAQd;CACA,QAAQ,SAAmB;EACzB,MAAM,UAAU,IAAI,QAAwB;EAE5C,OAAO,IAAI,MAAM,MAAM,EACrB,IAAI,QAAQ,MAAM,UAAU;GAC1B,IAAI,SAAS,MACX,OAAO,QAAQ,GAAG,KAAK,OAAO;GAGhC,MAAM,QAAQ,QAAQ,IAAI,QAAQ,MAAM,QAAQ;GAEhD,IAAI,OAAO,UAAU,YACnB,QAAQ,MAAR;IACE,KAAK;IACL,KAAK;IACL,KAAK,OACH,OAAO,SAAU,SAAiB;KAChC,MAAM,SAAU,MAAmB,KAAK,QAAQ,OAAO;KACvD,IAAI,WAAW,OACb,QAAQ,KAAK,WAAW,EAAE,OAAO,QAAQ,CAAC;KAE5C,OAAO;IACT;IAEF,KAAK;IACL,KAAK,WACH,OAAO,WAAe;KACpB,MAAM,UAAW,MAAmB,KAAK,MAAM;KAC/C,QAAQ,KAAK,WAAW,EAAE,OAAO,QAAQ,CAAC;KAC1C,OAAO;IACT;IAEF,KAAK,SACH,OAAO,WAAkB;KACvB,MAAoB,KAAK,MAAM;KAC/B,QAAQ,KAAK,SAAS,CAAC,CAAC;IAC1B;GACJ;GAGF,OAAO;EACT,EACF,CAAC;CACH;AACF;;;;AAKA,SAAgB,eAQd;CACA,QAAQ,SAAmB;EACzB,MAAM,UAAU,IAAI,QAAwB;EAE5C,OAAO,IAAI,MAAM,MAAM,EACrB,IAAI,QAAQ,MAAM,UAAU;GAC1B,IAAI,SAAS,MACX,OAAO,QAAQ,GAAG,KAAK,OAAO;GAGhC,MAAM,QAAQ,QAAQ,IAAI,QAAQ,MAAM,QAAQ;GAEhD,IAAI,OAAO,UAAU,YACnB,QAAQ,MAAR;IACE,KAAK;IACL,KAAK;IACL,KAAK,QACH,OAAO,SAAU,SAAiB;KAChC,MAAM,SAAU,MAAmB,KAAK,QAAQ,OAAO;KACvD,QAAQ,KAAK,YAAY,EAAE,OAAO,QAAQ,CAAC;KAC3C,OAAO;IACT;IAEF,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK,OACH,OAAO,SAAU,SAAiB;KAChC,MAAM,SAAU,MAAmB,KAAK,QAAQ,OAAO;KACvD,QAAQ,KAAK,WAAW,EAAE,OAAO,QAAQ,CAAC;KAC1C,OAAO;IACT;IAEF,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK,WACH,OAAO,WAAe;KACpB,MAAM,UAAW,MAAmB,KAAK,MAAM;KAC/C,IAAI,YAAY,KAAA,GACd,QAAQ,KAAK,eAAe,EAAE,OAAO,QAAQ,CAAC;KAEhD,OAAO;IACT;IAEF,KAAK;IACL,KAAK;IACL,KAAK,OACH,OAAO,WAAe;KACpB,MAAM,UAAW,MAAmB,KAAK,MAAM;KAC/C,IAAI,YAAY,KAAA,GACd,QAAQ,KAAK,cAAc,EAAE,OAAO,QAAQ,CAAC;KAE/C,OAAO;IACT;IAEF,KAAK,SACH,OAAO,WAAkB;KACvB,MAAoB,KAAK,MAAM;KAC/B,QAAQ,KAAK,SAAS,CAAC,CAAC;IAC1B;GACJ;GAGF,OAAO;EACT,EACF,CAAC;CACH;AACF;;;;AAKA,SAAgB,aAQd;CACA,QAAQ,SAAwB;EAC9B,MAAM,UAAU,IAAI,QAAyB;EAE7C,OAAO,IAAI,MAAM,MAAM,EACrB,IAAI,QAAQ,MAAM,UAAU;GAC1B,IAAI,SAAS,MACX,OAAO,QAAQ,GAAG,KAAK,OAAO;GAGhC,MAAM,QAAQ,QAAQ,IAAI,QAAQ,MAAM,QAAQ;GAEhD,IAAI,OAAO,UAAU,YACnB,QAAQ,MAAR;IACE,KAAK,OACH,OAAO,SAAU,KAAQ,KAAuB;KAC9C,MAAM,WAAY,MAAmB,KAAK,QAAQ,KAAK,GAAG;KAC1D,QAAQ,KAAK,OAAO;MAAE;MAAK,OAAO;MAAK;KAAS,CAAC;KACjD,OAAO;IACT;IAEF,KAAK,UACH,OAAO,SAAU,KAAuB;KACtC,MAAM,eAAgB,MAAmB,KAAK,QAAQ,GAAG;KACzD,IAAI,iBAAiB,KAAA,GACnB,QAAQ,KAAK,UAAU;MAAE;MAAK,OAAO;KAAa,CAAC;KAErD,OAAO;IACT;IAEF,KAAK,SACH,OAAO,WAAkB;KACvB,MAAoB,KAAK,MAAM;KAC/B,QAAQ,KAAK,SAAS,CAAC,CAAC;IAC1B;GACJ;GAGF,OAAO;EACT,EACF,CAAC;CACH;AACF;;;;AAKA,SAAgB,UAQd;CACA,QAAQ,SAAwB;EAC9B,MAAM,UAAU,IAAI,QAA6B;EAEjD,OAAO,IAAI,MAAM,MAAM,EACrB,IAAI,QAAQ,MAAM,UAAU;GAC1B,IAAI,SAAS,MACX,OAAO,QAAQ,GAAG,KAAK,OAAO;GAGhC,MAAM,QAAQ,QAAQ,IAAI,QAAQ,MAAM,QAAQ;GAEhD,IAAI,OAAO,UAAU,YACnB,QAAQ,MAAR;IACE,KAAK,OACH,OAAO,SAAU,SAAqB;KACpC,MAAM,SAAU,MAAmB,KAAK,QAAQ,OAAO;KACvD,IAAI,QACF,QAAQ,KAAK,OAAO,EAAE,OAAO,QAAQ,CAAC;KAExC,OAAO;IACT;IAEF,KAAK,UACH,OAAO,SAAU,SAAqB;KACpC,MAAM,SAAU,MAAmB,KAAK,QAAQ,OAAO;KACvD,IAAI,QACF,QAAQ,KAAK,UAAU,EAAE,OAAO,QAAQ,CAAC;KAE3C,OAAO;IACT;IAEF,KAAK,SACH,OAAO,WAAkB;KACvB,MAAoB,KAAK,MAAM;KAC/B,QAAQ,KAAK,SAAS,CAAC,CAAC;IAC1B;GACJ;GAGF,OAAO;EACT,EACF,CAAC;CACH;AACF;;;;;;;;;AC/aA,SAAS,gBAAgB,OAAyB;CAChD,OAAO,OAAO,UAAU,cAAe,MAA4C,OAAO,iBAAiB;AAC7G;AAEA,IAAM,QAAN,MAAY;CACV,QAA+B,QAAQ,QAAQ;;;;;CAM/C,MAAM,KAAQ,IAAsC;EAClD,MAAM,MAAM,KAAK,MAAM,WAAW,GAAG,CAAC;EACtC,KAAK,QAAQ,IAAI,WACT,KAAA,SACA,KAAA,CACR;EACA,OAAO;CACT;AAOF;;;;;;;;;;;;;;;;;;;AAoBA,SAAgB,eAAgD;CAC9D,QAAQ,SAAe;EACrB,MAAM,QAAQ,IAAI,MAAM;EAExB,OAAO,IAAI,MAAM,MAAM,EACrB,IAAI,QAAQ,MAAM,UAAU;GAC1B,MAAM,QAAQ,QAAQ,IAAI,QAAQ,MAAM,QAAQ;GAGhD,IAAI,OAAO,UAAU,YACnB,OAAO;GAOT,IAAI,gBAAgB,KAAK,GACvB,OAAO,SAAyB,GAAG,MAAiB;IAClD,OAAO,MAAM,WAAY,MAAmB,MAAM,QAAQ,IAAI,CAAC;GACjE;GAEF,OAAO,SAAyB,GAAG,MAAiB;IAClD,MAAM,SAAU,MAAmB,MAAM,QAAQ,IAAI;IACrD,IAAI,kBAAkB,SACpB,OAAO,MAAM,WAAW,MAAM;IAEhC,OAAO;GACT;EACF,EACF,CAAC;CACH;AACF;;;;AAKA,MAAa,mBAAyC;;;;AAKtD,MAAa,kBAAwC;;;;AAKrD,MAAa,yBAA+C;;;;AAK5D,MAAa,kBAAwC;;;;;;;;;;AAWrD,SAAgB,wBAAyD;CACvE,QAAQ,SAAe;EACrB,MAAM,QAAQ,IAAI,MAAM;EACxB,IAAI,aAA4B;EAChC,IAAI,YAAY;EAEhB,OAAO,IAAI,MAAM,MAAM,EACrB,IAAI,QAAQ,MAAM,UAAU;GAC1B,MAAM,QAAQ,QAAQ,IAAI,QAAQ,MAAM,QAAQ;GAEhD,IAAI,OAAO,UAAU,YACnB,OAAO;GAGT,OAAO,eAA2B,GAAG,MAAa;IAEhD,MAAM,WAAW,OAAO,QAAQ;IAGhC,IAAI,eAAe,UAAU;KAC3B;KACA,IAAI;MACF,MAAM,SAAU,MAAmB,MAAM,QAAQ,IAAI;MACrD,OAAO,kBAAkB,UAAU,MAAM,SAAS;KACpD,UAAU;MACR;KACF;IACF;IAGA,OAAO,MAAM,KAAK,YAAY;KAC5B,aAAa;KACb,YAAY;KACZ,IAAI;MACF,MAAM,SAAU,MAAmB,MAAM,QAAQ,IAAI;MACrD,OAAO,kBAAkB,UAAU,MAAM,SAAS;KACpD,UAAU;MACR;MACA,IAAI,cAAc,GAChB,aAAa;KAEjB;IACF,CAAC;GACH;EACF,EACF,CAAC;CACH;AACF;;;;;;;;;;;;;;;;;;;AAoBA,SAAgB,gBAAiD;CAC/D,QAAQ,SAAe;EACrB,IAAI,UAAU;EACd,IAAI,SAAS;EACb,IAAI,iBAAiC,CAAC;EACtC,IAAI,iBAAiC,CAAC;EAMtC,MAAM,cAAc,YAA2B;GAC7C,IAAI,UAAU,eAAe,SAAS,GAAG;IACvC,MAAM,IAAI,SAAe,YAAY,eAAe,KAAK,OAAO,CAAC;IACjE;GACF;GACA;EACF;EAEA,MAAM,oBAA0B;GAC9B;GACA,IAAI,YAAY,KAAK,eAAe,SAAS,GAAG;IAC9C,SAAS;IAET,eAD4B,MACzB,CAAC,CAAC;GACP;EACF;EAEA,MAAM,eAAe,YAA2B;GAC9C,IAAI,UAAU,UAAU,GAAG;IACzB,MAAM,IAAI,SAAe,YAAY,eAAe,KAAK,OAAO,CAAC;IACjE;GACF;GACA,SAAS;EACX;EAEA,MAAM,qBAA2B;GAC/B,SAAS;GACT,IAAI,eAAe,SAAS,GAAG;IAC7B,SAAS;IAET,eAD4B,MACzB,CAAC,CAAC;GACP,OAAO,IAAI,eAAe,SAAS,GAAG;IACpC,MAAM,aAAa,eAAe,OAAO,CAAC;IAC1C,WAAW,WAAW;IACtB,WAAW,SAAS,YAAY,QAAQ,CAAC;GAC3C;EACF;EAGA,MAAM,+BAAe,IAAI,IAAI;GAC3B;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;EACF,CAAC;EAED,OAAO,IAAI,MAAM,MAAM,EACrB,IAAI,QAAQ,MAAM,UAAU;GAC1B,MAAM,QAAQ,QAAQ,IAAI,QAAQ,MAAM,QAAQ;GAEhD,IAAI,OAAO,UAAU,YACnB,OAAO;GAGT,MAAM,eAAe,OAAO,SAAS,YAAY,aAAa,IAAI,IAAI;GAEtE,OAAO,eAA2B,GAAG,MAAa;IAChD,IAAI,cAAc;KAEhB,MAAM,YAAY;KAClB,IAAI;MACF,MAAM,SAAU,MAAmB,MAAM,QAAQ,IAAI;MACrD,OAAO,kBAAkB,UAAU,MAAM,SAAS;KACpD,UAAU;MACR,YAAY;KACd;IACF,OAAO;KAEL,MAAM,aAAa;KACnB,IAAI;MACF,MAAM,SAAU,MAAmB,MAAM,QAAQ,IAAI;MACrD,OAAO,kBAAkB,UAAU,MAAM,SAAS;KACpD,UAAU;MACR,aAAa;KACf;IACF;GACF;EACF,EACF,CAAC;CACH;AACF;;AC1SA,SAAgB,mBAAyB,KAAoB,MAAsC;CACjG,QAAQ,MAAR;EACE,KAAK,eACH,SAAS,KAAQ,UAAgB;GAC/B,IAAI,IAAI,IAAI,GAAG,GAAG,OAAO,IAAI,IAAI,GAAG;GACpC,IAAI,IAAI,KAAK,KAAK;GAClB,OAAO;EACT;EAEF,KAAK,WACH,SAAS,KAAQ,UAA6B,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,KAAK,KAAK,IAAI,KAAA;EAErF,KAAK,gBACH,SAAS,KAAQ,UAAa,aAAyB;GACrD,IAAI,CAAC,IAAI,IAAI,GAAG,KAAK,CAAC,OAAO,GAAG,IAAI,IAAI,GAAG,GAAG,QAAQ,GAAG,OAAO;GAChE,IAAI,IAAI,KAAK,QAAQ;GACrB,OAAO;EACT;EAEF,KAAK,eACH,SAAS,KAAQ,UAAsB;GACrC,IAAI,CAAC,IAAI,IAAI,GAAG,KAAK,CAAC,OAAO,GAAG,IAAI,IAAI,GAAG,GAAG,KAAK,GAAG,OAAO;GAC7D,IAAI,OAAO,GAAG;GACd,OAAO;EACT;EAEF,KAAK,mBACH,SAAS,KAAQ,oBAAsC;GACrD,IAAI,IAAI,IAAI,GAAG,GAAG,OAAO,IAAI,IAAI,GAAG;GACpC,MAAM,QAAQ,gBAAgB,GAAG;GACjC,IAAI,IAAI,KAAK,KAAK;GAClB,OAAO;EACT;EAEF,KAAK,oBACH,SAAS,KAAQ,cAAkE;GACjF,IAAI,CAAC,IAAI,IAAI,GAAG,GAAG,OAAO,KAAA;GAC1B,MAAM,QAAQ,UAAU,KAAK,IAAI,IAAI,GAAG,CAAC;GACzC,IAAI,UAAU,KAAA,GAAW;IACvB,IAAI,OAAO,GAAG;IACd;GACF;GACA,IAAI,IAAI,KAAK,KAAK;GAClB,OAAO;EACT;EAEF,KAAK,WACH,SAAS,KAAQ,cAA8E;GAC7F,MAAM,UAAU,IAAI,IAAI,GAAG;GAC3B,MAAM,QAAQ,UAAU,KAAK,UAAU,IAAI,IAAI,GAAG,IAAI,KAAA,CAAS;GAC/D,IAAI,UAAU,KAAA,GAAW;IACvB,IAAI,SAAS,IAAI,OAAO,GAAG;IAC3B;GACF;GACA,IAAI,IAAI,KAAK,KAAK;GAClB,OAAO;EACT;EAEF,KAAK,SACH,SAAS,KAAQ,OAAU,cAA0E;GACnG,IAAI,CAAC,IAAI,IAAI,GAAG,GAAG;IACjB,IAAI,IAAI,KAAK,KAAK;IAClB,OAAO;GACT;GACA,MAAM,SAAS,UAAU,IAAI,IAAI,GAAG,GAAG,KAAK;GAC5C,IAAI,WAAW,KAAA,GAAW;IACxB,IAAI,OAAO,GAAG;IACd;GACF;GACA,IAAI,IAAI,KAAK,MAAM;GACnB,OAAO;EACT;EAEF,KAAK,UACH,SAAS,UAAuC;GAC9C,KAAK,MAAM,SAAS,OAClB,IAAI,IAAI,MAAM,KAAK,MAAM,KAAK;EAElC;CACJ;AAEF;;;;;;;;;AC7CA,SAAgB,OACd,SACyE;CACzE,MAAM,EAAE,UAAU,YAAY;CAE9B,QAAQ,SAAsE;EAE5E,IAAI,OAA6B;EACjC,IAAI,OAA6B;EACjC,MAAM,0BAAU,IAAI,IAAsB;EAE1C,MAAM,cAAc,SAA8B;GAEhD,IAAI,KAAK,MACP,KAAK,KAAK,OAAO,KAAK;QAEtB,OAAO,KAAK;GAGd,IAAI,KAAK,MACP,KAAK,KAAK,OAAO,KAAK;QAEtB,OAAO,KAAK;GAId,KAAK,OAAO;GACZ,KAAK,OAAO;GACZ,IAAI,MACF,KAAK,OAAO;GAEd,OAAO;GAEP,IAAI,CAAC,MACH,OAAO;GAGT,KAAK,eAAe,KAAK,IAAI;EAC/B;EAEA,MAAM,WAAW,KAAQ,UAAmB;GAC1C,MAAM,OAAsB;IAC1B;IACA;IACA,cAAc,KAAK,IAAI;IACvB,MAAM;IACN,MAAM;GACR;GAEA,IAAI,MACF,KAAK,OAAO;GAEd,OAAO;GAEP,IAAI,CAAC,MACH,OAAO;GAGT,QAAQ,IAAI,KAAK,IAAI;EACvB;EAEA,MAAM,cAAc,SAA8B;GAChD,IAAI,KAAK,MACP,KAAK,KAAK,OAAO,KAAK;QAEtB,OAAO,KAAK;GAGd,IAAI,KAAK,MACP,KAAK,KAAK,OAAO,KAAK;QAEtB,OAAO,KAAK;GAGd,QAAQ,OAAO,KAAK,GAAG;EACzB;EAKA,MAAM,uBAA6B;GACjC,KAAK,MAAM,QAAQ,CAAC,GAAG,QAAQ,OAAO,CAAC,GACrC,IAAI,CAAC,KAAK,IAAI,KAAK,GAAG,GACpB,WAAW,IAAI;EAGrB;EAEA,MAAM,iBAAuB;GAC3B,OAAO,MAAM;IACX,MAAM,YAAY;IAClB,WAAW,SAAS;IACpB,IAAI,CAAC,KAAK,IAAI,UAAU,GAAG,GAEzB;IAEF,KAAK,OAAO,UAAU,GAAG;IAEzB,IAAI,SACF,QAAQ;KACN,KAAK,UAAU;KACf,OAAO,UAAU;KACjB,WAAW,UAAU;IACvB,CAAC;IAEH;GACF;EACF;EAEA,OAAO,IAAI,MAAM,MAAM,EACrB,IAAI,QAAQ,MAAM,UAAU;GAE1B,IAAI,SAAS,UACX,OAAO,OAAO,QAAQ;GAKxB,MAAM,YAAY,mBAAmB,UAA2B,IAAI;GACpE,IAAI,WACF,OAAO;GAGT,MAAM,QAAQ,QAAQ,IAAI,QAAQ,MAAM,QAAQ;GAEhD,IAAI,OAAO,UAAU,YACnB,QAAQ,MAAR;IACE,KAAK,OACH,OAAO,SAAU,KAAW;KAC1B,IAAI;KACJ,IAAI;MACF,SAAU,MAAmB,KAAK,QAAQ,GAAG;KAC/C,SAAS,OAAO;MAEd,MAAM,QAAQ,QAAQ,IAAI,GAAG;MAC7B,IAAI,OACF,WAAW,KAAK;MAElB,MAAM;KACR;KAEA,MAAM,OAAO,QAAQ,IAAI,GAAG;KAC5B,IAAI,MACF,WAAW,IAAI;KAEjB,OAAO;IACT;IAEF,KAAK,OACH,OAAO,SAAU,KAAiB;KAChC,MAAM,SAAU,MAAmB,KAAK,QAAQ,GAAG;KACnD,MAAM,OAAO,QAAQ,IAAI,GAAG;KAC5B,IAAI,MAAM;MACR,IAAI,QAEF,WAAW,IAAI;WAGf,WAAW,IAAI;KAEnB;KACA,OAAO;IACT;IAEF,KAAK,OACH,OAAO,SAAU,KAAQ,KAAuB;KAG9C,IAFe,OAAO,IAAI,GAEjB,GAAG;MAEV,MAAM,WAAY,MAAmB,KAAK,QAAQ,KAAK,GAAG;MAC1D,MAAM,OAAO,QAAQ,IAAI,GAAG;MAC5B,IAAI,MAAM;OACR,KAAK,QAAQ;OACb,WAAW,IAAI;MACjB;MACA,OAAO;KACT,OAAO;MAGL,MAAM,QAAQ,QAAQ,IAAI,GAAG;MAC7B,IAAI,OACF,WAAW,KAAK;MAGlB,IAAI,QAAQ,QAAQ,UAClB,eAAe;MAEjB,IAAI,OAAO,QAAQ,UACjB,SAAS;MAEX,MAAM,SAAU,MAAmB,KAAK,QAAQ,KAAK,GAAG;MACxD,QAAQ,KAAK,GAAG;MAChB,OAAO;KACT;IACF;IAEF,KAAK,UACH,OAAO,SAAU,KAAuB;KACtC,MAAM,SAAU,MAAmB,KAAK,QAAQ,GAAG;KACnD,MAAM,OAAO,QAAQ,IAAI,GAAG;KAC5B,IAAI,MACF,WAAW,IAAI;KAEjB,OAAO;IACT;IAEF,KAAK,SACH,OAAO,WAAkB;KACvB,MAAoB,KAAK,MAAM;KAC/B,OAAO;KACP,OAAO;KACP,QAAQ,MAAM;IAChB;GACJ;GAGF,OAAO;EACT,EACF,CAAC;CACH;AACF;;;;;;;;;;AAWA,IAAa,WAAb,MAA4B;CAC1B;CACA;CACA,sBAAyD,IAAI,IAAI;CACjE,OAAqC;CACrC,OAAqC;CAErC,YAAY,UAAkB,SAAoD;EAChF,KAAK,WAAW;EAChB,KAAK,UAAU;CACjB;CAEA,IAAI,OAAe;EACjB,OAAO,KAAK,IAAI;CAClB;CAEA,IAAI,SAAkB;EACpB,OAAO,KAAK,IAAI,QAAQ,KAAK;CAC/B;CAEA,IAAI,KAAuB;EACzB,MAAM,QAAQ,KAAK,IAAI,IAAI,GAAG;EAC9B,IAAI,CAAC,OAAO,OAAO,KAAA;EAEnB,KAAK,WAAW,MAAM,IAAI;EAC1B,OAAO,MAAM;CACf;CAEA,IAAI,KAAQ,OAAgB;EAC1B,MAAM,QAAQ,KAAK,IAAI,IAAI,GAAG;EAE9B,IAAI,OAAO;GAET,MAAM,QAAQ;GACd,MAAM,KAAK,QAAQ;GACnB,KAAK,WAAW,MAAM,IAAI;EAC5B,OAAO;GAEL,IAAI,KAAK,IAAI,QAAQ,KAAK,UACxB,KAAK,SAAS;GAGhB,MAAM,OAAsB;IAC1B;IACA;IACA,cAAc,KAAK,IAAI;IACvB,MAAM;IACN,MAAM,KAAK;GACb;GAEA,IAAI,KAAK,MACP,KAAK,KAAK,OAAO;GAEnB,KAAK,OAAO;GAEZ,IAAI,CAAC,KAAK,MACR,KAAK,OAAO;GAGd,KAAK,IAAI,IAAI,KAAK;IAAE;IAAO;GAAK,CAAC;EACnC;CACF;CAEA,IAAI,KAAiB;EACnB,OAAO,KAAK,IAAI,IAAI,GAAG;CACzB;CAEA,OAAO,KAAiB;EACtB,MAAM,QAAQ,KAAK,IAAI,IAAI,GAAG;EAC9B,IAAI,CAAC,OAAO,OAAO;EAEnB,KAAK,WAAW,MAAM,IAAI;EAC1B,KAAK,IAAI,OAAO,GAAG;EACnB,OAAO;CACT;CAEA,QAAc;EACZ,KAAK,IAAI,MAAM;EACf,KAAK,OAAO;EACZ,KAAK,OAAO;CACd;CAEA,WAAmB,MAA2B;EAC5C,IAAI,SAAS,KAAK,MAAM;EAGxB,IAAI,KAAK,MACP,KAAK,KAAK,OAAO,KAAK;EAExB,IAAI,KAAK,MACP,KAAK,KAAK,OAAO,KAAK;OAEtB,KAAK,OAAO,KAAK;EAInB,KAAK,OAAO;EACZ,KAAK,OAAO,KAAK;EACjB,IAAI,KAAK,MACP,KAAK,KAAK,OAAO;EAEnB,KAAK,OAAO;EAEZ,KAAK,eAAe,KAAK,IAAI;CAC/B;CAEA,WAAmB,MAA2B;EAC5C,IAAI,KAAK,MACP,KAAK,KAAK,OAAO,KAAK;OAEtB,KAAK,OAAO,KAAK;EAGnB,IAAI,KAAK,MACP,KAAK,KAAK,OAAO,KAAK;OAEtB,KAAK,OAAO,KAAK;CAErB;CAEA,WAAyB;EACvB,IAAI,CAAC,KAAK,MAAM;EAEhB,MAAM,UAAU,KAAK;EACrB,KAAK,WAAW,OAAO;EACvB,KAAK,IAAI,OAAO,QAAQ,GAAG;EAE3B,IAAI,KAAK,SACP,KAAK,QAAQ,QAAQ,KAAK,QAAQ,KAAK;CAE3C;;;;CAKA,CAAC,OAA4B;EAC3B,IAAI,OAAO,KAAK;EAChB,OAAO,MAAM;GACX,MAAM,KAAK;GACX,OAAO,KAAK;EACd;CACF;;;;CAKA,CAAC,UAAoC;EACnC,IAAI,OAAO,KAAK;EAChB,OAAO,MAAM;GACX,MAAM,CAAC,KAAK,KAAK,KAAK,KAAK;GAC3B,OAAO,KAAK;EACd;CACF;AACF;;;;AAKA,SAAgB,SACd,UACA,SACgB;CAChB,OAAO,IAAI,SAAS,UAAU,OAAO;AACvC;;;;;;ACxaA,SAAS,qBAAqB,OAAmB,UAAkD;CACjG,MAAM,QAAQ,YAAY,OAAO,QAAQ;CACzC,MAA6C,QAAQ;CACrD,OAAO;AACT;;;;;;;AAuCA,SAAgB,OACd,SAC6E;CAC7E,MAAM,EAAE,KAAK,gBAAgB,KAAM,aAAa;CAEhD,QACE,SACqD;EACrD,MAAM,2BAAW,IAAI,IAAoB;EACzC,IAAI,aAAoD;EAExD,MAAM,qBAA2B;GAC/B,MAAM,MAAM,KAAK,IAAI;GACrB,MAAM,UAAe,CAAC;GAEtB,KAAK,MAAM,CAAC,KAAK,UAAU,UACzB,IAAI,OAAO,MAAM,WACf,QAAQ,KAAK,GAAG;GAIpB,KAAK,MAAM,OAAO,SAAS;IACzB,MAAM,QAAQ,SAAS,IAAI,GAAG;IAC9B,IAAI,OAAO;KACT,KAAK,OAAO,GAAG;KACf,SAAS,OAAO,GAAG;KAEnB,IAAI,UACF,SAAS;MACP;MACA,OAAO,MAAM;MACb,WAAW,MAAM;MACjB,WAAW;KACb,CAAC;IAEL;GACF;EACF;EAGA,aAAa,qBAAqB,cAAc,aAAa;EAE7D,MAAM,gBAAsB;GAC1B,IAAI,YAAY;IACd,cAAc,UAAU;IACxB,aAAa;GACf;EACF;EAEA,OAAO,IAAI,MAAM,MAAM,EACrB,IAAI,QAAQ,MAAM,UAAU;GAE1B,IAAI,SAAS,WACX,OAAO;GAKT,MAAM,YAAY,mBAAmB,UAA2B,IAAI;GACpE,IAAI,WACF,OAAO;GAGT,MAAM,QAAQ,QAAQ,IAAI,QAAQ,MAAM,QAAQ;GAEhD,IAAI,OAAO,UAAU,YACnB,QAAQ,MAAR;IACE,KAAK,OACH,OAAO,SAAU,KAAW;KAE1B,MAAM,QAAQ,SAAS,IAAI,GAAG;KAC9B,IAAI,SAAS,KAAK,IAAI,KAAK,MAAM,WAAW;MAC1C,OAAO,OAAO,GAAG;MACjB,SAAS,OAAO,GAAG;MACnB,MAAM,IAAI,MAAM,gBAAgB,KAAK;KACvC;KACA,OAAQ,MAAmB,KAAK,QAAQ,GAAG;IAC7C;IAEF,KAAK,OACH,OAAO,SAAU,KAAiB;KAEhC,MAAM,QAAQ,SAAS,IAAI,GAAG;KAC9B,IAAI,SAAS,KAAK,IAAI,KAAK,MAAM,WAAW;MAC1C,OAAO,OAAO,GAAG;MACjB,SAAS,OAAO,GAAG;MACnB,OAAO;KACT;KACA,OAAQ,MAAmB,KAAK,QAAQ,GAAG;IAC7C;IAEF,KAAK,OACH,OAAO,SAAU,KAAQ,KAAuB;KAC9C,MAAM,MAAM,KAAK,IAAI;KACrB,MAAM,SAAU,MAAmB,KAAK,QAAQ,KAAK,GAAG;KAExD,SAAS,IAAI,KAAK;MAChB,OAAO;MACP,WAAW,MAAM;MACjB,WAAW;KACb,CAAC;KAED,OAAO;IACT;IAEF,KAAK,UACH,OAAO,SAAU,KAAuB;KACtC,MAAM,SAAU,MAAmB,KAAK,QAAQ,GAAG;KACnD,SAAS,OAAO,GAAG;KACnB,OAAO;IACT;IAEF,KAAK,SACH,OAAO,WAAkB;KACvB,MAAoB,KAAK,MAAM;KAC/B,SAAS,MAAM;IACjB;GACJ;GAGF,OAAO;EACT,EACF,CAAC;CACH;AACF;;;;;;;AAQA,SAAgB,cACd,SAG6E;CAC7E,MAAM,EAAE,KAAK,gBAAgB,KAAM,aAAa;CAEhD,QACE,SACqD;EACrD,MAAM,2BAAW,IAAI,IAAiD;EACtE,IAAI,aAAoD;EAExD,MAAM,qBAA2B;GAC/B,MAAM,MAAM,KAAK,IAAI;GACrB,MAAM,UAAe,CAAC;GAEtB,KAAK,MAAM,CAAC,SAAS,UAAU,UAC7B,IAAI,OAAO,MAAM,WACf,QAAQ,KAAK,OAAO;GAIxB,KAAK,MAAM,WAAW,SAAS;IAC7B,MAAM,QAAQ,SAAS,IAAI,OAAO;IAClC,IAAI,OAAO;KACT,KAAK,OAAO,OAAO;KACnB,SAAS,OAAO,OAAO;KAEvB,IAAI,UACF,SAAS;MACP;MACA,WAAW,MAAM;MACjB,WAAW;KACb,CAAC;IAEL;GACF;EACF;EAEA,aAAa,qBAAqB,cAAc,aAAa;EAE7D,MAAM,gBAAsB;GAC1B,IAAI,YAAY;IACd,cAAc,UAAU;IACxB,aAAa;GACf;EACF;EAEA,OAAO,IAAI,MAAM,MAAM,EACrB,IAAI,QAAQ,MAAM,UAAU;GAC1B,IAAI,SAAS,WACX,OAAO;GAGT,MAAM,QAAQ,QAAQ,IAAI,QAAQ,MAAM,QAAQ;GAEhD,IAAI,OAAO,UAAU,YACnB,QAAQ,MAAR;IACE,KAAK,OACH,OAAO,SAAU,SAAqB;KACpC,MAAM,SAAU,MAAmB,KAAK,QAAQ,OAAO;KACvD,IAAI,QAAQ;MACV,MAAM,MAAM,KAAK,IAAI;MACrB,SAAS,IAAI,SAAS;OACpB,WAAW,MAAM;OACjB,WAAW;MACb,CAAC;KACH;KACA,OAAO;IACT;IAEF,KAAK,UACH,OAAO,SAAU,SAAqB;KACpC,MAAM,SAAU,MAAmB,KAAK,QAAQ,OAAO;KACvD,IAAI,QACF,SAAS,OAAO,OAAO;KAEzB,OAAO;IACT;IAEF,KAAK,SACH,OAAO,WAAkB;KACvB,MAAoB,KAAK,MAAM;KAC/B,SAAS,MAAM;IACjB;GACJ;GAGF,OAAO;EACT,EACF,CAAC;CACH;AACF;;;;;;;;;;;AAYA,IAAa,WAAb,MAA4B;CAC1B;CACA;CACA;CACA,sBAAc,IAAI,IAAoB;CACtC,aAA4D;CAE5D,YAAY,KAAa,gBAAwB,KAAM,UAAqD;EAC1G,KAAK,MAAM;EACX,KAAK,gBAAgB;EACrB,KAAK,WAAW;EAChB,KAAK,qBAAqB;CAC5B;CAEA,IAAI,OAAe;EACjB,KAAK,QAAQ;EACb,OAAO,KAAK,IAAI;CAClB;CAEA,IAAI,KAAuB;EACzB,MAAM,QAAQ,KAAK,IAAI,IAAI,GAAG;EAC9B,IAAI,CAAC,OAAO,OAAO,KAAA;EAEnB,IAAI,KAAK,IAAI,KAAK,MAAM,WAAW;GACjC,KAAK,IAAI,OAAO,GAAG;GACnB,IAAI,KAAK,UACP,KAAK,SAAS,KAAK,MAAM,KAAK;GAEhC;EACF;EAEA,OAAO,MAAM;CACf;CAEA,IAAI,KAAQ,OAAU,WAA0B;EAC9C,MAAM,MAAM,KAAK,IAAI;EACrB,MAAM,WAAW,cAAc,KAAA,IAAY,YAAY,KAAK;EAE5D,KAAK,IAAI,IAAI,KAAK;GAChB;GACA,WAAW,MAAM;GACjB,WAAW;EACb,CAAC;CACH;CAEA,IAAI,KAAiB;EACnB,OAAO,KAAK,IAAI,GAAG,MAAM,KAAA;CAC3B;CAEA,OAAO,KAAiB;EACtB,OAAO,KAAK,IAAI,OAAO,GAAG;CAC5B;CAEA,QAAc;EACZ,KAAK,IAAI,MAAM;CACjB;;;;CAKA,UAAgB;EACd,MAAM,MAAM,KAAK,IAAI;EACrB,MAAM,UAAe,CAAC;EAEtB,KAAK,MAAM,CAAC,KAAK,UAAU,KAAK,KAC9B,IAAI,OAAO,MAAM,WACf,QAAQ,KAAK,GAAG;EAIpB,KAAK,MAAM,OAAO,SAAS;GACzB,MAAM,QAAQ,KAAK,IAAI,IAAI,GAAG;GAC9B,IAAI,OAAO;IACT,KAAK,IAAI,OAAO,GAAG;IACnB,IAAI,KAAK,UACP,KAAK,SAAS,KAAK,MAAM,KAAK;GAElC;EACF;CACF;;;;;CAMA,OAAO,KAA4B;EACjC,MAAM,QAAQ,KAAK,IAAI,IAAI,GAAG;EAC9B,IAAI,CAAC,OAAO,OAAO,KAAA;EAEnB,MAAM,YAAY,MAAM,YAAY,KAAK,IAAI;EAC7C,OAAO,YAAY,IAAI,YAAY,KAAA;CACrC;;;;CAKA,MAAM,KAAQ,WAA6B;EACzC,MAAM,QAAQ,KAAK,IAAI,IAAI,GAAG;EAC9B,IAAI,CAAC,OAAO,OAAO;EAEnB,IAAI,KAAK,IAAI,KAAK,MAAM,WAAW;GACjC,KAAK,IAAI,OAAO,GAAG;GACnB,OAAO;EACT;EAEA,MAAM,WAAW,cAAc,KAAA,IAAY,YAAY,KAAK;EAC5D,MAAM,YAAY,KAAK,IAAI,IAAI;EAC/B,OAAO;CACT;CAEA,uBAAqC;EACnC,KAAK,aAAa,2BAA2B,KAAK,QAAQ,GAAG,KAAK,aAAa;CACjF;;;;CAKA,UAAgB;EACd,IAAI,KAAK,YAAY;GACnB,cAAc,KAAK,UAAU;GAC7B,KAAK,aAAa;EACpB;CACF;CAEA,CAAC,OAA4B;EAC3B,KAAK,QAAQ;EACb,OAAO,KAAK,IAAI,KAAK;CACvB;CAEA,CAAC,SAA8B;EAC7B,KAAK,QAAQ;EACb,KAAK,MAAM,SAAS,KAAK,IAAI,OAAO,GAClC,MAAM,MAAM;CAEhB;CAEA,CAAC,UAAoC;EACnC,KAAK,QAAQ;EACb,KAAK,MAAM,CAAC,KAAK,UAAU,KAAK,KAC9B,MAAM,CAAC,KAAK,MAAM,KAAK;CAE3B;AACF;;;;AAKA,SAAgB,SACd,KACA,SAIgB;CAChB,OAAO,IAAI,SACT,KACA,SAAS,eACT,SAAS,QACX;AACF;;;;;;;;;;;;;;;;;;ACxYA,IAAa,aAAb,MAAqD;CACnD,SAAsB,CAAC;CACvB,UAA+B,CAAC;CAChC,SAAgC,CAAC;;CAEjC,UAAiC,CAAC;CAClC,YAAoB;CACpB;CACA;CAEA,YAAY,UAA6B,CAAC,GAAG;EAC3C,KAAK,WAAW,QAAQ,YAAY;EACpC,IAAI,QAAQ,YAAY,KAAA,GACtB,KAAK,iBAAiB,QAAQ;CAElC;CAMA,IAAI,OAAe;EACjB,OAAO,KAAK,OAAO;CACrB;CAEA,IAAI,UAAmB;EACrB,OAAO,KAAK,OAAO,WAAW;CAChC;CAEA,IAAI,SAAkB;EACpB,OAAO,KAAK,OAAO,UAAU,KAAK;CACpC;CAEA,IAAI,WAAoB;EACtB,OAAO,KAAK;CACd;CAEA,IAAI,oBAA4B;EAC9B,OAAO,KAAK,aAAa,WAAW,WAAW,KAAK,WAAW,KAAK,OAAO;CAC7E;;;;;;;;;CAcA,MAAM,IAAI,SAAY,SAAiC;EACrD,IAAI,KAAK,WACP,MAAM,IAAI,MAAM,iBAAiB;EAEnC,IAAI,KAAK,UAAU,OAAO,GACxB;EAIF,KAAK,YAAY,OAAO;EAIxB,OAAO,IAAI,SAAe,SAAS,WAAW;GAC5C,MAAM,SAAoB;IAAE;IAAS;IAAS;GAAO;GACrD,MAAM,YAAY,WAAW,KAAK;GAClC,IAAI,cAAc,KAAA,GAChB,OAAO,YAAY,iBAAiB;IAClC,MAAM,QAAQ,KAAK,QAAQ,QAAQ,MAAM;IACzC,IAAI,UAAU,IACZ,KAAK,QAAQ,OAAO,OAAO,CAAC;IAE9B,uBAAO,IAAI,MAAM,qBAAqB,UAAU,GAAG,CAAC;GACtD,GAAG,SAAS;GAEd,KAAK,QAAQ,KAAK,MAAM;EAC1B,CAAC;CACH;;;;;;;;CASA,MAAM,KAAK,SAA8B;EACvC,MAAM,OAAO,KAAK,QAAQ;EAC1B,IAAI,KAAK,OACP,OAAO,KAAK;EAId,IAAI,KAAK,WACP,MAAM,IAAI,MAAM,2BAA2B;EAI7C,OAAO,IAAI,SAAY,SAAS,WAAW;GACzC,MAAM,QAAqB;IAAE;IAAS;GAAO;GAC7C,MAAM,YAAY,WAAW,KAAK;GAClC,IAAI,cAAc,KAAA,GAChB,MAAM,YAAY,iBAAiB;IACjC,MAAM,QAAQ,KAAK,OAAO,QAAQ,KAAK;IACvC,IAAI,UAAU,IACZ,KAAK,OAAO,OAAO,OAAO,CAAC;IAE7B,uBAAO,IAAI,MAAM,sBAAsB,UAAU,GAAG,CAAC;GACvD,GAAG,SAAS;GAEd,KAAK,OAAO,KAAK,KAAK;EACxB,CAAC;CACH;;;;;;;;;;;CAYA,SAAS,WAAiC,UAAiD;EACzF,MAAM,OAAO,KAAK,QAAQ;EAC1B,IAAI,KAAK,OAAO;GACd,UAAU,KAAK,OAAO;GACtB,aAAa;EACf;EACA,IAAI,KAAK,WAAW;GAClB,yBAAS,IAAI,MAAM,2BAA2B,CAAC;GAC/C,aAAa;EACf;EACA,MAAM,QAAqB;GAAE,SAAS;GAAW,QAAQ;EAAS;EAClE,KAAK,OAAO,KAAK,KAAK;EACtB,aAAa;GACX,MAAM,QAAQ,KAAK,OAAO,QAAQ,KAAK;GACvC,IAAI,UAAU,IAAI,OAAO;GACzB,KAAK,OAAO,OAAO,OAAO,CAAC;GAC3B,OAAO;EACT;CACF;;;;;CAUA,OAAO,SAAqB;EAC1B,IAAI,KAAK,WACP,OAAO;EAET,OAAO,KAAK,UAAU,OAAO;CAC/B;;;;;CAMA,UAAyB;EACvB,MAAM,OAAO,KAAK,QAAQ;EAC1B,OAAO,KAAK,QAAQ,KAAK,UAAU,KAAA;CACrC;;CAGA,UAAkB,SAAqB;EAErC,MAAM,QAAQ,KAAK,OAAO,MAAM;EAChC,IAAI,OAAO;GACT,KAAK,YAAY,OAAO;GACxB,KAAK,aAAa,KAAK;GACvB,MAAM,QAAQ,OAAO;GACrB,OAAO;EACT;EACA,IAAI,KAAK,OAAO,SAAS,KAAK,UAAU;GACtC,KAAK,OAAO,KAAK,OAAO;GACxB,KAAK,YAAY,OAAO;GACxB,OAAO;EACT;EACA,OAAO;CACT;;CAGA,YAAoB,SAAkB;EACpC,MAAM,UAAU,KAAK;EACrB,KAAK,UAAU,CAAC;EAChB,KAAK,MAAM,UAAU,SAAS;GAC5B,KAAK,aAAa,MAAM;GACxB,OAAO,QAAQ,OAAO;EACxB;CACF;;;;;;;CAQA,UAAkE;EAChE,IAAI,KAAK,OAAO,SAAS,GAAG;GAC1B,MAAM,UAAU,KAAK,OAAO,MAAM;GAClC,KAAK,YAAY;GACjB,OAAO;IAAE,OAAO;IAAM;GAAQ;EAChC;EACA,MAAM,SAAS,KAAK,QAAQ,MAAM;EAClC,IAAI,QAAQ;GACV,KAAK,aAAa,MAAM;GACxB,OAAO,QAAQ;GACf,OAAO;IAAE,OAAO;IAAM,SAAS,OAAO;GAAQ;EAChD;EACA,OAAO,EAAE,OAAO,MAAM;CACxB;;;;;CAUA,MAAM,OAAmB;EACvB,IAAI,KAAK,OAAO,SAAS,GACvB,OAAO,KAAK,OAAO;EAErB,IAAI,KAAK,QAAQ,SAAS,GACxB,OAAO,KAAK,QAAQ,EAAE,CAAE;EAG1B,IAAI,KAAK,WACP,MAAM,IAAI,MAAM,2BAA2B;EAK7C,OAAO,IAAI,SAAY,SAAS,WAAW;GACzC,MAAM,SAAsB;IAAE;IAAS;GAAO;GAC9C,MAAM,YAAY,KAAK;GACvB,IAAI,cAAc,KAAA,GAChB,OAAO,YAAY,iBAAiB;IAClC,MAAM,QAAQ,KAAK,QAAQ,QAAQ,MAAM;IACzC,IAAI,UAAU,IACZ,KAAK,QAAQ,OAAO,OAAO,CAAC;IAE9B,uBAAO,IAAI,MAAM,sBAAsB,UAAU,GAAG,CAAC;GACvD,GAAG,SAAS;GAEd,KAAK,QAAQ,KAAK,MAAM;EAC1B,CAAC;CACH;;;;;CAMA,UAAyB;EACvB,OAAO,KAAK,OAAO,SAAS,IAAI,KAAK,OAAO,KAAK,KAAK,QAAQ,EAAE,EAAE;CACpE;;;;;CAUA,QAAc;EACZ,KAAK,YAAY;EAGjB,KAAK,MAAM,UAAU,KAAK,SAAS;GACjC,KAAK,aAAa,MAAM;GACxB,OAAO,uBAAO,IAAI,MAAM,cAAc,CAAC;EACzC;EACA,KAAK,UAAU,CAAC;EAGhB,IAAI,KAAK,OAAO,WAAW,GAAG;GAC5B,KAAK,MAAM,SAAS,KAAK,QAAQ;IAC/B,KAAK,aAAa,KAAK;IACvB,MAAM,uBAAO,IAAI,MAAM,wBAAwB,CAAC;GAClD;GACA,KAAK,SAAS,CAAC;GACf,KAAK,MAAM,UAAU,KAAK,SAAS;IACjC,KAAK,aAAa,MAAM;IACxB,OAAO,uBAAO,IAAI,MAAM,wBAAwB,CAAC;GACnD;GACA,KAAK,UAAU,CAAC;EAClB;CACF;;;;;CAMA,QAAa;EAGX,MAAM,WAAW,KAAK,OAAO,MAAM;EACnC,KAAK,SAAS,CAAC;EACf,KAAK,MAAM,UAAU,KAAK,QAAQ,OAAO,CAAC,GAAG;GAC3C,KAAK,aAAa,MAAM;GACxB,OAAO,QAAQ;GACf,SAAS,KAAK,OAAO,OAAO;EAC9B;EACA,OAAO;CACT;;;;;CAUA,QAAQ,OAAO,iBAAmC;EAChD,OAAO,MAAM;GACX,MAAM,OAAO,KAAK,QAAQ;GAC1B,IAAI,KAAK,OACP,MAAM,KAAK;QACN,IAAI,KAAK,WACd;QACK;IACL,IAAI;IACJ,IAAI;KACF,UAAU,MAAM,KAAK,KAAK;IAC5B,SAAS,OAAO;KAEd,IAAI,KAAK,WAAW;KACpB,MAAM;IACR;IACA,MAAM;GACR;EACF;CACF;;CAOA,cAA4B;EAC1B,IAAI,KAAK,QAAQ,SAAS,KAAK,KAAK,OAAO,SAAS,KAAK,UAAU;GACjE,MAAM,SAAS,KAAK,QAAQ,MAAM;GAClC,KAAK,aAAa,MAAM;GACxB,KAAK,OAAO,KAAK,OAAO,OAAO;GAC/B,OAAO,QAAQ;EACjB;CACF;CAEA,aAAqB,UAA+B;EAClD,IAAI,SAAS,WACX,aAAa,SAAS,SAAS;CAEnC;;;;CASA,WASE;EACA,OAAO;GACL,MAAM,KAAK;GACX,UAAU,KAAK;GACf,SAAS,KAAK;GACd,QAAQ,KAAK;GACb,UAAU,KAAK;GACf,gBAAgB,KAAK,QAAQ;GAC7B,eAAe,KAAK,OAAO;GAC3B,mBAAmB,KAAK;EAC1B;CACF;CAEA,WAAmB;EACjB,OAAO,mBAAmB,KAAK,KAAK,aAAa,KAAK,SAAS,WAAW,KAAK,UAAU;CAC3F;AACF;;;;;;;;;AAUA,SAAgB,WAAc,SAA4C;CACxE,OAAO,IAAI,WAAc,OAAO;AAClC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AClcA,IAAa,UAAb,MAAwB;CACtB;CACA,YAAoB;CAEpB,YAAY,aAAqB,GAAG;EAGlC,KAAK,QAAQ,WAAc,EAAE,UAAU,WAAW,CAAC;CACrD;;;;;;;CAQA,MAAM,KAAK,OAAyB;EAClC,IAAI,KAAK,WACP,MAAM,IAAI,MAAM,+BAA+B;EAEjD,MAAM,KAAK,MAAM,IAAI,KAAK;CAC5B;;;;;;;CAQA,MAAM,UAAsB;EAC1B,OAAO,MAAM,KAAK,MAAM,KAAK;CAC/B;;;;;;;;;;CAWA,YAAY,SAA6B,UAAiD;EACxF,OAAO,KAAK,MAAM,SAAS,SAAS,QAAQ;CAC9C;;;;;CAMA,QAAQ,OAAmB;EACzB,IAAI,KAAK,WAAW,OAAO;EAC3B,OAAO,KAAK,MAAM,OAAO,KAAK;CAChC;;;;;CAMA,aAA4B;EAC1B,OAAO,KAAK,MAAM,QAAQ;CAC5B;;;;;CAMA,QAAc;EACZ,KAAK,YAAY;EACjB,KAAK,MAAM,MAAM;CACnB;CAEA,IAAI,WAAoB;EACtB,OAAO,KAAK;CACd;CAEA,IAAI,OAAe;EACjB,OAAO,KAAK,MAAM;CACpB;;;;;CAMA,KAAQ,SAAyC;EAC/C,OAAO;GACL,SAAS;GACT;GACA,kBAAkB,KAAK,WAAW;GAClC,eAAe,KAAK,QAAQ;GAC5B,OAAO,SAAS,aAAa,KAAK,YAAY,SAAS,QAAQ;EACjE;CACF;;;;;CAMA,QAAQ,OAAO,iBAAmC;EAChD,OAAO,MACL,IAAI;GACF,MAAM,MAAM,KAAK,QAAQ;EAC3B,SAAS,GAAG;GAEV;EACF;CAEJ;AACF;;;;;;;AA0BA,SAAS,QAAQ,OAAoE;CACnF,OAAO,IAAI,SAAS,SAAS,WAAW;EACtC,MAAM,YAAkC,CAAC;EACzC,IAAI,UAAU;EACd,MAAM,YAAkB;GACtB,UAAU;GACV,KAAK,MAAM,YAAY,WAAW,SAAS;EAC7C;EAEA,IAAI;GACF,KAAK,IAAI,QAAQ,GAAG,QAAQ,MAAM,UAAU,CAAC,SAAS,SACpD,UAAU,KACR,MAAM,MAAM,EACT,UAAU;IACT,IAAI,SAAS;IACb,IAAI;IACJ,QAAQ;KAAE;KAAO;IAAM,CAAC;GAC1B,IACC,UAAU;IACT,IAAI,SAAS;IACb,IAAI;IACJ,OAAO,KAAK;GACd,CACF,CACF;EAEJ,SAAS,OAAO;GAEd,IAAI,CAAC,SAAS,IAAI;GAClB,OAAO,KAAK;EACd;CACF,CAAC;AACH;;;;;;;;;;;;;;;;;;AAmBA,eAAsB,OAAU,GAAG,OAAoC;CACrE,MAAM,EAAE,OAAO,UAAU,MAAM,QAC7B,MAAM,KAAK,MAAY,EAAE,UAAU,SAAS,aAAa,EAAE,QAAQ,YAAY,SAAS,QAAQ,EAAE,CACpG;CAEA,OAAO,MAAM,MAAM,CAAE,QAAQ,KAAK;AACpC;;;;;;;;;;AAWA,SAAgB,QAAQ,IAA2B;CACjD,MAAM,KAAK,IAAI,QAAc;CAC7B,iBAAiB;EACf,GAAG,KAAK,KAAA,CAAS,CAAC,CAAC,YAAY,CAAC,CAAC;EACjC,GAAG,MAAM;CACX,GAAG,EAAE;CACL,OAAO;AACT;;;;;;;;;;AAWA,SAAgB,OAAO,IAAoD;CACzE,MAAM,KAAK,IAAI,QAAgB,CAAC;CAChC,IAAI,QAAQ;CAEZ,MAAM,aAAa,kBAAkB;EACnC,GAAG,QAAQ,OAAO;CACpB,GAAG,EAAE;CAEL,OAAO,OAAO,OAAO,IAAI,EACvB,YAAY;EACV,cAAc,UAAU;EACxB,GAAG,MAAM;CACX,EACF,CAAC;AACH;;;;;;;;;;;AAYA,SAAgB,SACd,OACA,WACA,aAAqB,GACT;CACZ,MAAM,SAAS,IAAI,QAAW,UAAU;CAIxC,CAAC,YAAY;EACX,IAAI;GACF,WAAW,MAAM,SAAS,OAAO;IAC/B,MAAM,cAAc,MAAM,UAAU,KAAK;IACzC,MAAM,OAAO,KAAK,WAAW;GAC/B;EACF,UAAU;GACR,OAAO,MAAM;EACf;CACF,EAAA,CAAG,CAAC,CAAC,OAAO,UAAmB,QAAQ,MAAM,mBAAmB,KAAK,CAAC;CAEtE,OAAO;AACT;;;;;;;;;;AAWA,SAAgB,OAAU,OAAmB,OAAe,aAAqB,GAAiB;CAChG,MAAM,UAAU,MAAM,KAAK,EAAE,QAAQ,MAAM,SAAS,IAAI,QAAW,UAAU,CAAC;CAE9E,CAAC,YAAY;EACX,IAAI;GACF,WAAW,MAAM,SAAS,OACxB,MAAM,QAAQ,IAAI,QAAQ,KAAK,OAAO,GAAG,KAAK,KAAK,CAAC,CAAC;EAEzD,UAAU;GACR,QAAQ,SAAS,OAAO,GAAG,MAAM,CAAC;EACpC;CACF,EAAA,CAAG,CAAC,CAAC,OAAO,UAAmB,QAAQ,MAAM,iBAAiB,KAAK,CAAC;CAEpE,OAAO;AACT;;;;;;;;;;;AAYA,SAAgB,MAAS,GAAG,QAAkC;CAC5D,MAAM,SAAS,IAAI,QAAW;CAE9B,MAAM,UAAU,OAAO,IAAI,OAAO,UAAU;EAC1C,WAAW,MAAM,SAAS,OACxB,MAAM,OAAO,KAAK,KAAK;CAE3B,CAAC;CAGD,QAAQ,WAAW,OAAO,CAAC,CAAC,MAAM,YAAY;EAC5C,OAAO,MAAM;EACb,KAAK,MAAM,UAAU,SAAS,IAAI,OAAO,WAAW,YAAY,QAAQ,MAAM,gBAAgB,OAAO,MAAM;CAC7G,CAAC;CAED,OAAO;AACT;;;;;;;;AASA,SAAgB,MAAS,GAAG,QAAkC;CAC5D,MAAM,SAAS,IAAI,QAAW;CAE9B,CAAC,YAAY;EAEX,IAAI,QAAQ;EACZ,OAAO,MAAM;GACX,MAAM,QAAQ,OAAO,KAAK,GAAG,YAAY,QAAQ,UAAU,OAAO,MAAM;GACxE,IAAI;GACJ,IAAI;IACF,OAAO,MAAM,QAAQ,MAAM,KAAK,WAAiB,SAAS,aAAa,OAAO,MAAM,CAAE,YAAY,SAAS,QAAQ,CAAC,CAAC;GACvH,QAAQ;IAEN;GACF;GAEA,SADc,MAAM,KAAK,SACR,KAAK,OAAO;GAC7B,IAAI;IACF,MAAM,OAAO,KAAK,KAAK,KAAU;GACnC,QAAQ;IAEN;GACF;EACF;EACA,OAAO,MAAM;CACf,EAAA,CAAG;CAEH,OAAO;AACT;;;;AAKA,SAAgB,SAAY,UAA8B;CACxD,OAAO,IAAI,QAAW,QAAQ;AAChC;;;;;AAMA,SAAgB,aAA4B;CAC1C,OAAO,IAAI,QAAW,CAAC;AACzB;;;;;;;;AASA,SAAgB,QAAW,aAAqB,GAAe;CAC7D,OAAO,IAAI,QAAW,UAAU;AAClC;;;;;;;;;;;;;AAcA,SAAgB,WACd,MACA,QACA,UAAoD,EAAE,SAAS,EAAE,GACrD;CACZ,MAAM,UAAU,IAAI,QAAW,QAAQ,cAAc,CAAC;CACtD,MAAM,EAAE,SAAS,gBAAgB;CAEjC,MAAM,UAAU,MAAM,KAAK,EAAE,QAAQ,YAAY,GAAG,YAAY;EAC9D,WAAW,MAAM,OAAO,MACtB,IAAI;GACF,MAAM,SAAS,MAAM,OAAO,GAAG;GAC/B,MAAM,QAAQ,KAAK,MAAM;EAC3B,SAAS,OAAO;GACd,QAAQ,MAAM,iBAAiB,KAAK;EACtC;CAEJ,CAAC;CAED,QAAQ,IAAI,OAAO,CAAC,CAAC,WAAW,QAAQ,MAAM,CAAC;CAE/C,OAAO;AACT;;;;;;;;;AC5aA,gBAAuB,UAAa,UAA6E;CAC/G,MAAM,0BAAU,IAAI,IAAiC;CACrD,IAAI,OAAO;CACX,KAAK,MAAM,WAAW,UAAU;EAC9B,MAAM,QAAQ;EACd,QAAQ;EACR,QAAQ,IACN,OACA,QAAQ,QAAQ,OAAO,CAAC,CAAC,MACtB,WAAuB;GAAE;GAAO,QAAQ;GAAa;EAAM,KAC3D,YAAiC;GAAE;GAAO,QAAQ;GAAY;EAAO,EACxE,CACF;CACF;CACA,OAAO,QAAQ,OAAO,GAAG;EACvB,MAAM,UAAU,MAAM,QAAQ,KAAK,QAAQ,OAAO,CAAC;EACnD,QAAQ,OAAO,QAAQ,KAAK;EAC5B,MAAM;CACR;AACF;;;;;;;;;;;;;;;;;;;;;;;ACdA,UAAiB,IACf,UACA,IACc;CACd,IAAI,QAAQ;CACZ,KAAK,MAAM,SAAS,UAClB,MAAM,GAAG,OAAO,OAAO;AAE3B;;;;AAKA,UAAiB,OACf,UACA,WACc;CACd,IAAI,QAAQ;CACZ,KAAK,MAAM,SAAS,UAClB,IAAI,UAAU,OAAO,OAAO,GAC1B,MAAM;AAGZ;;;;AAKA,UAAiB,QACf,UACA,IACc;CACd,IAAI,QAAQ;CACZ,KAAK,MAAM,SAAS,UAClB,OAAO,GAAG,OAAO,OAAO;AAE5B;;;;AAKA,UAAiB,QAAW,UAA+C;CACzE,KAAK,MAAM,SAAS,UAClB,OAAO;AAEX;;;;AASA,UAAiB,KAAQ,UAAuB,GAAyB;CACvE,IAAI,QAAQ;CACZ,KAAK,MAAM,SAAS,UAAU;EAC5B,IAAI,WAAW,GAAG;EAClB,MAAM;CACR;AACF;;;;AAKA,UAAiB,KAAQ,UAAuB,GAAyB;CACvE,IAAI,QAAQ;CACZ,KAAK,MAAM,SAAS,UAClB,IAAI,WAAW,GACb,MAAM;AAGZ;;;;AAKA,UAAiB,UACf,UACA,WACc;CACd,KAAK,MAAM,SAAS,UAAU;EAC5B,IAAI,CAAC,UAAU,KAAK,GAAG;EACvB,MAAM;CACR;AACF;;;;AAKA,UAAiB,UACf,UACA,WACc;CACd,IAAI,WAAW;CACf,KAAK,MAAM,SAAS,UAAU;EAC5B,IAAI,YAAY,UAAU,KAAK,GAAG;EAClC,WAAW;EACX,MAAM;CACR;AACF;;;;AASA,UAAiB,OAAU,GAAG,WAAwC;CACpE,KAAK,MAAM,YAAY,WACrB,OAAO;AAEX;;;;AAKA,UAAiB,IACf,GAAG,WACW;CACd,MAAM,YAAY,UAAU,KAAK,OAAO,GAAG,OAAO,SAAS,CAAC,CAAC;CAE7D,OAAO,MAAM;EACX,MAAM,UAAU,UAAU,KAAK,OAAO,GAAG,KAAK,CAAC;EAC/C,IAAI,QAAQ,MAAM,MAAM,EAAE,IAAI,GAAG;EACjC,MAAM,QAAQ,KAAK,MAAM,EAAE,KAAK;CAClC;AACF;;;;AAKA,UAAiB,UAAa,UAA+C;CAC3E,IAAI,QAAQ;CACZ,KAAK,MAAM,SAAS,UAClB,MAAM,CAAC,SAAS,KAAK;AAEzB;;;;AASA,UAAiB,MAAS,UAAuB,MAA8B;CAC7E,IAAI,QAAa,CAAC;CAClB,KAAK,MAAM,SAAS,UAAU;EAC5B,MAAM,KAAK,KAAK;EAChB,IAAI,MAAM,WAAW,MAAM;GACzB,MAAM;GACN,QAAQ,CAAC;EACX;CACF;CACA,IAAI,MAAM,SAAS,GACjB,MAAM;AAEV;;;;AAKA,UAAiB,OAAU,UAAuB,MAA8B;CAC9E,MAAM,SAAc,CAAC;CACrB,KAAK,MAAM,SAAS,UAAU;EAC5B,OAAO,KAAK,KAAK;EACjB,IAAI,OAAO,SAAS,MAClB,OAAO,MAAM;EAEf,IAAI,OAAO,WAAW,MACpB,MAAM,CAAC,GAAG,MAAM;CAEpB;AACF;;;;AAKA,SAAgB,UACd,UACA,WACY;CACZ,MAAM,SAAc,CAAC;CACrB,MAAM,QAAa,CAAC;CAEpB,KAAK,MAAM,SAAS,UAClB,IAAI,UAAU,KAAK,GACjB,OAAO,KAAK,KAAK;MAEjB,MAAM,KAAK,KAAK;CAIpB,OAAO,CAAC,QAAQ,KAAK;AACvB;;;;AASA,SAAgB,OACd,UACA,IACA,SACG;CACH,IAAI,MAAM;CACV,IAAI,QAAQ;CACZ,KAAK,MAAM,SAAS,UAClB,MAAM,GAAG,KAAK,OAAO,OAAO;CAE9B,OAAO;AACT;;;;AAKA,UAAiB,KACf,UACA,IACA,SACc;CACd,IAAI,MAAM;CACV,MAAM;CACN,KAAK,MAAM,SAAS,UAAU;EAC5B,MAAM,GAAG,KAAK,KAAK;EACnB,MAAM;CACR;AACF;;;;AASA,UAAiB,KACf,UACA,SACc;CACd,MAAM,QAAQ,MAAM,KAAK,QAAQ;CACjC,MAAM,KAAK,OAAO;CAClB,OAAO;AACT;;;;AAKA,UAAiB,QAAW,UAAqC;CAC/D,MAAM,QAAQ,MAAM,KAAK,QAAQ;CACjC,MAAM,QAAQ;CACd,OAAO;AACT;;;;AASA,UAAiB,SACf,UACA,OACc;CACd,MAAM,uBAAO,IAAI,IAAO;CACxB,KAAK,MAAM,SAAS,UAAU;EAC5B,MAAM,MAAO,QAAQ,MAAM,KAAK,IAAI;EACpC,IAAI,CAAC,KAAK,IAAI,GAAG,GAAG;GAClB,KAAK,IAAI,GAAG;GACZ,MAAM;EACR;CACF;AACF;;;;AAKA,UAAiB,oBACf,UACA,OACc;CACd,IAAI;CACJ,IAAI,QAAQ;CAEZ,KAAK,MAAM,SAAS,UAAU;EAC5B,MAAM,MAAO,QAAQ,MAAM,KAAK,IAAI;EACpC,IAAI,SAAS,QAAQ,SAAS;GAC5B,MAAM;GACN,UAAU;GACV,QAAQ;EACV;CACF;AACF;;;;AASA,UAAiB,IACf,UACA,IACc;CACd,IAAI,QAAQ;CACZ,KAAK,MAAM,SAAS,UAAU;EAC5B,GAAG,OAAO,OAAO;EACjB,MAAM;CACR;AACF;;;;AASA,SAAgB,KACd,UACA,WACS;CACT,KAAK,MAAM,SAAS,UAClB,IAAI,UAAU,KAAK,GAAG,OAAO;CAE/B,OAAO;AACT;;;;AAKA,SAAgB,MACd,UACA,WACS;CACT,KAAK,MAAM,SAAS,UAClB,IAAI,CAAC,UAAU,KAAK,GAAG,OAAO;CAEhC,OAAO;AACT;;;;AAKA,SAAgB,KACd,UACA,WACS;CACT,OAAO,CAAC,KAAK,UAAU,SAAS;AAClC;;;;AAKA,SAAgB,KACd,UACA,WACe;CACf,KAAK,MAAM,SAAS,UAClB,IAAI,UAAU,KAAK,GAAG,OAAO;AAGjC;;;;AAKA,SAAgB,MACd,UACA,WACQ;CACR,IAAI,QAAQ;CACZ,KAAK,MAAM,SAAS,UAClB,IAAI,CAAC,aAAa,UAAU,KAAK,GAC/B;CAGJ,OAAO;AACT;;;;AASA,SAAgB,IACd,UACA,SACe;CACf,MAAM,MAAM,aAAa,GAAQ,MAAW,IAAI;CAChD,IAAI;CAEJ,KAAK,MAAM,SAAS,UAClB,IAAI,aAAa,KAAA,KAAa,IAAI,OAAO,QAAQ,IAAI,GACnD,WAAW;CAIf,OAAO;AACT;;;;AAKA,SAAgB,IACd,UACA,SACe;CACf,MAAM,MAAM,aAAa,GAAQ,MAAW,IAAI;CAChD,IAAI;CAEJ,KAAK,MAAM,SAAS,UAClB,IAAI,aAAa,KAAA,KAAa,IAAI,OAAO,QAAQ,IAAI,GACnD,WAAW;CAIf,OAAO;AACT;;;;AAKA,SAAgB,IAAI,UAAoC;CACtD,IAAI,QAAQ;CACZ,KAAK,MAAM,SAAS,UAClB,SAAS;CAEX,OAAO;AACT;;;;AAKA,SAAgB,QAAQ,UAAgD;CACtE,IAAI,QAAQ;CACZ,IAAI,QAAQ;CAEZ,KAAK,MAAM,SAAS,UAAU;EAC5B,SAAS;EACT;CACF;CAEA,OAAO,UAAU,IAAI,KAAA,IAAY,QAAQ;AAC3C;;;;AASA,SAAgBC,UAAW,UAA4B;CACrD,OAAO,MAAM,KAAK,QAAQ;AAC5B;;;;AAKA,SAAgBC,QAAS,UAA+B;CACtD,OAAO,IAAI,IAAI,QAAQ;AACzB;;;;AAKA,SAAgBC,QACd,UACA,OACA,SACW;CACX,MAAM,sBAAM,IAAI,IAAU;CAC1B,KAAK,MAAM,SAAS,UAClB,IAAI,IAAI,MAAM,KAAK,GAAG,QAAQ,KAAK,CAAC;CAEtC,OAAO;AACT;;;;;;;;;;;;;AAkBA,SAAgB,KACd,OACA,GAAG,KACE;CACL,OAAO,IAAI,QAAQ,KAAK,OAAO,GAAG,GAAG,GAAG,KAAK;AAC/C;;;;;;;;;;;;;;;;;;;;AC5dA,SAAgB,QACd,UACA,WACG;CACH,IAAI,MAAM,UAAU,SAAS;CAC7B,KAAK,MAAM,WAAW,UACpB,MAAM,UAAU,YAAY,KAAK,OAAO;CAE1C,OAAO,UAAU,SAAS,GAAG;AAC/B;;;;AASA,SAAgB,SAAsD;CACpE,OAAO;EACL,gBAAgB,UAAa;EAC7B,cAAc,MAAM,aAAa,KAAK,IAAI,OAAO,GAAG;EACpD,WAAW,SAAS;CACtB;AACF;;;;AAKA,SAAgB,QAAiD;CAC/D,OAAO;EACL,gBAAgB,QAAW;EAC3B,cAAc,KAAK,aAAa,IAAI,IAAI,OAAO,GAAG;EAClD,WAAW,QAAQ;CACrB;AACF;;;;AAKA,SAAgB,UAAqC;CACnD,OAAO;EACL,gBAAgB,CAAC;EACjB,cAAc,KAAK,aAAa,IAAI,KAAK,OAAO,GAAG;EACnD,WAAW,QAAQ;CACrB;AACF;;;;AAKA,SAAgB,MACd,cACA,gBAC4C;CAC5C,OAAO;EACL,gBAAgB,QAAc;EAC9B,cAAc,KAAK,YAAY;GAC7B,IAAI,IAAI,aAAa,OAAO,GAAG,eAAe,OAAO,CAAC;GACtD,OAAO;EACT;EACA,WAAW,QAAQ;CACrB;AACF;;;;;;;;AAaA,SAAgB,WACd,YACkE;CAClE,OAAO;EACL,gBAAgB,QAAyB;EACzC,cAAc,KAAK,YAAY;GAC7B,MAAM,MAAM,WAAW,OAAO;GAE9B,IADiB,gBAAgB,WAAW,UAAa,CACtD,CAAC,CAAC,IAAI,OAAO;GAChB,OAAO;EACT;EACA,WAAW,QAAQ;CACrB;AACF;;;;;;;;;;;AAYA,SAAgB,eACd,YACA,YAC4C;CAC5C,OAAO;EACL,gBAAgB,QAAc;EAC9B,cAAc,KAAK,YAAY;GAC7B,MAAM,MAAM,WAAW,OAAO;GAC9B,MAAM,MAAM,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,WAAW,SAAS;GAC9D,IAAI,IAAI,KAAK,WAAW,YAAY,KAAK,OAAO,CAAC;GACjD,OAAO;EACT;EACA,WAAW,QAAQ;GACjB,MAAM,SAAS,QAAc;GAC7B,KAAK,MAAM,SAAS,IAAI,QAAQ,GAC9B,OAAO,IAAI,MAAM,KAAK,WAAW,SAAS,MAAM,KAAK,CAAC;GAExD,OAAO;EACT;CACF;AACF;;;;;;;;;;;AAYA,SAAgB,eACd,WAC8E;CAC9E,OAAO,YAAY,YAAY,UAAU,OAAO,CAAC;AACnD;;;;AASA,SAAgB,WAA4C;CAC1D,OAAO;EACL,gBAAgB;EAChB,cAAc,UAAU,QAAQ;EAChC,WAAW,UAAU;CACvB;AACF;;;;AAKA,SAAgB,cACd,QAC8B;CAC9B,OAAO;EACL,gBAAgB;EAChB,cAAc,KAAK,YAAY,MAAM,OAAO,OAAO;EACnD,WAAW,QAAQ;CACrB;AACF;;;;AAKA,SAAgB,gBACd,QACsD;CACtD,OAAO;EACL,iBAAiB;GAAE,KAAK;GAAG,OAAO;EAAE;EACpC,cAAc,KAAK,YAAY;GAC7B,IAAI,OAAO,OAAO,OAAO;GACzB,IAAI;GACJ,OAAO;EACT;EACA,WAAW,QAAS,IAAI,UAAU,IAAI,IAAI,IAAI,MAAM,IAAI;CAC1D;AACF;;;;AAKA,SAAgB,MACd,YAC4C;CAC5C,OAAO;EACL,gBAAgB,KAAA;EAChB,cAAc,KAAK,YAAY;GAC7B,IAAI,QAAQ,KAAA,KAAa,WAAW,SAAS,GAAG,IAAI,GAClD,OAAO;GAET,OAAO;EACT;EACA,WAAW,QAAQ;CACrB;AACF;;;;AAKA,SAAgB,MACd,YAC4C;CAC5C,OAAO;EACL,gBAAgB,KAAA;EAChB,cAAc,KAAK,YAAY;GAC7B,IAAI,QAAQ,KAAA,KAAa,WAAW,SAAS,GAAG,IAAI,GAClD,OAAO;GAET,OAAO;EACT;EACA,WAAW,QAAQ;CACrB;AACF;;;;;;;;;;;;;;AAmBA,SAAgB,QACd,YAAoB,IACpB,SAAiB,IACjB,SAAiB,IACe;CAChC,OAAO;EACL,gBAAgB,CAAC;EACjB,cAAc,OAAO,aAAa,MAAM,KAAK,OAAO,OAAO,CAAC,GAAG;EAC/D,WAAW,UAAU,SAAS,MAAM,KAAK,SAAS,IAAI;CACxD;AACF;;;;;;;;;;AAeA,SAAgB,QACd,QACA,YACoB;CACpB,OAAO;EACL,UAAU,WAAW;EACrB,cAAc,KAAK,YAAY,WAAW,YAAY,KAAK,OAAO,OAAO,CAAC;EAC1E,UAAU,WAAW;CACvB;AACF;;;;AAKA,SAAgB,UACd,WACA,YACoB;CACpB,OAAO;EACL,UAAU,WAAW;EACrB,cAAc,KAAK,YAAY;GAC7B,OAAO,UAAU,OAAO,IAAI,WAAW,YAAY,KAAK,OAAO,IAAI;EACrE;EACA,UAAU,WAAW;CACvB;AACF;;;;AAKA,SAAgB,YACd,QACA,YACoB;CACpB,OAAO;EACL,UAAU,WAAW;EACrB,cAAc,KAAK,YAAY;GAC7B,KAAK,MAAM,UAAU,OAAO,OAAO,GACjC,MAAM,WAAW,YAAY,KAAK,MAAM;GAE1C,OAAO;EACT;EACA,UAAU,WAAW;CACvB;AACF;;;;AASA,SAAgB,SACd,UACA,SACoB;CACpB,OAAO;EACL,gBAAgB;EAChB,cAAc,KAAK,YAAY,QAAQ,KAAK,OAAO;EACnD,WAAW,QAAQ;CACrB;AACF;;;;AAKA,SAAgB,aACd,UACA,QACA,SACoB;CACpB,OAAO;EACL,gBAAgB;EAChB,cAAc,KAAK,YAAY,QAAQ,KAAK,OAAO,OAAO,CAAC;EAC3D,WAAW,QAAQ;CACrB;AACF;;;;;;;;;;;;;;AAmBA,SAAgB,OACd,YACA,YACA,UAC2B;CAC3B,OAAO;EACL,gBAAgB,CAAC,WAAW,SAAS,GAAG,WAAW,SAAS,CAAC;EAC7D,cAAc,CAAC,MAAM,OAAO,YAAY,CACtC,WAAW,YAAY,MAAM,OAAO,GACpC,WAAW,YAAY,MAAM,OAAO,CACtC;EACA,WAAW,CAAC,MAAM,UAAU;GAC1B,OAAO,SAAS,WAAW,SAAS,IAAI,GAAG,WAAW,SAAS,IAAI,CAAC;EACtE;CACF;AACF;;;;AASA,SAAgB,QAAuD;CACrE,OAAO;EACL,gBAAgB,KAAA;EAChB,cAAc,OAAO,YAAa,UAAU,KAAA,IAAY,UAAU;EAClE,WAAW,UAAU;CACvB;AACF;;;;AAKA,SAAgB,OAAsD;CACpE,OAAO;EACL,gBAAgB,KAAA;EAChB,cAAc,OAAO,YAAY;EACjC,WAAW,SAAS;CACtB;AACF;AAaA,SAAgB,kBACd,QAC6D;CAC7D,OAAO;EACL,iBAAiB;GACf,OAAO;GACP,KAAK;GACL,KAAK;GACL,KAAK;EACP;EACA,cAAc,OAAO,YAAY;GAC/B,MAAM,QAAQ,OAAO,OAAO;GAG5B,MAAM,QAAQ,MAAM,QAAS;GAC7B,MAAM,MAAM,MAAM,MAAO;GACzB,MAAM,MAAM,KAAK,IAAI,MAAM,KAAM,KAAK;GACtC,MAAM,MAAM,KAAK,IAAI,MAAM,KAAM,KAAK;GACtC,OAAO;EACT;EACA,WAAW,WAAW;GACpB,OAAO,MAAM;GACb,KAAK,MAAM;GACX,KAAK,MAAM;GACX,KAAK,MAAM;GACX,SAAS,MAAM,UAAW,IAAI,IAAI,MAAM,MAAO,MAAM;EACvD;CACF;AACF;;;;;;;;;;;;;;;;;ACtdA,MAAM,mCAAmB,IAAI,IAAc;AAE3C,SAAgB,YAAwB;CACtC,MAAM,MAAM;CACZ,IAAI,CAAC,iBAAiB,IAAI,GAAG,GAAG;EAC9B,MAAM,OAAO,QAAQ,SAAkB,CAAC,CAAC,CAAC,UAAa,CAAC;EACxD,iBAAiB,IAAI,KAAK,IAAI;CAChC;CACA,OAAO,iBAAiB,IAAI,GAAG;AACjC;;;;AAKA,MAAM,oCAAoB,IAAI,IAAc;AAE5C,SAAgB,aAA0B;CACxC,MAAM,MAAM;CACZ,IAAI,CAAC,kBAAkB,IAAI,GAAG,GAAG;EAC/B,MAAM,QAAQ,QAAQ,SAAmB,CAAC,CAAC,CAAC,WAAc,CAAa;EACvE,kBAAkB,IAAI,KAAK,KAAK;CAClC;CACA,OAAO,kBAAkB,IAAI,GAAG;AAClC;;;;AAKA,MAAM,kCAAkB,IAAI,IAAc;AAE1C,SAAgB,WAAgC;CAC9C,MAAM,MAAM;CACZ,IAAI,CAAC,gBAAgB,IAAI,GAAG,GAAG;EAC7B,MAAM,MAAM,QAAQ,SAAwB,CAAC,CAAC,CAAC,QAAc,CAAC;EAC9D,gBAAgB,IAAI,KAAK,GAAG;CAC9B;CACA,OAAO,gBAAgB,IAAI,GAAG;AAChC;;;;;;;;;;AAeA,SAAgB,cAAiB,SAAqB;CACpD,MAAM,OAAO,UAAa;CAC1B,KAAK,IAAI,OAAO;CAChB,OAAO,QAAQ,SAAkB,CAAC,CAAC,CAAC,IAAI;AAC1C;;;;AAKA,SAAgB,aAAmB,KAAQ,OAAyB;CAClE,MAAM,MAAM,QAAc;CAC1B,IAAI,IAAI,KAAK,KAAK;CAClB,OAAO,QAAQ,SAAwB,CAAC,CAAC,CAAC,GAAG;AAC/C;;;;;;;;;AAcA,SAAgB,QAAW,GAAW,SAAqB;CACzD,IAAI,IAAI,GACN,MAAM,IAAI,MAAM,+BAA+B,GAAG;CAGpD,MAAM,OAAO,UAAa;CAC1B,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACrB,KAAK,IAAI,OAAO;CAElB,OAAO,QAAQ,SAAkB,CAAC,CAAC,CAAC,IAAI;AAC1C;;;;;;;AAYA,SAAgB,OAAU,GAAG,UAA6B;CACxD,OAAO,UAAU,QAAQ;AAC3B;;;;AAKA,SAAgB,QAAW,GAAG,UAA8B;CAC1D,OAAO,WAAW,QAAQ;AAC5B;;;;;;;AAQA,SAAgB,MAAY,GAAG,SAAkC;CAC/D,OAAO,QAAQ,OAAO;AACxB;;;;;;;;AAaA,SAAgB,cAAiB,GAAG,UAA6B;CAC/D,OAAO,UAAU,QAAQ;AAC3B;;;;AAKA,SAAgB,aAAmB,GAAG,SAAkC;CACtE,OAAO,QAAQ,OAAO;AACxB;;;;;;;;;AAcA,SAAgB,gBAAmB,GAAG,UAAwB;CAC5D,IAAI,SAAS,WAAW,GACtB,OAAO,UAAa;CAEtB,IAAI,SAAS,WAAW,GACtB,OAAO,cAAc,SAAS,EAAQ;CAExC,MAAM,OAAO,UAAU,QAAQ;CAC/B,OAAO,QAAQ,SAAkB,CAAC,CAAC,CAAC,IAAI;AAC1C;;;;AAKA,SAAgB,eAAqB,GAAG,SAAkC;CACxE,IAAI,QAAQ,WAAW,GACrB,OAAO,SAAe;CAExB,IAAI,QAAQ,WAAW,GACrB,OAAO,aAAa,QAAQ,EAAE,CAAE,IAAI,QAAQ,EAAE,CAAE,EAAE;CAEpD,MAAM,MAAM,QAAQ,OAAO;CAC3B,OAAO,QAAQ,SAAwB,CAAC,CAAC,CAAC,GAAG;AAC/C;;;;;;;;AAaA,SAAgB,MAAM,OAAe,KAAa,OAAe,GAAsB;CACrF,IAAI,SAAS,GACX,MAAM,IAAI,MAAM,qBAAqB;CAGvC,MAAM,OAAO,UAAkB;CAE/B,IAAI,OAAO,GACT,KAAK,IAAI,IAAI,OAAO,IAAI,KAAK,KAAK,MAChC,KAAK,IAAI,CAAC;MAGZ,KAAK,IAAI,IAAI,OAAO,IAAI,KAAK,KAAK,MAChC,KAAK,IAAI,CAAC;CAId,OAAO;AACT;;;;;;;AAQA,SAAgB,QAAQ,GAA8B;CACpD,OAAO,MAAM,GAAG,CAAC;AACnB;;;;;;;;;;;;;AAkBA,SAAgB,UAAa,SAAqD;CAChF,MAAM,OAAO,UAAa;CAC1B,QAAQ,IAAI;CACZ,OAAO;AACT;;;;AAKA,SAAgB,SAAe,SAAsD;CACnF,MAAM,MAAM,QAAc;CAC1B,QAAQ,GAAG;CACX,OAAO;AACT;;;;;;;;AAaA,SAAgBC,SAAU,UAAqC;CAC7D,OAAO,UAAU,QAAQ;AAC3B;AAkBA,SAAgBC,QACd,UACA,cACA,gBACiB;CACjB,MAAM,MAAM,QAAgB;CAC5B,KAAK,MAAM,QAAQ,UAAU;EAC3B,MAAM,MAAM,aAAa,IAAI;EAC7B,MAAM,QAAQ,iBAAiB,eAAe,IAAI,IAAI;EACtD,IAAI,IAAI,KAAK,KAAK;CACpB;CACA,OAAO;AACT;;;;;;;;;;;;;AAkBA,SAAgB,QACd,UACA,cAC0B;CAC1B,MAAM,MAAM,QAAyB;CAErC,KAAK,MAAM,QAAQ,UAAU;EAC3B,MAAM,MAAM,aAAa,IAAI;EAE7B,IADiB,gBAAgB,WAAW,UAAa,CACtD,CAAC,CAAC,IAAI,IAAI;CACf;CAEA,OAAO;AACT;;;;;;;;;;;AC/UA,SAAgB,YAAY,OAAe,MAAc,iBAAyB,cAAoB;CACpG,IAAI,QAAQ,KAAK,SAAS,MACxB,MAAM,IAAI,WAAW,GAAG,eAAe,UAAU,MAAM,qBAAqB,KAAK,EAAE;AAEvF;;;;;;;;;;AAWA,SAAgB,kBAAkB,OAAe,MAAc,iBAAyB,cAAoB;CAC1G,IAAI,QAAQ,KAAK,QAAQ,MACvB,MAAM,IAAI,WAAW,GAAG,eAAe,UAAU,MAAM,qBAAqB,KAAK,EAAE;AAEvF;;;;;;;;;;AAWA,SAAgB,iBACd,OACA,KACA,MACA,iBAAyB,cACnB;CACN,IAAI,QAAQ,KAAK,MAAM,QAAQ,QAAQ,KACrC,MAAM,IAAI,WACR,GAAG,eAAe,mBAAmB,MAAM,IAAI,IAAI,aAAa,MAClE;AAEJ;;;;;;;;;AAcA,SAAgB,UAAa,OAAY,SAAY,IAAmB;CACtE,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAChC,IAAI,GAAG,MAAM,IAAK,OAAO,GACvB,OAAO;CAGX,OAAO;AACT;;;;;;;;;AAUA,SAAgB,cAAiB,OAAY,SAAY,IAAmB;CAC1E,KAAK,IAAI,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KACrC,IAAI,GAAG,MAAM,IAAK,OAAO,GACvB,OAAO;CAGX,OAAO;AACT;;;;;;;;;AAUA,SAAgB,cAAiB,OAAY,SAAY,IAAoB;CAC3E,OAAO,UAAU,OAAO,SAAS,EAAE,MAAM;AAC3C;;;;;;;;;AAUA,SAAgB,YAAe,OAAY,SAAY,IAAoB;CACzE,MAAM,QAAQ,UAAU,OAAO,SAAS,EAAE;CAC1C,IAAI,UAAU,IAAI,OAAO;CACzB,MAAM,OAAO,OAAO,CAAC;CACrB,OAAO;AACT;;;;;;;;;AAUA,SAAgB,eAAkB,OAAY,SAAY,IAAmB;CAC3E,IAAI,QAAQ;CACZ,KAAK,IAAI,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KACrC,IAAI,GAAG,MAAM,IAAK,OAAO,GAAG;EAC1B,MAAM,OAAO,GAAG,CAAC;EACjB;CACF;CAEF,OAAO;AACT;;;;;;;AAYA,UAAiB,cAAiB,OAAyB;CACzD,OAAO;AACT;;;;;;;AAQA,UAAiB,qBAAwB,OAAyB;CAChE,KAAK,IAAI,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KACrC,MAAM,MAAM;AAEhB;;;;;;;;;AAwBA,SAAgB,eAAkB,OAA6B,UAAkB,qCAAwC;CACvH,IAAI,UAAU,QAAQ,UAAU,KAAA,GAC9B,MAAM,IAAI,MAAM,OAAO;CAEzB,OAAO;AACT;;;;;;;;AASA,SAAgB,gBAAgB,MAAc,iBAAyB,cAAoB;CACzF,IAAI,SAAS,GACX,MAAM,IAAI,MAAM,GAAG,eAAe,UAAU;AAEhD;;;;;;;;;AAcA,SAAgB,MAAM,OAAe,KAAa,KAAqB;CACrE,OAAO,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK,CAAC;AAC3C;;;;;;;;AASA,SAAgB,eAAe,KAAqB;CAClD,IAAI,OAAO;CACX,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;EACnC,MAAM,OAAO,IAAI,WAAW,CAAC;EAC7B,QAAS,QAAQ,KAAK,OAAQ;EAC9B,OAAO,OAAO;CAChB;CACA,OAAO;AACT"}
+{"version":3,"file":"index.js","names":["fold","PRESENT","clamp","toArray","toSet","toMap","toList","toMap"],"sources":["../src/core/effects.ts","../src/core/policies.ts","../src/core/middleware.ts","../src/core/events.ts","../src/storage/listeners.ts","../src/order/rank.ts","../src/utils/defaults.ts","../src/impl/array-list.ts","../src/impl/array-deque.ts","../src/impl/hash-map.ts","../src/impl/linked-hash-map.ts","../src/impl/tree-map.ts","../src/impl/tree-set.ts","../src/impl/linked-list.ts","../src/impl/hash-set.ts","../src/impl/priority-queue.ts","../src/impl/summary-tree.ts","../src/core/capacity.ts","../src/behaviors/bounded.ts","../src/behaviors/readonly.ts","../src/behaviors/safe.ts","../src/behaviors/evented.ts","../src/behaviors/synchronized.ts","../src/behaviors/composite.ts","../src/behaviors/lru.ts","../src/behaviors/ttl.ts","../src/async/async-queue.ts","../src/async/channels.ts","../src/async/settled.ts","../src/fx/iter.ts","../src/fx/collectors.ts","../src/utils/factories.ts","../src/utils/helpers.ts"],"sourcesContent":["/**\n * Functional effect types for error handling and optional values.\n *\n * This module gives Option<T> and Result<T,E> types for explicit, type-safe\n * error handling without exceptions. This module includes async variants.\n */\n\n// ============================================================================\n// Option<T> - represents optional values\n// ============================================================================\n\n/**\n * This type represents the absence of a value.\n */\nexport interface None {\n  readonly _tag: \"None\";\n}\n\n/**\n * This type represents the presence of a value.\n */\nexport interface Some<T> {\n  readonly _tag: \"Some\";\n  readonly value: T;\n}\n\n/**\n * Option<T> represents a value that is present or absent.\n * This is a type-safe alternative to null/undefined.\n *\n * @example\n * function findUser(id: string): Option<User> {\n *   const user = db.get(id);\n *   return user ? Some(user) : None;\n * }\n */\nexport type Option<T> = None | Some<T>;\n\n/**\n * The singleton None value.\n */\nexport const None: None = Object.freeze({ _tag: \"None\" });\n\n/**\n * This function constructs a Some value containing the given value.\n */\nexport const Some = <T>(value: T): Some<T> =>\n  Object.freeze({ _tag: \"Some\", value });\n\n/**\n * Type guard to check if an Option is None.\n */\nexport const isNone = <T>(opt: Option<T>): opt is None => opt._tag === \"None\";\n\n/**\n * Type guard to check if an Option is Some.\n */\nexport const isSome = <T>(opt: Option<T>): opt is Some<T> =>\n  opt._tag === \"Some\";\n\n/**\n * This function extracts the value from a Some, or gives the default value if None.\n */\nexport const getOrElse = <T>(opt: Option<T>, defaultValue: T): T =>\n  isSome(opt) ? opt.value : defaultValue;\n\n/**\n * This function extracts the value from a Some, or throws an error if None.\n */\nexport const unwrap = <T>(opt: Option<T>): T => {\n  if (isSome(opt)) return opt.value;\n  throw new Error(\"Called unwrap on None\");\n};\n\n/**\n * This function maps a function over the value in a Some, or gives None.\n */\nexport const mapOption = <T, U>(\n  opt: Option<T>,\n  f: (value: T) => U\n): Option<U> => (isSome(opt) ? Some(f(opt.value)) : None);\n\n/**\n * Chains Option-returning operations.\n */\nexport const flatMapOption = <T, U>(\n  opt: Option<T>,\n  f: (value: T) => Option<U>\n): Option<U> => (isSome(opt) ? f(opt.value) : None);\n\n/**\n * This function converts a nullable value to an Option.\n */\nexport const fromNullable = <T>(value: T | null | undefined): Option<T> =>\n  value == null ? None : Some(value);\n\n/**\n * This function converts an Option to a nullable value.\n */\nexport const toNullable = <T>(opt: Option<T>): T | undefined =>\n  isSome(opt) ? opt.value : undefined;\n\n// ============================================================================\n// Result<T, E> - represents success or failure\n// ============================================================================\n\n/**\n * This type represents a successful result containing a value.\n */\nexport interface Ok<T> {\n  readonly _tag: \"Ok\";\n  readonly value: T;\n  /** This method calls the `Ok` case with the value. */\n  match<U>(cases: { Ok: (value: T) => U; Err: (error: never) => U }): U;\n}\n\n/**\n * This type represents a failed result containing an error.\n */\nexport interface Err<E> {\n  readonly _tag: \"Err\";\n  readonly error: E;\n  /** This method calls the `Err` case with the error. */\n  match<U>(cases: { Ok: (value: never) => U; Err: (error: E) => U }): U;\n}\n\n/**\n * Result<T, E> represents the result of an operation that can fail.\n * It contains either a success value (Ok) or an error value (Err).\n *\n * @example\n * function divide(a: number, b: number): Result<number, string> {\n *   if (b === 0) return Err(\"Division by zero\");\n *   return Ok(a / b);\n * }\n */\nexport type Result<T, E> = Ok<T> | Err<E>;\n\n/**\n * This function constructs an Ok result containing the given value.\n */\nexport const Ok = <T>(value: T): Ok<T> =>\n  Object.freeze({\n    _tag: \"Ok\",\n    value,\n    match: <U>(f: { Ok: (value: T) => U; Err: (error: unknown) => U }) =>\n      f.Ok(value),\n  });\n\n/**\n * This function constructs an Err result containing the given error.\n */\nexport const Err = <E>(error: E): Err<E> =>\n  Object.freeze({\n    _tag: \"Err\",\n    error,\n    match: <U>(f: { Ok: (value: unknown) => U; Err: (error: E) => U }) =>\n      f.Err(error),\n  });\n\n/**\n * Type guard to check if a Result is Ok.\n */\nexport const isOk = <T, E>(result: Result<T, E>): result is Ok<T> =>\n  result._tag === \"Ok\";\n\n/**\n * Type guard to check if a Result is Err.\n */\nexport const isErr = <T, E>(result: Result<T, E>): result is Err<E> =>\n  result._tag === \"Err\";\n\n/**\n * This function extracts the value from an Ok, or gives the default value if Err.\n */\nexport const getOrElseResult = <T, E>(\n  result: Result<T, E>,\n  defaultValue: T\n): T => (isOk(result) ? result.value : defaultValue);\n\n/**\n * This function extracts the value from an Ok, or throws the error if Err.\n */\nexport const unwrapResult = <T, E>(result: Result<T, E>): T => {\n  if (isOk(result)) return result.value;\n  throw result.error;\n};\n\n/**\n * This function maps a function over the value in an Ok, or gives the Err unchanged.\n */\nexport const mapResult = <T, U, E>(\n  result: Result<T, E>,\n  f: (value: T) => U\n): Result<U, E> => (isOk(result) ? Ok(f(result.value)) : result);\n\n/**\n * This function maps a function over the error in an Err, or gives the Ok unchanged.\n */\nexport const mapError = <T, E, F>(\n  result: Result<T, E>,\n  f: (error: E) => F\n): Result<T, F> => (isErr(result) ? Err(f(result.error)) : result);\n\n/**\n * Chains Result-returning operations.\n */\nexport const flatMapResult = <T, U, E>(\n  result: Result<T, E>,\n  f: (value: T) => Result<U, E>\n): Result<U, E> => (isOk(result) ? f(result.value) : result);\n\n/**\n * This function converts a throwing function into a Result-returning function.\n */\nexport const tryCatch = <T, E = unknown>(\n  fn: () => T,\n  onError?: (error: unknown) => E\n): Result<T, E> => {\n  try {\n    return Ok(fn());\n  } catch (error) {\n    return Err((onError ? onError(error) : error) as E);\n  }\n};\n\n/**\n * This function converts an async throwing function into a Result-returning async function.\n */\nexport const tryCatchAsync = async <T, E = unknown>(\n  fn: () => Promise<T>,\n  onError?: (error: unknown) => E\n): Promise<Result<T, E>> => {\n  try {\n    return Ok(await fn());\n  } catch (error) {\n    return Err((onError ? onError(error) : error) as E);\n  }\n};\n\n// ============================================================================\n// Async variants\n// ============================================================================\n\n/**\n * Async variant of Option<T>.\n */\nexport type AsyncOption<T> = Promise<Option<T>>;\n\n/**\n * Async variant of Result<T, E>.\n */\nexport type AsyncResult<T, E> = Promise<Result<T, E>>;\n\n/**\n * This function maps a function over an async Option.\n */\nexport const mapAsyncOption = async <T, U>(\n  opt: AsyncOption<T>,\n  f: (value: T) => U | Promise<U>\n): AsyncOption<U> => {\n  const resolved = await opt;\n  if (isSome(resolved)) {\n    return Some(await f(resolved.value));\n  }\n  return None;\n};\n\n/**\n * This function maps a function over an async Result.\n */\nexport const mapAsyncResult = async <T, U, E>(\n  result: AsyncResult<T, E>,\n  f: (value: T) => U | Promise<U>\n): AsyncResult<U, E> => {\n  const resolved = await result;\n  if (isOk(resolved)) {\n    return Ok(await f(resolved.value));\n  }\n  return resolved;\n};\n\n// ============================================================================\n// Conversion utilities\n// ============================================================================\n\n/**\n * This function converts an Option to a Result.\n * None becomes Err with the given error.\n */\nexport const optionToResult = <T, E>(opt: Option<T>, error: E): Result<T, E> =>\n  isSome(opt) ? Ok(opt.value) : Err(error);\n\n/**\n * This function converts a Result to an Option.\n * Err becomes None, discarding the error.\n */\nexport const resultToOption = <T, E>(result: Result<T, E>): Option<T> =>\n  isOk(result) ? Some(result.value) : None;\n\n/**\n * This function combines multiple Options into an Option of an array.\n * This function gives None if any input is None.\n */\nexport const sequence = <T>(opts: Option<T>[]): Option<T[]> => {\n  const values: T[] = [];\n  for (const opt of opts) {\n    if (isNone(opt)) return None;\n    values.push(opt.value);\n  }\n  return Some(values);\n};\n\n/**\n * This function combines multiple Results into a Result of an array.\n * This function gives the first Err encountered, or Ok with all values.\n */\nexport const sequenceResults = <T, E>(\n  results: Result<T, E>[]\n): Result<T[], E> => {\n  const values: T[] = [];\n  for (const result of results) {\n    if (isErr(result)) return result;\n    values.push(result.value);\n  }\n  return Ok(values);\n};\n","/**\n * Policy types for configurable collection behaviors.\n *\n * Policies define how collections handle edge cases like overflow,\n * underflow, and eviction. These are used by behavior decorators\n * to give flexible, composable behavior.\n */\n\n// ============================================================================\n// Overflow Policies - what to do when a bounded collection is full\n// ============================================================================\n\n/**\n * Policy for handling overflow when adding to a full bounded collection.\n *\n * - 'throw': Throw an error when trying to add to a full collection\n * - 'drop-oldest': Remove the oldest element and add the new one\n * - 'drop-newest': Ignore the new element (don't add it)\n * - 'reject': Return false/None but don't throw (graceful failure)\n * - 'grow': Automatically increase capacity (becomes unbounded)\n * - 'block': For async collections, wait until space is available\n */\nexport type OverflowPolicy =\n  | \"throw\"\n  | \"drop-oldest\"\n  | \"drop-newest\"\n  | \"reject\"\n  | \"grow\"\n  | \"block\";\n\n/**\n * Context information given when overflow occurs.\n */\nexport interface OverflowContext<T> {\n  /** The element that triggered the overflow. */\n  readonly newElement: T;\n  /** Current size of the collection. */\n  readonly currentSize: number;\n  /** Maximum capacity of the collection. */\n  readonly capacity: number;\n  /** Timestamp when overflow occurred. */\n  readonly timestamp: number;\n}\n\n/**\n * Callback invoked when overflow occurs.\n * This function can log, record metrics or do custom handling.\n */\nexport type OverflowHandler<T> = (context: OverflowContext<T>) => void;\n\n// ============================================================================\n// Underflow Policies - what to do when removing from an empty collection\n// ============================================================================\n\n/**\n * Policy for handling underflow when removing from an empty collection.\n *\n * - 'throw': Throw an error when trying to remove from empty collection\n * - 'return-none': Return None/undefined (graceful failure)\n * - 'return-default': Give a default value given by user\n * - 'block': For async collections, wait until an element is available\n */\nexport type UnderflowPolicy =\n  | \"throw\"\n  | \"return-none\"\n  | \"return-default\"\n  | \"block\";\n\n/**\n * Context information given when underflow occurs.\n */\nexport interface UnderflowContext {\n  /** The operation that triggered the underflow. */\n  readonly operation: string;\n  /** Timestamp when underflow occurred. */\n  readonly timestamp: number;\n}\n\n/**\n * Callback invoked when underflow occurs.\n */\nexport type UnderflowHandler = (context: UnderflowContext) => void;\n\n// ============================================================================\n// Eviction Policies - how to choose which element to remove\n// ============================================================================\n\n/**\n * Policy for choosing which element to evict from a bounded collection.\n *\n * - 'lru': Least Recently Used - evict element not accessed for longest time\n * - 'lfu': Least Frequently Used - evict element accessed least often\n * - 'fifo': First In First Out - evict oldest inserted element\n * - 'lifo': Last In First Out - evict newest inserted element (stack-like)\n * - 'random': Evict a random element\n * - 'ttl': Time To Live - evict elements that have expired\n * - 'priority': Evict element with lowest priority\n * - 'custom': User-provided eviction function\n */\nexport type EvictionPolicy =\n  | \"lru\"\n  | \"lfu\"\n  | \"fifo\"\n  | \"lifo\"\n  | \"random\"\n  | \"ttl\"\n  | \"priority\"\n  | \"custom\";\n\n/**\n * Metadata tracked for eviction decisions.\n */\nexport interface EvictionMetadata {\n  /** When the element was inserted. */\n  readonly insertedAt: number;\n  /** When the element was last accessed. */\n  lastAccessedAt: number;\n  /** How many times the element has been accessed. */\n  accessCount: number;\n  /** Time-to-live expiration timestamp (if applicable). */\n  readonly expiresAt?: number;\n  /** Priority value (higher = more important, if applicable). */\n  readonly priority?: number;\n}\n\n/**\n * Information about an element that can be evicted.\n */\nexport interface EvictionCandidate<T> {\n  /** The element value. */\n  readonly element: T;\n  /** Eviction metadata for this element. */\n  readonly metadata: EvictionMetadata;\n}\n\n/**\n * Custom eviction function.\n * Given candidates, gives the element to evict.\n */\nexport type EvictionSelector<T> = (\n  candidates: EvictionCandidate<T>[]\n) => T | undefined;\n\n// ============================================================================\n// Retry Policies - for async operations\n// ============================================================================\n\n/**\n * Policy for retrying failed async operations.\n */\nexport interface RetryPolicy {\n  /** Maximum number of retry tries. */\n  readonly maxAttempts: number;\n  /** Initial delay in milliseconds. */\n  readonly initialDelay: number;\n  /** Backoff strategy. */\n  readonly backoff: \"none\" | \"linear\" | \"exponential\";\n  /** Maximum delay cap (for backoff). */\n  readonly maxDelay?: number;\n  /** Jitter to add randomness and avoid thundering herd. */\n  readonly jitter?: boolean;\n}\n\n/**\n * Context for retry decisions.\n */\nexport interface RetryContext {\n  /** Current try number (1-indexed). */\n  readonly attempt: number;\n  /** The error that caused the retry. */\n  readonly error: unknown;\n  /** Elapsed time since first try. */\n  readonly elapsedMs: number;\n}\n\n/**\n * Callback to determine if an error is retryable.\n */\nexport type RetryPredicate = (context: RetryContext) => boolean;\n\n// ============================================================================\n// Conflict Resolution Policies - for concurrent modifications\n// ============================================================================\n\n/**\n * Policy for resolving conflicts when same key is changed concurrently.\n *\n * - 'last-write-wins': Most recent write takes precedence\n * - 'first-write-wins': First write takes precedence\n * - 'merge': Call merge function to combine values\n * - 'throw': Throw an error on conflict\n */\nexport type ConflictResolutionPolicy =\n  | \"last-write-wins\"\n  | \"first-write-wins\"\n  | \"merge\"\n  | \"throw\";\n\n/**\n * Function to merge conflicting values.\n */\nexport type MergeFunction<T> = (current: T, incoming: T) => T;\n\n// ============================================================================\n// Compaction Policies - for memory management\n// ============================================================================\n\n/**\n * Policy for when to compact internal storage.\n */\nexport interface CompactionPolicy {\n  /** Compact when the used part of the capacity drops below this ratio (0-1). */\n  readonly minLoadFactor?: number;\n  /** Compact when wasted space exceeds this many elements. */\n  readonly maxWastedSpace?: number;\n  /** Automatically compact on every removal. */\n  readonly autoCompact?: boolean;\n}\n\n// ============================================================================\n// Growth Policies - for dynamic capacity\n// ============================================================================\n\n/**\n * Policy for how to grow capacity when needed.\n */\nexport interface GrowthPolicy {\n  /** Growth strategy. */\n  readonly strategy: \"double\" | \"linear\" | \"golden-ratio\" | \"custom\";\n  /** For linear growth, how many elements to add. */\n  readonly linearIncrement?: number;\n  /** For custom growth, a function to calculate new capacity. */\n  readonly customGrowth?: (currentCapacity: number) => number;\n  /** Maximum capacity limit (prevent unbounded growth). */\n  readonly maxCapacity?: number;\n}\n\n// ============================================================================\n// Validation Policies - for type checking\n// ============================================================================\n\n/**\n * Validation action when an invalid element is encountered.\n *\n * - 'throw': Throw an error\n * - 'drop': Silently drop the invalid element\n * - 'coerce': Try to coerce to valid type\n * - 'log': Log a warning and continue\n */\nexport type ValidationPolicy = \"throw\" | \"drop\" | \"coerce\" | \"log\";\n\n/**\n * Context for validation failures.\n */\nexport interface ValidationContext<T> {\n  /** The invalid element. */\n  readonly element: T;\n  /** Validation error message/details. */\n  readonly error: unknown;\n  /** The operation that triggered validation. */\n  readonly operation: string;\n}\n\n/**\n * Callback invoked on validation failures.\n */\nexport type ValidationHandler<T> = (context: ValidationContext<T>) => void;\n\n// ============================================================================\n// Default policies\n// ============================================================================\n\n/**\n * Default overflow policy: throw an error.\n */\nexport const DEFAULT_OVERFLOW_POLICY: OverflowPolicy = \"throw\";\n\n/**\n * Default underflow policy: throw an error.\n */\nexport const DEFAULT_UNDERFLOW_POLICY: UnderflowPolicy = \"throw\";\n\n/**\n * Default eviction policy: FIFO (oldest first).\n */\nexport const DEFAULT_EVICTION_POLICY: EvictionPolicy = \"fifo\";\n\n/**\n * Default retry policy: 3 tries with exponential backoff.\n */\nexport const DEFAULT_RETRY_POLICY: RetryPolicy = {\n  maxAttempts: 3,\n  initialDelay: 100,\n  backoff: \"exponential\",\n  maxDelay: 5000,\n  jitter: true,\n};\n\n/**\n * Default conflict resolution: last write wins.\n */\nexport const DEFAULT_CONFLICT_POLICY: ConflictResolutionPolicy =\n  \"last-write-wins\";\n\n/**\n * Default growth policy: double capacity.\n */\nexport const DEFAULT_GROWTH_POLICY: GrowthPolicy = {\n  strategy: \"double\",\n  maxCapacity: Number.MAX_SAFE_INTEGER,\n};\n\n/**\n * Default validation policy: throw on invalid.\n */\nexport const DEFAULT_VALIDATION_POLICY: ValidationPolicy = \"throw\";\n","/**\n * Middleware composition system for collections.\n *\n * This module gives the core composition mechanism. With it, behaviors go in layers\n * on top of collections with the decorator pattern.\n *\n * The mechanism is for synchronous collection operations. The collection instance itself\n * is the context, so a behavior needs no explicit context object.\n *\n * @example\n * const list = compose(\n *   safeList<number>(),\n *   eventedList<number>(),\n *   boundedList<number>({ capacity: 100 })\n * )(arrayList<number>())\n */\n\nimport type { Collection } from \"../interfaces/collection.js\";\nimport { compose as fold, type Chain, type Layer, type Stacked } from \"./layers.js\";\n\n/**\n * A middleware is a function that takes a collection and gives\n * an enhanced version of that collection.\n *\n * This maps to the unified middleware pattern where:\n * - The \"context\" is the collection itself (passed directly, not in a context object)\n * - Execution is synchronous (no Promises)\n * - Type transformation is tracked through In -> Out\n *\n * Middleware can:\n * - Intercept method calls\n * - Add new capabilities\n * - Transform inputs/outputs\n * - Delegate to the next layer\n *\n * @template In The input collection type\n * @template Out The output collection type (defaults to In if not specified)\n */\nexport type Middleware<In = any, Out extends In = In> = (next: In) => Out;\n\n/**\n * Composes multiple middleware layers into a single enhancer function.\n *\n * This function uses reduceRight to make an \"onion\" pattern where the first middleware\n * is the outermost layer (runs first when calling into the collection).\n *\n * The type system properly tracks capability additions through composition.\n *\n * @example\n * // Layer order (outer to inner):\n * // 1. safe - converts throws to Option/Result\n * // 2. evented - emits events on mutations\n * // 3. bounded - enforces capacity limits\n * // 4. base - the underlying ArrayList\n * const enhancer = compose(\n *   safeList<number>(),\n *   eventedList<number>(),\n *   boundedList<number>({ capacity: 100 })\n * )\n * const list = enhancer(arrayList<number>())\n * // Type: List<number> & SafeCollection & EventedCollection & BoundedCollection\n *\n * @param layers The middleware layers to compose\n * @returns A function that applies all layers to a base collection\n */\nexport function compose<const L extends readonly Layer[]>(...layers: L & Chain<L>): Stacked<L> {\n  return fold(...(layers as readonly Layer[])) as unknown as Stacked<L>;\n}\n\n/**\n * Utility to check if a collection has a specific capability.\n * Useful for middleware that wants to conditionally enhance behavior.\n *\n * @example\n * if (hasCapability(collection, 'on')) {\n *   // Collection supports events\n *   collection.on('add', handler)\n * }\n */\nexport const hasCapability = <C extends Collection<any>, K extends keyof any>(\n  collection: C,\n  capability: K\n): collection is C & Record<K, unknown> => {\n  return capability in collection;\n};\n\n/**\n * Marker interface for collections that support events.\n * Middleware can use this to detect event capability.\n */\nexport interface Evented<E extends Record<string, any>> {\n  /**\n   * Subscribe to an event.\n   * @returns Unsubscribe function\n   */\n  on<K extends keyof E>(event: K, handler: (payload: E[K]) => void): () => void;\n\n  /**\n   * Emit an event (internal use by middleware).\n   * @internal\n   */\n  emit?<K extends keyof E>(event: K, payload: E[K]): void;\n}\n\n/**\n * Marker interface for collections that support async operations.\n */\nexport interface Async<T> {\n  /**\n   * Async iterator for consuming elements.\n   */\n  [Symbol.asyncIterator](): AsyncIterator<T>;\n}\n\n/**\n * Marker interface for collections that are bounded.\n */\nexport interface BoundedCollection {\n  /** Maximum capacity */\n  readonly capacity: number;\n  /** If collection is at capacity */\n  readonly isFull: boolean;\n  /** Remaining space */\n  readonly remainingCapacity: number;\n}\n\n/**\n * Marker interface for collections that support safe (Option/Result) operations.\n */\nexport interface SafeCollection {\n  /**\n   * Namespace for safe operations that return Option/Result instead of throwing.\n   */\n  readonly safe: unknown;\n}\n\n/**\n * Type helper to extract the element type from a collection.\n */\nexport type ElementType<C> = C extends {\n  [Symbol.iterator](): Iterator<infer T>;\n}\n  ? T\n  : C extends { get(index: number): infer T }\n  ? T\n  : C extends { peek(): infer T }\n  ? T\n  : never;\n\n/**\n * Type helper to make all methods of a type return their async equivalents.\n */\nexport type Asyncify<C> = {\n  [K in keyof C]: C[K] extends (...args: infer Args) => infer R\n    ? (...args: Args) => Promise<R>\n    : C[K];\n};\n\n/**\n * Helper to make a proxy that intercepts method calls.\n * Useful for implementing middleware that needs to wrap method invocations.\n *\n * @example\n * const logged = interceptMethods(collection, (target, method, args) => {\n *   console.log(`Calling ${String(method)} with`, args)\n *   const result = Reflect.apply(target[method], target, args)\n *   console.log(`Result:`, result)\n *   return result\n * })\n */\nexport const interceptMethods = <C extends object>(\n  target: C,\n  interceptor: (target: C, method: keyof C, args: unknown[]) => unknown\n): C => {\n  return new Proxy(target, {\n    get(t, prop, receiver) {\n      const value = Reflect.get(t, prop, receiver);\n      if (typeof value === \"function\" && typeof prop === \"string\") {\n        return function (this: unknown, ...args: unknown[]) {\n          return interceptor(t, prop as keyof C, args);\n        };\n      }\n      return value;\n    },\n  });\n};\n\n/**\n * Helper to make a readonly view of a collection by blocking mutating methods.\n *\n * @param mutatingMethods Set of method names that the middleware blocks\n * @param errorMessage Custom error message to throw\n */\nexport const blockMethods = <C extends object>(\n  target: C,\n  mutatingMethods: Set<string | symbol>,\n  errorMessage: string = \"Operation not allowed\"\n): C => {\n  return new Proxy(target, {\n    get(t, prop, receiver) {\n      const value = Reflect.get(t, prop, receiver);\n      if (typeof value === \"function\" && mutatingMethods.has(prop)) {\n        return () => {\n          throw new Error(errorMessage);\n        };\n      }\n      return value;\n    },\n  });\n};\n\n/**\n * Helper to delegate method calls to a target while maintaining correct context.\n * Useful when wrapping collections.\n */\nexport const delegate = <C extends object, T extends C>(\n  target: T,\n  wrapper: Partial<C>\n): C => {\n  return new Proxy(target, {\n    get(t, prop, receiver) {\n      // If wrapper has the property, use it\n      if (prop in wrapper) {\n        return Reflect.get(wrapper, prop, receiver);\n      }\n      // Otherwise delegate to target\n      const value = Reflect.get(t, prop, receiver);\n      // Bind methods to maintain correct 'this' context\n      if (typeof value === \"function\") {\n        return value.bind(t);\n      }\n      return value;\n    },\n  }) as C;\n};\n\n/**\n * Utility type to add optional capabilities to a collection type.\n */\nexport type WithCapability<C, Cap> = C & Cap;\n\n/**\n * Builder pattern helper for fluent API construction.\n *\n * @example\n * class ListBuilder<T> {\n *   private middleware: Middleware<List<T>>[] = []\n *\n *   bounded(capacity: number) {\n *     this.middleware.push(boundedList({ capacity }))\n *     return this\n *   }\n *\n *   evented() {\n *     this.middleware.push(eventedList())\n *     return this\n *   }\n *\n *   build(): List<T> {\n *     return compose(...this.middleware)(arrayList<T>())\n *   }\n * }\n */\nexport abstract class CollectionBuilder<C> {\n  protected middleware: Middleware<C>[] = [];\n\n  /**\n   * Apply a custom middleware.\n   */\n  use(middleware: Middleware<C>): this {\n    this.middleware.push(middleware);\n    return this;\n  }\n\n  /**\n   * Build the final collection by composing all middleware with the base.\n   */\n  abstract build(): C;\n}\n\n/**\n * Utility to make a middleware that only enhances specific methods.\n *\n * @example\n * const logAdd = enhanceMethod('add', (original, args) => {\n *   console.log('Adding:', args[0])\n *   return original(...args)\n * })\n */\nexport const enhanceMethod = <C extends object, K extends keyof C & string>(\n  methodName: K,\n  enhancer: (\n    original: C[K] extends (...args: infer Args) => infer R\n      ? (...args: Args) => R\n      : never,\n    args: C[K] extends (...args: infer Args) => any ? Args : never\n  ) => C[K] extends (...args: any[]) => infer R ? R : never\n): Middleware<C> => {\n  return (next: C): C => {\n    type MethodArgs = C[K] extends (...args: infer Args) => any ? Args : never;\n    return new Proxy(next, {\n      get(target, prop, receiver) {\n        const value = Reflect.get(target, prop, receiver);\n        if (prop === methodName && typeof value === \"function\") {\n          return function (this: unknown, ...args: unknown[]) {\n            return enhancer(value.bind(target), args as MethodArgs);\n          };\n        }\n        return value;\n      },\n    });\n  };\n};\n\n/**\n * This function combines multiple middleware into a single middleware.\n * Useful for making reusable middleware bundles.\n *\n * Bundle has the same composition semantics as compose - the first middleware\n * is the outermost layer, and types are tracked through the chain.\n *\n * @example\n * const standardBehaviors = bundle(\n *   boundedList<number>({ capacity: 1000 }),\n *   eventedList<number>(),\n *   safeList<number>()\n * )\n *\n * const list = compose(standardBehaviors)(arrayList<number>())\n */\nexport const bundle: typeof compose = compose;\n","/**\n * Typed event emitter system for collections.\n *\n * This function gives a lightweight, type-safe event system for mutation events\n * and other observable behavior. Events are strongly typed using\n * TypeScript's mapped types.\n */\n\n/**\n * A listener function that receives an event payload.\n */\nexport type Listener<P> = (payload: P) => void;\n\n/**\n * A function to unsubscribe from an event.\n */\nexport type Unsubscribe = () => void;\n\n/**\n * Event map defining event names and their payload types.\n *\n * @example\n * interface MyEvents {\n *   add: { value: number; index: number }\n *   remove: { value: number }\n *   clear: {}\n * }\n */\nexport type EventMap = Record<string, any>;\n\n/**\n * Type-safe event emitter.\n *\n * This class supports subscribing to events, emitting events, and managing listeners.\n * All event names and payloads are type-checked at compile time.\n *\n * @example\n * interface ListEvents<T> {\n *   add: { value: T; index: number }\n *   remove: { value: T; index: number }\n *   clear: {}\n * }\n *\n * const emitter = new Emitter<ListEvents<number>>()\n *\n * const unsub = emitter.on('add', ({ value, index }) => {\n *   console.log(`Added ${value} at ${index}`)\n * })\n *\n * emitter.emit('add', { value: 42, index: 0 })\n * unsub() // Unsubscribe\n */\nexport class Emitter<E extends EventMap> {\n  private listeners = new Map<keyof E, Set<Listener<any>>>();\n\n  /**\n   * Subscribe to an event.\n   *\n   * @param event The event name\n   * @param listener The callback to invoke when event is emitted\n   * @returns A function to unsubscribe\n   */\n  on<K extends keyof E>(event: K, listener: Listener<E[K]>): Unsubscribe {\n    let listeners = this.listeners.get(event);\n    if (!listeners) {\n      listeners = new Set();\n      this.listeners.set(event, listeners);\n    }\n    listeners.add(listener);\n\n    // Return unsubscribe function\n    return () => {\n      listeners!.delete(listener);\n      // Clean up empty sets\n      if (listeners!.size === 0) {\n        this.listeners.delete(event);\n      }\n    };\n  }\n\n  /**\n   * Subscribe to an event, but automatically unsubscribe after first emission.\n   *\n   * @param event The event name\n   * @param listener The callback to invoke once\n   * @returns A function to unsubscribe (in case you want to cancel before emission)\n   */\n  once<K extends keyof E>(event: K, listener: Listener<E[K]>): Unsubscribe {\n    const wrappedListener: Listener<E[K]> = (payload) => {\n      unsubscribe();\n      listener(payload);\n    };\n\n    const unsubscribe = this.on(event, wrappedListener);\n    return unsubscribe;\n  }\n\n  /**\n   * Emit an event to all registered listeners.\n   *\n   * @param event The event name\n   * @param payload The event payload\n   */\n  emit<K extends keyof E>(event: K, payload: E[K]): void {\n    const listeners = this.listeners.get(event);\n    if (listeners) {\n      // Create a snapshot to avoid issues if listeners modify the set\n      const snapshot = Array.from(listeners);\n      for (const listener of snapshot) {\n        try {\n          listener(payload);\n        } catch (error) {\n          // Log error but don't stop other listeners\n          console.error(\n            `Error in event listener for '${String(event)}':`,\n            error\n          );\n        }\n      }\n    }\n  }\n\n  /**\n   * Remove all listeners for a specific event, or all events if no event specified.\n   *\n   * @param event Optional event name to clear listeners for\n   */\n  off<K extends keyof E>(event?: K): void {\n    if (event !== undefined) {\n      this.listeners.delete(event);\n    } else {\n      this.listeners.clear();\n    }\n  }\n\n  /**\n   * Get the number of listeners for a specific event.\n   *\n   * @param event The event name\n   * @returns Number of registered listeners\n   */\n  listenerCount<K extends keyof E>(event: K): number {\n    return this.listeners.get(event)?.size ?? 0;\n  }\n\n  /**\n   * Get all event names that have at least one listener.\n   */\n  eventNames(): (keyof E)[] {\n    return Array.from(this.listeners.keys());\n  }\n\n  /**\n   * Check if there are any listeners for a specific event.\n   */\n  hasListeners<K extends keyof E>(event: K): boolean {\n    return this.listenerCount(event) > 0;\n  }\n\n  /**\n   * Remove all listeners and clean up resources.\n   */\n  dispose(): void {\n    this.listeners.clear();\n  }\n}\n\n/**\n * Make an event emitter for a specific event map.\n *\n * This is a convenience factory function.\n *\n * @example\n * const events = createEmitter<ListEvents<number>>()\n */\nexport const createEmitter = <E extends EventMap>(): Emitter<E> => {\n  return new Emitter<E>();\n};\n\n/**\n * Event batching utility for reducing event noise.\n * This class collects events and emits them in batches.\n *\n * @example\n * const batcher = new EventBatcher(emitter, 'add', 100)\n * batcher.queue({ value: 1, index: 0 })\n * batcher.queue({ value: 2, index: 1 })\n * // After 100ms or flush(), emits single 'batch-add' event with both items\n */\nexport class EventBatcher<E extends EventMap, K extends keyof E> {\n  private emitter: Emitter<E & { [P in `batch-${K & string}`]: E[K][] }>;\n  private event: K;\n  private delayMs: number;\n  private batch: E[K][] = [];\n  private timer: ReturnType<typeof setTimeout> | null = null;\n\n  constructor(\n    emitter: Emitter<E & { [P in `batch-${K & string}`]: E[K][] }>,\n    event: K,\n    delayMs: number\n  ) {\n    this.emitter = emitter;\n    this.event = event;\n    this.delayMs = delayMs;\n  }\n\n  /**\n   * Add an event to the current batch.\n   */\n  queue(payload: E[K]): void {\n    this.batch.push(payload);\n\n    if (this.timer === null) {\n      this.timer = setTimeout(() => this.flush(), this.delayMs);\n    }\n  }\n\n  /**\n   * Immediately emit all batched events.\n   */\n  flush(): void {\n    if (this.timer !== null) {\n      clearTimeout(this.timer);\n      this.timer = null;\n    }\n\n    if (this.batch.length > 0) {\n      const batchEvent = `batch-${String(this.event)}` as keyof (E & { [P in `batch-${K & string}`]: E[K][] });\n      this.emitter.emit(batchEvent, this.batch as any);\n      this.batch = [];\n    }\n  }\n\n  /**\n   * Clean up resources.\n   */\n  dispose(): void {\n    this.flush();\n  }\n}\n\n/**\n * Async event emitter that gives promises.\n * This class waits for all async listeners to complete.\n *\n * @example\n * const emitter = new AsyncEmitter<{ save: { data: string } }>()\n *\n * emitter.on('save', async ({ data }) => {\n *   await database.save(data)\n * })\n *\n * await emitter.emit('save', { data: 'test' }) // Waits for save\n */\nexport class AsyncEmitter<E extends EventMap> {\n  private listeners = new Map<keyof E, Set<Listener<any>>>();\n\n  on<K extends keyof E>(event: K, listener: Listener<E[K]>): Unsubscribe {\n    let listeners = this.listeners.get(event);\n    if (!listeners) {\n      listeners = new Set();\n      this.listeners.set(event, listeners);\n    }\n    listeners.add(listener);\n\n    return () => {\n      listeners!.delete(listener);\n      if (listeners!.size === 0) {\n        this.listeners.delete(event);\n      }\n    };\n  }\n\n  /**\n   * Emit an event and wait for all async listeners to complete.\n   *\n   * @param event The event name\n   * @param payload The event payload\n   * @returns Promise that resolves when all listeners complete\n   */\n  async emit<K extends keyof E>(event: K, payload: E[K]): Promise<void> {\n    const listeners = this.listeners.get(event);\n    if (listeners) {\n      const promises = Array.from(listeners).map((listener) =>\n        Promise.resolve().then(() => listener(payload))\n      );\n      await Promise.all(promises);\n    }\n  }\n\n  off<K extends keyof E>(event?: K): void {\n    if (event !== undefined) {\n      this.listeners.delete(event);\n    } else {\n      this.listeners.clear();\n    }\n  }\n\n  listenerCount<K extends keyof E>(event: K): number {\n    return this.listeners.get(event)?.size ?? 0;\n  }\n\n  eventNames(): (keyof E)[] {\n    return Array.from(this.listeners.keys());\n  }\n\n  dispose(): void {\n    this.listeners.clear();\n  }\n}\n\n/**\n * Utility to forward events from one emitter to another.\n * Useful for composing event sources.\n *\n * @example\n * const child = new Emitter<ChildEvents>()\n * const parent = new Emitter<ParentEvents>()\n *\n * forwardEvent(child, parent, 'childEvent', 'parentEvent')\n */\nexport const forwardEvent = <\n  E1 extends EventMap,\n  E2 extends EventMap,\n  K1 extends keyof E1,\n  K2 extends keyof E2\n>(\n  source: Emitter<E1>,\n  target: Emitter<E2>,\n  sourceEvent: K1,\n  targetEvent: K2,\n  transform?: (payload: E1[K1]) => E2[K2]\n): Unsubscribe => {\n  return source.on(sourceEvent, (payload) => {\n    const transformedPayload = transform\n      ? transform(payload)\n      : (payload as any);\n    target.emit(targetEvent, transformedPayload);\n  });\n};\n\n/**\n * Make a filtered event subscription that only fires when predicate is true.\n *\n * @example\n * const emitter = new Emitter<{ change: { value: number } }>()\n *\n * onWhen(emitter, 'change', ({ value }) => value > 10, ({ value }) => {\n *   console.log('Value exceeded 10:', value)\n * })\n */\nexport const onWhen = <E extends EventMap, K extends keyof E>(\n  emitter: Emitter<E>,\n  event: K,\n  predicate: (payload: E[K]) => boolean,\n  listener: Listener<E[K]>\n): Unsubscribe => {\n  return emitter.on(event, (payload) => {\n    if (predicate(payload)) {\n      listener(payload);\n    }\n  });\n};\n","/**\n * A set of listeners for the events of a storage: the change batches of `observe()`, or the status\n * of a sync. A storage package uses it, so each storage treats its listeners in the same way.\n */\n\n/** The function that gets the error of a listener. */\nexport type ListenerErrorHandler = (error: unknown) => void;\n\n/**\n * The default handler of the error of a listener. It throws the error again in a microtask, as an\n * `EventTarget` reports the error of a listener. Thus the error is not lost, and the write that\n * sent the event does not fail.\n */\nexport const reportListenerError: ListenerErrorHandler = (error) => {\n  queueMicrotask(() => {\n    throw error;\n  });\n};\n\n/**\n * The listeners of one kind of event.\n *\n * - `emit()` gives the event to each listener, in the order of `add()`.\n * - A listener that `add()` gets during an `emit()` gets the next event, not this one.\n * - The error of a listener goes to the error handler. The other listeners get the event.\n * - The same function can be added two times. Each `add()` gives its own function that removes it.\n */\nexport class StorageListeners<E> {\n  private readonly listeners = new Set<{ readonly listener: (event: E) => void }>();\n  private readonly onError: ListenerErrorHandler;\n\n  /** @param onError - The function that gets the error of a listener. The default is `reportListenerError`. */\n  constructor(onError: ListenerErrorHandler = reportListenerError) {\n    this.onError = onError;\n  }\n\n  /** The number of listeners. */\n  get size(): number {\n    return this.listeners.size;\n  }\n\n  /**\n   * This method adds a listener.\n   *\n   * @returns The function that removes the listener. A second use of it does nothing.\n   */\n  add(listener: (event: E) => void): () => void {\n    const entry = { listener };\n    this.listeners.add(entry);\n    return () => {\n      this.listeners.delete(entry);\n    };\n  }\n\n  /** This method gives the event to each listener. */\n  emit(event: E): void {\n    for (const entry of [...this.listeners]) {\n      // A listener that a listener before it removed gets no event\n      if (!this.listeners.has(entry)) continue;\n      try {\n        entry.listener(event);\n      } catch (error) {\n        this.onError(error);\n      }\n    }\n  }\n\n  /** This method removes each listener. */\n  clear(): void {\n    this.listeners.clear();\n  }\n}\n","/**\n * The keys of an ordered list: fractional indexing with base-62 keys. A\n * key is a string. Each item of the list keeps one, and the list sorts by it. An item that moves\n * between two others gets a key between theirs, so a move writes one item and no other.\n *\n * - A key has an integer part and a fraction part. The first character of the integer part gives its\n *   length. An insertion at an end changes the integer part, so the keys stay short.\n * - An insertion between two keys uses the fraction part, which can grow without a limit. Thus the keys\n *   do not run out, and the list needs no rebalance.\n * - Compare two keys by the code units of the strings (`a < b`), not with `localeCompare`.\n * - Two writers that move items into the same gap at the same time can get the same key. Sort by the\n *   key, then by the id of the item, so each reader sees one order.\n *\n * The algorithm is the one of the `fractional-indexing` package of Rocicorp (CC0), after the article\n * \"Implementing Fractional Indexing\" of David Greenspan.\n */\n\n/** The digits of a key, in ascending order of their code units. */\nexport const KEY_DIGITS = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\";\n\nconst ZERO = KEY_DIGITS[0]!;\nconst LAST = KEY_DIGITS[KEY_DIGITS.length - 1]!;\n/** The smallest integer part. No key comes before it. */\nconst SMALLEST_INTEGER = `A${ZERO.repeat(26)}`;\n\nfunction invalid(message: string): RangeError {\n  return new RangeError(message);\n}\n\n/** This function gives the length of an integer part from its head character: a to z and Z to A give 2 to 27. */\nfunction integerLength(head: string): number {\n  if (head >= \"a\" && head <= \"z\") return head.charCodeAt(0) - \"a\".charCodeAt(0) + 2;\n  if (head >= \"A\" && head <= \"Z\") return \"Z\".charCodeAt(0) - head.charCodeAt(0) + 2;\n  throw invalid(`A key cannot start with \"${head}\"`);\n}\n\nfunction integerPart(key: string): string {\n  const length = integerLength(key[0] ?? \"\");\n  if (length > key.length) throw invalid(`The key \"${key}\" is too short for its integer part`);\n  return key.slice(0, length);\n}\n\nfunction validateKey(key: string): void {\n  if (typeof key !== \"string\" || key === \"\") throw invalid(\"A key is a string that is not empty\");\n  for (const c of key) if (!KEY_DIGITS.includes(c)) throw invalid(`The key \"${key}\" has a character that is no digit of a key`);\n  if (key === SMALLEST_INTEGER) throw invalid(`The key \"${key}\" is reserved`);\n  const fraction = key.slice(integerPart(key).length);\n  if (fraction.endsWith(ZERO)) throw invalid(`The fraction part of the key \"${key}\" ends with ${ZERO}`);\n}\n\n/** A fraction strictly between two fractions. `b` null is the end. Neither one ends with the zero digit. */\nfunction midpoint(a: string, b: string | null): string {\n  if (b !== null) {\n    let n = 0;\n    while ((a[n] ?? ZERO) === b[n]) n++;\n    if (n > 0) return b.slice(0, n) + midpoint(a.slice(n), b.slice(n));\n  }\n  const digitA = a ? KEY_DIGITS.indexOf(a[0]!) : 0;\n  const digitB = b !== null ? KEY_DIGITS.indexOf(b[0]!) : KEY_DIGITS.length;\n  if (digitB - digitA > 1) return KEY_DIGITS[Math.round((digitA + digitB) / 2)]!;\n  // The first digits are next to each other\n  if (b !== null && b.length > 1) return b.slice(0, 1);\n  return KEY_DIGITS[digitA]! + midpoint(a.slice(1), null);\n}\n\nfunction incrementInteger(x: string): string | null {\n  const [head, ...digits] = x.split(\"\") as [string, ...string[]];\n  let carry = true;\n  for (let i = digits.length - 1; carry && i >= 0; i--) {\n    const d = KEY_DIGITS.indexOf(digits[i]!) + 1;\n    if (d === KEY_DIGITS.length) digits[i] = ZERO;\n    else {\n      digits[i] = KEY_DIGITS[d]!;\n      carry = false;\n    }\n  }\n  if (!carry) return head + digits.join(\"\");\n  if (head === \"Z\") return `a${ZERO}`;\n  if (head === \"z\") return null;\n  const next = String.fromCharCode(head.charCodeAt(0) + 1);\n  if (next > \"a\") digits.push(ZERO);\n  else digits.pop();\n  return next + digits.join(\"\");\n}\n\nfunction decrementInteger(x: string): string | null {\n  const [head, ...digits] = x.split(\"\") as [string, ...string[]];\n  let borrow = true;\n  for (let i = digits.length - 1; borrow && i >= 0; i--) {\n    const d = KEY_DIGITS.indexOf(digits[i]!) - 1;\n    if (d === -1) digits[i] = LAST;\n    else {\n      digits[i] = KEY_DIGITS[d]!;\n      borrow = false;\n    }\n  }\n  if (!borrow) return head + digits.join(\"\");\n  if (head === \"a\") return `Z${LAST}`;\n  if (head === \"A\") return null;\n  const next = String.fromCharCode(head.charCodeAt(0) - 1);\n  if (next < \"Z\") digits.push(LAST);\n  else digits.pop();\n  return next + digits.join(\"\");\n}\n\n/**\n * This function gives a key strictly between two keys. Without `prev`, the key comes before `next`.\n * Without `next`, it comes after `prev`. Without both, it gives the first key of a list (\"a0\").\n *\n * @throws RangeError when a key is not valid, or when `prev` is not before `next`\n *\n * @example\n * ```ts\n * keyBetween(undefined, undefined); // \"a0\"\n * keyBetween(\"a0\", undefined); // \"a1\", after a0\n * keyBetween(\"a0\", \"a1\"); // \"a0V\"\n * ```\n */\nexport function keyBetween(prev: string | null | undefined, next: string | null | undefined): string {\n  const a = prev ?? null;\n  const b = next ?? null;\n  if (a !== null) validateKey(a);\n  if (b !== null) validateKey(b);\n  if (a !== null && b !== null && a >= b) throw invalid(`The key \"${a}\" is not before the key \"${b}\"`);\n  if (a === null) {\n    if (b === null) return `a${ZERO}`;\n    const ib = integerPart(b);\n    const fb = b.slice(ib.length);\n    if (ib === SMALLEST_INTEGER) return ib + midpoint(\"\", fb);\n    if (ib < b) return ib;\n    const decremented = decrementInteger(ib);\n    if (decremented === null) throw invalid(\"No key comes before this one\");\n    return decremented;\n  }\n  const ia = integerPart(a);\n  const fa = a.slice(ia.length);\n  if (b === null) {\n    const incremented = incrementInteger(ia);\n    return incremented === null ? ia + midpoint(fa, null) : incremented;\n  }\n  const ib = integerPart(b);\n  const fb = b.slice(ib.length);\n  if (ia === ib) return ia + midpoint(fa, fb);\n  const incremented = incrementInteger(ia);\n  if (incremented === null) throw invalid(\"No key comes after this one\");\n  if (incremented < b) return incremented;\n  return ia + midpoint(fa, null);\n}\n\n/**\n * This function gives `count` keys in ascending order, strictly between two keys.\n * Use it to put several items at one place, or to give keys to a new list.\n *\n * @throws RangeError as `keyBetween`, or when `count` is not an integer of 0 or more\n */\nexport function keysBetween(prev: string | null | undefined, next: string | null | undefined, count: number): string[] {\n  if (!Number.isInteger(count) || count < 0) throw invalid(`A count of keys is an integer of 0 or more, not ${count}`);\n  const a = prev ?? null;\n  const b = next ?? null;\n  if (count === 0) return [];\n  if (count === 1) return [keyBetween(a, b)];\n  if (b === null) {\n    const keys = [keyBetween(a, null)];\n    for (let i = 1; i < count; i++) keys.push(keyBetween(keys[i - 1]!, null));\n    return keys;\n  }\n  if (a === null) {\n    const keys = [keyBetween(null, b)];\n    for (let i = 1; i < count; i++) keys.push(keyBetween(null, keys[i - 1]!));\n    return keys.reverse();\n  }\n  const half = Math.floor(count / 2);\n  const middle = keyBetween(a, b);\n  return [...keysBetween(a, middle, half), middle, ...keysBetween(middle, b, count - half - 1)];\n}\n\n/** The options of `isValidKey`. */\nexport interface KeyCheckOptions {\n  /** The longest key that the check accepts. The default is 1024 characters. */\n  readonly maxLength?: number;\n}\n\n/**\n * This function tells if a value is a valid key, for example a key that a client writes. A key that\n * is longer than `maxLength` is not valid.\n */\nexport function isValidKey(key: unknown, options: KeyCheckOptions = {}): key is string {\n  if (typeof key !== \"string\" || key.length > (options.maxLength ?? 1024)) return false;\n  try {\n    validateKey(key);\n    return true;\n  } catch {\n    return false;\n  }\n}\n\n/** An item of an ordered list: its id and its key. */\nexport interface KeyedItem {\n  readonly id: string;\n  readonly key: string;\n}\n\n/**\n * This function gives the writes of a move: the new key of the item that moves, and new keys for the\n * neighbors that need them. Give the other items of the list in order (by key, then by id), without\n * the item that moves. Also give the index of the drop, from 0 to their number (`dropIndex`).\n *\n * Two writers can give two items one key. A drop between two such items has no key between them.\n * So the helper first gives new keys to the items after the drop that have the key of the item before\n * it. Each write is `{ id, key }`. The writes of the neighbors come first, and the write of the item\n * that moves comes last.\n *\n * @throws RangeError when the index is outside the list, when the list holds the item that moves, or\n * when a key is not valid\n *\n * @example\n * ```ts\n * const index = dropIndex(pointer, others.map(centerOf));\n * for (const { id, key } of keysForDrop(others, index, dragged.id)) await save(id, { rank: key });\n * ```\n */\nexport function keysForDrop(items: readonly KeyedItem[], index: number, movingId: string): Array<{ id: string; key: string }> {\n  if (!Number.isInteger(index) || index < 0 || index > items.length) throw invalid(`The index ${index} is outside the list of ${items.length} items`);\n  if (items.some((item) => item.id === movingId)) throw invalid(`The list holds the item that moves (${movingId})`);\n  const prev = items[index - 1]?.key ?? null;\n  // The items from the index on that do not come after the item before the drop need new keys\n  let end = index;\n  while (end < items.length && prev !== null && items[end]!.key <= prev) end++;\n  const writes: Array<{ id: string; key: string }> = [];\n  if (end > index) {\n    const keys = keysBetween(prev, items[end]?.key ?? null, end - index);\n    for (let i = index; i < end; i++) writes.push({ id: items[i]!.id, key: keys[i - index]! });\n  }\n  const next = writes.length > 0 ? writes[0]!.key : (items[index]?.key ?? null);\n  writes.push({ id: movingId, key: keyBetween(prev, next) });\n  return writes;\n}\n\n/** The order of two keys: the code units of the strings, as the keys need (not `localeCompare`). */\nexport function compareKeys(a: string, b: string): number {\n  return a < b ? -1 : a > b ? 1 : 0;\n}\n\n/** A point, for example the center of an item on the screen. */\nexport interface Point {\n  readonly x: number;\n  readonly y: number;\n}\n\n/**\n * This function gives the index at which a point goes among the items of a list on the screen.\n * The reading order is the rows from top to bottom, and each row from left to right.\n * The index is that of the first item whose center comes after the point, from 0 to the number of items. A center within\n * `rowTolerance` of the point on the vertical axis is in the row of the point.\n *\n * Give the centers in reading order, the same order as the keys, and without the item that moves.\n *\n * @example\n * ```ts\n * const index = dropIndex(pointer, others.map(centerOf));\n * const key = keyBetween(keys[index - 1], keys[index]);\n * ```\n */\nexport function dropIndex(point: Point, centers: readonly Point[], rowTolerance = 24): number {\n  for (let i = 0; i < centers.length; i++) {\n    const c = centers[i]!;\n    if (point.y < c.y - rowTolerance) return i;\n    if (Math.abs(point.y - c.y) <= rowTolerance && point.x < c.x) return i;\n  }\n  return centers.length;\n}\n","/**\n * Default implementations of equality, hashing, and comparison functions.\n *\n * This module gives sensible defaults for primitive types and utilities for\n * making custom comparators.\n */\n\nimport type { Eq, Hash, Compare } from \"../core/traits.js\";\n\n// ============================================================================\n// Default Equality\n// ============================================================================\n\n/**\n * Default equality using strict equality (===).\n * Works for primitives and reference equality for objects.\n */\nexport const defaultEq: Eq<any> = (a, b) => a === b;\n\n/**\n * Structural equality for objects (shallow comparison of properties).\n * This function compares own enumerable properties using ===.\n */\nexport const shallowEq: Eq<any> = (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\n  const keysA = Object.keys(a);\n  const keysB = Object.keys(b);\n\n  if (keysA.length !== keysB.length) return false;\n\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\n  return true;\n};\n\n/** SameValueZero: the meaning of `===`, and NaN equals NaN. */\nconst sameValueZero = (a: unknown, b: unknown): boolean => a === b || (Number.isNaN(a) && Number.isNaN(b));\n\nconst isObject = (value: unknown): value is object => typeof value === \"object\" && value !== null;\n\n/** The pairs that one comparison holds equal. The log lets a failed try remove its pairs. */\ninterface HeldPairs {\n  readonly partners: Map<object, Set<object>>;\n  readonly log: [object, object][];\n}\n\nfunction releasePairs(held: HeldPairs, mark: number): void {\n  while (held.log.length > mark) {\n    const [a, b] = held.log.pop()!;\n    held.partners.get(a)?.delete(b);\n  }\n}\n\nfunction equalElements(a: ArrayLike<unknown>, b: ArrayLike<unknown>): boolean {\n  if (a.length !== b.length) return false;\n  for (let i = 0; i < a.length; i++) {\n    if (!sameValueZero(a[i], b[i])) return false;\n  }\n  return true;\n}\n\n/** The kinds of `equalObjects` and `hashFields`, so that the relation and its hash stay in step. */\nconst isBinary = (value: object): value is ArrayBufferLike | DataView =>\n  value instanceof DataView || value instanceof ArrayBuffer || (typeof SharedArrayBuffer !== \"undefined\" && value instanceof SharedArrayBuffer);\n\nconst isOpaque = (value: object): boolean => value instanceof Promise || value instanceof WeakMap || value instanceof WeakSet || value instanceof WeakRef;\n\nconst isBoxed = (value: object): boolean =>\n  value instanceof Number || value instanceof String || value instanceof Boolean || value instanceof BigInt || value instanceof Symbol;\n\nfunction bytesOf(value: ArrayBufferLike | DataView): Uint8Array {\n  return ArrayBuffer.isView(value) ? new Uint8Array(value.buffer, value.byteOffset, value.byteLength) : new Uint8Array(value);\n}\n\nfunction enumerableKeys(value: object): (string | symbol)[] {\n  return Reflect.ownKeys(value).filter((key) => Object.prototype.propertyIsEnumerable.call(value, key));\n}\n\nfunction equalKeys(a: any, b: any, held: HeldPairs): boolean {\n  const keys = enumerableKeys(a);\n  if (keys.length !== enumerableKeys(b).length) return false;\n  return keys.every((key) => Object.prototype.propertyIsEnumerable.call(b, key) && equalValues(a[key], b[key], held));\n}\n\n/**\n * The comparison of the entries of two maps, or of the members of two sets. A primitive key finds\n * its partner by `has`. An object key tries each object key of `b` that is not taken yet. The first\n * partner is correct, because the relation is an equivalence.\n */\nfunction equalEntries(a: Map<unknown, unknown> | Set<unknown>, b: Map<unknown, unknown> | Set<unknown>, held: HeldPairs): boolean {\n  if (a.size !== b.size) return false;\n  const valueAt = (key: unknown): unknown => (b instanceof Map ? b.get(key) : key);\n  const free = [...b.entries()].filter(([key]) => isObject(key));\n  for (const [key, value] of a.entries()) {\n    if (!isObject(key)) {\n      if (!b.has(key) || !equalValues(value, valueAt(key), held)) return false;\n      continue;\n    }\n    const at = free.findIndex(([otherKey, otherValue]) => {\n      const mark = held.log.length;\n      if (equalValues(key, otherKey, held) && equalValues(value, otherValue, held)) return true;\n      releasePairs(held, mark);\n      return false;\n    });\n    if (at < 0) return false;\n    free.splice(at, 1);\n  }\n  return true;\n}\n\n/** The comparison of two objects with the same prototype. */\nfunction equalObjects(a: any, b: any, held: HeldPairs): boolean {\n  if (Array.isArray(a) || Array.isArray(b)) {\n    if (!Array.isArray(a) || !Array.isArray(b) || a.length !== b.length) return false;\n    for (let i = 0; i < a.length; i++) {\n      if (!equalValues(a[i], b[i], held)) return false;\n    }\n    return true;\n  }\n  if (isBinary(a)) return equalElements(bytesOf(a), bytesOf(b));\n  if (ArrayBuffer.isView(a)) return equalElements(a as unknown as ArrayLike<unknown>, b);\n  if (isOpaque(a)) return false;\n  if (a instanceof Date && !sameValueZero(a.getTime(), b.getTime())) return false;\n  if (a instanceof RegExp && (a.source !== b.source || a.flags !== b.flags)) return false;\n  if (a instanceof Error && !(a.name === b.name && a.message === b.message && equalValues(a.cause, b.cause, held))) return false;\n  if (isBoxed(a) && !sameValueZero(a.valueOf(), b.valueOf())) return false;\n  if ((a instanceof Map || a instanceof Set) && !equalEntries(a, b, held)) return false;\n  return equalKeys(a, b, held);\n}\n\n/**\n * The comparison of two values. A pair stays held after it passes, so a shared or cyclic part\n * costs one visit. A failure ends the whole comparison, or the try in `equalEntries`, which\n * releases its pairs.\n */\nfunction equalValues(a: unknown, b: unknown, held: HeldPairs): boolean {\n  if (sameValueZero(a, b)) return true;\n  if (!isObject(a) || !isObject(b)) return false;\n  if (Object.getPrototypeOf(a) !== Object.getPrototypeOf(b)) return false;\n  let partners = held.partners.get(a);\n  if (partners?.has(b)) return true;\n  if (partners === undefined) {\n    partners = new Set();\n    held.partners.set(a, partners);\n  }\n  partners.add(b);\n  held.log.push([a, b]);\n  return equalObjects(a, b, held);\n}\n\n/**\n * Deep structural equality. This relation is an equivalence: it is reflexive, symmetric and\n * transitive, for each value.\n *\n * - Primitives compare by SameValueZero: NaN equals NaN, and 0 equals -0.\n * - Two objects must have the same prototype. So `{}` differs from `Object.create(null)`, from an\n *   instance of a class with the same keys, and from an object of another realm.\n * - Arrays compare by length and by index. A hole equals `undefined`.\n * - Typed arrays compare by element. `ArrayBuffer`, `SharedArrayBuffer` and `DataView` compare by byte.\n * - `Date` compares by time, `RegExp` by source and flags, and `Error` by name, message and cause.\n * - A boxed primitive compares by its value. `Map` and `Set` compare by entries, in any order. An object key\n *   matches a deep-equal key.\n * - Each other object compares by its own enumerable keys, strings and symbols, in any order. The objects above do too,\n *   except arrays and binary data.\n * - Functions, `Promise`, `WeakMap`, `WeakSet` and `WeakRef` compare by identity.\n * - Cycles are safe: two cyclic values are equal when they unfold to the same infinite tree.\n *\n * The recursion follows the depth of the data, so a very deep value can exhaust the stack.\n * `defaultHash` agrees with this relation: two equal values have one hash.\n */\nexport const deepEq: Eq<any> = (a, b): boolean => equalValues(a, b, { partners: new Map(), log: [] });\n\n/**\n * Equality by comparing a specific property.\n *\n * @example\n * const userEq = eqBy<User, 'id'>('id')\n * // or with accessor function:\n * const userEq = eqBy<User>((u) => u.id)\n */\nexport const eqBy = <T, K extends keyof T = keyof T>(\n  keyOrFn: K | ((value: T) => any)\n): Eq<T> => {\n  const accessor = typeof keyOrFn === \"function\" ? keyOrFn : (v: T) => v[keyOrFn];\n  return (a, b) => accessor(a) === accessor(b);\n};\n\n// ============================================================================\n// Default Hashing\n// ============================================================================\n\n/** The hash of one primitive or function. */\nfunction hashPrimitive(value: unknown): number {\n  if (value === null) return 0;\n  if (value === undefined) return 1;\n  switch (typeof value) {\n    case \"boolean\":\n      return value ? 1 : 0;\n    case \"number\":\n      return hashNumber(value);\n    case \"string\":\n      return hashString(value);\n    case \"symbol\":\n      return hashString(value.toString());\n    case \"bigint\":\n      return hashString(value.toString());\n    default:\n      return 2;\n  }\n}\n\n/** The levels of an object that `defaultHash` reads. A cyclic value unfolds to this depth and stops. */\nconst HASH_DEPTH = 16;\n\n/** The hashes of one call, by object and by remaining depth. A shared part costs one visit per depth. */\ntype HashMemo = Map<object, number[]>;\n\n/** This function adds one hash to a running hash. The result depends on the order. */\nconst mix = (hash: number, part: number): number => (Math.imul(hash, 31) + part) | 0;\n\n/** The finalizer of MurmurHash3. It makes a sum of entries depend on each pair, not on each half. */\nfunction scramble(hash: number): number {\n  let mixed = hash ^ (hash >>> 16);\n  mixed = Math.imul(mixed, 0x85ebca6b);\n  mixed ^= mixed >>> 13;\n  mixed = Math.imul(mixed, 0xc2b2ae35);\n  return mixed ^ (mixed >>> 16);\n}\n\n/** The start values of the kinds. Two kinds do not compare equal, so their hashes can differ. */\nconst KIND = { array: 3, binary: 5, elements: 7, opaque: 11, record: 13 } as const;\n\nconst hashAt = (value: unknown, depth: number, memo: HashMemo): number =>\n  isObject(value) ? hashObject(value, depth, memo) : hashPrimitive(value);\n\nfunction hashElements(start: number, elements: ArrayLike<unknown>): number {\n  let hash = start;\n  for (let i = 0; i < elements.length; i++) hash = mix(hash, hashPrimitive(elements[i]));\n  return hash;\n}\n\n/** The sum of the entries of a map or a set. A sum does not depend on the order of the entries. */\nfunction hashEntries(value: Map<unknown, unknown> | Set<unknown>, depth: number, memo: HashMemo): number {\n  let sum = 0;\n  for (const [key, entry] of value.entries()) sum = (sum + scramble(mix(hashAt(key, depth, memo), hashAt(entry, depth, memo)))) | 0;\n  return sum;\n}\n\n/** The sum of the own enumerable keys and their values, as `equalKeys` reads them. */\nfunction hashKeys(value: any, depth: number, memo: HashMemo): number {\n  let sum = 0;\n  for (const key of enumerableKeys(value)) sum = (sum + scramble(mix(hashPrimitive(key), hashAt(value[key], depth, memo)))) | 0;\n  return sum;\n}\n\n/** The hash of the fields of one object. This function reads only what `equalObjects` reads. */\nfunction hashFields(value: any, depth: number, memo: HashMemo): number {\n  if (Array.isArray(value)) {\n    let hash: number = KIND.array;\n    for (let i = 0; i < value.length; i++) hash = mix(hash, hashAt(value[i], depth, memo));\n    return hash;\n  }\n  if (isBinary(value)) return hashElements(KIND.binary, bytesOf(value));\n  if (ArrayBuffer.isView(value)) return hashElements(KIND.elements, value as unknown as ArrayLike<unknown>);\n  if (isOpaque(value)) return KIND.opaque;\n  let hash: number = KIND.record;\n  if (value instanceof Date) hash = mix(hash, hashNumber(value.getTime()));\n  if (value instanceof RegExp) hash = mix(mix(hash, hashString(value.source)), hashString(value.flags));\n  if (value instanceof Error) {\n    hash = mix(mix(mix(hash, hashAt(value.name, depth, memo)), hashAt(value.message, depth, memo)), hashAt(value.cause, depth, memo));\n  }\n  if (isBoxed(value)) hash = mix(hash, hashPrimitive(value.valueOf()));\n  if (value instanceof Map || value instanceof Set) hash = mix(hash, hashEntries(value, depth, memo));\n  return mix(hash, hashKeys(value, depth, memo));\n}\n\n/** The hash of one object at one depth. The depth falls with each level, so a cycle ends. */\nfunction hashObject(value: object, depth: number, memo: HashMemo): number {\n  if (depth === 0) return 0;\n  let byDepth = memo.get(value);\n  if (byDepth === undefined) {\n    byDepth = [];\n    memo.set(value, byDepth);\n  }\n  const known = byDepth[depth];\n  if (known !== undefined) return known;\n  const hash = hashFields(value, depth - 1, memo);\n  byDepth[depth] = hash;\n  return hash;\n}\n\n/**\n * This function is the default hash of a key. It agrees with `deepEq`: when `deepEq(a, b)` is true,\n * `defaultHash(a)` equals `defaultHash(b)`. So a hash map with `deepEq` finds an equal key.\n *\n * - The hash of an object reads the same fields as `deepEq`. The order of the keys of an object,\n *   and of the entries of a `Map` or a `Set`, has no effect.\n * - The hash reads 16 levels, so a cyclic or very deep value ends. Two values that differ only\n *   below that depth have one hash, and `deepEq` then tells them apart.\n * - A shared part costs one visit per level, so a dense graph ends.\n * - The hash of an object can change in a new version. Do not store it.\n */\nexport const defaultHash: Hash<any> = (value: any): number =>\n  isObject(value) ? hashObject(value, HASH_DEPTH, new Map()) : hashPrimitive(value);\n\n/**\n * Hash function for strings using djb2 algorithm.\n */\nexport const hashString = (str: string): number => {\n  let hash = 5381;\n  for (let i = 0; i < str.length; i++) {\n    hash = ((hash << 5) + hash) + str.charCodeAt(i); // hash * 33 + c\n    hash = hash & hash; // Convert to 32-bit integer\n  }\n  return hash >>> 0; // Convert to unsigned\n};\n\n/**\n * Hash function for numbers.\n */\nexport const hashNumber = (num: number): number => {\n  if (Number.isNaN(num)) return 0;\n  if (!Number.isFinite(num)) return num > 0 ? 1 : -1;\n\n  // For integers, use the number itself\n  if (Number.isInteger(num)) {\n    return num | 0; // Convert to 32-bit int\n  }\n\n  // For floats, hash the string representation\n  return hashString(num.toString());\n};\n\n/**\n * Combine multiple hash values.\n * Useful for hashing objects with multiple fields.\n *\n * @example\n * const pointHash: Hash<Point> = (p) =>\n *   combineHashes(hashNumber(p.x), hashNumber(p.y))\n */\nexport const combineHashes = (...hashes: number[]): number => {\n  let combined = 0;\n  for (const hash of hashes) {\n    combined = ((combined << 5) - combined) + hash;\n    combined = combined & combined; // Convert to 32-bit int\n  }\n  return combined >>> 0; // Convert to unsigned\n};\n\n/**\n * Make a hash function that hashes by a specific property.\n *\n * @example\n * const userHash = hashBy<User>((u) => u.id)\n */\nexport const hashBy = <T>(accessor: (value: T) => any): Hash<T> => {\n  return (value) => defaultHash(accessor(value));\n};\n\n// ============================================================================\n// Default Comparison\n// ============================================================================\n\n/**\n * Natural ordering comparison for primitives.\n * Numbers, strings, booleans, dates are compared naturally.\n */\nexport const defaultCompare: Compare<any> = (a, b) => {\n  if (a === b) return 0;\n  if (a === null || a === undefined) return -1;\n  if (b === null || b === undefined) return 1;\n\n  // Handle dates\n  if (a instanceof Date && b instanceof Date) {\n    return a.getTime() - b.getTime();\n  }\n\n  // Handle numbers\n  if (typeof a === \"number\" && typeof b === \"number\") {\n    if (Number.isNaN(a)) return Number.isNaN(b) ? 0 : -1;\n    if (Number.isNaN(b)) return 1;\n    return a - b;\n  }\n\n  // Handle strings\n  if (typeof a === \"string\" && typeof b === \"string\") {\n    return a.localeCompare(b);\n  }\n\n  // Handle booleans\n  if (typeof a === \"boolean\" && typeof b === \"boolean\") {\n    return a === b ? 0 : a ? 1 : -1;\n  }\n\n  // Fallback: convert to string and compare\n  return String(a).localeCompare(String(b));\n};\n\n/**\n * Numeric comparison (for numbers).\n */\nexport const numberCompare: Compare<number> = (a, b) => {\n  if (Number.isNaN(a)) return Number.isNaN(b) ? 0 : -1;\n  if (Number.isNaN(b)) return 1;\n  return a - b;\n};\n\n/**\n * String comparison using locale-aware sorting.\n */\nexport const stringCompare: Compare<string> = (a, b) => a.localeCompare(b);\n\n/**\n * Case-insensitive string comparison.\n */\nexport const stringCompareIgnoreCase: Compare<string> = (a, b) =>\n  a.toLowerCase().localeCompare(b.toLowerCase());\n\n/**\n * Date comparison.\n */\nexport const dateCompare: Compare<Date> = (a, b) =>\n  a.getTime() - b.getTime();\n\n/**\n * Boolean comparison (false < true).\n */\nexport const booleanCompare: Compare<boolean> = (a, b) =>\n  a === b ? 0 : a ? 1 : -1;\n\n// ============================================================================\n// Comparator Combinators\n// ============================================================================\n\n/**\n * This function reverses a comparator.\n *\n * @example\n * const descending = reversed(numberCompare)\n */\nexport const reversed = <T>(compare: Compare<T>): Compare<T> =>\n  (a, b) => compare(b, a);\n\n/**\n * This function makes a comparator that compares by a specific property or function.\n *\n * @example\n * const byAge = comparing<Person>((p) => p.age)\n * const byName = comparing<Person, 'name'>('name')\n */\nexport const comparing = <T, K extends keyof T = keyof T>(\n  keyOrFn: K | ((value: T) => any),\n  compare: Compare<any> = defaultCompare\n): Compare<T> => {\n  const accessor = typeof keyOrFn === \"function\" ? keyOrFn : (v: T) => v[keyOrFn];\n  return (a, b) => compare(accessor(a), accessor(b));\n};\n\n/**\n * Chains comparators. If the first comparator gives 0 (equal),\n * tries the next comparator, and so on.\n *\n * @example\n * const userCompare = thenComparing(\n *   comparing<User>('lastName'),\n *   comparing<User>('firstName'),\n *   comparing<User>('age')\n * )\n */\nexport const thenComparing = <T>(...comparators: Compare<T>[]): Compare<T> => {\n  return (a, b) => {\n    for (const compare of comparators) {\n      const result = compare(a, b);\n      if (result !== 0) return result;\n    }\n    return 0;\n  };\n};\n\n/**\n * This function makes a comparator that treats null/undefined as less than all other values.\n *\n * @example\n * const compare = nullsFirst(numberCompare)\n */\nexport const nullsFirst = <T>(compare: Compare<T>): Compare<T | null | undefined> => {\n  return (a, b) => {\n    if (a == null && b == null) return 0;\n    if (a == null) return -1;\n    if (b == null) return 1;\n    return compare(a, b);\n  };\n};\n\n/**\n * This function makes a comparator that treats null/undefined as greater than all other values.\n *\n * @example\n * const compare = nullsLast(numberCompare)\n */\nexport const nullsLast = <T>(compare: Compare<T>): Compare<T | null | undefined> => {\n  return (a, b) => {\n    if (a == null && b == null) return 0;\n    if (a == null) return 1;\n    if (b == null) return -1;\n    return compare(a, b);\n  };\n};\n\n/**\n * This function makes a comparator from a key extraction function.\n * Elements are compared by their extracted keys.\n *\n * @example\n * const byLength = comparingKey<string>((s) => s.length)\n */\nexport const comparingKey = <T, K>(\n  keyExtractor: (value: T) => K,\n  keyCompare: Compare<K> = defaultCompare\n): Compare<T> => {\n  return (a, b) => keyCompare(keyExtractor(a), keyExtractor(b));\n};\n","/**\n * ArrayList implementation - A dynamic array-backed list.\n *\n * This module gives O(1) indexed access and amortized O(1) append.\n * Mirrors java.util.ArrayList.\n *\n * @example\n * const list = arrayList<number>()\n * list.add(1)\n * list.add(2)\n * list.add(3)\n * console.log(list.get(1)) // 2\n */\n\nimport type { List, RandomAccess } from \"../interfaces/list.js\";\nimport type { Eq, Compare } from \"../core/traits.js\";\nimport { defaultEq, defaultCompare } from \"../utils/defaults.js\";\n\n/**\n * Options for making an ArrayList.\n */\nexport interface ArrayListOptions<T> {\n  /**\n   * Initial capacity of the underlying array.\n   * @default 10\n   */\n  initialCapacity?: number;\n\n  /**\n   * Equality function for comparing elements.\n   * @default defaultEq (===)\n   */\n  eq?: Eq<T>;\n}\n\n/**\n * ArrayList<T> - Resizable array implementation of the List interface.\n *\n * This class gives fast random access (O(1)) and fast append (amortized O(1)).\n * Insertion and removal in the middle shift elements (O(n)).\n *\n * This is the most commonly used list implementation.\n */\nexport class ArrayList<T> implements List<T>, RandomAccess {\n  private _array: T[];\n  private _size: number;\n  private readonly _eq: Eq<T>;\n\n  readonly supportsRandomAccess = true as const;\n\n  constructor(options: ArrayListOptions<T> = {}) {\n    const { initialCapacity = 10, eq = defaultEq } = options;\n    this._array = new Array(initialCapacity);\n    this._size = 0;\n    this._eq = eq;\n  }\n\n  // ========================================================================\n  // Size and capacity\n  // ========================================================================\n\n  get size(): number {\n    return this._size;\n  }\n\n  get isEmpty(): boolean {\n    return this._size === 0;\n  }\n\n  /**\n   * Current capacity of the underlying array.\n   */\n  get capacity(): number {\n    return this._array.length;\n  }\n\n  get eq(): Eq<T> {\n    return this._eq;\n  }\n\n  // ========================================================================\n  // Indexed access\n  // ========================================================================\n\n  get(index: number): T {\n    this.checkIndex(index);\n    return this._array[index]!;\n  }\n\n  set(index: number, element: T): T {\n    this.checkIndex(index);\n    const old = this._array[index]!;\n    this._array[index] = element;\n    return old!;\n  }\n\n  // ========================================================================\n  // Search\n  // ========================================================================\n\n  contains(element: T): boolean {\n    return this.indexOf(element) !== -1;\n  }\n\n  indexOf(element: T, fromIndex: number = 0): number {\n    if (fromIndex < 0) fromIndex = 0;\n    for (let i = fromIndex; i < this._size; i++) {\n      if (this._eq(this._array[i]!, element)) {\n        return i;\n      }\n    }\n    return -1;\n  }\n\n  lastIndexOf(element: T, fromIndex?: number): number {\n    const start =\n      fromIndex !== undefined\n        ? Math.min(fromIndex, this._size - 1)\n        : this._size - 1;\n    for (let i = start; i >= 0; i--) {\n      if (this._eq(this._array[i]!, element)) {\n        return i;\n      }\n    }\n    return -1;\n  }\n\n  containsAll(other: Iterable<T>): boolean {\n    for (const element of other) {\n      if (!this.contains(element)) return false;\n    }\n    return true;\n  }\n\n  // ========================================================================\n  // Addition\n  // ========================================================================\n\n  add(element: T): boolean {\n    this.ensureCapacity(this._size + 1);\n    this._array[this._size++] = element;\n    return true;\n  }\n\n  push(element: T): void {\n    this.add(element);\n  }\n\n  unshift(element: T): void {\n    this.insert(0, element);\n  }\n\n  insert(index: number, element: T): void {\n    this.checkInsertIndex(index);\n    this.ensureCapacity(this._size + 1);\n\n    // Shift elements to the right\n    for (let i = this._size; i > index; i--) {\n      this._array[i] = this._array[i - 1]!;\n    }\n\n    this._array[index] = element;\n    this._size++;\n  }\n\n  insertAll(index: number, other: Iterable<T>): boolean {\n    this.checkInsertIndex(index);\n    const elements = Array.isArray(other) ? other : Array.from(other);\n    if (elements.length === 0) return false;\n\n    this.ensureCapacity(this._size + elements.length);\n\n    // Shift existing elements to the right\n    for (let i = this._size - 1; i >= index; i--) {\n      this._array[i + elements.length] = this._array[i]!;\n    }\n\n    // Insert new elements\n    for (let i = 0; i < elements.length; i++) {\n      this._array[index + i] = elements[i];\n    }\n\n    this._size += elements.length;\n    return true;\n  }\n\n  addAll(other: Iterable<T>): boolean {\n    const elements = Array.isArray(other) ? other : Array.from(other);\n    if (elements.length === 0) return false;\n\n    this.ensureCapacity(this._size + elements.length);\n\n    for (const element of elements) {\n      this._array[this._size++] = element;\n    }\n\n    return true;\n  }\n\n  // ========================================================================\n  // Removal\n  // ========================================================================\n\n  remove(element: T): boolean {\n    const index = this.indexOf(element);\n    if (index === -1) return false;\n    this.removeAt(index);\n    return true;\n  }\n\n  removeAt(index: number): T {\n    this.checkIndex(index);\n    const old = this._array[index]!;\n\n    // Shift elements to the left\n    for (let i = index; i < this._size - 1; i++) {\n      this._array[i] = this._array[i + 1]!;\n    }\n\n    this._size--;\n    // Clear the last element to allow GC\n    this._array[this._size] = undefined as any;\n\n    return old;\n  }\n\n  pop(): T {\n    if (this.isEmpty) {\n      throw new Error(\"Cannot pop from empty list\");\n    }\n    return this.removeAt(this._size - 1);\n  }\n\n  shift(): T {\n    if (this.isEmpty) {\n      throw new Error(\"Cannot shift from empty list\");\n    }\n    return this.removeAt(0);\n  }\n\n  removeRange(fromIndex: number, toIndex: number): void {\n    this.checkRange(fromIndex, toIndex);\n    const numToRemove = toIndex - fromIndex;\n    if (numToRemove === 0) return;\n\n    // Shift elements to the left\n    for (let i = toIndex; i < this._size; i++) {\n      this._array[i - numToRemove] = this._array[i]!;\n    }\n\n    // Clear removed elements\n    for (let i = this._size - numToRemove; i < this._size; i++) {\n      this._array[i] = undefined as any;\n    }\n\n    this._size -= numToRemove;\n  }\n\n  removeAll(other: Iterable<T>): boolean {\n    const toRemove = new Set<T>();\n    for (const element of other) {\n      toRemove.add(element);\n    }\n\n    let writeIndex = 0;\n    let modified = false;\n\n    for (let readIndex = 0; readIndex < this._size; readIndex++) {\n      const element = this._array[readIndex]!;\n      let shouldRemove = false;\n\n      // Check if element matches any in toRemove using custom equality\n      for (const removeElement of toRemove) {\n        if (this._eq(element, removeElement)) {\n          shouldRemove = true;\n          modified = true;\n          break;\n        }\n      }\n\n      if (!shouldRemove) {\n        this._array[writeIndex++] = element;\n      }\n    }\n\n    // Clear remaining elements\n    for (let i = writeIndex; i < this._size; i++) {\n      this._array[i] = undefined as any;\n    }\n\n    this._size = writeIndex;\n    return modified;\n  }\n\n  retainAll(other: Iterable<T>): boolean {\n    const toRetain = Array.from(other);\n    let writeIndex = 0;\n    let modified = false;\n\n    for (let readIndex = 0; readIndex < this._size; readIndex++) {\n      const element = this._array[readIndex]!;\n      let shouldRetain = false;\n\n      // Check if element matches any in toRetain using custom equality\n      for (const retainElement of toRetain) {\n        if (this._eq(element, retainElement)) {\n          shouldRetain = true;\n          break;\n        }\n      }\n\n      if (shouldRetain) {\n        this._array[writeIndex++] = element;\n      } else {\n        modified = true;\n      }\n    }\n\n    // Clear remaining elements\n    for (let i = writeIndex; i < this._size; i++) {\n      this._array[i] = undefined as any;\n    }\n\n    this._size = writeIndex;\n    return modified;\n  }\n\n  clear(): void {\n    // Clear all elements to allow GC\n    for (let i = 0; i < this._size; i++) {\n      this._array[i] = undefined as any;\n    }\n    this._size = 0;\n  }\n\n  // ========================================================================\n  // Ordering\n  // ========================================================================\n\n  sort(compare: Compare<T> = defaultCompare): void {\n    // Sort only the used portion of the array\n    const slice = this._array.slice(0, this._size);\n    slice.sort(compare);\n    for (let i = 0; i < this._size; i++) {\n      this._array[i] = slice[i]!;\n    }\n  }\n\n  reverse(): void {\n    let left = 0;\n    let right = this._size - 1;\n    while (left < right) {\n      const temp = this._array[left]!;\n      this._array[left] = this._array[right]!;\n      this._array[right] = temp;\n      left++;\n      right--;\n    }\n  }\n\n  // ========================================================================\n  // Views\n  // ========================================================================\n\n  first(): T {\n    if (this.isEmpty) {\n      throw new Error(\"List is empty\");\n    }\n    return this._array[0]!;\n  }\n\n  last(): T {\n    if (this.isEmpty) {\n      throw new Error(\"List is empty\");\n    }\n    return this._array[this._size - 1]!;\n  }\n\n  subList(fromIndex: number, toIndex: number): List<T> {\n    this.checkRange(fromIndex, toIndex);\n    // For now, return a copy. Later we can implement a view.\n    const sub = new ArrayList<T>({ eq: this._eq });\n    for (let i = fromIndex; i < toIndex; i++) {\n      sub.add(this._array[i]!);\n    }\n    return sub;\n  }\n\n  // ========================================================================\n  // Iteration\n  // ========================================================================\n\n  *[Symbol.iterator](): Iterator<T> {\n    for (let i = 0; i < this._size; i++) {\n      yield this._array[i]!;\n    }\n  }\n\n  forEach(action: (element: T, index: number) => void): void {\n    for (let i = 0; i < this._size; i++) {\n      action(this._array[i]!, i);\n    }\n  }\n\n  toArray(): T[] {\n    return this._array.slice(0, this._size);\n  }\n\n  // ========================================================================\n  // Capacity management\n  // ========================================================================\n\n  /**\n   * This method makes sure that the capacity is at least the specified minimum.\n   */\n  ensureCapacity(minCapacity: number): void {\n    if (minCapacity <= this._array.length) return;\n\n    // Grow by 1.5x or to minCapacity, whichever is larger\n    const newCapacity = Math.max(\n      minCapacity,\n      Math.floor(this._array.length * 1.5) + 1\n    );\n\n    const newArray = new Array(newCapacity);\n    for (let i = 0; i < this._size; i++) {\n      newArray[i] = this._array[i];\n    }\n    this._array = newArray;\n  }\n\n  /**\n   * This method trims the capacity to the current size to minimize memory usage.\n   */\n  trimToSize(): void {\n    if (this._size < this._array.length) {\n      this._array = this._array.slice(0, this._size);\n    }\n  }\n\n  // ========================================================================\n  // Private helpers\n  // ========================================================================\n\n  private checkIndex(index: number): void {\n    if (index < 0 || index >= this._size) {\n      throw new RangeError(\n        `Index ${index} out of bounds for size ${this._size}`\n      );\n    }\n  }\n\n  private checkInsertIndex(index: number): void {\n    if (index < 0 || index > this._size) {\n      throw new RangeError(\n        `Index ${index} out of bounds for insert (size ${this._size})`\n      );\n    }\n  }\n\n  private checkRange(fromIndex: number, toIndex: number): void {\n    if (fromIndex < 0 || toIndex > this._size || fromIndex > toIndex) {\n      throw new RangeError(\n        `Invalid range [${fromIndex}, ${toIndex}) for size ${this._size}`\n      );\n    }\n  }\n}\n\n/**\n * Factory function to make an ArrayList.\n *\n * @example\n * const list = arrayList<number>()\n * const listWithEq = arrayList<User>({ eq: (a, b) => a.id === b.id })\n * const listFromArray = arrayList([1, 2, 3])\n */\nexport function arrayList<T>(\n  optionsOrElements?: ArrayListOptions<T> | Iterable<T>\n): ArrayList<T> {\n  // Check if it's an iterable (not options)\n  if (optionsOrElements && Symbol.iterator in optionsOrElements) {\n    const list = new ArrayList<T>();\n    list.addAll(optionsOrElements as Iterable<T>);\n    return list;\n  }\n\n  const list = new ArrayList<T>(optionsOrElements as ArrayListOptions<T>);\n  return list;\n}\n","/**\n * ArrayDeque implementation - A ring buffer backed double-ended queue.\n *\n * This module gives O(1) insertion and removal at both ends.\n * More efficient than ArrayList for queue/stack operations.\n * Mirrors java.util.ArrayDeque.\n *\n * @example\n * const deque = arrayDeque<number>()\n * deque.addFirst(1)\n * deque.addLast(2)\n * deque.removeFirst() // 1\n */\n\nimport type { Deque } from \"../interfaces/queue.js\";\nimport type { Eq } from \"../core/traits.js\";\nimport { defaultEq } from \"../utils/defaults.js\";\n\n/**\n * Options for making an ArrayDeque.\n */\nexport interface ArrayDequeOptions<T> {\n  /**\n   * Initial capacity of the underlying array.\n   * This value must be a power of 2 for efficient modulo operations.\n   * @default 16\n   */\n  initialCapacity?: number;\n\n  /**\n   * Equality function for comparing elements.\n   * @default defaultEq (===)\n   */\n  eq?: Eq<T>;\n}\n\n/**\n * ArrayDeque<T> - Ring buffer implementation of Deque.\n *\n * This class uses a circular array to give O(1) operations at both ends.\n * The array grows automatically when full.\n *\n * Not thread-safe. Use synchronized() behavior for concurrent access.\n */\nexport class ArrayDeque<T> implements Deque<T> {\n  private _elements: (T | undefined)[];\n  private _head: number; // Index of first element\n  private _tail: number; // Index where next element will be added\n  private readonly _eq: Eq<T>;\n\n  constructor(options: ArrayDequeOptions<T> = {}) {\n    const { initialCapacity = 16, eq = defaultEq } = options;\n    // Ensure capacity is a power of 2 for efficient modulo using bitwise AND\n    const capacity = this.nextPowerOfTwo(Math.max(8, initialCapacity));\n    this._elements = new Array(capacity);\n    this._head = 0;\n    this._tail = 0;\n    this._eq = eq;\n  }\n\n  // ========================================================================\n  // Size\n  // ========================================================================\n\n  get size(): number {\n    // Handle wraparound: (tail - head) & mask\n    return (this._tail - this._head) & (this._elements.length - 1);\n  }\n\n  get isEmpty(): boolean {\n    return this._head === this._tail;\n  }\n\n  get eq(): Eq<T> {\n    return this._eq;\n  }\n\n  // ========================================================================\n  // Front operations (head)\n  // ========================================================================\n\n  addFirst(element: T): void {\n    this._head = (this._head - 1) & (this._elements.length - 1);\n    this._elements[this._head] = element;\n    if (this._head === this._tail) {\n      this.grow();\n    }\n  }\n\n  offerFirst(element: T): boolean {\n    this.addFirst(element);\n    return true;\n  }\n\n  removeFirst(): T {\n    if (this.isEmpty) {\n      throw new Error(\"Deque is empty\");\n    }\n    return this.pollFirst()!;\n  }\n\n  pollFirst(): T | undefined {\n    if (this.isEmpty) {\n      return undefined;\n    }\n    const element = this._elements[this._head];\n    this._elements[this._head] = undefined;\n    this._head = (this._head + 1) & (this._elements.length - 1);\n    return element;\n  }\n\n  peekFirst(): T {\n    if (this.isEmpty) {\n      throw new Error(\"Deque is empty\");\n    }\n    return this._elements[this._head]!;\n  }\n\n  peekFirstOrUndefined(): T | undefined {\n    return this.isEmpty ? undefined : this._elements[this._head];\n  }\n\n  // ========================================================================\n  // Back operations (tail)\n  // ========================================================================\n\n  addLast(element: T): void {\n    this._elements[this._tail] = element;\n    this._tail = (this._tail + 1) & (this._elements.length - 1);\n    if (this._tail === this._head) {\n      this.grow();\n    }\n  }\n\n  offerLast(element: T): boolean {\n    this.addLast(element);\n    return true;\n  }\n\n  removeLast(): T {\n    if (this.isEmpty) {\n      throw new Error(\"Deque is empty\");\n    }\n    return this.pollLast()!;\n  }\n\n  pollLast(): T | undefined {\n    if (this.isEmpty) {\n      return undefined;\n    }\n    this._tail = (this._tail - 1) & (this._elements.length - 1);\n    const element = this._elements[this._tail];\n    this._elements[this._tail] = undefined;\n    return element;\n  }\n\n  peekLast(): T {\n    if (this.isEmpty) {\n      throw new Error(\"Deque is empty\");\n    }\n    const lastIndex = (this._tail - 1) & (this._elements.length - 1);\n    return this._elements[lastIndex]!;\n  }\n\n  peekLastOrUndefined(): T | undefined {\n    if (this.isEmpty) {\n      return undefined;\n    }\n    const lastIndex = (this._tail - 1) & (this._elements.length - 1);\n    return this._elements[lastIndex];\n  }\n\n  // ========================================================================\n  // Stack operations (LIFO at the end, as on a JavaScript array)\n  // ========================================================================\n\n  // push and pop work at the end, and shift/unshift at the front, in every collection of this\n  // package. Before, they worked at the front here (the Java Deque rule), so a LinkedList used\n  // as a List reversed the pushed elements (ARCHITECTURE-PROPOSALS P8).\n  push(element: T): void {\n    this.addLast(element);\n  }\n\n  pop(): T {\n    return this.removeLast();\n  }\n\n  // ========================================================================\n  // Queue operations (FIFO - add last, remove first)\n  // ========================================================================\n\n  offer(element: T): boolean {\n    return this.offerLast(element);\n  }\n\n  poll(): T {\n    return this.removeFirst();\n  }\n\n  peek(): T {\n    return this.peekFirst();\n  }\n\n  peekOrUndefined(): T | undefined {\n    return this.peekFirstOrUndefined();\n  }\n\n  pollOrUndefined(): T | undefined {\n    return this.pollFirst();\n  }\n\n  enqueue(element: T): boolean {\n    return this.offer(element);\n  }\n\n  dequeue(): T {\n    return this.poll();\n  }\n\n  // ========================================================================\n  // Collection operations\n  // ========================================================================\n\n  add(element: T): boolean {\n    this.addLast(element);\n    return true;\n  }\n\n  addAll(other: Iterable<T>): boolean {\n    let modified = false;\n    for (const element of other) {\n      this.addLast(element);\n      modified = true;\n    }\n    return modified;\n  }\n\n  contains(element: T): boolean {\n    for (const item of this) {\n      if (this._eq(item, element)) {\n        return true;\n      }\n    }\n    return false;\n  }\n\n  containsAll(other: Iterable<T>): boolean {\n    for (const element of other) {\n      if (!this.contains(element)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  remove(element: T): boolean {\n    // Linear search for the first occurrence\n    const mask = this._elements.length - 1;\n    const size = this.size;\n    for (let offset = 0; offset < size; offset++) {\n      if (this._eq(this._elements[(this._head + offset) & mask]!, element)) {\n        this.removeAtOffset(offset);\n        return true;\n      }\n    }\n    return false;\n  }\n\n  /**\n   * This method removes the element at a position from the head. The shorter side moves one place.\n   * (Before, a bitwise expression chose the side, and it was not a valid test.)\n   */\n  private removeAtOffset(offset: number): void {\n    const mask = this._elements.length - 1;\n    const size = this.size;\n    if (offset < size / 2) {\n      // Move the elements before it one place toward the tail\n      for (let i = offset; i > 0; i--) {\n        this._elements[(this._head + i) & mask] = this._elements[(this._head + i - 1) & mask];\n      }\n      this._elements[this._head] = undefined;\n      this._head = (this._head + 1) & mask;\n    } else {\n      // Move the elements after it one place toward the head\n      for (let i = offset; i < size - 1; i++) {\n        this._elements[(this._head + i) & mask] = this._elements[(this._head + i + 1) & mask];\n      }\n      this._tail = (this._tail - 1) & mask;\n      this._elements[this._tail] = undefined;\n    }\n  }\n\n\n  removeAll(other: Iterable<T>): boolean {\n    const toRemove = new Set<T>();\n    for (const element of other) {\n      toRemove.add(element);\n    }\n\n    let modified = false;\n    for (const element of toRemove) {\n      while (this.remove(element)) {\n        modified = true;\n      }\n    }\n    return modified;\n  }\n\n  retainAll(other: Iterable<T>): boolean {\n    const toRetain = new Set(other);\n    const newDeque = new ArrayDeque<T>({ eq: this._eq });\n\n    for (const element of this) {\n      let shouldRetain = false;\n      for (const retainElement of toRetain) {\n        if (this._eq(element, retainElement)) {\n          shouldRetain = true;\n          break;\n        }\n      }\n      if (shouldRetain) {\n        newDeque.addLast(element);\n      }\n    }\n\n    const modified = newDeque.size !== this.size;\n    this._elements = newDeque._elements;\n    this._head = newDeque._head;\n    this._tail = newDeque._tail;\n\n    return modified;\n  }\n\n  clear(): void {\n    // Clear all elements for GC\n    let index = this._head;\n    while (index !== this._tail) {\n      this._elements[index] = undefined;\n      index = (index + 1) & (this._elements.length - 1);\n    }\n    this._head = 0;\n    this._tail = 0;\n  }\n\n  // ========================================================================\n  // Iteration\n  // ========================================================================\n\n  *[Symbol.iterator](): Iterator<T> {\n    let index = this._head;\n    while (index !== this._tail) {\n      yield this._elements[index]!;\n      index = (index + 1) & (this._elements.length - 1);\n    }\n  }\n\n  forEach(action: (element: T, index: number) => void): void {\n    let arrayIndex = this._head;\n    let logicalIndex = 0;\n    while (arrayIndex !== this._tail) {\n      action(this._elements[arrayIndex]!, logicalIndex);\n      arrayIndex = (arrayIndex + 1) & (this._elements.length - 1);\n      logicalIndex++;\n    }\n  }\n\n  toArray(): T[] {\n    const result: T[] = [];\n    for (const element of this) {\n      result.push(element);\n    }\n    return result;\n  }\n\n  // ========================================================================\n  // Capacity management\n  // ========================================================================\n\n  /**\n   * This method doubles the capacity of the deque.\n   */\n  private grow(): void {\n    const oldCapacity = this._elements.length;\n    const newCapacity = oldCapacity << 1; // Double capacity\n\n    if (newCapacity < 0) {\n      throw new Error(\"Deque too large\");\n    }\n\n    const newElements = new Array(newCapacity);\n\n    // Copy elements from head to end of old array\n    const rightSize = oldCapacity - this._head;\n    for (let i = 0; i < rightSize; i++) {\n      newElements[i] = this._elements[this._head + i];\n    }\n\n    // Copy wrapped elements from start of old array\n    const leftSize = this._head;\n    for (let i = 0; i < leftSize; i++) {\n      newElements[rightSize + i] = this._elements[i];\n    }\n\n    // grow() runs when the array is full: head === tail and every slot holds an element. Then\n    // `size` computes 0, so the old `this._tail = size` lost every element (BUGS-2026-07 C8).\n    this._elements = newElements;\n    this._head = 0;\n    this._tail = oldCapacity;\n  }\n\n  /**\n   * This method gives the next power of 2 >= n.\n   */\n  private nextPowerOfTwo(n: number): number {\n    if (n <= 0) return 1;\n    n--;\n    n |= n >> 1;\n    n |= n >> 2;\n    n |= n >> 4;\n    n |= n >> 8;\n    n |= n >> 16;\n    return n + 1;\n  }\n\n  // ========================================================================\n  // Inspection\n  // ========================================================================\n\n  /**\n   * This value is the current capacity of the underlying array.\n   */\n  get capacity(): number {\n    return this._elements.length;\n  }\n\n  /**\n   * This method gives a string representation for debugging.\n   */\n  toString(): string {\n    return `ArrayDeque[${this.toArray().join(\", \")}]`;\n  }\n}\n\n/**\n * Factory function to make an ArrayDeque.\n *\n * @example\n * const deque = arrayDeque<number>()\n * const dequeFromArray = arrayDeque([1, 2, 3])\n * const dequeWithOptions = arrayDeque<string>({ initialCapacity: 32 })\n */\nexport function arrayDeque<T>(\n  optionsOrElements?: ArrayDequeOptions<T> | Iterable<T>\n): ArrayDeque<T> {\n  // Check if it's an iterable (not options)\n  if (optionsOrElements && Symbol.iterator in optionsOrElements) {\n    const deque = new ArrayDeque<T>();\n    deque.addAll(optionsOrElements as Iterable<T>);\n    return deque;\n  }\n\n  return new ArrayDeque<T>(optionsOrElements as ArrayDequeOptions<T>);\n}\n","/**\n * HashMap implementation - A hash table with custom equality and hashing.\n *\n * This module gives O(1) average case lookup, insertion, and deletion.\n * This module supports custom equality and hash functions for keys.\n * Mirrors java.util.HashMap.\n *\n * @example\n * const map = hashMap<string, number>()\n * map.set('one', 1)\n * map.set('two', 2)\n * console.log(map.get('one')) // 1\n *\n * // Custom equality for object keys\n * const userMap = hashMap<User, Data>({\n *   keyEq: (a, b) => a.id === b.id,\n *   keyHash: (u) => hashString(u.id)\n * })\n */\n\nimport type { MapLike, Entry } from \"../interfaces/map.js\";\nimport type { Eq, Hash } from \"../core/traits.js\";\nimport { defaultEq, defaultHash } from \"../utils/defaults.js\";\n\n/**\n * Internal entry node for hash buckets.\n */\ninterface Node<K, V> {\n  key: K;\n  value: V;\n  hash: number;\n  next: Node<K, V> | null;\n}\n\n/**\n * Options for making a HashMap.\n */\nexport interface HashMapOptions<K, V> {\n  /**\n   * Initial capacity (number of buckets).\n   * This value must be a power of 2.\n   * @default 16\n   */\n  initialCapacity?: number;\n\n  /**\n   * Load factor threshold for resizing (0-1).\n   * When size > capacity * loadFactor, the map resizes.\n   * @default 0.75\n   */\n  loadFactor?: number;\n\n  /**\n   * Equality function for keys.\n   * @default defaultEq (===)\n   */\n  keyEq?: Eq<K>;\n\n  /**\n   * Hash function for keys.\n   * @default defaultHash\n   */\n  keyHash?: Hash<K>;\n\n  /**\n   * Equality function for values (used in containsValue).\n   * @default defaultEq (===)\n   */\n  valueEq?: Eq<V>;\n}\n\n/**\n * HashMap<K, V> - Hash table implementation with custom equality/hashing.\n *\n * This class uses separate chaining for collision resolution.\n * Automatically resizes when load factor is exceeded.\n *\n * Not thread-safe. Use synchronized() behavior for concurrent access.\n */\nexport class HashMap<K, V> implements MapLike<K, V> {\n  private _buckets: (Node<K, V> | null)[];\n  private _size: number;\n  private readonly _loadFactor: number;\n  private readonly _keyEq: Eq<K>;\n  private readonly _keyHash: Hash<K>;\n  private readonly _valueEq: Eq<V>;\n  private _threshold: number;\n  /**\n   * The count of structural changes (a key added or removed, a clear, a resize). An iterator\n   * records it at its start and throws when it changes. Before, a resize during iteration made\n   * the iterator skip or repeat entries (BUGS-2026-07 L15).\n   */\n  private _modCount = 0;\n\n  constructor(options: HashMapOptions<K, V> = {}) {\n    const {\n      initialCapacity = 16,\n      loadFactor = 0.75,\n      keyEq = defaultEq,\n      keyHash = defaultHash,\n      valueEq = defaultEq,\n    } = options;\n\n    const capacity = this.nextPowerOfTwo(Math.max(4, initialCapacity));\n    this._buckets = new Array(capacity).fill(null);\n    this._size = 0;\n    this._loadFactor = loadFactor;\n    this._keyEq = keyEq;\n    this._keyHash = keyHash;\n    this._valueEq = valueEq;\n    this._threshold = Math.floor(capacity * loadFactor);\n  }\n\n  // ========================================================================\n  // Size\n  // ========================================================================\n\n  get size(): number {\n    return this._size;\n  }\n\n  get isEmpty(): boolean {\n    return this._size === 0;\n  }\n\n  get keyEq(): Eq<K> {\n    return this._keyEq;\n  }\n\n  get valueEq(): Eq<V> {\n    return this._valueEq;\n  }\n\n  // ========================================================================\n  // Lookup\n  // ========================================================================\n\n  has(key: K): boolean {\n    const hash = this._keyHash(key);\n    const index = this.bucketIndex(hash);\n    let node = this._buckets[index] ?? null;\n\n    while (node !== null) {\n      if (node.hash === hash && this._keyEq(node.key, key)) {\n        return true;\n      }\n      node = node.next;\n    }\n\n    return false;\n  }\n\n  get(key: K): V {\n    const value = this.getOrUndefined(key);\n    if (value === undefined) {\n      throw new Error(`Key not found: ${key}`);\n    }\n    return value;\n  }\n\n  getOrUndefined(key: K): V | undefined {\n    const hash = this._keyHash(key);\n    const index = this.bucketIndex(hash);\n    let node = this._buckets[index] ?? null;\n\n    while (node !== null) {\n      if (node.hash === hash && this._keyEq(node.key, key)) {\n        return node.value;\n      }\n      node = node.next;\n    }\n\n    return undefined;\n  }\n\n  getOrDefault(key: K, defaultValue: V): V {\n    const value = this.getOrUndefined(key);\n    return value !== undefined ? value : defaultValue;\n  }\n\n  containsValue(value: V): boolean {\n    for (const bucket of this._buckets) {\n      let node = bucket;\n      while (node !== null) {\n        if (this._valueEq(node.value, value)) {\n          return true;\n        }\n        node = node.next;\n      }\n    }\n    return false;\n  }\n\n  // ========================================================================\n  // Modification\n  // ========================================================================\n\n  set(key: K, value: V): V | undefined {\n    const hash = this._keyHash(key);\n    const index = this.bucketIndex(hash);\n    let node = this._buckets[index] ?? null;\n\n    // Check if key already exists\n    while (node !== null) {\n      if (node.hash === hash && this._keyEq(node.key, key)) {\n        const oldValue = node.value;\n        node.value = value;\n        return oldValue;\n      }\n      node = node.next;\n    }\n\n    // Key doesn't exist, add new entry\n    const newNode: Node<K, V> = {\n      key,\n      value,\n      hash,\n      next: this._buckets[index] ?? null,\n    };\n    this._buckets[index] = newNode;\n    this._size++;\n    this._modCount++;\n\n    // Check if resize is needed\n    if (this._size > this._threshold) {\n      this.resize();\n    }\n\n    return undefined;\n  }\n\n  setIfAbsent(key: K, value: V): V {\n    const existing = this.getOrUndefined(key);\n    if (existing !== undefined) {\n      return existing;\n    }\n    this.set(key, value);\n    return value;\n  }\n\n  delete(key: K): V | undefined {\n    const hash = this._keyHash(key);\n    const index = this.bucketIndex(hash);\n    let node = this._buckets[index] ?? null;\n    let prev: Node<K, V> | null = null;\n\n    while (node !== null) {\n      if (node.hash === hash && this._keyEq(node.key, key)) {\n        // Found the node to delete\n        if (prev === null) {\n          // Node is at head of bucket\n          this._buckets[index] = node.next;\n        } else {\n          // Node is in middle or end\n          prev.next = node.next;\n        }\n        this._size--;\n        this._modCount++;\n        return node.value;\n      }\n      prev = node;\n      node = node.next;\n    }\n\n    return undefined;\n  }\n\n  deleteEntry(key: K, value: V): boolean {\n    const hash = this._keyHash(key);\n    const index = this.bucketIndex(hash);\n    let node = this._buckets[index] ?? null;\n    let prev: Node<K, V> | null = null;\n\n    while (node !== null) {\n      if (\n        node.hash === hash &&\n        this._keyEq(node.key, key) &&\n        this._valueEq(node.value, value)\n      ) {\n        // Found the entry to delete\n        if (prev === null) {\n          this._buckets[index] = node.next;\n        } else {\n          prev.next = node.next;\n        }\n        this._size--;\n        this._modCount++;\n        return true;\n      }\n      prev = node;\n      node = node.next;\n    }\n\n    return false;\n  }\n\n  replace(key: K, value: V): V | undefined {\n    const hash = this._keyHash(key);\n    const index = this.bucketIndex(hash);\n    let node = this._buckets[index] ?? null;\n\n    while (node !== null) {\n      if (node.hash === hash && this._keyEq(node.key, key)) {\n        const oldValue = node.value;\n        node.value = value;\n        return oldValue;\n      }\n      node = node.next;\n    }\n\n    return undefined;\n  }\n\n  replaceEntry(key: K, oldValue: V, newValue: V): boolean {\n    const hash = this._keyHash(key);\n    const index = this.bucketIndex(hash);\n    let node = this._buckets[index] ?? null;\n\n    while (node !== null) {\n      if (\n        node.hash === hash &&\n        this._keyEq(node.key, key) &&\n        this._valueEq(node.value, oldValue)\n      ) {\n        node.value = newValue;\n        return true;\n      }\n      node = node.next;\n    }\n\n    return false;\n  }\n\n  // ========================================================================\n  // Compute operations\n  // ========================================================================\n\n  computeIfAbsent(key: K, mappingFunction: (key: K) => V): V {\n    const existing = this.getOrUndefined(key);\n    if (existing !== undefined) {\n      return existing;\n    }\n\n    const newValue = mappingFunction(key);\n    this.set(key, newValue);\n    return newValue;\n  }\n\n  computeIfPresent(\n    key: K,\n    remappingFunction: (key: K, value: V) => V | undefined\n  ): V | undefined {\n    const existing = this.getOrUndefined(key);\n    if (existing === undefined) {\n      return undefined;\n    }\n\n    const newValue = remappingFunction(key, existing);\n    if (newValue === undefined) {\n      this.delete(key);\n      return undefined;\n    }\n\n    this.set(key, newValue);\n    return newValue;\n  }\n\n  compute(\n    key: K,\n    remappingFunction: (key: K, value: V | undefined) => V | undefined\n  ): V | undefined {\n    const existing = this.getOrUndefined(key);\n    const newValue = remappingFunction(key, existing);\n\n    if (newValue === undefined) {\n      if (existing !== undefined) {\n        this.delete(key);\n      }\n      return undefined;\n    }\n\n    this.set(key, newValue);\n    return newValue;\n  }\n\n  merge(\n    key: K,\n    value: V,\n    remappingFunction: (oldValue: V, newValue: V) => V | undefined\n  ): V | undefined {\n    const existing = this.getOrUndefined(key);\n\n    if (existing === undefined) {\n      this.set(key, value);\n      return value;\n    }\n\n    const merged = remappingFunction(existing, value);\n    if (merged === undefined) {\n      this.delete(key);\n      return undefined;\n    }\n\n    this.set(key, merged);\n    return merged;\n  }\n\n  // ========================================================================\n  // Bulk operations\n  // ========================================================================\n\n  putAll(other: MapLike<K, V> | Iterable<Entry<K, V>>): void {\n    for (const entry of other) {\n      this.set(entry.key, entry.value);\n    }\n  }\n\n  clear(): void {\n    this._buckets.fill(null);\n    this._size = 0;\n    this._modCount++;\n  }\n\n  // ========================================================================\n  // Views\n  // ========================================================================\n\n  *keys(): IterableIterator<K> {\n    const expected = this._modCount;\n    for (const bucket of this._buckets) {\n      let node = bucket;\n      while (node !== null) {\n        yield node.key;\n        this.checkUnchanged(expected);\n        node = node.next;\n      }\n    }\n  }\n\n  *values(): IterableIterator<V> {\n    const expected = this._modCount;\n    for (const bucket of this._buckets) {\n      let node = bucket;\n      while (node !== null) {\n        yield node.value;\n        this.checkUnchanged(expected);\n        node = node.next;\n      }\n    }\n  }\n\n  *entries(): IterableIterator<Entry<K, V>> {\n    const expected = this._modCount;\n    for (const bucket of this._buckets) {\n      let node = bucket;\n      while (node !== null) {\n        yield { key: node.key, value: node.value };\n        this.checkUnchanged(expected);\n        node = node.next;\n      }\n    }\n  }\n\n  // ========================================================================\n  // Iteration\n  // ========================================================================\n\n  *[Symbol.iterator](): Iterator<Entry<K, V>> {\n    yield* this.entries();\n  }\n\n  forEach(action: (value: V, key: K, map: this) => void): void {\n    for (const entry of this.entries()) {\n      action(entry.value, entry.key, this);\n    }\n  }\n\n  // ========================================================================\n  // Internal helpers\n  // ========================================================================\n\n  /** This method throws when the map changed structurally after an iterator started. */\n  private checkUnchanged(expected: number): void {\n    if (this._modCount !== expected) {\n      throw new Error(\"HashMap changed during iteration\");\n    }\n  }\n\n  /**\n   * This method gives the bucket index for a given hash.\n   */\n  private bucketIndex(hash: number): number {\n    // Use bitwise AND with (length - 1) for efficient modulo\n    // This works because length is always a power of 2\n    return hash & (this._buckets.length - 1);\n  }\n\n  /**\n   * This method resizes the hash table to double its current capacity.\n   */\n  private resize(): void {\n    const oldBuckets = this._buckets;\n    const newCapacity = oldBuckets.length << 1; // Double capacity\n\n    if (newCapacity < 0) {\n      throw new Error(\"Map too large\");\n    }\n\n    this._buckets = new Array(newCapacity).fill(null);\n    this._threshold = Math.floor(newCapacity * this._loadFactor);\n    this._modCount++;\n\n    // Rehash all entries\n    for (const bucket of oldBuckets) {\n      let node = bucket;\n      while (node !== null) {\n        const next = node.next;\n        const index = this.bucketIndex(node.hash);\n        node.next = this._buckets[index] ?? null;\n        this._buckets[index] = node;\n        node = next;\n      }\n    }\n  }\n\n  /**\n   * This method gives the next power of 2 >= n.\n   */\n  private nextPowerOfTwo(n: number): number {\n    if (n <= 0) return 1;\n    n--;\n    n |= n >> 1;\n    n |= n >> 2;\n    n |= n >> 4;\n    n |= n >> 8;\n    n |= n >> 16;\n    return n + 1;\n  }\n\n  // ========================================================================\n  // Inspection\n  // ========================================================================\n\n  /**\n   * This value is the current number of buckets.\n   */\n  get capacity(): number {\n    return this._buckets.length;\n  }\n\n  /**\n   * This value is the current load factor (size / capacity).\n   */\n  get loadFactor(): number {\n    return this._size / this._buckets.length;\n  }\n\n  /**\n   * This method gives statistics about bucket distribution (for debugging).\n   */\n  getStats(): {\n    size: number;\n    capacity: number;\n    loadFactor: number;\n    avgChainLength: number;\n    maxChainLength: number;\n    emptyBuckets: number;\n  } {\n    let maxChainLength = 0;\n    let totalChainLength = 0;\n    let emptyBuckets = 0;\n\n    for (const bucket of this._buckets) {\n      if (bucket === null) {\n        emptyBuckets++;\n      } else {\n        let length = 0;\n        let node: Node<K, V> | null = bucket;\n        while (node !== null) {\n          length++;\n          node = node.next;\n        }\n        totalChainLength += length;\n        maxChainLength = Math.max(maxChainLength, length);\n      }\n    }\n\n    return {\n      size: this._size,\n      capacity: this._buckets.length,\n      loadFactor: this.loadFactor,\n      avgChainLength: this._size > 0 ? totalChainLength / (this._buckets.length - emptyBuckets) : 0,\n      maxChainLength,\n      emptyBuckets,\n    };\n  }\n}\n\n/**\n * Factory function to make a HashMap.\n *\n * @example\n * const map = hashMap<string, number>()\n * const mapWithOptions = hashMap<User, Data>({\n *   keyEq: (a, b) => a.id === b.id,\n *   keyHash: (u) => hashString(u.id)\n * })\n * const mapFromEntries = hashMap([['a', 1], ['b', 2]])\n */\nexport function hashMap<K, V>(\n  optionsOrEntries?: HashMapOptions<K, V> | Iterable<readonly [K, V]>\n): HashMap<K, V> {\n  // Check if it's an iterable of entries\n  if (optionsOrEntries && Symbol.iterator in optionsOrEntries) {\n    const map = new HashMap<K, V>();\n    for (const [key, value] of optionsOrEntries as Iterable<readonly [K, V]>) {\n      map.set(key, value);\n    }\n    return map;\n  }\n\n  return new HashMap<K, V>(optionsOrEntries as HashMapOptions<K, V>);\n}\n","/**\n * LinkedHashMap - HashMap that maintains insertion order.\n *\n * This module combines a hash table with a doubly-linked list to maintain predictable\n * iteration order. Mirrors java.util.LinkedHashMap.\n *\n * Key features:\n * - O(1) access, insert, delete (like HashMap)\n * - Predictable iteration order (insertion order or access order)\n * - Perfect for LRU caches when accessOrder is true\n *\n * @example\n * const map = linkedHashMap<string, number>()\n * map.set('a', 1)\n * map.set('b', 2)\n * map.set('c', 3)\n * // Iteration order: a, b, c (insertion order)\n *\n * @example\n * // LRU cache with access order\n * const lru = linkedHashMap<string, number>({ accessOrder: true })\n * lru.set('a', 1)\n * lru.set('b', 2)\n * lru.get('a') // Moves 'a' to end\n * // Iteration order: b, a (access order)\n */\n\nimport type { MapLike, Entry } from \"../interfaces/map.js\";\nimport type { Eq, Hash } from \"../core/traits.js\";\nimport { defaultEq, defaultHash } from \"../utils/defaults.js\";\n\n/**\n * An entry. It is in two lists: the chain of its hash bucket (`next`) and the order list\n * (`before`, `after`). Before, one `next` field served both lists, so the first collision or\n * resize corrupted the map (BUGS-2026-07 C10).\n */\ninterface LinkedNode<K, V> {\n  key: K;\n  value: V;\n  hash: number;\n  /** The next entry of the same hash bucket */\n  next: LinkedNode<K, V> | null;\n  /** The entry before this one in the iteration order */\n  before: LinkedNode<K, V> | null;\n  /** The entry after this one in the iteration order */\n  after: LinkedNode<K, V> | null;\n}\n\n/**\n * Options for making a LinkedHashMap.\n */\nexport interface LinkedHashMapOptions<K, V> {\n  /**\n   * Initial capacity of the hash table.\n   * @default 16\n   */\n  initialCapacity?: number;\n\n  /**\n   * Load factor before resizing.\n   * @default 0.75\n   */\n  loadFactor?: number;\n\n  /**\n   * Equality function for keys.\n   * @default defaultEq\n   */\n  eq?: Eq<K>;\n\n  /**\n   * Hash function for keys.\n   * @default defaultHash\n   */\n  hash?: Hash<K>;\n\n  /**\n   * Equality function for values.\n   * @default defaultEq\n   */\n  valueEq?: Eq<V>;\n\n  /**\n   * If true, maintain access order instead of insertion order.\n   * Useful for LRU caches.\n   * @default false\n   */\n  accessOrder?: boolean;\n}\n\n/**\n * LinkedHashMap<K, V> - Hash map with predictable iteration order.\n *\n * This class maintains a doubly-linked list of entries to preserve insertion order\n * (or access order if accessOrder is true).\n */\nexport class LinkedHashMap<K, V> implements MapLike<K, V> {\n  private _buckets: (LinkedNode<K, V> | null)[];\n  private _size: number = 0;\n  private readonly _loadFactor: number;\n  private readonly _eq: Eq<K>;\n  private readonly _hash: Hash<K>;\n  private readonly _valueEq: Eq<V>;\n  private readonly _accessOrder: boolean;\n\n  // Doubly-linked list sentinels\n  private _head: LinkedNode<K, V> | null = null;\n  private _tail: LinkedNode<K, V> | null = null;\n\n  constructor(options: LinkedHashMapOptions<K, V> = {}) {\n    const {\n      initialCapacity = 16,\n      loadFactor = 0.75,\n      eq = defaultEq,\n      hash = defaultHash,\n      valueEq = defaultEq,\n      accessOrder = false,\n    } = options;\n\n    this._buckets = new Array(Math.max(1, initialCapacity)).fill(null);\n    this._loadFactor = loadFactor;\n    this._eq = eq;\n    this._hash = hash;\n    this._valueEq = valueEq;\n    this._accessOrder = accessOrder;\n  }\n\n  // ========================================================================\n  // Size and state\n  // ========================================================================\n\n  get size(): number {\n    return this._size;\n  }\n\n  get isEmpty(): boolean {\n    return this._size === 0;\n  }\n\n  get eq(): Eq<K> {\n    return this._eq;\n  }\n\n  get keyEq(): Eq<K> {\n    return this._eq;\n  }\n\n  get valueEq(): Eq<V> {\n    return this._valueEq;\n  }\n\n  get hash(): Hash<K> {\n    return this._hash;\n  }\n\n  // ========================================================================\n  // Lookup operations\n  // ========================================================================\n\n  has(key: K): boolean {\n    return this.getNode(key) !== null;\n  }\n\n  containsKey(key: K): boolean {\n    return this.has(key);\n  }\n\n  containsValue(value: V): boolean {\n    let node = this._head;\n    while (node !== null) {\n      if (this._valueEq(node.value, value)) {\n        return true;\n      }\n      node = node.after;\n    }\n    return false;\n  }\n\n  get(key: K): V {\n    const node = this.getNode(key);\n    if (node === null) {\n      throw new Error(\"Key not found\");\n    }\n    if (this._accessOrder) {\n      this.moveToEnd(node);\n    }\n    return node.value;\n  }\n\n  getOrUndefined(key: K): V | undefined {\n    const node = this.getNode(key);\n    if (node === null) return undefined;\n    if (this._accessOrder) {\n      this.moveToEnd(node);\n    }\n    return node.value;\n  }\n\n  getOrDefault(key: K, defaultValue: V): V {\n    const node = this.getNode(key);\n    if (node === null) return defaultValue;\n    if (this._accessOrder) {\n      this.moveToEnd(node);\n    }\n    return node.value;\n  }\n\n  // ========================================================================\n  // Modification operations\n  // ========================================================================\n\n  set(key: K, value: V): V | undefined {\n    const hashCode = this._hash(key);\n    const index = this.getBucketIndex(hashCode);\n    let node = this._buckets[index] ?? null;\n\n    // Check if key already exists\n    while (node !== null) {\n      if (node.hash === hashCode && this._eq(node.key, key)) {\n        const oldValue = node.value;\n        node.value = value;\n        if (this._accessOrder) {\n          this.moveToEnd(node);\n        }\n        return oldValue;\n      }\n      node = node.next;\n    }\n\n    // Key doesn't exist, add new entry\n    const newNode: LinkedNode<K, V> = {\n      key,\n      value,\n      hash: hashCode,\n      next: this._buckets[index] ?? null,\n      before: null,\n      after: null,\n    };\n\n    this._buckets[index] = newNode;\n    this._size++;\n\n    // Add to linked list\n    this.addToEnd(newNode);\n\n    // Resize if needed\n    if (this._size > this._buckets.length * this._loadFactor) {\n      this.resize();\n    }\n\n    return undefined;\n  }\n\n  setIfAbsent(key: K, value: V): V {\n    const existing = this.getNode(key);\n    if (existing !== null) {\n      if (this._accessOrder) {\n        this.moveToEnd(existing);\n      }\n      return existing.value;\n    }\n    this.set(key, value);\n    return value;\n  }\n\n  replace(key: K, value: V): V | undefined {\n    const node = this.getNode(key);\n    if (node === null) return undefined;\n    const oldValue = node.value;\n    node.value = value;\n    if (this._accessOrder) {\n      this.moveToEnd(node);\n    }\n    return oldValue;\n  }\n\n  replaceEntry(key: K, oldValue: V, newValue: V): boolean {\n    const node = this.getNode(key);\n    if (node === null || !this._valueEq(node.value, oldValue)) {\n      return false;\n    }\n    node.value = newValue;\n    if (this._accessOrder) {\n      this.moveToEnd(node);\n    }\n    return true;\n  }\n\n  delete(key: K): V | undefined {\n    const node = this.getNode(key);\n    if (node === null) return undefined;\n\n    const oldValue = node.value;\n\n    // Remove from bucket\n    this.removeFromBucket(node);\n\n    // Remove from linked list\n    this.removeFromList(node);\n\n    this._size--;\n    return oldValue;\n  }\n\n  deleteEntry(key: K, value: V): boolean {\n    const node = this.getNode(key);\n    if (node === null || !this._valueEq(node.value, value)) {\n      return false;\n    }\n\n    // Remove from bucket\n    this.removeFromBucket(node);\n\n    // Remove from linked list\n    this.removeFromList(node);\n\n    this._size--;\n    return true;\n  }\n\n  clear(): void {\n    this._buckets = new Array(this._buckets.length).fill(null);\n    this._size = 0;\n    this._head = null;\n    this._tail = null;\n  }\n\n  // ========================================================================\n  // Bulk operations\n  // ========================================================================\n\n  putAll(other: MapLike<K, V> | Iterable<Entry<K, V>>): void {\n    if ('entries' in other && typeof other.entries === 'function') {\n      for (const entry of other.entries()) {\n        this.set(entry.key, entry.value);\n      }\n    } else {\n      for (const entry of other as Iterable<Entry<K, V>>) {\n        this.set(entry.key, entry.value);\n      }\n    }\n  }\n\n  // ========================================================================\n  // Computed operations\n  // ========================================================================\n\n  computeIfAbsent(key: K, mappingFunction: (key: K) => V): V {\n    const existing = this.getNode(key);\n    if (existing !== null) {\n      if (this._accessOrder) {\n        this.moveToEnd(existing);\n      }\n      return existing.value;\n    }\n    const value = mappingFunction(key);\n    this.set(key, value);\n    return value;\n  }\n\n  computeIfPresent(key: K, remappingFunction: (key: K, value: V) => V | undefined): V | undefined {\n    const existing = this.getNode(key);\n    if (existing === null) return undefined;\n\n    const newValue = remappingFunction(key, existing.value);\n    if (newValue === undefined) {\n      this.delete(key);\n      return undefined;\n    }\n    existing.value = newValue;\n    if (this._accessOrder) {\n      this.moveToEnd(existing);\n    }\n    return newValue;\n  }\n\n  compute(key: K, remappingFunction: (key: K, value: V | undefined) => V | undefined): V | undefined {\n    const existing = this.getNode(key);\n    const newValue = remappingFunction(key, existing?.value);\n\n    if (newValue === undefined) {\n      if (existing !== null) {\n        this.delete(key);\n      }\n      return undefined;\n    }\n\n    this.set(key, newValue);\n    return newValue;\n  }\n\n  merge(key: K, value: V, remappingFunction: (oldValue: V, newValue: V) => V | undefined): V | undefined {\n    const existing = this.getNode(key);\n\n    if (existing === null) {\n      this.set(key, value);\n      return value;\n    }\n\n    const merged = remappingFunction(existing.value, value);\n    if (merged === undefined) {\n      this.delete(key);\n      return undefined;\n    }\n\n    existing.value = merged;\n    if (this._accessOrder) {\n      this.moveToEnd(existing);\n    }\n    return merged;\n  }\n\n  // ========================================================================\n  // View operations\n  // ========================================================================\n\n  *keys(): IterableIterator<K> {\n    let node = this._head;\n    while (node !== null) {\n      yield node.key;\n      node = node.after;\n    }\n  }\n\n  *values(): IterableIterator<V> {\n    let node = this._head;\n    while (node !== null) {\n      yield node.value;\n      node = node.after;\n    }\n  }\n\n  *entries(): IterableIterator<Entry<K, V>> {\n    let node = this._head;\n    while (node !== null) {\n      yield { key: node.key, value: node.value };\n      node = node.after;\n    }\n  }\n\n  *[Symbol.iterator](): Iterator<Entry<K, V>> {\n    yield* this.entries();\n  }\n\n  forEach(action: (value: V, key: K, map: this) => void): void {\n    for (const entry of this.entries()) {\n      action(entry.value, entry.key, this);\n    }\n  }\n\n  toArray(): Entry<K, V>[] {\n    return Array.from(this.entries());\n  }\n\n  // ========================================================================\n  // Private helpers\n  // ========================================================================\n\n  private getNode(key: K): LinkedNode<K, V> | null {\n    const hashCode = this._hash(key);\n    const index = this.getBucketIndex(hashCode);\n    let node = this._buckets[index] ?? null;\n\n    while (node !== null) {\n      if (node.hash === hashCode && this._eq(node.key, key)) {\n        return node;\n      }\n      node = node.next;\n    }\n\n    return null;\n  }\n\n  private getBucketIndex(hashCode: number): number {\n    return Math.abs(hashCode) % this._buckets.length;\n  }\n\n  private removeFromBucket(node: LinkedNode<K, V>): void {\n    const index = this.getBucketIndex(node.hash);\n    let current = this._buckets[index] ?? null;\n    let prev: LinkedNode<K, V> | null = null;\n\n    while (current !== null) {\n      if (current === node) {\n        if (prev === null) {\n          this._buckets[index] = current.next;\n        } else {\n          prev.next = current.next;\n        }\n        return;\n      }\n      prev = current;\n      current = current.next;\n    }\n  }\n\n  private addToEnd(node: LinkedNode<K, V>): void {\n    node.before = this._tail;\n    node.after = null;\n    if (this._tail === null) this._head = node;\n    else this._tail.after = node;\n    this._tail = node;\n  }\n\n  private removeFromList(node: LinkedNode<K, V>): void {\n    if (node.before !== null) node.before.after = node.after;\n    else this._head = node.after;\n    if (node.after !== null) node.after.before = node.before;\n    else this._tail = node.before;\n    node.before = node.after = null;\n  }\n\n  private moveToEnd(node: LinkedNode<K, V>): void {\n    if (node === this._tail) return; // Already at end\n    this.removeFromList(node);\n    this.addToEnd(node);\n  }\n\n  private resize(): void {\n    this._buckets = new Array(this._buckets.length * 2).fill(null);\n    // Rebuild the bucket chains (`next`) from the order list (`after`)\n    for (let node = this._head; node !== null; node = node.after) {\n      const index = this.getBucketIndex(node.hash);\n      node.next = this._buckets[index] ?? null;\n      this._buckets[index] = node;\n    }\n  }\n\n  // ========================================================================\n  // Utility methods\n  // ========================================================================\n\n  toString(): string {\n    const entries = Array.from(this.entries())\n      .map(({ key, value }) => `${key}=${value}`)\n      .join(', ');\n    return `LinkedHashMap{${entries}}`;\n  }\n}\n\n/**\n * Factory function to make a LinkedHashMap.\n *\n * @example\n * const map = linkedHashMap<string, number>()\n * map.set('a', 1)\n * map.set('b', 2)\n *\n * @example\n * // With initial entries\n * const map = linkedHashMap<string, number>([\n *   ['a', 1],\n *   ['b', 2]\n * ])\n *\n * @example\n * // LRU cache with access order\n * const lru = linkedHashMap<string, number>({ accessOrder: true })\n */\nexport function linkedHashMap<K, V>(\n  optionsOrEntries?: LinkedHashMapOptions<K, V> | Iterable<[K, V]>\n): LinkedHashMap<K, V> {\n  if (optionsOrEntries && Symbol.iterator in optionsOrEntries) {\n    const map = new LinkedHashMap<K, V>();\n    for (const [key, value] of optionsOrEntries as Iterable<[K, V]>) {\n      map.set(key, value);\n    }\n    return map;\n  }\n\n  return new LinkedHashMap<K, V>(optionsOrEntries as LinkedHashMapOptions<K, V>);\n}\n","/**\n * TreeMap - Red-black tree based sorted map implementation.\n *\n * This module implements a self-balancing binary search tree that maintains keys in sorted\n * order. Mirrors java.util.TreeMap.\n *\n * Key features:\n * - O(log n) access, insert, delete\n * - Keys maintained in sorted order (natural or custom comparator)\n * - Navigation methods (floor, ceiling, lower, higher)\n * - Range view operations (subMap, headMap, tailMap)\n *\n * @example\n * const map = treeMap<string, number>()\n * map.set('c', 3)\n * map.set('a', 1)\n * map.set('b', 2)\n * // Iteration order: a, b, c (sorted)\n *\n * @example\n * // Custom comparator for descending order\n * const map = treeMap<number, string>({\n *   compare: (a, b) => b - a\n * })\n */\n\nimport type { NavigableMap, SortedMap, Entry } from \"../interfaces/map.js\";\nimport type { Eq, Compare } from \"../core/traits.js\";\nimport { defaultEq, defaultCompare } from \"../utils/defaults.js\";\n\n/**\n * Node color in red-black tree.\n */\nconst Color = {\n  RED: \"RED\",\n  BLACK: \"BLACK\",\n} as const;\ntype Color = (typeof Color)[keyof typeof Color];\n\n/**\n * Node in the red-black tree.\n */\ninterface TreeNode<K, V> {\n  key: K;\n  value: V;\n  color: Color;\n  left: TreeNode<K, V> | null;\n  right: TreeNode<K, V> | null;\n  parent: TreeNode<K, V> | null;\n}\n\n// Null-safe helpers of the red-black algorithms: a null leaf is black\nfunction colorOf<K, V>(node: TreeNode<K, V> | null): Color {\n  return node === null ? Color.BLACK : node.color;\n}\nfunction parentOf<K, V>(node: TreeNode<K, V> | null): TreeNode<K, V> | null {\n  return node === null ? null : node.parent;\n}\nfunction leftOf<K, V>(node: TreeNode<K, V> | null): TreeNode<K, V> | null {\n  return node === null ? null : node.left;\n}\nfunction rightOf<K, V>(node: TreeNode<K, V> | null): TreeNode<K, V> | null {\n  return node === null ? null : node.right;\n}\nfunction setColor<K, V>(node: TreeNode<K, V> | null, color: Color): void {\n  if (node !== null) node.color = color;\n}\n\n/**\n * Options for making a TreeMap.\n */\nexport interface TreeMapOptions<K, V> {\n  /**\n   * Comparison function for keys.\n   * @default defaultCompare\n   */\n  compare?: Compare<K>;\n\n  /**\n   * Equality function for keys.\n   * @default defaultEq\n   */\n  eq?: Eq<K>;\n\n  /**\n   * Equality function for values.\n   * @default defaultEq\n   */\n  valueEq?: Eq<V>;\n}\n\n/**\n * TreeMap<K, V> - Red-black tree based sorted map.\n *\n * Maintains keys in sorted order using a self-balancing binary search tree.\n * This class gives O(log n) operations and navigation methods.\n */\nexport class TreeMap<K, V> implements NavigableMap<K, V> {\n  private _root: TreeNode<K, V> | null = null;\n  private _size: number = 0;\n  private readonly _compare: Compare<K>;\n  private readonly _eq: Eq<K>;\n  private readonly _valueEq: Eq<V>;\n\n  constructor(options: TreeMapOptions<K, V> = {}) {\n    const {\n      compare = defaultCompare,\n      eq = defaultEq,\n      valueEq = defaultEq,\n    } = options;\n\n    this._compare = compare;\n    this._eq = eq;\n    this._valueEq = valueEq;\n  }\n\n  // ========================================================================\n  // Size and state\n  // ========================================================================\n\n  get size(): number {\n    return this._size;\n  }\n\n  get isEmpty(): boolean {\n    return this._size === 0;\n  }\n\n  get comparator(): Compare<K> {\n    return this._compare;\n  }\n\n  get keyEq(): Eq<K> {\n    return this._eq;\n  }\n\n  get valueEq(): Eq<V> {\n    return this._valueEq;\n  }\n\n  // ========================================================================\n  // Lookup operations\n  // ========================================================================\n\n  has(key: K): boolean {\n    return this.getNode(key) !== null;\n  }\n\n  containsKey(key: K): boolean {\n    return this.has(key);\n  }\n\n  containsValue(value: V): boolean {\n    return this.findValue(this._root, value);\n  }\n\n  get(key: K): V {\n    const node = this.getNode(key);\n    if (node === null) {\n      throw new Error(\"Key not found\");\n    }\n    return node.value;\n  }\n\n  getOrUndefined(key: K): V | undefined {\n    const node = this.getNode(key);\n    return node?.value;\n  }\n\n  getOrDefault(key: K, defaultValue: V): V {\n    const node = this.getNode(key);\n    return node !== null ? node.value : defaultValue;\n  }\n\n  // ========================================================================\n  // Modification operations\n  // ========================================================================\n\n  set(key: K, value: V): V | undefined {\n    if (this._root === null) {\n      this._root = this.createNode(key, value, Color.BLACK);\n      this._size++;\n      return undefined;\n    }\n\n    // Find insertion point\n    let node: TreeNode<K, V> | null = this._root;\n    let parent: TreeNode<K, V> | null = null;\n\n    while (node !== null) {\n      parent = node;\n      const cmp = this._compare(key, node.key);\n\n      if (cmp === 0) {\n        // Key exists, replace value\n        const oldValue = node.value;\n        node.value = value;\n        return oldValue;\n      } else if (cmp < 0) {\n        node = node.left;\n      } else {\n        node = node.right;\n      }\n    }\n\n    // Insert new node\n    const newNode = this.createNode(key, value, Color.RED);\n    newNode.parent = parent;\n\n    if (parent !== null) {\n      const cmp = this._compare(key, parent.key);\n      if (cmp < 0) {\n        parent.left = newNode;\n      } else {\n        parent.right = newNode;\n      }\n    }\n\n    this._size++;\n    this.fixAfterInsertion(newNode);\n    return undefined;\n  }\n\n  setIfAbsent(key: K, value: V): V {\n    const existing = this.getNode(key);\n    if (existing !== null) {\n      return existing.value;\n    }\n    this.set(key, value);\n    return value;\n  }\n\n  replace(key: K, value: V): V | undefined {\n    const node = this.getNode(key);\n    if (node === null) return undefined;\n    const oldValue = node.value;\n    node.value = value;\n    return oldValue;\n  }\n\n  replaceEntry(key: K, oldValue: V, newValue: V): boolean {\n    const node = this.getNode(key);\n    if (node === null || !this._valueEq(node.value, oldValue)) {\n      return false;\n    }\n    node.value = newValue;\n    return true;\n  }\n\n  delete(key: K): V | undefined {\n    const node = this.getNode(key);\n    if (node === null) return undefined;\n\n    const oldValue = node.value;\n    this.deleteNode(node);\n    this._size--;\n    return oldValue;\n  }\n\n  deleteEntry(key: K, value: V): boolean {\n    const node = this.getNode(key);\n    if (node === null || !this._valueEq(node.value, value)) {\n      return false;\n    }\n    this.deleteNode(node);\n    this._size--;\n    return true;\n  }\n\n  clear(): void {\n    this._root = null;\n    this._size = 0;\n  }\n\n  // ========================================================================\n  // Bulk operations\n  // ========================================================================\n\n  putAll(other: NavigableMap<K, V> | Iterable<Entry<K, V>>): void {\n    if ('entries' in other && typeof other.entries === 'function') {\n      for (const entry of other.entries()) {\n        this.set(entry.key, entry.value);\n      }\n    } else {\n      for (const entry of other as Iterable<Entry<K, V>>) {\n        this.set(entry.key, entry.value);\n      }\n    }\n  }\n\n  // ========================================================================\n  // Computed operations\n  // ========================================================================\n\n  computeIfAbsent(key: K, mappingFunction: (key: K) => V): V {\n    const existing = this.getNode(key);\n    if (existing !== null) {\n      return existing.value;\n    }\n    const value = mappingFunction(key);\n    this.set(key, value);\n    return value;\n  }\n\n  computeIfPresent(key: K, remappingFunction: (key: K, value: V) => V | undefined): V | undefined {\n    const existing = this.getNode(key);\n    if (existing === null) return undefined;\n\n    const newValue = remappingFunction(key, existing.value);\n    if (newValue === undefined) {\n      this.delete(key);\n      return undefined;\n    }\n    existing.value = newValue;\n    return newValue;\n  }\n\n  compute(key: K, remappingFunction: (key: K, value: V | undefined) => V | undefined): V | undefined {\n    const existing = this.getNode(key);\n    const newValue = remappingFunction(key, existing?.value);\n\n    if (newValue === undefined) {\n      if (existing !== null) {\n        this.delete(key);\n      }\n      return undefined;\n    }\n\n    this.set(key, newValue);\n    return newValue;\n  }\n\n  merge(key: K, value: V, remappingFunction: (oldValue: V, newValue: V) => V | undefined): V | undefined {\n    const existing = this.getNode(key);\n\n    if (existing === null) {\n      this.set(key, value);\n      return value;\n    }\n\n    const merged = remappingFunction(existing.value, value);\n    if (merged === undefined) {\n      this.delete(key);\n      return undefined;\n    }\n\n    existing.value = merged;\n    return merged;\n  }\n\n  // ========================================================================\n  // SortedMap operations\n  // ========================================================================\n\n  firstKey(): K {\n    if (this._root === null) {\n      throw new Error(\"Map is empty\");\n    }\n    return this.getFirstNode(this._root).key;\n  }\n\n  lastKey(): K {\n    if (this._root === null) {\n      throw new Error(\"Map is empty\");\n    }\n    return this.getLastNode(this._root).key;\n  }\n\n  headMap(toKey: K): SortedMap<K, V> {\n    // Return a view (simplified: create new map with filtered entries)\n    const result = new TreeMap<K, V>({\n      compare: this._compare,\n      eq: this._eq,\n      valueEq: this._valueEq,\n    });\n\n    for (const entry of this.entries()) {\n      if (this._compare(entry.key, toKey) < 0) {\n        result.set(entry.key, entry.value);\n      } else {\n        break; // Keys are sorted, so we can stop\n      }\n    }\n\n    return result;\n  }\n\n  tailMap(fromKey: K): SortedMap<K, V> {\n    const result = new TreeMap<K, V>({\n      compare: this._compare,\n      eq: this._eq,\n      valueEq: this._valueEq,\n    });\n\n    let started = false;\n    for (const entry of this.entries()) {\n      if (!started && this._compare(entry.key, fromKey) < 0) {\n        continue;\n      }\n      started = true;\n      result.set(entry.key, entry.value);\n    }\n\n    return result;\n  }\n\n  subMap(fromKey: K, toKey: K): SortedMap<K, V> {\n    const result = new TreeMap<K, V>({\n      compare: this._compare,\n      eq: this._eq,\n      valueEq: this._valueEq,\n    });\n\n    for (const entry of this.entries()) {\n      const cmpFrom = this._compare(entry.key, fromKey);\n      const cmpTo = this._compare(entry.key, toKey);\n\n      if (cmpFrom >= 0 && cmpTo < 0) {\n        result.set(entry.key, entry.value);\n      } else if (cmpTo >= 0) {\n        break; // Past the range\n      }\n    }\n\n    return result;\n  }\n\n  // ========================================================================\n  // NavigableMap operations\n  // ========================================================================\n\n  floorKey(key: K): K | undefined {\n    return this.floorEntry(key)?.key;\n  }\n\n  ceilingKey(key: K): K | undefined {\n    return this.ceilingEntry(key)?.key;\n  }\n\n  lowerKey(key: K): K | undefined {\n    return this.lowerEntry(key)?.key;\n  }\n\n  higherKey(key: K): K | undefined {\n    return this.higherEntry(key)?.key;\n  }\n\n  floorEntry(key: K): Entry<K, V> | undefined {\n    let node = this._root;\n    let result: TreeNode<K, V> | null = null;\n\n    while (node !== null) {\n      const cmp = this._compare(key, node.key);\n      if (cmp === 0) {\n        return { key: node.key, value: node.value };\n      } else if (cmp < 0) {\n        node = node.left;\n      } else {\n        result = node; // This node is <= key\n        node = node.right;\n      }\n    }\n\n    return result ? { key: result.key, value: result.value } : undefined;\n  }\n\n  ceilingEntry(key: K): Entry<K, V> | undefined {\n    let node = this._root;\n    let result: TreeNode<K, V> | null = null;\n\n    while (node !== null) {\n      const cmp = this._compare(key, node.key);\n      if (cmp === 0) {\n        return { key: node.key, value: node.value };\n      } else if (cmp > 0) {\n        node = node.right;\n      } else {\n        result = node; // This node is >= key\n        node = node.left;\n      }\n    }\n\n    return result ? { key: result.key, value: result.value } : undefined;\n  }\n\n  lowerEntry(key: K): Entry<K, V> | undefined {\n    let node = this._root;\n    let result: TreeNode<K, V> | null = null;\n\n    while (node !== null) {\n      const cmp = this._compare(key, node.key);\n      if (cmp <= 0) {\n        node = node.left;\n      } else {\n        result = node; // This node is < key\n        node = node.right;\n      }\n    }\n\n    return result ? { key: result.key, value: result.value } : undefined;\n  }\n\n  higherEntry(key: K): Entry<K, V> | undefined {\n    let node = this._root;\n    let result: TreeNode<K, V> | null = null;\n\n    while (node !== null) {\n      const cmp = this._compare(key, node.key);\n      if (cmp >= 0) {\n        node = node.right;\n      } else {\n        result = node; // This node is > key\n        node = node.left;\n      }\n    }\n\n    return result ? { key: result.key, value: result.value } : undefined;\n  }\n\n  firstEntry(): Entry<K, V> | undefined {\n    if (this._root === null) return undefined;\n    const node = this.getFirstNode(this._root);\n    return { key: node.key, value: node.value };\n  }\n\n  lastEntry(): Entry<K, V> | undefined {\n    if (this._root === null) return undefined;\n    const node = this.getLastNode(this._root);\n    return { key: node.key, value: node.value };\n  }\n\n  pollFirstEntry(): Entry<K, V> | undefined {\n    if (this._root === null) return undefined;\n    const node = this.getFirstNode(this._root);\n    const entry = { key: node.key, value: node.value };\n    this.deleteNode(node);\n    this._size--;\n    return entry;\n  }\n\n  pollLastEntry(): Entry<K, V> | undefined {\n    if (this._root === null) return undefined;\n    const node = this.getLastNode(this._root);\n    const entry = { key: node.key, value: node.value };\n    this.deleteNode(node);\n    this._size--;\n    return entry;\n  }\n\n  descendingMap(): NavigableMap<K, V> {\n    // Create a new TreeMap with reversed comparator\n    const reversed = new TreeMap<K, V>({\n      compare: (a, b) => this._compare(b, a),\n      eq: this._eq,\n      valueEq: this._valueEq,\n    });\n\n    for (const entry of this.entries()) {\n      reversed.set(entry.key, entry.value);\n    }\n\n    return reversed;\n  }\n\n  *descendingKeys(): IterableIterator<K> {\n    yield* this.reverseInOrderTraversal(this._root, (node) => node.key);\n  }\n\n  // ========================================================================\n  // View operations\n  // ========================================================================\n\n  *keys(): IterableIterator<K> {\n    yield* this.inOrderTraversal(this._root, (node) => node.key);\n  }\n\n  *values(): IterableIterator<V> {\n    yield* this.inOrderTraversal(this._root, (node) => node.value);\n  }\n\n  *entries(): IterableIterator<Entry<K, V>> {\n    yield* this.inOrderTraversal(this._root, (node) => ({\n      key: node.key,\n      value: node.value,\n    }));\n  }\n\n  *[Symbol.iterator](): Iterator<Entry<K, V>> {\n    yield* this.entries();\n  }\n\n  forEach(action: (value: V, key: K, map: this) => void): void {\n    for (const entry of this.entries()) {\n      action(entry.value, entry.key, this);\n    }\n  }\n\n  toArray(): Entry<K, V>[] {\n    return Array.from(this.entries());\n  }\n\n  // ========================================================================\n  // Private helpers - Tree operations\n  // ========================================================================\n\n  private createNode(key: K, value: V, color: Color): TreeNode<K, V> {\n    return {\n      key,\n      value,\n      color,\n      left: null,\n      right: null,\n      parent: null,\n    };\n  }\n\n  private getNode(key: K): TreeNode<K, V> | null {\n    let node = this._root;\n\n    while (node !== null) {\n      const cmp = this._compare(key, node.key);\n      if (cmp === 0) {\n        return node;\n      } else if (cmp < 0) {\n        node = node.left;\n      } else {\n        node = node.right;\n      }\n    }\n\n    return null;\n  }\n\n  private getFirstNode(node: TreeNode<K, V>): TreeNode<K, V> {\n    while (node.left !== null) {\n      node = node.left;\n    }\n    return node;\n  }\n\n  private getLastNode(node: TreeNode<K, V>): TreeNode<K, V> {\n    while (node.right !== null) {\n      node = node.right;\n    }\n    return node;\n  }\n\n  private findValue(node: TreeNode<K, V> | null, value: V): boolean {\n    if (node === null) return false;\n    if (this._valueEq(node.value, value)) return true;\n    return this.findValue(node.left, value) || this.findValue(node.right, value);\n  }\n\n  private *inOrderTraversal<T>(\n    node: TreeNode<K, V> | null,\n    mapper: (node: TreeNode<K, V>) => T\n  ): IterableIterator<T> {\n    if (node === null) return;\n    yield* this.inOrderTraversal(node.left, mapper);\n    yield mapper(node);\n    yield* this.inOrderTraversal(node.right, mapper);\n  }\n\n  private *reverseInOrderTraversal<T>(\n    node: TreeNode<K, V> | null,\n    mapper: (node: TreeNode<K, V>) => T\n  ): IterableIterator<T> {\n    if (node === null) return;\n    yield* this.reverseInOrderTraversal(node.right, mapper);\n    yield mapper(node);\n    yield* this.reverseInOrderTraversal(node.left, mapper);\n  }\n\n  // ========================================================================\n  // Private helpers - Red-black tree balancing\n  // ========================================================================\n\n  private rotateLeft(node: TreeNode<K, V> | null): void {\n    if (node === null || node.right === null) return;\n    const right = node.right;\n    node.right = right.left;\n\n    if (right.left !== null) {\n      right.left.parent = node;\n    }\n\n    right.parent = node.parent;\n\n    if (node.parent === null) {\n      this._root = right;\n    } else if (node === node.parent.left) {\n      node.parent.left = right;\n    } else {\n      node.parent.right = right;\n    }\n\n    right.left = node;\n    node.parent = right;\n  }\n\n  private rotateRight(node: TreeNode<K, V> | null): void {\n    if (node === null || node.left === null) return;\n    const left = node.left;\n    node.left = left.right;\n\n    if (left.right !== null) {\n      left.right.parent = node;\n    }\n\n    left.parent = node.parent;\n\n    if (node.parent === null) {\n      this._root = left;\n    } else if (node === node.parent.right) {\n      node.parent.right = left;\n    } else {\n      node.parent.left = left;\n    }\n\n    left.right = node;\n    node.parent = left;\n  }\n\n  private fixAfterInsertion(node: TreeNode<K, V>): void {\n    while (node.parent !== null && node.parent.color === Color.RED) {\n      if (node.parent === node.parent.parent?.left) {\n        const uncle = node.parent.parent.right;\n\n        if (uncle?.color === Color.RED) {\n          // Case 1: Uncle is red\n          node.parent.color = Color.BLACK;\n          uncle.color = Color.BLACK;\n          node.parent.parent.color = Color.RED;\n          node = node.parent.parent;\n        } else {\n          if (node === node.parent.right) {\n            // Case 2: Node is right child\n            node = node.parent;\n            this.rotateLeft(node);\n          }\n          // Case 3: Node is left child\n          node.parent!.color = Color.BLACK;\n          node.parent!.parent!.color = Color.RED;\n          this.rotateRight(node.parent!.parent!);\n        }\n      } else {\n        const uncle = node.parent.parent?.left ?? null;\n\n        if (uncle?.color === Color.RED) {\n          // Case 1: Uncle is red\n          node.parent.color = Color.BLACK;\n          uncle.color = Color.BLACK;\n          node.parent.parent!.color = Color.RED;\n          node = node.parent.parent!;\n        } else {\n          if (node === node.parent.left) {\n            // Case 2: Node is left child\n            node = node.parent;\n            this.rotateRight(node);\n          }\n          // Case 3: Node is right child\n          node.parent!.color = Color.BLACK;\n          node.parent!.parent!.color = Color.RED;\n          this.rotateLeft(node.parent!.parent!);\n        }\n      }\n    }\n\n    this._root!.color = Color.BLACK;\n  }\n\n  /**\n   * This method deletes a node (the CLRS algorithm, as in java.util.TreeMap). A null leaf counts as black.\n   *\n   * Before (BUGS-2026-07 L10): the deletion of a black leaf skipped the fix-up, so the black\n   * heights drifted and the tree became unbalanced. Also, the fix-up treated a null leaf as\n   * \"not black\", so it chose the wrong case and rotated at null (a TypeError).\n   */\n  private deleteNode(target: TreeNode<K, V>): void {\n    let node = target;\n    // A node with two children takes the key and value of its successor, then the successor goes\n    if (node.left !== null && node.right !== null) {\n      const successor = this.getFirstNode(node.right);\n      node.key = successor.key;\n      node.value = successor.value;\n      node = successor;\n    }\n\n    const replacement = node.left ?? node.right;\n    if (replacement !== null) {\n      replacement.parent = node.parent;\n      if (node.parent === null) this._root = replacement;\n      else if (node === node.parent.left) node.parent.left = replacement;\n      else node.parent.right = replacement;\n      node.left = node.right = node.parent = null;\n      if (node.color === Color.BLACK) this.fixAfterDeletion(replacement);\n    } else if (node.parent === null) {\n      // The only node\n      this._root = null;\n    } else {\n      // A leaf: it is its own phantom replacement during the fix-up, then it goes\n      if (node.color === Color.BLACK) this.fixAfterDeletion(node);\n      if (node.parent !== null) {\n        if (node === node.parent.left) node.parent.left = null;\n        else if (node === node.parent.right) node.parent.right = null;\n        node.parent = null;\n      }\n    }\n  }\n\n  private fixAfterDeletion(start: TreeNode<K, V>): void {\n    let x: TreeNode<K, V> | null = start;\n    while (x !== this._root && colorOf(x) === Color.BLACK) {\n      if (x === leftOf(parentOf(x))) {\n        let sibling = rightOf(parentOf(x));\n        if (colorOf(sibling) === Color.RED) {\n          setColor(sibling, Color.BLACK);\n          setColor(parentOf(x), Color.RED);\n          this.rotateLeft(parentOf(x));\n          sibling = rightOf(parentOf(x));\n        }\n        if (colorOf(leftOf(sibling)) === Color.BLACK && colorOf(rightOf(sibling)) === Color.BLACK) {\n          setColor(sibling, Color.RED);\n          x = parentOf(x);\n        } else {\n          if (colorOf(rightOf(sibling)) === Color.BLACK) {\n            setColor(leftOf(sibling), Color.BLACK);\n            setColor(sibling, Color.RED);\n            this.rotateRight(sibling);\n            sibling = rightOf(parentOf(x));\n          }\n          setColor(sibling, colorOf(parentOf(x)));\n          setColor(parentOf(x), Color.BLACK);\n          setColor(rightOf(sibling), Color.BLACK);\n          this.rotateLeft(parentOf(x));\n          x = this._root;\n        }\n      } else {\n        let sibling = leftOf(parentOf(x));\n        if (colorOf(sibling) === Color.RED) {\n          setColor(sibling, Color.BLACK);\n          setColor(parentOf(x), Color.RED);\n          this.rotateRight(parentOf(x));\n          sibling = leftOf(parentOf(x));\n        }\n        if (colorOf(rightOf(sibling)) === Color.BLACK && colorOf(leftOf(sibling)) === Color.BLACK) {\n          setColor(sibling, Color.RED);\n          x = parentOf(x);\n        } else {\n          if (colorOf(leftOf(sibling)) === Color.BLACK) {\n            setColor(rightOf(sibling), Color.BLACK);\n            setColor(sibling, Color.RED);\n            this.rotateLeft(sibling);\n            sibling = leftOf(parentOf(x));\n          }\n          setColor(sibling, colorOf(parentOf(x)));\n          setColor(parentOf(x), Color.BLACK);\n          setColor(leftOf(sibling), Color.BLACK);\n          this.rotateRight(parentOf(x));\n          x = this._root;\n        }\n      }\n    }\n    setColor(x, Color.BLACK);\n  }\n\n  // ========================================================================\n  // Utility methods\n  // ========================================================================\n\n  toString(): string {\n    const entries = Array.from(this.entries())\n      .map(({ key, value }) => `${key}=${value}`)\n      .join(', ');\n    return `TreeMap{${entries}}`;\n  }\n}\n\n/**\n * Factory function to make a TreeMap.\n *\n * @example\n * const map = treeMap<string, number>()\n * map.set('c', 3)\n * map.set('a', 1)\n * map.set('b', 2)\n * // Iteration order: a, b, c\n *\n * @example\n * // With initial entries\n * const map = treeMap<string, number>([\n *   ['c', 3],\n *   ['a', 1],\n *   ['b', 2]\n * ])\n *\n * @example\n * // Custom comparator for descending order\n * const map = treeMap<number, string>({ compare: (a, b) => b - a })\n */\nexport function treeMap<K, V>(\n  optionsOrEntries?: TreeMapOptions<K, V> | Iterable<[K, V]>\n): TreeMap<K, V> {\n  if (optionsOrEntries && Symbol.iterator in optionsOrEntries) {\n    const map = new TreeMap<K, V>();\n    for (const [key, value] of optionsOrEntries as Iterable<[K, V]>) {\n      map.set(key, value);\n    }\n    return map;\n  }\n\n  return new TreeMap<K, V>(optionsOrEntries as TreeMapOptions<K, V>);\n}\n","/**\n * TreeSet - Red-black tree based sorted set implementation.\n *\n * This module implements a sorted set using TreeMap as the backing structure.\n * Mirrors java.util.TreeSet.\n *\n * Key features:\n * - O(log n) add, remove, contains\n * - Elements maintained in sorted order (natural or custom comparator)\n * - Navigation methods (floor, ceiling, lower, higher)\n * - Range view operations (subSet, headSet, tailSet)\n *\n * @example\n * const set = treeSet<string>()\n * set.add('c')\n * set.add('a')\n * set.add('b')\n * // Iteration order: a, b, c (sorted)\n *\n * @example\n * // Custom comparator for descending order\n * const set = treeSet<number>({\n *   compare: (a, b) => b - a\n * })\n */\n\nimport type { SortedSet, NavigableSet } from \"../interfaces/set.js\";\nimport type { Eq, Compare } from \"../core/traits.js\";\nimport { TreeMap } from \"./tree-map.js\";\nimport { defaultEq, defaultCompare } from \"../utils/defaults.js\";\n\n/**\n * Dummy value used for TreeMap backing.\n */\nconst PRESENT = true;\n\n/**\n * Options for making a TreeSet.\n */\nexport interface TreeSetOptions<T> {\n  /**\n   * Comparison function for elements.\n   * @default defaultCompare\n   */\n  compare?: Compare<T>;\n\n  /**\n   * Equality function for elements.\n   * @default defaultEq\n   */\n  eq?: Eq<T>;\n}\n\n/**\n * TreeSet<T> - Red-black tree based sorted set.\n *\n * Maintains elements in sorted order using a TreeMap as backing structure.\n * This class gives O(log n) operations and navigation methods.\n */\nexport class TreeSet<T> implements NavigableSet<T> {\n  private readonly _map: TreeMap<T, boolean>;\n  private readonly _compare: Compare<T>;\n  private readonly _eq: Eq<T>;\n\n  constructor(options: TreeSetOptions<T> = {}) {\n    const {\n      compare = defaultCompare,\n      eq = defaultEq,\n    } = options;\n\n    this._compare = compare;\n    this._eq = eq;\n    this._map = new TreeMap<T, boolean>({\n      compare,\n      eq,\n    });\n  }\n\n  // ========================================================================\n  // Size and state\n  // ========================================================================\n\n  get size(): number {\n    return this._map.size;\n  }\n\n  get isEmpty(): boolean {\n    return this._map.isEmpty;\n  }\n\n  get comparator(): Compare<T> {\n    return this._compare;\n  }\n\n  get eq(): Eq<T> {\n    return this._eq;\n  }\n\n  // ========================================================================\n  // Membership operations\n  // ========================================================================\n\n  has(element: T): boolean {\n    return this._map.has(element);\n  }\n\n  contains(element: T): boolean {\n    return this.has(element);\n  }\n\n  containsAll(other: Iterable<T>): boolean {\n    for (const element of other) {\n      if (!this.has(element)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  // ========================================================================\n  // Modification operations\n  // ========================================================================\n\n  add(element: T): boolean {\n    const oldValue = this._map.set(element, PRESENT);\n    return oldValue === undefined; // Returns true if element was added (not already present)\n  }\n\n  remove(element: T): boolean {\n    const removed = this._map.delete(element);\n    return removed !== undefined;\n  }\n\n  clear(): void {\n    this._map.clear();\n  }\n\n  // ========================================================================\n  // Bulk operations\n  // ========================================================================\n\n  addAll(elements: Iterable<T>): boolean {\n    let modified = false;\n    for (const element of elements) {\n      if (this.add(element)) {\n        modified = true;\n      }\n    }\n    return modified;\n  }\n\n  removeAll(elements: Iterable<T>): boolean {\n    let modified = false;\n    for (const element of elements) {\n      if (this.remove(element)) {\n        modified = true;\n      }\n    }\n    return modified;\n  }\n\n  retainAll(elements: Iterable<T>): boolean {\n    const toRetain = new Set<T>();\n    for (const element of elements) {\n      toRetain.add(element);\n    }\n\n    let modified = false;\n    for (const element of Array.from(this)) {\n      if (!toRetain.has(element)) {\n        this.remove(element);\n        modified = true;\n      }\n    }\n    return modified;\n  }\n\n  // ========================================================================\n  // Set operations\n  // ========================================================================\n\n  union(other: Iterable<T>): TreeSet<T> {\n    const result = new TreeSet<T>({\n      compare: this._compare,\n      eq: this._eq,\n    });\n\n    for (const element of this) {\n      result.add(element);\n    }\n    for (const element of other) {\n      result.add(element);\n    }\n\n    return result;\n  }\n\n  intersection(other: Iterable<T>): TreeSet<T> {\n    const result = new TreeSet<T>({\n      compare: this._compare,\n      eq: this._eq,\n    });\n\n    const otherSet = new Set<T>();\n    for (const element of other) {\n      otherSet.add(element);\n    }\n\n    for (const element of this) {\n      if (otherSet.has(element)) {\n        result.add(element);\n      }\n    }\n\n    return result;\n  }\n\n  difference(other: Iterable<T>): TreeSet<T> {\n    const result = new TreeSet<T>({\n      compare: this._compare,\n      eq: this._eq,\n    });\n\n    const otherSet = new Set<T>();\n    for (const element of other) {\n      otherSet.add(element);\n    }\n\n    for (const element of this) {\n      if (!otherSet.has(element)) {\n        result.add(element);\n      }\n    }\n\n    return result;\n  }\n\n  symmetricDifference(other: Iterable<T>): TreeSet<T> {\n    const result = new TreeSet<T>({\n      compare: this._compare,\n      eq: this._eq,\n    });\n\n    // Add all elements from this set\n    for (const element of this) {\n      result.add(element);\n    }\n\n    // Toggle elements from other set\n    for (const element of other) {\n      if (result.has(element)) {\n        result.remove(element);\n      } else {\n        result.add(element);\n      }\n    }\n\n    return result;\n  }\n\n  isSubsetOf(other: Iterable<T>): boolean {\n    const otherSet = new Set<T>();\n    for (const element of other) {\n      otherSet.add(element);\n    }\n\n    for (const element of this) {\n      if (!otherSet.has(element)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  isSupersetOf(other: Iterable<T>): boolean {\n    for (const element of other) {\n      if (!this.has(element)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  isDisjointFrom(other: Iterable<T>): boolean {\n    for (const element of other) {\n      if (this.has(element)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  // ========================================================================\n  // SortedSet operations\n  // ========================================================================\n\n  first(): T {\n    const key = this._map.firstKey();\n    return key;\n  }\n\n  last(): T {\n    const key = this._map.lastKey();\n    return key;\n  }\n\n  headSet(toElement: T): SortedSet<T> {\n    const result = new TreeSet<T>({\n      compare: this._compare,\n      eq: this._eq,\n    });\n\n    for (const element of this) {\n      if (this._compare(element, toElement) < 0) {\n        result.add(element);\n      } else {\n        break; // Elements are sorted\n      }\n    }\n\n    return result;\n  }\n\n  tailSet(fromElement: T): SortedSet<T> {\n    const result = new TreeSet<T>({\n      compare: this._compare,\n      eq: this._eq,\n    });\n\n    let started = false;\n    for (const element of this) {\n      if (!started && this._compare(element, fromElement) < 0) {\n        continue;\n      }\n      started = true;\n      result.add(element);\n    }\n\n    return result;\n  }\n\n  subSet(fromElement: T, toElement: T): SortedSet<T> {\n    const result = new TreeSet<T>({\n      compare: this._compare,\n      eq: this._eq,\n    });\n\n    for (const element of this) {\n      const cmpFrom = this._compare(element, fromElement);\n      const cmpTo = this._compare(element, toElement);\n\n      if (cmpFrom >= 0 && cmpTo < 0) {\n        result.add(element);\n      } else if (cmpTo >= 0) {\n        break; // Past the range\n      }\n    }\n\n    return result;\n  }\n\n  // ========================================================================\n  // NavigableSet operations\n  // ========================================================================\n\n  floor(element: T): T | undefined {\n    return this._map.floorKey(element);\n  }\n\n  ceiling(element: T): T | undefined {\n    return this._map.ceilingKey(element);\n  }\n\n  lower(element: T): T | undefined {\n    return this._map.lowerKey(element);\n  }\n\n  higher(element: T): T | undefined {\n    return this._map.higherKey(element);\n  }\n\n  pollFirst(): T | undefined {\n    const entry = this._map.pollFirstEntry();\n    return entry?.key;\n  }\n\n  pollLast(): T | undefined {\n    const entry = this._map.pollLastEntry();\n    return entry?.key;\n  }\n\n  descendingSet(): NavigableSet<T> {\n    const reversed = new TreeSet<T>({\n      compare: (a, b) => this._compare(b, a),\n      eq: this._eq,\n    });\n\n    for (const element of this) {\n      reversed.add(element);\n    }\n\n    return reversed;\n  }\n\n  *descendingIterator(): IterableIterator<T> {\n    yield* this._map.descendingKeys();\n  }\n\n  // ========================================================================\n  // View operations\n  // ========================================================================\n\n  *[Symbol.iterator](): Iterator<T> {\n    yield* this._map.keys();\n  }\n\n  forEach(action: (element: T, index: number) => void): void {\n    let index = 0;\n    for (const element of this) {\n      action(element, index++);\n    }\n  }\n\n  toArray(): T[] {\n    return Array.from(this);\n  }\n\n  // ========================================================================\n  // Utility methods\n  // ========================================================================\n\n  toString(): string {\n    const elements = Array.from(this).join(', ');\n    return `TreeSet{${elements}}`;\n  }\n}\n\n/**\n * Factory function to make a TreeSet.\n *\n * @example\n * const set = treeSet<string>()\n * set.add('c')\n * set.add('a')\n * set.add('b')\n * // Iteration order: a, b, c\n *\n * @example\n * // With initial elements\n * const set = treeSet(['c', 'a', 'b'])\n * // Iteration order: a, b, c\n *\n * @example\n * // Custom comparator for descending order\n * const set = treeSet<number>({ compare: (a, b) => b - a })\n */\nexport function treeSet<T>(\n  optionsOrElements?: TreeSetOptions<T> | Iterable<T>\n): TreeSet<T> {\n  if (optionsOrElements && Symbol.iterator in optionsOrElements) {\n    const set = new TreeSet<T>();\n    for (const element of optionsOrElements as Iterable<T>) {\n      set.add(element);\n    }\n    return set;\n  }\n\n  return new TreeSet<T>(optionsOrElements as TreeSetOptions<T>);\n}\n","/**\n * LinkedList implementation - A doubly-linked list.\n *\n * This module gives O(1) insertion/removal at both ends and at known positions.\n * Slower random access O(n) compared to ArrayList.\n * Mirrors java.util.LinkedList.\n *\n * @example\n * const list = linkedList<number>()\n * list.addFirst(1)\n * list.addLast(2)\n * list.add(3)\n */\n\nimport type { List } from \"../interfaces/list.js\";\nimport type { Deque } from \"../interfaces/queue.js\";\nimport type { Eq, Compare } from \"../core/traits.js\";\nimport { defaultEq, defaultCompare } from \"../utils/defaults.js\";\n\n/**\n * Internal node structure for the linked list.\n */\nclass Node<T> {\n  value: T;\n  prev: Node<T> | null;\n  next: Node<T> | null;\n\n  constructor(value: T, prev: Node<T> | null = null, next: Node<T> | null = null) {\n    this.value = value;\n    this.prev = prev;\n    this.next = next;\n  }\n}\n\n/**\n * Options for making a LinkedList.\n */\nexport interface LinkedListOptions<T> {\n  /**\n   * Equality function for comparing elements.\n   * @default defaultEq (===)\n   */\n  eq?: Eq<T>;\n}\n\n/**\n * LinkedList<T> - Doubly-linked list implementation.\n *\n * Efficient for:\n * - Insertion/removal at ends: O(1)\n * - Insertion/removal at known position: O(1)\n * - Sequential iteration: O(n)\n *\n * Not efficient for:\n * - Random access by index: O(n)\n * - Search: O(n)\n *\n * This class implements both List and Deque interfaces.\n */\nexport class LinkedList<T> implements List<T>, Deque<T> {\n  private _head: Node<T> | null = null;\n  private _tail: Node<T> | null = null;\n  private _size: number = 0;\n  private readonly _eq: Eq<T>;\n\n  constructor(options: LinkedListOptions<T> = {}) {\n    const { eq = defaultEq } = options;\n    this._eq = eq;\n  }\n\n  // ========================================================================\n  // Size\n  // ========================================================================\n\n  get size(): number {\n    return this._size;\n  }\n\n  get isEmpty(): boolean {\n    return this._size === 0;\n  }\n\n  get eq(): Eq<T> {\n    return this._eq;\n  }\n\n  // ========================================================================\n  // Deque operations (both ends)\n  // ========================================================================\n\n  addFirst(element: T): void {\n    const newNode = new Node(element, null, this._head);\n    if (this._head) {\n      this._head.prev = newNode;\n    }\n    this._head = newNode;\n    if (!this._tail) {\n      this._tail = newNode;\n    }\n    this._size++;\n  }\n\n  addLast(element: T): void {\n    const newNode = new Node(element, this._tail, null);\n    if (this._tail) {\n      this._tail.next = newNode;\n    }\n    this._tail = newNode;\n    if (!this._head) {\n      this._head = newNode;\n    }\n    this._size++;\n  }\n\n  removeFirst(): T {\n    if (!this._head) {\n      throw new Error(\"List is empty\");\n    }\n    return this.pollFirst()!;\n  }\n\n  removeLast(): T {\n    if (!this._tail) {\n      throw new Error(\"List is empty\");\n    }\n    return this.pollLast()!;\n  }\n\n  pollFirst(): T | undefined {\n    if (!this._head) return undefined;\n\n    const value = this._head.value;\n    this._head = this._head.next;\n\n    if (this._head) {\n      this._head.prev = null;\n    } else {\n      this._tail = null;\n    }\n\n    this._size--;\n    return value;\n  }\n\n  pollLast(): T | undefined {\n    if (!this._tail) return undefined;\n\n    const value = this._tail.value;\n    this._tail = this._tail.prev;\n\n    if (this._tail) {\n      this._tail.next = null;\n    } else {\n      this._head = null;\n    }\n\n    this._size--;\n    return value;\n  }\n\n  peekFirst(): T {\n    if (!this._head) {\n      throw new Error(\"List is empty\");\n    }\n    return this._head.value;\n  }\n\n  peekLast(): T {\n    if (!this._tail) {\n      throw new Error(\"List is empty\");\n    }\n    return this._tail.value;\n  }\n\n  peekFirstOrUndefined(): T | undefined {\n    return this._head?.value;\n  }\n\n  peekLastOrUndefined(): T | undefined {\n    return this._tail?.value;\n  }\n\n  offerFirst(element: T): boolean {\n    this.addFirst(element);\n    return true;\n  }\n\n  offerLast(element: T): boolean {\n    this.addLast(element);\n    return true;\n  }\n\n  // ========================================================================\n  // Stack operations (LIFO at the end, as on a JavaScript array)\n  // ========================================================================\n\n  // push and pop work at the end, and shift/unshift at the front, in every collection of this\n  // package. Before, they worked at the front here (the Java Deque rule), so a LinkedList used\n  // as a List reversed the pushed elements (ARCHITECTURE-PROPOSALS P8).\n  push(element: T): void {\n    this.addLast(element);\n  }\n\n  pop(): T {\n    return this.removeLast();\n  }\n\n  // ========================================================================\n  // Queue operations (FIFO)\n  // ========================================================================\n\n  offer(element: T): boolean {\n    return this.offerLast(element);\n  }\n\n  poll(): T {\n    return this.removeFirst();\n  }\n\n  peek(): T {\n    return this.peekFirst();\n  }\n\n  peekOrUndefined(): T | undefined {\n    return this.peekFirstOrUndefined();\n  }\n\n  pollOrUndefined(): T | undefined {\n    return this.pollFirst();\n  }\n\n  enqueue(element: T): boolean {\n    return this.offer(element);\n  }\n\n  dequeue(): T {\n    return this.poll();\n  }\n\n  // ========================================================================\n  // List operations\n  // ========================================================================\n\n  get(index: number): T {\n    const node = this.getNode(index);\n    return node.value;\n  }\n\n  set(index: number, element: T): T {\n    const node = this.getNode(index);\n    const old = node.value;\n    node.value = element;\n    return old;\n  }\n\n  insert(index: number, element: T): void {\n    if (index < 0 || index > this._size) {\n      throw new RangeError(`Index ${index} out of bounds for size ${this._size}`);\n    }\n\n    if (index === 0) {\n      this.addFirst(element);\n      return;\n    }\n\n    if (index === this._size) {\n      this.addLast(element);\n      return;\n    }\n\n    const nextNode = this.getNode(index);\n    const prevNode = nextNode.prev!;\n    const newNode = new Node(element, prevNode, nextNode);\n\n    prevNode.next = newNode;\n    nextNode.prev = newNode;\n    this._size++;\n  }\n\n  insertAll(index: number, other: Iterable<T>): boolean {\n    if (index < 0 || index > this._size) {\n      throw new RangeError(`Index ${index} out of bounds for size ${this._size}`);\n    }\n\n    const elements = Array.from(other);\n    if (elements.length === 0) return false;\n\n    for (let i = 0; i < elements.length; i++) {\n      this.insert(index + i, elements[i]!);\n    }\n\n    return true;\n  }\n\n  removeAt(index: number): T {\n    const node = this.getNode(index);\n    return this.unlinkNode(node);\n  }\n\n  removeRange(fromIndex: number, toIndex: number): void {\n    if (fromIndex < 0 || toIndex > this._size || fromIndex > toIndex) {\n      throw new RangeError(`Invalid range [${fromIndex}, ${toIndex})`);\n    }\n\n    for (let i = fromIndex; i < toIndex; i++) {\n      this.removeAt(fromIndex);\n    }\n  }\n\n  indexOf(element: T, fromIndex: number = 0): number {\n    let index = 0;\n    let node = this._head;\n\n    while (node) {\n      if (index >= fromIndex && this._eq(node.value, element)) {\n        return index;\n      }\n      node = node.next;\n      index++;\n    }\n\n    return -1;\n  }\n\n  lastIndexOf(element: T, fromIndex?: number): number {\n    const start = fromIndex !== undefined ? fromIndex : this._size - 1;\n    let index = this._size - 1;\n    let node = this._tail;\n\n    while (node && index >= 0) {\n      if (index <= start && this._eq(node.value, element)) {\n        return index;\n      }\n      node = node.prev;\n      index--;\n    }\n\n    return -1;\n  }\n\n  first(): T {\n    return this.peekFirst();\n  }\n\n  last(): T {\n    return this.peekLast();\n  }\n\n  shift(): T {\n    return this.removeFirst();\n  }\n\n  unshift(element: T): void {\n    this.addFirst(element);\n  }\n\n  // ========================================================================\n  // Collection operations\n  // ========================================================================\n\n  add(element: T): boolean {\n    this.addLast(element);\n    return true;\n  }\n\n  addAll(other: Iterable<T>): boolean {\n    let modified = false;\n    for (const element of other) {\n      this.addLast(element);\n      modified = true;\n    }\n    return modified;\n  }\n\n  contains(element: T): boolean {\n    return this.indexOf(element) !== -1;\n  }\n\n  containsAll(other: Iterable<T>): boolean {\n    for (const element of other) {\n      if (!this.contains(element)) return false;\n    }\n    return true;\n  }\n\n  remove(element: T): boolean {\n    let node = this._head;\n\n    while (node) {\n      if (this._eq(node.value, element)) {\n        this.unlinkNode(node);\n        return true;\n      }\n      node = node.next;\n    }\n\n    return false;\n  }\n\n  removeAll(other: Iterable<T>): boolean {\n    const toRemove = new Set(other);\n    let modified = false;\n\n    for (const element of toRemove) {\n      while (this.remove(element)) {\n        modified = true;\n      }\n    }\n\n    return modified;\n  }\n\n  retainAll(other: Iterable<T>): boolean {\n    const toRetain = new Set(other);\n    let node = this._head;\n    let modified = false;\n\n    while (node) {\n      const next = node.next;\n      let shouldRetain = false;\n\n      for (const retainElement of toRetain) {\n        if (this._eq(node.value, retainElement)) {\n          shouldRetain = true;\n          break;\n        }\n      }\n\n      if (!shouldRetain) {\n        this.unlinkNode(node);\n        modified = true;\n      }\n\n      node = next;\n    }\n\n    return modified;\n  }\n\n  clear(): void {\n    this._head = null;\n    this._tail = null;\n    this._size = 0;\n  }\n\n  // ========================================================================\n  // Sorting and reversing\n  // ========================================================================\n\n  sort(compare: Compare<T> = defaultCompare): void {\n    if (this._size <= 1) return;\n\n    // Convert to array, sort, rebuild list\n    const array = this.toArray();\n    array.sort(compare);\n\n    this.clear();\n    for (const element of array) {\n      this.addLast(element);\n    }\n  }\n\n  reverse(): void {\n    if (this._size <= 1) return;\n\n    let node = this._head;\n    this._head = this._tail;\n    this._tail = node;\n\n    while (node) {\n      const next = node.next;\n      node.next = node.prev;\n      node.prev = next;\n      node = next;\n    }\n  }\n\n  // ========================================================================\n  // Views\n  // ========================================================================\n\n  subList(fromIndex: number, toIndex: number): List<T> {\n    if (fromIndex < 0 || toIndex > this._size || fromIndex > toIndex) {\n      throw new RangeError(`Invalid range [${fromIndex}, ${toIndex})`);\n    }\n\n    const sub = new LinkedList<T>({ eq: this._eq });\n    let index = 0;\n    let node = this._head;\n\n    while (node && index < toIndex) {\n      if (index >= fromIndex) {\n        sub.addLast(node.value);\n      }\n      node = node.next;\n      index++;\n    }\n\n    return sub;\n  }\n\n  // ========================================================================\n  // Iteration\n  // ========================================================================\n\n  *[Symbol.iterator](): Iterator<T> {\n    let node = this._head;\n    while (node) {\n      yield node.value;\n      node = node.next;\n    }\n  }\n\n  forEach(action: (element: T, index: number) => void): void {\n    let index = 0;\n    let node = this._head;\n\n    while (node) {\n      action(node.value, index);\n      node = node.next;\n      index++;\n    }\n  }\n\n  toArray(): T[] {\n    const result: T[] = [];\n    let node = this._head;\n\n    while (node) {\n      result.push(node.value);\n      node = node.next;\n    }\n\n    return result;\n  }\n\n  // ========================================================================\n  // Private helpers\n  // ========================================================================\n\n  private getNode(index: number): Node<T> {\n    if (index < 0 || index >= this._size) {\n      throw new RangeError(`Index ${index} out of bounds for size ${this._size}`);\n    }\n\n    // Optimize: start from head or tail depending on index\n    if (index < this._size / 2) {\n      // Start from head\n      let node = this._head!;\n      for (let i = 0; i < index; i++) {\n        node = node.next!;\n      }\n      return node;\n    } else {\n      // Start from tail\n      let node = this._tail!;\n      for (let i = this._size - 1; i > index; i--) {\n        node = node.prev!;\n      }\n      return node;\n    }\n  }\n\n  private unlinkNode(node: Node<T>): T {\n    const value = node.value;\n\n    if (node.prev) {\n      node.prev.next = node.next;\n    } else {\n      this._head = node.next;\n    }\n\n    if (node.next) {\n      node.next.prev = node.prev;\n    } else {\n      this._tail = node.prev;\n    }\n\n    this._size--;\n    return value;\n  }\n\n  // ========================================================================\n  // Inspection\n  // ========================================================================\n\n  toString(): string {\n    return `LinkedList[${this.toArray().join(\", \")}]`;\n  }\n}\n\n/**\n * Factory function to make a LinkedList.\n *\n * @example\n * const list = linkedList<number>()\n * const listFromArray = linkedList([1, 2, 3])\n */\nexport function linkedList<T>(\n  optionsOrElements?: LinkedListOptions<T> | Iterable<T>\n): LinkedList<T> {\n  // Check if it's an iterable (not options)\n  if (optionsOrElements && Symbol.iterator in optionsOrElements) {\n    const list = new LinkedList<T>();\n    list.addAll(optionsOrElements as Iterable<T>);\n    return list;\n  }\n\n  return new LinkedList<T>(optionsOrElements as LinkedListOptions<T>);\n}\n","/**\n * HashSet implementation - A set backed by a HashMap.\n *\n * This module gives O(1) average case for add, remove, and contains operations.\n * Elements are unique based on custom equality and hash functions.\n * Mirrors java.util.HashSet.\n *\n * @example\n * const set = hashSet<number>()\n * set.add(1)\n * set.add(2)\n * set.add(1) // Returns false, already present\n * set.size // 2\n */\n\nimport type { Set } from \"../interfaces/set.js\";\nimport type { Eq, Hash } from \"../core/traits.js\";\nimport { HashMap } from \"./hash-map.js\";\nimport { defaultEq, defaultHash } from \"../utils/defaults.js\";\n\n/**\n * Dummy value used for the HashMap backing the set.\n */\nconst PRESENT = Symbol(\"PRESENT\");\n\n/**\n * Options for making a HashSet.\n */\nexport interface HashSetOptions<T> {\n  /**\n   * Initial capacity.\n   * @default 16\n   */\n  initialCapacity?: number;\n\n  /**\n   * Load factor threshold for resizing.\n   * @default 0.75\n   */\n  loadFactor?: number;\n\n  /**\n   * Equality function for elements.\n   * @default defaultEq (===)\n   */\n  eq?: Eq<T>;\n\n  /**\n   * Hash function for elements.\n   * @default defaultHash\n   */\n  hash?: Hash<T>;\n}\n\n/**\n * HashSet<T> - Hash table implementation of the Set interface.\n *\n * A HashMap holds the elements. Its values are a dummy constant.\n * This class gives constant-time performance for basic operations.\n *\n * Not thread-safe. Use synchronized() behavior for concurrent access.\n */\nexport class HashSet<T> implements Set<T> {\n  private readonly _map: HashMap<T, symbol>;\n  private readonly _eq: Eq<T>;\n\n  constructor(options: HashSetOptions<T> = {}) {\n    const {\n      initialCapacity = 16,\n      loadFactor = 0.75,\n      eq = defaultEq,\n      hash = defaultHash,\n    } = options;\n\n    this._eq = eq;\n    this._map = new HashMap<T, symbol>({\n      initialCapacity,\n      loadFactor,\n      keyEq: eq,\n      keyHash: hash,\n    });\n  }\n\n  // ========================================================================\n  // Size\n  // ========================================================================\n\n  get size(): number {\n    return this._map.size;\n  }\n\n  get isEmpty(): boolean {\n    return this._map.isEmpty;\n  }\n\n  get eq(): Eq<T> {\n    return this._eq;\n  }\n\n  // ========================================================================\n  // Core set operations\n  // ========================================================================\n\n  add(element: T): boolean {\n    const hadElement = this._map.has(element);\n    this._map.set(element, PRESENT);\n    return !hadElement;\n  }\n\n  remove(element: T): boolean {\n    return this._map.delete(element) !== undefined;\n  }\n\n  contains(element: T): boolean {\n    return this._map.has(element);\n  }\n\n  // ========================================================================\n  // Bulk operations\n  // ========================================================================\n\n  addAll(other: Iterable<T>): boolean {\n    let modified = false;\n    for (const element of other) {\n      if (this.add(element)) {\n        modified = true;\n      }\n    }\n    return modified;\n  }\n\n  removeAll(other: Iterable<T>): boolean {\n    let modified = false;\n    for (const element of other) {\n      if (this.remove(element)) {\n        modified = true;\n      }\n    }\n    return modified;\n  }\n\n  retainAll(other: Iterable<T>): boolean {\n    const toRetain = new globalThis.Set(other);\n    const toRemove: T[] = [];\n\n    for (const element of this) {\n      let shouldRetain = false;\n      for (const retainElement of toRetain) {\n        if (this._eq(element, retainElement)) {\n          shouldRetain = true;\n          break;\n        }\n      }\n      if (!shouldRetain) {\n        toRemove.push(element);\n      }\n    }\n\n    let modified = false;\n    for (const element of toRemove) {\n      this.remove(element);\n      modified = true;\n    }\n\n    return modified;\n  }\n\n  containsAll(other: Iterable<T>): boolean {\n    for (const element of other) {\n      if (!this.contains(element)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  clear(): void {\n    this._map.clear();\n  }\n\n  // ========================================================================\n  // Set operations (mathematical)\n  // ========================================================================\n\n  /**\n   * This method gives a new set that is the union of this set and the other set.\n   * The new set contains all elements from both sets.\n   */\n  union(other: Iterable<T>): HashSet<T> {\n    const result = this.clone();\n    result.addAll(other);\n    return result;\n  }\n\n  /**\n   * This method gives a new set that is the intersection of this set and the other set.\n   * The new set contains only elements present in both sets.\n   */\n  intersection(other: Iterable<T>): HashSet<T> {\n    const result = new HashSet<T>({ eq: this._eq });\n    for (const element of this) {\n      for (const otherElement of other) {\n        if (this._eq(element, otherElement)) {\n          result.add(element);\n          break;\n        }\n      }\n    }\n    return result;\n  }\n\n  /**\n   * This method gives a new set that is the difference of this set and the other set.\n   * The new set contains elements in this set but not in the other set.\n   */\n  difference(other: Iterable<T>): HashSet<T> {\n    const result = this.clone();\n    result.removeAll(other);\n    return result;\n  }\n\n  /**\n   * This method gives a new set that is the symmetric difference of this set and the other set.\n   * The new set contains elements in either set but not in both.\n   */\n  symmetricDifference(other: Iterable<T>): HashSet<T> {\n    const result = this.union(other);\n    const inter = this.intersection(other);\n    result.removeAll(inter);\n    return result;\n  }\n\n  /**\n   * This method gives true if this set is a subset of the other set.\n   * All elements in this set are also in the other set.\n   */\n  isSubsetOf(other: Iterable<T>): boolean {\n    const otherSet = new HashSet<T>({ eq: this._eq });\n    otherSet.addAll(other);\n\n    for (const element of this) {\n      if (!otherSet.contains(element)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  /**\n   * This method gives true if this set is a superset of the other set.\n   * All elements in the other set are also in this set.\n   */\n  isSupersetOf(other: Iterable<T>): boolean {\n    for (const element of other) {\n      if (!this.contains(element)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  /**\n   * This method gives true if this set and the other set have no elements in common.\n   */\n  isDisjointFrom(other: Iterable<T>): boolean {\n    for (const element of other) {\n      if (this.contains(element)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  // ========================================================================\n  // Iteration\n  // ========================================================================\n\n  *[Symbol.iterator](): Iterator<T> {\n    for (const entry of this._map) {\n      yield entry.key;\n    }\n  }\n\n  forEach(action: (element: T, index: number) => void): void {\n    let index = 0;\n    for (const element of this) {\n      action(element, index++);\n    }\n  }\n\n  toArray(): T[] {\n    return Array.from(this);\n  }\n\n  // ========================================================================\n  // Utility methods\n  // ========================================================================\n\n  /**\n   * This method makes a shallow copy of this set.\n   */\n  clone(): HashSet<T> {\n    const clone = new HashSet<T>({ eq: this._eq });\n    clone.addAll(this);\n    return clone;\n  }\n\n  /**\n   * This method gives statistics about the underlying hash table.\n   */\n  getStats(): ReturnType<HashMap<T, symbol>[\"getStats\"]> {\n    return this._map.getStats();\n  }\n\n  /**\n   * This method gives a string representation for debugging.\n   */\n  toString(): string {\n    return `HashSet{${this.toArray().join(\", \")}}`;\n  }\n}\n\n/**\n * Factory function to make a HashSet.\n *\n * @example\n * const set = hashSet<number>()\n * const setFromArray = hashSet([1, 2, 3, 2, 1]) // {1, 2, 3}\n * const setWithOptions = hashSet<string>({ initialCapacity: 32 })\n */\nexport function hashSet<T>(\n  optionsOrElements?: HashSetOptions<T> | Iterable<T>\n): HashSet<T> {\n  // Check if it's an iterable (not options)\n  if (optionsOrElements && Symbol.iterator in optionsOrElements) {\n    const set = new HashSet<T>();\n    set.addAll(optionsOrElements as Iterable<T>);\n    return set;\n  }\n\n  return new HashSet<T>(optionsOrElements as HashSetOptions<T>);\n}\n","/**\n * PriorityQueue implementation - A binary heap-based priority queue.\n *\n * Elements are ordered according to their natural ordering (through a comparator).\n * The head of the queue is the least element according to the comparator.\n * This module gives O(log n) enqueue and O(log n) dequeue operations.\n * Mirrors java.util.PriorityQueue.\n *\n * @example\n * const pq = priorityQueue<number>((a, b) => a - b) // Min heap\n * pq.offer(5)\n * pq.offer(2)\n * pq.offer(8)\n * pq.poll() // 2 (smallest element)\n */\n\nimport type { PriorityQueue as IPriorityQueue } from \"../interfaces/queue.js\";\nimport type { Eq, Compare } from \"../core/traits.js\";\nimport { defaultEq, defaultCompare } from \"../utils/defaults.js\";\n\n/**\n * Options for making a PriorityQueue.\n */\nexport interface PriorityQueueOptions<T> {\n  /**\n   * Initial capacity of the heap.\n   * @default 11\n   */\n  initialCapacity?: number;\n\n  /**\n   * Comparator for ordering elements.\n   * Lower values have higher priority (min heap).\n   * @default defaultCompare\n   */\n  compare?: Compare<T>;\n\n  /**\n   * Equality function for elements.\n   * @default defaultEq\n   */\n  eq?: Eq<T>;\n}\n\n/**\n * PriorityQueue<T> - Binary heap implementation of priority queue.\n *\n * Elements are always retrieved in priority order (according to comparator).\n * Not a FIFO queue - order depends on priority, not insertion order.\n *\n * The heap is a min heap by default (smallest element has highest priority).\n * For max heap, use reversed comparator: (a, b) => compare(b, a)\n *\n * Not thread-safe. Use synchronized() behavior for concurrent access.\n */\nexport class PriorityQueue<T> implements IPriorityQueue<T> {\n  private _heap: T[];\n  private readonly _compare: Compare<T>;\n  private readonly _eq: Eq<T>;\n\n  constructor(options: PriorityQueueOptions<T> = {}) {\n    const {\n      compare = defaultCompare,\n      eq = defaultEq,\n    } = options;\n\n    // The heap starts empty: a JavaScript array grows by itself, so initialCapacity is only a\n    // hint. (Before, `new Array(initialCapacity)` made 11 holes: an empty queue had size 11,\n    // and the heap compared holes. BUGS-2026-07 C9.)\n    this._heap = [];\n    this._compare = compare;\n    this._eq = eq;\n  }\n\n  // ========================================================================\n  // Size\n  // ========================================================================\n\n  get size(): number {\n    return this._heap.length;\n  }\n\n  get isEmpty(): boolean {\n    return this._heap.length === 0;\n  }\n\n  get eq(): Eq<T> {\n    return this._eq;\n  }\n\n  get compare(): Compare<T> {\n    return this._compare;\n  }\n\n  get comparator(): Compare<T> {\n    return this._compare;\n  }\n\n  // ========================================================================\n  // Priority queue operations\n  // ========================================================================\n\n  offer(element: T): boolean {\n    this._heap.push(element);\n    this.bubbleUp(this._heap.length - 1);\n    return true;\n  }\n\n  poll(): T {\n    if (this.isEmpty) {\n      throw new Error(\"Priority queue is empty\");\n    }\n    return this.pollOrUndefined()!;\n  }\n\n  pollOrUndefined(): T | undefined {\n    if (this.isEmpty) {\n      return undefined;\n    }\n\n    const result = this._heap[0];\n\n    if (this._heap.length === 1) {\n      this._heap.pop();\n    } else {\n      this._heap[0] = this._heap.pop()!;\n      this.bubbleDown(0);\n    }\n\n    return result;\n  }\n\n  peek(): T {\n    if (this.isEmpty) {\n      throw new Error(\"Priority queue is empty\");\n    }\n    return this._heap[0]!;\n  }\n\n  peekOrUndefined(): T | undefined {\n    return this.isEmpty ? undefined : this._heap[0];\n  }\n\n  // ========================================================================\n  // Queue interface compatibility\n  // ========================================================================\n\n  enqueue(element: T): boolean {\n    return this.offer(element);\n  }\n\n  dequeue(): T {\n    return this.poll();\n  }\n\n  // ========================================================================\n  // Collection operations\n  // ========================================================================\n\n  add(element: T): boolean {\n    return this.offer(element);\n  }\n\n  addAll(other: Iterable<T>): boolean {\n    let modified = false;\n    for (const element of other) {\n      this.offer(element);\n      modified = true;\n    }\n    return modified;\n  }\n\n  contains(element: T): boolean {\n    for (const item of this._heap) {\n      if (this._eq(item, element)) {\n        return true;\n      }\n    }\n    return false;\n  }\n\n  containsAll(other: Iterable<T>): boolean {\n    for (const element of other) {\n      if (!this.contains(element)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  remove(element: T): boolean {\n    const index = this._heap.findIndex((item) => this._eq(item, element));\n    if (index === -1) {\n      return false;\n    }\n\n    if (index === this._heap.length - 1) {\n      this._heap.pop();\n    } else {\n      this._heap[index] = this._heap.pop()!;\n      this.bubbleDown(index);\n      this.bubbleUp(index);\n    }\n\n    return true;\n  }\n\n  removeAll(other: Iterable<T>): boolean {\n    let modified = false;\n    for (const element of other) {\n      while (this.remove(element)) {\n        modified = true;\n      }\n    }\n    return modified;\n  }\n\n  retainAll(other: Iterable<T>): boolean {\n    const toRetain = new Set(other);\n    const newHeap: T[] = [];\n\n    for (const element of this._heap) {\n      let shouldRetain = false;\n      for (const retainElement of toRetain) {\n        if (this._eq(element, retainElement)) {\n          shouldRetain = true;\n          break;\n        }\n      }\n      if (shouldRetain) {\n        newHeap.push(element);\n      }\n    }\n\n    const modified = newHeap.length !== this._heap.length;\n    this._heap = newHeap;\n    this.heapify();\n\n    return modified;\n  }\n\n  clear(): void {\n    this._heap = [];\n  }\n\n  // ========================================================================\n  // Iteration\n  // ========================================================================\n\n  /**\n   * Iterator gives elements in arbitrary order (not priority order).\n   * To get elements in priority order, repeatedly call poll().\n   */\n  *[Symbol.iterator](): Iterator<T> {\n    yield* this._heap;\n  }\n\n  forEach(action: (element: T, index: number) => void): void {\n    this._heap.forEach((element, index) => action(element, index));\n  }\n\n  /**\n   * This method gives elements in arbitrary heap order (not sorted).\n   */\n  toArray(): T[] {\n    return this._heap.slice();\n  }\n\n  /**\n   * This method gives elements in priority order (sorted).\n   * This is a destructive operation that drains the queue.\n   */\n  toSortedArray(): T[] {\n    const result: T[] = [];\n    const clone = this.clone();\n\n    while (!clone.isEmpty) {\n      result.push(clone.poll());\n    }\n\n    return result;\n  }\n\n  // ========================================================================\n  // Heap operations\n  // ========================================================================\n\n  /**\n   * This method bubbles an element up the heap to maintain heap property.\n   */\n  private bubbleUp(index: number): void {\n    const element = this._heap[index]!;\n\n    while (index > 0) {\n      const parentIndex = Math.floor((index - 1) / 2);\n      const parent = this._heap[parentIndex]!;\n\n      if (this._compare(element, parent) >= 0) {\n        break;\n      }\n\n      this._heap[index] = parent;\n      index = parentIndex;\n    }\n\n    this._heap[index] = element;\n  }\n\n  /**\n   * This method bubbles an element down the heap to maintain heap property.\n   *\n   * The element moves down through a hole: a smaller child moves up into the hole, and the\n   * element goes into the last hole. The children are compared with the element.\n   * Before, they were compared with `_heap[index]`. After the first step, that value is a copy of\n   * the child that moved up. Thus a poll could leave a larger element above a smaller one.\n   */\n  private bubbleDown(index: number): void {\n    const length = this._heap.length;\n    const element = this._heap[index]!;\n\n    while (true) {\n      const leftChildIndex = 2 * index + 1;\n      const rightChildIndex = 2 * index + 2;\n      if (leftChildIndex >= length) {\n        break;\n      }\n\n      let childIndex = leftChildIndex;\n      if (\n        rightChildIndex < length &&\n        this._compare(this._heap[rightChildIndex]!, this._heap[leftChildIndex]!) < 0\n      ) {\n        childIndex = rightChildIndex;\n      }\n\n      if (this._compare(this._heap[childIndex]!, element) >= 0) {\n        break;\n      }\n\n      this._heap[index] = this._heap[childIndex]!;\n      index = childIndex;\n    }\n\n    this._heap[index] = element;\n  }\n\n  /**\n   * This method rebuilds the heap from an arbitrary array.\n   * This method uses Floyd's algorithm (O(n) time).\n   */\n  private heapify(): void {\n    // Start from last non-leaf node and bubble down\n    for (let i = Math.floor(this._heap.length / 2) - 1; i >= 0; i--) {\n      this.bubbleDown(i);\n    }\n  }\n\n  // ========================================================================\n  // Utility methods\n  // ========================================================================\n\n  /**\n   * This method makes a shallow copy of this priority queue.\n   */\n  clone(): PriorityQueue<T> {\n    const clone = new PriorityQueue<T>({\n      compare: this._compare,\n      eq: this._eq,\n    });\n    clone._heap = this._heap.slice();\n    return clone;\n  }\n\n  /**\n   * This method validates the heap property (for debugging).\n   * This method gives true if the heap is valid.\n   */\n  validate(): boolean {\n    for (let i = 0; i < this._heap.length; i++) {\n      const leftChildIndex = 2 * i + 1;\n      const rightChildIndex = 2 * i + 2;\n\n      if (\n        leftChildIndex < this._heap.length &&\n        this._compare(this._heap[i]!, this._heap[leftChildIndex]!) > 0\n      ) {\n        return false;\n      }\n\n      if (\n        rightChildIndex < this._heap.length &&\n        this._compare(this._heap[i]!, this._heap[rightChildIndex]!) > 0\n      ) {\n        return false;\n      }\n    }\n\n    return true;\n  }\n\n  /**\n   * This method gives a string representation for debugging.\n   */\n  toString(): string {\n    return `PriorityQueue[${this._heap.join(\", \")}]`;\n  }\n}\n\n/**\n * Factory function to make a PriorityQueue.\n *\n * @example\n * // Min heap (default)\n * const minHeap = priorityQueue<number>()\n *\n * // Max heap\n * const maxHeap = priorityQueue<number>((a, b) => b - a)\n *\n * // From array\n * const pq = priorityQueue([5, 2, 8, 1, 9])\n *\n * // With custom comparator\n * const pq = priorityQueue<Task>((a, b) => a.priority - b.priority)\n */\nexport function priorityQueue<T>(\n  optionsOrElementsOrComparator?:\n    | PriorityQueueOptions<T>\n    | Iterable<T>\n    | Compare<T>\n): PriorityQueue<T> {\n  // If it's a function, treat it as a comparator\n  if (typeof optionsOrElementsOrComparator === \"function\") {\n    return new PriorityQueue<T>({\n      compare: optionsOrElementsOrComparator as Compare<T>,\n    });\n  }\n\n  // Check if it's an iterable (not options)\n  if (optionsOrElementsOrComparator && Symbol.iterator in optionsOrElementsOrComparator) {\n    const pq = new PriorityQueue<T>();\n    pq.addAll(optionsOrElementsOrComparator as Iterable<T>);\n    return pq;\n  }\n\n  return new PriorityQueue<T>(\n    optionsOrElementsOrComparator as PriorityQueueOptions<T>\n  );\n}\n","/**\n * SummaryTree: a persistent sequence of leaves with a summary of each part.\n *\n * The tree is a balanced binary tree (AVL) with one leaf in each node. Each node keeps the summary of its subtree.\n * A summary is a value of a monoid: the caller gives the monoid as data, with `empty` and `combine`. The order of the\n * leaves is kept, so `combine` must be associative, but it can be non-commutative.\n *\n * Each operation gives a new tree and keeps the old tree. The two trees share the nodes that did not change.\n * Concatenation, a split at an index or at a summary search, an edit and a lookup are O(log n).\n *\n * The algorithms are the \"join\" algorithms of Blelloch, Ferizovic and Sun, \"Just Join for Parallel Ordered Sets\"\n * (SPAA 2016).\n *\n * @example\n * // The number of leaves and the total length of the strings\n * const spec = {\n *   monoid: { empty: { count: 0, length: 0 }, combine: (a, b) => ({ count: a.count + b.count, length: a.length + b.length }) },\n *   measure: (leaf: string) => ({ count: 1, length: leaf.length }),\n * };\n * const tree = summaryTree(spec, [\"ab\", \"cde\", \"f\"]);\n * tree.summary; // { count: 3, length: 6 }\n * const [left, right] = tree.split((prefix) => prefix.length > 2); // left: [\"ab\"], right: [\"cde\", \"f\"]\n */\n\n/** A monoid as data: the identity value `empty` and an associative operation `combine`. */\nexport interface SummaryMonoid<Summary> {\n  /** The summary of a sequence with no leaf. `combine(empty, s)` and `combine(s, empty)` are equal to `s`. */\n  readonly empty: Summary;\n  /** This function gives the summary of a sequence from the summaries of its two parts, left first. */\n  readonly combine: (left: Summary, right: Summary) => Summary;\n}\n\n/** The data that a tree needs: the monoid of the summaries and the summary of one leaf. */\nexport interface SummarySpec<Leaf, Summary> {\n  readonly monoid: SummaryMonoid<Summary>;\n  /** This function gives the summary of one leaf. */\n  readonly measure: (leaf: Leaf) => Summary;\n  /**\n   * This optional function joins two neighbor leaves at a seam into one leaf, or gives `undefined` to keep both. A seam\n   * is the place where `concat`, `append`, `prepend`, `splice`, `insert` or `remove` puts two leaves next to each other.\n   * The tree calls it once at each seam, and not between the leaves that one call inserts. `set` does not call it.\n   */\n  readonly merge?: (left: Leaf, right: Leaf) => Leaf | undefined;\n}\n\n/** The result of a summary search: the first leaf whose prefix summary satisfies the predicate. */\nexport interface SummarySearch<Leaf, Summary> {\n  /** The index of the leaf. */\n  readonly index: number;\n  readonly leaf: Leaf;\n  /** The summary of the leaves before the leaf. */\n  readonly before: Summary;\n  /** The summary of the leaves before the leaf, and of the leaf. */\n  readonly through: Summary;\n}\n\n/** The result of `locate`: the leaf that holds a position of an additive key, and the position in that leaf. */\nexport interface SummaryLocation<Leaf> {\n  /** The index of the leaf. */\n  readonly index: number;\n  readonly leaf: Leaf;\n  /** The position in the leaf: the target minus the key of the leaves before the leaf. */\n  readonly offset: number;\n}\n\n/** One node of the tree. The tree does not change a node after it makes it. */\ninterface Node<Leaf, Summary> {\n  readonly left: Node<Leaf, Summary> | null;\n  readonly leaf: Leaf;\n  /** The summary of the leaf of this node only. */\n  readonly own: Summary;\n  /** The summary of the leaves of the left subtree and the leaf of this node. A copy with the same left subtree and leaf keeps it. */\n  readonly inner: Summary;\n  readonly right: Node<Leaf, Summary> | null;\n  readonly height: number;\n  readonly size: number;\n  /** The summary of all the leaves of this subtree. */\n  readonly summary: Summary;\n}\n\ntype Tree<Leaf, Summary> = Node<Leaf, Summary> | null;\n\nfunction heightOf<L, S>(tree: Tree<L, S>): number {\n  return tree === null ? 0 : tree.height;\n}\n\nfunction sizeOf<L, S>(tree: Tree<L, S>): number {\n  return tree === null ? 0 : tree.size;\n}\n\n/** The functions that make and join nodes for one monoid. */\nclass Builder<L, S> {\n  readonly spec: SummarySpec<L, S>;\n\n  constructor(spec: SummarySpec<L, S>) {\n    this.spec = spec;\n  }\n\n  summaryOf(tree: Tree<L, S>): S {\n    return tree === null ? this.spec.monoid.empty : tree.summary;\n  }\n\n  /** This function makes a node. Give `inner` only when it is the summary of `left` and `own`, to save one `combine`. */\n  node(left: Tree<L, S>, leaf: L, own: S, right: Tree<L, S>, inner?: S): Node<L, S> {\n    if (inner === undefined) inner = left === null ? own : this.spec.monoid.combine(left.summary, own);\n    return {\n      left,\n      leaf,\n      own,\n      inner,\n      right,\n      height: 1 + Math.max(heightOf(left), heightOf(right)),\n      size: sizeOf(left) + 1 + sizeOf(right),\n      summary: right === null ? inner : this.spec.monoid.combine(inner, right.summary),\n    };\n  }\n\n  /** This function copies a node with a new right subtree. It keeps the summary `inner`, so it calls `combine` once at most. */\n  withRight(n: Node<L, S>, right: Tree<L, S>): Node<L, S> {\n    return this.node(n.left, n.leaf, n.own, right, n.inner);\n  }\n\n  rotateLeft(n: Node<L, S>): Node<L, S> {\n    const r = n.right!;\n    return this.node(this.withRight(n, r.left), r.leaf, r.own, r.right);\n  }\n\n  rotateRight(n: Node<L, S>): Node<L, S> {\n    const l = n.left!;\n    return this.withRight(l, this.node(l.right, n.leaf, n.own, n.right));\n  }\n\n  /** This function joins a tree that is higher by more than 1 with a leaf and a lower tree on its right. */\n  joinRight(left: Node<L, S>, leaf: L, own: S, right: Tree<L, S>): Node<L, S> {\n    const c = left.right;\n    if (heightOf(c) <= heightOf(right) + 1) {\n      const t = this.node(c, leaf, own, right);\n      if (t.height <= heightOf(left.left) + 1) return this.withRight(left, t);\n      return this.rotateLeft(this.withRight(left, this.rotateRight(t)));\n    }\n    const t = this.joinRight(c!, leaf, own, right);\n    const joined = this.withRight(left, t);\n    return t.height <= heightOf(left.left) + 1 ? joined : this.rotateLeft(joined);\n  }\n\n  /** This function joins a lower tree on the left with a leaf and a tree that is higher by more than 1. */\n  joinLeft(left: Tree<L, S>, leaf: L, own: S, right: Node<L, S>, inner?: S): Node<L, S> {\n    const c = right.left;\n    if (heightOf(c) <= heightOf(left) + 1) {\n      const t = this.node(left, leaf, own, c, inner);\n      if (t.height <= heightOf(right.right) + 1) return this.node(t, right.leaf, right.own, right.right);\n      return this.rotateRight(this.node(this.rotateLeft(t), right.leaf, right.own, right.right));\n    }\n    const t = this.joinLeft(left, leaf, own, c!, inner);\n    const joined = this.node(t, right.leaf, right.own, right.right);\n    return t.height <= heightOf(right.right) + 1 ? joined : this.rotateRight(joined);\n  }\n\n  /**\n   * This function gives the tree of the leaves of `left`, then `leaf`, then the leaves of `right`. Give `inner` only\n   * when it is the summary of `left` and `own`.\n   */\n  join(left: Tree<L, S>, leaf: L, own: S, right: Tree<L, S>, inner?: S): Node<L, S> {\n    if (heightOf(left) > heightOf(right) + 1) return this.joinRight(left!, leaf, own, right);\n    if (heightOf(right) > heightOf(left) + 1) return this.joinLeft(left, leaf, own, right!, inner);\n    return this.node(left, leaf, own, right, inner);\n  }\n\n  /** This function removes the last leaf of a tree, and gives the rest and the node of that leaf. */\n  splitLast(tree: Node<L, S>): [Tree<L, S>, Node<L, S>] {\n    if (tree.right === null) return [tree.left, tree];\n    const [rest, last] = this.splitLast(tree.right);\n    return [this.join(tree.left, tree.leaf, tree.own, rest, tree.inner), last];\n  }\n\n  concat(left: Tree<L, S>, right: Tree<L, S>): Tree<L, S> {\n    if (left === null) return right;\n    if (right === null) return left;\n    const [rest, last] = this.splitLast(left);\n    return this.join(rest, last.leaf, last.own, right);\n  }\n\n  /** This function splits a tree into its first `index` leaves and the other leaves. */\n  splitAt(tree: Tree<L, S>, index: number): [Tree<L, S>, Tree<L, S>] {\n    if (tree === null) return [null, null];\n    const before = sizeOf(tree.left);\n    if (index <= before) {\n      const [a, b] = this.splitAt(tree.left, index);\n      return [a, this.join(b, tree.leaf, tree.own, tree.right)];\n    }\n    const [a, b] = this.splitAt(tree.right, index - before - 1);\n    return [this.join(tree.left, tree.leaf, tree.own, a, tree.inner), b];\n  }\n\n  /** This function splits a tree before the first leaf whose prefix summary, after `acc`, satisfies the predicate. */\n  splitBy(tree: Tree<L, S>, predicate: (prefix: S) => boolean, acc: S): [Tree<L, S>, Tree<L, S>] {\n    if (tree === null) return [null, null];\n    const { combine } = this.spec.monoid;\n    const throughLeft = tree.left === null ? acc : combine(acc, tree.left.summary);\n    if (tree.left !== null && predicate(throughLeft)) {\n      const [a, b] = this.splitBy(tree.left, predicate, acc);\n      return [a, this.join(b, tree.leaf, tree.own, tree.right)];\n    }\n    const throughLeaf = combine(throughLeft, tree.own);\n    if (predicate(throughLeaf)) return [tree.left, this.join(null, tree.leaf, tree.own, tree.right)];\n    const [a, b] = this.splitBy(tree.right, predicate, throughLeaf);\n    return [this.join(tree.left, tree.leaf, tree.own, a, tree.inner), b];\n  }\n\n  /** This function replaces the leaf at an index in the tree. It copies only the path to the leaf. */\n  replaceAt(tree: Node<L, S>, index: number, leaf: L, own: S): Node<L, S> {\n    const before = sizeOf(tree.left);\n    if (index === before) return this.node(tree.left, leaf, own, tree.right);\n    if (index < before) return this.node(this.replaceAt(tree.left!, index, leaf, own), tree.leaf, tree.own, tree.right);\n    return this.withRight(tree, this.replaceAt(tree.right!, index - before - 1, leaf, own));\n  }\n\n  /** This function puts one leaf before the leaf at an index. It copies only the path, and `join` keeps the balance. */\n  insertAt(tree: Tree<L, S>, index: number, leaf: L, own: S): Node<L, S> {\n    if (tree === null) return this.node(null, leaf, own, null);\n    const before = sizeOf(tree.left);\n    if (index <= before) return this.join(this.insertAt(tree.left, index, leaf, own), tree.leaf, tree.own, tree.right);\n    return this.join(tree.left, tree.leaf, tree.own, this.insertAt(tree.right, index - before - 1, leaf, own), tree.inner);\n  }\n\n  /**\n   * This function replaces the leaf at an index with one or more leaves. It descends once.\n   * At the node of the leaf, it puts the first new leaf in the node.\n   * It puts the other new leaves at the start of the right subtree of that node.\n   */\n  replaceSpan(tree: Node<L, S>, index: number, leaves: readonly L[]): Node<L, S> {\n    const before = sizeOf(tree.left);\n    if (index < before) return this.join(this.replaceSpan(tree.left!, index, leaves), tree.leaf, tree.own, tree.right);\n    if (index > before) return this.join(tree.left, tree.leaf, tree.own, this.replaceSpan(tree.right!, index - before - 1, leaves), tree.inner);\n    let right = tree.right;\n    for (let i = 1; i < leaves.length; i++) right = this.insertAt(right, i - 1, leaves[i]!, this.spec.measure(leaves[i]!));\n    return this.join(tree.left, leaves[0]!, this.spec.measure(leaves[0]!), right);\n  }\n\n  /** This function removes the leaf at an index. It copies only the path, and `join` keeps the balance. */\n  removeAt(tree: Node<L, S>, index: number): Tree<L, S> {\n    const before = sizeOf(tree.left);\n    if (index === before) return this.concat(tree.left, tree.right);\n    if (index < before) return this.join(this.removeAt(tree.left!, index), tree.leaf, tree.own, tree.right);\n    return this.join(tree.left, tree.leaf, tree.own, this.removeAt(tree.right!, index - before - 1), tree.inner);\n  }\n\n  /** This function gives the leaf at an index of the tree. The index must be in the tree. */\n  leafAt(tree: Node<L, S>, index: number): L {\n    let node = tree;\n    for (;;) {\n      const before = sizeOf(node.left);\n      if (index === before) return node.leaf;\n      if (index < before) node = node.left!;\n      else {\n        index -= before + 1;\n        node = node.right!;\n      }\n    }\n  }\n\n  /** This function joins the leaves at `index` and `index + 1` when `spec.merge` gives one leaf for them. */\n  seam(tree: Tree<L, S>, index: number): Tree<L, S> {\n    const { merge } = this.spec;\n    if (merge === undefined || tree === null || index < 0 || index + 1 >= tree.size) return tree;\n    const merged = merge(this.leafAt(tree, index), this.leafAt(tree, index + 1));\n    if (merged === undefined) return tree;\n    return this.removeAt(this.replaceAt(tree, index, merged, this.spec.measure(merged)), index + 1);\n  }\n\n  /** This function makes a balanced tree of the leaves `items[lo]` to `items[hi - 1]`. */\n  build(items: readonly L[], lo: number, hi: number): Tree<L, S> {\n    if (lo >= hi) return null;\n    const mid = (lo + hi) >>> 1;\n    const leaf = items[mid]!;\n    return this.node(this.build(items, lo, mid), leaf, this.spec.measure(leaf), this.build(items, mid + 1, hi));\n  }\n}\n\n/** The largest number of removed and inserted leaves for which `splice` copies paths instead of splitting the tree. */\nconst SMALL_EDIT = 8;\n\n/** The builders of each spec. Each spec has one builder, so that two trees of the same spec can be joined. */\nconst builders = new WeakMap<object, Builder<unknown, unknown>>();\n\nfunction builderOf<L, S>(spec: SummarySpec<L, S>): Builder<L, S> {\n  let builder = builders.get(spec) as Builder<L, S> | undefined;\n  if (builder === undefined) {\n    builder = new Builder(spec);\n    builders.set(spec, builder as Builder<unknown, unknown>);\n  }\n  return builder;\n}\n\nfunction* walk<L, S>(tree: Tree<L, S>): Generator<L, void, undefined> {\n  // An explicit stack: the depth of the tree is O(log n), so the stack stays small\n  const stack: Node<L, S>[] = [];\n  let node = tree;\n  while (node !== null || stack.length > 0) {\n    while (node !== null) {\n      stack.push(node);\n      node = node.left;\n    }\n    const top = stack.pop()!;\n    yield top.leaf;\n    node = top.right;\n  }\n}\n\n/** This function gives the index of a leaf, with a negative index counted from the end, or -1 when it is not in the tree. */\nfunction indexOf(index: number, size: number): number {\n  if (!Number.isInteger(index)) return -1;\n  const at = index < 0 ? size + index : index;\n  return at >= 0 && at < size ? at : -1;\n}\n\nfunction clamp(value: number, size: number): number {\n  if (Number.isNaN(value)) return 0;\n  const whole = Math.trunc(value);\n  return whole < 0 ? Math.max(0, size + whole) : Math.min(whole, size);\n}\n\n/**\n * A persistent sequence of leaves with a summary of each part. Make one with `summaryTree`. Each method that changes\n * the sequence gives a new tree.\n */\nexport class SummaryTree<Leaf, Summary> implements Iterable<Leaf> {\n  private readonly builder: Builder<Leaf, Summary>;\n  private readonly root: Tree<Leaf, Summary>;\n\n  private constructor(builder: Builder<Leaf, Summary>, root: Tree<Leaf, Summary>) {\n    this.builder = builder;\n    this.root = root;\n  }\n\n  /** This function makes a tree of a spec from leaves, as `summaryTree` does. */\n  static of<Leaf, Summary>(spec: SummarySpec<Leaf, Summary>, leaves: Iterable<Leaf> = []): SummaryTree<Leaf, Summary> {\n    const builder = builderOf(spec);\n    const items = [...leaves];\n    return new SummaryTree(builder, builder.build(items, 0, items.length));\n  }\n\n  private wrap(root: Tree<Leaf, Summary>): SummaryTree<Leaf, Summary> {\n    return root === this.root ? this : new SummaryTree(this.builder, root);\n  }\n\n  private treeOf(leaves: Iterable<Leaf> | SummaryTree<Leaf, Summary>): Tree<Leaf, Summary> {\n    if (leaves instanceof SummaryTree) {\n      if (leaves.builder !== this.builder) throw new TypeError(\"SummaryTree: the two trees have different specs\");\n      return leaves.root;\n    }\n    const items = [...leaves];\n    return this.builder.build(items, 0, items.length);\n  }\n\n  /** The spec of the tree: its monoid and its measure. */\n  get spec(): SummarySpec<Leaf, Summary> {\n    return this.builder.spec;\n  }\n\n  /** The number of leaves. */\n  get size(): number {\n    return sizeOf(this.root);\n  }\n\n  get isEmpty(): boolean {\n    return this.root === null;\n  }\n\n  /** The summary of all the leaves, in their order. An empty tree has the summary `monoid.empty`. */\n  get summary(): Summary {\n    return this.builder.summaryOf(this.root);\n  }\n\n  /** The height of the tree: 0 for an empty tree. The height is at most 1.45 log2(size + 2). */\n  get height(): number {\n    return heightOf(this.root);\n  }\n\n  /**\n   * This function gives the leaf at an index, or `undefined` when the index is not in the tree. A negative index counts\n   * from the end, as `Array.prototype.at` does.\n   */\n  at(index: number): Leaf | undefined {\n    index = indexOf(index, this.size);\n    return index === -1 ? undefined : this.builder.leafAt(this.root!, index);\n  }\n\n  /** This function gives the summary of the leaves from `start` to `end`, with `end` not included. */\n  summaryOf(start = 0, end: number = this.size): Summary {\n    return this.slice(start, end).summary;\n  }\n\n  /** This function gives the tree of the leaves of this tree, then the leaves of `other`. The two trees must have the same spec. */\n  concat(other: SummaryTree<Leaf, Summary> | Iterable<Leaf>): SummaryTree<Leaf, Summary> {\n    const joined = this.builder.concat(this.root, this.treeOf(other));\n    return this.wrap(this.builder.seam(joined, this.size - 1));\n  }\n\n  /** This function splits the tree into its first `index` leaves and the other leaves. */\n  splitAt(index: number): [SummaryTree<Leaf, Summary>, SummaryTree<Leaf, Summary>] {\n    const [left, right] = this.builder.splitAt(this.root, clamp(index, this.size));\n    return [this.wrap(left), this.wrap(right)];\n  }\n\n  /**\n   * This function splits the tree before the first leaf whose prefix summary satisfies the predicate. The prefix of a\n   * leaf includes the leaf. The predicate must be monotone: after it is true for a prefix, it is true for each longer\n   * prefix. When no prefix satisfies it, the right tree is empty.\n   */\n  split(predicate: (prefix: Summary) => boolean): [SummaryTree<Leaf, Summary>, SummaryTree<Leaf, Summary>] {\n    const [left, right] = this.builder.splitBy(this.root, predicate, this.builder.spec.monoid.empty);\n    return [this.wrap(left), this.wrap(right)];\n  }\n\n  /**\n   * This function finds the first leaf whose prefix summary satisfies a monotone predicate, as `split` does. It changes\n   * nothing. It gives `undefined` when no prefix satisfies the predicate.\n   */\n  search(predicate: (prefix: Summary) => boolean): SummarySearch<Leaf, Summary> | undefined {\n    const { combine } = this.builder.spec.monoid;\n    let node = this.root;\n    let acc = this.builder.spec.monoid.empty;\n    let index = 0;\n    while (node !== null) {\n      const throughLeft = node.left === null ? acc : combine(acc, node.left.summary);\n      if (node.left !== null && predicate(throughLeft)) {\n        node = node.left;\n        continue;\n      }\n      const through = combine(throughLeft, node.own);\n      if (predicate(through)) return { index: index + sizeOf(node.left), leaf: node.leaf, before: throughLeft, through };\n      index += sizeOf(node.left) + 1;\n      acc = through;\n      node = node.right;\n    }\n    return undefined;\n  }\n\n  /**\n   * This function finds the leaf that holds a position of an additive key, and it calls no `combine`. The key must be\n   * additive and not negative: `key(combine(a, b))` is `key(a) + key(b)`. The function descends by the key of each left\n   * subtree and of each leaf, and subtracts it from the target. It gives the first leaf whose prefix key is more than\n   * the target, or `undefined` when the target is not in `[0, key(summary))`.\n   *\n   * @example\n   * // The leaf and the offset in it of the code unit at position 1000 of a rope\n   * const at = rope.locate((s) => s.length, 1000);\n   */\n  locate(key: (summary: Summary) => number, target: number): SummaryLocation<Leaf> | undefined {\n    if (!(target >= 0)) return undefined;\n    let node = this.root;\n    let index = 0;\n    let rest = target;\n    while (node !== null) {\n      if (node.left !== null) {\n        const left = key(node.left.summary);\n        if (rest < left) {\n          node = node.left;\n          continue;\n        }\n        rest -= left;\n        index += node.left.size;\n      }\n      const own = key(node.own);\n      if (rest < own) return { index, leaf: node.leaf, offset: rest };\n      rest -= own;\n      index += 1;\n      node = node.right;\n    }\n    return undefined;\n  }\n\n  /** This function gives the tree of the leaves from `start` to `end`, with `end` not included. A negative index counts from the end. */\n  slice(start = 0, end: number = this.size): SummaryTree<Leaf, Summary> {\n    const from = clamp(start, this.size);\n    const to = clamp(end, this.size);\n    if (to <= from) return this.wrap(null);\n    const [, rest] = this.builder.splitAt(this.root, from);\n    const [middle] = this.builder.splitAt(rest, to - from);\n    return this.wrap(middle);\n  }\n\n  /**\n   * This function removes `deleteCount` leaves at `start` and puts the leaves of `inserted` there, as\n   * `Array.prototype.splice` does. It gives the new tree, not the removed leaves.\n   */\n  splice(start: number, deleteCount: number = this.size, inserted: SummaryTree<Leaf, Summary> | Iterable<Leaf> = []): SummaryTree<Leaf, Summary> {\n    const from = clamp(start, this.size);\n    const count = Math.max(0, Math.min(Number.isNaN(deleteCount) ? 0 : Math.trunc(deleteCount), this.size - from));\n    const builder = this.builder;\n    const leaves = inserted instanceof SummaryTree ? undefined : [...inserted];\n    const added = leaves === undefined ? (inserted as SummaryTree<Leaf, Summary>).size : leaves.length;\n    if (count === 0 && added === 0) return this;\n    let root = this.root;\n    if (leaves !== undefined && count + added <= SMALL_EDIT) {\n      // A small edit copies only the paths to its leaves: 1 or 2 combines for each level of each path\n      const replaced = Math.min(count, added);\n      if (count > 0 && added > count) {\n        // The last removed leaf takes all the extra leaves in one descent\n        for (let i = 0; i < count - 1; i++) root = builder.replaceAt(root!, from + i, leaves[i]!, builder.spec.measure(leaves[i]!));\n        root = builder.replaceSpan(root!, from + count - 1, leaves.slice(count - 1));\n      } else for (let i = 0; i < added; i++) {\n        const leaf = leaves[i]!;\n        const own = builder.spec.measure(leaf);\n        root = i < replaced ? builder.replaceAt(root!, from + i, leaf, own) : builder.insertAt(root, from + i, leaf, own);\n      }\n      for (let i = replaced; i < count; i++) root = builder.removeAt(root!, from + added);\n    } else {\n      const middle = leaves === undefined ? this.treeOf(inserted) : builder.build(leaves, 0, leaves.length);\n      const [left, rest] = builder.splitAt(root, from);\n      const [, right] = builder.splitAt(rest, count);\n      root = builder.concat(builder.concat(left, middle), right);\n    }\n    // The right seam first, so that a merge there does not move the index of the left seam\n    if (added > 0) root = builder.seam(root, from + added - 1);\n    return this.wrap(builder.seam(root, from - 1));\n  }\n\n  /** This function puts the leaves of `inserted` before the leaf at `index`. */\n  insert(index: number, inserted: SummaryTree<Leaf, Summary> | Iterable<Leaf>): SummaryTree<Leaf, Summary> {\n    return this.splice(index, 0, inserted);\n  }\n\n  /** This function removes the leaves from `start` to `end`, with `end` not included. */\n  remove(start: number, end: number = this.size): SummaryTree<Leaf, Summary> {\n    const from = clamp(start, this.size);\n    return this.splice(from, Math.max(0, clamp(end, this.size) - from));\n  }\n\n  /**\n   * This function replaces the leaf at an index. A negative index counts from the end, as `Array.prototype.with` does.\n   * An index that is not in the tree changes nothing. It copies only the path to the leaf, and it does not call\n   * `spec.merge`.\n   */\n  set(index: number, leaf: Leaf): SummaryTree<Leaf, Summary> {\n    const at = indexOf(index, this.size);\n    return at === -1 ? this : this.wrap(this.builder.replaceAt(this.root!, at, leaf, this.builder.spec.measure(leaf)));\n  }\n\n  /** This function adds leaves after the last leaf. */\n  append(...leaves: Leaf[]): SummaryTree<Leaf, Summary> {\n    return this.concat(leaves);\n  }\n\n  /** This function adds leaves before the first leaf. */\n  prepend(...leaves: Leaf[]): SummaryTree<Leaf, Summary> {\n    const joined = this.builder.concat(this.treeOf(leaves), this.root);\n    return this.wrap(this.builder.seam(joined, leaves.length - 1));\n  }\n\n  /** This function gives the leaves in their order. */\n  [Symbol.iterator](): Iterator<Leaf> {\n    return walk(this.root);\n  }\n\n  /** This function gives the leaves in an array. */\n  toArray(): Leaf[] {\n    return [...walk(this.root)];\n  }\n}\n\n/**\n * This function makes a persistent tree of leaves with a summary of each part. Use the same `spec` object for each\n * tree that `concat` or `splice` joins.\n */\nexport function summaryTree<Leaf, Summary>(spec: SummarySpec<Leaf, Summary>, leaves: Iterable<Leaf> = []): SummaryTree<Leaf, Summary> {\n  return SummaryTree.of(spec, leaves);\n}\n\n/**\n * @internal This function examines the invariants of a tree: the AVL balance, the heights, the sizes and the\n * summaries. It gives a list of the faults, empty when there is no fault. The tests use it.\n */\nexport function summaryTreeFaults<Leaf, Summary>(tree: SummaryTree<Leaf, Summary>, equal: (a: Summary, b: Summary) => boolean): string[] {\n  const builder = tree[\"builder\"];\n  const faults: string[] = [];\n  const visit = (node: Tree<Leaf, Summary>, path: string): void => {\n    if (node === null) return;\n    visit(node.left, `${path}L`);\n    visit(node.right, `${path}R`);\n    const hl = heightOf(node.left);\n    const hr = heightOf(node.right);\n    if (Math.abs(hl - hr) > 1) faults.push(`${path}: balance ${hl - hr}`);\n    if (node.height !== 1 + Math.max(hl, hr)) faults.push(`${path}: height ${node.height}`);\n    if (node.size !== sizeOf(node.left) + 1 + sizeOf(node.right)) faults.push(`${path}: size ${node.size}`);\n    const { combine } = builder.spec.monoid;\n    const inner = combine(builder.summaryOf(node.left), builder.spec.measure(node.leaf));\n    if (!equal(node.inner, inner)) faults.push(`${path}: inner`);\n    if (!equal(node.summary, combine(inner, builder.summaryOf(node.right)))) faults.push(`${path}: summary`);\n  };\n  visit(tree[\"root\"], \"^\");\n  return faults;\n}\n","/**\n * The check of a capacity, for each layer and class that has a maximum size.\n */\n\n/**\n * This function gives the capacity when it is a positive whole number. Otherwise it throws a\n * `RangeError`. A capacity of `NaN` makes a comparison `size >= capacity` always false, so a\n * structure with that capacity grows without a limit. A capacity of 0 or less, or a fraction,\n * has no clear meaning.\n *\n * @param capacity - The capacity to check.\n * @param owner - The name of the layer or class, for the message of the error.\n * @returns The same capacity.\n * @throws RangeError when the capacity is not a positive whole number.\n */\nexport function checkCapacity(capacity: number, owner: string): number {\n  if (!Number.isSafeInteger(capacity) || capacity < 1) {\n    throw new RangeError(`${owner}: the capacity must be a positive whole number, not ${String(capacity)}`);\n  }\n  return capacity;\n}\n","/**\n * Bounded behavior - Enforces capacity limits on collections.\n *\n * This module wraps collections to prevent them from exceeding a maximum size.\n * This module gives various overflow policies to handle full collections.\n *\n * @example\n * const list = compose(\n *   boundedList<number>({ capacity: 100, policy: 'drop-oldest' })\n * )(arrayList<number>())\n *\n * // Add 101 elements - first element will be dropped\n * for (let i = 0; i < 101; i++) {\n *   list.add(i)\n * }\n */\n\nimport { checkCapacity } from \"../core/capacity.js\";\nimport type { Middleware } from \"../core/middleware.js\";\nimport type { List } from \"../interfaces/list.js\";\nimport type { Queue, Deque } from \"../interfaces/queue.js\";\nimport type { MapLike } from \"../interfaces/map.js\";\nimport type { Collection } from \"../interfaces/collection.js\";\nimport type {\n  OverflowPolicy,\n  OverflowHandler,\n  OverflowContext,\n} from \"../core/policies.js\";\n\n/**\n * Options for bounded behavior.\n */\nexport interface BoundedOptions<T> {\n  /**\n   * Maximum number of elements the collection can hold.\n   */\n  capacity: number;\n\n  /**\n   * Policy for handling overflow when collection is full.\n   * @default 'throw'\n   */\n  policy?: OverflowPolicy;\n\n  /**\n   * Optional callback invoked when overflow occurs.\n   * The behavior calls this function before it applies the policy.\n   */\n  onOverflow?: OverflowHandler<T>;\n}\n\n/**\n * Marker interface for bounded collections.\n */\nexport interface BoundedCollection {\n  readonly capacity: number;\n  readonly isFull: boolean;\n  readonly remainingCapacity: number;\n}\n\n/**\n * This function makes a bounded List middleware.\n *\n * Intercepts add operations to enforce capacity limits.\n * This function supports multiple overflow policies.\n */\nexport function boundedList<T>(\n  options: BoundedOptions<T>\n): Middleware<List<T>, List<T> & BoundedCollection> {\n  const { policy = \"throw\", onOverflow } = options;\n  const capacity = checkCapacity(options.capacity, \"boundedList\");\n\n  return (next: List<T>): List<T> & BoundedCollection => {\n    // An unshift puts the element at the front, so drop-oldest drops the last element for it\n    const handleOverflow = (element: T, dropFrom: \"first\" | \"last\" = \"first\"): void => {\n      // Call overflow handler if provided\n      if (onOverflow) {\n        const context: OverflowContext<T> = {\n          newElement: element,\n          currentSize: next.size,\n          capacity,\n          timestamp: Date.now(),\n        };\n        onOverflow(context);\n      }\n\n      // Apply policy\n      switch (policy) {\n        case \"throw\":\n          throw new Error(`List is full (capacity: ${capacity})`);\n\n        case \"drop-oldest\":\n          // Remove one element: the first, or the last for an unshift\n          if (!next.isEmpty) {\n            if (dropFrom === \"last\") next.pop();\n            else next.shift();\n          }\n          break;\n\n        case \"drop-newest\":\n          // Don't add the new element (do nothing)\n          return;\n\n        case \"reject\":\n          // Silently reject (return false for add operations)\n          return;\n\n        case \"grow\":\n          // Allow growth (do nothing, element will be added)\n          return;\n\n        case \"block\":\n          throw new Error(\"Block policy not supported for sync collections\");\n\n        default:\n          throw new Error(`Unknown overflow policy: ${policy}`);\n      }\n    };\n\n    // After drop-oldest removed the first element, an index of the caller is one place lower\n    const shifted = (index: number): number => (policy === \"drop-oldest\" ? Math.max(0, index - 1) : index);\n\n    return new Proxy(next, {\n      get(target, prop, receiver) {\n        // Capacity property\n        if (prop === \"capacity\") {\n          return capacity;\n        }\n\n        // isFull property\n        if (prop === \"isFull\") {\n          return target.size >= capacity;\n        }\n\n        // remainingCapacity property\n        if (prop === \"remainingCapacity\") {\n          return Math.max(0, capacity - target.size);\n        }\n\n        const value = Reflect.get(target, prop, receiver);\n\n        // Intercept methods that add elements\n        if (typeof value === \"function\") {\n          switch (prop) {\n            case \"add\":\n              return function (element: T): boolean {\n                if (target.size >= capacity && policy !== \"grow\") {\n                  handleOverflow(element);\n                  if (policy === \"reject\" || policy === \"drop-newest\") {\n                    return false;\n                  }\n                }\n                return (value as Function).call(target, element);\n              };\n\n            case \"push\":\n              return function (element: T): void {\n                if (target.size >= capacity && policy !== \"grow\") {\n                  handleOverflow(element);\n                  if (policy === \"reject\" || policy === \"drop-newest\") {\n                    return;\n                  }\n                }\n                (value as Function).call(target, element);\n              };\n\n            case \"unshift\":\n              return function (element: T): void {\n                if (target.size >= capacity && policy !== \"grow\") {\n                  // One element goes: the last one (before, the first and the last went: audit pass 2)\n                  handleOverflow(element, \"last\");\n                  if (policy === \"reject\" || policy === \"drop-newest\") {\n                    return;\n                  }\n                }\n                (value as Function).call(target, element);\n              };\n\n            case \"insert\":\n              return function (index: number, element: T): void {\n                let at = index;\n                if (target.size >= capacity && policy !== \"grow\") {\n                  handleOverflow(element);\n                  if (policy === \"reject\" || policy === \"drop-newest\") {\n                    return;\n                  }\n                  at = shifted(at);\n                }\n                (value as Function).call(target, at, element);\n              };\n\n            case \"addAll\":\n            case \"insertAll\":\n              return function (...args: any[]): boolean {\n                const elements = args[args.length - 1] as Iterable<T>;\n                const elementsArray = Array.from(elements);\n\n                // Check if adding all elements would exceed capacity\n                if (target.size + elementsArray.length > capacity && policy !== \"grow\") {\n                  // Add elements one by one with overflow handling. An insert keeps the order of\n                  // the elements, at an index that follows each drop.\n                  let added = false;\n                  let at = args[0] as number;\n                  for (const element of elementsArray) {\n                    if (target.size >= capacity) {\n                      handleOverflow(element);\n                      if (policy === \"reject\" || policy === \"drop-newest\") {\n                        break;\n                      }\n                      at = shifted(at);\n                    }\n                    if (prop === \"addAll\") {\n                      target.add(element);\n                    } else {\n                      target.insert(at, element);\n                      at++;\n                    }\n                    added = true;\n                  }\n                  return added;\n                }\n\n                return (value as Function).apply(target, args);\n              };\n          }\n        }\n\n        return value;\n      },\n    }) as List<T> & BoundedCollection;\n  };\n}\n\n/**\n * This function makes a bounded Queue middleware.\n */\nexport function boundedQueue<T>(\n  options: BoundedOptions<T>\n): Middleware<Queue<T>, Queue<T> & BoundedCollection> {\n  const { policy = \"throw\", onOverflow } = options;\n  const capacity = checkCapacity(options.capacity, \"boundedQueue\");\n\n  return (next: Queue<T>): Queue<T> & BoundedCollection => {\n    const handleOverflow = (element: T): void => {\n      if (onOverflow) {\n        const context: OverflowContext<T> = {\n          newElement: element,\n          currentSize: next.size,\n          capacity,\n          timestamp: Date.now(),\n        };\n        onOverflow(context);\n      }\n\n      switch (policy) {\n        case \"throw\":\n          throw new Error(`Queue is full (capacity: ${capacity})`);\n        case \"drop-oldest\":\n          if (!next.isEmpty) {\n            next.poll();\n          }\n          break;\n        case \"drop-newest\":\n        case \"reject\":\n          return;\n        case \"grow\":\n          return;\n        case \"block\":\n          throw new Error(\"Block policy not supported for sync collections\");\n        default:\n          throw new Error(`Unknown overflow policy: ${policy}`);\n      }\n    };\n\n    return new Proxy(next, {\n      get(target, prop, receiver) {\n        if (prop === \"capacity\") return capacity;\n        if (prop === \"isFull\") return target.size >= capacity;\n        if (prop === \"remainingCapacity\") return Math.max(0, capacity - target.size);\n\n        const value = Reflect.get(target, prop, receiver);\n\n        if (typeof value === \"function\") {\n          switch (prop) {\n            case \"offer\":\n            case \"enqueue\":\n            case \"add\":\n              return function (element: T): boolean {\n                if (target.size >= capacity && policy !== \"grow\") {\n                  handleOverflow(element);\n                  if (policy === \"reject\" || policy === \"drop-newest\") {\n                    return false;\n                  }\n                }\n                return (value as Function).call(target, element);\n              };\n          }\n        }\n\n        return value;\n      },\n    }) as Queue<T> & BoundedCollection;\n  };\n}\n\n/**\n * This function makes a bounded Deque middleware.\n */\nexport function boundedDeque<T>(\n  options: BoundedOptions<T>\n): Middleware<Deque<T>, Deque<T> & BoundedCollection> {\n  const { policy = \"throw\", onOverflow } = options;\n  const capacity = checkCapacity(options.capacity, \"boundedDeque\");\n\n  return (next: Deque<T>): Deque<T> & BoundedCollection => {\n    const handleOverflow = (element: T): void => {\n      if (onOverflow) {\n        const context: OverflowContext<T> = {\n          newElement: element,\n          currentSize: next.size,\n          capacity,\n          timestamp: Date.now(),\n        };\n        onOverflow(context);\n      }\n\n      switch (policy) {\n        case \"throw\":\n          throw new Error(`Deque is full (capacity: ${capacity})`);\n        case \"drop-oldest\":\n          if (!next.isEmpty) {\n            next.removeFirst();\n          }\n          break;\n        case \"drop-newest\":\n        case \"reject\":\n          return;\n        case \"grow\":\n          return;\n        case \"block\":\n          throw new Error(\"Block policy not supported for sync collections\");\n        default:\n          throw new Error(`Unknown overflow policy: ${policy}`);\n      }\n    };\n\n    return new Proxy(next, {\n      get(target, prop, receiver) {\n        if (prop === \"capacity\") return capacity;\n        if (prop === \"isFull\") return target.size >= capacity;\n        if (prop === \"remainingCapacity\") return Math.max(0, capacity - target.size);\n\n        const value = Reflect.get(target, prop, receiver);\n\n        if (typeof value === \"function\") {\n          switch (prop) {\n            case \"addFirst\":\n            case \"addLast\":\n            case \"offerFirst\":\n            case \"offerLast\":\n            case \"push\":\n            case \"offer\":\n            case \"add\":\n              return function (element: T): any {\n                if (target.size >= capacity && policy !== \"grow\") {\n                  handleOverflow(element);\n                  if (policy === \"reject\" || policy === \"drop-newest\") {\n                    return prop.startsWith(\"offer\") || prop === \"add\" ? false : undefined;\n                  }\n                }\n                return (value as Function).call(target, element);\n              };\n          }\n        }\n\n        return value;\n      },\n    }) as Deque<T> & BoundedCollection;\n  };\n}\n\n/**\n * This function makes a bounded Map middleware.\n */\nexport function boundedMap<K, V>(\n  options: Omit<BoundedOptions<V>, \"onOverflow\"> & {\n    onOverflow?: (context: Omit<OverflowContext<V>, \"newElement\"> & { key: K; value: V }) => void;\n  }\n): Middleware<MapLike<K, V>, MapLike<K, V> & BoundedCollection> {\n  const { policy = \"throw\", onOverflow } = options;\n  const capacity = checkCapacity(options.capacity, \"boundedMap\");\n\n  return (next: MapLike<K, V>): MapLike<K, V> & BoundedCollection => {\n    let insertionOrder: K[] = []; // Track insertion order for drop-oldest\n\n    const handleOverflow = (key: K, value: V): void => {\n      if (onOverflow) {\n        onOverflow({\n          key,\n          value,\n          currentSize: next.size,\n          capacity,\n          timestamp: Date.now(),\n        });\n      }\n\n      switch (policy) {\n        case \"throw\":\n          throw new Error(`Map is full (capacity: ${capacity})`);\n        case \"drop-oldest\":\n          // Remove oldest key\n          if (insertionOrder.length > 0) {\n            const oldestKey = insertionOrder.shift()!;\n            next.delete(oldestKey);\n          }\n          break;\n        case \"drop-newest\":\n        case \"reject\":\n          return;\n        case \"grow\":\n          return;\n        case \"block\":\n          throw new Error(\"Block policy not supported for sync collections\");\n        default:\n          throw new Error(`Unknown overflow policy: ${policy}`);\n      }\n    };\n\n    return new Proxy(next, {\n      get(target, prop, receiver) {\n        if (prop === \"capacity\") return capacity;\n        if (prop === \"isFull\") return target.size >= capacity;\n        if (prop === \"remainingCapacity\") return Math.max(0, capacity - target.size);\n\n        const value = Reflect.get(target, prop, receiver);\n\n        if (typeof value === \"function\") {\n          switch (prop) {\n            case \"set\":\n              return function (key: K, val: V): V | undefined {\n                const hadKey = target.has(key);\n\n                if (!hadKey && target.size >= capacity && policy !== \"grow\") {\n                  handleOverflow(key, val);\n                  if (policy === \"reject\" || policy === \"drop-newest\") {\n                    return undefined;\n                  }\n                }\n\n                const result = (value as Function).call(target, key, val);\n\n                // Track insertion order\n                if (!hadKey) {\n                  insertionOrder.push(key);\n                }\n\n                return result;\n              };\n\n            case \"delete\":\n              return function (key: K): V | undefined {\n                const result = (value as Function).call(target, key);\n                // Remove from insertion order tracking\n                insertionOrder = insertionOrder.filter((k) => !target.keyEq(k, key));\n                return result;\n              };\n\n            case \"clear\":\n              return function (): void {\n                (value as Function).call(target);\n                insertionOrder = [];\n              };\n          }\n        }\n\n        return value;\n      },\n    }) as MapLike<K, V> & BoundedCollection;\n  };\n}\n\n/**\n * Generic bounded collection middleware.\n * Works with any collection type.\n */\nexport function bounded<C extends Collection<any>>(\n  options: BoundedOptions<any>\n): Middleware<C, C & BoundedCollection> {\n  return boundedList(options) as any;\n}\n","/**\n * Readonly behavior - Makes immutable views of collections.\n *\n * This module wraps collections to prevent modifications by throwing errors\n * on any mutation try. Mirrors Java's Collections.unmodifiable*() methods.\n *\n * @example\n * const list = compose(\n *   readonlyList()\n * )(arrayList([1, 2, 3]))\n *\n * list.get(0) // OK: 1\n * list.add(4) // Error: Cannot modify readonly list\n */\n\nimport type { Middleware } from \"../core/middleware.js\";\nimport type { ReadonlyList } from \"../interfaces/list.js\";\nimport type { ReadonlyQueue } from \"../interfaces/queue.js\";\nimport type { ReadonlyMapLike } from \"../interfaces/map.js\";\nimport type { ReadonlyCollection } from \"../interfaces/collection.js\";\n\n/**\n * Options for readonly behavior.\n */\nexport interface ReadonlyOptions {\n  /**\n   * Custom error message to throw on mutation tries.\n   * @default 'Cannot modify readonly collection'\n   */\n  errorMessage?: string;\n}\n\n/**\n * This set holds the names of the methods that mutate collections.\n */\nconst MUTATING_METHODS = new Set([\n  // Collection mutations\n  \"add\",\n  \"addAll\",\n  \"remove\",\n  \"removeAll\",\n  \"retainAll\",\n  \"clear\",\n\n  // List mutations\n  \"set\",\n  \"insert\",\n  \"insertAll\",\n  \"removeAt\",\n  \"removeRange\",\n  \"push\",\n  \"pop\",\n  \"shift\",\n  \"unshift\",\n  \"sort\",\n  \"reverse\",\n\n  // Queue/Deque mutations\n  \"offer\",\n  \"offerFirst\",\n  \"offerLast\",\n  \"poll\",\n  \"pollFirst\",\n  \"pollLast\",\n  \"enqueue\",\n  \"dequeue\",\n  \"addFirst\",\n  \"addLast\",\n  \"removeFirst\",\n  \"removeLast\",\n\n  // Map mutations\n  \"set\",\n  \"setIfAbsent\",\n  \"forcePut\",\n  \"pollFirstEntry\",\n  \"pollLastEntry\",\n  \"delete\",\n  \"deleteEntry\",\n  \"replace\",\n  \"replaceEntry\",\n  \"computeIfAbsent\",\n  \"computeIfPresent\",\n  \"compute\",\n  \"merge\",\n  \"putAll\",\n]);\n\n/** Methods that return a view of the collection: the view is readonly too. */\nconst VIEW_METHODS = new Set([\n  \"subList\",\n  \"subMap\",\n  \"subSet\",\n  \"headMap\",\n  \"tailMap\",\n  \"headSet\",\n  \"tailSet\",\n  \"descendingMap\",\n  \"descendingSet\",\n  \"inverse\",\n]);\n\n/**\n * This function makes a readonly middleware for any collection type.\n */\nfunction createReadonly<C extends object>(\n  errorMessage: string = \"Cannot modify readonly collection\"\n): Middleware<C> {\n  return (next: C): C => {\n    // The read methods, bound to the collection: one function for each name\n    const bound = new Map<PropertyKey, { value: Function; method: Function }>();\n    return new Proxy(next, {\n      get(target, prop) {\n        // A read runs on the collection itself, not on the proxy: a read that changes internal\n        // state (a LinkedHashMap with accessOrder moves the entry) does not hit the set trap\n        const value = Reflect.get(target, prop, target);\n\n        // Block mutating methods\n        if (typeof prop === \"string\" && MUTATING_METHODS.has(prop)) {\n          if (typeof value === \"function\") {\n            return () => {\n              throw new Error(errorMessage);\n            };\n          }\n        }\n\n        // A view (a sublist, a submap, a head or tail set, a descending map) is readonly too.\n        // Before, only subList and subMap were wrapped, and setIfAbsent, pollFirstEntry and\n        // pollLastEntry were not blocked (BUGS-2026-07 L14).\n        if (typeof value === \"function\" && typeof prop === \"string\" && VIEW_METHODS.has(prop)) {\n          return function (this: any, ...args: any[]) {\n            const result = value.apply(target, args);\n            // Recursively apply readonly to the result\n            return createReadonly<typeof result>(errorMessage)(result);\n          };\n        }\n\n        if (typeof value === \"function\") {\n          const known = bound.get(prop);\n          if (known !== undefined && known.value === value) return known.method;\n          const method = (value as Function).bind(target) as Function;\n          bound.set(prop, { value, method });\n          return method;\n        }\n\n        return value;\n      },\n\n      set(_target, _prop, _value, _receiver) {\n        // Block property assignments\n        throw new Error(errorMessage);\n      },\n\n      deleteProperty(_target, _prop) {\n        // Block property deletions\n        throw new Error(errorMessage);\n      },\n    });\n  };\n}\n\n/**\n * This function makes a readonly List middleware.\n *\n * All mutation methods will throw an error.\n * Read operations work normally.\n *\n * @example\n * const readonlyNumbers = compose(\n *   readonlyList()\n * )(arrayList([1, 2, 3]))\n */\nexport function readonlyList<T>(\n  options: ReadonlyOptions = {}\n): Middleware<ReadonlyList<T>> {\n  const errorMessage = options.errorMessage ?? \"Cannot modify readonly list\";\n  return createReadonly<any>(errorMessage);\n}\n\n/**\n * This function makes a readonly Queue middleware.\n */\nexport function readonlyQueue<T>(\n  options: ReadonlyOptions = {}\n): Middleware<ReadonlyQueue<T>> {\n  const errorMessage = options.errorMessage ?? \"Cannot modify readonly queue\";\n  return createReadonly<any>(errorMessage);\n}\n\n/**\n * This function makes a readonly Map middleware.\n */\nexport function readonlyMap<K, V>(\n  options: ReadonlyOptions = {}\n): Middleware<ReadonlyMapLike<K, V>> {\n  const errorMessage = options.errorMessage ?? \"Cannot modify readonly map\";\n  return createReadonly<any>(errorMessage);\n}\n\n/**\n * This function makes a readonly Collection middleware.\n *\n * Generic version that works with any collection type.\n */\nexport function readonlyCollection<T>(\n  options: ReadonlyOptions = {}\n): Middleware<ReadonlyCollection<T>> {\n  const errorMessage = options.errorMessage ?? \"Cannot modify readonly collection\";\n  return createReadonly<any>(errorMessage);\n}\n\n/**\n * Generic readonly middleware.\n * Alias for readonlyCollection.\n */\nexport function readonly<C extends object>(\n  options: ReadonlyOptions = {}\n): Middleware<C> {\n  const errorMessage = options.errorMessage ?? \"Cannot modify readonly collection\";\n  return createReadonly<C>(errorMessage);\n}\n\n/**\n * Alias for Java compatibility: unmodifiableList\n */\nexport const unmodifiableList : typeof readonlyList = readonlyList;\n\n/**\n * Alias for Java compatibility: unmodifiableMap\n */\nexport const unmodifiableMap : typeof readonlyMap = readonlyMap;\n\n/**\n * Alias for Java compatibility: unmodifiableCollection\n */\nexport const unmodifiableCollection : typeof readonlyCollection = readonlyCollection;\n","/**\n * Safe behavior - Gives Option/Result-based error handling.\n *\n * This module wraps collection operations that throw errors to instead return\n * Option<T> or Result<T, E>, enabling functional error handling.\n *\n * @example\n * const list = compose(\n *   safeList<number>()\n * )(arrayList<number>())\n *\n * const value = list.safe.get(10) // Option<number> instead of throwing\n * if (isSome(value)) {\n *   console.log(value.value)\n * }\n */\n\nimport type { Middleware } from \"../core/middleware.js\";\nimport type { List } from \"../interfaces/list.js\";\nimport type { Queue, Deque } from \"../interfaces/queue.js\";\nimport type { MapLike } from \"../interfaces/map.js\";\nimport { type Option, type Result } from \"../core/effects.js\";\nimport { None, Some, tryCatch } from \"../core/effects.js\";\n\n/**\n * Safe operations for List.\n */\nexport interface SafeListOperations<T> {\n  /**\n   * Get element at index, giving Option.\n   */\n  get(index: number): Option<T>;\n\n  /**\n   * Set element at index, giving Result with old value or error.\n   */\n  set(index: number, element: T): Result<T, string>;\n\n  /**\n   * Remove element at index, giving Result with removed value or error.\n   */\n  removeAt(index: number): Result<T, string>;\n\n  /**\n   * Get first element as Option.\n   */\n  first(): Option<T>;\n\n  /**\n   * Get last element as Option.\n   */\n  last(): Option<T>;\n\n  /**\n   * Pop element, giving Option.\n   */\n  pop(): Option<T>;\n\n  /**\n   * Shift element, giving Option.\n   */\n  shift(): Option<T>;\n}\n\n/**\n * Safe operations for Queue.\n */\nexport interface SafeQueueOperations<T> {\n  /**\n   * Peek at head element as Option.\n   */\n  peek(): Option<T>;\n\n  /**\n   * Poll element as Option.\n   */\n  poll(): Option<T>;\n\n  /**\n   * Dequeue element as Option.\n   */\n  dequeue(): Option<T>;\n}\n\n/**\n * Safe operations for Deque.\n */\nexport interface SafeDequeOperations<T> extends SafeQueueOperations<T> {\n  /**\n   * Peek at first element as Option.\n   */\n  peekFirst(): Option<T>;\n\n  /**\n   * Peek at last element as Option.\n   */\n  peekLast(): Option<T>;\n\n  /**\n   * Poll first element as Option.\n   */\n  pollFirst(): Option<T>;\n\n  /**\n   * Poll last element as Option.\n   */\n  pollLast(): Option<T>;\n\n  /**\n   * Pop element as Option.\n   */\n  pop(): Option<T>;\n}\n\n/**\n * Safe operations for Map.\n */\nexport interface SafeMapOperations<K, V> {\n  /**\n   * Get value for key as Option.\n   */\n  get(key: K): Option<V>;\n\n  /**\n   * Set value for key, giving Result with old value or success.\n   */\n  set(key: K, value: V): Result<V | undefined, string>;\n\n  /**\n   * Delete key, giving Result with deleted value or error.\n   */\n  delete(key: K): Result<V | undefined, string>;\n}\n\n/**\n * This function makes a safe List middleware.\n *\n * This function exposes a `safe` property with Option/Result-based operations.\n */\nexport function safeList<T>(): Middleware<\n  List<T>,\n  List<T> & { safe: SafeListOperations<T> }\n> {\n  return (next: List<T>): List<T> & { safe: SafeListOperations<T> } => {\n    const safe: SafeListOperations<T> = {\n      get(index: number): Option<T> {\n        return tryCatch(\n          () => next.get(index),\n          () => \"Index out of bounds\"\n        ).match<Option<T>>({\n          Ok: (value) => Some(value),\n          Err: () => None,\n        }) as Option<T>;\n      },\n\n      set(index: number, element: T): Result<T, string> {\n        return tryCatch(\n          () => next.set(index, element),\n          (error) => String(error)\n        );\n      },\n\n      removeAt(index: number): Result<T, string> {\n        return tryCatch(\n          () => next.removeAt(index),\n          (error) => String(error)\n        );\n      },\n\n      first(): Option<T> {\n        return next.isEmpty ? None : Some(next.first());\n      },\n\n      last(): Option<T> {\n        return next.isEmpty ? None : Some(next.last());\n      },\n\n      pop(): Option<T> {\n        if (next.isEmpty) return None;\n        return tryCatch(\n          () => next.pop(),\n          () => \"List is empty\"\n        ).match<Option<T>>({\n          Ok: (value) => Some(value),\n          Err: () => None,\n        }) as Option<T>;\n      },\n\n      shift(): Option<T> {\n        if (next.isEmpty) return None;\n        return tryCatch(\n          () => next.shift(),\n          () => \"List is empty\"\n        ).match<Option<T>>({\n          Ok: (value) => Some(value),\n          Err: () => None,\n        }) as Option<T>;\n      },\n    };\n\n    // Extend next with safe property\n    return Object.assign(next, { safe });\n  };\n}\n\n/**\n * This function makes a safe Queue middleware.\n */\nexport function safeQueue<T>(): Middleware<\n  Queue<T>,\n  Queue<T> & { safe: SafeQueueOperations<T> }\n> {\n  return (next: Queue<T>): Queue<T> & { safe: SafeQueueOperations<T> } => {\n    const safe: SafeQueueOperations<T> = {\n      peek(): Option<T> {\n        if (next.isEmpty) return None;\n        return tryCatch(\n          () => next.peek(),\n          () => \"Queue is empty\"\n        ).match<Option<T>>({\n          Ok: (value) => Some(value),\n          Err: () => None,\n        }) as Option<T>;\n      },\n\n      poll(): Option<T> {\n        if (next.isEmpty) return None;\n        return tryCatch(\n          () => next.poll(),\n          () => \"Queue is empty\"\n        ).match<Option<T>>({\n          Ok: (value) => Some(value),\n          Err: () => None,\n        }) as Option<T>;\n      },\n\n      dequeue(): Option<T> {\n        if (next.isEmpty) return None;\n        return tryCatch(\n          () => next.dequeue(),\n          () => \"Queue is empty\"\n        ).match<Option<T>>({\n          Ok: (value) => Some(value),\n          Err: () => None,\n        }) as Option<T>;\n      },\n    };\n\n    return Object.assign(next, { safe });\n  };\n}\n\n/**\n * This function makes a safe Deque middleware.\n */\nexport function safeDeque<T>(): Middleware<\n  Deque<T>,\n  Deque<T> & { safe: SafeDequeOperations<T> }\n> {\n  return (next: Deque<T>): Deque<T> & { safe: SafeDequeOperations<T> } => {\n    const safe: SafeDequeOperations<T> = {\n      peek(): Option<T> {\n        return next.isEmpty ? None : Some(next.peekFirst());\n      },\n\n      poll(): Option<T> {\n        // One poll: before, the test and the result each called pollFirst(), so poll() removed\n        // two elements and returned the second (BUGS-2026-07 L12)\n        if (next.isEmpty) return None;\n        return Some(next.pollFirst() as T);\n      },\n\n      dequeue(): Option<T> {\n        if (next.isEmpty) return None;\n        return tryCatch(\n          () => next.dequeue(),\n          () => \"Deque is empty\"\n        ).match<Option<T>>({\n          Ok: (value) => Some(value),\n          Err: () => None,\n        }) as Option<T>;\n      },\n\n      peekFirst(): Option<T> {\n        return next.isEmpty ? None : Some(next.peekFirst());\n      },\n\n      peekLast(): Option<T> {\n        return next.isEmpty ? None : Some(next.peekLast());\n      },\n\n      pollFirst(): Option<T> {\n        const result = next.pollFirst();\n        return result !== undefined ? Some(result) : None;\n      },\n\n      pollLast(): Option<T> {\n        const result = next.pollLast();\n        return result !== undefined ? Some(result) : None;\n      },\n\n      pop(): Option<T> {\n        if (next.isEmpty) return None;\n        return tryCatch(\n          () => next.pop(),\n          () => \"Deque is empty\"\n        ).match<Option<T>>({\n          Ok: (value) => Some(value),\n          Err: () => None,\n        }) as Option<T>;\n      },\n    };\n\n    return Object.assign(next, { safe });\n  };\n}\n\n/**\n * This function makes a safe Map middleware.\n */\nexport function safeMap<K, V>(): Middleware<\n  MapLike<K, V>,\n  MapLike<K, V> & { safe: SafeMapOperations<K, V> }\n> {\n  return (\n    next: MapLike<K, V>\n  ): MapLike<K, V> & { safe: SafeMapOperations<K, V> } => {\n    const safe: SafeMapOperations<K, V> = {\n      get(key: K): Option<V> {\n        return next.has(key) ? Some(next.get(key)) : None;\n      },\n\n      set(key: K, value: V): Result<V | undefined, string> {\n        return tryCatch(\n          () => next.set(key, value),\n          (error) => String(error)\n        );\n      },\n\n      delete(key: K): Result<V | undefined, string> {\n        return tryCatch(\n          () => next.delete(key),\n          (error) => String(error)\n        );\n      },\n    };\n\n    return Object.assign(next, { safe });\n  };\n}\n\n/**\n * Generic safe middleware that works with any collection.\n */\nexport function safe<C extends object>(): Middleware<C> {\n  // Return as-is for now; specialized versions handle specific types\n  return (next: C): C => next;\n}\n","/**\n * Evented behavior - Emits typed events on collection mutations.\n *\n * This module wraps collections to emit events whenever elements are added, removed,\n * or the collection is cleared. This module enables reactive programming patterns.\n *\n * @example\n * const list = compose(\n *   eventedList<number>()\n * )(arrayList<number>())\n *\n * list.on('add', ({ value, index }) => {\n *   console.log(`Added ${value} at index ${index}`)\n * })\n *\n * list.add(42) // Triggers 'add' event\n */\n\nimport type { Middleware } from \"../core/middleware.js\";\nimport type { List } from \"../interfaces/list.js\";\nimport type { Queue, Deque } from \"../interfaces/queue.js\";\nimport type { MapLike } from \"../interfaces/map.js\";\nimport type { Collection } from \"../interfaces/collection.js\";\nimport { Emitter, type Unsubscribe } from \"../core/events.js\";\n\n// ============================================================================\n// Event type definitions\n// ============================================================================\n\n/**\n * Events emitted by List collections.\n */\nexport interface ListEvents<T> {\n  /** Element was added */\n  add: { value: T; index?: number };\n  /** Element was removed */\n  remove: { value: T; index?: number };\n  /** Element was replaced */\n  set: { oldValue: T; newValue: T; index: number };\n  /** Collection was cleared */\n  clear: {};\n  /** Collection was sorted */\n  sort: {};\n  /** Collection was reversed */\n  reverse: {};\n}\n\n/**\n * Events emitted by Queue collections.\n */\nexport interface QueueEvents<T> {\n  /** Element was added to queue */\n  enqueue: { value: T };\n  /** Element was removed from queue */\n  dequeue: { value: T };\n  /** Collection was cleared */\n  clear: {};\n}\n\n/**\n * Events emitted by Deque collections.\n */\nexport interface DequeEvents<T> {\n  /** Element was added to front */\n  addFirst: { value: T };\n  /** Element was added to back */\n  addLast: { value: T };\n  /** Element was removed from front */\n  removeFirst: { value: T };\n  /** Element was removed from back */\n  removeLast: { value: T };\n  /** Collection was cleared */\n  clear: {};\n}\n\n/**\n * Events emitted by Map collections.\n */\nexport interface MapEvents<K, V> {\n  /** Key-value pair was set */\n  set: { key: K; value: V; oldValue?: V };\n  /** Key was deleted */\n  delete: { key: K; value: V };\n  /** Collection was cleared */\n  clear: {};\n}\n\n/**\n * Generic collection events.\n */\nexport interface CollectionEvents<T> {\n  /** Element was added */\n  add: { value: T };\n  /** Element was removed */\n  remove: { value: T };\n  /** Collection was cleared */\n  clear: {};\n}\n\n// ============================================================================\n// Evented middleware implementations\n// ============================================================================\n\n/**\n * This function makes an evented List middleware.\n *\n * This function emits events for add, remove, set, clear, sort, and reverse operations.\n */\nexport function eventedList<T>(): Middleware<\n  List<T>,\n  List<T> & {\n    on<E extends keyof ListEvents<T>>(\n      event: E,\n      listener: (payload: ListEvents<T>[E]) => void\n    ): Unsubscribe;\n  }\n> {\n  return (next: List<T>) => {\n    const emitter = new Emitter<ListEvents<T>>();\n\n    return new Proxy(next, {\n      get(target, prop, receiver) {\n        // Expose event subscription\n        if (prop === \"on\") {\n          return emitter.on.bind(emitter);\n        }\n\n        const value = Reflect.get(target, prop, receiver);\n\n        if (typeof value === \"function\") {\n          switch (prop) {\n            case \"add\":\n            case \"push\":\n              return function (element: T): any {\n                const result = (value as Function).call(target, element);\n                emitter.emit(\"add\", { value: element });\n                return result;\n              };\n\n            case \"unshift\":\n              return function (element: T): void {\n                (value as Function).call(target, element);\n                emitter.emit(\"add\", { value: element, index: 0 });\n              };\n\n            case \"insert\":\n              return function (index: number, element: T): void {\n                (value as Function).call(target, index, element);\n                emitter.emit(\"add\", { value: element, index });\n              };\n\n            case \"set\":\n              return function (index: number, element: T): T {\n                const oldValue = (value as Function).call(target, index, element);\n                emitter.emit(\"set\", { oldValue, newValue: element, index });\n                return oldValue;\n              };\n\n            case \"remove\":\n              return function (element: T): boolean {\n                const result = (value as Function).call(target, element);\n                if (result) {\n                  emitter.emit(\"remove\", { value: element });\n                }\n                return result;\n              };\n\n            case \"removeAt\":\n              return function (index: number): T {\n                const removed = (value as Function).call(target, index);\n                emitter.emit(\"remove\", { value: removed, index });\n                return removed;\n              };\n\n            case \"pop\":\n              return function (): T {\n                const removed = (value as Function).call(target);\n                emitter.emit(\"remove\", { value: removed });\n                return removed;\n              };\n\n            case \"shift\":\n              return function (): T {\n                const removed = (value as Function).call(target);\n                emitter.emit(\"remove\", { value: removed, index: 0 });\n                return removed;\n              };\n\n            case \"clear\":\n              return function (): void {\n                (value as Function).call(target);\n                emitter.emit(\"clear\", {});\n              };\n\n            case \"sort\":\n              return function (...args: any[]): void {\n                (value as Function).apply(target, args);\n                emitter.emit(\"sort\", {});\n              };\n\n            case \"reverse\":\n              return function (): void {\n                (value as Function).call(target);\n                emitter.emit(\"reverse\", {});\n              };\n          }\n        }\n\n        return value;\n      },\n    }) as any;\n  };\n}\n\n/**\n * This function makes an evented Queue middleware.\n */\nexport function eventedQueue<T>(): Middleware<\n  Queue<T>,\n  Queue<T> & {\n    on<E extends keyof QueueEvents<T>>(\n      event: E,\n      listener: (payload: QueueEvents<T>[E]) => void\n    ): Unsubscribe;\n  }\n> {\n  return (next: Queue<T>) => {\n    const emitter = new Emitter<QueueEvents<T>>();\n\n    return new Proxy(next, {\n      get(target, prop, receiver) {\n        if (prop === \"on\") {\n          return emitter.on.bind(emitter);\n        }\n\n        const value = Reflect.get(target, prop, receiver);\n\n        if (typeof value === \"function\") {\n          switch (prop) {\n            case \"offer\":\n            case \"enqueue\":\n            case \"add\":\n              return function (element: T): any {\n                const result = (value as Function).call(target, element);\n                if (result !== false) {\n                  emitter.emit(\"enqueue\", { value: element });\n                }\n                return result;\n              };\n\n            case \"poll\":\n            case \"dequeue\":\n              return function (): T {\n                const removed = (value as Function).call(target);\n                emitter.emit(\"dequeue\", { value: removed });\n                return removed;\n              };\n\n            case \"clear\":\n              return function (): void {\n                (value as Function).call(target);\n                emitter.emit(\"clear\", {});\n              };\n          }\n        }\n\n        return value;\n      },\n    }) as any;\n  };\n}\n\n/**\n * This function makes an evented Deque middleware.\n */\nexport function eventedDeque<T>(): Middleware<\n  Deque<T>,\n  Deque<T> & {\n    on<E extends keyof DequeEvents<T>>(\n      event: E,\n      listener: (payload: DequeEvents<T>[E]) => void\n    ): Unsubscribe;\n  }\n> {\n  return (next: Deque<T>) => {\n    const emitter = new Emitter<DequeEvents<T>>();\n\n    return new Proxy(next, {\n      get(target, prop, receiver) {\n        if (prop === \"on\") {\n          return emitter.on.bind(emitter);\n        }\n\n        const value = Reflect.get(target, prop, receiver);\n\n        if (typeof value === \"function\") {\n          switch (prop) {\n            case \"addFirst\":\n            case \"offerFirst\":\n            case \"push\":\n              return function (element: T): any {\n                const result = (value as Function).call(target, element);\n                emitter.emit(\"addFirst\", { value: element });\n                return result;\n              };\n\n            case \"addLast\":\n            case \"offerLast\":\n            case \"offer\":\n            case \"add\":\n              return function (element: T): any {\n                const result = (value as Function).call(target, element);\n                emitter.emit(\"addLast\", { value: element });\n                return result;\n              };\n\n            case \"removeFirst\":\n            case \"pollFirst\":\n            case \"poll\":\n            case \"dequeue\":\n              return function (): T {\n                const removed = (value as Function).call(target);\n                if (removed !== undefined) {\n                  emitter.emit(\"removeFirst\", { value: removed });\n                }\n                return removed;\n              };\n\n            case \"removeLast\":\n            case \"pollLast\":\n            case \"pop\":\n              return function (): T {\n                const removed = (value as Function).call(target);\n                if (removed !== undefined) {\n                  emitter.emit(\"removeLast\", { value: removed });\n                }\n                return removed;\n              };\n\n            case \"clear\":\n              return function (): void {\n                (value as Function).call(target);\n                emitter.emit(\"clear\", {});\n              };\n          }\n        }\n\n        return value;\n      },\n    }) as any;\n  };\n}\n\n/**\n * This function makes an evented Map middleware.\n */\nexport function eventedMap<K, V>(): Middleware<\n  MapLike<K, V>,\n  MapLike<K, V> & {\n    on<E extends keyof MapEvents<K, V>>(\n      event: E,\n      listener: (payload: MapEvents<K, V>[E]) => void\n    ): Unsubscribe;\n  }\n> {\n  return (next: MapLike<K, V>) => {\n    const emitter = new Emitter<MapEvents<K, V>>();\n\n    return new Proxy(next, {\n      get(target, prop, receiver) {\n        if (prop === \"on\") {\n          return emitter.on.bind(emitter);\n        }\n\n        const value = Reflect.get(target, prop, receiver);\n\n        if (typeof value === \"function\") {\n          switch (prop) {\n            case \"set\":\n              return function (key: K, val: V): V | undefined {\n                const oldValue = (value as Function).call(target, key, val);\n                emitter.emit(\"set\", { key, value: val, oldValue });\n                return oldValue;\n              };\n\n            case \"delete\":\n              return function (key: K): V | undefined {\n                const deletedValue = (value as Function).call(target, key);\n                if (deletedValue !== undefined) {\n                  emitter.emit(\"delete\", { key, value: deletedValue });\n                }\n                return deletedValue;\n              };\n\n            case \"clear\":\n              return function (): void {\n                (value as Function).call(target);\n                emitter.emit(\"clear\", {});\n              };\n          }\n        }\n\n        return value;\n      },\n    }) as any;\n  };\n}\n\n/**\n * Generic evented collection middleware.\n */\nexport function evented<T>(): Middleware<\n  Collection<T>,\n  Collection<T> & {\n    on<E extends keyof CollectionEvents<T>>(\n      event: E,\n      listener: (payload: CollectionEvents<T>[E]) => void\n    ): Unsubscribe;\n  }\n> {\n  return (next: Collection<T>) => {\n    const emitter = new Emitter<CollectionEvents<T>>();\n\n    return new Proxy(next, {\n      get(target, prop, receiver) {\n        if (prop === \"on\") {\n          return emitter.on.bind(emitter);\n        }\n\n        const value = Reflect.get(target, prop, receiver);\n\n        if (typeof value === \"function\") {\n          switch (prop) {\n            case \"add\":\n              return function (element: T): boolean {\n                const result = (value as Function).call(target, element);\n                if (result) {\n                  emitter.emit(\"add\", { value: element });\n                }\n                return result;\n              };\n\n            case \"remove\":\n              return function (element: T): boolean {\n                const result = (value as Function).call(target, element);\n                if (result) {\n                  emitter.emit(\"remove\", { value: element });\n                }\n                return result;\n              };\n\n            case \"clear\":\n              return function (): void {\n                (value as Function).call(target);\n                emitter.emit(\"clear\", {});\n              };\n          }\n        }\n\n        return value;\n      },\n    }) as any;\n  };\n}\n","/**\n * Synchronized behavior - Gives thread-safe access with mutex locking.\n *\n * This module wraps collections to serialize all operations using a mutex, making sure that\n * thread-safe access in concurrent environments. Mirrors Java's\n * Collections.synchronizedList() and related methods.\n *\n * Note: JavaScript is single-threaded, but async operations can interleave.\n * This middleware makes sure that atomic operations across async boundaries.\n *\n * @example\n * const list = compose(\n *   synchronized()\n * )(arrayList<number>())\n *\n * // All operations are now serialized\n * await Promise.all([\n *   list.add(1),\n *   list.add(2),\n *   list.add(3)\n * ])\n */\n\nimport type { Middleware } from \"../core/middleware.js\";\n\n/**\n * Simple mutex implementation for JavaScript async operations.\n *\n * This middleware makes sure that only one operation starts at a time, even if\n * multiple async operations are started concurrently.\n */\n/** True for an `async` function or method. */\nfunction isAsyncFunction(value: unknown): boolean {\n  return typeof value === \"function\" && (value as { [Symbol.toStringTag]?: string })[Symbol.toStringTag] === \"AsyncFunction\";\n}\n\nclass Mutex {\n  private queue: Promise<void> = Promise.resolve();\n\n  /**\n   * This method acquires the lock and starts the function.\n   * Other operations wait until this completes.\n   */\n  async lock<T>(fn: () => T | Promise<T>): Promise<T> {\n    const run = this.queue.then(() => fn());\n    this.queue = run.then(\n      () => undefined,\n      () => undefined\n    );\n    return run;\n  }\n\n  /**\n   * Synchronous version that starts immediately.\n   * Still queues to prevent interleaving with async operations.\n   */\n\n}\n\n/**\n * This function makes a synchronized middleware that locks all method calls.\n *\n * Every method call on the collection is wrapped with a mutex,\n * making sure that atomic execution even in concurrent async scenarios.\n *\n * @example\n * const syncList = compose(\n *   synchronized()\n * )(arrayList<number>())\n *\n * // These additions are guaranteed to execute in order\n * await Promise.all([\n *   syncList.add(1),\n *   syncList.add(2),\n *   syncList.add(3)\n * ])\n */\nexport function synchronized<C extends object>(): Middleware<C> {\n  return (next: C): C => {\n    const mutex = new Mutex();\n\n    return new Proxy(next, {\n      get(target, prop, receiver) {\n        const value = Reflect.get(target, prop, receiver);\n\n        // Don't wrap non-functions\n        if (typeof value !== \"function\") {\n          return value;\n        }\n\n        // An async method runs inside the lock: it starts after the earlier async calls end.\n        // (Before, every method ran first and took the lock after, so nothing was excluded:\n        // BUGS-2026-07 L11.) A plain method runs at once: JavaScript does not interrupt it.\n        // When a plain method returns a promise anyway, the lock waits for that promise.\n        if (isAsyncFunction(value)) {\n          return function (this: unknown, ...args: unknown[]) {\n            return mutex.lock(() => (value as Function).apply(target, args));\n          };\n        }\n        return function (this: unknown, ...args: unknown[]) {\n          const result = (value as Function).apply(target, args);\n          if (result instanceof Promise) {\n            return mutex.lock(() => result);\n          }\n          return result;\n        };\n      },\n    }) as C;\n  };\n}\n\n/**\n * Alias for Java compatibility: synchronizedList\n */\nexport const synchronizedList : typeof synchronized = synchronized;\n\n/**\n * Alias for Java compatibility: synchronizedMap\n */\nexport const synchronizedMap : typeof synchronized = synchronized;\n\n/**\n * Alias for Java compatibility: synchronizedCollection\n */\nexport const synchronizedCollection : typeof synchronized = synchronized;\n\n/**\n * Alias for Java compatibility: synchronizedSet\n */\nexport const synchronizedSet : typeof synchronized = synchronized;\n\n/**\n * Advanced synchronized middleware with reentrant locking.\n *\n * With this function, the same \"thread\" (async context) can acquire the lock multiple times.\n * Useful for methods that call other synchronized methods internally.\n *\n * Note: JavaScript has no true thread IDs. This function uses async context\n * tracking if available. If not, the behavior is non-reentrant.\n */\nexport function reentrantSynchronized<C extends object>(): Middleware<C> {\n  return (next: C): C => {\n    const mutex = new Mutex();\n    let lockHolder: symbol | null = null;\n    let lockCount = 0;\n\n    return new Proxy(next, {\n      get(target, prop, receiver) {\n        const value = Reflect.get(target, prop, receiver);\n\n        if (typeof value !== \"function\") {\n          return value;\n        }\n\n        return async function (this: any, ...args: any[]) {\n          // Generate a unique ID for this call context\n          const callerId = Symbol(\"caller\");\n\n          // If we already hold the lock, execute directly (reentrant)\n          if (lockHolder === callerId) {\n            lockCount++;\n            try {\n              const result = (value as Function).apply(target, args);\n              return result instanceof Promise ? await result : result;\n            } finally {\n              lockCount--;\n            }\n          }\n\n          // Otherwise, acquire the lock\n          return mutex.lock(async () => {\n            lockHolder = callerId;\n            lockCount = 1;\n            try {\n              const result = (value as Function).apply(target, args);\n              return result instanceof Promise ? await result : result;\n            } finally {\n              lockCount--;\n              if (lockCount === 0) {\n                lockHolder = null;\n              }\n            }\n          });\n        };\n      },\n    }) as C;\n  };\n}\n\n/**\n * Read-write lock implementation for collections.\n *\n * With this function, multiple concurrent readers can read, but a writer is exclusive.\n * More efficient than full synchronization for read-heavy workloads.\n *\n * @example\n * const list = compose(\n *   readWriteLock()\n * )(arrayList<number>())\n *\n * // Multiple reads can happen concurrently\n * await Promise.all([\n *   list.get(0),\n *   list.get(1),\n *   list.get(2)\n * ])\n */\nexport function readWriteLock<C extends object>(): Middleware<C> {\n  return (next: C): C => {\n    let readers = 0;\n    let writer = false;\n    let waitingReaders: (() => void)[] = [];\n    let waitingWriters: (() => void)[] = [];\n\n    // Hand-off rule: the releaser counts the waiters it wakes (readers += n, or writer = true),\n    // so a woken waiter does not count itself again. (Before, releaseWrite set readers = n and\n    // each woken reader added 1, so the count never came back to 0 and writers waited forever:\n    // BUGS-2026-07 L11.)\n    const acquireRead = async (): Promise<void> => {\n      if (writer || waitingWriters.length > 0) {\n        await new Promise<void>((resolve) => waitingReaders.push(resolve));\n        return;\n      }\n      readers++;\n    };\n\n    const releaseRead = (): void => {\n      readers--;\n      if (readers === 0 && waitingWriters.length > 0) {\n        writer = true;\n        const next = waitingWriters.shift()!;\n        next();\n      }\n    };\n\n    const acquireWrite = async (): Promise<void> => {\n      if (writer || readers > 0) {\n        await new Promise<void>((resolve) => waitingWriters.push(resolve));\n        return;\n      }\n      writer = true;\n    };\n\n    const releaseWrite = (): void => {\n      writer = false;\n      if (waitingWriters.length > 0) {\n        writer = true;\n        const next = waitingWriters.shift()!;\n        next();\n      } else if (waitingReaders.length > 0) {\n        const allReaders = waitingReaders.splice(0);\n        readers += allReaders.length;\n        allReaders.forEach((resolve) => resolve());\n      }\n    };\n\n    // Methods that only read (don't mutate)\n    const READ_METHODS = new Set([\n      \"get\",\n      \"has\",\n      \"contains\",\n      \"containsAll\",\n      \"containsValue\",\n      \"indexOf\",\n      \"lastIndexOf\",\n      \"peek\",\n      \"peekFirst\",\n      \"peekLast\",\n      \"first\",\n      \"last\",\n      \"isEmpty\",\n      \"size\",\n      \"toArray\",\n      \"keys\",\n      \"values\",\n      \"entries\",\n      \"forEach\",\n      \"getOrDefault\",\n      \"getOrUndefined\",\n    ]);\n\n    return new Proxy(next, {\n      get(target, prop, receiver) {\n        const value = Reflect.get(target, prop, receiver);\n\n        if (typeof value !== \"function\") {\n          return value;\n        }\n\n        const isReadMethod = typeof prop === \"string\" && READ_METHODS.has(prop);\n\n        return async function (this: any, ...args: any[]) {\n          if (isReadMethod) {\n            // Acquire read lock\n            await acquireRead();\n            try {\n              const result = (value as Function).apply(target, args);\n              return result instanceof Promise ? await result : result;\n            } finally {\n              releaseRead();\n            }\n          } else {\n            // Acquire write lock\n            await acquireWrite();\n            try {\n              const result = (value as Function).apply(target, args);\n              return result instanceof Promise ? await result : result;\n            } finally {\n              releaseWrite();\n            }\n          }\n        };\n      },\n    }) as C;\n  };\n}\n","/**\n * Composite map methods built on `has`, `get`, `set` and `delete`.\n *\n * A map behavior (lruMap, ttlMap) intercepts the primitive methods. It gives these\n * implementations for the composite methods, bound to the behavior's own proxy.\n * Thus a call like `setIfAbsent` goes through the behavior's `set` and keeps its rules:\n * capacity and recency for LRU, expiry for TTL. (BUGS-2026-07 L13: the composite methods\n * went straight to the map below, so they bypassed the behavior.)\n *\n * The semantics follow HashMap. One difference: `replaceEntry` and `deleteEntry` compare\n * values with Object.is, not with a map's custom value equality.\n */\n\nimport type { Entry, MapLike } from \"../interfaces/map.js\";\n\ntype AnyFn = (...args: never[]) => unknown;\n\nexport function compositeMapMethod<K, V>(map: MapLike<K, V>, name: PropertyKey): AnyFn | undefined {\n  switch (name) {\n    case \"setIfAbsent\":\n      return ((key: K, value: V): V => {\n        if (map.has(key)) return map.get(key);\n        map.set(key, value);\n        return value;\n      }) as AnyFn;\n\n    case \"replace\":\n      return ((key: K, value: V): V | undefined => (map.has(key) ? map.set(key, value) : undefined)) as AnyFn;\n\n    case \"replaceEntry\":\n      return ((key: K, oldValue: V, newValue: V): boolean => {\n        if (!map.has(key) || !Object.is(map.get(key), oldValue)) return false;\n        map.set(key, newValue);\n        return true;\n      }) as AnyFn;\n\n    case \"deleteEntry\":\n      return ((key: K, value: V): boolean => {\n        if (!map.has(key) || !Object.is(map.get(key), value)) return false;\n        map.delete(key);\n        return true;\n      }) as AnyFn;\n\n    case \"computeIfAbsent\":\n      return ((key: K, mappingFunction: (key: K) => V): V => {\n        if (map.has(key)) return map.get(key);\n        const value = mappingFunction(key);\n        map.set(key, value);\n        return value;\n      }) as AnyFn;\n\n    case \"computeIfPresent\":\n      return ((key: K, remapping: (key: K, value: V) => V | undefined): V | undefined => {\n        if (!map.has(key)) return undefined;\n        const value = remapping(key, map.get(key));\n        if (value === undefined) {\n          map.delete(key);\n          return undefined;\n        }\n        map.set(key, value);\n        return value;\n      }) as AnyFn;\n\n    case \"compute\":\n      return ((key: K, remapping: (key: K, value: V | undefined) => V | undefined): V | undefined => {\n        const present = map.has(key);\n        const value = remapping(key, present ? map.get(key) : undefined);\n        if (value === undefined) {\n          if (present) map.delete(key);\n          return undefined;\n        }\n        map.set(key, value);\n        return value;\n      }) as AnyFn;\n\n    case \"merge\":\n      return ((key: K, value: V, remapping: (oldValue: V, newValue: V) => V | undefined): V | undefined => {\n        if (!map.has(key)) {\n          map.set(key, value);\n          return value;\n        }\n        const merged = remapping(map.get(key), value);\n        if (merged === undefined) {\n          map.delete(key);\n          return undefined;\n        }\n        map.set(key, merged);\n        return merged;\n      }) as AnyFn;\n\n    case \"putAll\":\n      return ((other: Iterable<Entry<K, V>>): void => {\n        for (const entry of other) {\n          map.set(entry.key, entry.value);\n        }\n      }) as AnyFn;\n  }\n  return undefined;\n}\n","/**\n * LRU (Least Recently Used) eviction behavior.\n *\n * This module tracks access times and automatically evicts the least recently used\n * elements when capacity is reached. Perfect for caching.\n *\n * @example\n * const cache = compose(\n *   lruMap<string, Data>({ capacity: 100 })\n * )(hashMap<string, Data>())\n *\n * cache.set('key1', data1) // Accessed\n * cache.get('key1')        // Accessed again (moves to front)\n * // When full, least recently accessed keys are evicted\n */\n\nimport { checkCapacity } from \"../core/capacity.js\";\nimport type { Middleware } from \"../core/middleware.js\";\nimport type { MapLike } from \"../interfaces/map.js\";\nimport { compositeMapMethod } from \"./composite.js\";\n\n/**\n * Options for LRU behavior.\n */\nexport interface LRUOptions {\n  /**\n   * The maximum number of entries, a positive whole number. When the map is full, a new key\n   * evicts the least recently used entry.\n   */\n  capacity: number;\n\n  /**\n   * Optional callback invoked when an item is evicted.\n   */\n  onEvict?: (info: { key: any; value: any; timestamp: number }) => void;\n}\n\n/**\n * Metadata for tracking LRU access.\n */\ninterface LRUNode<K, V> {\n  key: K;\n  value: V;\n  lastAccessed: number;\n  prev: LRUNode<K, V> | null;\n  next: LRUNode<K, V> | null;\n}\n\n/**\n * This function makes an LRU Map middleware.\n *\n * This function maintains a doubly-linked list to track access order.\n * Most recently accessed items are at the head.\n * When capacity is exceeded, items at the tail are evicted.\n *\n * @throws RangeError when `options.capacity` is not a positive whole number.\n */\nexport function lruMap<K, V>(\n  options: LRUOptions\n): Middleware<MapLike<K, V>, MapLike<K, V> & { readonly isFull: boolean }> {\n  const { onEvict } = options;\n  const capacity = checkCapacity(options.capacity, \"lruMap\");\n\n  return (next: MapLike<K, V>): MapLike<K, V> & { readonly isFull: boolean } => {\n    // Doubly-linked list for LRU tracking\n    let head: LRUNode<K, V> | null = null;\n    let tail: LRUNode<K, V> | null = null;\n    const nodeMap = new Map<K, LRUNode<K, V>>();\n\n    const moveToHead = (node: LRUNode<K, V>): void => {\n      // Remove from current position\n      if (node.prev) {\n        node.prev.next = node.next;\n      } else {\n        head = node.next;\n      }\n\n      if (node.next) {\n        node.next.prev = node.prev;\n      } else {\n        tail = node.prev;\n      }\n\n      // Add to head\n      node.prev = null;\n      node.next = head;\n      if (head) {\n        head.prev = node;\n      }\n      head = node;\n\n      if (!tail) {\n        tail = node;\n      }\n\n      node.lastAccessed = Date.now();\n    };\n\n    const addNode = (key: K, value: V): void => {\n      const node: LRUNode<K, V> = {\n        key,\n        value,\n        lastAccessed: Date.now(),\n        prev: null,\n        next: head,\n      };\n\n      if (head) {\n        head.prev = node;\n      }\n      head = node;\n\n      if (!tail) {\n        tail = node;\n      }\n\n      nodeMap.set(key, node);\n    };\n\n    const removeNode = (node: LRUNode<K, V>): void => {\n      if (node.prev) {\n        node.prev.next = node.next;\n      } else {\n        head = node.next;\n      }\n\n      if (node.next) {\n        node.next.prev = node.prev;\n      } else {\n        tail = node.prev;\n      }\n\n      nodeMap.delete(node.key);\n    };\n\n    // A layer below this one (for example ttlMap, in compose(lruMap, ttlMap)) can remove an\n    // entry without this layer seeing it. Its node is then stale: the list must not keep it\n    // (it holds the value, and it would grow without bound) and evicting it is not an eviction.\n    const dropStaleNodes = (): void => {\n      for (const node of [...nodeMap.values()]) {\n        if (!next.has(node.key)) {\n          removeNode(node);\n        }\n      }\n    };\n\n    const evictLRU = (): void => {\n      while (tail) {\n        const candidate = tail;\n        removeNode(candidate);\n        if (!next.has(candidate.key)) {\n          // Already removed below: skip it and evict the next least recently used entry\n          continue;\n        }\n        next.delete(candidate.key);\n\n        if (onEvict) {\n          onEvict({\n            key: candidate.key,\n            value: candidate.value,\n            timestamp: candidate.lastAccessed,\n          });\n        }\n        return;\n      }\n    };\n\n    return new Proxy(next, {\n      get(target, prop, receiver) {\n        // Add isFull property\n        if (prop === \"isFull\") {\n          return target.size >= capacity;\n        }\n\n        // Composite methods (setIfAbsent, compute, merge, putAll and others) go through this\n        // proxy's own primitives, so they keep this behavior's rules (BUGS-2026-07 L13)\n        const composite = compositeMapMethod(receiver as MapLike<K, V>, prop);\n        if (composite) {\n          return composite;\n        }\n\n        const value = Reflect.get(target, prop, receiver);\n\n        if (typeof value === \"function\") {\n          switch (prop) {\n            case \"get\":\n              return function (key: K): V {\n                let result: V;\n                try {\n                  result = (value as Function).call(target, key);\n                } catch (error) {\n                  // The entry is gone below (for example expired): forget its node\n                  const stale = nodeMap.get(key);\n                  if (stale) {\n                    removeNode(stale);\n                  }\n                  throw error;\n                }\n                // Update access time\n                const node = nodeMap.get(key);\n                if (node) {\n                  moveToHead(node);\n                }\n                return result;\n              };\n\n            case \"has\":\n              return function (key: K): boolean {\n                const result = (value as Function).call(target, key);\n                const node = nodeMap.get(key);\n                if (node) {\n                  if (result) {\n                    // Update access time\n                    moveToHead(node);\n                  } else {\n                    // The entry is gone below (for example expired): forget its node\n                    removeNode(node);\n                  }\n                }\n                return result;\n              };\n\n            case \"set\":\n              return function (key: K, val: V): V | undefined {\n                const hadKey = target.has(key);\n\n                if (hadKey) {\n                  // Update existing\n                  const oldValue = (value as Function).call(target, key, val);\n                  const node = nodeMap.get(key);\n                  if (node) {\n                    node.value = val;\n                    moveToHead(node);\n                  }\n                  return oldValue;\n                } else {\n                  // Add new. A stale node for this key (its entry was removed below) must not\n                  // stay in the list: evicting it later would delete the new node's map entry.\n                  const stale = nodeMap.get(key);\n                  if (stale) {\n                    removeNode(stale);\n                  }\n                  // Keep the node list bounded: when it reaches capacity, drop stale nodes first\n                  if (nodeMap.size >= capacity) {\n                    dropStaleNodes();\n                  }\n                  if (target.size >= capacity) {\n                    evictLRU();\n                  }\n                  const result = (value as Function).call(target, key, val);\n                  addNode(key, val);\n                  return result;\n                }\n              };\n\n            case \"delete\":\n              return function (key: K): V | undefined {\n                const result = (value as Function).call(target, key);\n                const node = nodeMap.get(key);\n                if (node) {\n                  removeNode(node);\n                }\n                return result;\n              };\n\n            case \"clear\":\n              return function (): void {\n                (value as Function).call(target);\n                head = null;\n                tail = null;\n                nodeMap.clear();\n              };\n          }\n        }\n\n        return value;\n      },\n    }) as MapLike<K, V> & { readonly isFull: boolean };\n  };\n}\n\n/**\n * This class makes an LRU cache with a simpler API.\n * This is a standalone LRU cache implementation.\n *\n * @example\n * const cache = lruCache<string, Data>(100)\n * cache.set('key', value)\n * cache.get('key') // Moves to front\n */\nexport class LRUCache<K, V> {\n  private readonly capacity: number;\n  private readonly onEvict: ((key: K, value: V) => void) | undefined;\n  private map: Map<K, { value: V; node: LRUNode<K, V> }> = new Map();\n  private head: LRUNode<K, V> | null = null;\n  private tail: LRUNode<K, V> | null = null;\n\n  /**\n   * @param capacity - The maximum number of entries, a positive whole number.\n   * @param onEvict - The function that this cache starts for each entry that it evicts.\n   * @throws RangeError when `capacity` is not a positive whole number.\n   */\n  constructor(capacity: number, onEvict?: ((key: K, value: V) => void) | undefined) {\n    this.capacity = checkCapacity(capacity, \"LRUCache\");\n    this.onEvict = onEvict;\n  }\n\n  get size(): number {\n    return this.map.size;\n  }\n\n  get isFull(): boolean {\n    return this.map.size >= this.capacity;\n  }\n\n  get(key: K): V | undefined {\n    const entry = this.map.get(key);\n    if (!entry) return undefined;\n\n    this.moveToHead(entry.node);\n    return entry.value;\n  }\n\n  set(key: K, value: V): void {\n    const entry = this.map.get(key);\n\n    if (entry) {\n      // Update existing\n      entry.value = value;\n      entry.node.value = value;\n      this.moveToHead(entry.node);\n    } else {\n      // Add new\n      if (this.map.size >= this.capacity) {\n        this.evictLRU();\n      }\n\n      const node: LRUNode<K, V> = {\n        key,\n        value,\n        lastAccessed: Date.now(),\n        prev: null,\n        next: this.head,\n      };\n\n      if (this.head) {\n        this.head.prev = node;\n      }\n      this.head = node;\n\n      if (!this.tail) {\n        this.tail = node;\n      }\n\n      this.map.set(key, { value, node });\n    }\n  }\n\n  has(key: K): boolean {\n    return this.map.has(key);\n  }\n\n  delete(key: K): boolean {\n    const entry = this.map.get(key);\n    if (!entry) return false;\n\n    this.removeNode(entry.node);\n    this.map.delete(key);\n    return true;\n  }\n\n  /**\n   * This method deletes each entry for which `matches` gives true, and it gives the number of\n   * deleted entries. It is not a use: the order of the other entries does not change, and it\n   * does not start `onEvict`. It starts `matches` once for each entry, the most recent first. If\n   * `matches` throws, the entries that it matched before stay deleted.\n   *\n   * @param matches - The test of an entry.\n   * @returns The number of deleted entries.\n   */\n  deleteWhere(matches: (value: V, key: K) => boolean): number {\n    const nodes: LRUNode<K, V>[] = [];\n    for (let node = this.head; node; node = node.next) nodes.push(node);\n    let deleted = 0;\n    for (const node of nodes) {\n      // The function `matches` can change the cache. Skip each node that is not in it now.\n      if (this.map.get(node.key)?.node !== node) continue;\n      if (!matches(node.value, node.key)) continue;\n      // The function `matches` can delete this node itself, so check again.\n      if (this.map.get(node.key)?.node !== node) continue;\n      this.removeNode(node);\n      this.map.delete(node.key);\n      deleted++;\n    }\n    return deleted;\n  }\n\n  clear(): void {\n    this.map.clear();\n    this.head = null;\n    this.tail = null;\n  }\n\n  private moveToHead(node: LRUNode<K, V>): void {\n    if (node === this.head) return;\n\n    // Remove from current position\n    if (node.prev) {\n      node.prev.next = node.next;\n    }\n    if (node.next) {\n      node.next.prev = node.prev;\n    } else {\n      this.tail = node.prev;\n    }\n\n    // Add to head\n    node.prev = null;\n    node.next = this.head;\n    if (this.head) {\n      this.head.prev = node;\n    }\n    this.head = node;\n\n    node.lastAccessed = Date.now();\n  }\n\n  private removeNode(node: LRUNode<K, V>): void {\n    if (node.prev) {\n      node.prev.next = node.next;\n    } else {\n      this.head = node.next;\n    }\n\n    if (node.next) {\n      node.next.prev = node.prev;\n    } else {\n      this.tail = node.prev;\n    }\n  }\n\n  private evictLRU(): void {\n    if (!this.tail) return;\n\n    const evicted = this.tail;\n    this.removeNode(evicted);\n    this.map.delete(evicted.key);\n\n    if (this.onEvict) {\n      this.onEvict(evicted.key, evicted.value);\n    }\n  }\n\n  /**\n   * This method gives keys in LRU order (most recent first).\n   */\n  *keys(): IterableIterator<K> {\n    let node = this.head;\n    while (node) {\n      yield node.key;\n      node = node.next;\n    }\n  }\n\n  /**\n   * This method gives entries in LRU order (most recent first).\n   */\n  *entries(): IterableIterator<[K, V]> {\n    let node = this.head;\n    while (node) {\n      yield [node.key, node.value];\n      node = node.next;\n    }\n  }\n}\n\n/**\n * This function makes an LRU cache.\n *\n * @throws RangeError when `capacity` is not a positive whole number.\n */\nexport function lruCache<K, V>(\n  capacity: number,\n  onEvict?: (key: K, value: V) => void\n): LRUCache<K, V> {\n  return new LRUCache(capacity, onEvict);\n}\n","/**\n * TTL (Time-To-Live) expiration behavior.\n *\n * Automatically expires elements after a specified time period.\n * Perfect for temporary caches and time-limited data.\n *\n * @example\n * const cache = compose(\n *   ttlMap<string, Data>({ ttl: 60000 }) // 60 seconds\n * )(hashMap<string, Data>())\n *\n * cache.set('key', data)\n * // After 60 seconds, 'key' is automatically removed\n */\n\nimport type { Middleware } from \"../core/middleware.js\";\nimport type { MapLike } from \"../interfaces/map.js\";\nimport { compositeMapMethod } from \"./composite.js\";\nimport type { Collection } from \"../interfaces/collection.js\";\n\n/**\n * Start the background expiration checker without keeping a Node.js process alive.\n * (In a browser, setInterval gives a number and there is nothing to unref.)\n */\nfunction startExpirationTimer(check: () => void, interval: number): ReturnType<typeof setInterval> {\n  const timer = setInterval(check, interval);\n  (timer as unknown as { unref?: () => void }).unref?.();\n  return timer;\n}\n\n/**\n * Options for TTL behavior.\n */\nexport interface TTLOptions {\n  /**\n   * Time-to-live in milliseconds.\n   * Elements expire after this duration.\n   */\n  ttl: number;\n\n  /**\n   * Interval for checking expired elements (in milliseconds).\n   * @default 1000 (check every second)\n   */\n  checkInterval?: number;\n\n  /**\n   * Optional callback invoked when an element expires.\n   */\n  onExpire?: (info: { key: any; value: any; createdAt: number; expiredAt: number }) => void;\n}\n\n/**\n * Metadata for TTL tracking.\n */\ninterface TTLEntry<V> {\n  value: V;\n  expiresAt: number;\n  createdAt: number;\n}\n\n/**\n * This function makes a TTL Map middleware.\n *\n * Automatically removes entries after TTL expires.\n * This function uses a background interval to check for expired entries.\n */\nexport function ttlMap<K, V>(\n  options: TTLOptions\n): Middleware<MapLike<K, V>, MapLike<K, V> & { readonly dispose: () => void }> {\n  const { ttl, checkInterval = 1000, onExpire } = options;\n\n  return (\n    next: MapLike<K, V>\n  ): MapLike<K, V> & { readonly dispose: () => void } => {\n    const metadata = new Map<K, TTLEntry<V>>();\n    let intervalId: ReturnType<typeof setInterval> | null = null;\n\n    const checkExpired = (): void => {\n      const now = Date.now();\n      const expired: K[] = [];\n\n      for (const [key, entry] of metadata) {\n        if (now >= entry.expiresAt) {\n          expired.push(key);\n        }\n      }\n\n      for (const key of expired) {\n        const entry = metadata.get(key);\n        if (entry) {\n          next.delete(key);\n          metadata.delete(key);\n\n          if (onExpire) {\n            onExpire({\n              key,\n              value: entry.value,\n              createdAt: entry.createdAt,\n              expiredAt: now,\n            });\n          }\n        }\n      }\n    };\n\n    // Start background expiration checker\n    intervalId = startExpirationTimer(checkExpired, checkInterval);\n\n    const dispose = (): void => {\n      if (intervalId) {\n        clearInterval(intervalId);\n        intervalId = null;\n      }\n    };\n\n    return new Proxy(next, {\n      get(target, prop, receiver) {\n        // Add dispose method\n        if (prop === \"dispose\") {\n          return dispose;\n        }\n\n        // Composite methods (setIfAbsent, compute, merge, putAll and others) go through this\n        // proxy's own primitives, so they keep the expiry rules (BUGS-2026-07 L13)\n        const composite = compositeMapMethod(receiver as MapLike<K, V>, prop);\n        if (composite) {\n          return composite;\n        }\n\n        const value = Reflect.get(target, prop, receiver);\n\n        if (typeof value === \"function\") {\n          switch (prop) {\n            case \"get\":\n              return function (key: K): V {\n                // Check if expired before returning\n                const entry = metadata.get(key);\n                if (entry && Date.now() >= entry.expiresAt) {\n                  target.delete(key);\n                  metadata.delete(key);\n                  throw new Error(`Key expired: ${key}`);\n                }\n                return (value as Function).call(target, key);\n              };\n\n            case \"has\":\n              return function (key: K): boolean {\n                // Check if expired\n                const entry = metadata.get(key);\n                if (entry && Date.now() >= entry.expiresAt) {\n                  target.delete(key);\n                  metadata.delete(key);\n                  return false;\n                }\n                return (value as Function).call(target, key);\n              };\n\n            case \"set\":\n              return function (key: K, val: V): V | undefined {\n                const now = Date.now();\n                const result = (value as Function).call(target, key, val);\n\n                metadata.set(key, {\n                  value: val,\n                  expiresAt: now + ttl,\n                  createdAt: now,\n                });\n\n                return result;\n              };\n\n            case \"delete\":\n              return function (key: K): V | undefined {\n                const result = (value as Function).call(target, key);\n                metadata.delete(key);\n                return result;\n              };\n\n            case \"clear\":\n              return function (): void {\n                (value as Function).call(target);\n                metadata.clear();\n              };\n          }\n        }\n\n        return value;\n      },\n    }) as MapLike<K, V> & { readonly dispose: () => void };\n  };\n}\n\n/**\n * This function makes a TTL Collection middleware.\n *\n * Note: This is less precise than TTL map because collections don't have keys.\n * Elements are tracked by reference, which can fail for primitive types.\n */\nexport function ttlCollection<T>(\n  options: Omit<TTLOptions, \"onExpire\"> & {\n    onExpire?: (info: { element: T; createdAt: number; expiredAt: number }) => void;\n  }\n): Middleware<Collection<T>, Collection<T> & { readonly dispose: () => void }> {\n  const { ttl, checkInterval = 1000, onExpire } = options;\n\n  return (\n    next: Collection<T>\n  ): Collection<T> & { readonly dispose: () => void } => {\n    const metadata = new Map<T, { expiresAt: number; createdAt: number }>();\n    let intervalId: ReturnType<typeof setInterval> | null = null;\n\n    const checkExpired = (): void => {\n      const now = Date.now();\n      const expired: T[] = [];\n\n      for (const [element, entry] of metadata) {\n        if (now >= entry.expiresAt) {\n          expired.push(element);\n        }\n      }\n\n      for (const element of expired) {\n        const entry = metadata.get(element);\n        if (entry) {\n          next.remove(element);\n          metadata.delete(element);\n\n          if (onExpire) {\n            onExpire({\n              element,\n              createdAt: entry.createdAt,\n              expiredAt: now,\n            });\n          }\n        }\n      }\n    };\n\n    intervalId = startExpirationTimer(checkExpired, checkInterval);\n\n    const dispose = (): void => {\n      if (intervalId) {\n        clearInterval(intervalId);\n        intervalId = null;\n      }\n    };\n\n    return new Proxy(next, {\n      get(target, prop, receiver) {\n        if (prop === \"dispose\") {\n          return dispose;\n        }\n\n        const value = Reflect.get(target, prop, receiver);\n\n        if (typeof value === \"function\") {\n          switch (prop) {\n            case \"add\":\n              return function (element: T): boolean {\n                const result = (value as Function).call(target, element);\n                if (result) {\n                  const now = Date.now();\n                  metadata.set(element, {\n                    expiresAt: now + ttl,\n                    createdAt: now,\n                  });\n                }\n                return result;\n              };\n\n            case \"remove\":\n              return function (element: T): boolean {\n                const result = (value as Function).call(target, element);\n                if (result) {\n                  metadata.delete(element);\n                }\n                return result;\n              };\n\n            case \"clear\":\n              return function (): void {\n                (value as Function).call(target);\n                metadata.clear();\n              };\n          }\n        }\n\n        return value;\n      },\n    }) as Collection<T> & { readonly dispose: () => void };\n  };\n}\n\n/**\n * Standalone TTL cache with Map-like API.\n *\n * @example\n * const cache = new TTLCache<string, number>(60000) // 60 second TTL\n * cache.set('key', 42)\n * setTimeout(() => {\n *   cache.get('key') // undefined (expired)\n * }, 61000)\n */\nexport class TTLCache<K, V> {\n  private readonly ttl: number;\n  private readonly checkInterval: number;\n  private readonly onExpire: ((key: K, value: V) => void) | undefined;\n  private map = new Map<K, TTLEntry<V>>();\n  private intervalId: ReturnType<typeof setInterval> | null = null;\n\n  constructor(ttl: number, checkInterval: number = 1000, onExpire?: ((key: K, value: V) => void) | undefined) {\n    this.ttl = ttl;\n    this.checkInterval = checkInterval;\n    this.onExpire = onExpire;\n    this.startExpirationCheck();\n  }\n\n  get size(): number {\n    this.cleanup();\n    return this.map.size;\n  }\n\n  get(key: K): V | undefined {\n    const entry = this.map.get(key);\n    if (!entry) return undefined;\n\n    if (Date.now() >= entry.expiresAt) {\n      this.map.delete(key);\n      if (this.onExpire) {\n        this.onExpire(key, entry.value);\n      }\n      return undefined;\n    }\n\n    return entry.value;\n  }\n\n  set(key: K, value: V, customTTL?: number): void {\n    const now = Date.now();\n    const ttlToUse = customTTL !== undefined ? customTTL : this.ttl;\n\n    this.map.set(key, {\n      value,\n      expiresAt: now + ttlToUse,\n      createdAt: now,\n    });\n  }\n\n  has(key: K): boolean {\n    return this.get(key) !== undefined;\n  }\n\n  delete(key: K): boolean {\n    return this.map.delete(key);\n  }\n\n  clear(): void {\n    this.map.clear();\n  }\n\n  /**\n   * Manually trigger cleanup of expired entries.\n   */\n  cleanup(): void {\n    const now = Date.now();\n    const expired: K[] = [];\n\n    for (const [key, entry] of this.map) {\n      if (now >= entry.expiresAt) {\n        expired.push(key);\n      }\n    }\n\n    for (const key of expired) {\n      const entry = this.map.get(key);\n      if (entry) {\n        this.map.delete(key);\n        if (this.onExpire) {\n          this.onExpire(key, entry.value);\n        }\n      }\n    }\n  }\n\n  /**\n   * Get remaining TTL for a key in milliseconds.\n   * This method gives undefined if key doesn't exist or is expired.\n   */\n  getTTL(key: K): number | undefined {\n    const entry = this.map.get(key);\n    if (!entry) return undefined;\n\n    const remaining = entry.expiresAt - Date.now();\n    return remaining > 0 ? remaining : undefined;\n  }\n\n  /**\n   * Update TTL for an existing key.\n   */\n  touch(key: K, customTTL?: number): boolean {\n    const entry = this.map.get(key);\n    if (!entry) return false;\n\n    if (Date.now() >= entry.expiresAt) {\n      this.map.delete(key);\n      return false;\n    }\n\n    const ttlToUse = customTTL !== undefined ? customTTL : this.ttl;\n    entry.expiresAt = Date.now() + ttlToUse;\n    return true;\n  }\n\n  private startExpirationCheck(): void {\n    this.intervalId = startExpirationTimer(() => this.cleanup(), this.checkInterval);\n  }\n\n  /**\n   * Stop the background expiration checker and clean up.\n   */\n  dispose(): void {\n    if (this.intervalId) {\n      clearInterval(this.intervalId);\n      this.intervalId = null;\n    }\n  }\n\n  *keys(): IterableIterator<K> {\n    this.cleanup();\n    yield* this.map.keys();\n  }\n\n  *values(): IterableIterator<V> {\n    this.cleanup();\n    for (const entry of this.map.values()) {\n      yield entry.value;\n    }\n  }\n\n  *entries(): IterableIterator<[K, V]> {\n    this.cleanup();\n    for (const [key, entry] of this.map) {\n      yield [key, entry.value];\n    }\n  }\n}\n\n/**\n * Factory function to make a TTL cache.\n */\nexport function ttlCache<K, V>(\n  ttl: number,\n  options?: {\n    checkInterval?: number;\n    onExpire?: (key: K, value: V) => void;\n  }\n): TTLCache<K, V> {\n  return new TTLCache(\n    ttl,\n    options?.checkInterval,\n    options?.onExpire\n  );\n}\n","/**\n * AsyncQueue - An async iterable queue with backpressure support.\n *\n * The queue is for producer-consumer patterns where producers can wait when\n * the queue is full and consumers can wait when the queue is empty.\n * This module implements AsyncIterable for use with for-await-of loops.\n *\n * @example\n * const queue = asyncQueue<number>({ capacity: 10 })\n *\n * // Producer\n * await queue.put(42) // Waits if queue is full\n *\n * // Consumer\n * const value = await queue.take() // Waits if queue is empty\n *\n * // Async iteration\n * for await (const value of queue) {\n *   console.log(value)\n * }\n */\n\nimport type { AsyncQueue as IAsyncQueue } from \"../interfaces/queue.js\";\n\n/**\n * Options for making an AsyncQueue.\n */\nexport interface AsyncQueueOptions {\n  /**\n   * Maximum capacity. Infinity for unbounded queue.\n   * @default Infinity\n   */\n  capacity?: number;\n\n  /**\n   * Timeout for put/take operations in milliseconds.\n   * @default undefined (no timeout)\n   */\n  timeout?: number;\n}\n\n/**\n * Resolver for waiting operations.\n */\ninterface Resolver<T> {\n  resolve: (value: T) => void;\n  reject: (reason: any) => void;\n  timeoutId?: ReturnType<typeof setTimeout>;\n}\n\n/** A waiting put: it keeps its element until the queue takes it. */\ninterface Putter<T> extends Resolver<void> {\n  element: T;\n}\n\n/**\n * AsyncQueue<T> - Thread-safe async queue with backpressure.\n *\n * Features:\n * - Blocking put() when full (backpressure)\n * - Blocking take() when empty\n * - AsyncIterable support\n * - Graceful closing\n * - Timeouts\n *\n * Perfect for:\n * - Producer-consumer patterns\n * - Rate limiting\n * - Task queues\n * - Stream processing\n */\nexport class AsyncQueue<T> implements IAsyncQueue<T> {\n  private buffer: T[] = [];\n  private putters: Putter<T>[] = [];\n  private takers: Resolver<T>[] = [];\n  /** The calls of `peek` that wait: they see the next element, but they do not take it. */\n  private peekers: Resolver<T>[] = [];\n  private _isClosed = false;\n  private readonly capacity: number;\n  private readonly defaultTimeout?: number;\n\n  constructor(options: AsyncQueueOptions = {}) {\n    this.capacity = options.capacity ?? Infinity;\n    if (options.timeout !== undefined) {\n      this.defaultTimeout = options.timeout;\n    }\n  }\n\n  // ========================================================================\n  // Size and state\n  // ========================================================================\n\n  get size(): number {\n    return this.buffer.length;\n  }\n\n  get isEmpty(): boolean {\n    return this.buffer.length === 0;\n  }\n\n  get isFull(): boolean {\n    return this.buffer.length >= this.capacity;\n  }\n\n  get isClosed(): boolean {\n    return this._isClosed;\n  }\n\n  get remainingCapacity(): number {\n    return this.capacity === Infinity ? Infinity : this.capacity - this.buffer.length;\n  }\n\n  // ========================================================================\n  // Blocking operations\n  // ========================================================================\n\n  /**\n   * This method adds an element to the queue.\n   * If the queue is full, waits until space is available. With a capacity of 0, it waits until\n   * a taker takes the element (a rendezvous).\n   *\n   * @throws Error if queue is closed\n   * @throws Error if timeout expires\n   */\n  async put(element: T, timeout?: number): Promise<void> {\n    if (this._isClosed) {\n      throw new Error(\"Queue is closed\");\n    }\n    if (this.tryPutNow(element)) {\n      return;\n    }\n\n    // A waiting peek sees the element of a waiting put (a capacity of 0)\n    this.wakePeekers(element);\n\n    // Queue is full: wait with the element. (Before, a waiting putter kept only its resolve\n    // function, so its element was dropped when space came: BUGS-2026-07 C11.)\n    return new Promise<void>((resolve, reject) => {\n      const putter: Putter<T> = { element, resolve, reject };\n      const timeoutMs = timeout ?? this.defaultTimeout;\n      if (timeoutMs !== undefined) {\n        putter.timeoutId = setTimeout(() => {\n          const index = this.putters.indexOf(putter);\n          if (index !== -1) {\n            this.putters.splice(index, 1);\n          }\n          reject(new Error(`Put timeout after ${timeoutMs}ms`));\n        }, timeoutMs);\n      }\n      this.putters.push(putter);\n    });\n  }\n\n  /**\n   * Removes and gives an element from the queue.\n   * If the queue is empty, waits until an element is available.\n   *\n   * @throws Error if queue is closed and empty\n   * @throws Error if timeout expires\n   */\n  async take(timeout?: number): Promise<T> {\n    const next = this.takeNow();\n    if (next.found) {\n      return next.element;\n    }\n\n    // If closed and empty, throw\n    if (this._isClosed) {\n      throw new Error(\"Queue is closed and empty\");\n    }\n\n    // Wait for an element\n    return new Promise<T>((resolve, reject) => {\n      const taker: Resolver<T> = { resolve, reject };\n      const timeoutMs = timeout ?? this.defaultTimeout;\n      if (timeoutMs !== undefined) {\n        taker.timeoutId = setTimeout(() => {\n          const index = this.takers.indexOf(taker);\n          if (index !== -1) {\n            this.takers.splice(index, 1);\n          }\n          reject(new Error(`Take timeout after ${timeoutMs}ms`));\n        }, timeoutMs);\n      }\n      this.takers.push(taker);\n    });\n  }\n\n  /**\n   * This method waits for the next element, as `take` does, but it gives the element to\n   * `onElement` and the closure of the queue to `onClosed`. These calls are synchronous: they\n   * occur in the call that adds the element or closes the queue. The method has no timeout.\n   *\n   * The function that it gives withdraws the wait. A withdrawn wait gets no element, so no\n   * element goes to a taker that left. `select` races its cases with this method.\n   *\n   * @returns A function that withdraws the wait. It gives true when the wait had no element yet.\n   */\n  waitTake(onElement: (element: T) => void, onClosed: (error: Error) => void): () => boolean {\n    const next = this.takeNow();\n    if (next.found) {\n      onElement(next.element);\n      return () => false;\n    }\n    if (this._isClosed) {\n      onClosed(new Error(\"Queue is closed and empty\"));\n      return () => false;\n    }\n    const taker: Resolver<T> = { resolve: onElement, reject: onClosed };\n    this.takers.push(taker);\n    return () => {\n      const index = this.takers.indexOf(taker);\n      if (index === -1) return false;\n      this.takers.splice(index, 1);\n      return true;\n    };\n  }\n\n  // ========================================================================\n  // Non-blocking operations\n  // ========================================================================\n\n  /**\n   * This method tries to add an element without waiting.\n   * This method gives false if queue is full (with a capacity of 0: if no taker waits).\n   */\n  tryPut(element: T): boolean {\n    if (this._isClosed) {\n      return false;\n    }\n    return this.tryPutNow(element);\n  }\n\n  /**\n   * This method tries to remove an element without waiting.\n   * This method gives undefined if queue is empty.\n   */\n  tryTake(): T | undefined {\n    const next = this.takeNow();\n    return next.found ? next.element : undefined;\n  }\n\n  /** This method gives the element to a waiting taker, or puts it in the buffer when there is space. */\n  private tryPutNow(element: T): boolean {\n    // A waiting taker gets the element directly (the buffer is empty when a taker waits)\n    const taker = this.takers.shift();\n    if (taker) {\n      this.wakePeekers(element);\n      this.clearTimeout(taker);\n      taker.resolve(element);\n      return true;\n    }\n    if (this.buffer.length < this.capacity) {\n      this.buffer.push(element);\n      this.wakePeekers(element);\n      return true;\n    }\n    return false;\n  }\n\n  /** Each waiting peek gets the element, which stays where it is. */\n  private wakePeekers(element: T): void {\n    const peekers = this.peekers;\n    this.peekers = [];\n    for (const peeker of peekers) {\n      this.clearTimeout(peeker);\n      peeker.resolve(element);\n    }\n  }\n\n  /**\n   * This method takes the next element: from the buffer (then a waiting putter moves its element into the\n   * buffer), or directly from a waiting putter (a capacity of 0). (Before, the direct path\n   * released the putter but did not give its element to the taker, so the taker waited forever:\n   * BUGS-2026-07 C11.)\n   */\n  private takeNow(): { found: true; element: T } | { found: false } {\n    if (this.buffer.length > 0) {\n      const element = this.buffer.shift()!;\n      this.admitPutter();\n      return { found: true, element };\n    }\n    const putter = this.putters.shift();\n    if (putter) {\n      this.clearTimeout(putter);\n      putter.resolve();\n      return { found: true, element: putter.element };\n    }\n    return { found: false };\n  }\n\n  // ========================================================================\n  // Peeking\n  // ========================================================================\n\n  /**\n   * This method gives the next element without removing it.\n   * Waits if queue is empty.\n   */\n  async peek(): Promise<T> {\n    if (this.buffer.length > 0) {\n      return this.buffer[0]!;\n    }\n    if (this.putters.length > 0) {\n      return this.putters[0]!.element;\n    }\n\n    if (this._isClosed) {\n      throw new Error(\"Queue is closed and empty\");\n    }\n\n    // Wait for the next element without a take. (Before, peek took the element and put it back\n    // at the front: a take that waited after it kept waiting, and the order changed: audit pass 2.)\n    return new Promise<T>((resolve, reject) => {\n      const peeker: Resolver<T> = { resolve, reject };\n      const timeoutMs = this.defaultTimeout;\n      if (timeoutMs !== undefined) {\n        peeker.timeoutId = setTimeout(() => {\n          const index = this.peekers.indexOf(peeker);\n          if (index !== -1) {\n            this.peekers.splice(index, 1);\n          }\n          reject(new Error(`Peek timeout after ${timeoutMs}ms`));\n        }, timeoutMs);\n      }\n      this.peekers.push(peeker);\n    });\n  }\n\n  /**\n   * This method gives the next element without waiting.\n   * This method gives undefined if queue is empty.\n   */\n  tryPeek(): T | undefined {\n    return this.buffer.length > 0 ? this.buffer[0] : this.putters[0]?.element;\n  }\n\n  // ========================================================================\n  // Closing and draining\n  // ========================================================================\n\n  /**\n   * This method closes the queue. No more elements can be added.\n   * Existing elements can still be consumed.\n   */\n  close(): void {\n    this._isClosed = true;\n\n    // Reject all waiting putters\n    for (const putter of this.putters) {\n      this.clearTimeout(putter);\n      putter.reject(new Error(\"Queue closed\"));\n    }\n    this.putters = [];\n\n    // Wake up takers if queue is empty\n    if (this.buffer.length === 0) {\n      for (const taker of this.takers) {\n        this.clearTimeout(taker);\n        taker.reject(new Error(\"Queue closed and empty\"));\n      }\n      this.takers = [];\n      for (const peeker of this.peekers) {\n        this.clearTimeout(peeker);\n        peeker.reject(new Error(\"Queue closed and empty\"));\n      }\n      this.peekers = [];\n    }\n  }\n\n  /**\n   * This method drains all elements into an array.\n   * This method gives immediately with current elements.\n   */\n  drain(): T[] {\n    // The buffer, then the elements of the waiting putters, in order. (Before, the waiting\n    // putters were released but their elements were dropped.)\n    const elements = this.buffer.slice();\n    this.buffer = [];\n    for (const putter of this.putters.splice(0)) {\n      this.clearTimeout(putter);\n      putter.resolve();\n      elements.push(putter.element);\n    }\n    return elements;\n  }\n\n  // ========================================================================\n  // Async iteration\n  // ========================================================================\n\n  /**\n   * Async iterator that yields elements as they become available.\n   * Stops when queue is closed and empty.\n   */\n  async *[Symbol.asyncIterator](): AsyncIterator<T> {\n    while (true) {\n      const next = this.takeNow();\n      if (next.found) {\n        yield next.element;\n      } else if (this._isClosed) {\n        break;\n      } else {\n        let element: T;\n        try {\n          element = await this.take();\n        } catch (error) {\n          // The queue was closed while the iterator waited\n          if (this._isClosed) break;\n          throw error;\n        }\n        yield element;\n      }\n    }\n  }\n\n  // ========================================================================\n  // Private helpers\n  // ========================================================================\n\n  /** When the buffer has space, the first waiting putter moves its element into it. */\n  private admitPutter(): void {\n    if (this.putters.length > 0 && this.buffer.length < this.capacity) {\n      const putter = this.putters.shift()!;\n      this.clearTimeout(putter);\n      this.buffer.push(putter.element);\n      putter.resolve();\n    }\n  }\n\n  private clearTimeout(resolver: Resolver<any>): void {\n    if (resolver.timeoutId) {\n      clearTimeout(resolver.timeoutId);\n    }\n  }\n\n  // ========================================================================\n  // Utility methods\n  // ========================================================================\n\n  /**\n   * This method gives statistics about the queue.\n   */\n  getStats() : {\n    size: number;\n    capacity: number;\n    isEmpty: boolean;\n    isFull: boolean;\n    isClosed: boolean;\n    waitingPutters: number;\n    waitingTakers: number;\n    remainingCapacity: number;\n  } {\n    return {\n      size: this.size,\n      capacity: this.capacity,\n      isEmpty: this.isEmpty,\n      isFull: this.isFull,\n      isClosed: this._isClosed,\n      waitingPutters: this.putters.length,\n      waitingTakers: this.takers.length,\n      remainingCapacity: this.remainingCapacity,\n    };\n  }\n\n  toString(): string {\n    return `AsyncQueue[size=${this.size}, capacity=${this.capacity}, closed=${this._isClosed}]`;\n  }\n}\n\n/**\n * Factory function to make an AsyncQueue.\n *\n * @example\n * const queue = asyncQueue<number>({ capacity: 100 })\n * await queue.put(42)\n * const value = await queue.take()\n */\nexport function asyncQueue<T>(options?: AsyncQueueOptions): AsyncQueue<T> {\n  return new AsyncQueue<T>(options);\n}\n","/**\n * Go-style channels for CSP (Communicating Sequential Processes).\n *\n * This module gives typed, bidirectional communication channels inspired by Go.\n * Perfect for coordinating async operations and implementing concurrent patterns.\n *\n * @example\n * const ch = channel<number>()\n *\n * // Sender\n * await ch.send(42)\n *\n * // Receiver\n * const value = await ch.receive()\n *\n * // Select from multiple channels\n * const result = await select(\n *   ch1.case((v) => console.log('ch1:', v)),\n *   ch2.case((v) => console.log('ch2:', v))\n * )\n */\n\nimport { asyncQueue, type AsyncQueue } from \"./async-queue.js\";\n\n/**\n * Channel<T> - Bidirectional communication channel.\n *\n * The channels of Go are the model. This class gives send/receive operations\n * that can block until the other side is ready.\n */\nexport class Channel<T> {\n  private queue: AsyncQueue<T>;\n  private _isClosed = false;\n\n  constructor(bufferSize: number = 0) {\n    // A buffer size of 0 is an unbuffered channel: send waits for a receiver (a rendezvous).\n    // (Before, `bufferSize || 1` gave it a buffer of 1: BUGS-2026-07 L17.)\n    this.queue = asyncQueue<T>({ capacity: bufferSize });\n  }\n\n  /**\n   * This method sends a value through the channel.\n   * Blocks if channel buffer is full.\n   *\n   * @throws Error if channel is closed\n   */\n  async send(value: T): Promise<void> {\n    if (this._isClosed) {\n      throw new Error(\"Cannot send on closed channel\");\n    }\n    await this.queue.put(value);\n  }\n\n  /**\n   * This method receives a value from the channel.\n   * Blocks if no value is available.\n   *\n   * @throws Error if channel is closed and empty\n   */\n  async receive(): Promise<T> {\n    return await this.queue.take();\n  }\n\n  /**\n   * This method waits for one value, as `receive` does, and gives it to `onValue`. When the\n   * channel is closed and empty, it calls `onClosed`. These calls are synchronous: they occur in\n   * the call that sends the value or closes the channel.\n   *\n   * The function that it gives withdraws the wait, so no later value goes to it.\n   *\n   * @returns A function that withdraws the wait. It gives true when the wait had no value yet.\n   */\n  waitReceive(onValue: (value: T) => void, onClosed: (error: Error) => void): () => boolean {\n    return this.queue.waitTake(onValue, onClosed);\n  }\n\n  /**\n   * This method tries to send without blocking.\n   * This method gives false if channel is full.\n   */\n  trySend(value: T): boolean {\n    if (this._isClosed) return false;\n    return this.queue.tryPut(value);\n  }\n\n  /**\n   * This method tries to receive without blocking.\n   * This method gives undefined if no value is available.\n   */\n  tryReceive(): T | undefined {\n    return this.queue.tryTake();\n  }\n\n  /**\n   * This method closes the channel. No more values can be sent.\n   * Receivers can still drain remaining values.\n   */\n  close(): void {\n    this._isClosed = true;\n    this.queue.close();\n  }\n\n  get isClosed(): boolean {\n    return this._isClosed;\n  }\n\n  get size(): number {\n    return this.queue.size;\n  }\n\n  /**\n   * This method makes a select case for this channel.\n   * The select() function uses this value for multiplexing.\n   */\n  case<R>(handler: (value: T) => R): SelectCase<R> {\n    return {\n      channel: this,\n      handler,\n      tryReceive: () => this.tryReceive(),\n      receive: () => this.receive(),\n      wait: (onValue, onClosed) => this.waitReceive(onValue, onClosed),\n    };\n  }\n\n  /**\n   * Async iteration over channel values.\n   * Stops when channel is closed and empty.\n   */\n  async *[Symbol.asyncIterator](): AsyncIterator<T> {\n    while (true) {\n      try {\n        yield await this.receive();\n      } catch (e) {\n        // Channel closed\n        break;\n      }\n    }\n  }\n}\n\n/**\n * SelectCase represents a case in a select statement.\n */\nexport interface SelectCase<R> {\n  channel: Channel<any>;\n  handler: (value: any) => R;\n  tryReceive: () => any;\n  receive: () => Promise<any>;\n  /**\n   * A wait for one value that `select` can withdraw: `Channel.waitReceive`. A case without it\n   * uses the `waitReceive` method of its channel.\n   */\n  wait?: (onValue: (value: any) => void, onClosed: (error: Error) => void) => () => boolean;\n}\n\n/** A wait for one value that can be withdrawn, as `Channel.waitReceive` gives it. */\ntype Wait = (onValue: (value: unknown) => void, onClosed: (error: Error) => void) => () => boolean;\n\n/**\n * This function gives the first value of the waits, with the index of its wait. It rejects with\n * the error of the first wait whose channel is closed and empty. It withdraws each other wait in\n * the same call, so a later value stays in its channel. (Before, the receives of the cases that\n * lost stayed in their channels and dropped the next value of each: audit O56.)\n */\nfunction firstOf(waits: readonly Wait[]): Promise<{ index: number; value: unknown }> {\n  return new Promise((resolve, reject) => {\n    const withdraws: Array<() => boolean> = [];\n    let settled = false;\n    const end = (): void => {\n      settled = true;\n      for (const withdraw of withdraws) withdraw();\n    };\n    // A wait can call back at once, in its own call, when its channel has a value or is closed\n    try {\n      for (let index = 0; index < waits.length && !settled; index++) {\n        withdraws.push(\n          waits[index]!(\n            (value) => {\n              if (settled) return;\n              end();\n              resolve({ index, value });\n            },\n            (error) => {\n              if (settled) return;\n              end();\n              reject(error);\n            },\n          ),\n        );\n      }\n    } catch (error) {\n      // A wait that throws: the waits before it are withdrawn\n      if (!settled) end();\n      reject(error);\n    }\n  });\n}\n\n/**\n * Selects from multiple channels (like Go's select statement).\n *\n * This function waits for the first channel to have a value available,\n * then calls its handler and gives the result.\n *\n * The first case with a value at once wins. The cases that lose keep no receive: a value that\n * comes later stays in its channel for the next receiver. When the channel of a case is closed\n * and empty, the given promise rejects.\n *\n * @example\n * const result = await select(\n *   ch1.case((v) => `ch1: ${v}`),\n *   ch2.case((v) => `ch2: ${v}`),\n *   timeout(1000).case(() => 'timeout')\n * )\n */\nexport async function select<R>(...cases: SelectCase<R>[]): Promise<R> {\n  const { index, value } = await firstOf(\n    cases.map((c): Wait => c.wait ?? ((onValue, onClosed) => c.channel.waitReceive(onValue, onClosed))),\n  );\n  // The handler runs after the race, not in the call of the sender\n  return cases[index]!.handler(value);\n}\n\n/**\n * This function makes a timeout channel that sends after the specified duration.\n *\n * @example\n * const result = await select(\n *   dataChannel.case((v) => v),\n *   timeout(5000).case(() => 'timeout!')\n * )\n */\nexport function timeout(ms: number): Channel<void> {\n  const ch = new Channel<void>();\n  setTimeout(() => {\n    ch.send(undefined).catch(() => {}); // Ignore if closed\n    ch.close();\n  }, ms);\n  return ch;\n}\n\n/**\n * This function makes a ticker channel that sends at regular intervals.\n *\n * @example\n * const tick = ticker(1000) // Every second\n * for await (const t of tick) {\n *   console.log('Tick:', t)\n * }\n */\nexport function ticker(ms: number): Channel<number> & { stop: () => void } {\n  const ch = new Channel<number>(1);\n  let count = 0;\n\n  const intervalId = setInterval(() => {\n    ch.trySend(count++);\n  }, ms);\n\n  return Object.assign(ch, {\n    stop: () => {\n      clearInterval(intervalId);\n      ch.close();\n    },\n  });\n}\n\n/**\n * Pipeline: pipes values from input channel through transform to output channel.\n *\n * @example\n * const input = channel<number>()\n * const output = pipeline(input, (x) => x * 2)\n *\n * await input.send(5)\n * const result = await output.receive() // 10\n */\nexport function pipeline<T, U>(\n  input: Channel<T>,\n  transform: (value: T) => U | Promise<U>,\n  bufferSize: number = 0\n): Channel<U> {\n  const output = new Channel<U>(bufferSize);\n\n  // The output closes also when the transform fails, so its reader does not wait forever. The\n  // error goes to the console, as in workerPool. (Before, it was an unhandled rejection: audit pass 2.)\n  (async () => {\n    try {\n      for await (const value of input) {\n        const transformed = await transform(value);\n        await output.send(transformed);\n      }\n    } finally {\n      output.close();\n    }\n  })().catch((error: unknown) => console.error(\"pipeline error:\", error));\n\n  return output;\n}\n\n/**\n * Fan-out: distributes values from one input channel to multiple output channels.\n *\n * @example\n * const input = channel<number>()\n * const [out1, out2, out3] = fanOut(input, 3)\n *\n * // Each output gets a copy of every input value\n */\nexport function fanOut<T>(input: Channel<T>, count: number, bufferSize: number = 0): Channel<T>[] {\n  const outputs = Array.from({ length: count }, () => new Channel<T>(bufferSize));\n\n  (async () => {\n    try {\n      for await (const value of input) {\n        await Promise.all(outputs.map((ch) => ch.send(value)));\n      }\n    } finally {\n      outputs.forEach((ch) => ch.close());\n    }\n  })().catch((error: unknown) => console.error(\"fanOut error:\", error));\n\n  return outputs;\n}\n\n/**\n * Fan-in: merges multiple input channels into one output channel.\n *\n * @example\n * const ch1 = channel<number>()\n * const ch2 = channel<number>()\n * const merged = fanIn(ch1, ch2)\n *\n * // merged receives values from both ch1 and ch2\n */\nexport function fanIn<T>(...inputs: Channel<T>[]): Channel<T> {\n  const output = new Channel<T>();\n\n  const workers = inputs.map(async (input) => {\n    for await (const value of input) {\n      await output.send(value);\n    }\n  });\n\n  // All the workers settle, then the output closes, also after a failed send\n  Promise.allSettled(workers).then((results) => {\n    output.close();\n    for (const result of results) if (result.status === \"rejected\") console.error(\"fanIn error:\", result.reason);\n  });\n\n  return output;\n}\n\n/**\n * Merge: like fanIn but closes output when first input closes.\n *\n * It takes one value at a time, from the inputs in turn. It keeps no receive on an input while\n * it waits for the reader of the output. Thus each value of each input reaches the output one\n * time, in the order of its input, or stays in its input.\n */\nexport function merge<T>(...inputs: Channel<T>[]): Channel<T> {\n  const output = new Channel<T>();\n\n  (async () => {\n    // The input after the input of the last value comes first, so a busy input starves no other\n    let start = 0;\n    while (true) {\n      const order = inputs.map((_, offset) => (start + offset) % inputs.length);\n      let next: { index: number; value: unknown };\n      try {\n        next = await firstOf(order.map((index): Wait => (onValue, onClosed) => inputs[index]!.waitReceive(onValue, onClosed)));\n      } catch {\n        // An input is closed and empty\n        break;\n      }\n      const index = order[next.index]!;\n      start = (index + 1) % inputs.length;\n      try {\n        await output.send(next.value as T);\n      } catch {\n        // The reader closed the output\n        break;\n      }\n    }\n    output.close();\n  })();\n\n  return output;\n}\n\n/**\n * Buffered channel with specified capacity.\n */\nexport function buffered<T>(capacity: number): Channel<T> {\n  return new Channel<T>(capacity);\n}\n\n/**\n * Unbuffered channel (rendezvous point).\n * Sends block until receiver is ready.\n */\nexport function unbuffered<T>(): Channel<T> {\n  return new Channel<T>(0);\n}\n\n/**\n * Factory function to make a channel.\n *\n * @example\n * const ch = channel<number>()\n * const bufferedCh = channel<string>(10)\n */\nexport function channel<T>(bufferSize: number = 0): Channel<T> {\n  return new Channel<T>(bufferSize);\n}\n\n/**\n * WorkerPool: distributes work across multiple workers.\n *\n * @example\n * const pool = workerPool(\n *   jobChannel,\n *   async (job) => await processJob(job),\n *   { workers: 4 }\n * )\n *\n * // 4 workers concurrently process jobs from jobChannel\n */\nexport function workerPool<T, R>(\n  jobs: Channel<T>,\n  worker: (job: T) => Promise<R>,\n  options: { workers: number; bufferSize?: number } = { workers: 1 }\n): Channel<R> {\n  const results = new Channel<R>(options.bufferSize || 0);\n  const { workers: workerCount } = options;\n\n  const workers = Array.from({ length: workerCount }, async () => {\n    for await (const job of jobs) {\n      try {\n        const result = await worker(job);\n        await results.send(result);\n      } catch (error) {\n        console.error(\"Worker error:\", error);\n      }\n    }\n  });\n\n  Promise.all(workers).then(() => results.close());\n\n  return results;\n}\n","/**\n * asSettled - The results of running promises, in the order that they settle.\n *\n * @example\n * const pages = urls.map((url) => fetch(url));\n * for await (const result of asSettled(pages)) {\n *   if (result.status === \"fulfilled\") show(result.index, result.value);\n *   else report(result.index, result.reason);\n * }\n */\n\n/** One result of `asSettled`: the index of its promise in the input, and how the promise settled. */\nexport type Settled<T> = { readonly index: number } & PromiseSettledResult<T>;\n\n/**\n * This function gives the result of each promise when it settles, in settle order, not in input\n * order. The promises run already: this function starts nothing. Each result has the index of its\n * promise in the input. A rejected promise gives `status: \"rejected\"` and its reason: the\n * generator does not throw it. When the consumer stops early, the other promises continue, and\n * their rejections are not reported as unhandled.\n */\nexport async function* asSettled<T>(promises: Iterable<Promise<T>>): AsyncGenerator<Settled<T>, void, undefined> {\n  const pending = new Map<number, Promise<Settled<T>>>();\n  let next = 0;\n  for (const promise of promises) {\n    const index = next;\n    next += 1;\n    pending.set(\n      index,\n      Promise.resolve(promise).then(\n        (value): Settled<T> => ({ index, status: \"fulfilled\", value }),\n        (reason: unknown): Settled<T> => ({ index, status: \"rejected\", reason })\n      )\n    );\n  }\n  while (pending.size > 0) {\n    const settled = await Promise.race(pending.values());\n    pending.delete(settled.index);\n    yield settled;\n  }\n}\n","/**\n * Functional operations for iterables (lazy sync transforms).\n *\n * This module gives Stream-like operations with lazy evaluation.\n * All operations return generators for composability.\n *\n * @example\n * const result = pipe(\n *   [1, 2, 3, 4, 5],\n *   map(x => x * 2),\n *   filter(x => x > 5),\n *   take(2),\n *   toArray\n * ) // [6, 8]\n */\n\n// ============================================================================\n// Mapping and transformation\n// ============================================================================\n\n/**\n * This function maps each element through a function.\n *\n * @example\n * const doubled = map([1, 2, 3], x => x * 2) // [2, 4, 6]\n */\nexport function* map<T, U>(\n  iterable: Iterable<T>,\n  fn: (value: T, index: number) => U\n): Generator<U> {\n  let index = 0;\n  for (const value of iterable) {\n    yield fn(value, index++);\n  }\n}\n\n/**\n * This function filters elements based on a predicate.\n */\nexport function* filter<T>(\n  iterable: Iterable<T>,\n  predicate: (value: T, index: number) => boolean\n): Generator<T> {\n  let index = 0;\n  for (const value of iterable) {\n    if (predicate(value, index++)) {\n      yield value;\n    }\n  }\n}\n\n/**\n * This function flatMaps each element to an iterable and flattens.\n */\nexport function* flatMap<T, U>(\n  iterable: Iterable<T>,\n  fn: (value: T, index: number) => Iterable<U>\n): Generator<U> {\n  let index = 0;\n  for (const value of iterable) {\n    yield* fn(value, index++);\n  }\n}\n\n/**\n * This function flattens a nested iterable.\n */\nexport function* flatten<T>(iterable: Iterable<Iterable<T>>): Generator<T> {\n  for (const inner of iterable) {\n    yield* inner;\n  }\n}\n\n// ============================================================================\n// Limiting and skipping\n// ============================================================================\n\n/**\n * This function takes the first n elements.\n */\nexport function* take<T>(iterable: Iterable<T>, n: number): Generator<T> {\n  let count = 0;\n  for (const value of iterable) {\n    if (count++ >= n) break;\n    yield value;\n  }\n}\n\n/**\n * This function skips the first n elements.\n */\nexport function* skip<T>(iterable: Iterable<T>, n: number): Generator<T> {\n  let count = 0;\n  for (const value of iterable) {\n    if (count++ >= n) {\n      yield value;\n    }\n  }\n}\n\n/**\n * This function takes elements while predicate is true.\n */\nexport function* takeWhile<T>(\n  iterable: Iterable<T>,\n  predicate: (value: T) => boolean\n): Generator<T> {\n  for (const value of iterable) {\n    if (!predicate(value)) break;\n    yield value;\n  }\n}\n\n/**\n * This function skips elements while predicate is true.\n */\nexport function* skipWhile<T>(\n  iterable: Iterable<T>,\n  predicate: (value: T) => boolean\n): Generator<T> {\n  let skipping = true;\n  for (const value of iterable) {\n    if (skipping && predicate(value)) continue;\n    skipping = false;\n    yield value;\n  }\n}\n\n// ============================================================================\n// Combining\n// ============================================================================\n\n/**\n * Concatenates multiple iterables.\n */\nexport function* concat<T>(...iterables: Iterable<T>[]): Generator<T> {\n  for (const iterable of iterables) {\n    yield* iterable;\n  }\n}\n\n/**\n * Zips multiple iterables together.\n */\nexport function* zip<T extends any[]>(\n  ...iterables: { [K in keyof T]: Iterable<T[K]> }\n): Generator<T> {\n  const iterators = iterables.map((it) => it[Symbol.iterator]());\n\n  while (true) {\n    const results = iterators.map((it) => it.next());\n    if (results.some((r) => r.done)) break;\n    yield results.map((r) => r.value) as T;\n  }\n}\n\n/**\n * Zips with index.\n */\nexport function* enumerate<T>(iterable: Iterable<T>): Generator<[number, T]> {\n  let index = 0;\n  for (const value of iterable) {\n    yield [index++, value];\n  }\n}\n\n// ============================================================================\n// Partitioning\n// ============================================================================\n\n/**\n * Chunks elements into arrays of specified size.\n */\nexport function* chunk<T>(iterable: Iterable<T>, size: number): Generator<T[]> {\n  let chunk: T[] = [];\n  for (const value of iterable) {\n    chunk.push(value);\n    if (chunk.length === size) {\n      yield chunk;\n      chunk = [];\n    }\n  }\n  if (chunk.length > 0) {\n    yield chunk;\n  }\n}\n\n/**\n * This function makes a sliding window of specified size.\n */\nexport function* window<T>(iterable: Iterable<T>, size: number): Generator<T[]> {\n  const window: T[] = [];\n  for (const value of iterable) {\n    window.push(value);\n    if (window.length > size) {\n      window.shift();\n    }\n    if (window.length === size) {\n      yield [...window];\n    }\n  }\n}\n\n/**\n * Partitions elements into two arrays based on predicate.\n */\nexport function partition<T>(\n  iterable: Iterable<T>,\n  predicate: (value: T) => boolean\n): [T[], T[]] {\n  const truthy: T[] = [];\n  const falsy: T[] = [];\n\n  for (const value of iterable) {\n    if (predicate(value)) {\n      truthy.push(value);\n    } else {\n      falsy.push(value);\n    }\n  }\n\n  return [truthy, falsy];\n}\n\n// ============================================================================\n// Reducing and folding\n// ============================================================================\n\n/**\n * This function reduces iterable to a single value.\n */\nexport function reduce<T, U>(\n  iterable: Iterable<T>,\n  fn: (acc: U, value: T, index: number) => U,\n  initial: U\n): U {\n  let acc = initial;\n  let index = 0;\n  for (const value of iterable) {\n    acc = fn(acc, value, index++);\n  }\n  return acc;\n}\n\n/**\n * Scans (like reduce but emits intermediate results).\n */\nexport function* scan<T, U>(\n  iterable: Iterable<T>,\n  fn: (acc: U, value: T) => U,\n  initial: U\n): Generator<U> {\n  let acc = initial;\n  yield acc;\n  for (const value of iterable) {\n    acc = fn(acc, value);\n    yield acc;\n  }\n}\n\n// ============================================================================\n// Sorting and ordering\n// ============================================================================\n\n/**\n * This function sorts elements (materializes the iterable).\n */\nexport function* sort<T>(\n  iterable: Iterable<T>,\n  compare?: (a: T, b: T) => number\n): Generator<T> {\n  const array = Array.from(iterable);\n  array.sort(compare);\n  yield* array;\n}\n\n/**\n * Reverses elements (materializes the iterable).\n */\nexport function* reverse<T>(iterable: Iterable<T>): Generator<T> {\n  const array = Array.from(iterable);\n  array.reverse();\n  yield* array;\n}\n\n// ============================================================================\n// Distinct and uniqueness\n// ============================================================================\n\n/**\n * This function removes duplicate elements (by reference or key function).\n */\nexport function* distinct<T, K = T>(\n  iterable: Iterable<T>,\n  keyFn?: (value: T) => K\n): Generator<T> {\n  const seen = new Set<K>();\n  for (const value of iterable) {\n    const key = (keyFn ? keyFn(value) : value) as K;\n    if (!seen.has(key)) {\n      seen.add(key);\n      yield value;\n    }\n  }\n}\n\n/**\n * This function removes consecutive duplicates.\n */\nexport function* distinctConsecutive<T, K = T>(\n  iterable: Iterable<T>,\n  keyFn?: (value: T) => K\n): Generator<T> {\n  let lastKey: K | undefined;\n  let first = true;\n\n  for (const value of iterable) {\n    const key = (keyFn ? keyFn(value) : value) as K;\n    if (first || key !== lastKey) {\n      yield value;\n      lastKey = key;\n      first = false;\n    }\n  }\n}\n\n// ============================================================================\n// Peeking and side effects\n// ============================================================================\n\n/**\n * This function does a side effect for each element. The stream does not change.\n */\nexport function* tap<T>(\n  iterable: Iterable<T>,\n  fn: (value: T, index: number) => void\n): Generator<T> {\n  let index = 0;\n  for (const value of iterable) {\n    fn(value, index++);\n    yield value;\n  }\n}\n\n// ============================================================================\n// Predicates and checks\n// ============================================================================\n\n/**\n * This function gives true if any element matches the predicate.\n */\nexport function some<T>(\n  iterable: Iterable<T>,\n  predicate: (value: T) => boolean\n): boolean {\n  for (const value of iterable) {\n    if (predicate(value)) return true;\n  }\n  return false;\n}\n\n/**\n * This function gives true if all elements match the predicate.\n */\nexport function every<T>(\n  iterable: Iterable<T>,\n  predicate: (value: T) => boolean\n): boolean {\n  for (const value of iterable) {\n    if (!predicate(value)) return false;\n  }\n  return true;\n}\n\n/**\n * This function gives true if no elements match the predicate.\n */\nexport function none<T>(\n  iterable: Iterable<T>,\n  predicate: (value: T) => boolean\n): boolean {\n  return !some(iterable, predicate);\n}\n\n/**\n * This function finds the first element matching the predicate.\n */\nexport function find<T>(\n  iterable: Iterable<T>,\n  predicate: (value: T) => boolean\n): T | undefined {\n  for (const value of iterable) {\n    if (predicate(value)) return value;\n  }\n  return undefined;\n}\n\n/**\n * This function counts elements (optionally matching a predicate).\n */\nexport function count<T>(\n  iterable: Iterable<T>,\n  predicate?: (value: T) => boolean\n): number {\n  let count = 0;\n  for (const value of iterable) {\n    if (!predicate || predicate(value)) {\n      count++;\n    }\n  }\n  return count;\n}\n\n// ============================================================================\n// Min/Max\n// ============================================================================\n\n/**\n * This function gives the minimum element.\n */\nexport function min<T>(\n  iterable: Iterable<T>,\n  compare?: (a: T, b: T) => number\n): T | undefined {\n  const cmp = compare || ((a: any, b: any) => a - b);\n  let minValue: T | undefined;\n\n  for (const value of iterable) {\n    if (minValue === undefined || cmp(value, minValue) < 0) {\n      minValue = value;\n    }\n  }\n\n  return minValue;\n}\n\n/**\n * This function gives the maximum element.\n */\nexport function max<T>(\n  iterable: Iterable<T>,\n  compare?: (a: T, b: T) => number\n): T | undefined {\n  const cmp = compare || ((a: any, b: any) => a - b);\n  let maxValue: T | undefined;\n\n  for (const value of iterable) {\n    if (maxValue === undefined || cmp(value, maxValue) > 0) {\n      maxValue = value;\n    }\n  }\n\n  return maxValue;\n}\n\n/**\n * This function gives the sum of elements.\n */\nexport function sum(iterable: Iterable<number>): number {\n  let total = 0;\n  for (const value of iterable) {\n    total += value;\n  }\n  return total;\n}\n\n/**\n * This function gives the average of elements.\n */\nexport function average(iterable: Iterable<number>): number | undefined {\n  let total = 0;\n  let count = 0;\n\n  for (const value of iterable) {\n    total += value;\n    count++;\n  }\n\n  return count === 0 ? undefined : total / count;\n}\n\n// ============================================================================\n// Terminal operations (materialization)\n// ============================================================================\n\n/**\n * This function collects elements into an array.\n */\nexport function toArray<T>(iterable: Iterable<T>): T[] {\n  return Array.from(iterable);\n}\n\n/**\n * This function collects elements into a Set.\n */\nexport function toSet<T>(iterable: Iterable<T>): Set<T> {\n  return new Set(iterable);\n}\n\n/**\n * This function collects elements into a Map.\n */\nexport function toMap<T, K, V>(\n  iterable: Iterable<T>,\n  keyFn: (value: T) => K,\n  valueFn: (value: T) => V\n): Map<K, V> {\n  const map = new Map<K, V>();\n  for (const value of iterable) {\n    map.set(keyFn(value), valueFn(value));\n  }\n  return map;\n}\n\n// ============================================================================\n// Pipe utility for composition\n// ============================================================================\n\n/**\n * This function pipes a value through a series of transformations.\n *\n * @example\n * const result = pipe(\n *   [1, 2, 3, 4, 5],\n *   (it) => map(it, x => x * 2),\n *   (it) => filter(it, x => x > 5),\n *   (it) => take(it, 2),\n *   toArray\n * ) // [6, 8]\n */\nexport function pipe<T>(\n  value: T,\n  ...fns: Array<(value: any) => any>\n): any {\n  return fns.reduce((acc, fn) => fn(acc), value);\n}\n","/**\n * Collectors for Stream-style collection operations.\n *\n * This module gives Java Stream API-style collectors for transforming iterables\n * into various collection types. The model is java.util.stream.Collectors.\n *\n * @example\n * import { collect, toList, groupingBy } from './collectors'\n *\n * const grouped = collect(users, groupingBy(u => u.age))\n */\n\nimport { arrayList, type ArrayList } from \"../impl/array-list.js\";\nimport { hashMap, type HashMap } from \"../impl/hash-map.js\";\nimport { hashSet, type HashSet } from \"../impl/hash-set.js\";\n\n// ============================================================================\n// Collector interface\n// ============================================================================\n\n/**\n * A Collector represents a mutable reduction operation.\n *\n * @template T - The type of input elements\n * @template A - The mutable accumulation type\n * @template R - The final result type\n */\nexport interface Collector<T, A, R> {\n  /**\n   * This value makes the initial accumulator.\n   */\n  supplier: () => A;\n\n  /**\n   * This value incorporates an element into the accumulator and gives the next accumulator. A mutable\n   * accumulator (a list, a map) gives itself. An immutable one (a count, a sum) gives the\n   * new value. (Before, the result was ignored, so every immutable collector - counting,\n   * summing, minBy, maxBy, reducing, first, last - given its seed: BUGS-2026-07 C12.)\n   */\n  accumulator: (acc: A, element: T) => A;\n\n  /**\n   * This value combines two accumulators (for parallel streams).\n   */\n  combiner?: (acc1: A, acc2: A) => A;\n\n  /**\n   * This value transforms the accumulator into the final result.\n   */\n  finisher: (acc: A) => R;\n}\n\n/**\n * This function collects elements using a collector.\n *\n * @example\n * const list = collect([1, 2, 3], toList())\n * const set = collect([1, 2, 2, 3], toSet())\n */\nexport function collect<T, A, R>(\n  iterable: Iterable<T>,\n  collector: Collector<T, A, R>\n): R {\n  let acc = collector.supplier();\n  for (const element of iterable) {\n    acc = collector.accumulator(acc, element);\n  }\n  return collector.finisher(acc);\n}\n\n// ============================================================================\n// Basic collectors\n// ============================================================================\n\n/**\n * This function collects elements into an ArrayList.\n */\nexport function toList<T>(): Collector<T, ArrayList<T>, ArrayList<T>> {\n  return {\n    supplier: () => arrayList<T>(),\n    accumulator: (list, element) => (list.add(element), list),\n    finisher: (list) => list,\n  };\n}\n\n/**\n * This function collects elements into a HashSet.\n */\nexport function toSet<T>(): Collector<T, HashSet<T>, HashSet<T>> {\n  return {\n    supplier: () => hashSet<T>(),\n    accumulator: (set, element) => (set.add(element), set),\n    finisher: (set) => set,\n  };\n}\n\n/**\n * This function collects elements into a native Array.\n */\nexport function toArray<T>(): Collector<T, T[], T[]> {\n  return {\n    supplier: () => [],\n    accumulator: (arr, element) => (arr.push(element), arr),\n    finisher: (arr) => arr,\n  };\n}\n\n/**\n * This function collects elements into a HashMap using key and value extractors.\n */\nexport function toMap<T, K, V>(\n  keyExtractor: (element: T) => K,\n  valueExtractor: (element: T) => V\n): Collector<T, HashMap<K, V>, HashMap<K, V>> {\n  return {\n    supplier: () => hashMap<K, V>(),\n    accumulator: (map, element) => {\n      map.set(keyExtractor(element), valueExtractor(element));\n      return map;\n    },\n    finisher: (map) => map,\n  };\n}\n\n// ============================================================================\n// Grouping collectors\n// ============================================================================\n\n/**\n * This function groups elements by a classifier function.\n *\n * @example\n * const byAge = collect(users, groupingBy(u => u.age))\n * // Map<number, ArrayList<User>>\n */\nexport function groupingBy<T, K>(\n  classifier: (element: T) => K\n): Collector<T, HashMap<K, ArrayList<T>>, HashMap<K, ArrayList<T>>> {\n  return {\n    supplier: () => hashMap<K, ArrayList<T>>(),\n    accumulator: (map, element) => {\n      const key = classifier(element);\n      const list = map.computeIfAbsent(key, () => arrayList<T>());\n      list.add(element);\n      return map;\n    },\n    finisher: (map) => map,\n  };\n}\n\n/**\n * Groups and transforms with a downstream collector.\n *\n * @example\n * const countByAge = collect(\n *   users,\n *   groupingBy(u => u.age, counting())\n * )\n * // Map<number, number>\n */\nexport function groupingByWith<T, K, A, D>(\n  classifier: (element: T) => K,\n  downstream: Collector<T, A, D>\n): Collector<T, HashMap<K, A>, HashMap<K, D>> {\n  return {\n    supplier: () => hashMap<K, A>(),\n    accumulator: (map, element) => {\n      const key = classifier(element);\n      const acc = map.has(key) ? map.get(key) : downstream.supplier();\n      map.set(key, downstream.accumulator(acc, element));\n      return map;\n    },\n    finisher: (map) => {\n      const result = hashMap<K, D>();\n      for (const entry of map.entries()) {\n        result.set(entry.key, downstream.finisher(entry.value));\n      }\n      return result;\n    },\n  };\n}\n\n/**\n * Partitions elements into two groups based on a predicate.\n *\n * @example\n * const partitioned = collect(\n *   numbers,\n *   partitioningBy(n => n % 2 === 0)\n * )\n * // Map<boolean, ArrayList<number>>\n */\nexport function partitioningBy<T>(\n  predicate: (element: T) => boolean\n): Collector<T, HashMap<boolean, ArrayList<T>>, HashMap<boolean, ArrayList<T>>> {\n  return groupingBy((element) => predicate(element));\n}\n\n// ============================================================================\n// Aggregation collectors\n// ============================================================================\n\n/**\n * This function counts the number of elements.\n */\nexport function counting<T>(): Collector<T, number, number> {\n  return {\n    supplier: () => 0,\n    accumulator: (count) => count + 1,\n    finisher: (count) => count,\n  };\n}\n\n/**\n * Sums numeric elements.\n */\nexport function summingNumber<T>(\n  mapper: (element: T) => number\n): Collector<T, number, number> {\n  return {\n    supplier: () => 0,\n    accumulator: (sum, element) => sum + mapper(element),\n    finisher: (sum) => sum,\n  };\n}\n\n/**\n * Averages numeric elements.\n */\nexport function averagingNumber<T>(\n  mapper: (element: T) => number\n): Collector<T, { sum: number; count: number }, number> {\n  return {\n    supplier: () => ({ sum: 0, count: 0 }),\n    accumulator: (acc, element) => {\n      acc.sum += mapper(element);\n      acc.count++;\n      return acc;\n    },\n    finisher: (acc) => (acc.count === 0 ? 0 : acc.sum / acc.count),\n  };\n}\n\n/**\n * This function finds the minimum element.\n */\nexport function minBy<T>(\n  comparator: (a: T, b: T) => number\n): Collector<T, T | undefined, T | undefined> {\n  return {\n    supplier: () => undefined,\n    accumulator: (min, element) => {\n      if (min === undefined || comparator(element, min) < 0) {\n        return element;\n      }\n      return min;\n    },\n    finisher: (min) => min,\n  };\n}\n\n/**\n * This function finds the maximum element.\n */\nexport function maxBy<T>(\n  comparator: (a: T, b: T) => number\n): Collector<T, T | undefined, T | undefined> {\n  return {\n    supplier: () => undefined,\n    accumulator: (max, element) => {\n      if (max === undefined || comparator(element, max) > 0) {\n        return element;\n      }\n      return max;\n    },\n    finisher: (max) => max,\n  };\n}\n\n// ============================================================================\n// String collectors\n// ============================================================================\n\n/**\n * Joins elements into a string.\n *\n * @example\n * const csv = collect(['a', 'b', 'c'], joining(', '))\n * // \"a, b, c\"\n *\n * const bracketed = collect(\n *   ['a', 'b', 'c'],\n *   joining(', ', '[', ']')\n * )\n * // \"[a, b, c]\"\n */\nexport function joining<T>(\n  delimiter: string = \"\",\n  prefix: string = \"\",\n  suffix: string = \"\"\n): Collector<T, string[], string> {\n  return {\n    supplier: () => [],\n    accumulator: (parts, element) => (parts.push(String(element)), parts),\n    finisher: (parts) => prefix + parts.join(delimiter) + suffix,\n  };\n}\n\n// ============================================================================\n// Mapping collectors\n// ============================================================================\n\n/**\n * This function applies a mapping function before collecting.\n *\n * @example\n * const names = collect(\n *   users,\n *   mapping(u => u.name, toList())\n * )\n */\nexport function mapping<T, U, A, R>(\n  mapper: (element: T) => U,\n  downstream: Collector<U, A, R>\n): Collector<T, A, R> {\n  return {\n    supplier: downstream.supplier,\n    accumulator: (acc, element) => downstream.accumulator(acc, mapper(element)),\n    finisher: downstream.finisher,\n  };\n}\n\n/**\n * This function filters elements before collecting.\n */\nexport function filtering<T, A, R>(\n  predicate: (element: T) => boolean,\n  downstream: Collector<T, A, R>\n): Collector<T, A, R> {\n  return {\n    supplier: downstream.supplier,\n    accumulator: (acc, element) => {\n      return predicate(element) ? downstream.accumulator(acc, element) : acc;\n    },\n    finisher: downstream.finisher,\n  };\n}\n\n/**\n * FlatMaps elements before collecting.\n */\nexport function flatMapping<T, U, A, R>(\n  mapper: (element: T) => Iterable<U>,\n  downstream: Collector<U, A, R>\n): Collector<T, A, R> {\n  return {\n    supplier: downstream.supplier,\n    accumulator: (acc, element) => {\n      for (const mapped of mapper(element)) {\n        acc = downstream.accumulator(acc, mapped);\n      }\n      return acc;\n    },\n    finisher: downstream.finisher,\n  };\n}\n\n// ============================================================================\n// Reducing collectors\n// ============================================================================\n\n/**\n * General reduction collector.\n */\nexport function reducing<T>(\n  identity: T,\n  reducer: (acc: T, element: T) => T\n): Collector<T, T, T> {\n  return {\n    supplier: () => identity,\n    accumulator: (acc, element) => reducer(acc, element),\n    finisher: (acc) => acc,\n  };\n}\n\n/**\n * Reducing with mapper.\n */\nexport function reducingWith<T, U>(\n  identity: U,\n  mapper: (element: T) => U,\n  reducer: (acc: U, mapped: U) => U\n): Collector<T, U, U> {\n  return {\n    supplier: () => identity,\n    accumulator: (acc, element) => reducer(acc, mapper(element)),\n    finisher: (acc) => acc,\n  };\n}\n\n// ============================================================================\n// Composite collectors\n// ============================================================================\n\n/**\n * This function collects with two collectors and combines results.\n *\n * @example\n * const stats = collect(\n *   numbers,\n *   teeing(\n *     summingNumber(n => n),\n *     counting(),\n *     (sum, count) => ({ sum, count, avg: sum / count })\n *   )\n * )\n */\nexport function teeing<T, A1, A2, R1, R2, R>(\n  collector1: Collector<T, A1, R1>,\n  collector2: Collector<T, A2, R2>,\n  combiner: (r1: R1, r2: R2) => R\n): Collector<T, [A1, A2], R> {\n  return {\n    supplier: () => [collector1.supplier(), collector2.supplier()] as [A1, A2],\n    accumulator: ([acc1, acc2], element) => [\n      collector1.accumulator(acc1, element),\n      collector2.accumulator(acc2, element),\n    ],\n    finisher: ([acc1, acc2]) => {\n      return combiner(collector1.finisher(acc1), collector2.finisher(acc2));\n    },\n  };\n}\n\n// ============================================================================\n// Utility collectors\n// ============================================================================\n\n/**\n * This function collects the first element.\n */\nexport function first<T>(): Collector<T, T | undefined, T | undefined> {\n  return {\n    supplier: () => undefined,\n    accumulator: (first, element) => (first === undefined ? element : first),\n    finisher: (first) => first,\n  };\n}\n\n/**\n * This function collects the last element.\n */\nexport function last<T>(): Collector<T, T | undefined, T | undefined> {\n  return {\n    supplier: () => undefined,\n    accumulator: (_last, element) => element,\n    finisher: (last) => last,\n  };\n}\n\n/**\n * This type makes summary statistics.\n */\nexport interface SummaryStatistics {\n  count: number;\n  sum: number;\n  min: number;\n  max: number;\n  average: number;\n}\n\nexport function summarizingNumber<T>(\n  mapper: (element: T) => number\n): Collector<T, Partial<SummaryStatistics>, SummaryStatistics> {\n  return {\n    supplier: () => ({\n      count: 0,\n      sum: 0,\n      min: Infinity,\n      max: -Infinity,\n    }),\n    accumulator: (stats, element) => {\n      const value = mapper(element);\n      // The supplier sets every field. (Before, `stats.min || Infinity` treated a minimum of 0\n      // as missing: BUGS-2026-07 L16.)\n      stats.count = stats.count! + 1;\n      stats.sum = stats.sum! + value;\n      stats.min = Math.min(stats.min!, value);\n      stats.max = Math.max(stats.max!, value);\n      return stats;\n    },\n    finisher: (stats) => ({\n      count: stats.count!,\n      sum: stats.sum!,\n      min: stats.min!,\n      max: stats.max!,\n      average: stats.count! === 0 ? 0 : stats.sum! / stats.count!,\n    }),\n  };\n}\n","/**\n * Factory utilities for making collections.\n *\n * This module gives convenient factory methods similar to Java's Collections class.\n * These functions mirror Java methods like Collections.emptyList() and singletonList().\n */\n\nimport { arrayList, ArrayList } from \"../impl/array-list.js\";\nimport { arrayDeque, ArrayDeque } from \"../impl/array-deque.js\";\nimport { hashMap, HashMap } from \"../impl/hash-map.js\";\nimport type { List } from \"../interfaces/list.js\";\nimport type { Queue } from \"../interfaces/queue.js\";\nimport type { MapLike } from \"../interfaces/map.js\";\nimport { readonly } from \"../behaviors/readonly.js\";\nimport { compose } from \"../core/middleware.js\";\n\n// ============================================================================\n// Empty collections\n// ============================================================================\n\n/**\n * This value is an empty, immutable list.\n * Multiple calls return the same instance (singleton pattern).\n *\n * @example\n * const list = emptyList<number>()\n * list.size // 0\n * list.add(1) // Error: Cannot modify readonly collection\n */\nconst EMPTY_LIST_CACHE = new Map<any, any>();\n\nexport function emptyList<T>(): List<T> {\n  const key = \"list\";\n  if (!EMPTY_LIST_CACHE.has(key)) {\n    const list = compose(readonly<List<T>>())(arrayList<T>());\n    EMPTY_LIST_CACHE.set(key, list);\n  }\n  return EMPTY_LIST_CACHE.get(key);\n}\n\n/**\n * This value is an empty, immutable queue.\n */\nconst EMPTY_QUEUE_CACHE = new Map<any, any>();\n\nexport function emptyQueue<T>(): Queue<T> {\n  const key = \"queue\";\n  if (!EMPTY_QUEUE_CACHE.has(key)) {\n    const queue = compose(readonly<Queue<T>>())(arrayDeque<T>() as Queue<T>);\n    EMPTY_QUEUE_CACHE.set(key, queue);\n  }\n  return EMPTY_QUEUE_CACHE.get(key);\n}\n\n/**\n * This value is an empty, immutable map.\n */\nconst EMPTY_MAP_CACHE = new Map<any, any>();\n\nexport function emptyMap<K, V>(): MapLike<K, V> {\n  const key = \"map\";\n  if (!EMPTY_MAP_CACHE.has(key)) {\n    const map = compose(readonly<MapLike<K, V>>())(hashMap<K, V>());\n    EMPTY_MAP_CACHE.set(key, map);\n  }\n  return EMPTY_MAP_CACHE.get(key);\n}\n\n// ============================================================================\n// Singleton collections (single element)\n// ============================================================================\n\n/**\n * This function gives an immutable list containing only the specified element.\n *\n * @example\n * const list = singletonList(42)\n * list.size // 1\n * list.get(0) // 42\n * list.add(2) // Error: Cannot modify readonly collection\n */\nexport function singletonList<T>(element: T): List<T> {\n  const list = arrayList<T>();\n  list.add(element);\n  return compose(readonly<List<T>>())(list);\n}\n\n/**\n * This function gives an immutable map containing only the specified key-value mapping.\n */\nexport function singletonMap<K, V>(key: K, value: V): MapLike<K, V> {\n  const map = hashMap<K, V>();\n  map.set(key, value);\n  return compose(readonly<MapLike<K, V>>())(map);\n}\n\n// ============================================================================\n// N-copies collections\n// ============================================================================\n\n/**\n * This function gives an immutable list consisting of n copies of the specified element.\n *\n * @example\n * const list = nCopies(5, 'hello')\n * list.size // 5\n * list.get(2) // 'hello'\n */\nexport function nCopies<T>(n: number, element: T): List<T> {\n  if (n < 0) {\n    throw new Error(`n must be non-negative, got ${n}`);\n  }\n\n  const list = arrayList<T>();\n  for (let i = 0; i < n; i++) {\n    list.add(element);\n  }\n  return compose(readonly<List<T>>())(list);\n}\n\n// ============================================================================\n// Collection creation from iterables\n// ============================================================================\n\n/**\n * This function makes a new ArrayList from the given elements.\n *\n * @example\n * const list = listOf(1, 2, 3, 4, 5)\n */\nexport function listOf<T>(...elements: T[]): ArrayList<T> {\n  return arrayList(elements);\n}\n\n/**\n * This function makes a new ArrayDeque from the given elements.\n */\nexport function queueOf<T>(...elements: T[]): ArrayDeque<T> {\n  return arrayDeque(elements);\n}\n\n/**\n * This function makes a new HashMap from the given key-value pairs.\n *\n * @example\n * const map = mapOf(['a', 1], ['b', 2], ['c', 3])\n */\nexport function mapOf<K, V>(...entries: [K, V][]): HashMap<K, V> {\n  return hashMap(entries);\n}\n\n// ============================================================================\n// Mutable collection factories\n// ============================================================================\n\n/**\n * This function makes a new mutable ArrayList with optional initial elements.\n *\n * @example\n * const list = mutableListOf(1, 2, 3)\n * list.add(4)\n */\nexport function mutableListOf<T>(...elements: T[]): ArrayList<T> {\n  return arrayList(elements);\n}\n\n/**\n * This function makes a new mutable HashMap with optional initial entries.\n */\nexport function mutableMapOf<K, V>(...entries: [K, V][]): HashMap<K, V> {\n  return hashMap(entries);\n}\n\n// ============================================================================\n// Immutable collection factories\n// ============================================================================\n\n/**\n * This function makes an immutable List from the given elements.\n *\n * @example\n * const list = immutableListOf(1, 2, 3)\n * list.get(0) // 1\n * list.add(4) // Error: Cannot modify readonly collection\n */\nexport function immutableListOf<T>(...elements: T[]): List<T> {\n  if (elements.length === 0) {\n    return emptyList<T>();\n  }\n  if (elements.length === 1) {\n    return singletonList(elements[0]! as T);\n  }\n  const list = arrayList(elements);\n  return compose(readonly<List<T>>())(list);\n}\n\n/**\n * This function makes an immutable Map from the given entries.\n */\nexport function immutableMapOf<K, V>(...entries: [K, V][]): MapLike<K, V> {\n  if (entries.length === 0) {\n    return emptyMap<K, V>();\n  }\n  if (entries.length === 1) {\n    return singletonMap(entries[0]![0], entries[0]![1]);\n  }\n  const map = hashMap(entries);\n  return compose(readonly<MapLike<K, V>>())(map);\n}\n\n// ============================================================================\n// Range factories\n// ============================================================================\n\n/**\n * This function makes a list containing integers from start (inclusive) to end (exclusive).\n *\n * @example\n * const list = range(0, 5) // [0, 1, 2, 3, 4]\n * const list2 = range(10, 15) // [10, 11, 12, 13, 14]\n */\nexport function range(start: number, end: number, step: number = 1): ArrayList<number> {\n  if (step === 0) {\n    throw new Error(\"step cannot be zero\");\n  }\n\n  const list = arrayList<number>();\n\n  if (step > 0) {\n    for (let i = start; i < end; i += step) {\n      list.add(i);\n    }\n  } else {\n    for (let i = start; i > end; i += step) {\n      list.add(i);\n    }\n  }\n\n  return list;\n}\n\n/**\n * This function makes a list containing integers from 0 to n (exclusive).\n *\n * @example\n * const list = rangeTo(5) // [0, 1, 2, 3, 4]\n */\nexport function rangeTo(n: number): ArrayList<number> {\n  return range(0, n);\n}\n\n// ============================================================================\n// Collection builders\n// ============================================================================\n\n/**\n * Builder for constructing lists with a fluent API.\n *\n * @example\n * const list = buildList<number>((builder) => {\n *   builder.add(1)\n *   builder.add(2)\n *   if (someCondition) {\n *     builder.add(3)\n *   }\n * })\n */\nexport function buildList<T>(builder: (list: ArrayList<T>) => void): ArrayList<T> {\n  const list = arrayList<T>();\n  builder(list);\n  return list;\n}\n\n/**\n * Builder for constructing maps with a fluent API.\n */\nexport function buildMap<K, V>(builder: (map: HashMap<K, V>) => void): HashMap<K, V> {\n  const map = hashMap<K, V>();\n  builder(map);\n  return map;\n}\n\n// ============================================================================\n// Conversion utilities\n// ============================================================================\n\n/**\n * This function converts an iterable to an ArrayList.\n *\n * @example\n * const set = new Set([1, 2, 3])\n * const list = toList(set)\n */\nexport function toList<T>(iterable: Iterable<T>): ArrayList<T> {\n  return arrayList(iterable);\n}\n\n/**\n * This function converts an iterable to a HashMap using a key extractor function.\n *\n * @example\n * const users = [{ id: 1, name: 'Alice' }, { id: 2, name: 'Bob' }]\n * const userMap = toMap(users, u => u.id)\n */\nexport function toMap<T, K>(\n  iterable: Iterable<T>,\n  keyExtractor: (value: T) => K\n): HashMap<K, T>;\nexport function toMap<T, K, V>(\n  iterable: Iterable<T>,\n  keyExtractor: (value: T) => K,\n  valueExtractor: (value: T) => V\n): HashMap<K, V>;\nexport function toMap<T, K, V>(\n  iterable: Iterable<T>,\n  keyExtractor: (value: T) => K,\n  valueExtractor?: (value: T) => V\n): HashMap<K, any> {\n  const map = hashMap<K, any>();\n  for (const item of iterable) {\n    const key = keyExtractor(item);\n    const value = valueExtractor ? valueExtractor(item) : item;\n    map.set(key, value);\n  }\n  return map;\n}\n\n// ============================================================================\n// Grouping utilities\n// ============================================================================\n\n/**\n * This function groups elements by a key extractor function.\n *\n * @example\n * const users = [\n *   { age: 25, name: 'Alice' },\n *   { age: 30, name: 'Bob' },\n *   { age: 25, name: 'Charlie' }\n * ]\n * const byAge = groupBy(users, u => u.age)\n * // Map { 25 => [Alice, Charlie], 30 => [Bob] }\n */\nexport function groupBy<T, K>(\n  iterable: Iterable<T>,\n  keyExtractor: (value: T) => K\n): HashMap<K, ArrayList<T>> {\n  const map = hashMap<K, ArrayList<T>>();\n\n  for (const item of iterable) {\n    const key = keyExtractor(item);\n    const list = map.computeIfAbsent(key, () => arrayList<T>());\n    list.add(item);\n  }\n\n  return map;\n}\n","/**\n * Common helper utilities for collections.\n *\n * This module gives shared functionality to reduce code duplication across implementations.\n */\n\nimport type { Eq } from \"../core/traits.js\";\n\n// ============================================================================\n// Bounds checking utilities\n// ============================================================================\n\n/**\n * Checks if an index is within valid bounds [0, size).\n * This function throws RangeError if out of bounds.\n *\n * @param index The index to check\n * @param size The size of the collection\n * @param collectionName Optional name for error message\n * @throws RangeError if index is out of bounds\n */\nexport function checkBounds(index: number, size: number, collectionName: string = \"Collection\"): void {\n  if (index < 0 || index >= size) {\n    throw new RangeError(`${collectionName}: Index ${index} out of bounds [0, ${size})`);\n  }\n}\n\n/**\n * Checks if an index is valid for insertion [0, size].\n * In this function, index === size is correct for append operations.\n *\n * @param index The index to check\n * @param size The size of the collection\n * @param collectionName Optional name for error message\n * @throws RangeError if index is out of bounds\n */\nexport function checkInsertBounds(index: number, size: number, collectionName: string = \"Collection\"): void {\n  if (index < 0 || index > size) {\n    throw new RangeError(`${collectionName}: Index ${index} out of bounds [0, ${size}]`);\n  }\n}\n\n/**\n * Checks if a range [start, end) is valid.\n *\n * @param start Start index (inclusive)\n * @param end End index (exclusive)\n * @param size The size of the collection\n * @param collectionName Optional name for error message\n * @throws RangeError if range is invalid\n */\nexport function checkRangeBounds(\n  start: number,\n  end: number,\n  size: number,\n  collectionName: string = \"Collection\"\n): void {\n  if (start < 0 || end > size || start > end) {\n    throw new RangeError(\n      `${collectionName}: Invalid range [${start}, ${end}) for size ${size}`\n    );\n  }\n}\n\n// ============================================================================\n// Equality and search utilities\n// ============================================================================\n\n/**\n * This function finds the index of an element in an array using custom equality.\n *\n * @param array The array to search\n * @param element The element to find\n * @param eq Equality function\n * @returns Index of element, or -1 if not found\n */\nexport function findIndex<T>(array: T[], element: T, eq: Eq<T>): number {\n  for (let i = 0; i < array.length; i++) {\n    if (eq(array[i]!, element)) {\n      return i;\n    }\n  }\n  return -1;\n}\n\n/**\n * This function finds the last index of an element in an array using custom equality.\n *\n * @param array The array to search\n * @param element The element to find\n * @param eq Equality function\n * @returns Last index of element, or -1 if not found\n */\nexport function findLastIndex<T>(array: T[], element: T, eq: Eq<T>): number {\n  for (let i = array.length - 1; i >= 0; i--) {\n    if (eq(array[i]!, element)) {\n      return i;\n    }\n  }\n  return -1;\n}\n\n/**\n * Checks if an array contains an element using custom equality.\n *\n * @param array The array to search\n * @param element The element to find\n * @param eq Equality function\n * @returns true if element is found\n */\nexport function arrayContains<T>(array: T[], element: T, eq: Eq<T>): boolean {\n  return findIndex(array, element, eq) !== -1;\n}\n\n/**\n * This function removes the first occurrence of an element from an array.\n *\n * @param array The array to change\n * @param element The element to remove\n * @param eq Equality function\n * @returns true if element was found and removed\n */\nexport function arrayRemove<T>(array: T[], element: T, eq: Eq<T>): boolean {\n  const index = findIndex(array, element, eq);\n  if (index === -1) return false;\n  array.splice(index, 1);\n  return true;\n}\n\n/**\n * This function removes all occurrences of an element from an array.\n *\n * @param array The array to change\n * @param element The element to remove\n * @param eq Equality function\n * @returns Number of elements removed\n */\nexport function arrayRemoveAll<T>(array: T[], element: T, eq: Eq<T>): number {\n  let count = 0;\n  for (let i = array.length - 1; i >= 0; i--) {\n    if (eq(array[i]!, element)) {\n      array.splice(i, 1);\n      count++;\n    }\n  }\n  return count;\n}\n\n// ============================================================================\n// Iterator utilities\n// ============================================================================\n\n/**\n * This function makes a simple iterator for an array.\n *\n * @param array The array to iterate\n * @returns Iterator over the array\n */\nexport function* arrayIterator<T>(array: T[]): Iterator<T> {\n  yield* array;\n}\n\n/**\n * This function makes a reversed iterator for an array.\n *\n * @param array The array to iterate\n * @returns Reversed iterator over the array\n */\nexport function* reverseArrayIterator<T>(array: T[]): Iterator<T> {\n  for (let i = array.length - 1; i >= 0; i--) {\n    yield array[i]!;\n  }\n}\n\n/**\n * This function converts an iterable to an array.\n *\n * @param iterable The iterable to convert\n * @returns Array containing all elements\n */\nexport function toArray<T>(iterable: Iterable<T>): T[] {\n  return Array.from(iterable);\n}\n\n// ============================================================================\n// Validation utilities\n// ============================================================================\n\n/**\n * This function makes sure that a value is not null or undefined.\n *\n * @param value The value to check\n * @param message Error message\n * @returns The non-null value\n * @throws Error if value is null or undefined\n */\nexport function requireNonNull<T>(value: T | null | undefined, message: string = \"Value cannot be null or undefined\"): T {\n  if (value === null || value === undefined) {\n    throw new Error(message);\n  }\n  return value;\n}\n\n/**\n * This function makes sure that a collection is not empty.\n *\n * @param size Current size\n * @param collectionName Optional name for error message\n * @throws Error if collection is empty\n */\nexport function requireNonEmpty(size: number, collectionName: string = \"Collection\"): void {\n  if (size === 0) {\n    throw new Error(`${collectionName} is empty`);\n  }\n}\n\n// ============================================================================\n// Math utilities\n// ============================================================================\n\n/**\n * This function clamps a value between min and max.\n *\n * @param value The value to clamp\n * @param min Minimum value\n * @param max Maximum value\n * @returns Clamped value\n */\nexport function clamp(value: number, min: number, max: number): number {\n  return Math.max(min, Math.min(max, value));\n}\n\n/**\n * This function calculates hash code for a string.\n * This function uses Java's String.hashCode() algorithm.\n *\n * @param str The string to hash\n * @returns Hash code\n */\nexport function stringHashCode(str: string): number {\n  let hash = 0;\n  for (let i = 0; i < str.length; i++) {\n    const char = str.charCodeAt(i);\n    hash = ((hash << 5) - hash) + char;\n    hash = hash & hash; // Convert to 32-bit integer\n  }\n  return hash;\n}\n"],"mappings":";;;;;AAyCA,MAAa,OAAa,OAAO,OAAO,EAAE,MAAM,OAAO,CAAC;;;;AAKxD,MAAa,QAAW,UACtB,OAAO,OAAO;CAAE,MAAM;CAAQ;AAAM,CAAC;;;;AAKvC,MAAa,UAAa,QAAgC,IAAI,SAAS;;;;AAKvE,MAAa,UAAa,QACxB,IAAI,SAAS;;;;AAKf,MAAa,aAAgB,KAAgB,iBAC3C,OAAO,GAAG,IAAI,IAAI,QAAQ;;;;AAK5B,MAAa,UAAa,QAAsB;CAC9C,IAAI,OAAO,GAAG,GAAG,OAAO,IAAI;CAC5B,MAAM,IAAI,MAAM,uBAAuB;AACzC;;;;AAKA,MAAa,aACX,KACA,MACe,OAAO,GAAG,IAAI,KAAK,EAAE,IAAI,KAAK,CAAC,IAAI;;;;AAKpD,MAAa,iBACX,KACA,MACe,OAAO,GAAG,IAAI,EAAE,IAAI,KAAK,IAAI;;;;AAK9C,MAAa,gBAAmB,UAC9B,SAAS,OAAO,OAAO,KAAK,KAAK;;;;AAKnC,MAAa,cAAiB,QAC5B,OAAO,GAAG,IAAI,IAAI,QAAQ,KAAA;;;;AAyC5B,MAAa,MAAS,UACpB,OAAO,OAAO;CACZ,MAAM;CACN;CACA,QAAW,MACT,EAAE,GAAG,KAAK;AACd,CAAC;;;;AAKH,MAAa,OAAU,UACrB,OAAO,OAAO;CACZ,MAAM;CACN;CACA,QAAW,MACT,EAAE,IAAI,KAAK;AACf,CAAC;;;;AAKH,MAAa,QAAc,WACzB,OAAO,SAAS;;;;AAKlB,MAAa,SAAe,WAC1B,OAAO,SAAS;;;;AAKlB,MAAa,mBACX,QACA,iBACO,KAAK,MAAM,IAAI,OAAO,QAAQ;;;;AAKvC,MAAa,gBAAsB,WAA4B;CAC7D,IAAI,KAAK,MAAM,GAAG,OAAO,OAAO;CAChC,MAAM,OAAO;AACf;;;;AAKA,MAAa,aACX,QACA,MACkB,KAAK,MAAM,IAAI,GAAG,EAAE,OAAO,KAAK,CAAC,IAAI;;;;AAKzD,MAAa,YACX,QACA,MACkB,MAAM,MAAM,IAAI,IAAI,EAAE,OAAO,KAAK,CAAC,IAAI;;;;AAK3D,MAAa,iBACX,QACA,MACkB,KAAK,MAAM,IAAI,EAAE,OAAO,KAAK,IAAI;;;;AAKrD,MAAa,YACX,IACA,YACiB;CACjB,IAAI;EACF,OAAO,GAAG,GAAG,CAAC;CAChB,SAAS,OAAO;EACd,OAAO,IAAK,UAAU,QAAQ,KAAK,IAAI,KAAW;CACpD;AACF;;;;AAKA,MAAa,gBAAgB,OAC3B,IACA,YAC0B;CAC1B,IAAI;EACF,OAAO,GAAG,MAAM,GAAG,CAAC;CACtB,SAAS,OAAO;EACd,OAAO,IAAK,UAAU,QAAQ,KAAK,IAAI,KAAW;CACpD;AACF;;;;AAmBA,MAAa,iBAAiB,OAC5B,KACA,MACmB;CACnB,MAAM,WAAW,MAAM;CACvB,IAAI,OAAO,QAAQ,GACjB,OAAO,KAAK,MAAM,EAAE,SAAS,KAAK,CAAC;CAErC,OAAO;AACT;;;;AAKA,MAAa,iBAAiB,OAC5B,QACA,MACsB;CACtB,MAAM,WAAW,MAAM;CACvB,IAAI,KAAK,QAAQ,GACf,OAAO,GAAG,MAAM,EAAE,SAAS,KAAK,CAAC;CAEnC,OAAO;AACT;;;;;AAUA,MAAa,kBAAwB,KAAgB,UACnD,OAAO,GAAG,IAAI,GAAG,IAAI,KAAK,IAAI,IAAI,KAAK;;;;;AAMzC,MAAa,kBAAwB,WACnC,KAAK,MAAM,IAAI,KAAK,OAAO,KAAK,IAAI;;;;;AAMtC,MAAa,YAAe,SAAmC;CAC7D,MAAM,SAAc,CAAC;CACrB,KAAK,MAAM,OAAO,MAAM;EACtB,IAAI,OAAO,GAAG,GAAG,OAAO;EACxB,OAAO,KAAK,IAAI,KAAK;CACvB;CACA,OAAO,KAAK,MAAM;AACpB;;;;;AAMA,MAAa,mBACX,YACmB;CACnB,MAAM,SAAc,CAAC;CACrB,KAAK,MAAM,UAAU,SAAS;EAC5B,IAAI,MAAM,MAAM,GAAG,OAAO;EAC1B,OAAO,KAAK,OAAO,KAAK;CAC1B;CACA,OAAO,GAAG,MAAM;AAClB;;;;;ACnDA,MAAa,0BAA0C;;;;AAKvD,MAAa,2BAA4C;;;;AAKzD,MAAa,0BAA0C;;;;AAKvD,MAAa,uBAAoC;CAC/C,aAAa;CACb,cAAc;CACd,SAAS;CACT,UAAU;CACV,QAAQ;AACV;;;;AAKA,MAAa,0BACX;;;;AAKF,MAAa,wBAAsC;CACjD,UAAU;CACV,aAAa,OAAO;AACtB;;;;AAKA,MAAa,4BAA8C;;;;;;;;;;;;;;;;;;;;;;;;;;;AC1P3D,SAAgB,QAA0C,GAAG,QAAkC;CAC7F,OAAOA,UAAK,GAAI,MAA2B;AAC7C;;;;;;;;;;;AAYA,MAAa,iBACX,YACA,eACyC;CACzC,OAAO,cAAc;AACvB;;;;;;;;;;;;;AAsFA,MAAa,oBACX,QACA,gBACM;CACN,OAAO,IAAI,MAAM,QAAQ,EACvB,IAAI,GAAG,MAAM,UAAU;EACrB,MAAM,QAAQ,QAAQ,IAAI,GAAG,MAAM,QAAQ;EAC3C,IAAI,OAAO,UAAU,cAAc,OAAO,SAAS,UACjD,OAAO,SAAyB,GAAG,MAAiB;GAClD,OAAO,YAAY,GAAG,MAAiB,IAAI;EAC7C;EAEF,OAAO;CACT,EACF,CAAC;AACH;;;;;;;AAQA,MAAa,gBACX,QACA,iBACA,eAAuB,4BACjB;CACN,OAAO,IAAI,MAAM,QAAQ,EACvB,IAAI,GAAG,MAAM,UAAU;EACrB,MAAM,QAAQ,QAAQ,IAAI,GAAG,MAAM,QAAQ;EAC3C,IAAI,OAAO,UAAU,cAAc,gBAAgB,IAAI,IAAI,GACzD,aAAa;GACX,MAAM,IAAI,MAAM,YAAY;EAC9B;EAEF,OAAO;CACT,EACF,CAAC;AACH;;;;;AAMA,MAAa,YACX,QACA,YACM;CACN,OAAO,IAAI,MAAM,QAAQ,EACvB,IAAI,GAAG,MAAM,UAAU;EAErB,IAAI,QAAQ,SACV,OAAO,QAAQ,IAAI,SAAS,MAAM,QAAQ;EAG5C,MAAM,QAAQ,QAAQ,IAAI,GAAG,MAAM,QAAQ;EAE3C,IAAI,OAAO,UAAU,YACnB,OAAO,MAAM,KAAK,CAAC;EAErB,OAAO;CACT,EACF,CAAC;AACH;;;;;;;;;;;;;;;;;;;;;;;AA6BA,IAAsB,oBAAtB,MAA2C;CACzC,aAAwC,CAAC;;;;CAKzC,IAAI,YAAiC;EACnC,KAAK,WAAW,KAAK,UAAU;EAC/B,OAAO;CACT;AAMF;;;;;;;;;;AAWA,MAAa,iBACX,YACA,aAMkB;CAClB,QAAQ,SAAe;EAErB,OAAO,IAAI,MAAM,MAAM,EACrB,IAAI,QAAQ,MAAM,UAAU;GAC1B,MAAM,QAAQ,QAAQ,IAAI,QAAQ,MAAM,QAAQ;GAChD,IAAI,SAAS,cAAc,OAAO,UAAU,YAC1C,OAAO,SAAyB,GAAG,MAAiB;IAClD,OAAO,SAAS,MAAM,KAAK,MAAM,GAAG,IAAkB;GACxD;GAEF,OAAO;EACT,EACF,CAAC;CACH;AACF;;;;;;;;;;;;;;;;;AAkBA,MAAa,SAAyB;;;;;;;;;;;;;;;;;;;;;;;;ACtRtC,IAAa,UAAb,MAAyC;CACvC,4BAAoB,IAAI,IAAiC;;;;;;;;CASzD,GAAsB,OAAU,UAAuC;EACrE,IAAI,YAAY,KAAK,UAAU,IAAI,KAAK;EACxC,IAAI,CAAC,WAAW;GACd,4BAAY,IAAI,IAAI;GACpB,KAAK,UAAU,IAAI,OAAO,SAAS;EACrC;EACA,UAAU,IAAI,QAAQ;EAGtB,aAAa;GACX,UAAW,OAAO,QAAQ;GAE1B,IAAI,UAAW,SAAS,GACtB,KAAK,UAAU,OAAO,KAAK;EAE/B;CACF;;;;;;;;CASA,KAAwB,OAAU,UAAuC;EACvE,MAAM,mBAAmC,YAAY;GACnD,YAAY;GACZ,SAAS,OAAO;EAClB;EAEA,MAAM,cAAc,KAAK,GAAG,OAAO,eAAe;EAClD,OAAO;CACT;;;;;;;CAQA,KAAwB,OAAU,SAAqB;EACrD,MAAM,YAAY,KAAK,UAAU,IAAI,KAAK;EAC1C,IAAI,WAAW;GAEb,MAAM,WAAW,MAAM,KAAK,SAAS;GACrC,KAAK,MAAM,YAAY,UACrB,IAAI;IACF,SAAS,OAAO;GAClB,SAAS,OAAO;IAEd,QAAQ,MACN,gCAAgC,OAAO,KAAK,EAAE,KAC9C,KACF;GACF;EAEJ;CACF;;;;;;CAOA,IAAuB,OAAiB;EACtC,IAAI,UAAU,KAAA,GACZ,KAAK,UAAU,OAAO,KAAK;OAE3B,KAAK,UAAU,MAAM;CAEzB;;;;;;;CAQA,cAAiC,OAAkB;EACjD,OAAO,KAAK,UAAU,IAAI,KAAK,CAAC,EAAE,QAAQ;CAC5C;;;;CAKA,aAA0B;EACxB,OAAO,MAAM,KAAK,KAAK,UAAU,KAAK,CAAC;CACzC;;;;CAKA,aAAgC,OAAmB;EACjD,OAAO,KAAK,cAAc,KAAK,IAAI;CACrC;;;;CAKA,UAAgB;EACd,KAAK,UAAU,MAAM;CACvB;AACF;;;;;;;;;AAUA,MAAa,sBAAsD;CACjE,OAAO,IAAI,QAAW;AACxB;;;;;;;;;;;AAYA,IAAa,eAAb,MAAiE;CAC/D;CACA;CACA;CACA,QAAwB,CAAC;CACzB,QAAsD;CAEtD,YACE,SACA,OACA,SACA;EACA,KAAK,UAAU;EACf,KAAK,QAAQ;EACb,KAAK,UAAU;CACjB;;;;CAKA,MAAM,SAAqB;EACzB,KAAK,MAAM,KAAK,OAAO;EAEvB,IAAI,KAAK,UAAU,MACjB,KAAK,QAAQ,iBAAiB,KAAK,MAAM,GAAG,KAAK,OAAO;CAE5D;;;;CAKA,QAAc;EACZ,IAAI,KAAK,UAAU,MAAM;GACvB,aAAa,KAAK,KAAK;GACvB,KAAK,QAAQ;EACf;EAEA,IAAI,KAAK,MAAM,SAAS,GAAG;GACzB,MAAM,aAAa,SAAS,OAAO,KAAK,KAAK;GAC7C,KAAK,QAAQ,KAAK,YAAY,KAAK,KAAY;GAC/C,KAAK,QAAQ,CAAC;EAChB;CACF;;;;CAKA,UAAgB;EACd,KAAK,MAAM;CACb;AACF;;;;;;;;;;;;;;AAeA,IAAa,eAAb,MAA8C;CAC5C,4BAAoB,IAAI,IAAiC;CAEzD,GAAsB,OAAU,UAAuC;EACrE,IAAI,YAAY,KAAK,UAAU,IAAI,KAAK;EACxC,IAAI,CAAC,WAAW;GACd,4BAAY,IAAI,IAAI;GACpB,KAAK,UAAU,IAAI,OAAO,SAAS;EACrC;EACA,UAAU,IAAI,QAAQ;EAEtB,aAAa;GACX,UAAW,OAAO,QAAQ;GAC1B,IAAI,UAAW,SAAS,GACtB,KAAK,UAAU,OAAO,KAAK;EAE/B;CACF;;;;;;;;CASA,MAAM,KAAwB,OAAU,SAA8B;EACpE,MAAM,YAAY,KAAK,UAAU,IAAI,KAAK;EAC1C,IAAI,WAAW;GACb,MAAM,WAAW,MAAM,KAAK,SAAS,CAAC,CAAC,KAAK,aAC1C,QAAQ,QAAQ,CAAC,CAAC,WAAW,SAAS,OAAO,CAAC,CAChD;GACA,MAAM,QAAQ,IAAI,QAAQ;EAC5B;CACF;CAEA,IAAuB,OAAiB;EACtC,IAAI,UAAU,KAAA,GACZ,KAAK,UAAU,OAAO,KAAK;OAE3B,KAAK,UAAU,MAAM;CAEzB;CAEA,cAAiC,OAAkB;EACjD,OAAO,KAAK,UAAU,IAAI,KAAK,CAAC,EAAE,QAAQ;CAC5C;CAEA,aAA0B;EACxB,OAAO,MAAM,KAAK,KAAK,UAAU,KAAK,CAAC;CACzC;CAEA,UAAgB;EACd,KAAK,UAAU,MAAM;CACvB;AACF;;;;;;;;;;;AAYA,MAAa,gBAMX,QACA,QACA,aACA,aACA,cACgB;CAChB,OAAO,OAAO,GAAG,cAAc,YAAY;EACzC,MAAM,qBAAqB,YACvB,UAAU,OAAO,IAChB;EACL,OAAO,KAAK,aAAa,kBAAkB;CAC7C,CAAC;AACH;;;;;;;;;;;AAYA,MAAa,UACX,SACA,OACA,WACA,aACgB;CAChB,OAAO,QAAQ,GAAG,QAAQ,YAAY;EACpC,IAAI,UAAU,OAAO,GACnB,SAAS,OAAO;CAEpB,CAAC;AACH;;;;;;;AC7VA,MAAa,uBAA6C,UAAU;CAClE,qBAAqB;EACnB,MAAM;CACR,CAAC;AACH;;;;;;;;;AAUA,IAAa,mBAAb,MAAiC;CAC/B,4BAA6B,IAAI,IAA+C;CAChF;;CAGA,YAAY,UAAgC,qBAAqB;EAC/D,KAAK,UAAU;CACjB;;CAGA,IAAI,OAAe;EACjB,OAAO,KAAK,UAAU;CACxB;;;;;;CAOA,IAAI,UAA0C;EAC5C,MAAM,QAAQ,EAAE,SAAS;EACzB,KAAK,UAAU,IAAI,KAAK;EACxB,aAAa;GACX,KAAK,UAAU,OAAO,KAAK;EAC7B;CACF;;CAGA,KAAK,OAAgB;EACnB,KAAK,MAAM,SAAS,CAAC,GAAG,KAAK,SAAS,GAAG;GAEvC,IAAI,CAAC,KAAK,UAAU,IAAI,KAAK,GAAG;GAChC,IAAI;IACF,MAAM,SAAS,KAAK;GACtB,SAAS,OAAO;IACd,KAAK,QAAQ,KAAK;GACpB;EACF;CACF;;CAGA,QAAc;EACZ,KAAK,UAAU,MAAM;CACvB;AACF;;;;;;;;;;;;;;;;;;;ACrDA,MAAa,aAAa;AAE1B,MAAM,OAAO,WAAW;AACxB,MAAM,OAAO,WAAW;;AAExB,MAAM,mBAAmB,IAAI,KAAK,OAAO,EAAE;AAE3C,SAAS,QAAQ,SAA6B;CAC5C,OAAO,IAAI,WAAW,OAAO;AAC/B;;AAGA,SAAS,cAAc,MAAsB;CAC3C,IAAI,QAAQ,OAAO,QAAQ,KAAK,OAAO,KAAK,WAAW,CAAC,IAAI,IAAI,WAAW,CAAC,IAAI;CAChF,IAAI,QAAQ,OAAO,QAAQ,KAAK,OAAO,IAAI,WAAW,CAAC,IAAI,KAAK,WAAW,CAAC,IAAI;CAChF,MAAM,QAAQ,4BAA4B,KAAK,EAAE;AACnD;AAEA,SAAS,YAAY,KAAqB;CACxC,MAAM,SAAS,cAAc,IAAI,MAAM,EAAE;CACzC,IAAI,SAAS,IAAI,QAAQ,MAAM,QAAQ,YAAY,IAAI,oCAAoC;CAC3F,OAAO,IAAI,MAAM,GAAG,MAAM;AAC5B;AAEA,SAAS,YAAY,KAAmB;CACtC,IAAI,OAAO,QAAQ,YAAY,QAAQ,IAAI,MAAM,QAAQ,qCAAqC;CAC9F,KAAK,MAAM,KAAK,KAAK,IAAI,CAAA,iEAAY,SAAS,CAAC,GAAG,MAAM,QAAQ,YAAY,IAAI,4CAA4C;CAC5H,IAAI,QAAQ,kBAAkB,MAAM,QAAQ,YAAY,IAAI,cAAc;CAE1E,IADiB,IAAI,MAAM,YAAY,GAAG,CAAC,CAAC,MACjC,CAAC,CAAC,SAAS,IAAI,GAAG,MAAM,QAAQ,iCAAiC,IAAI,cAAc,MAAM;AACtG;;AAGA,SAAS,SAAS,GAAW,GAA0B;CACrD,IAAI,MAAM,MAAM;EACd,IAAI,IAAI;EACR,QAAQ,EAAE,MAAM,UAAU,EAAE,IAAI;EAChC,IAAI,IAAI,GAAG,OAAO,EAAE,MAAM,GAAG,CAAC,IAAI,SAAS,EAAE,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;CACnE;CACA,MAAM,SAAS,IAAI,WAAW,QAAQ,EAAE,EAAG,IAAI;CAC/C,MAAM,SAAS,MAAM,OAAO,WAAW,QAAQ,EAAE,EAAG,IAAI;CACxD,IAAI,SAAS,SAAS,GAAG,OAAO,WAAW,KAAK,OAAO,SAAS,UAAU,CAAC;CAE3E,IAAI,MAAM,QAAQ,EAAE,SAAS,GAAG,OAAO,EAAE,MAAM,GAAG,CAAC;CACnD,OAAO,WAAW,UAAW,SAAS,EAAE,MAAM,CAAC,GAAG,IAAI;AACxD;AAEA,SAAS,iBAAiB,GAA0B;CAClD,MAAM,CAAC,MAAM,GAAG,UAAU,EAAE,MAAM,EAAE;CACpC,IAAI,QAAQ;CACZ,KAAK,IAAI,IAAI,OAAO,SAAS,GAAG,SAAS,KAAK,GAAG,KAAK;EACpD,MAAM,IAAI,WAAW,QAAQ,OAAO,EAAG,IAAI;EAC3C,IAAI,MAAM,IAAmB,OAAO,KAAK;OACpC;GACH,OAAO,KAAK,WAAW;GACvB,QAAQ;EACV;CACF;CACA,IAAI,CAAC,OAAO,OAAO,OAAO,OAAO,KAAK,EAAE;CACxC,IAAI,SAAS,KAAK,OAAO,IAAI;CAC7B,IAAI,SAAS,KAAK,OAAO;CACzB,MAAM,OAAO,OAAO,aAAa,KAAK,WAAW,CAAC,IAAI,CAAC;CACvD,IAAI,OAAO,KAAK,OAAO,KAAK,IAAI;MAC3B,OAAO,IAAI;CAChB,OAAO,OAAO,OAAO,KAAK,EAAE;AAC9B;AAEA,SAAS,iBAAiB,GAA0B;CAClD,MAAM,CAAC,MAAM,GAAG,UAAU,EAAE,MAAM,EAAE;CACpC,IAAI,SAAS;CACb,KAAK,IAAI,IAAI,OAAO,SAAS,GAAG,UAAU,KAAK,GAAG,KAAK;EACrD,MAAM,IAAI,WAAW,QAAQ,OAAO,EAAG,IAAI;EAC3C,IAAI,MAAM,IAAI,OAAO,KAAK;OACrB;GACH,OAAO,KAAK,WAAW;GACvB,SAAS;EACX;CACF;CACA,IAAI,CAAC,QAAQ,OAAO,OAAO,OAAO,KAAK,EAAE;CACzC,IAAI,SAAS,KAAK,OAAO,IAAI;CAC7B,IAAI,SAAS,KAAK,OAAO;CACzB,MAAM,OAAO,OAAO,aAAa,KAAK,WAAW,CAAC,IAAI,CAAC;CACvD,IAAI,OAAO,KAAK,OAAO,KAAK,IAAI;MAC3B,OAAO,IAAI;CAChB,OAAO,OAAO,OAAO,KAAK,EAAE;AAC9B;;;;;;;;;;;;;;AAeA,SAAgB,WAAW,MAAiC,MAAyC;CACnG,MAAM,IAAI,QAAQ;CAClB,MAAM,IAAI,QAAQ;CAClB,IAAI,MAAM,MAAM,YAAY,CAAC;CAC7B,IAAI,MAAM,MAAM,YAAY,CAAC;CAC7B,IAAI,MAAM,QAAQ,MAAM,QAAQ,KAAK,GAAG,MAAM,QAAQ,YAAY,EAAE,2BAA2B,EAAE,EAAE;CACnG,IAAI,MAAM,MAAM;EACd,IAAI,MAAM,MAAM,OAAO,IAAI;EAC3B,MAAM,KAAK,YAAY,CAAC;EACxB,MAAM,KAAK,EAAE,MAAM,GAAG,MAAM;EAC5B,IAAI,OAAO,kBAAkB,OAAO,KAAK,SAAS,IAAI,EAAE;EACxD,IAAI,KAAK,GAAG,OAAO;EACnB,MAAM,cAAc,iBAAiB,EAAE;EACvC,IAAI,gBAAgB,MAAM,MAAM,QAAQ,8BAA8B;EACtE,OAAO;CACT;CACA,MAAM,KAAK,YAAY,CAAC;CACxB,MAAM,KAAK,EAAE,MAAM,GAAG,MAAM;CAC5B,IAAI,MAAM,MAAM;EACd,MAAM,cAAc,iBAAiB,EAAE;EACvC,OAAO,gBAAgB,OAAO,KAAK,SAAS,IAAI,IAAI,IAAI;CAC1D;CACA,MAAM,KAAK,YAAY,CAAC;CACxB,MAAM,KAAK,EAAE,MAAM,GAAG,MAAM;CAC5B,IAAI,OAAO,IAAI,OAAO,KAAK,SAAS,IAAI,EAAE;CAC1C,MAAM,cAAc,iBAAiB,EAAE;CACvC,IAAI,gBAAgB,MAAM,MAAM,QAAQ,6BAA6B;CACrE,IAAI,cAAc,GAAG,OAAO;CAC5B,OAAO,KAAK,SAAS,IAAI,IAAI;AAC/B;;;;;;;AAQA,SAAgB,YAAY,MAAiC,MAAiC,OAAyB;CACrH,IAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,GAAG,MAAM,QAAQ,mDAAmD,OAAO;CACnH,MAAM,IAAI,QAAQ;CAClB,MAAM,IAAI,QAAQ;CAClB,IAAI,UAAU,GAAG,OAAO,CAAC;CACzB,IAAI,UAAU,GAAG,OAAO,CAAC,WAAW,GAAG,CAAC,CAAC;CACzC,IAAI,MAAM,MAAM;EACd,MAAM,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC;EACjC,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK,KAAK,KAAK,WAAW,KAAK,IAAI,IAAK,IAAI,CAAC;EACxE,OAAO;CACT;CACA,IAAI,MAAM,MAAM;EACd,MAAM,OAAO,CAAC,WAAW,MAAM,CAAC,CAAC;EACjC,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK,KAAK,KAAK,WAAW,MAAM,KAAK,IAAI,EAAG,CAAC;EACxE,OAAO,KAAK,QAAQ;CACtB;CACA,MAAM,OAAO,KAAK,MAAM,QAAQ,CAAC;CACjC,MAAM,SAAS,WAAW,GAAG,CAAC;CAC9B,OAAO;EAAC,GAAG,YAAY,GAAG,QAAQ,IAAI;EAAG;EAAQ,GAAG,YAAY,QAAQ,GAAG,QAAQ,OAAO,CAAC;CAAC;AAC9F;;;;;AAYA,SAAgB,WAAW,KAAc,UAA2B,CAAC,GAAkB;CACrF,IAAI,OAAO,QAAQ,YAAY,IAAI,UAAU,QAAQ,aAAa,OAAO,OAAO;CAChF,IAAI;EACF,YAAY,GAAG;EACf,OAAO;CACT,QAAQ;EACN,OAAO;CACT;AACF;;;;;;;;;;;;;;;;;;;;AA2BA,SAAgB,YAAY,OAA6B,OAAe,UAAsD;CAC5H,IAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,KAAK,QAAQ,MAAM,QAAQ,MAAM,QAAQ,aAAa,MAAM,0BAA0B,MAAM,OAAO,OAAO;CAClJ,IAAI,MAAM,MAAM,SAAS,KAAK,OAAO,QAAQ,GAAG,MAAM,QAAQ,uCAAuC,SAAS,EAAE;CAChH,MAAM,OAAO,MAAM,QAAQ,EAAE,EAAE,OAAO;CAEtC,IAAI,MAAM;CACV,OAAO,MAAM,MAAM,UAAU,SAAS,QAAQ,MAAM,IAAI,CAAE,OAAO,MAAM;CACvE,MAAM,SAA6C,CAAC;CACpD,IAAI,MAAM,OAAO;EACf,MAAM,OAAO,YAAY,MAAM,MAAM,IAAI,EAAE,OAAO,MAAM,MAAM,KAAK;EACnE,KAAK,IAAI,IAAI,OAAO,IAAI,KAAK,KAAK,OAAO,KAAK;GAAE,IAAI,MAAM,EAAE,CAAE;GAAI,KAAK,KAAK,IAAI;EAAQ,CAAC;CAC3F;CACA,MAAM,OAAO,OAAO,SAAS,IAAI,OAAO,EAAE,CAAE,MAAO,MAAM,MAAM,EAAE,OAAO;CACxE,OAAO,KAAK;EAAE,IAAI;EAAU,KAAK,WAAW,MAAM,IAAI;CAAE,CAAC;CACzD,OAAO;AACT;;AAGA,SAAgB,YAAY,GAAW,GAAmB;CACxD,OAAO,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI;AAClC;;;;;;;;;;;;;;;AAsBA,SAAgB,UAAU,OAAc,SAA2B,eAAe,IAAY;CAC5F,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;EACvC,MAAM,IAAI,QAAQ;EAClB,IAAI,MAAM,IAAI,EAAE,IAAI,cAAc,OAAO;EACzC,IAAI,KAAK,IAAI,MAAM,IAAI,EAAE,CAAC,KAAK,gBAAgB,MAAM,IAAI,EAAE,GAAG,OAAO;CACvE;CACA,OAAO,QAAQ;AACjB;;;;;;AC7PA,MAAa,aAAsB,GAAG,MAAM,MAAM;;;;;AAMlD,MAAa,aAAsB,GAAG,MAAM;CAC1C,IAAI,MAAM,GAAG,OAAO;CACpB,IAAI,OAAO,MAAM,YAAY,OAAO,MAAM,UAAU,OAAO;CAC3D,IAAI,MAAM,QAAQ,MAAM,MAAM,OAAO;CAErC,MAAM,QAAQ,OAAO,KAAK,CAAC;CAC3B,MAAM,QAAQ,OAAO,KAAK,CAAC;CAE3B,IAAI,MAAM,WAAW,MAAM,QAAQ,OAAO;CAE1C,KAAK,MAAM,OAAO,OAAO;EACvB,IAAI,CAAC,OAAO,UAAU,eAAe,KAAK,GAAG,GAAG,GAAG,OAAO;EAC1D,IAAI,EAAE,SAAS,EAAE,MAAM,OAAO;CAChC;CAEA,OAAO;AACT;;AAGA,MAAM,iBAAiB,GAAY,MAAwB,MAAM,KAAM,OAAO,MAAM,CAAC,KAAK,OAAO,MAAM,CAAC;AAExG,MAAM,YAAY,UAAoC,OAAO,UAAU,YAAY,UAAU;AAQ7F,SAAS,aAAa,MAAiB,MAAoB;CACzD,OAAO,KAAK,IAAI,SAAS,MAAM;EAC7B,MAAM,CAAC,GAAG,KAAK,KAAK,IAAI,IAAI;EAC5B,KAAK,SAAS,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC;CAChC;AACF;AAEA,SAAS,cAAc,GAAuB,GAAgC;CAC5E,IAAI,EAAE,WAAW,EAAE,QAAQ,OAAO;CAClC,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAC5B,IAAI,CAAC,cAAc,EAAE,IAAI,EAAE,EAAE,GAAG,OAAO;CAEzC,OAAO;AACT;;AAGA,MAAM,YAAY,UAChB,iBAAiB,YAAY,iBAAiB,eAAgB,OAAO,sBAAsB,eAAe,iBAAiB;AAE7H,MAAM,YAAY,UAA2B,iBAAiB,WAAW,iBAAiB,WAAW,iBAAiB,WAAW,iBAAiB;AAElJ,MAAM,WAAW,UACf,iBAAiB,UAAU,iBAAiB,UAAU,iBAAiB,WAAW,iBAAiB,UAAU,iBAAiB;AAEhI,SAAS,QAAQ,OAA+C;CAC9D,OAAO,YAAY,OAAO,KAAK,IAAI,IAAI,WAAW,MAAM,QAAQ,MAAM,YAAY,MAAM,UAAU,IAAI,IAAI,WAAW,KAAK;AAC5H;AAEA,SAAS,eAAe,OAAoC;CAC1D,OAAO,QAAQ,QAAQ,KAAK,CAAC,CAAC,QAAQ,QAAQ,OAAO,UAAU,qBAAqB,KAAK,OAAO,GAAG,CAAC;AACtG;AAEA,SAAS,UAAU,GAAQ,GAAQ,MAA0B;CAC3D,MAAM,OAAO,eAAe,CAAC;CAC7B,IAAI,KAAK,WAAW,eAAe,CAAC,CAAC,CAAC,QAAQ,OAAO;CACrD,OAAO,KAAK,OAAO,QAAQ,OAAO,UAAU,qBAAqB,KAAK,GAAG,GAAG,KAAK,YAAY,EAAE,MAAM,EAAE,MAAM,IAAI,CAAC;AACpH;;;;;;AAOA,SAAS,aAAa,GAAyC,GAAyC,MAA0B;CAChI,IAAI,EAAE,SAAS,EAAE,MAAM,OAAO;CAC9B,MAAM,WAAW,QAA2B,aAAa,MAAM,EAAE,IAAI,GAAG,IAAI;CAC5E,MAAM,OAAO,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,SAAS,SAAS,GAAG,CAAC;CAC7D,KAAK,MAAM,CAAC,KAAK,UAAU,EAAE,QAAQ,GAAG;EACtC,IAAI,CAAC,SAAS,GAAG,GAAG;GAClB,IAAI,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,YAAY,OAAO,QAAQ,GAAG,GAAG,IAAI,GAAG,OAAO;GACnE;EACF;EACA,MAAM,KAAK,KAAK,WAAW,CAAC,UAAU,gBAAgB;GACpD,MAAM,OAAO,KAAK,IAAI;GACtB,IAAI,YAAY,KAAK,UAAU,IAAI,KAAK,YAAY,OAAO,YAAY,IAAI,GAAG,OAAO;GACrF,aAAa,MAAM,IAAI;GACvB,OAAO;EACT,CAAC;EACD,IAAI,KAAK,GAAG,OAAO;EACnB,KAAK,OAAO,IAAI,CAAC;CACnB;CACA,OAAO;AACT;;AAGA,SAAS,aAAa,GAAQ,GAAQ,MAA0B;CAC9D,IAAI,MAAM,QAAQ,CAAC,KAAK,MAAM,QAAQ,CAAC,GAAG;EACxC,IAAI,CAAC,MAAM,QAAQ,CAAC,KAAK,CAAC,MAAM,QAAQ,CAAC,KAAK,EAAE,WAAW,EAAE,QAAQ,OAAO;EAC5E,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAC5B,IAAI,CAAC,YAAY,EAAE,IAAI,EAAE,IAAI,IAAI,GAAG,OAAO;EAE7C,OAAO;CACT;CACA,IAAI,SAAS,CAAC,GAAG,OAAO,cAAc,QAAQ,CAAC,GAAG,QAAQ,CAAC,CAAC;CAC5D,IAAI,YAAY,OAAO,CAAC,GAAG,OAAO,cAAc,GAAoC,CAAC;CACrF,IAAI,SAAS,CAAC,GAAG,OAAO;CACxB,IAAI,aAAa,QAAQ,CAAC,cAAc,EAAE,QAAQ,GAAG,EAAE,QAAQ,CAAC,GAAG,OAAO;CAC1E,IAAI,aAAa,WAAW,EAAE,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE,QAAQ,OAAO;CAClF,IAAI,aAAa,SAAS,EAAE,EAAE,SAAS,EAAE,QAAQ,EAAE,YAAY,EAAE,WAAW,YAAY,EAAE,OAAO,EAAE,OAAO,IAAI,IAAI,OAAO;CACzH,IAAI,QAAQ,CAAC,KAAK,CAAC,cAAc,EAAE,QAAQ,GAAG,EAAE,QAAQ,CAAC,GAAG,OAAO;CACnE,KAAK,aAAa,OAAO,aAAa,QAAQ,CAAC,aAAa,GAAG,GAAG,IAAI,GAAG,OAAO;CAChF,OAAO,UAAU,GAAG,GAAG,IAAI;AAC7B;;;;;;AAOA,SAAS,YAAY,GAAY,GAAY,MAA0B;CACrE,IAAI,cAAc,GAAG,CAAC,GAAG,OAAO;CAChC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,OAAO;CACzC,IAAI,OAAO,eAAe,CAAC,MAAM,OAAO,eAAe,CAAC,GAAG,OAAO;CAClE,IAAI,WAAW,KAAK,SAAS,IAAI,CAAC;CAClC,IAAI,UAAU,IAAI,CAAC,GAAG,OAAO;CAC7B,IAAI,aAAa,KAAA,GAAW;EAC1B,2BAAW,IAAI,IAAI;EACnB,KAAK,SAAS,IAAI,GAAG,QAAQ;CAC/B;CACA,SAAS,IAAI,CAAC;CACd,KAAK,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC;CACpB,OAAO,aAAa,GAAG,GAAG,IAAI;AAChC;;;;;;;;;;;;;;;;;;;;;AAsBA,MAAa,UAAmB,GAAG,MAAe,YAAY,GAAG,GAAG;CAAE,0BAAU,IAAI,IAAI;CAAG,KAAK,CAAC;AAAE,CAAC;;;;;;;;;AAUpG,MAAa,QACX,YACU;CACV,MAAM,WAAW,OAAO,YAAY,aAAa,WAAW,MAAS,EAAE;CACvE,QAAQ,GAAG,MAAM,SAAS,CAAC,MAAM,SAAS,CAAC;AAC7C;;AAOA,SAAS,cAAc,OAAwB;CAC7C,IAAI,UAAU,MAAM,OAAO;CAC3B,IAAI,UAAU,KAAA,GAAW,OAAO;CAChC,QAAQ,OAAO,OAAf;EACE,KAAK,WACH,OAAO,QAAQ,IAAI;EACrB,KAAK,UACH,OAAO,WAAW,KAAK;EACzB,KAAK,UACH,OAAO,WAAW,KAAK;EACzB,KAAK,UACH,OAAO,WAAW,MAAM,SAAS,CAAC;EACpC,KAAK,UACH,OAAO,WAAW,MAAM,SAAS,CAAC;EACpC,SACE,OAAO;CACX;AACF;;AAGA,MAAM,aAAa;;AAMnB,MAAM,OAAO,MAAc,SAA0B,KAAK,KAAK,MAAM,EAAE,IAAI,OAAQ;;AAGnF,SAAS,SAAS,MAAsB;CACtC,IAAI,QAAQ,OAAQ,SAAS;CAC7B,QAAQ,KAAK,KAAK,OAAO,UAAU;CACnC,SAAS,UAAU;CACnB,QAAQ,KAAK,KAAK,OAAO,UAAU;CACnC,OAAO,QAAS,UAAU;AAC5B;;AAGA,MAAM,OAAO;CAAE,OAAO;CAAG,QAAQ;CAAG,UAAU;CAAG,QAAQ;CAAI,QAAQ;AAAG;AAExE,MAAM,UAAU,OAAgB,OAAe,SAC7C,SAAS,KAAK,IAAI,WAAW,OAAO,OAAO,IAAI,IAAI,cAAc,KAAK;AAExE,SAAS,aAAa,OAAe,UAAsC;CACzE,IAAI,OAAO;CACX,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KAAK,OAAO,IAAI,MAAM,cAAc,SAAS,EAAE,CAAC;CACrF,OAAO;AACT;;AAGA,SAAS,YAAY,OAA6C,OAAe,MAAwB;CACvG,IAAI,MAAM;CACV,KAAK,MAAM,CAAC,KAAK,UAAU,MAAM,QAAQ,GAAG,MAAO,MAAM,SAAS,IAAI,OAAO,KAAK,OAAO,IAAI,GAAG,OAAO,OAAO,OAAO,IAAI,CAAC,CAAC,IAAK;CAChI,OAAO;AACT;;AAGA,SAAS,SAAS,OAAY,OAAe,MAAwB;CACnE,IAAI,MAAM;CACV,KAAK,MAAM,OAAO,eAAe,KAAK,GAAG,MAAO,MAAM,SAAS,IAAI,cAAc,GAAG,GAAG,OAAO,MAAM,MAAM,OAAO,IAAI,CAAC,CAAC,IAAK;CAC5H,OAAO;AACT;;AAGA,SAAS,WAAW,OAAY,OAAe,MAAwB;CACrE,IAAI,MAAM,QAAQ,KAAK,GAAG;EACxB,IAAI,OAAe,KAAK;EACxB,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,OAAO,IAAI,MAAM,OAAO,MAAM,IAAI,OAAO,IAAI,CAAC;EACrF,OAAO;CACT;CACA,IAAI,SAAS,KAAK,GAAG,OAAO,aAAa,KAAK,QAAQ,QAAQ,KAAK,CAAC;CACpE,IAAI,YAAY,OAAO,KAAK,GAAG,OAAO,aAAa,KAAK,UAAU,KAAsC;CACxG,IAAI,SAAS,KAAK,GAAG,OAAO,KAAK;CACjC,IAAI,OAAe,KAAK;CACxB,IAAI,iBAAiB,MAAM,OAAO,IAAI,MAAM,WAAW,MAAM,QAAQ,CAAC,CAAC;CACvE,IAAI,iBAAiB,QAAQ,OAAO,IAAI,IAAI,MAAM,WAAW,MAAM,MAAM,CAAC,GAAG,WAAW,MAAM,KAAK,CAAC;CACpG,IAAI,iBAAiB,OACnB,OAAO,IAAI,IAAI,IAAI,MAAM,OAAO,MAAM,MAAM,OAAO,IAAI,CAAC,GAAG,OAAO,MAAM,SAAS,OAAO,IAAI,CAAC,GAAG,OAAO,MAAM,OAAO,OAAO,IAAI,CAAC;CAElI,IAAI,QAAQ,KAAK,GAAG,OAAO,IAAI,MAAM,cAAc,MAAM,QAAQ,CAAC,CAAC;CACnE,IAAI,iBAAiB,OAAO,iBAAiB,KAAK,OAAO,IAAI,MAAM,YAAY,OAAO,OAAO,IAAI,CAAC;CAClG,OAAO,IAAI,MAAM,SAAS,OAAO,OAAO,IAAI,CAAC;AAC/C;;AAGA,SAAS,WAAW,OAAe,OAAe,MAAwB;CACxE,IAAI,UAAU,GAAG,OAAO;CACxB,IAAI,UAAU,KAAK,IAAI,KAAK;CAC5B,IAAI,YAAY,KAAA,GAAW;EACzB,UAAU,CAAC;EACX,KAAK,IAAI,OAAO,OAAO;CACzB;CACA,MAAM,QAAQ,QAAQ;CACtB,IAAI,UAAU,KAAA,GAAW,OAAO;CAChC,MAAM,OAAO,WAAW,OAAO,QAAQ,GAAG,IAAI;CAC9C,QAAQ,SAAS;CACjB,OAAO;AACT;;;;;;;;;;;;AAaA,MAAa,eAA0B,UACrC,SAAS,KAAK,IAAI,WAAW,OAAO,4BAAY,IAAI,IAAI,CAAC,IAAI,cAAc,KAAK;;;;AAKlF,MAAa,cAAc,QAAwB;CACjD,IAAI,OAAO;CACX,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;EACnC,QAAS,QAAQ,KAAK,OAAQ,IAAI,WAAW,CAAC;EAC9C,OAAO,OAAO;CAChB;CACA,OAAO,SAAS;AAClB;;;;AAKA,MAAa,cAAc,QAAwB;CACjD,IAAI,OAAO,MAAM,GAAG,GAAG,OAAO;CAC9B,IAAI,CAAC,OAAO,SAAS,GAAG,GAAG,OAAO,MAAM,IAAI,IAAI;CAGhD,IAAI,OAAO,UAAU,GAAG,GACtB,OAAO,MAAM;CAIf,OAAO,WAAW,IAAI,SAAS,CAAC;AAClC;;;;;;;;;AAUA,MAAa,iBAAiB,GAAG,WAA6B;CAC5D,IAAI,WAAW;CACf,KAAK,MAAM,QAAQ,QAAQ;EACzB,YAAa,YAAY,KAAK,WAAY;EAC1C,WAAW,WAAW;CACxB;CACA,OAAO,aAAa;AACtB;;;;;;;AAQA,MAAa,UAAa,aAAyC;CACjE,QAAQ,UAAU,YAAY,SAAS,KAAK,CAAC;AAC/C;;;;;AAUA,MAAa,kBAAgC,GAAG,MAAM;CACpD,IAAI,MAAM,GAAG,OAAO;CACpB,IAAI,MAAM,QAAQ,MAAM,KAAA,GAAW,OAAO;CAC1C,IAAI,MAAM,QAAQ,MAAM,KAAA,GAAW,OAAO;CAG1C,IAAI,aAAa,QAAQ,aAAa,MACpC,OAAO,EAAE,QAAQ,IAAI,EAAE,QAAQ;CAIjC,IAAI,OAAO,MAAM,YAAY,OAAO,MAAM,UAAU;EAClD,IAAI,OAAO,MAAM,CAAC,GAAG,OAAO,OAAO,MAAM,CAAC,IAAI,IAAI;EAClD,IAAI,OAAO,MAAM,CAAC,GAAG,OAAO;EAC5B,OAAO,IAAI;CACb;CAGA,IAAI,OAAO,MAAM,YAAY,OAAO,MAAM,UACxC,OAAO,EAAE,cAAc,CAAC;CAI1B,IAAI,OAAO,MAAM,aAAa,OAAO,MAAM,WACzC,OAAO,MAAM,IAAI,IAAI,IAAI,IAAI;CAI/B,OAAO,OAAO,CAAC,CAAC,CAAC,cAAc,OAAO,CAAC,CAAC;AAC1C;;;;AAKA,MAAa,iBAAkC,GAAG,MAAM;CACtD,IAAI,OAAO,MAAM,CAAC,GAAG,OAAO,OAAO,MAAM,CAAC,IAAI,IAAI;CAClD,IAAI,OAAO,MAAM,CAAC,GAAG,OAAO;CAC5B,OAAO,IAAI;AACb;;;;AAKA,MAAa,iBAAkC,GAAG,MAAM,EAAE,cAAc,CAAC;;;;AAKzE,MAAa,2BAA4C,GAAG,MAC1D,EAAE,YAAY,CAAC,CAAC,cAAc,EAAE,YAAY,CAAC;;;;AAK/C,MAAa,eAA8B,GAAG,MAC5C,EAAE,QAAQ,IAAI,EAAE,QAAQ;;;;AAK1B,MAAa,kBAAoC,GAAG,MAClD,MAAM,IAAI,IAAI,IAAI,IAAI;;;;;;;AAYxB,MAAa,YAAe,aACzB,GAAG,MAAM,QAAQ,GAAG,CAAC;;;;;;;;AASxB,MAAa,aACX,SACA,UAAwB,mBACT;CACf,MAAM,WAAW,OAAO,YAAY,aAAa,WAAW,MAAS,EAAE;CACvE,QAAQ,GAAG,MAAM,QAAQ,SAAS,CAAC,GAAG,SAAS,CAAC,CAAC;AACnD;;;;;;;;;;;;AAaA,MAAa,iBAAoB,GAAG,gBAA0C;CAC5E,QAAQ,GAAG,MAAM;EACf,KAAK,MAAM,WAAW,aAAa;GACjC,MAAM,SAAS,QAAQ,GAAG,CAAC;GAC3B,IAAI,WAAW,GAAG,OAAO;EAC3B;EACA,OAAO;CACT;AACF;;;;;;;AAQA,MAAa,cAAiB,YAAuD;CACnF,QAAQ,GAAG,MAAM;EACf,IAAI,KAAK,QAAQ,KAAK,MAAM,OAAO;EACnC,IAAI,KAAK,MAAM,OAAO;EACtB,IAAI,KAAK,MAAM,OAAO;EACtB,OAAO,QAAQ,GAAG,CAAC;CACrB;AACF;;;;;;;AAQA,MAAa,aAAgB,YAAuD;CAClF,QAAQ,GAAG,MAAM;EACf,IAAI,KAAK,QAAQ,KAAK,MAAM,OAAO;EACnC,IAAI,KAAK,MAAM,OAAO;EACtB,IAAI,KAAK,MAAM,OAAO;EACtB,OAAO,QAAQ,GAAG,CAAC;CACrB;AACF;;;;;;;;AASA,MAAa,gBACX,cACA,aAAyB,mBACV;CACf,QAAQ,GAAG,MAAM,WAAW,aAAa,CAAC,GAAG,aAAa,CAAC,CAAC;AAC9D;;;;;;;;;;ACreA,IAAa,YAAb,MAAa,UAA8C;CACzD;CACA;CACA;CAEA,uBAAgC;CAEhC,YAAY,UAA+B,CAAC,GAAG;EAC7C,MAAM,EAAE,kBAAkB,IAAI,KAAK,cAAc;EACjD,KAAK,SAAS,IAAI,MAAM,eAAe;EACvC,KAAK,QAAQ;EACb,KAAK,MAAM;CACb;CAMA,IAAI,OAAe;EACjB,OAAO,KAAK;CACd;CAEA,IAAI,UAAmB;EACrB,OAAO,KAAK,UAAU;CACxB;;;;CAKA,IAAI,WAAmB;EACrB,OAAO,KAAK,OAAO;CACrB;CAEA,IAAI,KAAY;EACd,OAAO,KAAK;CACd;CAMA,IAAI,OAAkB;EACpB,KAAK,WAAW,KAAK;EACrB,OAAO,KAAK,OAAO;CACrB;CAEA,IAAI,OAAe,SAAe;EAChC,KAAK,WAAW,KAAK;EACrB,MAAM,MAAM,KAAK,OAAO;EACxB,KAAK,OAAO,SAAS;EACrB,OAAO;CACT;CAMA,SAAS,SAAqB;EAC5B,OAAO,KAAK,QAAQ,OAAO,MAAM;CACnC;CAEA,QAAQ,SAAY,YAAoB,GAAW;EACjD,IAAI,YAAY,GAAG,YAAY;EAC/B,KAAK,IAAI,IAAI,WAAW,IAAI,KAAK,OAAO,KACtC,IAAI,KAAK,IAAI,KAAK,OAAO,IAAK,OAAO,GACnC,OAAO;EAGX,OAAO;CACT;CAEA,YAAY,SAAY,WAA4B;EAClD,MAAM,QACJ,cAAc,KAAA,IACV,KAAK,IAAI,WAAW,KAAK,QAAQ,CAAC,IAClC,KAAK,QAAQ;EACnB,KAAK,IAAI,IAAI,OAAO,KAAK,GAAG,KAC1B,IAAI,KAAK,IAAI,KAAK,OAAO,IAAK,OAAO,GACnC,OAAO;EAGX,OAAO;CACT;CAEA,YAAY,OAA6B;EACvC,KAAK,MAAM,WAAW,OACpB,IAAI,CAAC,KAAK,SAAS,OAAO,GAAG,OAAO;EAEtC,OAAO;CACT;CAMA,IAAI,SAAqB;EACvB,KAAK,eAAe,KAAK,QAAQ,CAAC;EAClC,KAAK,OAAO,KAAK,WAAW;EAC5B,OAAO;CACT;CAEA,KAAK,SAAkB;EACrB,KAAK,IAAI,OAAO;CAClB;CAEA,QAAQ,SAAkB;EACxB,KAAK,OAAO,GAAG,OAAO;CACxB;CAEA,OAAO,OAAe,SAAkB;EACtC,KAAK,iBAAiB,KAAK;EAC3B,KAAK,eAAe,KAAK,QAAQ,CAAC;EAGlC,KAAK,IAAI,IAAI,KAAK,OAAO,IAAI,OAAO,KAClC,KAAK,OAAO,KAAK,KAAK,OAAO,IAAI;EAGnC,KAAK,OAAO,SAAS;EACrB,KAAK;CACP;CAEA,UAAU,OAAe,OAA6B;EACpD,KAAK,iBAAiB,KAAK;EAC3B,MAAM,WAAW,MAAM,QAAQ,KAAK,IAAI,QAAQ,MAAM,KAAK,KAAK;EAChE,IAAI,SAAS,WAAW,GAAG,OAAO;EAElC,KAAK,eAAe,KAAK,QAAQ,SAAS,MAAM;EAGhD,KAAK,IAAI,IAAI,KAAK,QAAQ,GAAG,KAAK,OAAO,KACvC,KAAK,OAAO,IAAI,SAAS,UAAU,KAAK,OAAO;EAIjD,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KACnC,KAAK,OAAO,QAAQ,KAAK,SAAS;EAGpC,KAAK,SAAS,SAAS;EACvB,OAAO;CACT;CAEA,OAAO,OAA6B;EAClC,MAAM,WAAW,MAAM,QAAQ,KAAK,IAAI,QAAQ,MAAM,KAAK,KAAK;EAChE,IAAI,SAAS,WAAW,GAAG,OAAO;EAElC,KAAK,eAAe,KAAK,QAAQ,SAAS,MAAM;EAEhD,KAAK,MAAM,WAAW,UACpB,KAAK,OAAO,KAAK,WAAW;EAG9B,OAAO;CACT;CAMA,OAAO,SAAqB;EAC1B,MAAM,QAAQ,KAAK,QAAQ,OAAO;EAClC,IAAI,UAAU,IAAI,OAAO;EACzB,KAAK,SAAS,KAAK;EACnB,OAAO;CACT;CAEA,SAAS,OAAkB;EACzB,KAAK,WAAW,KAAK;EACrB,MAAM,MAAM,KAAK,OAAO;EAGxB,KAAK,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ,GAAG,KACtC,KAAK,OAAO,KAAK,KAAK,OAAO,IAAI;EAGnC,KAAK;EAEL,KAAK,OAAO,KAAK,SAAS,KAAA;EAE1B,OAAO;CACT;CAEA,MAAS;EACP,IAAI,KAAK,SACP,MAAM,IAAI,MAAM,4BAA4B;EAE9C,OAAO,KAAK,SAAS,KAAK,QAAQ,CAAC;CACrC;CAEA,QAAW;EACT,IAAI,KAAK,SACP,MAAM,IAAI,MAAM,8BAA8B;EAEhD,OAAO,KAAK,SAAS,CAAC;CACxB;CAEA,YAAY,WAAmB,SAAuB;EACpD,KAAK,WAAW,WAAW,OAAO;EAClC,MAAM,cAAc,UAAU;EAC9B,IAAI,gBAAgB,GAAG;EAGvB,KAAK,IAAI,IAAI,SAAS,IAAI,KAAK,OAAO,KACpC,KAAK,OAAO,IAAI,eAAe,KAAK,OAAO;EAI7C,KAAK,IAAI,IAAI,KAAK,QAAQ,aAAa,IAAI,KAAK,OAAO,KACrD,KAAK,OAAO,KAAK,KAAA;EAGnB,KAAK,SAAS;CAChB;CAEA,UAAU,OAA6B;EACrC,MAAM,2BAAW,IAAI,IAAO;EAC5B,KAAK,MAAM,WAAW,OACpB,SAAS,IAAI,OAAO;EAGtB,IAAI,aAAa;EACjB,IAAI,WAAW;EAEf,KAAK,IAAI,YAAY,GAAG,YAAY,KAAK,OAAO,aAAa;GAC3D,MAAM,UAAU,KAAK,OAAO;GAC5B,IAAI,eAAe;GAGnB,KAAK,MAAM,iBAAiB,UAC1B,IAAI,KAAK,IAAI,SAAS,aAAa,GAAG;IACpC,eAAe;IACf,WAAW;IACX;GACF;GAGF,IAAI,CAAC,cACH,KAAK,OAAO,gBAAgB;EAEhC;EAGA,KAAK,IAAI,IAAI,YAAY,IAAI,KAAK,OAAO,KACvC,KAAK,OAAO,KAAK,KAAA;EAGnB,KAAK,QAAQ;EACb,OAAO;CACT;CAEA,UAAU,OAA6B;EACrC,MAAM,WAAW,MAAM,KAAK,KAAK;EACjC,IAAI,aAAa;EACjB,IAAI,WAAW;EAEf,KAAK,IAAI,YAAY,GAAG,YAAY,KAAK,OAAO,aAAa;GAC3D,MAAM,UAAU,KAAK,OAAO;GAC5B,IAAI,eAAe;GAGnB,KAAK,MAAM,iBAAiB,UAC1B,IAAI,KAAK,IAAI,SAAS,aAAa,GAAG;IACpC,eAAe;IACf;GACF;GAGF,IAAI,cACF,KAAK,OAAO,gBAAgB;QAE5B,WAAW;EAEf;EAGA,KAAK,IAAI,IAAI,YAAY,IAAI,KAAK,OAAO,KACvC,KAAK,OAAO,KAAK,KAAA;EAGnB,KAAK,QAAQ;EACb,OAAO;CACT;CAEA,QAAc;EAEZ,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,KAC9B,KAAK,OAAO,KAAK,KAAA;EAEnB,KAAK,QAAQ;CACf;CAMA,KAAK,UAAsB,gBAAsB;EAE/C,MAAM,QAAQ,KAAK,OAAO,MAAM,GAAG,KAAK,KAAK;EAC7C,MAAM,KAAK,OAAO;EAClB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,KAC9B,KAAK,OAAO,KAAK,MAAM;CAE3B;CAEA,UAAgB;EACd,IAAI,OAAO;EACX,IAAI,QAAQ,KAAK,QAAQ;EACzB,OAAO,OAAO,OAAO;GACnB,MAAM,OAAO,KAAK,OAAO;GACzB,KAAK,OAAO,QAAQ,KAAK,OAAO;GAChC,KAAK,OAAO,SAAS;GACrB;GACA;EACF;CACF;CAMA,QAAW;EACT,IAAI,KAAK,SACP,MAAM,IAAI,MAAM,eAAe;EAEjC,OAAO,KAAK,OAAO;CACrB;CAEA,OAAU;EACR,IAAI,KAAK,SACP,MAAM,IAAI,MAAM,eAAe;EAEjC,OAAO,KAAK,OAAO,KAAK,QAAQ;CAClC;CAEA,QAAQ,WAAmB,SAA0B;EACnD,KAAK,WAAW,WAAW,OAAO;EAElC,MAAM,MAAM,IAAI,UAAa,EAAE,IAAI,KAAK,IAAI,CAAC;EAC7C,KAAK,IAAI,IAAI,WAAW,IAAI,SAAS,KACnC,IAAI,IAAI,KAAK,OAAO,EAAG;EAEzB,OAAO;CACT;CAMA,EAAE,OAAO,YAAyB;EAChC,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,KAC9B,MAAM,KAAK,OAAO;CAEtB;CAEA,QAAQ,QAAmD;EACzD,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,KAC9B,OAAO,KAAK,OAAO,IAAK,CAAC;CAE7B;CAEA,UAAe;EACb,OAAO,KAAK,OAAO,MAAM,GAAG,KAAK,KAAK;CACxC;;;;CASA,eAAe,aAA2B;EACxC,IAAI,eAAe,KAAK,OAAO,QAAQ;EAGvC,MAAM,cAAc,KAAK,IACvB,aACA,KAAK,MAAM,KAAK,OAAO,SAAS,GAAG,IAAI,CACzC;EAEA,MAAM,WAAW,IAAI,MAAM,WAAW;EACtC,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,OAAO,KAC9B,SAAS,KAAK,KAAK,OAAO;EAE5B,KAAK,SAAS;CAChB;;;;CAKA,aAAmB;EACjB,IAAI,KAAK,QAAQ,KAAK,OAAO,QAC3B,KAAK,SAAS,KAAK,OAAO,MAAM,GAAG,KAAK,KAAK;CAEjD;CAMA,WAAmB,OAAqB;EACtC,IAAI,QAAQ,KAAK,SAAS,KAAK,OAC7B,MAAM,IAAI,WACR,SAAS,MAAM,0BAA0B,KAAK,OAChD;CAEJ;CAEA,iBAAyB,OAAqB;EAC5C,IAAI,QAAQ,KAAK,QAAQ,KAAK,OAC5B,MAAM,IAAI,WACR,SAAS,MAAM,kCAAkC,KAAK,MAAM,EAC9D;CAEJ;CAEA,WAAmB,WAAmB,SAAuB;EAC3D,IAAI,YAAY,KAAK,UAAU,KAAK,SAAS,YAAY,SACvD,MAAM,IAAI,WACR,kBAAkB,UAAU,IAAI,QAAQ,aAAa,KAAK,OAC5D;CAEJ;AACF;;;;;;;;;AAUA,SAAgB,UACd,mBACc;CAEd,IAAI,qBAAqB,OAAO,YAAY,mBAAmB;EAC7D,MAAM,OAAO,IAAI,UAAa;EAC9B,KAAK,OAAO,iBAAgC;EAC5C,OAAO;CACT;CAGA,OAAO,IADU,UAAa,iBACpB;AACZ;;;;;;;;;;AC7bA,IAAa,aAAb,MAAa,WAAkC;CAC7C;CACA;CACA;CACA;CAEA,YAAY,UAAgC,CAAC,GAAG;EAC9C,MAAM,EAAE,kBAAkB,IAAI,KAAK,cAAc;EAEjD,MAAM,WAAW,KAAK,eAAe,KAAK,IAAI,GAAG,eAAe,CAAC;EACjE,KAAK,YAAY,IAAI,MAAM,QAAQ;EACnC,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,MAAM;CACb;CAMA,IAAI,OAAe;EAEjB,OAAQ,KAAK,QAAQ,KAAK,QAAU,KAAK,UAAU,SAAS;CAC9D;CAEA,IAAI,UAAmB;EACrB,OAAO,KAAK,UAAU,KAAK;CAC7B;CAEA,IAAI,KAAY;EACd,OAAO,KAAK;CACd;CAMA,SAAS,SAAkB;EACzB,KAAK,QAAS,KAAK,QAAQ,IAAM,KAAK,UAAU,SAAS;EACzD,KAAK,UAAU,KAAK,SAAS;EAC7B,IAAI,KAAK,UAAU,KAAK,OACtB,KAAK,KAAK;CAEd;CAEA,WAAW,SAAqB;EAC9B,KAAK,SAAS,OAAO;EACrB,OAAO;CACT;CAEA,cAAiB;EACf,IAAI,KAAK,SACP,MAAM,IAAI,MAAM,gBAAgB;EAElC,OAAO,KAAK,UAAU;CACxB;CAEA,YAA2B;EACzB,IAAI,KAAK,SACP;EAEF,MAAM,UAAU,KAAK,UAAU,KAAK;EACpC,KAAK,UAAU,KAAK,SAAS,KAAA;EAC7B,KAAK,QAAS,KAAK,QAAQ,IAAM,KAAK,UAAU,SAAS;EACzD,OAAO;CACT;CAEA,YAAe;EACb,IAAI,KAAK,SACP,MAAM,IAAI,MAAM,gBAAgB;EAElC,OAAO,KAAK,UAAU,KAAK;CAC7B;CAEA,uBAAsC;EACpC,OAAO,KAAK,UAAU,KAAA,IAAY,KAAK,UAAU,KAAK;CACxD;CAMA,QAAQ,SAAkB;EACxB,KAAK,UAAU,KAAK,SAAS;EAC7B,KAAK,QAAS,KAAK,QAAQ,IAAM,KAAK,UAAU,SAAS;EACzD,IAAI,KAAK,UAAU,KAAK,OACtB,KAAK,KAAK;CAEd;CAEA,UAAU,SAAqB;EAC7B,KAAK,QAAQ,OAAO;EACpB,OAAO;CACT;CAEA,aAAgB;EACd,IAAI,KAAK,SACP,MAAM,IAAI,MAAM,gBAAgB;EAElC,OAAO,KAAK,SAAS;CACvB;CAEA,WAA0B;EACxB,IAAI,KAAK,SACP;EAEF,KAAK,QAAS,KAAK,QAAQ,IAAM,KAAK,UAAU,SAAS;EACzD,MAAM,UAAU,KAAK,UAAU,KAAK;EACpC,KAAK,UAAU,KAAK,SAAS,KAAA;EAC7B,OAAO;CACT;CAEA,WAAc;EACZ,IAAI,KAAK,SACP,MAAM,IAAI,MAAM,gBAAgB;EAElC,MAAM,YAAa,KAAK,QAAQ,IAAM,KAAK,UAAU,SAAS;EAC9D,OAAO,KAAK,UAAU;CACxB;CAEA,sBAAqC;EACnC,IAAI,KAAK,SACP;EAEF,MAAM,YAAa,KAAK,QAAQ,IAAM,KAAK,UAAU,SAAS;EAC9D,OAAO,KAAK,UAAU;CACxB;CASA,KAAK,SAAkB;EACrB,KAAK,QAAQ,OAAO;CACtB;CAEA,MAAS;EACP,OAAO,KAAK,WAAW;CACzB;CAMA,MAAM,SAAqB;EACzB,OAAO,KAAK,UAAU,OAAO;CAC/B;CAEA,OAAU;EACR,OAAO,KAAK,YAAY;CAC1B;CAEA,OAAU;EACR,OAAO,KAAK,UAAU;CACxB;CAEA,kBAAiC;EAC/B,OAAO,KAAK,qBAAqB;CACnC;CAEA,kBAAiC;EAC/B,OAAO,KAAK,UAAU;CACxB;CAEA,QAAQ,SAAqB;EAC3B,OAAO,KAAK,MAAM,OAAO;CAC3B;CAEA,UAAa;EACX,OAAO,KAAK,KAAK;CACnB;CAMA,IAAI,SAAqB;EACvB,KAAK,QAAQ,OAAO;EACpB,OAAO;CACT;CAEA,OAAO,OAA6B;EAClC,IAAI,WAAW;EACf,KAAK,MAAM,WAAW,OAAO;GAC3B,KAAK,QAAQ,OAAO;GACpB,WAAW;EACb;EACA,OAAO;CACT;CAEA,SAAS,SAAqB;EAC5B,KAAK,MAAM,QAAQ,MACjB,IAAI,KAAK,IAAI,MAAM,OAAO,GACxB,OAAO;EAGX,OAAO;CACT;CAEA,YAAY,OAA6B;EACvC,KAAK,MAAM,WAAW,OACpB,IAAI,CAAC,KAAK,SAAS,OAAO,GACxB,OAAO;EAGX,OAAO;CACT;CAEA,OAAO,SAAqB;EAE1B,MAAM,OAAO,KAAK,UAAU,SAAS;EACrC,MAAM,OAAO,KAAK;EAClB,KAAK,IAAI,SAAS,GAAG,SAAS,MAAM,UAClC,IAAI,KAAK,IAAI,KAAK,UAAW,KAAK,QAAQ,SAAU,OAAQ,OAAO,GAAG;GACpE,KAAK,eAAe,MAAM;GAC1B,OAAO;EACT;EAEF,OAAO;CACT;;;;;CAMA,eAAuB,QAAsB;EAC3C,MAAM,OAAO,KAAK,UAAU,SAAS;EACrC,MAAM,OAAO,KAAK;EAClB,IAAI,SAAS,OAAO,GAAG;GAErB,KAAK,IAAI,IAAI,QAAQ,IAAI,GAAG,KAC1B,KAAK,UAAW,KAAK,QAAQ,IAAK,QAAQ,KAAK,UAAW,KAAK,QAAQ,IAAI,IAAK;GAElF,KAAK,UAAU,KAAK,SAAS,KAAA;GAC7B,KAAK,QAAS,KAAK,QAAQ,IAAK;EAClC,OAAO;GAEL,KAAK,IAAI,IAAI,QAAQ,IAAI,OAAO,GAAG,KACjC,KAAK,UAAW,KAAK,QAAQ,IAAK,QAAQ,KAAK,UAAW,KAAK,QAAQ,IAAI,IAAK;GAElF,KAAK,QAAS,KAAK,QAAQ,IAAK;GAChC,KAAK,UAAU,KAAK,SAAS,KAAA;EAC/B;CACF;CAGA,UAAU,OAA6B;EACrC,MAAM,2BAAW,IAAI,IAAO;EAC5B,KAAK,MAAM,WAAW,OACpB,SAAS,IAAI,OAAO;EAGtB,IAAI,WAAW;EACf,KAAK,MAAM,WAAW,UACpB,OAAO,KAAK,OAAO,OAAO,GACxB,WAAW;EAGf,OAAO;CACT;CAEA,UAAU,OAA6B;EACrC,MAAM,WAAW,IAAI,IAAI,KAAK;EAC9B,MAAM,WAAW,IAAI,WAAc,EAAE,IAAI,KAAK,IAAI,CAAC;EAEnD,KAAK,MAAM,WAAW,MAAM;GAC1B,IAAI,eAAe;GACnB,KAAK,MAAM,iBAAiB,UAC1B,IAAI,KAAK,IAAI,SAAS,aAAa,GAAG;IACpC,eAAe;IACf;GACF;GAEF,IAAI,cACF,SAAS,QAAQ,OAAO;EAE5B;EAEA,MAAM,WAAW,SAAS,SAAS,KAAK;EACxC,KAAK,YAAY,SAAS;EAC1B,KAAK,QAAQ,SAAS;EACtB,KAAK,QAAQ,SAAS;EAEtB,OAAO;CACT;CAEA,QAAc;EAEZ,IAAI,QAAQ,KAAK;EACjB,OAAO,UAAU,KAAK,OAAO;GAC3B,KAAK,UAAU,SAAS,KAAA;GACxB,QAAS,QAAQ,IAAM,KAAK,UAAU,SAAS;EACjD;EACA,KAAK,QAAQ;EACb,KAAK,QAAQ;CACf;CAMA,EAAE,OAAO,YAAyB;EAChC,IAAI,QAAQ,KAAK;EACjB,OAAO,UAAU,KAAK,OAAO;GAC3B,MAAM,KAAK,UAAU;GACrB,QAAS,QAAQ,IAAM,KAAK,UAAU,SAAS;EACjD;CACF;CAEA,QAAQ,QAAmD;EACzD,IAAI,aAAa,KAAK;EACtB,IAAI,eAAe;EACnB,OAAO,eAAe,KAAK,OAAO;GAChC,OAAO,KAAK,UAAU,aAAc,YAAY;GAChD,aAAc,aAAa,IAAM,KAAK,UAAU,SAAS;GACzD;EACF;CACF;CAEA,UAAe;EACb,MAAM,SAAc,CAAC;EACrB,KAAK,MAAM,WAAW,MACpB,OAAO,KAAK,OAAO;EAErB,OAAO;CACT;;;;CASA,OAAqB;EACnB,MAAM,cAAc,KAAK,UAAU;EACnC,MAAM,cAAc,eAAe;EAEnC,IAAI,cAAc,GAChB,MAAM,IAAI,MAAM,iBAAiB;EAGnC,MAAM,cAAc,IAAI,MAAM,WAAW;EAGzC,MAAM,YAAY,cAAc,KAAK;EACrC,KAAK,IAAI,IAAI,GAAG,IAAI,WAAW,KAC7B,YAAY,KAAK,KAAK,UAAU,KAAK,QAAQ;EAI/C,MAAM,WAAW,KAAK;EACtB,KAAK,IAAI,IAAI,GAAG,IAAI,UAAU,KAC5B,YAAY,YAAY,KAAK,KAAK,UAAU;EAK9C,KAAK,YAAY;EACjB,KAAK,QAAQ;EACb,KAAK,QAAQ;CACf;;;;CAKA,eAAuB,GAAmB;EACxC,IAAI,KAAK,GAAG,OAAO;EACnB;EACA,KAAK,KAAK;EACV,KAAK,KAAK;EACV,KAAK,KAAK;EACV,KAAK,KAAK;EACV,KAAK,KAAK;EACV,OAAO,IAAI;CACb;;;;CASA,IAAI,WAAmB;EACrB,OAAO,KAAK,UAAU;CACxB;;;;CAKA,WAAmB;EACjB,OAAO,cAAc,KAAK,QAAQ,CAAC,CAAC,KAAK,IAAI,EAAE;CACjD;AACF;;;;;;;;;AAUA,SAAgB,WACd,mBACe;CAEf,IAAI,qBAAqB,OAAO,YAAY,mBAAmB;EAC7D,MAAM,QAAQ,IAAI,WAAc;EAChC,MAAM,OAAO,iBAAgC;EAC7C,OAAO;CACT;CAEA,OAAO,IAAI,WAAc,iBAAyC;AACpE;;;;;;;;;;AC/XA,IAAa,UAAb,MAAoD;CAClD;CACA;CACA;CACA;CACA;CACA;CACA;;;;;;CAMA,YAAoB;CAEpB,YAAY,UAAgC,CAAC,GAAG;EAC9C,MAAM,EACJ,kBAAkB,IAClB,aAAa,KACb,QAAQ,WACR,UAAU,aACV,UAAU,cACR;EAEJ,MAAM,WAAW,KAAK,eAAe,KAAK,IAAI,GAAG,eAAe,CAAC;EACjE,KAAK,WAAW,IAAI,MAAM,QAAQ,CAAC,CAAC,KAAK,IAAI;EAC7C,KAAK,QAAQ;EACb,KAAK,cAAc;EACnB,KAAK,SAAS;EACd,KAAK,WAAW;EAChB,KAAK,WAAW;EAChB,KAAK,aAAa,KAAK,MAAM,WAAW,UAAU;CACpD;CAMA,IAAI,OAAe;EACjB,OAAO,KAAK;CACd;CAEA,IAAI,UAAmB;EACrB,OAAO,KAAK,UAAU;CACxB;CAEA,IAAI,QAAe;EACjB,OAAO,KAAK;CACd;CAEA,IAAI,UAAiB;EACnB,OAAO,KAAK;CACd;CAMA,IAAI,KAAiB;EACnB,MAAM,OAAO,KAAK,SAAS,GAAG;EAC9B,MAAM,QAAQ,KAAK,YAAY,IAAI;EACnC,IAAI,OAAO,KAAK,SAAS,UAAU;EAEnC,OAAO,SAAS,MAAM;GACpB,IAAI,KAAK,SAAS,QAAQ,KAAK,OAAO,KAAK,KAAK,GAAG,GACjD,OAAO;GAET,OAAO,KAAK;EACd;EAEA,OAAO;CACT;CAEA,IAAI,KAAW;EACb,MAAM,QAAQ,KAAK,eAAe,GAAG;EACrC,IAAI,UAAU,KAAA,GACZ,MAAM,IAAI,MAAM,kBAAkB,KAAK;EAEzC,OAAO;CACT;CAEA,eAAe,KAAuB;EACpC,MAAM,OAAO,KAAK,SAAS,GAAG;EAC9B,MAAM,QAAQ,KAAK,YAAY,IAAI;EACnC,IAAI,OAAO,KAAK,SAAS,UAAU;EAEnC,OAAO,SAAS,MAAM;GACpB,IAAI,KAAK,SAAS,QAAQ,KAAK,OAAO,KAAK,KAAK,GAAG,GACjD,OAAO,KAAK;GAEd,OAAO,KAAK;EACd;CAGF;CAEA,aAAa,KAAQ,cAAoB;EACvC,MAAM,QAAQ,KAAK,eAAe,GAAG;EACrC,OAAO,UAAU,KAAA,IAAY,QAAQ;CACvC;CAEA,cAAc,OAAmB;EAC/B,KAAK,MAAM,UAAU,KAAK,UAAU;GAClC,IAAI,OAAO;GACX,OAAO,SAAS,MAAM;IACpB,IAAI,KAAK,SAAS,KAAK,OAAO,KAAK,GACjC,OAAO;IAET,OAAO,KAAK;GACd;EACF;EACA,OAAO;CACT;CAMA,IAAI,KAAQ,OAAyB;EACnC,MAAM,OAAO,KAAK,SAAS,GAAG;EAC9B,MAAM,QAAQ,KAAK,YAAY,IAAI;EACnC,IAAI,OAAO,KAAK,SAAS,UAAU;EAGnC,OAAO,SAAS,MAAM;GACpB,IAAI,KAAK,SAAS,QAAQ,KAAK,OAAO,KAAK,KAAK,GAAG,GAAG;IACpD,MAAM,WAAW,KAAK;IACtB,KAAK,QAAQ;IACb,OAAO;GACT;GACA,OAAO,KAAK;EACd;EAGA,MAAM,UAAsB;GAC1B;GACA;GACA;GACA,MAAM,KAAK,SAAS,UAAU;EAChC;EACA,KAAK,SAAS,SAAS;EACvB,KAAK;EACL,KAAK;EAGL,IAAI,KAAK,QAAQ,KAAK,YACpB,KAAK,OAAO;CAIhB;CAEA,YAAY,KAAQ,OAAa;EAC/B,MAAM,WAAW,KAAK,eAAe,GAAG;EACxC,IAAI,aAAa,KAAA,GACf,OAAO;EAET,KAAK,IAAI,KAAK,KAAK;EACnB,OAAO;CACT;CAEA,OAAO,KAAuB;EAC5B,MAAM,OAAO,KAAK,SAAS,GAAG;EAC9B,MAAM,QAAQ,KAAK,YAAY,IAAI;EACnC,IAAI,OAAO,KAAK,SAAS,UAAU;EACnC,IAAI,OAA0B;EAE9B,OAAO,SAAS,MAAM;GACpB,IAAI,KAAK,SAAS,QAAQ,KAAK,OAAO,KAAK,KAAK,GAAG,GAAG;IAEpD,IAAI,SAAS,MAEX,KAAK,SAAS,SAAS,KAAK;SAG5B,KAAK,OAAO,KAAK;IAEnB,KAAK;IACL,KAAK;IACL,OAAO,KAAK;GACd;GACA,OAAO;GACP,OAAO,KAAK;EACd;CAGF;CAEA,YAAY,KAAQ,OAAmB;EACrC,MAAM,OAAO,KAAK,SAAS,GAAG;EAC9B,MAAM,QAAQ,KAAK,YAAY,IAAI;EACnC,IAAI,OAAO,KAAK,SAAS,UAAU;EACnC,IAAI,OAA0B;EAE9B,OAAO,SAAS,MAAM;GACpB,IACE,KAAK,SAAS,QACd,KAAK,OAAO,KAAK,KAAK,GAAG,KACzB,KAAK,SAAS,KAAK,OAAO,KAAK,GAC/B;IAEA,IAAI,SAAS,MACX,KAAK,SAAS,SAAS,KAAK;SAE5B,KAAK,OAAO,KAAK;IAEnB,KAAK;IACL,KAAK;IACL,OAAO;GACT;GACA,OAAO;GACP,OAAO,KAAK;EACd;EAEA,OAAO;CACT;CAEA,QAAQ,KAAQ,OAAyB;EACvC,MAAM,OAAO,KAAK,SAAS,GAAG;EAC9B,MAAM,QAAQ,KAAK,YAAY,IAAI;EACnC,IAAI,OAAO,KAAK,SAAS,UAAU;EAEnC,OAAO,SAAS,MAAM;GACpB,IAAI,KAAK,SAAS,QAAQ,KAAK,OAAO,KAAK,KAAK,GAAG,GAAG;IACpD,MAAM,WAAW,KAAK;IACtB,KAAK,QAAQ;IACb,OAAO;GACT;GACA,OAAO,KAAK;EACd;CAGF;CAEA,aAAa,KAAQ,UAAa,UAAsB;EACtD,MAAM,OAAO,KAAK,SAAS,GAAG;EAC9B,MAAM,QAAQ,KAAK,YAAY,IAAI;EACnC,IAAI,OAAO,KAAK,SAAS,UAAU;EAEnC,OAAO,SAAS,MAAM;GACpB,IACE,KAAK,SAAS,QACd,KAAK,OAAO,KAAK,KAAK,GAAG,KACzB,KAAK,SAAS,KAAK,OAAO,QAAQ,GAClC;IACA,KAAK,QAAQ;IACb,OAAO;GACT;GACA,OAAO,KAAK;EACd;EAEA,OAAO;CACT;CAMA,gBAAgB,KAAQ,iBAAmC;EACzD,MAAM,WAAW,KAAK,eAAe,GAAG;EACxC,IAAI,aAAa,KAAA,GACf,OAAO;EAGT,MAAM,WAAW,gBAAgB,GAAG;EACpC,KAAK,IAAI,KAAK,QAAQ;EACtB,OAAO;CACT;CAEA,iBACE,KACA,mBACe;EACf,MAAM,WAAW,KAAK,eAAe,GAAG;EACxC,IAAI,aAAa,KAAA,GACf;EAGF,MAAM,WAAW,kBAAkB,KAAK,QAAQ;EAChD,IAAI,aAAa,KAAA,GAAW;GAC1B,KAAK,OAAO,GAAG;GACf;EACF;EAEA,KAAK,IAAI,KAAK,QAAQ;EACtB,OAAO;CACT;CAEA,QACE,KACA,mBACe;EACf,MAAM,WAAW,KAAK,eAAe,GAAG;EACxC,MAAM,WAAW,kBAAkB,KAAK,QAAQ;EAEhD,IAAI,aAAa,KAAA,GAAW;GAC1B,IAAI,aAAa,KAAA,GACf,KAAK,OAAO,GAAG;GAEjB;EACF;EAEA,KAAK,IAAI,KAAK,QAAQ;EACtB,OAAO;CACT;CAEA,MACE,KACA,OACA,mBACe;EACf,MAAM,WAAW,KAAK,eAAe,GAAG;EAExC,IAAI,aAAa,KAAA,GAAW;GAC1B,KAAK,IAAI,KAAK,KAAK;GACnB,OAAO;EACT;EAEA,MAAM,SAAS,kBAAkB,UAAU,KAAK;EAChD,IAAI,WAAW,KAAA,GAAW;GACxB,KAAK,OAAO,GAAG;GACf;EACF;EAEA,KAAK,IAAI,KAAK,MAAM;EACpB,OAAO;CACT;CAMA,OAAO,OAAoD;EACzD,KAAK,MAAM,SAAS,OAClB,KAAK,IAAI,MAAM,KAAK,MAAM,KAAK;CAEnC;CAEA,QAAc;EACZ,KAAK,SAAS,KAAK,IAAI;EACvB,KAAK,QAAQ;EACb,KAAK;CACP;CAMA,CAAC,OAA4B;EAC3B,MAAM,WAAW,KAAK;EACtB,KAAK,MAAM,UAAU,KAAK,UAAU;GAClC,IAAI,OAAO;GACX,OAAO,SAAS,MAAM;IACpB,MAAM,KAAK;IACX,KAAK,eAAe,QAAQ;IAC5B,OAAO,KAAK;GACd;EACF;CACF;CAEA,CAAC,SAA8B;EAC7B,MAAM,WAAW,KAAK;EACtB,KAAK,MAAM,UAAU,KAAK,UAAU;GAClC,IAAI,OAAO;GACX,OAAO,SAAS,MAAM;IACpB,MAAM,KAAK;IACX,KAAK,eAAe,QAAQ;IAC5B,OAAO,KAAK;GACd;EACF;CACF;CAEA,CAAC,UAAyC;EACxC,MAAM,WAAW,KAAK;EACtB,KAAK,MAAM,UAAU,KAAK,UAAU;GAClC,IAAI,OAAO;GACX,OAAO,SAAS,MAAM;IACpB,MAAM;KAAE,KAAK,KAAK;KAAK,OAAO,KAAK;IAAM;IACzC,KAAK,eAAe,QAAQ;IAC5B,OAAO,KAAK;GACd;EACF;CACF;CAMA,EAAE,OAAO,YAAmC;EAC1C,OAAO,KAAK,QAAQ;CACtB;CAEA,QAAQ,QAAqD;EAC3D,KAAK,MAAM,SAAS,KAAK,QAAQ,GAC/B,OAAO,MAAM,OAAO,MAAM,KAAK,IAAI;CAEvC;;CAOA,eAAuB,UAAwB;EAC7C,IAAI,KAAK,cAAc,UACrB,MAAM,IAAI,MAAM,kCAAkC;CAEtD;;;;CAKA,YAAoB,MAAsB;EAGxC,OAAO,OAAQ,KAAK,SAAS,SAAS;CACxC;;;;CAKA,SAAuB;EACrB,MAAM,aAAa,KAAK;EACxB,MAAM,cAAc,WAAW,UAAU;EAEzC,IAAI,cAAc,GAChB,MAAM,IAAI,MAAM,eAAe;EAGjC,KAAK,WAAW,IAAI,MAAM,WAAW,CAAC,CAAC,KAAK,IAAI;EAChD,KAAK,aAAa,KAAK,MAAM,cAAc,KAAK,WAAW;EAC3D,KAAK;EAGL,KAAK,MAAM,UAAU,YAAY;GAC/B,IAAI,OAAO;GACX,OAAO,SAAS,MAAM;IACpB,MAAM,OAAO,KAAK;IAClB,MAAM,QAAQ,KAAK,YAAY,KAAK,IAAI;IACxC,KAAK,OAAO,KAAK,SAAS,UAAU;IACpC,KAAK,SAAS,SAAS;IACvB,OAAO;GACT;EACF;CACF;;;;CAKA,eAAuB,GAAmB;EACxC,IAAI,KAAK,GAAG,OAAO;EACnB;EACA,KAAK,KAAK;EACV,KAAK,KAAK;EACV,KAAK,KAAK;EACV,KAAK,KAAK;EACV,KAAK,KAAK;EACV,OAAO,IAAI;CACb;;;;CASA,IAAI,WAAmB;EACrB,OAAO,KAAK,SAAS;CACvB;;;;CAKA,IAAI,aAAqB;EACvB,OAAO,KAAK,QAAQ,KAAK,SAAS;CACpC;;;;CAKA,WAOE;EACA,IAAI,iBAAiB;EACrB,IAAI,mBAAmB;EACvB,IAAI,eAAe;EAEnB,KAAK,MAAM,UAAU,KAAK,UACxB,IAAI,WAAW,MACb;OACK;GACL,IAAI,SAAS;GACb,IAAI,OAA0B;GAC9B,OAAO,SAAS,MAAM;IACpB;IACA,OAAO,KAAK;GACd;GACA,oBAAoB;GACpB,iBAAiB,KAAK,IAAI,gBAAgB,MAAM;EAClD;EAGF,OAAO;GACL,MAAM,KAAK;GACX,UAAU,KAAK,SAAS;GACxB,YAAY,KAAK;GACjB,gBAAgB,KAAK,QAAQ,IAAI,oBAAoB,KAAK,SAAS,SAAS,gBAAgB;GAC5F;GACA;EACF;CACF;AACF;;;;;;;;;;;;AAaA,SAAgB,QACd,kBACe;CAEf,IAAI,oBAAoB,OAAO,YAAY,kBAAkB;EAC3D,MAAM,MAAM,IAAI,QAAc;EAC9B,KAAK,MAAM,CAAC,KAAK,UAAU,kBACzB,IAAI,IAAI,KAAK,KAAK;EAEpB,OAAO;CACT;CAEA,OAAO,IAAI,QAAc,gBAAwC;AACnE;;;;;;;;AC9gBA,IAAa,gBAAb,MAA0D;CACxD;CACA,QAAwB;CACxB;CACA;CACA;CACA;CACA;CAGA,QAAyC;CACzC,QAAyC;CAEzC,YAAY,UAAsC,CAAC,GAAG;EACpD,MAAM,EACJ,kBAAkB,IAClB,aAAa,KACb,KAAK,WACL,OAAO,aACP,UAAU,WACV,cAAc,UACZ;EAEJ,KAAK,WAAW,IAAI,MAAM,KAAK,IAAI,GAAG,eAAe,CAAC,CAAC,CAAC,KAAK,IAAI;EACjE,KAAK,cAAc;EACnB,KAAK,MAAM;EACX,KAAK,QAAQ;EACb,KAAK,WAAW;EAChB,KAAK,eAAe;CACtB;CAMA,IAAI,OAAe;EACjB,OAAO,KAAK;CACd;CAEA,IAAI,UAAmB;EACrB,OAAO,KAAK,UAAU;CACxB;CAEA,IAAI,KAAY;EACd,OAAO,KAAK;CACd;CAEA,IAAI,QAAe;EACjB,OAAO,KAAK;CACd;CAEA,IAAI,UAAiB;EACnB,OAAO,KAAK;CACd;CAEA,IAAI,OAAgB;EAClB,OAAO,KAAK;CACd;CAMA,IAAI,KAAiB;EACnB,OAAO,KAAK,QAAQ,GAAG,MAAM;CAC/B;CAEA,YAAY,KAAiB;EAC3B,OAAO,KAAK,IAAI,GAAG;CACrB;CAEA,cAAc,OAAmB;EAC/B,IAAI,OAAO,KAAK;EAChB,OAAO,SAAS,MAAM;GACpB,IAAI,KAAK,SAAS,KAAK,OAAO,KAAK,GACjC,OAAO;GAET,OAAO,KAAK;EACd;EACA,OAAO;CACT;CAEA,IAAI,KAAW;EACb,MAAM,OAAO,KAAK,QAAQ,GAAG;EAC7B,IAAI,SAAS,MACX,MAAM,IAAI,MAAM,eAAe;EAEjC,IAAI,KAAK,cACP,KAAK,UAAU,IAAI;EAErB,OAAO,KAAK;CACd;CAEA,eAAe,KAAuB;EACpC,MAAM,OAAO,KAAK,QAAQ,GAAG;EAC7B,IAAI,SAAS,MAAM,OAAO,KAAA;EAC1B,IAAI,KAAK,cACP,KAAK,UAAU,IAAI;EAErB,OAAO,KAAK;CACd;CAEA,aAAa,KAAQ,cAAoB;EACvC,MAAM,OAAO,KAAK,QAAQ,GAAG;EAC7B,IAAI,SAAS,MAAM,OAAO;EAC1B,IAAI,KAAK,cACP,KAAK,UAAU,IAAI;EAErB,OAAO,KAAK;CACd;CAMA,IAAI,KAAQ,OAAyB;EACnC,MAAM,WAAW,KAAK,MAAM,GAAG;EAC/B,MAAM,QAAQ,KAAK,eAAe,QAAQ;EAC1C,IAAI,OAAO,KAAK,SAAS,UAAU;EAGnC,OAAO,SAAS,MAAM;GACpB,IAAI,KAAK,SAAS,YAAY,KAAK,IAAI,KAAK,KAAK,GAAG,GAAG;IACrD,MAAM,WAAW,KAAK;IACtB,KAAK,QAAQ;IACb,IAAI,KAAK,cACP,KAAK,UAAU,IAAI;IAErB,OAAO;GACT;GACA,OAAO,KAAK;EACd;EAGA,MAAM,UAA4B;GAChC;GACA;GACA,MAAM;GACN,MAAM,KAAK,SAAS,UAAU;GAC9B,QAAQ;GACR,OAAO;EACT;EAEA,KAAK,SAAS,SAAS;EACvB,KAAK;EAGL,KAAK,SAAS,OAAO;EAGrB,IAAI,KAAK,QAAQ,KAAK,SAAS,SAAS,KAAK,aAC3C,KAAK,OAAO;CAIhB;CAEA,YAAY,KAAQ,OAAa;EAC/B,MAAM,WAAW,KAAK,QAAQ,GAAG;EACjC,IAAI,aAAa,MAAM;GACrB,IAAI,KAAK,cACP,KAAK,UAAU,QAAQ;GAEzB,OAAO,SAAS;EAClB;EACA,KAAK,IAAI,KAAK,KAAK;EACnB,OAAO;CACT;CAEA,QAAQ,KAAQ,OAAyB;EACvC,MAAM,OAAO,KAAK,QAAQ,GAAG;EAC7B,IAAI,SAAS,MAAM,OAAO,KAAA;EAC1B,MAAM,WAAW,KAAK;EACtB,KAAK,QAAQ;EACb,IAAI,KAAK,cACP,KAAK,UAAU,IAAI;EAErB,OAAO;CACT;CAEA,aAAa,KAAQ,UAAa,UAAsB;EACtD,MAAM,OAAO,KAAK,QAAQ,GAAG;EAC7B,IAAI,SAAS,QAAQ,CAAC,KAAK,SAAS,KAAK,OAAO,QAAQ,GACtD,OAAO;EAET,KAAK,QAAQ;EACb,IAAI,KAAK,cACP,KAAK,UAAU,IAAI;EAErB,OAAO;CACT;CAEA,OAAO,KAAuB;EAC5B,MAAM,OAAO,KAAK,QAAQ,GAAG;EAC7B,IAAI,SAAS,MAAM,OAAO,KAAA;EAE1B,MAAM,WAAW,KAAK;EAGtB,KAAK,iBAAiB,IAAI;EAG1B,KAAK,eAAe,IAAI;EAExB,KAAK;EACL,OAAO;CACT;CAEA,YAAY,KAAQ,OAAmB;EACrC,MAAM,OAAO,KAAK,QAAQ,GAAG;EAC7B,IAAI,SAAS,QAAQ,CAAC,KAAK,SAAS,KAAK,OAAO,KAAK,GACnD,OAAO;EAIT,KAAK,iBAAiB,IAAI;EAG1B,KAAK,eAAe,IAAI;EAExB,KAAK;EACL,OAAO;CACT;CAEA,QAAc;EACZ,KAAK,WAAW,IAAI,MAAM,KAAK,SAAS,MAAM,CAAC,CAAC,KAAK,IAAI;EACzD,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;CACf;CAMA,OAAO,OAAoD;EACzD,IAAI,aAAa,SAAS,OAAO,MAAM,YAAY,YACjD,KAAK,MAAM,SAAS,MAAM,QAAQ,GAChC,KAAK,IAAI,MAAM,KAAK,MAAM,KAAK;OAGjC,KAAK,MAAM,SAAS,OAClB,KAAK,IAAI,MAAM,KAAK,MAAM,KAAK;CAGrC;CAMA,gBAAgB,KAAQ,iBAAmC;EACzD,MAAM,WAAW,KAAK,QAAQ,GAAG;EACjC,IAAI,aAAa,MAAM;GACrB,IAAI,KAAK,cACP,KAAK,UAAU,QAAQ;GAEzB,OAAO,SAAS;EAClB;EACA,MAAM,QAAQ,gBAAgB,GAAG;EACjC,KAAK,IAAI,KAAK,KAAK;EACnB,OAAO;CACT;CAEA,iBAAiB,KAAQ,mBAAuE;EAC9F,MAAM,WAAW,KAAK,QAAQ,GAAG;EACjC,IAAI,aAAa,MAAM,OAAO,KAAA;EAE9B,MAAM,WAAW,kBAAkB,KAAK,SAAS,KAAK;EACtD,IAAI,aAAa,KAAA,GAAW;GAC1B,KAAK,OAAO,GAAG;GACf;EACF;EACA,SAAS,QAAQ;EACjB,IAAI,KAAK,cACP,KAAK,UAAU,QAAQ;EAEzB,OAAO;CACT;CAEA,QAAQ,KAAQ,mBAAmF;EACjG,MAAM,WAAW,KAAK,QAAQ,GAAG;EACjC,MAAM,WAAW,kBAAkB,KAAK,UAAU,KAAK;EAEvD,IAAI,aAAa,KAAA,GAAW;GAC1B,IAAI,aAAa,MACf,KAAK,OAAO,GAAG;GAEjB;EACF;EAEA,KAAK,IAAI,KAAK,QAAQ;EACtB,OAAO;CACT;CAEA,MAAM,KAAQ,OAAU,mBAA+E;EACrG,MAAM,WAAW,KAAK,QAAQ,GAAG;EAEjC,IAAI,aAAa,MAAM;GACrB,KAAK,IAAI,KAAK,KAAK;GACnB,OAAO;EACT;EAEA,MAAM,SAAS,kBAAkB,SAAS,OAAO,KAAK;EACtD,IAAI,WAAW,KAAA,GAAW;GACxB,KAAK,OAAO,GAAG;GACf;EACF;EAEA,SAAS,QAAQ;EACjB,IAAI,KAAK,cACP,KAAK,UAAU,QAAQ;EAEzB,OAAO;CACT;CAMA,CAAC,OAA4B;EAC3B,IAAI,OAAO,KAAK;EAChB,OAAO,SAAS,MAAM;GACpB,MAAM,KAAK;GACX,OAAO,KAAK;EACd;CACF;CAEA,CAAC,SAA8B;EAC7B,IAAI,OAAO,KAAK;EAChB,OAAO,SAAS,MAAM;GACpB,MAAM,KAAK;GACX,OAAO,KAAK;EACd;CACF;CAEA,CAAC,UAAyC;EACxC,IAAI,OAAO,KAAK;EAChB,OAAO,SAAS,MAAM;GACpB,MAAM;IAAE,KAAK,KAAK;IAAK,OAAO,KAAK;GAAM;GACzC,OAAO,KAAK;EACd;CACF;CAEA,EAAE,OAAO,YAAmC;EAC1C,OAAO,KAAK,QAAQ;CACtB;CAEA,QAAQ,QAAqD;EAC3D,KAAK,MAAM,SAAS,KAAK,QAAQ,GAC/B,OAAO,MAAM,OAAO,MAAM,KAAK,IAAI;CAEvC;CAEA,UAAyB;EACvB,OAAO,MAAM,KAAK,KAAK,QAAQ,CAAC;CAClC;CAMA,QAAgB,KAAiC;EAC/C,MAAM,WAAW,KAAK,MAAM,GAAG;EAC/B,MAAM,QAAQ,KAAK,eAAe,QAAQ;EAC1C,IAAI,OAAO,KAAK,SAAS,UAAU;EAEnC,OAAO,SAAS,MAAM;GACpB,IAAI,KAAK,SAAS,YAAY,KAAK,IAAI,KAAK,KAAK,GAAG,GAClD,OAAO;GAET,OAAO,KAAK;EACd;EAEA,OAAO;CACT;CAEA,eAAuB,UAA0B;EAC/C,OAAO,KAAK,IAAI,QAAQ,IAAI,KAAK,SAAS;CAC5C;CAEA,iBAAyB,MAA8B;EACrD,MAAM,QAAQ,KAAK,eAAe,KAAK,IAAI;EAC3C,IAAI,UAAU,KAAK,SAAS,UAAU;EACtC,IAAI,OAAgC;EAEpC,OAAO,YAAY,MAAM;GACvB,IAAI,YAAY,MAAM;IACpB,IAAI,SAAS,MACX,KAAK,SAAS,SAAS,QAAQ;SAE/B,KAAK,OAAO,QAAQ;IAEtB;GACF;GACA,OAAO;GACP,UAAU,QAAQ;EACpB;CACF;CAEA,SAAiB,MAA8B;EAC7C,KAAK,SAAS,KAAK;EACnB,KAAK,QAAQ;EACb,IAAI,KAAK,UAAU,MAAM,KAAK,QAAQ;OACjC,KAAK,MAAM,QAAQ;EACxB,KAAK,QAAQ;CACf;CAEA,eAAuB,MAA8B;EACnD,IAAI,KAAK,WAAW,MAAM,KAAK,OAAO,QAAQ,KAAK;OAC9C,KAAK,QAAQ,KAAK;EACvB,IAAI,KAAK,UAAU,MAAM,KAAK,MAAM,SAAS,KAAK;OAC7C,KAAK,QAAQ,KAAK;EACvB,KAAK,SAAS,KAAK,QAAQ;CAC7B;CAEA,UAAkB,MAA8B;EAC9C,IAAI,SAAS,KAAK,OAAO;EACzB,KAAK,eAAe,IAAI;EACxB,KAAK,SAAS,IAAI;CACpB;CAEA,SAAuB;EACrB,KAAK,WAAW,IAAI,MAAM,KAAK,SAAS,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI;EAE7D,KAAK,IAAI,OAAO,KAAK,OAAO,SAAS,MAAM,OAAO,KAAK,OAAO;GAC5D,MAAM,QAAQ,KAAK,eAAe,KAAK,IAAI;GAC3C,KAAK,OAAO,KAAK,SAAS,UAAU;GACpC,KAAK,SAAS,SAAS;EACzB;CACF;CAMA,WAAmB;EAIjB,OAAO,iBAHS,MAAM,KAAK,KAAK,QAAQ,CAAC,CAAC,CACvC,KAAK,EAAE,KAAK,YAAY,GAAG,IAAI,GAAG,OAAO,CAAC,CAC1C,KAAK,IACsB,EAAE;CAClC;AACF;;;;;;;;;;;;;;;;;;;;AAqBA,SAAgB,cACd,kBACqB;CACrB,IAAI,oBAAoB,OAAO,YAAY,kBAAkB;EAC3D,MAAM,MAAM,IAAI,cAAoB;EACpC,KAAK,MAAM,CAAC,KAAK,UAAU,kBACzB,IAAI,IAAI,KAAK,KAAK;EAEpB,OAAO;CACT;CAEA,OAAO,IAAI,cAAoB,gBAA8C;AAC/E;;;;;AC1hBA,MAAM,QAAQ;CACZ,KAAK;CACL,OAAO;AACT;AAgBA,SAAS,QAAc,MAAoC;CACzD,OAAO,SAAS,OAAO,MAAM,QAAQ,KAAK;AAC5C;AACA,SAAS,SAAe,MAAoD;CAC1E,OAAO,SAAS,OAAO,OAAO,KAAK;AACrC;AACA,SAAS,OAAa,MAAoD;CACxE,OAAO,SAAS,OAAO,OAAO,KAAK;AACrC;AACA,SAAS,QAAc,MAAoD;CACzE,OAAO,SAAS,OAAO,OAAO,KAAK;AACrC;AACA,SAAS,SAAe,MAA6B,OAAoB;CACvE,IAAI,SAAS,MAAM,KAAK,QAAQ;AAClC;;;;;;;AA+BA,IAAa,UAAb,MAAa,QAA4C;CACvD,QAAuC;CACvC,QAAwB;CACxB;CACA;CACA;CAEA,YAAY,UAAgC,CAAC,GAAG;EAC9C,MAAM,EACJ,UAAU,gBACV,KAAK,WACL,UAAU,cACR;EAEJ,KAAK,WAAW;EAChB,KAAK,MAAM;EACX,KAAK,WAAW;CAClB;CAMA,IAAI,OAAe;EACjB,OAAO,KAAK;CACd;CAEA,IAAI,UAAmB;EACrB,OAAO,KAAK,UAAU;CACxB;CAEA,IAAI,aAAyB;EAC3B,OAAO,KAAK;CACd;CAEA,IAAI,QAAe;EACjB,OAAO,KAAK;CACd;CAEA,IAAI,UAAiB;EACnB,OAAO,KAAK;CACd;CAMA,IAAI,KAAiB;EACnB,OAAO,KAAK,QAAQ,GAAG,MAAM;CAC/B;CAEA,YAAY,KAAiB;EAC3B,OAAO,KAAK,IAAI,GAAG;CACrB;CAEA,cAAc,OAAmB;EAC/B,OAAO,KAAK,UAAU,KAAK,OAAO,KAAK;CACzC;CAEA,IAAI,KAAW;EACb,MAAM,OAAO,KAAK,QAAQ,GAAG;EAC7B,IAAI,SAAS,MACX,MAAM,IAAI,MAAM,eAAe;EAEjC,OAAO,KAAK;CACd;CAEA,eAAe,KAAuB;EAEpC,OADa,KAAK,QAAQ,GAChB,CAAC,EAAE;CACf;CAEA,aAAa,KAAQ,cAAoB;EACvC,MAAM,OAAO,KAAK,QAAQ,GAAG;EAC7B,OAAO,SAAS,OAAO,KAAK,QAAQ;CACtC;CAMA,IAAI,KAAQ,OAAyB;EACnC,IAAI,KAAK,UAAU,MAAM;GACvB,KAAK,QAAQ,KAAK,WAAW,KAAK,OAAO,MAAM,KAAK;GACpD,KAAK;GACL;EACF;EAGA,IAAI,OAA8B,KAAK;EACvC,IAAI,SAAgC;EAEpC,OAAO,SAAS,MAAM;GACpB,SAAS;GACT,MAAM,MAAM,KAAK,SAAS,KAAK,KAAK,GAAG;GAEvC,IAAI,QAAQ,GAAG;IAEb,MAAM,WAAW,KAAK;IACtB,KAAK,QAAQ;IACb,OAAO;GACT,OAAO,IAAI,MAAM,GACf,OAAO,KAAK;QAEZ,OAAO,KAAK;EAEhB;EAGA,MAAM,UAAU,KAAK,WAAW,KAAK,OAAO,MAAM,GAAG;EACrD,QAAQ,SAAS;EAEjB,IAAI,WAAW,MAAM;GAEnB,IADY,KAAK,SAAS,KAAK,OAAO,GAChC,IAAI,GACR,OAAO,OAAO;QAEd,OAAO,QAAQ;EAEnB;EAEA,KAAK;EACL,KAAK,kBAAkB,OAAO;CAEhC;CAEA,YAAY,KAAQ,OAAa;EAC/B,MAAM,WAAW,KAAK,QAAQ,GAAG;EACjC,IAAI,aAAa,MACf,OAAO,SAAS;EAElB,KAAK,IAAI,KAAK,KAAK;EACnB,OAAO;CACT;CAEA,QAAQ,KAAQ,OAAyB;EACvC,MAAM,OAAO,KAAK,QAAQ,GAAG;EAC7B,IAAI,SAAS,MAAM,OAAO,KAAA;EAC1B,MAAM,WAAW,KAAK;EACtB,KAAK,QAAQ;EACb,OAAO;CACT;CAEA,aAAa,KAAQ,UAAa,UAAsB;EACtD,MAAM,OAAO,KAAK,QAAQ,GAAG;EAC7B,IAAI,SAAS,QAAQ,CAAC,KAAK,SAAS,KAAK,OAAO,QAAQ,GACtD,OAAO;EAET,KAAK,QAAQ;EACb,OAAO;CACT;CAEA,OAAO,KAAuB;EAC5B,MAAM,OAAO,KAAK,QAAQ,GAAG;EAC7B,IAAI,SAAS,MAAM,OAAO,KAAA;EAE1B,MAAM,WAAW,KAAK;EACtB,KAAK,WAAW,IAAI;EACpB,KAAK;EACL,OAAO;CACT;CAEA,YAAY,KAAQ,OAAmB;EACrC,MAAM,OAAO,KAAK,QAAQ,GAAG;EAC7B,IAAI,SAAS,QAAQ,CAAC,KAAK,SAAS,KAAK,OAAO,KAAK,GACnD,OAAO;EAET,KAAK,WAAW,IAAI;EACpB,KAAK;EACL,OAAO;CACT;CAEA,QAAc;EACZ,KAAK,QAAQ;EACb,KAAK,QAAQ;CACf;CAMA,OAAO,OAAyD;EAC9D,IAAI,aAAa,SAAS,OAAO,MAAM,YAAY,YACjD,KAAK,MAAM,SAAS,MAAM,QAAQ,GAChC,KAAK,IAAI,MAAM,KAAK,MAAM,KAAK;OAGjC,KAAK,MAAM,SAAS,OAClB,KAAK,IAAI,MAAM,KAAK,MAAM,KAAK;CAGrC;CAMA,gBAAgB,KAAQ,iBAAmC;EACzD,MAAM,WAAW,KAAK,QAAQ,GAAG;EACjC,IAAI,aAAa,MACf,OAAO,SAAS;EAElB,MAAM,QAAQ,gBAAgB,GAAG;EACjC,KAAK,IAAI,KAAK,KAAK;EACnB,OAAO;CACT;CAEA,iBAAiB,KAAQ,mBAAuE;EAC9F,MAAM,WAAW,KAAK,QAAQ,GAAG;EACjC,IAAI,aAAa,MAAM,OAAO,KAAA;EAE9B,MAAM,WAAW,kBAAkB,KAAK,SAAS,KAAK;EACtD,IAAI,aAAa,KAAA,GAAW;GAC1B,KAAK,OAAO,GAAG;GACf;EACF;EACA,SAAS,QAAQ;EACjB,OAAO;CACT;CAEA,QAAQ,KAAQ,mBAAmF;EACjG,MAAM,WAAW,KAAK,QAAQ,GAAG;EACjC,MAAM,WAAW,kBAAkB,KAAK,UAAU,KAAK;EAEvD,IAAI,aAAa,KAAA,GAAW;GAC1B,IAAI,aAAa,MACf,KAAK,OAAO,GAAG;GAEjB;EACF;EAEA,KAAK,IAAI,KAAK,QAAQ;EACtB,OAAO;CACT;CAEA,MAAM,KAAQ,OAAU,mBAA+E;EACrG,MAAM,WAAW,KAAK,QAAQ,GAAG;EAEjC,IAAI,aAAa,MAAM;GACrB,KAAK,IAAI,KAAK,KAAK;GACnB,OAAO;EACT;EAEA,MAAM,SAAS,kBAAkB,SAAS,OAAO,KAAK;EACtD,IAAI,WAAW,KAAA,GAAW;GACxB,KAAK,OAAO,GAAG;GACf;EACF;EAEA,SAAS,QAAQ;EACjB,OAAO;CACT;CAMA,WAAc;EACZ,IAAI,KAAK,UAAU,MACjB,MAAM,IAAI,MAAM,cAAc;EAEhC,OAAO,KAAK,aAAa,KAAK,KAAK,CAAC,CAAC;CACvC;CAEA,UAAa;EACX,IAAI,KAAK,UAAU,MACjB,MAAM,IAAI,MAAM,cAAc;EAEhC,OAAO,KAAK,YAAY,KAAK,KAAK,CAAC,CAAC;CACtC;CAEA,QAAQ,OAA2B;EAEjC,MAAM,SAAS,IAAI,QAAc;GAC/B,SAAS,KAAK;GACd,IAAI,KAAK;GACT,SAAS,KAAK;EAChB,CAAC;EAED,KAAK,MAAM,SAAS,KAAK,QAAQ,GAC/B,IAAI,KAAK,SAAS,MAAM,KAAK,KAAK,IAAI,GACpC,OAAO,IAAI,MAAM,KAAK,MAAM,KAAK;OAEjC;EAIJ,OAAO;CACT;CAEA,QAAQ,SAA6B;EACnC,MAAM,SAAS,IAAI,QAAc;GAC/B,SAAS,KAAK;GACd,IAAI,KAAK;GACT,SAAS,KAAK;EAChB,CAAC;EAED,IAAI,UAAU;EACd,KAAK,MAAM,SAAS,KAAK,QAAQ,GAAG;GAClC,IAAI,CAAC,WAAW,KAAK,SAAS,MAAM,KAAK,OAAO,IAAI,GAClD;GAEF,UAAU;GACV,OAAO,IAAI,MAAM,KAAK,MAAM,KAAK;EACnC;EAEA,OAAO;CACT;CAEA,OAAO,SAAY,OAA2B;EAC5C,MAAM,SAAS,IAAI,QAAc;GAC/B,SAAS,KAAK;GACd,IAAI,KAAK;GACT,SAAS,KAAK;EAChB,CAAC;EAED,KAAK,MAAM,SAAS,KAAK,QAAQ,GAAG;GAClC,MAAM,UAAU,KAAK,SAAS,MAAM,KAAK,OAAO;GAChD,MAAM,QAAQ,KAAK,SAAS,MAAM,KAAK,KAAK;GAE5C,IAAI,WAAW,KAAK,QAAQ,GAC1B,OAAO,IAAI,MAAM,KAAK,MAAM,KAAK;QAC5B,IAAI,SAAS,GAClB;EAEJ;EAEA,OAAO;CACT;CAMA,SAAS,KAAuB;EAC9B,OAAO,KAAK,WAAW,GAAG,CAAC,EAAE;CAC/B;CAEA,WAAW,KAAuB;EAChC,OAAO,KAAK,aAAa,GAAG,CAAC,EAAE;CACjC;CAEA,SAAS,KAAuB;EAC9B,OAAO,KAAK,WAAW,GAAG,CAAC,EAAE;CAC/B;CAEA,UAAU,KAAuB;EAC/B,OAAO,KAAK,YAAY,GAAG,CAAC,EAAE;CAChC;CAEA,WAAW,KAAiC;EAC1C,IAAI,OAAO,KAAK;EAChB,IAAI,SAAgC;EAEpC,OAAO,SAAS,MAAM;GACpB,MAAM,MAAM,KAAK,SAAS,KAAK,KAAK,GAAG;GACvC,IAAI,QAAQ,GACV,OAAO;IAAE,KAAK,KAAK;IAAK,OAAO,KAAK;GAAM;QACrC,IAAI,MAAM,GACf,OAAO,KAAK;QACP;IACL,SAAS;IACT,OAAO,KAAK;GACd;EACF;EAEA,OAAO,SAAS;GAAE,KAAK,OAAO;GAAK,OAAO,OAAO;EAAM,IAAI,KAAA;CAC7D;CAEA,aAAa,KAAiC;EAC5C,IAAI,OAAO,KAAK;EAChB,IAAI,SAAgC;EAEpC,OAAO,SAAS,MAAM;GACpB,MAAM,MAAM,KAAK,SAAS,KAAK,KAAK,GAAG;GACvC,IAAI,QAAQ,GACV,OAAO;IAAE,KAAK,KAAK;IAAK,OAAO,KAAK;GAAM;QACrC,IAAI,MAAM,GACf,OAAO,KAAK;QACP;IACL,SAAS;IACT,OAAO,KAAK;GACd;EACF;EAEA,OAAO,SAAS;GAAE,KAAK,OAAO;GAAK,OAAO,OAAO;EAAM,IAAI,KAAA;CAC7D;CAEA,WAAW,KAAiC;EAC1C,IAAI,OAAO,KAAK;EAChB,IAAI,SAAgC;EAEpC,OAAO,SAAS,MAEd,IADY,KAAK,SAAS,KAAK,KAAK,GAC9B,KAAK,GACT,OAAO,KAAK;OACP;GACL,SAAS;GACT,OAAO,KAAK;EACd;EAGF,OAAO,SAAS;GAAE,KAAK,OAAO;GAAK,OAAO,OAAO;EAAM,IAAI,KAAA;CAC7D;CAEA,YAAY,KAAiC;EAC3C,IAAI,OAAO,KAAK;EAChB,IAAI,SAAgC;EAEpC,OAAO,SAAS,MAEd,IADY,KAAK,SAAS,KAAK,KAAK,GAC9B,KAAK,GACT,OAAO,KAAK;OACP;GACL,SAAS;GACT,OAAO,KAAK;EACd;EAGF,OAAO,SAAS;GAAE,KAAK,OAAO;GAAK,OAAO,OAAO;EAAM,IAAI,KAAA;CAC7D;CAEA,aAAsC;EACpC,IAAI,KAAK,UAAU,MAAM,OAAO,KAAA;EAChC,MAAM,OAAO,KAAK,aAAa,KAAK,KAAK;EACzC,OAAO;GAAE,KAAK,KAAK;GAAK,OAAO,KAAK;EAAM;CAC5C;CAEA,YAAqC;EACnC,IAAI,KAAK,UAAU,MAAM,OAAO,KAAA;EAChC,MAAM,OAAO,KAAK,YAAY,KAAK,KAAK;EACxC,OAAO;GAAE,KAAK,KAAK;GAAK,OAAO,KAAK;EAAM;CAC5C;CAEA,iBAA0C;EACxC,IAAI,KAAK,UAAU,MAAM,OAAO,KAAA;EAChC,MAAM,OAAO,KAAK,aAAa,KAAK,KAAK;EACzC,MAAM,QAAQ;GAAE,KAAK,KAAK;GAAK,OAAO,KAAK;EAAM;EACjD,KAAK,WAAW,IAAI;EACpB,KAAK;EACL,OAAO;CACT;CAEA,gBAAyC;EACvC,IAAI,KAAK,UAAU,MAAM,OAAO,KAAA;EAChC,MAAM,OAAO,KAAK,YAAY,KAAK,KAAK;EACxC,MAAM,QAAQ;GAAE,KAAK,KAAK;GAAK,OAAO,KAAK;EAAM;EACjD,KAAK,WAAW,IAAI;EACpB,KAAK;EACL,OAAO;CACT;CAEA,gBAAoC;EAElC,MAAM,WAAW,IAAI,QAAc;GACjC,UAAU,GAAG,MAAM,KAAK,SAAS,GAAG,CAAC;GACrC,IAAI,KAAK;GACT,SAAS,KAAK;EAChB,CAAC;EAED,KAAK,MAAM,SAAS,KAAK,QAAQ,GAC/B,SAAS,IAAI,MAAM,KAAK,MAAM,KAAK;EAGrC,OAAO;CACT;CAEA,CAAC,iBAAsC;EACrC,OAAO,KAAK,wBAAwB,KAAK,QAAQ,SAAS,KAAK,GAAG;CACpE;CAMA,CAAC,OAA4B;EAC3B,OAAO,KAAK,iBAAiB,KAAK,QAAQ,SAAS,KAAK,GAAG;CAC7D;CAEA,CAAC,SAA8B;EAC7B,OAAO,KAAK,iBAAiB,KAAK,QAAQ,SAAS,KAAK,KAAK;CAC/D;CAEA,CAAC,UAAyC;EACxC,OAAO,KAAK,iBAAiB,KAAK,QAAQ,UAAU;GAClD,KAAK,KAAK;GACV,OAAO,KAAK;EACd,EAAE;CACJ;CAEA,EAAE,OAAO,YAAmC;EAC1C,OAAO,KAAK,QAAQ;CACtB;CAEA,QAAQ,QAAqD;EAC3D,KAAK,MAAM,SAAS,KAAK,QAAQ,GAC/B,OAAO,MAAM,OAAO,MAAM,KAAK,IAAI;CAEvC;CAEA,UAAyB;EACvB,OAAO,MAAM,KAAK,KAAK,QAAQ,CAAC;CAClC;CAMA,WAAmB,KAAQ,OAAU,OAA8B;EACjE,OAAO;GACL;GACA;GACA;GACA,MAAM;GACN,OAAO;GACP,QAAQ;EACV;CACF;CAEA,QAAgB,KAA+B;EAC7C,IAAI,OAAO,KAAK;EAEhB,OAAO,SAAS,MAAM;GACpB,MAAM,MAAM,KAAK,SAAS,KAAK,KAAK,GAAG;GACvC,IAAI,QAAQ,GACV,OAAO;QACF,IAAI,MAAM,GACf,OAAO,KAAK;QAEZ,OAAO,KAAK;EAEhB;EAEA,OAAO;CACT;CAEA,aAAqB,MAAsC;EACzD,OAAO,KAAK,SAAS,MACnB,OAAO,KAAK;EAEd,OAAO;CACT;CAEA,YAAoB,MAAsC;EACxD,OAAO,KAAK,UAAU,MACpB,OAAO,KAAK;EAEd,OAAO;CACT;CAEA,UAAkB,MAA6B,OAAmB;EAChE,IAAI,SAAS,MAAM,OAAO;EAC1B,IAAI,KAAK,SAAS,KAAK,OAAO,KAAK,GAAG,OAAO;EAC7C,OAAO,KAAK,UAAU,KAAK,MAAM,KAAK,KAAK,KAAK,UAAU,KAAK,OAAO,KAAK;CAC7E;CAEA,CAAS,iBACP,MACA,QACqB;EACrB,IAAI,SAAS,MAAM;EACnB,OAAO,KAAK,iBAAiB,KAAK,MAAM,MAAM;EAC9C,MAAM,OAAO,IAAI;EACjB,OAAO,KAAK,iBAAiB,KAAK,OAAO,MAAM;CACjD;CAEA,CAAS,wBACP,MACA,QACqB;EACrB,IAAI,SAAS,MAAM;EACnB,OAAO,KAAK,wBAAwB,KAAK,OAAO,MAAM;EACtD,MAAM,OAAO,IAAI;EACjB,OAAO,KAAK,wBAAwB,KAAK,MAAM,MAAM;CACvD;CAMA,WAAmB,MAAmC;EACpD,IAAI,SAAS,QAAQ,KAAK,UAAU,MAAM;EAC1C,MAAM,QAAQ,KAAK;EACnB,KAAK,QAAQ,MAAM;EAEnB,IAAI,MAAM,SAAS,MACjB,MAAM,KAAK,SAAS;EAGtB,MAAM,SAAS,KAAK;EAEpB,IAAI,KAAK,WAAW,MAClB,KAAK,QAAQ;OACR,IAAI,SAAS,KAAK,OAAO,MAC9B,KAAK,OAAO,OAAO;OAEnB,KAAK,OAAO,QAAQ;EAGtB,MAAM,OAAO;EACb,KAAK,SAAS;CAChB;CAEA,YAAoB,MAAmC;EACrD,IAAI,SAAS,QAAQ,KAAK,SAAS,MAAM;EACzC,MAAM,OAAO,KAAK;EAClB,KAAK,OAAO,KAAK;EAEjB,IAAI,KAAK,UAAU,MACjB,KAAK,MAAM,SAAS;EAGtB,KAAK,SAAS,KAAK;EAEnB,IAAI,KAAK,WAAW,MAClB,KAAK,QAAQ;OACR,IAAI,SAAS,KAAK,OAAO,OAC9B,KAAK,OAAO,QAAQ;OAEpB,KAAK,OAAO,OAAO;EAGrB,KAAK,QAAQ;EACb,KAAK,SAAS;CAChB;CAEA,kBAA0B,MAA4B;EACpD,OAAO,KAAK,WAAW,QAAQ,KAAK,OAAO,UAAU,MAAM,KACzD,IAAI,KAAK,WAAW,KAAK,OAAO,QAAQ,MAAM;GAC5C,MAAM,QAAQ,KAAK,OAAO,OAAO;GAEjC,IAAI,OAAO,UAAU,MAAM,KAAK;IAE9B,KAAK,OAAO,QAAQ,MAAM;IAC1B,MAAM,QAAQ,MAAM;IACpB,KAAK,OAAO,OAAO,QAAQ,MAAM;IACjC,OAAO,KAAK,OAAO;GACrB,OAAO;IACL,IAAI,SAAS,KAAK,OAAO,OAAO;KAE9B,OAAO,KAAK;KACZ,KAAK,WAAW,IAAI;IACtB;IAEA,KAAK,OAAQ,QAAQ,MAAM;IAC3B,KAAK,OAAQ,OAAQ,QAAQ,MAAM;IACnC,KAAK,YAAY,KAAK,OAAQ,MAAO;GACvC;EACF,OAAO;GACL,MAAM,QAAQ,KAAK,OAAO,QAAQ,QAAQ;GAE1C,IAAI,OAAO,UAAU,MAAM,KAAK;IAE9B,KAAK,OAAO,QAAQ,MAAM;IAC1B,MAAM,QAAQ,MAAM;IACpB,KAAK,OAAO,OAAQ,QAAQ,MAAM;IAClC,OAAO,KAAK,OAAO;GACrB,OAAO;IACL,IAAI,SAAS,KAAK,OAAO,MAAM;KAE7B,OAAO,KAAK;KACZ,KAAK,YAAY,IAAI;IACvB;IAEA,KAAK,OAAQ,QAAQ,MAAM;IAC3B,KAAK,OAAQ,OAAQ,QAAQ,MAAM;IACnC,KAAK,WAAW,KAAK,OAAQ,MAAO;GACtC;EACF;EAGF,KAAK,MAAO,QAAQ,MAAM;CAC5B;;;;;;;;CASA,WAAmB,QAA8B;EAC/C,IAAI,OAAO;EAEX,IAAI,KAAK,SAAS,QAAQ,KAAK,UAAU,MAAM;GAC7C,MAAM,YAAY,KAAK,aAAa,KAAK,KAAK;GAC9C,KAAK,MAAM,UAAU;GACrB,KAAK,QAAQ,UAAU;GACvB,OAAO;EACT;EAEA,MAAM,cAAc,KAAK,QAAQ,KAAK;EACtC,IAAI,gBAAgB,MAAM;GACxB,YAAY,SAAS,KAAK;GAC1B,IAAI,KAAK,WAAW,MAAM,KAAK,QAAQ;QAClC,IAAI,SAAS,KAAK,OAAO,MAAM,KAAK,OAAO,OAAO;QAClD,KAAK,OAAO,QAAQ;GACzB,KAAK,OAAO,KAAK,QAAQ,KAAK,SAAS;GACvC,IAAI,KAAK,UAAU,MAAM,OAAO,KAAK,iBAAiB,WAAW;EACnE,OAAO,IAAI,KAAK,WAAW,MAEzB,KAAK,QAAQ;OACR;GAEL,IAAI,KAAK,UAAU,MAAM,OAAO,KAAK,iBAAiB,IAAI;GAC1D,IAAI,KAAK,WAAW,MAAM;IACxB,IAAI,SAAS,KAAK,OAAO,MAAM,KAAK,OAAO,OAAO;SAC7C,IAAI,SAAS,KAAK,OAAO,OAAO,KAAK,OAAO,QAAQ;IACzD,KAAK,SAAS;GAChB;EACF;CACF;CAEA,iBAAyB,OAA6B;EACpD,IAAI,IAA2B;EAC/B,OAAO,MAAM,KAAK,SAAS,QAAQ,CAAC,MAAM,MAAM,OAC9C,IAAI,MAAM,OAAO,SAAS,CAAC,CAAC,GAAG;GAC7B,IAAI,UAAU,QAAQ,SAAS,CAAC,CAAC;GACjC,IAAI,QAAQ,OAAO,MAAM,MAAM,KAAK;IAClC,SAAS,SAAS,MAAM,KAAK;IAC7B,SAAS,SAAS,CAAC,GAAG,MAAM,GAAG;IAC/B,KAAK,WAAW,SAAS,CAAC,CAAC;IAC3B,UAAU,QAAQ,SAAS,CAAC,CAAC;GAC/B;GACA,IAAI,QAAQ,OAAO,OAAO,CAAC,MAAM,MAAM,SAAS,QAAQ,QAAQ,OAAO,CAAC,MAAM,MAAM,OAAO;IACzF,SAAS,SAAS,MAAM,GAAG;IAC3B,IAAI,SAAS,CAAC;GAChB,OAAO;IACL,IAAI,QAAQ,QAAQ,OAAO,CAAC,MAAM,MAAM,OAAO;KAC7C,SAAS,OAAO,OAAO,GAAG,MAAM,KAAK;KACrC,SAAS,SAAS,MAAM,GAAG;KAC3B,KAAK,YAAY,OAAO;KACxB,UAAU,QAAQ,SAAS,CAAC,CAAC;IAC/B;IACA,SAAS,SAAS,QAAQ,SAAS,CAAC,CAAC,CAAC;IACtC,SAAS,SAAS,CAAC,GAAG,MAAM,KAAK;IACjC,SAAS,QAAQ,OAAO,GAAG,MAAM,KAAK;IACtC,KAAK,WAAW,SAAS,CAAC,CAAC;IAC3B,IAAI,KAAK;GACX;EACF,OAAO;GACL,IAAI,UAAU,OAAO,SAAS,CAAC,CAAC;GAChC,IAAI,QAAQ,OAAO,MAAM,MAAM,KAAK;IAClC,SAAS,SAAS,MAAM,KAAK;IAC7B,SAAS,SAAS,CAAC,GAAG,MAAM,GAAG;IAC/B,KAAK,YAAY,SAAS,CAAC,CAAC;IAC5B,UAAU,OAAO,SAAS,CAAC,CAAC;GAC9B;GACA,IAAI,QAAQ,QAAQ,OAAO,CAAC,MAAM,MAAM,SAAS,QAAQ,OAAO,OAAO,CAAC,MAAM,MAAM,OAAO;IACzF,SAAS,SAAS,MAAM,GAAG;IAC3B,IAAI,SAAS,CAAC;GAChB,OAAO;IACL,IAAI,QAAQ,OAAO,OAAO,CAAC,MAAM,MAAM,OAAO;KAC5C,SAAS,QAAQ,OAAO,GAAG,MAAM,KAAK;KACtC,SAAS,SAAS,MAAM,GAAG;KAC3B,KAAK,WAAW,OAAO;KACvB,UAAU,OAAO,SAAS,CAAC,CAAC;IAC9B;IACA,SAAS,SAAS,QAAQ,SAAS,CAAC,CAAC,CAAC;IACtC,SAAS,SAAS,CAAC,GAAG,MAAM,KAAK;IACjC,SAAS,OAAO,OAAO,GAAG,MAAM,KAAK;IACrC,KAAK,YAAY,SAAS,CAAC,CAAC;IAC5B,IAAI,KAAK;GACX;EACF;EAEF,SAAS,GAAG,MAAM,KAAK;CACzB;CAMA,WAAmB;EAIjB,OAAO,WAHS,MAAM,KAAK,KAAK,QAAQ,CAAC,CAAC,CACvC,KAAK,EAAE,KAAK,YAAY,GAAG,IAAI,GAAG,OAAO,CAAC,CAC1C,KAAK,IACgB,EAAE;CAC5B;AACF;;;;;;;;;;;;;;;;;;;;;;;AAwBA,SAAgB,QACd,kBACe;CACf,IAAI,oBAAoB,OAAO,YAAY,kBAAkB;EAC3D,MAAM,MAAM,IAAI,QAAc;EAC9B,KAAK,MAAM,CAAC,KAAK,UAAU,kBACzB,IAAI,IAAI,KAAK,KAAK;EAEpB,OAAO;CACT;CAEA,OAAO,IAAI,QAAc,gBAAwC;AACnE;;;;;AC92BA,MAAMC,YAAU;;;;;;;AAyBhB,IAAa,UAAb,MAAa,QAAsC;CACjD;CACA;CACA;CAEA,YAAY,UAA6B,CAAC,GAAG;EAC3C,MAAM,EACJ,UAAU,gBACV,KAAK,cACH;EAEJ,KAAK,WAAW;EAChB,KAAK,MAAM;EACX,KAAK,OAAO,IAAI,QAAoB;GAClC;GACA;EACF,CAAC;CACH;CAMA,IAAI,OAAe;EACjB,OAAO,KAAK,KAAK;CACnB;CAEA,IAAI,UAAmB;EACrB,OAAO,KAAK,KAAK;CACnB;CAEA,IAAI,aAAyB;EAC3B,OAAO,KAAK;CACd;CAEA,IAAI,KAAY;EACd,OAAO,KAAK;CACd;CAMA,IAAI,SAAqB;EACvB,OAAO,KAAK,KAAK,IAAI,OAAO;CAC9B;CAEA,SAAS,SAAqB;EAC5B,OAAO,KAAK,IAAI,OAAO;CACzB;CAEA,YAAY,OAA6B;EACvC,KAAK,MAAM,WAAW,OACpB,IAAI,CAAC,KAAK,IAAI,OAAO,GACnB,OAAO;EAGX,OAAO;CACT;CAMA,IAAI,SAAqB;EAEvB,OADiB,KAAK,KAAK,IAAI,SAASA,SAC1B,MAAM,KAAA;CACtB;CAEA,OAAO,SAAqB;EAE1B,OADgB,KAAK,KAAK,OAAO,OACpB,MAAM,KAAA;CACrB;CAEA,QAAc;EACZ,KAAK,KAAK,MAAM;CAClB;CAMA,OAAO,UAAgC;EACrC,IAAI,WAAW;EACf,KAAK,MAAM,WAAW,UACpB,IAAI,KAAK,IAAI,OAAO,GAClB,WAAW;EAGf,OAAO;CACT;CAEA,UAAU,UAAgC;EACxC,IAAI,WAAW;EACf,KAAK,MAAM,WAAW,UACpB,IAAI,KAAK,OAAO,OAAO,GACrB,WAAW;EAGf,OAAO;CACT;CAEA,UAAU,UAAgC;EACxC,MAAM,2BAAW,IAAI,IAAO;EAC5B,KAAK,MAAM,WAAW,UACpB,SAAS,IAAI,OAAO;EAGtB,IAAI,WAAW;EACf,KAAK,MAAM,WAAW,MAAM,KAAK,IAAI,GACnC,IAAI,CAAC,SAAS,IAAI,OAAO,GAAG;GAC1B,KAAK,OAAO,OAAO;GACnB,WAAW;EACb;EAEF,OAAO;CACT;CAMA,MAAM,OAAgC;EACpC,MAAM,SAAS,IAAI,QAAW;GAC5B,SAAS,KAAK;GACd,IAAI,KAAK;EACX,CAAC;EAED,KAAK,MAAM,WAAW,MACpB,OAAO,IAAI,OAAO;EAEpB,KAAK,MAAM,WAAW,OACpB,OAAO,IAAI,OAAO;EAGpB,OAAO;CACT;CAEA,aAAa,OAAgC;EAC3C,MAAM,SAAS,IAAI,QAAW;GAC5B,SAAS,KAAK;GACd,IAAI,KAAK;EACX,CAAC;EAED,MAAM,2BAAW,IAAI,IAAO;EAC5B,KAAK,MAAM,WAAW,OACpB,SAAS,IAAI,OAAO;EAGtB,KAAK,MAAM,WAAW,MACpB,IAAI,SAAS,IAAI,OAAO,GACtB,OAAO,IAAI,OAAO;EAItB,OAAO;CACT;CAEA,WAAW,OAAgC;EACzC,MAAM,SAAS,IAAI,QAAW;GAC5B,SAAS,KAAK;GACd,IAAI,KAAK;EACX,CAAC;EAED,MAAM,2BAAW,IAAI,IAAO;EAC5B,KAAK,MAAM,WAAW,OACpB,SAAS,IAAI,OAAO;EAGtB,KAAK,MAAM,WAAW,MACpB,IAAI,CAAC,SAAS,IAAI,OAAO,GACvB,OAAO,IAAI,OAAO;EAItB,OAAO;CACT;CAEA,oBAAoB,OAAgC;EAClD,MAAM,SAAS,IAAI,QAAW;GAC5B,SAAS,KAAK;GACd,IAAI,KAAK;EACX,CAAC;EAGD,KAAK,MAAM,WAAW,MACpB,OAAO,IAAI,OAAO;EAIpB,KAAK,MAAM,WAAW,OACpB,IAAI,OAAO,IAAI,OAAO,GACpB,OAAO,OAAO,OAAO;OAErB,OAAO,IAAI,OAAO;EAItB,OAAO;CACT;CAEA,WAAW,OAA6B;EACtC,MAAM,2BAAW,IAAI,IAAO;EAC5B,KAAK,MAAM,WAAW,OACpB,SAAS,IAAI,OAAO;EAGtB,KAAK,MAAM,WAAW,MACpB,IAAI,CAAC,SAAS,IAAI,OAAO,GACvB,OAAO;EAGX,OAAO;CACT;CAEA,aAAa,OAA6B;EACxC,KAAK,MAAM,WAAW,OACpB,IAAI,CAAC,KAAK,IAAI,OAAO,GACnB,OAAO;EAGX,OAAO;CACT;CAEA,eAAe,OAA6B;EAC1C,KAAK,MAAM,WAAW,OACpB,IAAI,KAAK,IAAI,OAAO,GAClB,OAAO;EAGX,OAAO;CACT;CAMA,QAAW;EAET,OADY,KAAK,KAAK,SACb;CACX;CAEA,OAAU;EAER,OADY,KAAK,KAAK,QACb;CACX;CAEA,QAAQ,WAA4B;EAClC,MAAM,SAAS,IAAI,QAAW;GAC5B,SAAS,KAAK;GACd,IAAI,KAAK;EACX,CAAC;EAED,KAAK,MAAM,WAAW,MACpB,IAAI,KAAK,SAAS,SAAS,SAAS,IAAI,GACtC,OAAO,IAAI,OAAO;OAElB;EAIJ,OAAO;CACT;CAEA,QAAQ,aAA8B;EACpC,MAAM,SAAS,IAAI,QAAW;GAC5B,SAAS,KAAK;GACd,IAAI,KAAK;EACX,CAAC;EAED,IAAI,UAAU;EACd,KAAK,MAAM,WAAW,MAAM;GAC1B,IAAI,CAAC,WAAW,KAAK,SAAS,SAAS,WAAW,IAAI,GACpD;GAEF,UAAU;GACV,OAAO,IAAI,OAAO;EACpB;EAEA,OAAO;CACT;CAEA,OAAO,aAAgB,WAA4B;EACjD,MAAM,SAAS,IAAI,QAAW;GAC5B,SAAS,KAAK;GACd,IAAI,KAAK;EACX,CAAC;EAED,KAAK,MAAM,WAAW,MAAM;GAC1B,MAAM,UAAU,KAAK,SAAS,SAAS,WAAW;GAClD,MAAM,QAAQ,KAAK,SAAS,SAAS,SAAS;GAE9C,IAAI,WAAW,KAAK,QAAQ,GAC1B,OAAO,IAAI,OAAO;QACb,IAAI,SAAS,GAClB;EAEJ;EAEA,OAAO;CACT;CAMA,MAAM,SAA2B;EAC/B,OAAO,KAAK,KAAK,SAAS,OAAO;CACnC;CAEA,QAAQ,SAA2B;EACjC,OAAO,KAAK,KAAK,WAAW,OAAO;CACrC;CAEA,MAAM,SAA2B;EAC/B,OAAO,KAAK,KAAK,SAAS,OAAO;CACnC;CAEA,OAAO,SAA2B;EAChC,OAAO,KAAK,KAAK,UAAU,OAAO;CACpC;CAEA,YAA2B;EAEzB,OADc,KAAK,KAAK,eACb,CAAC,EAAE;CAChB;CAEA,WAA0B;EAExB,OADc,KAAK,KAAK,cACb,CAAC,EAAE;CAChB;CAEA,gBAAiC;EAC/B,MAAM,WAAW,IAAI,QAAW;GAC9B,UAAU,GAAG,MAAM,KAAK,SAAS,GAAG,CAAC;GACrC,IAAI,KAAK;EACX,CAAC;EAED,KAAK,MAAM,WAAW,MACpB,SAAS,IAAI,OAAO;EAGtB,OAAO;CACT;CAEA,CAAC,qBAA0C;EACzC,OAAO,KAAK,KAAK,eAAe;CAClC;CAMA,EAAE,OAAO,YAAyB;EAChC,OAAO,KAAK,KAAK,KAAK;CACxB;CAEA,QAAQ,QAAmD;EACzD,IAAI,QAAQ;EACZ,KAAK,MAAM,WAAW,MACpB,OAAO,SAAS,OAAO;CAE3B;CAEA,UAAe;EACb,OAAO,MAAM,KAAK,IAAI;CACxB;CAMA,WAAmB;EAEjB,OAAO,WADU,MAAM,KAAK,IAAI,CAAC,CAAC,KAAK,IACd,EAAE;CAC7B;AACF;;;;;;;;;;;;;;;;;;;;AAqBA,SAAgB,QACd,mBACY;CACZ,IAAI,qBAAqB,OAAO,YAAY,mBAAmB;EAC7D,MAAM,MAAM,IAAI,QAAW;EAC3B,KAAK,MAAM,WAAW,mBACpB,IAAI,IAAI,OAAO;EAEjB,OAAO;CACT;CAEA,OAAO,IAAI,QAAW,iBAAsC;AAC9D;;;;;AC9bA,IAAM,OAAN,MAAc;CACZ;CACA;CACA;CAEA,YAAY,OAAU,OAAuB,MAAM,OAAuB,MAAM;EAC9E,KAAK,QAAQ;EACb,KAAK,OAAO;EACZ,KAAK,OAAO;CACd;AACF;;;;;;;;;;;;;;;AA2BA,IAAa,aAAb,MAAa,WAA2C;CACtD,QAAgC;CAChC,QAAgC;CAChC,QAAwB;CACxB;CAEA,YAAY,UAAgC,CAAC,GAAG;EAC9C,MAAM,EAAE,KAAK,cAAc;EAC3B,KAAK,MAAM;CACb;CAMA,IAAI,OAAe;EACjB,OAAO,KAAK;CACd;CAEA,IAAI,UAAmB;EACrB,OAAO,KAAK,UAAU;CACxB;CAEA,IAAI,KAAY;EACd,OAAO,KAAK;CACd;CAMA,SAAS,SAAkB;EACzB,MAAM,UAAU,IAAI,KAAK,SAAS,MAAM,KAAK,KAAK;EAClD,IAAI,KAAK,OACP,KAAK,MAAM,OAAO;EAEpB,KAAK,QAAQ;EACb,IAAI,CAAC,KAAK,OACR,KAAK,QAAQ;EAEf,KAAK;CACP;CAEA,QAAQ,SAAkB;EACxB,MAAM,UAAU,IAAI,KAAK,SAAS,KAAK,OAAO,IAAI;EAClD,IAAI,KAAK,OACP,KAAK,MAAM,OAAO;EAEpB,KAAK,QAAQ;EACb,IAAI,CAAC,KAAK,OACR,KAAK,QAAQ;EAEf,KAAK;CACP;CAEA,cAAiB;EACf,IAAI,CAAC,KAAK,OACR,MAAM,IAAI,MAAM,eAAe;EAEjC,OAAO,KAAK,UAAU;CACxB;CAEA,aAAgB;EACd,IAAI,CAAC,KAAK,OACR,MAAM,IAAI,MAAM,eAAe;EAEjC,OAAO,KAAK,SAAS;CACvB;CAEA,YAA2B;EACzB,IAAI,CAAC,KAAK,OAAO,OAAO,KAAA;EAExB,MAAM,QAAQ,KAAK,MAAM;EACzB,KAAK,QAAQ,KAAK,MAAM;EAExB,IAAI,KAAK,OACP,KAAK,MAAM,OAAO;OAElB,KAAK,QAAQ;EAGf,KAAK;EACL,OAAO;CACT;CAEA,WAA0B;EACxB,IAAI,CAAC,KAAK,OAAO,OAAO,KAAA;EAExB,MAAM,QAAQ,KAAK,MAAM;EACzB,KAAK,QAAQ,KAAK,MAAM;EAExB,IAAI,KAAK,OACP,KAAK,MAAM,OAAO;OAElB,KAAK,QAAQ;EAGf,KAAK;EACL,OAAO;CACT;CAEA,YAAe;EACb,IAAI,CAAC,KAAK,OACR,MAAM,IAAI,MAAM,eAAe;EAEjC,OAAO,KAAK,MAAM;CACpB;CAEA,WAAc;EACZ,IAAI,CAAC,KAAK,OACR,MAAM,IAAI,MAAM,eAAe;EAEjC,OAAO,KAAK,MAAM;CACpB;CAEA,uBAAsC;EACpC,OAAO,KAAK,OAAO;CACrB;CAEA,sBAAqC;EACnC,OAAO,KAAK,OAAO;CACrB;CAEA,WAAW,SAAqB;EAC9B,KAAK,SAAS,OAAO;EACrB,OAAO;CACT;CAEA,UAAU,SAAqB;EAC7B,KAAK,QAAQ,OAAO;EACpB,OAAO;CACT;CASA,KAAK,SAAkB;EACrB,KAAK,QAAQ,OAAO;CACtB;CAEA,MAAS;EACP,OAAO,KAAK,WAAW;CACzB;CAMA,MAAM,SAAqB;EACzB,OAAO,KAAK,UAAU,OAAO;CAC/B;CAEA,OAAU;EACR,OAAO,KAAK,YAAY;CAC1B;CAEA,OAAU;EACR,OAAO,KAAK,UAAU;CACxB;CAEA,kBAAiC;EAC/B,OAAO,KAAK,qBAAqB;CACnC;CAEA,kBAAiC;EAC/B,OAAO,KAAK,UAAU;CACxB;CAEA,QAAQ,SAAqB;EAC3B,OAAO,KAAK,MAAM,OAAO;CAC3B;CAEA,UAAa;EACX,OAAO,KAAK,KAAK;CACnB;CAMA,IAAI,OAAkB;EAEpB,OADa,KAAK,QAAQ,KAChB,CAAC,CAAC;CACd;CAEA,IAAI,OAAe,SAAe;EAChC,MAAM,OAAO,KAAK,QAAQ,KAAK;EAC/B,MAAM,MAAM,KAAK;EACjB,KAAK,QAAQ;EACb,OAAO;CACT;CAEA,OAAO,OAAe,SAAkB;EACtC,IAAI,QAAQ,KAAK,QAAQ,KAAK,OAC5B,MAAM,IAAI,WAAW,SAAS,MAAM,0BAA0B,KAAK,OAAO;EAG5E,IAAI,UAAU,GAAG;GACf,KAAK,SAAS,OAAO;GACrB;EACF;EAEA,IAAI,UAAU,KAAK,OAAO;GACxB,KAAK,QAAQ,OAAO;GACpB;EACF;EAEA,MAAM,WAAW,KAAK,QAAQ,KAAK;EACnC,MAAM,WAAW,SAAS;EAC1B,MAAM,UAAU,IAAI,KAAK,SAAS,UAAU,QAAQ;EAEpD,SAAS,OAAO;EAChB,SAAS,OAAO;EAChB,KAAK;CACP;CAEA,UAAU,OAAe,OAA6B;EACpD,IAAI,QAAQ,KAAK,QAAQ,KAAK,OAC5B,MAAM,IAAI,WAAW,SAAS,MAAM,0BAA0B,KAAK,OAAO;EAG5E,MAAM,WAAW,MAAM,KAAK,KAAK;EACjC,IAAI,SAAS,WAAW,GAAG,OAAO;EAElC,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KACnC,KAAK,OAAO,QAAQ,GAAG,SAAS,EAAG;EAGrC,OAAO;CACT;CAEA,SAAS,OAAkB;EACzB,MAAM,OAAO,KAAK,QAAQ,KAAK;EAC/B,OAAO,KAAK,WAAW,IAAI;CAC7B;CAEA,YAAY,WAAmB,SAAuB;EACpD,IAAI,YAAY,KAAK,UAAU,KAAK,SAAS,YAAY,SACvD,MAAM,IAAI,WAAW,kBAAkB,UAAU,IAAI,QAAQ,EAAE;EAGjE,KAAK,IAAI,IAAI,WAAW,IAAI,SAAS,KACnC,KAAK,SAAS,SAAS;CAE3B;CAEA,QAAQ,SAAY,YAAoB,GAAW;EACjD,IAAI,QAAQ;EACZ,IAAI,OAAO,KAAK;EAEhB,OAAO,MAAM;GACX,IAAI,SAAS,aAAa,KAAK,IAAI,KAAK,OAAO,OAAO,GACpD,OAAO;GAET,OAAO,KAAK;GACZ;EACF;EAEA,OAAO;CACT;CAEA,YAAY,SAAY,WAA4B;EAClD,MAAM,QAAQ,cAAc,KAAA,IAAY,YAAY,KAAK,QAAQ;EACjE,IAAI,QAAQ,KAAK,QAAQ;EACzB,IAAI,OAAO,KAAK;EAEhB,OAAO,QAAQ,SAAS,GAAG;GACzB,IAAI,SAAS,SAAS,KAAK,IAAI,KAAK,OAAO,OAAO,GAChD,OAAO;GAET,OAAO,KAAK;GACZ;EACF;EAEA,OAAO;CACT;CAEA,QAAW;EACT,OAAO,KAAK,UAAU;CACxB;CAEA,OAAU;EACR,OAAO,KAAK,SAAS;CACvB;CAEA,QAAW;EACT,OAAO,KAAK,YAAY;CAC1B;CAEA,QAAQ,SAAkB;EACxB,KAAK,SAAS,OAAO;CACvB;CAMA,IAAI,SAAqB;EACvB,KAAK,QAAQ,OAAO;EACpB,OAAO;CACT;CAEA,OAAO,OAA6B;EAClC,IAAI,WAAW;EACf,KAAK,MAAM,WAAW,OAAO;GAC3B,KAAK,QAAQ,OAAO;GACpB,WAAW;EACb;EACA,OAAO;CACT;CAEA,SAAS,SAAqB;EAC5B,OAAO,KAAK,QAAQ,OAAO,MAAM;CACnC;CAEA,YAAY,OAA6B;EACvC,KAAK,MAAM,WAAW,OACpB,IAAI,CAAC,KAAK,SAAS,OAAO,GAAG,OAAO;EAEtC,OAAO;CACT;CAEA,OAAO,SAAqB;EAC1B,IAAI,OAAO,KAAK;EAEhB,OAAO,MAAM;GACX,IAAI,KAAK,IAAI,KAAK,OAAO,OAAO,GAAG;IACjC,KAAK,WAAW,IAAI;IACpB,OAAO;GACT;GACA,OAAO,KAAK;EACd;EAEA,OAAO;CACT;CAEA,UAAU,OAA6B;EACrC,MAAM,WAAW,IAAI,IAAI,KAAK;EAC9B,IAAI,WAAW;EAEf,KAAK,MAAM,WAAW,UACpB,OAAO,KAAK,OAAO,OAAO,GACxB,WAAW;EAIf,OAAO;CACT;CAEA,UAAU,OAA6B;EACrC,MAAM,WAAW,IAAI,IAAI,KAAK;EAC9B,IAAI,OAAO,KAAK;EAChB,IAAI,WAAW;EAEf,OAAO,MAAM;GACX,MAAM,OAAO,KAAK;GAClB,IAAI,eAAe;GAEnB,KAAK,MAAM,iBAAiB,UAC1B,IAAI,KAAK,IAAI,KAAK,OAAO,aAAa,GAAG;IACvC,eAAe;IACf;GACF;GAGF,IAAI,CAAC,cAAc;IACjB,KAAK,WAAW,IAAI;IACpB,WAAW;GACb;GAEA,OAAO;EACT;EAEA,OAAO;CACT;CAEA,QAAc;EACZ,KAAK,QAAQ;EACb,KAAK,QAAQ;EACb,KAAK,QAAQ;CACf;CAMA,KAAK,UAAsB,gBAAsB;EAC/C,IAAI,KAAK,SAAS,GAAG;EAGrB,MAAM,QAAQ,KAAK,QAAQ;EAC3B,MAAM,KAAK,OAAO;EAElB,KAAK,MAAM;EACX,KAAK,MAAM,WAAW,OACpB,KAAK,QAAQ,OAAO;CAExB;CAEA,UAAgB;EACd,IAAI,KAAK,SAAS,GAAG;EAErB,IAAI,OAAO,KAAK;EAChB,KAAK,QAAQ,KAAK;EAClB,KAAK,QAAQ;EAEb,OAAO,MAAM;GACX,MAAM,OAAO,KAAK;GAClB,KAAK,OAAO,KAAK;GACjB,KAAK,OAAO;GACZ,OAAO;EACT;CACF;CAMA,QAAQ,WAAmB,SAA0B;EACnD,IAAI,YAAY,KAAK,UAAU,KAAK,SAAS,YAAY,SACvD,MAAM,IAAI,WAAW,kBAAkB,UAAU,IAAI,QAAQ,EAAE;EAGjE,MAAM,MAAM,IAAI,WAAc,EAAE,IAAI,KAAK,IAAI,CAAC;EAC9C,IAAI,QAAQ;EACZ,IAAI,OAAO,KAAK;EAEhB,OAAO,QAAQ,QAAQ,SAAS;GAC9B,IAAI,SAAS,WACX,IAAI,QAAQ,KAAK,KAAK;GAExB,OAAO,KAAK;GACZ;EACF;EAEA,OAAO;CACT;CAMA,EAAE,OAAO,YAAyB;EAChC,IAAI,OAAO,KAAK;EAChB,OAAO,MAAM;GACX,MAAM,KAAK;GACX,OAAO,KAAK;EACd;CACF;CAEA,QAAQ,QAAmD;EACzD,IAAI,QAAQ;EACZ,IAAI,OAAO,KAAK;EAEhB,OAAO,MAAM;GACX,OAAO,KAAK,OAAO,KAAK;GACxB,OAAO,KAAK;GACZ;EACF;CACF;CAEA,UAAe;EACb,MAAM,SAAc,CAAC;EACrB,IAAI,OAAO,KAAK;EAEhB,OAAO,MAAM;GACX,OAAO,KAAK,KAAK,KAAK;GACtB,OAAO,KAAK;EACd;EAEA,OAAO;CACT;CAMA,QAAgB,OAAwB;EACtC,IAAI,QAAQ,KAAK,SAAS,KAAK,OAC7B,MAAM,IAAI,WAAW,SAAS,MAAM,0BAA0B,KAAK,OAAO;EAI5E,IAAI,QAAQ,KAAK,QAAQ,GAAG;GAE1B,IAAI,OAAO,KAAK;GAChB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KACzB,OAAO,KAAK;GAEd,OAAO;EACT,OAAO;GAEL,IAAI,OAAO,KAAK;GAChB,KAAK,IAAI,IAAI,KAAK,QAAQ,GAAG,IAAI,OAAO,KACtC,OAAO,KAAK;GAEd,OAAO;EACT;CACF;CAEA,WAAmB,MAAkB;EACnC,MAAM,QAAQ,KAAK;EAEnB,IAAI,KAAK,MACP,KAAK,KAAK,OAAO,KAAK;OAEtB,KAAK,QAAQ,KAAK;EAGpB,IAAI,KAAK,MACP,KAAK,KAAK,OAAO,KAAK;OAEtB,KAAK,QAAQ,KAAK;EAGpB,KAAK;EACL,OAAO;CACT;CAMA,WAAmB;EACjB,OAAO,cAAc,KAAK,QAAQ,CAAC,CAAC,KAAK,IAAI,EAAE;CACjD;AACF;;;;;;;;AASA,SAAgB,WACd,mBACe;CAEf,IAAI,qBAAqB,OAAO,YAAY,mBAAmB;EAC7D,MAAM,OAAO,IAAI,WAAc;EAC/B,KAAK,OAAO,iBAAgC;EAC5C,OAAO;CACT;CAEA,OAAO,IAAI,WAAc,iBAAyC;AACpE;;;;;AC1kBA,MAAM,UAAU,OAAO,SAAS;;;;;;;;;AAuChC,IAAa,UAAb,MAAa,QAA6B;CACxC;CACA;CAEA,YAAY,UAA6B,CAAC,GAAG;EAC3C,MAAM,EACJ,kBAAkB,IAClB,aAAa,KACb,KAAK,WACL,OAAO,gBACL;EAEJ,KAAK,MAAM;EACX,KAAK,OAAO,IAAI,QAAmB;GACjC;GACA;GACA,OAAO;GACP,SAAS;EACX,CAAC;CACH;CAMA,IAAI,OAAe;EACjB,OAAO,KAAK,KAAK;CACnB;CAEA,IAAI,UAAmB;EACrB,OAAO,KAAK,KAAK;CACnB;CAEA,IAAI,KAAY;EACd,OAAO,KAAK;CACd;CAMA,IAAI,SAAqB;EACvB,MAAM,aAAa,KAAK,KAAK,IAAI,OAAO;EACxC,KAAK,KAAK,IAAI,SAAS,OAAO;EAC9B,OAAO,CAAC;CACV;CAEA,OAAO,SAAqB;EAC1B,OAAO,KAAK,KAAK,OAAO,OAAO,MAAM,KAAA;CACvC;CAEA,SAAS,SAAqB;EAC5B,OAAO,KAAK,KAAK,IAAI,OAAO;CAC9B;CAMA,OAAO,OAA6B;EAClC,IAAI,WAAW;EACf,KAAK,MAAM,WAAW,OACpB,IAAI,KAAK,IAAI,OAAO,GAClB,WAAW;EAGf,OAAO;CACT;CAEA,UAAU,OAA6B;EACrC,IAAI,WAAW;EACf,KAAK,MAAM,WAAW,OACpB,IAAI,KAAK,OAAO,OAAO,GACrB,WAAW;EAGf,OAAO;CACT;CAEA,UAAU,OAA6B;EACrC,MAAM,WAAW,IAAI,WAAW,IAAI,KAAK;EACzC,MAAM,WAAgB,CAAC;EAEvB,KAAK,MAAM,WAAW,MAAM;GAC1B,IAAI,eAAe;GACnB,KAAK,MAAM,iBAAiB,UAC1B,IAAI,KAAK,IAAI,SAAS,aAAa,GAAG;IACpC,eAAe;IACf;GACF;GAEF,IAAI,CAAC,cACH,SAAS,KAAK,OAAO;EAEzB;EAEA,IAAI,WAAW;EACf,KAAK,MAAM,WAAW,UAAU;GAC9B,KAAK,OAAO,OAAO;GACnB,WAAW;EACb;EAEA,OAAO;CACT;CAEA,YAAY,OAA6B;EACvC,KAAK,MAAM,WAAW,OACpB,IAAI,CAAC,KAAK,SAAS,OAAO,GACxB,OAAO;EAGX,OAAO;CACT;CAEA,QAAc;EACZ,KAAK,KAAK,MAAM;CAClB;;;;;CAUA,MAAM,OAAgC;EACpC,MAAM,SAAS,KAAK,MAAM;EAC1B,OAAO,OAAO,KAAK;EACnB,OAAO;CACT;;;;;CAMA,aAAa,OAAgC;EAC3C,MAAM,SAAS,IAAI,QAAW,EAAE,IAAI,KAAK,IAAI,CAAC;EAC9C,KAAK,MAAM,WAAW,MACpB,KAAK,MAAM,gBAAgB,OACzB,IAAI,KAAK,IAAI,SAAS,YAAY,GAAG;GACnC,OAAO,IAAI,OAAO;GAClB;EACF;EAGJ,OAAO;CACT;;;;;CAMA,WAAW,OAAgC;EACzC,MAAM,SAAS,KAAK,MAAM;EAC1B,OAAO,UAAU,KAAK;EACtB,OAAO;CACT;;;;;CAMA,oBAAoB,OAAgC;EAClD,MAAM,SAAS,KAAK,MAAM,KAAK;EAC/B,MAAM,QAAQ,KAAK,aAAa,KAAK;EACrC,OAAO,UAAU,KAAK;EACtB,OAAO;CACT;;;;;CAMA,WAAW,OAA6B;EACtC,MAAM,WAAW,IAAI,QAAW,EAAE,IAAI,KAAK,IAAI,CAAC;EAChD,SAAS,OAAO,KAAK;EAErB,KAAK,MAAM,WAAW,MACpB,IAAI,CAAC,SAAS,SAAS,OAAO,GAC5B,OAAO;EAGX,OAAO;CACT;;;;;CAMA,aAAa,OAA6B;EACxC,KAAK,MAAM,WAAW,OACpB,IAAI,CAAC,KAAK,SAAS,OAAO,GACxB,OAAO;EAGX,OAAO;CACT;;;;CAKA,eAAe,OAA6B;EAC1C,KAAK,MAAM,WAAW,OACpB,IAAI,KAAK,SAAS,OAAO,GACvB,OAAO;EAGX,OAAO;CACT;CAMA,EAAE,OAAO,YAAyB;EAChC,KAAK,MAAM,SAAS,KAAK,MACvB,MAAM,MAAM;CAEhB;CAEA,QAAQ,QAAmD;EACzD,IAAI,QAAQ;EACZ,KAAK,MAAM,WAAW,MACpB,OAAO,SAAS,OAAO;CAE3B;CAEA,UAAe;EACb,OAAO,MAAM,KAAK,IAAI;CACxB;;;;CASA,QAAoB;EAClB,MAAM,QAAQ,IAAI,QAAW,EAAE,IAAI,KAAK,IAAI,CAAC;EAC7C,MAAM,OAAO,IAAI;EACjB,OAAO;CACT;;;;CAKA,WAAuD;EACrD,OAAO,KAAK,KAAK,SAAS;CAC5B;;;;CAKA,WAAmB;EACjB,OAAO,WAAW,KAAK,QAAQ,CAAC,CAAC,KAAK,IAAI,EAAE;CAC9C;AACF;;;;;;;;;AAUA,SAAgB,QACd,mBACY;CAEZ,IAAI,qBAAqB,OAAO,YAAY,mBAAmB;EAC7D,MAAM,MAAM,IAAI,QAAW;EAC3B,IAAI,OAAO,iBAAgC;EAC3C,OAAO;CACT;CAEA,OAAO,IAAI,QAAW,iBAAsC;AAC9D;;;;;;;;;;;;;AC9RA,IAAa,gBAAb,MAAa,cAA8C;CACzD;CACA;CACA;CAEA,YAAY,UAAmC,CAAC,GAAG;EACjD,MAAM,EACJ,UAAU,gBACV,KAAK,cACH;EAKJ,KAAK,QAAQ,CAAC;EACd,KAAK,WAAW;EAChB,KAAK,MAAM;CACb;CAMA,IAAI,OAAe;EACjB,OAAO,KAAK,MAAM;CACpB;CAEA,IAAI,UAAmB;EACrB,OAAO,KAAK,MAAM,WAAW;CAC/B;CAEA,IAAI,KAAY;EACd,OAAO,KAAK;CACd;CAEA,IAAI,UAAsB;EACxB,OAAO,KAAK;CACd;CAEA,IAAI,aAAyB;EAC3B,OAAO,KAAK;CACd;CAMA,MAAM,SAAqB;EACzB,KAAK,MAAM,KAAK,OAAO;EACvB,KAAK,SAAS,KAAK,MAAM,SAAS,CAAC;EACnC,OAAO;CACT;CAEA,OAAU;EACR,IAAI,KAAK,SACP,MAAM,IAAI,MAAM,yBAAyB;EAE3C,OAAO,KAAK,gBAAgB;CAC9B;CAEA,kBAAiC;EAC/B,IAAI,KAAK,SACP;EAGF,MAAM,SAAS,KAAK,MAAM;EAE1B,IAAI,KAAK,MAAM,WAAW,GACxB,KAAK,MAAM,IAAI;OACV;GACL,KAAK,MAAM,KAAK,KAAK,MAAM,IAAI;GAC/B,KAAK,WAAW,CAAC;EACnB;EAEA,OAAO;CACT;CAEA,OAAU;EACR,IAAI,KAAK,SACP,MAAM,IAAI,MAAM,yBAAyB;EAE3C,OAAO,KAAK,MAAM;CACpB;CAEA,kBAAiC;EAC/B,OAAO,KAAK,UAAU,KAAA,IAAY,KAAK,MAAM;CAC/C;CAMA,QAAQ,SAAqB;EAC3B,OAAO,KAAK,MAAM,OAAO;CAC3B;CAEA,UAAa;EACX,OAAO,KAAK,KAAK;CACnB;CAMA,IAAI,SAAqB;EACvB,OAAO,KAAK,MAAM,OAAO;CAC3B;CAEA,OAAO,OAA6B;EAClC,IAAI,WAAW;EACf,KAAK,MAAM,WAAW,OAAO;GAC3B,KAAK,MAAM,OAAO;GAClB,WAAW;EACb;EACA,OAAO;CACT;CAEA,SAAS,SAAqB;EAC5B,KAAK,MAAM,QAAQ,KAAK,OACtB,IAAI,KAAK,IAAI,MAAM,OAAO,GACxB,OAAO;EAGX,OAAO;CACT;CAEA,YAAY,OAA6B;EACvC,KAAK,MAAM,WAAW,OACpB,IAAI,CAAC,KAAK,SAAS,OAAO,GACxB,OAAO;EAGX,OAAO;CACT;CAEA,OAAO,SAAqB;EAC1B,MAAM,QAAQ,KAAK,MAAM,WAAW,SAAS,KAAK,IAAI,MAAM,OAAO,CAAC;EACpE,IAAI,UAAU,IACZ,OAAO;EAGT,IAAI,UAAU,KAAK,MAAM,SAAS,GAChC,KAAK,MAAM,IAAI;OACV;GACL,KAAK,MAAM,SAAS,KAAK,MAAM,IAAI;GACnC,KAAK,WAAW,KAAK;GACrB,KAAK,SAAS,KAAK;EACrB;EAEA,OAAO;CACT;CAEA,UAAU,OAA6B;EACrC,IAAI,WAAW;EACf,KAAK,MAAM,WAAW,OACpB,OAAO,KAAK,OAAO,OAAO,GACxB,WAAW;EAGf,OAAO;CACT;CAEA,UAAU,OAA6B;EACrC,MAAM,WAAW,IAAI,IAAI,KAAK;EAC9B,MAAM,UAAe,CAAC;EAEtB,KAAK,MAAM,WAAW,KAAK,OAAO;GAChC,IAAI,eAAe;GACnB,KAAK,MAAM,iBAAiB,UAC1B,IAAI,KAAK,IAAI,SAAS,aAAa,GAAG;IACpC,eAAe;IACf;GACF;GAEF,IAAI,cACF,QAAQ,KAAK,OAAO;EAExB;EAEA,MAAM,WAAW,QAAQ,WAAW,KAAK,MAAM;EAC/C,KAAK,QAAQ;EACb,KAAK,QAAQ;EAEb,OAAO;CACT;CAEA,QAAc;EACZ,KAAK,QAAQ,CAAC;CAChB;;;;;CAUA,EAAE,OAAO,YAAyB;EAChC,OAAO,KAAK;CACd;CAEA,QAAQ,QAAmD;EACzD,KAAK,MAAM,SAAS,SAAS,UAAU,OAAO,SAAS,KAAK,CAAC;CAC/D;;;;CAKA,UAAe;EACb,OAAO,KAAK,MAAM,MAAM;CAC1B;;;;;CAMA,gBAAqB;EACnB,MAAM,SAAc,CAAC;EACrB,MAAM,QAAQ,KAAK,MAAM;EAEzB,OAAO,CAAC,MAAM,SACZ,OAAO,KAAK,MAAM,KAAK,CAAC;EAG1B,OAAO;CACT;;;;CASA,SAAiB,OAAqB;EACpC,MAAM,UAAU,KAAK,MAAM;EAE3B,OAAO,QAAQ,GAAG;GAChB,MAAM,cAAc,KAAK,OAAO,QAAQ,KAAK,CAAC;GAC9C,MAAM,SAAS,KAAK,MAAM;GAE1B,IAAI,KAAK,SAAS,SAAS,MAAM,KAAK,GACpC;GAGF,KAAK,MAAM,SAAS;GACpB,QAAQ;EACV;EAEA,KAAK,MAAM,SAAS;CACtB;;;;;;;;;CAUA,WAAmB,OAAqB;EACtC,MAAM,SAAS,KAAK,MAAM;EAC1B,MAAM,UAAU,KAAK,MAAM;EAE3B,OAAO,MAAM;GACX,MAAM,iBAAiB,IAAI,QAAQ;GACnC,MAAM,kBAAkB,IAAI,QAAQ;GACpC,IAAI,kBAAkB,QACpB;GAGF,IAAI,aAAa;GACjB,IACE,kBAAkB,UAClB,KAAK,SAAS,KAAK,MAAM,kBAAmB,KAAK,MAAM,eAAgB,IAAI,GAE3E,aAAa;GAGf,IAAI,KAAK,SAAS,KAAK,MAAM,aAAc,OAAO,KAAK,GACrD;GAGF,KAAK,MAAM,SAAS,KAAK,MAAM;GAC/B,QAAQ;EACV;EAEA,KAAK,MAAM,SAAS;CACtB;;;;;CAMA,UAAwB;EAEtB,KAAK,IAAI,IAAI,KAAK,MAAM,KAAK,MAAM,SAAS,CAAC,IAAI,GAAG,KAAK,GAAG,KAC1D,KAAK,WAAW,CAAC;CAErB;;;;CASA,QAA0B;EACxB,MAAM,QAAQ,IAAI,cAAiB;GACjC,SAAS,KAAK;GACd,IAAI,KAAK;EACX,CAAC;EACD,MAAM,QAAQ,KAAK,MAAM,MAAM;EAC/B,OAAO;CACT;;;;;CAMA,WAAoB;EAClB,KAAK,IAAI,IAAI,GAAG,IAAI,KAAK,MAAM,QAAQ,KAAK;GAC1C,MAAM,iBAAiB,IAAI,IAAI;GAC/B,MAAM,kBAAkB,IAAI,IAAI;GAEhC,IACE,iBAAiB,KAAK,MAAM,UAC5B,KAAK,SAAS,KAAK,MAAM,IAAK,KAAK,MAAM,eAAgB,IAAI,GAE7D,OAAO;GAGT,IACE,kBAAkB,KAAK,MAAM,UAC7B,KAAK,SAAS,KAAK,MAAM,IAAK,KAAK,MAAM,gBAAiB,IAAI,GAE9D,OAAO;EAEX;EAEA,OAAO;CACT;;;;CAKA,WAAmB;EACjB,OAAO,iBAAiB,KAAK,MAAM,KAAK,IAAI,EAAE;CAChD;AACF;;;;;;;;;;;;;;;;;AAkBA,SAAgB,cACd,+BAIkB;CAElB,IAAI,OAAO,kCAAkC,YAC3C,OAAO,IAAI,cAAiB,EAC1B,SAAS,8BACX,CAAC;CAIH,IAAI,iCAAiC,OAAO,YAAY,+BAA+B;EACrF,MAAM,KAAK,IAAI,cAAiB;EAChC,GAAG,OAAO,6BAA4C;EACtD,OAAO;CACT;CAEA,OAAO,IAAI,cACT,6BACF;AACF;;AC7WA,SAAS,SAAe,MAA0B;CAChD,OAAO,SAAS,OAAO,IAAI,KAAK;AAClC;AAEA,SAAS,OAAa,MAA0B;CAC9C,OAAO,SAAS,OAAO,IAAI,KAAK;AAClC;;AAGA,IAAM,UAAN,MAAoB;CAClB;CAEA,YAAY,MAAyB;EACnC,KAAK,OAAO;CACd;CAEA,UAAU,MAAqB;EAC7B,OAAO,SAAS,OAAO,KAAK,KAAK,OAAO,QAAQ,KAAK;CACvD;;CAGA,KAAK,MAAkB,MAAS,KAAQ,OAAmB,OAAuB;EAChF,IAAI,UAAU,KAAA,GAAW,QAAQ,SAAS,OAAO,MAAM,KAAK,KAAK,OAAO,QAAQ,KAAK,SAAS,GAAG;EACjG,OAAO;GACL;GACA;GACA;GACA;GACA;GACA,QAAQ,IAAI,KAAK,IAAI,SAAS,IAAI,GAAG,SAAS,KAAK,CAAC;GACpD,MAAM,OAAO,IAAI,IAAI,IAAI,OAAO,KAAK;GACrC,SAAS,UAAU,OAAO,QAAQ,KAAK,KAAK,OAAO,QAAQ,OAAO,MAAM,OAAO;EACjF;CACF;;CAGA,UAAU,GAAe,OAA+B;EACtD,OAAO,KAAK,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,OAAO,EAAE,KAAK;CACxD;CAEA,WAAW,GAA2B;EACpC,MAAM,IAAI,EAAE;EACZ,OAAO,KAAK,KAAK,KAAK,UAAU,GAAG,EAAE,IAAI,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK;CACpE;CAEA,YAAY,GAA2B;EACrC,MAAM,IAAI,EAAE;EACZ,OAAO,KAAK,UAAU,GAAG,KAAK,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,CAAC;CACrE;;CAGA,UAAU,MAAkB,MAAS,KAAQ,OAA+B;EAC1E,MAAM,IAAI,KAAK;EACf,IAAI,SAAS,CAAC,KAAK,SAAS,KAAK,IAAI,GAAG;GACtC,MAAM,IAAI,KAAK,KAAK,GAAG,MAAM,KAAK,KAAK;GACvC,IAAI,EAAE,UAAU,SAAS,KAAK,IAAI,IAAI,GAAG,OAAO,KAAK,UAAU,MAAM,CAAC;GACtE,OAAO,KAAK,WAAW,KAAK,UAAU,MAAM,KAAK,YAAY,CAAC,CAAC,CAAC;EAClE;EACA,MAAM,IAAI,KAAK,UAAU,GAAI,MAAM,KAAK,KAAK;EAC7C,MAAM,SAAS,KAAK,UAAU,MAAM,CAAC;EACrC,OAAO,EAAE,UAAU,SAAS,KAAK,IAAI,IAAI,IAAI,SAAS,KAAK,WAAW,MAAM;CAC9E;;CAGA,SAAS,MAAkB,MAAS,KAAQ,OAAmB,OAAuB;EACpF,MAAM,IAAI,MAAM;EAChB,IAAI,SAAS,CAAC,KAAK,SAAS,IAAI,IAAI,GAAG;GACrC,MAAM,IAAI,KAAK,KAAK,MAAM,MAAM,KAAK,GAAG,KAAK;GAC7C,IAAI,EAAE,UAAU,SAAS,MAAM,KAAK,IAAI,GAAG,OAAO,KAAK,KAAK,GAAG,MAAM,MAAM,MAAM,KAAK,MAAM,KAAK;GACjG,OAAO,KAAK,YAAY,KAAK,KAAK,KAAK,WAAW,CAAC,GAAG,MAAM,MAAM,MAAM,KAAK,MAAM,KAAK,CAAC;EAC3F;EACA,MAAM,IAAI,KAAK,SAAS,MAAM,MAAM,KAAK,GAAI,KAAK;EAClD,MAAM,SAAS,KAAK,KAAK,GAAG,MAAM,MAAM,MAAM,KAAK,MAAM,KAAK;EAC9D,OAAO,EAAE,UAAU,SAAS,MAAM,KAAK,IAAI,IAAI,SAAS,KAAK,YAAY,MAAM;CACjF;;;;;CAMA,KAAK,MAAkB,MAAS,KAAQ,OAAmB,OAAuB;EAChF,IAAI,SAAS,IAAI,IAAI,SAAS,KAAK,IAAI,GAAG,OAAO,KAAK,UAAU,MAAO,MAAM,KAAK,KAAK;EACvF,IAAI,SAAS,KAAK,IAAI,SAAS,IAAI,IAAI,GAAG,OAAO,KAAK,SAAS,MAAM,MAAM,KAAK,OAAQ,KAAK;EAC7F,OAAO,KAAK,KAAK,MAAM,MAAM,KAAK,OAAO,KAAK;CAChD;;CAGA,UAAU,MAA4C;EACpD,IAAI,KAAK,UAAU,MAAM,OAAO,CAAC,KAAK,MAAM,IAAI;EAChD,MAAM,CAAC,MAAM,QAAQ,KAAK,UAAU,KAAK,KAAK;EAC9C,OAAO,CAAC,KAAK,KAAK,KAAK,MAAM,KAAK,MAAM,KAAK,KAAK,MAAM,KAAK,KAAK,GAAG,IAAI;CAC3E;CAEA,OAAO,MAAkB,OAA+B;EACtD,IAAI,SAAS,MAAM,OAAO;EAC1B,IAAI,UAAU,MAAM,OAAO;EAC3B,MAAM,CAAC,MAAM,QAAQ,KAAK,UAAU,IAAI;EACxC,OAAO,KAAK,KAAK,MAAM,KAAK,MAAM,KAAK,KAAK,KAAK;CACnD;;CAGA,QAAQ,MAAkB,OAAyC;EACjE,IAAI,SAAS,MAAM,OAAO,CAAC,MAAM,IAAI;EACrC,MAAM,SAAS,OAAO,KAAK,IAAI;EAC/B,IAAI,SAAS,QAAQ;GACnB,MAAM,CAAC,GAAG,KAAK,KAAK,QAAQ,KAAK,MAAM,KAAK;GAC5C,OAAO,CAAC,GAAG,KAAK,KAAK,GAAG,KAAK,MAAM,KAAK,KAAK,KAAK,KAAK,CAAC;EAC1D;EACA,MAAM,CAAC,GAAG,KAAK,KAAK,QAAQ,KAAK,OAAO,QAAQ,SAAS,CAAC;EAC1D,OAAO,CAAC,KAAK,KAAK,KAAK,MAAM,KAAK,MAAM,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,CAAC;CACrE;;CAGA,QAAQ,MAAkB,WAAmC,KAAkC;EAC7F,IAAI,SAAS,MAAM,OAAO,CAAC,MAAM,IAAI;EACrC,MAAM,EAAE,YAAY,KAAK,KAAK;EAC9B,MAAM,cAAc,KAAK,SAAS,OAAO,MAAM,QAAQ,KAAK,KAAK,KAAK,OAAO;EAC7E,IAAI,KAAK,SAAS,QAAQ,UAAU,WAAW,GAAG;GAChD,MAAM,CAAC,GAAG,KAAK,KAAK,QAAQ,KAAK,MAAM,WAAW,GAAG;GACrD,OAAO,CAAC,GAAG,KAAK,KAAK,GAAG,KAAK,MAAM,KAAK,KAAK,KAAK,KAAK,CAAC;EAC1D;EACA,MAAM,cAAc,QAAQ,aAAa,KAAK,GAAG;EACjD,IAAI,UAAU,WAAW,GAAG,OAAO,CAAC,KAAK,MAAM,KAAK,KAAK,MAAM,KAAK,MAAM,KAAK,KAAK,KAAK,KAAK,CAAC;EAC/F,MAAM,CAAC,GAAG,KAAK,KAAK,QAAQ,KAAK,OAAO,WAAW,WAAW;EAC9D,OAAO,CAAC,KAAK,KAAK,KAAK,MAAM,KAAK,MAAM,KAAK,KAAK,GAAG,KAAK,KAAK,GAAG,CAAC;CACrE;;CAGA,UAAU,MAAkB,OAAe,MAAS,KAAoB;EACtE,MAAM,SAAS,OAAO,KAAK,IAAI;EAC/B,IAAI,UAAU,QAAQ,OAAO,KAAK,KAAK,KAAK,MAAM,MAAM,KAAK,KAAK,KAAK;EACvE,IAAI,QAAQ,QAAQ,OAAO,KAAK,KAAK,KAAK,UAAU,KAAK,MAAO,OAAO,MAAM,GAAG,GAAG,KAAK,MAAM,KAAK,KAAK,KAAK,KAAK;EAClH,OAAO,KAAK,UAAU,MAAM,KAAK,UAAU,KAAK,OAAQ,QAAQ,SAAS,GAAG,MAAM,GAAG,CAAC;CACxF;;CAGA,SAAS,MAAkB,OAAe,MAAS,KAAoB;EACrE,IAAI,SAAS,MAAM,OAAO,KAAK,KAAK,MAAM,MAAM,KAAK,IAAI;EACzD,MAAM,SAAS,OAAO,KAAK,IAAI;EAC/B,IAAI,SAAS,QAAQ,OAAO,KAAK,KAAK,KAAK,SAAS,KAAK,MAAM,OAAO,MAAM,GAAG,GAAG,KAAK,MAAM,KAAK,KAAK,KAAK,KAAK;EACjH,OAAO,KAAK,KAAK,KAAK,MAAM,KAAK,MAAM,KAAK,KAAK,KAAK,SAAS,KAAK,OAAO,QAAQ,SAAS,GAAG,MAAM,GAAG,GAAG,KAAK,KAAK;CACvH;;;;;;CAOA,YAAY,MAAkB,OAAe,QAAkC;EAC7E,MAAM,SAAS,OAAO,KAAK,IAAI;EAC/B,IAAI,QAAQ,QAAQ,OAAO,KAAK,KAAK,KAAK,YAAY,KAAK,MAAO,OAAO,MAAM,GAAG,KAAK,MAAM,KAAK,KAAK,KAAK,KAAK;EACjH,IAAI,QAAQ,QAAQ,OAAO,KAAK,KAAK,KAAK,MAAM,KAAK,MAAM,KAAK,KAAK,KAAK,YAAY,KAAK,OAAQ,QAAQ,SAAS,GAAG,MAAM,GAAG,KAAK,KAAK;EAC1I,IAAI,QAAQ,KAAK;EACjB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,QAAQ,KAAK,SAAS,OAAO,IAAI,GAAG,OAAO,IAAK,KAAK,KAAK,QAAQ,OAAO,EAAG,CAAC;EACrH,OAAO,KAAK,KAAK,KAAK,MAAM,OAAO,IAAK,KAAK,KAAK,QAAQ,OAAO,EAAG,GAAG,KAAK;CAC9E;;CAGA,SAAS,MAAkB,OAA2B;EACpD,MAAM,SAAS,OAAO,KAAK,IAAI;EAC/B,IAAI,UAAU,QAAQ,OAAO,KAAK,OAAO,KAAK,MAAM,KAAK,KAAK;EAC9D,IAAI,QAAQ,QAAQ,OAAO,KAAK,KAAK,KAAK,SAAS,KAAK,MAAO,KAAK,GAAG,KAAK,MAAM,KAAK,KAAK,KAAK,KAAK;EACtG,OAAO,KAAK,KAAK,KAAK,MAAM,KAAK,MAAM,KAAK,KAAK,KAAK,SAAS,KAAK,OAAQ,QAAQ,SAAS,CAAC,GAAG,KAAK,KAAK;CAC7G;;CAGA,OAAO,MAAkB,OAAkB;EACzC,IAAI,OAAO;EACX,SAAS;GACP,MAAM,SAAS,OAAO,KAAK,IAAI;GAC/B,IAAI,UAAU,QAAQ,OAAO,KAAK;GAClC,IAAI,QAAQ,QAAQ,OAAO,KAAK;QAC3B;IACH,SAAS,SAAS;IAClB,OAAO,KAAK;GACd;EACF;CACF;;CAGA,KAAK,MAAkB,OAA2B;EAChD,MAAM,EAAE,UAAU,KAAK;EACvB,IAAI,UAAU,KAAA,KAAa,SAAS,QAAQ,QAAQ,KAAK,QAAQ,KAAK,KAAK,MAAM,OAAO;EACxF,MAAM,SAAS,MAAM,KAAK,OAAO,MAAM,KAAK,GAAG,KAAK,OAAO,MAAM,QAAQ,CAAC,CAAC;EAC3E,IAAI,WAAW,KAAA,GAAW,OAAO;EACjC,OAAO,KAAK,SAAS,KAAK,UAAU,MAAM,OAAO,QAAQ,KAAK,KAAK,QAAQ,MAAM,CAAC,GAAG,QAAQ,CAAC;CAChG;;CAGA,MAAM,OAAqB,IAAY,IAAwB;EAC7D,IAAI,MAAM,IAAI,OAAO;EACrB,MAAM,MAAO,KAAK,OAAQ;EAC1B,MAAM,OAAO,MAAM;EACnB,OAAO,KAAK,KAAK,KAAK,MAAM,OAAO,IAAI,GAAG,GAAG,MAAM,KAAK,KAAK,QAAQ,IAAI,GAAG,KAAK,MAAM,OAAO,MAAM,GAAG,EAAE,CAAC;CAC5G;AACF;;AAGA,MAAM,aAAa;;AAGnB,MAAM,2BAAW,IAAI,QAA2C;AAEhE,SAAS,UAAgB,MAAwC;CAC/D,IAAI,UAAU,SAAS,IAAI,IAAI;CAC/B,IAAI,YAAY,KAAA,GAAW;EACzB,UAAU,IAAI,QAAQ,IAAI;EAC1B,SAAS,IAAI,MAAM,OAAoC;CACzD;CACA,OAAO;AACT;AAEA,UAAU,KAAW,MAAiD;CAEpE,MAAM,QAAsB,CAAC;CAC7B,IAAI,OAAO;CACX,OAAO,SAAS,QAAQ,MAAM,SAAS,GAAG;EACxC,OAAO,SAAS,MAAM;GACpB,MAAM,KAAK,IAAI;GACf,OAAO,KAAK;EACd;EACA,MAAM,MAAM,MAAM,IAAI;EACtB,MAAM,IAAI;EACV,OAAO,IAAI;CACb;AACF;;AAGA,SAAS,QAAQ,OAAe,MAAsB;CACpD,IAAI,CAAC,OAAO,UAAU,KAAK,GAAG,OAAO;CACrC,MAAM,KAAK,QAAQ,IAAI,OAAO,QAAQ;CACtC,OAAO,MAAM,KAAK,KAAK,OAAO,KAAK;AACrC;AAEA,SAASC,QAAM,OAAe,MAAsB;CAClD,IAAI,OAAO,MAAM,KAAK,GAAG,OAAO;CAChC,MAAM,QAAQ,KAAK,MAAM,KAAK;CAC9B,OAAO,QAAQ,IAAI,KAAK,IAAI,GAAG,OAAO,KAAK,IAAI,KAAK,IAAI,OAAO,IAAI;AACrE;;;;;AAMA,IAAa,cAAb,MAAa,YAAqD;CAChE;CACA;CAEA,YAAoB,SAAiC,MAA2B;EAC9E,KAAK,UAAU;EACf,KAAK,OAAO;CACd;;CAGA,OAAO,GAAkB,MAAkC,SAAyB,CAAC,GAA+B;EAClH,MAAM,UAAU,UAAU,IAAI;EAC9B,MAAM,QAAQ,CAAC,GAAG,MAAM;EACxB,OAAO,IAAI,YAAY,SAAS,QAAQ,MAAM,OAAO,GAAG,MAAM,MAAM,CAAC;CACvE;CAEA,KAAa,MAAuD;EAClE,OAAO,SAAS,KAAK,OAAO,OAAO,IAAI,YAAY,KAAK,SAAS,IAAI;CACvE;CAEA,OAAe,QAA0E;EACvF,IAAI,kBAAkB,aAAa;GACjC,IAAI,OAAO,YAAY,KAAK,SAAS,MAAM,IAAI,UAAU,iDAAiD;GAC1G,OAAO,OAAO;EAChB;EACA,MAAM,QAAQ,CAAC,GAAG,MAAM;EACxB,OAAO,KAAK,QAAQ,MAAM,OAAO,GAAG,MAAM,MAAM;CAClD;;CAGA,IAAI,OAAmC;EACrC,OAAO,KAAK,QAAQ;CACtB;;CAGA,IAAI,OAAe;EACjB,OAAO,OAAO,KAAK,IAAI;CACzB;CAEA,IAAI,UAAmB;EACrB,OAAO,KAAK,SAAS;CACvB;;CAGA,IAAI,UAAmB;EACrB,OAAO,KAAK,QAAQ,UAAU,KAAK,IAAI;CACzC;;CAGA,IAAI,SAAiB;EACnB,OAAO,SAAS,KAAK,IAAI;CAC3B;;;;;CAMA,GAAG,OAAiC;EAClC,QAAQ,QAAQ,OAAO,KAAK,IAAI;EAChC,OAAO,UAAU,KAAK,KAAA,IAAY,KAAK,QAAQ,OAAO,KAAK,MAAO,KAAK;CACzE;;CAGA,UAAU,QAAQ,GAAG,MAAc,KAAK,MAAe;EACrD,OAAO,KAAK,MAAM,OAAO,GAAG,CAAC,CAAC;CAChC;;CAGA,OAAO,OAAgF;EACrF,MAAM,SAAS,KAAK,QAAQ,OAAO,KAAK,MAAM,KAAK,OAAO,KAAK,CAAC;EAChE,OAAO,KAAK,KAAK,KAAK,QAAQ,KAAK,QAAQ,KAAK,OAAO,CAAC,CAAC;CAC3D;;CAGA,QAAQ,OAAyE;EAC/E,MAAM,CAAC,MAAM,SAAS,KAAK,QAAQ,QAAQ,KAAK,MAAMA,QAAM,OAAO,KAAK,IAAI,CAAC;EAC7E,OAAO,CAAC,KAAK,KAAK,IAAI,GAAG,KAAK,KAAK,KAAK,CAAC;CAC3C;;;;;;CAOA,MAAM,WAAmG;EACvG,MAAM,CAAC,MAAM,SAAS,KAAK,QAAQ,QAAQ,KAAK,MAAM,WAAW,KAAK,QAAQ,KAAK,OAAO,KAAK;EAC/F,OAAO,CAAC,KAAK,KAAK,IAAI,GAAG,KAAK,KAAK,KAAK,CAAC;CAC3C;;;;;CAMA,OAAO,WAAmF;EACxF,MAAM,EAAE,YAAY,KAAK,QAAQ,KAAK;EACtC,IAAI,OAAO,KAAK;EAChB,IAAI,MAAM,KAAK,QAAQ,KAAK,OAAO;EACnC,IAAI,QAAQ;EACZ,OAAO,SAAS,MAAM;GACpB,MAAM,cAAc,KAAK,SAAS,OAAO,MAAM,QAAQ,KAAK,KAAK,KAAK,OAAO;GAC7E,IAAI,KAAK,SAAS,QAAQ,UAAU,WAAW,GAAG;IAChD,OAAO,KAAK;IACZ;GACF;GACA,MAAM,UAAU,QAAQ,aAAa,KAAK,GAAG;GAC7C,IAAI,UAAU,OAAO,GAAG,OAAO;IAAE,OAAO,QAAQ,OAAO,KAAK,IAAI;IAAG,MAAM,KAAK;IAAM,QAAQ;IAAa;GAAQ;GACjH,SAAS,OAAO,KAAK,IAAI,IAAI;GAC7B,MAAM;GACN,OAAO,KAAK;EACd;CAEF;;;;;;;;;;;CAYA,OAAO,KAAmC,QAAmD;EAC3F,IAAI,EAAE,UAAU,IAAI,OAAO,KAAA;EAC3B,IAAI,OAAO,KAAK;EAChB,IAAI,QAAQ;EACZ,IAAI,OAAO;EACX,OAAO,SAAS,MAAM;GACpB,IAAI,KAAK,SAAS,MAAM;IACtB,MAAM,OAAO,IAAI,KAAK,KAAK,OAAO;IAClC,IAAI,OAAO,MAAM;KACf,OAAO,KAAK;KACZ;IACF;IACA,QAAQ;IACR,SAAS,KAAK,KAAK;GACrB;GACA,MAAM,MAAM,IAAI,KAAK,GAAG;GACxB,IAAI,OAAO,KAAK,OAAO;IAAE;IAAO,MAAM,KAAK;IAAM,QAAQ;GAAK;GAC9D,QAAQ;GACR,SAAS;GACT,OAAO,KAAK;EACd;CAEF;;CAGA,MAAM,QAAQ,GAAG,MAAc,KAAK,MAAkC;EACpE,MAAM,OAAOA,QAAM,OAAO,KAAK,IAAI;EACnC,MAAM,KAAKA,QAAM,KAAK,KAAK,IAAI;EAC/B,IAAI,MAAM,MAAM,OAAO,KAAK,KAAK,IAAI;EACrC,MAAM,GAAG,QAAQ,KAAK,QAAQ,QAAQ,KAAK,MAAM,IAAI;EACrD,MAAM,CAAC,UAAU,KAAK,QAAQ,QAAQ,MAAM,KAAK,IAAI;EACrD,OAAO,KAAK,KAAK,MAAM;CACzB;;;;;CAMA,OAAO,OAAe,cAAsB,KAAK,MAAM,WAAwD,CAAC,GAA+B;EAC7I,MAAM,OAAOA,QAAM,OAAO,KAAK,IAAI;EACnC,MAAM,QAAQ,KAAK,IAAI,GAAG,KAAK,IAAI,OAAO,MAAM,WAAW,IAAI,IAAI,KAAK,MAAM,WAAW,GAAG,KAAK,OAAO,IAAI,CAAC;EAC7G,MAAM,UAAU,KAAK;EACrB,MAAM,SAAS,oBAAoB,cAAc,KAAA,IAAY,CAAC,GAAG,QAAQ;EACzE,MAAM,QAAQ,WAAW,KAAA,IAAa,SAAwC,OAAO,OAAO;EAC5F,IAAI,UAAU,KAAK,UAAU,GAAG,OAAO;EACvC,IAAI,OAAO,KAAK;EAChB,IAAI,WAAW,KAAA,KAAa,QAAQ,SAAS,YAAY;GAEvD,MAAM,WAAW,KAAK,IAAI,OAAO,KAAK;GACtC,IAAI,QAAQ,KAAK,QAAQ,OAAO;IAE9B,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,GAAG,KAAK,OAAO,QAAQ,UAAU,MAAO,OAAO,GAAG,OAAO,IAAK,QAAQ,KAAK,QAAQ,OAAO,EAAG,CAAC;IAC1H,OAAO,QAAQ,YAAY,MAAO,OAAO,QAAQ,GAAG,OAAO,MAAM,QAAQ,CAAC,CAAC;GAC7E,OAAO,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK;IACrC,MAAM,OAAO,OAAO;IACpB,MAAM,MAAM,QAAQ,KAAK,QAAQ,IAAI;IACrC,OAAO,IAAI,WAAW,QAAQ,UAAU,MAAO,OAAO,GAAG,MAAM,GAAG,IAAI,QAAQ,SAAS,MAAM,OAAO,GAAG,MAAM,GAAG;GAClH;GACA,KAAK,IAAI,IAAI,UAAU,IAAI,OAAO,KAAK,OAAO,QAAQ,SAAS,MAAO,OAAO,KAAK;EACpF,OAAO;GACL,MAAM,SAAS,WAAW,KAAA,IAAY,KAAK,OAAO,QAAQ,IAAI,QAAQ,MAAM,QAAQ,GAAG,OAAO,MAAM;GACpG,MAAM,CAAC,MAAM,QAAQ,QAAQ,QAAQ,MAAM,IAAI;GAC/C,MAAM,GAAG,SAAS,QAAQ,QAAQ,MAAM,KAAK;GAC7C,OAAO,QAAQ,OAAO,QAAQ,OAAO,MAAM,MAAM,GAAG,KAAK;EAC3D;EAEA,IAAI,QAAQ,GAAG,OAAO,QAAQ,KAAK,MAAM,OAAO,QAAQ,CAAC;EACzD,OAAO,KAAK,KAAK,QAAQ,KAAK,MAAM,OAAO,CAAC,CAAC;CAC/C;;CAGA,OAAO,OAAe,UAAmF;EACvG,OAAO,KAAK,OAAO,OAAO,GAAG,QAAQ;CACvC;;CAGA,OAAO,OAAe,MAAc,KAAK,MAAkC;EACzE,MAAM,OAAOA,QAAM,OAAO,KAAK,IAAI;EACnC,OAAO,KAAK,OAAO,MAAM,KAAK,IAAI,GAAGA,QAAM,KAAK,KAAK,IAAI,IAAI,IAAI,CAAC;CACpE;;;;;;CAOA,IAAI,OAAe,MAAwC;EACzD,MAAM,KAAK,QAAQ,OAAO,KAAK,IAAI;EACnC,OAAO,OAAO,KAAK,OAAO,KAAK,KAAK,KAAK,QAAQ,UAAU,KAAK,MAAO,IAAI,MAAM,KAAK,QAAQ,KAAK,QAAQ,IAAI,CAAC,CAAC;CACnH;;CAGA,OAAO,GAAG,QAA4C;EACpD,OAAO,KAAK,OAAO,MAAM;CAC3B;;CAGA,QAAQ,GAAG,QAA4C;EACrD,MAAM,SAAS,KAAK,QAAQ,OAAO,KAAK,OAAO,MAAM,GAAG,KAAK,IAAI;EACjE,OAAO,KAAK,KAAK,KAAK,QAAQ,KAAK,QAAQ,OAAO,SAAS,CAAC,CAAC;CAC/D;;CAGA,CAAC,OAAO,YAA4B;EAClC,OAAO,KAAK,KAAK,IAAI;CACvB;;CAGA,UAAkB;EAChB,OAAO,CAAC,GAAG,KAAK,KAAK,IAAI,CAAC;CAC5B;AACF;;;;;AAMA,SAAgB,YAA2B,MAAkC,SAAyB,CAAC,GAA+B;CACpI,OAAO,YAAY,GAAG,MAAM,MAAM;AACpC;;;;;;;;;;;;;;;;ACziBA,SAAgB,cAAc,UAAkB,OAAuB;CACrE,IAAI,CAAC,OAAO,cAAc,QAAQ,KAAK,WAAW,GAChD,MAAM,IAAI,WAAW,GAAG,MAAM,sDAAsD,OAAO,QAAQ,GAAG;CAExG,OAAO;AACT;;;;;;;;;;;;;;;;;;;;;;;;AC8CA,SAAgB,YACd,SACkD;CAClD,MAAM,EAAE,SAAS,SAAS,eAAe;CACzC,MAAM,WAAW,cAAc,QAAQ,UAAU,aAAa;CAE9D,QAAQ,SAA+C;EAErD,MAAM,kBAAkB,SAAY,WAA6B,YAAkB;GAEjF,IAAI,YAAY;IACd,MAAM,UAA8B;KAClC,YAAY;KACZ,aAAa,KAAK;KAClB;KACA,WAAW,KAAK,IAAI;IACtB;IACA,WAAW,OAAO;GACpB;GAGA,QAAQ,QAAR;IACE,KAAK,SACH,MAAM,IAAI,MAAM,2BAA2B,SAAS,EAAE;IAExD,KAAK;KAEH,IAAI,CAAC,KAAK,SAAS;MACjB,IAAI,aAAa,QAAQ,KAAK,IAAI;WAC7B,KAAK,MAAM;KAClB;KACA;IAEF,KAAK,eAEH;IAEF,KAAK,UAEH;IAEF,KAAK,QAEH;IAEF,KAAK,SACH,MAAM,IAAI,MAAM,iDAAiD;IAEnE,SACE,MAAM,IAAI,MAAM,4BAA4B,QAAQ;GACxD;EACF;EAGA,MAAM,WAAW,UAA2B,WAAW,gBAAgB,KAAK,IAAI,GAAG,QAAQ,CAAC,IAAI;EAEhG,OAAO,IAAI,MAAM,MAAM,EACrB,IAAI,QAAQ,MAAM,UAAU;GAE1B,IAAI,SAAS,YACX,OAAO;GAIT,IAAI,SAAS,UACX,OAAO,OAAO,QAAQ;GAIxB,IAAI,SAAS,qBACX,OAAO,KAAK,IAAI,GAAG,WAAW,OAAO,IAAI;GAG3C,MAAM,QAAQ,QAAQ,IAAI,QAAQ,MAAM,QAAQ;GAGhD,IAAI,OAAO,UAAU,YACnB,QAAQ,MAAR;IACE,KAAK,OACH,OAAO,SAAU,SAAqB;KACpC,IAAI,OAAO,QAAQ,YAAY,WAAW,QAAQ;MAChD,eAAe,OAAO;MACtB,IAAI,WAAW,YAAY,WAAW,eACpC,OAAO;KAEX;KACA,OAAQ,MAAmB,KAAK,QAAQ,OAAO;IACjD;IAEF,KAAK,QACH,OAAO,SAAU,SAAkB;KACjC,IAAI,OAAO,QAAQ,YAAY,WAAW,QAAQ;MAChD,eAAe,OAAO;MACtB,IAAI,WAAW,YAAY,WAAW,eACpC;KAEJ;KACA,MAAoB,KAAK,QAAQ,OAAO;IAC1C;IAEF,KAAK,WACH,OAAO,SAAU,SAAkB;KACjC,IAAI,OAAO,QAAQ,YAAY,WAAW,QAAQ;MAEhD,eAAe,SAAS,MAAM;MAC9B,IAAI,WAAW,YAAY,WAAW,eACpC;KAEJ;KACA,MAAoB,KAAK,QAAQ,OAAO;IAC1C;IAEF,KAAK,UACH,OAAO,SAAU,OAAe,SAAkB;KAChD,IAAI,KAAK;KACT,IAAI,OAAO,QAAQ,YAAY,WAAW,QAAQ;MAChD,eAAe,OAAO;MACtB,IAAI,WAAW,YAAY,WAAW,eACpC;MAEF,KAAK,QAAQ,EAAE;KACjB;KACA,MAAoB,KAAK,QAAQ,IAAI,OAAO;IAC9C;IAEF,KAAK;IACL,KAAK,aACH,OAAO,SAAU,GAAG,MAAsB;KACxC,MAAM,WAAW,KAAK,KAAK,SAAS;KACpC,MAAM,gBAAgB,MAAM,KAAK,QAAQ;KAGzC,IAAI,OAAO,OAAO,cAAc,SAAS,YAAY,WAAW,QAAQ;MAGtE,IAAI,QAAQ;MACZ,IAAI,KAAK,KAAK;MACd,KAAK,MAAM,WAAW,eAAe;OACnC,IAAI,OAAO,QAAQ,UAAU;QAC3B,eAAe,OAAO;QACtB,IAAI,WAAW,YAAY,WAAW,eACpC;QAEF,KAAK,QAAQ,EAAE;OACjB;OACA,IAAI,SAAS,UACX,OAAO,IAAI,OAAO;YACb;QACL,OAAO,OAAO,IAAI,OAAO;QACzB;OACF;OACA,QAAQ;MACV;MACA,OAAO;KACT;KAEA,OAAQ,MAAmB,MAAM,QAAQ,IAAI;IAC/C;GACJ;GAGF,OAAO;EACT,EACF,CAAC;CACH;AACF;;;;AAKA,SAAgB,aACd,SACoD;CACpD,MAAM,EAAE,SAAS,SAAS,eAAe;CACzC,MAAM,WAAW,cAAc,QAAQ,UAAU,cAAc;CAE/D,QAAQ,SAAiD;EACvD,MAAM,kBAAkB,YAAqB;GAC3C,IAAI,YAAY;IACd,MAAM,UAA8B;KAClC,YAAY;KACZ,aAAa,KAAK;KAClB;KACA,WAAW,KAAK,IAAI;IACtB;IACA,WAAW,OAAO;GACpB;GAEA,QAAQ,QAAR;IACE,KAAK,SACH,MAAM,IAAI,MAAM,4BAA4B,SAAS,EAAE;IACzD,KAAK;KACH,IAAI,CAAC,KAAK,SACR,KAAK,KAAK;KAEZ;IACF,KAAK;IACL,KAAK,UACH;IACF,KAAK,QACH;IACF,KAAK,SACH,MAAM,IAAI,MAAM,iDAAiD;IACnE,SACE,MAAM,IAAI,MAAM,4BAA4B,QAAQ;GACxD;EACF;EAEA,OAAO,IAAI,MAAM,MAAM,EACrB,IAAI,QAAQ,MAAM,UAAU;GAC1B,IAAI,SAAS,YAAY,OAAO;GAChC,IAAI,SAAS,UAAU,OAAO,OAAO,QAAQ;GAC7C,IAAI,SAAS,qBAAqB,OAAO,KAAK,IAAI,GAAG,WAAW,OAAO,IAAI;GAE3E,MAAM,QAAQ,QAAQ,IAAI,QAAQ,MAAM,QAAQ;GAEhD,IAAI,OAAO,UAAU,YACnB,QAAQ,MAAR;IACE,KAAK;IACL,KAAK;IACL,KAAK,OACH,OAAO,SAAU,SAAqB;KACpC,IAAI,OAAO,QAAQ,YAAY,WAAW,QAAQ;MAChD,eAAe,OAAO;MACtB,IAAI,WAAW,YAAY,WAAW,eACpC,OAAO;KAEX;KACA,OAAQ,MAAmB,KAAK,QAAQ,OAAO;IACjD;GACJ;GAGF,OAAO;EACT,EACF,CAAC;CACH;AACF;;;;AAKA,SAAgB,aACd,SACoD;CACpD,MAAM,EAAE,SAAS,SAAS,eAAe;CACzC,MAAM,WAAW,cAAc,QAAQ,UAAU,cAAc;CAE/D,QAAQ,SAAiD;EACvD,MAAM,kBAAkB,YAAqB;GAC3C,IAAI,YAAY;IACd,MAAM,UAA8B;KAClC,YAAY;KACZ,aAAa,KAAK;KAClB;KACA,WAAW,KAAK,IAAI;IACtB;IACA,WAAW,OAAO;GACpB;GAEA,QAAQ,QAAR;IACE,KAAK,SACH,MAAM,IAAI,MAAM,4BAA4B,SAAS,EAAE;IACzD,KAAK;KACH,IAAI,CAAC,KAAK,SACR,KAAK,YAAY;KAEnB;IACF,KAAK;IACL,KAAK,UACH;IACF,KAAK,QACH;IACF,KAAK,SACH,MAAM,IAAI,MAAM,iDAAiD;IACnE,SACE,MAAM,IAAI,MAAM,4BAA4B,QAAQ;GACxD;EACF;EAEA,OAAO,IAAI,MAAM,MAAM,EACrB,IAAI,QAAQ,MAAM,UAAU;GAC1B,IAAI,SAAS,YAAY,OAAO;GAChC,IAAI,SAAS,UAAU,OAAO,OAAO,QAAQ;GAC7C,IAAI,SAAS,qBAAqB,OAAO,KAAK,IAAI,GAAG,WAAW,OAAO,IAAI;GAE3E,MAAM,QAAQ,QAAQ,IAAI,QAAQ,MAAM,QAAQ;GAEhD,IAAI,OAAO,UAAU,YACnB,QAAQ,MAAR;IACE,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK,OACH,OAAO,SAAU,SAAiB;KAChC,IAAI,OAAO,QAAQ,YAAY,WAAW,QAAQ;MAChD,eAAe,OAAO;MACtB,IAAI,WAAW,YAAY,WAAW,eACpC,OAAO,KAAK,WAAW,OAAO,KAAK,SAAS,QAAQ,QAAQ,KAAA;KAEhE;KACA,OAAQ,MAAmB,KAAK,QAAQ,OAAO;IACjD;GACJ;GAGF,OAAO;EACT,EACF,CAAC;CACH;AACF;;;;AAKA,SAAgB,WACd,SAG8D;CAC9D,MAAM,EAAE,SAAS,SAAS,eAAe;CACzC,MAAM,WAAW,cAAc,QAAQ,UAAU,YAAY;CAE7D,QAAQ,SAA2D;EACjE,IAAI,iBAAsB,CAAC;EAE3B,MAAM,kBAAkB,KAAQ,UAAmB;GACjD,IAAI,YACF,WAAW;IACT;IACA;IACA,aAAa,KAAK;IAClB;IACA,WAAW,KAAK,IAAI;GACtB,CAAC;GAGH,QAAQ,QAAR;IACE,KAAK,SACH,MAAM,IAAI,MAAM,0BAA0B,SAAS,EAAE;IACvD,KAAK;KAEH,IAAI,eAAe,SAAS,GAAG;MAC7B,MAAM,YAAY,eAAe,MAAM;MACvC,KAAK,OAAO,SAAS;KACvB;KACA;IACF,KAAK;IACL,KAAK,UACH;IACF,KAAK,QACH;IACF,KAAK,SACH,MAAM,IAAI,MAAM,iDAAiD;IACnE,SACE,MAAM,IAAI,MAAM,4BAA4B,QAAQ;GACxD;EACF;EAEA,OAAO,IAAI,MAAM,MAAM,EACrB,IAAI,QAAQ,MAAM,UAAU;GAC1B,IAAI,SAAS,YAAY,OAAO;GAChC,IAAI,SAAS,UAAU,OAAO,OAAO,QAAQ;GAC7C,IAAI,SAAS,qBAAqB,OAAO,KAAK,IAAI,GAAG,WAAW,OAAO,IAAI;GAE3E,MAAM,QAAQ,QAAQ,IAAI,QAAQ,MAAM,QAAQ;GAEhD,IAAI,OAAO,UAAU,YACnB,QAAQ,MAAR;IACE,KAAK,OACH,OAAO,SAAU,KAAQ,KAAuB;KAC9C,MAAM,SAAS,OAAO,IAAI,GAAG;KAE7B,IAAI,CAAC,UAAU,OAAO,QAAQ,YAAY,WAAW,QAAQ;MAC3D,eAAe,KAAK,GAAG;MACvB,IAAI,WAAW,YAAY,WAAW,eACpC;KAEJ;KAEA,MAAM,SAAU,MAAmB,KAAK,QAAQ,KAAK,GAAG;KAGxD,IAAI,CAAC,QACH,eAAe,KAAK,GAAG;KAGzB,OAAO;IACT;IAEF,KAAK,UACH,OAAO,SAAU,KAAuB;KACtC,MAAM,SAAU,MAAmB,KAAK,QAAQ,GAAG;KAEnD,iBAAiB,eAAe,QAAQ,MAAM,CAAC,OAAO,MAAM,GAAG,GAAG,CAAC;KACnE,OAAO;IACT;IAEF,KAAK,SACH,OAAO,WAAkB;KACvB,MAAoB,KAAK,MAAM;KAC/B,iBAAiB,CAAC;IACpB;GACJ;GAGF,OAAO;EACT,EACF,CAAC;CACH;AACF;;;;;AAMA,SAAgB,QACd,SACsC;CACtC,OAAO,YAAY,OAAO;AAC5B;;;;;ACtcA,MAAM,mCAAmB,IAAI,IAAI;CAE/B;CACA;CACA;CACA;CACA;CACA;CAGA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CAGA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CAGA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;;AAGD,MAAM,+BAAe,IAAI,IAAI;CAC3B;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;;;;AAKD,SAAS,eACP,eAAuB,qCACR;CACf,QAAQ,SAAe;EAErB,MAAM,wBAAQ,IAAI,IAAwD;EAC1E,OAAO,IAAI,MAAM,MAAM;GACrB,IAAI,QAAQ,MAAM;IAGhB,MAAM,QAAQ,QAAQ,IAAI,QAAQ,MAAM,MAAM;IAG9C,IAAI,OAAO,SAAS,YAAY,iBAAiB,IAAI,IAAI,GACnD;SAAA,OAAO,UAAU,YACnB,aAAa;MACX,MAAM,IAAI,MAAM,YAAY;KAC9B;IAAA;IAOJ,IAAI,OAAO,UAAU,cAAc,OAAO,SAAS,YAAY,aAAa,IAAI,IAAI,GAClF,OAAO,SAAqB,GAAG,MAAa;KAC1C,MAAM,SAAS,MAAM,MAAM,QAAQ,IAAI;KAEvC,OAAO,eAA8B,YAAY,CAAC,CAAC,MAAM;IAC3D;IAGF,IAAI,OAAO,UAAU,YAAY;KAC/B,MAAM,QAAQ,MAAM,IAAI,IAAI;KAC5B,IAAI,UAAU,KAAA,KAAa,MAAM,UAAU,OAAO,OAAO,MAAM;KAC/D,MAAM,SAAU,MAAmB,KAAK,MAAM;KAC9C,MAAM,IAAI,MAAM;MAAE;MAAO;KAAO,CAAC;KACjC,OAAO;IACT;IAEA,OAAO;GACT;GAEA,IAAI,SAAS,OAAO,QAAQ,WAAW;IAErC,MAAM,IAAI,MAAM,YAAY;GAC9B;GAEA,eAAe,SAAS,OAAO;IAE7B,MAAM,IAAI,MAAM,YAAY;GAC9B;EACF,CAAC;CACH;AACF;;;;;;;;;;;;AAaA,SAAgB,aACd,UAA2B,CAAC,GACC;CAE7B,OAAO,eADc,QAAQ,gBAAgB,6BACN;AACzC;;;;AAKA,SAAgB,cACd,UAA2B,CAAC,GACE;CAE9B,OAAO,eADc,QAAQ,gBAAgB,8BACN;AACzC;;;;AAKA,SAAgB,YACd,UAA2B,CAAC,GACO;CAEnC,OAAO,eADc,QAAQ,gBAAgB,4BACN;AACzC;;;;;;AAOA,SAAgB,mBACd,UAA2B,CAAC,GACO;CAEnC,OAAO,eADc,QAAQ,gBAAgB,mCACN;AACzC;;;;;AAMA,SAAgB,SACd,UAA2B,CAAC,GACb;CAEf,OAAO,eADc,QAAQ,gBAAgB,mCACR;AACvC;;;;AAKA,MAAa,mBAAyC;;;;AAKtD,MAAa,kBAAuC;;;;AAKpD,MAAa,yBAAqD;;;;;;;AChGlE,SAAgB,WAGd;CACA,QAAQ,SAA6D;EA0DnE,OAAO,OAAO,OAAO,MAAM,EAAE,MAAA;GAxD3B,IAAI,OAA0B;IAC5B,OAAO,eACC,KAAK,IAAI,KAAK,SACd,qBACR,CAAC,CAAC,MAAiB;KACjB,KAAK,UAAU,KAAK,KAAK;KACzB,WAAW;IACb,CAAC;GACH;GAEA,IAAI,OAAe,SAA+B;IAChD,OAAO,eACC,KAAK,IAAI,OAAO,OAAO,IAC5B,UAAU,OAAO,KAAK,CACzB;GACF;GAEA,SAAS,OAAkC;IACzC,OAAO,eACC,KAAK,SAAS,KAAK,IACxB,UAAU,OAAO,KAAK,CACzB;GACF;GAEA,QAAmB;IACjB,OAAO,KAAK,UAAU,OAAO,KAAK,KAAK,MAAM,CAAC;GAChD;GAEA,OAAkB;IAChB,OAAO,KAAK,UAAU,OAAO,KAAK,KAAK,KAAK,CAAC;GAC/C;GAEA,MAAiB;IACf,IAAI,KAAK,SAAS,OAAO;IACzB,OAAO,eACC,KAAK,IAAI,SACT,eACR,CAAC,CAAC,MAAiB;KACjB,KAAK,UAAU,KAAK,KAAK;KACzB,WAAW;IACb,CAAC;GACH;GAEA,QAAmB;IACjB,IAAI,KAAK,SAAS,OAAO;IACzB,OAAO,eACC,KAAK,MAAM,SACX,eACR,CAAC,CAAC,MAAiB;KACjB,KAAK,UAAU,KAAK,KAAK;KACzB,WAAW;IACb,CAAC;GACH;EAI8B,EAAE,CAAC;CACrC;AACF;;;;AAKA,SAAgB,YAGd;CACA,QAAQ,SAAgE;EAoCtE,OAAO,OAAO,OAAO,MAAM,EAAE,MAAA;GAlC3B,OAAkB;IAChB,IAAI,KAAK,SAAS,OAAO;IACzB,OAAO,eACC,KAAK,KAAK,SACV,gBACR,CAAC,CAAC,MAAiB;KACjB,KAAK,UAAU,KAAK,KAAK;KACzB,WAAW;IACb,CAAC;GACH;GAEA,OAAkB;IAChB,IAAI,KAAK,SAAS,OAAO;IACzB,OAAO,eACC,KAAK,KAAK,SACV,gBACR,CAAC,CAAC,MAAiB;KACjB,KAAK,UAAU,KAAK,KAAK;KACzB,WAAW;IACb,CAAC;GACH;GAEA,UAAqB;IACnB,IAAI,KAAK,SAAS,OAAO;IACzB,OAAO,eACC,KAAK,QAAQ,SACb,gBACR,CAAC,CAAC,MAAiB;KACjB,KAAK,UAAU,KAAK,KAAK;KACzB,WAAW;IACb,CAAC;GACH;EAG8B,EAAE,CAAC;CACrC;AACF;;;;AAKA,SAAgB,YAGd;CACA,QAAQ,SAAgE;EAsDtE,OAAO,OAAO,OAAO,MAAM,EAAE,MAAA;GApD3B,OAAkB;IAChB,OAAO,KAAK,UAAU,OAAO,KAAK,KAAK,UAAU,CAAC;GACpD;GAEA,OAAkB;IAGhB,IAAI,KAAK,SAAS,OAAO;IACzB,OAAO,KAAK,KAAK,UAAU,CAAM;GACnC;GAEA,UAAqB;IACnB,IAAI,KAAK,SAAS,OAAO;IACzB,OAAO,eACC,KAAK,QAAQ,SACb,gBACR,CAAC,CAAC,MAAiB;KACjB,KAAK,UAAU,KAAK,KAAK;KACzB,WAAW;IACb,CAAC;GACH;GAEA,YAAuB;IACrB,OAAO,KAAK,UAAU,OAAO,KAAK,KAAK,UAAU,CAAC;GACpD;GAEA,WAAsB;IACpB,OAAO,KAAK,UAAU,OAAO,KAAK,KAAK,SAAS,CAAC;GACnD;GAEA,YAAuB;IACrB,MAAM,SAAS,KAAK,UAAU;IAC9B,OAAO,WAAW,KAAA,IAAY,KAAK,MAAM,IAAI;GAC/C;GAEA,WAAsB;IACpB,MAAM,SAAS,KAAK,SAAS;IAC7B,OAAO,WAAW,KAAA,IAAY,KAAK,MAAM,IAAI;GAC/C;GAEA,MAAiB;IACf,IAAI,KAAK,SAAS,OAAO;IACzB,OAAO,eACC,KAAK,IAAI,SACT,gBACR,CAAC,CAAC,MAAiB;KACjB,KAAK,UAAU,KAAK,KAAK;KACzB,WAAW;IACb,CAAC;GACH;EAG8B,EAAE,CAAC;CACrC;AACF;;;;AAKA,SAAgB,UAGd;CACA,QACE,SACsD;EAqBtD,OAAO,OAAO,OAAO,MAAM,EAAE,MAAA;GAnB3B,IAAI,KAAmB;IACrB,OAAO,KAAK,IAAI,GAAG,IAAI,KAAK,KAAK,IAAI,GAAG,CAAC,IAAI;GAC/C;GAEA,IAAI,KAAQ,OAAyC;IACnD,OAAO,eACC,KAAK,IAAI,KAAK,KAAK,IACxB,UAAU,OAAO,KAAK,CACzB;GACF;GAEA,OAAO,KAAuC;IAC5C,OAAO,eACC,KAAK,OAAO,GAAG,IACpB,UAAU,OAAO,KAAK,CACzB;GACF;EAG8B,EAAE,CAAC;CACrC;AACF;;;;AAKA,SAAgB,OAAwC;CAEtD,QAAQ,SAAe;AACzB;;;;;;;ACzPA,SAAgB,cAQd;CACA,QAAQ,SAAkB;EACxB,MAAM,UAAU,IAAI,QAAuB;EAE3C,OAAO,IAAI,MAAM,MAAM,EACrB,IAAI,QAAQ,MAAM,UAAU;GAE1B,IAAI,SAAS,MACX,OAAO,QAAQ,GAAG,KAAK,OAAO;GAGhC,MAAM,QAAQ,QAAQ,IAAI,QAAQ,MAAM,QAAQ;GAEhD,IAAI,OAAO,UAAU,YACnB,QAAQ,MAAR;IACE,KAAK;IACL,KAAK,QACH,OAAO,SAAU,SAAiB;KAChC,MAAM,SAAU,MAAmB,KAAK,QAAQ,OAAO;KACvD,QAAQ,KAAK,OAAO,EAAE,OAAO,QAAQ,CAAC;KACtC,OAAO;IACT;IAEF,KAAK,WACH,OAAO,SAAU,SAAkB;KACjC,MAAoB,KAAK,QAAQ,OAAO;KACxC,QAAQ,KAAK,OAAO;MAAE,OAAO;MAAS,OAAO;KAAE,CAAC;IAClD;IAEF,KAAK,UACH,OAAO,SAAU,OAAe,SAAkB;KAChD,MAAoB,KAAK,QAAQ,OAAO,OAAO;KAC/C,QAAQ,KAAK,OAAO;MAAE,OAAO;MAAS;KAAM,CAAC;IAC/C;IAEF,KAAK,OACH,OAAO,SAAU,OAAe,SAAe;KAC7C,MAAM,WAAY,MAAmB,KAAK,QAAQ,OAAO,OAAO;KAChE,QAAQ,KAAK,OAAO;MAAE;MAAU,UAAU;MAAS;KAAM,CAAC;KAC1D,OAAO;IACT;IAEF,KAAK,UACH,OAAO,SAAU,SAAqB;KACpC,MAAM,SAAU,MAAmB,KAAK,QAAQ,OAAO;KACvD,IAAI,QACF,QAAQ,KAAK,UAAU,EAAE,OAAO,QAAQ,CAAC;KAE3C,OAAO;IACT;IAEF,KAAK,YACH,OAAO,SAAU,OAAkB;KACjC,MAAM,UAAW,MAAmB,KAAK,QAAQ,KAAK;KACtD,QAAQ,KAAK,UAAU;MAAE,OAAO;MAAS;KAAM,CAAC;KAChD,OAAO;IACT;IAEF,KAAK,OACH,OAAO,WAAe;KACpB,MAAM,UAAW,MAAmB,KAAK,MAAM;KAC/C,QAAQ,KAAK,UAAU,EAAE,OAAO,QAAQ,CAAC;KACzC,OAAO;IACT;IAEF,KAAK,SACH,OAAO,WAAe;KACpB,MAAM,UAAW,MAAmB,KAAK,MAAM;KAC/C,QAAQ,KAAK,UAAU;MAAE,OAAO;MAAS,OAAO;KAAE,CAAC;KACnD,OAAO;IACT;IAEF,KAAK,SACH,OAAO,WAAkB;KACvB,MAAoB,KAAK,MAAM;KAC/B,QAAQ,KAAK,SAAS,CAAC,CAAC;IAC1B;IAEF,KAAK,QACH,OAAO,SAAU,GAAG,MAAmB;KACrC,MAAoB,MAAM,QAAQ,IAAI;KACtC,QAAQ,KAAK,QAAQ,CAAC,CAAC;IACzB;IAEF,KAAK,WACH,OAAO,WAAkB;KACvB,MAAoB,KAAK,MAAM;KAC/B,QAAQ,KAAK,WAAW,CAAC,CAAC;IAC5B;GACJ;GAGF,OAAO;EACT,EACF,CAAC;CACH;AACF;;;;AAKA,SAAgB,eAQd;CACA,QAAQ,SAAmB;EACzB,MAAM,UAAU,IAAI,QAAwB;EAE5C,OAAO,IAAI,MAAM,MAAM,EACrB,IAAI,QAAQ,MAAM,UAAU;GAC1B,IAAI,SAAS,MACX,OAAO,QAAQ,GAAG,KAAK,OAAO;GAGhC,MAAM,QAAQ,QAAQ,IAAI,QAAQ,MAAM,QAAQ;GAEhD,IAAI,OAAO,UAAU,YACnB,QAAQ,MAAR;IACE,KAAK;IACL,KAAK;IACL,KAAK,OACH,OAAO,SAAU,SAAiB;KAChC,MAAM,SAAU,MAAmB,KAAK,QAAQ,OAAO;KACvD,IAAI,WAAW,OACb,QAAQ,KAAK,WAAW,EAAE,OAAO,QAAQ,CAAC;KAE5C,OAAO;IACT;IAEF,KAAK;IACL,KAAK,WACH,OAAO,WAAe;KACpB,MAAM,UAAW,MAAmB,KAAK,MAAM;KAC/C,QAAQ,KAAK,WAAW,EAAE,OAAO,QAAQ,CAAC;KAC1C,OAAO;IACT;IAEF,KAAK,SACH,OAAO,WAAkB;KACvB,MAAoB,KAAK,MAAM;KAC/B,QAAQ,KAAK,SAAS,CAAC,CAAC;IAC1B;GACJ;GAGF,OAAO;EACT,EACF,CAAC;CACH;AACF;;;;AAKA,SAAgB,eAQd;CACA,QAAQ,SAAmB;EACzB,MAAM,UAAU,IAAI,QAAwB;EAE5C,OAAO,IAAI,MAAM,MAAM,EACrB,IAAI,QAAQ,MAAM,UAAU;GAC1B,IAAI,SAAS,MACX,OAAO,QAAQ,GAAG,KAAK,OAAO;GAGhC,MAAM,QAAQ,QAAQ,IAAI,QAAQ,MAAM,QAAQ;GAEhD,IAAI,OAAO,UAAU,YACnB,QAAQ,MAAR;IACE,KAAK;IACL,KAAK;IACL,KAAK,QACH,OAAO,SAAU,SAAiB;KAChC,MAAM,SAAU,MAAmB,KAAK,QAAQ,OAAO;KACvD,QAAQ,KAAK,YAAY,EAAE,OAAO,QAAQ,CAAC;KAC3C,OAAO;IACT;IAEF,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK,OACH,OAAO,SAAU,SAAiB;KAChC,MAAM,SAAU,MAAmB,KAAK,QAAQ,OAAO;KACvD,QAAQ,KAAK,WAAW,EAAE,OAAO,QAAQ,CAAC;KAC1C,OAAO;IACT;IAEF,KAAK;IACL,KAAK;IACL,KAAK;IACL,KAAK,WACH,OAAO,WAAe;KACpB,MAAM,UAAW,MAAmB,KAAK,MAAM;KAC/C,IAAI,YAAY,KAAA,GACd,QAAQ,KAAK,eAAe,EAAE,OAAO,QAAQ,CAAC;KAEhD,OAAO;IACT;IAEF,KAAK;IACL,KAAK;IACL,KAAK,OACH,OAAO,WAAe;KACpB,MAAM,UAAW,MAAmB,KAAK,MAAM;KAC/C,IAAI,YAAY,KAAA,GACd,QAAQ,KAAK,cAAc,EAAE,OAAO,QAAQ,CAAC;KAE/C,OAAO;IACT;IAEF,KAAK,SACH,OAAO,WAAkB;KACvB,MAAoB,KAAK,MAAM;KAC/B,QAAQ,KAAK,SAAS,CAAC,CAAC;IAC1B;GACJ;GAGF,OAAO;EACT,EACF,CAAC;CACH;AACF;;;;AAKA,SAAgB,aAQd;CACA,QAAQ,SAAwB;EAC9B,MAAM,UAAU,IAAI,QAAyB;EAE7C,OAAO,IAAI,MAAM,MAAM,EACrB,IAAI,QAAQ,MAAM,UAAU;GAC1B,IAAI,SAAS,MACX,OAAO,QAAQ,GAAG,KAAK,OAAO;GAGhC,MAAM,QAAQ,QAAQ,IAAI,QAAQ,MAAM,QAAQ;GAEhD,IAAI,OAAO,UAAU,YACnB,QAAQ,MAAR;IACE,KAAK,OACH,OAAO,SAAU,KAAQ,KAAuB;KAC9C,MAAM,WAAY,MAAmB,KAAK,QAAQ,KAAK,GAAG;KAC1D,QAAQ,KAAK,OAAO;MAAE;MAAK,OAAO;MAAK;KAAS,CAAC;KACjD,OAAO;IACT;IAEF,KAAK,UACH,OAAO,SAAU,KAAuB;KACtC,MAAM,eAAgB,MAAmB,KAAK,QAAQ,GAAG;KACzD,IAAI,iBAAiB,KAAA,GACnB,QAAQ,KAAK,UAAU;MAAE;MAAK,OAAO;KAAa,CAAC;KAErD,OAAO;IACT;IAEF,KAAK,SACH,OAAO,WAAkB;KACvB,MAAoB,KAAK,MAAM;KAC/B,QAAQ,KAAK,SAAS,CAAC,CAAC;IAC1B;GACJ;GAGF,OAAO;EACT,EACF,CAAC;CACH;AACF;;;;AAKA,SAAgB,UAQd;CACA,QAAQ,SAAwB;EAC9B,MAAM,UAAU,IAAI,QAA6B;EAEjD,OAAO,IAAI,MAAM,MAAM,EACrB,IAAI,QAAQ,MAAM,UAAU;GAC1B,IAAI,SAAS,MACX,OAAO,QAAQ,GAAG,KAAK,OAAO;GAGhC,MAAM,QAAQ,QAAQ,IAAI,QAAQ,MAAM,QAAQ;GAEhD,IAAI,OAAO,UAAU,YACnB,QAAQ,MAAR;IACE,KAAK,OACH,OAAO,SAAU,SAAqB;KACpC,MAAM,SAAU,MAAmB,KAAK,QAAQ,OAAO;KACvD,IAAI,QACF,QAAQ,KAAK,OAAO,EAAE,OAAO,QAAQ,CAAC;KAExC,OAAO;IACT;IAEF,KAAK,UACH,OAAO,SAAU,SAAqB;KACpC,MAAM,SAAU,MAAmB,KAAK,QAAQ,OAAO;KACvD,IAAI,QACF,QAAQ,KAAK,UAAU,EAAE,OAAO,QAAQ,CAAC;KAE3C,OAAO;IACT;IAEF,KAAK,SACH,OAAO,WAAkB;KACvB,MAAoB,KAAK,MAAM;KAC/B,QAAQ,KAAK,SAAS,CAAC,CAAC;IAC1B;GACJ;GAGF,OAAO;EACT,EACF,CAAC;CACH;AACF;;;;;;;;;AC/aA,SAAS,gBAAgB,OAAyB;CAChD,OAAO,OAAO,UAAU,cAAe,MAA4C,OAAO,iBAAiB;AAC7G;AAEA,IAAM,QAAN,MAAY;CACV,QAA+B,QAAQ,QAAQ;;;;;CAM/C,MAAM,KAAQ,IAAsC;EAClD,MAAM,MAAM,KAAK,MAAM,WAAW,GAAG,CAAC;EACtC,KAAK,QAAQ,IAAI,WACT,KAAA,SACA,KAAA,CACR;EACA,OAAO;CACT;AAOF;;;;;;;;;;;;;;;;;;;AAoBA,SAAgB,eAAgD;CAC9D,QAAQ,SAAe;EACrB,MAAM,QAAQ,IAAI,MAAM;EAExB,OAAO,IAAI,MAAM,MAAM,EACrB,IAAI,QAAQ,MAAM,UAAU;GAC1B,MAAM,QAAQ,QAAQ,IAAI,QAAQ,MAAM,QAAQ;GAGhD,IAAI,OAAO,UAAU,YACnB,OAAO;GAOT,IAAI,gBAAgB,KAAK,GACvB,OAAO,SAAyB,GAAG,MAAiB;IAClD,OAAO,MAAM,WAAY,MAAmB,MAAM,QAAQ,IAAI,CAAC;GACjE;GAEF,OAAO,SAAyB,GAAG,MAAiB;IAClD,MAAM,SAAU,MAAmB,MAAM,QAAQ,IAAI;IACrD,IAAI,kBAAkB,SACpB,OAAO,MAAM,WAAW,MAAM;IAEhC,OAAO;GACT;EACF,EACF,CAAC;CACH;AACF;;;;AAKA,MAAa,mBAAyC;;;;AAKtD,MAAa,kBAAwC;;;;AAKrD,MAAa,yBAA+C;;;;AAK5D,MAAa,kBAAwC;;;;;;;;;;AAWrD,SAAgB,wBAAyD;CACvE,QAAQ,SAAe;EACrB,MAAM,QAAQ,IAAI,MAAM;EACxB,IAAI,aAA4B;EAChC,IAAI,YAAY;EAEhB,OAAO,IAAI,MAAM,MAAM,EACrB,IAAI,QAAQ,MAAM,UAAU;GAC1B,MAAM,QAAQ,QAAQ,IAAI,QAAQ,MAAM,QAAQ;GAEhD,IAAI,OAAO,UAAU,YACnB,OAAO;GAGT,OAAO,eAA2B,GAAG,MAAa;IAEhD,MAAM,WAAW,OAAO,QAAQ;IAGhC,IAAI,eAAe,UAAU;KAC3B;KACA,IAAI;MACF,MAAM,SAAU,MAAmB,MAAM,QAAQ,IAAI;MACrD,OAAO,kBAAkB,UAAU,MAAM,SAAS;KACpD,UAAU;MACR;KACF;IACF;IAGA,OAAO,MAAM,KAAK,YAAY;KAC5B,aAAa;KACb,YAAY;KACZ,IAAI;MACF,MAAM,SAAU,MAAmB,MAAM,QAAQ,IAAI;MACrD,OAAO,kBAAkB,UAAU,MAAM,SAAS;KACpD,UAAU;MACR;MACA,IAAI,cAAc,GAChB,aAAa;KAEjB;IACF,CAAC;GACH;EACF,EACF,CAAC;CACH;AACF;;;;;;;;;;;;;;;;;;;AAoBA,SAAgB,gBAAiD;CAC/D,QAAQ,SAAe;EACrB,IAAI,UAAU;EACd,IAAI,SAAS;EACb,IAAI,iBAAiC,CAAC;EACtC,IAAI,iBAAiC,CAAC;EAMtC,MAAM,cAAc,YAA2B;GAC7C,IAAI,UAAU,eAAe,SAAS,GAAG;IACvC,MAAM,IAAI,SAAe,YAAY,eAAe,KAAK,OAAO,CAAC;IACjE;GACF;GACA;EACF;EAEA,MAAM,oBAA0B;GAC9B;GACA,IAAI,YAAY,KAAK,eAAe,SAAS,GAAG;IAC9C,SAAS;IAET,eAD4B,MACzB,CAAC,CAAC;GACP;EACF;EAEA,MAAM,eAAe,YAA2B;GAC9C,IAAI,UAAU,UAAU,GAAG;IACzB,MAAM,IAAI,SAAe,YAAY,eAAe,KAAK,OAAO,CAAC;IACjE;GACF;GACA,SAAS;EACX;EAEA,MAAM,qBAA2B;GAC/B,SAAS;GACT,IAAI,eAAe,SAAS,GAAG;IAC7B,SAAS;IAET,eAD4B,MACzB,CAAC,CAAC;GACP,OAAO,IAAI,eAAe,SAAS,GAAG;IACpC,MAAM,aAAa,eAAe,OAAO,CAAC;IAC1C,WAAW,WAAW;IACtB,WAAW,SAAS,YAAY,QAAQ,CAAC;GAC3C;EACF;EAGA,MAAM,+BAAe,IAAI,IAAI;GAC3B;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;GACA;EACF,CAAC;EAED,OAAO,IAAI,MAAM,MAAM,EACrB,IAAI,QAAQ,MAAM,UAAU;GAC1B,MAAM,QAAQ,QAAQ,IAAI,QAAQ,MAAM,QAAQ;GAEhD,IAAI,OAAO,UAAU,YACnB,OAAO;GAGT,MAAM,eAAe,OAAO,SAAS,YAAY,aAAa,IAAI,IAAI;GAEtE,OAAO,eAA2B,GAAG,MAAa;IAChD,IAAI,cAAc;KAEhB,MAAM,YAAY;KAClB,IAAI;MACF,MAAM,SAAU,MAAmB,MAAM,QAAQ,IAAI;MACrD,OAAO,kBAAkB,UAAU,MAAM,SAAS;KACpD,UAAU;MACR,YAAY;KACd;IACF,OAAO;KAEL,MAAM,aAAa;KACnB,IAAI;MACF,MAAM,SAAU,MAAmB,MAAM,QAAQ,IAAI;MACrD,OAAO,kBAAkB,UAAU,MAAM,SAAS;KACpD,UAAU;MACR,aAAa;KACf;IACF;GACF;EACF,EACF,CAAC;CACH;AACF;;AC1SA,SAAgB,mBAAyB,KAAoB,MAAsC;CACjG,QAAQ,MAAR;EACE,KAAK,eACH,SAAS,KAAQ,UAAgB;GAC/B,IAAI,IAAI,IAAI,GAAG,GAAG,OAAO,IAAI,IAAI,GAAG;GACpC,IAAI,IAAI,KAAK,KAAK;GAClB,OAAO;EACT;EAEF,KAAK,WACH,SAAS,KAAQ,UAA6B,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,KAAK,KAAK,IAAI,KAAA;EAErF,KAAK,gBACH,SAAS,KAAQ,UAAa,aAAyB;GACrD,IAAI,CAAC,IAAI,IAAI,GAAG,KAAK,CAAC,OAAO,GAAG,IAAI,IAAI,GAAG,GAAG,QAAQ,GAAG,OAAO;GAChE,IAAI,IAAI,KAAK,QAAQ;GACrB,OAAO;EACT;EAEF,KAAK,eACH,SAAS,KAAQ,UAAsB;GACrC,IAAI,CAAC,IAAI,IAAI,GAAG,KAAK,CAAC,OAAO,GAAG,IAAI,IAAI,GAAG,GAAG,KAAK,GAAG,OAAO;GAC7D,IAAI,OAAO,GAAG;GACd,OAAO;EACT;EAEF,KAAK,mBACH,SAAS,KAAQ,oBAAsC;GACrD,IAAI,IAAI,IAAI,GAAG,GAAG,OAAO,IAAI,IAAI,GAAG;GACpC,MAAM,QAAQ,gBAAgB,GAAG;GACjC,IAAI,IAAI,KAAK,KAAK;GAClB,OAAO;EACT;EAEF,KAAK,oBACH,SAAS,KAAQ,cAAkE;GACjF,IAAI,CAAC,IAAI,IAAI,GAAG,GAAG,OAAO,KAAA;GAC1B,MAAM,QAAQ,UAAU,KAAK,IAAI,IAAI,GAAG,CAAC;GACzC,IAAI,UAAU,KAAA,GAAW;IACvB,IAAI,OAAO,GAAG;IACd;GACF;GACA,IAAI,IAAI,KAAK,KAAK;GAClB,OAAO;EACT;EAEF,KAAK,WACH,SAAS,KAAQ,cAA8E;GAC7F,MAAM,UAAU,IAAI,IAAI,GAAG;GAC3B,MAAM,QAAQ,UAAU,KAAK,UAAU,IAAI,IAAI,GAAG,IAAI,KAAA,CAAS;GAC/D,IAAI,UAAU,KAAA,GAAW;IACvB,IAAI,SAAS,IAAI,OAAO,GAAG;IAC3B;GACF;GACA,IAAI,IAAI,KAAK,KAAK;GAClB,OAAO;EACT;EAEF,KAAK,SACH,SAAS,KAAQ,OAAU,cAA0E;GACnG,IAAI,CAAC,IAAI,IAAI,GAAG,GAAG;IACjB,IAAI,IAAI,KAAK,KAAK;IAClB,OAAO;GACT;GACA,MAAM,SAAS,UAAU,IAAI,IAAI,GAAG,GAAG,KAAK;GAC5C,IAAI,WAAW,KAAA,GAAW;IACxB,IAAI,OAAO,GAAG;IACd;GACF;GACA,IAAI,IAAI,KAAK,MAAM;GACnB,OAAO;EACT;EAEF,KAAK,UACH,SAAS,UAAuC;GAC9C,KAAK,MAAM,SAAS,OAClB,IAAI,IAAI,MAAM,KAAK,MAAM,KAAK;EAElC;CACJ;AAEF;;;;;;;;;;;;;;;;;;;;;;;;;;ACzCA,SAAgB,OACd,SACyE;CACzE,MAAM,EAAE,YAAY;CACpB,MAAM,WAAW,cAAc,QAAQ,UAAU,QAAQ;CAEzD,QAAQ,SAAsE;EAE5E,IAAI,OAA6B;EACjC,IAAI,OAA6B;EACjC,MAAM,0BAAU,IAAI,IAAsB;EAE1C,MAAM,cAAc,SAA8B;GAEhD,IAAI,KAAK,MACP,KAAK,KAAK,OAAO,KAAK;QAEtB,OAAO,KAAK;GAGd,IAAI,KAAK,MACP,KAAK,KAAK,OAAO,KAAK;QAEtB,OAAO,KAAK;GAId,KAAK,OAAO;GACZ,KAAK,OAAO;GACZ,IAAI,MACF,KAAK,OAAO;GAEd,OAAO;GAEP,IAAI,CAAC,MACH,OAAO;GAGT,KAAK,eAAe,KAAK,IAAI;EAC/B;EAEA,MAAM,WAAW,KAAQ,UAAmB;GAC1C,MAAM,OAAsB;IAC1B;IACA;IACA,cAAc,KAAK,IAAI;IACvB,MAAM;IACN,MAAM;GACR;GAEA,IAAI,MACF,KAAK,OAAO;GAEd,OAAO;GAEP,IAAI,CAAC,MACH,OAAO;GAGT,QAAQ,IAAI,KAAK,IAAI;EACvB;EAEA,MAAM,cAAc,SAA8B;GAChD,IAAI,KAAK,MACP,KAAK,KAAK,OAAO,KAAK;QAEtB,OAAO,KAAK;GAGd,IAAI,KAAK,MACP,KAAK,KAAK,OAAO,KAAK;QAEtB,OAAO,KAAK;GAGd,QAAQ,OAAO,KAAK,GAAG;EACzB;EAKA,MAAM,uBAA6B;GACjC,KAAK,MAAM,QAAQ,CAAC,GAAG,QAAQ,OAAO,CAAC,GACrC,IAAI,CAAC,KAAK,IAAI,KAAK,GAAG,GACpB,WAAW,IAAI;EAGrB;EAEA,MAAM,iBAAuB;GAC3B,OAAO,MAAM;IACX,MAAM,YAAY;IAClB,WAAW,SAAS;IACpB,IAAI,CAAC,KAAK,IAAI,UAAU,GAAG,GAEzB;IAEF,KAAK,OAAO,UAAU,GAAG;IAEzB,IAAI,SACF,QAAQ;KACN,KAAK,UAAU;KACf,OAAO,UAAU;KACjB,WAAW,UAAU;IACvB,CAAC;IAEH;GACF;EACF;EAEA,OAAO,IAAI,MAAM,MAAM,EACrB,IAAI,QAAQ,MAAM,UAAU;GAE1B,IAAI,SAAS,UACX,OAAO,OAAO,QAAQ;GAKxB,MAAM,YAAY,mBAAmB,UAA2B,IAAI;GACpE,IAAI,WACF,OAAO;GAGT,MAAM,QAAQ,QAAQ,IAAI,QAAQ,MAAM,QAAQ;GAEhD,IAAI,OAAO,UAAU,YACnB,QAAQ,MAAR;IACE,KAAK,OACH,OAAO,SAAU,KAAW;KAC1B,IAAI;KACJ,IAAI;MACF,SAAU,MAAmB,KAAK,QAAQ,GAAG;KAC/C,SAAS,OAAO;MAEd,MAAM,QAAQ,QAAQ,IAAI,GAAG;MAC7B,IAAI,OACF,WAAW,KAAK;MAElB,MAAM;KACR;KAEA,MAAM,OAAO,QAAQ,IAAI,GAAG;KAC5B,IAAI,MACF,WAAW,IAAI;KAEjB,OAAO;IACT;IAEF,KAAK,OACH,OAAO,SAAU,KAAiB;KAChC,MAAM,SAAU,MAAmB,KAAK,QAAQ,GAAG;KACnD,MAAM,OAAO,QAAQ,IAAI,GAAG;KAC5B,IAAI,MAAM;MACR,IAAI,QAEF,WAAW,IAAI;WAGf,WAAW,IAAI;KAEnB;KACA,OAAO;IACT;IAEF,KAAK,OACH,OAAO,SAAU,KAAQ,KAAuB;KAG9C,IAFe,OAAO,IAAI,GAEjB,GAAG;MAEV,MAAM,WAAY,MAAmB,KAAK,QAAQ,KAAK,GAAG;MAC1D,MAAM,OAAO,QAAQ,IAAI,GAAG;MAC5B,IAAI,MAAM;OACR,KAAK,QAAQ;OACb,WAAW,IAAI;MACjB;MACA,OAAO;KACT,OAAO;MAGL,MAAM,QAAQ,QAAQ,IAAI,GAAG;MAC7B,IAAI,OACF,WAAW,KAAK;MAGlB,IAAI,QAAQ,QAAQ,UAClB,eAAe;MAEjB,IAAI,OAAO,QAAQ,UACjB,SAAS;MAEX,MAAM,SAAU,MAAmB,KAAK,QAAQ,KAAK,GAAG;MACxD,QAAQ,KAAK,GAAG;MAChB,OAAO;KACT;IACF;IAEF,KAAK,UACH,OAAO,SAAU,KAAuB;KACtC,MAAM,SAAU,MAAmB,KAAK,QAAQ,GAAG;KACnD,MAAM,OAAO,QAAQ,IAAI,GAAG;KAC5B,IAAI,MACF,WAAW,IAAI;KAEjB,OAAO;IACT;IAEF,KAAK,SACH,OAAO,WAAkB;KACvB,MAAoB,KAAK,MAAM;KAC/B,OAAO;KACP,OAAO;KACP,QAAQ,MAAM;IAChB;GACJ;GAGF,OAAO;EACT,EACF,CAAC;CACH;AACF;;;;;;;;;;AAWA,IAAa,WAAb,MAA4B;CAC1B;CACA;CACA,sBAAyD,IAAI,IAAI;CACjE,OAAqC;CACrC,OAAqC;;;;;;CAOrC,YAAY,UAAkB,SAAoD;EAChF,KAAK,WAAW,cAAc,UAAU,UAAU;EAClD,KAAK,UAAU;CACjB;CAEA,IAAI,OAAe;EACjB,OAAO,KAAK,IAAI;CAClB;CAEA,IAAI,SAAkB;EACpB,OAAO,KAAK,IAAI,QAAQ,KAAK;CAC/B;CAEA,IAAI,KAAuB;EACzB,MAAM,QAAQ,KAAK,IAAI,IAAI,GAAG;EAC9B,IAAI,CAAC,OAAO,OAAO,KAAA;EAEnB,KAAK,WAAW,MAAM,IAAI;EAC1B,OAAO,MAAM;CACf;CAEA,IAAI,KAAQ,OAAgB;EAC1B,MAAM,QAAQ,KAAK,IAAI,IAAI,GAAG;EAE9B,IAAI,OAAO;GAET,MAAM,QAAQ;GACd,MAAM,KAAK,QAAQ;GACnB,KAAK,WAAW,MAAM,IAAI;EAC5B,OAAO;GAEL,IAAI,KAAK,IAAI,QAAQ,KAAK,UACxB,KAAK,SAAS;GAGhB,MAAM,OAAsB;IAC1B;IACA;IACA,cAAc,KAAK,IAAI;IACvB,MAAM;IACN,MAAM,KAAK;GACb;GAEA,IAAI,KAAK,MACP,KAAK,KAAK,OAAO;GAEnB,KAAK,OAAO;GAEZ,IAAI,CAAC,KAAK,MACR,KAAK,OAAO;GAGd,KAAK,IAAI,IAAI,KAAK;IAAE;IAAO;GAAK,CAAC;EACnC;CACF;CAEA,IAAI,KAAiB;EACnB,OAAO,KAAK,IAAI,IAAI,GAAG;CACzB;CAEA,OAAO,KAAiB;EACtB,MAAM,QAAQ,KAAK,IAAI,IAAI,GAAG;EAC9B,IAAI,CAAC,OAAO,OAAO;EAEnB,KAAK,WAAW,MAAM,IAAI;EAC1B,KAAK,IAAI,OAAO,GAAG;EACnB,OAAO;CACT;;;;;;;;;;CAWA,YAAY,SAAgD;EAC1D,MAAM,QAAyB,CAAC;EAChC,KAAK,IAAI,OAAO,KAAK,MAAM,MAAM,OAAO,KAAK,MAAM,MAAM,KAAK,IAAI;EAClE,IAAI,UAAU;EACd,KAAK,MAAM,QAAQ,OAAO;GAExB,IAAI,KAAK,IAAI,IAAI,KAAK,GAAG,CAAC,EAAE,SAAS,MAAM;GAC3C,IAAI,CAAC,QAAQ,KAAK,OAAO,KAAK,GAAG,GAAG;GAEpC,IAAI,KAAK,IAAI,IAAI,KAAK,GAAG,CAAC,EAAE,SAAS,MAAM;GAC3C,KAAK,WAAW,IAAI;GACpB,KAAK,IAAI,OAAO,KAAK,GAAG;GACxB;EACF;EACA,OAAO;CACT;CAEA,QAAc;EACZ,KAAK,IAAI,MAAM;EACf,KAAK,OAAO;EACZ,KAAK,OAAO;CACd;CAEA,WAAmB,MAA2B;EAC5C,IAAI,SAAS,KAAK,MAAM;EAGxB,IAAI,KAAK,MACP,KAAK,KAAK,OAAO,KAAK;EAExB,IAAI,KAAK,MACP,KAAK,KAAK,OAAO,KAAK;OAEtB,KAAK,OAAO,KAAK;EAInB,KAAK,OAAO;EACZ,KAAK,OAAO,KAAK;EACjB,IAAI,KAAK,MACP,KAAK,KAAK,OAAO;EAEnB,KAAK,OAAO;EAEZ,KAAK,eAAe,KAAK,IAAI;CAC/B;CAEA,WAAmB,MAA2B;EAC5C,IAAI,KAAK,MACP,KAAK,KAAK,OAAO,KAAK;OAEtB,KAAK,OAAO,KAAK;EAGnB,IAAI,KAAK,MACP,KAAK,KAAK,OAAO,KAAK;OAEtB,KAAK,OAAO,KAAK;CAErB;CAEA,WAAyB;EACvB,IAAI,CAAC,KAAK,MAAM;EAEhB,MAAM,UAAU,KAAK;EACrB,KAAK,WAAW,OAAO;EACvB,KAAK,IAAI,OAAO,QAAQ,GAAG;EAE3B,IAAI,KAAK,SACP,KAAK,QAAQ,QAAQ,KAAK,QAAQ,KAAK;CAE3C;;;;CAKA,CAAC,OAA4B;EAC3B,IAAI,OAAO,KAAK;EAChB,OAAO,MAAM;GACX,MAAM,KAAK;GACX,OAAO,KAAK;EACd;CACF;;;;CAKA,CAAC,UAAoC;EACnC,IAAI,OAAO,KAAK;EAChB,OAAO,MAAM;GACX,MAAM,CAAC,KAAK,KAAK,KAAK,KAAK;GAC3B,OAAO,KAAK;EACd;CACF;AACF;;;;;;AAOA,SAAgB,SACd,UACA,SACgB;CAChB,OAAO,IAAI,SAAS,UAAU,OAAO;AACvC;;;;;;AC9cA,SAAS,qBAAqB,OAAmB,UAAkD;CACjG,MAAM,QAAQ,YAAY,OAAO,QAAQ;CACzC,MAA6C,QAAQ;CACrD,OAAO;AACT;;;;;;;AAuCA,SAAgB,OACd,SAC6E;CAC7E,MAAM,EAAE,KAAK,gBAAgB,KAAM,aAAa;CAEhD,QACE,SACqD;EACrD,MAAM,2BAAW,IAAI,IAAoB;EACzC,IAAI,aAAoD;EAExD,MAAM,qBAA2B;GAC/B,MAAM,MAAM,KAAK,IAAI;GACrB,MAAM,UAAe,CAAC;GAEtB,KAAK,MAAM,CAAC,KAAK,UAAU,UACzB,IAAI,OAAO,MAAM,WACf,QAAQ,KAAK,GAAG;GAIpB,KAAK,MAAM,OAAO,SAAS;IACzB,MAAM,QAAQ,SAAS,IAAI,GAAG;IAC9B,IAAI,OAAO;KACT,KAAK,OAAO,GAAG;KACf,SAAS,OAAO,GAAG;KAEnB,IAAI,UACF,SAAS;MACP;MACA,OAAO,MAAM;MACb,WAAW,MAAM;MACjB,WAAW;KACb,CAAC;IAEL;GACF;EACF;EAGA,aAAa,qBAAqB,cAAc,aAAa;EAE7D,MAAM,gBAAsB;GAC1B,IAAI,YAAY;IACd,cAAc,UAAU;IACxB,aAAa;GACf;EACF;EAEA,OAAO,IAAI,MAAM,MAAM,EACrB,IAAI,QAAQ,MAAM,UAAU;GAE1B,IAAI,SAAS,WACX,OAAO;GAKT,MAAM,YAAY,mBAAmB,UAA2B,IAAI;GACpE,IAAI,WACF,OAAO;GAGT,MAAM,QAAQ,QAAQ,IAAI,QAAQ,MAAM,QAAQ;GAEhD,IAAI,OAAO,UAAU,YACnB,QAAQ,MAAR;IACE,KAAK,OACH,OAAO,SAAU,KAAW;KAE1B,MAAM,QAAQ,SAAS,IAAI,GAAG;KAC9B,IAAI,SAAS,KAAK,IAAI,KAAK,MAAM,WAAW;MAC1C,OAAO,OAAO,GAAG;MACjB,SAAS,OAAO,GAAG;MACnB,MAAM,IAAI,MAAM,gBAAgB,KAAK;KACvC;KACA,OAAQ,MAAmB,KAAK,QAAQ,GAAG;IAC7C;IAEF,KAAK,OACH,OAAO,SAAU,KAAiB;KAEhC,MAAM,QAAQ,SAAS,IAAI,GAAG;KAC9B,IAAI,SAAS,KAAK,IAAI,KAAK,MAAM,WAAW;MAC1C,OAAO,OAAO,GAAG;MACjB,SAAS,OAAO,GAAG;MACnB,OAAO;KACT;KACA,OAAQ,MAAmB,KAAK,QAAQ,GAAG;IAC7C;IAEF,KAAK,OACH,OAAO,SAAU,KAAQ,KAAuB;KAC9C,MAAM,MAAM,KAAK,IAAI;KACrB,MAAM,SAAU,MAAmB,KAAK,QAAQ,KAAK,GAAG;KAExD,SAAS,IAAI,KAAK;MAChB,OAAO;MACP,WAAW,MAAM;MACjB,WAAW;KACb,CAAC;KAED,OAAO;IACT;IAEF,KAAK,UACH,OAAO,SAAU,KAAuB;KACtC,MAAM,SAAU,MAAmB,KAAK,QAAQ,GAAG;KACnD,SAAS,OAAO,GAAG;KACnB,OAAO;IACT;IAEF,KAAK,SACH,OAAO,WAAkB;KACvB,MAAoB,KAAK,MAAM;KAC/B,SAAS,MAAM;IACjB;GACJ;GAGF,OAAO;EACT,EACF,CAAC;CACH;AACF;;;;;;;AAQA,SAAgB,cACd,SAG6E;CAC7E,MAAM,EAAE,KAAK,gBAAgB,KAAM,aAAa;CAEhD,QACE,SACqD;EACrD,MAAM,2BAAW,IAAI,IAAiD;EACtE,IAAI,aAAoD;EAExD,MAAM,qBAA2B;GAC/B,MAAM,MAAM,KAAK,IAAI;GACrB,MAAM,UAAe,CAAC;GAEtB,KAAK,MAAM,CAAC,SAAS,UAAU,UAC7B,IAAI,OAAO,MAAM,WACf,QAAQ,KAAK,OAAO;GAIxB,KAAK,MAAM,WAAW,SAAS;IAC7B,MAAM,QAAQ,SAAS,IAAI,OAAO;IAClC,IAAI,OAAO;KACT,KAAK,OAAO,OAAO;KACnB,SAAS,OAAO,OAAO;KAEvB,IAAI,UACF,SAAS;MACP;MACA,WAAW,MAAM;MACjB,WAAW;KACb,CAAC;IAEL;GACF;EACF;EAEA,aAAa,qBAAqB,cAAc,aAAa;EAE7D,MAAM,gBAAsB;GAC1B,IAAI,YAAY;IACd,cAAc,UAAU;IACxB,aAAa;GACf;EACF;EAEA,OAAO,IAAI,MAAM,MAAM,EACrB,IAAI,QAAQ,MAAM,UAAU;GAC1B,IAAI,SAAS,WACX,OAAO;GAGT,MAAM,QAAQ,QAAQ,IAAI,QAAQ,MAAM,QAAQ;GAEhD,IAAI,OAAO,UAAU,YACnB,QAAQ,MAAR;IACE,KAAK,OACH,OAAO,SAAU,SAAqB;KACpC,MAAM,SAAU,MAAmB,KAAK,QAAQ,OAAO;KACvD,IAAI,QAAQ;MACV,MAAM,MAAM,KAAK,IAAI;MACrB,SAAS,IAAI,SAAS;OACpB,WAAW,MAAM;OACjB,WAAW;MACb,CAAC;KACH;KACA,OAAO;IACT;IAEF,KAAK,UACH,OAAO,SAAU,SAAqB;KACpC,MAAM,SAAU,MAAmB,KAAK,QAAQ,OAAO;KACvD,IAAI,QACF,SAAS,OAAO,OAAO;KAEzB,OAAO;IACT;IAEF,KAAK,SACH,OAAO,WAAkB;KACvB,MAAoB,KAAK,MAAM;KAC/B,SAAS,MAAM;IACjB;GACJ;GAGF,OAAO;EACT,EACF,CAAC;CACH;AACF;;;;;;;;;;;AAYA,IAAa,WAAb,MAA4B;CAC1B;CACA;CACA;CACA,sBAAc,IAAI,IAAoB;CACtC,aAA4D;CAE5D,YAAY,KAAa,gBAAwB,KAAM,UAAqD;EAC1G,KAAK,MAAM;EACX,KAAK,gBAAgB;EACrB,KAAK,WAAW;EAChB,KAAK,qBAAqB;CAC5B;CAEA,IAAI,OAAe;EACjB,KAAK,QAAQ;EACb,OAAO,KAAK,IAAI;CAClB;CAEA,IAAI,KAAuB;EACzB,MAAM,QAAQ,KAAK,IAAI,IAAI,GAAG;EAC9B,IAAI,CAAC,OAAO,OAAO,KAAA;EAEnB,IAAI,KAAK,IAAI,KAAK,MAAM,WAAW;GACjC,KAAK,IAAI,OAAO,GAAG;GACnB,IAAI,KAAK,UACP,KAAK,SAAS,KAAK,MAAM,KAAK;GAEhC;EACF;EAEA,OAAO,MAAM;CACf;CAEA,IAAI,KAAQ,OAAU,WAA0B;EAC9C,MAAM,MAAM,KAAK,IAAI;EACrB,MAAM,WAAW,cAAc,KAAA,IAAY,YAAY,KAAK;EAE5D,KAAK,IAAI,IAAI,KAAK;GAChB;GACA,WAAW,MAAM;GACjB,WAAW;EACb,CAAC;CACH;CAEA,IAAI,KAAiB;EACnB,OAAO,KAAK,IAAI,GAAG,MAAM,KAAA;CAC3B;CAEA,OAAO,KAAiB;EACtB,OAAO,KAAK,IAAI,OAAO,GAAG;CAC5B;CAEA,QAAc;EACZ,KAAK,IAAI,MAAM;CACjB;;;;CAKA,UAAgB;EACd,MAAM,MAAM,KAAK,IAAI;EACrB,MAAM,UAAe,CAAC;EAEtB,KAAK,MAAM,CAAC,KAAK,UAAU,KAAK,KAC9B,IAAI,OAAO,MAAM,WACf,QAAQ,KAAK,GAAG;EAIpB,KAAK,MAAM,OAAO,SAAS;GACzB,MAAM,QAAQ,KAAK,IAAI,IAAI,GAAG;GAC9B,IAAI,OAAO;IACT,KAAK,IAAI,OAAO,GAAG;IACnB,IAAI,KAAK,UACP,KAAK,SAAS,KAAK,MAAM,KAAK;GAElC;EACF;CACF;;;;;CAMA,OAAO,KAA4B;EACjC,MAAM,QAAQ,KAAK,IAAI,IAAI,GAAG;EAC9B,IAAI,CAAC,OAAO,OAAO,KAAA;EAEnB,MAAM,YAAY,MAAM,YAAY,KAAK,IAAI;EAC7C,OAAO,YAAY,IAAI,YAAY,KAAA;CACrC;;;;CAKA,MAAM,KAAQ,WAA6B;EACzC,MAAM,QAAQ,KAAK,IAAI,IAAI,GAAG;EAC9B,IAAI,CAAC,OAAO,OAAO;EAEnB,IAAI,KAAK,IAAI,KAAK,MAAM,WAAW;GACjC,KAAK,IAAI,OAAO,GAAG;GACnB,OAAO;EACT;EAEA,MAAM,WAAW,cAAc,KAAA,IAAY,YAAY,KAAK;EAC5D,MAAM,YAAY,KAAK,IAAI,IAAI;EAC/B,OAAO;CACT;CAEA,uBAAqC;EACnC,KAAK,aAAa,2BAA2B,KAAK,QAAQ,GAAG,KAAK,aAAa;CACjF;;;;CAKA,UAAgB;EACd,IAAI,KAAK,YAAY;GACnB,cAAc,KAAK,UAAU;GAC7B,KAAK,aAAa;EACpB;CACF;CAEA,CAAC,OAA4B;EAC3B,KAAK,QAAQ;EACb,OAAO,KAAK,IAAI,KAAK;CACvB;CAEA,CAAC,SAA8B;EAC7B,KAAK,QAAQ;EACb,KAAK,MAAM,SAAS,KAAK,IAAI,OAAO,GAClC,MAAM,MAAM;CAEhB;CAEA,CAAC,UAAoC;EACnC,KAAK,QAAQ;EACb,KAAK,MAAM,CAAC,KAAK,UAAU,KAAK,KAC9B,MAAM,CAAC,KAAK,MAAM,KAAK;CAE3B;AACF;;;;AAKA,SAAgB,SACd,KACA,SAIgB;CAChB,OAAO,IAAI,SACT,KACA,SAAS,eACT,SAAS,QACX;AACF;;;;;;;;;;;;;;;;;;ACxYA,IAAa,aAAb,MAAqD;CACnD,SAAsB,CAAC;CACvB,UAA+B,CAAC;CAChC,SAAgC,CAAC;;CAEjC,UAAiC,CAAC;CAClC,YAAoB;CACpB;CACA;CAEA,YAAY,UAA6B,CAAC,GAAG;EAC3C,KAAK,WAAW,QAAQ,YAAY;EACpC,IAAI,QAAQ,YAAY,KAAA,GACtB,KAAK,iBAAiB,QAAQ;CAElC;CAMA,IAAI,OAAe;EACjB,OAAO,KAAK,OAAO;CACrB;CAEA,IAAI,UAAmB;EACrB,OAAO,KAAK,OAAO,WAAW;CAChC;CAEA,IAAI,SAAkB;EACpB,OAAO,KAAK,OAAO,UAAU,KAAK;CACpC;CAEA,IAAI,WAAoB;EACtB,OAAO,KAAK;CACd;CAEA,IAAI,oBAA4B;EAC9B,OAAO,KAAK,aAAa,WAAW,WAAW,KAAK,WAAW,KAAK,OAAO;CAC7E;;;;;;;;;CAcA,MAAM,IAAI,SAAY,SAAiC;EACrD,IAAI,KAAK,WACP,MAAM,IAAI,MAAM,iBAAiB;EAEnC,IAAI,KAAK,UAAU,OAAO,GACxB;EAIF,KAAK,YAAY,OAAO;EAIxB,OAAO,IAAI,SAAe,SAAS,WAAW;GAC5C,MAAM,SAAoB;IAAE;IAAS;IAAS;GAAO;GACrD,MAAM,YAAY,WAAW,KAAK;GAClC,IAAI,cAAc,KAAA,GAChB,OAAO,YAAY,iBAAiB;IAClC,MAAM,QAAQ,KAAK,QAAQ,QAAQ,MAAM;IACzC,IAAI,UAAU,IACZ,KAAK,QAAQ,OAAO,OAAO,CAAC;IAE9B,uBAAO,IAAI,MAAM,qBAAqB,UAAU,GAAG,CAAC;GACtD,GAAG,SAAS;GAEd,KAAK,QAAQ,KAAK,MAAM;EAC1B,CAAC;CACH;;;;;;;;CASA,MAAM,KAAK,SAA8B;EACvC,MAAM,OAAO,KAAK,QAAQ;EAC1B,IAAI,KAAK,OACP,OAAO,KAAK;EAId,IAAI,KAAK,WACP,MAAM,IAAI,MAAM,2BAA2B;EAI7C,OAAO,IAAI,SAAY,SAAS,WAAW;GACzC,MAAM,QAAqB;IAAE;IAAS;GAAO;GAC7C,MAAM,YAAY,WAAW,KAAK;GAClC,IAAI,cAAc,KAAA,GAChB,MAAM,YAAY,iBAAiB;IACjC,MAAM,QAAQ,KAAK,OAAO,QAAQ,KAAK;IACvC,IAAI,UAAU,IACZ,KAAK,OAAO,OAAO,OAAO,CAAC;IAE7B,uBAAO,IAAI,MAAM,sBAAsB,UAAU,GAAG,CAAC;GACvD,GAAG,SAAS;GAEd,KAAK,OAAO,KAAK,KAAK;EACxB,CAAC;CACH;;;;;;;;;;;CAYA,SAAS,WAAiC,UAAiD;EACzF,MAAM,OAAO,KAAK,QAAQ;EAC1B,IAAI,KAAK,OAAO;GACd,UAAU,KAAK,OAAO;GACtB,aAAa;EACf;EACA,IAAI,KAAK,WAAW;GAClB,yBAAS,IAAI,MAAM,2BAA2B,CAAC;GAC/C,aAAa;EACf;EACA,MAAM,QAAqB;GAAE,SAAS;GAAW,QAAQ;EAAS;EAClE,KAAK,OAAO,KAAK,KAAK;EACtB,aAAa;GACX,MAAM,QAAQ,KAAK,OAAO,QAAQ,KAAK;GACvC,IAAI,UAAU,IAAI,OAAO;GACzB,KAAK,OAAO,OAAO,OAAO,CAAC;GAC3B,OAAO;EACT;CACF;;;;;CAUA,OAAO,SAAqB;EAC1B,IAAI,KAAK,WACP,OAAO;EAET,OAAO,KAAK,UAAU,OAAO;CAC/B;;;;;CAMA,UAAyB;EACvB,MAAM,OAAO,KAAK,QAAQ;EAC1B,OAAO,KAAK,QAAQ,KAAK,UAAU,KAAA;CACrC;;CAGA,UAAkB,SAAqB;EAErC,MAAM,QAAQ,KAAK,OAAO,MAAM;EAChC,IAAI,OAAO;GACT,KAAK,YAAY,OAAO;GACxB,KAAK,aAAa,KAAK;GACvB,MAAM,QAAQ,OAAO;GACrB,OAAO;EACT;EACA,IAAI,KAAK,OAAO,SAAS,KAAK,UAAU;GACtC,KAAK,OAAO,KAAK,OAAO;GACxB,KAAK,YAAY,OAAO;GACxB,OAAO;EACT;EACA,OAAO;CACT;;CAGA,YAAoB,SAAkB;EACpC,MAAM,UAAU,KAAK;EACrB,KAAK,UAAU,CAAC;EAChB,KAAK,MAAM,UAAU,SAAS;GAC5B,KAAK,aAAa,MAAM;GACxB,OAAO,QAAQ,OAAO;EACxB;CACF;;;;;;;CAQA,UAAkE;EAChE,IAAI,KAAK,OAAO,SAAS,GAAG;GAC1B,MAAM,UAAU,KAAK,OAAO,MAAM;GAClC,KAAK,YAAY;GACjB,OAAO;IAAE,OAAO;IAAM;GAAQ;EAChC;EACA,MAAM,SAAS,KAAK,QAAQ,MAAM;EAClC,IAAI,QAAQ;GACV,KAAK,aAAa,MAAM;GACxB,OAAO,QAAQ;GACf,OAAO;IAAE,OAAO;IAAM,SAAS,OAAO;GAAQ;EAChD;EACA,OAAO,EAAE,OAAO,MAAM;CACxB;;;;;CAUA,MAAM,OAAmB;EACvB,IAAI,KAAK,OAAO,SAAS,GACvB,OAAO,KAAK,OAAO;EAErB,IAAI,KAAK,QAAQ,SAAS,GACxB,OAAO,KAAK,QAAQ,EAAE,CAAE;EAG1B,IAAI,KAAK,WACP,MAAM,IAAI,MAAM,2BAA2B;EAK7C,OAAO,IAAI,SAAY,SAAS,WAAW;GACzC,MAAM,SAAsB;IAAE;IAAS;GAAO;GAC9C,MAAM,YAAY,KAAK;GACvB,IAAI,cAAc,KAAA,GAChB,OAAO,YAAY,iBAAiB;IAClC,MAAM,QAAQ,KAAK,QAAQ,QAAQ,MAAM;IACzC,IAAI,UAAU,IACZ,KAAK,QAAQ,OAAO,OAAO,CAAC;IAE9B,uBAAO,IAAI,MAAM,sBAAsB,UAAU,GAAG,CAAC;GACvD,GAAG,SAAS;GAEd,KAAK,QAAQ,KAAK,MAAM;EAC1B,CAAC;CACH;;;;;CAMA,UAAyB;EACvB,OAAO,KAAK,OAAO,SAAS,IAAI,KAAK,OAAO,KAAK,KAAK,QAAQ,EAAE,EAAE;CACpE;;;;;CAUA,QAAc;EACZ,KAAK,YAAY;EAGjB,KAAK,MAAM,UAAU,KAAK,SAAS;GACjC,KAAK,aAAa,MAAM;GACxB,OAAO,uBAAO,IAAI,MAAM,cAAc,CAAC;EACzC;EACA,KAAK,UAAU,CAAC;EAGhB,IAAI,KAAK,OAAO,WAAW,GAAG;GAC5B,KAAK,MAAM,SAAS,KAAK,QAAQ;IAC/B,KAAK,aAAa,KAAK;IACvB,MAAM,uBAAO,IAAI,MAAM,wBAAwB,CAAC;GAClD;GACA,KAAK,SAAS,CAAC;GACf,KAAK,MAAM,UAAU,KAAK,SAAS;IACjC,KAAK,aAAa,MAAM;IACxB,OAAO,uBAAO,IAAI,MAAM,wBAAwB,CAAC;GACnD;GACA,KAAK,UAAU,CAAC;EAClB;CACF;;;;;CAMA,QAAa;EAGX,MAAM,WAAW,KAAK,OAAO,MAAM;EACnC,KAAK,SAAS,CAAC;EACf,KAAK,MAAM,UAAU,KAAK,QAAQ,OAAO,CAAC,GAAG;GAC3C,KAAK,aAAa,MAAM;GACxB,OAAO,QAAQ;GACf,SAAS,KAAK,OAAO,OAAO;EAC9B;EACA,OAAO;CACT;;;;;CAUA,QAAQ,OAAO,iBAAmC;EAChD,OAAO,MAAM;GACX,MAAM,OAAO,KAAK,QAAQ;GAC1B,IAAI,KAAK,OACP,MAAM,KAAK;QACN,IAAI,KAAK,WACd;QACK;IACL,IAAI;IACJ,IAAI;KACF,UAAU,MAAM,KAAK,KAAK;IAC5B,SAAS,OAAO;KAEd,IAAI,KAAK,WAAW;KACpB,MAAM;IACR;IACA,MAAM;GACR;EACF;CACF;;CAOA,cAA4B;EAC1B,IAAI,KAAK,QAAQ,SAAS,KAAK,KAAK,OAAO,SAAS,KAAK,UAAU;GACjE,MAAM,SAAS,KAAK,QAAQ,MAAM;GAClC,KAAK,aAAa,MAAM;GACxB,KAAK,OAAO,KAAK,OAAO,OAAO;GAC/B,OAAO,QAAQ;EACjB;CACF;CAEA,aAAqB,UAA+B;EAClD,IAAI,SAAS,WACX,aAAa,SAAS,SAAS;CAEnC;;;;CASA,WASE;EACA,OAAO;GACL,MAAM,KAAK;GACX,UAAU,KAAK;GACf,SAAS,KAAK;GACd,QAAQ,KAAK;GACb,UAAU,KAAK;GACf,gBAAgB,KAAK,QAAQ;GAC7B,eAAe,KAAK,OAAO;GAC3B,mBAAmB,KAAK;EAC1B;CACF;CAEA,WAAmB;EACjB,OAAO,mBAAmB,KAAK,KAAK,aAAa,KAAK,SAAS,WAAW,KAAK,UAAU;CAC3F;AACF;;;;;;;;;AAUA,SAAgB,WAAc,SAA4C;CACxE,OAAO,IAAI,WAAc,OAAO;AAClC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AClcA,IAAa,UAAb,MAAwB;CACtB;CACA,YAAoB;CAEpB,YAAY,aAAqB,GAAG;EAGlC,KAAK,QAAQ,WAAc,EAAE,UAAU,WAAW,CAAC;CACrD;;;;;;;CAQA,MAAM,KAAK,OAAyB;EAClC,IAAI,KAAK,WACP,MAAM,IAAI,MAAM,+BAA+B;EAEjD,MAAM,KAAK,MAAM,IAAI,KAAK;CAC5B;;;;;;;CAQA,MAAM,UAAsB;EAC1B,OAAO,MAAM,KAAK,MAAM,KAAK;CAC/B;;;;;;;;;;CAWA,YAAY,SAA6B,UAAiD;EACxF,OAAO,KAAK,MAAM,SAAS,SAAS,QAAQ;CAC9C;;;;;CAMA,QAAQ,OAAmB;EACzB,IAAI,KAAK,WAAW,OAAO;EAC3B,OAAO,KAAK,MAAM,OAAO,KAAK;CAChC;;;;;CAMA,aAA4B;EAC1B,OAAO,KAAK,MAAM,QAAQ;CAC5B;;;;;CAMA,QAAc;EACZ,KAAK,YAAY;EACjB,KAAK,MAAM,MAAM;CACnB;CAEA,IAAI,WAAoB;EACtB,OAAO,KAAK;CACd;CAEA,IAAI,OAAe;EACjB,OAAO,KAAK,MAAM;CACpB;;;;;CAMA,KAAQ,SAAyC;EAC/C,OAAO;GACL,SAAS;GACT;GACA,kBAAkB,KAAK,WAAW;GAClC,eAAe,KAAK,QAAQ;GAC5B,OAAO,SAAS,aAAa,KAAK,YAAY,SAAS,QAAQ;EACjE;CACF;;;;;CAMA,QAAQ,OAAO,iBAAmC;EAChD,OAAO,MACL,IAAI;GACF,MAAM,MAAM,KAAK,QAAQ;EAC3B,SAAS,GAAG;GAEV;EACF;CAEJ;AACF;;;;;;;AA0BA,SAAS,QAAQ,OAAoE;CACnF,OAAO,IAAI,SAAS,SAAS,WAAW;EACtC,MAAM,YAAkC,CAAC;EACzC,IAAI,UAAU;EACd,MAAM,YAAkB;GACtB,UAAU;GACV,KAAK,MAAM,YAAY,WAAW,SAAS;EAC7C;EAEA,IAAI;GACF,KAAK,IAAI,QAAQ,GAAG,QAAQ,MAAM,UAAU,CAAC,SAAS,SACpD,UAAU,KACR,MAAM,MAAM,EACT,UAAU;IACT,IAAI,SAAS;IACb,IAAI;IACJ,QAAQ;KAAE;KAAO;IAAM,CAAC;GAC1B,IACC,UAAU;IACT,IAAI,SAAS;IACb,IAAI;IACJ,OAAO,KAAK;GACd,CACF,CACF;EAEJ,SAAS,OAAO;GAEd,IAAI,CAAC,SAAS,IAAI;GAClB,OAAO,KAAK;EACd;CACF,CAAC;AACH;;;;;;;;;;;;;;;;;;AAmBA,eAAsB,OAAU,GAAG,OAAoC;CACrE,MAAM,EAAE,OAAO,UAAU,MAAM,QAC7B,MAAM,KAAK,MAAY,EAAE,UAAU,SAAS,aAAa,EAAE,QAAQ,YAAY,SAAS,QAAQ,EAAE,CACpG;CAEA,OAAO,MAAM,MAAM,CAAE,QAAQ,KAAK;AACpC;;;;;;;;;;AAWA,SAAgB,QAAQ,IAA2B;CACjD,MAAM,KAAK,IAAI,QAAc;CAC7B,iBAAiB;EACf,GAAG,KAAK,KAAA,CAAS,CAAC,CAAC,YAAY,CAAC,CAAC;EACjC,GAAG,MAAM;CACX,GAAG,EAAE;CACL,OAAO;AACT;;;;;;;;;;AAWA,SAAgB,OAAO,IAAoD;CACzE,MAAM,KAAK,IAAI,QAAgB,CAAC;CAChC,IAAI,QAAQ;CAEZ,MAAM,aAAa,kBAAkB;EACnC,GAAG,QAAQ,OAAO;CACpB,GAAG,EAAE;CAEL,OAAO,OAAO,OAAO,IAAI,EACvB,YAAY;EACV,cAAc,UAAU;EACxB,GAAG,MAAM;CACX,EACF,CAAC;AACH;;;;;;;;;;;AAYA,SAAgB,SACd,OACA,WACA,aAAqB,GACT;CACZ,MAAM,SAAS,IAAI,QAAW,UAAU;CAIxC,CAAC,YAAY;EACX,IAAI;GACF,WAAW,MAAM,SAAS,OAAO;IAC/B,MAAM,cAAc,MAAM,UAAU,KAAK;IACzC,MAAM,OAAO,KAAK,WAAW;GAC/B;EACF,UAAU;GACR,OAAO,MAAM;EACf;CACF,EAAA,CAAG,CAAC,CAAC,OAAO,UAAmB,QAAQ,MAAM,mBAAmB,KAAK,CAAC;CAEtE,OAAO;AACT;;;;;;;;;;AAWA,SAAgB,OAAU,OAAmB,OAAe,aAAqB,GAAiB;CAChG,MAAM,UAAU,MAAM,KAAK,EAAE,QAAQ,MAAM,SAAS,IAAI,QAAW,UAAU,CAAC;CAE9E,CAAC,YAAY;EACX,IAAI;GACF,WAAW,MAAM,SAAS,OACxB,MAAM,QAAQ,IAAI,QAAQ,KAAK,OAAO,GAAG,KAAK,KAAK,CAAC,CAAC;EAEzD,UAAU;GACR,QAAQ,SAAS,OAAO,GAAG,MAAM,CAAC;EACpC;CACF,EAAA,CAAG,CAAC,CAAC,OAAO,UAAmB,QAAQ,MAAM,iBAAiB,KAAK,CAAC;CAEpE,OAAO;AACT;;;;;;;;;;;AAYA,SAAgB,MAAS,GAAG,QAAkC;CAC5D,MAAM,SAAS,IAAI,QAAW;CAE9B,MAAM,UAAU,OAAO,IAAI,OAAO,UAAU;EAC1C,WAAW,MAAM,SAAS,OACxB,MAAM,OAAO,KAAK,KAAK;CAE3B,CAAC;CAGD,QAAQ,WAAW,OAAO,CAAC,CAAC,MAAM,YAAY;EAC5C,OAAO,MAAM;EACb,KAAK,MAAM,UAAU,SAAS,IAAI,OAAO,WAAW,YAAY,QAAQ,MAAM,gBAAgB,OAAO,MAAM;CAC7G,CAAC;CAED,OAAO;AACT;;;;;;;;AASA,SAAgB,MAAS,GAAG,QAAkC;CAC5D,MAAM,SAAS,IAAI,QAAW;CAE9B,CAAC,YAAY;EAEX,IAAI,QAAQ;EACZ,OAAO,MAAM;GACX,MAAM,QAAQ,OAAO,KAAK,GAAG,YAAY,QAAQ,UAAU,OAAO,MAAM;GACxE,IAAI;GACJ,IAAI;IACF,OAAO,MAAM,QAAQ,MAAM,KAAK,WAAiB,SAAS,aAAa,OAAO,MAAM,CAAE,YAAY,SAAS,QAAQ,CAAC,CAAC;GACvH,QAAQ;IAEN;GACF;GAEA,SADc,MAAM,KAAK,SACR,KAAK,OAAO;GAC7B,IAAI;IACF,MAAM,OAAO,KAAK,KAAK,KAAU;GACnC,QAAQ;IAEN;GACF;EACF;EACA,OAAO,MAAM;CACf,EAAA,CAAG;CAEH,OAAO;AACT;;;;AAKA,SAAgB,SAAY,UAA8B;CACxD,OAAO,IAAI,QAAW,QAAQ;AAChC;;;;;AAMA,SAAgB,aAA4B;CAC1C,OAAO,IAAI,QAAW,CAAC;AACzB;;;;;;;;AASA,SAAgB,QAAW,aAAqB,GAAe;CAC7D,OAAO,IAAI,QAAW,UAAU;AAClC;;;;;;;;;;;;;AAcA,SAAgB,WACd,MACA,QACA,UAAoD,EAAE,SAAS,EAAE,GACrD;CACZ,MAAM,UAAU,IAAI,QAAW,QAAQ,cAAc,CAAC;CACtD,MAAM,EAAE,SAAS,gBAAgB;CAEjC,MAAM,UAAU,MAAM,KAAK,EAAE,QAAQ,YAAY,GAAG,YAAY;EAC9D,WAAW,MAAM,OAAO,MACtB,IAAI;GACF,MAAM,SAAS,MAAM,OAAO,GAAG;GAC/B,MAAM,QAAQ,KAAK,MAAM;EAC3B,SAAS,OAAO;GACd,QAAQ,MAAM,iBAAiB,KAAK;EACtC;CAEJ,CAAC;CAED,QAAQ,IAAI,OAAO,CAAC,CAAC,WAAW,QAAQ,MAAM,CAAC;CAE/C,OAAO;AACT;;;;;;;;;AC5aA,gBAAuB,UAAa,UAA6E;CAC/G,MAAM,0BAAU,IAAI,IAAiC;CACrD,IAAI,OAAO;CACX,KAAK,MAAM,WAAW,UAAU;EAC9B,MAAM,QAAQ;EACd,QAAQ;EACR,QAAQ,IACN,OACA,QAAQ,QAAQ,OAAO,CAAC,CAAC,MACtB,WAAuB;GAAE;GAAO,QAAQ;GAAa;EAAM,KAC3D,YAAiC;GAAE;GAAO,QAAQ;GAAY;EAAO,EACxE,CACF;CACF;CACA,OAAO,QAAQ,OAAO,GAAG;EACvB,MAAM,UAAU,MAAM,QAAQ,KAAK,QAAQ,OAAO,CAAC;EACnD,QAAQ,OAAO,QAAQ,KAAK;EAC5B,MAAM;CACR;AACF;;;;;;;;;;;;;;;;;;;;;;;ACdA,UAAiB,IACf,UACA,IACc;CACd,IAAI,QAAQ;CACZ,KAAK,MAAM,SAAS,UAClB,MAAM,GAAG,OAAO,OAAO;AAE3B;;;;AAKA,UAAiB,OACf,UACA,WACc;CACd,IAAI,QAAQ;CACZ,KAAK,MAAM,SAAS,UAClB,IAAI,UAAU,OAAO,OAAO,GAC1B,MAAM;AAGZ;;;;AAKA,UAAiB,QACf,UACA,IACc;CACd,IAAI,QAAQ;CACZ,KAAK,MAAM,SAAS,UAClB,OAAO,GAAG,OAAO,OAAO;AAE5B;;;;AAKA,UAAiB,QAAW,UAA+C;CACzE,KAAK,MAAM,SAAS,UAClB,OAAO;AAEX;;;;AASA,UAAiB,KAAQ,UAAuB,GAAyB;CACvE,IAAI,QAAQ;CACZ,KAAK,MAAM,SAAS,UAAU;EAC5B,IAAI,WAAW,GAAG;EAClB,MAAM;CACR;AACF;;;;AAKA,UAAiB,KAAQ,UAAuB,GAAyB;CACvE,IAAI,QAAQ;CACZ,KAAK,MAAM,SAAS,UAClB,IAAI,WAAW,GACb,MAAM;AAGZ;;;;AAKA,UAAiB,UACf,UACA,WACc;CACd,KAAK,MAAM,SAAS,UAAU;EAC5B,IAAI,CAAC,UAAU,KAAK,GAAG;EACvB,MAAM;CACR;AACF;;;;AAKA,UAAiB,UACf,UACA,WACc;CACd,IAAI,WAAW;CACf,KAAK,MAAM,SAAS,UAAU;EAC5B,IAAI,YAAY,UAAU,KAAK,GAAG;EAClC,WAAW;EACX,MAAM;CACR;AACF;;;;AASA,UAAiB,OAAU,GAAG,WAAwC;CACpE,KAAK,MAAM,YAAY,WACrB,OAAO;AAEX;;;;AAKA,UAAiB,IACf,GAAG,WACW;CACd,MAAM,YAAY,UAAU,KAAK,OAAO,GAAG,OAAO,SAAS,CAAC,CAAC;CAE7D,OAAO,MAAM;EACX,MAAM,UAAU,UAAU,KAAK,OAAO,GAAG,KAAK,CAAC;EAC/C,IAAI,QAAQ,MAAM,MAAM,EAAE,IAAI,GAAG;EACjC,MAAM,QAAQ,KAAK,MAAM,EAAE,KAAK;CAClC;AACF;;;;AAKA,UAAiB,UAAa,UAA+C;CAC3E,IAAI,QAAQ;CACZ,KAAK,MAAM,SAAS,UAClB,MAAM,CAAC,SAAS,KAAK;AAEzB;;;;AASA,UAAiB,MAAS,UAAuB,MAA8B;CAC7E,IAAI,QAAa,CAAC;CAClB,KAAK,MAAM,SAAS,UAAU;EAC5B,MAAM,KAAK,KAAK;EAChB,IAAI,MAAM,WAAW,MAAM;GACzB,MAAM;GACN,QAAQ,CAAC;EACX;CACF;CACA,IAAI,MAAM,SAAS,GACjB,MAAM;AAEV;;;;AAKA,UAAiB,OAAU,UAAuB,MAA8B;CAC9E,MAAM,SAAc,CAAC;CACrB,KAAK,MAAM,SAAS,UAAU;EAC5B,OAAO,KAAK,KAAK;EACjB,IAAI,OAAO,SAAS,MAClB,OAAO,MAAM;EAEf,IAAI,OAAO,WAAW,MACpB,MAAM,CAAC,GAAG,MAAM;CAEpB;AACF;;;;AAKA,SAAgB,UACd,UACA,WACY;CACZ,MAAM,SAAc,CAAC;CACrB,MAAM,QAAa,CAAC;CAEpB,KAAK,MAAM,SAAS,UAClB,IAAI,UAAU,KAAK,GACjB,OAAO,KAAK,KAAK;MAEjB,MAAM,KAAK,KAAK;CAIpB,OAAO,CAAC,QAAQ,KAAK;AACvB;;;;AASA,SAAgB,OACd,UACA,IACA,SACG;CACH,IAAI,MAAM;CACV,IAAI,QAAQ;CACZ,KAAK,MAAM,SAAS,UAClB,MAAM,GAAG,KAAK,OAAO,OAAO;CAE9B,OAAO;AACT;;;;AAKA,UAAiB,KACf,UACA,IACA,SACc;CACd,IAAI,MAAM;CACV,MAAM;CACN,KAAK,MAAM,SAAS,UAAU;EAC5B,MAAM,GAAG,KAAK,KAAK;EACnB,MAAM;CACR;AACF;;;;AASA,UAAiB,KACf,UACA,SACc;CACd,MAAM,QAAQ,MAAM,KAAK,QAAQ;CACjC,MAAM,KAAK,OAAO;CAClB,OAAO;AACT;;;;AAKA,UAAiB,QAAW,UAAqC;CAC/D,MAAM,QAAQ,MAAM,KAAK,QAAQ;CACjC,MAAM,QAAQ;CACd,OAAO;AACT;;;;AASA,UAAiB,SACf,UACA,OACc;CACd,MAAM,uBAAO,IAAI,IAAO;CACxB,KAAK,MAAM,SAAS,UAAU;EAC5B,MAAM,MAAO,QAAQ,MAAM,KAAK,IAAI;EACpC,IAAI,CAAC,KAAK,IAAI,GAAG,GAAG;GAClB,KAAK,IAAI,GAAG;GACZ,MAAM;EACR;CACF;AACF;;;;AAKA,UAAiB,oBACf,UACA,OACc;CACd,IAAI;CACJ,IAAI,QAAQ;CAEZ,KAAK,MAAM,SAAS,UAAU;EAC5B,MAAM,MAAO,QAAQ,MAAM,KAAK,IAAI;EACpC,IAAI,SAAS,QAAQ,SAAS;GAC5B,MAAM;GACN,UAAU;GACV,QAAQ;EACV;CACF;AACF;;;;AASA,UAAiB,IACf,UACA,IACc;CACd,IAAI,QAAQ;CACZ,KAAK,MAAM,SAAS,UAAU;EAC5B,GAAG,OAAO,OAAO;EACjB,MAAM;CACR;AACF;;;;AASA,SAAgB,KACd,UACA,WACS;CACT,KAAK,MAAM,SAAS,UAClB,IAAI,UAAU,KAAK,GAAG,OAAO;CAE/B,OAAO;AACT;;;;AAKA,SAAgB,MACd,UACA,WACS;CACT,KAAK,MAAM,SAAS,UAClB,IAAI,CAAC,UAAU,KAAK,GAAG,OAAO;CAEhC,OAAO;AACT;;;;AAKA,SAAgB,KACd,UACA,WACS;CACT,OAAO,CAAC,KAAK,UAAU,SAAS;AAClC;;;;AAKA,SAAgB,KACd,UACA,WACe;CACf,KAAK,MAAM,SAAS,UAClB,IAAI,UAAU,KAAK,GAAG,OAAO;AAGjC;;;;AAKA,SAAgB,MACd,UACA,WACQ;CACR,IAAI,QAAQ;CACZ,KAAK,MAAM,SAAS,UAClB,IAAI,CAAC,aAAa,UAAU,KAAK,GAC/B;CAGJ,OAAO;AACT;;;;AASA,SAAgB,IACd,UACA,SACe;CACf,MAAM,MAAM,aAAa,GAAQ,MAAW,IAAI;CAChD,IAAI;CAEJ,KAAK,MAAM,SAAS,UAClB,IAAI,aAAa,KAAA,KAAa,IAAI,OAAO,QAAQ,IAAI,GACnD,WAAW;CAIf,OAAO;AACT;;;;AAKA,SAAgB,IACd,UACA,SACe;CACf,MAAM,MAAM,aAAa,GAAQ,MAAW,IAAI;CAChD,IAAI;CAEJ,KAAK,MAAM,SAAS,UAClB,IAAI,aAAa,KAAA,KAAa,IAAI,OAAO,QAAQ,IAAI,GACnD,WAAW;CAIf,OAAO;AACT;;;;AAKA,SAAgB,IAAI,UAAoC;CACtD,IAAI,QAAQ;CACZ,KAAK,MAAM,SAAS,UAClB,SAAS;CAEX,OAAO;AACT;;;;AAKA,SAAgB,QAAQ,UAAgD;CACtE,IAAI,QAAQ;CACZ,IAAI,QAAQ;CAEZ,KAAK,MAAM,SAAS,UAAU;EAC5B,SAAS;EACT;CACF;CAEA,OAAO,UAAU,IAAI,KAAA,IAAY,QAAQ;AAC3C;;;;AASA,SAAgBC,UAAW,UAA4B;CACrD,OAAO,MAAM,KAAK,QAAQ;AAC5B;;;;AAKA,SAAgBC,QAAS,UAA+B;CACtD,OAAO,IAAI,IAAI,QAAQ;AACzB;;;;AAKA,SAAgBC,QACd,UACA,OACA,SACW;CACX,MAAM,sBAAM,IAAI,IAAU;CAC1B,KAAK,MAAM,SAAS,UAClB,IAAI,IAAI,MAAM,KAAK,GAAG,QAAQ,KAAK,CAAC;CAEtC,OAAO;AACT;;;;;;;;;;;;;AAkBA,SAAgB,KACd,OACA,GAAG,KACE;CACL,OAAO,IAAI,QAAQ,KAAK,OAAO,GAAG,GAAG,GAAG,KAAK;AAC/C;;;;;;;;;;;;;;;;;;;;AC5dA,SAAgB,QACd,UACA,WACG;CACH,IAAI,MAAM,UAAU,SAAS;CAC7B,KAAK,MAAM,WAAW,UACpB,MAAM,UAAU,YAAY,KAAK,OAAO;CAE1C,OAAO,UAAU,SAAS,GAAG;AAC/B;;;;AASA,SAAgB,SAAsD;CACpE,OAAO;EACL,gBAAgB,UAAa;EAC7B,cAAc,MAAM,aAAa,KAAK,IAAI,OAAO,GAAG;EACpD,WAAW,SAAS;CACtB;AACF;;;;AAKA,SAAgB,QAAiD;CAC/D,OAAO;EACL,gBAAgB,QAAW;EAC3B,cAAc,KAAK,aAAa,IAAI,IAAI,OAAO,GAAG;EAClD,WAAW,QAAQ;CACrB;AACF;;;;AAKA,SAAgB,UAAqC;CACnD,OAAO;EACL,gBAAgB,CAAC;EACjB,cAAc,KAAK,aAAa,IAAI,KAAK,OAAO,GAAG;EACnD,WAAW,QAAQ;CACrB;AACF;;;;AAKA,SAAgB,MACd,cACA,gBAC4C;CAC5C,OAAO;EACL,gBAAgB,QAAc;EAC9B,cAAc,KAAK,YAAY;GAC7B,IAAI,IAAI,aAAa,OAAO,GAAG,eAAe,OAAO,CAAC;GACtD,OAAO;EACT;EACA,WAAW,QAAQ;CACrB;AACF;;;;;;;;AAaA,SAAgB,WACd,YACkE;CAClE,OAAO;EACL,gBAAgB,QAAyB;EACzC,cAAc,KAAK,YAAY;GAC7B,MAAM,MAAM,WAAW,OAAO;GAE9B,IADiB,gBAAgB,WAAW,UAAa,CACtD,CAAC,CAAC,IAAI,OAAO;GAChB,OAAO;EACT;EACA,WAAW,QAAQ;CACrB;AACF;;;;;;;;;;;AAYA,SAAgB,eACd,YACA,YAC4C;CAC5C,OAAO;EACL,gBAAgB,QAAc;EAC9B,cAAc,KAAK,YAAY;GAC7B,MAAM,MAAM,WAAW,OAAO;GAC9B,MAAM,MAAM,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,WAAW,SAAS;GAC9D,IAAI,IAAI,KAAK,WAAW,YAAY,KAAK,OAAO,CAAC;GACjD,OAAO;EACT;EACA,WAAW,QAAQ;GACjB,MAAM,SAAS,QAAc;GAC7B,KAAK,MAAM,SAAS,IAAI,QAAQ,GAC9B,OAAO,IAAI,MAAM,KAAK,WAAW,SAAS,MAAM,KAAK,CAAC;GAExD,OAAO;EACT;CACF;AACF;;;;;;;;;;;AAYA,SAAgB,eACd,WAC8E;CAC9E,OAAO,YAAY,YAAY,UAAU,OAAO,CAAC;AACnD;;;;AASA,SAAgB,WAA4C;CAC1D,OAAO;EACL,gBAAgB;EAChB,cAAc,UAAU,QAAQ;EAChC,WAAW,UAAU;CACvB;AACF;;;;AAKA,SAAgB,cACd,QAC8B;CAC9B,OAAO;EACL,gBAAgB;EAChB,cAAc,KAAK,YAAY,MAAM,OAAO,OAAO;EACnD,WAAW,QAAQ;CACrB;AACF;;;;AAKA,SAAgB,gBACd,QACsD;CACtD,OAAO;EACL,iBAAiB;GAAE,KAAK;GAAG,OAAO;EAAE;EACpC,cAAc,KAAK,YAAY;GAC7B,IAAI,OAAO,OAAO,OAAO;GACzB,IAAI;GACJ,OAAO;EACT;EACA,WAAW,QAAS,IAAI,UAAU,IAAI,IAAI,IAAI,MAAM,IAAI;CAC1D;AACF;;;;AAKA,SAAgB,MACd,YAC4C;CAC5C,OAAO;EACL,gBAAgB,KAAA;EAChB,cAAc,KAAK,YAAY;GAC7B,IAAI,QAAQ,KAAA,KAAa,WAAW,SAAS,GAAG,IAAI,GAClD,OAAO;GAET,OAAO;EACT;EACA,WAAW,QAAQ;CACrB;AACF;;;;AAKA,SAAgB,MACd,YAC4C;CAC5C,OAAO;EACL,gBAAgB,KAAA;EAChB,cAAc,KAAK,YAAY;GAC7B,IAAI,QAAQ,KAAA,KAAa,WAAW,SAAS,GAAG,IAAI,GAClD,OAAO;GAET,OAAO;EACT;EACA,WAAW,QAAQ;CACrB;AACF;;;;;;;;;;;;;;AAmBA,SAAgB,QACd,YAAoB,IACpB,SAAiB,IACjB,SAAiB,IACe;CAChC,OAAO;EACL,gBAAgB,CAAC;EACjB,cAAc,OAAO,aAAa,MAAM,KAAK,OAAO,OAAO,CAAC,GAAG;EAC/D,WAAW,UAAU,SAAS,MAAM,KAAK,SAAS,IAAI;CACxD;AACF;;;;;;;;;;AAeA,SAAgB,QACd,QACA,YACoB;CACpB,OAAO;EACL,UAAU,WAAW;EACrB,cAAc,KAAK,YAAY,WAAW,YAAY,KAAK,OAAO,OAAO,CAAC;EAC1E,UAAU,WAAW;CACvB;AACF;;;;AAKA,SAAgB,UACd,WACA,YACoB;CACpB,OAAO;EACL,UAAU,WAAW;EACrB,cAAc,KAAK,YAAY;GAC7B,OAAO,UAAU,OAAO,IAAI,WAAW,YAAY,KAAK,OAAO,IAAI;EACrE;EACA,UAAU,WAAW;CACvB;AACF;;;;AAKA,SAAgB,YACd,QACA,YACoB;CACpB,OAAO;EACL,UAAU,WAAW;EACrB,cAAc,KAAK,YAAY;GAC7B,KAAK,MAAM,UAAU,OAAO,OAAO,GACjC,MAAM,WAAW,YAAY,KAAK,MAAM;GAE1C,OAAO;EACT;EACA,UAAU,WAAW;CACvB;AACF;;;;AASA,SAAgB,SACd,UACA,SACoB;CACpB,OAAO;EACL,gBAAgB;EAChB,cAAc,KAAK,YAAY,QAAQ,KAAK,OAAO;EACnD,WAAW,QAAQ;CACrB;AACF;;;;AAKA,SAAgB,aACd,UACA,QACA,SACoB;CACpB,OAAO;EACL,gBAAgB;EAChB,cAAc,KAAK,YAAY,QAAQ,KAAK,OAAO,OAAO,CAAC;EAC3D,WAAW,QAAQ;CACrB;AACF;;;;;;;;;;;;;;AAmBA,SAAgB,OACd,YACA,YACA,UAC2B;CAC3B,OAAO;EACL,gBAAgB,CAAC,WAAW,SAAS,GAAG,WAAW,SAAS,CAAC;EAC7D,cAAc,CAAC,MAAM,OAAO,YAAY,CACtC,WAAW,YAAY,MAAM,OAAO,GACpC,WAAW,YAAY,MAAM,OAAO,CACtC;EACA,WAAW,CAAC,MAAM,UAAU;GAC1B,OAAO,SAAS,WAAW,SAAS,IAAI,GAAG,WAAW,SAAS,IAAI,CAAC;EACtE;CACF;AACF;;;;AASA,SAAgB,QAAuD;CACrE,OAAO;EACL,gBAAgB,KAAA;EAChB,cAAc,OAAO,YAAa,UAAU,KAAA,IAAY,UAAU;EAClE,WAAW,UAAU;CACvB;AACF;;;;AAKA,SAAgB,OAAsD;CACpE,OAAO;EACL,gBAAgB,KAAA;EAChB,cAAc,OAAO,YAAY;EACjC,WAAW,SAAS;CACtB;AACF;AAaA,SAAgB,kBACd,QAC6D;CAC7D,OAAO;EACL,iBAAiB;GACf,OAAO;GACP,KAAK;GACL,KAAK;GACL,KAAK;EACP;EACA,cAAc,OAAO,YAAY;GAC/B,MAAM,QAAQ,OAAO,OAAO;GAG5B,MAAM,QAAQ,MAAM,QAAS;GAC7B,MAAM,MAAM,MAAM,MAAO;GACzB,MAAM,MAAM,KAAK,IAAI,MAAM,KAAM,KAAK;GACtC,MAAM,MAAM,KAAK,IAAI,MAAM,KAAM,KAAK;GACtC,OAAO;EACT;EACA,WAAW,WAAW;GACpB,OAAO,MAAM;GACb,KAAK,MAAM;GACX,KAAK,MAAM;GACX,KAAK,MAAM;GACX,SAAS,MAAM,UAAW,IAAI,IAAI,MAAM,MAAO,MAAM;EACvD;CACF;AACF;;;;;;;;;;;;;;;;;ACtdA,MAAM,mCAAmB,IAAI,IAAc;AAE3C,SAAgB,YAAwB;CACtC,MAAM,MAAM;CACZ,IAAI,CAAC,iBAAiB,IAAI,GAAG,GAAG;EAC9B,MAAM,OAAO,QAAQ,SAAkB,CAAC,CAAC,CAAC,UAAa,CAAC;EACxD,iBAAiB,IAAI,KAAK,IAAI;CAChC;CACA,OAAO,iBAAiB,IAAI,GAAG;AACjC;;;;AAKA,MAAM,oCAAoB,IAAI,IAAc;AAE5C,SAAgB,aAA0B;CACxC,MAAM,MAAM;CACZ,IAAI,CAAC,kBAAkB,IAAI,GAAG,GAAG;EAC/B,MAAM,QAAQ,QAAQ,SAAmB,CAAC,CAAC,CAAC,WAAc,CAAa;EACvE,kBAAkB,IAAI,KAAK,KAAK;CAClC;CACA,OAAO,kBAAkB,IAAI,GAAG;AAClC;;;;AAKA,MAAM,kCAAkB,IAAI,IAAc;AAE1C,SAAgB,WAAgC;CAC9C,MAAM,MAAM;CACZ,IAAI,CAAC,gBAAgB,IAAI,GAAG,GAAG;EAC7B,MAAM,MAAM,QAAQ,SAAwB,CAAC,CAAC,CAAC,QAAc,CAAC;EAC9D,gBAAgB,IAAI,KAAK,GAAG;CAC9B;CACA,OAAO,gBAAgB,IAAI,GAAG;AAChC;;;;;;;;;;AAeA,SAAgB,cAAiB,SAAqB;CACpD,MAAM,OAAO,UAAa;CAC1B,KAAK,IAAI,OAAO;CAChB,OAAO,QAAQ,SAAkB,CAAC,CAAC,CAAC,IAAI;AAC1C;;;;AAKA,SAAgB,aAAmB,KAAQ,OAAyB;CAClE,MAAM,MAAM,QAAc;CAC1B,IAAI,IAAI,KAAK,KAAK;CAClB,OAAO,QAAQ,SAAwB,CAAC,CAAC,CAAC,GAAG;AAC/C;;;;;;;;;AAcA,SAAgB,QAAW,GAAW,SAAqB;CACzD,IAAI,IAAI,GACN,MAAM,IAAI,MAAM,+BAA+B,GAAG;CAGpD,MAAM,OAAO,UAAa;CAC1B,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KACrB,KAAK,IAAI,OAAO;CAElB,OAAO,QAAQ,SAAkB,CAAC,CAAC,CAAC,IAAI;AAC1C;;;;;;;AAYA,SAAgB,OAAU,GAAG,UAA6B;CACxD,OAAO,UAAU,QAAQ;AAC3B;;;;AAKA,SAAgB,QAAW,GAAG,UAA8B;CAC1D,OAAO,WAAW,QAAQ;AAC5B;;;;;;;AAQA,SAAgB,MAAY,GAAG,SAAkC;CAC/D,OAAO,QAAQ,OAAO;AACxB;;;;;;;;AAaA,SAAgB,cAAiB,GAAG,UAA6B;CAC/D,OAAO,UAAU,QAAQ;AAC3B;;;;AAKA,SAAgB,aAAmB,GAAG,SAAkC;CACtE,OAAO,QAAQ,OAAO;AACxB;;;;;;;;;AAcA,SAAgB,gBAAmB,GAAG,UAAwB;CAC5D,IAAI,SAAS,WAAW,GACtB,OAAO,UAAa;CAEtB,IAAI,SAAS,WAAW,GACtB,OAAO,cAAc,SAAS,EAAQ;CAExC,MAAM,OAAO,UAAU,QAAQ;CAC/B,OAAO,QAAQ,SAAkB,CAAC,CAAC,CAAC,IAAI;AAC1C;;;;AAKA,SAAgB,eAAqB,GAAG,SAAkC;CACxE,IAAI,QAAQ,WAAW,GACrB,OAAO,SAAe;CAExB,IAAI,QAAQ,WAAW,GACrB,OAAO,aAAa,QAAQ,EAAE,CAAE,IAAI,QAAQ,EAAE,CAAE,EAAE;CAEpD,MAAM,MAAM,QAAQ,OAAO;CAC3B,OAAO,QAAQ,SAAwB,CAAC,CAAC,CAAC,GAAG;AAC/C;;;;;;;;AAaA,SAAgB,MAAM,OAAe,KAAa,OAAe,GAAsB;CACrF,IAAI,SAAS,GACX,MAAM,IAAI,MAAM,qBAAqB;CAGvC,MAAM,OAAO,UAAkB;CAE/B,IAAI,OAAO,GACT,KAAK,IAAI,IAAI,OAAO,IAAI,KAAK,KAAK,MAChC,KAAK,IAAI,CAAC;MAGZ,KAAK,IAAI,IAAI,OAAO,IAAI,KAAK,KAAK,MAChC,KAAK,IAAI,CAAC;CAId,OAAO;AACT;;;;;;;AAQA,SAAgB,QAAQ,GAA8B;CACpD,OAAO,MAAM,GAAG,CAAC;AACnB;;;;;;;;;;;;;AAkBA,SAAgB,UAAa,SAAqD;CAChF,MAAM,OAAO,UAAa;CAC1B,QAAQ,IAAI;CACZ,OAAO;AACT;;;;AAKA,SAAgB,SAAe,SAAsD;CACnF,MAAM,MAAM,QAAc;CAC1B,QAAQ,GAAG;CACX,OAAO;AACT;;;;;;;;AAaA,SAAgBC,SAAU,UAAqC;CAC7D,OAAO,UAAU,QAAQ;AAC3B;AAkBA,SAAgBC,QACd,UACA,cACA,gBACiB;CACjB,MAAM,MAAM,QAAgB;CAC5B,KAAK,MAAM,QAAQ,UAAU;EAC3B,MAAM,MAAM,aAAa,IAAI;EAC7B,MAAM,QAAQ,iBAAiB,eAAe,IAAI,IAAI;EACtD,IAAI,IAAI,KAAK,KAAK;CACpB;CACA,OAAO;AACT;;;;;;;;;;;;;AAkBA,SAAgB,QACd,UACA,cAC0B;CAC1B,MAAM,MAAM,QAAyB;CAErC,KAAK,MAAM,QAAQ,UAAU;EAC3B,MAAM,MAAM,aAAa,IAAI;EAE7B,IADiB,gBAAgB,WAAW,UAAa,CACtD,CAAC,CAAC,IAAI,IAAI;CACf;CAEA,OAAO;AACT;;;;;;;;;;;AC/UA,SAAgB,YAAY,OAAe,MAAc,iBAAyB,cAAoB;CACpG,IAAI,QAAQ,KAAK,SAAS,MACxB,MAAM,IAAI,WAAW,GAAG,eAAe,UAAU,MAAM,qBAAqB,KAAK,EAAE;AAEvF;;;;;;;;;;AAWA,SAAgB,kBAAkB,OAAe,MAAc,iBAAyB,cAAoB;CAC1G,IAAI,QAAQ,KAAK,QAAQ,MACvB,MAAM,IAAI,WAAW,GAAG,eAAe,UAAU,MAAM,qBAAqB,KAAK,EAAE;AAEvF;;;;;;;;;;AAWA,SAAgB,iBACd,OACA,KACA,MACA,iBAAyB,cACnB;CACN,IAAI,QAAQ,KAAK,MAAM,QAAQ,QAAQ,KACrC,MAAM,IAAI,WACR,GAAG,eAAe,mBAAmB,MAAM,IAAI,IAAI,aAAa,MAClE;AAEJ;;;;;;;;;AAcA,SAAgB,UAAa,OAAY,SAAY,IAAmB;CACtE,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAChC,IAAI,GAAG,MAAM,IAAK,OAAO,GACvB,OAAO;CAGX,OAAO;AACT;;;;;;;;;AAUA,SAAgB,cAAiB,OAAY,SAAY,IAAmB;CAC1E,KAAK,IAAI,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KACrC,IAAI,GAAG,MAAM,IAAK,OAAO,GACvB,OAAO;CAGX,OAAO;AACT;;;;;;;;;AAUA,SAAgB,cAAiB,OAAY,SAAY,IAAoB;CAC3E,OAAO,UAAU,OAAO,SAAS,EAAE,MAAM;AAC3C;;;;;;;;;AAUA,SAAgB,YAAe,OAAY,SAAY,IAAoB;CACzE,MAAM,QAAQ,UAAU,OAAO,SAAS,EAAE;CAC1C,IAAI,UAAU,IAAI,OAAO;CACzB,MAAM,OAAO,OAAO,CAAC;CACrB,OAAO;AACT;;;;;;;;;AAUA,SAAgB,eAAkB,OAAY,SAAY,IAAmB;CAC3E,IAAI,QAAQ;CACZ,KAAK,IAAI,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KACrC,IAAI,GAAG,MAAM,IAAK,OAAO,GAAG;EAC1B,MAAM,OAAO,GAAG,CAAC;EACjB;CACF;CAEF,OAAO;AACT;;;;;;;AAYA,UAAiB,cAAiB,OAAyB;CACzD,OAAO;AACT;;;;;;;AAQA,UAAiB,qBAAwB,OAAyB;CAChE,KAAK,IAAI,IAAI,MAAM,SAAS,GAAG,KAAK,GAAG,KACrC,MAAM,MAAM;AAEhB;;;;;;;;;AAwBA,SAAgB,eAAkB,OAA6B,UAAkB,qCAAwC;CACvH,IAAI,UAAU,QAAQ,UAAU,KAAA,GAC9B,MAAM,IAAI,MAAM,OAAO;CAEzB,OAAO;AACT;;;;;;;;AASA,SAAgB,gBAAgB,MAAc,iBAAyB,cAAoB;CACzF,IAAI,SAAS,GACX,MAAM,IAAI,MAAM,GAAG,eAAe,UAAU;AAEhD;;;;;;;;;AAcA,SAAgB,MAAM,OAAe,KAAa,KAAqB;CACrE,OAAO,KAAK,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK,CAAC;AAC3C;;;;;;;;AASA,SAAgB,eAAe,KAAqB;CAClD,IAAI,OAAO;CACX,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;EACnC,MAAM,OAAO,IAAI,WAAW,CAAC;EAC7B,QAAS,QAAQ,KAAK,OAAQ;EAC9B,OAAO,OAAO;CAChB;CACA,OAAO;AACT"}