@but212/atom-effect 0.22.2 → 0.24.0

package/dist/index.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.mjs","sources":["../src/constants.ts","../src/errors/errors.ts","../src/utils/debug.ts","../src/core/dep-tracking.ts","../src/errors/messages.ts","../src/utils/error.ts","../src/core/base.ts","../src/internal/epoch.ts","../src/internal/scheduler.ts","../src/symbols.ts","../src/tracking/context.ts","../src/tracking/untracked.ts","../src/core/atom.ts","../src/utils/array-pool.ts","../src/internal/pool.ts","../src/utils/type-guards.ts","../src/core/computed.ts","../src/core/effect.ts","../src/internal/batch.ts"],"sourcesContent":["/**\n * Async operation states.\n */\nexport const AsyncState = {\n  IDLE: 'idle',\n  PENDING: 'pending',\n  RESOLVED: 'resolved',\n  REJECTED: 'rejected',\n} as const;\n\n/**\n * Effect flags.\n */\nexport const EFFECT_STATE_FLAGS = {\n  DISPOSED: 1 << 0,\n  EXECUTING: 1 << 3,\n} as const;\n\n/**\n * Computed flags.\n */\nexport const COMPUTED_STATE_FLAGS = {\n  DISPOSED: 1 << 0,\n  /** Marker bit: identifies this node as a computed. */\n  IS_COMPUTED: 1 << 1,\n  DIRTY: 1 << 3,\n  IDLE: 1 << 4,\n  PENDING: 1 << 5,\n  RESOLVED: 1 << 6,\n  REJECTED: 1 << 7,\n  RECOMPUTING: 1 << 8,\n  HAS_ERROR: 1 << 9,\n} as const;\n\n/**\n * Writable Atom Flags.\n */\nexport const ATOM_STATE_FLAGS = {\n  DISPOSED: 1 << 0,\n  SYNC: 1 << 3,\n  NOTIFICATION_SCHEDULED: 1 << 4,\n} as const;\n\n/**\n * Array pool configuration.\n */\nexport const POOL_CONFIG = {\n  MAX_SIZE: 1000,\n  WARMUP_SIZE: 100,\n  ENABLE_STATS: false,\n} as const;\n\n/**\n * Scheduler configuration.\n */\nexport const SCHEDULER_CONFIG = {\n  // Infinite loop protection\n  MAX_EXECUTIONS_PER_SECOND: 1000,\n  MAX_EXECUTIONS_PER_EFFECT: 100,\n\n  // Batch processing limits to prevent blocking the main thread for too long\n  MAX_EXECUTIONS_PER_FLUSH: 10000,\n  MAX_FLUSH_ITERATIONS: 1000,\n  MIN_FLUSH_ITERATIONS: 10,\n\n  // Memory management\n  BATCH_QUEUE_SHRINK_THRESHOLD: 1000,\n} as const;\n\n/**\n * Debugging thresholds.\n */\nexport const DEBUG_CONFIG = {\n  WARN_INFINITE_LOOP: true,\n  EFFECT_FREQUENCY_WINDOW: 1000,\n} as const;\n\n/**\n * Computed configuration.\n */\nexport const COMPUTED_CONFIG = {\n  MAX_ASYNC_RETRIES: 3,\n  MAX_PROMISE_ID: Number.MAX_SAFE_INTEGER - 1,\n} as const;\n\n/**\n * V8 Small Integer (SMI) max value.\n */\nexport const SMI_MAX = 0x3fffffff;\n\n/**\n * Development environment flag.\n */\nexport const IS_DEV =\n  (typeof process !== 'undefined' && process.env && process.env.NODE_ENV !== 'production') ||\n  (typeof __DEV__ !== 'undefined' && !!__DEV__);\n\n// Fallback declaration for __DEV__ if not present in environment\ndeclare const __DEV__: boolean;\n\nexport const EMPTY_ERROR_ARRAY: readonly Error[] = Object.freeze([]);\n","/**\n * Base error class.\n */\nexport class AtomError extends Error {\n  constructor(\n    message: string,\n    public cause: Error | null = null,\n    public recoverable = true\n  ) {\n    super(message);\n    this.name = 'AtomError';\n  }\n}\n\n/** Computed error. */\nexport class ComputedError extends AtomError {\n  constructor(message: string, cause: Error | null = null) {\n    super(message, cause, true);\n    this.name = 'ComputedError';\n  }\n}\n\n/** Effect error. */\nexport class EffectError extends AtomError {\n  constructor(message: string, cause: Error | null = null) {\n    super(message, cause, false);\n    this.name = 'EffectError';\n  }\n}\n\n/** Scheduler error. */\nexport class SchedulerError extends AtomError {\n  constructor(message: string, cause: Error | null = null) {\n    super(message, cause, false);\n    this.name = 'SchedulerError';\n  }\n}\n","import { DEBUG_CONFIG, IS_DEV } from '@/constants';\nimport { ComputedError } from '@/errors/errors';\nimport type { DebugConfig, Dependency, DependencyId } from '@/types';\n\n// Debug symbols\nexport const DEBUG_NAME = Symbol('AtomEffect.DebugName');\nexport const DEBUG_ID = Symbol('AtomEffect.Id');\nexport const DEBUG_TYPE = Symbol('AtomEffect.Type');\nexport const NO_DEFAULT_VALUE = Symbol('AtomEffect.NoDefaultValue');\n\n/**\n * Dependency type guard.\n */\nconst hasDeps = (o: Dependency): o is Dependency & { dependencies: Dependency[] } =>\n  'dependencies' in o && Array.isArray((o as { dependencies: unknown }).dependencies);\n\n/**\n * Cycle detection.\n */\nfunction checkCircularInternal(dep: Dependency, current: object, visited: Set<number>): void {\n  // Cycle detected in *this* path\n  if (dep === current) {\n    throw new ComputedError(\n      'Circular dependency detected: The computation refers to itself explicitly or implicitly.'\n    );\n  }\n\n  // Cycle check\n  if (visited.has(dep.id)) return;\n  visited.add(dep.id);\n\n  if (hasDeps(dep)) {\n    // Check dependencies\n    dep.dependencies.forEach((child) => {\n      if (child) {\n        checkCircularInternal(child, current, visited);\n      }\n    });\n  }\n}\n\n/**\n * Debug controller.\n */\nexport const debug: DebugConfig = {\n  // Dev mode flag\n  enabled: IS_DEV,\n\n  warnInfiniteLoop: DEBUG_CONFIG.WARN_INFINITE_LOOP,\n\n  warn(cond, msg) {\n    if (IS_DEV && this.enabled && cond) {\n      console.warn(`[Atom Effect] ${msg}`);\n    }\n  },\n\n  checkCircular(dep, current) {\n    if (dep === current) {\n      throw new ComputedError('Direct circular dependency detected');\n    }\n\n    if (IS_DEV && this.enabled) {\n      checkCircularInternal(dep, current, new Set());\n    }\n  },\n\n  attachDebugInfo(obj, type, id) {\n    if (!IS_DEV || !this.enabled) return;\n\n    const t = obj as Record<symbol, unknown>;\n    t[DEBUG_NAME] = `${type}_${id}`;\n    t[DEBUG_ID] = id;\n    t[DEBUG_TYPE] = type;\n  },\n\n  getDebugName: (obj) =>\n    (obj as Record<symbol, unknown> | null)?.[DEBUG_NAME] as string | undefined,\n\n  getDebugType: (obj) =>\n    (obj as Record<symbol, unknown> | null)?.[DEBUG_TYPE] as string | undefined,\n};\n\n/**\n * ID counter.\n */\nlet nextId = 1;\n\n/**\n * Generates ID.\n */\nexport const generateId = (): DependencyId => nextId++;\n","import type { DependencySubscriber, Listener } from '@/tracking/tracking.types';\nimport type { Dependency, Subscriber } from '@/types';\nimport { debug } from '@/utils/debug';\n/**\n * Tracks dependency.\n */\nexport function trackDependency<T>(\n  dependency: Dependency,\n  current: Listener,\n  subscribers: Subscription<T>[]\n): void {\n  if (typeof current === 'function') {\n    const fn = current as (newValue?: T, oldValue?: T) => void;\n    // O(n) duplicate check — acceptable because:\n    // 1. subscribers array is typically 1-10 elements\n    // 2. DependencySubscriber (hot path) uses O(1) epoch-based dedup via addDependency\n    // 3. This branch only runs for raw function listeners (uncommon)\n    if (subscribers.some((link) => link && link.fn === fn)) return;\n    subscribers.push(new Subscription(fn, undefined));\n    return;\n  }\n\n  if ('addDependency' in (current as object)) {\n    (current as DependencySubscriber).addDependency(dependency);\n    return;\n  }\n\n  const sub = current as Subscriber;\n  if (subscribers.some((link) => link && link.sub === sub)) return;\n  subscribers.push(new Subscription(undefined, sub));\n}\n\n/**\n * Syncs dependencies.\n * Uses a local Map to park previous subscriptions, avoiding\n * temporary state on dependency nodes.\n */\nexport function syncDependencies(\n  nextLinks: DependencyLink[],\n  prevLinks: DependencyLink[],\n  tracker: Subscriber\n): void {\n  // Park: collect previous subscriptions into a local Map\n  const parked = new Map<Dependency, () => void>();\n  prevLinks.forEach((link) => {\n    if (link?.unsub) {\n      parked.set(link.node, link.unsub);\n    }\n  });\n\n  // Reclaim or subscribe\n  nextLinks.forEach((link) => {\n    if (!link) return;\n\n    const node = link.node;\n    const existing = parked.get(node);\n    if (existing !== undefined) {\n      // Re-link: reclaim subscription from previous set\n      link.unsub = existing;\n      parked.delete(node);\n    } else {\n      // New link: subscribe afresh\n      debug.checkCircular(node, tracker);\n      link.unsub = node.subscribe(tracker);\n    }\n  });\n\n  // Cleanup: release unused subscriptions\n  parked.forEach((unsub) => unsub());\n}\n\n/**\n * Dependency graph edge.\n */\nexport class DependencyLink {\n  public unsub: (() => void) | undefined;\n\n  constructor(\n    public node: Dependency,\n    public version: number,\n    unsub: (() => void) | undefined = undefined\n  ) {\n    // Always initialize to maintain consistent V8 hidden class\n    this.unsub = unsub;\n  }\n}\n\n/**\n * Subscription entry.\n */\nexport class Subscription<T> {\n  public fn: ((newValue?: T, oldValue?: T) => void) | undefined;\n  public sub: Subscriber | undefined;\n\n  constructor(fn: ((newValue?: T, oldValue?: T) => void) | undefined, sub: Subscriber | undefined) {\n    // Always initialize both properties to maintain consistent V8 hidden class\n    this.fn = fn;\n    this.sub = sub;\n  }\n}\n","/**\n * Error message registry.\n */\nexport const ERROR_MESSAGES = {\n  // Computed Errors\n  COMPUTED_MUST_BE_FUNCTION: 'Computed target must be a function',\n  COMPUTED_ASYNC_PENDING_NO_DEFAULT: 'Async computation pending with no default value',\n  COMPUTED_COMPUTATION_FAILED: 'Computation execution failed',\n  COMPUTED_ASYNC_COMPUTATION_FAILED: 'Async computation execution failed',\n  COMPUTED_CIRCULAR_DEPENDENCY: 'Circular dependency detected',\n  COMPUTED_DISPOSED: 'Attempted to access disposed computed',\n\n  // Atom Errors\n  ATOM_SUBSCRIBER_MUST_BE_FUNCTION: 'Subscriber must be a function or Subscriber object',\n  ATOM_INDIVIDUAL_SUBSCRIBER_FAILED: 'Subscriber execution failed',\n\n  // Effect Errors\n  EFFECT_MUST_BE_FUNCTION: 'Effect target must be a function',\n  EFFECT_EXECUTION_FAILED: 'Effect execution failed',\n  EFFECT_CLEANUP_FAILED: 'Effect cleanup failed',\n  EFFECT_DISPOSED: 'Attempted to run disposed effect',\n\n  // Scheduler Errors\n  SCHEDULER_FLUSH_OVERFLOW: (max: number, dropped: number): string =>\n    `Maximum flush iterations (${max}) exceeded. ${dropped} jobs dropped. Possible infinite loop.`,\n\n  // System / Debug\n  CALLBACK_ERROR_IN_ERROR_HANDLER: 'Exception encountered in onError handler',\n\n  // Effect frequency\n  EFFECT_FREQUENCY_LIMIT_EXCEEDED:\n    'Effect executed too frequently within 1 second. Suspected infinite loop.',\n\n  SCHEDULER_CALLBACK_MUST_BE_FUNCTION: 'Scheduler callback must be a function',\n  SCHEDULER_END_BATCH_WITHOUT_START: 'endBatch() called without matching startBatch(). Ignoring.',\n} as const;\n","import { AtomError } from '@/errors/errors';\n\n/**\n * Wraps error.\n *\n * @param error - Raw error.\n * @param ErrorClass - Error class.\n * @param context - Error context.\n */\nexport function wrapError(\n  error: unknown,\n  ErrorClass: typeof AtomError,\n  context: string\n): AtomError {\n  // Return if wrapped\n  if (error instanceof AtomError) {\n    return error;\n  }\n\n  const isNativeError = error instanceof Error;\n  const originalMessage = isNativeError ? error.message : String(error);\n  const cause = isNativeError ? error : undefined;\n\n  const type = isNativeError ? error.constructor.name : 'Unexpected error';\n  const finalMessage = `${type} (${context}): ${originalMessage}`;\n\n  return new ErrorClass(finalMessage, cause);\n}\n","import { IS_DEV, SMI_MAX } from '@/constants';\nimport { Subscription } from '@/core/dep-tracking';\nimport { AtomError } from '@/errors/errors';\nimport { ERROR_MESSAGES } from '@/errors/messages';\nimport type { DependencyId, Subscriber } from '@/types';\nimport { generateId } from '@/utils/debug';\nimport { wrapError } from '@/utils/error';\n\n/**\n * Base class for all reactive nodes.\n */\nexport class ReactiveNode {\n  /** State flags */\n  flags = 0;\n  /** Version counter */\n  version = 0;\n  /** Last access epoch */\n  _lastSeenEpoch = -1;\n  /** Debug ID */\n  readonly id: DependencyId = generateId() & SMI_MAX;\n}\n\n/**\n * Reactive dependency base class.\n */\nexport abstract class ReactiveDependency<T> extends ReactiveNode {\n  protected abstract _subscribers: Subscription<T>[];\n\n  /**\n   * Adds subscriber.\n   */\n  subscribe(listener: ((newValue?: T, oldValue?: T) => void) | Subscriber): () => void {\n    const isFn = typeof listener === 'function';\n    // Validate subscriber\n    if (!isFn && (!listener || typeof (listener as Subscriber).execute !== 'function')) {\n      throw wrapError(\n        new TypeError('Invalid subscriber'),\n        AtomError,\n        ERROR_MESSAGES.ATOM_SUBSCRIBER_MUST_BE_FUNCTION\n      );\n    }\n\n    if (\n      this._subscribers.some((sub) => {\n        if (!sub) return false;\n        return isFn ? sub.fn === listener : sub.sub === listener;\n      })\n    ) {\n      if (IS_DEV) console.warn('Duplicate subscription ignored.');\n      return () => {};\n    }\n\n    const link = new Subscription<T>(\n      isFn ? (listener as (newValue?: T, oldValue?: T) => void) : undefined,\n      !isFn ? (listener as Subscriber) : undefined\n    );\n\n    const subs = this._subscribers;\n    subs.push(link);\n\n    return () => this._unsubscribe(link);\n  }\n\n  private _unsubscribe(link: Subscription<T>): void {\n    const subs = this._subscribers;\n    const idx = subs.indexOf(link);\n    if (idx === -1) return;\n\n    // Remove subscriber\n    const last = subs.pop();\n    if (idx < subs.length && last) {\n      subs[idx] = last;\n    }\n  }\n\n  subscriberCount(): number {\n    return this._subscribers.length;\n  }\n\n  protected _notifySubscribers(newValue: T | undefined, oldValue: T | undefined): void {\n    if (this._subscribers.length === 0) return;\n\n    const subs = this._subscribers.slice(0);\n    subs.forEach((s) => {\n      if (!s) return;\n      try {\n        if (s.fn) s.fn(newValue, oldValue);\n        else if (s.sub) s.sub.execute();\n      } catch (err) {\n        this._handleNotifyError(err);\n      }\n    });\n  }\n\n  private _handleNotifyError(err: unknown): void {\n    console.error(wrapError(err, AtomError, ERROR_MESSAGES.ATOM_INDIVIDUAL_SUBSCRIBER_FAILED));\n  }\n}\n","import { IS_DEV, SMI_MAX } from '@/constants';\n\n// Global epoch counter.\nlet collectorEpoch = 0;\n\n/**\n * Next tracking epoch.\n */\nexport const nextEpoch = () => {\n  collectorEpoch = (collectorEpoch + 1) & SMI_MAX || 1;\n  return collectorEpoch;\n};\n\n/** Current tracking epoch. */\nexport const currentEpoch = () => collectorEpoch;\n\n/** Increments a version counter within SMI range. */\nexport const nextVersion = (v: number) => (v + 1) & SMI_MAX;\n\nexport let flushExecutionCount = 0;\nlet isFlushing = false;\nlet _flushEpoch = 0;\n\n/** Current flush epoch. */\nexport const currentFlushEpoch = () => _flushEpoch;\n\n/**\n * Starts flush cycle.\n */\nexport function startFlush(): boolean {\n  if (isFlushing) {\n    if (IS_DEV) console.warn('startFlush() called during flush - ignored');\n    return false;\n  }\n\n  isFlushing = true;\n  _flushEpoch = nextEpoch();\n  flushExecutionCount = 0;\n  return true;\n}\n\n/** Ends flush cycle. */\nexport const endFlush = () => {\n  isFlushing = false;\n};\n\n/**\n * Increments execution count.\n */\nexport const incrementFlushExecutionCount = () => (isFlushing ? ++flushExecutionCount : 0);\n\n/**\n * Resets flush state.\n */\nexport function resetFlushState(): void {\n  _flushEpoch = 0;\n  flushExecutionCount = 0;\n  isFlushing = false;\n}\n","import { IS_DEV, SCHEDULER_CONFIG } from '@/constants';\nimport { SchedulerError } from '@/errors/errors';\nimport { ERROR_MESSAGES } from '@/errors/messages';\nimport { endFlush, startFlush } from '@/internal/epoch';\n\nexport enum SchedulerPhase {\n  IDLE = 0,\n  BATCHING = 1,\n  FLUSHING = 2,\n}\n\nexport interface SchedulerJob {\n  (): void;\n  /** Next scheduled epoch */\n  _nextEpoch?: number;\n}\n\n/**\n * Scheduler implementation.\n */\nclass Scheduler {\n  /** Queue buffer */\n  _queueBuffer: [SchedulerJob[], SchedulerJob[]] = [[], []];\n  _bufferIndex = 0;\n  _size = 0;\n\n  /** Epoch counter */\n  _epoch = 0;\n\n  /** State flags */\n  _isProcessing = false;\n  _isBatching = false;\n  _isFlushingSync = false;\n\n  /** Batching state */\n  _batchDepth = 0;\n  _batchQueue: SchedulerJob[] = [];\n  _batchQueueSize = 0;\n\n  /** Config */\n  _maxFlushIterations: number = SCHEDULER_CONFIG.MAX_FLUSH_ITERATIONS;\n\n  /** Overflow callback */\n  onOverflow: ((droppedCount: number) => void) | null = null;\n\n  /** Bound run loop for microtask */\n  private readonly _boundRunLoop = this._runLoop.bind(this);\n\n  get phase(): SchedulerPhase {\n    if (this._isProcessing || this._isFlushingSync) return SchedulerPhase.FLUSHING;\n    if (this._isBatching) return SchedulerPhase.BATCHING;\n    return SchedulerPhase.IDLE;\n  }\n\n  get queueSize(): number {\n    return this._size;\n  }\n\n  get isBatching(): boolean {\n    return this._isBatching;\n  }\n\n  /**\n   * Schedules job.\n   */\n  schedule(callback: SchedulerJob): void {\n    if (IS_DEV && typeof callback !== 'function') {\n      throw new SchedulerError(ERROR_MESSAGES.SCHEDULER_CALLBACK_MUST_BE_FUNCTION);\n    }\n\n    // Deduplicate job\n    if (callback._nextEpoch === this._epoch) return;\n    callback._nextEpoch = this._epoch;\n\n    if (this._isBatching || this._isFlushingSync) {\n      this._batchQueue[this._batchQueueSize++] = callback;\n      return;\n    }\n\n    // Push to current active buffer\n    this._queueBuffer[this._bufferIndex]![this._size++] = callback;\n\n    // Wake up if sleeping\n    if (!this._isProcessing) {\n      this._flush();\n    }\n  }\n\n  /**\n   * Triggers flush.\n   */\n  _flush(): void {\n    if (this._isProcessing || this._size === 0) return;\n    this._isProcessing = true;\n\n    queueMicrotask(this._boundRunLoop);\n  }\n\n  /**\n   * Scheduler loop.\n   */\n  private _runLoop(): void {\n    try {\n      if (this._size === 0) return;\n\n      const started = startFlush();\n      this._drainQueue();\n      if (started) endFlush();\n    } finally {\n      this._isProcessing = false;\n      // If new jobs arrived during flush (and not batching), re-schedule\n      if (this._size > 0 && !this._isBatching) {\n        this._flush();\n      }\n    }\n  }\n\n  _flushSync(): void {\n    this._isFlushingSync = true;\n    const started = startFlush();\n    try {\n      this._mergeBatchQueue();\n      this._drainQueue();\n    } finally {\n      this._isFlushingSync = false;\n      if (started) endFlush();\n    }\n  }\n\n  _mergeBatchQueue(): void {\n    if (this._batchQueueSize === 0) return;\n\n    // Increment epoch\n    const epoch = ++this._epoch;\n    const bQueue = this._batchQueue;\n    const targetBuffer = this._queueBuffer[this._bufferIndex]!;\n    let currentSize = this._size;\n\n    // Merge batch\n    bQueue.slice(0, this._batchQueueSize).forEach((job) => {\n      // Retag jobs\n      if (job._nextEpoch !== epoch) {\n        job._nextEpoch = epoch;\n        targetBuffer[currentSize++] = job;\n      }\n    });\n\n    this._size = currentSize;\n    this._batchQueueSize = 0;\n\n    // Resize batch queue\n    if (bQueue.length > SCHEDULER_CONFIG.BATCH_QUEUE_SHRINK_THRESHOLD) {\n      bQueue.length = 0;\n    }\n  }\n\n  _drainQueue(): void {\n    let iterations = 0;\n    // Process queue\n    while (this._size > 0) {\n      // Overflow check\n      if (++iterations > this._maxFlushIterations) {\n        this._handleFlushOverflow();\n        return;\n      }\n\n      this._processQueue();\n      // If batch updates happened during processing, merge them in now\n      this._mergeBatchQueue();\n    }\n  }\n\n  _processQueue(): void {\n    const idx = this._bufferIndex;\n    const jobs = this._queueBuffer[idx]!;\n    const count = this._size;\n\n    // Swap buffers\n    this._bufferIndex = idx ^ 1;\n    this._size = 0;\n    this._epoch++;\n\n    // Execute jobs\n    for (let i = 0; i < count; i++) {\n      try {\n        jobs[i]!();\n      } catch (e) {\n        console.error(new SchedulerError('Error occurred during scheduler execution', e as Error));\n      }\n    }\n    // Clear the consumed buffer\n    jobs.length = 0;\n  }\n\n  private _handleFlushOverflow(): void {\n    const droppedCount = this._size + this._batchQueueSize;\n    console.error(\n      new SchedulerError(\n        ERROR_MESSAGES.SCHEDULER_FLUSH_OVERFLOW(this._maxFlushIterations, droppedCount)\n      )\n    );\n    this._size = 0;\n    this._queueBuffer[this._bufferIndex]!.length = 0;\n    this._batchQueueSize = 0;\n\n    if (this.onOverflow) {\n      try {\n        this.onOverflow(droppedCount);\n      } catch {}\n    }\n  }\n\n  startBatch(): void {\n    this._batchDepth++;\n    this._isBatching = true;\n  }\n\n  endBatch(): void {\n    if (this._batchDepth === 0) {\n      if (IS_DEV) console.warn(ERROR_MESSAGES.SCHEDULER_END_BATCH_WITHOUT_START);\n      return;\n    }\n\n    if (--this._batchDepth === 0) {\n      this._flushSync();\n      this._isBatching = false;\n    }\n  }\n\n  setMaxFlushIterations(max: number): void {\n    if (max < SCHEDULER_CONFIG.MIN_FLUSH_ITERATIONS)\n      throw new SchedulerError(\n        `Max flush iterations must be at least ${SCHEDULER_CONFIG.MIN_FLUSH_ITERATIONS}`\n      );\n    this._maxFlushIterations = max;\n  }\n}\n\nexport const scheduler = new Scheduler();\n","/**\n * Brand symbols for reliable type identification.\n * Prevents false positives from duck-typing with external objects.\n */\nexport const ATOM_BRAND: unique symbol = Symbol.for('atom-effect/atom');\nexport const COMPUTED_BRAND: unique symbol = Symbol.for('atom-effect/computed');\nexport const EFFECT_BRAND: unique symbol = Symbol.for('atom-effect/effect');\n","import type { Listener } from './tracking.types';\n\n/**\n * Global tracking context.\n */\nexport const trackingContext = {\n  /** Active listener. */\n  current: null as Listener | null,\n\n  /**\n   * Executes in context.\n   *\n   * @param listener - The subscriber.\n   * @param fn - The logic to execute.\n   * @returns The result of `fn`.\n   */\n  run<T>(listener: Listener, fn: () => T): T {\n    const prev = this.current;\n    this.current = listener;\n    try {\n      return fn();\n    } finally {\n      this.current = prev;\n    }\n  },\n};\n\n/**\n * Tracking context type.\n */\nexport type ITrackingContext = typeof trackingContext;\n","import { trackingContext } from './context';\n\n/**\n * Untracked execution.\n *\n * @param fn - Function to execute.\n * @returns Result of `fn`.\n */\nexport function untracked<T>(fn: () => T): T {\n  const prev = trackingContext.current;\n\n  // Skip if untracked\n  if (prev === null) return fn();\n\n  trackingContext.current = null;\n  try {\n    return fn();\n  } finally {\n    trackingContext.current = prev;\n  }\n}\n","import { ATOM_STATE_FLAGS } from '@/constants';\nimport { ReactiveDependency } from '@/core/base';\nimport { type Subscription, trackDependency } from '@/core/dep-tracking';\nimport { nextVersion } from '@/internal/epoch';\nimport { scheduler } from '@/internal/scheduler';\nimport { ATOM_BRAND } from '@/symbols';\nimport { trackingContext } from '@/tracking';\nimport type { AtomOptions, WritableAtom } from '@/types';\nimport { debug } from '@/utils/debug';\n\n/**\n * Internal {@link WritableAtom} implementation.\n */\nclass AtomImpl<T> extends ReactiveDependency<T> implements WritableAtom<T> {\n  private _value: T;\n  /** Old value for notifications */\n  private _pendingOldValue: T | undefined = undefined;\n  /** Cached notification task */\n  private readonly _notifyTask = () => this._flushNotifications();\n  protected _subscribers: Subscription<T>[] = [];\n\n  /** @internal */\n  readonly [ATOM_BRAND] = true;\n\n  constructor(initialValue: T, sync: boolean) {\n    super();\n    this._value = initialValue;\n    if (sync) this.flags |= ATOM_STATE_FLAGS.SYNC;\n    debug.attachDebugInfo(this, 'atom', this.id);\n  }\n\n  get value(): T {\n    const current = trackingContext.current;\n    if (current) {\n      trackDependency(this, current, this._subscribers);\n    }\n    return this._value;\n  }\n\n  set value(newValue: T) {\n    const oldValue = this._value;\n    if (Object.is(oldValue, newValue)) return;\n\n    this._value = newValue;\n    this.version = nextVersion(this.version);\n\n    const flags = this.flags;\n    if (this._subscribers.length === 0 || flags & ATOM_STATE_FLAGS.NOTIFICATION_SCHEDULED) {\n      return;\n    }\n\n    this._pendingOldValue = oldValue;\n    this.flags = flags | ATOM_STATE_FLAGS.NOTIFICATION_SCHEDULED;\n\n    // Sync handling\n    if (flags & ATOM_STATE_FLAGS.SYNC && !scheduler.isBatching) {\n      this._flushNotifications();\n      return;\n    }\n\n    // Async scheduling\n    scheduler.schedule(this._notifyTask);\n  }\n\n  /**\n   * Triggers subscribers.\n   */\n  private _flushNotifications(): void {\n    const flags = this.flags;\n    // Guard: Spurious flush or already disposed\n    if (!(flags & ATOM_STATE_FLAGS.NOTIFICATION_SCHEDULED) || flags & ATOM_STATE_FLAGS.DISPOSED) {\n      return;\n    }\n\n    const oldValue = this._pendingOldValue as T;\n    this._pendingOldValue = undefined;\n    this.flags &= ~ATOM_STATE_FLAGS.NOTIFICATION_SCHEDULED;\n\n    this._notifySubscribers(this._value, oldValue);\n  }\n\n  peek(): T {\n    return this._value;\n  }\n\n  dispose(): void {\n    if (this.flags & ATOM_STATE_FLAGS.DISPOSED) return;\n\n    this._subscribers.length = 0;\n    this.flags |= ATOM_STATE_FLAGS.DISPOSED;\n    // Release references\n    this._value = undefined as T;\n    this._pendingOldValue = undefined;\n  }\n\n  [Symbol.dispose](): void {\n    this.dispose();\n  }\n}\n\n/**\n * Creates a reactive atom holding mutable state.\n *\n * @param initialValue - The initial value of the atom.\n * @param options - Configuration options (sync: boolean).\n */\nexport function atom<T>(initialValue: T, options: AtomOptions = {}): WritableAtom<T> {\n  return new AtomImpl(initialValue, options.sync ?? false);\n}\n","import { IS_DEV } from '@/constants';\nimport type { PoolStats } from '@/types';\n\n/**\n * Array pool.\n *\n * @template T - Element type.\n */\nexport class ArrayPool<T> {\n  private readonly pool: T[][] = [];\n\n  // Mutable stats container, null when disabled\n  private stats: {\n    acquired: number;\n    released: number;\n    rejected: { frozen: number; tooLarge: number; poolFull: number };\n  } | null = null;\n\n  /**\n   * @param limit - Max unique arrays to hold (default: 50). Prevents the pool itself from consuming too much memory.\n   * @param capacity - Max length of an array to accept (default: 256).\n   * @param enableStats - Force-enable stats even in production (default: false).\n   */\n  constructor(\n    private readonly limit = 50,\n    private readonly capacity = 256,\n    enableStats = false\n  ) {\n    this.stats =\n      IS_DEV || enableStats\n        ? {\n            acquired: 0,\n            released: 0,\n            rejected: { frozen: 0, tooLarge: 0, poolFull: 0 },\n          }\n        : null;\n  }\n\n  /**\n   * Acquires array.\n   */\n  acquire(): T[] {\n    if (this.stats) {\n      this.stats.acquired++;\n    }\n    // LIFO reuse for better cache locality\n    return this.pool.pop() ?? [];\n  }\n\n  /**\n   * Releases array.\n   *\n   * @param arr - Array to release.\n   * @param emptyConst - Optional empty constant.\n   */\n  release(arr: T[], emptyConst?: readonly T[]): void {\n    if (emptyConst && arr === emptyConst) return;\n\n    if (arr.length > this.capacity) {\n      if (this.stats) this.stats.rejected.tooLarge++;\n      return;\n    }\n\n    if (this.pool.length >= this.limit) {\n      if (this.stats) this.stats.rejected.poolFull++;\n      return;\n    }\n\n    if (Object.isFrozen(arr)) {\n      if (this.stats) this.stats.rejected.frozen++;\n      return;\n    }\n\n    arr.length = 0;\n    this.pool.push(arr);\n\n    if (this.stats) {\n      this.stats.released++;\n    }\n  }\n\n  /**\n   * Pool stats.\n   */\n  getStats(): PoolStats | null {\n    if (!this.stats) return null;\n\n    const { acquired, released, rejected } = this.stats;\n    const leakCount =\n      acquired - released - (rejected.frozen + rejected.tooLarge + rejected.poolFull);\n\n    return {\n      acquired,\n      released,\n      rejected: { ...rejected },\n      leaked: leakCount,\n      poolSize: this.pool.length,\n    };\n  }\n\n  /**\n   * Resets pool.\n   */\n  reset(): void {\n    this.pool.length = 0;\n    if (this.stats) {\n      this.stats = {\n        acquired: 0,\n        released: 0,\n        rejected: { frozen: 0, tooLarge: 0, poolFull: 0 },\n      };\n    }\n  }\n}\n","import type { DependencyLink } from '@/core/dep-tracking';\nimport { ArrayPool } from '@/utils/array-pool';\n\nexport const EMPTY_LINKS: DependencyLink[] = Object.freeze(\n  [] as unknown as DependencyLink[]\n) as DependencyLink[];\n\nexport const linksArrayPool = new ArrayPool<DependencyLink>();\n","import { ATOM_BRAND, COMPUTED_BRAND, EFFECT_BRAND } from '@/symbols';\nimport type { ComputedAtom, EffectObject, ReadonlyAtom, WritableAtom } from '@/types';\n\n/**\n * Readonly atom check.\n *\n * @param obj - Object to check.\n */\nexport function isAtom(obj: unknown): obj is ReadonlyAtom {\n  return obj !== null && typeof obj === 'object' && ATOM_BRAND in obj;\n}\n\n/**\n * Writable atom check.\n */\nexport function isWritable(obj: unknown): obj is WritableAtom {\n  return isAtom(obj) && !isComputed(obj);\n}\n\n/**\n * Computed atom check.\n */\nexport function isComputed(obj: unknown): obj is ComputedAtom {\n  return obj !== null && typeof obj === 'object' && COMPUTED_BRAND in obj;\n}\n\n/**\n * Effect object check.\n */\nexport function isEffect(obj: unknown): obj is EffectObject {\n  return obj !== null && typeof obj === 'object' && EFFECT_BRAND in obj;\n}\n\n/**\n * Promise check.\n */\nexport function isPromise<T>(value: unknown): value is Promise<T> {\n  return (\n    value !== null &&\n    typeof value === 'object' &&\n    typeof (value as { then?: unknown }).then === 'function'\n  );\n}\n","import {\n  AsyncState,\n  COMPUTED_CONFIG,\n  COMPUTED_STATE_FLAGS,\n  EMPTY_ERROR_ARRAY,\n  IS_DEV,\n  SMI_MAX,\n} from '@/constants';\nimport { ReactiveDependency } from '@/core/base';\nimport {\n  DependencyLink,\n  type Subscription,\n  syncDependencies,\n  trackDependency,\n} from '@/core/dep-tracking';\nimport { ComputedError } from '@/errors/errors';\nimport { ERROR_MESSAGES } from '@/errors/messages';\nimport { currentFlushEpoch, nextEpoch, nextVersion } from '@/internal/epoch';\nimport { EMPTY_LINKS, linksArrayPool } from '@/internal/pool';\nimport { ATOM_BRAND, COMPUTED_BRAND } from '@/symbols';\nimport { trackingContext } from '@/tracking';\nimport type {\n  AsyncStateType,\n  ComputedAtom,\n  ComputedOptions,\n  Dependency,\n  Subscriber,\n} from '@/types';\nimport { debug, NO_DEFAULT_VALUE } from '@/utils/debug';\nimport { wrapError } from '@/utils/error';\nimport { isPromise } from '@/utils/type-guards';\n\nconst { IDLE, DIRTY, PENDING, RESOLVED, REJECTED, HAS_ERROR, RECOMPUTING, DISPOSED, IS_COMPUTED } =\n  COMPUTED_STATE_FLAGS;\n\nfunction getAsyncState(flags: number): AsyncStateType {\n  if (flags & RESOLVED) return AsyncState.RESOLVED;\n  if (flags & PENDING) return AsyncState.PENDING;\n  if (flags & REJECTED) return AsyncState.REJECTED;\n  return AsyncState.IDLE;\n}\n\n/**\n * Computed atom implementation.\n */\nclass ComputedAtomImpl<T> extends ReactiveDependency<T> implements ComputedAtom<T>, Subscriber {\n  /** @internal */\n  readonly [ATOM_BRAND] = true;\n  /** @internal */\n  readonly [COMPUTED_BRAND] = true;\n\n  private _value: T;\n  private _error: Error | null = null;\n  /** Promise tracking ID */\n  private _promiseId = 0;\n\n  private readonly _equal: (a: T, b: T) => boolean;\n  private readonly _fn: () => T | Promise<T>;\n  private readonly _defaultValue: T;\n  private readonly _onError: ((error: Error) => void) | null;\n  private readonly _maxAsyncRetries: number;\n\n  protected _subscribers: Subscription<T>[] = [];\n  private _links: DependencyLink[] = EMPTY_LINKS;\n\n  // Async state\n  private _asyncStartAggregateVersion = 0;\n  private _asyncRetryCount = 0;\n  private _lastDriftEpoch = -1;\n\n  // Dependency collection state\n  private _trackEpoch = -1;\n  private _trackLinks: DependencyLink[] = EMPTY_LINKS;\n  private _trackCount = 0;\n\n  constructor(fn: () => T | Promise<T>, options: ComputedOptions<T> = {}) {\n    if (typeof fn !== 'function') throw new ComputedError(ERROR_MESSAGES.COMPUTED_MUST_BE_FUNCTION);\n    super();\n\n    this._value = undefined as T;\n    // Start dirty so first access triggers computation\n    this.flags = IS_COMPUTED | DIRTY | IDLE;\n    this._equal = options.equal ?? Object.is;\n    this._fn = fn;\n    this._defaultValue = 'defaultValue' in options ? options.defaultValue : (NO_DEFAULT_VALUE as T);\n    this._onError = options.onError ?? null;\n    const retries = options.maxAsyncRetries;\n    this._maxAsyncRetries = (retries ?? COMPUTED_CONFIG.MAX_ASYNC_RETRIES) & SMI_MAX;\n\n    debug.attachDebugInfo(this, 'computed', this.id);\n\n    // Eager evaluation if not lazy\n    if (options.lazy === false) {\n      try {\n        this._recompute();\n      } catch {\n        /* _handleError already stored error and called onError */\n      }\n    }\n  }\n\n  private _track(): void {\n    const current = trackingContext.current;\n    if (current) trackDependency(this, current, this._subscribers);\n  }\n\n  get value(): T {\n    this._track();\n\n    const flags = this.flags;\n    if ((flags & (RESOLVED | DIRTY | IDLE)) === RESOLVED) {\n      return this._value;\n    }\n\n    if (flags & DISPOSED) {\n      throw new ComputedError(ERROR_MESSAGES.COMPUTED_DISPOSED);\n    }\n\n    if (flags & RECOMPUTING) {\n      if (this._defaultValue !== (NO_DEFAULT_VALUE as T)) return this._defaultValue;\n      throw new ComputedError(ERROR_MESSAGES.COMPUTED_CIRCULAR_DEPENDENCY);\n    }\n\n    if (flags & (DIRTY | IDLE)) {\n      this._recompute();\n      // Re-read flags after update\n      if (this.flags & RESOLVED) return this._value;\n    }\n\n    // 3. Async/Error handling\n    const def = this._defaultValue;\n    const hasDef = def !== (NO_DEFAULT_VALUE as T);\n\n    if (this.flags & PENDING) {\n      if (hasDef) return def;\n      throw new ComputedError(ERROR_MESSAGES.COMPUTED_ASYNC_PENDING_NO_DEFAULT);\n    }\n\n    if (this.flags & REJECTED) {\n      if (hasDef) return def;\n      throw this._error;\n    }\n\n    return this._value;\n  }\n\n  peek(): T {\n    return this._value;\n  }\n\n  get state(): AsyncStateType {\n    this._track();\n    return getAsyncState(this.flags);\n  }\n\n  get hasError(): boolean {\n    this._track();\n    if (this.flags & (REJECTED | HAS_ERROR)) return true;\n\n    // Live scan: deps may have changed error state asynchronously\n    return this._links.some((link) => link?.node?.flags & HAS_ERROR);\n  }\n\n  get isValid(): boolean {\n    return !this.hasError;\n  }\n\n  get errors(): readonly Error[] {\n    this._track();\n    if (!this.hasError) return EMPTY_ERROR_ARRAY;\n\n    // Collect errors directly into array, dedupe via indexOf (avoids Set allocation)\n    const collected: Error[] = [];\n    if (this._error) collected.push(this._error);\n\n    const links = this._links;\n    links.forEach((link) => {\n      const dep = link.node;\n      if (dep.flags & HAS_ERROR) {\n        const computedDep = dep as unknown as ComputedAtom<unknown>;\n        computedDep.errors.forEach((err) => {\n          if (err && !collected.includes(err)) collected.push(err);\n        });\n      }\n    });\n\n    return Object.freeze(collected);\n  }\n\n  get lastError(): Error | null {\n    this._track();\n    return this._error;\n  }\n\n  get isPending(): boolean {\n    this._track();\n    return (this.flags & PENDING) !== 0;\n  }\n\n  get isResolved(): boolean {\n    this._track();\n    return (this.flags & RESOLVED) !== 0;\n  }\n\n  invalidate(): void {\n    this._markDirty();\n  }\n\n  dispose(): void {\n    if (this.flags & DISPOSED) return;\n\n    const links = this._links;\n    if (links !== EMPTY_LINKS) {\n      links.forEach((link) => link!.unsub?.());\n      linksArrayPool.release(links);\n      this._links = EMPTY_LINKS;\n    }\n\n    this._subscribers.length = 0;\n    this.flags = DISPOSED | DIRTY | IDLE;\n\n    // Release Memory\n    this._error = null;\n    this._value = undefined as T;\n  }\n\n  [Symbol.dispose](): void {\n    this.dispose();\n  }\n\n  addDependency(dep: Dependency): void {\n    // Deduplicate dependencies\n    if (dep._lastSeenEpoch === this._trackEpoch) return;\n    dep._lastSeenEpoch = this._trackEpoch;\n\n    // Resize array if needed\n    if (this._trackCount < this._trackLinks.length) {\n      const link = this._trackLinks[this._trackCount]!;\n      link.node = dep;\n      link.version = dep.version;\n    } else {\n      this._trackLinks.push(new DependencyLink(dep, dep.version));\n    }\n    this._trackCount++;\n  }\n\n  private _recompute(): void {\n    if (this.flags & RECOMPUTING) return;\n    this.flags |= RECOMPUTING;\n\n    const prevLinks = this._links;\n    this._trackEpoch = nextEpoch();\n    this._trackLinks = linksArrayPool.acquire();\n    this._trackCount = 0;\n\n    let committed = false;\n    try {\n      // Execute function\n      const result = trackingContext.run(this, this._fn);\n\n      // Inline _commitDeps\n      this._trackLinks.length = this._trackCount;\n      syncDependencies(this._trackLinks, prevLinks, this);\n      this._links = this._trackLinks;\n      committed = true;\n\n      // Handle Result\n      if (isPromise(result)) {\n        this._handleAsyncComputation(result);\n      } else {\n        this._finalizeResolution(result);\n      }\n    } catch (e) {\n      // Commit dependencies on error\n      if (!committed) {\n        try {\n          this._trackLinks.length = this._trackCount;\n          syncDependencies(this._trackLinks, prevLinks, this);\n          this._links = this._trackLinks;\n          committed = true;\n        } catch (commitErr) {\n          if (IS_DEV) {\n            console.warn('[atom-effect] _commitDeps failed during error recovery:', commitErr);\n          }\n        }\n      }\n      this._handleError(e as Error, ERROR_MESSAGES.COMPUTED_COMPUTATION_FAILED, true);\n    } finally {\n      // Release pool\n      if (committed && prevLinks !== EMPTY_LINKS) {\n        linksArrayPool.release(prevLinks);\n      } else if (!committed) {\n        linksArrayPool.release(this._trackLinks);\n      }\n\n      // Reset transient state\n      this._trackEpoch = -1;\n      this._trackLinks = EMPTY_LINKS;\n      this._trackCount = 0;\n      this.flags &= ~RECOMPUTING;\n    }\n  }\n\n  private _handleAsyncComputation(promise: Promise<T>): void {\n    // Set pending, clear idle/dirty/resolved/rejected\n    this.flags = (this.flags | PENDING) & ~(IDLE | DIRTY | RESOLVED | REJECTED);\n    // Notify pending\n    this._notifySubscribers(undefined, undefined);\n\n    this._asyncStartAggregateVersion = this._captureVersionSnapshot();\n    this._asyncRetryCount = 0;\n    // Invalidate old promises\n    this._promiseId = (this._promiseId + 1) % COMPUTED_CONFIG.MAX_PROMISE_ID;\n    const promiseId = this._promiseId;\n\n    promise.then(\n      (res) => {\n        if (promiseId !== this._promiseId) return; // Stale\n\n        if (this._captureVersionSnapshot() !== this._asyncStartAggregateVersion) {\n          // Reset retry counter when flush epoch changes — drifts across different\n          // scheduler flushes are independent bursts, not a continuous failure streak.\n          const epoch = currentFlushEpoch();\n          if (this._lastDriftEpoch !== epoch) {\n            this._lastDriftEpoch = epoch;\n            this._asyncRetryCount = 0;\n          }\n          if (this._asyncRetryCount++ < this._maxAsyncRetries) {\n            return this._markDirty(); // Retry\n          }\n          return this._handleError(\n            new ComputedError(\n              `Async drift threshold exceeded after ${this._maxAsyncRetries} retries.`\n            ),\n            ERROR_MESSAGES.COMPUTED_ASYNC_COMPUTATION_FAILED\n          );\n        }\n\n        this._finalizeResolution(res);\n        this._notifySubscribers(res, undefined);\n      },\n      (err) =>\n        promiseId === this._promiseId &&\n        this._handleError(err, ERROR_MESSAGES.COMPUTED_ASYNC_COMPUTATION_FAILED)\n    );\n  }\n\n  private _captureVersionSnapshot(): number {\n    let hash = 0;\n    const links = this._links;\n    for (let i = 0, len = links.length; i < len; i++) {\n      hash = ((hash << 5) - hash + links[i]!.node.version) | 0;\n    }\n    return hash;\n  }\n\n  private _handleError(err: unknown, msg: string, throwErr = false): void {\n    const error = wrapError(err, ComputedError, msg);\n\n    if (!throwErr && !(this.flags & REJECTED)) {\n      this.version = nextVersion(this.version);\n    }\n\n    this._error = error;\n    // Set rejected + has_error, clear idle/dirty/pending/resolved\n    this.flags = (this.flags & ~(IDLE | DIRTY | PENDING | RESOLVED)) | REJECTED | HAS_ERROR;\n\n    if (this._onError) {\n      try {\n        this._onError(error);\n      } catch (e) {\n        console.error(ERROR_MESSAGES.CALLBACK_ERROR_IN_ERROR_HANDLER, e);\n      }\n    }\n\n    if (throwErr) throw error;\n    this._notifySubscribers(undefined, undefined);\n  }\n\n  private _finalizeResolution(value: T): void {\n    // Only bump version if value actually changed or first resolve\n    if (!(this.flags & RESOLVED) || !this._equal(this._value, value)) {\n      this.version = nextVersion(this.version);\n    }\n\n    this._value = value;\n    this._error = null;\n    // Set resolved, clear idle/dirty/pending/rejected/has_error\n    this.flags = (this.flags | RESOLVED) & ~(IDLE | DIRTY | PENDING | REJECTED | HAS_ERROR);\n  }\n\n  execute(): void {\n    // Subscriber implementation\n    this._markDirty();\n  }\n\n  /** @internal */\n  _markDirty(): void {\n    if (this.flags & (RECOMPUTING | DIRTY)) return;\n    this.flags |= DIRTY;\n    this._notifySubscribers(undefined, undefined);\n  }\n}\n\n/**\n * Creates a computed value.\n * @param fn - Computation function\n * @param options - Options object\n */\nexport function computed<T>(fn: () => T, options?: ComputedOptions<T>): ComputedAtom<T>;\nexport function computed<T>(\n  fn: () => Promise<T>,\n  options: ComputedOptions<T> & { defaultValue: T }\n): ComputedAtom<T>;\nexport function computed<T>(\n  fn: () => T | Promise<T>,\n  options: ComputedOptions<T> = {}\n): ComputedAtom<T> {\n  return new ComputedAtomImpl(fn, options);\n}\n","import {\n  COMPUTED_STATE_FLAGS,\n  DEBUG_CONFIG,\n  EFFECT_STATE_FLAGS,\n  IS_DEV,\n  SCHEDULER_CONFIG,\n} from '@/constants';\nimport { ReactiveNode } from '@/core/base';\nimport { DependencyLink } from '@/core/dep-tracking';\nimport { EffectError } from '@/errors/errors';\nimport { ERROR_MESSAGES } from '@/errors/messages';\nimport {\n  currentFlushEpoch,\n  flushExecutionCount,\n  incrementFlushExecutionCount,\n  nextEpoch,\n} from '@/internal/epoch';\nimport { EMPTY_LINKS, linksArrayPool } from '@/internal/pool';\nimport { scheduler } from '@/internal/scheduler';\nimport { EFFECT_BRAND } from '@/symbols';\nimport { type DependencyTracker, trackingContext } from '@/tracking';\nimport type { Dependency, EffectFunction, EffectObject, EffectOptions } from '@/types';\nimport { debug } from '@/utils/debug';\nimport { wrapError } from '@/utils/error';\nimport { isPromise } from '@/utils/type-guards';\n\n/**\n * Effect implementation.\n */\nclass EffectImpl extends ReactiveNode implements EffectObject, DependencyTracker {\n  /** @internal */\n  readonly [EFFECT_BRAND] = true;\n\n  private _cleanup: (() => void) | null = null;\n  private _links: DependencyLink[] = EMPTY_LINKS;\n  private _nextLinks: DependencyLink[] | null = null;\n  private _prevLinks: DependencyLink[] = EMPTY_LINKS;\n\n  /** Pre-allocated scheduler task (created once in constructor) */\n  private readonly _executeTask: (() => void) | undefined;\n\n  /** Pre-allocated notify callback shared by all subscriptions */\n  private readonly _notifyCallback: () => void;\n\n  private readonly _onError: ((error: unknown) => void) | null;\n\n  // Cycle detection\n  private _currentEpoch = -1;\n  private _lastFlushEpoch = -1;\n  private _executionsInEpoch = 0;\n\n  private readonly _fn: EffectFunction;\n  private readonly _sync: boolean;\n  private readonly _maxExecutions: number;\n  private readonly _maxExecutionsPerFlush: number;\n  // Frequency tracking (Dev)\n  private _executionCount = 0;\n  private _windowStart = 0;\n  private _windowCount = 0;\n  private _execId = 0;\n\n  constructor(fn: EffectFunction, options: EffectOptions = {}) {\n    super();\n    this._fn = fn;\n    this._onError = options.onError ?? null;\n    this._sync = options.sync ?? false;\n    this._maxExecutions =\n      options.maxExecutionsPerSecond ?? SCHEDULER_CONFIG.MAX_EXECUTIONS_PER_SECOND;\n    this._maxExecutionsPerFlush =\n      options.maxExecutionsPerFlush ?? SCHEDULER_CONFIG.MAX_EXECUTIONS_PER_EFFECT;\n    // Pre-allocate callbacks once — eliminates per-dependency closure allocation\n    if (this._sync) {\n      this._executeTask = undefined;\n      this._notifyCallback = () => this.execute();\n    } else {\n      this._executeTask = () => this.execute();\n      this._notifyCallback = () => scheduler.schedule(this._executeTask!);\n    }\n\n    debug.attachDebugInfo(this, 'effect', this.id);\n  }\n\n  public run(): void {\n    if (this.flags & EFFECT_STATE_FLAGS.DISPOSED) {\n      throw new EffectError(ERROR_MESSAGES.EFFECT_DISPOSED);\n    }\n    this.execute(true);\n  }\n\n  public dispose(): void {\n    if (this.flags & EFFECT_STATE_FLAGS.DISPOSED) return;\n    this.flags |= EFFECT_STATE_FLAGS.DISPOSED;\n\n    this._execCleanup();\n    this._unsubLinks(this._links);\n    if (this._links !== EMPTY_LINKS) {\n      linksArrayPool.release(this._links);\n    }\n\n    // Reset State\n    this._links = EMPTY_LINKS;\n    this._prevLinks = EMPTY_LINKS;\n  }\n\n  [Symbol.dispose](): void {\n    this.dispose();\n  }\n\n  public addDependency(dep: Dependency): void {\n    // Only track if currently executing (double check)\n    if (!(this.flags & EFFECT_STATE_FLAGS.EXECUTING)) return;\n\n    const startEpoch = this._currentEpoch;\n\n    // Deduplicate in current epoch\n    if (dep._lastSeenEpoch === startEpoch) return;\n    dep._lastSeenEpoch = startEpoch;\n\n    const nextLinks = this._nextLinks!;\n\n    // Reclaim existing subscription from previous links (linear scan — typically 1-10 deps)\n    const prev = this._prevLinks;\n    const existingIndex = prev.findIndex((link) => link && link.node === dep && link.unsub);\n\n    if (existingIndex !== -1) {\n      const link = prev[existingIndex]!;\n      // Reuse DependencyLink object — update version, move to nextLinks\n      link.version = dep.version;\n      nextLinks.push(link);\n      prev[existingIndex] = null!; // Mark as reclaimed (avoid double-reclaim)\n      return;\n    }\n\n    try {\n      const unsubscribe = dep.subscribe(this._notifyCallback);\n      nextLinks.push(new DependencyLink(dep, dep.version, unsubscribe));\n    } catch (error) {\n      const wrapped = wrapError(error, EffectError, ERROR_MESSAGES.EFFECT_EXECUTION_FAILED);\n      console.error(wrapped);\n      if (this._onError) {\n        try {\n          this._onError(wrapped);\n        } catch {}\n      }\n      // Add noop link so next execution can attempt re-subscription\n      nextLinks.push(new DependencyLink(dep, dep.version, undefined));\n    }\n  }\n\n  /**\n   * Executes effect with tracking.\n   */\n  public execute(force = false): void {\n    if (this.flags & (EFFECT_STATE_FLAGS.DISPOSED | EFFECT_STATE_FLAGS.EXECUTING)) return;\n\n    // Skip if not dirty\n    if (!force && this._links.length > 0 && !this._isDirty()) return;\n\n    this._checkInfiniteLoops();\n\n    this.flags |= EFFECT_STATE_FLAGS.EXECUTING;\n    this._execCleanup();\n\n    // Store prevLinks on instance for addDependency's linear reclaim scan\n    this._prevLinks = this._links;\n\n    // Setup tracking\n    const nextLinks = linksArrayPool.acquire();\n    this._nextLinks = nextLinks;\n    this._currentEpoch = nextEpoch();\n\n    let committed = false;\n    try {\n      const result = trackingContext.run(this, this._fn);\n      this._links = nextLinks;\n      committed = true;\n\n      // Handle result\n      if (isPromise(result)) {\n        this._handleAsyncResult(result);\n      } else {\n        this._cleanup = typeof result === 'function' ? result : null;\n      }\n    } catch (error) {\n      // Commit on error — assign links before marking committed\n      // so _finalizeDependencies can clean up prevLinks correctly\n      this._links = nextLinks;\n      committed = true;\n      this._handleExecutionError(error);\n      this._cleanup = null;\n    } finally {\n      this._finalizeDependencies(committed, this._prevLinks, nextLinks);\n      this.flags &= ~EFFECT_STATE_FLAGS.EXECUTING;\n    }\n  }\n\n  private _handleAsyncResult(promise: Promise<unknown>): void {\n    const execId = ++this._execId;\n    promise.then(\n      (cleanup) => {\n        // Guard against race conditions (new execution or disposal happened)\n        if (execId !== this._execId || this.flags & EFFECT_STATE_FLAGS.DISPOSED) {\n          if (typeof cleanup === 'function') {\n            try {\n              cleanup();\n            } catch (e) {\n              this._handleExecutionError(e, ERROR_MESSAGES.EFFECT_CLEANUP_FAILED);\n            }\n          }\n          return;\n        }\n        if (typeof cleanup === 'function') this._cleanup = cleanup as () => void;\n      },\n      (err) => execId === this._execId && this._handleExecutionError(err)\n    );\n  }\n\n  private _finalizeDependencies(\n    committed: boolean,\n    prevLinks: DependencyLink[],\n    nextLinks: DependencyLink[]\n  ): void {\n    this._nextLinks = null;\n    this._prevLinks = EMPTY_LINKS;\n\n    if (committed) {\n      // Cleanup unclaimed prev subscriptions (entries not nulled out by addDependency)\n      prevLinks.forEach((link) => link?.unsub?.());\n\n      if (prevLinks !== EMPTY_LINKS) {\n        linksArrayPool.release(prevLinks);\n      }\n    } else {\n      // Abort and restore\n      this._unsubLinks(nextLinks);\n      linksArrayPool.release(nextLinks);\n    }\n  }\n\n  private _unsubLinks(links: DependencyLink[]): void {\n    links.forEach((link) => link?.unsub?.());\n  }\n\n  private _isDirty(): boolean {\n    const links = this._links;\n    // Save tracking context once, restore at end (avoids per-iteration function allocation)\n    const prevContext = trackingContext.current;\n    trackingContext.current = null;\n\n    try {\n      return links.some((link) => {\n        const dep = link.node;\n\n        // Trigger recomputation for computed dependencies\n        if (dep.flags & COMPUTED_STATE_FLAGS.IS_COMPUTED) {\n          try {\n            // Force computed to re-evaluate so version reflects latest state\n            void (dep as { value: unknown }).value;\n          } catch {\n            if (IS_DEV) {\n              console.warn(`[atom-effect] Dependency #${dep.id} threw during dirty check`);\n            }\n            return true; // Error usually implies dirty/re-eval needed\n          }\n        }\n\n        // Version Check\n        return dep.version !== link.version;\n      });\n    } finally {\n      trackingContext.current = prevContext;\n    }\n  }\n\n  private _execCleanup(): void {\n    if (!this._cleanup) return;\n    try {\n      this._cleanup();\n    } catch (error) {\n      this._handleExecutionError(error, ERROR_MESSAGES.EFFECT_CLEANUP_FAILED);\n    }\n    this._cleanup = null;\n  }\n\n  private _checkInfiniteLoops(): void {\n    const epoch = currentFlushEpoch();\n    if (this._lastFlushEpoch !== epoch) {\n      this._lastFlushEpoch = epoch;\n      this._executionsInEpoch = 0;\n    }\n\n    if (++this._executionsInEpoch > this._maxExecutionsPerFlush)\n      this._throwInfiniteLoopError('per-effect');\n    if (incrementFlushExecutionCount() > SCHEDULER_CONFIG.MAX_EXECUTIONS_PER_FLUSH)\n      this._throwInfiniteLoopError('global');\n\n    this._executionCount++;\n\n    // Frequency check (dev only)\n    if (IS_DEV && Number.isFinite(this._maxExecutions)) {\n      const now = Date.now();\n      if (now - this._windowStart >= DEBUG_CONFIG.EFFECT_FREQUENCY_WINDOW) {\n        this._windowStart = now;\n        this._windowCount = 1;\n      } else if (++this._windowCount > this._maxExecutions) {\n        const err = new EffectError(ERROR_MESSAGES.EFFECT_FREQUENCY_LIMIT_EXCEEDED);\n        this.dispose();\n        this._handleExecutionError(err);\n        throw err;\n      }\n    }\n  }\n\n  get isDisposed(): boolean {\n    return (this.flags & EFFECT_STATE_FLAGS.DISPOSED) !== 0;\n  }\n  get executionCount(): number {\n    return this._executionCount;\n  }\n  get isExecuting(): boolean {\n    return (this.flags & EFFECT_STATE_FLAGS.EXECUTING) !== 0;\n  }\n\n  private _throwInfiniteLoopError(type: 'per-effect' | 'global'): never {\n    const error = new EffectError(\n      `Infinite loop detected (${type}): effect executed ${this._executionsInEpoch} times in current flush. Total executions in flush: ${flushExecutionCount}`\n    );\n    this.dispose();\n    console.error(error);\n    throw error;\n  }\n\n  private _handleExecutionError(\n    error: unknown,\n    message: string = ERROR_MESSAGES.EFFECT_EXECUTION_FAILED\n  ): void {\n    const errorObj = wrapError(error, EffectError, message);\n    console.error(errorObj);\n    if (this._onError) {\n      try {\n        this._onError(errorObj);\n      } catch (e) {\n        console.error(wrapError(e, EffectError, ERROR_MESSAGES.CALLBACK_ERROR_IN_ERROR_HANDLER));\n      }\n    }\n  }\n}\n\n/**\n * Creates and starts an effect.\n *\n * @param fn - Effect function.\n * @param options - Configuration options.\n * @returns Effect instance.\n */\nexport function effect(fn: EffectFunction, options: EffectOptions = {}): EffectObject {\n  if (typeof fn !== 'function') {\n    throw new EffectError(ERROR_MESSAGES.EFFECT_MUST_BE_FUNCTION);\n  }\n\n  const effectInstance = new EffectImpl(fn, options);\n  effectInstance.execute();\n\n  return effectInstance;\n}\n","import { scheduler } from './scheduler';\n\n/**\n * Batches updates.\n *\n * @param fn - Batch function.\n * @returns - Result of `fn`.\n */\nexport function batch<T>(fn: () => T): T {\n  // Validate callback\n  if (typeof fn !== 'function') {\n    throw new TypeError('Batch callback must be a function');\n  }\n\n  scheduler.startBatch();\n  try {\n    return fn();\n  } finally {\n    scheduler.endBatch();\n  }\n}\n"],"names":["AsyncState","EFFECT_STATE_FLAGS","COMPUTED_STATE_FLAGS","ATOM_STATE_FLAGS","POOL_CONFIG","SCHEDULER_CONFIG","DEBUG_CONFIG","COMPUTED_CONFIG","SMI_MAX","IS_DEV","EMPTY_ERROR_ARRAY","AtomError","message","cause","recoverable","ComputedError","EffectError","SchedulerError","DEBUG_NAME","DEBUG_TYPE","NO_DEFAULT_VALUE","debug","cond","msg","dep","current","obj","type","id","nextId","generateId","trackDependency","dependency","subscribers","fn","link","Subscription","sub","syncDependencies","nextLinks","prevLinks","tracker","parked","node","existing","unsub","DependencyLink","version","ERROR_MESSAGES","max","dropped","wrapError","error","ErrorClass","context","isNativeError","originalMessage","finalMessage","ReactiveNode","ReactiveDependency","listener","isFn","subs","idx","last","newValue","oldValue","s","err","collectorEpoch","nextEpoch","nextVersion","v","flushExecutionCount","isFlushing","_flushEpoch","currentFlushEpoch","startFlush","endFlush","incrementFlushExecutionCount","Scheduler","callback","started","epoch","bQueue","targetBuffer","currentSize","job","iterations","jobs","count","i","e","droppedCount","scheduler","ATOM_BRAND","COMPUTED_BRAND","EFFECT_BRAND","trackingContext","prev","untracked","_a","AtomImpl","initialValue","sync","flags","atom","options","ArrayPool","limit","capacity","enableStats","arr","emptyConst","acquired","released","rejected","leakCount","EMPTY_LINKS","linksArrayPool","isAtom","isComputed","isEffect","isPromise","value","_b","IDLE","DIRTY","PENDING","RESOLVED","REJECTED","HAS_ERROR","RECOMPUTING","DISPOSED","IS_COMPUTED","getAsyncState","ComputedAtomImpl","retries","def","hasDef","collected","links","committed","result","promise","promiseId","res","hash","len","throwErr","computed","EffectImpl","startEpoch","existingIndex","unsubscribe","wrapped","force","execId","cleanup","prevContext","errorObj","effect","effectInstance","batch"],"mappings":"AAGO,MAAMA,IAAa;AAAA,EACxB,MAAM;AAAA,EACN,SAAS;AAAA,EACT,UAAU;AAAA,EACV,UAAU;AACZ,GAKaC,IAAqB;AAAA,EAChC,UAAU;AAAA,EACV,WAAW;AACb,GAKaC,IAAuB;AAAA,EAClC,UAAU;AAAA;AAAA,EAEV,aAAa;AAAA,EACb,OAAO;AAAA,EACP,MAAM;AAAA,EACN,SAAS;AAAA,EACT,UAAU;AAAA,EACV,UAAU;AAAA,EACV,aAAa;AAAA,EACb,WAAW;AACb,GAKaC,IAAmB;AAAA,EAC9B,UAAU;AAAA,EACV,MAAM;AAAA,EACN,wBAAwB;AAC1B,GAKaC,KAAc;AAAA,EACzB,UAAU;AAAA,EACV,aAAa;AAAA,EACb,cAAc;AAChB,GAKaC,IAAmB;AAAA;AAAA,EAE9B,2BAA2B;AAAA,EAC3B,2BAA2B;AAAA;AAAA,EAG3B,0BAA0B;AAAA,EAC1B,sBAAsB;AAAA,EACtB,sBAAsB;AAAA;AAAA,EAGtB,8BAA8B;AAChC,GAKaC,KAAe;AAAA,EAC1B,oBAAoB;AAAA,EACpB,yBAAyB;AAC3B,GAKaC,IAAkB;AAAA,EAC7B,mBAAmB;AAAA,EACnB,gBAAgB,OAAO,mBAAmB;AAC5C,GAKaC,IAAU,YAKVC,IACV,OAAO,UAAY,OAAe,QAAQ,OAAO,MACf,IAKxBC,KAAsC,OAAO,OAAO,EAAE;ACjG5D,MAAMC,UAAkB,MAAM;AAAA,EACnC,YACEC,GACOC,IAAsB,MACtBC,IAAc,IACrB;AACA,UAAMF,CAAO,GAHN,KAAA,QAAAC,GACA,KAAA,cAAAC,GAGP,KAAK,OAAO;AAAA,EACd;AACF;AAGO,MAAMC,UAAsBJ,EAAU;AAAA,EAC3C,YAAYC,GAAiBC,IAAsB,MAAM;AACvD,UAAMD,GAASC,GAAO,EAAI,GAC1B,KAAK,OAAO;AAAA,EACd;AACF;AAGO,MAAMG,UAAoBL,EAAU;AAAA,EACzC,YAAYC,GAAiBC,IAAsB,MAAM;AACvD,UAAMD,GAASC,GAAO,EAAK,GAC3B,KAAK,OAAO;AAAA,EACd;AACF;AAGO,MAAMI,UAAuBN,EAAU;AAAA,EAC5C,YAAYC,GAAiBC,IAAsB,MAAM;AACvD,UAAMD,GAASC,GAAO,EAAK,GAC3B,KAAK,OAAO;AAAA,EACd;AACF;AC/BO,MAAMK,4BAAoB,sBAAsB,GAE1CC,4BAAoB,iBAAiB,GACrCC,2BAA0B,2BAA2B,GAoCrDC,IAAqB;AAAA;AAAA,EAEhC,SAASZ;AAAA,EAET,kBAAkBH,GAAa;AAAA,EAE/B,KAAKgB,GAAMC,GAAK;AAAA,EAIhB;AAAA,EAEA,cAAcC,GAAKC,GAAS;AAC1B,QAAID,MAAQC;AACV,YAAM,IAAIV,EAAc,qCAAqC;AAAA,EAMjE;AAAA,EAEA,gBAAgBW,GAAKC,GAAMC,GAAI;AAAA,EAO/B;AAAA,EAEA,cAAc,CAACF,MACZA,IAAyCR,EAAU;AAAA,EAEtD,cAAc,CAACQ,MACZA,IAAyCP,EAAU;AACxD;AAKA,IAAIU,KAAS;AAKN,MAAMC,KAAa,MAAoBD;ACpFvC,SAASE,EACdC,GACAP,GACAQ,GACM;AACN,MAAI,OAAOR,KAAY,YAAY;AACjC,UAAMS,IAAKT;AAKX,QAAIQ,EAAY,KAAK,CAACE,MAASA,KAAQA,EAAK,OAAOD,CAAE,EAAG;AACxD,IAAAD,EAAY,KAAK,IAAIG,EAAaF,GAAI,MAAS,CAAC;AAChD;AAAA,EACF;AAEA,MAAI,mBAAoBT,GAAoB;AACzC,IAAAA,EAAiC,cAAcO,CAAU;AAC1D;AAAA,EACF;AAEA,QAAMK,IAAMZ;AACZ,EAAIQ,EAAY,KAAK,CAACE,MAASA,KAAQA,EAAK,QAAQE,CAAG,KACvDJ,EAAY,KAAK,IAAIG,EAAa,QAAWC,CAAG,CAAC;AACnD;AAOO,SAASC,EACdC,GACAC,GACAC,GACM;AAEN,QAAMC,wBAAa,IAAA;AACnB,EAAAF,EAAU,QAAQ,CAACL,MAAS;AAC1B,IAAIA,GAAM,SACRO,EAAO,IAAIP,EAAK,MAAMA,EAAK,KAAK;AAAA,EAEpC,CAAC,GAGDI,EAAU,QAAQ,CAACJ,MAAS;AAC1B,QAAI,CAACA,EAAM;AAEX,UAAMQ,IAAOR,EAAK,MACZS,IAAWF,EAAO,IAAIC,CAAI;AAChC,IAAIC,MAAa,UAEfT,EAAK,QAAQS,GACbF,EAAO,OAAOC,CAAI,MAGlBtB,EAAM,cAAcsB,GAAMF,CAAO,GACjCN,EAAK,QAAQQ,EAAK,UAAUF,CAAO;AAAA,EAEvC,CAAC,GAGDC,EAAO,QAAQ,CAACG,MAAUA,EAAA,CAAO;AACnC;AAKO,MAAMC,EAAe;AAAA,EAG1B,YACSH,GACAI,GACPF,IAAkC,QAClC;AAHO,SAAA,OAAAF,GACA,KAAA,UAAAI,GAIP,KAAK,QAAQF;AAAA,EACf;AACF;AAKO,MAAMT,EAAgB;AAAA,EAI3B,YAAYF,GAAwDG,GAA6B;AAE/F,SAAK,KAAKH,GACV,KAAK,MAAMG;AAAA,EACb;AACF;AChGO,MAAMW,IAAiB;AAAA;AAAA,EAE5B,2BAA2B;AAAA,EAC3B,mCAAmC;AAAA,EACnC,6BAA6B;AAAA,EAC7B,mCAAmC;AAAA,EACnC,8BAA8B;AAAA,EAC9B,mBAAmB;AAAA;AAAA,EAGnB,kCAAkC;AAAA,EAClC,mCAAmC;AAAA;AAAA,EAGnC,yBAAyB;AAAA,EACzB,yBAAyB;AAAA,EACzB,uBAAuB;AAAA,EACvB,iBAAiB;AAAA;AAAA,EAGjB,0BAA0B,CAACC,GAAaC,MACtC,6BAA6BD,CAAG,eAAeC,CAAO;AAAA;AAAA,EAGxD,iCAAiC;AAAA;AAAA,EAGjC,iCACE;AAAA,EAEF,qCAAqC;AAAA,EACrC,mCAAmC;AACrC;AC1BO,SAASC,EACdC,GACAC,GACAC,GACW;AAEX,MAAIF,aAAiBzC;AACnB,WAAOyC;AAGT,QAAMG,IAAgBH,aAAiB,OACjCI,IAAkBD,IAAgBH,EAAM,UAAU,OAAOA,CAAK,GAC9DvC,IAAQ0C,IAAgBH,IAAQ,QAGhCK,IAAe,GADRF,IAAgBH,EAAM,YAAY,OAAO,kBAC1B,KAAKE,CAAO,MAAME,CAAe;AAE7D,SAAO,IAAIH,EAAWI,GAAc5C,CAAK;AAC3C;AChBO,MAAM6C,EAAa;AAAA,EAAnB,cAAA;AAEL,SAAA,QAAQ,GAER,KAAA,UAAU,GAEV,KAAA,iBAAiB,IAEjB,KAAS,KAAmB5B,OAAetB;AAAA,EAAA;AAC7C;AAKO,MAAemD,UAA8BD,EAAa;AAAA;AAAA;AAAA;AAAA,EAM/D,UAAUE,GAA2E;AACnF,UAAMC,IAAO,OAAOD,KAAa;AAEjC,QAAI,CAACC,MAAS,CAACD,KAAY,OAAQA,EAAwB,WAAY;AACrE,YAAMT;AAAA,QACJ,IAAI,UAAU,oBAAoB;AAAA,QAClCxC;AAAA,QACAqC,EAAe;AAAA,MAAA;AAInB,QACE,KAAK,aAAa,KAAK,CAACX,MACjBA,IACEwB,IAAOxB,EAAI,OAAOuB,IAAWvB,EAAI,QAAQuB,IAD/B,EAElB;AAGD,aAAO,MAAM;AAAA,MAAC;AAGhB,UAAMzB,IAAO,IAAIC;AAAA,MACfyB,IAAQD,IAAoD;AAAA,MAC3DC,IAAkC,SAA1BD;AAAA,IAA0B;AAIrC,WADa,KAAK,aACb,KAAKzB,CAAI,GAEP,MAAM,KAAK,aAAaA,CAAI;AAAA,EACrC;AAAA,EAEQ,aAAaA,GAA6B;AAChD,UAAM2B,IAAO,KAAK,cACZC,IAAMD,EAAK,QAAQ3B,CAAI;AAC7B,QAAI4B,MAAQ,GAAI;AAGhB,UAAMC,IAAOF,EAAK,IAAA;AAClB,IAAIC,IAAMD,EAAK,UAAUE,MACvBF,EAAKC,CAAG,IAAIC;AAAA,EAEhB;AAAA,EAEA,kBAA0B;AACxB,WAAO,KAAK,aAAa;AAAA,EAC3B;AAAA,EAEU,mBAAmBC,GAAyBC,GAA+B;AACnF,QAAI,KAAK,aAAa,WAAW,EAAG;AAGpC,IADa,KAAK,aAAa,MAAM,CAAC,EACjC,QAAQ,CAACC,MAAM;AAClB,UAAKA;AACL,YAAI;AACF,UAAIA,EAAE,KAAIA,EAAE,GAAGF,GAAUC,CAAQ,IACxBC,EAAE,OAAKA,EAAE,IAAI,QAAA;AAAA,QACxB,SAASC,GAAK;AACZ,eAAK,mBAAmBA,CAAG;AAAA,QAC7B;AAAA,IACF,CAAC;AAAA,EACH;AAAA,EAEQ,mBAAmBA,GAAoB;AAC7C,YAAQ,MAAMjB,EAAUiB,GAAKzD,GAAWqC,EAAe,iCAAiC,CAAC;AAAA,EAC3F;AACF;AC9FA,IAAIqB,IAAiB;AAKd,MAAMC,IAAY,OACvBD,IAAkBA,IAAiB,IAAK7D,KAAW,GAC5C6D,IAOIE,IAAc,CAACC,MAAeA,IAAI,IAAKhE;AAE7C,IAAIiE,IAAsB,GAC7BC,IAAa,IACbC,KAAc;AAGX,MAAMC,KAAoB,MAAMD;AAKhC,SAASE,IAAsB;AACpC,SAAIH,IAEK,MAGTA,IAAa,IACbC,KAAcL,EAAA,GACdG,IAAsB,GACf;AACT;AAGO,MAAMK,IAAW,MAAM;AAC5B,EAAAJ,IAAa;AACf,GAKaK,KAA+B,MAAOL,IAAa,EAAED,IAAsB;AC7BxF,MAAMO,GAAU;AAAA,EAAhB,cAAA;AAEE,SAAA,eAAiD,CAAC,CAAA,GAAI,EAAE,GACxD,KAAA,eAAe,GACf,KAAA,QAAQ,GAGR,KAAA,SAAS,GAGT,KAAA,gBAAgB,IAChB,KAAA,cAAc,IACd,KAAA,kBAAkB,IAGlB,KAAA,cAAc,GACd,KAAA,cAA8B,CAAA,GAC9B,KAAA,kBAAkB,GAGlB,KAAA,sBAA8B3E,EAAiB,sBAG/C,KAAA,aAAsD,MAGtD,KAAiB,gBAAgB,KAAK,SAAS,KAAK,IAAI;AAAA,EAAA;AAAA,EAExD,IAAI,QAAwB;AAC1B,WAAI,KAAK,iBAAiB,KAAK,kBAAwB,IACnD,KAAK,cAAoB,IACtB;AAAA,EACT;AAAA,EAEA,IAAI,YAAoB;AACtB,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,IAAI,aAAsB;AACxB,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA,EAKA,SAAS4E,GAA8B;AAMrC,QAAIA,EAAS,eAAe,KAAK,QAGjC;AAAA,UAFAA,EAAS,aAAa,KAAK,QAEvB,KAAK,eAAe,KAAK,iBAAiB;AAC5C,aAAK,YAAY,KAAK,iBAAiB,IAAIA;AAC3C;AAAA,MACF;AAGA,WAAK,aAAa,KAAK,YAAY,EAAG,KAAK,OAAO,IAAIA,GAGjD,KAAK,iBACR,KAAK,OAAA;AAAA;AAAA,EAET;AAAA;AAAA;AAAA;AAAA,EAKA,SAAe;AACb,IAAI,KAAK,iBAAiB,KAAK,UAAU,MACzC,KAAK,gBAAgB,IAErB,eAAe,KAAK,aAAa;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA,EAKQ,WAAiB;AACvB,QAAI;AACF,UAAI,KAAK,UAAU,EAAG;AAEtB,YAAMC,IAAUL,EAAA;AAChB,WAAK,YAAA,GACDK,KAASJ,EAAA;AAAA,IACf,UAAA;AACE,WAAK,gBAAgB,IAEjB,KAAK,QAAQ,KAAK,CAAC,KAAK,eAC1B,KAAK,OAAA;AAAA,IAET;AAAA,EACF;AAAA,EAEA,aAAmB;AACjB,SAAK,kBAAkB;AACvB,UAAMI,IAAUL,EAAA;AAChB,QAAI;AACF,WAAK,iBAAA,GACL,KAAK,YAAA;AAAA,IACP,UAAA;AACE,WAAK,kBAAkB,IACnBK,KAASJ,EAAA;AAAA,IACf;AAAA,EACF;AAAA,EAEA,mBAAyB;AACvB,QAAI,KAAK,oBAAoB,EAAG;AAGhC,UAAMK,IAAQ,EAAE,KAAK,QACfC,IAAS,KAAK,aACdC,IAAe,KAAK,aAAa,KAAK,YAAY;AACxD,QAAIC,IAAc,KAAK;AAGvB,IAAAF,EAAO,MAAM,GAAG,KAAK,eAAe,EAAE,QAAQ,CAACG,MAAQ;AAErD,MAAIA,EAAI,eAAeJ,MACrBI,EAAI,aAAaJ,GACjBE,EAAaC,GAAa,IAAIC;AAAA,IAElC,CAAC,GAED,KAAK,QAAQD,GACb,KAAK,kBAAkB,GAGnBF,EAAO,SAAS/E,EAAiB,iCACnC+E,EAAO,SAAS;AAAA,EAEpB;AAAA,EAEA,cAAoB;AAClB,QAAII,IAAa;AAEjB,WAAO,KAAK,QAAQ,KAAG;AAErB,UAAI,EAAEA,IAAa,KAAK,qBAAqB;AAC3C,aAAK,qBAAA;AACL;AAAA,MACF;AAEA,WAAK,cAAA,GAEL,KAAK,iBAAA;AAAA,IACP;AAAA,EACF;AAAA,EAEA,gBAAsB;AACpB,UAAMzB,IAAM,KAAK,cACX0B,IAAO,KAAK,aAAa1B,CAAG,GAC5B2B,IAAQ,KAAK;AAGnB,SAAK,eAAe3B,IAAM,GAC1B,KAAK,QAAQ,GACb,KAAK;AAGL,aAAS4B,IAAI,GAAGA,IAAID,GAAOC;AACzB,UAAI;AACF,QAAAF,EAAKE,CAAC,EAAA;AAAA,MACR,SAASC,GAAG;AACV,gBAAQ,MAAM,IAAI3E,EAAe,6CAA6C2E,CAAU,CAAC;AAAA,MAC3F;AAGF,IAAAH,EAAK,SAAS;AAAA,EAChB;AAAA,EAEQ,uBAA6B;AACnC,UAAMI,IAAe,KAAK,QAAQ,KAAK;AAUvC,QATA,QAAQ;AAAA,MACN,IAAI5E;AAAA,QACF+B,EAAe,yBAAyB,KAAK,qBAAqB6C,CAAY;AAAA,MAAA;AAAA,IAChF,GAEF,KAAK,QAAQ,GACb,KAAK,aAAa,KAAK,YAAY,EAAG,SAAS,GAC/C,KAAK,kBAAkB,GAEnB,KAAK;AACP,UAAI;AACF,aAAK,WAAWA,CAAY;AAAA,MAC9B,QAAQ;AAAA,MAAC;AAAA,EAEb;AAAA,EAEA,aAAmB;AACjB,SAAK,eACL,KAAK,cAAc;AAAA,EACrB;AAAA,EAEA,WAAiB;AACf,IAAI,KAAK,gBAAgB,KAKrB,EAAE,KAAK,gBAAgB,MACzB,KAAK,WAAA,GACL,KAAK,cAAc;AAAA,EAEvB;AAAA,EAEA,sBAAsB5C,GAAmB;AACvC,QAAIA,IAAM5C,EAAiB;AACzB,YAAM,IAAIY;AAAA,QACR,yCAAyCZ,EAAiB,oBAAoB;AAAA,MAAA;AAElF,SAAK,sBAAsB4C;AAAA,EAC7B;AACF;AAEO,MAAM6C,IAAY,IAAId,GAAA,GC1OhBe,IAA4B,uBAAO,IAAI,kBAAkB,GACzDC,KAAgC,uBAAO,IAAI,sBAAsB,GACjEC,KAA8B,uBAAO,IAAI,oBAAoB,GCD7DC,IAAkB;AAAA;AAAA,EAE7B,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAST,IAAOtC,GAAoB1B,GAAgB;AACzC,UAAMiE,IAAO,KAAK;AAClB,SAAK,UAAUvC;AACf,QAAI;AACF,aAAO1B,EAAA;AAAA,IACT,UAAA;AACE,WAAK,UAAUiE;AAAA,IACjB;AAAA,EACF;AACF;ACjBO,SAASC,GAAalE,GAAgB;AAC3C,QAAMiE,IAAOD,EAAgB;AAG7B,MAAIC,MAAS,KAAM,QAAOjE,EAAA;AAE1B,EAAAgE,EAAgB,UAAU;AAC1B,MAAI;AACF,WAAOhE,EAAA;AAAA,EACT,UAAA;AACE,IAAAgE,EAAgB,UAAUC;AAAA,EAC5B;AACF;ACpBA,IAAAE;AAaA,MAAMC,WAAoB3C,EAAiD;AAAA,EAWzE,YAAY4C,GAAiBC,GAAe;AAC1C,UAAA,GATF,KAAQ,mBAAkC,QAE1C,KAAiB,cAAc,MAAM,KAAK,oBAAA,GAC1C,KAAU,eAAkC,CAAA,GAG5C,KAAUH,CAAA,IAAc,IAItB,KAAK,SAASE,GACVC,MAAM,KAAK,SAASrG,EAAiB,OACzCkB,EAAM,gBAAgB,MAAM,QAAQ,KAAK,EAAE;AAAA,EAC7C;AAAA,EAEA,IAAI,QAAW;AACb,UAAMI,IAAUyE,EAAgB;AAChC,WAAIzE,KACFM,EAAgB,MAAMN,GAAS,KAAK,YAAY,GAE3C,KAAK;AAAA,EACd;AAAA,EAEA,IAAI,MAAMwC,GAAa;AACrB,UAAMC,IAAW,KAAK;AACtB,QAAI,OAAO,GAAGA,GAAUD,CAAQ,EAAG;AAEnC,SAAK,SAASA,GACd,KAAK,UAAUM,EAAY,KAAK,OAAO;AAEvC,UAAMkC,IAAQ,KAAK;AACnB,QAAI,OAAK,aAAa,WAAW,KAAKA,IAAQtG,EAAiB,yBAQ/D;AAAA,UAJA,KAAK,mBAAmB+D,GACxB,KAAK,QAAQuC,IAAQtG,EAAiB,wBAGlCsG,IAAQtG,EAAiB,QAAQ,CAAC2F,EAAU,YAAY;AAC1D,aAAK,oBAAA;AACL;AAAA,MACF;AAGA,MAAAA,EAAU,SAAS,KAAK,WAAW;AAAA;AAAA,EACrC;AAAA;AAAA;AAAA;AAAA,EAKQ,sBAA4B;AAClC,UAAMW,IAAQ,KAAK;AAEnB,QAAI,EAAEA,IAAQtG,EAAiB,2BAA2BsG,IAAQtG,EAAiB;AACjF;AAGF,UAAM+D,IAAW,KAAK;AACtB,SAAK,mBAAmB,QACxB,KAAK,SAAS,KAEd,KAAK,mBAAmB,KAAK,QAAQA,CAAQ;AAAA,EAC/C;AAAA,EAEA,OAAU;AACR,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,UAAgB;AACd,IAAI,KAAK,QAAQ/D,EAAiB,aAElC,KAAK,aAAa,SAAS,GAC3B,KAAK,SAASA,EAAiB,UAE/B,KAAK,SAAS,QACd,KAAK,mBAAmB;AAAA,EAC1B;AAAA,EAEA,EAzEUkG,IAAAN,GAyET,OAAO,QAAA,IAAiB;AACvB,SAAK,QAAA;AAAA,EACP;AACF;AAQO,SAASW,GAAQH,GAAiBI,IAAuB,IAAqB;AACnF,SAAO,IAAIL,GAASC,GAAcI,EAAQ,QAAQ,EAAK;AACzD;ACpGO,MAAMC,GAAa;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAexB,YACmBC,IAAQ,IACRC,IAAW,KAC5BC,IAAc,IACd;AAHiB,SAAA,QAAAF,GACA,KAAA,WAAAC,GAhBnB,KAAiB,OAAc,CAAA,GAG/B,KAAQ,QAIG,MAYT,KAAK,QACOC,IACN;AAAA,MACE,UAAU;AAAA,MACV,UAAU;AAAA,MACV,UAAU,EAAE,QAAQ,GAAG,UAAU,GAAG,UAAU,EAAA;AAAA,IAAE,IAElD;AAAA,EACR;AAAA;AAAA;AAAA;AAAA,EAKA,UAAe;AACb,WAAI,KAAK,SACP,KAAK,MAAM,YAGN,KAAK,KAAK,IAAA,KAAS,CAAA;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,QAAQC,GAAUC,GAAiC;AACjD,QAAI,EAAAA,KAAcD,MAAQC,IAE1B;AAAA,UAAID,EAAI,SAAS,KAAK,UAAU;AAC9B,QAAI,KAAK,SAAO,KAAK,MAAM,SAAS;AACpC;AAAA,MACF;AAEA,UAAI,KAAK,KAAK,UAAU,KAAK,OAAO;AAClC,QAAI,KAAK,SAAO,KAAK,MAAM,SAAS;AACpC;AAAA,MACF;AAEA,UAAI,OAAO,SAASA,CAAG,GAAG;AACxB,QAAI,KAAK,SAAO,KAAK,MAAM,SAAS;AACpC;AAAA,MACF;AAEA,MAAAA,EAAI,SAAS,GACb,KAAK,KAAK,KAAKA,CAAG,GAEd,KAAK,SACP,KAAK,MAAM;AAAA;AAAA,EAEf;AAAA;AAAA;AAAA;AAAA,EAKA,WAA6B;AAC3B,QAAI,CAAC,KAAK,MAAO,QAAO;AAExB,UAAM,EAAE,UAAAE,GAAU,UAAAC,GAAU,UAAAC,EAAA,IAAa,KAAK,OACxCC,IACJH,IAAWC,KAAYC,EAAS,SAASA,EAAS,WAAWA,EAAS;AAExE,WAAO;AAAA,MACL,UAAAF;AAAA,MACA,UAAAC;AAAA,MACA,UAAU,EAAE,GAAGC,EAAA;AAAA,MACf,QAAQC;AAAA,MACR,UAAU,KAAK,KAAK;AAAA,IAAA;AAAA,EAExB;AAAA;AAAA;AAAA;AAAA,EAKA,QAAc;AACZ,SAAK,KAAK,SAAS,GACf,KAAK,UACP,KAAK,QAAQ;AAAA,MACX,UAAU;AAAA,MACV,UAAU;AAAA,MACV,UAAU,EAAE,QAAQ,GAAG,UAAU,GAAG,UAAU,EAAA;AAAA,IAAE;AAAA,EAGtD;AACF;AC9GO,MAAMC,IAAgC,OAAO;AAAA,EAClD,CAAA;AACF,GAEaC,IAAiB,IAAIX,GAAA;ACC3B,SAASY,GAAO9F,GAAmC;AACxD,SAAOA,MAAQ,QAAQ,OAAOA,KAAQ,YAAYqE,KAAcrE;AAClE;AAYO,SAAS+F,GAAW/F,GAAmC;AAC5D,SAAOA,MAAQ,QAAQ,OAAOA,KAAQ,YAAYsE,MAAkBtE;AACtE;AAKO,SAASgG,GAAShG,GAAmC;AAC1D,SAAOA,MAAQ,QAAQ,OAAOA,KAAQ,YAAYuE,MAAgBvE;AACpE;AAKO,SAASiG,GAAaC,GAAqC;AAChE,SACEA,MAAU,QACV,OAAOA,KAAU,YACjB,OAAQA,EAA6B,QAAS;AAElD;AC1CA,IAAAvB,GAAAwB;AAgCA,MAAM,EAAE,MAAAC,GAAM,OAAAC,GAAO,SAAAC,GAAS,UAAAC,GAAU,UAAAC,GAAU,WAAAC,GAAW,aAAAC,GAAa,UAAAC,GAAU,aAAAC,GAAA,IAClFpI;AAEF,SAASqI,GAAc9B,GAA+B;AACpD,SAAIA,IAAQwB,IAAiBjI,EAAW,WACpCyG,IAAQuB,IAAgBhI,EAAW,UACnCyG,IAAQyB,IAAiBlI,EAAW,WACjCA,EAAW;AACpB;AAKA,MAAMwI,WAA4B7E,EAA6D;AAAA,EA8B7F,YAAYzB,GAA0ByE,IAA8B,IAAI;AACtE,QAAI,OAAOzE,KAAO,kBAAkB,IAAInB,EAAciC,EAAe,yBAAyB;AAC9F,UAAA,GA9BF,KAAU6E,CAAA,IAAc,IAExB,KAAUxB,CAAA,IAAkB,IAG5B,KAAQ,SAAuB,MAE/B,KAAQ,aAAa,GAQrB,KAAU,eAAkC,CAAA,GAC5C,KAAQ,SAA2BiB,GAGnC,KAAQ,8BAA8B,GACtC,KAAQ,mBAAmB,GAC3B,KAAQ,kBAAkB,IAG1B,KAAQ,cAAc,IACtB,KAAQ,cAAgCA,GACxC,KAAQ,cAAc,GAMpB,KAAK,SAAS,QAEd,KAAK,QAAQgB,KAAcP,IAAQD,GACnC,KAAK,SAASnB,EAAQ,SAAS,OAAO,IACtC,KAAK,MAAMzE,GACX,KAAK,gBAAgB,kBAAkByE,IAAUA,EAAQ,eAAgBvF,GACzE,KAAK,WAAWuF,EAAQ,WAAW;AACnC,UAAM8B,IAAU9B,EAAQ;AAMxB,QALA,KAAK,oBAAoB8B,KAAWlI,EAAgB,qBAAqBC,GAEzEa,EAAM,gBAAgB,MAAM,YAAY,KAAK,EAAE,GAG3CsF,EAAQ,SAAS;AACnB,UAAI;AACF,aAAK,WAAA;AAAA,MACP,QAAQ;AAAA,MAER;AAAA,EAEJ;AAAA,EAEQ,SAAe;AACrB,UAAMlF,IAAUyE,EAAgB;AAChC,IAAIzE,KAASM,EAAgB,MAAMN,GAAS,KAAK,YAAY;AAAA,EAC/D;AAAA,EAEA,IAAI,QAAW;AACb,SAAK,OAAA;AAEL,UAAMgF,IAAQ,KAAK;AACnB,SAAKA,KAASwB,IAAWF,IAAQD,QAAWG;AAC1C,aAAO,KAAK;AAGd,QAAIxB,IAAQ4B;AACV,YAAM,IAAItH,EAAciC,EAAe,iBAAiB;AAG1D,QAAIyD,IAAQ2B,GAAa;AACvB,UAAI,KAAK,kBAAmBhH,EAAwB,QAAO,KAAK;AAChE,YAAM,IAAIL,EAAciC,EAAe,4BAA4B;AAAA,IACrE;AAEA,QAAIyD,KAASsB,IAAQD,OACnB,KAAK,WAAA,GAED,KAAK,QAAQG;AAAU,aAAO,KAAK;AAIzC,UAAMS,IAAM,KAAK,eACXC,IAASD,MAAStH;AAExB,QAAI,KAAK,QAAQ4G,GAAS;AACxB,UAAIW,EAAQ,QAAOD;AACnB,YAAM,IAAI3H,EAAciC,EAAe,iCAAiC;AAAA,IAC1E;AAEA,QAAI,KAAK,QAAQkF,GAAU;AACzB,UAAIS,EAAQ,QAAOD;AACnB,YAAM,KAAK;AAAA,IACb;AAEA,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,OAAU;AACR,WAAO,KAAK;AAAA,EACd;AAAA,EAEA,IAAI,QAAwB;AAC1B,gBAAK,OAAA,GACEH,GAAc,KAAK,KAAK;AAAA,EACjC;AAAA,EAEA,IAAI,WAAoB;AAEtB,WADA,KAAK,OAAA,GACD,KAAK,SAASL,IAAWC,KAAmB,KAGzC,KAAK,OAAO,KAAK,CAAChG,MAASA,GAAM,MAAM,QAAQgG,CAAS;AAAA,EACjE;AAAA,EAEA,IAAI,UAAmB;AACrB,WAAO,CAAC,KAAK;AAAA,EACf;AAAA,EAEA,IAAI,SAA2B;AAE7B,QADA,KAAK,OAAA,GACD,CAAC,KAAK,SAAU,QAAOzH;AAG3B,UAAMkI,IAAqB,CAAA;AAC3B,WAAI,KAAK,UAAQA,EAAU,KAAK,KAAK,MAAM,GAE7B,KAAK,OACb,QAAQ,CAACzG,MAAS;AACtB,YAAMX,IAAMW,EAAK;AACjB,MAAIX,EAAI,QAAQ2G,KACM3G,EACR,OAAO,QAAQ,CAAC4C,MAAQ;AAClC,QAAIA,KAAO,CAACwE,EAAU,SAASxE,CAAG,KAAGwE,EAAU,KAAKxE,CAAG;AAAA,MACzD,CAAC;AAAA,IAEL,CAAC,GAEM,OAAO,OAAOwE,CAAS;AAAA,EAChC;AAAA,EAEA,IAAI,YAA0B;AAC5B,gBAAK,OAAA,GACE,KAAK;AAAA,EACd;AAAA,EAEA,IAAI,YAAqB;AACvB,gBAAK,OAAA,IACG,KAAK,QAAQZ,OAAa;AAAA,EACpC;AAAA,EAEA,IAAI,aAAsB;AACxB,gBAAK,OAAA,IACG,KAAK,QAAQC,OAAc;AAAA,EACrC;AAAA,EAEA,aAAmB;AACjB,SAAK,WAAA;AAAA,EACP;AAAA,EAEA,UAAgB;AACd,QAAI,KAAK,QAAQI,EAAU;AAE3B,UAAMQ,IAAQ,KAAK;AACnB,IAAIA,MAAUvB,MACZuB,EAAM,QAAQ,CAAC1G,MAASA,EAAM,SAAS,GACvCoF,EAAe,QAAQsB,CAAK,GAC5B,KAAK,SAASvB,IAGhB,KAAK,aAAa,SAAS,GAC3B,KAAK,QAAQe,IAAWN,IAAQD,GAGhC,KAAK,SAAS,MACd,KAAK,SAAS;AAAA,EAChB;AAAA,EAEA,EAnLUD,IAAA9B,GAEAM,IAAAL,IAiLT,OAAO,YAAiB;AACvB,SAAK,QAAA;AAAA,EACP;AAAA,EAEA,cAAcxE,GAAuB;AAEnC,QAAIA,EAAI,mBAAmB,KAAK,aAIhC;AAAA,UAHAA,EAAI,iBAAiB,KAAK,aAGtB,KAAK,cAAc,KAAK,YAAY,QAAQ;AAC9C,cAAMW,IAAO,KAAK,YAAY,KAAK,WAAW;AAC9C,QAAAA,EAAK,OAAOX,GACZW,EAAK,UAAUX,EAAI;AAAA,MACrB;AACE,aAAK,YAAY,KAAK,IAAIsB,EAAetB,GAAKA,EAAI,OAAO,CAAC;AAE5D,WAAK;AAAA;AAAA,EACP;AAAA,EAEQ,aAAmB;AACzB,QAAI,KAAK,QAAQ4G,EAAa;AAC9B,SAAK,SAASA;AAEd,UAAM5F,IAAY,KAAK;AACvB,SAAK,cAAc8B,EAAA,GACnB,KAAK,cAAciD,EAAe,QAAA,GAClC,KAAK,cAAc;AAEnB,QAAIuB,IAAY;AAChB,QAAI;AAEF,YAAMC,IAAS7C,EAAgB,IAAI,MAAM,KAAK,GAAG;AAGjD,WAAK,YAAY,SAAS,KAAK,aAC/B5D,EAAiB,KAAK,aAAaE,GAAW,IAAI,GAClD,KAAK,SAAS,KAAK,aACnBsG,IAAY,IAGRnB,GAAUoB,CAAM,IAClB,KAAK,wBAAwBA,CAAM,IAEnC,KAAK,oBAAoBA,CAAM;AAAA,IAEnC,SAASnD,GAAG;AAEV,UAAI,CAACkD;AACH,YAAI;AACF,eAAK,YAAY,SAAS,KAAK,aAC/BxG,EAAiB,KAAK,aAAaE,GAAW,IAAI,GAClD,KAAK,SAAS,KAAK,aACnBsG,IAAY;AAAA,QACd,QAAoB;AAAA,QAIpB;AAEF,WAAK,aAAalD,GAAY5C,EAAe,6BAA6B,EAAI;AAAA,IAChF,UAAA;AAEE,MAAI8F,KAAatG,MAAc8E,IAC7BC,EAAe,QAAQ/E,CAAS,IACtBsG,KACVvB,EAAe,QAAQ,KAAK,WAAW,GAIzC,KAAK,cAAc,IACnB,KAAK,cAAcD,GACnB,KAAK,cAAc,GACnB,KAAK,SAAS,CAACc;AAAA,IACjB;AAAA,EACF;AAAA,EAEQ,wBAAwBY,GAA2B;AAEzD,SAAK,SAAS,KAAK,QAAQhB,KAAW,MAEtC,KAAK,mBAAmB,QAAW,MAAS,GAE5C,KAAK,8BAA8B,KAAK,wBAAA,GACxC,KAAK,mBAAmB,GAExB,KAAK,cAAc,KAAK,aAAa,KAAKzH,EAAgB;AAC1D,UAAM0I,IAAY,KAAK;AAEvB,IAAAD,EAAQ;AAAA,MACN,CAACE,MAAQ;AACP,YAAID,MAAc,KAAK,YAEvB;AAAA,cAAI,KAAK,8BAA8B,KAAK,6BAA6B;AAGvE,kBAAM9D,IAAQP,GAAA;AAKd,mBAJI,KAAK,oBAAoBO,MAC3B,KAAK,kBAAkBA,GACvB,KAAK,mBAAmB,IAEtB,KAAK,qBAAqB,KAAK,mBAC1B,KAAK,WAAA,IAEP,KAAK;AAAA,cACV,IAAIpE;AAAA,gBACF,wCAAwC,KAAK,gBAAgB;AAAA,cAAA;AAAA,cAE/DiC,EAAe;AAAA,YAAA;AAAA,UAEnB;AAEA,eAAK,oBAAoBkG,CAAG,GAC5B,KAAK,mBAAmBA,GAAK,MAAS;AAAA;AAAA,MACxC;AAAA,MACA,CAAC9E,MACC6E,MAAc,KAAK,cACnB,KAAK,aAAa7E,GAAKpB,EAAe,iCAAiC;AAAA,IAAA;AAAA,EAE7E;AAAA,EAEQ,0BAAkC;AACxC,QAAImG,IAAO;AACX,UAAMN,IAAQ,KAAK;AACnB,aAASlD,IAAI,GAAGyD,IAAMP,EAAM,QAAQlD,IAAIyD,GAAKzD;AAC3C,MAAAwD,KAASA,KAAQ,KAAKA,IAAON,EAAMlD,CAAC,EAAG,KAAK,UAAW;AAEzD,WAAOwD;AAAA,EACT;AAAA,EAEQ,aAAa/E,GAAc7C,GAAa8H,IAAW,IAAa;AACtE,UAAMjG,IAAQD,EAAUiB,GAAKrD,GAAeQ,CAAG;AAU/C,QARI,CAAC8H,KAAY,EAAE,KAAK,QAAQnB,OAC9B,KAAK,UAAU3D,EAAY,KAAK,OAAO,IAGzC,KAAK,SAASnB,GAEd,KAAK,QAAS,KAAK,QAAQ,OAAwC8E,IAAWC,GAE1E,KAAK;AACP,UAAI;AACF,aAAK,SAAS/E,CAAK;AAAA,MACrB,SAASwC,GAAG;AACV,gBAAQ,MAAM5C,EAAe,iCAAiC4C,CAAC;AAAA,MACjE;AAGF,QAAIyD,EAAU,OAAMjG;AACpB,SAAK,mBAAmB,QAAW,MAAS;AAAA,EAC9C;AAAA,EAEQ,oBAAoBwE,GAAgB;AAE1C,KAAI,EAAE,KAAK,QAAQK,MAAa,CAAC,KAAK,OAAO,KAAK,QAAQL,CAAK,OAC7D,KAAK,UAAUrD,EAAY,KAAK,OAAO,IAGzC,KAAK,SAASqD,GACd,KAAK,SAAS,MAEd,KAAK,SAAS,KAAK,QAAQK,KAAY;AAAA,EACzC;AAAA,EAEA,UAAgB;AAEd,SAAK,WAAA;AAAA,EACP;AAAA;AAAA,EAGA,aAAmB;AACjB,IAAI,KAAK,SAASG,IAAcL,OAChC,KAAK,SAASA,GACd,KAAK,mBAAmB,QAAW,MAAS;AAAA,EAC9C;AACF;AAYO,SAASuB,GACdpH,GACAyE,IAA8B,IACb;AACjB,SAAO,IAAI6B,GAAiBtG,GAAIyE,CAAO;AACzC;ACnaA,IAAAN;AA6BA,MAAMkD,WAAmB7F,EAAwD;AAAA,EAgC/E,YAAYxB,GAAoByE,IAAyB,IAAI;AAC3D,UAAA,GA/BF,KAAUN,CAAA,IAAgB,IAE1B,KAAQ,WAAgC,MACxC,KAAQ,SAA2BiB,GACnC,KAAQ,aAAsC,MAC9C,KAAQ,aAA+BA,GAWvC,KAAQ,gBAAgB,IACxB,KAAQ,kBAAkB,IAC1B,KAAQ,qBAAqB,GAO7B,KAAQ,kBAAkB,GAC1B,KAAQ,eAAe,GACvB,KAAQ,eAAe,GACvB,KAAQ,UAAU,GAIhB,KAAK,MAAMpF,GACX,KAAK,WAAWyE,EAAQ,WAAW,MACnC,KAAK,QAAQA,EAAQ,QAAQ,IAC7B,KAAK,iBACHA,EAAQ,0BAA0BtG,EAAiB,2BACrD,KAAK,yBACHsG,EAAQ,yBAAyBtG,EAAiB,2BAEhD,KAAK,SACP,KAAK,eAAe,QACpB,KAAK,kBAAkB,MAAM,KAAK,QAAA,MAElC,KAAK,eAAe,MAAM,KAAK,QAAA,GAC/B,KAAK,kBAAkB,MAAMyF,EAAU,SAAS,KAAK,YAAa,IAGpEzE,EAAM,gBAAgB,MAAM,UAAU,KAAK,EAAE;AAAA,EAC/C;AAAA,EAEO,MAAY;AACjB,QAAI,KAAK,QAAQpB,EAAmB;AAClC,YAAM,IAAIe,EAAYgC,EAAe,eAAe;AAEtD,SAAK,QAAQ,EAAI;AAAA,EACnB;AAAA,EAEO,UAAgB;AACrB,IAAI,KAAK,QAAQ/C,EAAmB,aACpC,KAAK,SAASA,EAAmB,UAEjC,KAAK,aAAA,GACL,KAAK,YAAY,KAAK,MAAM,GACxB,KAAK,WAAWqH,KAClBC,EAAe,QAAQ,KAAK,MAAM,GAIpC,KAAK,SAASD,GACd,KAAK,aAAaA;AAAA,EACpB;AAAA,EAEA,EAzEUjB,IAAAJ,IAyET,OAAO,QAAA,IAAiB;AACvB,SAAK,QAAA;AAAA,EACP;AAAA,EAEO,cAAczE,GAAuB;AAE1C,QAAI,EAAE,KAAK,QAAQvB,EAAmB,WAAY;AAElD,UAAMuJ,IAAa,KAAK;AAGxB,QAAIhI,EAAI,mBAAmBgI,EAAY;AACvC,IAAAhI,EAAI,iBAAiBgI;AAErB,UAAMjH,IAAY,KAAK,YAGjB4D,IAAO,KAAK,YACZsD,IAAgBtD,EAAK,UAAU,CAAChE,MAASA,KAAQA,EAAK,SAASX,KAAOW,EAAK,KAAK;AAEtF,QAAIsH,MAAkB,IAAI;AACxB,YAAMtH,IAAOgE,EAAKsD,CAAa;AAE/B,MAAAtH,EAAK,UAAUX,EAAI,SACnBe,EAAU,KAAKJ,CAAI,GACnBgE,EAAKsD,CAAa,IAAI;AACtB;AAAA,IACF;AAEA,QAAI;AACF,YAAMC,IAAclI,EAAI,UAAU,KAAK,eAAe;AACtD,MAAAe,EAAU,KAAK,IAAIO,EAAetB,GAAKA,EAAI,SAASkI,CAAW,CAAC;AAAA,IAClE,SAAStG,GAAO;AACd,YAAMuG,IAAUxG,EAAUC,GAAOpC,GAAagC,EAAe,uBAAuB;AAEpF,UADA,QAAQ,MAAM2G,CAAO,GACjB,KAAK;AACP,YAAI;AACF,eAAK,SAASA,CAAO;AAAA,QACvB,QAAQ;AAAA,QAAC;AAGX,MAAApH,EAAU,KAAK,IAAIO,EAAetB,GAAKA,EAAI,SAAS,MAAS,CAAC;AAAA,IAChE;AAAA,EACF;AAAA;AAAA;AAAA;AAAA,EAKO,QAAQoI,IAAQ,IAAa;AAIlC,QAHI,KAAK,SAAS3J,EAAmB,WAAWA,EAAmB,cAG/D,CAAC2J,KAAS,KAAK,OAAO,SAAS,KAAK,CAAC,KAAK,WAAY;AAE1D,SAAK,oBAAA,GAEL,KAAK,SAAS3J,EAAmB,WACjC,KAAK,aAAA,GAGL,KAAK,aAAa,KAAK;AAGvB,UAAMsC,IAAYgF,EAAe,QAAA;AACjC,SAAK,aAAahF,GAClB,KAAK,gBAAgB+B,EAAA;AAErB,QAAIwE,IAAY;AAChB,QAAI;AACF,YAAMC,IAAS7C,EAAgB,IAAI,MAAM,KAAK,GAAG;AACjD,WAAK,SAAS3D,GACduG,IAAY,IAGRnB,GAAUoB,CAAM,IAClB,KAAK,mBAAmBA,CAAM,IAE9B,KAAK,WAAW,OAAOA,KAAW,aAAaA,IAAS;AAAA,IAE5D,SAAS3F,GAAO;AAGd,WAAK,SAASb,GACduG,IAAY,IACZ,KAAK,sBAAsB1F,CAAK,GAChC,KAAK,WAAW;AAAA,IAClB,UAAA;AACE,WAAK,sBAAsB0F,GAAW,KAAK,YAAYvG,CAAS,GAChE,KAAK,SAAS;AAAA,IAChB;AAAA,EACF;AAAA,EAEQ,mBAAmByG,GAAiC;AAC1D,UAAMa,IAAS,EAAE,KAAK;AACtB,IAAAb,EAAQ;AAAA,MACN,CAACc,MAAY;AAEX,YAAID,MAAW,KAAK,WAAW,KAAK,QAAQ5J,EAAmB,UAAU;AACvE,cAAI,OAAO6J,KAAY;AACrB,gBAAI;AACF,cAAAA,EAAA;AAAA,YACF,SAASlE,GAAG;AACV,mBAAK,sBAAsBA,GAAG5C,EAAe,qBAAqB;AAAA,YACpE;AAEF;AAAA,QACF;AACA,QAAI,OAAO8G,KAAY,eAAY,KAAK,WAAWA;AAAA,MACrD;AAAA,MACA,CAAC1F,MAAQyF,MAAW,KAAK,WAAW,KAAK,sBAAsBzF,CAAG;AAAA,IAAA;AAAA,EAEtE;AAAA,EAEQ,sBACN0E,GACAtG,GACAD,GACM;AACN,SAAK,aAAa,MAClB,KAAK,aAAa+E,GAEdwB,KAEFtG,EAAU,QAAQ,CAACL,MAASA,GAAM,SAAS,GAEvCK,MAAc8E,KAChBC,EAAe,QAAQ/E,CAAS,MAIlC,KAAK,YAAYD,CAAS,GAC1BgF,EAAe,QAAQhF,CAAS;AAAA,EAEpC;AAAA,EAEQ,YAAYsG,GAA+B;AACjD,IAAAA,EAAM,QAAQ,CAAC1G,MAASA,GAAM,SAAS;AAAA,EACzC;AAAA,EAEQ,WAAoB;AAC1B,UAAM0G,IAAQ,KAAK,QAEbkB,IAAc7D,EAAgB;AACpC,IAAAA,EAAgB,UAAU;AAE1B,QAAI;AACF,aAAO2C,EAAM,KAAK,CAAC1G,MAAS;AAC1B,cAAMX,IAAMW,EAAK;AAGjB,YAAIX,EAAI,QAAQtB,EAAqB;AACnC,cAAI;AAEF,YAAMsB,EAA2B;AAAA,UACnC,QAAQ;AAIN,mBAAO;AAAA,UACT;AAIF,eAAOA,EAAI,YAAYW,EAAK;AAAA,MAC9B,CAAC;AAAA,IACH,UAAA;AACE,MAAA+D,EAAgB,UAAU6D;AAAA,IAC5B;AAAA,EACF;AAAA,EAEQ,eAAqB;AAC3B,QAAK,KAAK,UACV;AAAA,UAAI;AACF,aAAK,SAAA;AAAA,MACP,SAAS3G,GAAO;AACd,aAAK,sBAAsBA,GAAOJ,EAAe,qBAAqB;AAAA,MACxE;AACA,WAAK,WAAW;AAAA;AAAA,EAClB;AAAA,EAEQ,sBAA4B;AAClC,UAAMmC,IAAQP,GAAA;AACd,IAAI,KAAK,oBAAoBO,MAC3B,KAAK,kBAAkBA,GACvB,KAAK,qBAAqB,IAGxB,EAAE,KAAK,qBAAqB,KAAK,0BACnC,KAAK,wBAAwB,YAAY,GACvCJ,GAAA,IAAiC1E,EAAiB,4BACpD,KAAK,wBAAwB,QAAQ,GAEvC,KAAK;AAAA,EAeP;AAAA,EAEA,IAAI,aAAsB;AACxB,YAAQ,KAAK,QAAQJ,EAAmB,cAAc;AAAA,EACxD;AAAA,EACA,IAAI,iBAAyB;AAC3B,WAAO,KAAK;AAAA,EACd;AAAA,EACA,IAAI,cAAuB;AACzB,YAAQ,KAAK,QAAQA,EAAmB,eAAe;AAAA,EACzD;AAAA,EAEQ,wBAAwB0B,GAAsC;AACpE,UAAMyB,IAAQ,IAAIpC;AAAA,MAChB,2BAA2BW,CAAI,sBAAsB,KAAK,kBAAkB,uDAAuD8C,CAAmB;AAAA,IAAA;AAExJ,eAAK,QAAA,GACL,QAAQ,MAAMrB,CAAK,GACbA;AAAA,EACR;AAAA,EAEQ,sBACNA,GACAxC,IAAkBoC,EAAe,yBAC3B;AACN,UAAMgH,IAAW7G,EAAUC,GAAOpC,GAAaJ,CAAO;AAEtD,QADA,QAAQ,MAAMoJ,CAAQ,GAClB,KAAK;AACP,UAAI;AACF,aAAK,SAASA,CAAQ;AAAA,MACxB,SAASpE,GAAG;AACV,gBAAQ,MAAMzC,EAAUyC,GAAG5E,GAAagC,EAAe,+BAA+B,CAAC;AAAA,MACzF;AAAA,EAEJ;AACF;AASO,SAASiH,GAAO/H,GAAoByE,IAAyB,IAAkB;AACpF,MAAI,OAAOzE,KAAO;AAChB,UAAM,IAAIlB,EAAYgC,EAAe,uBAAuB;AAG9D,QAAMkH,IAAiB,IAAIX,GAAWrH,GAAIyE,CAAO;AACjD,SAAAuD,EAAe,QAAA,GAERA;AACT;ACpWO,SAASC,GAASjI,GAAgB;AAEvC,MAAI,OAAOA,KAAO;AAChB,UAAM,IAAI,UAAU,mCAAmC;AAGzD,EAAA4D,EAAU,WAAA;AACV,MAAI;AACF,WAAO5D,EAAA;AAAA,EACT,UAAA;AACE,IAAA4D,EAAU,SAAA;AAAA,EACZ;AACF;"}
+{"version":3,"file":"index.mjs","names":[],"sources":["../src/constants.ts","../src/core/dep-tracking.ts","../src/errors/errors.ts","../src/errors/messages.ts","../src/internal/slot-buffer.ts","../src/utils/debug.ts","../src/utils/error.ts","../src/core/base.ts","../src/internal/epoch.ts","../src/internal/scheduler.ts","../src/symbols.ts","../src/tracking/context.ts","../src/tracking/untracked.ts","../src/core/atom.ts","../src/internal/dep-slot-buffer.ts","../src/utils/type-guards.ts","../src/core/computed.ts","../src/core/effect.ts","../src/internal/batch.ts"],"sourcesContent":["/**\n * Async operation states.\n */\nexport const AsyncState = {\n  IDLE: 'idle',\n  PENDING: 'pending',\n  RESOLVED: 'resolved',\n  REJECTED: 'rejected',\n} as const;\n\n/**\n * Effect flags.\n */\nexport const EFFECT_STATE_FLAGS = {\n  DISPOSED: 1 << 0,\n  EXECUTING: 1 << 3,\n} as const;\n\n/**\n * Computed flags.\n */\nexport const COMPUTED_STATE_FLAGS = {\n  DISPOSED: 1 << 0,\n  /** Marker bit: identifies this node as a computed. */\n  IS_COMPUTED: 1 << 1,\n  DIRTY: 1 << 3,\n  IDLE: 1 << 4,\n  PENDING: 1 << 5,\n  RESOLVED: 1 << 6,\n  REJECTED: 1 << 7,\n  RECOMPUTING: 1 << 8,\n  HAS_ERROR: 1 << 9,\n  /** Flagged when explicitly invalidated. Bypasses fast-path dirty checks. */\n  FORCE_COMPUTE: 1 << 10,\n} as const;\n\n/**\n * Writable Atom Flags.\n */\nexport const ATOM_STATE_FLAGS = {\n  DISPOSED: 1 << 0,\n  SYNC: 1 << 3,\n  NOTIFICATION_SCHEDULED: 1 << 4,\n} as const;\n\n/**\n * Scheduler configuration.\n */\nexport const SCHEDULER_CONFIG = {\n  // Infinite loop protection\n  MAX_EXECUTIONS_PER_SECOND: 1000,\n  MAX_EXECUTIONS_PER_EFFECT: 100,\n\n  // Batch processing limits to prevent blocking the main thread for too long\n  MAX_EXECUTIONS_PER_FLUSH: 10000,\n  MAX_FLUSH_ITERATIONS: 1000,\n  MIN_FLUSH_ITERATIONS: 10,\n\n  // Memory management\n  BATCH_QUEUE_SHRINK_THRESHOLD: 1000,\n} as const;\n\n/**\n * Debugging thresholds.\n */\nexport const DEBUG_CONFIG = {\n  WARN_INFINITE_LOOP: true,\n  EFFECT_FREQUENCY_WINDOW: 1000,\n} as const;\n\n/**\n * Computed configuration.\n */\nexport const COMPUTED_CONFIG = {\n  MAX_ASYNC_RETRIES: 3,\n  MAX_PROMISE_ID: Number.MAX_SAFE_INTEGER - 1,\n} as const;\n\n/**\n * Epoch sentinel values.\n */\nexport const EPOCH_CONSTANTS = {\n  /** Uninitialized epoch marker. Used as initial value before any flush has occurred. */\n  UNINITIALIZED: -1,\n  /** Minimum valid epoch value after a counter reset. */\n  MIN: 1,\n} as const;\n\n/**\n * V8 Small Integer (SMI) max value.\n */\nexport const SMI_MAX = 0x3fffffff;\n\n/**\n * Bit-packing constants for versioned slot operations.\n * Used by DepSlotBuffer for O(1) snapshot hashing.\n */\nexport const BITPACK = {\n  /** Bits allocated for version in a packed slot value. */\n  VERSION_BITS: 16,\n} as const;\n\n/**\n * Development environment flag.\n */\nexport const IS_DEV =\n  (typeof process !== 'undefined' && process.env && process.env.NODE_ENV !== 'production') ||\n  (typeof __DEV__ !== 'undefined' && !!__DEV__);\n\n// Fallback declaration for __DEV__ if not present in environment\ndeclare const __DEV__: boolean;\n\nexport const EMPTY_ERROR_ARRAY: readonly Error[] = Object.freeze([]);\n","import type { Dependency, Subscriber } from '@/types';\n// trackDependency removed as it was obsolete and caused polymorphic cache misses\n\n/**\n * Dependency graph edge.\n */\nexport class DependencyLink {\n  public unsub: (() => void) | undefined;\n\n  constructor(\n    public node: Dependency,\n    public version: number,\n    unsub: (() => void) | undefined = undefined\n  ) {\n    // Always initialize to maintain consistent V8 hidden class\n    this.unsub = unsub;\n  }\n}\n\n/**\n * Subscription entry.\n */\nexport class Subscription<T> {\n  public fn: ((newValue?: T, oldValue?: T) => void) | undefined;\n  public sub: Subscriber | undefined;\n\n  constructor(fn: ((newValue?: T, oldValue?: T) => void) | undefined, sub: Subscriber | undefined) {\n    // Always initialize both properties to maintain consistent V8 hidden class\n    this.fn = fn;\n    this.sub = sub;\n  }\n\n  notify(newValue?: T, oldValue?: T): void {\n    if (this.fn) this.fn(newValue, oldValue);\n    else if (this.sub) this.sub.execute();\n  }\n}\n","/**\n * Base error class.\n */\nexport class AtomError extends Error {\n  constructor(\n    message: string,\n    public cause: Error | null = null,\n    public recoverable = true\n  ) {\n    super(message);\n    this.name = 'AtomError';\n  }\n}\n\n/** Computed error. */\nexport class ComputedError extends AtomError {\n  constructor(message: string, cause: Error | null = null) {\n    super(message, cause, true);\n    this.name = 'ComputedError';\n  }\n}\n\n/** Effect error. */\nexport class EffectError extends AtomError {\n  constructor(message: string, cause: Error | null = null) {\n    super(message, cause, false);\n    this.name = 'EffectError';\n  }\n}\n\n/** Scheduler error. */\nexport class SchedulerError extends AtomError {\n  constructor(message: string, cause: Error | null = null) {\n    super(message, cause, false);\n    this.name = 'SchedulerError';\n  }\n}\n","/**\n * Error message registry.\n */\nexport const ERROR_MESSAGES = {\n  // Computed Errors\n  COMPUTED_MUST_BE_FUNCTION: 'Computed target must be a function',\n  COMPUTED_ASYNC_PENDING_NO_DEFAULT: 'Async computation pending with no default value',\n  COMPUTED_COMPUTATION_FAILED: 'Computation execution failed',\n  COMPUTED_ASYNC_COMPUTATION_FAILED: 'Async computation execution failed',\n  COMPUTED_CIRCULAR_DEPENDENCY: 'Circular dependency detected',\n  COMPUTED_DISPOSED: 'Attempted to access disposed computed',\n\n  // Atom Errors\n  ATOM_SUBSCRIBER_MUST_BE_FUNCTION: 'Subscriber must be a function or Subscriber object',\n  ATOM_INDIVIDUAL_SUBSCRIBER_FAILED: 'Subscriber execution failed',\n\n  // Effect Errors\n  EFFECT_MUST_BE_FUNCTION: 'Effect target must be a function',\n  EFFECT_EXECUTION_FAILED: 'Effect execution failed',\n  EFFECT_CLEANUP_FAILED: 'Effect cleanup failed',\n  EFFECT_DISPOSED: 'Attempted to run disposed effect',\n\n  // Scheduler Errors\n  SCHEDULER_FLUSH_OVERFLOW: (max: number, dropped: number): string =>\n    `Maximum flush iterations (${max}) exceeded. ${dropped} jobs dropped. Possible infinite loop.`,\n\n  // System / Debug\n  CALLBACK_ERROR_IN_ERROR_HANDLER: 'Exception encountered in onError handler',\n\n  // Effect frequency\n  EFFECT_FREQUENCY_LIMIT_EXCEEDED:\n    'Effect executed too frequently within 1 second. Suspected infinite loop.',\n\n  SCHEDULER_CALLBACK_MUST_BE_FUNCTION: 'Scheduler callback must be a function',\n  SCHEDULER_END_BATCH_WITHOUT_START: 'endBatch() called without matching startBatch(). Ignoring.',\n  BATCH_CALLBACK_MUST_BE_FUNCTION: 'Batch callback must be a function',\n} as const;\n","import { EPOCH_CONSTANTS } from '@/constants';\n\nconst _SLOT_CAPACITY = 4;\n\n/**\n * Inline-slot subscriber container.\n *\n * Stores up to {@link _SLOT_CAPACITY} items directly as object properties\n * (zero array allocation). Spills to an overflow array only when the\n * inline slots are exhausted.\n *\n * Design goals:\n * - **Cache locality**: hot-path data lives on the same V8 object.\n * - **Logical deletion**: `remove()` nulls a slot and decrements `_count`.\n *   Physical compaction is deferred to `compact()`.\n * - **Epoch-aware reuse**: `clear()` resets `_count` to 0 without touching\n *   slot references; new `add()` calls overwrite stale pointers in-place.\n *\n * @template T - Slot element type (e.g. `Subscription<V>`).\n */\nexport class SlotBuffer<T> {\n  // ── Inline slots ──────────────────────────────────────────────────────\n  // Always declared to lock V8 hidden class shape.\n  _s0: T | null = null;\n  _s1: T | null = null;\n  _s2: T | null = null;\n  _s3: T | null = null;\n\n  // ── Bookkeeping ───────────────────────────────────────────────────────\n  /** Active (non-null) element count across slots + overflow. */\n  _count = 0;\n\n  /** Last mutation epoch — used for staleness detection in `clear()`. */\n  _epoch: number = EPOCH_CONSTANTS.UNINITIALIZED;\n\n  /** Lazy-allocated overflow array for subscribers beyond {@link SLOT_CAPACITY}. */\n  _overflow: (T | null)[] | null = null;\n\n  // ── Public API ────────────────────────────────────────────────────────\n\n  /** Number of active (non-null) elements. */\n  get size(): number {\n    return this._count;\n  }\n\n  /** Gets the item at a specific logical index. */\n  getAt(index: number): T | null {\n    if (index === 0) return this._s0;\n    if (index === 1) return this._s1;\n    if (index === 2) return this._s2;\n    if (index === 3) return this._s3;\n\n    const ov = this._overflow;\n    if (ov !== null && index >= 4) {\n      const ovIdx = index - 4;\n      if (ovIdx < ov.length) return ov[ovIdx] || null;\n    }\n    return null;\n  }\n\n  /** Overwrites an item at a specific index. */\n  setAt(index: number, item: T | null): void {\n    if (index === 0) {\n      this._s0 = item;\n    } else if (index === 1) {\n      this._s1 = item;\n    } else if (index === 2) {\n      this._s2 = item;\n    } else if (index === 3) {\n      this._s3 = item;\n    } else {\n      this._overflow ??= [];\n      const ov = this._overflow;\n      ov[index - 4] = item;\n    }\n\n    if (index >= this._count) {\n      this._count = index + 1;\n    }\n  }\n\n  /**\n   * Discards all items from the given index onwards.\n   * Equivalent to resetting the length of an array.\n   */\n  truncateFrom(index: number): void {\n    const count = this._count;\n    if (index >= count) return;\n\n    // 1. Unroll Inline Slots Cleanup\n    if (index <= 0) {\n      const s = this._s0;\n      if (s != null) {\n        this._onItemRemoved(s);\n        this._s0 = null;\n      }\n    }\n    if (index <= 1) {\n      const s = this._s1;\n      if (s != null) {\n        this._onItemRemoved(s);\n        this._s1 = null;\n      }\n    }\n    if (index <= 2) {\n      const s = this._s2;\n      if (s != null) {\n        this._onItemRemoved(s);\n        this._s2 = null;\n      }\n    }\n    if (index <= 3) {\n      const s = this._s3;\n      if (s != null) {\n        this._onItemRemoved(s);\n        this._s3 = null;\n      }\n    }\n\n    // 2. Overflow Cleanup\n    const ov = this._overflow;\n    if (ov !== null && count > 4) {\n      const startIdx = index > 4 ? index - 4 : 0;\n      const len = ov.length;\n      for (let i = startIdx; i < len; i++) {\n        const item = ov[i];\n        if (item != null) {\n          this._onItemRemoved(item);\n          ov[i] = null;\n        }\n      }\n\n      if (index <= 4) {\n        ov.length = 0;\n        this._overflow = null;\n      } else {\n        ov.length = index - 4;\n      }\n    }\n\n    this._count = index;\n  }\n\n  /**\n   * Protected hook called whenever an item is logically removed from the buffer.\n   * Allows subclasses (like DepSlotBuffer) to perform cleanup (unsubscribing)\n   * without allocating temporary closures in hot paths.\n   */\n  protected _onItemRemoved(_item: T): void {\n    // Base implementation does nothing\n  }\n\n  /**\n   * Adds an item.\n   *\n   * Prefers filling a null inline slot (including previously-cleared ones)\n   * before spilling to the overflow array.\n   */\n  add(item: T): void {\n    // Fast path: fill inline slots first\n    if (this._s0 === null) {\n      this._s0 = item;\n      this._count++;\n      return;\n    }\n    if (this._s1 === null) {\n      this._s1 = item;\n      this._count++;\n      return;\n    }\n    if (this._s2 === null) {\n      this._s2 = item;\n      this._count++;\n      return;\n    }\n    if (this._s3 === null) {\n      this._s3 = item;\n      this._count++;\n      return;\n    }\n\n    // Overflow path\n    if (this._overflow === null) {\n      this._overflow = [item];\n    } else {\n      // Try to reuse a null gap in overflow before pushing\n      const ov = this._overflow;\n      for (let i = 0, len = ov.length; i < len; i++) {\n        if (ov[i] === null) {\n          ov[i] = item;\n          this._count++;\n          return;\n        }\n      }\n      ov.push(item);\n    }\n    this._count++;\n  }\n\n  /**\n   * Removes the first occurrence of {@link item} via identity comparison.\n   *\n   * The slot is nulled out (logical deletion). Call {@link compact}\n   * after notification traversal to reclaim the gaps.\n   *\n   * @returns `true` if the item was found and removed.\n   */\n  remove(item: T): boolean {\n    if (this._s0 === item) {\n      this._s0 = null;\n      this._count--;\n      return true;\n    }\n    if (this._s1 === item) {\n      this._s1 = null;\n      this._count--;\n      return true;\n    }\n    if (this._s2 === item) {\n      this._s2 = null;\n      this._count--;\n      return true;\n    }\n    if (this._s3 === item) {\n      this._s3 = null;\n      this._count--;\n      return true;\n    }\n\n    const ov = this._overflow;\n    if (ov == null) return false;\n\n    for (let i = 0, len = ov.length; i < len; i++) {\n      if (ov[i] === item) {\n        ov[i] = null;\n        this._count--;\n        return true;\n      }\n    }\n    return false;\n  }\n\n  /**\n   * Checks whether {@link item} exists in the buffer (identity comparison).\n   */\n  has(item: T): boolean {\n    const count = this._count;\n    if (count === 0) return false;\n\n    // 1. Inline Slots (Deterministic scan for safety against null holes)\n    if (this._s0 === item || this._s1 === item || this._s2 === item || this._s3 === item) {\n      return true;\n    }\n\n    // Fast exit if all active items are confirmed to be in inline slots\n    if (count <= 4) return false;\n\n    // 2. Overflow Scan (Early exit enabled for large sparse arrays)\n    const ov = this._overflow;\n    if (ov != null) {\n      let processed = 0;\n      if (this._s0 != null) processed++;\n      if (this._s1 != null) processed++;\n      if (this._s2 != null) processed++;\n      if (this._s3 != null) processed++;\n\n      for (let i = 0, len = ov.length; i < len; i++) {\n        const el = ov[i];\n        if (el != null) {\n          if (el === item) return true;\n          if (++processed === count) break;\n        }\n      }\n    }\n    return false;\n  }\n\n  /**\n   * Iterates over all non-null elements.\n   *\n   * Safe to call during notification — newly-added or removed items\n   * during iteration follow the same snapshot semantics as the old\n   * array-based approach (length captured upfront for overflow).\n   */\n  forEach(fn: (item: T) => void): void {\n    const count = this._count;\n    if (count === 0) return;\n\n    // 1. Inline slots (Deterministic scan)\n    const s0 = this._s0;\n    if (s0 != null) fn(s0);\n    const s1 = this._s1;\n    if (s1 != null) fn(s1);\n    const s2 = this._s2;\n    if (s2 != null) fn(s2);\n    const s3 = this._s3;\n    if (s3 != null) fn(s3);\n\n    // Fast exit\n    if (count <= 4) return;\n\n    // 2. Overflow\n    const ov = this._overflow;\n    if (ov != null) {\n      let processed = 0;\n      if (s0 != null) processed++;\n      if (s1 != null) processed++;\n      if (s2 != null) processed++;\n      if (s3 != null) processed++;\n\n      for (let i = 0, len = ov.length; i < len; i++) {\n        const el = ov[i];\n        if (el != null) {\n          fn(el);\n          if (++processed === count) return;\n        }\n      }\n    }\n  }\n\n  /**\n   * Iterates with index-based access for length-captured traversal.\n   *\n   * Returns the total number of slots to iterate (inline + overflow).\n   * Used by `_notifySubscribers` for length-captured iteration.\n   */\n  forEachIndexed(fn: (item: T) => void): number {\n    const count = this._count;\n    if (count === 0) return 0;\n\n    // 1. Inline slots\n    let executed = 0;\n    const s0 = this._s0;\n    if (s0 != null) {\n      fn(s0);\n      executed++;\n    }\n    const s1 = this._s1;\n    if (s1 != null) {\n      fn(s1);\n      executed++;\n    }\n    const s2 = this._s2;\n    if (s2 != null) {\n      fn(s2);\n      executed++;\n    }\n    const s3 = this._s3;\n    if (s3 != null) {\n      fn(s3);\n      executed++;\n    }\n\n    // Fast exit\n    if (count <= 4 || executed === count) return executed;\n\n    // 2. Overflow\n    const ov = this._overflow;\n    if (ov != null) {\n      for (let i = 0, len = ov.length; i < len; i++) {\n        const el = ov[i];\n        if (el != null) {\n          fn(el);\n          if (++executed === count) break;\n        }\n      }\n    }\n    return executed;\n  }\n\n  /**\n   * Compacts the overflow array by removing null gaps.\n   *\n   * Inline slots are not compacted — they stay null until reused by\n   * `add()`. This keeps the V8 hidden class stable.\n   */\n  compact(): void {\n    const ov = this._overflow;\n    if (ov === null || ov.length === 0) return;\n\n    // Pop-and-swap compaction (matches original _cleanupTombstones logic)\n    let i = 0;\n    while (i < ov.length) {\n      if (ov[i] === null) {\n        const last = ov.pop() as T;\n        if (i < ov.length && last != null) {\n          ov[i] = last;\n        }\n      } else {\n        i++;\n      }\n    }\n\n    // Release overflow array when empty\n    if (ov.length === 0) {\n      this._overflow = null;\n    }\n  }\n\n  /**\n   * Logical clear — resets count without zeroing slot references.\n   *\n   * The stale references become invisible (count is 0, forEach yields\n   * nothing after clear). Next `add()` overwrites them in-place.\n   *\n   * For a hard release (e.g. `dispose()`), use {@link dispose} instead.\n   */\n  clear(): void {\n    this._s0 = null;\n    this._s1 = null;\n    this._s2 = null;\n    this._s3 = null;\n    this._count = 0;\n\n    if (this._overflow !== null) {\n      this._overflow.length = 0;\n      this._overflow = null;\n    }\n  }\n\n  /**\n   * Hard dispose — releases all references for GC.\n   */\n  dispose(): void {\n    this.clear();\n  }\n}\n","import { DEBUG_CONFIG, IS_DEV } from '@/constants';\nimport type { DebugConfig, DependencyId } from '@/types';\n\n// Debug symbols\nexport const DEBUG_NAME = Symbol('AtomEffect.DebugName');\nexport const DEBUG_ID = Symbol('AtomEffect.Id');\nexport const DEBUG_TYPE = Symbol('AtomEffect.Type');\nexport const NO_DEFAULT_VALUE = Symbol('AtomEffect.NoDefaultValue');\n\n/**\n * Debug controller.\n */\nexport const debug: DebugConfig = {\n  // Dev mode flag\n  enabled: IS_DEV,\n\n  warnInfiniteLoop: DEBUG_CONFIG.WARN_INFINITE_LOOP,\n\n  warn(cond, msg) {\n    if (IS_DEV && this.enabled && cond) {\n      console.warn(`[Atom Effect] ${msg}`);\n    }\n  },\n\n  attachDebugInfo(obj, type, id) {\n    if (!IS_DEV || !this.enabled) return;\n\n    const t = obj as Record<symbol, unknown>;\n    t[DEBUG_NAME] = `${type}_${id}`;\n    t[DEBUG_ID] = id;\n    t[DEBUG_TYPE] = type;\n  },\n\n  getDebugName: (obj) =>\n    (obj as Record<symbol, unknown> | null)?.[DEBUG_NAME] as string | undefined,\n\n  getDebugType: (obj) =>\n    (obj as Record<symbol, unknown> | null)?.[DEBUG_TYPE] as string | undefined,\n};\n\n/**\n * ID counter.\n */\nlet nextId = 1;\n\n/**\n * Generates ID.\n */\nexport const generateId = (): DependencyId => nextId++;\n","import { AtomError } from '@/errors/errors';\n\n/**\n * Wraps error.\n *\n * @param error - Raw error.\n * @param ErrorClass - Error class.\n * @param context - Error context.\n */\nexport function wrapError(\n  error: unknown,\n  ErrorClass: typeof AtomError,\n  context: string\n): AtomError {\n  // Return if wrapped\n  if (error instanceof AtomError) {\n    return error;\n  }\n\n  const isNativeError = error instanceof Error;\n  const originalMessage = isNativeError ? error.message : String(error);\n  const cause = isNativeError ? error : undefined;\n\n  const type = isNativeError ? error.constructor.name : 'Unexpected error';\n  const finalMessage = `${type} (${context}): ${originalMessage}`;\n\n  return new ErrorClass(finalMessage, cause);\n}\n","import { EPOCH_CONSTANTS, IS_DEV, SMI_MAX } from '@/constants';\nimport { Subscription } from '@/core/dep-tracking';\nimport { AtomError } from '@/errors/errors';\nimport { ERROR_MESSAGES } from '@/errors/messages';\nimport type { DepSlotBuffer } from '@/internal/dep-slot-buffer';\nimport { SlotBuffer } from '@/internal/slot-buffer';\nimport type { DependencyId, Subscriber } from '@/types';\nimport { generateId } from '@/utils/debug';\nimport { wrapError } from '@/utils/error';\n\n/**\n * Unified base class for all reactive nodes (Atoms, Computeds, Effects).\n *\n * Optimized for V8 Hidden Class Monomorphism by having a single, consistent\n * object shape for all reactive logic.\n *\n * @template T - The type of value produced by this node (used for subscriptions).\n */\nexport abstract class ReactiveNode<T> {\n  /** [Producer/Consumer] State flags */\n  flags = 0;\n  /** [Producer/Consumer] Version counter */\n  version = 0;\n  /** [Producer/Consumer] Last access epoch */\n  _lastSeenEpoch = EPOCH_CONSTANTS.UNINITIALIZED;\n  /** [Context] Scheduler epoch tag */\n  _nextEpoch?: number;\n  /** [Debug] Unique ID for identify node in tracking maps */\n  readonly id: DependencyId = generateId() & SMI_MAX;\n\n  /**\n   * [Producer] Managed subscribers.\n   * Nullable to save memory in pure-consumer nodes (Effects).\n   */\n  _slots: SlotBuffer<Subscription<T>> | null = null;\n  /** [Producer] Re-entry guard for notification loop. */\n  _notifying = 0;\n\n  /**\n   * [Consumer] Managed dependencies.\n   * Nullable to save memory in pure-producers (Atoms).\n   */\n  _deps: DepSlotBuffer | null = null;\n  /** [Consumer] O(1) Hot-path dependency index for rapid dirty checks. */\n  _hotIndex = -1;\n\n  // ============================================================================\n  // Producer Logic (Subscriber Management)\n  // ============================================================================\n\n  /**\n   * Adds subscriber for notifications.\n   */\n  subscribe(listener: ((newValue?: T, oldValue?: T) => void) | Subscriber): () => void {\n    const isFn = typeof listener === 'function';\n    if (!isFn && (!listener || typeof (listener as Subscriber).execute !== 'function')) {\n      throw wrapError(\n        new TypeError('Invalid subscriber'),\n        AtomError,\n        ERROR_MESSAGES.ATOM_SUBSCRIBER_MUST_BE_FUNCTION\n      );\n    }\n\n    let slots = this._slots;\n    if (!slots) {\n      slots = new SlotBuffer<Subscription<T>>();\n      this._slots = slots;\n    }\n\n    // Duplicate check\n    let duplicate = false;\n    slots.forEach((sub) => {\n      if (isFn ? sub.fn === listener : sub.sub === listener) {\n        duplicate = true;\n      }\n    });\n\n    if (duplicate) {\n      if (IS_DEV) console.warn(`[atom-effect] Duplicate subscription ignored on node ${this.id}`);\n      return () => {};\n    }\n\n    const link = new Subscription<T>(\n      isFn ? (listener as (newValue?: T, oldValue?: T) => void) : undefined,\n      !isFn ? (listener as Subscriber) : undefined\n    );\n\n    slots.add(link);\n    return () => this._unsubscribe(link);\n  }\n\n  protected _unsubscribe(link: Subscription<T>): void {\n    if (!this._slots) return;\n\n    if (this._notifying > 0) {\n      this._slots.remove(link);\n      return;\n    }\n\n    this._slots.remove(link);\n    this._slots.compact();\n  }\n\n  /**\n   * Returns current subscriber count.\n   */\n  subscriberCount(): number {\n    return this._slots ? this._slots.size : 0;\n  }\n\n  /**\n   * Notifies all subscribers about a value update.\n   */\n  protected _notifySubscribers(newValue: T | undefined, oldValue: T | undefined): void {\n    const slots = this._slots;\n    if (!slots || slots.size === 0) return;\n\n    this._notifying++;\n    try {\n      slots.forEach((s) => {\n        try {\n          s.notify(newValue, oldValue);\n        } catch (err) {\n          console.error(\n            wrapError(err, AtomError, ERROR_MESSAGES.ATOM_INDIVIDUAL_SUBSCRIBER_FAILED)\n          );\n        }\n      });\n    } finally {\n      this._notifying--;\n      if (this._notifying === 0) {\n        slots.compact();\n      }\n    }\n  }\n\n  // ============================================================================\n  // Consumer Logic (Dependency Validation)\n  // ============================================================================\n\n  /**\n   * Determines if the node is dirty by checking its dependency chain.\n   * Optimized with O(1) hot-path check.\n   */\n  protected _isDirty(): boolean {\n    const deps = this._deps;\n    if (!deps || deps.size === 0) return false;\n\n    // Phase 1: Hot-path Check - O(1)\n    if (this._hotIndex !== -1) {\n      const hotLink = deps.getAt(this._hotIndex);\n      if (hotLink != null && hotLink.node.version !== hotLink.version) {\n        return true;\n      }\n    }\n\n    // Phase 2: Standard Validation - O(N)\n    if (!deps.hasComputeds && !deps.isDirtyFast()) return false;\n\n    // Deep check for computeds\n    return this._deepDirtyCheck();\n  }\n\n  /**\n   * Deeply validates dependency versions.\n   */\n  protected abstract _deepDirtyCheck(): boolean;\n}\n","import { IS_DEV, SMI_MAX } from '@/constants';\n\n// Global epoch counter.\nlet collectorEpoch = 0;\n\n/**\n * Next tracking epoch.\n */\nexport const nextEpoch = () => {\n  collectorEpoch = (collectorEpoch + 1) & SMI_MAX || 1;\n  return collectorEpoch;\n};\n\n/** Current tracking epoch. */\nexport const currentEpoch = () => collectorEpoch;\n\n/** Increments a version counter within SMI range. */\nexport const nextVersion = (v: number) => (v + 1) & SMI_MAX;\n\nexport let flushExecutionCount = 0;\nlet isFlushing = false;\nlet _flushEpoch = 0;\n\n/** Current flush epoch. */\nexport const currentFlushEpoch = () => _flushEpoch;\n\n/**\n * Starts flush cycle.\n */\nexport function startFlush(): boolean {\n  if (isFlushing) {\n    if (IS_DEV) console.warn('startFlush() called during flush - ignored');\n    return false;\n  }\n\n  isFlushing = true;\n  _flushEpoch = nextEpoch();\n  flushExecutionCount = 0;\n  return true;\n}\n\n/** Ends flush cycle. */\nexport const endFlush = () => {\n  isFlushing = false;\n};\n\n/**\n * Increments execution count.\n */\nexport const incrementFlushExecutionCount = () => (isFlushing ? ++flushExecutionCount : 0);\n\n/**\n * Resets flush state.\n */\nexport function resetFlushState(): void {\n  _flushEpoch = 0;\n  flushExecutionCount = 0;\n  isFlushing = false;\n}\n","import { IS_DEV, SCHEDULER_CONFIG } from '@/constants';\nimport { SchedulerError } from '@/errors/errors';\nimport { ERROR_MESSAGES } from '@/errors/messages';\nimport { endFlush, startFlush } from '@/internal/epoch';\n\nexport enum SchedulerPhase {\n  IDLE = 0,\n  BATCHING = 1,\n  FLUSHING = 2,\n}\n\nexport interface SchedulerJobObject {\n  execute(): void;\n  /** Next scheduled epoch */\n  _nextEpoch?: number;\n}\n\nexport interface SchedulerJobFunction {\n  (): void;\n  /** Next scheduled epoch */\n  _nextEpoch?: number;\n}\n\nexport type SchedulerJob = SchedulerJobFunction | SchedulerJobObject;\n\n/**\n * Scheduler implementation.\n */\nclass Scheduler {\n  /** Queue buffer */\n  _queueBuffer: [SchedulerJob[], SchedulerJob[]] = [[], []];\n  _bufferIndex = 0;\n  _size = 0;\n\n  /** Epoch counter */\n  _epoch = 0;\n\n  /** State flags */\n  _isProcessing = false;\n  _isBatching = false;\n  _isFlushingSync = false;\n\n  /** Batching state */\n  _batchDepth = 0;\n  _batchQueue: SchedulerJob[] = [];\n  _batchQueueSize = 0;\n\n  /** Config */\n  _maxFlushIterations: number = SCHEDULER_CONFIG.MAX_FLUSH_ITERATIONS;\n\n  /** Overflow callback */\n  onOverflow: ((droppedCount: number) => void) | null = null;\n\n  /** Bound run loop for microtask */\n  private readonly _boundRunLoop = this._runLoop.bind(this);\n\n  get phase(): SchedulerPhase {\n    if (this._isProcessing || this._isFlushingSync) return SchedulerPhase.FLUSHING;\n    if (this._isBatching) return SchedulerPhase.BATCHING;\n    return SchedulerPhase.IDLE;\n  }\n\n  get queueSize(): number {\n    return this._size;\n  }\n\n  get isBatching(): boolean {\n    return this._isBatching;\n  }\n\n  /**\n   * Schedules job.\n   */\n  schedule(callback: SchedulerJob): void {\n    if (IS_DEV) {\n      const isFn = typeof callback === 'function';\n      const isObj =\n        typeof callback === 'object' &&\n        callback !== null &&\n        typeof (callback as SchedulerJobObject).execute === 'function';\n      if (!isFn && !isObj) {\n        throw new SchedulerError(ERROR_MESSAGES.SCHEDULER_CALLBACK_MUST_BE_FUNCTION);\n      }\n    }\n\n    // Deduplicate job\n    if (callback._nextEpoch === this._epoch) return;\n    callback._nextEpoch = this._epoch;\n\n    if (this._isBatching || this._isFlushingSync) {\n      this._batchQueue[this._batchQueueSize++] = callback;\n      return;\n    }\n\n    // Push to current active buffer\n    this._queueBuffer[this._bufferIndex]![this._size++] = callback;\n\n    // Wake up if sleeping\n    if (!this._isProcessing) {\n      this._flush();\n    }\n  }\n\n  /**\n   * Triggers flush.\n   */\n  _flush(): void {\n    if (this._isProcessing || this._size === 0) return;\n    this._isProcessing = true;\n\n    queueMicrotask(this._boundRunLoop);\n  }\n\n  /**\n   * Scheduler loop.\n   */\n  private _runLoop(): void {\n    try {\n      if (this._size === 0) return;\n\n      const started = startFlush();\n      this._drainQueue();\n      if (started) endFlush();\n    } finally {\n      this._isProcessing = false;\n      // If new jobs arrived during flush (and not batching), re-schedule\n      if (this._size > 0 && !this._isBatching) {\n        this._flush();\n      }\n    }\n  }\n\n  _flushSync(): void {\n    this._isFlushingSync = true;\n    const started = startFlush();\n    try {\n      this._mergeBatchQueue();\n      this._drainQueue();\n    } finally {\n      this._isFlushingSync = false;\n      if (started) endFlush();\n    }\n  }\n\n  _mergeBatchQueue(): void {\n    if (this._batchQueueSize === 0) return;\n\n    // Increment epoch\n    const epoch = ++this._epoch;\n    const bQueue = this._batchQueue;\n    const targetBuffer = this._queueBuffer[this._bufferIndex]!;\n    let currentSize = this._size;\n\n    // Merge batch\n    bQueue.slice(0, this._batchQueueSize).forEach((job) => {\n      // Retag jobs\n      if (job._nextEpoch !== epoch) {\n        job._nextEpoch = epoch;\n        targetBuffer[currentSize++] = job;\n      }\n    });\n\n    this._size = currentSize;\n    this._batchQueueSize = 0;\n\n    // Resize batch queue\n    if (bQueue.length > SCHEDULER_CONFIG.BATCH_QUEUE_SHRINK_THRESHOLD) {\n      bQueue.length = 0;\n    }\n  }\n\n  _drainQueue(): void {\n    let iterations = 0;\n    // Process queue\n    while (this._size > 0) {\n      // Overflow check\n      if (++iterations > this._maxFlushIterations) {\n        this._handleFlushOverflow();\n        return;\n      }\n\n      this._processQueue();\n      // If batch updates happened during processing, merge them in now\n      this._mergeBatchQueue();\n    }\n  }\n\n  _processQueue(): void {\n    const idx = this._bufferIndex;\n    const jobs = this._queueBuffer[idx]!;\n    const count = this._size;\n\n    // Swap buffers\n    this._bufferIndex = idx ^ 1;\n    this._size = 0;\n    this._epoch++;\n\n    // Execute jobs\n    for (let i = 0; i < count; i++) {\n      try {\n        const job = jobs[i]!;\n        if (typeof job === 'function') job();\n        else job.execute();\n      } catch (e) {\n        console.error(new SchedulerError('Error occurred during scheduler execution', e as Error));\n      }\n    }\n    // Clear the consumed buffer\n    jobs.length = 0;\n  }\n\n  private _handleFlushOverflow(): void {\n    const droppedCount = this._size + this._batchQueueSize;\n    console.error(\n      new SchedulerError(\n        ERROR_MESSAGES.SCHEDULER_FLUSH_OVERFLOW(this._maxFlushIterations, droppedCount)\n      )\n    );\n    this._size = 0;\n    this._queueBuffer[this._bufferIndex]!.length = 0;\n    this._batchQueueSize = 0;\n\n    if (this.onOverflow) {\n      try {\n        this.onOverflow(droppedCount);\n      } catch {}\n    }\n  }\n\n  startBatch(): void {\n    this._batchDepth++;\n    this._isBatching = true;\n  }\n\n  endBatch(): void {\n    if (this._batchDepth === 0) {\n      if (IS_DEV) console.warn(ERROR_MESSAGES.SCHEDULER_END_BATCH_WITHOUT_START);\n      return;\n    }\n\n    if (--this._batchDepth === 0) {\n      this._flushSync();\n      this._isBatching = false;\n    }\n  }\n\n  setMaxFlushIterations(max: number): void {\n    if (max < SCHEDULER_CONFIG.MIN_FLUSH_ITERATIONS)\n      throw new SchedulerError(\n        `Max flush iterations must be at least ${SCHEDULER_CONFIG.MIN_FLUSH_ITERATIONS}`\n      );\n    this._maxFlushIterations = max;\n  }\n}\n\nexport const scheduler = new Scheduler();\n","/**\n * Brand symbols for reliable type identification.\n * Prevents false positives from duck-typing with external objects.\n */\nexport const ATOM_BRAND: unique symbol = Symbol.for('atom-effect/atom');\nexport const COMPUTED_BRAND: unique symbol = Symbol.for('atom-effect/computed');\nexport const EFFECT_BRAND: unique symbol = Symbol.for('atom-effect/effect');\n\n/**\n * Positive writable brand — only stamped on truly mutable atoms.\n * Allows future ReadonlyAtom / derived primitives to carry ATOM_BRAND\n * without being misidentified as writable by isWritable().\n */\nexport const WRITABLE_BRAND: unique symbol = Symbol.for('atom-effect/writable');\n","import type { Listener } from './tracking.types';\n\n/**\n * Global tracking context.\n */\nexport const trackingContext = {\n  /** Active listener. */\n  current: null as Listener | null,\n\n  /**\n   * Executes in context.\n   *\n   * @param listener - The subscriber.\n   * @param fn - The logic to execute.\n   * @returns The result of `fn`.\n   */\n  run<T>(listener: Listener, fn: () => T): T {\n    const prev = this.current;\n    this.current = listener;\n    try {\n      return fn();\n    } finally {\n      this.current = prev;\n    }\n  },\n};\n\n/**\n * Tracking context type.\n */\nexport type ITrackingContext = typeof trackingContext;\n","import { trackingContext } from './context';\n\n/**\n * Untracked execution.\n *\n * @param fn - Function to execute.\n * @returns Result of `fn`.\n */\nexport function untracked<T>(fn: () => T): T {\n  const prev = trackingContext.current;\n\n  // Skip if untracked\n  if (prev === null) return fn();\n\n  trackingContext.current = null;\n  try {\n    return fn();\n  } finally {\n    trackingContext.current = prev;\n  }\n}\n","import { ATOM_STATE_FLAGS } from '@/constants';\nimport { ReactiveNode } from '@/core/base';\nimport { nextVersion } from '@/internal/epoch';\nimport { scheduler } from '@/internal/scheduler';\nimport { ATOM_BRAND, WRITABLE_BRAND } from '@/symbols';\nimport { trackingContext } from '@/tracking';\nimport type { AtomOptions, WritableAtom } from '@/types';\nimport { debug } from '@/utils/debug';\n\n/**\n * Internal {@link WritableAtom} implementation.\n */\nclass AtomImpl<T> extends ReactiveNode<T> implements WritableAtom<T> {\n  private _value: T;\n  /** Old value for notifications */\n  private _pendingOldValue: T | undefined = undefined;\n\n  /** @internal */\n  readonly [ATOM_BRAND] = true;\n  /** @internal */\n  readonly [WRITABLE_BRAND] = true;\n\n  constructor(initialValue: T, sync: boolean) {\n    super();\n    this._value = initialValue;\n    if (sync) this.flags |= ATOM_STATE_FLAGS.SYNC;\n    debug.attachDebugInfo(this, 'atom', this.id);\n  }\n\n  get value(): T {\n    const context = trackingContext.current;\n    if (context != null) context.addDependency(this);\n    return this._value;\n  }\n\n  set value(newValue: T) {\n    const oldValue = this._value;\n    if (Object.is(oldValue, newValue)) return;\n\n    this._value = newValue;\n    this.version = nextVersion(this.version);\n\n    // 1. Check if notifications are needed\n    const slots = this._slots;\n    const flags = this.flags;\n    if (slots == null || slots.size === 0 || flags & ATOM_STATE_FLAGS.NOTIFICATION_SCHEDULED) {\n      return;\n    }\n\n    this._pendingOldValue = oldValue;\n    const nextFlags = flags | ATOM_STATE_FLAGS.NOTIFICATION_SCHEDULED;\n    this.flags = nextFlags;\n\n    // 2. Schedule or flush\n    if ((nextFlags & ATOM_STATE_FLAGS.SYNC) !== 0 && !scheduler.isBatching) {\n      this._flushNotifications();\n      return;\n    }\n\n    scheduler.schedule(this);\n  }\n\n  /**\n   * Executes scheduled notification.\n   * @internal\n   */\n  execute(): void {\n    this._flushNotifications();\n  }\n\n  /**\n   * Triggers subscribers.\n   */\n  private _flushNotifications(): void {\n    const flags = this.flags;\n    // Guard: Spurious flush or already disposed\n    if (!(flags & ATOM_STATE_FLAGS.NOTIFICATION_SCHEDULED) || flags & ATOM_STATE_FLAGS.DISPOSED) {\n      return;\n    }\n\n    const oldValue = this._pendingOldValue as T;\n    this._pendingOldValue = undefined;\n    this.flags &= ~ATOM_STATE_FLAGS.NOTIFICATION_SCHEDULED;\n\n    this._notifySubscribers(this._value, oldValue);\n  }\n\n  peek(): T {\n    return this._value;\n  }\n\n  dispose(): void {\n    if (this.flags & ATOM_STATE_FLAGS.DISPOSED) return;\n\n    this._slots?.clear();\n    this.flags |= ATOM_STATE_FLAGS.DISPOSED;\n    // Release references\n    this._value = undefined as T;\n    this._pendingOldValue = undefined;\n  }\n\n  protected override _deepDirtyCheck(): boolean {\n    return false;\n  }\n\n  [Symbol.dispose](): void {\n    this.dispose();\n  }\n}\n\n/**\n * Creates a reactive atom holding mutable state.\n *\n * @param initialValue - The initial value of the atom.\n * @param options - Configuration options (sync: boolean).\n */\nexport function atom<T>(initialValue: T, options: AtomOptions = {}): WritableAtom<T> {\n  return new AtomImpl(initialValue, options.sync ?? false);\n}\n","import { BITPACK } from '@/constants';\nimport type { DependencyLink } from '@/core/dep-tracking';\nimport type { Dependency } from '@/types';\nimport { SlotBuffer } from './slot-buffer';\n\n/**\n * Specialized inline-slot container for dependency tracking.\n *\n * Inherits from `SlotBuffer` to share the same zero-allocation inline\n * properties (`_s0`...`_s3`). Adds dependency-specific in-place updates,\n * truncation, and a hybrid O(1) Map fallback for mega-node performance.\n */\nexport class DepSlotBuffer extends SlotBuffer<DependencyLink> {\n  private _map: Map<Dependency, number> | null = null;\n  private readonly _SCAN_THRESHOLD = 32;\n\n  /**\n   * Indicates if the buffer contains at least one computed dependency.\n   */\n  hasComputeds = false;\n\n  /**\n   * Cached dependency version snapshot hash.\n   */\n  _depsHash = 0;\n\n  constructor() {\n    super();\n    // Initialize state-related fields explicitly for a stable V8 hidden class shape.\n    this._map = null;\n    this.hasComputeds = false;\n    this._depsHash = 0;\n  }\n\n  /**\n   * Resets tracking metadata for a new evaluation pass.\n   * Ensures 'hasComputeds' is clean.\n   */\n  prepareTracking(): void {\n    this.hasComputeds = false;\n  }\n\n  /**\n   * Protected hook called whenever a link is extracted from the buffer.\n   * Handles automatic unsubscription without closure allocation.\n   */\n  protected override _onItemRemoved(link: DependencyLink): void {\n    const unsub = link.unsub;\n    if (unsub) unsub();\n  }\n\n  /**\n   * Looks for an existing subscription to the given node starting from `trackIndex`.\n   * If found, swaps it to `trackIndex`, updates version, and returns true.\n   */\n  claimExisting(dep: Dependency, trackIndex: number): boolean {\n    const count = this._count;\n    if (trackIndex >= count) return false;\n\n    // 1. Hybrid O(1) Map Fallback for Mega-Nodes\n    const remaining = count - trackIndex;\n    if (this._map !== null || remaining > this._SCAN_THRESHOLD) {\n      return this._claimViaMap(dep, trackIndex);\n    }\n\n    // 2. Unrolled Fast Path for Inline Slots (0..3)\n    // Minimizes GetAt/SetAt overhead by accessing properties directly.\n    if (trackIndex < 4) {\n      // Slot 0\n      if (trackIndex <= 0) {\n        const l = this._s0;\n        if (l && l.node === dep && l.unsub) {\n          l.version = dep.version;\n          return true;\n        }\n      }\n      // Slot 1\n      if (trackIndex <= 1 && count > 1) {\n        const l = this._s1;\n        if (l && l.node === dep && l.unsub) {\n          l.version = dep.version;\n          if (trackIndex !== 1) {\n            const occ = this._s0;\n            this._s1 = occ;\n            this._s0 = l;\n          }\n          return true;\n        }\n      }\n      // Slot 2\n      if (trackIndex <= 2 && count > 2) {\n        const l = this._s2;\n        if (l && l.node === dep && l.unsub) {\n          l.version = dep.version;\n          if (trackIndex !== 2) {\n            this._swapInline(2, trackIndex, l);\n          }\n          return true;\n        }\n      }\n      // Slot 3\n      if (trackIndex <= 3 && count > 3) {\n        const l = this._s3;\n        if (l && l.node === dep && l.unsub) {\n          l.version = dep.version;\n          if (trackIndex !== 3) {\n            this._swapInline(3, trackIndex, l);\n          }\n          return true;\n        }\n      }\n    }\n\n    // 3. Sequential Scan for Overflow\n    const start = trackIndex > 4 ? trackIndex : 4;\n    const ov = this._overflow;\n    if (ov) {\n      for (let i = start - 4, len = ov.length; i < len; i++) {\n        const link = ov[i];\n        if (link && link.node === dep && link.unsub) {\n          link.version = dep.version;\n          this._swapGeneral(i + 4, trackIndex, link);\n          return true;\n        }\n      }\n    }\n\n    return false;\n  }\n\n  private _claimViaMap(dep: Dependency, trackIndex: number): boolean {\n    if (this._map === null) {\n      this._map = new Map();\n      const count = this._count;\n      for (let i = trackIndex; i < count; i++) {\n        const link = this.getAt(i);\n        if (link?.unsub) this._map.set(link.node, i);\n      }\n    }\n\n    const existingIndex = this._map.get(dep);\n    if (existingIndex === undefined || existingIndex < trackIndex) return false;\n\n    const link = this.getAt(existingIndex);\n    if (link == null || !link.unsub) return false;\n\n    link.version = dep.version;\n    if (existingIndex !== trackIndex) {\n      const occupant = this.getAt(trackIndex);\n      this.setAt(trackIndex, link);\n      this.setAt(existingIndex, occupant);\n      if (occupant?.unsub) this._map.set(occupant.node, existingIndex);\n      this._map.set(dep, trackIndex);\n    }\n    return true;\n  }\n\n  private _swapInline(idx: number, trackIndex: number, link: DependencyLink): void {\n    const occupant = this.getAt(trackIndex);\n    this.setAt(trackIndex, link);\n    this.setAt(idx, occupant);\n  }\n\n  private _swapGeneral(idx: number, trackIndex: number, link: DependencyLink): void {\n    if (idx === trackIndex) return;\n    const occupant = this.getAt(trackIndex);\n    this.setAt(trackIndex, link);\n    this.setAt(idx, occupant);\n  }\n\n  /**\n   * Inserts a new link at `trackIndex`, relocating the current occupant\n   * to the end of the buffer so it can be cleanly unsubscribed later by `truncateFrom`.\n   */\n  insertNew(trackIndex: number, link: DependencyLink): void {\n    const count = this._count;\n    if (trackIndex < count) {\n      const occupant = this.getAt(trackIndex);\n      if (occupant != null) {\n        this.add(occupant);\n        if (this._map !== null && occupant.unsub) {\n          this._map.set(occupant.node, this._count - 1);\n        }\n      }\n    }\n\n    if (trackIndex === 0) this._s0 = link;\n    else if (trackIndex === 1) this._s1 = link;\n    else if (trackIndex === 2) this._s2 = link;\n    else if (trackIndex === 3) this._s3 = link;\n    else this.setAt(trackIndex, link);\n\n    if (trackIndex >= count) {\n      this._count = trackIndex + 1;\n    }\n  }\n\n  /**\n   * Discards all links from the given index onwards.\n   * Unsubscribes each link before removing it.\n   */\n  truncateFrom(index: number): void {\n    if (index >= this._count) return;\n\n    super.truncateFrom(index);\n\n    if (this._map !== null) {\n      this._map.clear();\n      this._map = null;\n    }\n  }\n\n  /**\n   * Seals the buffer after a tracking pass completes.\n   * Computes the additive snapshot hash of all dependency versions.\n   */\n  seal(): void {\n    const count = this._count;\n    if (count <= 0) {\n      this._depsHash = 0;\n      return;\n    }\n\n    let hash = 0;\n    const vbits = BITPACK.VERSION_BITS;\n\n    const l0 = this._s0;\n    if (l0) hash = (hash + (l0.version << vbits) + l0.node.id) | 0;\n\n    if (count > 1) {\n      const l1 = this._s1;\n      if (l1) hash = (hash + (l1.version << vbits) + l1.node.id) | 0;\n    }\n    if (count > 2) {\n      const l2 = this._s2;\n      if (l2) hash = (hash + (l2.version << vbits) + l2.node.id) | 0;\n    }\n    if (count > 3) {\n      const l3 = this._s3;\n      if (l3) hash = (hash + (l3.version << vbits) + l3.node.id) | 0;\n\n      const ov = this._overflow;\n      if (ov) {\n        for (let i = 0, len = ov.length; i < len; i++) {\n          const l = ov[i];\n          if (l) hash = (hash + (l.version << vbits) + l.node.id) | 0;\n        }\n      }\n    }\n    this._depsHash = hash;\n  }\n\n  /**\n   * Efficient O(N) fast-path dirty check using the sealed version hash.\n   */\n  isDirtyFast(): boolean {\n    const count = this._count;\n    if (count <= 0) return false;\n\n    let hash = 0;\n    const vbits = BITPACK.VERSION_BITS;\n\n    // Flattened unrolling with node-destructuring for locality\n    const l0 = this._s0;\n    if (l0) {\n      const n = l0.node;\n      hash = (hash + (n.version << vbits) + n.id) | 0;\n    }\n\n    if (count > 1) {\n      const l = this._s1;\n      if (l) {\n        const n = l.node;\n        hash = (hash + (n.version << vbits) + n.id) | 0;\n      }\n    }\n    if (count > 2) {\n      const l = this._s2;\n      if (l) {\n        const n = l.node;\n        hash = (hash + (n.version << vbits) + n.id) | 0;\n      }\n    }\n    if (count > 3) {\n      const l = this._s3;\n      if (l) {\n        const n = l.node;\n        hash = (hash + (n.version << vbits) + n.id) | 0;\n      }\n\n      const ov = this._overflow;\n      if (ov) {\n        for (let i = 0, len = ov.length; i < len; i++) {\n          const l = ov[i];\n          if (l) {\n            const n = l.node;\n            hash = (hash + (n.version << vbits) + n.id) | 0;\n          }\n        }\n      }\n    }\n    return hash !== this._depsHash;\n  }\n\n  /**\n   * Captures a DJB2-based version snapshot for async drift detection.\n   */\n  captureVersionSnapshot(): number {\n    const count = this._count;\n    if (count <= 0) return 0;\n\n    let hash = 0;\n    const l0 = this._s0;\n    if (l0) hash = ((hash << 5) - hash + l0.node.version) | 0;\n\n    if (count > 1) {\n      const l1 = this._s1;\n      if (l1) hash = ((hash << 5) - hash + l1.node.version) | 0;\n    }\n    if (count > 2) {\n      const l2 = this._s2;\n      if (l2) hash = ((hash << 5) - hash + l2.node.version) | 0;\n    }\n    if (count > 3) {\n      const l3 = this._s3;\n      if (l3) hash = ((hash << 5) - hash + l3.node.version) | 0;\n\n      const ov = this._overflow;\n      if (ov) {\n        for (let i = 0, len = ov.length; i < len; i++) {\n          const l = ov[i];\n          if (l) hash = ((hash << 5) - hash + l.node.version) | 0;\n        }\n      }\n    }\n    return hash;\n  }\n\n  /** Unsubscribes from all links and resets the buffer. */\n  disposeAll(): void {\n    if (this._count > 0) {\n      this.truncateFrom(0);\n    }\n    this.hasComputeds = false;\n    if (this._map !== null) {\n      this._map.clear();\n      this._map = null;\n    }\n  }\n\n  /**\n   * [Safety Guard]\n   * remove() is strictly prohibited in DepSlotBuffer to preserve sequential cache paths.\n   */\n  override remove(_item: DependencyLink): boolean {\n    throw new Error(\n      'remove() is strictly prohibited in DepSlotBuffer to preserve sequential cache paths.'\n    );\n  }\n\n  /**\n   * [Safety Guard]\n   * Compaction is unnecessary since remove() is prohibited.\n   */\n  override compact(): void {\n    // No-op for DepSlotBuffer\n  }\n}\n","import { ATOM_BRAND, COMPUTED_BRAND, EFFECT_BRAND, WRITABLE_BRAND } from '@/symbols';\nimport type { ComputedAtom, EffectObject, ReadonlyAtom, WritableAtom } from '@/types';\n\n/**\n * Readonly atom check.\n *\n * @param obj - Object to check.\n */\nexport function isAtom(obj: unknown): obj is ReadonlyAtom {\n  return obj !== null && typeof obj === 'object' && ATOM_BRAND in obj;\n}\n\n/**\n * Writable atom check.\n *\n * Uses a dedicated positive brand instead of `!isComputed()` to remain\n * correct if new ReadonlyAtom-style primitives are added in the future.\n */\nexport function isWritable(obj: unknown): obj is WritableAtom {\n  return obj !== null && typeof obj === 'object' && WRITABLE_BRAND in obj;\n}\n\n/**\n * Computed atom check.\n */\nexport function isComputed(obj: unknown): obj is ComputedAtom {\n  return obj !== null && typeof obj === 'object' && COMPUTED_BRAND in obj;\n}\n\n/**\n * Effect object check.\n */\nexport function isEffect(obj: unknown): obj is EffectObject {\n  return obj !== null && typeof obj === 'object' && EFFECT_BRAND in obj;\n}\n\n/**\n * Promise check.\n */\nexport function isPromise<T>(value: unknown): value is Promise<T> {\n  return (\n    value !== null &&\n    typeof value === 'object' &&\n    typeof (value as { then?: unknown }).then === 'function'\n  );\n}\n","import {\n  AsyncState,\n  COMPUTED_CONFIG,\n  COMPUTED_STATE_FLAGS,\n  EMPTY_ERROR_ARRAY,\n  EPOCH_CONSTANTS,\n  IS_DEV,\n  SMI_MAX,\n} from '@/constants';\nimport { ReactiveNode } from '@/core/base';\nimport { DependencyLink } from '@/core/dep-tracking';\nimport { ComputedError } from '@/errors/errors';\nimport { ERROR_MESSAGES } from '@/errors/messages';\nimport { DepSlotBuffer } from '@/internal/dep-slot-buffer';\nimport { currentFlushEpoch, nextEpoch, nextVersion } from '@/internal/epoch';\nimport { ATOM_BRAND, COMPUTED_BRAND } from '@/symbols';\nimport { trackingContext } from '@/tracking';\nimport type {\n  AsyncStateType,\n  ComputedAtom,\n  ComputedOptions,\n  Dependency,\n  Subscriber,\n} from '@/types';\nimport { debug, NO_DEFAULT_VALUE } from '@/utils/debug';\nimport { wrapError } from '@/utils/error';\nimport { isPromise } from '@/utils/type-guards';\n\nconst {\n  IDLE,\n  DIRTY,\n  PENDING,\n  RESOLVED,\n  REJECTED,\n  HAS_ERROR,\n  RECOMPUTING,\n  DISPOSED,\n  IS_COMPUTED,\n  FORCE_COMPUTE,\n} = COMPUTED_STATE_FLAGS;\n\n/**\n * Computed atom implementation.\n */\nclass ComputedAtomImpl<T> extends ReactiveNode<T> implements ComputedAtom<T>, Subscriber {\n  /** @internal */\n  readonly [ATOM_BRAND] = true;\n  /** @internal */\n  readonly [COMPUTED_BRAND] = true;\n\n  private _value: T;\n  private _error: Error | null = null;\n  /** Promise tracking ID */\n  private _promiseId = 0;\n\n  private readonly _equal: (a: T, b: T) => boolean;\n  private readonly _fn: () => T | Promise<T>;\n  private readonly _defaultValue: T;\n  private readonly _onError: ((error: Error) => void) | null;\n  private readonly _maxAsyncRetries: number;\n\n  /** Initialized in constructor. Unified node property. */\n  _deps = new DepSlotBuffer();\n\n  // Async state\n  private _asyncStartAggregateVersion = 0;\n  private _asyncRetryCount = 0;\n  private _lastDriftEpoch: number = EPOCH_CONSTANTS.UNINITIALIZED;\n\n  // Dependency collection state\n  private _trackEpoch: number = EPOCH_CONSTANTS.UNINITIALIZED;\n  private _trackCount = 0;\n\n  constructor(fn: () => T | Promise<T>, options: ComputedOptions<T> = {}) {\n    if (typeof fn !== 'function') throw new ComputedError(ERROR_MESSAGES.COMPUTED_MUST_BE_FUNCTION);\n    super();\n\n    this._value = undefined as T;\n    // Start dirty so first access triggers computation\n    this.flags = IS_COMPUTED | DIRTY | IDLE;\n    this._equal = options.equal ?? Object.is;\n    this._fn = fn;\n    this._defaultValue = 'defaultValue' in options ? options.defaultValue : (NO_DEFAULT_VALUE as T);\n    this._onError = options.onError ?? null;\n    const retries = options.maxAsyncRetries;\n    this._maxAsyncRetries = (retries ?? COMPUTED_CONFIG.MAX_ASYNC_RETRIES) & SMI_MAX;\n\n    debug.attachDebugInfo(this, 'computed', this.id);\n\n    // Eager evaluation if not lazy\n    if (options.lazy === false) {\n      try {\n        this._recompute();\n      } catch {\n        /* _handleError already stored error and called onError */\n      }\n    }\n  }\n\n  private _track(): void {\n    trackingContext.current?.addDependency(this);\n  }\n\n  get value(): T {\n    this._track();\n\n    const flags = this.flags;\n    if ((flags & (RESOLVED | DIRTY | IDLE)) === RESOLVED) {\n      return this._value;\n    }\n\n    if (flags & DISPOSED) {\n      throw new ComputedError(ERROR_MESSAGES.COMPUTED_DISPOSED);\n    }\n\n    if (flags & RECOMPUTING) {\n      if (this._defaultValue !== (NO_DEFAULT_VALUE as T)) return this._defaultValue;\n      throw new ComputedError(ERROR_MESSAGES.COMPUTED_CIRCULAR_DEPENDENCY);\n    }\n\n    if (flags & (DIRTY | IDLE)) {\n      if (\n        (flags & IDLE) === 0 &&\n        (flags & FORCE_COMPUTE) === 0 &&\n        this._deps.size > 0 &&\n        !this._isDirty()\n      ) {\n        // Deps-stable skip: dependencies haven't changed, output remains the same\n        this.flags &= ~DIRTY;\n      } else {\n        this._recompute();\n      }\n      // Re-read flags after update\n      if (this.flags & RESOLVED) return this._value;\n    }\n\n    // 3. Async/Error handling\n    const def = this._defaultValue;\n    const hasDef = def !== (NO_DEFAULT_VALUE as T);\n\n    if (this.flags & PENDING) {\n      if (hasDef) return def;\n      throw new ComputedError(ERROR_MESSAGES.COMPUTED_ASYNC_PENDING_NO_DEFAULT);\n    }\n\n    if (this.flags & REJECTED) {\n      if (hasDef) return def;\n      throw this._error;\n    }\n\n    return this._value;\n  }\n\n  peek(): T {\n    return this._value;\n  }\n\n  get state(): AsyncStateType {\n    this._track();\n    const flags = this.flags;\n    if (flags & RESOLVED) return AsyncState.RESOLVED;\n    if (flags & PENDING) return AsyncState.PENDING;\n    if (flags & REJECTED) return AsyncState.REJECTED;\n    return AsyncState.IDLE;\n  }\n\n  get hasError(): boolean {\n    this._track();\n    const flags = this.flags;\n    if (flags & (REJECTED | HAS_ERROR)) return true;\n\n    const deps = this._deps;\n    const size = deps.size;\n    for (let i = 0; i < size; i++) {\n      const link = deps.getAt(i);\n      if (link != null && link.node.flags & HAS_ERROR) return true;\n    }\n    return false;\n  }\n\n  get isValid(): boolean {\n    return !this.hasError;\n  }\n\n  get errors(): readonly Error[] {\n    this._track();\n\n    // 1. Collect errors\n    const collected: Error[] = [];\n    if (this._error) collected.push(this._error);\n\n    const deps = this._deps;\n    const size = deps.size;\n    for (let i = 0; i < size; i++) {\n      const link = deps.getAt(i);\n      if (link == null) continue;\n\n      const dep = link.node;\n      if (dep.flags & HAS_ERROR) {\n        this._collectErrorsFromDep(dep as unknown as ComputedAtom<unknown>, collected);\n      }\n    }\n\n    return collected.length === 0 ? EMPTY_ERROR_ARRAY : Object.freeze(collected);\n  }\n\n  private _collectErrorsFromDep(computedDep: ComputedAtom<unknown>, collected: Error[]): void {\n    const errs = computedDep.errors;\n    const len = errs.length;\n    for (let j = 0; j < len; j++) {\n      const err = errs[j];\n      if (err != null && !collected.includes(err)) {\n        collected.push(err);\n      }\n    }\n  }\n\n  get lastError(): Error | null {\n    this._track();\n    return this._error;\n  }\n\n  get isPending(): boolean {\n    this._track();\n    return (this.flags & PENDING) !== 0;\n  }\n\n  get isResolved(): boolean {\n    this._track();\n    return (this.flags & RESOLVED) !== 0;\n  }\n\n  invalidate(): void {\n    this.flags |= FORCE_COMPUTE;\n    this._markDirty();\n  }\n\n  dispose(): void {\n    if (this.flags & DISPOSED) return;\n\n    this._deps.disposeAll();\n\n    this._slots?.clear();\n    this.flags = DISPOSED | DIRTY | IDLE;\n\n    // Release Memory\n    this._error = null;\n    this._value = undefined as T;\n    this._hotIndex = -1;\n  }\n\n  [Symbol.dispose](): void {\n    this.dispose();\n  }\n\n  addDependency(dep: Dependency): void {\n    if (dep._lastSeenEpoch === this._trackEpoch) return;\n    dep._lastSeenEpoch = this._trackEpoch;\n\n    const trackIndex = this._trackCount;\n    const existing = this._deps.getAt(trackIndex);\n\n    // 1. Stable Path: dependency index remains the same\n    if (existing != null && existing.node === dep) {\n      existing.version = dep.version;\n    }\n    // 2. Diverged Path: lookup or insert\n    else if (this._deps.claimExisting(dep, trackIndex)) {\n      // Version updated inside claimExisting\n    }\n    // 3. New dependency\n    else {\n      const link = new DependencyLink(dep, dep.version, dep.subscribe(this));\n      this._deps.insertNew(trackIndex, link);\n    }\n\n    if (dep.flags & IS_COMPUTED) {\n      this._deps.hasComputeds = true;\n    }\n    this._trackCount = trackIndex + 1;\n  }\n\n  private _recompute(): void {\n    if (this.flags & RECOMPUTING) return;\n    this.flags = (this.flags | RECOMPUTING) & ~FORCE_COMPUTE;\n\n    this._trackEpoch = nextEpoch();\n    this._trackCount = 0;\n    this._deps.prepareTracking();\n    this._hotIndex = -1;\n\n    let committed = false;\n    try {\n      // Execute function\n      const result = trackingContext.run(this, this._fn);\n\n      // Clean up any remaining trailing dependencies\n      this._deps.truncateFrom(this._trackCount);\n      this._deps.seal();\n      committed = true;\n\n      // Handle Result\n      if (isPromise(result)) {\n        this._handleAsyncComputation(result);\n      } else {\n        this._finalizeResolution(result);\n      }\n    } catch (e) {\n      // Commit dependencies on error gracefully\n      if (!committed) {\n        try {\n          this._deps.truncateFrom(this._trackCount);\n        } catch (commitErr) {\n          if (IS_DEV) {\n            console.warn('[atom-effect] _commitDeps failed during error recovery:', commitErr);\n          }\n        }\n      }\n      this._handleError(e as Error, ERROR_MESSAGES.COMPUTED_COMPUTATION_FAILED, true);\n    } finally {\n      // Reset transient state\n      this._trackEpoch = EPOCH_CONSTANTS.UNINITIALIZED;\n      this._trackCount = 0;\n      this.flags &= ~RECOMPUTING;\n    }\n  }\n\n  private _handleAsyncComputation(promise: Promise<T>): void {\n    // Set pending, clear idle/dirty/resolved/rejected\n    this.flags = (this.flags | PENDING) & ~(IDLE | DIRTY | RESOLVED | REJECTED);\n    // Notify pending\n    this._notifySubscribers(undefined, undefined);\n\n    this._asyncStartAggregateVersion = this._captureVersionSnapshot();\n    this._asyncRetryCount = 0;\n    // Invalidate old promises\n    this._promiseId = (this._promiseId + 1) % COMPUTED_CONFIG.MAX_PROMISE_ID;\n    const promiseId = this._promiseId;\n\n    promise.then(\n      (res) => {\n        if (promiseId !== this._promiseId) return; // Stale\n\n        if (this._captureVersionSnapshot() !== this._asyncStartAggregateVersion) {\n          // Reset retry counter when flush epoch changes — drifts across different\n          // scheduler flushes are independent bursts, not a continuous failure streak.\n          const epoch = currentFlushEpoch();\n          if (this._lastDriftEpoch !== epoch) {\n            this._lastDriftEpoch = epoch;\n            this._asyncRetryCount = 0;\n          }\n          if (this._asyncRetryCount++ < this._maxAsyncRetries) {\n            return this._markDirty(); // Retry\n          }\n          return this._handleError(\n            new ComputedError(\n              `Async drift threshold exceeded after ${this._maxAsyncRetries} retries.`\n            ),\n            ERROR_MESSAGES.COMPUTED_ASYNC_COMPUTATION_FAILED\n          );\n        }\n\n        this._finalizeResolution(res);\n        this._notifySubscribers(res, undefined);\n      },\n      (err) =>\n        promiseId === this._promiseId &&\n        this._handleError(err, ERROR_MESSAGES.COMPUTED_ASYNC_COMPUTATION_FAILED)\n    );\n  }\n\n  private _captureVersionSnapshot(): number {\n    return this._deps.captureVersionSnapshot();\n  }\n\n  private _handleError(err: unknown, msg: string, throwErr = false): void {\n    const error = wrapError(err, ComputedError, msg);\n\n    if (!throwErr && !(this.flags & REJECTED)) {\n      this.version = nextVersion(this.version);\n    }\n\n    this._error = error;\n    // Set rejected + has_error, clear idle/dirty/pending/resolved\n    this.flags = (this.flags & ~(IDLE | DIRTY | PENDING | RESOLVED)) | REJECTED | HAS_ERROR;\n\n    if (this._onError) {\n      try {\n        this._onError(error);\n      } catch (e) {\n        console.error(ERROR_MESSAGES.CALLBACK_ERROR_IN_ERROR_HANDLER, e);\n      }\n    }\n\n    if (throwErr) throw error;\n    this._notifySubscribers(undefined, undefined);\n  }\n\n  private _finalizeResolution(value: T): void {\n    // Only bump version if value actually changed or first resolve\n    if (!(this.flags & RESOLVED) || !this._equal(this._value, value)) {\n      this.version = nextVersion(this.version);\n    }\n\n    this._value = value;\n    this._error = null;\n    // Set resolved, clear idle/dirty/pending/rejected/has_error\n    this.flags = (this.flags | RESOLVED) & ~(IDLE | DIRTY | PENDING | REJECTED | HAS_ERROR);\n  }\n\n  execute(): void {\n    // Subscriber implementation\n    this._markDirty();\n  }\n\n  /** @internal */\n  _markDirty(): void {\n    if (this.flags & (RECOMPUTING | DIRTY)) return;\n    this.flags |= DIRTY;\n    this._notifySubscribers(undefined, undefined);\n  }\n\n  /**\n   * Deep dirty check for computations.\n   */\n  protected override _deepDirtyCheck(): boolean {\n    const deps = this._deps;\n    const prevContext = trackingContext.current;\n    trackingContext.current = null;\n\n    try {\n      const size = deps.size;\n      for (let i = 0; i < size; i++) {\n        const link = deps.getAt(i);\n        if (link == null) continue;\n\n        const dep = link.node;\n        if (dep.flags & IS_COMPUTED) {\n          try {\n            // Force computed to re-evaluate so version reflects latest state\n            void (dep as { value: unknown }).value;\n          } catch {\n            if (IS_DEV)\n              console.warn(`[atom-effect] Dependency #${dep.id} threw during dirty check`);\n          }\n        }\n\n        if (dep.version !== link.version) {\n          this._hotIndex = i;\n          return true;\n        }\n      }\n\n      this._hotIndex = -1;\n      return false;\n    } finally {\n      trackingContext.current = prevContext;\n    }\n  }\n}\n\n/**\n * Creates a computed value.\n * @param fn - Computation function\n * @param options - Options object\n */\nexport function computed<T>(fn: () => T, options?: ComputedOptions<T>): ComputedAtom<T>;\nexport function computed<T>(\n  fn: () => Promise<T>,\n  options: ComputedOptions<T> & { defaultValue: T }\n): ComputedAtom<T>;\nexport function computed<T>(\n  fn: () => T | Promise<T>,\n  options: ComputedOptions<T> = {}\n): ComputedAtom<T> {\n  return new ComputedAtomImpl(fn, options);\n}\n","import {\n  COMPUTED_STATE_FLAGS,\n  DEBUG_CONFIG,\n  EFFECT_STATE_FLAGS,\n  EPOCH_CONSTANTS,\n  IS_DEV,\n  SCHEDULER_CONFIG,\n} from '@/constants';\nimport { ReactiveNode } from '@/core/base';\nimport { DependencyLink } from '@/core/dep-tracking';\nimport { EffectError } from '@/errors/errors';\nimport { ERROR_MESSAGES } from '@/errors/messages';\nimport { DepSlotBuffer } from '@/internal/dep-slot-buffer';\nimport {\n  currentFlushEpoch,\n  flushExecutionCount,\n  incrementFlushExecutionCount,\n  nextEpoch,\n} from '@/internal/epoch';\nimport { scheduler } from '@/internal/scheduler';\nimport { EFFECT_BRAND } from '@/symbols';\nimport { type DependencyTracker, trackingContext } from '@/tracking';\nimport type { Dependency, EffectFunction, EffectObject, EffectOptions } from '@/types';\nimport { debug } from '@/utils/debug';\nimport { wrapError } from '@/utils/error';\nimport { isPromise } from '@/utils/type-guards';\n\n/**\n * Effect implementation.\n */\nclass EffectImpl extends ReactiveNode<void> implements EffectObject, DependencyTracker {\n  /** @internal */\n  readonly [EFFECT_BRAND] = true;\n\n  private _cleanup: (() => void) | null = null;\n  /** Initialized in constructor to maintain God Class object shape */\n  _deps = new DepSlotBuffer();\n\n  /** Pre-allocated notify callback shared by all subscriptions */\n  private readonly _notifyCallback: () => void;\n\n  private readonly _onError: ((error: unknown) => void) | null;\n\n  // Cycle detection\n  private _currentEpoch: number = EPOCH_CONSTANTS.UNINITIALIZED;\n  private _lastFlushEpoch: number = EPOCH_CONSTANTS.UNINITIALIZED;\n  private _executionsInEpoch = 0;\n\n  private readonly _fn: EffectFunction;\n  private readonly _sync: boolean;\n  private readonly _maxExecutions: number;\n  private readonly _maxExecutionsPerFlush: number;\n  // Frequency tracking (Dev)\n  private _executionCount = 0;\n  private _windowStart = 0;\n  private _windowCount = 0;\n  private _execId = 0;\n  private _trackCount = 0;\n\n  constructor(fn: EffectFunction, options: EffectOptions = {}) {\n    super();\n    this._fn = fn;\n    this._onError = options.onError ?? null;\n    this._sync = options.sync ?? false;\n    this._maxExecutions =\n      options.maxExecutionsPerSecond ?? SCHEDULER_CONFIG.MAX_EXECUTIONS_PER_SECOND;\n    this._maxExecutionsPerFlush =\n      options.maxExecutionsPerFlush ?? SCHEDULER_CONFIG.MAX_EXECUTIONS_PER_EFFECT;\n    // Pre-allocate callbacks once — eliminates per-dependency closure allocation\n    if (this._sync) {\n      this._notifyCallback = () => this.execute();\n    } else {\n      this._notifyCallback = () => scheduler.schedule(this);\n    }\n\n    debug.attachDebugInfo(this, 'effect', this.id);\n  }\n\n  public run(): void {\n    if (this.flags & EFFECT_STATE_FLAGS.DISPOSED) {\n      throw new EffectError(ERROR_MESSAGES.EFFECT_DISPOSED);\n    }\n    this.execute(true);\n  }\n\n  public dispose(): void {\n    if (this.flags & EFFECT_STATE_FLAGS.DISPOSED) return;\n    this.flags |= EFFECT_STATE_FLAGS.DISPOSED;\n\n    this._execCleanup();\n    this._deps?.disposeAll();\n  }\n\n  [Symbol.dispose](): void {\n    this.dispose();\n  }\n\n  public addDependency(dep: Dependency): void {\n    if (!(this.flags & EFFECT_STATE_FLAGS.EXECUTING)) return;\n\n    const startEpoch = this._currentEpoch;\n    if (dep._lastSeenEpoch === startEpoch) return;\n    dep._lastSeenEpoch = startEpoch;\n\n    const trackIndex = this._trackCount;\n    const deps = this._deps!;\n    const existing = deps.getAt(trackIndex);\n\n    // 1. Stable Path: dependency index remains the same\n    if (existing != null && existing.node === dep) {\n      existing.version = dep.version;\n    }\n    // 2. Diverged Path: lookup or insert\n    else if (deps.claimExisting(dep, trackIndex)) {\n      // Version updated in claimExisting\n    }\n    // 3. New dependency\n    else {\n      this._insertNewDependency(dep, trackIndex);\n    }\n\n    if (dep.flags & COMPUTED_STATE_FLAGS.IS_COMPUTED) {\n      deps.hasComputeds = true;\n    }\n    this._trackCount = trackIndex + 1;\n  }\n\n  private _insertNewDependency(dep: Dependency, trackIndex: number): void {\n    let link: DependencyLink;\n    try {\n      const unsubscribe = dep.subscribe(this._notifyCallback);\n      link = new DependencyLink(dep, dep.version, unsubscribe);\n    } catch (error) {\n      const wrapped = wrapError(error, EffectError, ERROR_MESSAGES.EFFECT_EXECUTION_FAILED);\n      console.error(wrapped);\n      if (this._onError) {\n        try {\n          this._onError(wrapped);\n        } catch {}\n      }\n      link = new DependencyLink(dep, dep.version, undefined);\n    }\n\n    this._deps!.insertNew(trackIndex, link);\n  }\n\n  /**\n   * Executes effect with tracking.\n   */\n  public execute(force = false): void {\n    if (this.flags & (EFFECT_STATE_FLAGS.DISPOSED | EFFECT_STATE_FLAGS.EXECUTING)) return;\n\n    // Skip if not dirty\n    const deps = this._deps!;\n    if (!force && deps.size > 0 && !this._isDirty()) return;\n\n    this._checkInfiniteLoops();\n\n    this.flags |= EFFECT_STATE_FLAGS.EXECUTING;\n    this._execCleanup();\n\n    this._currentEpoch = nextEpoch();\n    this._trackCount = 0;\n    deps.prepareTracking();\n    this._hotIndex = -1;\n\n    let committed = false;\n    try {\n      const result = trackingContext.run(this, this._fn);\n\n      // Clean up any remaining trailing dependencies\n      deps.truncateFrom(this._trackCount);\n      deps.seal();\n      committed = true;\n\n      // Handle result\n      if (isPromise(result)) {\n        this._handleAsyncResult(result);\n      } else {\n        this._cleanup = typeof result === 'function' ? result : null;\n      }\n    } catch (error) {\n      // Commit on error gracefully to maintain state for recovery\n      if (!committed) {\n        try {\n          deps.truncateFrom(this._trackCount);\n        } catch (commitErr) {\n          if (IS_DEV) {\n            console.warn('[atom-effect] _commitDeps failed during error recovery:', commitErr);\n          }\n        }\n      }\n      this._handleExecutionError(error);\n      this._cleanup = null;\n    } finally {\n      this.flags &= ~EFFECT_STATE_FLAGS.EXECUTING;\n    }\n  }\n\n  private _handleAsyncResult(promise: Promise<unknown>): void {\n    const execId = ++this._execId;\n    promise.then(\n      (cleanup) => {\n        // Guard against race conditions (new execution or disposal happened)\n        if (execId !== this._execId || this.flags & EFFECT_STATE_FLAGS.DISPOSED) {\n          if (typeof cleanup === 'function') {\n            try {\n              cleanup();\n            } catch (e) {\n              this._handleExecutionError(e, ERROR_MESSAGES.EFFECT_CLEANUP_FAILED);\n            }\n          }\n          return;\n        }\n        if (typeof cleanup === 'function') this._cleanup = cleanup as () => void;\n      },\n      (err) => execId === this._execId && this._handleExecutionError(err)\n    );\n  }\n\n  protected override _deepDirtyCheck(): boolean {\n    const prevContext = trackingContext.current;\n    trackingContext.current = null;\n    const deps = this._deps!;\n\n    try {\n      const size = deps.size;\n      for (let i = 0; i < size; i++) {\n        const link = deps.getAt(i);\n        if (link == null) continue;\n\n        const dep = link.node;\n        if (dep.flags & COMPUTED_STATE_FLAGS.IS_COMPUTED) {\n          this._tryPullComputed(dep);\n        }\n\n        if (dep.version !== link.version) {\n          this._hotIndex = i;\n          return true;\n        }\n      }\n      return false;\n    } finally {\n      trackingContext.current = prevContext;\n    }\n  }\n\n  private _tryPullComputed(dep: Dependency): void {\n    try {\n      // Force computed to re-evaluate so version reflects latest state\n      void (dep as { value: unknown }).value;\n    } catch {\n      if (IS_DEV) {\n        console.warn(`[atom-effect] Dependency #${dep.id} threw during dirty check`);\n      }\n    }\n  }\n\n  private _execCleanup(): void {\n    if (!this._cleanup) return;\n    try {\n      this._cleanup();\n    } catch (error) {\n      this._handleExecutionError(error, ERROR_MESSAGES.EFFECT_CLEANUP_FAILED);\n    }\n    this._cleanup = null;\n  }\n\n  private _checkInfiniteLoops(): void {\n    const epoch = currentFlushEpoch();\n    if (this._lastFlushEpoch !== epoch) {\n      this._lastFlushEpoch = epoch;\n      this._executionsInEpoch = 0;\n    }\n\n    const executions = ++this._executionsInEpoch;\n    if (executions > this._maxExecutionsPerFlush) this._throwInfiniteLoopError('per-effect');\n\n    const globalExecutions = incrementFlushExecutionCount();\n    if (globalExecutions > SCHEDULER_CONFIG.MAX_EXECUTIONS_PER_FLUSH) {\n      this._throwInfiniteLoopError('global');\n    }\n\n    this._executionCount++;\n\n    if (IS_DEV) this._checkFrequencyLimit();\n  }\n\n  private _checkFrequencyLimit(): void {\n    if (!Number.isFinite(this._maxExecutions)) return;\n\n    const now = Date.now();\n    if (now - this._windowStart >= DEBUG_CONFIG.EFFECT_FREQUENCY_WINDOW) {\n      this._windowStart = now;\n      this._windowCount = 1;\n      return;\n    }\n\n    if (++this._windowCount > this._maxExecutions) {\n      const err = new EffectError(ERROR_MESSAGES.EFFECT_FREQUENCY_LIMIT_EXCEEDED);\n      this.dispose();\n      this._handleExecutionError(err);\n      throw err;\n    }\n  }\n\n  get isDisposed(): boolean {\n    return (this.flags & EFFECT_STATE_FLAGS.DISPOSED) !== 0;\n  }\n  get executionCount(): number {\n    return this._executionCount;\n  }\n  get isExecuting(): boolean {\n    return (this.flags & EFFECT_STATE_FLAGS.EXECUTING) !== 0;\n  }\n\n  private _throwInfiniteLoopError(type: 'per-effect' | 'global'): never {\n    const error = new EffectError(\n      `Infinite loop detected (${type}): effect executed ${this._executionsInEpoch} times in current flush. Total executions in flush: ${flushExecutionCount}`\n    );\n    this.dispose();\n    console.error(error);\n    throw error;\n  }\n\n  private _handleExecutionError(\n    error: unknown,\n    message: string = ERROR_MESSAGES.EFFECT_EXECUTION_FAILED\n  ): void {\n    const errorObj = wrapError(error, EffectError, message);\n    console.error(errorObj);\n    if (this._onError) {\n      try {\n        this._onError(errorObj);\n      } catch (e) {\n        console.error(wrapError(e, EffectError, ERROR_MESSAGES.CALLBACK_ERROR_IN_ERROR_HANDLER));\n      }\n    }\n  }\n}\n\n/**\n * Creates and starts an effect.\n *\n * @param fn - Effect function.\n * @param options - Configuration options.\n * @returns Effect instance.\n */\nexport function effect(fn: EffectFunction, options: EffectOptions = {}): EffectObject {\n  if (typeof fn !== 'function') {\n    throw new EffectError(ERROR_MESSAGES.EFFECT_MUST_BE_FUNCTION);\n  }\n\n  const effectInstance = new EffectImpl(fn, options);\n  effectInstance.execute();\n\n  return effectInstance;\n}\n","import { ERROR_MESSAGES } from '@/errors/messages';\nimport { scheduler } from './scheduler';\n\n/**\n * Batches updates.\n *\n * @param fn - Batch function.\n * @returns - Result of `fn`.\n */\nexport function batch<T>(fn: () => T): T {\n  // Validate callback\n  if (typeof fn !== 'function') {\n    throw new TypeError(ERROR_MESSAGES.BATCH_CALLBACK_MUST_BE_FUNCTION);\n  }\n\n  scheduler.startBatch();\n  try {\n    return fn();\n  } finally {\n    scheduler.endBatch();\n  }\n}\n"],"mappings":"AAGA,IAAa,IAAa;AAAA,EACxB,MAAM;AAAA,EACN,SAAS;AAAA,EACT,UAAU;AAAA,EACV,UAAU;GAMC,IAAqB;AAAA,EAChC,UAAU;AAAA,EACV,WAAW;GAMA,IAAuB;AAAA,EAClC,UAAU;AAAA,EAEV,aAAa;AAAA,EACb,OAAO;AAAA,EACP,MAAM;AAAA,EACN,SAAS;AAAA,EACT,UAAU;AAAA,EACV,UAAU;AAAA,EACV,aAAa;AAAA,EACb,WAAW;AAAA,EAEX,eAAe;GAMJ,IAAmB;AAAA,EAC9B,UAAU;AAAA,EACV,MAAM;AAAA,EACN,wBAAwB;GAMb,IAAmB;AAAA,EAE9B,2BAA2B;AAAA,EAC3B,2BAA2B;AAAA,EAG3B,0BAA0B;AAAA,EAC1B,sBAAsB;AAAA,EACtB,sBAAsB;AAAA,EAGtB,8BAA8B;GAMnB,IAAe;AAAA,EAC1B,oBAAoB;AAAA,EACpB,yBAAyB;GAMd,IAAkB;AAAA,EAC7B,mBAAmB;AAAA,EACnB,gBAAgB,OAAO,mBAAmB;GAM/B,IAAkB;AAAA,EAE7B,eAAe;AAAA,EAEf,KAAK;GAMM,IAAU,YAMV,IAAU,EAErB,cAAc,GAAA,GAMH,MACV,OAAO,UAAY,OAAe,QAAQ,KACR,KAKxB,KAAsC,OAAO,OAAO,CAAA,CAAE,GC1GtD,IAAb,MAA4B;AAAA,EAG1B,YACE,GACA,GACA,IAAkC,QAClC;AAHO,SAAA,OAAA,GACA,KAAA,UAAA,GAIP,KAAK,QAAQ;AAAA;GAOJ,KAAb,MAA6B;AAAA,EAI3B,YAAY,GAAwD,GAA6B;AAE/F,SAAK,KAAK,GACV,KAAK,MAAM;AAAA;EAGb,OAAO,GAAc,GAAoB;AACvC,IAAI,KAAK,KAAI,KAAK,GAAG,GAAU,CAAA,IACtB,KAAK,OAAK,KAAK,IAAI,QAAA;AAAA;GC/BnB,IAAb,cAA+B,MAAM;AAAA,EACnC,YACE,GACA,IAA6B,MAC7B,IAAqB,IACrB;AACA,UAAM,CAAA,GAHC,KAAA,QAAA,GACA,KAAA,cAAA,GAGP,KAAK,OAAO;AAAA;GAKH,IAAb,cAAmC,EAAU;AAAA,EAC3C,YAAY,GAAiB,IAAsB,MAAM;AACvD,UAAM,GAAS,GAAO,EAAA,GACtB,KAAK,OAAO;AAAA;GAKH,IAAb,cAAiC,EAAU;AAAA,EACzC,YAAY,GAAiB,IAAsB,MAAM;AACvD,UAAM,GAAS,GAAO,EAAA,GACtB,KAAK,OAAO;AAAA;GAKH,IAAb,cAAoC,EAAU;AAAA,EAC5C,YAAY,GAAiB,IAAsB,MAAM;AACvD,UAAM,GAAS,GAAO,EAAA,GACtB,KAAK,OAAO;AAAA;GC/BH,IAAiB;AAAA,EAE5B,2BAA2B;AAAA,EAC3B,mCAAmC;AAAA,EACnC,6BAA6B;AAAA,EAC7B,mCAAmC;AAAA,EACnC,8BAA8B;AAAA,EAC9B,mBAAmB;AAAA,EAGnB,kCAAkC;AAAA,EAClC,mCAAmC;AAAA,EAGnC,yBAAyB;AAAA,EACzB,yBAAyB;AAAA,EACzB,uBAAuB;AAAA,EACvB,iBAAiB;AAAA,EAGjB,0BAAA,CAA2B,GAAa,MACtC,6BAA6B,CAAA,eAAkB,CAAA;AAAA,EAGjD,iCAAiC;AAAA,EAGjC,iCACE;AAAA,EAEF,qCAAqC;AAAA,EACrC,mCAAmC;AAAA,EACnC,iCAAiC;GCftB,KAAb,MAA2B;AAAA;eAGT,iBACA,iBACA,iBACA,oBAIP,iBAGQ,EAAgB,gCAGA;AAAA;EAKjC,IAAI,OAAe;AACjB,WAAO,KAAK;AAAA;EAId,MAAM,GAAyB;AAC7B,QAAI,MAAU,EAAG,QAAO,KAAK;AAC7B,QAAI,MAAU,EAAG,QAAO,KAAK;AAC7B,QAAI,MAAU,EAAG,QAAO,KAAK;AAC7B,QAAI,MAAU,EAAG,QAAO,KAAK;AAE7B,UAAM,IAAK,KAAK;AAChB,QAAI,MAAO,QAAQ,KAAS,GAAG;AAC7B,YAAM,IAAQ,IAAQ;AACtB,UAAI,IAAQ,EAAG,OAAQ,QAAO,EAAG,CAAA,KAAU;AAAA;AAE7C,WAAO;AAAA;EAIT,MAAM,GAAe,GAAsB;AACzC,QAAI,MAAU,EACZ,MAAK,MAAM;AAAA,aACF,MAAU,EACnB,MAAK,MAAM;AAAA,aACF,MAAU,EACnB,MAAK,MAAM;AAAA,aACF,MAAU,EACnB,MAAK,MAAM;AAAA,SACN;AACL,WAAK,cAAc,CAAA;AACnB,YAAM,IAAK,KAAK;AAChB,MAAA,EAAG,IAAQ,CAAA,IAAK;AAAA;AAGlB,IAAI,KAAS,KAAK,WAChB,KAAK,SAAS,IAAQ;AAAA;EAQ1B,aAAa,GAAqB;AAChC,UAAM,IAAQ,KAAK;AACnB,QAAI,KAAS,EAAO;AAGpB,QAAI,KAAS,GAAG;AACd,YAAM,IAAI,KAAK;AACf,MAAI,KAAK,SACP,KAAK,eAAe,CAAA,GACpB,KAAK,MAAM;AAAA;AAGf,QAAI,KAAS,GAAG;AACd,YAAM,IAAI,KAAK;AACf,MAAI,KAAK,SACP,KAAK,eAAe,CAAA,GACpB,KAAK,MAAM;AAAA;AAGf,QAAI,KAAS,GAAG;AACd,YAAM,IAAI,KAAK;AACf,MAAI,KAAK,SACP,KAAK,eAAe,CAAA,GACpB,KAAK,MAAM;AAAA;AAGf,QAAI,KAAS,GAAG;AACd,YAAM,IAAI,KAAK;AACf,MAAI,KAAK,SACP,KAAK,eAAe,CAAA,GACpB,KAAK,MAAM;AAAA;AAKf,UAAM,IAAK,KAAK;AAChB,QAAI,MAAO,QAAQ,IAAQ,GAAG;AAC5B,YAAM,IAAW,IAAQ,IAAI,IAAQ,IAAI,GACnC,IAAM,EAAG;AACf,eAAS,IAAI,GAAU,IAAI,GAAK,KAAK;AACnC,cAAM,IAAO,EAAG,CAAA;AAChB,QAAI,KAAQ,SACV,KAAK,eAAe,CAAA,GACpB,EAAG,CAAA,IAAK;AAAA;AAIZ,MAAI,KAAS,KACX,EAAG,SAAS,GACZ,KAAK,YAAY,QAEjB,EAAG,SAAS,IAAQ;AAAA;AAIxB,SAAK,SAAS;AAAA;EAQhB,eAAyB,GAAgB;AAAA,EAAA;AAAA,EAUzC,IAAI,GAAe;AAEjB,QAAI,KAAK,QAAQ,MAAM;AACrB,WAAK,MAAM,GACX,KAAK;AACL;AAAA;AAEF,QAAI,KAAK,QAAQ,MAAM;AACrB,WAAK,MAAM,GACX,KAAK;AACL;AAAA;AAEF,QAAI,KAAK,QAAQ,MAAM;AACrB,WAAK,MAAM,GACX,KAAK;AACL;AAAA;AAEF,QAAI,KAAK,QAAQ,MAAM;AACrB,WAAK,MAAM,GACX,KAAK;AACL;AAAA;AAIF,QAAI,KAAK,cAAc,KACrB,MAAK,YAAY,CAAC,CAAA;AAAA,SACb;AAEL,YAAM,IAAK,KAAK;AAChB,eAAS,IAAI,GAAG,IAAM,EAAG,QAAQ,IAAI,GAAK,IACxC,KAAI,EAAG,CAAA,MAAO,MAAM;AAClB,QAAA,EAAG,CAAA,IAAK,GACR,KAAK;AACL;AAAA;AAGJ,MAAA,EAAG,KAAK,CAAA;AAAA;AAEV,SAAK;AAAA;EAWP,OAAO,GAAkB;AACvB,QAAI,KAAK,QAAQ;AACf,kBAAK,MAAM,MACX,KAAK,UACE;AAET,QAAI,KAAK,QAAQ;AACf,kBAAK,MAAM,MACX,KAAK,UACE;AAET,QAAI,KAAK,QAAQ;AACf,kBAAK,MAAM,MACX,KAAK,UACE;AAET,QAAI,KAAK,QAAQ;AACf,kBAAK,MAAM,MACX,KAAK,UACE;AAGT,UAAM,IAAK,KAAK;AAChB,QAAI,KAAM,KAAM,QAAO;AAEvB,aAAS,IAAI,GAAG,IAAM,EAAG,QAAQ,IAAI,GAAK,IACxC,KAAI,EAAG,CAAA,MAAO;AACZ,aAAA,EAAG,CAAA,IAAK,MACR,KAAK,UACE;AAGX,WAAO;AAAA;EAMT,IAAI,GAAkB;AACpB,UAAM,IAAQ,KAAK;AACnB,QAAI,MAAU,EAAG,QAAO;AAGxB,QAAI,KAAK,QAAQ,KAAQ,KAAK,QAAQ,KAAQ,KAAK,QAAQ,KAAQ,KAAK,QAAQ,EAC9E,QAAO;AAIT,QAAI,KAAS,EAAG,QAAO;AAGvB,UAAM,IAAK,KAAK;AAChB,QAAI,KAAM,MAAM;AACd,UAAI,IAAY;AAChB,MAAI,KAAK,OAAO,QAAM,KAClB,KAAK,OAAO,QAAM,KAClB,KAAK,OAAO,QAAM,KAClB,KAAK,OAAO,QAAM;AAEtB,eAAS,IAAI,GAAG,IAAM,EAAG,QAAQ,IAAI,GAAK,KAAK;AAC7C,cAAM,IAAK,EAAG,CAAA;AACd,YAAI,KAAM,MAAM;AACd,cAAI,MAAO,EAAM,QAAO;AACxB,cAAI,EAAE,MAAc,EAAO;AAAA;;;AAIjC,WAAO;AAAA;EAUT,QAAQ,GAA6B;AACnC,UAAM,IAAQ,KAAK;AACnB,QAAI,MAAU,EAAG;AAGjB,UAAM,IAAK,KAAK;AAChB,IAAI,KAAM,QAAM,EAAG,CAAA;AACnB,UAAM,IAAK,KAAK;AAChB,IAAI,KAAM,QAAM,EAAG,CAAA;AACnB,UAAM,IAAK,KAAK;AAChB,IAAI,KAAM,QAAM,EAAG,CAAA;AACnB,UAAM,IAAK,KAAK;AAIhB,QAHI,KAAM,QAAM,EAAG,CAAA,GAGf,KAAS,EAAG;AAGhB,UAAM,IAAK,KAAK;AAChB,QAAI,KAAM,MAAM;AACd,UAAI,IAAY;AAChB,MAAI,KAAM,QAAM,KACZ,KAAM,QAAM,KACZ,KAAM,QAAM,KACZ,KAAM,QAAM;AAEhB,eAAS,IAAI,GAAG,IAAM,EAAG,QAAQ,IAAI,GAAK,KAAK;AAC7C,cAAM,IAAK,EAAG,CAAA;AACd,YAAI,KAAM,SACR,EAAG,CAAA,GACC,EAAE,MAAc;AAAO;AAAA;;;EAYnC,eAAe,GAA+B;AAC5C,UAAM,IAAQ,KAAK;AACnB,QAAI,MAAU,EAAG,QAAO;AAGxB,QAAI,IAAW;AACf,UAAM,IAAK,KAAK;AAChB,IAAI,KAAM,SACR,EAAG,CAAA,GACH;AAEF,UAAM,IAAK,KAAK;AAChB,IAAI,KAAM,SACR,EAAG,CAAA,GACH;AAEF,UAAM,IAAK,KAAK;AAChB,IAAI,KAAM,SACR,EAAG,CAAA,GACH;AAEF,UAAM,IAAK,KAAK;AAOhB,QANI,KAAM,SACR,EAAG,CAAA,GACH,MAIE,KAAS,KAAK,MAAa,EAAO,QAAO;AAG7C,UAAM,IAAK,KAAK;AAChB,QAAI,KAAM,KACR,UAAS,IAAI,GAAG,IAAM,EAAG,QAAQ,IAAI,GAAK,KAAK;AAC7C,YAAM,IAAK,EAAG,CAAA;AACd,UAAI,KAAM,SACR,EAAG,CAAA,GACC,EAAE,MAAa;AAAO;AAAA;AAIhC,WAAO;AAAA;EAST,UAAgB;AACd,UAAM,IAAK,KAAK;AAChB,QAAI,MAAO,QAAQ,EAAG,WAAW,EAAG;AAGpC,QAAI,IAAI;AACR,WAAO,IAAI,EAAG,SACZ,KAAI,EAAG,CAAA,MAAO,MAAM;AAClB,YAAM,IAAO,EAAG,IAAA;AAChB,MAAI,IAAI,EAAG,UAAU,KAAQ,SAC3B,EAAG,CAAA,IAAK;AAAA,UAGV,CAAA;AAKJ,IAAI,EAAG,WAAW,MAChB,KAAK,YAAY;AAAA;EAYrB,QAAc;AACZ,SAAK,MAAM,MACX,KAAK,MAAM,MACX,KAAK,MAAM,MACX,KAAK,MAAM,MACX,KAAK,SAAS,GAEV,KAAK,cAAc,SACrB,KAAK,UAAU,SAAS,GACxB,KAAK,YAAY;AAAA;EAOrB,UAAgB;AACd,SAAK,MAAA;AAAA;GCpaI,IAAa,uBAAO,sBAAA,GACpB,KAAW,uBAAO,eAAA,GAClB,IAAa,uBAAO,iBAAA,GACpB,IAAmB,uBAAO,2BAAA,GAK1B,IAAqB;AAAA,EAEhC,SAAA;AAAA,EAEA,kBAAkB,EAAa;AAAA,EAE/B,KAAK,GAAM,GAAK;AAAA;EAMhB,gBAAgB,GAAK,GAAM,GAAI;AAAA;EAS/B,cAAA,CAAe,MACZ,IAAyC,CAAA;AAAA,EAE5C,cAAA,CAAe,MACZ,IAAyC,CAAA;GAM1C,KAAS,GAKA,KAAA,MAAiC;ACvC9C,SAAgB,EACd,GACA,GACA,GACW;AAEX,MAAI,aAAiB,EACnB,QAAO;AAGT,QAAM,IAAgB,aAAiB,OACjC,IAAkB,IAAgB,EAAM,UAAU,OAAO,CAAA,GACzD,IAAQ,IAAgB,IAAQ;AAKtC,SAAO,IAAI,EAFU,GADR,IAAgB,EAAM,YAAY,OAAO,kBAAA,KACrB,CAAA,MAAa,CAAA,IAEV,CAAA;;ACRtC,IAAsB,IAAtB,MAAsC;AAAA;iBAE5B,kBAEE,yBAEO,EAAgB,yBAIL,GAAA,IAAe,iBAME,wBAEhC,gBAMiB,uBAElB;AAAA;EASZ,UAAU,GAA2E;AACnF,UAAM,IAAO,OAAO,KAAa;AACjC,QAAI,CAAC,MAAS,CAAC,KAAY,OAAQ,EAAwB,WAAY,YACrE,OAAM,EACJ,oBAAI,UAAU,oBAAA,GACd,GACA,EAAe,gCAAA;AAInB,QAAI,IAAQ,KAAK;AACjB,IAAK,MACH,IAAQ,IAAI,GAAA,GACZ,KAAK,SAAS;AAIhB,QAAI,IAAY;AAOhB,QANA,EAAM,QAAA,CAAS,MAAQ;AACrB,OAAI,IAAO,EAAI,OAAO,IAAW,EAAI,QAAQ,OAC3C,IAAY;AAAA,QAIZ;AAEF,aAAA,MAAa;AAAA,MAAA;AAGf,UAAM,IAAO,IAAI,GACf,IAAQ,IAAoD,QAC3D,IAAkC,SAA1B,CAA0B;AAGrC,WAAA,EAAM,IAAI,CAAA,GACV,MAAa,KAAK,aAAa,CAAA;AAAA;EAGjC,aAAuB,GAA6B;AAClD,QAAK,KAAK,QAEV;AAAA,UAAI,KAAK,aAAa,GAAG;AACvB,aAAK,OAAO,OAAO,CAAA;AACnB;AAAA;AAGF,WAAK,OAAO,OAAO,CAAA,GACnB,KAAK,OAAO,QAAA;AAAA;AAAA;EAMd,kBAA0B;AACxB,WAAO,KAAK,SAAS,KAAK,OAAO,OAAO;AAAA;EAM1C,mBAA6B,GAAyB,GAA+B;AACnF,UAAM,IAAQ,KAAK;AACnB,QAAI,GAAC,KAAS,EAAM,SAAS,IAE7B;AAAA,WAAK;AACL,UAAI;AACF,QAAA,EAAM,QAAA,CAAS,MAAM;AACnB,cAAI;AACF,YAAA,EAAE,OAAO,GAAU,CAAA;AAAA,mBACZ,GAAK;AACZ,oBAAQ,MACN,EAAU,GAAK,GAAW,EAAe,iCAAA,CAAkC;AAAA;;;AAKjF,aAAK,cACD,KAAK,eAAe,KACtB,EAAM,QAAA;AAAA;;;EAaZ,WAA8B;AAC5B,UAAM,IAAO,KAAK;AAClB,QAAI,CAAC,KAAQ,EAAK,SAAS,EAAG,QAAO;AAGrC,QAAI,KAAK,cAAc,IAAI;AACzB,YAAM,IAAU,EAAK,MAAM,KAAK,SAAA;AAChC,UAAI,KAAW,QAAQ,EAAQ,KAAK,YAAY,EAAQ,QACtD,QAAO;AAAA;AAKX,WAAI,CAAC,EAAK,gBAAgB,CAAC,EAAK,YAAA,IAAsB,KAG/C,KAAK,gBAAA;AAAA;GC7JZ,IAAiB,GAKR,IAAA,OACX,IAAkB,IAAiB,IAAA,cAAgB,GAC5C,IAOI,IAAA,CAAe,MAAe,IAAI,IAAK,GAEzC,IAAsB,GAC7B,IAAa,IACb,KAAc,GAGL,KAAA,MAA0B;AAKvC,SAAgB,IAAsB;AACpC,SAAI,IAEK,MAGT,IAAa,IACb,KAAc,EAAA,GACd,IAAsB,GACf;;AAIT,IAAa,IAAA,MAAiB;AAC5B,EAAA,IAAa;GAMF,KAAA,MAAsC,IAAa,EAAE,IAAsB,GC5C5E,IAAL,0BAAA,GAAA;AACL,SAAA,EAAA,EAAA,OAAA,CAAA,IAAA,QACA,EAAA,EAAA,WAAA,CAAA,IAAA,YACA,EAAA,EAAA,WAAA,CAAA,IAAA;QAoBI,KAAN,MAAgB;AAAA;wBAEmC,CAAC,CAAA,GAAI,CAAA,CAAE,uBACzC,gBACP,iBAGC,wBAGO,uBACF,2BACI,uBAGJ,sBACgB,CAAA,0BACZ,8BAGY,EAAiB,wCAGO,2BAGrB,KAAK,SAAS,KAAK,IAAA;AAAA;EAEpD,IAAI,QAAwB;AAC1B,WAAI,KAAK,iBAAiB,KAAK,kBAAwB,EAAe,WAClE,KAAK,cAAoB,EAAe,WACrC,EAAe;AAAA;EAGxB,IAAI,YAAoB;AACtB,WAAO,KAAK;AAAA;EAGd,IAAI,aAAsB;AACxB,WAAO,KAAK;AAAA;EAMd,SAAS,GAA8B;AAarC,QAAI,EAAS,eAAe,KAAK,QAGjC;AAAA,UAFA,EAAS,aAAa,KAAK,QAEvB,KAAK,eAAe,KAAK,iBAAiB;AAC5C,aAAK,YAAY,KAAK,iBAAA,IAAqB;AAC3C;AAAA;AAIF,WAAK,aAAa,KAAK,YAAA,EAAe,KAAK,OAAA,IAAW,GAGjD,KAAK,iBACR,KAAK,OAAA;AAAA;AAAA;EAOT,SAAe;AACb,IAAI,KAAK,iBAAiB,KAAK,UAAU,MACzC,KAAK,gBAAgB,IAErB,eAAe,KAAK,aAAA;AAAA;EAMtB,WAAyB;AACvB,QAAI;AACF,UAAI,KAAK,UAAU,EAAG;AAEtB,YAAM,IAAU,EAAA;AAChB,WAAK,YAAA,GACD,KAAS,EAAA;AAAA;AAEb,WAAK,gBAAgB,IAEjB,KAAK,QAAQ,KAAK,CAAC,KAAK,eAC1B,KAAK,OAAA;AAAA;;EAKX,aAAmB;AACjB,SAAK,kBAAkB;AACvB,UAAM,IAAU,EAAA;AAChB,QAAI;AACF,WAAK,iBAAA,GACL,KAAK,YAAA;AAAA;AAEL,WAAK,kBAAkB,IACnB,KAAS,EAAA;AAAA;;EAIjB,mBAAyB;AACvB,QAAI,KAAK,oBAAoB,EAAG;AAGhC,UAAM,IAAQ,EAAE,KAAK,QACf,IAAS,KAAK,aACd,IAAe,KAAK,aAAa,KAAK,YAAA;AAC5C,QAAI,IAAc,KAAK;AAGvB,IAAA,EAAO,MAAM,GAAG,KAAK,eAAA,EAAiB,QAAA,CAAS,MAAQ;AAErD,MAAI,EAAI,eAAe,MACrB,EAAI,aAAa,GACjB,EAAa,GAAA,IAAiB;AAAA,QAIlC,KAAK,QAAQ,GACb,KAAK,kBAAkB,GAGnB,EAAO,SAAS,EAAiB,iCACnC,EAAO,SAAS;AAAA;EAIpB,cAAoB;AAClB,QAAI,IAAa;AAEjB,WAAO,KAAK,QAAQ,KAAG;AAErB,UAAI,EAAE,IAAa,KAAK,qBAAqB;AAC3C,aAAK,qBAAA;AACL;AAAA;AAGF,WAAK,cAAA,GAEL,KAAK,iBAAA;AAAA;;EAIT,gBAAsB;AACpB,UAAM,IAAM,KAAK,cACX,IAAO,KAAK,aAAa,CAAA,GACzB,IAAQ,KAAK;AAGnB,SAAK,eAAe,IAAM,GAC1B,KAAK,QAAQ,GACb,KAAK;AAGL,aAAS,IAAI,GAAG,IAAI,GAAO,IACzB,KAAI;AACF,YAAM,IAAM,EAAK,CAAA;AACjB,MAAI,OAAO,KAAQ,aAAY,EAAA,IAC1B,EAAI,QAAA;AAAA,aACF,GAAG;AACV,cAAQ,MAAM,IAAI,EAAe,6CAA6C,CAAA,CAAW;AAAA;AAI7F,IAAA,EAAK,SAAS;AAAA;EAGhB,uBAAqC;AACnC,UAAM,IAAe,KAAK,QAAQ,KAAK;AAUvC,QATA,QAAQ,MACN,IAAI,EACF,EAAe,yBAAyB,KAAK,qBAAqB,CAAA,CAAa,CAChF,GAEH,KAAK,QAAQ,GACb,KAAK,aAAa,KAAK,YAAA,EAAe,SAAS,GAC/C,KAAK,kBAAkB,GAEnB,KAAK,WACP,KAAI;AACF,WAAK,WAAW,CAAA;AAAA,YACV;AAAA,IAAA;AAAA;EAIZ,aAAmB;AACjB,SAAK,eACL,KAAK,cAAc;AAAA;EAGrB,WAAiB;AACf,IAAI,KAAK,gBAAgB,KAKrB,EAAE,KAAK,gBAAgB,MACzB,KAAK,WAAA,GACL,KAAK,cAAc;AAAA;EAIvB,sBAAsB,GAAmB;AACvC,QAAI,IAAM,EAAiB,qBACzB,OAAM,IAAI,EACR,yCAAyC,EAAiB,oBAAA,EAAA;AAE9D,SAAK,sBAAsB;AAAA;GAIlB,IAAY,IAAI,GAAA,GC3PhB,IAA4B,uBAAO,IAAI,kBAAA,GACvC,KAAgC,uBAAO,IAAI,sBAAA,GAC3C,KAA8B,uBAAO,IAAI,oBAAA,GAOzC,KAAgC,uBAAO,IAAI,sBAAA,GCR3C,IAAkB;AAAA,EAE7B,SAAS;AAAA,EAST,IAAO,GAAoB,GAAgB;AACzC,UAAM,IAAO,KAAK;AAClB,SAAK,UAAU;AACf,QAAI;AACF,aAAO,EAAA;AAAA;AAEP,WAAK,UAAU;AAAA;;;ACdrB,SAAgB,GAAa,GAAgB;AAC3C,QAAM,IAAO,EAAgB;AAG7B,MAAI,MAAS,KAAM,QAAO,EAAA;AAE1B,EAAA,EAAgB,UAAU;AAC1B,MAAI;AACF,WAAO,EAAA;AAAA;AAEP,IAAA,EAAgB,UAAU;AAAA;;ACN9B,IAAM,KAAN,cAA0B,EAA2C;AAAA,EAUnE,YAAY,GAAiB,GAAe;AAC1C,UAAA,2BARwC,aAGhC,CAAA,IAAc,SAEd,EAAA,IAAkB,IAI1B,KAAK,SAAS,GACV,MAAM,KAAK,SAAS,EAAiB,OACzC,EAAM,gBAAgB,MAAM,QAAQ,KAAK,EAAA;AAAA;EAG3C,IAAI,QAAW;AACb,UAAM,IAAU,EAAgB;AAChC,WAAqB,GAAQ,cAAc,IAAA,GACpC,KAAK;AAAA;EAGd,IAAI,MAAM,GAAa;AACrB,UAAM,IAAW,KAAK;AACtB,QAAI,OAAO,GAAG,GAAU,CAAA,EAAW;AAEnC,SAAK,SAAS,GACd,KAAK,UAAU,EAAY,KAAK,OAAA;AAGhC,UAAM,IAAQ,KAAK,QACb,IAAQ,KAAK;AACnB,QAAI,KAAS,QAAQ,EAAM,SAAS,KAAK,IAAQ,EAAiB,uBAChE;AAGF,SAAK,mBAAmB;AACxB,UAAM,IAAY,IAAQ,EAAiB;AAI3C,QAHA,KAAK,QAAQ,IAGR,IAAY,EAAiB,UAAU,KAAK,CAAC,EAAU,YAAY;AACtE,WAAK,oBAAA;AACL;AAAA;AAGF,IAAA,EAAU,SAAS,IAAA;AAAA;EAOrB,UAAgB;AACd,SAAK,oBAAA;AAAA;EAMP,sBAAoC;AAClC,UAAM,IAAQ,KAAK;AAEnB,QAAI,EAAE,IAAQ,EAAiB,2BAA2B,IAAQ,EAAiB,SACjF;AAGF,UAAM,IAAW,KAAK;AACtB,SAAK,mBAAmB,QACxB,KAAK,SAAS,CAAC,EAAiB,wBAEhC,KAAK,mBAAmB,KAAK,QAAQ,CAAA;AAAA;EAGvC,OAAU;AACR,WAAO,KAAK;AAAA;EAGd,UAAgB;AACd,IAAI,KAAK,QAAQ,EAAiB,aAElC,KAAK,QAAQ,MAAA,GACb,KAAK,SAAS,EAAiB,UAE/B,KAAK,SAAS,QACd,KAAK,mBAAmB;AAAA;EAG1B,kBAA8C;AAC5C,WAAO;AAAA;EAGT,CAAC,OAAO,OAAA,IAAiB;AACvB,SAAK,QAAA;AAAA;;AAUT,SAAgB,GAAQ,GAAiB,IAAuB,CAAA,GAAqB;AACnF,SAAO,IAAI,GAAS,GAAc,EAAQ,QAAQ,EAAA;;ACzGpD,IAAa,KAAb,cAAmC,GAA2B;AAAA,EAc5D,cAAc;AACZ,UAAA,eAd6C,6BACZ,wBAKpB,qBAKH,GAKV,KAAK,OAAO,MACZ,KAAK,eAAe,IACpB,KAAK,YAAY;AAAA;EAOnB,kBAAwB;AACtB,SAAK,eAAe;AAAA;EAOtB,eAAkC,GAA4B;AAC5D,UAAM,IAAQ,EAAK;AACnB,IAAI,KAAO,EAAA;AAAA;EAOb,cAAc,GAAiB,GAA6B;AAC1D,UAAM,IAAQ,KAAK;AACnB,QAAI,KAAc,EAAO,QAAO;AAGhC,UAAM,IAAY,IAAQ;AAC1B,QAAI,KAAK,SAAS,QAAQ,IAAY,KAAK,gBACzC,QAAO,KAAK,aAAa,GAAK,CAAA;AAKhC,QAAI,IAAa,GAAG;AAElB,UAAI,KAAc,GAAG;AACnB,cAAM,IAAI,KAAK;AACf,YAAI,KAAK,EAAE,SAAS,KAAO,EAAE;AAC3B,iBAAA,EAAE,UAAU,EAAI,SACT;AAAA;AAIX,UAAI,KAAc,KAAK,IAAQ,GAAG;AAChC,cAAM,IAAI,KAAK;AACf,YAAI,KAAK,EAAE,SAAS,KAAO,EAAE;AAC3B,iBAAA,EAAE,UAAU,EAAI,SACZ,MAAe,MAEjB,KAAK,MADO,KAAK,KAEjB,KAAK,MAAM,IAEN;AAAA;AAIX,UAAI,KAAc,KAAK,IAAQ,GAAG;AAChC,cAAM,IAAI,KAAK;AACf,YAAI,KAAK,EAAE,SAAS,KAAO,EAAE;AAC3B,iBAAA,EAAE,UAAU,EAAI,SACZ,MAAe,KACjB,KAAK,YAAY,GAAG,GAAY,CAAA,GAE3B;AAAA;AAIX,UAAI,KAAc,KAAK,IAAQ,GAAG;AAChC,cAAM,IAAI,KAAK;AACf,YAAI,KAAK,EAAE,SAAS,KAAO,EAAE;AAC3B,iBAAA,EAAE,UAAU,EAAI,SACZ,MAAe,KACjB,KAAK,YAAY,GAAG,GAAY,CAAA,GAE3B;AAAA;;AAMb,UAAM,IAAQ,IAAa,IAAI,IAAa,GACtC,IAAK,KAAK;AAChB,QAAI,EACF,UAAS,IAAI,IAAQ,GAAG,IAAM,EAAG,QAAQ,IAAI,GAAK,KAAK;AACrD,YAAM,IAAO,EAAG,CAAA;AAChB,UAAI,KAAQ,EAAK,SAAS,KAAO,EAAK;AACpC,eAAA,EAAK,UAAU,EAAI,SACnB,KAAK,aAAa,IAAI,GAAG,GAAY,CAAA,GAC9B;AAAA;AAKb,WAAO;AAAA;EAGT,aAAqB,GAAiB,GAA6B;AACjE,QAAI,KAAK,SAAS,MAAM;AACtB,WAAK,OAAO,oBAAI,IAAA;AAChB,YAAM,IAAQ,KAAK;AACnB,eAAS,IAAI,GAAY,IAAI,GAAO,KAAK;AACvC,cAAM,IAAO,KAAK,MAAM,CAAA;AACxB,QAAI,GAAM,SAAO,KAAK,KAAK,IAAI,EAAK,MAAM,CAAA;AAAA;;AAI9C,UAAM,IAAgB,KAAK,KAAK,IAAI,CAAA;AACpC,QAAI,MAAkB,UAAa,IAAgB,EAAY,QAAO;AAEtE,UAAM,IAAO,KAAK,MAAM,CAAA;AACxB,QAAI,KAAQ,QAAQ,CAAC,EAAK,MAAO,QAAO;AAGxC,QADA,EAAK,UAAU,EAAI,SACf,MAAkB,GAAY;AAChC,YAAM,IAAW,KAAK,MAAM,CAAA;AAC5B,WAAK,MAAM,GAAY,CAAA,GACvB,KAAK,MAAM,GAAe,CAAA,GACtB,GAAU,SAAO,KAAK,KAAK,IAAI,EAAS,MAAM,CAAA,GAClD,KAAK,KAAK,IAAI,GAAK,CAAA;AAAA;AAErB,WAAO;AAAA;EAGT,YAAoB,GAAa,GAAoB,GAA4B;AAC/E,UAAM,IAAW,KAAK,MAAM,CAAA;AAC5B,SAAK,MAAM,GAAY,CAAA,GACvB,KAAK,MAAM,GAAK,CAAA;AAAA;EAGlB,aAAqB,GAAa,GAAoB,GAA4B;AAChF,QAAI,MAAQ,EAAY;AACxB,UAAM,IAAW,KAAK,MAAM,CAAA;AAC5B,SAAK,MAAM,GAAY,CAAA,GACvB,KAAK,MAAM,GAAK,CAAA;AAAA;EAOlB,UAAU,GAAoB,GAA4B;AACxD,UAAM,IAAQ,KAAK;AACnB,QAAI,IAAa,GAAO;AACtB,YAAM,IAAW,KAAK,MAAM,CAAA;AAC5B,MAAI,KAAY,SACd,KAAK,IAAI,CAAA,GACL,KAAK,SAAS,QAAQ,EAAS,SACjC,KAAK,KAAK,IAAI,EAAS,MAAM,KAAK,SAAS,CAAA;AAAA;AAKjD,IAAI,MAAe,IAAG,KAAK,MAAM,IACxB,MAAe,IAAG,KAAK,MAAM,IAC7B,MAAe,IAAG,KAAK,MAAM,IAC7B,MAAe,IAAG,KAAK,MAAM,IACjC,KAAK,MAAM,GAAY,CAAA,GAExB,KAAc,MAChB,KAAK,SAAS,IAAa;AAAA;EAQ/B,aAAa,GAAqB;AAChC,IAAI,KAAS,KAAK,WAElB,MAAM,aAAa,CAAA,GAEf,KAAK,SAAS,SAChB,KAAK,KAAK,MAAA,GACV,KAAK,OAAO;AAAA;EAQhB,OAAa;AACX,UAAM,IAAQ,KAAK;AACnB,QAAI,KAAS,GAAG;AACd,WAAK,YAAY;AACjB;AAAA;AAGF,QAAI,IAAO;AACX,UAAM,IAAQ,EAAQ,cAEhB,IAAK,KAAK;AAGhB,QAFI,MAAI,IAAQ,KAAQ,EAAG,WAAW,KAAS,EAAG,KAAK,KAAM,IAEzD,IAAQ,GAAG;AACb,YAAM,IAAK,KAAK;AAChB,MAAI,MAAI,IAAQ,KAAQ,EAAG,WAAW,KAAS,EAAG,KAAK,KAAM;AAAA;AAE/D,QAAI,IAAQ,GAAG;AACb,YAAM,IAAK,KAAK;AAChB,MAAI,MAAI,IAAQ,KAAQ,EAAG,WAAW,KAAS,EAAG,KAAK,KAAM;AAAA;AAE/D,QAAI,IAAQ,GAAG;AACb,YAAM,IAAK,KAAK;AAChB,MAAI,MAAI,IAAQ,KAAQ,EAAG,WAAW,KAAS,EAAG,KAAK,KAAM;AAE7D,YAAM,IAAK,KAAK;AAChB,UAAI,EACF,UAAS,IAAI,GAAG,IAAM,EAAG,QAAQ,IAAI,GAAK,KAAK;AAC7C,cAAM,IAAI,EAAG,CAAA;AACb,QAAI,MAAG,IAAQ,KAAQ,EAAE,WAAW,KAAS,EAAE,KAAK,KAAM;AAAA;;AAIhE,SAAK,YAAY;AAAA;EAMnB,cAAuB;AACrB,UAAM,IAAQ,KAAK;AACnB,QAAI,KAAS,EAAG,QAAO;AAEvB,QAAI,IAAO;AACX,UAAM,IAAQ,EAAQ,cAGhB,IAAK,KAAK;AAChB,QAAI,GAAI;AACN,YAAM,IAAI,EAAG;AACb,MAAA,IAAQ,KAAQ,EAAE,WAAW,KAAS,EAAE,KAAM;AAAA;AAGhD,QAAI,IAAQ,GAAG;AACb,YAAM,IAAI,KAAK;AACf,UAAI,GAAG;AACL,cAAM,IAAI,EAAE;AACZ,QAAA,IAAQ,KAAQ,EAAE,WAAW,KAAS,EAAE,KAAM;AAAA;;AAGlD,QAAI,IAAQ,GAAG;AACb,YAAM,IAAI,KAAK;AACf,UAAI,GAAG;AACL,cAAM,IAAI,EAAE;AACZ,QAAA,IAAQ,KAAQ,EAAE,WAAW,KAAS,EAAE,KAAM;AAAA;;AAGlD,QAAI,IAAQ,GAAG;AACb,YAAM,IAAI,KAAK;AACf,UAAI,GAAG;AACL,cAAM,IAAI,EAAE;AACZ,QAAA,IAAQ,KAAQ,EAAE,WAAW,KAAS,EAAE,KAAM;AAAA;AAGhD,YAAM,IAAK,KAAK;AAChB,UAAI,EACF,UAAS,IAAI,GAAG,IAAM,EAAG,QAAQ,IAAI,GAAK,KAAK;AAC7C,cAAM,IAAI,EAAG,CAAA;AACb,YAAI,GAAG;AACL,gBAAM,IAAI,EAAE;AACZ,UAAA,IAAQ,KAAQ,EAAE,WAAW,KAAS,EAAE,KAAM;AAAA;;;AAKtD,WAAO,MAAS,KAAK;AAAA;EAMvB,yBAAiC;AAC/B,UAAM,IAAQ,KAAK;AACnB,QAAI,KAAS,EAAG,QAAO;AAEvB,QAAI,IAAO;AACX,UAAM,IAAK,KAAK;AAGhB,QAFI,MAAI,KAAS,KAAQ,KAAK,IAAO,EAAG,KAAK,UAAW,IAEpD,IAAQ,GAAG;AACb,YAAM,IAAK,KAAK;AAChB,MAAI,MAAI,KAAS,KAAQ,KAAK,IAAO,EAAG,KAAK,UAAW;AAAA;AAE1D,QAAI,IAAQ,GAAG;AACb,YAAM,IAAK,KAAK;AAChB,MAAI,MAAI,KAAS,KAAQ,KAAK,IAAO,EAAG,KAAK,UAAW;AAAA;AAE1D,QAAI,IAAQ,GAAG;AACb,YAAM,IAAK,KAAK;AAChB,MAAI,MAAI,KAAS,KAAQ,KAAK,IAAO,EAAG,KAAK,UAAW;AAExD,YAAM,IAAK,KAAK;AAChB,UAAI,EACF,UAAS,IAAI,GAAG,IAAM,EAAG,QAAQ,IAAI,GAAK,KAAK;AAC7C,cAAM,IAAI,EAAG,CAAA;AACb,QAAI,MAAG,KAAS,KAAQ,KAAK,IAAO,EAAE,KAAK,UAAW;AAAA;;AAI5D,WAAO;AAAA;EAIT,aAAmB;AACjB,IAAI,KAAK,SAAS,KAChB,KAAK,aAAa,CAAA,GAEpB,KAAK,eAAe,IAChB,KAAK,SAAS,SAChB,KAAK,KAAK,MAAA,GACV,KAAK,OAAO;AAAA;EAQhB,OAAgB,GAAgC;AAC9C,UAAM,IAAI,MACR,sFAAA;AAAA;EAQJ,UAAyB;AAAA,EAAA;;ACpW3B,SAAgB,GAAO,GAAmC;AACxD,SAAO,MAAQ,QAAQ,OAAO,KAAQ,YAAY,KAAc;;AAgBlE,SAAgB,GAAW,GAAmC;AAC5D,SAAO,MAAQ,QAAQ,OAAO,KAAQ,YAAY,MAAkB;;AAMtE,SAAgB,GAAS,GAAmC;AAC1D,SAAO,MAAQ,QAAQ,OAAO,KAAQ,YAAY,MAAgB;;AAMpE,SAAgB,GAAa,GAAqC;AAChE,SACE,MAAU,QACV,OAAO,KAAU,YACjB,OAAQ,EAA6B,QAAS;;ACflD,IAAM,EACJ,MAAA,GACA,OAAA,GACA,SAAA,GACA,UAAA,GACA,UAAA,GACA,WAAA,GACA,aAAA,GACA,UAAA,GACA,aAAA,GACA,eAAA,EAAA,IACE,GAKE,KAAN,cAAkC,EAAuD;AAAA,EA6BvF,YAAY,GAA0B,IAA8B,CAAA,GAAI;AACtE,QAAI,OAAO,KAAO,WAAY,OAAM,IAAI,EAAc,EAAe,yBAAA;AAgBrE,QAfA,MAAA,QA7BQ,CAAA,IAAc,SAEd,EAAA,IAAkB,kBAGG,wBAEV,gBASb,IAAI,GAAA,sCAG0B,2BACX,0BACO,EAAgB,kCAGpB,EAAgB,kCACxB,GAMpB,KAAK,SAAS,QAEd,KAAK,QAAQ,IAAc,IAAQ,GACnC,KAAK,SAAS,EAAQ,SAAS,OAAO,IACtC,KAAK,MAAM,GACX,KAAK,gBAAgB,kBAAkB,IAAU,EAAQ,eAAgB,GACzE,KAAK,WAAW,EAAQ,WAAW,MAEnC,KAAK,oBADW,EAAQ,mBACY,EAAgB,qBAAqB,GAEzE,EAAM,gBAAgB,MAAM,YAAY,KAAK,EAAA,GAGzC,EAAQ,SAAS,GACnB,KAAI;AACF,WAAK,WAAA;AAAA,YACC;AAAA,IAAA;AAAA;EAMZ,SAAuB;AACrB,IAAA,EAAgB,SAAS,cAAc,IAAA;AAAA;EAGzC,IAAI,QAAW;AACb,SAAK,OAAA;AAEL,UAAM,IAAQ,KAAK;AACnB,SAAK,KAAS,IAAW,IAAQ,QAAW,EAC1C,QAAO,KAAK;AAGd,QAAI,IAAQ,EACV,OAAM,IAAI,EAAc,EAAe,iBAAA;AAGzC,QAAI,IAAQ,GAAa;AACvB,UAAI,KAAK,kBAAmB,EAAwB,QAAO,KAAK;AAChE,YAAM,IAAI,EAAc,EAAe,4BAAA;AAAA;AAGzC,QAAI,KAAS,IAAQ,QAEhB,IAAQ,OAAU,MAClB,IAAQ,OAAmB,KAC5B,KAAK,MAAM,OAAO,KAClB,CAAC,KAAK,SAAA,IAGN,KAAK,SAAS,CAAC,IAEf,KAAK,WAAA,GAGH,KAAK,QAAQ;AAAU,aAAO,KAAK;AAIzC,UAAM,IAAM,KAAK,eACX,IAAS,MAAS;AAExB,QAAI,KAAK,QAAQ,GAAS;AACxB,UAAI,EAAQ,QAAO;AACnB,YAAM,IAAI,EAAc,EAAe,iCAAA;AAAA;AAGzC,QAAI,KAAK,QAAQ,GAAU;AACzB,UAAI,EAAQ,QAAO;AACnB,YAAM,KAAK;AAAA;AAGb,WAAO,KAAK;AAAA;EAGd,OAAU;AACR,WAAO,KAAK;AAAA;EAGd,IAAI,QAAwB;AAC1B,SAAK,OAAA;AACL,UAAM,IAAQ,KAAK;AACnB,WAAI,IAAQ,IAAiB,EAAW,WACpC,IAAQ,IAAgB,EAAW,UACnC,IAAQ,IAAiB,EAAW,WACjC,EAAW;AAAA;EAGpB,IAAI,WAAoB;AAGtB,QAFA,KAAK,OAAA,GACS,KAAK,SACN,IAAW,GAAY,QAAO;AAE3C,UAAM,IAAO,KAAK,OACZ,IAAO,EAAK;AAClB,aAAS,IAAI,GAAG,IAAI,GAAM,KAAK;AAC7B,YAAM,IAAO,EAAK,MAAM,CAAA;AACxB,UAAI,KAAQ,QAAQ,EAAK,KAAK,QAAQ,EAAW,QAAO;AAAA;AAE1D,WAAO;AAAA;EAGT,IAAI,UAAmB;AACrB,WAAO,CAAC,KAAK;AAAA;EAGf,IAAI,SAA2B;AAC7B,SAAK,OAAA;AAGL,UAAM,IAAqB,CAAA;AAC3B,IAAI,KAAK,UAAQ,EAAU,KAAK,KAAK,MAAA;AAErC,UAAM,IAAO,KAAK,OACZ,IAAO,EAAK;AAClB,aAAS,IAAI,GAAG,IAAI,GAAM,KAAK;AAC7B,YAAM,IAAO,EAAK,MAAM,CAAA;AACxB,UAAI,KAAQ,KAAM;AAElB,YAAM,IAAM,EAAK;AACjB,MAAI,EAAI,QAAQ,KACd,KAAK,sBAAsB,GAAyC,CAAA;AAAA;AAIxE,WAAO,EAAU,WAAW,IAAI,KAAoB,OAAO,OAAO,CAAA;AAAA;EAGpE,sBAA8B,GAAoC,GAA0B;AAC1F,UAAM,IAAO,EAAY,QACnB,IAAM,EAAK;AACjB,aAAS,IAAI,GAAG,IAAI,GAAK,KAAK;AAC5B,YAAM,IAAM,EAAK,CAAA;AACjB,MAAI,KAAO,QAAQ,CAAC,EAAU,SAAS,CAAA,KACrC,EAAU,KAAK,CAAA;AAAA;;EAKrB,IAAI,YAA0B;AAC5B,gBAAK,OAAA,GACE,KAAK;AAAA;EAGd,IAAI,YAAqB;AACvB,gBAAK,OAAA,IACG,KAAK,QAAQ,OAAa;AAAA;EAGpC,IAAI,aAAsB;AACxB,gBAAK,OAAA,IACG,KAAK,QAAQ,OAAc;AAAA;EAGrC,aAAmB;AACjB,SAAK,SAAS,GACd,KAAK,WAAA;AAAA;EAGP,UAAgB;AACd,IAAI,KAAK,QAAQ,MAEjB,KAAK,MAAM,WAAA,GAEX,KAAK,QAAQ,MAAA,GACb,KAAK,QAAQ,IAAW,IAAQ,GAGhC,KAAK,SAAS,MACd,KAAK,SAAS,QACd,KAAK,YAAY;AAAA;EAGnB,CAAC,OAAO,OAAA,IAAiB;AACvB,SAAK,QAAA;AAAA;EAGP,cAAc,GAAuB;AACnC,QAAI,EAAI,mBAAmB,KAAK,YAAa;AAC7C,IAAA,EAAI,iBAAiB,KAAK;AAE1B,UAAM,IAAa,KAAK,aAClB,IAAW,KAAK,MAAM,MAAM,CAAA;AAGlC,QAAI,KAAY,QAAQ,EAAS,SAAS,EACxC,CAAA,EAAS,UAAU,EAAI;AAAA,aAGhB,MAAK,MAAM,cAAc,GAAK,CAAA,GAIlC;AACH,YAAM,IAAO,IAAI,EAAe,GAAK,EAAI,SAAS,EAAI,UAAU,IAAA,CAAK;AACrE,WAAK,MAAM,UAAU,GAAY,CAAA;AAAA;AAGnC,IAAI,EAAI,QAAQ,MACd,KAAK,MAAM,eAAe,KAE5B,KAAK,cAAc,IAAa;AAAA;EAGlC,aAA2B;AACzB,QAAI,KAAK,QAAQ,EAAa;AAC9B,SAAK,SAAS,KAAK,QAAQ,KAAe,CAAC,GAE3C,KAAK,cAAc,EAAA,GACnB,KAAK,cAAc,GACnB,KAAK,MAAM,gBAAA,GACX,KAAK,YAAY;AAEjB,QAAI,IAAY;AAChB,QAAI;AAEF,YAAM,IAAS,EAAgB,IAAI,MAAM,KAAK,GAAA;AAG9C,WAAK,MAAM,aAAa,KAAK,WAAA,GAC7B,KAAK,MAAM,KAAA,GACX,IAAY,IAGR,GAAU,CAAA,IACZ,KAAK,wBAAwB,CAAA,IAE7B,KAAK,oBAAoB,CAAA;AAAA,aAEpB,GAAG;AAEV,UAAI,CAAC,EACH,KAAI;AACF,aAAK,MAAM,aAAa,KAAK,WAAA;AAAA,cACX;AAAA;AAMtB,WAAK,aAAa,GAAY,EAAe,6BAA6B,EAAA;AAAA;AAG1E,WAAK,cAAc,EAAgB,eACnC,KAAK,cAAc,GACnB,KAAK,SAAS,CAAC;AAAA;;EAInB,wBAAgC,GAA2B;AAEzD,SAAK,SAAS,KAAK,QAAQ,KAAW,EAAE,IAAO,IAAQ,IAAW,IAElE,KAAK,mBAAmB,QAAW,MAAA,GAEnC,KAAK,8BAA8B,KAAK,wBAAA,GACxC,KAAK,mBAAmB,GAExB,KAAK,cAAc,KAAK,aAAa,KAAK,EAAgB;AAC1D,UAAM,IAAY,KAAK;AAEvB,IAAA,EAAQ,KAAA,CACL,MAAQ;AACP,UAAI,MAAc,KAAK,YAEvB;AAAA,YAAI,KAAK,wBAAA,MAA8B,KAAK,6BAA6B;AAGvE,gBAAM,IAAQ,GAAA;AAKd,iBAJI,KAAK,oBAAoB,MAC3B,KAAK,kBAAkB,GACvB,KAAK,mBAAmB,IAEtB,KAAK,qBAAqB,KAAK,mBAC1B,KAAK,WAAA,IAEP,KAAK,aACV,IAAI,EACF,wCAAwC,KAAK,gBAAA,WAAiB,GAEhE,EAAe,iCAAA;AAAA;AAInB,aAAK,oBAAoB,CAAA,GACzB,KAAK,mBAAmB,GAAK,MAAA;AAAA;AAAA,QAE9B,MACC,MAAc,KAAK,cACnB,KAAK,aAAa,GAAK,EAAe,iCAAA,CAAkC;AAAA;EAI9E,0BAA0C;AACxC,WAAO,KAAK,MAAM,uBAAA;AAAA;EAGpB,aAAqB,GAAc,GAAa,IAAW,IAAa;AACtE,UAAM,IAAQ,EAAU,GAAK,GAAe,CAAA;AAU5C,QARI,CAAC,KAAY,EAAE,KAAK,QAAQ,OAC9B,KAAK,UAAU,EAAY,KAAK,OAAA,IAGlC,KAAK,SAAS,GAEd,KAAK,QAAS,KAAK,QAAQ,EAAE,IAAO,IAAQ,IAAU,KAAa,IAAW,GAE1E,KAAK,SACP,KAAI;AACF,WAAK,SAAS,CAAA;AAAA,aACP,GAAG;AACV,cAAQ,MAAM,EAAe,iCAAiC,CAAA;AAAA;AAIlE,QAAI,EAAU,OAAM;AACpB,SAAK,mBAAmB,QAAW,MAAA;AAAA;EAGrC,oBAA4B,GAAgB;AAE1C,KAAI,EAAE,KAAK,QAAQ,MAAa,CAAC,KAAK,OAAO,KAAK,QAAQ,CAAA,OACxD,KAAK,UAAU,EAAY,KAAK,OAAA,IAGlC,KAAK,SAAS,GACd,KAAK,SAAS,MAEd,KAAK,SAAS,KAAK,QAAQ,KAAY,EAAE,IAAO,IAAQ,IAAU,IAAW;AAAA;EAG/E,UAAgB;AAEd,SAAK,WAAA;AAAA;EAIP,aAAmB;AACjB,IAAI,KAAK,SAAS,IAAc,OAChC,KAAK,SAAS,GACd,KAAK,mBAAmB,QAAW,MAAA;AAAA;EAMrC,kBAA8C;AAC5C,UAAM,IAAO,KAAK,OACZ,IAAc,EAAgB;AACpC,IAAA,EAAgB,UAAU;AAE1B,QAAI;AACF,YAAM,IAAO,EAAK;AAClB,eAAS,IAAI,GAAG,IAAI,GAAM,KAAK;AAC7B,cAAM,IAAO,EAAK,MAAM,CAAA;AACxB,YAAI,KAAQ,KAAM;AAElB,cAAM,IAAM,EAAK;AACjB,YAAI,EAAI,QAAQ,EACd,KAAI;AAEI,UAAA,EAA2B;AAAA,gBAC3B;AAAA;AAMV,YAAI,EAAI,YAAY,EAAK;AACvB,sBAAK,YAAY,GACV;AAAA;AAIX,kBAAK,YAAY,IACV;AAAA;AAEP,MAAA,EAAgB,UAAU;AAAA;;;AAehC,SAAgB,GACd,GACA,IAA8B,CAAA,GACb;AACjB,SAAO,IAAI,GAAiB,GAAI,CAAA;;AC7blC,IAAM,KAAN,cAAyB,EAA8D;AAAA,EA6BrF,YAAY,GAAoB,IAAyB,CAAA,GAAI;AAC3D,UAAA,QA5BQ,EAAA,IAAgB,oBAEc,mBAEhC,IAAI,GAAA,wBAQoB,EAAgB,sCACd,EAAgB,yCACrB,0BAOH,uBACH,uBACA,kBACL,sBACI,GAIpB,KAAK,MAAM,GACX,KAAK,WAAW,EAAQ,WAAW,MACnC,KAAK,QAAQ,EAAQ,QAAQ,IAC7B,KAAK,iBACH,EAAQ,0BAA0B,EAAiB,2BACrD,KAAK,yBACH,EAAQ,yBAAyB,EAAiB,2BAEhD,KAAK,QACP,KAAK,kBAAA,MAAwB,KAAK,QAAA,IAElC,KAAK,kBAAA,MAAwB,EAAU,SAAS,IAAA,GAGlD,EAAM,gBAAgB,MAAM,UAAU,KAAK,EAAA;AAAA;EAG7C,MAAmB;AACjB,QAAI,KAAK,QAAQ,EAAmB,SAClC,OAAM,IAAI,EAAY,EAAe,eAAA;AAEvC,SAAK,QAAQ,EAAA;AAAA;EAGf,UAAuB;AACrB,IAAI,KAAK,QAAQ,EAAmB,aACpC,KAAK,SAAS,EAAmB,UAEjC,KAAK,aAAA,GACL,KAAK,OAAO,WAAA;AAAA;EAGd,CAAC,OAAO,OAAA,IAAiB;AACvB,SAAK,QAAA;AAAA;EAGP,cAAqB,GAAuB;AAC1C,QAAI,EAAE,KAAK,QAAQ,EAAmB,WAAY;AAElD,UAAM,IAAa,KAAK;AACxB,QAAI,EAAI,mBAAmB,EAAY;AACvC,IAAA,EAAI,iBAAiB;AAErB,UAAM,IAAa,KAAK,aAClB,IAAO,KAAK,OACZ,IAAW,EAAK,MAAM,CAAA;AAG5B,IAAI,KAAY,QAAQ,EAAS,SAAS,IACxC,EAAS,UAAU,EAAI,UAGhB,EAAK,cAAc,GAAK,CAAA,KAK/B,KAAK,qBAAqB,GAAK,CAAA,GAG7B,EAAI,QAAQ,EAAqB,gBACnC,EAAK,eAAe,KAEtB,KAAK,cAAc,IAAa;AAAA;EAGlC,qBAA6B,GAAiB,GAA0B;AACtE,QAAI;AACJ,QAAI;AACF,YAAM,IAAc,EAAI,UAAU,KAAK,eAAA;AACvC,MAAA,IAAO,IAAI,EAAe,GAAK,EAAI,SAAS,CAAA;AAAA,aACrC,GAAO;AACd,YAAM,IAAU,EAAU,GAAO,GAAa,EAAe,uBAAA;AAE7D,UADA,QAAQ,MAAM,CAAA,GACV,KAAK,SACP,KAAI;AACF,aAAK,SAAS,CAAA;AAAA,cACR;AAAA,MAAA;AAEV,MAAA,IAAO,IAAI,EAAe,GAAK,EAAI,SAAS,MAAA;AAAA;AAG9C,SAAK,MAAO,UAAU,GAAY,CAAA;AAAA;EAMpC,QAAe,IAAQ,IAAa;AAClC,QAAI,KAAK,SAAS,EAAmB,WAAW,EAAmB,WAAY;AAG/E,UAAM,IAAO,KAAK;AAClB,QAAI,CAAC,KAAS,EAAK,OAAO,KAAK,CAAC,KAAK,SAAA,EAAY;AAEjD,SAAK,oBAAA,GAEL,KAAK,SAAS,EAAmB,WACjC,KAAK,aAAA,GAEL,KAAK,gBAAgB,EAAA,GACrB,KAAK,cAAc,GACnB,EAAK,gBAAA,GACL,KAAK,YAAY;AAEjB,QAAI,IAAY;AAChB,QAAI;AACF,YAAM,IAAS,EAAgB,IAAI,MAAM,KAAK,GAAA;AAG9C,MAAA,EAAK,aAAa,KAAK,WAAA,GACvB,EAAK,KAAA,GACL,IAAY,IAGR,GAAU,CAAA,IACZ,KAAK,mBAAmB,CAAA,IAExB,KAAK,WAAW,OAAO,KAAW,aAAa,IAAS;AAAA,aAEnD,GAAO;AAEd,UAAI,CAAC,EACH,KAAI;AACF,QAAA,EAAK,aAAa,KAAK,WAAA;AAAA,cACL;AAAA;AAMtB,WAAK,sBAAsB,CAAA,GAC3B,KAAK,WAAW;AAAA;AAEhB,WAAK,SAAS,CAAC,EAAmB;AAAA;;EAItC,mBAA2B,GAAiC;AAC1D,UAAM,IAAS,EAAE,KAAK;AACtB,IAAA,EAAQ,KAAA,CACL,MAAY;AAEX,UAAI,MAAW,KAAK,WAAW,KAAK,QAAQ,EAAmB,UAAU;AACvE,YAAI,OAAO,KAAY,WACrB,KAAI;AACF,UAAA,EAAA;AAAA,iBACO,GAAG;AACV,eAAK,sBAAsB,GAAG,EAAe,qBAAA;AAAA;AAGjD;AAAA;AAEF,MAAI,OAAO,KAAY,eAAY,KAAK,WAAW;AAAA,QAEpD,MAAQ,MAAW,KAAK,WAAW,KAAK,sBAAsB,CAAA,CAAI;AAAA;EAIvE,kBAA8C;AAC5C,UAAM,IAAc,EAAgB;AACpC,IAAA,EAAgB,UAAU;AAC1B,UAAM,IAAO,KAAK;AAElB,QAAI;AACF,YAAM,IAAO,EAAK;AAClB,eAAS,IAAI,GAAG,IAAI,GAAM,KAAK;AAC7B,cAAM,IAAO,EAAK,MAAM,CAAA;AACxB,YAAI,KAAQ,KAAM;AAElB,cAAM,IAAM,EAAK;AAKjB,YAJI,EAAI,QAAQ,EAAqB,eACnC,KAAK,iBAAiB,CAAA,GAGpB,EAAI,YAAY,EAAK;AACvB,sBAAK,YAAY,GACV;AAAA;AAGX,aAAO;AAAA;AAEP,MAAA,EAAgB,UAAU;AAAA;;EAI9B,iBAAyB,GAAuB;AAC9C,QAAI;AAEI,MAAA,EAA2B;AAAA,YAC3B;AAAA;;EAOV,eAA6B;AAC3B,QAAK,KAAK,UACV;AAAA,UAAI;AACF,aAAK,SAAA;AAAA,eACE,GAAO;AACd,aAAK,sBAAsB,GAAO,EAAe,qBAAA;AAAA;AAEnD,WAAK,WAAW;AAAA;AAAA;EAGlB,sBAAoC;AAClC,UAAM,IAAQ,GAAA;AACd,IAAI,KAAK,oBAAoB,MAC3B,KAAK,kBAAkB,GACvB,KAAK,qBAAqB,IAGT,EAAE,KAAK,qBACT,KAAK,0BAAwB,KAAK,wBAAwB,YAAA,GAElD,GAAA,IACF,EAAiB,4BACtC,KAAK,wBAAwB,QAAA,GAG/B,KAAK;AAAA;EAKP,uBAAqC;AACnC,QAAI,CAAC,OAAO,SAAS,KAAK,cAAA,EAAiB;AAE3C,UAAM,IAAM,KAAK,IAAA;AACjB,QAAI,IAAM,KAAK,gBAAgB,EAAa,yBAAyB;AACnE,WAAK,eAAe,GACpB,KAAK,eAAe;AACpB;AAAA;AAGF,QAAI,EAAE,KAAK,eAAe,KAAK,gBAAgB;AAC7C,YAAM,IAAM,IAAI,EAAY,EAAe,+BAAA;AAC3C,iBAAK,QAAA,GACL,KAAK,sBAAsB,CAAA,GACrB;AAAA;;EAIV,IAAI,aAAsB;AACxB,YAAQ,KAAK,QAAQ,EAAmB,cAAc;AAAA;EAExD,IAAI,iBAAyB;AAC3B,WAAO,KAAK;AAAA;EAEd,IAAI,cAAuB;AACzB,YAAQ,KAAK,QAAQ,EAAmB,eAAe;AAAA;EAGzD,wBAAgC,GAAsC;AACpE,UAAM,IAAQ,IAAI,EAChB,2BAA2B,CAAA,sBAA0B,KAAK,kBAAA,uDAAyE,CAAA,EAAA;AAErI,eAAK,QAAA,GACL,QAAQ,MAAM,CAAA,GACR;AAAA;EAGR,sBACE,GACA,IAAkB,EAAe,yBAC3B;AACN,UAAM,IAAW,EAAU,GAAO,GAAa,CAAA;AAE/C,QADA,QAAQ,MAAM,CAAA,GACV,KAAK,SACP,KAAI;AACF,WAAK,SAAS,CAAA;AAAA,aACP,GAAG;AACV,cAAQ,MAAM,EAAU,GAAG,GAAa,EAAe,+BAAA,CAAgC;AAAA;;;AAa/F,SAAgB,GAAO,GAAoB,IAAyB,CAAA,GAAkB;AACpF,MAAI,OAAO,KAAO,WAChB,OAAM,IAAI,EAAY,EAAe,uBAAA;AAGvC,QAAM,IAAiB,IAAI,GAAW,GAAI,CAAA;AAC1C,SAAA,EAAe,QAAA,GAER;;AC3VT,SAAgB,GAAS,GAAgB;AAEvC,MAAI,OAAO,KAAO,WAChB,OAAM,IAAI,UAAU,EAAe,+BAAA;AAGrC,EAAA,EAAU,WAAA;AACV,MAAI;AACF,WAAO,EAAA;AAAA;AAEP,IAAA,EAAU,SAAA;AAAA"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@but212/atom-effect",
-  "version": "0.22.2",
+  "version": "0.24.0",
   "type": "module",
   "description": "A reactive state management library that combines the power of `atom`, `computed`, and `effect` for seamless management of reactive state.",
   "main": "./dist/index.cjs",
@@ -39,20 +39,20 @@
     "directory": "packages/core"
   },
   "devDependencies": {
-    "@types/jsdom": "^27.0.0",
-    "@types/node": "^25.3.0",
-    "@vitest/coverage-v8": "^4.0.18",
-    "@vitest/ui": "^4.0.18",
-    "happy-dom": "^20.7.0",
-    "jsdom": "^28.1.0",
+    "@types/jsdom": "^28.0.1",
+    "@types/node": "^25.5.0",
+    "@vitest/coverage-v8": "^4.1.1",
+    "@vitest/ui": "^4.1.1",
+    "happy-dom": "^20.8.7",
+    "jsdom": "^29.0.1",
     "tinybench": "^6.0.0",
-    "vite": "^7.3.1",
+    "vite": "^8.0.2",
     "vite-plugin-dts": "^4.5.4",
-    "vite-tsconfig-paths": "^6.1.1",
-    "vitest": "^4.0.18"
+    "vitest": "^4.1.1"
   },
   "scripts": {
     "build": "vite build",
+    "clean": "rimraf dist",
     "test": "vitest",
     "test:run": "vitest run",
     "test:unit": "vitest __tests__/unit",