effect 3.13.9 → 3.13.11

package/dist/dts/Array.d.ts

@@ -3,13 +3,13 @@
  *
  * @since 2.0.0
  */
-import type { Either } from "./Either.js";
+import * as Either from "./Either.js";
 import * as Equivalence from "./Equivalence.js";
 import type { LazyArg } from "./Function.js";
 import type { TypeLambda } from "./HKT.js";
-import type { Option } from "./Option.js";
+import * as Option from "./Option.js";
 import * as Order from "./Order.js";
-import type { Predicate, Refinement } from "./Predicate.js";
+import * as Predicate from "./Predicate.js";
 import * as Record from "./Record.js";
 import type { NoInfer } from "./Types.js";
 /**
@@ -253,7 +253,7 @@ export declare const fromRecord: <K extends string, A>(self: Readonly<Record<K,
  * @category conversions
  * @since 2.0.0
  */
-export declare const fromOption: <A>(self: Option<A>) => Array<A>;
+export declare const fromOption: <A>(self: Option.Option<A>) => Array<A>;
 /**
  * Matches the elements of an array, applying functions to cases of empty and non-empty arrays.
  *
@@ -945,14 +945,14 @@ export declare const get: {
      * @category getters
      * @since 2.0.0
      */
-    (index: number): <A>(self: ReadonlyArray<A>) => Option<A>;
+    (index: number): <A>(self: ReadonlyArray<A>) => Option.Option<A>;
     /**
      * This function provides a safe way to read a value at a particular index from a `ReadonlyArray`.
      *
      * @category getters
      * @since 2.0.0
      */
-    <A>(self: ReadonlyArray<A>, index: number): Option<A>;
+    <A>(self: ReadonlyArray<A>, index: number): Option.Option<A>;
 };
 /**
  * Gets an element unsafely, will throw on out of bounds.
@@ -1014,7 +1014,7 @@ export declare const unappend: <A>(self: NonEmptyReadonlyArray<A>) => [arrayWith
  * @category getters
  * @since 2.0.0
  */
-export declare const head: <A>(self: ReadonlyArray<A>) => Option<A>;
+export declare const head: <A>(self: ReadonlyArray<A>) => Option.Option<A>;
 /**
  * Get the first element of a non empty array.
  *
@@ -1037,7 +1037,7 @@ export declare const headNonEmpty: <A>(self: NonEmptyReadonlyArray<A>) => A;
  * @category getters
  * @since 2.0.0
  */
-export declare const last: <A>(self: ReadonlyArray<A>) => Option<A>;
+export declare const last: <A>(self: ReadonlyArray<A>) => Option.Option<A>;
 /**
  * Get the last element of a non empty array.
  *
@@ -1060,7 +1060,7 @@ export declare const lastNonEmpty: <A>(self: NonEmptyReadonlyArray<A>) => A;
  * @category getters
  * @since 2.0.0
  */
-export declare const tail: <A>(self: Iterable<A>) => Option<Array<A>>;
+export declare const tail: <A>(self: Iterable<A>) => Option.Option<Array<A>>;
 /**
  * Get all but the first element of a `NonEmptyReadonlyArray`.
  *
@@ -1083,7 +1083,7 @@ export declare const tailNonEmpty: <A>(self: NonEmptyReadonlyArray<A>) => Array<
  * @category getters
  * @since 2.0.0
  */
-export declare const init: <A>(self: Iterable<A>) => Option<Array<A>>;
+export declare const init: <A>(self: Iterable<A>) => Option.Option<Array<A>>;
 /**
  * Get all but the last element of a non empty array, creating a new array.
  *
@@ -1562,7 +1562,7 @@ export declare const findFirstIndex: {
      * @category elements
      * @since 2.0.0
      */
-    <A>(predicate: (a: NoInfer<A>, i: number) => boolean): (self: Iterable<A>) => Option<number>;
+    <A>(predicate: (a: NoInfer<A>, i: number) => boolean): (self: Iterable<A>) => Option.Option<number>;
     /**
      * Return the first index for which a predicate holds.
      *
@@ -1578,7 +1578,7 @@ export declare const findFirstIndex: {
      * @category elements
      * @since 2.0.0
      */
-    <A>(self: Iterable<A>, predicate: (a: A, i: number) => boolean): Option<number>;
+    <A>(self: Iterable<A>, predicate: (a: A, i: number) => boolean): Option.Option<number>;
 };
 /**
  * Return the last index for which a predicate holds.
@@ -1611,7 +1611,7 @@ export declare const findLastIndex: {
      * @category elements
      * @since 2.0.0
      */
