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

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

@@ -1,21 +1,21 @@
 /**
  * This module provides utility functions for working with records in TypeScript.
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 import type { Either } from "./Either.js";
 import type { TypeLambda } from "./HKT.js";
 import type { Option } from "./Option.js";
 /**
  * @category models
- * @since 1.0.0
+ * @since 2.0.0
  */
 export interface ReadonlyRecord<A> {
     readonly [x: string]: A;
 }
 /**
  * @category type lambdas
- * @since 1.0.0
+ * @since 2.0.0
  */
 export interface ReadonlyRecordTypeLambda extends TypeLambda {
     readonly type: ReadonlyRecord<this["Target"]>;
@@ -24,7 +24,7 @@ export interface ReadonlyRecordTypeLambda extends TypeLambda {
  * Creates a new, empty record.
  *
  * @category constructors
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const empty: <A>() => Record<string, A>;
 /**
@@ -39,7 +39,7 @@ export declare const empty: <A>() => Record<string, A>;
  * assert.deepStrictEqual(isEmptyRecord({ a: 3 }), false);
  *
  * @category guards
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const isEmptyRecord: <A>(self: Record<string, A>) => self is Record<string, never>;
 /**
@@ -54,7 +54,7 @@ export declare const isEmptyRecord: <A>(self: Record<string, A>) => self is Reco
  * assert.deepStrictEqual(isEmptyReadonlyRecord({ a: 3 }), false);
  *
  * @category guards
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const isEmptyReadonlyRecord: <A>(self: ReadonlyRecord<A>) => self is ReadonlyRecord<never>;
 /**
@@ -75,7 +75,7 @@ export declare const isEmptyReadonlyRecord: <A>(self: ReadonlyRecord<A>) => self
  * )
  *
  * @category conversions
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const fromIterable: {
     <A, B>(f: (a: A) => readonly [string, B]): (self: Iterable<A>) => Record<string, B>;
@@ -97,7 +97,7 @@ export declare const fromIterable: {
  * assert.deepStrictEqual(fromEntries(input), { a: 1, b: 2 })
  *
  * @category conversions
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const fromEntries: <A>(self: Iterable<readonly [string, A]>) => Record<string, A>;
 /**
@@ -113,7 +113,7 @@ export declare const fromEntries: <A>(self: Iterable<readonly [string, A]>) => R
  * assert.deepStrictEqual(collect(x, (key, n) => [key, n]), [["a", 1], ["b", 2], ["c", 3]])
  *
  * @category conversions
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const collect: {
     <K extends string, A, B>(f: (key: K, a: A) => B): (self: Record<K, A>) => Array<B>;
@@ -131,7 +131,7 @@ export declare const collect: {
  * assert.deepStrictEqual(toEntries(x), [["a", 1], ["b", 2], ["c", 3]])
  *
  * @category conversions
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const toEntries: <K extends string, A>(self: Record<K, A>) => Array<[K, A]>;
 /**
@@ -148,7 +148,7 @@ export declare const toEntries: <K extends string, A>(self: Record<K, A>) => Arr
  * assert.deepStrictEqual(toArray(x), [["a", 1], ["b", 2], ["c", 3]])
  *
  * @category conversions
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const toArray: <K extends string, A>(self: Record<K, A>) => Array<[K, A]>;
 /**
@@ -161,7 +161,7 @@ export declare const toArray: <K extends string, A>(self: Record<K, A>) => Array
  *
  * assert.deepStrictEqual(size({ a: "a", b: 1, c: true }), 3);
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const size: <A>(self: ReadonlyRecord<A>) => number;
 /**
@@ -176,7 +176,7 @@ export declare const size: <A>(self: ReadonlyRecord<A>) => number;
  * assert.deepStrictEqual(has({ a: 1, b: 2 }, "a"), true);
  * assert.deepStrictEqual(has({ a: 1, b: 2 }, "c"), false);
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const has: {
     (key: string): <A>(self: ReadonlyRecord<A>) => boolean;
@@ -197,7 +197,7 @@ export declare const has: {
  * assert.deepStrictEqual(get(person, "name"), some("John Doe"))
  * assert.deepStrictEqual(get(person, "email"), none())
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const get: {
     (key: string): <A>(self: ReadonlyRecord<A>) => Option<A>;
@@ -226,7 +226,7 @@ export declare const get: {
  *  none()
  * )
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const modifyOption: {
     <A, B>(key: string, f: (a: A) => B): (self: ReadonlyRecord<A>) => Option<Record<string, A | B>>;
@@ -249,7 +249,7 @@ export declare const modifyOption: {
  * )
  * assert.deepStrictEqual(replaceOption({}, 'a', 10), none())
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const replaceOption: {
     <B>(key: string, b: B): <A>(self: ReadonlyRecord<A>) => Option<Record<string, B | A>>;
@@ -266,7 +266,7 @@ export declare const replaceOption: {
  *
  * assert.deepStrictEqual(remove({ a: 1, b: 2 }, "a"), { b: 2 })
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const remove: {
     (key: string): <A>(self: ReadonlyRecord<A>) => Record<string, A>;
@@ -288,7 +288,7 @@ export declare const remove: {
  * assert.deepStrictEqual(pop({ a: 1, b: 2 }, "c"), none())
  *
  * @category record
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const pop: {
     (key: string): <A>(self: ReadonlyRecord<A>) => Option<readonly [A, ReadonlyRecord<A>]>;
@@ -311,7 +311,7 @@ export declare const pop: {
  *
  * assert.deepStrictEqual(map({ a: 3, b: 5 }, g), { a: "A-3", b: "B-5" })
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const map: {
     <K extends string, A, B>(f: (a: A, key: K) => B): (self: Record<K, A>) => Record<K, B>;
@@ -332,7 +332,7 @@ export declare const map: {
  * const f = (a: number, key: string) => a > 2 ? some(a * 2) : none()
  * assert.deepStrictEqual(filterMap(x, f), { c: 6 })
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const filterMap: {
     <K extends string, A, B>(f: (a: A, key: K) => Option<B>): (self: Record<K, A>) => Record<string, B>;
@@ -351,7 +351,7 @@ export declare const filterMap: {
  * assert.deepStrictEqual(filter(x, (n) => n > 2), { c: 3, d: 4 })
  *
  * @category filtering
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const filter: {
     <K extends string, C extends A, B extends A, A = C>(refinement: (a: A, key: K) => a is B): (self: Record<K, C>) => Record<string, B>;
@@ -374,7 +374,7 @@ export declare const filter: {
  * )
  *
  * @category filtering
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const compact: <A>(self: ReadonlyRecord<Option<A>>) => Record<string, A>;
 /**
@@ -392,7 +392,7 @@ export declare const compact: <A>(self: ReadonlyRecord<Option<A>>) => Record<str
  * assert.deepStrictEqual(partitionMap(x, f), [{ a: 1, c: 3 }, { b: 2}])
  *
  * @category filtering
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const partitionMap: {
     <K extends string, A, B, C>(f: (a: A, key: K) => Either<B, C>): (self: Record<K, A>) => [Record<string, B>, Record<string, C>];
@@ -414,7 +414,7 @@ export declare const partitionMap: {
  * )
  *
  * @category filtering
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const separate: <A, B>(self: ReadonlyRecord<Either<A, B>>) => [Record<string, A>, Record<string, B>];
 /**
@@ -432,7 +432,7 @@ export declare const separate: <A, B>(self: ReadonlyRecord<Either<A, B>>) => [Re
  * )
  *
  * @category filtering
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const partition: {
     <K extends string, C extends A, B extends A, A = C>(refinement: (a: A, key: K) => a is B): (self: Record<K, C>) => [Record<string, C>, Record<string, B>];

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

@@ -1,5 +1,5 @@
 /**
- * @since 1.0.0
+ * @since 2.0.0
  */
 import type { Chunk } from "./Chunk.js";
 import type { Equal } from "./Equal.js";
@@ -9,12 +9,12 @@ import type { Order } from "./Order.js";
 import type { Pipeable } from "./Pipeable.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 constants
  */
 export declare const Direction: {
@@ -24,25 +24,25 @@ export declare const Direction: {
 /**
  * A Red-Black Tree.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category models
  */
 export interface RedBlackTree<Key, Value> extends Iterable<readonly [Key, Value]>, Equal, Pipeable, Inspectable {
     readonly [TypeId]: TypeId;
 }
 /**
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare namespace RedBlackTree {
     /**
-     * @since 1.0.0
+     * @since 2.0.0
      */
     type Direction = number & {
         readonly Direction: unique symbol;
     };
 }
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category refinements
  */
 export declare const isRedBlackTree: {
@@ -52,21 +52,21 @@ export declare const isRedBlackTree: {
 /**
  * Creates an empty `RedBlackTree`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const empty: <K, V = never>(ord: Order<K>) => RedBlackTree<K, V>;
 /**
  * Constructs a new tree from an iterable of key-value pairs.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const fromIterable: <K, V>(ord: Order<K>) => (entries: Iterable<readonly [K, V]>) => RedBlackTree<K, V>;
 /**
  * Constructs a new `RedBlackTree` from the specified entries.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const make: <K>(ord: Order<K>) => <Entries extends Array<readonly [K, any]>>(...entries: Entries) => RedBlackTree<K, Entries[number] extends readonly [any, infer V] ? V : never>;
@@ -76,7 +76,7 @@ export declare const make: <K>(ord: Order<K>) => <Entries extends Array<readonly
  *
  * **Note**: The iterator will run through elements in order.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category traversing
  */
 export declare const at: {
@@ -89,7 +89,7 @@ export declare const at: {
  *
  * **Note**: The iterator will run through elements in reverse order.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category traversing
  */
 export declare const atReversed: {
@@ -99,7 +99,7 @@ export declare const atReversed: {
 /**
  * Finds all values in the tree associated with the specified key.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const findAll: {
@@ -110,7 +110,7 @@ export declare const findAll: {
  * Finds the first value in the tree associated with the specified key, if it exists.
  *
  * @category elements
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const findFirst: {
     <K>(key: K): <V>(self: RedBlackTree<K, V>) => Option<V>;
@@ -119,7 +119,7 @@ export declare const findFirst: {
 /**
  * Returns the first entry in the tree, if it exists.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const first: <K, V>(self: RedBlackTree<K, V>) => Option<readonly [K, V]>;
@@ -127,7 +127,7 @@ export declare const first: <K, V>(self: RedBlackTree<K, V>) => Option<readonly
  * Returns the element at the specified index within the tree or `None` if the
  * specified index does not exist.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const getAt: {
@@ -137,7 +137,7 @@ export declare const getAt: {
 /**
  * Gets the `Order<K>` that the `RedBlackTree<K, V>` is using.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const getOrder: <K, V>(self: RedBlackTree<K, V>) => Order<K>;
@@ -145,7 +145,7 @@ export declare const getOrder: <K, V>(self: RedBlackTree<K, V>) => Order<K>;
  * Returns an iterator that traverse entries in order with keys greater than the
  * specified key.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category traversing
  */
 export declare const greaterThan: {
@@ -156,7 +156,7 @@ export declare const greaterThan: {
  * Returns an iterator that traverse entries in reverse order with keys greater
  * than the specified key.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category traversing
  */
 export declare const greaterThanReversed: {
@@ -167,7 +167,7 @@ export declare const greaterThanReversed: {
  * Returns an iterator that traverse entries in order with keys greater than or
  * equal to the specified key.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category traversing
  */
 export declare const greaterThanEqual: {
@@ -178,7 +178,7 @@ export declare const greaterThanEqual: {
  * Returns an iterator that traverse entries in reverse order with keys greater
  * than or equal to the specified key.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category traversing
  */
 export declare const greaterThanEqualReversed: {
@@ -188,7 +188,7 @@ export declare const greaterThanEqualReversed: {
 /**
  * Finds the item with key, if it exists.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const has: {
@@ -198,7 +198,7 @@ export declare const has: {
 /**
  * Insert a new item into the tree.
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const insert: {
     <K, V>(key: K, value: V): (self: RedBlackTree<K, V>) => RedBlackTree<K, V>;
@@ -207,21 +207,21 @@ export declare const insert: {
 /**
  * Get all the keys present in the tree in order.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const keys: <K, V>(self: RedBlackTree<K, V>) => IterableIterator<K>;
 /**
  * Get all the keys present in the tree in reverse order.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const keysReversed: <K, V>(self: RedBlackTree<K, V>) => IterableIterator<K>;
 /**
  * Returns the last entry in the tree, if it exists.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const last: <K, V>(self: RedBlackTree<K, V>) => Option<readonly [K, V]>;
@@ -229,7 +229,7 @@ export declare const last: <K, V>(self: RedBlackTree<K, V>) => Option<readonly [
  * Returns an iterator that traverse entries in order with keys less than the
  * specified key.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category traversing
  */
 export declare const lessThan: {
@@ -240,7 +240,7 @@ export declare const lessThan: {
  * Returns an iterator that traverse entries in reverse order with keys less
  * than the specified key.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category traversing
  */
 export declare const lessThanReversed: {
@@ -251,7 +251,7 @@ export declare const lessThanReversed: {
  * Returns an iterator that traverse entries in order with keys less than or
  * equal to the specified key.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category traversing
  */
 export declare const lessThanEqual: {
@@ -262,7 +262,7 @@ export declare const lessThanEqual: {
  * Returns an iterator that traverse entries in reverse order with keys less
  * than or equal to the specified key.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category traversing
  */
 export declare const lessThanEqualReversed: {
@@ -272,7 +272,7 @@ export declare const lessThanEqualReversed: {
 /**
  * Execute the specified function for each node of the tree, in order.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category traversing
  */
 export declare const forEach: {
@@ -282,7 +282,7 @@ export declare const forEach: {
 /**
  * Visit each node of the tree in order with key greater then or equal to max.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category traversing
  */
 export declare const forEachGreaterThanEqual: {
@@ -292,7 +292,7 @@ export declare const forEachGreaterThanEqual: {
 /**
  * Visit each node of the tree in order with key lower then max.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category traversing
  */
 export declare const forEachLessThan: {
@@ -303,7 +303,7 @@ export declare const forEachLessThan: {
  * Visit each node of the tree in order with key lower than max and greater
  * than or equal to min.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category traversing
  */
 export declare const forEachBetween: {
@@ -321,7 +321,7 @@ export declare const forEachBetween: {
 /**
  * Reduce a state over the entries of the tree.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category folding
  */
 export declare const reduce: {
@@ -331,7 +331,7 @@ export declare const reduce: {
 /**
  * Removes the entry with the specified key, if it exists.
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const removeFirst: {
     <K>(key: K): <V>(self: RedBlackTree<K, V>) => RedBlackTree<K, V>;
@@ -340,28 +340,28 @@ export declare const removeFirst: {
 /**
  * Traverse the tree in reverse order.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category traversing
  */
 export declare const reversed: <K, V>(self: RedBlackTree<K, V>) => Iterable<readonly [K, V]>;
 /**
  * Returns the size of the tree.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const size: <K, V>(self: RedBlackTree<K, V>) => number;
 /**
  * Get all values present in the tree in order.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const values: <K, V>(self: RedBlackTree<K, V>) => IterableIterator<V>;
 /**
  * Get all values present in the tree in reverse order.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const valuesReversed: <K, V>(self: RedBlackTree<K, V>) => IterableIterator<V>;

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

@@ -1,33 +1,33 @@
 /**
- * @since 1.0.0
+ * @since 2.0.0
  */
 import type * as Effect from "./Effect.js";
 import type * as Option from "./Option.js";
 import type { Pipeable } from "./Pipeable.js";
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category symbols
  */
 export declare const RefTypeId: unique symbol;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category symbols
  */
 export type RefTypeId = typeof RefTypeId;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category models
  */
 export interface Ref<A> extends Ref.Variance<A>, Pipeable {
     modify<B>(f: (a: A) => readonly [B, A]): Effect.Effect<never, never, B>;
 }
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category models
  */
 export declare namespace Ref {
     /**
-     * @since 1.0.0
+     * @since 2.0.0
      */
     interface Variance<A> {
         readonly [RefTypeId]: {
@@ -36,17 +36,17 @@ export declare namespace Ref {
     }
 }
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const make: <A>(value: A) => Effect.Effect<never, never, Ref<A>>;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const get: <A>(self: Ref<A>) => Effect.Effect<never, never, A>;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const getAndSet: {
@@ -54,7 +54,7 @@ export declare const getAndSet: {
     <A>(self: Ref<A>, value: A): Effect.Effect<never, never, A>;
 };
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const getAndUpdate: {
@@ -62,7 +62,7 @@ export declare const getAndUpdate: {
     <A>(self: Ref<A>, f: (a: A) => A): Effect.Effect<never, never, A>;
 };
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const getAndUpdateSome: {
@@ -70,7 +70,7 @@ export declare const getAndUpdateSome: {
     <A>(self: Ref<A>, pf: (a: A) => Option.Option<A>): Effect.Effect<never, never, A>;
 };
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const modify: {
@@ -78,7 +78,7 @@ export declare const modify: {
     <A, B>(self: Ref<A>, f: (a: A) => readonly [B, A]): Effect.Effect<never, never, B>;
 };
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const modifySome: {
@@ -86,7 +86,7 @@ export declare const modifySome: {
     <A, B>(self: Ref<A>, fallback: B, pf: (a: A) => Option.Option<readonly [B, A]>): Effect.Effect<never, never, B>;
 };
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const set: {
@@ -94,7 +94,7 @@ export declare const set: {
     <A>(self: Ref<A>, value: A): Effect.Effect<never, never, void>;
 };
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const setAndGet: {
@@ -102,7 +102,7 @@ export declare const setAndGet: {
     <A>(self: Ref<A>, value: A): Effect.Effect<never, never, A>;
 };
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const update: {
@@ -110,7 +110,7 @@ export declare const update: {
     <A>(self: Ref<A>, f: (a: A) => A): Effect.Effect<never, never, void>;
 };
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const updateAndGet: {
@@ -118,7 +118,7 @@ export declare const updateAndGet: {
     <A>(self: Ref<A>, f: (a: A) => A): Effect.Effect<never, never, A>;
 };
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const updateSome: {
@@ -126,7 +126,7 @@ export declare const updateSome: {
     <A>(self: Ref<A>, f: (a: A) => Option.Option<A>): Effect.Effect<never, never, void>;
 };
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const updateSomeAndGet: {
@@ -134,7 +134,7 @@ export declare const updateSomeAndGet: {
     <A>(self: Ref<A>, pf: (a: A) => Option.Option<A>): Effect.Effect<never, never, A>;
 };
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category unsafe
  */
 export declare const unsafeMake: <A>(value: A) => Ref<A>;