effect 4.0.0-beta.69 → 4.0.0-beta.70

package/dist/TxQueue.d.ts

@@ -21,6 +21,8 @@ import type * as Types from "./Types.ts";
 /**
  * Represents the state of a transactional queue with sophisticated lifecycle management.
  *
+ * **Details**
+ *
  * The queue progresses through three states:
  * - **Open**: Accepting offers and serving takes normally
  * - **Closing**: No new offers accepted, serving remaining items until empty
@@ -288,8 +290,9 @@ export declare const isTxQueue: <A = unknown, E = unknown>(u: unknown) => u is T
 /**
  * Creates a new bounded `TxQueue` with the specified capacity.
  *
- * **Return behavior**: This function returns a new TxQueue reference with
- * the specified capacity. No existing TxQueue instances are modified.
+ * **Details**
+ *
+ * This function returns a new TxQueue reference with the specified capacity. No existing TxQueue instances are modified.
  *
  * **Example** (Creating bounded queues)
  *
@@ -319,8 +322,9 @@ export declare const bounded: <A = never, E = never>(capacity: number) => Effect
 /**
  * Creates a new unbounded `TxQueue` with unlimited capacity.
  *
- * **Return behavior**: This function returns a new TxQueue reference with
- * unlimited capacity. No existing TxQueue instances are modified.
+ * **Details**
+ *
+ * This function returns a new TxQueue reference with unlimited capacity. No existing TxQueue instances are modified.
  *
  * **Example** (Creating unbounded queues)
  *
@@ -350,8 +354,9 @@ export declare const unbounded: <A = never, E = never>() => Effect.Effect<TxQueu
 /**
  * Creates a new dropping `TxQueue` with the specified capacity that drops new items when full.
  *
- * **Return behavior**: This function returns a new TxQueue reference with
- * dropping strategy. No existing TxQueue instances are modified.
+ * **Details**
+ *
+ * This function returns a new TxQueue reference with dropping strategy. No existing TxQueue instances are modified.
  *
  * **Example** (Creating dropping queues)
  *
@@ -379,8 +384,9 @@ export declare const dropping: <A = never, E = never>(capacity: number) => Effec
 /**
  * Creates a new sliding `TxQueue` with the specified capacity that evicts old items when full.
  *
- * **Return behavior**: This function returns a new TxQueue reference with
- * sliding strategy. No existing TxQueue instances are modified.
+ * **Details**
+ *
+ * This function returns a new TxQueue reference with sliding strategy. No existing TxQueue instances are modified.
  *
  * **Example** (Creating sliding queues)
  *
@@ -410,12 +416,9 @@ export declare const sliding: <A = never, E = never>(capacity: number) => Effect
 /**
  * Offers an item to the queue and returns whether it was accepted.
  *
- * Open unbounded queues always accept; open bounded queues retry while full;
- * dropping queues return `false` when full; sliding queues evict the oldest item
- * when full. Closing or done queues return `false`.
+ * **Details**
  *
- * **Mutation behavior**: This function mutates the original TxQueue by adding
- * the item according to the queue's strategy. It does not return a new TxQueue reference.
+ * Open unbounded queues always accept; open bounded queues retry while full; dropping queues return `false` when full; sliding queues evict the oldest item when full. Closing or done queues return `false`. This function mutates the original TxQueue by adding the item according to the queue's strategy. It does not return a new TxQueue reference.
  *
  * **Example** (Offering a value)
  *
@@ -438,12 +441,9 @@ export declare const offer: {
     /**
      * Offers an item to the queue and returns whether it was accepted.
      *
-     * Open unbounded queues always accept; open bounded queues retry while full;
-     * dropping queues return `false` when full; sliding queues evict the oldest item
-     * when full. Closing or done queues return `false`.
+     * **Details**
      *
-     * **Mutation behavior**: This function mutates the original TxQueue by adding
-     * the item according to the queue's strategy. It does not return a new TxQueue reference.
+     * Open unbounded queues always accept; open bounded queues retry while full; dropping queues return `false` when full; sliding queues evict the oldest item when full. Closing or done queues return `false`. This function mutates the original TxQueue by adding the item according to the queue's strategy. It does not return a new TxQueue reference.
      *
      * **Example** (Offering a value)
      *
@@ -466,12 +466,9 @@ export declare const offer: {
     /**
      * Offers an item to the queue and returns whether it was accepted.
      *
-     * Open unbounded queues always accept; open bounded queues retry while full;
-     * dropping queues return `false` when full; sliding queues evict the oldest item
-     * when full. Closing or done queues return `false`.
+     * **Details**
      *
-     * **Mutation behavior**: This function mutates the original TxQueue by adding
-     * the item according to the queue's strategy. It does not return a new TxQueue reference.
+     * Open unbounded queues always accept; open bounded queues retry while full; dropping queues return `false` when full; sliding queues evict the oldest item when full. Closing or done queues return `false`. This function mutates the original TxQueue by adding the item according to the queue's strategy. It does not return a new TxQueue reference.
      *
      * **Example** (Offering a value)
      *
@@ -496,12 +493,9 @@ export declare const offer: {
  * Offers multiple items to the queue, returning the items that were not
  * accepted.
  *
- * Each item follows `offer` semantics: bounded queues retry while full,
- * dropping queues reject new items when full, sliding queues evict old items to
- * accept new items, and closing or done queues reject all items.
+ * **Details**
  *
- * **Mutation behavior**: This function mutates the original TxQueue by adding
- * items according to the queue's strategy. It does not return a new TxQueue reference.
+ * Each item follows `offer` semantics: bounded queues retry while full, dropping queues reject new items when full, sliding queues evict old items to accept new items, and closing or done queues reject all items. This function mutates the original TxQueue by adding items according to the queue's strategy. It does not return a new TxQueue reference.
  *
  * **Example** (Offering multiple values)
  *
@@ -526,12 +520,9 @@ export declare const offerAll: {
      * Offers multiple items to the queue, returning the items that were not
      * accepted.
      *
-     * Each item follows `offer` semantics: bounded queues retry while full,
-     * dropping queues reject new items when full, sliding queues evict old items to
-     * accept new items, and closing or done queues reject all items.
+     * **Details**
      *
-     * **Mutation behavior**: This function mutates the original TxQueue by adding
-     * items according to the queue's strategy. It does not return a new TxQueue reference.
+     * Each item follows `offer` semantics: bounded queues retry while full, dropping queues reject new items when full, sliding queues evict old items to accept new items, and closing or done queues reject all items. This function mutates the original TxQueue by adding items according to the queue's strategy. It does not return a new TxQueue reference.
      *
      * **Example** (Offering multiple values)
      *
@@ -556,12 +547,9 @@ export declare const offerAll: {
      * Offers multiple items to the queue, returning the items that were not
      * accepted.
      *
-     * Each item follows `offer` semantics: bounded queues retry while full,
-     * dropping queues reject new items when full, sliding queues evict old items to
-     * accept new items, and closing or done queues reject all items.
+     * **Details**
      *
-     * **Mutation behavior**: This function mutates the original TxQueue by adding
-     * items according to the queue's strategy. It does not return a new TxQueue reference.
+     * Each item follows `offer` semantics: bounded queues retry while full, dropping queues reject new items when full, sliding queues evict old items to accept new items, and closing or done queues reject all items. This function mutates the original TxQueue by adding items according to the queue's strategy. It does not return a new TxQueue reference.
      *
      * **Example** (Offering multiple values)
      *
@@ -587,10 +575,9 @@ export declare const offerAll: {
  * Takes the next item from the queue, retrying the transaction while the queue
  * is empty.
  *
- * If the queue is done, the effect fails with the queue's completion cause.
+ * **Details**
  *
- * **Mutation behavior**: This function mutates the original TxQueue by removing
- * the first item. It does not return a new TxQueue reference.
+ * If the queue is done, the effect fails with the queue's completion cause. This function mutates the original TxQueue by removing the first item. It does not return a new TxQueue reference.
  *
  * **Example** (Taking a value)
  *
@@ -644,13 +631,9 @@ export declare const poll: <A, E>(self: TxDequeue<A, E>) => Effect.Effect<Option
 /**
  * Takes all items from the queue. Blocks if the queue is empty.
  *
- * If the queue is already in a failed state, the error is propagated through the E-channel.
- * Follows the same patterns as `take` - waits when there are no elements.
+ * **Details**
  *
- * Returns a non-empty array since it blocks until at least one item is available.
- *
- * **Mutation behavior**: This function mutates the original TxQueue by removing
- * all items. It does not return a new TxQueue reference.
+ * If the queue is already in a failed state, the error is propagated through the E-channel. This follows the same patterns as `take` and waits when there are no elements. It returns a non-empty array because it blocks until at least one item is available. This function mutates the original TxQueue by removing all items. It does not return a new TxQueue reference.
  *
  * **Example** (Taking all queued values)
  *
@@ -686,14 +669,9 @@ export declare const takeAll: <A, E>(self: TxDequeue<A, E>) => Effect.Effect<Arr
 /**
  * Takes up to `n` items from the queue in a single transaction.
  *
- * For an open queue, waits until `min(n, capacity)` items are available, then
- * removes that many items. If `n` is less than or equal to zero, returns an
- * empty array without modifying the queue. If the queue is closing, drains the
- * currently available items and transitions to `Done`. If the queue is already
- * done, the effect fails with the queue's completion cause.
+ * **Details**
  *
- * **Mutation behavior**: This function mutates the original TxQueue by removing
- * the taken items. It does not return a new TxQueue reference.
+ * For an open queue, waits until `min(n, capacity)` items are available, then removes that many items. If `n` is less than or equal to zero, returns an empty array without modifying the queue. If the queue is closing, drains the currently available items and transitions to `Done`. If the queue is already done, the effect fails with the queue's completion cause. This function mutates the original TxQueue by removing the taken items. It does not return a new TxQueue reference.
  *
  * **Example** (Taking a fixed number of values)
  *
@@ -721,14 +699,9 @@ export declare const takeN: {
     /**
      * Takes up to `n` items from the queue in a single transaction.
      *
-     * For an open queue, waits until `min(n, capacity)` items are available, then
-     * removes that many items. If `n` is less than or equal to zero, returns an
-     * empty array without modifying the queue. If the queue is closing, drains the
-     * currently available items and transitions to `Done`. If the queue is already
-     * done, the effect fails with the queue's completion cause.
+     * **Details**
      *
-     * **Mutation behavior**: This function mutates the original TxQueue by removing
-     * the taken items. It does not return a new TxQueue reference.
+     * For an open queue, waits until `min(n, capacity)` items are available, then removes that many items. If `n` is less than or equal to zero, returns an empty array without modifying the queue. If the queue is closing, drains the currently available items and transitions to `Done`. If the queue is already done, the effect fails with the queue's completion cause. This function mutates the original TxQueue by removing the taken items. It does not return a new TxQueue reference.
      *
      * **Example** (Taking a fixed number of values)
      *
@@ -756,14 +729,9 @@ export declare const takeN: {
     /**
      * Takes up to `n` items from the queue in a single transaction.
      *
-     * For an open queue, waits until `min(n, capacity)` items are available, then
-     * removes that many items. If `n` is less than or equal to zero, returns an
-     * empty array without modifying the queue. If the queue is closing, drains the
-     * currently available items and transitions to `Done`. If the queue is already
-     * done, the effect fails with the queue's completion cause.
+     * **Details**
      *
-     * **Mutation behavior**: This function mutates the original TxQueue by removing
-     * the taken items. It does not return a new TxQueue reference.
+     * For an open queue, waits until `min(n, capacity)` items are available, then removes that many items. If `n` is less than or equal to zero, returns an empty array without modifying the queue. If the queue is closing, drains the currently available items and transitions to `Done`. If the queue is already done, the effect fails with the queue's completion cause. This function mutates the original TxQueue by removing the taken items. It does not return a new TxQueue reference.
      *
      * **Example** (Taking a fixed number of values)
      *
@@ -793,10 +761,9 @@ export declare const takeN: {
  * Takes between `min` and `max` currently available items, waiting for `min` on
  * an open queue.
  *
- * If the queue is closing, drains the currently available items even when fewer
- * than `min` are available and transitions to `Done`. Invalid ranges
- * (`min <= 0`, `max <= 0`, or `min > max`) return an empty array. If the queue
- * is already done, the effect fails with the queue's completion cause.
+ * **Details**
+ *
+ * If the queue is closing, drains the currently available items even when fewer than `min` are available and transitions to `Done`. Invalid ranges (`min <= 0`, `max <= 0`, or `min > max`) return an empty array. If the queue is already done, the effect fails with the queue's completion cause.
  *
  * **Example** (Taking batches within bounds)
  *
@@ -828,10 +795,9 @@ export declare const takeBetween: {
      * Takes between `min` and `max` currently available items, waiting for `min` on
      * an open queue.
      *
-     * If the queue is closing, drains the currently available items even when fewer
-     * than `min` are available and transitions to `Done`. Invalid ranges
-     * (`min <= 0`, `max <= 0`, or `min > max`) return an empty array. If the queue
-     * is already done, the effect fails with the queue's completion cause.
+     * **Details**
+     *
+     * If the queue is closing, drains the currently available items even when fewer than `min` are available and transitions to `Done`. Invalid ranges (`min <= 0`, `max <= 0`, or `min > max`) return an empty array. If the queue is already done, the effect fails with the queue's completion cause.
      *
      * **Example** (Taking batches within bounds)
      *
@@ -863,10 +829,9 @@ export declare const takeBetween: {
      * Takes between `min` and `max` currently available items, waiting for `min` on
      * an open queue.
      *
-     * If the queue is closing, drains the currently available items even when fewer
-     * than `min` are available and transitions to `Done`. Invalid ranges
-     * (`min <= 0`, `max <= 0`, or `min > max`) return an empty array. If the queue
-     * is already done, the effect fails with the queue's completion cause.
+     * **Details**
+     *
+     * If the queue is closing, drains the currently available items even when fewer than `min` are available and transitions to `Done`. Invalid ranges (`min <= 0`, `max <= 0`, or `min > max`) return an empty array. If the queue is already done, the effect fails with the queue's completion cause.
      *
      * **Example** (Taking batches within bounds)
      *
@@ -898,9 +863,9 @@ export declare const takeBetween: {
 /**
  * Waits transactionally for the next item and returns it without removing it.
  *
- * If the queue is open but empty, the transaction retries until an item is
- * available or the queue completes. If the queue is done, the queue's
- * completion cause is propagated through the error channel.
+ * **Details**
+ *
+ * If the queue is open but empty, the transaction retries until an item is available or the queue completes. If the queue is done, the queue's completion cause is propagated through the error channel.
  *
  * **Example** (Peeking without removing values)
  *
@@ -1007,10 +972,9 @@ export declare const isFull: (self: TxQueueState) => Effect.Effect<boolean>;
 /**
  * Gracefully interrupts the queue with the current fiber's interruption cause.
  *
- * If the queue still contains items, it enters the closing state so buffered
- * items can be drained before consumers observe the interruption. If it is
- * empty, it transitions directly to done. Returns `false` if the queue was
- * already closing or done.
+ * **Details**
+ *
+ * If the queue still contains items, it enters the closing state so buffered items can be drained before consumers observe the interruption. If it is empty, it transitions directly to done. Returns `false` if the queue was already closing or done.
  *
  * **Example** (Interrupting queues)
  *
@@ -1034,8 +998,9 @@ export declare const interrupt: <A, E>(self: TxEnqueue<A, E>) => Effect.Effect<b
 /**
  * Fails the queue with the specified error, discarding any buffered items.
  *
- * The queue transitions directly to done with `Cause.fail(error)`. Returns
- * `false` if the queue was already closing or done.
+ * **Details**
+ *
+ * The queue transitions directly to done with `Cause.fail(error)`. Returns `false` if the queue was already closing or done.
  *
  * **Example** (Failing queues)
  *
@@ -1058,8 +1023,9 @@ export declare const fail: {
     /**
      * Fails the queue with the specified error, discarding any buffered items.
      *
-     * The queue transitions directly to done with `Cause.fail(error)`. Returns
-     * `false` if the queue was already closing or done.
+     * **Details**
+     *
+     * The queue transitions directly to done with `Cause.fail(error)`. Returns `false` if the queue was already closing or done.
      *
      * **Example** (Failing queues)
      *
@@ -1082,8 +1048,9 @@ export declare const fail: {
     /**
      * Fails the queue with the specified error, discarding any buffered items.
      *
-     * The queue transitions directly to done with `Cause.fail(error)`. Returns
-     * `false` if the queue was already closing or done.
+     * **Details**
+     *
+     * The queue transitions directly to done with `Cause.fail(error)`. Returns `false` if the queue was already closing or done.
      *
      * **Example** (Failing queues)
      *
@@ -1107,9 +1074,9 @@ export declare const fail: {
 /**
  * Completes the queue with the specified cause.
  *
- * If the queue is empty, it transitions directly to done. If it still contains
- * items, it enters the closing state so buffered items can be drained before the
- * cause is observed. Returns `false` if the queue was already closing or done.
+ * **Details**
+ *
+ * If the queue is empty, it transitions directly to done. If it still contains items, it enters the closing state so buffered items can be drained before the cause is observed. Returns `false` if the queue was already closing or done.
  *
  * **Example** (Failing queues with causes)
  *
@@ -1133,9 +1100,9 @@ export declare const failCause: {
     /**
      * Completes the queue with the specified cause.
      *
-     * If the queue is empty, it transitions directly to done. If it still contains
-     * items, it enters the closing state so buffered items can be drained before the
-     * cause is observed. Returns `false` if the queue was already closing or done.
+     * **Details**
+     *
+     * If the queue is empty, it transitions directly to done. If it still contains items, it enters the closing state so buffered items can be drained before the cause is observed. Returns `false` if the queue was already closing or done.
      *
      * **Example** (Failing queues with causes)
      *
@@ -1159,9 +1126,9 @@ export declare const failCause: {
     /**
      * Completes the queue with the specified cause.
      *
-     * If the queue is empty, it transitions directly to done. If it still contains
-     * items, it enters the closing state so buffered items can be drained before the
-     * cause is observed. Returns `false` if the queue was already closing or done.
+     * **Details**
+     *
+     * If the queue is empty, it transitions directly to done. If it still contains items, it enters the closing state so buffered items can be drained before the cause is observed. Returns `false` if the queue was already closing or done.
      *
      * **Example** (Failing queues with causes)
      *
@@ -1186,10 +1153,9 @@ export declare const failCause: {
 /**
  * Ends a queue by signaling completion with a `Cause.Done` error.
  *
- * This is a convenience wrapper around `failCause` for queues whose error
- * channel can contain `Cause.Done`. If buffered items remain, the queue enters
- * the closing state and those items may still be consumed before later `take` or
- * `peek` operations fail with `Cause.Done`.
+ * **Details**
+ *
+ * This is a convenience wrapper around `failCause` for queues whose error channel can contain `Cause.Done`. If buffered items remain, the queue enters the closing state and those items may still be consumed before later `take` or `peek` operations fail with `Cause.Done`.
  *
  * **Example** (Ending queues)
  *
@@ -1220,9 +1186,9 @@ export declare const end: <A, E>(self: TxEnqueue<A, E | Cause.Done>) => Effect.E
  * Removes and returns all currently buffered elements without changing the
  * queue state.
  *
- * If the queue is already done with a `Cause.Done` error, returns an empty
- * array. If the queue is done for any other cause, including interruption or
- * failure, that cause is propagated.
+ * **Details**
+ *
+ * If the queue is already done with a `Cause.Done` error, returns an empty array. If the queue is done for any other cause, including interruption or failure, that cause is propagated.
  *
  * **Example** (Clearing queues)
  *
@@ -1251,12 +1217,9 @@ export declare const clear: <A, E>(self: TxEnqueue<A, E>) => Effect.Effect<Array
 /**
  * Shuts down the queue immediately by clearing all items and interrupting it (legacy compatibility).
  *
- * This operation performs two atomic steps:
- * 1. **Clears** all items from the queue using `clear()`
- * 2. **Interrupts** the queue using `interrupt()`
+ * **Details**
  *
- * **Mutation behavior**: This function mutates the original TxQueue by clearing
- * its contents and marking it as shutdown. It does not return a new TxQueue reference.
+ * This operation clears all items from the queue using `clear`, then interrupts the queue using `interrupt`. This function mutates the original TxQueue by clearing its contents and marking it as shutdown. It does not return a new TxQueue reference.
  *
  * **Example** (Shutting down queues)
  *

package/dist/TxQueue.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"TxQueue.d.ts","sourceRoot":"","sources":["../src/TxQueue.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,OAAO,KAAK,KAAK,GAAG,MAAM,YAAY,CAAA;AACtC,OAAO,KAAK,KAAK,MAAM,YAAY,CAAA;AAEnC,OAAO,KAAK,MAAM,MAAM,aAAa,CAAA;AAErC,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAA;AAEnD,OAAO,KAAK,MAAM,MAAM,aAAa,CAAA;AAErC,OAAO,EAAE,KAAK,WAAW,EAAe,MAAM,WAAW,CAAA;AACzD,OAAO,KAAK,OAAO,MAAM,cAAc,CAAA;AACvC,OAAO,KAAK,KAAK,MAAM,YAAY,CAAA;AACnC,OAAO,KAAK,KAAK,KAAK,MAAM,YAAY,CAAA;AAExC;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,MAAM,MAAM,KAAK,CAAC,EAAE,EAAE,CAAC,IACnB;IACA,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;CACtB,GACC;IACA,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAA;IACxB,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;CAC/B,GACC;IACA,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;CAC/B,CAAA;AAEH,QAAA,MAAM,aAAa,yCAAyC,CAAA;AAC5D,QAAA,MAAM,aAAa,yCAAyC,CAAA;AAC5D,QAAA,MAAM,MAAM,iCAAiC,CAAA;AAE7C;;;;GAIG;AACH,MAAM,CAAC,OAAO,WAAW,SAAS,CAAC;IACjC;;;;;OAKG;IACH,UAAiB,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAClC,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAA;QACnC,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAA;KACpC;CACF;AAED;;;;GAIG;AACH,MAAM,CAAC,OAAO,WAAW,SAAS,CAAC;IACjC;;;;;OAKG;IACH,UAAiB,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACpC,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;QAC/B,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;KAChC;CACF;AAED;;;;GAIG;AACH,MAAM,CAAC,OAAO,WAAW,OAAO,CAAC;IAC/B;;;;;OAKG;IACH,UAAiB,QAAQ,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;QAC1C,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;QAC/B,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;KAChC;CACF;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,YAAa,SAAQ,WAAW;IAC/C,QAAQ,CAAC,QAAQ,EAAE,SAAS,GAAG,WAAW,GAAG,UAAU,GAAG,SAAS,CAAA;IACnE,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;IACzB,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;IACpC,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAA;CAChD;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AACH,MAAM,WAAW,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,KAAK,CAAE,SAAQ,YAAY;IACjE,QAAQ,CAAC,CAAC,aAAa,CAAC,EAAE,SAAS,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;CACnD;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,MAAM,WAAW,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,KAAK,CAAE,SAAQ,YAAY;IACnE,QAAQ,CAAC,CAAC,aAAa,CAAC,EAAE,SAAS,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;CACnD;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,MAAM,WAAW,OAAO,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAE,SAAQ,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC;IAC3F,QAAQ,CAAC,CAAC,MAAM,CAAC,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;CAC1C;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,eAAO,MAAM,WAAW,GAAI,CAAC,GAAG,OAAO,EAAE,CAAC,GAAG,OAAO,EAAE,GAAG,OAAO,KAAG,CAAC,IAAI,SAAS,CAAC,CAAC,EAAE,CAAC,CAAkC,CAAA;AAExH;;;;;;;;;;;;;;;;;;GAkBG;AACH,eAAO,MAAM,WAAW,GAAI,CAAC,GAAG,OAAO,EAAE,CAAC,GAAG,OAAO,EAAE,GAAG,OAAO,KAAG,CAAC,IAAI,SAAS,CAAC,CAAC,EAAE,CAAC,CAAkC,CAAA;AAExH;;;;;;;;;;;;;;;;;;GAkBG;AACH,eAAO,MAAM,SAAS,GAAI,CAAC,GAAG,OAAO,EAAE,CAAC,GAAG,OAAO,EAAE,GAAG,OAAO,KAAG,CAAC,IAAI,OAAO,CAAC,CAAC,EAAE,CAAC,CAA2B,CAAA;AA6B7G;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,eAAO,MAAM,OAAO,GAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,EAC1C,UAAU,MAAM,KACf,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAWV,CAAA;AAEpB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,eAAO,MAAM,SAAS,GAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,OAAK,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAW1D,CAAA;AAEpB;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,eAAO,MAAM,QAAQ,GAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,EAC3C,UAAU,MAAM,KACf,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAWV,CAAA;AAEpB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,eAAO,MAAM,OAAO,GAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,EAC1C,UAAU,MAAM,KACf,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAWV,CAAA;AAMpB;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,eAAO,MAAM,KAAK,EAAE;IAKlB;;;;;;;;;;;;;;;;;;;;;;;;;;OA0BG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;IAKnE;;;;;;;;;;;;;;;;;;;;;;;;;;OA0BG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;CAsChE,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,eAAO,MAAM,QAAQ,EAAE;IACrB;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA4BG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;IAC/E;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA4BG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;CAgB5E,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACH,eAAO,MAAM,IAAI,GAAI,CAAC,EAAE,CAAC,EAAE,MAAM,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAG,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CA6BjD,CAAA;AAEpB;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,eAAO,MAAM,IAAI,GAAI,CAAC,EAAE,CAAC,EAAE,MAAM,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAe7D,CAAA;AAEpB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAwCG;AACH,eAAO,MAAM,OAAO,GAAI,CAAC,EAAE,CAAC,EAAE,MAAM,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAG,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,CA0BvE,CAAA;AAEpB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AACH,eAAO,MAAM,KAAK,EAAE;IAClB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAiCG;IACH,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACxE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAiCG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;CAwDrE,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AACH,eAAO,MAAM,WAAW,EAAE;IACxB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAiCG;IACH,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACvF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAiCG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;CAoDpF,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsCG;AACH,eAAO,MAAM,IAAI,GAAI,CAAC,EAAE,CAAC,EAAE,MAAM,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAG,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAcjD,CAAA;AAEpB;;;;;;;;;;;;;;;;;;;GAmBG;AACH,eAAO,MAAM,IAAI,GAAI,MAAM,YAAY,KAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAA6B,CAAA;AAE3F;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,eAAO,MAAM,OAAO,GAAI,MAAM,YAAY,KAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CAAgC,CAAA;AAElG;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,eAAO,MAAM,MAAM,GAAI,MAAM,YAAY,KAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CAGU,CAAA;AAE3E;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,eAAO,MAAM,SAAS,GAAI,CAAC,EAAE,CAAC,EAAE,MAAM,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CACJ,CAAA;AAEzE;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,eAAO,MAAM,IAAI,EAAE;IACjB;;;;;;;;;;;;;;;;;;;;;;OAsBG;IACH,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;IACnE;;;;;;;;;;;;;;;;;;;;;;OAsBG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;CAiBhE,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,eAAO,MAAM,SAAS,EAAE;IACtB;;;;;;;;;;;;;;;;;;;;;;;;OAwBG;IACH,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;IAChF;;;;;;;;;;;;;;;;;;;;;;;;OAwBG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;CAqB7E,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACH,eAAO,MAAM,GAAG,GAAI,CAAC,EAAE,CAAC,EAAE,MAAM,SAAS,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,KAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CACzC,CAAA;AAE3C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,eAAO,MAAM,KAAK,GAAI,CAAC,EAAE,CAAC,EAAE,MAAM,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,CAatE,CAAA;AAEpB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AACH,eAAO,MAAM,QAAQ,GAAI,CAAC,EAAE,CAAC,EAAE,MAAM,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CAIxD,CAAA;AAEpB;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,eAAO,MAAM,MAAM,GAAI,MAAM,YAAY,KAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CACO,CAAA;AAExE;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,eAAO,MAAM,SAAS,GAAI,MAAM,YAAY,KAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CACO,CAAA;AAE3E;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,eAAO,MAAM,MAAM,GAAI,MAAM,YAAY,KAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CACO,CAAA;AAExE;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,eAAO,MAAM,UAAU,GAAI,MAAM,YAAY,KAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CAAiB,CAAA;AAEtF;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,eAAO,MAAM,eAAe,GAAI,MAAM,YAAY,KAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAUnD,CAAA"}
+{"version":3,"file":"TxQueue.d.ts","sourceRoot":"","sources":["../src/TxQueue.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,OAAO,KAAK,KAAK,GAAG,MAAM,YAAY,CAAA;AACtC,OAAO,KAAK,KAAK,MAAM,YAAY,CAAA;AAEnC,OAAO,KAAK,MAAM,MAAM,aAAa,CAAA;AAErC,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAA;AAEnD,OAAO,KAAK,MAAM,MAAM,aAAa,CAAA;AAErC,OAAO,EAAE,KAAK,WAAW,EAAe,MAAM,WAAW,CAAA;AACzD,OAAO,KAAK,OAAO,MAAM,cAAc,CAAA;AACvC,OAAO,KAAK,KAAK,MAAM,YAAY,CAAA;AACnC,OAAO,KAAK,KAAK,KAAK,MAAM,YAAY,CAAA;AAExC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,MAAM,MAAM,KAAK,CAAC,EAAE,EAAE,CAAC,IACnB;IACA,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;CACtB,GACC;IACA,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAA;IACxB,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;CAC/B,GACC;IACA,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;CAC/B,CAAA;AAEH,QAAA,MAAM,aAAa,yCAAyC,CAAA;AAC5D,QAAA,MAAM,aAAa,yCAAyC,CAAA;AAC5D,QAAA,MAAM,MAAM,iCAAiC,CAAA;AAE7C;;;;GAIG;AACH,MAAM,CAAC,OAAO,WAAW,SAAS,CAAC;IACjC;;;;;OAKG;IACH,UAAiB,QAAQ,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAClC,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAA;QACnC,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAA;KACpC;CACF;AAED;;;;GAIG;AACH,MAAM,CAAC,OAAO,WAAW,SAAS,CAAC;IACjC;;;;;OAKG;IACH,UAAiB,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACpC,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;QAC/B,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;KAChC;CACF;AAED;;;;GAIG;AACH,MAAM,CAAC,OAAO,WAAW,OAAO,CAAC;IAC/B;;;;;OAKG;IACH,UAAiB,QAAQ,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;QAC1C,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;QAC/B,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;KAChC;CACF;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,YAAa,SAAQ,WAAW;IAC/C,QAAQ,CAAC,QAAQ,EAAE,SAAS,GAAG,WAAW,GAAG,UAAU,GAAG,SAAS,CAAA;IACnE,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;IACzB,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;IACpC,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAA;CAChD;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AACH,MAAM,WAAW,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,KAAK,CAAE,SAAQ,YAAY;IACjE,QAAQ,CAAC,CAAC,aAAa,CAAC,EAAE,SAAS,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;CACnD;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,MAAM,WAAW,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,KAAK,CAAE,SAAQ,YAAY;IACnE,QAAQ,CAAC,CAAC,aAAa,CAAC,EAAE,SAAS,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;CACnD;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,MAAM,WAAW,OAAO,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAE,SAAQ,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC;IAC3F,QAAQ,CAAC,CAAC,MAAM,CAAC,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;CAC1C;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,eAAO,MAAM,WAAW,GAAI,CAAC,GAAG,OAAO,EAAE,CAAC,GAAG,OAAO,EAAE,GAAG,OAAO,KAAG,CAAC,IAAI,SAAS,CAAC,CAAC,EAAE,CAAC,CAAkC,CAAA;AAExH;;;;;;;;;;;;;;;;;;GAkBG;AACH,eAAO,MAAM,WAAW,GAAI,CAAC,GAAG,OAAO,EAAE,CAAC,GAAG,OAAO,EAAE,GAAG,OAAO,KAAG,CAAC,IAAI,SAAS,CAAC,CAAC,EAAE,CAAC,CAAkC,CAAA;AAExH;;;;;;;;;;;;;;;;;;GAkBG;AACH,eAAO,MAAM,SAAS,GAAI,CAAC,GAAG,OAAO,EAAE,CAAC,GAAG,OAAO,EAAE,GAAG,OAAO,KAAG,CAAC,IAAI,OAAO,CAAC,CAAC,EAAE,CAAC,CAA2B,CAAA;AA6B7G;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,eAAO,MAAM,OAAO,GAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,EAC1C,UAAU,MAAM,KACf,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAWV,CAAA;AAEpB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,eAAO,MAAM,SAAS,GAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,OAAK,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAW1D,CAAA;AAEpB;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,eAAO,MAAM,QAAQ,GAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,EAC3C,UAAU,MAAM,KACf,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAWV,CAAA;AAEpB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,eAAO,MAAM,OAAO,GAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,EAC1C,UAAU,MAAM,KACf,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAWV,CAAA;AAMpB;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,eAAO,MAAM,KAAK,EAAE;IAKlB;;;;;;;;;;;;;;;;;;;;;;;OAuBG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;IAKnE;;;;;;;;;;;;;;;;;;;;;;;OAuBG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;CAsChE,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,eAAO,MAAM,QAAQ,EAAE;IACrB;;;;;;;;;;;;;;;;;;;;;;;;;OAyBG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;IAC/E;;;;;;;;;;;;;;;;;;;;;;;;;OAyBG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;CAgB5E,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,eAAO,MAAM,IAAI,GAAI,CAAC,EAAE,CAAC,EAAE,MAAM,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAG,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CA6BjD,CAAA;AAEpB;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,eAAO,MAAM,IAAI,GAAI,CAAC,EAAE,CAAC,EAAE,MAAM,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAe7D,CAAA;AAEpB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoCG;AACH,eAAO,MAAM,OAAO,GAAI,CAAC,EAAE,CAAC,EAAE,MAAM,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAG,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,CA0BvE,CAAA;AAEpB;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,eAAO,MAAM,KAAK,EAAE;IAClB;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA4BG;IACH,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACxE;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA4BG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;CAwDrE,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AACH,eAAO,MAAM,WAAW,EAAE;IACxB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAgCG;IACH,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACvF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAgCG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;CAoDpF,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsCG;AACH,eAAO,MAAM,IAAI,GAAI,CAAC,EAAE,CAAC,EAAE,MAAM,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAG,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAcjD,CAAA;AAEpB;;;;;;;;;;;;;;;;;;;GAmBG;AACH,eAAO,MAAM,IAAI,GAAI,MAAM,YAAY,KAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAA6B,CAAA;AAE3F;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,eAAO,MAAM,OAAO,GAAI,MAAM,YAAY,KAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CAAgC,CAAA;AAElG;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,eAAO,MAAM,MAAM,GAAI,MAAM,YAAY,KAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CAGU,CAAA;AAE3E;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,eAAO,MAAM,SAAS,GAAI,CAAC,EAAE,CAAC,EAAE,MAAM,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CACJ,CAAA;AAEzE;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,eAAO,MAAM,IAAI,EAAE;IACjB;;;;;;;;;;;;;;;;;;;;;;;OAuBG;IACH,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;IACnE;;;;;;;;;;;;;;;;;;;;;;;OAuBG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;CAiBhE,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,eAAO,MAAM,SAAS,EAAE;IACtB;;;;;;;;;;;;;;;;;;;;;;;;OAwBG;IACH,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;IAChF;;;;;;;;;;;;;;;;;;;;;;;;OAwBG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAA;CAqB7E,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,eAAO,MAAM,GAAG,GAAI,CAAC,EAAE,CAAC,EAAE,MAAM,SAAS,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,KAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CACzC,CAAA;AAE3C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,eAAO,MAAM,KAAK,GAAI,CAAC,EAAE,CAAC,EAAE,MAAM,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC,CAatE,CAAA;AAEpB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACH,eAAO,MAAM,QAAQ,GAAI,CAAC,EAAE,CAAC,EAAE,MAAM,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,KAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CAIxD,CAAA;AAEpB;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,eAAO,MAAM,MAAM,GAAI,MAAM,YAAY,KAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CACO,CAAA;AAExE;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,eAAO,MAAM,SAAS,GAAI,MAAM,YAAY,KAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CACO,CAAA;AAE3E;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,eAAO,MAAM,MAAM,GAAI,MAAM,YAAY,KAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CACO,CAAA;AAExE;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,eAAO,MAAM,UAAU,GAAI,MAAM,YAAY,KAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CAAiB,CAAA;AAEtF;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,eAAO,MAAM,eAAe,GAAI,MAAM,YAAY,KAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAUnD,CAAA"}