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

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

@@ -1,10 +1,10 @@
 /**
- * @since 1.0.0
+ * @since 2.0.0
  */
 import type { TypeLambda } from "./HKT.js";
 /**
  * @category type lambdas
- * @since 1.0.0
+ * @since 2.0.0
  */
 export interface FunctionTypeLambda extends TypeLambda {
     readonly type: (a: this["In"]) => this["Target"];
@@ -21,7 +21,7 @@ export interface FunctionTypeLambda extends TypeLambda {
  * assert.deepStrictEqual(isFunction("function"), false)
  *
  * @category guards
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const isFunction: (input: unknown) => input is Function;
 /**
@@ -63,7 +63,7 @@ export declare const isFunction: (input: unknown) => input is Function;
  * assert.deepStrictEqual(sum(2, 3), 5)
  * assert.deepStrictEqual(pipe(2, sum(3)), 5)
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const dual: {
     <DataLast extends (...args: Array<any>) => any, DataFirst extends (...args: Array<any>) => any>(arity: Parameters<DataFirst>["length"], body: DataFirst): DataLast & DataFirst;
@@ -81,7 +81,7 @@ export declare const dual: {
  *
  * assert.deepStrictEqual(pipe(length, apply("hello")), 5)
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const apply: <A>(a: A) => <B>(self: (a: A) => B) => B;
 /**
@@ -92,7 +92,7 @@ export declare const apply: <A>(a: A) => <B>(self: (a: A) => B) => B;
  *
  * export const constNull: LazyArg<null> = constant(null)
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export interface LazyArg<A> {
     (): A;
@@ -103,7 +103,7 @@ export interface LazyArg<A> {
  *
  * export const sum: FunctionN<[number, number], number> = (a, b) => a + b
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export interface FunctionN<A extends ReadonlyArray<unknown>, B> {
     (...args: A): B;
@@ -118,7 +118,7 @@ export interface FunctionN<A extends ReadonlyArray<unknown>, B> {
  *
  * assert.deepStrictEqual(identity(5), 5)
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const identity: <A>(a: A) => A;
 /**
@@ -131,7 +131,7 @@ export declare const identity: <A>(a: A) => A;
  *
  * assert.deepStrictEqual(unsafeCoerce, identity)
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const unsafeCoerce: <A, B>(a: A) => B;
 /**
@@ -150,7 +150,7 @@ export declare const unsafeCoerce: <A, B>(a: A) => B;
  * assert.deepStrictEqual(constNull(), null)
  * assert.deepStrictEqual(constNull(), null)
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const constant: <A>(value: A) => LazyArg<A>;
 /**
@@ -161,7 +161,7 @@ export declare const constant: <A>(value: A) => LazyArg<A>;
  *
  * assert.deepStrictEqual(constTrue(), true)
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const constTrue: LazyArg<boolean>;
 /**
@@ -172,7 +172,7 @@ export declare const constTrue: LazyArg<boolean>;
  *
  * assert.deepStrictEqual(constFalse(), false)
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const constFalse: LazyArg<boolean>;
 /**
@@ -183,7 +183,7 @@ export declare const constFalse: LazyArg<boolean>;
  *
  * assert.deepStrictEqual(constNull(), null)
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const constNull: LazyArg<null>;
 /**
@@ -194,7 +194,7 @@ export declare const constNull: LazyArg<null>;
  *
  * assert.deepStrictEqual(constUndefined(), undefined)
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const constUndefined: LazyArg<undefined>;
 /**
@@ -205,7 +205,7 @@ export declare const constUndefined: LazyArg<undefined>;
  *
  * assert.deepStrictEqual(constVoid(), undefined)
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const constVoid: LazyArg<void>;
 /**
@@ -220,7 +220,7 @@ export declare const constVoid: LazyArg<void>;
  *
  * assert.deepStrictEqual(flip(f)('aaa')(2), -1)
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const flip: <A extends unknown[], B extends unknown[], C>(f: (...a: A) => (...b: B) => C) => (...b: B) => (...a: A) => C;
 /**
@@ -238,7 +238,7 @@ export declare const flip: <A extends unknown[], B extends unknown[], C>(f: (...
  *
  * assert.strictEqual(compose(increment, square)(2), 9);
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const compose: {
     <B, C>(bc: (b: B) => C): <A>(self: (a: A) => B) => (a: A) => C;
@@ -250,7 +250,7 @@ export declare const compose: {
  *
  * This function is particularly when it's necessary to specify that certain cases are impossible.
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const absurd: <A>(_: never) => A;
 /**
@@ -263,7 +263,7 @@ export declare const absurd: <A>(_: never) => A;
  *
  * assert.deepStrictEqual(sumTupled([1, 2]), 3)
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const tupled: <A extends readonly unknown[], B>(f: (...a: A) => B) => (a: A) => B;
 /**
@@ -276,7 +276,7 @@ export declare const tupled: <A extends readonly unknown[], B>(f: (...a: A) => B
  *
  * assert.deepStrictEqual(getFirst(1, 2), 1)
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const untupled: <A extends readonly unknown[], B>(f: (a: A) => B) => (...a: A) => B;
 /**
@@ -297,7 +297,7 @@ export declare const untupled: <A extends readonly unknown[], B>(f: (a: A) => B)
  *
  * assert.deepStrictEqual(pipe(length("hello"), double, decrement), 9)
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare function pipe<A>(a: A): A;
 export declare function pipe<A, B>(a: A, ab: (a: A) => B): B;
@@ -334,7 +334,7 @@ export declare function pipe<A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q,
  *
  * assert.strictEqual(f('aaa'), 6)
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare function flow<A extends ReadonlyArray<unknown>, B>(ab: (...a: A) => B): (...a: A) => B;
 export declare function flow<A extends ReadonlyArray<unknown>, B, C>(ab: (...a: A) => B, bc: (b: B) => C): (...a: A) => C;
@@ -348,7 +348,7 @@ export declare function flow<A extends ReadonlyArray<unknown>, B, C, D, E, F, G,
 /**
  * Type hole simulation.
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const hole: <T>() => T;
 /**
@@ -365,7 +365,7 @@ export declare const hole: <T>() => T;
  *
  * assert.deepStrictEqual(SK(0, "hello"), "hello")
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const SK: <A, B>(_: A, b: B) => B;
 //# sourceMappingURL=Function.d.ts.map

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

@@ -1,5 +1,5 @@
 /**
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const globalValue: <A>(id: unknown, compute: () => A) => A;
 //# sourceMappingURL=GlobalValue.d.ts.map

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

@@ -4,12 +4,12 @@ import type * as Queue from "./Queue.js";
 import type * as Stream from "./Stream.js";
 import type * as Take from "./Take.js";
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category symbols
  */
 export declare const GroupByTypeId: unique symbol;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category symbols
  */
 export type GroupByTypeId = typeof GroupByTypeId;
@@ -18,18 +18,18 @@ export type GroupByTypeId = typeof GroupByTypeId;
  * be processed. Once this is applied all groups will be processed in parallel
  * and the results will be merged in arbitrary order.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category models
  */
 export interface GroupBy<R, E, K, V> extends GroupBy.Variance<R, E, K, V>, Pipeable {
     readonly grouped: Stream.Stream<R, E, readonly [K, Queue.Dequeue<Take.Take<E, V>>]>;
 }
 /**
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare namespace GroupBy {
     /**
-     * @since 1.0.0
+     * @since 2.0.0
      * @category models
      */
     interface Variance<R, E, K, V> {
@@ -45,7 +45,7 @@ export declare namespace GroupBy {
  * Run the function across all groups, collecting the results in an
  * arbitrary order.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category destructors
  */
 export declare const evaluate: {
@@ -59,7 +59,7 @@ export declare const evaluate: {
 /**
  * Filter the groups to be processed.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const filter: {
@@ -69,7 +69,7 @@ export declare const filter: {
 /**
  * Only consider the first `n` groups found in the `Stream`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category utils
  */
 export declare const first: {
@@ -79,7 +79,7 @@ export declare const first: {
 /**
  * Constructs a `GroupBy` from a `Stream`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const make: <R, E, K, V>(grouped: Stream.Stream<R, E, readonly [K, Queue.Dequeue<Take.Take<E, V>>]>) => GroupBy<R, E, K, V>;

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

@@ -1,18 +1,18 @@
 /**
- * @since 1.0.0
+ * @since 2.0.0
  */
 /**
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const URI: unique symbol;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  */
 export interface TypeClass<F extends TypeLambda> {
     readonly [URI]?: F;
 }
 /**
- * @since 1.0.0
+ * @since 2.0.0
  */
 export interface TypeLambda {
     readonly In: unknown;
@@ -21,7 +21,7 @@ export interface TypeLambda {
     readonly Target: unknown;
 }
 /**
- * @since 1.0.0
+ * @since 2.0.0
  */
 export type Kind<F extends TypeLambda, In, Out2, Out1, Target> = F extends {
     readonly type: unknown;

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

@@ -1,62 +1,62 @@
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category symbols
  */
 export declare const symbol: unique symbol;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category models
  */
 export interface Hash {
     [symbol](): number;
 }
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category hashing
  */
 export declare const hash: <A>(self: A) => number;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category hashing
  */
 export declare const random: <A extends object>(self: A) => number;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category hashing
  */
 export declare const combine: (b: number) => (self: number) => number;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category hashing
  */
 export declare const optimize: (n: number) => number;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category guards
  */
 export declare const isHash: (u: unknown) => u is Hash;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category hashing
  */
 export declare const number: (n: number) => number;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category hashing
  */
 export declare const string: (str: string) => number;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category hashing
  */
 export declare const structureKeys: <A extends object>(o: A, keys: readonly (keyof A)[]) => number;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category hashing
  */
 export declare const structure: <A extends object>(o: A) => number;
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category hashing
  */
 export declare const array: <A>(arr: readonly A[]) => number;

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

@@ -1,5 +1,5 @@
 /**
- * @since 1.0.0
+ * @since 2.0.0
  */
 import type { Equal } from "./Equal.js";
 import type { HashSet } from "./HashSet.js";
@@ -8,29 +8,29 @@ import type { Option } from "./Option.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 models
  */
 export interface HashMap<Key, Value> extends Iterable<[Key, Value]>, Equal, Pipeable, Inspectable {
     [TypeId]: TypeId;
 }
 /**
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare namespace HashMap {
     /**
-     * @since 1.0.0
+     * @since 2.0.0
      * @category models
      */
     type UpdateFn<V> = (option: Option<V>) => Option<V>;
 }
 /**
- * @since 1.0.0
+ * @since 2.0.0
  * @category refinements
  */
 export declare const isHashMap: {
@@ -40,28 +40,28 @@ export declare const isHashMap: {
 /**
  * Creates a new `HashMap`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const empty: <K = never, V = never>() => HashMap<K, V>;
 /**
  * Constructs a new `HashMap` from an array of key/value pairs.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const make: <Entries extends ReadonlyArray<readonly [any, any]>>(...entries: Entries) => HashMap<Entries[number] extends readonly [infer K, any] ? K : never, Entries[number] extends readonly [any, infer V] ? V : never>;
 /**
  * Constructs a new `HashMap` from an iterable of key/value pairs.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category constructors
  */
 export declare const fromIterable: <K, V>(entries: Iterable<readonly [K, V]>) => HashMap<K, V>;
 /**
  * Checks if the `HashMap` contains any entries.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const isEmpty: <K, V>(self: HashMap<K, V>) => boolean;
@@ -69,7 +69,7 @@ export declare const isEmpty: <K, V>(self: HashMap<K, V>) => boolean;
  * Safely lookup the value for the specified key in the `HashMap` using the
  * internal hashing function.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const get: {
@@ -79,7 +79,7 @@ export declare const get: {
 /**
  * Lookup the value for the specified key in the `HashMap` using a custom hash.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const getHash: {
@@ -90,7 +90,7 @@ export declare const getHash: {
  * Unsafely lookup the value for the specified key in the `HashMap` using the
  * internal hashing function.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category unsafe
  */
 export declare const unsafeGet: {
@@ -100,7 +100,7 @@ export declare const unsafeGet: {
 /**
  * Checks if the specified key has an entry in the `HashMap`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const has: {
@@ -111,7 +111,7 @@ export declare const has: {
  * Checks if the specified key has an entry in the `HashMap` using a custom
  * hash.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category elements
  */
 export declare const hasHash: {
@@ -122,7 +122,7 @@ export declare const hasHash: {
  * Sets the specified key to the specified value using the internal hashing
  * function.
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const set: {
     <K, V>(key: K, value: V): (self: HashMap<K, V>) => HashMap<K, V>;
@@ -131,47 +131,47 @@ export declare const set: {
 /**
  * Returns an `IterableIterator` of the keys within the `HashMap`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const keys: <K, V>(self: HashMap<K, V>) => IterableIterator<K>;
 /**
  * Returns a `HashSet` of keys within the `HashMap`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getter
  */
 export declare const keySet: <K, V>(self: HashMap<K, V>) => HashSet<K>;
 /**
  * Returns an `IterableIterator` of the values within the `HashMap`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const values: <K, V>(self: HashMap<K, V>) => IterableIterator<V>;
 /**
  * Returns the number of entries within the `HashMap`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category getters
  */
 export declare const size: <K, V>(self: HashMap<K, V>) => number;
 /**
  * Marks the `HashMap` as mutable.
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const beginMutation: <K, V>(self: HashMap<K, V>) => HashMap<K, V>;
 /**
  * Marks the `HashMap` as immutable.
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const endMutation: <K, V>(self: HashMap<K, V>) => HashMap<K, V>;
 /**
  * Mutates the `HashMap` within the context of the provided function.
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const mutate: {
     <K, V>(f: (self: HashMap<K, V>) => void): (self: HashMap<K, V>) => HashMap<K, V>;
@@ -185,7 +185,7 @@ export declare const mutate: {
  * The update function will be invoked with the current value of the key if it
  * exists, or `None` if no such value exists.
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const modifyAt: {
     <K, V>(key: K, f: HashMap.UpdateFn<V>): (self: HashMap<K, V>) => HashMap<K, V>;
@@ -201,7 +201,7 @@ export declare const modifyAt: {
  *
  * This function will always either update or insert a value into the `HashMap`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const modifyHash: {
     <K, V>(key: K, hash: number, f: HashMap.UpdateFn<V>): (self: HashMap<K, V>) => HashMap<K, V>;
@@ -210,7 +210,7 @@ export declare const modifyHash: {
 /**
  * Updates the value of the specified key within the `HashMap` if it exists.
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const modify: {
     <K, V>(key: K, f: (v: V) => V): (self: HashMap<K, V>) => HashMap<K, V>;
@@ -219,7 +219,7 @@ export declare const modify: {
 /**
  * Performs a union of this `HashMap` and that `HashMap`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const union: {
     <K1, V1>(that: HashMap<K1, V1>): <K0, V0>(self: HashMap<K0, V0>) => HashMap<K1 | K0, V1 | V0>;
@@ -229,7 +229,7 @@ export declare const union: {
  * Remove the entry for the specified key in the `HashMap` using the internal
  * hashing function.
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const remove: {
     <K>(key: K): <V>(self: HashMap<K, V>) => HashMap<K, V>;
@@ -238,7 +238,7 @@ export declare const remove: {
 /**
  * Removes all entries in the `HashMap` which have the specified keys.
  *
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const removeMany: {
     <K>(keys: Iterable<K>): <V>(self: HashMap<K, V>) => HashMap<K, V>;
@@ -247,7 +247,7 @@ export declare const removeMany: {
 /**
  * Maps over the entries of the `HashMap` using the specified function.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category mapping
  */
 export declare const map: {
@@ -259,7 +259,7 @@ export declare const map: {
  *
  * **NOTE**: the hash and equal of both maps have to be the same.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category sequencing
  */
 export declare const flatMap: {
@@ -269,7 +269,7 @@ export declare const flatMap: {
 /**
  * Applies the specified function to the entries of the `HashMap`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category traversing
  */
 export declare const forEach: {
@@ -279,7 +279,7 @@ export declare const forEach: {
 /**
  * Reduces the specified state over the entries of the `HashMap`.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category folding
  */
 export declare const reduce: {
@@ -289,7 +289,7 @@ export declare const reduce: {
 /**
  * Filters entries out of a `HashMap` using the specified predicate.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category filtering
  */
 export declare const filter: {
@@ -301,7 +301,7 @@ export declare const filter: {
 /**
  * Filters out `None` values from a `HashMap` of `Options`s.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category filtering
  */
 export declare const compact: <K, A>(self: HashMap<K, Option<A>>) => HashMap<K, A>;
@@ -309,7 +309,7 @@ export declare const compact: <K, A>(self: HashMap<K, Option<A>>) => HashMap<K,
  * Maps over the entries of the `HashMap` using the specified partial function
  * and filters out `None` values.
  *
- * @since 1.0.0
+ * @since 2.0.0
  * @category filtering
  */
 export declare const filterMap: {
@@ -321,7 +321,7 @@ export declare const filterMap: {
  * predicate, or `None` if no such element exists.
  *
  * @category elements
- * @since 1.0.0
+ * @since 2.0.0
  */
 export declare const findFirst: {
     <K, A>(predicate: (k: K, a: A) => boolean): (self: HashMap<K, A>) => Option<[K, A]>;