-    <A>(predicate: (a: NoInfer<A>, i: number) => boolean): (self: Iterable<A>) => Option<number>;
+    <A>(predicate: (a: NoInfer<A>, i: number) => boolean): (self: Iterable<A>) => Option.Option<number>;
     /**
      * Return the last index for which a predicate holds.
      *
@@ -1627,7 +1627,7 @@ export declare const findLastIndex: {
      * @category elements
      * @since 2.0.0
      */
-    <A>(self: Iterable<A>, predicate: (a: A, i: number) => boolean): Option<number>;
+    <A>(self: Iterable<A>, predicate: (a: A, i: number) => boolean): Option.Option<number>;
 };
 /**
  * Returns the first element that satisfies the specified
@@ -1662,7 +1662,7 @@ export declare const findFirst: {
      * @category elements
      * @since 2.0.0
      */
-    <A, B>(f: (a: NoInfer<A>, i: number) => Option<B>): (self: Iterable<A>) => Option<B>;
+    <A, B>(f: (a: NoInfer<A>, i: number) => Option.Option<B>): (self: Iterable<A>) => Option.Option<B>;
     /**
      * Returns the first element that satisfies the specified
      * predicate, or `None` if no such element exists.
@@ -1679,7 +1679,7 @@ export declare const findFirst: {
      * @category elements
      * @since 2.0.0
      */
-    <A, B extends A>(refinement: (a: NoInfer<A>, i: number) => a is B): (self: Iterable<A>) => Option<B>;
+    <A, B extends A>(refinement: (a: NoInfer<A>, i: number) => a is B): (self: Iterable<A>) => Option.Option<B>;
     /**
      * Returns the first element that satisfies the specified
      * predicate, or `None` if no such element exists.
@@ -1696,7 +1696,7 @@ export declare const findFirst: {
      * @category elements
      * @since 2.0.0
      */
-    <A>(predicate: (a: NoInfer<A>, i: number) => boolean): (self: Iterable<A>) => Option<A>;
+    <A>(predicate: (a: NoInfer<A>, i: number) => boolean): (self: Iterable<A>) => Option.Option<A>;
     /**
      * Returns the first element that satisfies the specified
      * predicate, or `None` if no such element exists.
@@ -1713,7 +1713,7 @@ export declare const findFirst: {
      * @category elements
      * @since 2.0.0
      */
-    <A, B>(self: Iterable<A>, f: (a: A, i: number) => Option<B>): Option<B>;
+    <A, B>(self: Iterable<A>, f: (a: A, i: number) => Option.Option<B>): Option.Option<B>;
     /**
      * Returns the first element that satisfies the specified
      * predicate, or `None` if no such element exists.
@@ -1730,7 +1730,7 @@ export declare const findFirst: {
      * @category elements
      * @since 2.0.0
      */
-    <A, B extends A>(self: Iterable<A>, refinement: (a: A, i: number) => a is B): Option<B>;
+    <A, B extends A>(self: Iterable<A>, refinement: (a: A, i: number) => a is B): Option.Option<B>;
     /**
      * Returns the first element that satisfies the specified
      * predicate, or `None` if no such element exists.
@@ -1747,7 +1747,7 @@ export declare const findFirst: {
      * @category elements
      * @since 2.0.0
      */
-    <A>(self: Iterable<A>, predicate: (a: A, i: number) => boolean): Option<A>;
+    <A>(self: Iterable<A>, predicate: (a: A, i: number) => boolean): Option.Option<A>;
 };
 /**
  * Finds the last element in an iterable collection that satisfies the given predicate or refinement.
@@ -1782,7 +1782,7 @@ export declare const findLast: {
      * @category elements
      * @since 2.0.0
      */
-    <A, B>(f: (a: NoInfer<A>, i: number) => Option<B>): (self: Iterable<A>) => Option<B>;
+    <A, B>(f: (a: NoInfer<A>, i: number) => Option.Option<B>): (self: Iterable<A>) => Option.Option<B>;
     /**
      * Finds the last element in an iterable collection that satisfies the given predicate or refinement.
      * Returns an `Option` containing the found element, or `Option.none` if no element matches.
@@ -1799,7 +1799,7 @@ export declare const findLast: {
      * @category elements
      * @since 2.0.0
      */
