mvc-kit 2.8.0 → 2.9.0

package/dist/Collection.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"Collection.cjs","sources":["../src/Collection.ts"],"sourcesContent":["import type { Listener, Subscribable } from './types';\n\nconst __DEV__ = typeof __MVC_KIT_DEV__ !== 'undefined' && __MVC_KIT_DEV__;\n\nfunction freeze<T>(obj: T): T {\n  return __DEV__ ? Object.freeze(obj) as T : obj;\n}\n\ntype CollectionState<T> = T[];\ntype CollectionListener<T> = Listener<CollectionState<T>>;\n\n/**\n * Reactive typed array with CRUD and query methods.\n */\nexport class Collection<T extends { id: string | number }> implements Subscribable<CollectionState<T>> {\n  /** Maximum number of items before FIFO eviction. 0 = unlimited. */\n  static MAX_SIZE = 0;\n  /** Time-to-live in milliseconds. 0 = no expiry. */\n  static TTL = 0;\n\n  private _items: readonly T[] = [];\n  private _disposed = false;\n  private _listeners = new Set<CollectionListener<T>>();\n  private _index = new Map<T['id'], T>();\n  private _abortController: AbortController | null = null;\n  private _cleanups: (() => void)[] | null = null;\n  private _timestamps: Map<T['id'], number> | null = null;\n  private _evictionTimer: ReturnType<typeof setTimeout> | null = null;\n\n  constructor(initialItems: T[] = []) {\n    let result = [...initialItems];\n\n    if (this._ttl > 0) {\n      this._timestamps = new Map();\n      const now = Date.now();\n      for (const item of result) {\n        this._timestamps.set(item.id, now);\n      }\n    }\n\n    if (this._maxSize > 0 && result.length > this._maxSize) {\n      // FIFO: trim from the front (oldest items)\n      const excess = result.length - this._maxSize;\n      const evicted = result.slice(0, excess);\n      result = result.slice(excess);\n      for (const item of evicted) {\n        this._timestamps?.delete(item.id);\n      }\n    }\n\n    this._items = freeze(result);\n    this.rebuildIndex();\n    this._scheduleEvictionTimer();\n  }\n\n  /**\n   * Alias for Subscribable compatibility.\n   */\n  get state(): T[] {\n    return this._items as T[];\n  }\n\n  /** The raw array of items. */\n  get items(): T[] {\n    return this._items as T[];\n  }\n\n  /** Number of items in the collection. */\n  get length(): number {\n    return this._items.length;\n  }\n\n  /** Whether this instance has been disposed. */\n  get disposed(): boolean {\n    return this._disposed;\n  }\n\n  /** AbortSignal that fires when this instance is disposed. Lazily created. */\n  get disposeSignal(): AbortSignal {\n    if (!this._abortController) {\n      this._abortController = new AbortController();\n    }\n    return this._abortController.signal;\n  }\n\n  // ── Config Accessors ──\n\n  private get _maxSize(): number {\n    return (this.constructor as typeof Collection).MAX_SIZE;\n  }\n\n  private get _ttl(): number {\n    return (this.constructor as typeof Collection).TTL;\n  }\n\n  // ── CRUD Methods (notify listeners) ──\n\n  /**\n   * Add one or more items. Items with existing IDs are silently skipped.\n   */\n  add(...items: T[]): void {\n    if (this._disposed) {\n      throw new Error('Cannot add to disposed Collection');\n    }\n\n    if (items.length === 0) {\n      return;\n    }\n\n    // Fast path: single item (most common case)\n    if (items.length === 1) {\n      const item = items[0];\n      if (this._index.has(item.id)) return;\n      const prev = this._items;\n      let result = [...prev, item];\n      this._index.set(item.id, item);\n      if (this._timestamps) this._timestamps.set(item.id, Date.now());\n      if (this._maxSize > 0 && result.length > this._maxSize) {\n        result = this._evictForCapacity(result);\n      }\n      this._items = freeze(result);\n      this.notify(prev);\n      this._scheduleEvictionTimer();\n      return;\n    }\n\n    // Multi-item path\n    const seen = new Set<T['id']>();\n    const newItems: T[] = [];\n    for (const item of items) {\n      if (!this._index.has(item.id) && !seen.has(item.id)) {\n        newItems.push(item);\n        seen.add(item.id);\n      }\n    }\n    if (newItems.length === 0) return;\n\n    const prev = this._items;\n    let result = [...prev, ...newItems];\n\n    for (const item of newItems) {\n      this._index.set(item.id, item);\n    }\n\n    // Record timestamps for TTL\n    if (this._timestamps) {\n      const now = Date.now();\n      for (const item of newItems) {\n        this._timestamps.set(item.id, now);\n      }\n    }\n\n    // Enforce capacity before freeze/notify\n    if (this._maxSize > 0 && result.length > this._maxSize) {\n      result = this._evictForCapacity(result);\n    }\n\n    this._items = freeze(result);\n    this.notify(prev);\n    this._scheduleEvictionTimer();\n  }\n\n  /**\n   * Add or replace items by ID. Existing items are replaced in-place\n   * (preserving array position); new items are appended. Deduplicates\n   * input — last occurrence wins. No-op if nothing changed (reference\n   * comparison).\n   */\n  upsert(...items: T[]): void {\n    if (this._disposed) {\n      throw new Error('Cannot upsert on disposed Collection');\n    }\n    if (items.length === 0) return;\n\n    // Deduplicate input — last occurrence wins\n    const incoming = new Map<T['id'], T>();\n    for (const item of items) {\n      incoming.set(item.id, item);\n    }\n\n    const prev = this._items;\n    let changed = false;\n    const replaced = new Set<T['id']>();\n    const newArray: T[] = [];\n\n    // Replace existing items in-place\n    for (const existing of prev) {\n      if (incoming.has(existing.id)) {\n        const replacement = incoming.get(existing.id)!;\n        if (replacement !== existing) changed = true;\n        newArray.push(replacement);\n        replaced.add(existing.id);\n      } else {\n        newArray.push(existing);\n      }\n    }\n\n    // Append genuinely new items\n    for (const [id, item] of incoming) {\n      if (!replaced.has(id)) {\n        newArray.push(item);\n        changed = true;\n      }\n    }\n\n    if (!changed) return;\n\n    // Record/refresh timestamps for TTL (upsert refreshes existing)\n    if (this._timestamps) {\n      const now = Date.now();\n      for (const [id] of incoming) {\n        this._timestamps.set(id, now);\n      }\n    }\n\n    for (const [id, item] of incoming) {\n      this._index.set(id, item);\n    }\n\n    // Enforce capacity before freeze/notify\n    let result = newArray;\n    if (this._maxSize > 0 && result.length > this._maxSize) {\n      result = this._evictForCapacity(result);\n    }\n\n    this._items = freeze(result);\n    this.notify(prev);\n    this._scheduleEvictionTimer();\n  }\n\n  /**\n   * Remove items by id(s).\n   */\n  remove(...ids: T['id'][]): void {\n    if (this._disposed) {\n      throw new Error('Cannot remove from disposed Collection');\n    }\n\n    if (ids.length === 0) {\n      return;\n    }\n\n    const idSet = new Set(ids);\n    const filtered = this._items.filter(item => !idSet.has(item.id));\n\n    if (filtered.length === this._items.length) {\n      return; // No items removed\n    }\n\n    const prev = this._items;\n    this._items = freeze(filtered);\n\n    for (const id of ids) {\n      this._index.delete(id);\n      this._timestamps?.delete(id);\n    }\n\n    this.notify(prev);\n    this._scheduleEvictionTimer();\n  }\n\n  /**\n   * Update an item by id with partial changes.\n   */\n  update(id: T['id'], changes: Partial<T>): void {\n    if (this._disposed) {\n      throw new Error('Cannot update disposed Collection');\n    }\n\n    // O(1) existence check via index Map\n    const existing = this._index.get(id);\n    if (!existing) return;\n\n    // Check if anything actually changed (before any array work)\n    const keys = Object.keys(changes) as (keyof T)[];\n    const hasChanges = keys.some(key => changes[key] !== existing[key]);\n    if (!hasChanges) return;\n\n    const updated = { ...existing, ...changes, id };\n    const prev = this._items;\n    const idx = this._items.indexOf(existing);\n    const newItems = [...prev];\n    newItems[idx] = updated;\n    this._items = freeze(newItems);\n    this._index.set(id, updated);\n\n    this.notify(prev);\n  }\n\n  /**\n   * Replace all items.\n   */\n  reset(items: T[]): void {\n    if (this._disposed) {\n      throw new Error('Cannot reset disposed Collection');\n    }\n\n    const prev = this._items;\n\n    // Record timestamps for TTL\n    if (this._timestamps) {\n      this._timestamps.clear();\n      const now = Date.now();\n      for (const item of items) {\n        this._timestamps.set(item.id, now);\n      }\n    }\n\n    let result = [...items];\n\n    // Enforce capacity before freeze/notify\n    if (this._maxSize > 0 && result.length > this._maxSize) {\n      result = this._evictForCapacity(result);\n    }\n\n    this._items = freeze(result);\n    this.rebuildIndex();\n\n    this.notify(prev);\n    this._scheduleEvictionTimer();\n  }\n\n  /**\n   * Remove all items.\n   */\n  clear(): void {\n    if (this._disposed) {\n      throw new Error('Cannot clear disposed Collection');\n    }\n\n    if (this._items.length === 0) {\n      return;\n    }\n\n    const prev = this._items;\n    this._items = freeze([] as T[]);\n    this._index.clear();\n    this._timestamps?.clear();\n    this._clearEvictionTimer();\n\n    this.notify(prev);\n  }\n\n  /**\n   * Snapshot current state, apply callback mutations, and return a rollback function.\n   * Rollback restores items to pre-callback state regardless of later mutations.\n   */\n  optimistic(callback: () => void): () => void {\n    if (this._disposed) {\n      throw new Error('Cannot perform optimistic update on disposed Collection');\n    }\n\n    const snapshot = this._items;\n    const timestampSnapshot = this._timestamps ? new Map(this._timestamps) : null;\n    callback();\n\n    let rolledBack = false;\n    return () => {\n      if (rolledBack || this._disposed) return;\n      rolledBack = true;\n\n      const prev = this._items;\n      this._items = snapshot;\n      if (timestampSnapshot) {\n        this._timestamps = timestampSnapshot;\n      }\n      this.rebuildIndex();\n      this.notify(prev);\n      this._scheduleEvictionTimer();\n    };\n  }\n\n  // ── Query Methods (pure, no notification) ──\n\n  /**\n   * Get item by id.\n   */\n  get(id: T['id']): T | undefined {\n    return this._index.get(id);\n  }\n\n  /**\n   * Check if item exists by id.\n   */\n  has(id: T['id']): boolean {\n    return this._index.has(id);\n  }\n\n  /**\n   * Find first item matching predicate.\n   */\n  find(predicate: (item: T) => boolean): T | undefined {\n    return this._items.find(predicate);\n  }\n\n  /**\n   * Filter items matching predicate.\n   */\n  filter(predicate: (item: T) => boolean): T[] {\n    return this._items.filter(predicate) as T[];\n  }\n\n  /**\n   * Return sorted copy.\n   */\n  sorted(compareFn: (a: T, b: T) => number): T[] {\n    return [...this._items].sort(compareFn);\n  }\n\n  /**\n   * Map items to new array.\n   */\n  map<U>(fn: (item: T) => U): U[] {\n    return this._items.map(fn);\n  }\n\n  // ── Subscribable interface ──\n\n  /** Subscribes to state changes. Returns an unsubscribe function. */\n  subscribe(listener: CollectionListener<T>): () => void {\n    if (this._disposed) {\n      return () => {};\n    }\n\n    this._listeners.add(listener);\n\n    return () => {\n      this._listeners.delete(listener);\n    };\n  }\n\n  /** Tears down the instance, releasing all subscriptions and resources. */\n  dispose(): void {\n    if (this._disposed) {\n      return;\n    }\n\n    this._disposed = true;\n    this._clearEvictionTimer();\n    this._abortController?.abort();\n    if (this._cleanups) {\n      for (const fn of this._cleanups) fn();\n      this._cleanups = null;\n    }\n    this.onDispose?.();\n    this._listeners.clear();\n    this._index.clear();\n    this._timestamps?.clear();\n  }\n\n  /** Registers a cleanup function to be called on dispose. @protected */\n  protected addCleanup(fn: () => void): void {\n    if (!this._cleanups) {\n      this._cleanups = [];\n    }\n    this._cleanups.push(fn);\n  }\n\n  /** Lifecycle hook called during dispose(). Override for custom teardown. @protected */\n  protected onDispose?(): void;\n\n  /**\n   * Called before items are auto-evicted by capacity or TTL.\n   * Override to filter which items get evicted, or veto entirely.\n   *\n   * @param items - Candidates for eviction\n   * @param reason - Why eviction is happening\n   * @returns void to proceed with all, false to veto, or T[] subset to evict only those\n   */\n  protected onEvict?(items: T[], reason: 'capacity' | 'ttl'): T[] | false | void;\n\n  private notify(prev: readonly T[]): void {\n    for (const listener of this._listeners) {\n      listener(this._items as T[], prev as T[]);\n    }\n  }\n\n  private rebuildIndex(): void {\n    this._index.clear();\n    for (const item of this._items) {\n      this._index.set(item.id, item);\n    }\n  }\n\n  // ── Eviction Internals ──\n\n  private _evictForCapacity(items: T[]): T[] {\n    const excess = items.length - this._maxSize;\n    if (excess <= 0) return items;\n\n    const candidates = items.slice(0, excess);\n    const toEvict = this._applyOnEvict(candidates, 'capacity');\n\n    if (toEvict === false) return items; // veto\n\n    if (toEvict.length === 0) return items; // nothing to evict\n\n    const evictIds = new Set(toEvict.map(item => item.id));\n    const result = items.filter(item => !evictIds.has(item.id));\n\n    // Clean up index and timestamps for evicted items\n    for (const item of toEvict) {\n      this._index.delete(item.id);\n      this._timestamps?.delete(item.id);\n    }\n\n    return result;\n  }\n\n  private _applyOnEvict(candidates: T[], reason: 'capacity' | 'ttl'): T[] | false {\n    if (!this.onEvict) return candidates;\n\n    const result = this.onEvict(candidates, reason);\n    if (result === false) {\n      // DEV warning when veto causes collection to exceed 2x MAX_SIZE\n      if (__DEV__ && reason === 'capacity' && this._maxSize > 0) {\n        const currentSize = this._items.length + candidates.length;\n        if (currentSize > this._maxSize * 2) {\n          console.warn(\n            `[mvc-kit] Collection exceeded 2x MAX_SIZE (${currentSize}/${this._maxSize}). ` +\n            `onEvict is vetoing eviction — this may cause unbounded growth.`\n          );\n        }\n      }\n      return false;\n    }\n    if (Array.isArray(result)) {\n      // Only include items that are actually in the current items\n      const candidateIds = new Set(candidates.map(c => c.id));\n      return result.filter(item => candidateIds.has(item.id));\n    }\n    return candidates; // void = proceed with all\n  }\n\n  private _sweepExpired(): void {\n    if (this._disposed || !this._timestamps || this._ttl <= 0) return;\n\n    const now = Date.now();\n    const ttl = this._ttl;\n    const expired: T[] = [];\n\n    for (const item of this._items) {\n      const ts = this._timestamps.get(item.id);\n      if (ts !== undefined && (now - ts) >= ttl) {\n        expired.push(item);\n      }\n    }\n\n    if (expired.length === 0) {\n      this._scheduleEvictionTimer();\n      return;\n    }\n\n    const toEvict = this._applyOnEvict(expired, 'ttl');\n\n    if (toEvict === false) {\n      this._scheduleEvictionTimer();\n      return;\n    }\n\n    if (toEvict.length === 0) {\n      this._scheduleEvictionTimer();\n      return;\n    }\n\n    const evictIds = new Set(toEvict.map(item => item.id));\n    const prev = this._items;\n    this._items = freeze(\n      (prev as T[]).filter((item: T) => !evictIds.has(item.id))\n    );\n\n    for (const item of toEvict) {\n      this._index.delete(item.id);\n      this._timestamps.delete(item.id);\n    }\n\n    this.notify(prev);\n    this._scheduleEvictionTimer();\n  }\n\n  private _scheduleEvictionTimer(): void {\n    this._clearEvictionTimer();\n\n    if (this._disposed || !this._timestamps || this._ttl <= 0 || this._timestamps.size === 0) return;\n\n    const now = Date.now();\n    const ttl = this._ttl;\n    let earliest = Infinity;\n\n    for (const ts of this._timestamps.values()) {\n      if (ts < earliest) earliest = ts;\n    }\n\n    const delay = Math.max(0, (earliest + ttl) - now);\n    this._evictionTimer = setTimeout(() => this._sweepExpired(), delay);\n  }\n\n  private _clearEvictionTimer(): void {\n    if (this._evictionTimer !== null) {\n      clearTimeout(this._evictionTimer);\n      this._evictionTimer = null;\n    }\n  }\n}\n"],"names":["prev","result"],"mappings":";;AAEA,MAAM,UAAU,OAAO,oBAAoB,eAAe;AAE1D,SAAS,OAAU,KAAW;AAC5B,SAAO,UAAU,OAAO,OAAO,GAAG,IAAS;AAC7C;AAQO,MAAM,WAA0F;AAAA;AAAA,EAErG,OAAO,WAAW;AAAA;AAAA,EAElB,OAAO,MAAM;AAAA,EAEL,SAAuB,CAAA;AAAA,EACvB,YAAY;AAAA,EACZ,iCAAiB,IAAA;AAAA,EACjB,6BAAa,IAAA;AAAA,EACb,mBAA2C;AAAA,EAC3C,YAAmC;AAAA,EACnC,cAA2C;AAAA,EAC3C,iBAAuD;AAAA,EAE/D,YAAY,eAAoB,IAAI;AAClC,QAAI,SAAS,CAAC,GAAG,YAAY;AAE7B,QAAI,KAAK,OAAO,GAAG;AACjB,WAAK,kCAAkB,IAAA;AACvB,YAAM,MAAM,KAAK,IAAA;AACjB,iBAAW,QAAQ,QAAQ;AACzB,aAAK,YAAY,IAAI,KAAK,IAAI,GAAG;AAAA,MACnC;AAAA,IACF;AAEA,QAAI,KAAK,WAAW,KAAK,OAAO,SAAS,KAAK,UAAU;AAEtD,YAAM,SAAS,OAAO,SAAS,KAAK;AACpC,YAAM,UAAU,OAAO,MAAM,GAAG,MAAM;AACtC,eAAS,OAAO,MAAM,MAAM;AAC5B,iBAAW,QAAQ,SAAS;AAC1B,aAAK,aAAa,OAAO,KAAK,EAAE;AAAA,MAClC;AAAA,IACF;AAEA,SAAK,SAAS,OAAO,MAAM;AAC3B,SAAK,aAAA;AACL,SAAK,uBAAA;AAAA,EACP;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,QAAa;AACf,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,QAAa;AACf,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,SAAiB;AACnB,WAAO,KAAK,OAAO;AAAA,EACrB;AAAA;AAAA,EAGA,IAAI,WAAoB;AACtB,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,gBAA6B;AAC/B,QAAI,CAAC,KAAK,kBAAkB;AAC1B,WAAK,mBAAmB,IAAI,gBAAA;AAAA,IAC9B;AACA,WAAO,KAAK,iBAAiB;AAAA,EAC/B;AAAA;AAAA,EAIA,IAAY,WAAmB;AAC7B,WAAQ,KAAK,YAAkC;AAAA,EACjD;AAAA,EAEA,IAAY,OAAe;AACzB,WAAQ,KAAK,YAAkC;AAAA,EACjD;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,OAAkB;AACvB,QAAI,KAAK,WAAW;AAClB,YAAM,IAAI,MAAM,mCAAmC;AAAA,IACrD;AAEA,QAAI,MAAM,WAAW,GAAG;AACtB;AAAA,IACF;AAGA,QAAI,MAAM,WAAW,GAAG;AACtB,YAAM,OAAO,MAAM,CAAC;AACpB,UAAI,KAAK,OAAO,IAAI,KAAK,EAAE,EAAG;AAC9B,YAAMA,QAAO,KAAK;AAClB,UAAIC,UAAS,CAAC,GAAGD,OAAM,IAAI;AAC3B,WAAK,OAAO,IAAI,KAAK,IAAI,IAAI;AAC7B,UAAI,KAAK,YAAa,MAAK,YAAY,IAAI,KAAK,IAAI,KAAK,KAAK;AAC9D,UAAI,KAAK,WAAW,KAAKC,QAAO,SAAS,KAAK,UAAU;AACtDA,kBAAS,KAAK,kBAAkBA,OAAM;AAAA,MACxC;AACA,WAAK,SAAS,OAAOA,OAAM;AAC3B,WAAK,OAAOD,KAAI;AAChB,WAAK,uBAAA;AACL;AAAA,IACF;AAGA,UAAM,2BAAW,IAAA;AACjB,UAAM,WAAgB,CAAA;AACtB,eAAW,QAAQ,OAAO;AACxB,UAAI,CAAC,KAAK,OAAO,IAAI,KAAK,EAAE,KAAK,CAAC,KAAK,IAAI,KAAK,EAAE,GAAG;AACnD,iBAAS,KAAK,IAAI;AAClB,aAAK,IAAI,KAAK,EAAE;AAAA,MAClB;AAAA,IACF;AACA,QAAI,SAAS,WAAW,EAAG;AAE3B,UAAM,OAAO,KAAK;AAClB,QAAI,SAAS,CAAC,GAAG,MAAM,GAAG,QAAQ;AAElC,eAAW,QAAQ,UAAU;AAC3B,WAAK,OAAO,IAAI,KAAK,IAAI,IAAI;AAAA,IAC/B;AAGA,QAAI,KAAK,aAAa;AACpB,YAAM,MAAM,KAAK,IAAA;AACjB,iBAAW,QAAQ,UAAU;AAC3B,aAAK,YAAY,IAAI,KAAK,IAAI,GAAG;AAAA,MACnC;AAAA,IACF;AAGA,QAAI,KAAK,WAAW,KAAK,OAAO,SAAS,KAAK,UAAU;AACtD,eAAS,KAAK,kBAAkB,MAAM;AAAA,IACxC;AAEA,SAAK,SAAS,OAAO,MAAM;AAC3B,SAAK,OAAO,IAAI;AAChB,SAAK,uBAAA;AAAA,EACP;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,UAAU,OAAkB;AAC1B,QAAI,KAAK,WAAW;AAClB,YAAM,IAAI,MAAM,sCAAsC;AAAA,IACxD;AACA,QAAI,MAAM,WAAW,EAAG;AAGxB,UAAM,+BAAe,IAAA;AACrB,eAAW,QAAQ,OAAO;AACxB,eAAS,IAAI,KAAK,IAAI,IAAI;AAAA,IAC5B;AAEA,UAAM,OAAO,KAAK;AAClB,QAAI,UAAU;AACd,UAAM,+BAAe,IAAA;AACrB,UAAM,WAAgB,CAAA;AAGtB,eAAW,YAAY,MAAM;AAC3B,UAAI,SAAS,IAAI,SAAS,EAAE,GAAG;AAC7B,cAAM,cAAc,SAAS,IAAI,SAAS,EAAE;AAC5C,YAAI,gBAAgB,SAAU,WAAU;AACxC,iBAAS,KAAK,WAAW;AACzB,iBAAS,IAAI,SAAS,EAAE;AAAA,MAC1B,OAAO;AACL,iBAAS,KAAK,QAAQ;AAAA,MACxB;AAAA,IACF;AAGA,eAAW,CAAC,IAAI,IAAI,KAAK,UAAU;AACjC,UAAI,CAAC,SAAS,IAAI,EAAE,GAAG;AACrB,iBAAS,KAAK,IAAI;AAClB,kBAAU;AAAA,MACZ;AAAA,IACF;AAEA,QAAI,CAAC,QAAS;AAGd,QAAI,KAAK,aAAa;AACpB,YAAM,MAAM,KAAK,IAAA;AACjB,iBAAW,CAAC,EAAE,KAAK,UAAU;AAC3B,aAAK,YAAY,IAAI,IAAI,GAAG;AAAA,MAC9B;AAAA,IACF;AAEA,eAAW,CAAC,IAAI,IAAI,KAAK,UAAU;AACjC,WAAK,OAAO,IAAI,IAAI,IAAI;AAAA,IAC1B;AAGA,QAAI,SAAS;AACb,QAAI,KAAK,WAAW,KAAK,OAAO,SAAS,KAAK,UAAU;AACtD,eAAS,KAAK,kBAAkB,MAAM;AAAA,IACxC;AAEA,SAAK,SAAS,OAAO,MAAM;AAC3B,SAAK,OAAO,IAAI;AAChB,SAAK,uBAAA;AAAA,EACP;AAAA;AAAA;AAAA;AAAA,EAKA,UAAU,KAAsB;AAC9B,QAAI,KAAK,WAAW;AAClB,YAAM,IAAI,MAAM,wCAAwC;AAAA,IAC1D;AAEA,QAAI,IAAI,WAAW,GAAG;AACpB;AAAA,IACF;AAEA,UAAM,QAAQ,IAAI,IAAI,GAAG;AACzB,UAAM,WAAW,KAAK,OAAO,OAAO,CAAA,SAAQ,CAAC,MAAM,IAAI,KAAK,EAAE,CAAC;AAE/D,QAAI,SAAS,WAAW,KAAK,OAAO,QAAQ;AAC1C;AAAA,IACF;AAEA,UAAM,OAAO,KAAK;AAClB,SAAK,SAAS,OAAO,QAAQ;AAE7B,eAAW,MAAM,KAAK;AACpB,WAAK,OAAO,OAAO,EAAE;AACrB,WAAK,aAAa,OAAO,EAAE;AAAA,IAC7B;AAEA,SAAK,OAAO,IAAI;AAChB,SAAK,uBAAA;AAAA,EACP;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,IAAa,SAA2B;AAC7C,QAAI,KAAK,WAAW;AAClB,YAAM,IAAI,MAAM,mCAAmC;AAAA,IACrD;AAGA,UAAM,WAAW,KAAK,OAAO,IAAI,EAAE;AACnC,QAAI,CAAC,SAAU;AAGf,UAAM,OAAO,OAAO,KAAK,OAAO;AAChC,UAAM,aAAa,KAAK,KAAK,CAAA,QAAO,QAAQ,GAAG,MAAM,SAAS,GAAG,CAAC;AAClE,QAAI,CAAC,WAAY;AAEjB,UAAM,UAAU,EAAE,GAAG,UAAU,GAAG,SAAS,GAAA;AAC3C,UAAM,OAAO,KAAK;AAClB,UAAM,MAAM,KAAK,OAAO,QAAQ,QAAQ;AACxC,UAAM,WAAW,CAAC,GAAG,IAAI;AACzB,aAAS,GAAG,IAAI;AAChB,SAAK,SAAS,OAAO,QAAQ;AAC7B,SAAK,OAAO,IAAI,IAAI,OAAO;AAE3B,SAAK,OAAO,IAAI;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,OAAkB;AACtB,QAAI,KAAK,WAAW;AAClB,YAAM,IAAI,MAAM,kCAAkC;AAAA,IACpD;AAEA,UAAM,OAAO,KAAK;AAGlB,QAAI,KAAK,aAAa;AACpB,WAAK,YAAY,MAAA;AACjB,YAAM,MAAM,KAAK,IAAA;AACjB,iBAAW,QAAQ,OAAO;AACxB,aAAK,YAAY,IAAI,KAAK,IAAI,GAAG;AAAA,MACnC;AAAA,IACF;AAEA,QAAI,SAAS,CAAC,GAAG,KAAK;AAGtB,QAAI,KAAK,WAAW,KAAK,OAAO,SAAS,KAAK,UAAU;AACtD,eAAS,KAAK,kBAAkB,MAAM;AAAA,IACxC;AAEA,SAAK,SAAS,OAAO,MAAM;AAC3B,SAAK,aAAA;AAEL,SAAK,OAAO,IAAI;AAChB,SAAK,uBAAA;AAAA,EACP;AAAA;AAAA;AAAA;AAAA,EAKA,QAAc;AACZ,QAAI,KAAK,WAAW;AAClB,YAAM,IAAI,MAAM,kCAAkC;AAAA,IACpD;AAEA,QAAI,KAAK,OAAO,WAAW,GAAG;AAC5B;AAAA,IACF;AAEA,UAAM,OAAO,KAAK;AAClB,SAAK,SAAS,OAAO,EAAS;AAC9B,SAAK,OAAO,MAAA;AACZ,SAAK,aAAa,MAAA;AAClB,SAAK,oBAAA;AAEL,SAAK,OAAO,IAAI;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,WAAW,UAAkC;AAC3C,QAAI,KAAK,WAAW;AAClB,YAAM,IAAI,MAAM,yDAAyD;AAAA,IAC3E;AAEA,UAAM,WAAW,KAAK;AACtB,UAAM,oBAAoB,KAAK,cAAc,IAAI,IAAI,KAAK,WAAW,IAAI;AACzE,aAAA;AAEA,QAAI,aAAa;AACjB,WAAO,MAAM;AACX,UAAI,cAAc,KAAK,UAAW;AAClC,mBAAa;AAEb,YAAM,OAAO,KAAK;AAClB,WAAK,SAAS;AACd,UAAI,mBAAmB;AACrB,aAAK,cAAc;AAAA,MACrB;AACA,WAAK,aAAA;AACL,WAAK,OAAO,IAAI;AAChB,WAAK,uBAAA;AAAA,IACP;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,IAAI,IAA4B;AAC9B,WAAO,KAAK,OAAO,IAAI,EAAE;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,IAAsB;AACxB,WAAO,KAAK,OAAO,IAAI,EAAE;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA,EAKA,KAAK,WAAgD;AACnD,WAAO,KAAK,OAAO,KAAK,SAAS;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,WAAsC;AAC3C,WAAO,KAAK,OAAO,OAAO,SAAS;AAAA,EACrC;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,WAAwC;AAC7C,WAAO,CAAC,GAAG,KAAK,MAAM,EAAE,KAAK,SAAS;AAAA,EACxC;AAAA;AAAA;AAAA;AAAA,EAKA,IAAO,IAAyB;AAC9B,WAAO,KAAK,OAAO,IAAI,EAAE;AAAA,EAC3B;AAAA;AAAA;AAAA,EAKA,UAAU,UAA6C;AACrD,QAAI,KAAK,WAAW;AAClB,aAAO,MAAM;AAAA,MAAC;AAAA,IAChB;AAEA,SAAK,WAAW,IAAI,QAAQ;AAE5B,WAAO,MAAM;AACX,WAAK,WAAW,OAAO,QAAQ;AAAA,IACjC;AAAA,EACF;AAAA;AAAA,EAGA,UAAgB;AACd,QAAI,KAAK,WAAW;AAClB;AAAA,IACF;AAEA,SAAK,YAAY;AACjB,SAAK,oBAAA;AACL,SAAK,kBAAkB,MAAA;AACvB,QAAI,KAAK,WAAW;AAClB,iBAAW,MAAM,KAAK,UAAW,IAAA;AACjC,WAAK,YAAY;AAAA,IACnB;AACA,SAAK,YAAA;AACL,SAAK,WAAW,MAAA;AAChB,SAAK,OAAO,MAAA;AACZ,SAAK,aAAa,MAAA;AAAA,EACpB;AAAA;AAAA,EAGU,WAAW,IAAsB;AACzC,QAAI,CAAC,KAAK,WAAW;AACnB,WAAK,YAAY,CAAA;AAAA,IACnB;AACA,SAAK,UAAU,KAAK,EAAE;AAAA,EACxB;AAAA,EAeQ,OAAO,MAA0B;AACvC,eAAW,YAAY,KAAK,YAAY;AACtC,eAAS,KAAK,QAAe,IAAW;AAAA,IAC1C;AAAA,EACF;AAAA,EAEQ,eAAqB;AAC3B,SAAK,OAAO,MAAA;AACZ,eAAW,QAAQ,KAAK,QAAQ;AAC9B,WAAK,OAAO,IAAI,KAAK,IAAI,IAAI;AAAA,IAC/B;AAAA,EACF;AAAA;AAAA,EAIQ,kBAAkB,OAAiB;AACzC,UAAM,SAAS,MAAM,SAAS,KAAK;AACnC,QAAI,UAAU,EAAG,QAAO;AAExB,UAAM,aAAa,MAAM,MAAM,GAAG,MAAM;AACxC,UAAM,UAAU,KAAK,cAAc,YAAY,UAAU;AAEzD,QAAI,YAAY,MAAO,QAAO;AAE9B,QAAI,QAAQ,WAAW,EAAG,QAAO;AAEjC,UAAM,WAAW,IAAI,IAAI,QAAQ,IAAI,CAAA,SAAQ,KAAK,EAAE,CAAC;AACrD,UAAM,SAAS,MAAM,OAAO,CAAA,SAAQ,CAAC,SAAS,IAAI,KAAK,EAAE,CAAC;AAG1D,eAAW,QAAQ,SAAS;AAC1B,WAAK,OAAO,OAAO,KAAK,EAAE;AAC1B,WAAK,aAAa,OAAO,KAAK,EAAE;AAAA,IAClC;AAEA,WAAO;AAAA,EACT;AAAA,EAEQ,cAAc,YAAiB,QAAyC;AAC9E,QAAI,CAAC,KAAK,QAAS,QAAO;AAE1B,UAAM,SAAS,KAAK,QAAQ,YAAY,MAAM;AAC9C,QAAI,WAAW,OAAO;AAEpB,UAAI,WAAW,WAAW,cAAc,KAAK,WAAW,GAAG;AACzD,cAAM,cAAc,KAAK,OAAO,SAAS,WAAW;AACpD,YAAI,cAAc,KAAK,WAAW,GAAG;AACnC,kBAAQ;AAAA,YACN,8CAA8C,WAAW,IAAI,KAAK,QAAQ;AAAA,UAAA;AAAA,QAG9E;AAAA,MACF;AACA,aAAO;AAAA,IACT;AACA,QAAI,MAAM,QAAQ,MAAM,GAAG;AAEzB,YAAM,eAAe,IAAI,IAAI,WAAW,IAAI,CAAA,MAAK,EAAE,EAAE,CAAC;AACtD,aAAO,OAAO,OAAO,CAAA,SAAQ,aAAa,IAAI,KAAK,EAAE,CAAC;AAAA,IACxD;AACA,WAAO;AAAA,EACT;AAAA,EAEQ,gBAAsB;AAC5B,QAAI,KAAK,aAAa,CAAC,KAAK,eAAe,KAAK,QAAQ,EAAG;AAE3D,UAAM,MAAM,KAAK,IAAA;AACjB,UAAM,MAAM,KAAK;AACjB,UAAM,UAAe,CAAA;AAErB,eAAW,QAAQ,KAAK,QAAQ;AAC9B,YAAM,KAAK,KAAK,YAAY,IAAI,KAAK,EAAE;AACvC,UAAI,OAAO,UAAc,MAAM,MAAO,KAAK;AACzC,gBAAQ,KAAK,IAAI;AAAA,MACnB;AAAA,IACF;AAEA,QAAI,QAAQ,WAAW,GAAG;AACxB,WAAK,uBAAA;AACL;AAAA,IACF;AAEA,UAAM,UAAU,KAAK,cAAc,SAAS,KAAK;AAEjD,QAAI,YAAY,OAAO;AACrB,WAAK,uBAAA;AACL;AAAA,IACF;AAEA,QAAI,QAAQ,WAAW,GAAG;AACxB,WAAK,uBAAA;AACL;AAAA,IACF;AAEA,UAAM,WAAW,IAAI,IAAI,QAAQ,IAAI,CAAA,SAAQ,KAAK,EAAE,CAAC;AACrD,UAAM,OAAO,KAAK;AAClB,SAAK,SAAS;AAAA,MACX,KAAa,OAAO,CAAC,SAAY,CAAC,SAAS,IAAI,KAAK,EAAE,CAAC;AAAA,IAAA;AAG1D,eAAW,QAAQ,SAAS;AAC1B,WAAK,OAAO,OAAO,KAAK,EAAE;AAC1B,WAAK,YAAY,OAAO,KAAK,EAAE;AAAA,IACjC;AAEA,SAAK,OAAO,IAAI;AAChB,SAAK,uBAAA;AAAA,EACP;AAAA,EAEQ,yBAA+B;AACrC,SAAK,oBAAA;AAEL,QAAI,KAAK,aAAa,CAAC,KAAK,eAAe,KAAK,QAAQ,KAAK,KAAK,YAAY,SAAS,EAAG;AAE1F,UAAM,MAAM,KAAK,IAAA;AACjB,UAAM,MAAM,KAAK;AACjB,QAAI,WAAW;AAEf,eAAW,MAAM,KAAK,YAAY,OAAA,GAAU;AAC1C,UAAI,KAAK,SAAU,YAAW;AAAA,IAChC;AAEA,UAAM,QAAQ,KAAK,IAAI,GAAI,WAAW,MAAO,GAAG;AAChD,SAAK,iBAAiB,WAAW,MAAM,KAAK,cAAA,GAAiB,KAAK;AAAA,EACpE;AAAA,EAEQ,sBAA4B;AAClC,QAAI,KAAK,mBAAmB,MAAM;AAChC,mBAAa,KAAK,cAAc;AAChC,WAAK,iBAAiB;AAAA,IACxB;AAAA,EACF;AACF;;"}
+{"version":3,"file":"Collection.cjs","sources":["../src/Collection.ts"],"sourcesContent":["import type { Listener, Subscribable } from './types';\n\nconst __DEV__ = typeof __MVC_KIT_DEV__ !== 'undefined' && __MVC_KIT_DEV__;\n\nfunction freeze<T>(obj: T): T {\n  return __DEV__ ? Object.freeze(obj) as T : obj;\n}\n\ntype CollectionState<T> = T[];\ntype CollectionListener<T> = Listener<CollectionState<T>>;\n\n/**\n * Reactive typed array with CRUD and query methods.\n */\nexport class Collection<T extends { id: string | number }> implements Subscribable<CollectionState<T>> {\n  /** Maximum number of items before FIFO eviction. 0 = unlimited. */\n  static MAX_SIZE = 0;\n  /** Time-to-live in milliseconds. 0 = no expiry. */\n  static TTL = 0;\n\n  private _items: readonly T[] = [];\n  private _disposed = false;\n  private _listeners = new Set<CollectionListener<T>>();\n  private _index = new Map<T['id'], T>();\n  private _abortController: AbortController | null = null;\n  private _cleanups: (() => void)[] | null = null;\n  private _timestamps: Map<T['id'], number> | null = null;\n  private _evictionTimer: ReturnType<typeof setTimeout> | null = null;\n\n  constructor(initialItems: T[] = []) {\n    let result = [...initialItems];\n\n    if (this._ttl > 0) {\n      this._timestamps = new Map();\n      const now = Date.now();\n      for (const item of result) {\n        this._timestamps.set(item.id, now);\n      }\n    }\n\n    if (this._maxSize > 0 && result.length > this._maxSize) {\n      // FIFO: trim from the front (oldest items)\n      const excess = result.length - this._maxSize;\n      const evicted = result.slice(0, excess);\n      result = result.slice(excess);\n      for (const item of evicted) {\n        this._timestamps?.delete(item.id);\n      }\n    }\n\n    this._items = freeze(result);\n    this.rebuildIndex();\n    this._scheduleEvictionTimer();\n  }\n\n  /**\n   * Alias for Subscribable compatibility.\n   */\n  get state(): T[] {\n    return this._items as T[];\n  }\n\n  /** The raw array of items. */\n  get items(): T[] {\n    return this._items as T[];\n  }\n\n  /** Number of items in the collection. */\n  get length(): number {\n    return this._items.length;\n  }\n\n  /** Whether this instance has been disposed. */\n  get disposed(): boolean {\n    return this._disposed;\n  }\n\n  /** AbortSignal that fires when this instance is disposed. Lazily created. */\n  get disposeSignal(): AbortSignal {\n    if (!this._abortController) {\n      this._abortController = new AbortController();\n    }\n    return this._abortController.signal;\n  }\n\n  // ── Config Accessors ──\n\n  private get _maxSize(): number {\n    return (this.constructor as typeof Collection).MAX_SIZE;\n  }\n\n  private get _ttl(): number {\n    return (this.constructor as typeof Collection).TTL;\n  }\n\n  // ── CRUD Methods (notify listeners) ──\n\n  /**\n   * Add one or more items. Items with existing IDs are silently skipped.\n   */\n  add(...items: T[]): void {\n    if (this._disposed) {\n      throw new Error('Cannot add to disposed Collection');\n    }\n\n    if (items.length === 0) {\n      return;\n    }\n\n    // Fast path: single item (most common case)\n    if (items.length === 1) {\n      const item = items[0];\n      if (this._index.has(item.id)) return;\n      const prev = this._items;\n      let result = [...prev, item];\n      this._index.set(item.id, item);\n      if (this._timestamps) this._timestamps.set(item.id, Date.now());\n      if (this._maxSize > 0 && result.length > this._maxSize) {\n        result = this._evictForCapacity(result);\n      }\n      this._items = freeze(result);\n      this.notify(prev);\n      this._scheduleEvictionTimer();\n      return;\n    }\n\n    // Multi-item path\n    const seen = new Set<T['id']>();\n    const newItems: T[] = [];\n    for (const item of items) {\n      if (!this._index.has(item.id) && !seen.has(item.id)) {\n        newItems.push(item);\n        seen.add(item.id);\n      }\n    }\n    if (newItems.length === 0) return;\n\n    const prev = this._items;\n    let result = [...prev, ...newItems];\n\n    for (const item of newItems) {\n      this._index.set(item.id, item);\n    }\n\n    // Record timestamps for TTL\n    if (this._timestamps) {\n      const now = Date.now();\n      for (const item of newItems) {\n        this._timestamps.set(item.id, now);\n      }\n    }\n\n    // Enforce capacity before freeze/notify\n    if (this._maxSize > 0 && result.length > this._maxSize) {\n      result = this._evictForCapacity(result);\n    }\n\n    this._items = freeze(result);\n    this.notify(prev);\n    this._scheduleEvictionTimer();\n  }\n\n  /**\n   * Add or replace items by ID. Existing items are replaced in-place\n   * (preserving array position); new items are appended. Deduplicates\n   * input — last occurrence wins. No-op if nothing changed (reference\n   * comparison).\n   */\n  upsert(...items: T[]): void {\n    if (this._disposed) {\n      throw new Error('Cannot upsert on disposed Collection');\n    }\n    if (items.length === 0) return;\n\n    // Fast path: single item (most common case — channel messages, real-time updates)\n    if (items.length === 1) {\n      const item = items[0];\n      const existing = this._index.get(item.id);\n\n      if (existing) {\n        // Replace in-place — skip if same reference\n        if (existing === item) return;\n        const prev = this._items;\n        const idx = this._items.indexOf(existing);\n        const newItems = [...prev];\n        newItems[idx] = item;\n        this._index.set(item.id, item);\n        if (this._timestamps) this._timestamps.set(item.id, Date.now());\n        this._items = freeze(newItems);\n        this.notify(prev);\n      } else {\n        // New item — append (with capacity enforcement)\n        const prev = this._items;\n        let result = [...prev, item];\n        this._index.set(item.id, item);\n        if (this._timestamps) this._timestamps.set(item.id, Date.now());\n        if (this._maxSize > 0 && result.length > this._maxSize) {\n          result = this._evictForCapacity(result);\n        }\n        this._items = freeze(result);\n        this.notify(prev);\n        this._scheduleEvictionTimer();\n      }\n      return;\n    }\n\n    // Multi-item path: deduplicate input — last occurrence wins\n    const incoming = new Map<T['id'], T>();\n    for (const item of items) {\n      incoming.set(item.id, item);\n    }\n\n    const prev = this._items;\n    let changed = false;\n    const replaced = new Set<T['id']>();\n    const newArray: T[] = [];\n\n    // Replace existing items in-place\n    for (const existing of prev) {\n      if (incoming.has(existing.id)) {\n        const replacement = incoming.get(existing.id)!;\n        if (replacement !== existing) changed = true;\n        newArray.push(replacement);\n        replaced.add(existing.id);\n      } else {\n        newArray.push(existing);\n      }\n    }\n\n    // Append genuinely new items\n    for (const [id, item] of incoming) {\n      if (!replaced.has(id)) {\n        newArray.push(item);\n        changed = true;\n      }\n    }\n\n    if (!changed) return;\n\n    // Record/refresh timestamps for TTL (upsert refreshes existing)\n    if (this._timestamps) {\n      const now = Date.now();\n      for (const [id] of incoming) {\n        this._timestamps.set(id, now);\n      }\n    }\n\n    for (const [id, item] of incoming) {\n      this._index.set(id, item);\n    }\n\n    // Enforce capacity before freeze/notify\n    let result = newArray;\n    if (this._maxSize > 0 && result.length > this._maxSize) {\n      result = this._evictForCapacity(result);\n    }\n\n    this._items = freeze(result);\n    this.notify(prev);\n    this._scheduleEvictionTimer();\n  }\n\n  /**\n   * Remove items by id(s).\n   */\n  remove(...ids: T['id'][]): void {\n    if (this._disposed) {\n      throw new Error('Cannot remove from disposed Collection');\n    }\n\n    if (ids.length === 0) {\n      return;\n    }\n\n    // Fast path: single id (most common case)\n    if (ids.length === 1) {\n      const id = ids[0];\n      if (!this._index.has(id)) return;\n      const prev = this._items;\n      this._items = freeze(prev.filter(item => item.id !== id));\n      this._index.delete(id);\n      this._timestamps?.delete(id);\n      this.notify(prev);\n      this._scheduleEvictionTimer();\n      return;\n    }\n\n    // Multi-id path\n    const idSet = new Set(ids);\n    const filtered = this._items.filter(item => !idSet.has(item.id));\n\n    if (filtered.length === this._items.length) {\n      return; // No items removed\n    }\n\n    const prev = this._items;\n    this._items = freeze(filtered);\n\n    for (const id of ids) {\n      this._index.delete(id);\n      this._timestamps?.delete(id);\n    }\n\n    this.notify(prev);\n    this._scheduleEvictionTimer();\n  }\n\n  /**\n   * Update an item by id with partial changes.\n   */\n  update(id: T['id'], changes: Partial<T>): void {\n    if (this._disposed) {\n      throw new Error('Cannot update disposed Collection');\n    }\n\n    // O(1) existence check via index Map\n    const existing = this._index.get(id);\n    if (!existing) return;\n\n    // Check if anything actually changed (before any array work)\n    const keys = Object.keys(changes) as (keyof T)[];\n    const hasChanges = keys.some(key => changes[key] !== existing[key]);\n    if (!hasChanges) return;\n\n    const updated = { ...existing, ...changes, id };\n    const prev = this._items;\n    const idx = this._items.indexOf(existing);\n    const newItems = [...prev];\n    newItems[idx] = updated;\n    this._items = freeze(newItems);\n    this._index.set(id, updated);\n\n    this.notify(prev);\n  }\n\n  /**\n   * Replace all items.\n   */\n  reset(items: T[]): void {\n    if (this._disposed) {\n      throw new Error('Cannot reset disposed Collection');\n    }\n\n    const prev = this._items;\n\n    // Record timestamps for TTL\n    if (this._timestamps) {\n      this._timestamps.clear();\n      const now = Date.now();\n      for (const item of items) {\n        this._timestamps.set(item.id, now);\n      }\n    }\n\n    let result = [...items];\n\n    // Enforce capacity before freeze/notify\n    if (this._maxSize > 0 && result.length > this._maxSize) {\n      result = this._evictForCapacity(result);\n    }\n\n    this._items = freeze(result);\n    this.rebuildIndex();\n\n    this.notify(prev);\n    this._scheduleEvictionTimer();\n  }\n\n  /**\n   * Remove all items.\n   */\n  clear(): void {\n    if (this._disposed) {\n      throw new Error('Cannot clear disposed Collection');\n    }\n\n    if (this._items.length === 0) {\n      return;\n    }\n\n    const prev = this._items;\n    this._items = freeze([] as T[]);\n    this._index.clear();\n    this._timestamps?.clear();\n    this._clearEvictionTimer();\n\n    this.notify(prev);\n  }\n\n  /**\n   * Snapshot current state, apply callback mutations, and return a rollback function.\n   * Rollback restores items to pre-callback state regardless of later mutations.\n   */\n  optimistic(callback: () => void): () => void {\n    if (this._disposed) {\n      throw new Error('Cannot perform optimistic update on disposed Collection');\n    }\n\n    const snapshot = this._items;\n    const timestampSnapshot = this._timestamps ? new Map(this._timestamps) : null;\n    callback();\n\n    let rolledBack = false;\n    return () => {\n      if (rolledBack || this._disposed) return;\n      rolledBack = true;\n\n      const prev = this._items;\n      this._items = snapshot;\n      if (timestampSnapshot) {\n        this._timestamps = timestampSnapshot;\n      }\n      this.rebuildIndex();\n      this.notify(prev);\n      this._scheduleEvictionTimer();\n    };\n  }\n\n  // ── Query Methods (pure, no notification) ──\n\n  /**\n   * Get item by id.\n   */\n  get(id: T['id']): T | undefined {\n    return this._index.get(id);\n  }\n\n  /**\n   * Check if item exists by id.\n   */\n  has(id: T['id']): boolean {\n    return this._index.has(id);\n  }\n\n  /**\n   * Find first item matching predicate.\n   */\n  find(predicate: (item: T) => boolean): T | undefined {\n    return this._items.find(predicate);\n  }\n\n  /**\n   * Filter items matching predicate.\n   */\n  filter(predicate: (item: T) => boolean): T[] {\n    return this._items.filter(predicate) as T[];\n  }\n\n  /**\n   * Return sorted copy.\n   */\n  sorted(compareFn: (a: T, b: T) => number): T[] {\n    return [...this._items].sort(compareFn);\n  }\n\n  /**\n   * Map items to new array.\n   */\n  map<U>(fn: (item: T) => U): U[] {\n    return this._items.map(fn);\n  }\n\n  // ── Subscribable interface ──\n\n  /** Subscribes to state changes. Returns an unsubscribe function. */\n  subscribe(listener: CollectionListener<T>): () => void {\n    if (this._disposed) {\n      return () => {};\n    }\n\n    this._listeners.add(listener);\n\n    return () => {\n      this._listeners.delete(listener);\n    };\n  }\n\n  /** Tears down the instance, releasing all subscriptions and resources. */\n  dispose(): void {\n    if (this._disposed) {\n      return;\n    }\n\n    this._disposed = true;\n    this._clearEvictionTimer();\n    this._abortController?.abort();\n    if (this._cleanups) {\n      for (const fn of this._cleanups) fn();\n      this._cleanups = null;\n    }\n    this.onDispose?.();\n    this._listeners.clear();\n    this._index.clear();\n    this._timestamps?.clear();\n  }\n\n  /** Registers a cleanup function to be called on dispose. @protected */\n  protected addCleanup(fn: () => void): void {\n    if (!this._cleanups) {\n      this._cleanups = [];\n    }\n    this._cleanups.push(fn);\n  }\n\n  /** Lifecycle hook called during dispose(). Override for custom teardown. @protected */\n  protected onDispose?(): void;\n\n  /**\n   * Called before items are auto-evicted by capacity or TTL.\n   * Override to filter which items get evicted, or veto entirely.\n   *\n   * @param items - Candidates for eviction\n   * @param reason - Why eviction is happening\n   * @returns void to proceed with all, false to veto, or T[] subset to evict only those\n   */\n  protected onEvict?(items: T[], reason: 'capacity' | 'ttl'): T[] | false | void;\n\n  private notify(prev: readonly T[]): void {\n    for (const listener of this._listeners) {\n      listener(this._items as T[], prev as T[]);\n    }\n  }\n\n  private rebuildIndex(): void {\n    this._index.clear();\n    for (const item of this._items) {\n      this._index.set(item.id, item);\n    }\n  }\n\n  // ── Eviction Internals ──\n\n  private _evictForCapacity(items: T[]): T[] {\n    const excess = items.length - this._maxSize;\n    if (excess <= 0) return items;\n\n    const candidates = items.slice(0, excess);\n    const toEvict = this._applyOnEvict(candidates, 'capacity');\n\n    if (toEvict === false) return items; // veto\n\n    if (toEvict.length === 0) return items; // nothing to evict\n\n    const evictIds = new Set(toEvict.map(item => item.id));\n    const result = items.filter(item => !evictIds.has(item.id));\n\n    // Clean up index and timestamps for evicted items\n    for (const item of toEvict) {\n      this._index.delete(item.id);\n      this._timestamps?.delete(item.id);\n    }\n\n    return result;\n  }\n\n  private _applyOnEvict(candidates: T[], reason: 'capacity' | 'ttl'): T[] | false {\n    if (!this.onEvict) return candidates;\n\n    const result = this.onEvict(candidates, reason);\n    if (result === false) {\n      // DEV warning when veto causes collection to exceed 2x MAX_SIZE\n      if (__DEV__ && reason === 'capacity' && this._maxSize > 0) {\n        const currentSize = this._items.length + candidates.length;\n        if (currentSize > this._maxSize * 2) {\n          console.warn(\n            `[mvc-kit] Collection exceeded 2x MAX_SIZE (${currentSize}/${this._maxSize}). ` +\n            `onEvict is vetoing eviction — this may cause unbounded growth.`\n          );\n        }\n      }\n      return false;\n    }\n    if (Array.isArray(result)) {\n      // Only include items that are actually in the current items\n      const candidateIds = new Set(candidates.map(c => c.id));\n      return result.filter(item => candidateIds.has(item.id));\n    }\n    return candidates; // void = proceed with all\n  }\n\n  private _sweepExpired(): void {\n    if (this._disposed || !this._timestamps || this._ttl <= 0) return;\n\n    const now = Date.now();\n    const ttl = this._ttl;\n    const expired: T[] = [];\n\n    for (const item of this._items) {\n      const ts = this._timestamps.get(item.id);\n      if (ts !== undefined && (now - ts) >= ttl) {\n        expired.push(item);\n      }\n    }\n\n    if (expired.length === 0) {\n      this._scheduleEvictionTimer();\n      return;\n    }\n\n    const toEvict = this._applyOnEvict(expired, 'ttl');\n\n    if (toEvict === false) {\n      this._scheduleEvictionTimer();\n      return;\n    }\n\n    if (toEvict.length === 0) {\n      this._scheduleEvictionTimer();\n      return;\n    }\n\n    const evictIds = new Set(toEvict.map(item => item.id));\n    const prev = this._items;\n    this._items = freeze(\n      (prev as T[]).filter((item: T) => !evictIds.has(item.id))\n    );\n\n    for (const item of toEvict) {\n      this._index.delete(item.id);\n      this._timestamps.delete(item.id);\n    }\n\n    this.notify(prev);\n    this._scheduleEvictionTimer();\n  }\n\n  private _scheduleEvictionTimer(): void {\n    this._clearEvictionTimer();\n\n    if (this._disposed || !this._timestamps || this._ttl <= 0 || this._timestamps.size === 0) return;\n\n    const now = Date.now();\n    const ttl = this._ttl;\n    let earliest = Infinity;\n\n    for (const ts of this._timestamps.values()) {\n      if (ts < earliest) earliest = ts;\n    }\n\n    const delay = Math.max(0, (earliest + ttl) - now);\n    this._evictionTimer = setTimeout(() => this._sweepExpired(), delay);\n  }\n\n  private _clearEvictionTimer(): void {\n    if (this._evictionTimer !== null) {\n      clearTimeout(this._evictionTimer);\n      this._evictionTimer = null;\n    }\n  }\n}\n"],"names":["prev","result"],"mappings":";;AAEA,MAAM,UAAU,OAAO,oBAAoB,eAAe;AAE1D,SAAS,OAAU,KAAW;AAC5B,SAAO,UAAU,OAAO,OAAO,GAAG,IAAS;AAC7C;AAQO,MAAM,WAA0F;AAAA;AAAA,EAErG,OAAO,WAAW;AAAA;AAAA,EAElB,OAAO,MAAM;AAAA,EAEL,SAAuB,CAAA;AAAA,EACvB,YAAY;AAAA,EACZ,iCAAiB,IAAA;AAAA,EACjB,6BAAa,IAAA;AAAA,EACb,mBAA2C;AAAA,EAC3C,YAAmC;AAAA,EACnC,cAA2C;AAAA,EAC3C,iBAAuD;AAAA,EAE/D,YAAY,eAAoB,IAAI;AAClC,QAAI,SAAS,CAAC,GAAG,YAAY;AAE7B,QAAI,KAAK,OAAO,GAAG;AACjB,WAAK,kCAAkB,IAAA;AACvB,YAAM,MAAM,KAAK,IAAA;AACjB,iBAAW,QAAQ,QAAQ;AACzB,aAAK,YAAY,IAAI,KAAK,IAAI,GAAG;AAAA,MACnC;AAAA,IACF;AAEA,QAAI,KAAK,WAAW,KAAK,OAAO,SAAS,KAAK,UAAU;AAEtD,YAAM,SAAS,OAAO,SAAS,KAAK;AACpC,YAAM,UAAU,OAAO,MAAM,GAAG,MAAM;AACtC,eAAS,OAAO,MAAM,MAAM;AAC5B,iBAAW,QAAQ,SAAS;AAC1B,aAAK,aAAa,OAAO,KAAK,EAAE;AAAA,MAClC;AAAA,IACF;AAEA,SAAK,SAAS,OAAO,MAAM;AAC3B,SAAK,aAAA;AACL,SAAK,uBAAA;AAAA,EACP;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,QAAa;AACf,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,QAAa;AACf,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,SAAiB;AACnB,WAAO,KAAK,OAAO;AAAA,EACrB;AAAA;AAAA,EAGA,IAAI,WAAoB;AACtB,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,gBAA6B;AAC/B,QAAI,CAAC,KAAK,kBAAkB;AAC1B,WAAK,mBAAmB,IAAI,gBAAA;AAAA,IAC9B;AACA,WAAO,KAAK,iBAAiB;AAAA,EAC/B;AAAA;AAAA,EAIA,IAAY,WAAmB;AAC7B,WAAQ,KAAK,YAAkC;AAAA,EACjD;AAAA,EAEA,IAAY,OAAe;AACzB,WAAQ,KAAK,YAAkC;AAAA,EACjD;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,OAAkB;AACvB,QAAI,KAAK,WAAW;AAClB,YAAM,IAAI,MAAM,mCAAmC;AAAA,IACrD;AAEA,QAAI,MAAM,WAAW,GAAG;AACtB;AAAA,IACF;AAGA,QAAI,MAAM,WAAW,GAAG;AACtB,YAAM,OAAO,MAAM,CAAC;AACpB,UAAI,KAAK,OAAO,IAAI,KAAK,EAAE,EAAG;AAC9B,YAAMA,QAAO,KAAK;AAClB,UAAIC,UAAS,CAAC,GAAGD,OAAM,IAAI;AAC3B,WAAK,OAAO,IAAI,KAAK,IAAI,IAAI;AAC7B,UAAI,KAAK,YAAa,MAAK,YAAY,IAAI,KAAK,IAAI,KAAK,KAAK;AAC9D,UAAI,KAAK,WAAW,KAAKC,QAAO,SAAS,KAAK,UAAU;AACtDA,kBAAS,KAAK,kBAAkBA,OAAM;AAAA,MACxC;AACA,WAAK,SAAS,OAAOA,OAAM;AAC3B,WAAK,OAAOD,KAAI;AAChB,WAAK,uBAAA;AACL;AAAA,IACF;AAGA,UAAM,2BAAW,IAAA;AACjB,UAAM,WAAgB,CAAA;AACtB,eAAW,QAAQ,OAAO;AACxB,UAAI,CAAC,KAAK,OAAO,IAAI,KAAK,EAAE,KAAK,CAAC,KAAK,IAAI,KAAK,EAAE,GAAG;AACnD,iBAAS,KAAK,IAAI;AAClB,aAAK,IAAI,KAAK,EAAE;AAAA,MAClB;AAAA,IACF;AACA,QAAI,SAAS,WAAW,EAAG;AAE3B,UAAM,OAAO,KAAK;AAClB,QAAI,SAAS,CAAC,GAAG,MAAM,GAAG,QAAQ;AAElC,eAAW,QAAQ,UAAU;AAC3B,WAAK,OAAO,IAAI,KAAK,IAAI,IAAI;AAAA,IAC/B;AAGA,QAAI,KAAK,aAAa;AACpB,YAAM,MAAM,KAAK,IAAA;AACjB,iBAAW,QAAQ,UAAU;AAC3B,aAAK,YAAY,IAAI,KAAK,IAAI,GAAG;AAAA,MACnC;AAAA,IACF;AAGA,QAAI,KAAK,WAAW,KAAK,OAAO,SAAS,KAAK,UAAU;AACtD,eAAS,KAAK,kBAAkB,MAAM;AAAA,IACxC;AAEA,SAAK,SAAS,OAAO,MAAM;AAC3B,SAAK,OAAO,IAAI;AAChB,SAAK,uBAAA;AAAA,EACP;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,UAAU,OAAkB;AAC1B,QAAI,KAAK,WAAW;AAClB,YAAM,IAAI,MAAM,sCAAsC;AAAA,IACxD;AACA,QAAI,MAAM,WAAW,EAAG;AAGxB,QAAI,MAAM,WAAW,GAAG;AACtB,YAAM,OAAO,MAAM,CAAC;AACpB,YAAM,WAAW,KAAK,OAAO,IAAI,KAAK,EAAE;AAExC,UAAI,UAAU;AAEZ,YAAI,aAAa,KAAM;AACvB,cAAMA,QAAO,KAAK;AAClB,cAAM,MAAM,KAAK,OAAO,QAAQ,QAAQ;AACxC,cAAM,WAAW,CAAC,GAAGA,KAAI;AACzB,iBAAS,GAAG,IAAI;AAChB,aAAK,OAAO,IAAI,KAAK,IAAI,IAAI;AAC7B,YAAI,KAAK,YAAa,MAAK,YAAY,IAAI,KAAK,IAAI,KAAK,KAAK;AAC9D,aAAK,SAAS,OAAO,QAAQ;AAC7B,aAAK,OAAOA,KAAI;AAAA,MAClB,OAAO;AAEL,cAAMA,QAAO,KAAK;AAClB,YAAIC,UAAS,CAAC,GAAGD,OAAM,IAAI;AAC3B,aAAK,OAAO,IAAI,KAAK,IAAI,IAAI;AAC7B,YAAI,KAAK,YAAa,MAAK,YAAY,IAAI,KAAK,IAAI,KAAK,KAAK;AAC9D,YAAI,KAAK,WAAW,KAAKC,QAAO,SAAS,KAAK,UAAU;AACtDA,oBAAS,KAAK,kBAAkBA,OAAM;AAAA,QACxC;AACA,aAAK,SAAS,OAAOA,OAAM;AAC3B,aAAK,OAAOD,KAAI;AAChB,aAAK,uBAAA;AAAA,MACP;AACA;AAAA,IACF;AAGA,UAAM,+BAAe,IAAA;AACrB,eAAW,QAAQ,OAAO;AACxB,eAAS,IAAI,KAAK,IAAI,IAAI;AAAA,IAC5B;AAEA,UAAM,OAAO,KAAK;AAClB,QAAI,UAAU;AACd,UAAM,+BAAe,IAAA;AACrB,UAAM,WAAgB,CAAA;AAGtB,eAAW,YAAY,MAAM;AAC3B,UAAI,SAAS,IAAI,SAAS,EAAE,GAAG;AAC7B,cAAM,cAAc,SAAS,IAAI,SAAS,EAAE;AAC5C,YAAI,gBAAgB,SAAU,WAAU;AACxC,iBAAS,KAAK,WAAW;AACzB,iBAAS,IAAI,SAAS,EAAE;AAAA,MAC1B,OAAO;AACL,iBAAS,KAAK,QAAQ;AAAA,MACxB;AAAA,IACF;AAGA,eAAW,CAAC,IAAI,IAAI,KAAK,UAAU;AACjC,UAAI,CAAC,SAAS,IAAI,EAAE,GAAG;AACrB,iBAAS,KAAK,IAAI;AAClB,kBAAU;AAAA,MACZ;AAAA,IACF;AAEA,QAAI,CAAC,QAAS;AAGd,QAAI,KAAK,aAAa;AACpB,YAAM,MAAM,KAAK,IAAA;AACjB,iBAAW,CAAC,EAAE,KAAK,UAAU;AAC3B,aAAK,YAAY,IAAI,IAAI,GAAG;AAAA,MAC9B;AAAA,IACF;AAEA,eAAW,CAAC,IAAI,IAAI,KAAK,UAAU;AACjC,WAAK,OAAO,IAAI,IAAI,IAAI;AAAA,IAC1B;AAGA,QAAI,SAAS;AACb,QAAI,KAAK,WAAW,KAAK,OAAO,SAAS,KAAK,UAAU;AACtD,eAAS,KAAK,kBAAkB,MAAM;AAAA,IACxC;AAEA,SAAK,SAAS,OAAO,MAAM;AAC3B,SAAK,OAAO,IAAI;AAChB,SAAK,uBAAA;AAAA,EACP;AAAA;AAAA;AAAA;AAAA,EAKA,UAAU,KAAsB;AAC9B,QAAI,KAAK,WAAW;AAClB,YAAM,IAAI,MAAM,wCAAwC;AAAA,IAC1D;AAEA,QAAI,IAAI,WAAW,GAAG;AACpB;AAAA,IACF;AAGA,QAAI,IAAI,WAAW,GAAG;AACpB,YAAM,KAAK,IAAI,CAAC;AAChB,UAAI,CAAC,KAAK,OAAO,IAAI,EAAE,EAAG;AAC1B,YAAMA,QAAO,KAAK;AAClB,WAAK,SAAS,OAAOA,MAAK,OAAO,UAAQ,KAAK,OAAO,EAAE,CAAC;AACxD,WAAK,OAAO,OAAO,EAAE;AACrB,WAAK,aAAa,OAAO,EAAE;AAC3B,WAAK,OAAOA,KAAI;AAChB,WAAK,uBAAA;AACL;AAAA,IACF;AAGA,UAAM,QAAQ,IAAI,IAAI,GAAG;AACzB,UAAM,WAAW,KAAK,OAAO,OAAO,CAAA,SAAQ,CAAC,MAAM,IAAI,KAAK,EAAE,CAAC;AAE/D,QAAI,SAAS,WAAW,KAAK,OAAO,QAAQ;AAC1C;AAAA,IACF;AAEA,UAAM,OAAO,KAAK;AAClB,SAAK,SAAS,OAAO,QAAQ;AAE7B,eAAW,MAAM,KAAK;AACpB,WAAK,OAAO,OAAO,EAAE;AACrB,WAAK,aAAa,OAAO,EAAE;AAAA,IAC7B;AAEA,SAAK,OAAO,IAAI;AAChB,SAAK,uBAAA;AAAA,EACP;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,IAAa,SAA2B;AAC7C,QAAI,KAAK,WAAW;AAClB,YAAM,IAAI,MAAM,mCAAmC;AAAA,IACrD;AAGA,UAAM,WAAW,KAAK,OAAO,IAAI,EAAE;AACnC,QAAI,CAAC,SAAU;AAGf,UAAM,OAAO,OAAO,KAAK,OAAO;AAChC,UAAM,aAAa,KAAK,KAAK,CAAA,QAAO,QAAQ,GAAG,MAAM,SAAS,GAAG,CAAC;AAClE,QAAI,CAAC,WAAY;AAEjB,UAAM,UAAU,EAAE,GAAG,UAAU,GAAG,SAAS,GAAA;AAC3C,UAAM,OAAO,KAAK;AAClB,UAAM,MAAM,KAAK,OAAO,QAAQ,QAAQ;AACxC,UAAM,WAAW,CAAC,GAAG,IAAI;AACzB,aAAS,GAAG,IAAI;AAChB,SAAK,SAAS,OAAO,QAAQ;AAC7B,SAAK,OAAO,IAAI,IAAI,OAAO;AAE3B,SAAK,OAAO,IAAI;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,OAAkB;AACtB,QAAI,KAAK,WAAW;AAClB,YAAM,IAAI,MAAM,kCAAkC;AAAA,IACpD;AAEA,UAAM,OAAO,KAAK;AAGlB,QAAI,KAAK,aAAa;AACpB,WAAK,YAAY,MAAA;AACjB,YAAM,MAAM,KAAK,IAAA;AACjB,iBAAW,QAAQ,OAAO;AACxB,aAAK,YAAY,IAAI,KAAK,IAAI,GAAG;AAAA,MACnC;AAAA,IACF;AAEA,QAAI,SAAS,CAAC,GAAG,KAAK;AAGtB,QAAI,KAAK,WAAW,KAAK,OAAO,SAAS,KAAK,UAAU;AACtD,eAAS,KAAK,kBAAkB,MAAM;AAAA,IACxC;AAEA,SAAK,SAAS,OAAO,MAAM;AAC3B,SAAK,aAAA;AAEL,SAAK,OAAO,IAAI;AAChB,SAAK,uBAAA;AAAA,EACP;AAAA;AAAA;AAAA;AAAA,EAKA,QAAc;AACZ,QAAI,KAAK,WAAW;AAClB,YAAM,IAAI,MAAM,kCAAkC;AAAA,IACpD;AAEA,QAAI,KAAK,OAAO,WAAW,GAAG;AAC5B;AAAA,IACF;AAEA,UAAM,OAAO,KAAK;AAClB,SAAK,SAAS,OAAO,EAAS;AAC9B,SAAK,OAAO,MAAA;AACZ,SAAK,aAAa,MAAA;AAClB,SAAK,oBAAA;AAEL,SAAK,OAAO,IAAI;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,WAAW,UAAkC;AAC3C,QAAI,KAAK,WAAW;AAClB,YAAM,IAAI,MAAM,yDAAyD;AAAA,IAC3E;AAEA,UAAM,WAAW,KAAK;AACtB,UAAM,oBAAoB,KAAK,cAAc,IAAI,IAAI,KAAK,WAAW,IAAI;AACzE,aAAA;AAEA,QAAI,aAAa;AACjB,WAAO,MAAM;AACX,UAAI,cAAc,KAAK,UAAW;AAClC,mBAAa;AAEb,YAAM,OAAO,KAAK;AAClB,WAAK,SAAS;AACd,UAAI,mBAAmB;AACrB,aAAK,cAAc;AAAA,MACrB;AACA,WAAK,aAAA;AACL,WAAK,OAAO,IAAI;AAChB,WAAK,uBAAA;AAAA,IACP;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,IAAI,IAA4B;AAC9B,WAAO,KAAK,OAAO,IAAI,EAAE;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,IAAsB;AACxB,WAAO,KAAK,OAAO,IAAI,EAAE;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA,EAKA,KAAK,WAAgD;AACnD,WAAO,KAAK,OAAO,KAAK,SAAS;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,WAAsC;AAC3C,WAAO,KAAK,OAAO,OAAO,SAAS;AAAA,EACrC;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,WAAwC;AAC7C,WAAO,CAAC,GAAG,KAAK,MAAM,EAAE,KAAK,SAAS;AAAA,EACxC;AAAA;AAAA;AAAA;AAAA,EAKA,IAAO,IAAyB;AAC9B,WAAO,KAAK,OAAO,IAAI,EAAE;AAAA,EAC3B;AAAA;AAAA;AAAA,EAKA,UAAU,UAA6C;AACrD,QAAI,KAAK,WAAW;AAClB,aAAO,MAAM;AAAA,MAAC;AAAA,IAChB;AAEA,SAAK,WAAW,IAAI,QAAQ;AAE5B,WAAO,MAAM;AACX,WAAK,WAAW,OAAO,QAAQ;AAAA,IACjC;AAAA,EACF;AAAA;AAAA,EAGA,UAAgB;AACd,QAAI,KAAK,WAAW;AAClB;AAAA,IACF;AAEA,SAAK,YAAY;AACjB,SAAK,oBAAA;AACL,SAAK,kBAAkB,MAAA;AACvB,QAAI,KAAK,WAAW;AAClB,iBAAW,MAAM,KAAK,UAAW,IAAA;AACjC,WAAK,YAAY;AAAA,IACnB;AACA,SAAK,YAAA;AACL,SAAK,WAAW,MAAA;AAChB,SAAK,OAAO,MAAA;AACZ,SAAK,aAAa,MAAA;AAAA,EACpB;AAAA;AAAA,EAGU,WAAW,IAAsB;AACzC,QAAI,CAAC,KAAK,WAAW;AACnB,WAAK,YAAY,CAAA;AAAA,IACnB;AACA,SAAK,UAAU,KAAK,EAAE;AAAA,EACxB;AAAA,EAeQ,OAAO,MAA0B;AACvC,eAAW,YAAY,KAAK,YAAY;AACtC,eAAS,KAAK,QAAe,IAAW;AAAA,IAC1C;AAAA,EACF;AAAA,EAEQ,eAAqB;AAC3B,SAAK,OAAO,MAAA;AACZ,eAAW,QAAQ,KAAK,QAAQ;AAC9B,WAAK,OAAO,IAAI,KAAK,IAAI,IAAI;AAAA,IAC/B;AAAA,EACF;AAAA;AAAA,EAIQ,kBAAkB,OAAiB;AACzC,UAAM,SAAS,MAAM,SAAS,KAAK;AACnC,QAAI,UAAU,EAAG,QAAO;AAExB,UAAM,aAAa,MAAM,MAAM,GAAG,MAAM;AACxC,UAAM,UAAU,KAAK,cAAc,YAAY,UAAU;AAEzD,QAAI,YAAY,MAAO,QAAO;AAE9B,QAAI,QAAQ,WAAW,EAAG,QAAO;AAEjC,UAAM,WAAW,IAAI,IAAI,QAAQ,IAAI,CAAA,SAAQ,KAAK,EAAE,CAAC;AACrD,UAAM,SAAS,MAAM,OAAO,CAAA,SAAQ,CAAC,SAAS,IAAI,KAAK,EAAE,CAAC;AAG1D,eAAW,QAAQ,SAAS;AAC1B,WAAK,OAAO,OAAO,KAAK,EAAE;AAC1B,WAAK,aAAa,OAAO,KAAK,EAAE;AAAA,IAClC;AAEA,WAAO;AAAA,EACT;AAAA,EAEQ,cAAc,YAAiB,QAAyC;AAC9E,QAAI,CAAC,KAAK,QAAS,QAAO;AAE1B,UAAM,SAAS,KAAK,QAAQ,YAAY,MAAM;AAC9C,QAAI,WAAW,OAAO;AAEpB,UAAI,WAAW,WAAW,cAAc,KAAK,WAAW,GAAG;AACzD,cAAM,cAAc,KAAK,OAAO,SAAS,WAAW;AACpD,YAAI,cAAc,KAAK,WAAW,GAAG;AACnC,kBAAQ;AAAA,YACN,8CAA8C,WAAW,IAAI,KAAK,QAAQ;AAAA,UAAA;AAAA,QAG9E;AAAA,MACF;AACA,aAAO;AAAA,IACT;AACA,QAAI,MAAM,QAAQ,MAAM,GAAG;AAEzB,YAAM,eAAe,IAAI,IAAI,WAAW,IAAI,CAAA,MAAK,EAAE,EAAE,CAAC;AACtD,aAAO,OAAO,OAAO,CAAA,SAAQ,aAAa,IAAI,KAAK,EAAE,CAAC;AAAA,IACxD;AACA,WAAO;AAAA,EACT;AAAA,EAEQ,gBAAsB;AAC5B,QAAI,KAAK,aAAa,CAAC,KAAK,eAAe,KAAK,QAAQ,EAAG;AAE3D,UAAM,MAAM,KAAK,IAAA;AACjB,UAAM,MAAM,KAAK;AACjB,UAAM,UAAe,CAAA;AAErB,eAAW,QAAQ,KAAK,QAAQ;AAC9B,YAAM,KAAK,KAAK,YAAY,IAAI,KAAK,EAAE;AACvC,UAAI,OAAO,UAAc,MAAM,MAAO,KAAK;AACzC,gBAAQ,KAAK,IAAI;AAAA,MACnB;AAAA,IACF;AAEA,QAAI,QAAQ,WAAW,GAAG;AACxB,WAAK,uBAAA;AACL;AAAA,IACF;AAEA,UAAM,UAAU,KAAK,cAAc,SAAS,KAAK;AAEjD,QAAI,YAAY,OAAO;AACrB,WAAK,uBAAA;AACL;AAAA,IACF;AAEA,QAAI,QAAQ,WAAW,GAAG;AACxB,WAAK,uBAAA;AACL;AAAA,IACF;AAEA,UAAM,WAAW,IAAI,IAAI,QAAQ,IAAI,CAAA,SAAQ,KAAK,EAAE,CAAC;AACrD,UAAM,OAAO,KAAK;AAClB,SAAK,SAAS;AAAA,MACX,KAAa,OAAO,CAAC,SAAY,CAAC,SAAS,IAAI,KAAK,EAAE,CAAC;AAAA,IAAA;AAG1D,eAAW,QAAQ,SAAS;AAC1B,WAAK,OAAO,OAAO,KAAK,EAAE;AAC1B,WAAK,YAAY,OAAO,KAAK,EAAE;AAAA,IACjC;AAEA,SAAK,OAAO,IAAI;AAChB,SAAK,uBAAA;AAAA,EACP;AAAA,EAEQ,yBAA+B;AACrC,SAAK,oBAAA;AAEL,QAAI,KAAK,aAAa,CAAC,KAAK,eAAe,KAAK,QAAQ,KAAK,KAAK,YAAY,SAAS,EAAG;AAE1F,UAAM,MAAM,KAAK,IAAA;AACjB,UAAM,MAAM,KAAK;AACjB,QAAI,WAAW;AAEf,eAAW,MAAM,KAAK,YAAY,OAAA,GAAU;AAC1C,UAAI,KAAK,SAAU,YAAW;AAAA,IAChC;AAEA,UAAM,QAAQ,KAAK,IAAI,GAAI,WAAW,MAAO,GAAG;AAChD,SAAK,iBAAiB,WAAW,MAAM,KAAK,cAAA,GAAiB,KAAK;AAAA,EACpE;AAAA,EAEQ,sBAA4B;AAClC,QAAI,KAAK,mBAAmB,MAAM;AAChC,mBAAa,KAAK,cAAc;AAChC,WAAK,iBAAiB;AAAA,IACxB;AAAA,EACF;AACF;;"}

