@tempots/std 0.24.0 → 0.25.1

package/string.js

@@ -1,4 +1,4 @@
-import { MissingImplementationError as p } from "./error.js";
+import { MissingImplementationError as h } from "./error.js";
 import { mapRegExp as l } from "./regexp.js";
 const Z = (t, n) => {
   const e = t.indexOf(n);
@@ -12,68 +12,69 @@ const Z = (t, n) => {
 }, R = (t, n) => {
   const e = t.lastIndexOf(n);
   return e < 0 ? "" : t.substring(0, e);
-}, g = (t) => t.substring(0, 1).toUpperCase() + t.substring(1), f = (t) => t.toUpperCase(), F = (t, n = !1) => n ? l(g(t), _, f) : l(g(t), z, f), G = (t) => t.replace($, `
-`), Q = (t, n) => t == null && n == null ? 0 : t == null ? -1 : n == null ? 1 : b(t.toLowerCase(), n.toLowerCase()), K = (t, n) => t.substring(t.length - n.length).toLowerCase() === n.toLowerCase(), q = (t, n) => t.substring(0, n.length).toLowerCase() === n.toLowerCase(), J = (t, n) => S(
+}, g = (t) => t.substring(0, 1).toUpperCase() + t.substring(1), a = (t) => t.toUpperCase(), F = (t, n = !1) => n ? l(g(t), _, a) : l(g(t), z, a), G = (t) => t.replace($, `
+`), Q = (t, n) => t == null && n == null ? 0 : t == null ? -1 : n == null ? 1 : S(t.toLowerCase(), n.toLowerCase()), K = (t, n) => t.substring(t.length - n.length).toLowerCase() === n.toLowerCase(), q = (t, n) => t.substring(0, n.length).toLowerCase() === n.toLowerCase(), J = (t, n) => A(
   t.toLowerCase(),
   n.map((e) => e.toLowerCase())
 ), V = (t, n) => y(
   t.toLowerCase(),
   n.map((e) => e.toLowerCase())
-), X = (t) => t.trim().replace(d, " "), b = (t, n) => t < n ? -1 : t > n ? 1 : 0, h = (t, n) => t.toLowerCase().includes(n.toLowerCase()), Y = (t, n) => t.split(n).length - 1, v = (t, n) => n.some((e) => h(t, e)), tt = (t, n) => n.some((e) => t.includes(e)), nt = (t, n) => n.every((e) => h(t, e)), et = (t, n) => n.every((e) => t.includes(e)), rt = (t) => t.replace(/_/g, "-"), st = (t, n) => {
+), X = (t) => t.trim().replace(d, " "), S = (t, n) => t < n ? -1 : t > n ? 1 : 0, p = (t, n) => t.toLowerCase().includes(n.toLowerCase()), Y = (t, n) => t.split(n).length - 1, v = (t, n) => n.some((e) => p(t, e)), tt = (t, n) => n.some((e) => t.includes(e)), nt = (t, n) => n.every((e) => p(t, e)), et = (t, n) => n.every((e) => t.includes(e)), rt = (t) => t.replace(/_/g, "-"), st = (t, n) => {
   if (t === n) return -1;
   const e = Math.min(t.length, n.length);
   for (let r = 0; r < e; r++)
     if (t.substring(r, r + 1) !== n.substring(r, r + 1)) return r;
   return e;
-}, A = (t, n = 20, e = "…") => {
+}, b = (t, n = 20, e = "…") => {
   const r = t.length, s = e.length;
   return r > n ? n < s ? e.slice(s - n, n) : t.slice(0, n - s) + e : t;
 }, it = (t, n = 20, e = "…") => {
   const r = t.length, s = e.length;
   if (r > n) {
     if (n <= s)
-      return A(t, n, e);
+      return b(t, n, e);
     const c = Math.ceil((n - s) / 2), u = Math.floor((n - s) / 2);
     return t.slice(0, c) + e + t.slice(r - u);
   } else return t;
-}, S = (t, n) => n.some((e) => t.endsWith(e)), ot = (t, n) => Array.from(t).filter(n).join(""), ct = (t, n) => x(t).filter(n).map((r) => String.fromCharCode(r)).join(""), ut = (t, n = 2166136261) => {
+}, A = (t, n) => n.some((e) => t.endsWith(e)), ot = (t, n) => Array.from(t).filter(n).join(""), ct = (t, n) => x(t).filter(n).map((r) => String.fromCharCode(r)).join(""), ut = (t, n = 2166136261) => {
   let e = n;
   for (let r = 0, s = t.length; r < s; r++)
     e ^= t.charCodeAt(r), e += (e << 1) + (e << 4) + (e << 7) + (e << 8) + (e << 24);
   return e >>> 0;
-}, lt = (t) => t != null && t.length > 0, gt = (t) => E(t).split("_").join(" "), ft = (t) => t.length > 0 && !N.test(t), at = (t) => M.test(t), pt = (t) => !T.test(t), ht = (t) => t.toLowerCase() === t, dt = (t) => t.toUpperCase() === t, Ct = (t, n) => t != null && t !== "" ? t : n, bt = (t) => U.test(t), At = (t) => t == null || t === "", St = (t) => t.substring(0, 1).toLowerCase() + t.substring(1), L = (t, n = 1) => {
+}, lt = (t) => t != null && t.length > 0, gt = (t) => E(t).split("_").join(" "), at = (t) => t.length > 0 && !N.test(t), ft = (t) => M.test(t), ht = (t) => !T.test(t), pt = (t) => t.toLowerCase() === t, dt = (t) => t.toUpperCase() === t, Ct = (t, n) => t != null && t !== "" ? t : n, St = (t) => U.test(t), bt = (t) => t == null || t === "", At = (t) => t.substring(0, 1).toLowerCase() + t.substring(1), L = (t, n = 1) => {
   const e = Math.floor((t.length - n + 1) * Math.random());
   return t.substring(e, e + n);
-}, m = (t, n) => Array.from({ length: n }, () => L(t)).join(""), Lt = (t) => m(j, t), mt = (t, n) => Array.from(n).map(t), wt = (t, n) => t.split(n).join(""), It = (t, n) => t.endsWith(n) ? t.substring(0, t.length - n.length) : t, yt = (t, n, e) => t.substring(0, n) + t.substring(n + e), xt = (t, n) => t.startsWith(n) ? t.substring(n.length) : t, Ot = (t, n) => {
+}, w = (t, n) => Array.from({ length: n }, () => L(t)).join(""), Lt = (t) => w(j, t), wt = (t, n) => Array.from(n).map(t), mt = (t, n) => t.split(n).join(""), It = (t, n) => t.endsWith(n) ? t.substring(0, t.length - n.length) : t, yt = (t, n, e) => t.substring(0, n) + t.substring(n + e), xt = (t, n) => t.startsWith(n) ? t.substring(n.length) : t, Ot = (t, n) => {
   const e = t.indexOf(n);
   return e < 0 ? t : t.substring(0, e) + t.substring(e + n.length);
 }, Wt = (t) => {
   const n = Array.from(t);
   return n.reverse(), n.join("");
-}, w = (t, n = "'") => n === "'" ? t.includes("'") ? t.includes('"') ? "'" + t.split("'").join("\\'") + "'" : '"' + t + '"' : "'" + t + "'" : t.includes('"') ? t.includes("'") ? '"' + t.split('"').join('\\"') + '"' : "'" + t + "'" : '"' + t + '"', I = (t, n = "'") => n + t.split(n).join("\\" + n) + n, Et = (t, n = "'") => t.indexOf(`
-`) >= 0 ? I(t, "`") : w(t, n), Bt = (t, n) => {
+}, m = (t, n = "'") => n === "'" ? t.includes("'") ? t.includes('"') ? "'" + t.split("'").join("\\'") + "'" : '"' + t + '"' : "'" + t + "'" : t.includes('"') ? t.includes("'") ? '"' + t.split('"').join('\\"') + '"' : "'" + t + "'" : '"' + t + '"', I = (t, n = "'") => n + t.split(n).join("\\" + n) + n, Et = (t, n = "'") => t.indexOf(`
+`) >= 0 ? I(t, "`") : m(t, n), Bt = (t, n) => {
   const e = t.indexOf(n);
   return e < 0 ? [t] : [t.substring(0, e), t.substring(e + n.length)];
 }, y = (t, n) => n.some((e) => t.startsWith(e)), jt = (t, n, e = n) => `${n}${t}${e}`, x = (t) => Array.from({ length: t.length }, (n, e) => t.charCodeAt(e)), zt = (t, n) => {
   const e = [];
-  for (; t.length > 0; )
-    e.push(t.substring(0, n)), t = t.substring(n);
+  for (let r = 0; r < t.length; r += n)
+    e.push(t.substring(r, r + n));
   return e;
 }, Tt = (t) => t.split(C), Nt = (t, n) => W(O(t, n), n), O = (t, n) => {
-  let e = 0;
-  for (let r = 0; r < t.length && n.includes(t.charAt(r)); r++)
-    e++;
-  return t.substring(e);
+  const e = new Set(n);
+  let r = 0;
+  for (let s = 0; s < t.length && e.has(t.charAt(s)); s++)
+    r++;
+  return t.substring(r);
 }, W = (t, n) => {
-  const e = t.length;
-  let r = e, s;
-  for (let c = 0; c < e && (s = e - c - 1, n.includes(t.charAt(s))); c++)
-    r = s;
-  return t.substring(0, r);
+  const e = new Set(n), r = t.length;
+  let s = r, c;
+  for (let u = 0; u < r && (c = r - u - 1, e.has(t.charAt(c))); u++)
+    s = c;
+  return t.substring(0, s);
 }, E = (t) => (t = t.replace(/::/g, "/"), t = t.replace(/([A-Z]+)([A-Z][a-z])/g, "$1_$2"), t = t.replace(/([a-z\d])([A-Z])/g, "$1_$2"), t = t.replace(/-/g, "_"), t.toLowerCase()), _t = (t) => t.substring(0, 1).toUpperCase() + t.substring(1), Mt = (t, n = 78, e = "", r = `
 `) => t.split(C).map(
   (s) => B(s.replace(d, " ").trim(), n, e, r)
-).join(r), a = (t, n) => {
+).join(r), f = (t, n) => {
   if (n < 0 || n >= t.length) return !1;
   const e = t.charCodeAt(n);
   return e === 9 || e === 10 || e === 11 || e === 12 || e === 13 || e === 32;
@@ -82,7 +83,7 @@ const Z = (t, n) => {
     return Buffer.from(t).toString("base64");
   if (typeof btoa < "u")
     return btoa(t);
-  throw new p(
+  throw new h(
     "No implementation found for base64 encoding"
   );
 }, $t = (t) => {
@@ -90,7 +91,7 @@ const Z = (t, n) => {
     return Buffer.from(t, "base64").toString("utf8");
   if (typeof atob < "u")
     return atob(t);
-  throw new p(
+  throw new h(
     "No implementation found for base64 decoding"
   );
 }, B = (t, n, e, r) => {
@@ -102,9 +103,9 @@ const Z = (t, n) => {
       break;
     }
     let i = 0;
-    for (; !a(t, o + n - i) && i < n; ) i++;
+    for (; !f(t, o + n - i) && i < n; ) i++;
     if (i === n) {
-      for (i = 0; !a(t, o + n + i) && o + n + i < c; ) i++;
+      for (i = 0; !f(t, o + n + i) && o + n + i < c; ) i++;
       s.push(t.substring(o, o + n + i)), o += n + i + 1;
     } else
       s.push(t.substring(o, o + n - i)), o += n - i + 1;
@@ -130,7 +131,7 @@ export {
   zt as chunkString,
   X as collapseText,
   Q as compareCaseInsensitive,
-  b as compareStrings,
+  S as compareStrings,
   et as containsAllText,
   nt as containsAllTextCaseInsensitive,
   tt as containsAnyText,
@@ -141,37 +142,37 @@ export {
   Ot as deleteFirstFromString,
   It as deleteStringAfter,
   xt as deleteStringBefore,
-  wt as deleteSubstring,
-  A as ellipsis,
+  mt as deleteSubstring,
+  b as ellipsis,
   it as ellipsisMiddle,
   Ut as encodeBase64,
   ct as filterCharcodes,
   ot as filterChars,
   gt as humanize,
   Ct as ifEmptyString,
-  ft as isAlpha,
-  at as isAlphaNum,
-  pt as isBreakingWhitespace,
-  bt as isDigitsOnly,
-  At as isEmptyString,
-  ht as isLowerCase,
-  a as isSpaceAt,
+  at as isAlpha,
+  ft as isAlphaNum,
+  ht as isBreakingWhitespace,
+  St as isDigitsOnly,
+  bt as isEmptyString,
+  pt as isLowerCase,
+  f as isSpaceAt,
   dt as isUpperCase,
   Et as jsQuote,
-  St as lowerCaseFirst,
+  At as lowerCaseFirst,
   kt as lpad,
-  mt as mapChars,
+  wt as mapChars,
   I as quote,
-  m as randomStringSequence,
+  w as randomStringSequence,
   Lt as randomStringSequenceBase64,
   L as randomSubString,
   Wt as reverseString,
   Ht as rpad,
-  w as smartQuote,
+  m as smartQuote,
   Dt as splitStringOnFirst,
   Zt as splitStringOnLast,
   Bt as splitStringOnce,
-  S as stringEndsWithAny,
+  A as stringEndsWithAny,
   lt as stringHasContent,
   ut as stringHashCode,
   y as stringStartsWithAny,
@@ -182,7 +183,7 @@ export {
   P as substringBefore,
   R as substringBeforeLast,
   jt as surroundString,
-  h as textContainsCaseInsensitive,
+  p as textContainsCaseInsensitive,
   J as textEndsWithAnyCaseInsensitive,
   K as textEndsWithCaseInsensitive,
   V as textStartsWithAnyCaseInsensitive,

package/timer.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const p=(n,e)=>{const t=setTimeout(n,e);return()=>clearTimeout(t)},b=(n,e)=>{const t=setInterval(n,e);return()=>clearInterval(t)};function F(n,e,t={}){const{noTrailing:o=!1,noLeading:l=!1,debounceMode:i}=t;let a,f=!1,c=0;function m(){a&&clearTimeout(a)}function T(u){const{upcomingOnly:s=!1}=u||{};m(),f=!s}function d(...u){if(f)return;const s=this,v=Date.now()-c;function r(){c=Date.now(),e.apply(s,u)}function A(){a=void 0}!l&&i&&!a&&r(),m(),i===void 0&&v>n?l?(c=Date.now(),o||(a=setTimeout(i?A:r,n))):r():o||(a=setTimeout(i?A:r,i===void 0?Math.max(0,n-v):n))}return d.cancel=T,d}function g(n,e,{atBegin:t=!1}={}){return F(n,e,{debounceMode:t!==!1})}const y=n=>{let e=null;const t=l=>{e=null,n(l)};return(()=>{e==null&&(e=requestAnimationFrame(t))})(),()=>{e!=null&&(cancelAnimationFrame(e),e=null)}},I=n=>{let e=null;const t=l=>{e=requestAnimationFrame(t),n(l)};return(()=>{e==null&&(e=requestAnimationFrame(t))})(),()=>{e!=null&&(cancelAnimationFrame(e),e=null)}};exports.debounce=g;exports.delayed=p;exports.delayedAnimationFrame=y;exports.interval=b;exports.intervalAnimationFrame=I;exports.throttle=F;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const p=(n,e)=>{let t=()=>{};const i=setTimeout(()=>{const l=n();l!=null&&(t=l)},e);return()=>{clearTimeout(i),t()}},I=(n,e)=>{let t=()=>{};const i=setInterval(()=>{const l=n();l!=null&&(t=l)},e);return()=>{clearInterval(i),t()}};function A(n,e,t={}){const{noTrailing:i=!1,noLeading:l=!1,debounceMode:o}=t;let a,f=!1,c=0;function m(){a&&clearTimeout(a)}function T(u){const{upcomingOnly:s=!1}=u||{};m(),f=!s}function d(...u){if(f)return;const s=this,v=Date.now()-c;function r(){c=Date.now(),e.apply(s,u)}function F(){a=void 0}!l&&o&&!a&&r(),m(),o===void 0&&v>n?l?(c=Date.now(),i||(a=setTimeout(o?F:r,n))):r():i||(a=setTimeout(o?F:r,o===void 0?Math.max(0,n-v):n))}return d.cancel=T,d}function b(n,e,{atBegin:t=!1}={}){return A(n,e,{debounceMode:t!==!1})}const g=n=>{let e=null;const t=l=>{e=null,n(l)};return(()=>{e==null&&(e=requestAnimationFrame(t))})(),()=>{e!=null&&(cancelAnimationFrame(e),e=null)}},y=n=>{let e=null;const t=l=>{e=requestAnimationFrame(t),n(l)};return(()=>{e==null&&(e=requestAnimationFrame(t))})(),()=>{e!=null&&(cancelAnimationFrame(e),e=null)}};exports.debounce=b;exports.delayed=p;exports.delayedAnimationFrame=g;exports.interval=I;exports.intervalAnimationFrame=y;exports.throttle=A;

package/timer.d.ts

@@ -1,6 +1,6 @@
 /**
  * Delays the execution of a function by the given number of milliseconds.
- * @param fn - The function to delay.
+ * @param fn - The function to delay. The function can optionally return a callback that will be invoked when the delay is cancelled.
  * @param ms - The number of milliseconds to delay the function.
  * @returns A function that, when called, will cancel the delay and prevent the original function from being executed.
  * @example
@@ -13,10 +13,10 @@
  * ```
  * @public
  */
-export declare const delayed: (fn: () => void, ms: number) => () => void;
+export declare const delayed: (fn: () => (() => void) | void, ms: number) => () => void;
 /**
  * Executes a function repeatedly at a fixed interval.
- * @param fn - The function to execute periodically.
+ * @param fn - The function to execute periodically. The function can optionally return a callback that will be invoked when the delay is cancelled.
  * @param ms - The number of milliseconds between each execution.
  * @returns A function that, when called, will cancel the interval and stop future executions.
  * @example

package/timer.js

@@ -1,38 +1,52 @@
-const T = (n, e) => {
-  const t = setTimeout(n, e);
-  return () => clearTimeout(t);
-}, x = (n, e) => {
-  const t = setInterval(n, e);
-  return () => clearInterval(t);
+const I = (n, e) => {
+  let t = () => {
+  };
+  const i = setTimeout(() => {
+    const l = n();
+    l != null && (t = l);
+  }, e);
+  return () => {
+    clearTimeout(i), t();
+  };
+}, T = (n, e) => {
+  let t = () => {
+  };
+  const i = setInterval(() => {
+    const l = n();
+    l != null && (t = l);
+  }, e);
+  return () => {
+    clearInterval(i), t();
+  };
 };
-function F(n, e, t = {}) {
-  const { noTrailing: a = !1, noLeading: l = !1, debounceMode: o } = t;
-  let i, f = !1, c = 0;
+function A(n, e, t = {}) {
+  const { noTrailing: i = !1, noLeading: l = !1, debounceMode: a } = t;
+  let o, f = !1, c = 0;
   function m() {
-    i && clearTimeout(i);
+    o && clearTimeout(o);
   }
-  function A(u) {
+  function p(u) {
     const { upcomingOnly: s = !1 } = u || {};
     m(), f = !s;
   }
   function d(...u) {
     if (f) return;
-    const s = this, p = Date.now() - c;
+    const s = this, F = Date.now() - c;
     function r() {
       c = Date.now(), e.apply(s, u);
     }
     function v() {
-      i = void 0;
+      o = void 0;
     }
-    !l && o && !i && r(), m(), o === void 0 && p > n ? l ? (c = Date.now(), a || (i = setTimeout(o ? v : r, n))) : r() : a || (i = setTimeout(
-      o ? v : r,
-      o === void 0 ? Math.max(0, n - p) : n
+    !l && a && !o && r(), m(), a === void 0 && F > n ? l ? (c = Date.now(), i || (o = setTimeout(a ? v : r, n))) : r() : i || (o = setTimeout(
+      a ? v : r,
+      a === void 0 ? Math.max(0, n - F) : n
     ));
   }
-  return d.cancel = A, d;
+  return d.cancel = p, d;
 }
-function I(n, e, { atBegin: t = !1 } = {}) {
-  return F(n, e, { debounceMode: t !== !1 });
+function x(n, e, { atBegin: t = !1 } = {}) {
+  return A(n, e, { debounceMode: t !== !1 });
 }
 const g = (n) => {
   let e = null;
@@ -56,10 +70,10 @@ const g = (n) => {
   };
 };
 export {
-  I as debounce,
-  T as delayed,
+  x as debounce,
+  I as delayed,
   g as delayedAnimationFrame,
-  x as interval,
+  T as interval,
   w as intervalAnimationFrame,
-  F as throttle
+  A as throttle
 };

package/validation.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./result-CdwVhaAc.cjs");exports.Validation=i.Validation;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./result-bSKKrSLB.cjs");exports.Validation=i.Validation;

package/validation.d.ts

@@ -72,6 +72,18 @@ export declare const Validation: {
      * @returns A new `Validation` with the mapped value.
      */
     toResult: <T, E>(validation: Validation<E>, value: T) => Result<T, E>;
+    /**
+     * Executes side effects based on the state of the validation.
+     * Unlike `match`, all handlers are optional, allowing you to react only to specific states.
+     * @param v - The validation.
+     * @param handlers - An object with optional handlers for each state.
+     * @returns The validation that was passed in, allowing for chaining.
+     * @public
+     */
+    effect: <E>(v: Validation<E>, handlers: {
+        valid?: () => void;
+        invalid?: (error: E) => void;
+    }) => Validation<E>;
     /**
      * Execute a function when the `Validation` is valid.
      *
@@ -88,4 +100,81 @@ export declare const Validation: {
      * @returns The `Validation` object.
      */
     whenInvalid: <E>(r: Validation<E>, apply: (e: E) => void) => Validation<E>;
+    /**
+     * Maps the error of an invalid `Validation` to a new error using the provided function.
+     * For valid validations, the validation is preserved unchanged.
+     * @param v - The `Validation` to map the error of.
+     * @param f - The mapping function to apply to the error.
+     * @returns A new `Validation` with the mapped error if invalid, otherwise the original valid.
+     * @public
+     */
+    mapError: <E, F>(v: Validation<E>, f: (error: E) => F) => Validation<F>;
+    /**
+     * Maps the error of an invalid `Validation` to a new `Validation` using the provided function.
+     * This allows recovery from errors by returning a valid validation.
+     * @param v - The `Validation` to recover from.
+     * @param f - The recovery function that returns a new `Validation`.
+     * @returns The result of the recovery function if invalid, otherwise the original valid.
+     * @public
+     */
+    flatMapError: <E, F>(v: Validation<E>, f: (error: E) => Validation<F>) => Validation<F>;
+    /**
+     * Combines two validations. Both must be valid for the result to be valid.
+     * If both are invalid, errors are combined using the provided function.
+     * @param v1 - The first validation.
+     * @param v2 - The second validation.
+     * @param combineErrors - The function to combine two errors.
+     * @returns A combined validation.
+     * @public
+     */
+    combine: <E>(v1: Validation<E>, v2: Validation<E>, combineErrors: (e1: E, e2: E) => E) => Validation<E>;
+    /**
+     * Combines multiple validations into a single validation.
+     * All must be valid for the result to be valid.
+     * Returns the first invalid validation if any.
+     * @param validations - The validations to combine.
+     * @returns A single validation that is valid only if all inputs are valid.
+     * @public
+     */
+    all: <E>(validations: Validation<E>[]) => Validation<E>;
+    /**
+     * Combines multiple validations, accumulating all errors.
+     * All must be valid for the result to be valid.
+     * If any are invalid, all errors are collected into an array.
+     * @param validations - The validations to combine.
+     * @returns A validation that is valid only if all inputs are valid, otherwise contains all errors.
+     * @public
+     */
+    allErrors: <E>(validations: Validation<E>[]) => Validation<E[]>;
+    /**
+     * Compares two validations for equality.
+     * @param v1 - The first validation.
+     * @param v2 - The second validation.
+     * @param errorEquals - Optional custom equality function for errors. Defaults to strict equality.
+     * @returns `true` if the validations are equal, `false` otherwise.
+     * @public
+     */
+    equals: <E>(v1: Validation<E>, v2: Validation<E>, errorEquals?: (e1: E, e2: E) => boolean) => boolean;
+    /**
+     * Recovers from an invalid validation by returning a valid validation.
+     * @param v - The `Validation` to recover from.
+     * @returns A valid validation regardless of the input.
+     * @public
+     */
+    recover: <E>(_v: Validation<E>) => Validation<never>;
+    /**
+     * Gets the error if the validation is invalid, otherwise returns undefined.
+     * @param v - The validation to get the error from.
+     * @returns The error if invalid, otherwise undefined.
+     * @public
+     */
+    getError: <E>(v: Validation<E>) => E | undefined;
+    /**
+     * Gets the error if the validation is invalid, otherwise returns the default value.
+     * @param v - The validation to get the error from.
+     * @param defaultError - The default error to return if valid.
+     * @returns The error if invalid, otherwise the default error.
+     * @public
+     */
+    getErrorOrElse: <E>(v: Validation<E>, defaultError: E) => E;
 };

package/validation.js

@@ -1,4 +1,4 @@
-import { V as i } from "./result-CGd0jCdl.js";
+import { V as i } from "./result-7Po2Mxhx.js";
 export {
   i as Validation
 };