-    <A, B extends A>(refinement: (a: NoInfer<A>, i: number) => a is B): (self: Iterable<A>) => Option<B>;
+    <A, B extends A>(refinement: (a: NoInfer<A>, i: number) => a is B): (self: Iterable<A>) => Option.Option<B>;
     /**
      * Finds the last element in an iterable collection that satisfies the given predicate or refinement.
      * Returns an `Option` containing the found element, or `Option.none` if no element matches.
@@ -1816,7 +1816,7 @@ export declare const findLast: {
      * @category elements
      * @since 2.0.0
      */
-    <A>(predicate: (a: NoInfer<A>, i: number) => boolean): (self: Iterable<A>) => Option<A>;
+    <A>(predicate: (a: NoInfer<A>, i: number) => boolean): (self: Iterable<A>) => Option.Option<A>;
     /**
      * Finds the last element in an iterable collection that satisfies the given predicate or refinement.
      * Returns an `Option` containing the found element, or `Option.none` if no element matches.
@@ -1833,7 +1833,7 @@ export declare const findLast: {
      * @category elements
      * @since 2.0.0
      */
-    <A, B>(self: Iterable<A>, f: (a: A, i: number) => Option<B>): Option<B>;
+    <A, B>(self: Iterable<A>, f: (a: A, i: number) => Option.Option<B>): Option.Option<B>;
     /**
      * Finds the last element in an iterable collection that satisfies the given predicate or refinement.
      * Returns an `Option` containing the found element, or `Option.none` if no element matches.
@@ -1850,7 +1850,7 @@ export declare const findLast: {
      * @category elements
      * @since 2.0.0
      */
-    <A, B extends A>(self: Iterable<A>, refinement: (a: A, i: number) => a is B): Option<B>;
+    <A, B extends A>(self: Iterable<A>, refinement: (a: A, i: number) => a is B): Option.Option<B>;
     /**
      * Finds the last element in an iterable collection that satisfies the given predicate or refinement.
      * Returns an `Option` containing the found element, or `Option.none` if no element matches.
@@ -1867,7 +1867,7 @@ export declare const findLast: {
      * @category elements
      * @since 2.0.0
      */
-    <A>(self: Iterable<A>, predicate: (a: A, i: number) => boolean): Option<A>;
+    <A>(self: Iterable<A>, predicate: (a: A, i: number) => boolean): Option.Option<A>;
 };
 /**
  * Insert an element at the specified index, creating a new `NonEmptyArray`,
@@ -1900,7 +1900,7 @@ export declare const insertAt: {
      *
      * @since 2.0.0
      */
-    <B>(i: number, b: B): <A>(self: Iterable<A>) => Option<NonEmptyArray<A | B>>;
+    <B>(i: number, b: B): <A>(self: Iterable<A>) => Option.Option<NonEmptyArray<A | B>>;
     /**
      * Insert an element at the specified index, creating a new `NonEmptyArray`,
      * or return `None` if the index is out of bounds.
@@ -1916,7 +1916,7 @@ export declare const insertAt: {
      *
      * @since 2.0.0
      */
-    <A, B>(self: Iterable<A>, i: number, b: B): Option<NonEmptyArray<A | B>>;
+    <A, B>(self: Iterable<A>, i: number, b: B): Option.Option<NonEmptyArray<A | B>>;
 };
 /**
  * Change the element at the specified index, creating a new `Array`,
@@ -1996,7 +1996,7 @@ export declare const replaceOption: {
      *
      * @since 2.0.0
      */
-    <B>(i: number, b: B): <A, S extends Iterable<A> = Iterable<A>>(self: S) => Option<ReadonlyArray.With<S, ReadonlyArray.Infer<S> | B>>;
+    <B>(i: number, b: B): <A, S extends Iterable<A> = Iterable<A>>(self: S) => Option.Option<ReadonlyArray.With<S, ReadonlyArray.Infer<S> | B>>;
     /**
      * Replaces an element in an array with the given value, returning an option of the updated array.
      *
@@ -2011,7 +2011,7 @@ export declare const replaceOption: {
      *
      * @since 2.0.0
      */
-    <A, B, S extends Iterable<A> = Iterable<A>>(self: S, i: number, b: B): Option<ReadonlyArray.With<S, ReadonlyArray.Infer<S> | B>>;
+    <A, B, S extends Iterable<A> = Iterable<A>>(self: S, i: number, b: B): Option.Option<ReadonlyArray.With<S, ReadonlyArray.Infer<S> | B>>;
 };
 /**
  * Apply a function to the element at the specified index, creating a new `Array`,
@@ -2101,7 +2101,7 @@ export declare const modifyOption: {
      *
      * @since 2.0.0
      */
