@angular/core/fesm2022/_effect-chunk.mjs.map

Angular - the core framework

{"version":3,"file":"_effect-chunk.mjs","sources":["../../../../../k8-fastbuild-ST-fdfa778d11ba/bin/packages/core/primitives/signals/src/graph.ts","../../../../../k8-fastbuild-ST-fdfa778d11ba/bin/packages/core/primitives/signals/src/equality.ts","../../../../../k8-fastbuild-ST-fdfa778d11ba/bin/packages/core/primitives/signals/src/computed.ts","../../../../../k8-fastbuild-ST-fdfa778d11ba/bin/packages/core/primitives/signals/src/errors.ts","../../../../../k8-fastbuild-ST-fdfa778d11ba/bin/packages/core/primitives/signals/src/signal.ts","../../../../../k8-fastbuild-ST-fdfa778d11ba/bin/packages/core/primitives/signals/src/effect.ts"],"sourcesContent":["/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.dev/license\n */\n\n// Required as the signals library is in a separate package, so we need to explicitly ensure the\n// global `ngDevMode` type is defined.\ndeclare const ngDevMode: boolean | undefined;\n\n/**\n * The currently active consumer `ReactiveNode`, if running code in a reactive context.\n *\n * Change this via `setActiveConsumer`.\n */\nlet activeConsumer: ReactiveNode | null = null;\nlet inNotificationPhase = false;\n\nexport type Version = number & {__brand: 'Version'};\n\n/**\n * Global epoch counter. Incremented whenever a source signal is set.\n */\nlet epoch: Version = 1 as Version;\n\nexport type ReactiveHookFn = (node: ReactiveNode) => void;\n\n/**\n * If set, called after a producer `ReactiveNode` is created.\n */\nlet postProducerCreatedFn: ReactiveHookFn | null = null;\n\n/**\n * Symbol used to tell `Signal`s apart from other functions.\n *\n * This can be used to auto-unwrap signals in various cases, or to auto-wrap non-signal values.\n */\nexport const SIGNAL: unique symbol = /* @__PURE__ */ Symbol('SIGNAL');\n\nexport function setActiveConsumer(consumer: ReactiveNode | null): ReactiveNode | null {\n  const prev = activeConsumer;\n  activeConsumer = consumer;\n  return prev;\n}\n\nexport function getActiveConsumer(): ReactiveNode | null {\n  return activeConsumer;\n}\n\nexport function isInNotificationPhase(): boolean {\n  return inNotificationPhase;\n}\n\nexport interface Reactive {\n  [SIGNAL]: ReactiveNode;\n}\n\nexport function isReactive(value: unknown): value is Reactive {\n  return (value as Partial<Reactive>)[SIGNAL] !== undefined;\n}\n\nexport const REACTIVE_NODE: ReactiveNode = {\n  version: 0 as Version,\n  lastCleanEpoch: 0 as Version,\n  dirty: false,\n  producers: undefined,\n  producersTail: undefined,\n  consumers: undefined,\n  consumersTail: undefined,\n  recomputing: false,\n  consumerAllowSignalWrites: false,\n  consumerIsAlwaysLive: false,\n  kind: 'unknown',\n  producerMustRecompute: () => false,\n  producerRecomputeValue: () => {},\n  consumerMarkedDirty: () => {},\n  consumerOnSignalRead: () => {},\n};\n\ninterface ReactiveLink {\n  producer: ReactiveNode;\n  consumer: ReactiveNode;\n\n  /**\n   * Stores the epoch that holds when this link was observed, allowing subsequent observations of the same producer to\n   * realize that there's an existing link, avoiding the creation of a new, redundant link. A value of `null` indicates\n   * that the link cannot be assumed to be valid based on the epoch counter.\n   */\n  knownValidAtEpoch: Version | null;\n  lastReadVersion: number;\n  prevConsumer: ReactiveLink | undefined;\n  nextConsumer: ReactiveLink | undefined;\n  nextProducer: ReactiveLink | undefined;\n}\n\nexport type ReactiveNodeKind =\n  | 'signal'\n  | 'computed'\n  | 'effect'\n  | 'template'\n  | 'linkedSignal'\n  | 'afterRenderEffectPhase'\n  | 'childSignalProp' // Represents a signal passed as a prop to a child component in a CoW app\n  | 'unknown';\n\n/**\n * A producer and/or consumer which participates in the reactive graph.\n *\n * Producer `ReactiveNode`s which are accessed when a consumer `ReactiveNode` is the\n * `activeConsumer` are tracked as dependencies of that consumer.\n *\n * Certain consumers are also tracked as \"live\" consumers and create edges in the other direction,\n * from producer to consumer. These edges are used to propagate change notifications when a\n * producer's value is updated.\n *\n * A `ReactiveNode` may be both a producer and consumer.\n */\nexport interface ReactiveNode {\n  /**\n   * Version of the value that this node produces.\n   *\n   * This is incremented whenever a new value is produced by this node which is not equal to the\n   * previous value (by whatever definition of equality is in use).\n   */\n  version: Version;\n\n  /**\n   * Epoch at which this node is verified to be clean.\n   *\n   * This allows skipping of some polling operations in the case where no signals have been set\n   * since this node was last read.\n   */\n  lastCleanEpoch: Version;\n\n  /**\n   * Whether this node (in its consumer capacity) is dirty.\n   *\n   * Only live consumers become dirty, when receiving a change notification from a dependency\n   * producer.\n   */\n  dirty: boolean;\n\n  /**\n   * Whether this node is currently rebuilding its producer list.\n   */\n  recomputing: boolean;\n\n  /**\n   * Producers which are dependencies of this consumer.\n   */\n  producers: ReactiveLink | undefined;\n\n  /**\n   * Points to the last linked list node in the `producers` linked list.\n   *\n   * When this node is recomputing, this is used to track the producers that we have accessed so far.\n   */\n  producersTail: ReactiveLink | undefined;\n\n  /**\n   * Linked list of consumers of this producer that are \"live\" (they require push notifications).\n   *\n   * The length of this list is effectively our reference count for this node.\n   */\n  consumers: ReactiveLink | undefined;\n  consumersTail: ReactiveLink | undefined;\n\n  /**\n   * Whether writes to signals are allowed when this consumer is the `activeConsumer`.\n   *\n   * This is used to enforce guardrails such as preventing writes to writable signals in the\n   * computation function of computed signals, which is supposed to be pure.\n   */\n  consumerAllowSignalWrites: boolean;\n\n  readonly consumerIsAlwaysLive: boolean;\n\n  /**\n   * Tracks whether producers need to recompute their value independently of the reactive graph (for\n   * example, if no initial value has been computed).\n   */\n  producerMustRecompute(node: unknown): boolean;\n  producerRecomputeValue(node: unknown): void;\n  consumerMarkedDirty(node: unknown): void;\n\n  /**\n   * Called when a signal is read within this consumer.\n   */\n  consumerOnSignalRead(node: unknown): void;\n\n  /**\n   * A debug name for the reactive node. Used in Angular DevTools to identify the node.\n   */\n  debugName?: string;\n\n  /**\n   * Kind of node. Example: 'signal', 'computed', 'input', 'effect'.\n   *\n   * ReactiveNode has this as 'unknown' by default, but derived node types should override this to\n   * make available the kind of signal that particular instance of a ReactiveNode represents.\n   *\n   * Used in Angular DevTools to identify the kind of signal.\n   */\n  kind: ReactiveNodeKind;\n}\n\n/**\n * Called by implementations when a producer's signal is read.\n */\nexport function producerAccessed(node: ReactiveNode): void {\n  if (inNotificationPhase) {\n    throw new Error(\n      typeof ngDevMode !== 'undefined' && ngDevMode\n        ? `Assertion error: signal read during notification phase`\n        : '',\n    );\n  }\n\n  if (activeConsumer === null) {\n    // Accessed outside of a reactive context, so nothing to record.\n    return;\n  }\n\n  activeConsumer.consumerOnSignalRead(node);\n\n  const prevProducerLink = activeConsumer.producersTail;\n\n  // If the last producer we accessed is the same as the current one, we can skip adding a new\n  // link\n  if (prevProducerLink !== undefined && prevProducerLink.producer === node) {\n    return;\n  }\n\n  let nextProducerLink: ReactiveLink | undefined = undefined;\n  const isRecomputing = activeConsumer.recomputing;\n  if (isRecomputing) {\n    // If we're incrementally rebuilding the producers list, we want to check if the next producer\n    // in the list is the same as the one we're trying to add.\n\n    // If the previous producer is defined, then the next producer is just the one that follows it.\n    // Otherwise, we should check the head of the producers list (the first node that we accessed the last time this consumer was run).\n    nextProducerLink =\n      prevProducerLink !== undefined ? prevProducerLink.nextProducer : activeConsumer.producers;\n    if (nextProducerLink !== undefined && nextProducerLink.producer === node) {\n      // If the next producer is the same as the one we're trying to add, we can just update the\n      // last read version, update the tail of the producers list of this rerun, and return.\n      activeConsumer.producersTail = nextProducerLink;\n      nextProducerLink.lastReadVersion = node.version;\n      nextProducerLink.knownValidAtEpoch = epoch;\n      return;\n    }\n  }\n\n  const prevConsumerLink = node.consumersTail;\n\n  // If the producer we're accessing already has a link to this consumer, we can skip adding a new\n  // link. This can short circuit the creation of a new link in the case where the consumer reads alternating ReactiveNodes\n  if (\n    prevConsumerLink !== undefined &&\n    prevConsumerLink.consumer === activeConsumer &&\n    (!isRecomputing || prevConsumerLink.knownValidAtEpoch === epoch)\n  ) {\n    return;\n  }\n\n  // If we got here, it means that we need to create a new link between the producer and the consumer.\n  const isLive = consumerIsLive(activeConsumer);\n  const newLink: ReactiveLink = {\n    producer: node,\n    consumer: activeConsumer,\n    // instead of eagerly destroying the previous link, we delay until we've finished recomputing\n    // the producers list, so that we can destroy all of the old links at once.\n    nextProducer: nextProducerLink,\n    // Don't set prevConsumer here — it's only meaningful when the link is part of\n    // the producer's consumer list. producerAddLiveConsumer sets it correctly when\n    // the link is actually inserted. Setting it eagerly would create a dangling\n    // reference into the consumer list that prevents GC of removed entries.\n    prevConsumer: undefined,\n    knownValidAtEpoch: epoch,\n    lastReadVersion: node.version,\n    nextConsumer: undefined,\n  };\n  activeConsumer.producersTail = newLink;\n  if (prevProducerLink !== undefined) {\n    prevProducerLink.nextProducer = newLink;\n  } else {\n    activeConsumer.producers = newLink;\n  }\n\n  if (isLive) {\n    producerAddLiveConsumer(node, newLink);\n  }\n}\n\n/**\n * Increment the global epoch counter.\n *\n * Called by source producers (that is, not computeds) whenever their values change.\n */\nexport function producerIncrementEpoch(): void {\n  epoch++;\n}\n\n/**\n * Ensure this producer's `version` is up-to-date.\n */\nexport function producerUpdateValueVersion(node: ReactiveNode): void {\n  if (consumerIsLive(node) && !node.dirty) {\n    // A live consumer will be marked dirty by producers, so a clean state means that its version\n    // is guaranteed to be up-to-date.\n    return;\n  }\n\n  if (!node.dirty && node.lastCleanEpoch === epoch) {\n    // Even non-live consumers can skip polling if they previously found themselves to be clean at\n    // the current epoch, since their dependencies could not possibly have changed (such a change\n    // would've increased the epoch).\n    return;\n  }\n\n  if (!node.producerMustRecompute(node) && !consumerPollProducersForChange(node)) {\n    // None of our producers report a change since the last time they were read, so no\n    // recomputation of our value is necessary, and we can consider ourselves clean.\n    producerMarkClean(node);\n    return;\n  }\n\n  node.producerRecomputeValue(node);\n\n  // After recomputing the value, we're no longer dirty.\n  producerMarkClean(node);\n}\n\n/**\n * Propagate a dirty notification to live consumers of this producer.\n */\nexport function producerNotifyConsumers(node: ReactiveNode): void {\n  if (node.consumers === undefined) {\n    return;\n  }\n\n  // Prevent signal reads when we're updating the graph\n  const prev = inNotificationPhase;\n  inNotificationPhase = true;\n  try {\n    for (\n      let link: ReactiveLink | undefined = node.consumers;\n      link !== undefined;\n      link = link.nextConsumer\n    ) {\n      const consumer = link.consumer;\n      if (!consumer.dirty) {\n        consumerMarkDirty(consumer);\n      }\n    }\n  } finally {\n    inNotificationPhase = prev;\n  }\n}\n\n/**\n * Whether this `ReactiveNode` in its producer capacity is currently allowed to initiate updates,\n * based on the current consumer context.\n */\nexport function producerUpdatesAllowed(): boolean {\n  return activeConsumer?.consumerAllowSignalWrites !== false;\n}\n\nexport function consumerMarkDirty(node: ReactiveNode): void {\n  node.dirty = true;\n  producerNotifyConsumers(node);\n  node.consumerMarkedDirty?.(node);\n}\n\nexport function producerMarkClean(node: ReactiveNode): void {\n  node.dirty = false;\n  node.lastCleanEpoch = epoch;\n}\n\n/**\n * Prepare this consumer to run a computation in its reactive context and set\n * it as the active consumer.\n *\n * Must be called by subclasses which represent reactive computations, before those computations\n * begin.\n */\nexport function consumerBeforeComputation(node: ReactiveNode | null): ReactiveNode | null {\n  if (node) resetConsumerBeforeComputation(node);\n\n  return setActiveConsumer(node);\n}\n\n/**\n * Prepare this consumer to run a computation in its reactive context.\n *\n * We expose this mainly for code where we manually batch effects into a single\n * consumer. In those cases we may wish to \"reopen\" a consumer multiple times\n * in initial render before finalizing it. Most code should just call\n * `consumerBeforeComputation` instead of calling this directly.\n */\nexport function resetConsumerBeforeComputation(node: ReactiveNode): void {\n  // Clear link validity state before running a computation, such that links that were captured in a prior computation\n  // (which may have happened in the same epoch) are not mistakenly considered valid. This is only necessary if any of\n  // the links has `knownValidAtEpoch` equal to the current epoch, for which the producer that was accessed last is used\n  // as proxy: any earlier producers cannot exceed its epoch.\n  if (node.producersTail?.knownValidAtEpoch === epoch) {\n    let producer = node.producers;\n    while (producer !== undefined) {\n      producer.knownValidAtEpoch = null;\n      producer = producer.nextProducer;\n    }\n  }\n\n  node.producersTail = undefined;\n  node.recomputing = true;\n}\n\n/**\n * Finalize this consumer's state and set previous consumer as the active consumer after a\n * reactive computation has run.\n *\n * Must be called by subclasses which represent reactive computations, after those computations\n * have finished.\n */\nexport function consumerAfterComputation(\n  node: ReactiveNode | null,\n  prevConsumer: ReactiveNode | null,\n): void {\n  setActiveConsumer(prevConsumer);\n\n  if (node) finalizeConsumerAfterComputation(node);\n}\n\n/**\n * Finalize this consumer's state after a reactive computation has run.\n *\n * We expose this mainly for code where we manually batch effects into a single\n * consumer. In those cases we may wish to \"reopen\" a consumer multiple times\n * in initial render before finalizing it. Most code should just call\n * `consumerAfterComputation` instead of calling this directly.\n */\nexport function finalizeConsumerAfterComputation(node: ReactiveNode): void {\n  node.recomputing = false;\n\n  // We've finished incrementally rebuilding the producers list, now if there are any producers\n  // that are after producersTail, they are stale and should be removed.\n  const producersTail = node.producersTail as ReactiveLink | undefined;\n  let toRemove = producersTail !== undefined ? producersTail.nextProducer : node.producers;\n  if (toRemove !== undefined) {\n    if (consumerIsLive(node)) {\n      // For each stale link, we first unlink it from the producers list of consumers\n      do {\n        toRemove = producerRemoveLiveConsumerLink(toRemove);\n      } while (toRemove !== undefined);\n    }\n\n    // Now, we can truncate the producers list to remove all stale links.\n    if (producersTail !== undefined) {\n      producersTail.nextProducer = undefined;\n    } else {\n      node.producers = undefined;\n    }\n  }\n}\n\n/**\n * Determine whether this consumer has any dependencies which have changed since the last time\n * they were read.\n */\nexport function consumerPollProducersForChange(node: ReactiveNode): boolean {\n  // Poll producers for change.\n  for (let link = node.producers; link !== undefined; link = link.nextProducer) {\n    const producer = link.producer;\n    const seenVersion = link.lastReadVersion;\n\n    // First check the versions. A mismatch means that the producer's value is known to have\n    // changed since the last time we read it.\n    if (seenVersion !== producer.version) {\n      return true;\n    }\n\n    // The producer's version is the same as the last time we read it, but it might itself be\n    // stale. Force the producer to recompute its version (calculating a new value if necessary).\n    producerUpdateValueVersion(producer);\n\n    // Now when we do this check, `producer.version` is guaranteed to be up to date, so if the\n    // versions still match then it has not changed since the last time we read it.\n    if (seenVersion !== producer.version) {\n      return true;\n    }\n  }\n\n  return false;\n}\n\n/**\n * Disconnect this consumer from the graph.\n */\nexport function consumerDestroy(node: ReactiveNode): void {\n  if (consumerIsLive(node)) {\n    // Drop all connections from the graph to this node.\n    let link = node.producers;\n    while (link !== undefined) {\n      link = producerRemoveLiveConsumerLink(link);\n    }\n  }\n\n  // Truncate all the linked lists to drop all connection from this node to the graph.\n  node.producers = undefined;\n  node.producersTail = undefined;\n  node.consumers = undefined;\n  node.consumersTail = undefined;\n}\n\n/**\n * Add `consumer` as a live consumer of this node.\n *\n * Note that this operation is potentially transitive. If this node becomes live, then it becomes\n * a live consumer of all of its current producers.\n */\nfunction producerAddLiveConsumer(node: ReactiveNode, link: ReactiveLink): void {\n  const consumersTail = node.consumersTail;\n  const wasLive = consumerIsLive(node);\n  if (consumersTail !== undefined) {\n    link.nextConsumer = consumersTail.nextConsumer;\n    consumersTail.nextConsumer = link;\n  } else {\n    link.nextConsumer = undefined;\n    node.consumers = link;\n  }\n  link.prevConsumer = consumersTail;\n  node.consumersTail = link;\n  if (!wasLive) {\n    for (\n      let link: ReactiveLink | undefined = node.producers;\n      link !== undefined;\n      link = link.nextProducer\n    ) {\n      producerAddLiveConsumer(link.producer, link);\n    }\n  }\n}\n\nfunction producerRemoveLiveConsumerLink(link: ReactiveLink): ReactiveLink | undefined {\n  const producer = link.producer;\n  const nextProducer = link.nextProducer;\n  const nextConsumer = link.nextConsumer;\n  const prevConsumer = link.prevConsumer;\n  link.nextConsumer = undefined;\n  link.prevConsumer = undefined;\n  if (nextConsumer !== undefined) {\n    nextConsumer.prevConsumer = prevConsumer;\n  } else {\n    producer.consumersTail = prevConsumer;\n  }\n  if (prevConsumer !== undefined) {\n    prevConsumer.nextConsumer = nextConsumer;\n  } else {\n    producer.consumers = nextConsumer;\n    if (!consumerIsLive(producer)) {\n      let producerLink = producer.producers;\n      while (producerLink !== undefined) {\n        producerLink = producerRemoveLiveConsumerLink(producerLink);\n      }\n    }\n  }\n  return nextProducer;\n}\n\nfunction consumerIsLive(node: ReactiveNode): boolean {\n  return node.consumerIsAlwaysLive || node.consumers !== undefined;\n}\n\nexport function runPostProducerCreatedFn(node: ReactiveNode): void {\n  postProducerCreatedFn?.(node);\n}\n\nexport function setPostProducerCreatedFn(fn: ReactiveHookFn | null): ReactiveHookFn | null {\n  const prev = postProducerCreatedFn;\n  postProducerCreatedFn = fn;\n  return prev;\n}\n","/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.dev/license\n */\n\n/**\n * A comparison function which can determine if two values are equal.\n */\nexport type ValueEqualityFn<T> = (a: T, b: T) => boolean;\n\n/**\n * The default equality function used for `signal` and `computed`, which uses referential equality.\n */\nexport function defaultEquals<T>(a: T, b: T) {\n  return Object.is(a, b);\n}\n","/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.dev/license\n */\n\nimport {defaultEquals, ValueEqualityFn} from './equality';\nimport {\n  consumerAfterComputation,\n  consumerBeforeComputation,\n  producerAccessed,\n  producerUpdateValueVersion,\n  REACTIVE_NODE,\n  ReactiveNode,\n  runPostProducerCreatedFn,\n  setActiveConsumer,\n  SIGNAL,\n} from './graph';\n\n// Required as the signals library is in a separate package, so we need to explicitly ensure the\n// global `ngDevMode` type is defined.\ndeclare const ngDevMode: boolean | undefined;\n\n/**\n * A computation, which derives a value from a declarative reactive expression.\n *\n * `Computed`s are both producers and consumers of reactivity.\n */\nexport interface ComputedNode<T> extends ReactiveNode {\n  /**\n   * Current value of the computation, or one of the sentinel values above (`UNSET`, `COMPUTING`,\n   * `ERROR`).\n   */\n  value: T;\n\n  /**\n   * If `value` is `ERRORED`, the error caught from the last computation attempt which will\n   * be re-thrown.\n   */\n  error: unknown;\n\n  /**\n   * The computation function which will produce a new value.\n   */\n  computation: () => T;\n\n  equal: ValueEqualityFn<T>;\n}\n\nexport type ComputedGetter<T> = (() => T) & {\n  [SIGNAL]: ComputedNode<T>;\n};\n\n/**\n * Create a computed signal which derives a reactive value from an expression.\n */\nexport function createComputed<T>(\n  computation: () => T,\n  equal?: ValueEqualityFn<T>,\n): ComputedGetter<T> {\n  const node: ComputedNode<T> = Object.create(COMPUTED_NODE);\n  node.computation = computation;\n\n  if (equal !== undefined) {\n    node.equal = equal;\n  }\n\n  const computed = () => {\n    // Check if the value needs updating before returning it.\n    producerUpdateValueVersion(node);\n\n    // Record that someone looked at this signal.\n    producerAccessed(node);\n\n    if (node.value === ERRORED) {\n      throw node.error;\n    }\n\n    return node.value;\n  };\n\n  (computed as ComputedGetter<T>)[SIGNAL] = node;\n  if (typeof ngDevMode !== 'undefined' && ngDevMode) {\n    computed.toString = () =>\n      `[Computed${node.debugName ? ' (' + node.debugName + ')' : ''}: ${String(node.value)}]`;\n  }\n\n  runPostProducerCreatedFn(node);\n\n  return computed as unknown as ComputedGetter<T>;\n}\n\n/**\n * A dedicated symbol used before a computed value has been calculated for the first time.\n * Explicitly typed as `any` so we can use it as signal's value.\n */\nexport const UNSET: any = /* @__PURE__ */ Symbol('UNSET');\n\n/**\n * A dedicated symbol used in place of a computed signal value to indicate that a given computation\n * is in progress. Used to detect cycles in computation chains.\n * Explicitly typed as `any` so we can use it as signal's value.\n */\nexport const COMPUTING: any = /* @__PURE__ */ Symbol('COMPUTING');\n\n/**\n * A dedicated symbol used in place of a computed signal value to indicate that a given computation\n * failed. The thrown error is cached until the computation gets dirty again.\n * Explicitly typed as `any` so we can use it as signal's value.\n */\nexport const ERRORED: any = /* @__PURE__ */ Symbol('ERRORED');\n\n// Note: Using an IIFE here to ensure that the spread assignment is not considered\n// a side-effect, ending up preserving `COMPUTED_NODE` and `REACTIVE_NODE`.\nconst COMPUTED_NODE: Omit<ComputedNode<unknown>, 'computation'> = /* @__PURE__ */ (() => {\n  return {\n    ...REACTIVE_NODE,\n    value: UNSET,\n    dirty: true,\n    error: null,\n    equal: defaultEquals,\n    kind: 'computed',\n\n    producerMustRecompute(node: ComputedNode<unknown>): boolean {\n      // Force a recomputation if there's no current value, or if the current value is in the\n      // process of being calculated (which should throw an error).\n      return node.value === UNSET || node.value === COMPUTING;\n    },\n\n    producerRecomputeValue(node: ComputedNode<unknown>): void {\n      if (node.value === COMPUTING) {\n        // Our computation somehow led to a cyclic read of itself.\n        throw new Error(\n          typeof ngDevMode !== 'undefined' && ngDevMode ? 'Detected cycle in computations.' : '',\n        );\n      }\n\n      const oldValue = node.value;\n      node.value = COMPUTING;\n\n      const prevConsumer = consumerBeforeComputation(node);\n      let newValue: unknown;\n      let wasEqual = false;\n      try {\n        newValue = node.computation();\n        // We want to mark this node as errored if calling `equal` throws; however, we don't want\n        // to track any reactive reads inside `equal`.\n        setActiveConsumer(null);\n        wasEqual =\n          oldValue !== UNSET &&\n          oldValue !== ERRORED &&\n          newValue !== ERRORED &&\n          node.equal(oldValue, newValue);\n      } catch (err) {\n        newValue = ERRORED;\n        node.error = err;\n      } finally {\n        consumerAfterComputation(node, prevConsumer);\n      }\n\n      if (wasEqual) {\n        // No change to `valueVersion` - old and new values are\n        // semantically equivalent.\n        node.value = oldValue;\n        return;\n      }\n\n      node.value = newValue;\n      node.version++;\n    },\n  };\n})();\n","/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.dev/license\n */\n\nimport type {SignalNode} from './signal';\n\nfunction defaultThrowError(): never {\n  throw new Error();\n}\n\nlet throwInvalidWriteToSignalErrorFn: <T>(node: SignalNode<T>) => never = defaultThrowError;\n\nexport function throwInvalidWriteToSignalError<T>(node: SignalNode<T>) {\n  throwInvalidWriteToSignalErrorFn(node);\n}\n\nexport function setThrowInvalidWriteToSignalError(fn: <T>(node: SignalNode<T>) => never): void {\n  throwInvalidWriteToSignalErrorFn = fn;\n}\n","/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.dev/license\n */\n\nimport {defaultEquals, ValueEqualityFn} from './equality';\nimport {throwInvalidWriteToSignalError} from './errors';\nimport {\n  producerAccessed,\n  producerIncrementEpoch,\n  producerNotifyConsumers,\n  producerUpdatesAllowed,\n  REACTIVE_NODE,\n  ReactiveNode,\n  ReactiveHookFn,\n  runPostProducerCreatedFn,\n  SIGNAL,\n} from './graph';\n\n// Required as the signals library is in a separate package, so we need to explicitly ensure the\n// global `ngDevMode` type is defined.\ndeclare const ngDevMode: boolean | undefined;\n\n/**\n * If set, called after `WritableSignal`s are updated.\n *\n * This hook can be used to achieve various effects, such as running effects synchronously as part\n * of setting a signal.\n */\nlet postSignalSetFn: ReactiveHookFn | null = null;\n\nexport interface SignalNode<T> extends ReactiveNode {\n  value: T;\n  equal: ValueEqualityFn<T>;\n}\n\nexport type SignalBaseGetter<T> = (() => T) & {readonly [SIGNAL]: unknown};\nexport type SignalSetter<T> = (newValue: T) => void;\nexport type SignalUpdater<T> = (updateFn: (value: T) => T) => void;\n\n// Note: Closure *requires* this to be an `interface` and not a type, which is why the\n// `SignalBaseGetter` type exists to provide the correct shape.\nexport interface SignalGetter<T> extends SignalBaseGetter<T> {\n  readonly [SIGNAL]: SignalNode<T>;\n}\n\n/**\n * Creates a `Signal` getter, setter, and updater function.\n */\nexport function createSignal<T>(\n  initialValue: T,\n  equal?: ValueEqualityFn<T>,\n): [SignalGetter<T>, SignalSetter<T>, SignalUpdater<T>] {\n  const node: SignalNode<T> = Object.create(SIGNAL_NODE);\n  node.value = initialValue;\n  if (equal !== undefined) {\n    node.equal = equal;\n  }\n  const getter = (() => signalGetFn(node)) as SignalGetter<T>;\n  (getter as any)[SIGNAL] = node;\n  if (typeof ngDevMode !== 'undefined' && ngDevMode) {\n    getter.toString = () =>\n      `[Signal${node.debugName ? ' (' + node.debugName + ')' : ''}: ${String(node.value)}]`;\n  }\n\n  runPostProducerCreatedFn(node);\n  const set = (newValue: T) => signalSetFn(node, newValue);\n  const update = (updateFn: (value: T) => T) => signalUpdateFn(node, updateFn);\n  return [getter, set, update];\n}\n\nexport function setPostSignalSetFn(fn: ReactiveHookFn | null): ReactiveHookFn | null {\n  const prev = postSignalSetFn;\n  postSignalSetFn = fn;\n  return prev;\n}\n\nexport function signalGetFn<T>(node: SignalNode<T>): T {\n  producerAccessed(node);\n  return node.value;\n}\n\nexport function signalSetFn<T>(node: SignalNode<T>, newValue: T) {\n  if (!producerUpdatesAllowed()) {\n    throwInvalidWriteToSignalError(node);\n  }\n\n  if (!node.equal(node.value, newValue)) {\n    node.value = newValue;\n    signalValueChanged(node);\n  }\n}\n\nexport function signalUpdateFn<T>(node: SignalNode<T>, updater: (value: T) => T): void {\n  if (!producerUpdatesAllowed()) {\n    throwInvalidWriteToSignalError(node);\n  }\n\n  signalSetFn(node, updater(node.value));\n}\n\nexport function runPostSignalSetFn<T>(node: SignalNode<T>): void {\n  postSignalSetFn?.(node);\n}\n\n// Note: Using an IIFE here to ensure that the spread assignment is not considered\n// a side-effect, ending up preserving `COMPUTED_NODE` and `REACTIVE_NODE`.\nexport const SIGNAL_NODE: SignalNode<unknown> = /* @__PURE__ */ (() => {\n  return {\n    ...REACTIVE_NODE,\n    equal: defaultEquals,\n    value: undefined,\n    kind: 'signal',\n  };\n})();\n\nfunction signalValueChanged<T>(node: SignalNode<T>): void {\n  node.version++;\n  producerIncrementEpoch();\n  producerNotifyConsumers(node);\n  postSignalSetFn?.(node);\n}\n","/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.dev/license\n */\n\nimport {\n  consumerAfterComputation,\n  consumerBeforeComputation,\n  consumerPollProducersForChange,\n  REACTIVE_NODE,\n  ReactiveNode,\n} from './graph';\n\n/**\n * An effect can, optionally, register a cleanup function. If registered, the cleanup is executed\n * before the next effect run. The cleanup function makes it possible to \"cancel\" any work that the\n * previous effect run might have started.\n */\nexport type EffectCleanupFn = () => void;\n\n/**\n * A callback passed to the effect function that makes it possible to register cleanup logic.\n */\nexport type EffectCleanupRegisterFn = (cleanupFn: EffectCleanupFn) => void;\n\nexport interface BaseEffectNode extends ReactiveNode {\n  fn: () => void;\n  destroy(): void;\n  cleanup(): void;\n  run(): void;\n}\n\nexport const BASE_EFFECT_NODE: Omit<BaseEffectNode, 'fn' | 'destroy' | 'cleanup' | 'run'> =\n  /* @__PURE__ */ (() => ({\n    ...REACTIVE_NODE,\n    consumerIsAlwaysLive: true,\n    consumerAllowSignalWrites: true,\n    dirty: true,\n    kind: 'effect',\n  }))();\n\nexport function runEffect(node: BaseEffectNode) {\n  node.dirty = false;\n  if (node.version > 0 && !consumerPollProducersForChange(node)) {\n    return;\n  }\n  node.version++;\n  const prevNode = consumerBeforeComputation(node);\n  try {\n    node.cleanup();\n    node.fn();\n  } finally {\n    consumerAfterComputation(node, prevNode);\n  }\n}\n"],"names":[],"mappings":";;;;;;AAiBA,IAAI,cAAc,GAAwB,IAAI;AAC9C,IAAI,mBAAmB,GAAG,KAAK;AAO/B,IAAI,KAAK,GAAY,CAAY;AAOjC,IAAI,qBAAqB,GAA0B,IAAI;MAO1C,MAAM,kBAAkC,MAAM,CAAC,QAAQ;AAE9D,SAAU,iBAAiB,CAAC,QAA6B,EAAA;EAC7D,MAAM,IAAI,GAAG,cAAc;AAC3B,EAAA,cAAc,GAAG,QAAQ;AACzB,EAAA,OAAO,IAAI;AACb;SAEgB,iBAAiB,GAAA;AAC/B,EAAA,OAAO,cAAc;AACvB;SAEgB,qBAAqB,GAAA;AACnC,EAAA,OAAO,mBAAmB;AAC5B;AAMM,SAAU,UAAU,CAAC,KAAc,EAAA;AACvC,EAAA,OAAQ,KAA2B,CAAC,MAAM,CAAC,KAAK,SAAS;AAC3D;AAEO,MAAM,aAAa,GAAiB;AACzC,EAAA,OAAO,EAAE,CAAY;AACrB,EAAA,cAAc,EAAE,CAAY;AAC5B,EAAA,KAAK,EAAE,KAAK;AACZ,EAAA,SAAS,EAAE,SAAS;AACpB,EAAA,aAAa,EAAE,SAAS;AACxB,EAAA,SAAS,EAAE,SAAS;AACpB,EAAA,aAAa,EAAE,SAAS;AACxB,EAAA,WAAW,EAAE,KAAK;AAClB,EAAA,yBAAyB,EAAE,KAAK;AAChC,EAAA,oBAAoB,EAAE,KAAK;AAC3B,EAAA,IAAI,EAAE,SAAS;EACf,qBAAqB,EAAE,MAAM,KAAK;EAClC,sBAAsB,EAAE,MAAK,CAAE,CAAC;EAChC,mBAAmB,EAAE,MAAK,CAAE,CAAC;EAC7B,oBAAoB,EAAE,MAAK,CAAE;;AAqIzB,SAAU,gBAAgB,CAAC,IAAkB,EAAA;AACjD,EAAA,IAAI,mBAAmB,EAAE;AACvB,IAAA,MAAM,IAAI,KAAK,CACb,OAAO,SAAS,KAAK,WAAW,IAAI,SAAA,GAChC,CAAA,sDAAA,CAAA,GACA,EAAE,CACP;AACH,EAAA;EAEA,IAAI,cAAc,KAAK,IAAI,EAAE;AAE3B,IAAA;AACF,EAAA;AAEA,EAAA,cAAc,CAAC,oBAAoB,CAAC,IAAI,CAAC;AAEzC,EAAA,MAAM,gBAAgB,GAAG,cAAc,CAAC,aAAa;EAIrD,IAAI,gBAAgB,KAAK,SAAS,IAAI,gBAAgB,CAAC,QAAQ,KAAK,IAAI,EAAE;AACxE,IAAA;AACF,EAAA;EAEA,IAAI,gBAAgB,GAA6B,SAAS;AAC1D,EAAA,MAAM,aAAa,GAAG,cAAc,CAAC,WAAW;AAChD,EAAA,IAAI,aAAa,EAAE;IAMjB,gBAAgB,GACd,gBAAgB,KAAK,SAAS,GAAG,gBAAgB,CAAC,YAAY,GAAG,cAAc,CAAC,SAAS;IAC3F,IAAI,gBAAgB,KAAK,SAAS,IAAI,gBAAgB,CAAC,QAAQ,KAAK,IAAI,EAAE;MAGxE,cAAc,CAAC,aAAa,GAAG,gBAAgB;AAC/C,MAAA,gBAAgB,CAAC,eAAe,GAAG,IAAI,CAAC,OAAO;MAC/C,gBAAgB,CAAC,iBAAiB,GAAG,KAAK;AAC1C,MAAA;AACF,IAAA;AACF,EAAA;AAEA,EAAA,MAAM,gBAAgB,GAAG,IAAI,CAAC,aAAa;AAI3C,EAAA,IACE,gBAAgB,KAAK,SAAS,IAC9B,gBAAgB,CAAC,QAAQ,KAAK,cAAc,KAC3C,CAAC,aAAa,IAAI,gBAAgB,CAAC,iBAAiB,KAAK,KAAK,CAAC,EAChE;AACA,IAAA;AACF,EAAA;AAGA,EAAA,MAAM,MAAM,GAAG,cAAc,CAAC,cAAc,CAAC;AAC7C,EAAA,MAAM,OAAO,GAAiB;AAC5B,IAAA,QAAQ,EAAE,IAAI;AACd,IAAA,QAAQ,EAAE,cAAc;AAGxB,IAAA,YAAY,EAAE,gBAAgB;AAK9B,IAAA,YAAY,EAAE,SAAS;AACvB,IAAA,iBAAiB,EAAE,KAAK;IACxB,eAAe,EAAE,IAAI,CAAC,OAAO;AAC7B,IAAA,YAAY,EAAE;GACf;EACD,cAAc,CAAC,aAAa,GAAG,OAAO;EACtC,IAAI,gBAAgB,KAAK,SAAS,EAAE;IAClC,gBAAgB,CAAC,YAAY,GAAG,OAAO;AACzC,EAAA,CAAA,MAAO;IACL,cAAc,CAAC,SAAS,GAAG,OAAO;AACpC,EAAA;AAEA,EAAA,IAAI,MAAM,EAAE;AACV,IAAA,uBAAuB,CAAC,IAAI,EAAE,OAAO,CAAC;AACxC,EAAA;AACF;SAOgB,sBAAsB,GAAA;AACpC,EAAA,KAAK,EAAE;AACT;AAKM,SAAU,0BAA0B,CAAC,IAAkB,EAAA;EAC3D,IAAI,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE;AAGvC,IAAA;AACF,EAAA;EAEA,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,cAAc,KAAK,KAAK,EAAE;AAIhD,IAAA;AACF,EAAA;AAEA,EAAA,IAAI,CAAC,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,IAAI,CAAC,8BAA8B,CAAC,IAAI,CAAC,EAAE;IAG9E,iBAAiB,CAAC,IAAI,CAAC;AACvB,IAAA;AACF,EAAA;AAEA,EAAA,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC;EAGjC,iBAAiB,CAAC,IAAI,CAAC;AACzB;AAKM,SAAU,uBAAuB,CAAC,IAAkB,EAAA;AACxD,EAAA,IAAI,IAAI,CAAC,SAAS,KAAK,SAAS,EAAE;AAChC,IAAA;AACF,EAAA;EAGA,MAAM,IAAI,GAAG,mBAAmB;AAChC,EAAA,mBAAmB,GAAG,IAAI;EAC1B,IAAI;AACF,IAAA,KACE,IAAI,IAAI,GAA6B,IAAI,CAAC,SAAS,EACnD,IAAI,KAAK,SAAS,EAClB,IAAI,GAAG,IAAI,CAAC,YAAY,EACxB;AACA,MAAA,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ;AAC9B,MAAA,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE;QACnB,iBAAiB,CAAC,QAAQ,CAAC;AAC7B,MAAA;AACF,IAAA;AACF,EAAA,CAAA,SAAU;AACR,IAAA,mBAAmB,GAAG,IAAI;AAC5B,EAAA;AACF;SAMgB,sBAAsB,GAAA;AACpC,EAAA,OAAO,cAAc,EAAE,yBAAyB,KAAK,KAAK;AAC5D;AAEM,SAAU,iBAAiB,CAAC,IAAkB,EAAA;EAClD,IAAI,CAAC,KAAK,GAAG,IAAI;EACjB,uBAAuB,CAAC,IAAI,CAAC;AAC7B,EAAA,IAAI,CAAC,mBAAmB,GAAG,IAAI,CAAC;AAClC;AAEM,SAAU,iBAAiB,CAAC,IAAkB,EAAA;EAClD,IAAI,CAAC,KAAK,GAAG,KAAK;EAClB,IAAI,CAAC,cAAc,GAAG,KAAK;AAC7B;AASM,SAAU,yBAAyB,CAAC,IAAyB,EAAA;AACjE,EAAA,IAAI,IAAI,EAAE,8BAA8B,CAAC,IAAI,CAAC;EAE9C,OAAO,iBAAiB,CAAC,IAAI,CAAC;AAChC;AAUM,SAAU,8BAA8B,CAAC,IAAkB,EAAA;AAK/D,EAAA,IAAI,IAAI,CAAC,aAAa,EAAE,iBAAiB,KAAK,KAAK,EAAE;AACnD,IAAA,IAAI,QAAQ,GAAG,IAAI,CAAC,SAAS;IAC7B,OAAO,QAAQ,KAAK,SAAS,EAAE;MAC7B,QAAQ,CAAC,iBAAiB,GAAG,IAAI;MACjC,QAAQ,GAAG,QAAQ,CAAC,YAAY;AAClC,IAAA;AACF,EAAA;EAEA,IAAI,CAAC,aAAa,GAAG,SAAS;EAC9B,IAAI,CAAC,WAAW,GAAG,IAAI;AACzB;AASM,SAAU,wBAAwB,CACtC,IAAyB,EACzB,YAAiC,EAAA;EAEjC,iBAAiB,CAAC,YAAY,CAAC;AAE/B,EAAA,IAAI,IAAI,EAAE,gCAAgC,CAAC,IAAI,CAAC;AAClD;AAUM,SAAU,gCAAgC,CAAC,IAAkB,EAAA;EACjE,IAAI,CAAC,WAAW,GAAG,KAAK;AAIxB,EAAA,MAAM,aAAa,GAAG,IAAI,CAAC,aAAyC;AACpE,EAAA,IAAI,QAAQ,GAAG,aAAa,KAAK,SAAS,GAAG,aAAa,CAAC,YAAY,GAAG,IAAI,CAAC,SAAS;EACxF,IAAI,QAAQ,KAAK,SAAS,EAAE;AAC1B,IAAA,IAAI,cAAc,CAAC,IAAI,CAAC,EAAE;MAExB,GAAG;AACD,QAAA,QAAQ,GAAG,8BAA8B,CAAC,QAAQ,CAAC;MACrD,CAAC,QAAQ,QAAQ,KAAK,SAAS;AACjC,IAAA;IAGA,IAAI,aAAa,KAAK,SAAS,EAAE;MAC/B,aAAa,CAAC,YAAY,GAAG,SAAS;AACxC,IAAA,CAAA,MAAO;MACL,IAAI,CAAC,SAAS,GAAG,SAAS;AAC5B,IAAA;AACF,EAAA;AACF;AAMM,SAAU,8BAA8B,CAAC,IAAkB,EAAA;AAE/D,EAAA,KAAK,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,EAAE,IAAI,KAAK,SAAS,EAAE,IAAI,GAAG,IAAI,CAAC,YAAY,EAAE;AAC5E,IAAA,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ;AAC9B,IAAA,MAAM,WAAW,GAAG,IAAI,CAAC,eAAe;AAIxC,IAAA,IAAI,WAAW,KAAK,QAAQ,CAAC,OAAO,EAAE;AACpC,MAAA,OAAO,IAAI;AACb,IAAA;IAIA,0BAA0B,CAAC,QAAQ,CAAC;AAIpC,IAAA,IAAI,WAAW,KAAK,QAAQ,CAAC,OAAO,EAAE;AACpC,MAAA,OAAO,IAAI;AACb,IAAA;AACF,EAAA;AAEA,EAAA,OAAO,KAAK;AACd;AAKM,SAAU,eAAe,CAAC,IAAkB,EAAA;AAChD,EAAA,IAAI,cAAc,CAAC,IAAI,CAAC,EAAE;AAExB,IAAA,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS;IACzB,OAAO,IAAI,KAAK,SAAS,EAAE;AACzB,MAAA,IAAI,GAAG,8BAA8B,CAAC,IAAI,CAAC;AAC7C,IAAA;AACF,EAAA;EAGA,IAAI,CAAC,SAAS,GAAG,SAAS;EAC1B,IAAI,CAAC,aAAa,GAAG,SAAS;EAC9B,IAAI,CAAC,SAAS,GAAG,SAAS;EAC1B,IAAI,CAAC,aAAa,GAAG,SAAS;AAChC;AAQA,SAAS,uBAAuB,CAAC,IAAkB,EAAE,IAAkB,EAAA;AACrE,EAAA,MAAM,aAAa,GAAG,IAAI,CAAC,aAAa;AACxC,EAAA,MAAM,OAAO,GAAG,cAAc,CAAC,IAAI,CAAC;EACpC,IAAI,aAAa,KAAK,SAAS,EAAE;AAC/B,IAAA,IAAI,CAAC,YAAY,GAAG,aAAa,CAAC,YAAY;IAC9C,aAAa,CAAC,YAAY,GAAG,IAAI;AACnC,EAAA,CAAA,MAAO;IACL,IAAI,CAAC,YAAY,GAAG,SAAS;IAC7B,IAAI,CAAC,SAAS,GAAG,IAAI;AACvB,EAAA;EACA,IAAI,CAAC,YAAY,GAAG,aAAa;EACjC,IAAI,CAAC,aAAa,GAAG,IAAI;EACzB,IAAI,CAAC,OAAO,EAAE;AACZ,IAAA,KACE,IAAI,IAAI,GAA6B,IAAI,CAAC,SAAS,EACnD,IAAI,KAAK,SAAS,EAClB,IAAI,GAAG,IAAI,CAAC,YAAY,EACxB;AACA,MAAA,uBAAuB,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC;AAC9C,IAAA;AACF,EAAA;AACF;AAEA,SAAS,8BAA8B,CAAC,IAAkB,EAAA;AACxD,EAAA,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ;AAC9B,EAAA,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY;AACtC,EAAA,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY;AACtC,EAAA,MAAM,YAAY,GAAG,IAAI,CAAC,YAAY;EACtC,IAAI,CAAC,YAAY,GAAG,SAAS;EAC7B,IAAI,CAAC,YAAY,GAAG,SAAS;EAC7B,IAAI,YAAY,KAAK,SAAS,EAAE;IAC9B,YAAY,CAAC,YAAY,GAAG,YAAY;AAC1C,EAAA,CAAA,MAAO;IACL,QAAQ,CAAC,aAAa,GAAG,YAAY;AACvC,EAAA;EACA,IAAI,YAAY,KAAK,SAAS,EAAE;IAC9B,YAAY,CAAC,YAAY,GAAG,YAAY;AAC1C,EAAA,CAAA,MAAO;IACL,QAAQ,CAAC,SAAS,GAAG,YAAY;AACjC,IAAA,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,EAAE;AAC7B,MAAA,IAAI,YAAY,GAAG,QAAQ,CAAC,SAAS;MACrC,OAAO,YAAY,KAAK,SAAS,EAAE;AACjC,QAAA,YAAY,GAAG,8BAA8B,CAAC,YAAY,CAAC;AAC7D,MAAA;AACF,IAAA;AACF,EAAA;AACA,EAAA,OAAO,YAAY;AACrB;AAEA,SAAS,cAAc,CAAC,IAAkB,EAAA;EACxC,OAAO,IAAI,CAAC,oBAAoB,IAAI,IAAI,CAAC,SAAS,KAAK,SAAS;AAClE;AAEM,SAAU,wBAAwB,CAAC,IAAkB,EAAA;EACzD,qBAAqB,GAAG,IAAI,CAAC;AAC/B;AAEM,SAAU,wBAAwB,CAAC,EAAyB,EAAA;EAChE,MAAM,IAAI,GAAG,qBAAqB;AAClC,EAAA,qBAAqB,GAAG,EAAE;AAC1B,EAAA,OAAO,IAAI;AACb;;ACvjBM,SAAU,aAAa,CAAI,CAAI,EAAE,CAAI,EAAA;AACzC,EAAA,OAAO,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;AACxB;;ACwCM,SAAU,cAAc,CAC5B,WAAoB,EACpB,KAA0B,EAAA;AAE1B,EAAA,MAAM,IAAI,GAAoB,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC;EAC1D,IAAI,CAAC,WAAW,GAAG,WAAW;EAE9B,IAAI,KAAK,KAAK,SAAS,EAAE;IACvB,IAAI,CAAC,KAAK,GAAG,KAAK;AACpB,EAAA;EAEA,MAAM,QAAQ,GAAG,MAAK;IAEpB,0BAA0B,CAAC,IAAI,CAAC;IAGhC,gBAAgB,CAAC,IAAI,CAAC;AAEtB,IAAA,IAAI,IAAI,CAAC,KAAK,KAAK,OAAO,EAAE;MAC1B,MAAM,IAAI,CAAC,KAAK;AAClB,IAAA;IAEA,OAAO,IAAI,CAAC,KAAK;EACnB,CAAC;AAEA,EAAA,QAA8B,CAAC,MAAM,CAAC,GAAG,IAAI;AAC9C,EAAA,IAAI,OAAO,SAAS,KAAK,WAAW,IAAI,SAAS,EAAE;IACjD,QAAQ,CAAC,QAAQ,GAAG,MAClB,CAAA,SAAA,EAAY,IAAI,CAAC,SAAS,GAAG,IAAI,GAAG,IAAI,CAAC,SAAS,GAAG,GAAG,GAAG,EAAE,CAAA,EAAA,EAAK,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA,CAAA,CAAG;AAC3F,EAAA;EAEA,wBAAwB,CAAC,IAAI,CAAC;AAE9B,EAAA,OAAO,QAAwC;AACjD;MAMa,KAAK,kBAAwB,MAAM,CAAC,OAAO;MAO3C,SAAS,kBAAwB,MAAM,CAAC,WAAW;MAOnD,OAAO,kBAAwB,MAAM,CAAC,SAAS;AAI5D,MAAM,aAAa,kBAA+D,CAAC,MAAK;EACtF,OAAO;AACL,IAAA,GAAG,aAAa;AAChB,IAAA,KAAK,EAAE,KAAK;AACZ,IAAA,KAAK,EAAE,IAAI;AACX,IAAA,KAAK,EAAE,IAAI;AACX,IAAA,KAAK,EAAE,aAAa;AACpB,IAAA,IAAI,EAAE,UAAU;IAEhB,qBAAqB,CAAC,IAA2B,EAAA;MAG/C,OAAO,IAAI,CAAC,KAAK,KAAK,KAAK,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS;IACzD,CAAC;IAED,sBAAsB,CAAC,IAA2B,EAAA;AAChD,MAAA,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,EAAE;AAE5B,QAAA,MAAM,IAAI,KAAK,CACb,OAAO,SAAS,KAAK,WAAW,IAAI,SAAS,GAAG,iCAAiC,GAAG,EAAE,CACvF;AACH,MAAA;AAEA,MAAA,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK;MAC3B,IAAI,CAAC,KAAK,GAAG,SAAS;AAEtB,MAAA,MAAM,YAAY,GAAG,yBAAyB,CAAC,IAAI,CAAC;AACpD,MAAA,IAAI,QAAiB;MACrB,IAAI,QAAQ,GAAG,KAAK;MACpB,IAAI;AACF,QAAA,QAAQ,GAAG,IAAI,CAAC,WAAW,EAAE;QAG7B,iBAAiB,CAAC,IAAI,CAAC;QACvB,QAAQ,GACN,QAAQ,KAAK,KAAK,IAClB,QAAQ,KAAK,OAAO,IACpB,QAAQ,KAAK,OAAO,IACpB,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,QAAQ,CAAC;MAClC,CAAA,CAAE,OAAO,GAAG,EAAE;AACZ,QAAA,QAAQ,GAAG,OAAO;QAClB,IAAI,CAAC,KAAK,GAAG,GAAG;AAClB,MAAA,CAAA,SAAU;AACR,QAAA,wBAAwB,CAAC,IAAI,EAAE,YAAY,CAAC;AAC9C,MAAA;AAEA,MAAA,IAAI,QAAQ,EAAE;QAGZ,IAAI,CAAC,KAAK,GAAG,QAAQ;AACrB,QAAA;AACF,MAAA;MAEA,IAAI,CAAC,KAAK,GAAG,QAAQ;MACrB,IAAI,CAAC,OAAO,EAAE;AAChB,IAAA;GACD;AACH,CAAC,GAAG;;ACnKJ,SAAS,iBAAiB,GAAA;EACxB,MAAM,IAAI,KAAK,EAAE;AACnB;AAEA,IAAI,gCAAgC,GAAsC,iBAAiB;AAErF,SAAU,8BAA8B,CAAI,IAAmB,EAAA;EACnE,gCAAgC,CAAC,IAAI,CAAC;AACxC;AAEM,SAAU,iCAAiC,CAAC,EAAqC,EAAA;AACrF,EAAA,gCAAgC,GAAG,EAAE;AACvC;;ACUA,IAAI,eAAe,GAA0B,IAAI;AAoB3C,SAAU,YAAY,CAC1B,YAAe,EACf,KAA0B,EAAA;AAE1B,EAAA,MAAM,IAAI,GAAkB,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC;EACtD,IAAI,CAAC,KAAK,GAAG,YAAY;EACzB,IAAI,KAAK,KAAK,SAAS,EAAE;IACvB,IAAI,CAAC,KAAK,GAAG,KAAK;AACpB,EAAA;AACA,EAAA,MAAM,MAAM,GAAI,MAAM,WAAW,CAAC,IAAI,CAAqB;AAC1D,EAAA,MAAc,CAAC,MAAM,CAAC,GAAG,IAAI;AAC9B,EAAA,IAAI,OAAO,SAAS,KAAK,WAAW,IAAI,SAAS,EAAE;IACjD,MAAM,CAAC,QAAQ,GAAG,MAChB,CAAA,OAAA,EAAU,IAAI,CAAC,SAAS,GAAG,IAAI,GAAG,IAAI,CAAC,SAAS,GAAG,GAAG,GAAG,EAAE,CAAA,EAAA,EAAK,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA,CAAA,CAAG;AACzF,EAAA;EAEA,wBAAwB,CAAC,IAAI,CAAC;EAC9B,MAAM,GAAG,GAAI,QAAW,IAAK,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC;EACxD,MAAM,MAAM,GAAI,QAAyB,IAAK,cAAc,CAAC,IAAI,EAAE,QAAQ,CAAC;AAC5E,EAAA,OAAO,CAAC,MAAM,EAAE,GAAG,EAAE,MAAM,CAAC;AAC9B;AAEM,SAAU,kBAAkB,CAAC,EAAyB,EAAA;EAC1D,MAAM,IAAI,GAAG,eAAe;AAC5B,EAAA,eAAe,GAAG,EAAE;AACpB,EAAA,OAAO,IAAI;AACb;AAEM,SAAU,WAAW,CAAI,IAAmB,EAAA;EAChD,gBAAgB,CAAC,IAAI,CAAC;EACtB,OAAO,IAAI,CAAC,KAAK;AACnB;AAEM,SAAU,WAAW,CAAI,IAAmB,EAAE,QAAW,EAAA;AAC7D,EAAA,IAAI,CAAC,sBAAsB,EAAE,EAAE;IAC7B,8BAA8B,CAAC,IAAI,CAAC;AACtC,EAAA;EAEA,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,EAAE;IACrC,IAAI,CAAC,KAAK,GAAG,QAAQ;IACrB,kBAAkB,CAAC,IAAI,CAAC;AAC1B,EAAA;AACF;AAEM,SAAU,cAAc,CAAI,IAAmB,EAAE,OAAwB,EAAA;AAC7E,EAAA,IAAI,CAAC,sBAAsB,EAAE,EAAE;IAC7B,8BAA8B,CAAC,IAAI,CAAC;AACtC,EAAA;EAEA,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AACxC;AAEM,SAAU,kBAAkB,CAAI,IAAmB,EAAA;EACvD,eAAe,GAAG,IAAI,CAAC;AACzB;AAIO,MAAM,WAAW,kBAAwC,CAAC,MAAK;EACpE,OAAO;AACL,IAAA,GAAG,aAAa;AAChB,IAAA,KAAK,EAAE,aAAa;AACpB,IAAA,KAAK,EAAE,SAAS;AAChB,IAAA,IAAI,EAAE;GACP;AACH,CAAC;AAED,SAAS,kBAAkB,CAAI,IAAmB,EAAA;EAChD,IAAI,CAAC,OAAO,EAAE;AACd,EAAA,sBAAsB,EAAE;EACxB,uBAAuB,CAAC,IAAI,CAAC;EAC7B,eAAe,GAAG,IAAI,CAAC;AACzB;;ACzFO,MAAM,gBAAgB,kBACX,CAAC,OAAO;AACtB,EAAA,GAAG,aAAa;AAChB,EAAA,oBAAoB,EAAE,IAAI;AAC1B,EAAA,yBAAyB,EAAE,IAAI;AAC/B,EAAA,KAAK,EAAE,IAAI;AACX,EAAA,IAAI,EAAE;CACP,CAAC;AAEE,SAAU,SAAS,CAAC,IAAoB,EAAA;EAC5C,IAAI,CAAC,KAAK,GAAG,KAAK;EAClB,IAAI,IAAI,CAAC,OAAO,GAAG,CAAC,IAAI,CAAC,8BAA8B,CAAC,IAAI,CAAC,EAAE;AAC7D,IAAA;AACF,EAAA;EACA,IAAI,CAAC,OAAO,EAAE;AACd,EAAA,MAAM,QAAQ,GAAG,yBAAyB,CAAC,IAAI,CAAC;EAChD,IAAI;IACF,IAAI,CAAC,OAAO,EAAE;IACd,IAAI,CAAC,EAAE,EAAE;AACX,EAAA,CAAA,SAAU;AACR,IAAA,wBAAwB,CAAC,IAAI,EAAE,QAAQ,CAAC;AAC1C,EAAA;AACF;;;;"}