effect 4.0.0-beta.31 → 4.0.0-beta.32

package/dist/BigInt.js

@@ -7,6 +7,7 @@
 import * as Combiner from "./Combiner.js";
 import * as Equ from "./Equivalence.js";
 import { dual } from "./Function.js";
+import * as Option from "./Option.js";
 import * as order from "./Order.js";
 import * as predicate from "./Predicate.js";
 import * as Reducer from "./Reducer.js";
@@ -98,21 +99,23 @@ export const subtract = /*#__PURE__*/dual(2, (self, that) => self - that);
  * If the dividend is not a multiple of the divisor the result will be a `bigint` value
  * which represents the integer division rounded down to the nearest integer.
  *
- * Returns `undefined` if the divisor is `0n`.
+ * Returns `Option.none()` if the divisor is `0n`.
  *
  * @example
  * ```ts
  * import { divide } from "effect/BigInt"
  * import * as assert from "node:assert"
  *
- * assert.deepStrictEqual(divide(6n, 3n), 2n)
- * assert.deepStrictEqual(divide(6n, 0n), undefined)
+ * import { Option } from "effect"
+ *
+ * assert.deepStrictEqual(divide(6n, 3n), Option.some(2n))
+ * assert.deepStrictEqual(divide(6n, 0n), Option.none())
  * ```
  *
  * @category math
  * @since 2.0.0
  */
-export const divide = /*#__PURE__*/dual(2, (self, that) => that === bigint0 ? undefined : self / that);
+export const divide = /*#__PURE__*/dual(2, (self, that) => that === bigint0 ? Option.none() : Option.some(self / that));
 /**
  * Provides a division operation on `bigint`s.
  *
@@ -444,7 +447,7 @@ export const sqrtUnsafe = n => {
   return x;
 };
 /**
- * Determines the square root of a given `bigint` safely. Returns `undefined` if
+ * Determines the square root of a given `bigint` safely. Returns `Option.none()` if
  * the given `bigint` is negative.
  *
  * **Example**
@@ -452,16 +455,16 @@ export const sqrtUnsafe = n => {
  * ```ts
  * import { BigInt } from "effect"
  *
- * BigInt.sqrt(4n) // 2n
- * BigInt.sqrt(9n) // 3n
- * BigInt.sqrt(16n) // 4n
- * BigInt.sqrt(-1n) // undefined
+ * BigInt.sqrt(4n) // Option.some(2n)
+ * BigInt.sqrt(9n) // Option.some(3n)
+ * BigInt.sqrt(16n) // Option.some(4n)
+ * BigInt.sqrt(-1n) // Option.none()
  * ```
  *
  * @category math
  * @since 2.0.0
  */