-    <A, B, S extends Iterable<A> = Iterable<A>>(i: number, f: (a: ReadonlyArray.Infer<S>) => B): (self: S) => Option<ReadonlyArray.With<S, ReadonlyArray.Infer<S> | B>>;
+    <A, B, S extends Iterable<A> = Iterable<A>>(i: number, f: (a: ReadonlyArray.Infer<S>) => B): (self: S) => Option.Option<ReadonlyArray.With<S, ReadonlyArray.Infer<S> | B>>;
     /**
      * Apply a function to the element at the specified index, creating a new `Array`,
      * or return `None` if the index is out of bounds.
@@ -2121,7 +2121,7 @@ export declare const modifyOption: {
      *
      * @since 2.0.0
      */
-    <A, B, S extends Iterable<A> = Iterable<A>>(self: S, i: number, f: (a: ReadonlyArray.Infer<S>) => B): Option<ReadonlyArray.With<S, ReadonlyArray.Infer<S> | B>>;
+    <A, B, S extends Iterable<A> = Iterable<A>>(self: S, i: number, f: (a: ReadonlyArray.Infer<S>) => B): Option.Option<ReadonlyArray.With<S, ReadonlyArray.Infer<S> | B>>;
 };
 /**
  * Delete the element at the specified index, creating a new `Array`,
@@ -4035,7 +4035,7 @@ export declare const filterMap: {
      * @category filtering
      * @since 2.0.0
      */
-    <A, B>(f: (a: A, i: number) => Option<B>): (self: Iterable<A>) => Array<B>;
+    <A, B>(f: (a: A, i: number) => Option.Option<B>): (self: Iterable<A>) => Array<B>;
     /**
      * Applies a function to each element of the `Iterable` and filters based on the result, keeping the transformed values where the function returns `Some`.
      * This method combines filtering and mapping functionalities, allowing transformations and filtering of elements based on a single function pass.
@@ -4054,7 +4054,7 @@ export declare const filterMap: {
      * @category filtering
      * @since 2.0.0
      */
-    <A, B>(self: Iterable<A>, f: (a: A, i: number) => Option<B>): Array<B>;
+    <A, B>(self: Iterable<A>, f: (a: A, i: number) => Option.Option<B>): Array<B>;
 };
 /**
  * Applies a function to each element of the array and filters based on the result, stopping when a condition is not met.
@@ -4095,7 +4095,7 @@ export declare const filterMapWhile: {
      * @category filtering
      * @since 2.0.0
      */
-    <A, B>(f: (a: A, i: number) => Option<B>): (self: Iterable<A>) => Array<B>;
+    <A, B>(f: (a: A, i: number) => Option.Option<B>): (self: Iterable<A>) => Array<B>;
     /**
      * Applies a function to each element of the array and filters based on the result, stopping when a condition is not met.
      * This method combines filtering and mapping in a single pass, and short-circuits, i.e., stops processing, as soon as the function returns `None`.
@@ -4115,7 +4115,7 @@ export declare const filterMapWhile: {
      * @category filtering
      * @since 2.0.0
      */
-    <A, B>(self: Iterable<A>, f: (a: A, i: number) => Option<B>): Array<B>;
+    <A, B>(self: Iterable<A>, f: (a: A, i: number) => Option.Option<B>): Array<B>;
 };
 /**
  * Applies a function to each element of the `Iterable`, categorizing the results into two separate arrays.
@@ -4170,7 +4170,7 @@ export declare const partitionMap: {
      * @category filtering
      * @since 2.0.0
      */
-    <A, B, C>(f: (a: A, i: number) => Either<C, B>): (self: Iterable<A>) => [left: Array<B>, right: Array<C>];
+    <A, B, C>(f: (a: A, i: number) => Either.Either<C, B>): (self: Iterable<A>) => [left: Array<B>, right: Array<C>];
     /**
      * Applies a function to each element of the `Iterable`, categorizing the results into two separate arrays.
      * This function is particularly useful for operations where each element can result in two possible types,
@@ -4197,7 +4197,7 @@ export declare const partitionMap: {
      * @category filtering
      * @since 2.0.0
      */
-    <A, B, C>(self: Iterable<A>, f: (a: A, i: number) => Either<C, B>): [left: Array<B>, right: Array<C>];
+    <A, B, C>(self: Iterable<A>, f: (a: A, i: number) => Either.Either<C, B>): [left: Array<B>, right: Array<C>];
 };
 /**
  * Retrieves the `Some` values from an `Iterable` of `Option`s, collecting them into an array.
@@ -4214,7 +4214,7 @@ export declare const partitionMap: {
  * @category filtering
  * @since 2.0.0
  */