package/dist/Collection.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Collection.d.ts","sourceRoot":"","sources":["../src/Collection.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAQtD,KAAK,eAAe,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;AAC9B,KAAK,kBAAkB,CAAC,CAAC,IAAI,QAAQ,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;AAE1D;;GAEG;AACH,qBAAa,UAAU,CAAC,CAAC,SAAS;IAAE,EAAE,EAAE,MAAM,GAAG,MAAM,CAAA;CAAE,CAAE,YAAW,YAAY,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IACpG,mEAAmE;IACnE,MAAM,CAAC,QAAQ,SAAK;IACpB,mDAAmD;IACnD,MAAM,CAAC,GAAG,SAAK;IAEf,OAAO,CAAC,MAAM,CAAoB;IAClC,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,UAAU,CAAoC;IACtD,OAAO,CAAC,MAAM,CAAyB;IACvC,OAAO,CAAC,gBAAgB,CAAgC;IACxD,OAAO,CAAC,SAAS,CAA+B;IAChD,OAAO,CAAC,WAAW,CAAqC;IACxD,OAAO,CAAC,cAAc,CAA8C;gBAExD,YAAY,GAAE,CAAC,EAAO;IA0BlC;;OAEG;IACH,IAAI,KAAK,IAAI,CAAC,EAAE,CAEf;IAED,8BAA8B;IAC9B,IAAI,KAAK,IAAI,CAAC,EAAE,CAEf;IAED,yCAAyC;IACzC,IAAI,MAAM,IAAI,MAAM,CAEnB;IAED,+CAA+C;IAC/C,IAAI,QAAQ,IAAI,OAAO,CAEtB;IAED,6EAA6E;IAC7E,IAAI,aAAa,IAAI,WAAW,CAK/B;IAID,OAAO,KAAK,QAAQ,GAEnB;IAED,OAAO,KAAK,IAAI,GAEf;IAID;;OAEG;IACH,GAAG,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,GAAG,IAAI;IA8DxB;;;;;OAKG;IACH,MAAM,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,GAAG,IAAI;IA8D3B;;OAEG;IACH,MAAM,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI;IA4B/B;;OAEG;IACH,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI;IAyB9C;;OAEG;IACH,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,IAAI;IA8BvB;;OAEG;IACH,KAAK,IAAI,IAAI;IAkBb;;;OAGG;IACH,UAAU,CAAC,QAAQ,EAAE,MAAM,IAAI,GAAG,MAAM,IAAI;IA2B5C;;OAEG;IACH,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS;IAI/B;;OAEG;IACH,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,OAAO;IAIzB;;OAEG;IACH,IAAI,CAAC,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,GAAG,SAAS;IAIpD;;OAEG;IACH,MAAM,CAAC,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,EAAE;IAI5C;;OAEG;IACH,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,GAAG,CAAC,EAAE;IAI9C;;OAEG;IACH,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE;IAM/B,oEAAoE;IACpE,SAAS,CAAC,QAAQ,EAAE,kBAAkB,CAAC,CAAC,CAAC,GAAG,MAAM,IAAI;IAYtD,0EAA0E;IAC1E,OAAO,IAAI,IAAI;IAkBf,uEAAuE;IACvE,SAAS,CAAC,UAAU,CAAC,EAAE,EAAE,MAAM,IAAI,GAAG,IAAI;IAO1C,uFAAuF;IACvF,SAAS,CAAC,SAAS,CAAC,IAAI,IAAI;IAE5B;;;;;;;OAOG;IACH,SAAS,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,UAAU,GAAG,KAAK,GAAG,CAAC,EAAE,GAAG,KAAK,GAAG,IAAI;IAE9E,OAAO,CAAC,MAAM;IAMd,OAAO,CAAC,YAAY;IASpB,OAAO,CAAC,iBAAiB;IAuBzB,OAAO,CAAC,aAAa;IAyBrB,OAAO,CAAC,aAAa;IA8CrB,OAAO,CAAC,sBAAsB;IAiB9B,OAAO,CAAC,mBAAmB;CAM5B"}
+{"version":3,"file":"Collection.d.ts","sourceRoot":"","sources":["../src/Collection.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAQtD,KAAK,eAAe,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;AAC9B,KAAK,kBAAkB,CAAC,CAAC,IAAI,QAAQ,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;AAE1D;;GAEG;AACH,qBAAa,UAAU,CAAC,CAAC,SAAS;IAAE,EAAE,EAAE,MAAM,GAAG,MAAM,CAAA;CAAE,CAAE,YAAW,YAAY,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IACpG,mEAAmE;IACnE,MAAM,CAAC,QAAQ,SAAK;IACpB,mDAAmD;IACnD,MAAM,CAAC,GAAG,SAAK;IAEf,OAAO,CAAC,MAAM,CAAoB;IAClC,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,UAAU,CAAoC;IACtD,OAAO,CAAC,MAAM,CAAyB;IACvC,OAAO,CAAC,gBAAgB,CAAgC;IACxD,OAAO,CAAC,SAAS,CAA+B;IAChD,OAAO,CAAC,WAAW,CAAqC;IACxD,OAAO,CAAC,cAAc,CAA8C;gBAExD,YAAY,GAAE,CAAC,EAAO;IA0BlC;;OAEG;IACH,IAAI,KAAK,IAAI,CAAC,EAAE,CAEf;IAED,8BAA8B;IAC9B,IAAI,KAAK,IAAI,CAAC,EAAE,CAEf;IAED,yCAAyC;IACzC,IAAI,MAAM,IAAI,MAAM,CAEnB;IAED,+CAA+C;IAC/C,IAAI,QAAQ,IAAI,OAAO,CAEtB;IAED,6EAA6E;IAC7E,IAAI,aAAa,IAAI,WAAW,CAK/B;IAID,OAAO,KAAK,QAAQ,GAEnB;IAED,OAAO,KAAK,IAAI,GAEf;IAID;;OAEG;IACH,GAAG,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,GAAG,IAAI;IA8DxB;;;;;OAKG;IACH,MAAM,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,GAAG,IAAI;IA8F3B;;OAEG;IACH,MAAM,CAAC,GAAG,GAAG,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI;IA0C/B;;OAEG;IACH,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI;IAyB9C;;OAEG;IACH,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,GAAG,IAAI;IA8BvB;;OAEG;IACH,KAAK,IAAI,IAAI;IAkBb;;;OAGG;IACH,UAAU,CAAC,QAAQ,EAAE,MAAM,IAAI,GAAG,MAAM,IAAI;IA2B5C;;OAEG;IACH,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS;IAI/B;;OAEG;IACH,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,OAAO;IAIzB;;OAEG;IACH,IAAI,CAAC,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,GAAG,SAAS;IAIpD;;OAEG;IACH,MAAM,CAAC,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAAG,CAAC,EAAE;IAI5C;;OAEG;IACH,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,GAAG,CAAC,EAAE;IAI9C;;OAEG;IACH,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE;IAM/B,oEAAoE;IACpE,SAAS,CAAC,QAAQ,EAAE,kBAAkB,CAAC,CAAC,CAAC,GAAG,MAAM,IAAI;IAYtD,0EAA0E;IAC1E,OAAO,IAAI,IAAI;IAkBf,uEAAuE;IACvE,SAAS,CAAC,UAAU,CAAC,EAAE,EAAE,MAAM,IAAI,GAAG,IAAI;IAO1C,uFAAuF;IACvF,SAAS,CAAC,SAAS,CAAC,IAAI,IAAI;IAE5B;;;;;;;OAOG;IACH,SAAS,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,UAAU,GAAG,KAAK,GAAG,CAAC,EAAE,GAAG,KAAK,GAAG,IAAI;IAE9E,OAAO,CAAC,MAAM;IAMd,OAAO,CAAC,YAAY;IASpB,OAAO,CAAC,iBAAiB;IAuBzB,OAAO,CAAC,aAAa;IAyBrB,OAAO,CAAC,aAAa;IA8CrB,OAAO,CAAC,sBAAsB;IAiB9B,OAAO,CAAC,mBAAmB;CAM5B"}

package/dist/Collection.js

@@ -132,6 +132,33 @@ class Collection {
       throw new Error("Cannot upsert on disposed Collection");
     }
     if (items.length === 0) return;
+    if (items.length === 1) {
+      const item = items[0];
+      const existing = this._index.get(item.id);
+      if (existing) {
+        if (existing === item) return;
+        const prev2 = this._items;
+        const idx = this._items.indexOf(existing);
+        const newItems = [...prev2];
+        newItems[idx] = item;
+        this._index.set(item.id, item);
+        if (this._timestamps) this._timestamps.set(item.id, Date.now());
+        this._items = freeze(newItems);
+        this.notify(prev2);
+      } else {
+        const prev2 = this._items;
+        let result2 = [...prev2, item];
+        this._index.set(item.id, item);
+        if (this._timestamps) this._timestamps.set(item.id, Date.now());
+        if (this._maxSize > 0 && result2.length > this._maxSize) {
+          result2 = this._evictForCapacity(result2);
+        }
+        this._items = freeze(result2);
+        this.notify(prev2);
+        this._scheduleEvictionTimer();
+      }
+      return;
+    }
     const incoming = /* @__PURE__ */ new Map();
     for (const item of items) {
       incoming.set(item.id, item);
@@ -184,6 +211,17 @@ class Collection {
     if (ids.length === 0) {
       return;
     }
+    if (ids.length === 1) {
+      const id = ids[0];
+      if (!this._index.has(id)) return;
+      const prev2 = this._items;
+      this._items = freeze(prev2.filter((item) => item.id !== id));
+      this._index.delete(id);
+      this._timestamps?.delete(id);
+      this.notify(prev2);
+      this._scheduleEvictionTimer();
+      return;
+    }
     const idSet = new Set(ids);
     const filtered = this._items.filter((item) => !idSet.has(item.id));
     if (filtered.length === this._items.length) {

package/dist/Collection.js.map

@@ -1 +1 @@
-{"version":3,"file":"Collection.js","sources":["../src/Collection.ts"],"sourcesContent":["import type { Listener, Subscribable } from './types';\n\nconst __DEV__ = typeof __MVC_KIT_DEV__ !== 'undefined' && __MVC_KIT_DEV__;\n\nfunction freeze<T>(obj: T): T {\n  return __DEV__ ? Object.freeze(obj) as T : obj;\n}\n\ntype CollectionState<T> = T[];\ntype CollectionListener<T> = Listener<CollectionState<T>>;\n\n/**\n * Reactive typed array with CRUD and query methods.\n */\nexport class Collection<T extends { id: string | number }> implements Subscribable<CollectionState<T>> {\n  /** Maximum number of items before FIFO eviction. 0 = unlimited. */\n  static MAX_SIZE = 0;\n  /** Time-to-live in milliseconds. 0 = no expiry. */\n  static TTL = 0;\n\n  private _items: readonly T[] = [];\n  private _disposed = false;\n  private _listeners = new Set<CollectionListener<T>>();\n  private _index = new Map<T['id'], T>();\n  private _abortController: AbortController | null = null;\n  private _cleanups: (() => void)[] | null = null;\n  private _timestamps: Map<T['id'], number> | null = null;\n  private _evictionTimer: ReturnType<typeof setTimeout> | null = null;\n\n  constructor(initialItems: T[] = []) {\n    let result = [...initialItems];\n\n    if (this._ttl > 0) {\n      this._timestamps = new Map();\n      const now = Date.now();\n      for (const item of result) {\n        this._timestamps.set(item.id, now);\n      }\n    }\n\n    if (this._maxSize > 0 && result.length > this._maxSize) {\n      // FIFO: trim from the front (oldest items)\n      const excess = result.length - this._maxSize;\n      const evicted = result.slice(0, excess);\n      result = result.slice(excess);\n      for (const item of evicted) {\n        this._timestamps?.delete(item.id);\n      }\n    }\n\n    this._items = freeze(result);\n    this.rebuildIndex();\n    this._scheduleEvictionTimer();\n  }\n\n  /**\n   * Alias for Subscribable compatibility.\n   */\n  get state(): T[] {\n    return this._items as T[];\n  }\n\n  /** The raw array of items. */\n  get items(): T[] {\n    return this._items as T[];\n  }\n\n  /** Number of items in the collection. */\n  get length(): number {\n    return this._items.length;\n  }\n\n  /** Whether this instance has been disposed. */\n  get disposed(): boolean {\n    return this._disposed;\n  }\n\n  /** AbortSignal that fires when this instance is disposed. Lazily created. */\n  get disposeSignal(): AbortSignal {\n    if (!this._abortController) {\n      this._abortController = new AbortController();\n    }\n    return this._abortController.signal;\n  }\n\n  // ── Config Accessors ──\n\n  private get _maxSize(): number {\n    return (this.constructor as typeof Collection).MAX_SIZE;\n  }\n\n  private get _ttl(): number {\n    return (this.constructor as typeof Collection).TTL;\n  }\n\n  // ── CRUD Methods (notify listeners) ──\n\n  /**\n   * Add one or more items. Items with existing IDs are silently skipped.\n   */\n  add(...items: T[]): void {\n    if (this._disposed) {\n      throw new Error('Cannot add to disposed Collection');\n    }\n\n    if (items.length === 0) {\n      return;\n    }\n\n    // Fast path: single item (most common case)\n    if (items.length === 1) {\n      const item = items[0];\n      if (this._index.has(item.id)) return;\n      const prev = this._items;\n      let result = [...prev, item];\n      this._index.set(item.id, item);\n      if (this._timestamps) this._timestamps.set(item.id, Date.now());\n      if (this._maxSize > 0 && result.length > this._maxSize) {\n        result = this._evictForCapacity(result);\n      }\n      this._items = freeze(result);\n      this.notify(prev);\n      this._scheduleEvictionTimer();\n      return;\n    }\n\n    // Multi-item path\n    const seen = new Set<T['id']>();\n    const newItems: T[] = [];\n    for (const item of items) {\n      if (!this._index.has(item.id) && !seen.has(item.id)) {\n        newItems.push(item);\n        seen.add(item.id);\n      }\n    }\n    if (newItems.length === 0) return;\n\n    const prev = this._items;\n    let result = [...prev, ...newItems];\n\n    for (const item of newItems) {\n      this._index.set(item.id, item);\n    }\n\n    // Record timestamps for TTL\n    if (this._timestamps) {\n      const now = Date.now();\n      for (const item of newItems) {\n        this._timestamps.set(item.id, now);\n      }\n    }\n\n    // Enforce capacity before freeze/notify\n    if (this._maxSize > 0 && result.length > this._maxSize) {\n      result = this._evictForCapacity(result);\n    }\n\n    this._items = freeze(result);\n    this.notify(prev);\n    this._scheduleEvictionTimer();\n  }\n\n  /**\n   * Add or replace items by ID. Existing items are replaced in-place\n   * (preserving array position); new items are appended. Deduplicates\n   * input — last occurrence wins. No-op if nothing changed (reference\n   * comparison).\n   */\n  upsert(...items: T[]): void {\n    if (this._disposed) {\n      throw new Error('Cannot upsert on disposed Collection');\n    }\n    if (items.length === 0) return;\n\n    // Deduplicate input — last occurrence wins\n    const incoming = new Map<T['id'], T>();\n    for (const item of items) {\n      incoming.set(item.id, item);\n    }\n\n    const prev = this._items;\n    let changed = false;\n    const replaced = new Set<T['id']>();\n    const newArray: T[] = [];\n\n    // Replace existing items in-place\n    for (const existing of prev) {\n      if (incoming.has(existing.id)) {\n        const replacement = incoming.get(existing.id)!;\n        if (replacement !== existing) changed = true;\n        newArray.push(replacement);\n        replaced.add(existing.id);\n      } else {\n        newArray.push(existing);\n      }\n    }\n\n    // Append genuinely new items\n    for (const [id, item] of incoming) {\n      if (!replaced.has(id)) {\n        newArray.push(item);\n        changed = true;\n      }\n    }\n\n    if (!changed) return;\n\n    // Record/refresh timestamps for TTL (upsert refreshes existing)\n    if (this._timestamps) {\n      const now = Date.now();\n      for (const [id] of incoming) {\n        this._timestamps.set(id, now);\n      }\n    }\n\n    for (const [id, item] of incoming) {\n      this._index.set(id, item);\n    }\n\n    // Enforce capacity before freeze/notify\n    let result = newArray;\n    if (this._maxSize > 0 && result.length > this._maxSize) {\n      result = this._evictForCapacity(result);\n    }\n\n    this._items = freeze(result);\n    this.notify(prev);\n    this._scheduleEvictionTimer();\n  }\n\n  /**\n   * Remove items by id(s).\n   */\n  remove(...ids: T['id'][]): void {\n    if (this._disposed) {\n      throw new Error('Cannot remove from disposed Collection');\n    }\n\n    if (ids.length === 0) {\n      return;\n    }\n\n    const idSet = new Set(ids);\n    const filtered = this._items.filter(item => !idSet.has(item.id));\n\n    if (filtered.length === this._items.length) {\n      return; // No items removed\n    }\n\n    const prev = this._items;\n    this._items = freeze(filtered);\n\n    for (const id of ids) {\n      this._index.delete(id);\n      this._timestamps?.delete(id);\n    }\n\n    this.notify(prev);\n    this._scheduleEvictionTimer();\n  }\n\n  /**\n   * Update an item by id with partial changes.\n   */\n  update(id: T['id'], changes: Partial<T>): void {\n    if (this._disposed) {\n      throw new Error('Cannot update disposed Collection');\n    }\n\n    // O(1) existence check via index Map\n    const existing = this._index.get(id);\n    if (!existing) return;\n\n    // Check if anything actually changed (before any array work)\n    const keys = Object.keys(changes) as (keyof T)[];\n    const hasChanges = keys.some(key => changes[key] !== existing[key]);\n    if (!hasChanges) return;\n\n    const updated = { ...existing, ...changes, id };\n    const prev = this._items;\n    const idx = this._items.indexOf(existing);\n    const newItems = [...prev];\n    newItems[idx] = updated;\n    this._items = freeze(newItems);\n    this._index.set(id, updated);\n\n    this.notify(prev);\n  }\n\n  /**\n   * Replace all items.\n   */\n  reset(items: T[]): void {\n    if (this._disposed) {\n      throw new Error('Cannot reset disposed Collection');\n    }\n\n    const prev = this._items;\n\n    // Record timestamps for TTL\n    if (this._timestamps) {\n      this._timestamps.clear();\n      const now = Date.now();\n      for (const item of items) {\n        this._timestamps.set(item.id, now);\n      }\n    }\n\n    let result = [...items];\n\n    // Enforce capacity before freeze/notify\n    if (this._maxSize > 0 && result.length > this._maxSize) {\n      result = this._evictForCapacity(result);\n    }\n\n    this._items = freeze(result);\n    this.rebuildIndex();\n\n    this.notify(prev);\n    this._scheduleEvictionTimer();\n  }\n\n  /**\n   * Remove all items.\n   */\n  clear(): void {\n    if (this._disposed) {\n      throw new Error('Cannot clear disposed Collection');\n    }\n\n    if (this._items.length === 0) {\n      return;\n    }\n\n    const prev = this._items;\n    this._items = freeze([] as T[]);\n    this._index.clear();\n    this._timestamps?.clear();\n    this._clearEvictionTimer();\n\n    this.notify(prev);\n  }\n\n  /**\n   * Snapshot current state, apply callback mutations, and return a rollback function.\n   * Rollback restores items to pre-callback state regardless of later mutations.\n   */\n  optimistic(callback: () => void): () => void {\n    if (this._disposed) {\n      throw new Error('Cannot perform optimistic update on disposed Collection');\n    }\n\n    const snapshot = this._items;\n    const timestampSnapshot = this._timestamps ? new Map(this._timestamps) : null;\n    callback();\n\n    let rolledBack = false;\n    return () => {\n      if (rolledBack || this._disposed) return;\n      rolledBack = true;\n\n      const prev = this._items;\n      this._items = snapshot;\n      if (timestampSnapshot) {\n        this._timestamps = timestampSnapshot;\n      }\n      this.rebuildIndex();\n      this.notify(prev);\n      this._scheduleEvictionTimer();\n    };\n  }\n\n  // ── Query Methods (pure, no notification) ──\n\n  /**\n   * Get item by id.\n   */\n  get(id: T['id']): T | undefined {\n    return this._index.get(id);\n  }\n\n  /**\n   * Check if item exists by id.\n   */\n  has(id: T['id']): boolean {\n    return this._index.has(id);\n  }\n\n  /**\n   * Find first item matching predicate.\n   */\n  find(predicate: (item: T) => boolean): T | undefined {\n    return this._items.find(predicate);\n  }\n\n  /**\n   * Filter items matching predicate.\n   */\n  filter(predicate: (item: T) => boolean): T[] {\n    return this._items.filter(predicate) as T[];\n  }\n\n  /**\n   * Return sorted copy.\n   */\n  sorted(compareFn: (a: T, b: T) => number): T[] {\n    return [...this._items].sort(compareFn);\n  }\n\n  /**\n   * Map items to new array.\n   */\n  map<U>(fn: (item: T) => U): U[] {\n    return this._items.map(fn);\n  }\n\n  // ── Subscribable interface ──\n\n  /** Subscribes to state changes. Returns an unsubscribe function. */\n  subscribe(listener: CollectionListener<T>): () => void {\n    if (this._disposed) {\n      return () => {};\n    }\n\n    this._listeners.add(listener);\n\n    return () => {\n      this._listeners.delete(listener);\n    };\n  }\n\n  /** Tears down the instance, releasing all subscriptions and resources. */\n  dispose(): void {\n    if (this._disposed) {\n      return;\n    }\n\n    this._disposed = true;\n    this._clearEvictionTimer();\n    this._abortController?.abort();\n    if (this._cleanups) {\n      for (const fn of this._cleanups) fn();\n      this._cleanups = null;\n    }\n    this.onDispose?.();\n    this._listeners.clear();\n    this._index.clear();\n    this._timestamps?.clear();\n  }\n\n  /** Registers a cleanup function to be called on dispose. @protected */\n  protected addCleanup(fn: () => void): void {\n    if (!this._cleanups) {\n      this._cleanups = [];\n    }\n    this._cleanups.push(fn);\n  }\n\n  /** Lifecycle hook called during dispose(). Override for custom teardown. @protected */\n  protected onDispose?(): void;\n\n  /**\n   * Called before items are auto-evicted by capacity or TTL.\n   * Override to filter which items get evicted, or veto entirely.\n   *\n   * @param items - Candidates for eviction\n   * @param reason - Why eviction is happening\n   * @returns void to proceed with all, false to veto, or T[] subset to evict only those\n   */\n  protected onEvict?(items: T[], reason: 'capacity' | 'ttl'): T[] | false | void;\n\n  private notify(prev: readonly T[]): void {\n    for (const listener of this._listeners) {\n      listener(this._items as T[], prev as T[]);\n    }\n  }\n\n  private rebuildIndex(): void {\n    this._index.clear();\n    for (const item of this._items) {\n      this._index.set(item.id, item);\n    }\n  }\n\n  // ── Eviction Internals ──\n\n  private _evictForCapacity(items: T[]): T[] {\n    const excess = items.length - this._maxSize;\n    if (excess <= 0) return items;\n\n    const candidates = items.slice(0, excess);\n    const toEvict = this._applyOnEvict(candidates, 'capacity');\n\n    if (toEvict === false) return items; // veto\n\n    if (toEvict.length === 0) return items; // nothing to evict\n\n    const evictIds = new Set(toEvict.map(item => item.id));\n    const result = items.filter(item => !evictIds.has(item.id));\n\n    // Clean up index and timestamps for evicted items\n    for (const item of toEvict) {\n      this._index.delete(item.id);\n      this._timestamps?.delete(item.id);\n    }\n\n    return result;\n  }\n\n  private _applyOnEvict(candidates: T[], reason: 'capacity' | 'ttl'): T[] | false {\n    if (!this.onEvict) return candidates;\n\n    const result = this.onEvict(candidates, reason);\n    if (result === false) {\n      // DEV warning when veto causes collection to exceed 2x MAX_SIZE\n      if (__DEV__ && reason === 'capacity' && this._maxSize > 0) {\n        const currentSize = this._items.length + candidates.length;\n        if (currentSize > this._maxSize * 2) {\n          console.warn(\n            `[mvc-kit] Collection exceeded 2x MAX_SIZE (${currentSize}/${this._maxSize}). ` +\n            `onEvict is vetoing eviction — this may cause unbounded growth.`\n          );\n        }\n      }\n      return false;\n    }\n    if (Array.isArray(result)) {\n      // Only include items that are actually in the current items\n      const candidateIds = new Set(candidates.map(c => c.id));\n      return result.filter(item => candidateIds.has(item.id));\n    }\n    return candidates; // void = proceed with all\n  }\n\n  private _sweepExpired(): void {\n    if (this._disposed || !this._timestamps || this._ttl <= 0) return;\n\n    const now = Date.now();\n    const ttl = this._ttl;\n    const expired: T[] = [];\n\n    for (const item of this._items) {\n      const ts = this._timestamps.get(item.id);\n      if (ts !== undefined && (now - ts) >= ttl) {\n        expired.push(item);\n      }\n    }\n\n    if (expired.length === 0) {\n      this._scheduleEvictionTimer();\n      return;\n    }\n\n    const toEvict = this._applyOnEvict(expired, 'ttl');\n\n    if (toEvict === false) {\n      this._scheduleEvictionTimer();\n      return;\n    }\n\n    if (toEvict.length === 0) {\n      this._scheduleEvictionTimer();\n      return;\n    }\n\n    const evictIds = new Set(toEvict.map(item => item.id));\n    const prev = this._items;\n    this._items = freeze(\n      (prev as T[]).filter((item: T) => !evictIds.has(item.id))\n    );\n\n    for (const item of toEvict) {\n      this._index.delete(item.id);\n      this._timestamps.delete(item.id);\n    }\n\n    this.notify(prev);\n    this._scheduleEvictionTimer();\n  }\n\n  private _scheduleEvictionTimer(): void {\n    this._clearEvictionTimer();\n\n    if (this._disposed || !this._timestamps || this._ttl <= 0 || this._timestamps.size === 0) return;\n\n    const now = Date.now();\n    const ttl = this._ttl;\n    let earliest = Infinity;\n\n    for (const ts of this._timestamps.values()) {\n      if (ts < earliest) earliest = ts;\n    }\n\n    const delay = Math.max(0, (earliest + ttl) - now);\n    this._evictionTimer = setTimeout(() => this._sweepExpired(), delay);\n  }\n\n  private _clearEvictionTimer(): void {\n    if (this._evictionTimer !== null) {\n      clearTimeout(this._evictionTimer);\n      this._evictionTimer = null;\n    }\n  }\n}\n"],"names":["prev","result"],"mappings":"AAEA,MAAM,UAAU,OAAO,oBAAoB,eAAe;AAE1D,SAAS,OAAU,KAAW;AAC5B,SAAO,UAAU,OAAO,OAAO,GAAG,IAAS;AAC7C;AAQO,MAAM,WAA0F;AAAA;AAAA,EAErG,OAAO,WAAW;AAAA;AAAA,EAElB,OAAO,MAAM;AAAA,EAEL,SAAuB,CAAA;AAAA,EACvB,YAAY;AAAA,EACZ,iCAAiB,IAAA;AAAA,EACjB,6BAAa,IAAA;AAAA,EACb,mBAA2C;AAAA,EAC3C,YAAmC;AAAA,EACnC,cAA2C;AAAA,EAC3C,iBAAuD;AAAA,EAE/D,YAAY,eAAoB,IAAI;AAClC,QAAI,SAAS,CAAC,GAAG,YAAY;AAE7B,QAAI,KAAK,OAAO,GAAG;AACjB,WAAK,kCAAkB,IAAA;AACvB,YAAM,MAAM,KAAK,IAAA;AACjB,iBAAW,QAAQ,QAAQ;AACzB,aAAK,YAAY,IAAI,KAAK,IAAI,GAAG;AAAA,MACnC;AAAA,IACF;AAEA,QAAI,KAAK,WAAW,KAAK,OAAO,SAAS,KAAK,UAAU;AAEtD,YAAM,SAAS,OAAO,SAAS,KAAK;AACpC,YAAM,UAAU,OAAO,MAAM,GAAG,MAAM;AACtC,eAAS,OAAO,MAAM,MAAM;AAC5B,iBAAW,QAAQ,SAAS;AAC1B,aAAK,aAAa,OAAO,KAAK,EAAE;AAAA,MAClC;AAAA,IACF;AAEA,SAAK,SAAS,OAAO,MAAM;AAC3B,SAAK,aAAA;AACL,SAAK,uBAAA;AAAA,EACP;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,QAAa;AACf,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,QAAa;AACf,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,SAAiB;AACnB,WAAO,KAAK,OAAO;AAAA,EACrB;AAAA;AAAA,EAGA,IAAI,WAAoB;AACtB,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,gBAA6B;AAC/B,QAAI,CAAC,KAAK,kBAAkB;AAC1B,WAAK,mBAAmB,IAAI,gBAAA;AAAA,IAC9B;AACA,WAAO,KAAK,iBAAiB;AAAA,EAC/B;AAAA;AAAA,EAIA,IAAY,WAAmB;AAC7B,WAAQ,KAAK,YAAkC;AAAA,EACjD;AAAA,EAEA,IAAY,OAAe;AACzB,WAAQ,KAAK,YAAkC;AAAA,EACjD;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,OAAkB;AACvB,QAAI,KAAK,WAAW;AAClB,YAAM,IAAI,MAAM,mCAAmC;AAAA,IACrD;AAEA,QAAI,MAAM,WAAW,GAAG;AACtB;AAAA,IACF;AAGA,QAAI,MAAM,WAAW,GAAG;AACtB,YAAM,OAAO,MAAM,CAAC;AACpB,UAAI,KAAK,OAAO,IAAI,KAAK,EAAE,EAAG;AAC9B,YAAMA,QAAO,KAAK;AAClB,UAAIC,UAAS,CAAC,GAAGD,OAAM,IAAI;AAC3B,WAAK,OAAO,IAAI,KAAK,IAAI,IAAI;AAC7B,UAAI,KAAK,YAAa,MAAK,YAAY,IAAI,KAAK,IAAI,KAAK,KAAK;AAC9D,UAAI,KAAK,WAAW,KAAKC,QAAO,SAAS,KAAK,UAAU;AACtDA,kBAAS,KAAK,kBAAkBA,OAAM;AAAA,MACxC;AACA,WAAK,SAAS,OAAOA,OAAM;AAC3B,WAAK,OAAOD,KAAI;AAChB,WAAK,uBAAA;AACL;AAAA,IACF;AAGA,UAAM,2BAAW,IAAA;AACjB,UAAM,WAAgB,CAAA;AACtB,eAAW,QAAQ,OAAO;AACxB,UAAI,CAAC,KAAK,OAAO,IAAI,KAAK,EAAE,KAAK,CAAC,KAAK,IAAI,KAAK,EAAE,GAAG;AACnD,iBAAS,KAAK,IAAI;AAClB,aAAK,IAAI,KAAK,EAAE;AAAA,MAClB;AAAA,IACF;AACA,QAAI,SAAS,WAAW,EAAG;AAE3B,UAAM,OAAO,KAAK;AAClB,QAAI,SAAS,CAAC,GAAG,MAAM,GAAG,QAAQ;AAElC,eAAW,QAAQ,UAAU;AAC3B,WAAK,OAAO,IAAI,KAAK,IAAI,IAAI;AAAA,IAC/B;AAGA,QAAI,KAAK,aAAa;AACpB,YAAM,MAAM,KAAK,IAAA;AACjB,iBAAW,QAAQ,UAAU;AAC3B,aAAK,YAAY,IAAI,KAAK,IAAI,GAAG;AAAA,MACnC;AAAA,IACF;AAGA,QAAI,KAAK,WAAW,KAAK,OAAO,SAAS,KAAK,UAAU;AACtD,eAAS,KAAK,kBAAkB,MAAM;AAAA,IACxC;AAEA,SAAK,SAAS,OAAO,MAAM;AAC3B,SAAK,OAAO,IAAI;AAChB,SAAK,uBAAA;AAAA,EACP;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,UAAU,OAAkB;AAC1B,QAAI,KAAK,WAAW;AAClB,YAAM,IAAI,MAAM,sCAAsC;AAAA,IACxD;AACA,QAAI,MAAM,WAAW,EAAG;AAGxB,UAAM,+BAAe,IAAA;AACrB,eAAW,QAAQ,OAAO;AACxB,eAAS,IAAI,KAAK,IAAI,IAAI;AAAA,IAC5B;AAEA,UAAM,OAAO,KAAK;AAClB,QAAI,UAAU;AACd,UAAM,+BAAe,IAAA;AACrB,UAAM,WAAgB,CAAA;AAGtB,eAAW,YAAY,MAAM;AAC3B,UAAI,SAAS,IAAI,SAAS,EAAE,GAAG;AAC7B,cAAM,cAAc,SAAS,IAAI,SAAS,EAAE;AAC5C,YAAI,gBAAgB,SAAU,WAAU;AACxC,iBAAS,KAAK,WAAW;AACzB,iBAAS,IAAI,SAAS,EAAE;AAAA,MAC1B,OAAO;AACL,iBAAS,KAAK,QAAQ;AAAA,MACxB;AAAA,IACF;AAGA,eAAW,CAAC,IAAI,IAAI,KAAK,UAAU;AACjC,UAAI,CAAC,SAAS,IAAI,EAAE,GAAG;AACrB,iBAAS,KAAK,IAAI;AAClB,kBAAU;AAAA,MACZ;AAAA,IACF;AAEA,QAAI,CAAC,QAAS;AAGd,QAAI,KAAK,aAAa;AACpB,YAAM,MAAM,KAAK,IAAA;AACjB,iBAAW,CAAC,EAAE,KAAK,UAAU;AAC3B,aAAK,YAAY,IAAI,IAAI,GAAG;AAAA,MAC9B;AAAA,IACF;AAEA,eAAW,CAAC,IAAI,IAAI,KAAK,UAAU;AACjC,WAAK,OAAO,IAAI,IAAI,IAAI;AAAA,IAC1B;AAGA,QAAI,SAAS;AACb,QAAI,KAAK,WAAW,KAAK,OAAO,SAAS,KAAK,UAAU;AACtD,eAAS,KAAK,kBAAkB,MAAM;AAAA,IACxC;AAEA,SAAK,SAAS,OAAO,MAAM;AAC3B,SAAK,OAAO,IAAI;AAChB,SAAK,uBAAA;AAAA,EACP;AAAA;AAAA;AAAA;AAAA,EAKA,UAAU,KAAsB;AAC9B,QAAI,KAAK,WAAW;AAClB,YAAM,IAAI,MAAM,wCAAwC;AAAA,IAC1D;AAEA,QAAI,IAAI,WAAW,GAAG;AACpB;AAAA,IACF;AAEA,UAAM,QAAQ,IAAI,IAAI,GAAG;AACzB,UAAM,WAAW,KAAK,OAAO,OAAO,CAAA,SAAQ,CAAC,MAAM,IAAI,KAAK,EAAE,CAAC;AAE/D,QAAI,SAAS,WAAW,KAAK,OAAO,QAAQ;AAC1C;AAAA,IACF;AAEA,UAAM,OAAO,KAAK;AAClB,SAAK,SAAS,OAAO,QAAQ;AAE7B,eAAW,MAAM,KAAK;AACpB,WAAK,OAAO,OAAO,EAAE;AACrB,WAAK,aAAa,OAAO,EAAE;AAAA,IAC7B;AAEA,SAAK,OAAO,IAAI;AAChB,SAAK,uBAAA;AAAA,EACP;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,IAAa,SAA2B;AAC7C,QAAI,KAAK,WAAW;AAClB,YAAM,IAAI,MAAM,mCAAmC;AAAA,IACrD;AAGA,UAAM,WAAW,KAAK,OAAO,IAAI,EAAE;AACnC,QAAI,CAAC,SAAU;AAGf,UAAM,OAAO,OAAO,KAAK,OAAO;AAChC,UAAM,aAAa,KAAK,KAAK,CAAA,QAAO,QAAQ,GAAG,MAAM,SAAS,GAAG,CAAC;AAClE,QAAI,CAAC,WAAY;AAEjB,UAAM,UAAU,EAAE,GAAG,UAAU,GAAG,SAAS,GAAA;AAC3C,UAAM,OAAO,KAAK;AAClB,UAAM,MAAM,KAAK,OAAO,QAAQ,QAAQ;AACxC,UAAM,WAAW,CAAC,GAAG,IAAI;AACzB,aAAS,GAAG,IAAI;AAChB,SAAK,SAAS,OAAO,QAAQ;AAC7B,SAAK,OAAO,IAAI,IAAI,OAAO;AAE3B,SAAK,OAAO,IAAI;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,OAAkB;AACtB,QAAI,KAAK,WAAW;AAClB,YAAM,IAAI,MAAM,kCAAkC;AAAA,IACpD;AAEA,UAAM,OAAO,KAAK;AAGlB,QAAI,KAAK,aAAa;AACpB,WAAK,YAAY,MAAA;AACjB,YAAM,MAAM,KAAK,IAAA;AACjB,iBAAW,QAAQ,OAAO;AACxB,aAAK,YAAY,IAAI,KAAK,IAAI,GAAG;AAAA,MACnC;AAAA,IACF;AAEA,QAAI,SAAS,CAAC,GAAG,KAAK;AAGtB,QAAI,KAAK,WAAW,KAAK,OAAO,SAAS,KAAK,UAAU;AACtD,eAAS,KAAK,kBAAkB,MAAM;AAAA,IACxC;AAEA,SAAK,SAAS,OAAO,MAAM;AAC3B,SAAK,aAAA;AAEL,SAAK,OAAO,IAAI;AAChB,SAAK,uBAAA;AAAA,EACP;AAAA;AAAA;AAAA;AAAA,EAKA,QAAc;AACZ,QAAI,KAAK,WAAW;AAClB,YAAM,IAAI,MAAM,kCAAkC;AAAA,IACpD;AAEA,QAAI,KAAK,OAAO,WAAW,GAAG;AAC5B;AAAA,IACF;AAEA,UAAM,OAAO,KAAK;AAClB,SAAK,SAAS,OAAO,EAAS;AAC9B,SAAK,OAAO,MAAA;AACZ,SAAK,aAAa,MAAA;AAClB,SAAK,oBAAA;AAEL,SAAK,OAAO,IAAI;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,WAAW,UAAkC;AAC3C,QAAI,KAAK,WAAW;AAClB,YAAM,IAAI,MAAM,yDAAyD;AAAA,IAC3E;AAEA,UAAM,WAAW,KAAK;AACtB,UAAM,oBAAoB,KAAK,cAAc,IAAI,IAAI,KAAK,WAAW,IAAI;AACzE,aAAA;AAEA,QAAI,aAAa;AACjB,WAAO,MAAM;AACX,UAAI,cAAc,KAAK,UAAW;AAClC,mBAAa;AAEb,YAAM,OAAO,KAAK;AAClB,WAAK,SAAS;AACd,UAAI,mBAAmB;AACrB,aAAK,cAAc;AAAA,MACrB;AACA,WAAK,aAAA;AACL,WAAK,OAAO,IAAI;AAChB,WAAK,uBAAA;AAAA,IACP;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,IAAI,IAA4B;AAC9B,WAAO,KAAK,OAAO,IAAI,EAAE;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,IAAsB;AACxB,WAAO,KAAK,OAAO,IAAI,EAAE;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA,EAKA,KAAK,WAAgD;AACnD,WAAO,KAAK,OAAO,KAAK,SAAS;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,WAAsC;AAC3C,WAAO,KAAK,OAAO,OAAO,SAAS;AAAA,EACrC;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,WAAwC;AAC7C,WAAO,CAAC,GAAG,KAAK,MAAM,EAAE,KAAK,SAAS;AAAA,EACxC;AAAA;AAAA;AAAA;AAAA,EAKA,IAAO,IAAyB;AAC9B,WAAO,KAAK,OAAO,IAAI,EAAE;AAAA,EAC3B;AAAA;AAAA;AAAA,EAKA,UAAU,UAA6C;AACrD,QAAI,KAAK,WAAW;AAClB,aAAO,MAAM;AAAA,MAAC;AAAA,IAChB;AAEA,SAAK,WAAW,IAAI,QAAQ;AAE5B,WAAO,MAAM;AACX,WAAK,WAAW,OAAO,QAAQ;AAAA,IACjC;AAAA,EACF;AAAA;AAAA,EAGA,UAAgB;AACd,QAAI,KAAK,WAAW;AAClB;AAAA,IACF;AAEA,SAAK,YAAY;AACjB,SAAK,oBAAA;AACL,SAAK,kBAAkB,MAAA;AACvB,QAAI,KAAK,WAAW;AAClB,iBAAW,MAAM,KAAK,UAAW,IAAA;AACjC,WAAK,YAAY;AAAA,IACnB;AACA,SAAK,YAAA;AACL,SAAK,WAAW,MAAA;AAChB,SAAK,OAAO,MAAA;AACZ,SAAK,aAAa,MAAA;AAAA,EACpB;AAAA;AAAA,EAGU,WAAW,IAAsB;AACzC,QAAI,CAAC,KAAK,WAAW;AACnB,WAAK,YAAY,CAAA;AAAA,IACnB;AACA,SAAK,UAAU,KAAK,EAAE;AAAA,EACxB;AAAA,EAeQ,OAAO,MAA0B;AACvC,eAAW,YAAY,KAAK,YAAY;AACtC,eAAS,KAAK,QAAe,IAAW;AAAA,IAC1C;AAAA,EACF;AAAA,EAEQ,eAAqB;AAC3B,SAAK,OAAO,MAAA;AACZ,eAAW,QAAQ,KAAK,QAAQ;AAC9B,WAAK,OAAO,IAAI,KAAK,IAAI,IAAI;AAAA,IAC/B;AAAA,EACF;AAAA;AAAA,EAIQ,kBAAkB,OAAiB;AACzC,UAAM,SAAS,MAAM,SAAS,KAAK;AACnC,QAAI,UAAU,EAAG,QAAO;AAExB,UAAM,aAAa,MAAM,MAAM,GAAG,MAAM;AACxC,UAAM,UAAU,KAAK,cAAc,YAAY,UAAU;AAEzD,QAAI,YAAY,MAAO,QAAO;AAE9B,QAAI,QAAQ,WAAW,EAAG,QAAO;AAEjC,UAAM,WAAW,IAAI,IAAI,QAAQ,IAAI,CAAA,SAAQ,KAAK,EAAE,CAAC;AACrD,UAAM,SAAS,MAAM,OAAO,CAAA,SAAQ,CAAC,SAAS,IAAI,KAAK,EAAE,CAAC;AAG1D,eAAW,QAAQ,SAAS;AAC1B,WAAK,OAAO,OAAO,KAAK,EAAE;AAC1B,WAAK,aAAa,OAAO,KAAK,EAAE;AAAA,IAClC;AAEA,WAAO;AAAA,EACT;AAAA,EAEQ,cAAc,YAAiB,QAAyC;AAC9E,QAAI,CAAC,KAAK,QAAS,QAAO;AAE1B,UAAM,SAAS,KAAK,QAAQ,YAAY,MAAM;AAC9C,QAAI,WAAW,OAAO;AAEpB,UAAI,WAAW,WAAW,cAAc,KAAK,WAAW,GAAG;AACzD,cAAM,cAAc,KAAK,OAAO,SAAS,WAAW;AACpD,YAAI,cAAc,KAAK,WAAW,GAAG;AACnC,kBAAQ;AAAA,YACN,8CAA8C,WAAW,IAAI,KAAK,QAAQ;AAAA,UAAA;AAAA,QAG9E;AAAA,MACF;AACA,aAAO;AAAA,IACT;AACA,QAAI,MAAM,QAAQ,MAAM,GAAG;AAEzB,YAAM,eAAe,IAAI,IAAI,WAAW,IAAI,CAAA,MAAK,EAAE,EAAE,CAAC;AACtD,aAAO,OAAO,OAAO,CAAA,SAAQ,aAAa,IAAI,KAAK,EAAE,CAAC;AAAA,IACxD;AACA,WAAO;AAAA,EACT;AAAA,EAEQ,gBAAsB;AAC5B,QAAI,KAAK,aAAa,CAAC,KAAK,eAAe,KAAK,QAAQ,EAAG;AAE3D,UAAM,MAAM,KAAK,IAAA;AACjB,UAAM,MAAM,KAAK;AACjB,UAAM,UAAe,CAAA;AAErB,eAAW,QAAQ,KAAK,QAAQ;AAC9B,YAAM,KAAK,KAAK,YAAY,IAAI,KAAK,EAAE;AACvC,UAAI,OAAO,UAAc,MAAM,MAAO,KAAK;AACzC,gBAAQ,KAAK,IAAI;AAAA,MACnB;AAAA,IACF;AAEA,QAAI,QAAQ,WAAW,GAAG;AACxB,WAAK,uBAAA;AACL;AAAA,IACF;AAEA,UAAM,UAAU,KAAK,cAAc,SAAS,KAAK;AAEjD,QAAI,YAAY,OAAO;AACrB,WAAK,uBAAA;AACL;AAAA,IACF;AAEA,QAAI,QAAQ,WAAW,GAAG;AACxB,WAAK,uBAAA;AACL;AAAA,IACF;AAEA,UAAM,WAAW,IAAI,IAAI,QAAQ,IAAI,CAAA,SAAQ,KAAK,EAAE,CAAC;AACrD,UAAM,OAAO,KAAK;AAClB,SAAK,SAAS;AAAA,MACX,KAAa,OAAO,CAAC,SAAY,CAAC,SAAS,IAAI,KAAK,EAAE,CAAC;AAAA,IAAA;AAG1D,eAAW,QAAQ,SAAS;AAC1B,WAAK,OAAO,OAAO,KAAK,EAAE;AAC1B,WAAK,YAAY,OAAO,KAAK,EAAE;AAAA,IACjC;AAEA,SAAK,OAAO,IAAI;AAChB,SAAK,uBAAA;AAAA,EACP;AAAA,EAEQ,yBAA+B;AACrC,SAAK,oBAAA;AAEL,QAAI,KAAK,aAAa,CAAC,KAAK,eAAe,KAAK,QAAQ,KAAK,KAAK,YAAY,SAAS,EAAG;AAE1F,UAAM,MAAM,KAAK,IAAA;AACjB,UAAM,MAAM,KAAK;AACjB,QAAI,WAAW;AAEf,eAAW,MAAM,KAAK,YAAY,OAAA,GAAU;AAC1C,UAAI,KAAK,SAAU,YAAW;AAAA,IAChC;AAEA,UAAM,QAAQ,KAAK,IAAI,GAAI,WAAW,MAAO,GAAG;AAChD,SAAK,iBAAiB,WAAW,MAAM,KAAK,cAAA,GAAiB,KAAK;AAAA,EACpE;AAAA,EAEQ,sBAA4B;AAClC,QAAI,KAAK,mBAAmB,MAAM;AAChC,mBAAa,KAAK,cAAc;AAChC,WAAK,iBAAiB;AAAA,IACxB;AAAA,EACF;AACF;"}
+{"version":3,"file":"Collection.js","sources":["../src/Collection.ts"],"sourcesContent":["import type { Listener, Subscribable } from './types';\n\nconst __DEV__ = typeof __MVC_KIT_DEV__ !== 'undefined' && __MVC_KIT_DEV__;\n\nfunction freeze<T>(obj: T): T {\n  return __DEV__ ? Object.freeze(obj) as T : obj;\n}\n\ntype CollectionState<T> = T[];\ntype CollectionListener<T> = Listener<CollectionState<T>>;\n\n/**\n * Reactive typed array with CRUD and query methods.\n */\nexport class Collection<T extends { id: string | number }> implements Subscribable<CollectionState<T>> {\n  /** Maximum number of items before FIFO eviction. 0 = unlimited. */\n  static MAX_SIZE = 0;\n  /** Time-to-live in milliseconds. 0 = no expiry. */\n  static TTL = 0;\n\n  private _items: readonly T[] = [];\n  private _disposed = false;\n  private _listeners = new Set<CollectionListener<T>>();\n  private _index = new Map<T['id'], T>();\n  private _abortController: AbortController | null = null;\n  private _cleanups: (() => void)[] | null = null;\n  private _timestamps: Map<T['id'], number> | null = null;\n  private _evictionTimer: ReturnType<typeof setTimeout> | null = null;\n\n  constructor(initialItems: T[] = []) {\n    let result = [...initialItems];\n\n    if (this._ttl > 0) {\n      this._timestamps = new Map();\n      const now = Date.now();\n      for (const item of result) {\n        this._timestamps.set(item.id, now);\n      }\n    }\n\n    if (this._maxSize > 0 && result.length > this._maxSize) {\n      // FIFO: trim from the front (oldest items)\n      const excess = result.length - this._maxSize;\n      const evicted = result.slice(0, excess);\n      result = result.slice(excess);\n      for (const item of evicted) {\n        this._timestamps?.delete(item.id);\n      }\n    }\n\n    this._items = freeze(result);\n    this.rebuildIndex();\n    this._scheduleEvictionTimer();\n  }\n\n  /**\n   * Alias for Subscribable compatibility.\n   */\n  get state(): T[] {\n    return this._items as T[];\n  }\n\n  /** The raw array of items. */\n  get items(): T[] {\n    return this._items as T[];\n  }\n\n  /** Number of items in the collection. */\n  get length(): number {\n    return this._items.length;\n  }\n\n  /** Whether this instance has been disposed. */\n  get disposed(): boolean {\n    return this._disposed;\n  }\n\n  /** AbortSignal that fires when this instance is disposed. Lazily created. */\n  get disposeSignal(): AbortSignal {\n    if (!this._abortController) {\n      this._abortController = new AbortController();\n    }\n    return this._abortController.signal;\n  }\n\n  // ── Config Accessors ──\n\n  private get _maxSize(): number {\n    return (this.constructor as typeof Collection).MAX_SIZE;\n  }\n\n  private get _ttl(): number {\n    return (this.constructor as typeof Collection).TTL;\n  }\n\n  // ── CRUD Methods (notify listeners) ──\n\n  /**\n   * Add one or more items. Items with existing IDs are silently skipped.\n   */\n  add(...items: T[]): void {\n    if (this._disposed) {\n      throw new Error('Cannot add to disposed Collection');\n    }\n\n    if (items.length === 0) {\n      return;\n    }\n\n    // Fast path: single item (most common case)\n    if (items.length === 1) {\n      const item = items[0];\n      if (this._index.has(item.id)) return;\n      const prev = this._items;\n      let result = [...prev, item];\n      this._index.set(item.id, item);\n      if (this._timestamps) this._timestamps.set(item.id, Date.now());\n      if (this._maxSize > 0 && result.length > this._maxSize) {\n        result = this._evictForCapacity(result);\n      }\n      this._items = freeze(result);\n      this.notify(prev);\n      this._scheduleEvictionTimer();\n      return;\n    }\n\n    // Multi-item path\n    const seen = new Set<T['id']>();\n    const newItems: T[] = [];\n    for (const item of items) {\n      if (!this._index.has(item.id) && !seen.has(item.id)) {\n        newItems.push(item);\n        seen.add(item.id);\n      }\n    }\n    if (newItems.length === 0) return;\n\n    const prev = this._items;\n    let result = [...prev, ...newItems];\n\n    for (const item of newItems) {\n      this._index.set(item.id, item);\n    }\n\n    // Record timestamps for TTL\n    if (this._timestamps) {\n      const now = Date.now();\n      for (const item of newItems) {\n        this._timestamps.set(item.id, now);\n      }\n    }\n\n    // Enforce capacity before freeze/notify\n    if (this._maxSize > 0 && result.length > this._maxSize) {\n      result = this._evictForCapacity(result);\n    }\n\n    this._items = freeze(result);\n    this.notify(prev);\n    this._scheduleEvictionTimer();\n  }\n\n  /**\n   * Add or replace items by ID. Existing items are replaced in-place\n   * (preserving array position); new items are appended. Deduplicates\n   * input — last occurrence wins. No-op if nothing changed (reference\n   * comparison).\n   */\n  upsert(...items: T[]): void {\n    if (this._disposed) {\n      throw new Error('Cannot upsert on disposed Collection');\n    }\n    if (items.length === 0) return;\n\n    // Fast path: single item (most common case — channel messages, real-time updates)\n    if (items.length === 1) {\n      const item = items[0];\n      const existing = this._index.get(item.id);\n\n      if (existing) {\n        // Replace in-place — skip if same reference\n        if (existing === item) return;\n        const prev = this._items;\n        const idx = this._items.indexOf(existing);\n        const newItems = [...prev];\n        newItems[idx] = item;\n        this._index.set(item.id, item);\n        if (this._timestamps) this._timestamps.set(item.id, Date.now());\n        this._items = freeze(newItems);\n        this.notify(prev);\n      } else {\n        // New item — append (with capacity enforcement)\n        const prev = this._items;\n        let result = [...prev, item];\n        this._index.set(item.id, item);\n        if (this._timestamps) this._timestamps.set(item.id, Date.now());\n        if (this._maxSize > 0 && result.length > this._maxSize) {\n          result = this._evictForCapacity(result);\n        }\n        this._items = freeze(result);\n        this.notify(prev);\n        this._scheduleEvictionTimer();\n      }\n      return;\n    }\n\n    // Multi-item path: deduplicate input — last occurrence wins\n    const incoming = new Map<T['id'], T>();\n    for (const item of items) {\n      incoming.set(item.id, item);\n    }\n\n    const prev = this._items;\n    let changed = false;\n    const replaced = new Set<T['id']>();\n    const newArray: T[] = [];\n\n    // Replace existing items in-place\n    for (const existing of prev) {\n      if (incoming.has(existing.id)) {\n        const replacement = incoming.get(existing.id)!;\n        if (replacement !== existing) changed = true;\n        newArray.push(replacement);\n        replaced.add(existing.id);\n      } else {\n        newArray.push(existing);\n      }\n    }\n\n    // Append genuinely new items\n    for (const [id, item] of incoming) {\n      if (!replaced.has(id)) {\n        newArray.push(item);\n        changed = true;\n      }\n    }\n\n    if (!changed) return;\n\n    // Record/refresh timestamps for TTL (upsert refreshes existing)\n    if (this._timestamps) {\n      const now = Date.now();\n      for (const [id] of incoming) {\n        this._timestamps.set(id, now);\n      }\n    }\n\n    for (const [id, item] of incoming) {\n      this._index.set(id, item);\n    }\n\n    // Enforce capacity before freeze/notify\n    let result = newArray;\n    if (this._maxSize > 0 && result.length > this._maxSize) {\n      result = this._evictForCapacity(result);\n    }\n\n    this._items = freeze(result);\n    this.notify(prev);\n    this._scheduleEvictionTimer();\n  }\n\n  /**\n   * Remove items by id(s).\n   */\n  remove(...ids: T['id'][]): void {\n    if (this._disposed) {\n      throw new Error('Cannot remove from disposed Collection');\n    }\n\n    if (ids.length === 0) {\n      return;\n    }\n\n    // Fast path: single id (most common case)\n    if (ids.length === 1) {\n      const id = ids[0];\n      if (!this._index.has(id)) return;\n      const prev = this._items;\n      this._items = freeze(prev.filter(item => item.id !== id));\n      this._index.delete(id);\n      this._timestamps?.delete(id);\n      this.notify(prev);\n      this._scheduleEvictionTimer();\n      return;\n    }\n\n    // Multi-id path\n    const idSet = new Set(ids);\n    const filtered = this._items.filter(item => !idSet.has(item.id));\n\n    if (filtered.length === this._items.length) {\n      return; // No items removed\n    }\n\n    const prev = this._items;\n    this._items = freeze(filtered);\n\n    for (const id of ids) {\n      this._index.delete(id);\n      this._timestamps?.delete(id);\n    }\n\n    this.notify(prev);\n    this._scheduleEvictionTimer();\n  }\n\n  /**\n   * Update an item by id with partial changes.\n   */\n  update(id: T['id'], changes: Partial<T>): void {\n    if (this._disposed) {\n      throw new Error('Cannot update disposed Collection');\n    }\n\n    // O(1) existence check via index Map\n    const existing = this._index.get(id);\n    if (!existing) return;\n\n    // Check if anything actually changed (before any array work)\n    const keys = Object.keys(changes) as (keyof T)[];\n    const hasChanges = keys.some(key => changes[key] !== existing[key]);\n    if (!hasChanges) return;\n\n    const updated = { ...existing, ...changes, id };\n    const prev = this._items;\n    const idx = this._items.indexOf(existing);\n    const newItems = [...prev];\n    newItems[idx] = updated;\n    this._items = freeze(newItems);\n    this._index.set(id, updated);\n\n    this.notify(prev);\n  }\n\n  /**\n   * Replace all items.\n   */\n  reset(items: T[]): void {\n    if (this._disposed) {\n      throw new Error('Cannot reset disposed Collection');\n    }\n\n    const prev = this._items;\n\n    // Record timestamps for TTL\n    if (this._timestamps) {\n      this._timestamps.clear();\n      const now = Date.now();\n      for (const item of items) {\n        this._timestamps.set(item.id, now);\n      }\n    }\n\n    let result = [...items];\n\n    // Enforce capacity before freeze/notify\n    if (this._maxSize > 0 && result.length > this._maxSize) {\n      result = this._evictForCapacity(result);\n    }\n\n    this._items = freeze(result);\n    this.rebuildIndex();\n\n    this.notify(prev);\n    this._scheduleEvictionTimer();\n  }\n\n  /**\n   * Remove all items.\n   */\n  clear(): void {\n    if (this._disposed) {\n      throw new Error('Cannot clear disposed Collection');\n    }\n\n    if (this._items.length === 0) {\n      return;\n    }\n\n    const prev = this._items;\n    this._items = freeze([] as T[]);\n    this._index.clear();\n    this._timestamps?.clear();\n    this._clearEvictionTimer();\n\n    this.notify(prev);\n  }\n\n  /**\n   * Snapshot current state, apply callback mutations, and return a rollback function.\n   * Rollback restores items to pre-callback state regardless of later mutations.\n   */\n  optimistic(callback: () => void): () => void {\n    if (this._disposed) {\n      throw new Error('Cannot perform optimistic update on disposed Collection');\n    }\n\n    const snapshot = this._items;\n    const timestampSnapshot = this._timestamps ? new Map(this._timestamps) : null;\n    callback();\n\n    let rolledBack = false;\n    return () => {\n      if (rolledBack || this._disposed) return;\n      rolledBack = true;\n\n      const prev = this._items;\n      this._items = snapshot;\n      if (timestampSnapshot) {\n        this._timestamps = timestampSnapshot;\n      }\n      this.rebuildIndex();\n      this.notify(prev);\n      this._scheduleEvictionTimer();\n    };\n  }\n\n  // ── Query Methods (pure, no notification) ──\n\n  /**\n   * Get item by id.\n   */\n  get(id: T['id']): T | undefined {\n    return this._index.get(id);\n  }\n\n  /**\n   * Check if item exists by id.\n   */\n  has(id: T['id']): boolean {\n    return this._index.has(id);\n  }\n\n  /**\n   * Find first item matching predicate.\n   */\n  find(predicate: (item: T) => boolean): T | undefined {\n    return this._items.find(predicate);\n  }\n\n  /**\n   * Filter items matching predicate.\n   */\n  filter(predicate: (item: T) => boolean): T[] {\n    return this._items.filter(predicate) as T[];\n  }\n\n  /**\n   * Return sorted copy.\n   */\n  sorted(compareFn: (a: T, b: T) => number): T[] {\n    return [...this._items].sort(compareFn);\n  }\n\n  /**\n   * Map items to new array.\n   */\n  map<U>(fn: (item: T) => U): U[] {\n    return this._items.map(fn);\n  }\n\n  // ── Subscribable interface ──\n\n  /** Subscribes to state changes. Returns an unsubscribe function. */\n  subscribe(listener: CollectionListener<T>): () => void {\n    if (this._disposed) {\n      return () => {};\n    }\n\n    this._listeners.add(listener);\n\n    return () => {\n      this._listeners.delete(listener);\n    };\n  }\n\n  /** Tears down the instance, releasing all subscriptions and resources. */\n  dispose(): void {\n    if (this._disposed) {\n      return;\n    }\n\n    this._disposed = true;\n    this._clearEvictionTimer();\n    this._abortController?.abort();\n    if (this._cleanups) {\n      for (const fn of this._cleanups) fn();\n      this._cleanups = null;\n    }\n    this.onDispose?.();\n    this._listeners.clear();\n    this._index.clear();\n    this._timestamps?.clear();\n  }\n\n  /** Registers a cleanup function to be called on dispose. @protected */\n  protected addCleanup(fn: () => void): void {\n    if (!this._cleanups) {\n      this._cleanups = [];\n    }\n    this._cleanups.push(fn);\n  }\n\n  /** Lifecycle hook called during dispose(). Override for custom teardown. @protected */\n  protected onDispose?(): void;\n\n  /**\n   * Called before items are auto-evicted by capacity or TTL.\n   * Override to filter which items get evicted, or veto entirely.\n   *\n   * @param items - Candidates for eviction\n   * @param reason - Why eviction is happening\n   * @returns void to proceed with all, false to veto, or T[] subset to evict only those\n   */\n  protected onEvict?(items: T[], reason: 'capacity' | 'ttl'): T[] | false | void;\n\n  private notify(prev: readonly T[]): void {\n    for (const listener of this._listeners) {\n      listener(this._items as T[], prev as T[]);\n    }\n  }\n\n  private rebuildIndex(): void {\n    this._index.clear();\n    for (const item of this._items) {\n      this._index.set(item.id, item);\n    }\n  }\n\n  // ── Eviction Internals ──\n\n  private _evictForCapacity(items: T[]): T[] {\n    const excess = items.length - this._maxSize;\n    if (excess <= 0) return items;\n\n    const candidates = items.slice(0, excess);\n    const toEvict = this._applyOnEvict(candidates, 'capacity');\n\n    if (toEvict === false) return items; // veto\n\n    if (toEvict.length === 0) return items; // nothing to evict\n\n    const evictIds = new Set(toEvict.map(item => item.id));\n    const result = items.filter(item => !evictIds.has(item.id));\n\n    // Clean up index and timestamps for evicted items\n    for (const item of toEvict) {\n      this._index.delete(item.id);\n      this._timestamps?.delete(item.id);\n    }\n\n    return result;\n  }\n\n  private _applyOnEvict(candidates: T[], reason: 'capacity' | 'ttl'): T[] | false {\n    if (!this.onEvict) return candidates;\n\n    const result = this.onEvict(candidates, reason);\n    if (result === false) {\n      // DEV warning when veto causes collection to exceed 2x MAX_SIZE\n      if (__DEV__ && reason === 'capacity' && this._maxSize > 0) {\n        const currentSize = this._items.length + candidates.length;\n        if (currentSize > this._maxSize * 2) {\n          console.warn(\n            `[mvc-kit] Collection exceeded 2x MAX_SIZE (${currentSize}/${this._maxSize}). ` +\n            `onEvict is vetoing eviction — this may cause unbounded growth.`\n          );\n        }\n      }\n      return false;\n    }\n    if (Array.isArray(result)) {\n      // Only include items that are actually in the current items\n      const candidateIds = new Set(candidates.map(c => c.id));\n      return result.filter(item => candidateIds.has(item.id));\n    }\n    return candidates; // void = proceed with all\n  }\n\n  private _sweepExpired(): void {\n    if (this._disposed || !this._timestamps || this._ttl <= 0) return;\n\n    const now = Date.now();\n    const ttl = this._ttl;\n    const expired: T[] = [];\n\n    for (const item of this._items) {\n      const ts = this._timestamps.get(item.id);\n      if (ts !== undefined && (now - ts) >= ttl) {\n        expired.push(item);\n      }\n    }\n\n    if (expired.length === 0) {\n      this._scheduleEvictionTimer();\n      return;\n    }\n\n    const toEvict = this._applyOnEvict(expired, 'ttl');\n\n    if (toEvict === false) {\n      this._scheduleEvictionTimer();\n      return;\n    }\n\n    if (toEvict.length === 0) {\n      this._scheduleEvictionTimer();\n      return;\n    }\n\n    const evictIds = new Set(toEvict.map(item => item.id));\n    const prev = this._items;\n    this._items = freeze(\n      (prev as T[]).filter((item: T) => !evictIds.has(item.id))\n    );\n\n    for (const item of toEvict) {\n      this._index.delete(item.id);\n      this._timestamps.delete(item.id);\n    }\n\n    this.notify(prev);\n    this._scheduleEvictionTimer();\n  }\n\n  private _scheduleEvictionTimer(): void {\n    this._clearEvictionTimer();\n\n    if (this._disposed || !this._timestamps || this._ttl <= 0 || this._timestamps.size === 0) return;\n\n    const now = Date.now();\n    const ttl = this._ttl;\n    let earliest = Infinity;\n\n    for (const ts of this._timestamps.values()) {\n      if (ts < earliest) earliest = ts;\n    }\n\n    const delay = Math.max(0, (earliest + ttl) - now);\n    this._evictionTimer = setTimeout(() => this._sweepExpired(), delay);\n  }\n\n  private _clearEvictionTimer(): void {\n    if (this._evictionTimer !== null) {\n      clearTimeout(this._evictionTimer);\n      this._evictionTimer = null;\n    }\n  }\n}\n"],"names":["prev","result"],"mappings":"AAEA,MAAM,UAAU,OAAO,oBAAoB,eAAe;AAE1D,SAAS,OAAU,KAAW;AAC5B,SAAO,UAAU,OAAO,OAAO,GAAG,IAAS;AAC7C;AAQO,MAAM,WAA0F;AAAA;AAAA,EAErG,OAAO,WAAW;AAAA;AAAA,EAElB,OAAO,MAAM;AAAA,EAEL,SAAuB,CAAA;AAAA,EACvB,YAAY;AAAA,EACZ,iCAAiB,IAAA;AAAA,EACjB,6BAAa,IAAA;AAAA,EACb,mBAA2C;AAAA,EAC3C,YAAmC;AAAA,EACnC,cAA2C;AAAA,EAC3C,iBAAuD;AAAA,EAE/D,YAAY,eAAoB,IAAI;AAClC,QAAI,SAAS,CAAC,GAAG,YAAY;AAE7B,QAAI,KAAK,OAAO,GAAG;AACjB,WAAK,kCAAkB,IAAA;AACvB,YAAM,MAAM,KAAK,IAAA;AACjB,iBAAW,QAAQ,QAAQ;AACzB,aAAK,YAAY,IAAI,KAAK,IAAI,GAAG;AAAA,MACnC;AAAA,IACF;AAEA,QAAI,KAAK,WAAW,KAAK,OAAO,SAAS,KAAK,UAAU;AAEtD,YAAM,SAAS,OAAO,SAAS,KAAK;AACpC,YAAM,UAAU,OAAO,MAAM,GAAG,MAAM;AACtC,eAAS,OAAO,MAAM,MAAM;AAC5B,iBAAW,QAAQ,SAAS;AAC1B,aAAK,aAAa,OAAO,KAAK,EAAE;AAAA,MAClC;AAAA,IACF;AAEA,SAAK,SAAS,OAAO,MAAM;AAC3B,SAAK,aAAA;AACL,SAAK,uBAAA;AAAA,EACP;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,QAAa;AACf,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,QAAa;AACf,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,SAAiB;AACnB,WAAO,KAAK,OAAO;AAAA,EACrB;AAAA;AAAA,EAGA,IAAI,WAAoB;AACtB,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,gBAA6B;AAC/B,QAAI,CAAC,KAAK,kBAAkB;AAC1B,WAAK,mBAAmB,IAAI,gBAAA;AAAA,IAC9B;AACA,WAAO,KAAK,iBAAiB;AAAA,EAC/B;AAAA;AAAA,EAIA,IAAY,WAAmB;AAC7B,WAAQ,KAAK,YAAkC;AAAA,EACjD;AAAA,EAEA,IAAY,OAAe;AACzB,WAAQ,KAAK,YAAkC;AAAA,EACjD;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,OAAO,OAAkB;AACvB,QAAI,KAAK,WAAW;AAClB,YAAM,IAAI,MAAM,mCAAmC;AAAA,IACrD;AAEA,QAAI,MAAM,WAAW,GAAG;AACtB;AAAA,IACF;AAGA,QAAI,MAAM,WAAW,GAAG;AACtB,YAAM,OAAO,MAAM,CAAC;AACpB,UAAI,KAAK,OAAO,IAAI,KAAK,EAAE,EAAG;AAC9B,YAAMA,QAAO,KAAK;AAClB,UAAIC,UAAS,CAAC,GAAGD,OAAM,IAAI;AAC3B,WAAK,OAAO,IAAI,KAAK,IAAI,IAAI;AAC7B,UAAI,KAAK,YAAa,MAAK,YAAY,IAAI,KAAK,IAAI,KAAK,KAAK;AAC9D,UAAI,KAAK,WAAW,KAAKC,QAAO,SAAS,KAAK,UAAU;AACtDA,kBAAS,KAAK,kBAAkBA,OAAM;AAAA,MACxC;AACA,WAAK,SAAS,OAAOA,OAAM;AAC3B,WAAK,OAAOD,KAAI;AAChB,WAAK,uBAAA;AACL;AAAA,IACF;AAGA,UAAM,2BAAW,IAAA;AACjB,UAAM,WAAgB,CAAA;AACtB,eAAW,QAAQ,OAAO;AACxB,UAAI,CAAC,KAAK,OAAO,IAAI,KAAK,EAAE,KAAK,CAAC,KAAK,IAAI,KAAK,EAAE,GAAG;AACnD,iBAAS,KAAK,IAAI;AAClB,aAAK,IAAI,KAAK,EAAE;AAAA,MAClB;AAAA,IACF;AACA,QAAI,SAAS,WAAW,EAAG;AAE3B,UAAM,OAAO,KAAK;AAClB,QAAI,SAAS,CAAC,GAAG,MAAM,GAAG,QAAQ;AAElC,eAAW,QAAQ,UAAU;AAC3B,WAAK,OAAO,IAAI,KAAK,IAAI,IAAI;AAAA,IAC/B;AAGA,QAAI,KAAK,aAAa;AACpB,YAAM,MAAM,KAAK,IAAA;AACjB,iBAAW,QAAQ,UAAU;AAC3B,aAAK,YAAY,IAAI,KAAK,IAAI,GAAG;AAAA,MACnC;AAAA,IACF;AAGA,QAAI,KAAK,WAAW,KAAK,OAAO,SAAS,KAAK,UAAU;AACtD,eAAS,KAAK,kBAAkB,MAAM;AAAA,IACxC;AAEA,SAAK,SAAS,OAAO,MAAM;AAC3B,SAAK,OAAO,IAAI;AAChB,SAAK,uBAAA;AAAA,EACP;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,UAAU,OAAkB;AAC1B,QAAI,KAAK,WAAW;AAClB,YAAM,IAAI,MAAM,sCAAsC;AAAA,IACxD;AACA,QAAI,MAAM,WAAW,EAAG;AAGxB,QAAI,MAAM,WAAW,GAAG;AACtB,YAAM,OAAO,MAAM,CAAC;AACpB,YAAM,WAAW,KAAK,OAAO,IAAI,KAAK,EAAE;AAExC,UAAI,UAAU;AAEZ,YAAI,aAAa,KAAM;AACvB,cAAMA,QAAO,KAAK;AAClB,cAAM,MAAM,KAAK,OAAO,QAAQ,QAAQ;AACxC,cAAM,WAAW,CAAC,GAAGA,KAAI;AACzB,iBAAS,GAAG,IAAI;AAChB,aAAK,OAAO,IAAI,KAAK,IAAI,IAAI;AAC7B,YAAI,KAAK,YAAa,MAAK,YAAY,IAAI,KAAK,IAAI,KAAK,KAAK;AAC9D,aAAK,SAAS,OAAO,QAAQ;AAC7B,aAAK,OAAOA,KAAI;AAAA,MAClB,OAAO;AAEL,cAAMA,QAAO,KAAK;AAClB,YAAIC,UAAS,CAAC,GAAGD,OAAM,IAAI;AAC3B,aAAK,OAAO,IAAI,KAAK,IAAI,IAAI;AAC7B,YAAI,KAAK,YAAa,MAAK,YAAY,IAAI,KAAK,IAAI,KAAK,KAAK;AAC9D,YAAI,KAAK,WAAW,KAAKC,QAAO,SAAS,KAAK,UAAU;AACtDA,oBAAS,KAAK,kBAAkBA,OAAM;AAAA,QACxC;AACA,aAAK,SAAS,OAAOA,OAAM;AAC3B,aAAK,OAAOD,KAAI;AAChB,aAAK,uBAAA;AAAA,MACP;AACA;AAAA,IACF;AAGA,UAAM,+BAAe,IAAA;AACrB,eAAW,QAAQ,OAAO;AACxB,eAAS,IAAI,KAAK,IAAI,IAAI;AAAA,IAC5B;AAEA,UAAM,OAAO,KAAK;AAClB,QAAI,UAAU;AACd,UAAM,+BAAe,IAAA;AACrB,UAAM,WAAgB,CAAA;AAGtB,eAAW,YAAY,MAAM;AAC3B,UAAI,SAAS,IAAI,SAAS,EAAE,GAAG;AAC7B,cAAM,cAAc,SAAS,IAAI,SAAS,EAAE;AAC5C,YAAI,gBAAgB,SAAU,WAAU;AACxC,iBAAS,KAAK,WAAW;AACzB,iBAAS,IAAI,SAAS,EAAE;AAAA,MAC1B,OAAO;AACL,iBAAS,KAAK,QAAQ;AAAA,MACxB;AAAA,IACF;AAGA,eAAW,CAAC,IAAI,IAAI,KAAK,UAAU;AACjC,UAAI,CAAC,SAAS,IAAI,EAAE,GAAG;AACrB,iBAAS,KAAK,IAAI;AAClB,kBAAU;AAAA,MACZ;AAAA,IACF;AAEA,QAAI,CAAC,QAAS;AAGd,QAAI,KAAK,aAAa;AACpB,YAAM,MAAM,KAAK,IAAA;AACjB,iBAAW,CAAC,EAAE,KAAK,UAAU;AAC3B,aAAK,YAAY,IAAI,IAAI,GAAG;AAAA,MAC9B;AAAA,IACF;AAEA,eAAW,CAAC,IAAI,IAAI,KAAK,UAAU;AACjC,WAAK,OAAO,IAAI,IAAI,IAAI;AAAA,IAC1B;AAGA,QAAI,SAAS;AACb,QAAI,KAAK,WAAW,KAAK,OAAO,SAAS,KAAK,UAAU;AACtD,eAAS,KAAK,kBAAkB,MAAM;AAAA,IACxC;AAEA,SAAK,SAAS,OAAO,MAAM;AAC3B,SAAK,OAAO,IAAI;AAChB,SAAK,uBAAA;AAAA,EACP;AAAA;AAAA;AAAA;AAAA,EAKA,UAAU,KAAsB;AAC9B,QAAI,KAAK,WAAW;AAClB,YAAM,IAAI,MAAM,wCAAwC;AAAA,IAC1D;AAEA,QAAI,IAAI,WAAW,GAAG;AACpB;AAAA,IACF;AAGA,QAAI,IAAI,WAAW,GAAG;AACpB,YAAM,KAAK,IAAI,CAAC;AAChB,UAAI,CAAC,KAAK,OAAO,IAAI,EAAE,EAAG;AAC1B,YAAMA,QAAO,KAAK;AAClB,WAAK,SAAS,OAAOA,MAAK,OAAO,UAAQ,KAAK,OAAO,EAAE,CAAC;AACxD,WAAK,OAAO,OAAO,EAAE;AACrB,WAAK,aAAa,OAAO,EAAE;AAC3B,WAAK,OAAOA,KAAI;AAChB,WAAK,uBAAA;AACL;AAAA,IACF;AAGA,UAAM,QAAQ,IAAI,IAAI,GAAG;AACzB,UAAM,WAAW,KAAK,OAAO,OAAO,CAAA,SAAQ,CAAC,MAAM,IAAI,KAAK,EAAE,CAAC;AAE/D,QAAI,SAAS,WAAW,KAAK,OAAO,QAAQ;AAC1C;AAAA,IACF;AAEA,UAAM,OAAO,KAAK;AAClB,SAAK,SAAS,OAAO,QAAQ;AAE7B,eAAW,MAAM,KAAK;AACpB,WAAK,OAAO,OAAO,EAAE;AACrB,WAAK,aAAa,OAAO,EAAE;AAAA,IAC7B;AAEA,SAAK,OAAO,IAAI;AAChB,SAAK,uBAAA;AAAA,EACP;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,IAAa,SAA2B;AAC7C,QAAI,KAAK,WAAW;AAClB,YAAM,IAAI,MAAM,mCAAmC;AAAA,IACrD;AAGA,UAAM,WAAW,KAAK,OAAO,IAAI,EAAE;AACnC,QAAI,CAAC,SAAU;AAGf,UAAM,OAAO,OAAO,KAAK,OAAO;AAChC,UAAM,aAAa,KAAK,KAAK,CAAA,QAAO,QAAQ,GAAG,MAAM,SAAS,GAAG,CAAC;AAClE,QAAI,CAAC,WAAY;AAEjB,UAAM,UAAU,EAAE,GAAG,UAAU,GAAG,SAAS,GAAA;AAC3C,UAAM,OAAO,KAAK;AAClB,UAAM,MAAM,KAAK,OAAO,QAAQ,QAAQ;AACxC,UAAM,WAAW,CAAC,GAAG,IAAI;AACzB,aAAS,GAAG,IAAI;AAChB,SAAK,SAAS,OAAO,QAAQ;AAC7B,SAAK,OAAO,IAAI,IAAI,OAAO;AAE3B,SAAK,OAAO,IAAI;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA,EAKA,MAAM,OAAkB;AACtB,QAAI,KAAK,WAAW;AAClB,YAAM,IAAI,MAAM,kCAAkC;AAAA,IACpD;AAEA,UAAM,OAAO,KAAK;AAGlB,QAAI,KAAK,aAAa;AACpB,WAAK,YAAY,MAAA;AACjB,YAAM,MAAM,KAAK,IAAA;AACjB,iBAAW,QAAQ,OAAO;AACxB,aAAK,YAAY,IAAI,KAAK,IAAI,GAAG;AAAA,MACnC;AAAA,IACF;AAEA,QAAI,SAAS,CAAC,GAAG,KAAK;AAGtB,QAAI,KAAK,WAAW,KAAK,OAAO,SAAS,KAAK,UAAU;AACtD,eAAS,KAAK,kBAAkB,MAAM;AAAA,IACxC;AAEA,SAAK,SAAS,OAAO,MAAM;AAC3B,SAAK,aAAA;AAEL,SAAK,OAAO,IAAI;AAChB,SAAK,uBAAA;AAAA,EACP;AAAA;AAAA;AAAA;AAAA,EAKA,QAAc;AACZ,QAAI,KAAK,WAAW;AAClB,YAAM,IAAI,MAAM,kCAAkC;AAAA,IACpD;AAEA,QAAI,KAAK,OAAO,WAAW,GAAG;AAC5B;AAAA,IACF;AAEA,UAAM,OAAO,KAAK;AAClB,SAAK,SAAS,OAAO,EAAS;AAC9B,SAAK,OAAO,MAAA;AACZ,SAAK,aAAa,MAAA;AAClB,SAAK,oBAAA;AAEL,SAAK,OAAO,IAAI;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,WAAW,UAAkC;AAC3C,QAAI,KAAK,WAAW;AAClB,YAAM,IAAI,MAAM,yDAAyD;AAAA,IAC3E;AAEA,UAAM,WAAW,KAAK;AACtB,UAAM,oBAAoB,KAAK,cAAc,IAAI,IAAI,KAAK,WAAW,IAAI;AACzE,aAAA;AAEA,QAAI,aAAa;AACjB,WAAO,MAAM;AACX,UAAI,cAAc,KAAK,UAAW;AAClC,mBAAa;AAEb,YAAM,OAAO,KAAK;AAClB,WAAK,SAAS;AACd,UAAI,mBAAmB;AACrB,aAAK,cAAc;AAAA,MACrB;AACA,WAAK,aAAA;AACL,WAAK,OAAO,IAAI;AAChB,WAAK,uBAAA;AAAA,IACP;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,IAAI,IAA4B;AAC9B,WAAO,KAAK,OAAO,IAAI,EAAE;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA,EAKA,IAAI,IAAsB;AACxB,WAAO,KAAK,OAAO,IAAI,EAAE;AAAA,EAC3B;AAAA;AAAA;AAAA;AAAA,EAKA,KAAK,WAAgD;AACnD,WAAO,KAAK,OAAO,KAAK,SAAS;AAAA,EACnC;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,WAAsC;AAC3C,WAAO,KAAK,OAAO,OAAO,SAAS;AAAA,EACrC;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO,WAAwC;AAC7C,WAAO,CAAC,GAAG,KAAK,MAAM,EAAE,KAAK,SAAS;AAAA,EACxC;AAAA;AAAA;AAAA;AAAA,EAKA,IAAO,IAAyB;AAC9B,WAAO,KAAK,OAAO,IAAI,EAAE;AAAA,EAC3B;AAAA;AAAA;AAAA,EAKA,UAAU,UAA6C;AACrD,QAAI,KAAK,WAAW;AAClB,aAAO,MAAM;AAAA,MAAC;AAAA,IAChB;AAEA,SAAK,WAAW,IAAI,QAAQ;AAE5B,WAAO,MAAM;AACX,WAAK,WAAW,OAAO,QAAQ;AAAA,IACjC;AAAA,EACF;AAAA;AAAA,EAGA,UAAgB;AACd,QAAI,KAAK,WAAW;AAClB;AAAA,IACF;AAEA,SAAK,YAAY;AACjB,SAAK,oBAAA;AACL,SAAK,kBAAkB,MAAA;AACvB,QAAI,KAAK,WAAW;AAClB,iBAAW,MAAM,KAAK,UAAW,IAAA;AACjC,WAAK,YAAY;AAAA,IACnB;AACA,SAAK,YAAA;AACL,SAAK,WAAW,MAAA;AAChB,SAAK,OAAO,MAAA;AACZ,SAAK,aAAa,MAAA;AAAA,EACpB;AAAA;AAAA,EAGU,WAAW,IAAsB;AACzC,QAAI,CAAC,KAAK,WAAW;AACnB,WAAK,YAAY,CAAA;AAAA,IACnB;AACA,SAAK,UAAU,KAAK,EAAE;AAAA,EACxB;AAAA,EAeQ,OAAO,MAA0B;AACvC,eAAW,YAAY,KAAK,YAAY;AACtC,eAAS,KAAK,QAAe,IAAW;AAAA,IAC1C;AAAA,EACF;AAAA,EAEQ,eAAqB;AAC3B,SAAK,OAAO,MAAA;AACZ,eAAW,QAAQ,KAAK,QAAQ;AAC9B,WAAK,OAAO,IAAI,KAAK,IAAI,IAAI;AAAA,IAC/B;AAAA,EACF;AAAA;AAAA,EAIQ,kBAAkB,OAAiB;AACzC,UAAM,SAAS,MAAM,SAAS,KAAK;AACnC,QAAI,UAAU,EAAG,QAAO;AAExB,UAAM,aAAa,MAAM,MAAM,GAAG,MAAM;AACxC,UAAM,UAAU,KAAK,cAAc,YAAY,UAAU;AAEzD,QAAI,YAAY,MAAO,QAAO;AAE9B,QAAI,QAAQ,WAAW,EAAG,QAAO;AAEjC,UAAM,WAAW,IAAI,IAAI,QAAQ,IAAI,CAAA,SAAQ,KAAK,EAAE,CAAC;AACrD,UAAM,SAAS,MAAM,OAAO,CAAA,SAAQ,CAAC,SAAS,IAAI,KAAK,EAAE,CAAC;AAG1D,eAAW,QAAQ,SAAS;AAC1B,WAAK,OAAO,OAAO,KAAK,EAAE;AAC1B,WAAK,aAAa,OAAO,KAAK,EAAE;AAAA,IAClC;AAEA,WAAO;AAAA,EACT;AAAA,EAEQ,cAAc,YAAiB,QAAyC;AAC9E,QAAI,CAAC,KAAK,QAAS,QAAO;AAE1B,UAAM,SAAS,KAAK,QAAQ,YAAY,MAAM;AAC9C,QAAI,WAAW,OAAO;AAEpB,UAAI,WAAW,WAAW,cAAc,KAAK,WAAW,GAAG;AACzD,cAAM,cAAc,KAAK,OAAO,SAAS,WAAW;AACpD,YAAI,cAAc,KAAK,WAAW,GAAG;AACnC,kBAAQ;AAAA,YACN,8CAA8C,WAAW,IAAI,KAAK,QAAQ;AAAA,UAAA;AAAA,QAG9E;AAAA,MACF;AACA,aAAO;AAAA,IACT;AACA,QAAI,MAAM,QAAQ,MAAM,GAAG;AAEzB,YAAM,eAAe,IAAI,IAAI,WAAW,IAAI,CAAA,MAAK,EAAE,EAAE,CAAC;AACtD,aAAO,OAAO,OAAO,CAAA,SAAQ,aAAa,IAAI,KAAK,EAAE,CAAC;AAAA,IACxD;AACA,WAAO;AAAA,EACT;AAAA,EAEQ,gBAAsB;AAC5B,QAAI,KAAK,aAAa,CAAC,KAAK,eAAe,KAAK,QAAQ,EAAG;AAE3D,UAAM,MAAM,KAAK,IAAA;AACjB,UAAM,MAAM,KAAK;AACjB,UAAM,UAAe,CAAA;AAErB,eAAW,QAAQ,KAAK,QAAQ;AAC9B,YAAM,KAAK,KAAK,YAAY,IAAI,KAAK,EAAE;AACvC,UAAI,OAAO,UAAc,MAAM,MAAO,KAAK;AACzC,gBAAQ,KAAK,IAAI;AAAA,MACnB;AAAA,IACF;AAEA,QAAI,QAAQ,WAAW,GAAG;AACxB,WAAK,uBAAA;AACL;AAAA,IACF;AAEA,UAAM,UAAU,KAAK,cAAc,SAAS,KAAK;AAEjD,QAAI,YAAY,OAAO;AACrB,WAAK,uBAAA;AACL;AAAA,IACF;AAEA,QAAI,QAAQ,WAAW,GAAG;AACxB,WAAK,uBAAA;AACL;AAAA,IACF;AAEA,UAAM,WAAW,IAAI,IAAI,QAAQ,IAAI,CAAA,SAAQ,KAAK,EAAE,CAAC;AACrD,UAAM,OAAO,KAAK;AAClB,SAAK,SAAS;AAAA,MACX,KAAa,OAAO,CAAC,SAAY,CAAC,SAAS,IAAI,KAAK,EAAE,CAAC;AAAA,IAAA;AAG1D,eAAW,QAAQ,SAAS;AAC1B,WAAK,OAAO,OAAO,KAAK,EAAE;AAC1B,WAAK,YAAY,OAAO,KAAK,EAAE;AAAA,IACjC;AAEA,SAAK,OAAO,IAAI;AAChB,SAAK,uBAAA;AAAA,EACP;AAAA,EAEQ,yBAA+B;AACrC,SAAK,oBAAA;AAEL,QAAI,KAAK,aAAa,CAAC,KAAK,eAAe,KAAK,QAAQ,KAAK,KAAK,YAAY,SAAS,EAAG;AAE1F,UAAM,MAAM,KAAK,IAAA;AACjB,UAAM,MAAM,KAAK;AACjB,QAAI,WAAW;AAEf,eAAW,MAAM,KAAK,YAAY,OAAA,GAAU;AAC1C,UAAI,KAAK,SAAU,YAAW;AAAA,IAChC;AAEA,UAAM,QAAQ,KAAK,IAAI,GAAI,WAAW,MAAO,GAAG;AAChD,SAAK,iBAAiB,WAAW,MAAM,KAAK,cAAA,GAAiB,KAAK;AAAA,EACpE;AAAA,EAEQ,sBAA4B;AAClC,QAAI,KAAK,mBAAmB,MAAM;AAChC,mBAAa,KAAK,cAAc;AAChC,WAAK,iBAAiB;AAAA,IACxB;AAAA,EACF;AACF;"}

package/dist/Feed.cjs

@@ -0,0 +1,86 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+class Feed {
+  _cursor = null;
+  _hasMore = true;
+  _items = Object.freeze([]);
+  _listeners = /* @__PURE__ */ new Set();
+  // ── Readable state ──
+  /** Current cursor position for the next page fetch, or null if at the beginning. */
+  get cursor() {
+    return this._cursor;
+  }
+  /** Whether more pages are available from the server. */
+  get hasMore() {
+    return this._hasMore;
+  }
+  /** Accumulated items across all loaded pages. */
+  get items() {
+    return this._items;
+  }
+  /** Total number of accumulated items. */
+  get count() {
+    return this._items.length;
+  }
+  // ── Actions ──
+  /** Update cursor/hasMore only (backward-compatible, does NOT affect items). */
+  setResult(result) {
+    this._hasMore = result.hasMore;
+    this._cursor = result.cursor ?? null;
+    this._notify();
+  }
+  /** Append page items and update cursor/hasMore. */
+  appendPage(page) {
+    this._items = Object.freeze([...this._items, ...page.items]);
+    this._hasMore = page.hasMore;
+    this._cursor = page.cursor ?? null;
+    this._notify();
+  }
+  /** Prepend page items and update cursor/hasMore. */
+  prependPage(page) {
+    this._items = Object.freeze([...page.items, ...this._items]);
+    this._hasMore = page.hasMore;
+    this._cursor = page.cursor ?? null;
+    this._notify();
+  }
+  /** Add items without affecting cursor/hasMore. */
+  push(...items) {
+    if (items.length === 0) return;
+    this._items = Object.freeze([...this._items, ...items]);
+    this._notify();
+  }
+  /** Remove items that don't match the predicate. No-op if nothing is filtered out. */
+  filter(predicate) {
+    const filtered = this._items.filter(predicate);
+    if (filtered.length === this._items.length) return;
+    this._items = Object.freeze(filtered);
+    this._notify();
+  }
+  /** Replace all items and update cursor/hasMore atomically. Ideal for pull-to-refresh. */
+  replacePage(page) {
+    this._items = Object.freeze([...page.items]);
+    this._hasMore = page.hasMore;
+    this._cursor = page.cursor ?? null;
+    this._notify();
+  }
+  /** Reset to initial empty state with hasMore=true. */
+  reset() {
+    this._cursor = null;
+    this._hasMore = true;
+    this._items = Object.freeze([]);
+    this._notify();
+  }
+  // ── Subscribable interface ──
+  /** Subscribe to feed state changes. Returns an unsubscribe function. */
+  subscribe(cb) {
+    this._listeners.add(cb);
+    return () => {
+      this._listeners.delete(cb);
+    };
+  }
+  _notify() {
+    for (const cb of this._listeners) cb();
+  }
+}
+exports.Feed = Feed;
+//# sourceMappingURL=Feed.cjs.map

package/dist/Feed.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"Feed.cjs","sources":["../src/Feed.ts"],"sourcesContent":["/** Represents a page of items from a paginated API response. */\nexport interface FeedPage<T> {\n  items: T[];\n  hasMore: boolean;\n  cursor?: string | null;\n}\n\n/**\n * Cursor-based pagination state for server-side paginated feeds.\n * Accumulates items across pages, tracks cursor position and hasMore flag.\n * Subscribable — auto-tracked when used as a ViewModel property.\n */\nexport class Feed<T = unknown> {\n  private _cursor: string | null = null;\n  private _hasMore: boolean = true;\n  private _items: readonly T[] = Object.freeze([] as T[]);\n  private _listeners = new Set<() => void>();\n\n  // ── Readable state ──\n\n  /** Current cursor position for the next page fetch, or null if at the beginning. */\n  get cursor(): string | null {\n    return this._cursor;\n  }\n\n  /** Whether more pages are available from the server. */\n  get hasMore(): boolean {\n    return this._hasMore;\n  }\n\n  /** Accumulated items across all loaded pages. */\n  get items(): readonly T[] {\n    return this._items;\n  }\n\n  /** Total number of accumulated items. */\n  get count(): number {\n    return this._items.length;\n  }\n\n  // ── Actions ──\n\n  /** Update cursor/hasMore only (backward-compatible, does NOT affect items). */\n  setResult(result: { hasMore: boolean; cursor?: string | null }): void {\n    this._hasMore = result.hasMore;\n    this._cursor = result.cursor ?? null;\n    this._notify();\n  }\n\n  /** Append page items and update cursor/hasMore. */\n  appendPage(page: FeedPage<T>): void {\n    this._items = Object.freeze([...this._items, ...page.items]);\n    this._hasMore = page.hasMore;\n    this._cursor = page.cursor ?? null;\n    this._notify();\n  }\n\n  /** Prepend page items and update cursor/hasMore. */\n  prependPage(page: FeedPage<T>): void {\n    this._items = Object.freeze([...page.items, ...this._items]);\n    this._hasMore = page.hasMore;\n    this._cursor = page.cursor ?? null;\n    this._notify();\n  }\n\n  /** Add items without affecting cursor/hasMore. */\n  push(...items: T[]): void {\n    if (items.length === 0) return;\n    this._items = Object.freeze([...this._items, ...items]);\n    this._notify();\n  }\n\n  /** Remove items that don't match the predicate. No-op if nothing is filtered out. */\n  filter(predicate: (item: T) => boolean): void {\n    const filtered = this._items.filter(predicate);\n    if (filtered.length === this._items.length) return;\n    this._items = Object.freeze(filtered);\n    this._notify();\n  }\n\n  /** Replace all items and update cursor/hasMore atomically. Ideal for pull-to-refresh. */\n  replacePage(page: FeedPage<T>): void {\n    this._items = Object.freeze([...page.items]);\n    this._hasMore = page.hasMore;\n    this._cursor = page.cursor ?? null;\n    this._notify();\n  }\n\n  /** Reset to initial empty state with hasMore=true. */\n  reset(): void {\n    this._cursor = null;\n    this._hasMore = true;\n    this._items = Object.freeze([] as T[]);\n    this._notify();\n  }\n\n  // ── Subscribable interface ──\n\n  /** Subscribe to feed state changes. Returns an unsubscribe function. */\n  subscribe(cb: () => void): () => void {\n    this._listeners.add(cb);\n    return () => { this._listeners.delete(cb); };\n  }\n\n  private _notify(): void {\n    for (const cb of this._listeners) cb();\n  }\n}\n"],"names":[],"mappings":";;AAYO,MAAM,KAAkB;AAAA,EACrB,UAAyB;AAAA,EACzB,WAAoB;AAAA,EACpB,SAAuB,OAAO,OAAO,EAAS;AAAA,EAC9C,iCAAiB,IAAA;AAAA;AAAA;AAAA,EAKzB,IAAI,SAAwB;AAC1B,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,UAAmB;AACrB,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,QAAsB;AACxB,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,QAAgB;AAClB,WAAO,KAAK,OAAO;AAAA,EACrB;AAAA;AAAA;AAAA,EAKA,UAAU,QAA4D;AACpE,SAAK,WAAW,OAAO;AACvB,SAAK,UAAU,OAAO,UAAU;AAChC,SAAK,QAAA;AAAA,EACP;AAAA;AAAA,EAGA,WAAW,MAAyB;AAClC,SAAK,SAAS,OAAO,OAAO,CAAC,GAAG,KAAK,QAAQ,GAAG,KAAK,KAAK,CAAC;AAC3D,SAAK,WAAW,KAAK;AACrB,SAAK,UAAU,KAAK,UAAU;AAC9B,SAAK,QAAA;AAAA,EACP;AAAA;AAAA,EAGA,YAAY,MAAyB;AACnC,SAAK,SAAS,OAAO,OAAO,CAAC,GAAG,KAAK,OAAO,GAAG,KAAK,MAAM,CAAC;AAC3D,SAAK,WAAW,KAAK;AACrB,SAAK,UAAU,KAAK,UAAU;AAC9B,SAAK,QAAA;AAAA,EACP;AAAA;AAAA,EAGA,QAAQ,OAAkB;AACxB,QAAI,MAAM,WAAW,EAAG;AACxB,SAAK,SAAS,OAAO,OAAO,CAAC,GAAG,KAAK,QAAQ,GAAG,KAAK,CAAC;AACtD,SAAK,QAAA;AAAA,EACP;AAAA;AAAA,EAGA,OAAO,WAAuC;AAC5C,UAAM,WAAW,KAAK,OAAO,OAAO,SAAS;AAC7C,QAAI,SAAS,WAAW,KAAK,OAAO,OAAQ;AAC5C,SAAK,SAAS,OAAO,OAAO,QAAQ;AACpC,SAAK,QAAA;AAAA,EACP;AAAA;AAAA,EAGA,YAAY,MAAyB;AACnC,SAAK,SAAS,OAAO,OAAO,CAAC,GAAG,KAAK,KAAK,CAAC;AAC3C,SAAK,WAAW,KAAK;AACrB,SAAK,UAAU,KAAK,UAAU;AAC9B,SAAK,QAAA;AAAA,EACP;AAAA;AAAA,EAGA,QAAc;AACZ,SAAK,UAAU;AACf,SAAK,WAAW;AAChB,SAAK,SAAS,OAAO,OAAO,CAAA,CAAS;AACrC,SAAK,QAAA;AAAA,EACP;AAAA;AAAA;AAAA,EAKA,UAAU,IAA4B;AACpC,SAAK,WAAW,IAAI,EAAE;AACtB,WAAO,MAAM;AAAE,WAAK,WAAW,OAAO,EAAE;AAAA,IAAG;AAAA,EAC7C;AAAA,EAEQ,UAAgB;AACtB,eAAW,MAAM,KAAK,WAAY,IAAA;AAAA,EACpC;AACF;;"}

package/dist/Feed.d.ts

@@ -0,0 +1,46 @@
+/** Represents a page of items from a paginated API response. */
+export interface FeedPage<T> {
+    items: T[];
+    hasMore: boolean;
+    cursor?: string | null;
+}
+/**
+ * Cursor-based pagination state for server-side paginated feeds.
+ * Accumulates items across pages, tracks cursor position and hasMore flag.
+ * Subscribable — auto-tracked when used as a ViewModel property.
+ */
+export declare class Feed<T = unknown> {
+    private _cursor;
+    private _hasMore;
+    private _items;
+    private _listeners;
+    /** Current cursor position for the next page fetch, or null if at the beginning. */
+    get cursor(): string | null;
+    /** Whether more pages are available from the server. */
+    get hasMore(): boolean;
+    /** Accumulated items across all loaded pages. */
+    get items(): readonly T[];
+    /** Total number of accumulated items. */
+    get count(): number;
+    /** Update cursor/hasMore only (backward-compatible, does NOT affect items). */
+    setResult(result: {
+        hasMore: boolean;
+        cursor?: string | null;
+    }): void;
+    /** Append page items and update cursor/hasMore. */
+    appendPage(page: FeedPage<T>): void;
+    /** Prepend page items and update cursor/hasMore. */
+    prependPage(page: FeedPage<T>): void;
+    /** Add items without affecting cursor/hasMore. */
+    push(...items: T[]): void;
+    /** Remove items that don't match the predicate. No-op if nothing is filtered out. */
+    filter(predicate: (item: T) => boolean): void;
+    /** Replace all items and update cursor/hasMore atomically. Ideal for pull-to-refresh. */
+    replacePage(page: FeedPage<T>): void;
+    /** Reset to initial empty state with hasMore=true. */
+    reset(): void;
+    /** Subscribe to feed state changes. Returns an unsubscribe function. */
+    subscribe(cb: () => void): () => void;
+    private _notify;
+}
+//# sourceMappingURL=Feed.d.ts.map

package/dist/Feed.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Feed.d.ts","sourceRoot":"","sources":["../src/Feed.ts"],"names":[],"mappings":"AAAA,gEAAgE;AAChE,MAAM,WAAW,QAAQ,CAAC,CAAC;IACzB,KAAK,EAAE,CAAC,EAAE,CAAC;IACX,OAAO,EAAE,OAAO,CAAC;IACjB,MAAM,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CACxB;AAED;;;;GAIG;AACH,qBAAa,IAAI,CAAC,CAAC,GAAG,OAAO;IAC3B,OAAO,CAAC,OAAO,CAAuB;IACtC,OAAO,CAAC,QAAQ,CAAiB;IACjC,OAAO,CAAC,MAAM,CAA0C;IACxD,OAAO,CAAC,UAAU,CAAyB;IAI3C,oFAAoF;IACpF,IAAI,MAAM,IAAI,MAAM,GAAG,IAAI,CAE1B;IAED,wDAAwD;IACxD,IAAI,OAAO,IAAI,OAAO,CAErB;IAED,iDAAiD;IACjD,IAAI,KAAK,IAAI,SAAS,CAAC,EAAE,CAExB;IAED,yCAAyC;IACzC,IAAI,KAAK,IAAI,MAAM,CAElB;IAID,+EAA+E;IAC/E,SAAS,CAAC,MAAM,EAAE;QAAE,OAAO,EAAE,OAAO,CAAC;QAAC,MAAM,CAAC,EAAE,MAAM,GAAG,IAAI,CAAA;KAAE,GAAG,IAAI;IAMrE,mDAAmD;IACnD,UAAU,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI;IAOnC,oDAAoD;IACpD,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI;IAOpC,kDAAkD;IAClD,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,GAAG,IAAI;IAMzB,qFAAqF;IACrF,MAAM,CAAC,SAAS,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,GAAG,IAAI;IAO7C,yFAAyF;IACzF,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI;IAOpC,sDAAsD;IACtD,KAAK,IAAI,IAAI;IASb,wEAAwE;IACxE,SAAS,CAAC,EAAE,EAAE,MAAM,IAAI,GAAG,MAAM,IAAI;IAKrC,OAAO,CAAC,OAAO;CAGhB"}

package/dist/Feed.js

@@ -0,0 +1,86 @@
+class Feed {
+  _cursor = null;
+  _hasMore = true;
+  _items = Object.freeze([]);
+  _listeners = /* @__PURE__ */ new Set();
+  // ── Readable state ──
+  /** Current cursor position for the next page fetch, or null if at the beginning. */
+  get cursor() {
+    return this._cursor;
+  }
+  /** Whether more pages are available from the server. */
+  get hasMore() {
+    return this._hasMore;
+  }
+  /** Accumulated items across all loaded pages. */
+  get items() {
+    return this._items;
+  }
+  /** Total number of accumulated items. */
+  get count() {
+    return this._items.length;
+  }
+  // ── Actions ──
+  /** Update cursor/hasMore only (backward-compatible, does NOT affect items). */
+  setResult(result) {
+    this._hasMore = result.hasMore;
+    this._cursor = result.cursor ?? null;
+    this._notify();
+  }
+  /** Append page items and update cursor/hasMore. */
+  appendPage(page) {
+    this._items = Object.freeze([...this._items, ...page.items]);
+    this._hasMore = page.hasMore;
+    this._cursor = page.cursor ?? null;
+    this._notify();
+  }
+  /** Prepend page items and update cursor/hasMore. */
+  prependPage(page) {
+    this._items = Object.freeze([...page.items, ...this._items]);
+    this._hasMore = page.hasMore;
+    this._cursor = page.cursor ?? null;
+    this._notify();
+  }
+  /** Add items without affecting cursor/hasMore. */
+  push(...items) {
+    if (items.length === 0) return;
+    this._items = Object.freeze([...this._items, ...items]);
+    this._notify();
+  }
+  /** Remove items that don't match the predicate. No-op if nothing is filtered out. */
+  filter(predicate) {
+    const filtered = this._items.filter(predicate);
+    if (filtered.length === this._items.length) return;
+    this._items = Object.freeze(filtered);
+    this._notify();
+  }
+  /** Replace all items and update cursor/hasMore atomically. Ideal for pull-to-refresh. */
+  replacePage(page) {
+    this._items = Object.freeze([...page.items]);
+    this._hasMore = page.hasMore;
+    this._cursor = page.cursor ?? null;
+    this._notify();
+  }
+  /** Reset to initial empty state with hasMore=true. */
+  reset() {
+    this._cursor = null;
+    this._hasMore = true;
+    this._items = Object.freeze([]);
+    this._notify();
+  }
+  // ── Subscribable interface ──
+  /** Subscribe to feed state changes. Returns an unsubscribe function. */
+  subscribe(cb) {
+    this._listeners.add(cb);
+    return () => {
+      this._listeners.delete(cb);
+    };
+  }
+  _notify() {
+    for (const cb of this._listeners) cb();
+  }
+}
+export {
+  Feed
+};
+//# sourceMappingURL=Feed.js.map

package/dist/Feed.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Feed.js","sources":["../src/Feed.ts"],"sourcesContent":["/** Represents a page of items from a paginated API response. */\nexport interface FeedPage<T> {\n  items: T[];\n  hasMore: boolean;\n  cursor?: string | null;\n}\n\n/**\n * Cursor-based pagination state for server-side paginated feeds.\n * Accumulates items across pages, tracks cursor position and hasMore flag.\n * Subscribable — auto-tracked when used as a ViewModel property.\n */\nexport class Feed<T = unknown> {\n  private _cursor: string | null = null;\n  private _hasMore: boolean = true;\n  private _items: readonly T[] = Object.freeze([] as T[]);\n  private _listeners = new Set<() => void>();\n\n  // ── Readable state ──\n\n  /** Current cursor position for the next page fetch, or null if at the beginning. */\n  get cursor(): string | null {\n    return this._cursor;\n  }\n\n  /** Whether more pages are available from the server. */\n  get hasMore(): boolean {\n    return this._hasMore;\n  }\n\n  /** Accumulated items across all loaded pages. */\n  get items(): readonly T[] {\n    return this._items;\n  }\n\n  /** Total number of accumulated items. */\n  get count(): number {\n    return this._items.length;\n  }\n\n  // ── Actions ──\n\n  /** Update cursor/hasMore only (backward-compatible, does NOT affect items). */\n  setResult(result: { hasMore: boolean; cursor?: string | null }): void {\n    this._hasMore = result.hasMore;\n    this._cursor = result.cursor ?? null;\n    this._notify();\n  }\n\n  /** Append page items and update cursor/hasMore. */\n  appendPage(page: FeedPage<T>): void {\n    this._items = Object.freeze([...this._items, ...page.items]);\n    this._hasMore = page.hasMore;\n    this._cursor = page.cursor ?? null;\n    this._notify();\n  }\n\n  /** Prepend page items and update cursor/hasMore. */\n  prependPage(page: FeedPage<T>): void {\n    this._items = Object.freeze([...page.items, ...this._items]);\n    this._hasMore = page.hasMore;\n    this._cursor = page.cursor ?? null;\n    this._notify();\n  }\n\n  /** Add items without affecting cursor/hasMore. */\n  push(...items: T[]): void {\n    if (items.length === 0) return;\n    this._items = Object.freeze([...this._items, ...items]);\n    this._notify();\n  }\n\n  /** Remove items that don't match the predicate. No-op if nothing is filtered out. */\n  filter(predicate: (item: T) => boolean): void {\n    const filtered = this._items.filter(predicate);\n    if (filtered.length === this._items.length) return;\n    this._items = Object.freeze(filtered);\n    this._notify();\n  }\n\n  /** Replace all items and update cursor/hasMore atomically. Ideal for pull-to-refresh. */\n  replacePage(page: FeedPage<T>): void {\n    this._items = Object.freeze([...page.items]);\n    this._hasMore = page.hasMore;\n    this._cursor = page.cursor ?? null;\n    this._notify();\n  }\n\n  /** Reset to initial empty state with hasMore=true. */\n  reset(): void {\n    this._cursor = null;\n    this._hasMore = true;\n    this._items = Object.freeze([] as T[]);\n    this._notify();\n  }\n\n  // ── Subscribable interface ──\n\n  /** Subscribe to feed state changes. Returns an unsubscribe function. */\n  subscribe(cb: () => void): () => void {\n    this._listeners.add(cb);\n    return () => { this._listeners.delete(cb); };\n  }\n\n  private _notify(): void {\n    for (const cb of this._listeners) cb();\n  }\n}\n"],"names":[],"mappings":"AAYO,MAAM,KAAkB;AAAA,EACrB,UAAyB;AAAA,EACzB,WAAoB;AAAA,EACpB,SAAuB,OAAO,OAAO,EAAS;AAAA,EAC9C,iCAAiB,IAAA;AAAA;AAAA;AAAA,EAKzB,IAAI,SAAwB;AAC1B,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,UAAmB;AACrB,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,QAAsB;AACxB,WAAO,KAAK;AAAA,EACd;AAAA;AAAA,EAGA,IAAI,QAAgB;AAClB,WAAO,KAAK,OAAO;AAAA,EACrB;AAAA;AAAA;AAAA,EAKA,UAAU,QAA4D;AACpE,SAAK,WAAW,OAAO;AACvB,SAAK,UAAU,OAAO,UAAU;AAChC,SAAK,QAAA;AAAA,EACP;AAAA;AAAA,EAGA,WAAW,MAAyB;AAClC,SAAK,SAAS,OAAO,OAAO,CAAC,GAAG,KAAK,QAAQ,GAAG,KAAK,KAAK,CAAC;AAC3D,SAAK,WAAW,KAAK;AACrB,SAAK,UAAU,KAAK,UAAU;AAC9B,SAAK,QAAA;AAAA,EACP;AAAA;AAAA,EAGA,YAAY,MAAyB;AACnC,SAAK,SAAS,OAAO,OAAO,CAAC,GAAG,KAAK,OAAO,GAAG,KAAK,MAAM,CAAC;AAC3D,SAAK,WAAW,KAAK;AACrB,SAAK,UAAU,KAAK,UAAU;AAC9B,SAAK,QAAA;AAAA,EACP;AAAA;AAAA,EAGA,QAAQ,OAAkB;AACxB,QAAI,MAAM,WAAW,EAAG;AACxB,SAAK,SAAS,OAAO,OAAO,CAAC,GAAG,KAAK,QAAQ,GAAG,KAAK,CAAC;AACtD,SAAK,QAAA;AAAA,EACP;AAAA;AAAA,EAGA,OAAO,WAAuC;AAC5C,UAAM,WAAW,KAAK,OAAO,OAAO,SAAS;AAC7C,QAAI,SAAS,WAAW,KAAK,OAAO,OAAQ;AAC5C,SAAK,SAAS,OAAO,OAAO,QAAQ;AACpC,SAAK,QAAA;AAAA,EACP;AAAA;AAAA,EAGA,YAAY,MAAyB;AACnC,SAAK,SAAS,OAAO,OAAO,CAAC,GAAG,KAAK,KAAK,CAAC;AAC3C,SAAK,WAAW,KAAK;AACrB,SAAK,UAAU,KAAK,UAAU;AAC9B,SAAK,QAAA;AAAA,EACP;AAAA;AAAA,EAGA,QAAc;AACZ,SAAK,UAAU;AACf,SAAK,WAAW;AAChB,SAAK,SAAS,OAAO,OAAO,CAAA,CAAS;AACrC,SAAK,QAAA;AAAA,EACP;AAAA;AAAA;AAAA,EAKA,UAAU,IAA4B;AACpC,SAAK,WAAW,IAAI,EAAE;AACtB,WAAO,MAAM;AAAE,WAAK,WAAW,OAAO,EAAE;AAAA,IAAG;AAAA,EAC7C;AAAA,EAEQ,UAAgB;AACtB,eAAW,MAAM,KAAK,WAAY,IAAA;AAAA,EACpC;AACF;"}