-export const sqrt = n => isGreaterThanOrEqualTo(n, bigint0) ? sqrtUnsafe(n) : undefined;
+export const sqrt = n => isGreaterThanOrEqualTo(n, bigint0) ? Option.some(sqrtUnsafe(n)) : Option.none();
 /**
  * Takes an `Iterable` of `bigint`s and returns their sum as a single `bigint
  *
@@ -511,15 +514,15 @@ export const multiplyAll = collection => {
  * Converts a `bigint` to a `number`.
  *
  * If the `bigint` is outside the safe integer range for JavaScript (`Number.MAX_SAFE_INTEGER`
- * and `Number.MIN_SAFE_INTEGER`), it returns `undefined`
+ * and `Number.MIN_SAFE_INTEGER`), it returns `Option.none()`.
  *
  * @example
  * ```ts
  * import { BigInt as BI } from "effect"
  *
- * BI.toNumber(42n) // 42
- * BI.toNumber(BigInt(Number.MAX_SAFE_INTEGER) + 1n) // undefined
- * BI.toNumber(BigInt(Number.MIN_SAFE_INTEGER) - 1n) // undefined
+ * BI.toNumber(42n) // Option.some(42)
+ * BI.toNumber(BigInt(Number.MAX_SAFE_INTEGER) + 1n) // Option.none()
+ * BI.toNumber(BigInt(Number.MIN_SAFE_INTEGER) - 1n) // Option.none()
  * ```
  *
  * @category conversions
@@ -527,23 +530,23 @@ export const multiplyAll = collection => {
  */
 export const toNumber = b => {
   if (b > BigInt(Number.MAX_SAFE_INTEGER) || b < BigInt(Number.MIN_SAFE_INTEGER)) {
-    return undefined;
+    return Option.none();
   }
-  return Number(b);
+  return Option.some(Number(b));
 };
 /**
  * Converts a string to a `bigint`.
  *
  * If the string is empty or contains characters that cannot be converted into a
- * `bigint`, it returns `undefined`.
+ * `bigint`, it returns `Option.none()`.
  *
  * @example
  * ```ts
  * import { BigInt } from "effect"
  *
- * BigInt.fromString("42") // 42n
- * BigInt.fromString(" ") // undefined
- * BigInt.fromString("a") // undefined
+ * BigInt.fromString("42") // Option.some(42n)
+ * BigInt.fromString(" ") // Option.none()
+ * BigInt.fromString("a") // Option.none()
  * ```
  *
  * @category conversions
@@ -551,9 +554,9 @@ export const toNumber = b => {
  */
 export const fromString = s => {
   try {
-    return s.trim() === "" ? undefined : BigInt(s);
+    return s.trim() === "" ? Option.none() : Option.some(BigInt(s));
   } catch {
-    return undefined;
+    return Option.none();
   }
 };
 /**
@@ -561,16 +564,16 @@ export const fromString = s => {
  *
  * If the number is outside the safe integer range for JavaScript
  * (`Number.MAX_SAFE_INTEGER` and `Number.MIN_SAFE_INTEGER`) or if the number is
- * not a valid `bigint`, it returns `undefined`.
+ * not a valid `bigint`, it returns `Option.none()`.
  *
  * @example
  * ```ts
  * import { BigInt } from "effect"
  *
- * BigInt.fromNumber(42) // 42n
+ * BigInt.fromNumber(42) // Option.some(42n)
  *
- * BigInt.fromNumber(Number.MAX_SAFE_INTEGER + 1) // undefined
- * BigInt.fromNumber(Number.MIN_SAFE_INTEGER - 1) // undefined
+ * BigInt.fromNumber(Number.MAX_SAFE_INTEGER + 1) // Option.none()
+ * BigInt.fromNumber(Number.MIN_SAFE_INTEGER - 1) // Option.none()
  * ```
  *
  * @category conversions
@@ -578,12 +581,12 @@ export const fromString = s => {
  */
 export function fromNumber(n) {
   if (n > Number.MAX_SAFE_INTEGER || n < Number.MIN_SAFE_INTEGER) {
-    return undefined;
+    return Option.none();
   }
   try {
-    return BigInt(n);
+    return Option.some(BigInt(n));
   } catch {
-    return undefined;
+    return Option.none();
   }
 }
 /**

package/dist/BigInt.js.map

@@ -1 +1 @@
-{"version":3,"file":"BigInt.js","names":["Combiner","Equ","dual","order","predicate","Reducer","BigInt","globalThis","bigint0","bigint1","bigint2","isBigInt","sum","self","that","multiply","subtract","divide","undefined","divideUnsafe","increment","n","decrement","Order","Equivalence","isLessThan","isLessThanOrEqualTo","isGreaterThan","isGreaterThanOrEqualTo","between","isBetween","clamp","min","max","sign","abs","gcd","t","lcm","sqrtUnsafe","RangeError","x","sqrt","sumAll","collection","out","multiplyAll","toNumber","b","Number","MAX_SAFE_INTEGER","MIN_SAFE_INTEGER","fromString","s","trim","fromNumber","remainder","divisor","ReducerSum","make","a","ReducerMultiply","acc","CombinerMax","CombinerMin"],"sources":["../src/BigInt.ts"],"sourcesContent":[null],"mappings":"AAAA;;;;;;AAOA,OAAO,KAAKA,QAAQ,MAAM,eAAe;AACzC,OAAO,KAAKC,GAAG,MAAM,kBAAkB;AACvC,SAASC,IAAI,QAAQ,eAAe;AACpC,OAAO,KAAKC,KAAK,MAAM,YAAY;AAEnC,OAAO,KAAKC,SAAS,MAAM,gBAAgB;AAC3C,OAAO,KAAKC,OAAO,MAAM,cAAc;AAEvC;;;;;;;;;;;;;;;;;AAiBA,OAAO,MAAMC,MAAM,GAAGC,UAAU,CAACD,MAAM;AAEvC,MAAME,OAAO,gBAAGF,MAAM,CAAC,CAAC,CAAC;AACzB,MAAMG,OAAO,gBAAGH,MAAM,CAAC,CAAC,CAAC;AACzB,MAAMI,OAAO,gBAAGJ,MAAM,CAAC,CAAC,CAAC;AAEzB;;;;;;;;;;;;;;;AAeA,OAAO,MAAMK,QAAQ,GAAgCP,SAAS,CAACO,QAAQ;AAEvE;;;;;;;;;;;;;;AAcA,OAAO,MAAMC,GAAG,gBA+BZV,IAAI,CAAC,CAAC,EAAE,CAACW,IAAY,EAAEC,IAAY,KAAaD,IAAI,GAAGC,IAAI,CAAC;AAEhE;;;;;;;;;;;;;;AAcA,OAAO,MAAMC,QAAQ,gBA+BjBb,IAAI,CAAC,CAAC,EAAE,CAACW,IAAY,EAAEC,IAAY,KAAaD,IAAI,GAAGC,IAAI,CAAC;AAEhE;;;;;;;;;;;;;;AAcA,OAAO,MAAME,QAAQ,gBA+BjBd,IAAI,CAAC,CAAC,EAAE,CAACW,IAAY,EAAEC,IAAY,KAAaD,IAAI,GAAGC,IAAI,CAAC;AAEhE;;;;;;;;;;;;;;;;;;;;AAoBA,OAAO,MAAMG,MAAM,gBA2Cff,IAAI,CACN,CAAC,EACD,CAACW,IAAY,EAAEC,IAAY,KAAyBA,IAAI,KAAKN,OAAO,GAAGU,SAAS,GAAGL,IAAI,GAAGC,IAAI,CAC/F;AAED;;;;;;;;;;;;;;;;;;;;AAoBA,OAAO,MAAMK,YAAY,gBA2CrBjB,IAAI,CAAC,CAAC,EAAE,CAACW,IAAY,EAAEC,IAAY,KAAaD,IAAI,GAAGC,IAAI,CAAC;AAEhE;;;;;;;;;;;;;;AAcA,OAAO,MAAMM,SAAS,GAAIC,CAAS,IAAaA,CAAC,GAAGZ,OAAO;AAE3D;;;;;;;;;;;;;;AAcA,OAAO,MAAMa,SAAS,GAAID,CAAS,IAAaA,CAAC,GAAGZ,OAAO;AAE3D;;;;;;;;;;;;;;;;;;;AAmBA,OAAO,MAAMc,KAAK,GAAwBpB,KAAK,CAACG,MAAM;AAEtD;;;;;;;;;;;;;;AAcA,OAAO,MAAMkB,WAAW,GAA4BvB,GAAG,CAACK,MAAM;AAE9D;;;;;;;;;;;;;;;;AAgBA,OAAO,MAAMmB,UAAU,gBAmCnBtB,KAAK,CAACsB,UAAU,CAACF,KAAK,CAAC;AAE3B;;;;;;;;;;;;;;;;AAgBA,OAAO,MAAMG,mBAAmB,gBAmC5BvB,KAAK,CAACuB,mBAAmB,CAACH,KAAK,CAAC;AAEpC;;;;;;;;;;;;;;;;AAgBA,OAAO,MAAMI,aAAa,gBAmCtBxB,KAAK,CAACwB,aAAa,CAACJ,KAAK,CAAC;AAE9B;;;;;;;;;;;;;;;;AAgBA,OAAO,MAAMK,sBAAsB,gBAmC/BzB,KAAK,CAACyB,sBAAsB,CAACL,KAAK,CAAC;AAEvC;;;;;;;;;;;;;;;;;;AAkBA,OAAO,MAAMM,OAAO,gBAkDhB1B,KAAK,CAAC2B,SAAS,CAACP,KAAK,CAAC;AAE1B;;;;;;;;;;;;;;;;;;;;;;AAsBA,OAAO,MAAMQ,KAAK,gBA0Dd5B,KAAK,CAAC4B,KAAK,CAACR,KAAK,CAAC;AAEtB;;;;;;;;;;;;;;AAcA,OAAO,MAAMS,GAAG,gBA+BZ7B,KAAK,CAAC6B,GAAG,CAACT,KAAK,CAAC;AAEpB;;;;;;;;;;;;;;AAcA,OAAO,MAAMU,GAAG,gBA+BZ9B,KAAK,CAAC8B,GAAG,CAACV,KAAK,CAAC;AAEpB;;;;;;;;;;;;;;;;AAgBA,OAAO,MAAMW,IAAI,GAAIb,CAAS,IAAelB,KAAK,CAACG,MAAM,CAACe,CAAC,EAAEb,OAAO,CAAC;AAErE;;;;;;;;;;;;;;;;AAgBA,OAAO,MAAM2B,GAAG,GAAId,CAAS,IAAcA,CAAC,GAAGb,OAAO,GAAG,CAACa,CAAC,GAAGA,CAAE;AAEhE;;;;;;;;;;;;;;;;AAgBA,OAAO,MAAMe,GAAG,gBAmCZlC,IAAI,CAAC,CAAC,EAAE,CAACW,IAAY,EAAEC,IAAY,KAAY;EACjD,OAAOA,IAAI,KAAKN,OAAO,EAAE;IACvB,MAAM6B,CAAC,GAAGvB,IAAI;IACdA,IAAI,GAAGD,IAAI,GAAGC,IAAI;IAClBD,IAAI,GAAGwB,CAAC;EACV;EACA,OAAOxB,IAAI;AACb,CAAC,CAAC;AAEF;;;;;;;;;;;;;;;;AAgBA,OAAO,MAAMyB,GAAG,gBAmCZpC,IAAI,CAAC,CAAC,EAAE,CAACW,IAAY,EAAEC,IAAY,KAAcD,IAAI,GAAGC,IAAI,GAAIsB,GAAG,CAACvB,IAAI,EAAEC,IAAI,CAAC,CAAC;AAEpF;;;;;;;;;;;;;;;;AAgBA,OAAO,MAAMyB,UAAU,GAAIlB,CAAS,IAAY;EAC9C,IAAIA,CAAC,GAAGb,OAAO,EAAE;IACf,MAAM,IAAIgC,UAAU,CAAC,kDAAkD,CAAC;EAC1E;EACA,IAAInB,CAAC,GAAGX,OAAO,EAAE;IACf,OAAOW,CAAC;EACV;EACA,IAAIoB,CAAC,GAAGpB,CAAC,GAAGX,OAAO;EACnB,OAAO+B,CAAC,GAAGA,CAAC,GAAGpB,CAAC,EAAE;IAChBoB,CAAC,GAAG,CAAEpB,CAAC,GAAGoB,CAAC,GAAIA,CAAC,IAAI/B,OAAO;EAC7B;EACA,OAAO+B,CAAC;AACV,CAAC;AAED;;;;;;;;;;;;;;;;;;AAkBA,OAAO,MAAMC,IAAI,GAAIrB,CAAS,IAAyBO,sBAAsB,CAACP,CAAC,EAAEb,OAAO,CAAC,GAAG+B,UAAU,CAAClB,CAAC,CAAC,GAAGH,SAAS;AAErH;;;;;;;;;;;;;;AAcA,OAAO,MAAMyB,MAAM,GAAIC,UAA4B,IAAY;EAC7D,IAAIC,GAAG,GAAGrC,OAAO;EACjB,KAAK,MAAMa,CAAC,IAAIuB,UAAU,EAAE;IAC1BC,GAAG,IAAIxB,CAAC;EACV;EACA,OAAOwB,GAAG;AACZ,CAAC;AAED;;;;;;;;;;;;;;AAcA,OAAO,MAAMC,WAAW,GAAIF,UAA4B,IAAY;EAClE,IAAIC,GAAG,GAAGpC,OAAO;EACjB,KAAK,MAAMY,CAAC,IAAIuB,UAAU,EAAE;IAC1B,IAAIvB,CAAC,KAAKb,OAAO,EAAE;MACjB,OAAOA,OAAO;IAChB;IACAqC,GAAG,IAAIxB,CAAC;EACV;EACA,OAAOwB,GAAG;AACZ,CAAC;AAED;;;;;;;;;;;;;;;;;;AAkBA,OAAO,MAAME,QAAQ,GAAIC,CAAS,IAAwB;EACxD,IAAIA,CAAC,GAAG1C,MAAM,CAAC2C,MAAM,CAACC,gBAAgB,CAAC,IAAIF,CAAC,GAAG1C,MAAM,CAAC2C,MAAM,CAACE,gBAAgB,CAAC,EAAE;IAC9E,OAAOjC,SAAS;EAClB;EACA,OAAO+B,MAAM,CAACD,CAAC,CAAC;AAClB,CAAC;AAED;;;;;;;;;;;;;;;;;;AAkBA,OAAO,MAAMI,UAAU,GAAIC,CAAS,IAAwB;EAC1D,IAAI;IACF,OAAOA,CAAC,CAACC,IAAI,EAAE,KAAK,EAAE,GAClBpC,SAAS,GACTZ,MAAM,CAAC+C,CAAC,CAAC;EACf,CAAC,CAAC,MAAM;IACN,OAAOnC,SAAS;EAClB;AACF,CAAC;AAED;;;;;;;;;;;;;;;;;;;;AAoBA,OAAM,SAAUqC,UAAUA,CAAClC,CAAS;EAClC,IAAIA,CAAC,GAAG4B,MAAM,CAACC,gBAAgB,IAAI7B,CAAC,GAAG4B,MAAM,CAACE,gBAAgB,EAAE;IAC9D,OAAOjC,SAAS;EAClB;EAEA,IAAI;IACF,OAAOZ,MAAM,CAACe,CAAC,CAAC;EAClB,CAAC,CAAC,MAAM;IACN,OAAOH,SAAS;EAClB;AACF;AAEA;;;;;;;;;;;;;;;AAeA,OAAO,MAAMsC,SAAS,gBAiClBtD,IAAI,CAAC,CAAC,EAAE,CAACW,IAAY,EAAE4C,OAAe,KAAa5C,IAAI,GAAG4C,OAAO,CAAC;AAEtE;;;;;AAKA,OAAO,MAAMC,UAAU,gBAA4BrD,OAAO,CAACsD,IAAI,CAAC,CAACC,CAAC,EAAEZ,CAAC,KAAKY,CAAC,GAAGZ,CAAC,EAAE,EAAE,CAAC;AAEpF;;;;;AAKA,OAAO,MAAMa,eAAe,gBAA4BxD,OAAO,CAACsD,IAAI,CAAC,CAACC,CAAC,EAAEZ,CAAC,KAAKY,CAAC,GAAGZ,CAAC,EAAE,EAAE,EAAGJ,UAAU,IAAI;EACvG,IAAIkB,GAAG,GAAG,EAAE;EACZ,KAAK,MAAMzC,CAAC,IAAIuB,UAAU,EAAE;IAC1B,IAAIvB,CAAC,KAAK,EAAE,EAAE,OAAO,EAAE;IACvByC,GAAG,IAAIzC,CAAC;EACV;EACA,OAAOyC,GAAG;AACZ,CAAC,CAAC;AAEF;;;;;AAKA,OAAO,MAAMC,WAAW,gBAA8B/D,QAAQ,CAACiC,GAAG,CAACV,KAAK,CAAC;AAEzE;;;;;AAKA,OAAO,MAAMyC,WAAW,gBAA8BhE,QAAQ,CAACgC,GAAG,CAACT,KAAK,CAAC","ignoreList":[]}
+{"version":3,"file":"BigInt.js","names":["Combiner","Equ","dual","Option","order","predicate","Reducer","BigInt","globalThis","bigint0","bigint1","bigint2","isBigInt","sum","self","that","multiply","subtract","divide","none","some","divideUnsafe","increment","n","decrement","Order","Equivalence","isLessThan","isLessThanOrEqualTo","isGreaterThan","isGreaterThanOrEqualTo","between","isBetween","clamp","min","max","sign","abs","gcd","t","lcm","sqrtUnsafe","RangeError","x","sqrt","sumAll","collection","out","multiplyAll","toNumber","b","Number","MAX_SAFE_INTEGER","MIN_SAFE_INTEGER","fromString","s","trim","fromNumber","remainder","divisor","ReducerSum","make","a","ReducerMultiply","acc","CombinerMax","CombinerMin"],"sources":["../src/BigInt.ts"],"sourcesContent":[null],"mappings":"AAAA;;;;;;AAOA,OAAO,KAAKA,QAAQ,MAAM,eAAe;AACzC,OAAO,KAAKC,GAAG,MAAM,kBAAkB;AACvC,SAASC,IAAI,QAAQ,eAAe;AACpC,OAAO,KAAKC,MAAM,MAAM,aAAa;AACrC,OAAO,KAAKC,KAAK,MAAM,YAAY;AAEnC,OAAO,KAAKC,SAAS,MAAM,gBAAgB;AAC3C,OAAO,KAAKC,OAAO,MAAM,cAAc;AAEvC;;;;;;;;;;;;;;;;;AAiBA,OAAO,MAAMC,MAAM,GAAGC,UAAU,CAACD,MAAM;AAEvC,MAAME,OAAO,gBAAGF,MAAM,CAAC,CAAC,CAAC;AACzB,MAAMG,OAAO,gBAAGH,MAAM,CAAC,CAAC,CAAC;AACzB,MAAMI,OAAO,gBAAGJ,MAAM,CAAC,CAAC,CAAC;AAEzB;;;;;;;;;;;;;;;AAeA,OAAO,MAAMK,QAAQ,GAAgCP,SAAS,CAACO,QAAQ;AAEvE;;;;;;;;;;;;;;AAcA,OAAO,MAAMC,GAAG,gBA+BZX,IAAI,CAAC,CAAC,EAAE,CAACY,IAAY,EAAEC,IAAY,KAAaD,IAAI,GAAGC,IAAI,CAAC;AAEhE;;;;;;;;;;;;;;AAcA,OAAO,MAAMC,QAAQ,gBA+BjBd,IAAI,CAAC,CAAC,EAAE,CAACY,IAAY,EAAEC,IAAY,KAAaD,IAAI,GAAGC,IAAI,CAAC;AAEhE;;;;;;;;;;;;;;AAcA,OAAO,MAAME,QAAQ,gBA+BjBf,IAAI,CAAC,CAAC,EAAE,CAACY,IAAY,EAAEC,IAAY,KAAaD,IAAI,GAAGC,IAAI,CAAC;AAEhE;;;;;;;;;;;;;;;;;;;;;;AAsBA,OAAO,MAAMG,MAAM,gBA+CfhB,IAAI,CACN,CAAC,EACD,CAACY,IAAY,EAAEC,IAAY,KAA4BA,IAAI,KAAKN,OAAO,GAAGN,MAAM,CAACgB,IAAI,EAAE,GAAGhB,MAAM,CAACiB,IAAI,CAACN,IAAI,GAAGC,IAAI,CAAC,CACnH;AAED;;;;;;;;;;;;;;;;;;;;AAoBA,OAAO,MAAMM,YAAY,gBA2CrBnB,IAAI,CAAC,CAAC,EAAE,CAACY,IAAY,EAAEC,IAAY,KAAaD,IAAI,GAAGC,IAAI,CAAC;AAEhE;;;;;;;;;;;;;;AAcA,OAAO,MAAMO,SAAS,GAAIC,CAAS,IAAaA,CAAC,GAAGb,OAAO;AAE3D;;;;;;;;;;;;;;AAcA,OAAO,MAAMc,SAAS,GAAID,CAAS,IAAaA,CAAC,GAAGb,OAAO;AAE3D;;;;;;;;;;;;;;;;;;;AAmBA,OAAO,MAAMe,KAAK,GAAwBrB,KAAK,CAACG,MAAM;AAEtD;;;;;;;;;;;;;;AAcA,OAAO,MAAMmB,WAAW,GAA4BzB,GAAG,CAACM,MAAM;AAE9D;;;;;;;;;;;;;;;;AAgBA,OAAO,MAAMoB,UAAU,gBAmCnBvB,KAAK,CAACuB,UAAU,CAACF,KAAK,CAAC;AAE3B;;;;;;;;;;;;;;;;AAgBA,OAAO,MAAMG,mBAAmB,gBAmC5BxB,KAAK,CAACwB,mBAAmB,CAACH,KAAK,CAAC;AAEpC;;;;;;;;;;;;;;;;AAgBA,OAAO,MAAMI,aAAa,gBAmCtBzB,KAAK,CAACyB,aAAa,CAACJ,KAAK,CAAC;AAE9B;;;;;;;;;;;;;;;;AAgBA,OAAO,MAAMK,sBAAsB,gBAmC/B1B,KAAK,CAAC0B,sBAAsB,CAACL,KAAK,CAAC;AAEvC;;;;;;;;;;;;;;;;;;AAkBA,OAAO,MAAMM,OAAO,gBAkDhB3B,KAAK,CAAC4B,SAAS,CAACP,KAAK,CAAC;AAE1B;;;;;;;;;;;;;;;;;;;;;;AAsBA,OAAO,MAAMQ,KAAK,gBA0Dd7B,KAAK,CAAC6B,KAAK,CAACR,KAAK,CAAC;AAEtB;;;;;;;;;;;;;;AAcA,OAAO,MAAMS,GAAG,gBA+BZ9B,KAAK,CAAC8B,GAAG,CAACT,KAAK,CAAC;AAEpB;;;;;;;;;;;;;;AAcA,OAAO,MAAMU,GAAG,gBA+BZ/B,KAAK,CAAC+B,GAAG,CAACV,KAAK,CAAC;AAEpB;;;;;;;;;;;;;;;;AAgBA,OAAO,MAAMW,IAAI,GAAIb,CAAS,IAAenB,KAAK,CAACG,MAAM,CAACgB,CAAC,EAAEd,OAAO,CAAC;AAErE;;;;;;;;;;;;;;;;AAgBA,OAAO,MAAM4B,GAAG,GAAId,CAAS,IAAcA,CAAC,GAAGd,OAAO,GAAG,CAACc,CAAC,GAAGA,CAAE;AAEhE;;;;;;;;;;;;;;;;AAgBA,OAAO,MAAMe,GAAG,gBAmCZpC,IAAI,CAAC,CAAC,EAAE,CAACY,IAAY,EAAEC,IAAY,KAAY;EACjD,OAAOA,IAAI,KAAKN,OAAO,EAAE;IACvB,MAAM8B,CAAC,GAAGxB,IAAI;IACdA,IAAI,GAAGD,IAAI,GAAGC,IAAI;IAClBD,IAAI,GAAGyB,CAAC;EACV;EACA,OAAOzB,IAAI;AACb,CAAC,CAAC;AAEF;;;;;;;;;;;;;;;;AAgBA,OAAO,MAAM0B,GAAG,gBAmCZtC,IAAI,CAAC,CAAC,EAAE,CAACY,IAAY,EAAEC,IAAY,KAAcD,IAAI,GAAGC,IAAI,GAAIuB,GAAG,CAACxB,IAAI,EAAEC,IAAI,CAAC,CAAC;AAEpF;;;;;;;;;;;;;;;;AAgBA,OAAO,MAAM0B,UAAU,GAAIlB,CAAS,IAAY;EAC9C,IAAIA,CAAC,GAAGd,OAAO,EAAE;IACf,MAAM,IAAIiC,UAAU,CAAC,kDAAkD,CAAC;EAC1E;EACA,IAAInB,CAAC,GAAGZ,OAAO,EAAE;IACf,OAAOY,CAAC;EACV;EACA,IAAIoB,CAAC,GAAGpB,CAAC,GAAGZ,OAAO;EACnB,OAAOgC,CAAC,GAAGA,CAAC,GAAGpB,CAAC,EAAE;IAChBoB,CAAC,GAAG,CAAEpB,CAAC,GAAGoB,CAAC,GAAIA,CAAC,IAAIhC,OAAO;EAC7B;EACA,OAAOgC,CAAC;AACV,CAAC;AAED;;;;;;;;;;;;;;;;;;AAkBA,OAAO,MAAMC,IAAI,GAAIrB,CAAS,IAC5BO,sBAAsB,CAACP,CAAC,EAAEd,OAAO,CAAC,GAAGN,MAAM,CAACiB,IAAI,CAACqB,UAAU,CAAClB,CAAC,CAAC,CAAC,GAAGpB,MAAM,CAACgB,IAAI,EAAE;AAEjF;;;;;;;;;;;;;;AAcA,OAAO,MAAM0B,MAAM,GAAIC,UAA4B,IAAY;EAC7D,IAAIC,GAAG,GAAGtC,OAAO;EACjB,KAAK,MAAMc,CAAC,IAAIuB,UAAU,EAAE;IAC1BC,GAAG,IAAIxB,CAAC;EACV;EACA,OAAOwB,GAAG;AACZ,CAAC;AAED;;;;;;;;;;;;;;AAcA,OAAO,MAAMC,WAAW,GAAIF,UAA4B,IAAY;EAClE,IAAIC,GAAG,GAAGrC,OAAO;EACjB,KAAK,MAAMa,CAAC,IAAIuB,UAAU,EAAE;IAC1B,IAAIvB,CAAC,KAAKd,OAAO,EAAE;MACjB,OAAOA,OAAO;IAChB;IACAsC,GAAG,IAAIxB,CAAC;EACV;EACA,OAAOwB,GAAG;AACZ,CAAC;AAED;;;;;;;;;;;;;;;;;;AAkBA,OAAO,MAAME,QAAQ,GAAIC,CAAS,IAA2B;EAC3D,IAAIA,CAAC,GAAG3C,MAAM,CAAC4C,MAAM,CAACC,gBAAgB,CAAC,IAAIF,CAAC,GAAG3C,MAAM,CAAC4C,MAAM,CAACE,gBAAgB,CAAC,EAAE;IAC9E,OAAOlD,MAAM,CAACgB,IAAI,EAAE;EACtB;EACA,OAAOhB,MAAM,CAACiB,IAAI,CAAC+B,MAAM,CAACD,CAAC,CAAC,CAAC;AAC/B,CAAC;AAED;;;;;;;;;;;;;;;;;;AAkBA,OAAO,MAAMI,UAAU,GAAIC,CAAS,IAA2B;EAC7D,IAAI;IACF,OAAOA,CAAC,CAACC,IAAI,EAAE,KAAK,EAAE,GAClBrD,MAAM,CAACgB,IAAI,EAAE,GACbhB,MAAM,CAACiB,IAAI,CAACb,MAAM,CAACgD,CAAC,CAAC,CAAC;EAC5B,CAAC,CAAC,MAAM;IACN,OAAOpD,MAAM,CAACgB,IAAI,EAAE;EACtB;AACF,CAAC;AAED;;;;;;;;;;;;;;;;;;;;AAoBA,OAAM,SAAUsC,UAAUA,CAAClC,CAAS;EAClC,IAAIA,CAAC,GAAG4B,MAAM,CAACC,gBAAgB,IAAI7B,CAAC,GAAG4B,MAAM,CAACE,gBAAgB,EAAE;IAC9D,OAAOlD,MAAM,CAACgB,IAAI,EAAE;EACtB;EAEA,IAAI;IACF,OAAOhB,MAAM,CAACiB,IAAI,CAACb,MAAM,CAACgB,CAAC,CAAC,CAAC;EAC/B,CAAC,CAAC,MAAM;IACN,OAAOpB,MAAM,CAACgB,IAAI,EAAE;EACtB;AACF;AAEA;;;;;;;;;;;;;;;AAeA,OAAO,MAAMuC,SAAS,gBAiClBxD,IAAI,CAAC,CAAC,EAAE,CAACY,IAAY,EAAE6C,OAAe,KAAa7C,IAAI,GAAG6C,OAAO,CAAC;AAEtE;;;;;AAKA,OAAO,MAAMC,UAAU,gBAA4BtD,OAAO,CAACuD,IAAI,CAAC,CAACC,CAAC,EAAEZ,CAAC,KAAKY,CAAC,GAAGZ,CAAC,EAAE,EAAE,CAAC;AAEpF;;;;;AAKA,OAAO,MAAMa,eAAe,gBAA4BzD,OAAO,CAACuD,IAAI,CAAC,CAACC,CAAC,EAAEZ,CAAC,KAAKY,CAAC,GAAGZ,CAAC,EAAE,EAAE,EAAGJ,UAAU,IAAI;EACvG,IAAIkB,GAAG,GAAG,EAAE;EACZ,KAAK,MAAMzC,CAAC,IAAIuB,UAAU,EAAE;IAC1B,IAAIvB,CAAC,KAAK,EAAE,EAAE,OAAO,EAAE;IACvByC,GAAG,IAAIzC,CAAC;EACV;EACA,OAAOyC,GAAG;AACZ,CAAC,CAAC;AAEF;;;;;AAKA,OAAO,MAAMC,WAAW,gBAA8BjE,QAAQ,CAACmC,GAAG,CAACV,KAAK,CAAC;AAEzE;;;;;AAKA,OAAO,MAAMyC,WAAW,gBAA8BlE,QAAQ,CAACkC,GAAG,CAACT,KAAK,CAAC","ignoreList":[]}

package/dist/Chunk.d.ts

@@ -77,6 +77,7 @@ import type { TypeLambda } from "./HKT.ts";
 import { type Inspectable } from "./Inspectable.ts";
 import type { NonEmptyIterable } from "./NonEmptyIterable.ts";
 import type { Option } from "./Option.ts";
+import * as O from "./Option.ts";
 import * as Order from "./Order.ts";
 import type { Pipeable } from "./Pipeable.ts";
 import { type Predicate, type Refinement } from "./Predicate.ts";
@@ -2927,7 +2928,7 @@ export declare const splitWhere: {
  * @since 2.0.0
  * @category elements
  */
