effect 2.0.0-next.37 → 2.0.0-next.38

package/dist/declarations/src/HashSet.d.ts

@@ -1,5 +1,5 @@
 /**
- * @since 1.0.0
+ * @since 2.0.0
  */
 import type { Equal } from "./Equal.js";
 import type { Inspectable } from "./Inspectable.js";
@@ -7,19 +7,19 @@ import type { Pipeable } from "./Pipeable.js";
 import type { Predicate, Refinement } from "./Predicate.js";
 declare const TypeId: unique symbol;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category symbol
  */
 export type TypeId = typeof TypeId;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category models
  */
 export interface HashSet<A> extends Iterable<A>, Equal, Pipeable, Inspectable {
     readonly [TypeId]: TypeId;
 }
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category refinements
  */
 export declare const isHashSet: {
@@ -29,28 +29,28 @@ export declare const isHashSet: {
 /**
  * Creates an empty `HashSet`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const empty: <A = never>() => HashSet<A>;
 /**
  * Construct a new `HashSet` from a `Collection` of values
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const fromIterable: <A>(elements: Iterable<A>) => HashSet<A>;
 /**
  * Construct a new `HashSet` from a variable number of values.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const make: <As extends ReadonlyArray<any>>(...elements: As) => HashSet<As[number]>;
 /**
  * Checks if the specified value exists in the `HashSet`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const has: {
@@ -60,7 +60,7 @@ export declare const has: {
 /**
  * Check if a predicate holds true for some `HashSet` element.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const some: {
@@ -70,7 +70,7 @@ export declare const some: {
 /**
  * Check if a predicate holds true for every `HashSet` element.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const every: {
@@ -85,7 +85,7 @@ export declare const every: {
  *
  * **NOTE**: the hash and equal of both sets must be the same.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const isSubset: {
@@ -95,33 +95,33 @@ export declare const isSubset: {
 /**
  * Returns an `IterableIterator` of the values in the `HashSet`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const values: <A>(self: HashSet<A>) => IterableIterator<A>;
 /**
  * Calculates the number of values in the `HashSet`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const size: <A>(self: HashSet<A>) => number;
 /**
  * Marks the `HashSet` as mutable.
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const beginMutation: <A>(self: HashSet<A>) => HashSet<A>;
 /**
  * Marks the `HashSet` as immutable.
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const endMutation: <A>(self: HashSet<A>) => HashSet<A>;
 /**
  * Mutates the `HashSet` within the context of the provided function.
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const mutate: {
     <A>(f: (set: HashSet<A>) => void): (self: HashSet<A>) => HashSet<A>;
@@ -130,7 +130,7 @@ export declare const mutate: {
 /**
  * Adds a value to the `HashSet`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const add: {
     <A>(value: A): (self: HashSet<A>) => HashSet<A>;
@@ -139,7 +139,7 @@ export declare const add: {
 /**
  * Removes a value from the `HashSet`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const remove: {
     <A>(value: A): (self: HashSet<A>) => HashSet<A>;
@@ -152,7 +152,7 @@ export declare const remove: {
  * **NOTE**: the hash and equal of the values in both the set and the iterable
  * must be the same.
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const difference: {
     <A>(that: Iterable<A>): (self: HashSet<A>) => HashSet<A>;
@@ -165,7 +165,7 @@ export declare const difference: {
  * **NOTE**: the hash and equal of the values in both the set and the iterable
  * must be the same.
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const intersection: {
     <A>(that: Iterable<A>): (self: HashSet<A>) => HashSet<A>;
@@ -178,7 +178,7 @@ export declare const intersection: {
  * **NOTE**: the hash and equal of the values in both the set and the iterable
  * must be the same.
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const union: {
     <A>(that: Iterable<A>): (self: HashSet<A>) => HashSet<A>;
@@ -189,7 +189,7 @@ export declare const union: {
  * will be removed from the `HashSet`, otherwise the value will be added to the
  * `HashSet`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const toggle: {
     <A>(value: A): (self: HashSet<A>) => HashSet<A>;
@@ -198,7 +198,7 @@ export declare const toggle: {
 /**
  * Maps over the values of the `HashSet` using the specified function.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mapping
  */
 export declare const map: {
@@ -208,7 +208,7 @@ export declare const map: {
 /**
  * Chains over the values of the `HashSet` using the specified function.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category sequencing
  */
 export declare const flatMap: {
@@ -218,7 +218,7 @@ export declare const flatMap: {
 /**
  * Applies the specified function to the values of the `HashSet`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category traversing
  */
 export declare const forEach: {
@@ -228,7 +228,7 @@ export declare const forEach: {
 /**
  * Reduces the specified state over the values of the `HashSet`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category folding
  */
 export declare const reduce: {
@@ -238,7 +238,7 @@ export declare const reduce: {
 /**
  * Filters values out of a `HashSet` using the specified predicate.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category filtering
  */
 export declare const filter: {
@@ -254,7 +254,7 @@ export declare const filter: {
  * right side of the resulting `Tuple`, otherwise the value will be placed into
  * the left side.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category partitioning
  */
 export declare const partition: {

package/dist/declarations/src/Hub.d.ts

@@ -1,5 +1,5 @@
 /**
- * @since 1.0.0
+ * @since 2.0.0
  */
 import type * as Effect from "./Effect.js";
 import type { Pipeable } from "./Pipeable.js";
@@ -10,7 +10,7 @@ import type * as Scope from "./Scope.js";
  * messages of type `A` and subscribers can subscribe to take messages of type
  * `A`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category models
  */
 export interface Hub<A> extends Queue.Enqueue<A>, Pipeable {
@@ -38,7 +38,7 @@ export interface Hub<A> extends Queue.Enqueue<A>, Pipeable {
  *
  * For best performance use capacities that are powers of two.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const bounded: <A>(requestedCapacity: number) => Effect.Effect<never, never, Hub<A>>;
@@ -48,7 +48,7 @@ export declare const bounded: <A>(requestedCapacity: number) => Effect.Effect<ne
  *
  * For best performance use capacities that are powers of two.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const dropping: <A>(requestedCapacity: number) => Effect.Effect<never, never, Hub<A>>;
@@ -58,21 +58,21 @@ export declare const dropping: <A>(requestedCapacity: number) => Effect.Effect<n
  *
  * For best performance use capacities that are powers of two.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const sliding: <A>(requestedCapacity: number) => Effect.Effect<never, never, Hub<A>>;
 /**
  * Creates an unbounded hub.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const unbounded: <A>() => Effect.Effect<never, never, Hub<A>>;
 /**
  *  Returns the number of elements the queue can hold.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const capacity: <A>(self: Hub<A>) => number;
@@ -81,7 +81,7 @@ export declare const capacity: <A>(self: Hub<A>) => number;
  * in the queue. This may be negative if fibers are suspended waiting for
  * elements to be added to the queue.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const size: <A>(self: Hub<A>) => Effect.Effect<never, never, number>;
@@ -89,14 +89,14 @@ export declare const size: <A>(self: Hub<A>) => Effect.Effect<never, never, numb
  * Returns `true` if the `Queue` contains at least one element, `false`
  * otherwise.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const isFull: <A>(self: Hub<A>) => Effect.Effect<never, never, boolean>;
 /**
  * Returns `true` if the `Queue` contains zero elements, `false` otherwise.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const isEmpty: <A>(self: Hub<A>) => Effect.Effect<never, never, boolean>;
@@ -104,14 +104,14 @@ export declare const isEmpty: <A>(self: Hub<A>) => Effect.Effect<never, never, b
  * Interrupts any fibers that are suspended on `offer` or `take`. Future calls
  * to `offer*` and `take*` will be interrupted immediately.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const shutdown: <A>(self: Hub<A>) => Effect.Effect<never, never, void>;
 /**
  * Returns `true` if `shutdown` has been called, otherwise returns `false`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const isShutdown: <A>(self: Hub<A>) => Effect.Effect<never, never, boolean>;
@@ -120,7 +120,7 @@ export declare const isShutdown: <A>(self: Hub<A>) => Effect.Effect<never, never
  * not resume until the queue has been shutdown. If the queue is already
  * shutdown, the `Effect` will resume right away.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const awaitShutdown: <A>(self: Hub<A>) => Effect.Effect<never, never, void>;
@@ -128,7 +128,7 @@ export declare const awaitShutdown: <A>(self: Hub<A>) => Effect.Effect<never, ne
  * Publishes a message to the hub, returning whether the message was published
  * to the hub.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const publish: {
@@ -139,7 +139,7 @@ export declare const publish: {
  * Publishes all of the specified messages to the hub, returning whether they
  * were published to the hub.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const publishAll: {
@@ -151,7 +151,7 @@ export declare const publishAll: {
  * be evaluated multiple times within the scope to take a message from the hub
  * each time.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const subscribe: <A>(self: Hub<A>) => Effect.Effect<Scope.Scope, never, Queue.Dequeue<A>>;

package/dist/declarations/src/Inspectable.d.ts

@@ -1,18 +1,18 @@
 /**
- * @since 1.0.0
+ * @since 2.0.0
  */
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category symbols
  */
 export declare const NodeInspectSymbol: unique symbol;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category symbols
  */
 export type NodeInspectSymbol = typeof NodeInspectSymbol;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category models
  */
 export interface Inspectable {
@@ -21,11 +21,11 @@ export interface Inspectable {
     readonly [NodeInspectSymbol]: () => unknown;
 }
 /**
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const toJSON: (x: unknown) => unknown;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const toString: (x: unknown) => string;
 //# sourceMappingURL=Inspectable.d.ts.map

package/dist/declarations/src/KeyedPool.d.ts

@@ -1,17 +1,17 @@
 /**
- * @since 1.0.0
+ * @since 2.0.0
  */
 import type * as Duration from "./Duration.js";
 import type * as Effect from "./Effect.js";
 import type { Pipeable } from "./Pipeable.js";
 import type * as Scope from "./Scope.js";
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category symbols
  */
 export declare const KeyedPoolTypeId: unique symbol;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category symbols
  */
 export type KeyedPoolTypeId = typeof KeyedPoolTypeId;
@@ -19,7 +19,7 @@ export type KeyedPoolTypeId = typeof KeyedPoolTypeId;
  * A `KeyedPool<K, E, A>` is a pool of `Pool`s of items of type `A`. Each pool
  * in the `KeyedPool` is associated with a key of type `K`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category models
  */
 export interface KeyedPool<K, E, A> extends KeyedPool.Variance<K, E, A>, Pipeable {
@@ -38,11 +38,11 @@ export interface KeyedPool<K, E, A> extends KeyedPool.Variance<K, E, A>, Pipeabl
     invalidate(item: A): Effect.Effect<never, never, void>;
 }
 /**
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare namespace KeyedPool {
     /**
-     * @since 1.0.0
+     * @since 2.0.0
      * @category models
      */
     interface Variance<K, E, A> {
@@ -59,7 +59,7 @@ export declare namespace KeyedPool {
  * because the `Scope` is closed, the individual items allocated by the pool
  * will be released in some unspecified order.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const make: <K, R, E, A>(options: {
@@ -74,7 +74,7 @@ export declare const make: <K, R, E, A>(options: {
  *
  * The size of the underlying pools can be configured per key.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const makeWith: <K, R, E, A>(options: {
@@ -91,7 +91,7 @@ export declare const makeWith: <K, R, E, A>(options: {
  *
  * The size of the underlying pools can be configured per key.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const makeWithTTL: <K, R, E, A>(options: {
@@ -110,7 +110,7 @@ export declare const makeWithTTL: <K, R, E, A>(options: {
  *
  * The size of the underlying pools can be configured per key.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const makeWithTTLBy: <K, R, E, A>(options: {
@@ -125,7 +125,7 @@ export declare const makeWithTTLBy: <K, R, E, A>(options: {
  * for that same reason. Retrying a failed acquisition attempt will repeat the
  * acquisition attempt.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category combinators
  */
 export declare const get: {
@@ -137,7 +137,7 @@ export declare const get: {
  * reallocate the item, although this reallocation may occur lazily rather
  * than eagerly.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category combinators
  */
 export declare const invalidate: {