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

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

@@ -2,33 +2,33 @@ import type * as Option from "./Option.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 TDequeueTypeId: unique symbol;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category symbols
  */
 export type TDequeueTypeId = typeof TDequeueTypeId;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category symbols
  */
 export declare const TEnqueueTypeId: unique symbol;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category symbols
  */
 export type TEnqueueTypeId = typeof TEnqueueTypeId;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category models
  */
 export interface TQueue<A> extends TEnqueue<A>, TDequeue<A> {
 }
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category models
  */
 export interface TEnqueue<A> extends TQueue.TEnqueueVariance<A>, BaseTQueue {
@@ -54,7 +54,7 @@ export interface TEnqueue<A> extends TQueue.TEnqueueVariance<A>, BaseTQueue {
     offerAll(iterable: Iterable<A>): STM.STM<never, never, boolean>;
 }
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category models
  */
 export interface TDequeue<A> extends TQueue.TDequeueVariance<A>, BaseTQueue {
@@ -86,7 +86,7 @@ export interface TDequeue<A> extends TQueue.TDequeueVariance<A>, BaseTQueue {
 /**
  * The base interface that all `TQueue`s must implement.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category models
  */
 export interface BaseTQueue {
@@ -126,11 +126,11 @@ export interface BaseTQueue {
     readonly awaitShutdown: STM.STM<never, never, void>;
 }
 /**
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare namespace TQueue {
     /**
-     * @since 1.0.0
+     * @since 2.0.0
      * @category models
      */
     interface TEnqueueVariance<A> {
@@ -139,7 +139,7 @@ export declare namespace TQueue {
         };
     }
     /**
-     * @since 1.0.0
+     * @since 2.0.0
      * @category models
      */
     interface TDequeueVariance<A> {
@@ -151,21 +151,21 @@ export declare namespace TQueue {
 /**
  * Returns `true` if the specified value is a `TQueue`, `false` otherwise.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category refinements
  */
 export declare const isTQueue: (u: unknown) => u is TQueue<unknown>;
 /**
  * Returns `true` if the specified value is a `TDequeue`, `false` otherwise.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category refinements
  */
 export declare const isTDequeue: (u: unknown) => u is TDequeue<unknown>;
 /**
  * Returns `true` if the specified value is a `TEnqueue`, `false` otherwise.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category refinements
  */
 export declare const isTEnqueue: (u: unknown) => u is TEnqueue<unknown>;
@@ -174,7 +174,7 @@ export declare const isTEnqueue: (u: unknown) => u is TEnqueue<unknown>;
  * not resume until the queue has been shutdown. If the queue 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: TQueue<A>) => STM.STM<never, never, void>;
@@ -185,14 +185,14 @@ export declare const awaitShutdown: <A>(self: TQueue<A>) => STM.STM<never, never
  *
  * 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) => STM.STM<never, never, TQueue<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: TQueue<A>) => number;
@@ -202,14 +202,14 @@ export declare const capacity: <A>(self: TQueue<A>) => number;
  *
  * 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) => STM.STM<never, never, TQueue<A>>;
 /**
  * Returns `true` if the `TQueue` contains zero elements, `false` otherwise.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const isEmpty: <A>(self: TQueue<A>) => STM.STM<never, never, boolean>;
@@ -217,21 +217,21 @@ export declare const isEmpty: <A>(self: TQueue<A>) => STM.STM<never, never, bool
  * Returns `true` if the `TQueue` contains at least one element, `false`
  * otherwise.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const isFull: <A>(self: TQueue<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: TQueue<A>) => STM.STM<never, never, boolean>;
 /**
  * Places one value in the queue.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const offer: {
@@ -253,7 +253,7 @@ export declare const offer: {
  * For Dropping TQueue: uses `Dropping` Strategy, It places the values in the
  * queue but if there is no room it will not enqueue them and return false.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const offerAll: {
@@ -264,7 +264,7 @@ export declare const offerAll: {
  * Views the next element in the queue without removing it, retrying if the
  * queue is empty.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const peek: <A>(self: TDequeue<A>) => STM.STM<never, never, A>;
@@ -272,7 +272,7 @@ export declare const peek: <A>(self: TDequeue<A>) => STM.STM<never, never, A>;
  * Views the next element in the queue without removing it, returning `None`
  * if the queue is empty.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const peekOption: <A>(self: TDequeue<A>) => STM.STM<never, never, Option.Option<A>>;
@@ -280,7 +280,7 @@ export declare const peekOption: <A>(self: TDequeue<A>) => STM.STM<never, never,
  * Takes a single element from the queue, returning `None` if the queue is
  * empty.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const poll: <A>(self: TDequeue<A>) => STM.STM<never, never, Option.Option<A>>;
@@ -289,7 +289,7 @@ export declare const poll: <A>(self: TDequeue<A>) => STM.STM<never, never, Optio
  * taking and returning the first element that does satisfy the predicate.
  * Retries if no elements satisfy the predicate.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const seek: {
@@ -300,7 +300,7 @@ export declare const seek: {
  * 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 mutations
  */
 export declare const shutdown: <A>(self: TQueue<A>) => STM.STM<never, never, void>;
@@ -309,7 +309,7 @@ export declare const shutdown: <A>(self: TQueue<A>) => STM.STM<never, never, voi
  * 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: TQueue<A>) => STM.STM<never, never, number>;
@@ -319,7 +319,7 @@ export declare const size: <A>(self: TQueue<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, TQueue<A>>;
@@ -327,7 +327,7 @@ export declare const sliding: <A>(requestedCapacity: number) => STM.STM<never, n
  * Takes the oldest value in the queue. If the queue is empty, this will return
  * a computation that resumes when an item has been added to the queue.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const take: <A>(self: TDequeue<A>) => STM.STM<never, never, A>;
@@ -335,7 +335,7 @@ export declare const take: <A>(self: TDequeue<A>) => STM.STM<never, never, A>;
  * Takes all the values in the queue and returns the values. If the queue is
  * empty returns an empty collection.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const takeAll: <A>(self: TDequeue<A>) => STM.STM<never, never, Array<A>>;
@@ -344,7 +344,7 @@ export declare const takeAll: <A>(self: TDequeue<A>) => STM.STM<never, never, Ar
  * maximum. If there are fewer than the minimum number of elements available,
  * retries until at least the minimum number of elements have been collected.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const takeBetween: {
@@ -356,7 +356,7 @@ export declare const takeBetween: {
  * than the specified number of elements available, it retries until they
  * become available.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const takeN: {
@@ -366,7 +366,7 @@ export declare const takeN: {
 /**
  * Takes up to max number of values from the queue.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const takeUpTo: {
@@ -376,7 +376,7 @@ export declare const takeUpTo: {
 /**
  * Creates an unbounded queue.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const unbounded: <A>() => STM.STM<never, never, TQueue<A>>;

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

@@ -1,21 +1,21 @@
 /**
- * @since 1.0.0
+ * @since 2.0.0
  */
 import type * as Context from "./Context.js";
 import type * as Layer from "./Layer.js";
 import type * as STM from "./STM.js";
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category symbols
  */
 export declare const TRandomTypeId: unique symbol;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category symbols
  */
 export type TRandomTypeId = typeof TRandomTypeId;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category models
  */
 export interface TRandom {
@@ -50,35 +50,35 @@ export interface TRandom {
 /**
  * The service tag used to access `TRandom` in the environment of an effect.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category context
  */
 export declare const Tag: Context.Tag<TRandom, TRandom>;
 /**
  * The "live" `TRandom` service wrapped into a `Layer`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category context
  */
 export declare const live: Layer.Layer<never, never, TRandom>;
 /**
  * Returns the next number from the pseudo-random number generator.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category random
  */
 export declare const next: STM.STM<TRandom, never, number>;
 /**
  * Returns the next boolean value from the pseudo-random number generator.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category random
  */
 export declare const nextBoolean: STM.STM<TRandom, never, boolean>;
 /**
  * Returns the next integer from the pseudo-random number generator.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category random
  */
 export declare const nextInt: STM.STM<TRandom, never, number>;
@@ -86,7 +86,7 @@ export declare const nextInt: STM.STM<TRandom, never, number>;
  * Returns the next integer in the specified range from the pseudo-random number
  * generator.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category random
  */
 export declare const nextIntBetween: (low: number, high: number) => STM.STM<TRandom, never, number>;
@@ -94,14 +94,14 @@ export declare const nextIntBetween: (low: number, high: number) => STM.STM<TRan
  * Returns the next number in the specified range from the pseudo-random number
  * generator.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category random
  */
 export declare const nextRange: (min: number, max: number) => STM.STM<TRandom, never, number>;
 /**
  * Uses the pseudo-random number generator to shuffle the specified iterable.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category random
  */
 export declare const shuffle: <A>(elements: Iterable<A>) => STM.STM<TRandom, never, Array<A>>;

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

@@ -1,16 +1,16 @@
 /**
- * @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";
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category symbols
  */
 export declare const TReentrantLockTypeId: unique symbol;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category symbols
  */
 export type TReentrantLockTypeId = typeof TReentrantLockTypeId;
@@ -30,17 +30,17 @@ export type TReentrantLockTypeId = typeof TReentrantLockTypeId;
  * allows this structure to be composed into more complicated concurrent
  * structures that are consumed from effectful code.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category models
  */
 export interface TReentrantLock extends TReentrantLock.Proto {
 }
 /**
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare namespace TReentrantLock {
     /**
-     * @since 1.0.0
+     * @since 2.0.0
      * @category models
      */
     interface Proto {
@@ -52,7 +52,7 @@ export declare namespace TReentrantLock {
  * holding a write lock. Succeeds with the number of read locks held by this
  * fiber.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const acquireRead: (self: TReentrantLock) => STM.STM<never, never, number>;
@@ -61,21 +61,21 @@ export declare const acquireRead: (self: TReentrantLock) => STM.STM<never, never
  * are holding read or write locks. Succeeds with the number of write locks
  * held by this fiber.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const acquireWrite: (self: TReentrantLock) => STM.STM<never, never, number>;
 /**
  * Retrieves the number of acquired read locks for this fiber.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const fiberReadLocks: (self: TReentrantLock) => STM.STM<never, never, number>;
 /**
  * Retrieves the number of acquired write locks for this fiber.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const fiberWriteLocks: (self: TReentrantLock) => STM.STM<never, never, number>;
@@ -85,42 +85,42 @@ export declare const fiberWriteLocks: (self: TReentrantLock) => STM.STM<never, n
  *
  * See `TReentrantLock.writeLock`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const lock: (self: TReentrantLock) => Effect.Effect<Scope.Scope, never, number>;
 /**
  * Determines if any fiber has a read or write lock.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const locked: (self: TReentrantLock) => STM.STM<never, never, boolean>;
 /**
  * Makes a new reentrant read/write lock.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const make: STM.STM<never, never, TReentrantLock>;
 /**
  * Obtains a read lock in a scoped context.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const readLock: (self: TReentrantLock) => Effect.Effect<Scope.Scope, never, number>;
 /**
  * Retrieves the total number of acquired read locks.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const readLocks: (self: TReentrantLock) => STM.STM<never, never, number>;
 /**
  * Determines if any fiber has a read lock.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const readLocked: (self: TReentrantLock) => STM.STM<never, never, boolean>;
@@ -128,7 +128,7 @@ export declare const readLocked: (self: TReentrantLock) => STM.STM<never, never,
  * Releases a read lock held by this fiber. Succeeds with the outstanding
  * number of read locks held by this fiber.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const releaseRead: (self: TReentrantLock) => STM.STM<never, never, number>;
@@ -136,14 +136,14 @@ export declare const releaseRead: (self: TReentrantLock) => STM.STM<never, never
  * Releases a write lock held by this fiber. Succeeds with the outstanding
  * number of write locks held by this fiber.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const releaseWrite: (self: TReentrantLock) => STM.STM<never, never, number>;
 /**
  * Runs the specified workflow with a lock.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const withLock: {
@@ -153,7 +153,7 @@ export declare const withLock: {
 /**
  * Runs the specified workflow with a read lock.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const withReadLock: {
@@ -163,7 +163,7 @@ export declare const withReadLock: {
 /**
  * Runs the specified workflow with a write lock.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const withWriteLock: {
@@ -173,21 +173,21 @@ export declare const withWriteLock: {
 /**
  * Obtains a write lock in a scoped context.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const writeLock: (self: TReentrantLock) => Effect.Effect<Scope.Scope, never, number>;
 /**
  * Determines if a write lock is held by some fiber.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const writeLocked: (self: TReentrantLock) => STM.STM<never, never, boolean>;
 /**
  * Computes the number of write locks held by fibers.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mutations
  */
 export declare const writeLocks: (self: TReentrantLock) => STM.STM<never, never, number>;