-export declare const tail: <A>(self: Chunk<A>) => Chunk<A> | undefined;
+export declare const tail: <A>(self: Chunk<A>) => O.Option<Chunk<A>>;
 /**
  * Returns every elements after the first.
  *
@@ -3519,15 +3520,15 @@ export declare const remove: {
  *
  * const chunk = Chunk.make(1, 2, 3, 4)
  * const result = Chunk.modify(chunk, 1, (n) => n * 10)
- * console.log(result) // { _id: 'Chunk', values: [ 1, 20, 3, 4 ] }
+ * console.log(result) // Option.some(Chunk.make(1, 20, 3, 4))
  *
  * // Index out of bounds returns None
- * const outOfBounds = chunk?.pipe(Chunk.modify(10, (n) => n * 10))
- * console.log(outOfBounds === undefined) // true
+ * const outOfBounds = chunk.pipe(Chunk.modify(10, (n) => n * 10))
+ * console.log(outOfBounds) // Option.none()
  *
  * // Negative index returns None
- * const negative = chunk?.pipe(Chunk.modify(-1, (n) => n * 10))
- * console.log(negative === undefined) // true
+ * const negative = chunk.pipe(Chunk.modify(-1, (n) => n * 10))
+ * console.log(negative) // Option.none()
  * ```
  *
  * @category elements
@@ -3544,21 +3545,21 @@ export declare const modify: {
      *
      * const chunk = Chunk.make(1, 2, 3, 4)
      * const result = Chunk.modify(chunk, 1, (n) => n * 10)
-     * console.log(result) // { _id: 'Chunk', values: [ 1, 20, 3, 4 ] }
+     * console.log(result) // Option.some(Chunk.make(1, 20, 3, 4))
      *
      * // Index out of bounds returns None
-     * const outOfBounds = chunk?.pipe(Chunk.modify(10, (n) => n * 10))
-     * console.log(outOfBounds === undefined) // true
+     * const outOfBounds = chunk.pipe(Chunk.modify(10, (n) => n * 10))
+     * console.log(outOfBounds) // Option.none()
      *
      * // Negative index returns None
-     * const negative = chunk?.pipe(Chunk.modify(-1, (n) => n * 10))
-     * console.log(negative === undefined) // true
+     * const negative = chunk.pipe(Chunk.modify(-1, (n) => n * 10))
+     * console.log(negative) // Option.none()
      * ```
      *
      * @category elements
      * @since 2.0.0
      */