-export declare const getSomes: <T extends Iterable<Option<X>>, X = any>(self: T) => Array<Option.Value<ReadonlyArray.Infer<T>>>;
+export declare const getSomes: <T extends Iterable<Option.Option<X>>, X = any>(self: T) => Array<Option.Option.Value<ReadonlyArray.Infer<T>>>;
 /**
  * Retrieves the `Left` values from an `Iterable` of `Either`s, collecting them into an array.
  *
@@ -4230,7 +4230,7 @@ export declare const getSomes: <T extends Iterable<Option<X>>, X = any>(self: T)
  * @category filtering
  * @since 2.0.0
  */
-export declare const getLefts: <T extends Iterable<Either<any, any>>>(self: T) => Array<Either.Left<ReadonlyArray.Infer<T>>>;
+export declare const getLefts: <T extends Iterable<Either.Either<any, any>>>(self: T) => Array<Either.Either.Left<ReadonlyArray.Infer<T>>>;
 /**
  * Retrieves the `Right` values from an `Iterable` of `Either`s, collecting them into an array.
  *
@@ -4246,7 +4246,7 @@ export declare const getLefts: <T extends Iterable<Either<any, any>>>(self: T) =
  * @category filtering
  * @since 2.0.0
  */
-export declare const getRights: <T extends Iterable<Either<any, any>>>(self: T) => Array<Either.Right<ReadonlyArray.Infer<T>>>;
+export declare const getRights: <T extends Iterable<Either.Either<any, any>>>(self: T) => Array<Either.Either.Right<ReadonlyArray.Infer<T>>>;
 /**
  * @category filtering
  * @since 2.0.0
@@ -4360,7 +4360,7 @@ export declare const partition: {
  * @category filtering
  * @since 2.0.0
  */
-export declare const separate: <T extends Iterable<Either<any, any>>>(self: T) => [Array<Either.Left<ReadonlyArray.Infer<T>>>, Array<Either.Right<ReadonlyArray.Infer<T>>>];
+export declare const separate: <T extends Iterable<Either.Either<any, any>>>(self: T) => [Array<Either.Either.Left<ReadonlyArray.Infer<T>>>, Array<Either.Either.Right<ReadonlyArray.Infer<T>>>];
 /**
  * Reduces an array from the left.
  *
@@ -4477,7 +4477,7 @@ export declare const reduceRight: {
  * @since 2.0.0
  */
 export declare const liftPredicate: {
-    <A, B extends A>(refinement: Refinement<A, B>): (a: A) => Array<B>;
+    <A, B extends A>(refinement: Predicate.Refinement<A, B>): (a: A) => Array<B>;
     /**
      * Lifts a predicate into an array.
      *
@@ -4495,13 +4495,13 @@ export declare const liftPredicate: {
      * @category lifting
      * @since 2.0.0
      */
-    <A>(predicate: Predicate<A>): <B extends A>(b: B) => Array<B>;
+    <A>(predicate: Predicate.Predicate<A>): <B extends A>(b: B) => Array<B>;
 };
 /**
  * @category lifting
  * @since 2.0.0
  */
-export declare const liftOption: <A extends Array<unknown>, B>(f: (...a: A) => Option<B>) => (...a: A) => Array<B>;
+export declare const liftOption: <A extends Array<unknown>, B>(f: (...a: A) => Option.Option<B>) => (...a: A) => Array<B>;
 /**
  * @category conversions
  * @since 2.0.0
@@ -4606,7 +4606,7 @@ export declare const flatMapNullable: {
  * @category lifting
  * @since 2.0.0
  */
-export declare const liftEither: <A extends Array<unknown>, E, B>(f: (...a: A) => Either<B, E>) => (...a: A) => Array<B>;
+export declare const liftEither: <A extends Array<unknown>, E, B>(f: (...a: A) => Either.Either<B, E>) => (...a: A) => Array<B>;
 /**
  * Check if a predicate holds true for every `ReadonlyArray` element.
  *
@@ -4825,7 +4825,7 @@ export declare const max: {
  * @category constructors
  * @since 2.0.0
  */
-export declare const unfold: <B, A>(b: B, f: (b: B) => Option<readonly [A, B]>) => Array<A>;
+export declare const unfold: <B, A>(b: B, f: (b: B) => Option.Option<readonly [A, B]>) => Array<A>;
 /**
  * This function creates and returns a new `Order` for an array of values based on a given `Order` for the elements of the array.
  * The returned `Order` compares two arrays by applying the given `Order` to each element in the arrays.