effect 4.0.0-beta.65 → 4.0.0-beta.67

package/dist/Ordering.d.ts

@@ -1,29 +1,39 @@
 /**
- * @fileoverview
- * The Ordering module provides utilities for working with comparison results and ordering operations.
- * An Ordering represents the result of comparing two values, expressing whether the first value is
- * less than (-1), equal to (0), or greater than (1) the second value.
- *
- * This module is fundamental for building comparison functions, sorting algorithms, and implementing
- * ordered data structures. It provides composable operations for combining multiple comparison results
- * and pattern matching on ordering outcomes.
- *
- * Key Features:
- * - Type-safe representation of comparison results (-1, 0, 1)
- * - Composable operations for combining multiple orderings
- * - Pattern matching utilities for handling different ordering cases
- * - Ordering reversal and combination functions
- * - Integration with Effect's functional programming patterns
- *
- * Common Use Cases:
- * - Implementing custom comparison functions
- * - Building complex sorting criteria
- * - Combining multiple comparison results
- * - Creating ordered data structures
- * - Pattern matching on comparison outcomes
+ * The `Ordering` module provides the standard representation for the result of
+ * comparing two values. An `Ordering` is one of three numeric literals: `-1`
+ * when the first value is less than the second, `0` when both values compare as
+ * equal, and `1` when the first value is greater than the second.
+ *
+ * **Mental model**
+ *
+ * - `Ordering` describes the relationship between two compared values, not the
+ *   values themselves
+ * - Negative means "less than", zero means "equal", and positive means "greater
+ *   than"
+ * - Unlike JavaScript comparators, this type is normalized to exactly `-1`, `0`,
+ *   or `1`
+ * - `0` is neutral when combining comparisons; the first non-zero ordering
+ *   determines the result
+ *
+ * **Common tasks**
+ *
+ * - Interpret a comparison result with {@link match}
+ * - Reverse ascending and descending order with {@link reverse}
+ * - Combine multiple comparison criteria with {@link Reducer}
+ * - Build custom comparison functions for sorting, ordered collections, and
+ *   domain-specific ordering rules
+ *
+ * **Gotchas**
+ *
+ * - Do not cast arbitrary comparator results such as `a.localeCompare(b)`
+ *   directly unless they have been normalized to `-1`, `0`, or `1`
+ * - In comparator-style APIs, `-1` means the left value should come before the
+ *   right value, while `1` means it should come after
+ * - Reversing an `Ordering` swaps `-1` and `1`, but leaves `0` unchanged
  *
- * @since 2.0.0
+ * @fileoverview
  * @category utilities
+ * @since 2.0.0
  */
 import type { LazyArg } from "./Function.ts";
 import * as Reducer_ from "./Reducer.ts";
@@ -34,7 +44,8 @@ import * as Reducer_ from "./Reducer.ts";
  * - `0` indicates the values are equal
  * - `1` indicates the first value is greater than the second
  *
- * @example
+ * **Example** (Defining comparison results)
+ *
  * ```ts
  * import type { Ordering } from "effect"
  *
@@ -63,7 +74,8 @@ export type Ordering = -1 | 0 | 1;
  * Inverts the ordering of the input Ordering.
  * This is useful for creating descending sort orders from ascending ones.
  *
- * @example
+ * **Example** (Reversing comparison order)
+ *
  * ```ts
  * import { Ordering } from "effect"
  *