-    <A, B>(i: number, f: (a: A) => B): (self: Chunk<A>) => Chunk<A | B> | undefined;
+    <A, B>(i: number, f: (a: A) => B): (self: Chunk<A>) => O.Option<Chunk<A | B>>;
     /**
      * Applies a function to the element at the specified index, creating a new `Chunk`,
      * or returns `None` if the index is out of bounds.
@@ -3569,21 +3570,21 @@ export declare const modify: {
      *
      * const chunk = Chunk.make(1, 2, 3, 4)
      * const result = Chunk.modify(chunk, 1, (n) => n * 10)
-     * console.log(result) // { _id: 'Chunk', values: [ 1, 20, 3, 4 ] }
+     * console.log(result) // Option.some(Chunk.make(1, 20, 3, 4))
      *
      * // Index out of bounds returns None
-     * const outOfBounds = chunk?.pipe(Chunk.modify(10, (n) => n * 10))
-     * console.log(outOfBounds === undefined) // true
+     * const outOfBounds = chunk.pipe(Chunk.modify(10, (n) => n * 10))
+     * console.log(outOfBounds) // Option.none()
      *
      * // Negative index returns None
-     * const negative = chunk?.pipe(Chunk.modify(-1, (n) => n * 10))
-     * console.log(negative === undefined) // true
+     * const negative = chunk.pipe(Chunk.modify(-1, (n) => n * 10))
+     * console.log(negative) // Option.none()
      * ```
      *
      * @category elements
      * @since 2.0.0
      */
