effect 2.0.0-next.37 → 2.0.0-next.39

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

@@ -3,27 +3,27 @@ import type * as Order from "./Order.js";
 import type { Predicate } from "./Predicate.js";
 import type * as STM from "./STM.js";
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category symbols
  */
 export declare const TArrayTypeId: unique symbol;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category symbols
  */
 export type TArrayTypeId = typeof TArrayTypeId;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category models
  */
 export interface TArray<A> extends TArray.Variance<A> {
 }
 /**
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare namespace TArray {
     /**
-     * @since 1.0.0
+     * @since 2.0.0
      * @category models
      */
     interface Variance<A> {
@@ -36,7 +36,7 @@ export declare namespace TArray {
  * Finds the result of applying a partial function to the first value in its
  * domain.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const collectFirst: {
@@ -47,7 +47,7 @@ export declare const collectFirst: {
  * Finds the result of applying an transactional partial function to the first
  * value in its domain.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const collectFirstSTM: {
@@ -58,7 +58,7 @@ export declare const collectFirstSTM: {
  * Determine if the array contains a specified value.
  *
  * @macro trace
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const contains: {
@@ -69,7 +69,7 @@ export declare const contains: {
  * Count the values in the array matching a predicate.
  *
  * @macro trace
- * @since 1.0.0
+ * @since 2.0.0
  * @category folding
  */
 export declare const count: {
@@ -80,7 +80,7 @@ export declare const count: {
  * Count the values in the array matching a transactional predicate.
  *
  * @macro trace
- * @since 1.0.0
+ * @since 2.0.0
  * @category folding
  */
 export declare const countSTM: {
@@ -90,7 +90,7 @@ export declare const countSTM: {
 /**
  * Makes an empty `TArray`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const empty: <A>() => STM.STM<never, never, TArray<A>>;
@@ -98,7 +98,7 @@ export declare const empty: <A>() => STM.STM<never, never, TArray<A>>;
  * Atomically evaluate the conjunction of a predicate across the members of
  * the array.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const every: {
@@ -109,7 +109,7 @@ export declare const every: {
  * Atomically evaluate the conjunction of a transactional predicate across the
  * members of the array.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const everySTM: {
@@ -119,7 +119,7 @@ export declare const everySTM: {
 /**
  * Find the first element in the array matching the specified predicate.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const findFirst: {
@@ -129,7 +129,7 @@ export declare const findFirst: {
 /**
  * Get the first index of a specific value in the array.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const findFirstIndex: {
@@ -140,7 +140,7 @@ export declare const findFirstIndex: {
  * Get the first index of a specific value in the array starting from the
  * specified index.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const findFirstIndexFrom: {
@@ -150,7 +150,7 @@ export declare const findFirstIndexFrom: {
 /**
  * Get the index of the first entry in the array matching a predicate.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const findFirstIndexWhere: {
@@ -161,7 +161,7 @@ export declare const findFirstIndexWhere: {
  * Get the index of the first entry in the array starting from the specified
  * index, matching a predicate.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const findFirstIndexWhereFrom: {
@@ -171,7 +171,7 @@ export declare const findFirstIndexWhereFrom: {
 /**
  * Get the index of the next entry that matches a transactional predicate.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const findFirstIndexWhereSTM: {
@@ -182,7 +182,7 @@ export declare const findFirstIndexWhereSTM: {
  * Starting at specified index, get the index of the next entry that matches a
  * transactional predicate.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const findFirstIndexWhereFromSTM: {
@@ -192,7 +192,7 @@ export declare const findFirstIndexWhereFromSTM: {
 /**
  * Find the first element in the array matching a transactional predicate.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const findFirstSTM: {
@@ -202,7 +202,7 @@ export declare const findFirstSTM: {
 /**
  * Find the last element in the array matching a predicate.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const findLast: {
@@ -213,7 +213,7 @@ export declare const findLast: {
  * Get the last index of a specific value in the array bounded above by a
  * specific index.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const findLastIndex: {
@@ -224,7 +224,7 @@ export declare const findLastIndex: {
  * Get the last index of a specific value in the array bounded above by a
  * specific index.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const findLastIndexFrom: {
@@ -234,7 +234,7 @@ export declare const findLastIndexFrom: {
 /**
  * Find the last element in the array matching a transactional predicate.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const findLastSTM: {
@@ -244,7 +244,7 @@ export declare const findLastSTM: {
 /**
  * Atomically performs transactional effect for each item in array.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const forEach: {
@@ -254,14 +254,14 @@ export declare const forEach: {
 /**
  * Makes a new `TArray` initialized with provided iterable.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const fromIterable: <A>(iterable: Iterable<A>) => STM.STM<never, never, TArray<A>>;
 /**
  * Extracts value from ref in array.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const get: {
@@ -271,28 +271,28 @@ export declare const get: {
 /**
  * The first entry of the array, if it exists.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const headOption: <A>(self: TArray<A>) => STM.STM<never, never, Option.Option<A>>;
 /**
  * The last entry in the array, if it exists.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const lastOption: <A>(self: TArray<A>) => STM.STM<never, never, Option.Option<A>>;
 /**
  * Makes a new `TArray` that is initialized with specified values.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const make: <Elements extends [any, ...Array<any>]>(...elements: Elements) => STM.STM<never, never, TArray<Elements[number]>>;
 /**
  * Atomically compute the greatest element in the array, if it exists.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const maxOption: {
@@ -302,7 +302,7 @@ export declare const maxOption: {
 /**
  * Atomically compute the least element in the array, if it exists.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const minOption: {
@@ -312,7 +312,7 @@ export declare const minOption: {
 /**
  * Atomically folds using a pure function.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category folding
  */
 export declare const reduce: {
@@ -322,7 +322,7 @@ export declare const reduce: {
 /**
  * Atomically reduce the array, if non-empty, by a binary operator.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const reduceOption: {
@@ -333,7 +333,7 @@ export declare const reduceOption: {
  * Atomically reduce the non-empty array using a transactional binary
  * operator.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const reduceOptionSTM: {
@@ -344,7 +344,7 @@ export declare const reduceOptionSTM: {
  * Atomically folds using a transactional function.
  *
  * @macro trace
- * @since 1.0.0
+ * @since 2.0.0
  * @category folding
  */
 export declare const reduceSTM: {
@@ -354,14 +354,14 @@ export declare const reduceSTM: {
 /**
  * Returns the size of the `TArray`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const size: <A>(self: TArray<A>) => number;
 /**
  * Determine if the array contains a value satisfying a predicate.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const some: {
@@ -372,7 +372,7 @@ export declare const some: {
  * Determine if the array contains a value satisfying a transactional
  * predicate.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const someSTM: {
@@ -382,15 +382,15 @@ export declare const someSTM: {
 /**
  * Collects all elements into a chunk.
  *
- * @since 1.0.0
- * @since 1.0.0
+ * @since 2.0.0
+ * @since 2.0.0
  * @category destructors
  */
 export declare const toArray: <A>(self: TArray<A>) => STM.STM<never, never, Array<A>>;
 /**
  * Atomically updates all elements using a pure function.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const transform: {
@@ -400,7 +400,7 @@ export declare const transform: {
 /**
  * Atomically updates all elements using a transactional effect.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const transformSTM: {
@@ -410,7 +410,7 @@ export declare const transformSTM: {
 /**
  * Updates element in the array with given function.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const update: {
@@ -420,7 +420,7 @@ export declare const update: {
 /**
  * Atomically updates element in the array with given transactional effect.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const updateSTM: {

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

@@ -1,31 +1,31 @@
 /**
- * @since 1.0.0
+ * @since 2.0.0
  */
 import type * as Either from "./Either.js";
 import type * as Option from "./Option.js";
 import type * as STM from "./STM.js";
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category symbols
  */
 export declare const TDeferredTypeId: unique symbol;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category symbols
  */
 export type TDeferredTypeId = typeof TDeferredTypeId;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category models
  */
 export interface TDeferred<E, A> extends TDeferred.Variance<E, A> {
 }
 /**
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare namespace TDeferred {
     /**
-     * @since 1.0.0
+     * @since 2.0.0
      * @category models
      */
     interface Variance<E, A> {
@@ -38,12 +38,12 @@ export declare namespace TDeferred {
 declare const _await: <E, A>(self: TDeferred<E, A>) => STM.STM<never, E, A>;
 export { 
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 _await as await };
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const done: {
@@ -51,7 +51,7 @@ export declare const done: {
     <E, A>(self: TDeferred<E, A>, either: Either.Either<E, A>): STM.STM<never, never, boolean>;
 };
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const fail: {
@@ -59,17 +59,17 @@ export declare const fail: {
     <E, A>(self: TDeferred<E, A>, error: E): STM.STM<never, never, boolean>;
 };
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const make: <E, A>() => STM.STM<never, never, TDeferred<E, A>>;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const poll: <E, A>(self: TDeferred<E, A>) => STM.STM<never, never, Option.Option<Either.Either<E, A>>>;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const succeed: {

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

@@ -1,22 +1,22 @@
 /**
- * @since 1.0.0
+ * @since 2.0.0
  */
 import type * as Effect from "./Effect.js";
 import type * as Scope from "./Scope.js";
 import type * as STM from "./STM.js";
 import type * as TQueue from "./TQueue.js";
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category symbols
  */
 export declare const THubTypeId: unique symbol;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category symbols
  */
 export type THubTypeId = typeof THubTypeId;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category models
  */
 export interface THub<A> extends TQueue.TEnqueue<A> {
@@ -26,7 +26,7 @@ export interface THub<A> extends TQueue.TEnqueue<A> {
  * not resume until the queue has been shutdown. If the hub is already
  * shutdown, the `STM` will resume right away.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const awaitShutdown: <A>(self: THub<A>) => STM.STM<never, never, void>;
@@ -35,14 +35,14 @@ export declare const awaitShutdown: <A>(self: THub<A>) => STM.STM<never, never,
  * messages until they have been taken by all subscribers, applying back
  * pressure to publishers if the hub is at capacity.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const bounded: <A>(requestedCapacity: number) => STM.STM<never, never, THub<A>>;
 /**
  * Returns the number of elements the hub can hold.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const capacity: <A>(self: THub<A>) => number;
@@ -50,14 +50,14 @@ export declare const capacity: <A>(self: THub<A>) => number;
  * Creates a bounded hub with the dropping strategy. The hub will drop new
  * messages if the hub is at capacity.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const dropping: <A>(requestedCapacity: number) => STM.STM<never, never, THub<A>>;
 /**
  * Returns `true` if the `THub` contains zero elements, `false` otherwise.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const isEmpty: <A>(self: THub<A>) => STM.STM<never, never, boolean>;
@@ -65,14 +65,14 @@ export declare const isEmpty: <A>(self: THub<A>) => STM.STM<never, never, boolea
  * Returns `true` if the `THub` contains at least one element, `false`
  * otherwise.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const isFull: <A>(self: THub<A>) => STM.STM<never, never, boolean>;
 /**
  * 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: THub<A>) => STM.STM<never, never, boolean>;
@@ -80,7 +80,7 @@ export declare const isShutdown: <A>(self: THub<A>) => STM.STM<never, never, boo
  * Publishes a message to the hub, returning whether the message was published
  * to the hub.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const publish: {
@@ -91,7 +91,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 mutations
  */
 export declare const publishAll: {
@@ -103,7 +103,7 @@ export declare const publishAll: {
  * in the hub. This may be negative if fibers are suspended waiting for
  * elements to be added to the hub.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const size: <A>(self: THub<A>) => STM.STM<never, never, number>;
@@ -113,7 +113,7 @@ export declare const size: <A>(self: THub<A>) => STM.STM<never, never, number>;
  *
  * 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) => STM.STM<never, never, THub<A>>;
@@ -123,7 +123,7 @@ export declare const sliding: <A>(requestedCapacity: number) => STM.STM<never, n
  * caller is responsible for unsubscribing from the hub by shutting down the
  * queue.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const subscribe: <A>(self: THub<A>) => STM.STM<never, never, TQueue.TDequeue<A>>;
@@ -132,14 +132,14 @@ export declare const subscribe: <A>(self: THub<A>) => STM.STM<never, never, TQue
  * 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 mutations
  */
 export declare const subscribeScoped: <A>(self: THub<A>) => Effect.Effect<Scope.Scope, never, TQueue.TDequeue<A>>;
 /**
  * Creates an unbounded hub.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const unbounded: <A>() => STM.STM<never, never, THub<A>>;