@@ -97,7 +109,8 @@ export declare const reverse: (o: Ordering) => Ordering;
 /**
  * Depending on the `Ordering` parameter given to it, returns a value produced by one of the 3 functions provided as parameters.
  *
- * @example
+ * **Example** (Pattern matching on orderings)
+ *
  * ```ts
  * import { Ordering } from "effect"
  * import { constant } from "effect/Function"
@@ -121,7 +134,8 @@ export declare const match: {
     /**
      * Depending on the `Ordering` parameter given to it, returns a value produced by one of the 3 functions provided as parameters.
      *
-     * @example
+     * **Example** (Pattern matching on orderings)
+     *
      * ```ts
      * import { Ordering } from "effect"
      * import { constant } from "effect/Function"
@@ -149,7 +163,8 @@ export declare const match: {
     /**
      * Depending on the `Ordering` parameter given to it, returns a value produced by one of the 3 functions provided as parameters.
      *
-     * @example
+     * **Example** (Pattern matching on orderings)
+     *
      * ```ts
      * import { Ordering } from "effect"
      * import { constant } from "effect/Function"

package/dist/Ordering.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Ordering.d.ts","sourceRoot":"","sources":["../src/Ordering.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,eAAe,CAAA;AAE5C,OAAO,KAAK,QAAQ,MAAM,cAAc,CAAA;AAExC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,MAAM,MAAM,QAAQ,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;AAEjC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AACH,eAAO,MAAM,OAAO,GAAI,GAAG,QAAQ,KAAG,QAA6C,CAAA;AAEnF;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,eAAO,MAAM,KAAK,EAAE;IAClB;;;;;;;;;;;;;;;;;;;;;;OAsBG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EACV,OAAO,EAAE;QACP,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC,CAAC,CAAA;QAC/B,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAA;QAC5B,QAAQ,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC,CAAC,CAAA;KACnC,GACA,CAAC,IAAI,EAAE,QAAQ,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;IAChC;;;;;;;;;;;;;;;;;;;;;;OAsBG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EACV,CAAC,EAAE,QAAQ,EACX,OAAO,EAAE;QACP,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC,CAAC,CAAA;QAC/B,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAA;QAC5B,QAAQ,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC,CAAC,CAAA;KACnC,GACA,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;CAQwE,CAAA;AAEtF;;;;;;;GAOG;AACH,eAAO,MAAM,OAAO,EAAE,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAY9C,CAAA"}
+{"version":3,"file":"Ordering.d.ts","sourceRoot":"","sources":["../src/Ordering.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoCG;AACH,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,eAAe,CAAA;AAE5C,OAAO,KAAK,QAAQ,MAAM,cAAc,CAAA;AAExC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACH,MAAM,MAAM,QAAQ,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;AAEjC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AACH,eAAO,MAAM,OAAO,GAAI,GAAG,QAAQ,KAAG,QAA6C,CAAA;AAEnF;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,eAAO,MAAM,KAAK,EAAE;IAClB;;;;;;;;;;;;;;;;;;;;;;;OAuBG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EACV,OAAO,EAAE;QACP,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC,CAAC,CAAA;QAC/B,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAA;QAC5B,QAAQ,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC,CAAC,CAAA;KACnC,GACA,CAAC,IAAI,EAAE,QAAQ,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;IAChC;;;;;;;;;;;;;;;;;;;;;;;OAuBG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EACV,CAAC,EAAE,QAAQ,EACX,OAAO,EAAE;QACP,QAAQ,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC,CAAC,CAAA;QAC/B,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAA;QAC5B,QAAQ,CAAC,aAAa,EAAE,OAAO,CAAC,CAAC,CAAC,CAAA;KACnC,GACA,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;CAQwE,CAAA;AAEtF;;;;;;;GAOG;AACH,eAAO,MAAM,OAAO,EAAE,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAY9C,CAAA"}

package/dist/Ordering.js

@@ -4,7 +4,8 @@ import * as Reducer_ from "./Reducer.js";
  * Inverts the ordering of the input Ordering.
  * This is useful for creating descending sort orders from ascending ones.
  *
- * @example
+ * **Example** (Reversing comparison order)
+ *
  * ```ts
  * import { Ordering } from "effect"
  *
@@ -38,7 +39,8 @@ export const reverse = o => o === -1 ? 1 : o === 1 ? -1 : 0;
 /**
  * Depending on the `Ordering` parameter given to it, returns a value produced by one of the 3 functions provided as parameters.
  *
- * @example
+ * **Example** (Pattern matching on orderings)
+ *
  * ```ts
  * import { Ordering } from "effect"
  * import { constant } from "effect/Function"

package/dist/Ordering.js.map

@@ -1 +1 @@
-{"version":3,"file":"Ordering.js","names":["dual","Reducer_","reverse","o","match","self","onEqual","onGreaterThan","onLessThan","Reducer","make","that","collection","ordering"],"sources":["../src/Ordering.ts"],"sourcesContent":[null],"mappings":"AA4BA,SAASA,IAAI,QAAQ,eAAe;AACpC,OAAO,KAAKC,QAAQ,MAAM,cAAc;AAmCxC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAkCA,OAAO,MAAMC,OAAO,GAAIC,CAAW,IAAgBA,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAGA,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAE;AAEnF;;;;;;;;;;;;;;;;;;;;;;;AAuBA,OAAO,MAAMC,KAAK,gBA8DdJ,IAAI,CAAC,CAAC,EAAE,CACVK,IAAc,EACd;EAAEC,OAAO;EAAEC,aAAa;EAAEC;AAAU,CAInC,KACaH,IAAI,KAAK,CAAC,CAAC,GAAGG,UAAU,EAAE,GAAGH,IAAI,KAAK,CAAC,GAAGC,OAAO,EAAE,GAAGC,aAAa,EAAE,CAAC;AAEtF;;;;;;;;AAQA,OAAO,MAAME,OAAO,gBAA+BR,QAAQ,CAACS,IAAI,CAC9D,CAACL,IAAI,EAAEM,IAAI,KAAKN,IAAI,KAAK,CAAC,GAAGA,IAAI,GAAGM,IAAI,EACxC,CAAC,EACAC,UAAU,IAAI;EACb,IAAIC,QAAQ,GAAa,CAAC;EAC1B,KAAKA,QAAQ,IAAID,UAAU,EAAE;IAC3B,IAAIC,QAAQ,KAAK,CAAC,EAAE;MAClB,OAAOA,QAAQ;IACjB;EACF;EACA,OAAOA,QAAQ;AACjB,CAAC,CACF","ignoreList":[]}
+{"version":3,"file":"Ordering.js","names":["dual","Reducer_","reverse","o","match","self","onEqual","onGreaterThan","onLessThan","Reducer","make","that","collection","ordering"],"sources":["../src/Ordering.ts"],"sourcesContent":[null],"mappings":"AAsCA,SAASA,IAAI,QAAQ,eAAe;AACpC,OAAO,KAAKC,QAAQ,MAAM,cAAc;AAoCxC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAmCA,OAAO,MAAMC,OAAO,GAAIC,CAAW,IAAgBA,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAGA,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAE;AAEnF;;;;;;;;;;;;;;;;;;;;;;;;AAwBA,OAAO,MAAMC,KAAK,gBAgEdJ,IAAI,CAAC,CAAC,EAAE,CACVK,IAAc,EACd;EAAEC,OAAO;EAAEC,aAAa;EAAEC;AAAU,CAInC,KACaH,IAAI,KAAK,CAAC,CAAC,GAAGG,UAAU,EAAE,GAAGH,IAAI,KAAK,CAAC,GAAGC,OAAO,EAAE,GAAGC,aAAa,EAAE,CAAC;AAEtF;;;;;;;;AAQA,OAAO,MAAME,OAAO,gBAA+BR,QAAQ,CAACS,IAAI,CAC9D,CAACL,IAAI,EAAEM,IAAI,KAAKN,IAAI,KAAK,CAAC,GAAGA,IAAI,GAAGM,IAAI,EACxC,CAAC,EACAC,UAAU,IAAI;EACb,IAAIC,QAAQ,GAAa,CAAC;EAC1B,KAAKA,QAAQ,IAAID,UAAU,EAAE;IAC3B,IAAIC,QAAQ,KAAK,CAAC,EAAE;MAClB,OAAOA,QAAQ;IACjB;EACF;EACA,OAAOA,QAAQ;AACjB,CAAC,CACF","ignoreList":[]}

package/dist/PartitionedSemaphore.d.ts

@@ -1,16 +1,65 @@
 /**
+ * The `PartitionedSemaphore` module provides a semaphore for limiting
+ * concurrency across a shared permit pool while keeping waiters grouped by
+ * partition key. A `PartitionedSemaphore<K>` is useful when many independent
+ * groups of work compete for the same bounded resource and each group should
+ * make progress without one busy group monopolizing released permits.
+ *
+ * **Mental model**
+ *
+ * - The semaphore has a fixed shared capacity measured in permits
+ * - Work acquires permits with a partition key of type `K`
+ * - Waiting acquisitions are tracked per partition
+ * - Released permits are assigned to waiting partitions in round-robin order
+ * - `withPermit` and `withPermits` acquire permits around an effect and
+ *   release them when the effect exits, fails, or is interrupted
+ *
+ * **Common tasks**
+ *
+ * - Create a semaphore: {@link make}, {@link makeUnsafe}
+ * - Inspect capacity and availability: {@link capacity}, {@link available}
+ * - Acquire and release manually: {@link take}, {@link release}
+ * - Limit a single operation per partition: {@link withPermit}
+ * - Limit weighted work per partition: {@link withPermits}
+ * - Run only when permits are immediately available:
+ *   {@link withPermitsIfAvailable}
+ *
+ * **Gotchas**
+ *
+ * - `withPermitsIfAvailable` does not use a partition key; it only succeeds
+ *   when the shared pool has enough permits immediately
+ * - Acquiring more permits than the semaphore capacity never completes
+ * - Requests for zero or negative permits complete without acquiring anything
+ * - Non-finite capacities create an unbounded semaphore whose acquire and
+ *   release operations complete immediately
+ *
  * @since 4.0.0
  */
 import * as Effect from "./Effect.ts";
 import * as Option from "./Option.ts";
 /**
- * @since 4.0.0
+ * Runtime type identifier used to mark values that implement
+ * `PartitionedSemaphore`.
+ *
+ * **Details**
+ *
+ * This constant is stored on partitioned semaphore instances and can be used by
+ * library code that needs to recognize the data type at runtime.
+ *
  * @category models
+ * @since 4.0.0
  */
 export declare const PartitionedTypeId: PartitionedTypeId;
 /**
- * @since 4.0.0
+ * Literal type of the `PartitionedSemaphore` runtime type identifier.
+ *
+ * **Details**
+ *
+ * Use this type when declaring fields that must contain the exact
+ * `PartitionedTypeId` marker value.
+ *
  * @category models
+ * @since 4.0.0
  */
 export type PartitionedTypeId = "~effect/PartitionedSemaphore";
 /**
@@ -19,8 +68,8 @@ export type PartitionedTypeId = "~effect/PartitionedSemaphore";
  *
  * Waiting permits are distributed across partitions in round-robin order.
  *
- * @since 4.0.0
  * @category models
+ * @since 4.0.0
  */
 export interface PartitionedSemaphore<in K> {
     readonly [PartitionedTypeId]: PartitionedTypeId;
@@ -33,25 +82,50 @@ export interface PartitionedSemaphore<in K> {
     readonly withPermitsIfAvailable: (permits: number) => <A, E, R>(effect: Effect.Effect<A, E, R>) => Effect.Effect<Option.Option<A>, E, R>;
 }
 /**
- * @since 4.0.0
+ * Alias interface for a `PartitionedSemaphore` keyed by values of type `K`.
+ *
+ * **Details**
+ *
+ * This interface does not add members beyond `PartitionedSemaphore`; it
+ * provides an alternate exported name for APIs that refer to a partitioned
+ * permit pool.
+ *
  * @category models
+ * @since 4.0.0
  */
 export interface Partitioned<in K> extends PartitionedSemaphore<K> {
 }
 /**
- * Creates a `PartitionedSemaphore` unsafely.
+ * Constructs a `PartitionedSemaphore` synchronously, outside of `Effect`.
+ *
+ * **Details**
+ *
+ * Negative permit counts are clamped to `0`. Non-finite permit counts create
+ * an unbounded semaphore whose acquire and release operations complete
+ * immediately.
+ *
+ * **Notes**
+ *
+ * Prefer `make` when the semaphore should be created inside an `Effect`
+ * workflow.
  *
- * @since 4.0.0
  * @category constructors
+ * @since 4.0.0
  */
 export declare const makeUnsafe: <K = unknown>(options: {
     readonly permits: number;
 }) => PartitionedSemaphore<K>;
 /**
- * Creates a `PartitionedSemaphore`.
+ * Creates a `PartitionedSemaphore` inside an `Effect`.
+ *
+ * **Details**
+ *
+ * The `permits` option sets the shared permit capacity. The resulting
+ * semaphore tracks waiters by partition key and distributes released permits
+ * across waiting partitions in round-robin order.
  *
- * @since 4.0.0
  * @category constructors
+ * @since 4.0.0
  */
 export declare const make: <K = unknown>(options: {
     readonly permits: number;
@@ -59,124 +133,235 @@ export declare const make: <K = unknown>(options: {
 /**
  * Gets the current number of available permits.
  *
- * @since 4.0.0
  * @category combinators
+ * @since 4.0.0
  */
 export declare const available: <K>(self: PartitionedSemaphore<K>) => Effect.Effect<number>;
 /**
  * Gets the total capacity.
  *
- * @since 4.0.0
  * @category getters
+ * @since 4.0.0
  */
 export declare const capacity: <K>(self: PartitionedSemaphore<K>) => number;
 /**
- * Acquires permits for a partition.
+ * Returns an effect that acquires the requested number of permits for the
+ * given partition key.
+ *
+ * **Details**
+ *
+ * If enough permits are available, the effect completes immediately. Otherwise
+ * it waits until released permits are assigned to this partition. Requests for
+ * more permits than the semaphore capacity never complete. Requests for zero
+ * or a negative number of permits complete without acquiring anything.
  *
- * @since 4.0.0
  * @category combinators
+ * @since 4.0.0
  */
 export declare const take: {
     /**
-     * Acquires permits for a partition.
+     * Returns an effect that acquires the requested number of permits for the
+     * given partition key.
+     *
+     * **Details**
+     *
+     * If enough permits are available, the effect completes immediately. Otherwise
+     * it waits until released permits are assigned to this partition. Requests for
+     * more permits than the semaphore capacity never complete. Requests for zero
+     * or a negative number of permits complete without acquiring anything.
      *
-     * @since 4.0.0
      * @category combinators
+     * @since 4.0.0
      */
     <K>(key: K, permits: number): (self: PartitionedSemaphore<K>) => Effect.Effect<void>;
     /**
-     * Acquires permits for a partition.
+     * Returns an effect that acquires the requested number of permits for the
+     * given partition key.
+     *
+     * **Details**
+     *
+     * If enough permits are available, the effect completes immediately. Otherwise
+     * it waits until released permits are assigned to this partition. Requests for
+     * more permits than the semaphore capacity never complete. Requests for zero
+     * or a negative number of permits complete without acquiring anything.
      *
-     * @since 4.0.0
      * @category combinators
+     * @since 4.0.0
      */
     <K>(self: PartitionedSemaphore<K>, key: K, permits: number): Effect.Effect<void>;
 };
 /**
- * Releases permits back to the shared pool.
+ * Returns an effect that releases permits back to the shared pool and returns
+ * the current available permit count.
+ *
+ * **Details**
+ *
+ * Released permits are first assigned to waiting partitions in round-robin
+ * order. Only permits not needed by waiters increase the available count,
+ * which is capped at the semaphore capacity.
  *
- * @since 4.0.0
  * @category combinators
+ * @since 4.0.0
  */
 export declare const release: {
     /**
-     * Releases permits back to the shared pool.
+     * Returns an effect that releases permits back to the shared pool and returns
+     * the current available permit count.
+     *
+     * **Details**
+     *
+     * Released permits are first assigned to waiting partitions in round-robin
+     * order. Only permits not needed by waiters increase the available count,
+     * which is capped at the semaphore capacity.
      *
-     * @since 4.0.0
      * @category combinators
+     * @since 4.0.0
      */
     (permits: number): <K>(self: PartitionedSemaphore<K>) => Effect.Effect<number>;
     /**
-     * Releases permits back to the shared pool.
+     * Returns an effect that releases permits back to the shared pool and returns
+     * the current available permit count.
+     *
+     * **Details**
+     *
+     * Released permits are first assigned to waiting partitions in round-robin
+     * order. Only permits not needed by waiters increase the available count,
+     * which is capped at the semaphore capacity.
      *
-     * @since 4.0.0
      * @category combinators
+     * @since 4.0.0
      */
     <K>(self: PartitionedSemaphore<K>, permits: number): Effect.Effect<number>;
 };
 /**
- * Runs an effect with permits for a partition.
+ * Runs an effect after acquiring permits for a partition, then releases those
+ * permits when the effect exits.
+ *
+ * **Details**
+ *
+ * Permit acquisition may wait according to `take` semantics. Once acquired,
+ * the permits are released even if the wrapped effect fails or is interrupted.
+ * Requests for zero or a negative number of permits run the effect without
+ * acquiring anything.
  *
- * @since 4.0.0
  * @category combinators
+ * @since 4.0.0
  */
 export declare const withPermits: {
     /**
-     * Runs an effect with permits for a partition.
+     * Runs an effect after acquiring permits for a partition, then releases those
+     * permits when the effect exits.
+     *
+     * **Details**
+     *
+     * Permit acquisition may wait according to `take` semantics. Once acquired,
+     * the permits are released even if the wrapped effect fails or is interrupted.
+     * Requests for zero or a negative number of permits run the effect without
+     * acquiring anything.
      *
-     * @since 4.0.0
      * @category combinators
+     * @since 4.0.0
      */
     <K>(self: PartitionedSemaphore<K>, key: K, permits: number): <A, E, R>(effect: Effect.Effect<A, E, R>) => Effect.Effect<A, E, R>;
     /**
-     * Runs an effect with permits for a partition.
+     * Runs an effect after acquiring permits for a partition, then releases those
+     * permits when the effect exits.
+     *
+     * **Details**
+     *
+     * Permit acquisition may wait according to `take` semantics. Once acquired,
+     * the permits are released even if the wrapped effect fails or is interrupted.
+     * Requests for zero or a negative number of permits run the effect without
+     * acquiring anything.
      *
-     * @since 4.0.0
      * @category combinators
+     * @since 4.0.0
      */
     <K, A, E, R>(self: PartitionedSemaphore<K>, key: K, permits: number, effect: Effect.Effect<A, E, R>): Effect.Effect<A, E, R>;
 };
 /**
- * Runs an effect with a single permit for a partition.
+ * Runs an effect after acquiring one permit for a partition, then releases the
+ * permit when the effect exits.
+ *
+ * **Details**
+ *
+ * This is the single-permit variant of `withPermits`. The permit is released
+ * even if the wrapped effect fails or is interrupted.
  *
- * @since 4.0.0
  * @category combinators
+ * @since 4.0.0
  */
 export declare const withPermit: {
     /**
-     * Runs an effect with a single permit for a partition.
+     * Runs an effect after acquiring one permit for a partition, then releases the
+     * permit when the effect exits.
+     *
+     * **Details**
+     *
+     * This is the single-permit variant of `withPermits`. The permit is released
+     * even if the wrapped effect fails or is interrupted.
      *
-     * @since 4.0.0
      * @category combinators
+     * @since 4.0.0
      */
     <K>(self: PartitionedSemaphore<K>, key: K): <A, E, R>(effect: Effect.Effect<A, E, R>) => Effect.Effect<A, E, R>;
     /**
-     * Runs an effect with a single permit for a partition.
+     * Runs an effect after acquiring one permit for a partition, then releases the
+     * permit when the effect exits.
+     *
+     * **Details**
+     *
+     * This is the single-permit variant of `withPermits`. The permit is released
+     * even if the wrapped effect fails or is interrupted.
      *
-     * @since 4.0.0
      * @category combinators
+     * @since 4.0.0
      */
     <K, A, E, R>(self: PartitionedSemaphore<K>, key: K, effect: Effect.Effect<A, E, R>): Effect.Effect<A, E, R>;
 };
 /**
- * Runs an effect only if the permits are immediately available.
+ * Runs an effect only when the requested permits can be acquired immediately,
+ * returning the result in `Some`.
+ *
+ * **Details**
+ *
+ * If the permits are not available, the effect is not run and the result is
+ * `None`. When permits are acquired, they are released after the wrapped
+ * effect completes, fails, or is interrupted. Requests for zero or a negative
+ * number of permits run the effect and return `Some`.
  *
- * @since 4.0.0
  * @category combinators
+ * @since 4.0.0
  */
 export declare const withPermitsIfAvailable: {
     /**
-     * Runs an effect only if the permits are immediately available.
+     * Runs an effect only when the requested permits can be acquired immediately,
+     * returning the result in `Some`.
+     *
+     * **Details**
+     *
+     * If the permits are not available, the effect is not run and the result is
+     * `None`. When permits are acquired, they are released after the wrapped
+     * effect completes, fails, or is interrupted. Requests for zero or a negative
+     * number of permits run the effect and return `Some`.
      *
-     * @since 4.0.0
      * @category combinators
+     * @since 4.0.0
      */
     <K>(self: PartitionedSemaphore<K>, permits: number): <A, E, R>(effect: Effect.Effect<A, E, R>) => Effect.Effect<Option.Option<A>, E, R>;
     /**
-     * Runs an effect only if the permits are immediately available.
+     * Runs an effect only when the requested permits can be acquired immediately,
+     * returning the result in `Some`.
+     *
+     * **Details**
+     *
+     * If the permits are not available, the effect is not run and the result is
+     * `None`. When permits are acquired, they are released after the wrapped
+     * effect completes, fails, or is interrupted. Requests for zero or a negative
+     * number of permits run the effect and return `Some`.
      *
-     * @since 4.0.0
      * @category combinators
+     * @since 4.0.0
      */
     <K, A, E, R>(self: PartitionedSemaphore<K>, permits: number, effect: Effect.Effect<A, E, R>): Effect.Effect<Option.Option<A>, E, R>;
 };

package/dist/PartitionedSemaphore.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"PartitionedSemaphore.d.ts","sourceRoot":"","sources":["../src/PartitionedSemaphore.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,OAAO,KAAK,MAAM,MAAM,aAAa,CAAA;AAGrC,OAAO,KAAK,MAAM,MAAM,aAAa,CAAA;AAErC;;;GAGG;AACH,eAAO,MAAM,iBAAiB,EAAE,iBAAkD,CAAA;AAElF;;;GAGG;AACH,MAAM,MAAM,iBAAiB,GAAG,8BAA8B,CAAA;AAE9D;;;;;;;;GAQG;AACH,MAAM,WAAW,oBAAoB,CAAC,EAAE,CAAC,CAAC;IACxC,QAAQ,CAAC,CAAC,iBAAiB,CAAC,EAAE,iBAAiB,CAAA;IAC/C,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;IACzB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;IACzC,QAAQ,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IAC/D,QAAQ,CAAC,OAAO,EAAE,CAAC,OAAO,EAAE,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;IAC5D,QAAQ,CAAC,WAAW,EAAE,CACpB,GAAG,EAAE,CAAC,EACN,OAAO,EAAE,MAAM,KACZ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IACxE,QAAQ,CAAC,UAAU,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IACpG,QAAQ,CAAC,sBAAsB,EAAE,CAC/B,OAAO,EAAE,MAAM,KACZ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;CACxF;AAED;;;GAGG;AACH,MAAM,WAAW,WAAW,CAAC,EAAE,CAAC,CAAC,CAAE,SAAQ,oBAAoB,CAAC,CAAC,CAAC;CAAG;AAErE;;;;;GAKG;AACH,eAAO,MAAM,UAAU,GAAI,CAAC,GAAG,OAAO,EAAE,SAAS;IAC/C,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;CACzB,KAAG,oBAAoB,CAAC,CAAC,CAuLzB,CAAA;AAED;;;;;GAKG;AACH,eAAO,MAAM,IAAI,GAAI,CAAC,GAAG,OAAO,EAAE,SAAS;IACzC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;CACzB,KAAG,MAAM,CAAC,MAAM,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAA8C,CAAA;AAEvF;;;;;GAKG;AACH,eAAO,MAAM,SAAS,GAAI,CAAC,EAAE,MAAM,oBAAoB,CAAC,CAAC,CAAC,KAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAmB,CAAA;AAEpG;;;;;GAKG;AACH,eAAO,MAAM,QAAQ,GAAI,CAAC,EAAE,MAAM,oBAAoB,CAAC,CAAC,CAAC,KAAG,MAAuB,CAAA;AAEnF;;;;;GAKG;AACH,eAAO,MAAM,IAAI,EAAE;IACjB;;;;;OAKG;IACH,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,MAAM,GAAG,CAAC,IAAI,EAAE,oBAAoB,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IACpF;;;;;OAKG;IACH,CAAC,CAAC,EAAE,IAAI,EAAE,oBAAoB,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;CACsC,CAAA;AAExH;;;;;GAKG;AACH,eAAO,MAAM,OAAO,EAAE;IACpB;;;;;OAKG;IACH,CAAC,OAAO,EAAE,MAAM,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,oBAAoB,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;IAC9E;;;;;OAKG;IACH,CAAC,CAAC,EAAE,IAAI,EAAE,oBAAoB,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;CACoC,CAAA;AAEhH;;;;;GAKG;AACH,eAAO,MAAM,WAAW,EAAE;IACxB;;;;;OAKG;IACH,CAAC,CAAC,EAAE,IAAI,EAAE,oBAAoB,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IAChI;;;;;OAKG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EACT,IAAI,EAAE,oBAAoB,CAAC,CAAC,CAAC,EAC7B,GAAG,EAAE,CAAC,EACN,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAC7B,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;CAQlB,CAAA;AAET;;;;;GAKG;AACH,eAAO,MAAM,UAAU,EAAE;IACvB;;;;;OAKG;IACH,CAAC,CAAC,EAAE,IAAI,EAAE,oBAAoB,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IAC/G;;;;;OAKG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,oBAAoB,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;CAQpG,CAAA;AAET;;;;;GAKG;AACH,eAAO,MAAM,sBAAsB,EAAE;IACnC;;;;;OAKG;IACH,CAAC,CAAC,EAAE,IAAI,EAAE,oBAAoB,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IACvI;;;;;OAKG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EACT,IAAI,EAAE,oBAAoB,CAAC,CAAC,CAAC,EAC7B,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAC7B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;CAQjC,CAAA"}
+{"version":3,"file":"PartitionedSemaphore.d.ts","sourceRoot":"","sources":["../src/PartitionedSemaphore.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoCG;AACH,OAAO,KAAK,MAAM,MAAM,aAAa,CAAA;AAGrC,OAAO,KAAK,MAAM,MAAM,aAAa,CAAA;AAErC;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,iBAAiB,EAAE,iBAAkD,CAAA;AAElF;;;;;;;;;;GAUG;AACH,MAAM,MAAM,iBAAiB,GAAG,8BAA8B,CAAA;AAE9D;;;;;;;;GAQG;AACH,MAAM,WAAW,oBAAoB,CAAC,EAAE,CAAC,CAAC;IACxC,QAAQ,CAAC,CAAC,iBAAiB,CAAC,EAAE,iBAAiB,CAAA;IAC/C,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;IACzB,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;IACzC,QAAQ,CAAC,IAAI,EAAE,CAAC,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IAC/D,QAAQ,CAAC,OAAO,EAAE,CAAC,OAAO,EAAE,MAAM,KAAK,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;IAC5D,QAAQ,CAAC,WAAW,EAAE,CACpB,GAAG,EAAE,CAAC,EACN,OAAO,EAAE,MAAM,KACZ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IACxE,QAAQ,CAAC,UAAU,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IACpG,QAAQ,CAAC,sBAAsB,EAAE,CAC/B,OAAO,EAAE,MAAM,KACZ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;CACxF;AAED;;;;;;;;;;;GAWG;AACH,MAAM,WAAW,WAAW,CAAC,EAAE,CAAC,CAAC,CAAE,SAAQ,oBAAoB,CAAC,CAAC,CAAC;CAAG;AAErE;;;;;;;;;;;;;;;;GAgBG;AACH,eAAO,MAAM,UAAU,GAAI,CAAC,GAAG,OAAO,EAAE,SAAS;IAC/C,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;CACzB,KAAG,oBAAoB,CAAC,CAAC,CAuLzB,CAAA;AAED;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,IAAI,GAAI,CAAC,GAAG,OAAO,EAAE,SAAS;IACzC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;CACzB,KAAG,MAAM,CAAC,MAAM,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAA8C,CAAA;AAEvF;;;;;GAKG;AACH,eAAO,MAAM,SAAS,GAAI,CAAC,EAAE,MAAM,oBAAoB,CAAC,CAAC,CAAC,KAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAmB,CAAA;AAEpG;;;;;GAKG;AACH,eAAO,MAAM,QAAQ,GAAI,CAAC,EAAE,MAAM,oBAAoB,CAAC,CAAC,CAAC,KAAG,MAAuB,CAAA;AAEnF;;;;;;;;;;;;;GAaG;AACH,eAAO,MAAM,IAAI,EAAE;IACjB;;;;;;;;;;;;;OAaG;IACH,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,MAAM,GAAG,CAAC,IAAI,EAAE,oBAAoB,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;IACpF;;;;;;;;;;;;;OAaG;IACH,CAAC,CAAC,EAAE,IAAI,EAAE,oBAAoB,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;CACsC,CAAA;AAExH;;;;;;;;;;;;GAYG;AACH,eAAO,MAAM,OAAO,EAAE;IACpB;;;;;;;;;;;;OAYG;IACH,CAAC,OAAO,EAAE,MAAM,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,oBAAoB,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;IAC9E;;;;;;;;;;;;OAYG;IACH,CAAC,CAAC,EAAE,IAAI,EAAE,oBAAoB,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;CACoC,CAAA;AAEhH;;;;;;;;;;;;;GAaG;AACH,eAAO,MAAM,WAAW,EAAE;IACxB;;;;;;;;;;;;;OAaG;IACH,CAAC,CAAC,EAAE,IAAI,EAAE,oBAAoB,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,OAAO,EAAE,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IAChI;;;;;;;;;;;;;OAaG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EACT,IAAI,EAAE,oBAAoB,CAAC,CAAC,CAAC,EAC7B,GAAG,EAAE,CAAC,EACN,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAC7B,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;CAQlB,CAAA;AAET;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,UAAU,EAAE;IACvB;;;;;;;;;;;OAWG;IACH,CAAC,CAAC,EAAE,IAAI,EAAE,oBAAoB,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IAC/G;;;;;;;;;;;OAWG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,oBAAoB,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;CAQpG,CAAA;AAET;;;;;;;;;;;;;GAaG;AACH,eAAO,MAAM,sBAAsB,EAAE;IACnC;;;;;;;;;;;;;OAaG;IACH,CAAC,CAAC,EAAE,IAAI,EAAE,oBAAoB,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;IACvI;;;;;;;;;;;;;OAaG;IACH,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EACT,IAAI,EAAE,oBAAoB,CAAC,CAAC,CAAC,EAC7B,OAAO,EAAE,MAAM,EACf,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAC7B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAA;CAQjC,CAAA"}