-    <A, B>(self: Chunk<A>, i: number, f: (a: A) => B): Chunk<A | B> | undefined;
+    <A, B>(self: Chunk<A>, i: number, f: (a: A) => B): O.Option<Chunk<A | B>>;
 };
 /**
  * Change the element at the specified index, creating a new `Chunk`,
@@ -3595,15 +3596,15 @@ export declare const modify: {
  *
  * const chunk = Chunk.make("a", "b", "c", "d")
  * const result = Chunk.replace(chunk, 1, "X")
- * console.log(result) // { _id: 'Chunk', values: [ 'a', 'X', 'c', 'd' ] }
+ * console.log(result) // Option.some(Chunk.make("a", "X", "c", "d"))
  *
  * // Index out of bounds returns None
- * const outOfBounds = chunk?.pipe(Chunk.replace(10, "Y"))
- * console.log(outOfBounds === undefined) // true
+ * const outOfBounds = chunk.pipe(Chunk.replace(10, "Y"))
+ * console.log(outOfBounds) // Option.none()
  *
  * // Negative index returns None
- * const negative = chunk?.pipe(Chunk.replace(-1, "Z"))
- * console.log(negative === undefined) // true
+ * const negative = chunk.pipe(Chunk.replace(-1, "Z"))
+ * console.log(negative) // Option.none()
  * ```
  *
  * @category elements
@@ -3620,21 +3621,21 @@ export declare const replace: {
      *
      * const chunk = Chunk.make("a", "b", "c", "d")
      * const result = Chunk.replace(chunk, 1, "X")
-     * console.log(result) // { _id: 'Chunk', values: [ 'a', 'X', 'c', 'd' ] }
+     * console.log(result) // Option.some(Chunk.make("a", "X", "c", "d"))
      *
      * // Index out of bounds returns None
-     * const outOfBounds = chunk?.pipe(Chunk.replace(10, "Y"))
-     * console.log(outOfBounds === undefined) // true
+     * const outOfBounds = chunk.pipe(Chunk.replace(10, "Y"))
+     * console.log(outOfBounds) // Option.none()
      *
      * // Negative index returns None
-     * const negative = chunk?.pipe(Chunk.replace(-1, "Z"))
-     * console.log(negative === undefined) // true
+     * const negative = chunk.pipe(Chunk.replace(-1, "Z"))
+     * console.log(negative) // Option.none()
      * ```
      *
      * @category elements
      * @since 2.0.0
      */
-    <B>(i: number, b: B): <A>(self: Chunk<A>) => Chunk<B | A> | undefined;
+    <B>(i: number, b: B): <A>(self: Chunk<A>) => O.Option<Chunk<B | A>>;
     /**
      * Change the element at the specified index, creating a new `Chunk`,
      * or returns `None` if the index is out of bounds.
@@ -3645,21 +3646,21 @@ export declare const replace: {
      *
      * const chunk = Chunk.make("a", "b", "c", "d")
      * const result = Chunk.replace(chunk, 1, "X")
-     * console.log(result) // { _id: 'Chunk', values: [ 'a', 'X', 'c', 'd' ] }
+     * console.log(result) // Option.some(Chunk.make("a", "X", "c", "d"))
      *
      * // Index out of bounds returns None
-     * const outOfBounds = chunk?.pipe(Chunk.replace(10, "Y"))
-     * console.log(outOfBounds === undefined) // true
+     * const outOfBounds = chunk.pipe(Chunk.replace(10, "Y"))
+     * console.log(outOfBounds) // Option.none()
      *
      * // Negative index returns None
-     * const negative = chunk?.pipe(Chunk.replace(-1, "Z"))
-     * console.log(negative === undefined) // true
+     * const negative = chunk.pipe(Chunk.replace(-1, "Z"))
+     * console.log(negative) // Option.none()
      * ```
      *
      * @category elements
      * @since 2.0.0
      */
-    <A, B>(self: Chunk<A>, i: number, b: B): Chunk<B | A> | undefined;
+    <A, B>(self: Chunk<A>, i: number, b: B): O.Option<Chunk<B | A>>;
 };
 /**
  * Return a Chunk of length n with element i initialized with f(i).
@@ -4000,15 +4001,15 @@ export declare const findFirst: {
  *
  * const chunk = Chunk.make(1, 2, 3, 4, 5)
  * const result = Chunk.findFirstIndex(chunk, (n) => n > 3)
- * console.log(result) // 3
+ * console.log(result) // Option.some(3)
  *
  * // No match found
  * const notFound = Chunk.findFirstIndex(chunk, (n) => n > 10)
- * console.log(notFound) // undefined
+ * console.log(notFound) // Option.none()
  *
  * // Find first even number
  * const firstEven = Chunk.findFirstIndex(chunk, (n) => n % 2 === 0)
- * console.log(firstEven) // 1
+ * console.log(firstEven) // Option.some(1)
  * ```
  *
  * @category elements
@@ -4024,21 +4025,21 @@ export declare const findFirstIndex: {
      *
      * const chunk = Chunk.make(1, 2, 3, 4, 5)
      * const result = Chunk.findFirstIndex(chunk, (n) => n > 3)
-     * console.log(result) // 3
+     * console.log(result) // Option.some(3)
      *
      * // No match found
      * const notFound = Chunk.findFirstIndex(chunk, (n) => n > 10)
-     * console.log(notFound) // undefined
+     * console.log(notFound) // Option.none()
      *
      * // Find first even number
      * const firstEven = Chunk.findFirstIndex(chunk, (n) => n % 2 === 0)
-     * console.log(firstEven) // 1
+     * console.log(firstEven) // Option.some(1)
      * ```
      *
      * @category elements
      * @since 2.0.0
      */
-    <A>(predicate: Predicate<A>): (self: Chunk<A>) => number | undefined;
+    <A>(predicate: Predicate<A>): (self: Chunk<A>) => O.Option<number>;
     /**
      * Return the first index for which a predicate holds.
      *
@@ -4048,21 +4049,21 @@ export declare const findFirstIndex: {
      *
      * const chunk = Chunk.make(1, 2, 3, 4, 5)
      * const result = Chunk.findFirstIndex(chunk, (n) => n > 3)
-     * console.log(result) // 3
+     * console.log(result) // Option.some(3)
      *
      * // No match found
      * const notFound = Chunk.findFirstIndex(chunk, (n) => n > 10)
-     * console.log(notFound) // undefined
+     * console.log(notFound) // Option.none()
      *
      * // Find first even number
      * const firstEven = Chunk.findFirstIndex(chunk, (n) => n % 2 === 0)
-     * console.log(firstEven) // 1
+     * console.log(firstEven) // Option.some(1)
      * ```
      *
      * @category elements
      * @since 2.0.0
      */
-    <A>(self: Chunk<A>, predicate: Predicate<A>): number | undefined;
+    <A>(self: Chunk<A>, predicate: Predicate<A>): O.Option<number>;
 };
 /**
  * Find the last element for which a predicate holds.
@@ -4204,15 +4205,15 @@ export declare const findLast: {
  *
  * const chunk = Chunk.make(1, 2, 3, 4, 5)
  * const result = Chunk.findLastIndex(chunk, (n) => n < 4)
- * console.log(result) // 2
+ * console.log(result) // Option.some(2)
  *
  * // No match found
  * const notFound = Chunk.findLastIndex(chunk, (n) => n > 10)
- * console.log(notFound) // undefined
+ * console.log(notFound) // Option.none()
  *
  * // Find last even number index
  * const lastEven = Chunk.findLastIndex(chunk, (n) => n % 2 === 0)
- * console.log(lastEven) // 3
+ * console.log(lastEven) // Option.some(3)
  * ```
  *
  * @category elements
@@ -4228,21 +4229,21 @@ export declare const findLastIndex: {
      *
      * const chunk = Chunk.make(1, 2, 3, 4, 5)
      * const result = Chunk.findLastIndex(chunk, (n) => n < 4)
-     * console.log(result) // 2
+     * console.log(result) // Option.some(2)
      *
      * // No match found
      * const notFound = Chunk.findLastIndex(chunk, (n) => n > 10)
-     * console.log(notFound) // undefined
+     * console.log(notFound) // Option.none()
      *
      * // Find last even number index
      * const lastEven = Chunk.findLastIndex(chunk, (n) => n % 2 === 0)
-     * console.log(lastEven) // 3
+     * console.log(lastEven) // Option.some(3)
      * ```
      *
      * @category elements
      * @since 2.0.0
      */
-    <A>(predicate: Predicate<A>): (self: Chunk<A>) => number | undefined;
+    <A>(predicate: Predicate<A>): (self: Chunk<A>) => O.Option<number>;
     /**
      * Return the last index for which a predicate holds.
      *
@@ -4252,21 +4253,21 @@ export declare const findLastIndex: {
      *
      * const chunk = Chunk.make(1, 2, 3, 4, 5)
      * const result = Chunk.findLastIndex(chunk, (n) => n < 4)
-     * console.log(result) // 2
+     * console.log(result) // Option.some(2)
      *
      * // No match found
      * const notFound = Chunk.findLastIndex(chunk, (n) => n > 10)
-     * console.log(notFound) // undefined
+     * console.log(notFound) // Option.none()
      *
      * // Find last even number index
      * const lastEven = Chunk.findLastIndex(chunk, (n) => n % 2 === 0)
-     * console.log(lastEven) // 3
+     * console.log(lastEven) // Option.some(3)
      * ```
      *
      * @category elements
      * @since 2.0.0
      */
-    <A>(self: Chunk<A>, predicate: Predicate<A>): number | undefined;
+    <A>(self: Chunk<A>, predicate: Predicate<A>): O.Option<number>;
 };
 /**
  * Check if a predicate holds true for every `Chunk` element.