@vinicunca/perkakas 1.6.0 → 1.7.1

package/dist/chunk-XCG2UC6T.js

@@ -0,0 +1 @@
+import{a as u}from"./chunk-J6WPJH72.js";function s(...n){return u(d,n)}function d(n,t){let r=n.entries(),e=r.next();if("done"in e&&e.done)return 0;let{value:[,i]}=e,a=t(i,0,n);for(let[o,m]of r){let b=t(m,o,n);a+=b}return a}export{s as a};

package/dist/{chunk-673TXH2U.js → chunk-YRVN4PYH.js}

@@ -1 +1 @@
-import{a as y,b as a}from"./chunk-JI5FJX2E.js";import{b as o}from"./chunk-7KBK2RWQ.js";function s(...r){return o(p,r)}function p(r,t,e){if(e<=0)return[];if(e>=r.length)return[...r];let n=r.slice(0,e);y(n,t);let i=r.slice(e);for(let u of i)a(n,t,u);return n}export{s as a};
+import{a as y,b as a}from"./chunk-JI5FJX2E.js";import{b as o}from"./chunk-7KBK2RWQ.js";function s(...r){return o(m,r)}function m(r,t,e){if(e<=0)return[];if(e>=r.length)return[...r];let n=r.slice(0,e);y(n,t);let i=r.slice(e);for(let u of i)a(n,t,u);return n}export{s as a};

package/dist/chunk-YWIXN5BR.js

@@ -0,0 +1 @@
+var R=Symbol("funnel/voidReducer"),T=()=>R;function A(l,{triggerAt:f="end",minQuietPeriodMs:u,maxBurstDurationMs:r,minGapMs:o,reducer:p=T}){let e,n,d,i;function a(){let t=d;t!==void 0&&(d=void 0,t===R?l():l(t),o!==void 0&&(n=setTimeout(m,o)))}function m(){clearTimeout(n),n=void 0,e===void 0&&a()}function y(){clearTimeout(e),e=void 0,i=void 0,n===void 0&&a()}return{call:(...t)=>{let s=e===void 0&&n===void 0;if((f!=="start"||s)&&(d=p(d,...t)),!(e===void 0&&!s)){if(u!==void 0||r!==void 0||o===void 0){clearTimeout(e);let c=Date.now();i??=c;let g=r===void 0?u??0:Math.min(u??r,r-(c-i));e=setTimeout(y,g)}f!=="end"&&s&&a()}},cancel:()=>{clearTimeout(e),e=void 0,i=void 0,clearTimeout(n),n=void 0,d=void 0},flush:()=>{y(),m()},get isIdle(){return e===void 0&&n===void 0}}}export{A as a};

package/dist/{chunk-EDZFEURO.js → chunk-Z5YZYBC2.js}

@@ -1 +1 @@
-import{a as t}from"./chunk-5SAUYUEK.js";import{a as e}from"./chunk-J6WPJH72.js";function s(...n){return e(r,n,t(a))}function r([n]){return n}function a(){return o}function o(n){return{hasNext:!0,next:n,done:!0}}export{s as a};
+import{a as t}from"./chunk-NHTBBY2L.js";import{a as e}from"./chunk-J6WPJH72.js";function s(...n){return e(r,n,t(a))}function r([n]){return n}function a(){return o}function o(n){return{hasNext:!0,next:n,done:!0}}export{s as a};

package/dist/chunk-ZMG3NQDL.js

@@ -0,0 +1 @@
+var d=/^(?:0|[1-9]\d*)$/u;function s(i){let t=[],a=/\.{0,4096}(?<propName>[^.[\]]+)|\['(?<quoted>.{0,4096}?)'\]|\["(?<doubleQuoted>.{0,4096}?)"\]|\[(?<unquoted>.{0,4096}?)\]/uy,n;for(;(n=a.exec(i))!==null;){let{propName:e,quoted:o,doubleQuoted:u,unquoted:r}=n.groups;if(r!==void 0){t.push(...s(r));continue}t.push(e===void 0?o??u:d.test(e)?Number(e):e)}return t}export{s as a};

package/dist/chunk.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunk2HQM73ITcjs = require('./chunk-2HQM73IT.cjs');require('./chunk-XR72I63W.cjs');require('./chunk-GZJMERDJ.cjs');exports.chunk = _chunk2HQM73ITcjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunk2HQM73ITcjs = require('./chunk-2HQM73IT.cjs');require('./chunk-XR72I63W.cjs');require('./chunk-GZJMERDJ.cjs');require('./chunk-MBGSSEZN.cjs');exports.chunk = _chunk2HQM73ITcjs.a;

package/dist/chunk.d.cts

@@ -1,18 +1,11 @@
 import { IsNumericLiteral, LessThan, IfNever, ValueOf, Subtract, IntRange } from 'type-fest';
 import { I as IntRangeInclusive } from './int-range-inclusive-Cn-qsrAN.cjs';
 import { I as IterableContainer } from './iterable-container-BTpDVdNc.cjs';
+import { N as NTuple } from './n-tuple-5jljrt4c.cjs';
 import { N as NonEmptyArray } from './non-empty-array-C9Od1wmF.cjs';
 import { P as PartialArray } from './partial-array-Vnf1fBtl.cjs';
-import { T as TupleParts } from './tuple-parts-DAqFAJP8.cjs';
-
-/**
- * An array with *exactly* N elements in it.
- *
- * Only literal N values are supported. For very large N the type might result
- * in a recurse depth error. For negative N the type would result in an infinite
- * recursion. None of these have protections because this is an internal type!
- */
-type NTuple<T, N extends number, Result extends Array<unknown> = []> = Result['length'] extends N ? Result : NTuple<T, N, [...Result, T]>;
+import { T as TupleParts } from './tuple-parts-v6av7LMU.cjs';
+import './perkakas-type-error-8wPb8T2y.cjs';
 
 /**
  * This prevents typescript from failing on complex arrays and large chunks.
@@ -23,9 +16,7 @@ type NTuple<T, N extends number, Result extends Array<unknown> = []> = Result['l
  * See the type tests for an example.
  */
 type MAX_LITERAL_SIZE = 350;
-type Chunk<T extends IterableContainer, N extends number> = T extends readonly [] ? [] : IsNumericLiteral<N> extends true ? LessThan<N, 1> extends true ? never : LessThan<N, MAX_LITERAL_SIZE> extends true ? [
-    ...LiteralChunk<T, N>
-] : GenericChunk<T> : GenericChunk<T>;
+type Chunk<T extends IterableContainer, N extends number> = T extends readonly [] ? [] : IsNumericLiteral<N> extends true ? LessThan<N, 1> extends true ? never : LessThan<N, MAX_LITERAL_SIZE> extends true ? [...LiteralChunk<T, N>] : GenericChunk<T> : GenericChunk<T>;
 type LiteralChunk<T extends IterableContainer, N extends number> = ChunkRestElement<ChunkFixedTuple<TuplePrefix<T>, N>, TupleParts<T>['item'], TupleParts<T>['suffix'], N> | ([...TuplePrefix<T>, ...TupleParts<T>['suffix']] extends readonly [] ? [] : never);
 /**
  * This type **only** works if the input array `T` is a fixed tuple. For these
@@ -34,16 +25,7 @@ type LiteralChunk<T extends IterableContainer, N extends number> = ChunkRestElem
 type ChunkFixedTuple<T, N extends number, Result = []> = T extends readonly [infer Head, ...infer Rest] ? ChunkFixedTuple<Rest, N, Result extends [
     ...infer Previous extends Array<Array<unknown>>,
     infer Current extends Array<unknown>
-] ? Current['length'] extends N ? [
-    ...Previous,
-    Current,
-    [Head]
-] : [
-    ...Previous,
-    [...Current, Head]
-] : [
-    [Head]
-]> : Result;
+] ? Current['length'] extends N ? [...Previous, Current, [Head]] : [...Previous, [...Current, Head]] : [[Head]]> : Result;
 /**
  * Here lies the main complexity of building the chunk type. It takes the prefix
  * chunks, the rest param item type, and the suffix (not chunked!) and it
@@ -70,21 +52,16 @@ type ChunkRestElement<PrefixChunks, Item, Suffix extends Array<unknown>, N exten
     ],
     ...Array<NTuple<Item, N>>,
     ...SuffixChunk<Suffix, Item, N>
-] : [
-    ...Array<NTuple<Item, N>>,
-    ...SuffixChunk<Suffix, Item, N>
-]>;
+] : [...Array<NTuple<Item, N>>, ...SuffixChunk<Suffix, Item, N>]>;
 /**
  * This type assumes it takes a finite tuple that represents the suffix of our
  * input array. It builds all possible combinations of adding items to the
  * **head** of the suffix in order to pad the suffix until the last chunk is
  * full.
  */
-type SuffixChunk<T extends Array<unknown>, Item, N extends number> = T extends readonly [] ? [
-    ValueOf<{
-        [K in IntRangeInclusive<1, N>]: NTuple<Item, K>;
-    }>
-] : ValueOf<{
+type SuffixChunk<T extends Array<unknown>, Item, N extends number> = T extends readonly [] ? [ValueOf<{
+    [K in IntRangeInclusive<1, N>]: NTuple<Item, K>;
+}>] : ValueOf<{
     [Padding in IntRange<0, N>]: ChunkFixedTuple<[
         ...NTuple<Item, Padding>,
         ...T

package/dist/chunk.d.ts

@@ -1,18 +1,11 @@
 import { IsNumericLiteral, LessThan, IfNever, ValueOf, Subtract, IntRange } from 'type-fest';
 import { I as IntRangeInclusive } from './int-range-inclusive-Cn-qsrAN.js';
 import { I as IterableContainer } from './iterable-container-BTpDVdNc.js';
+import { N as NTuple } from './n-tuple-5jljrt4c.js';
 import { N as NonEmptyArray } from './non-empty-array-C9Od1wmF.js';
 import { P as PartialArray } from './partial-array-Vnf1fBtl.js';
-import { T as TupleParts } from './tuple-parts-CrwnkDKX.js';
-
-/**
- * An array with *exactly* N elements in it.
- *
- * Only literal N values are supported. For very large N the type might result
- * in a recurse depth error. For negative N the type would result in an infinite
- * recursion. None of these have protections because this is an internal type!
- */
-type NTuple<T, N extends number, Result extends Array<unknown> = []> = Result['length'] extends N ? Result : NTuple<T, N, [...Result, T]>;
+import { T as TupleParts } from './tuple-parts-BTivqbtT.js';
+import './perkakas-type-error-8wPb8T2y.js';
 
 /**
  * This prevents typescript from failing on complex arrays and large chunks.
@@ -23,9 +16,7 @@ type NTuple<T, N extends number, Result extends Array<unknown> = []> = Result['l
  * See the type tests for an example.
  */
 type MAX_LITERAL_SIZE = 350;
-type Chunk<T extends IterableContainer, N extends number> = T extends readonly [] ? [] : IsNumericLiteral<N> extends true ? LessThan<N, 1> extends true ? never : LessThan<N, MAX_LITERAL_SIZE> extends true ? [
-    ...LiteralChunk<T, N>
-] : GenericChunk<T> : GenericChunk<T>;
+type Chunk<T extends IterableContainer, N extends number> = T extends readonly [] ? [] : IsNumericLiteral<N> extends true ? LessThan<N, 1> extends true ? never : LessThan<N, MAX_LITERAL_SIZE> extends true ? [...LiteralChunk<T, N>] : GenericChunk<T> : GenericChunk<T>;
 type LiteralChunk<T extends IterableContainer, N extends number> = ChunkRestElement<ChunkFixedTuple<TuplePrefix<T>, N>, TupleParts<T>['item'], TupleParts<T>['suffix'], N> | ([...TuplePrefix<T>, ...TupleParts<T>['suffix']] extends readonly [] ? [] : never);
 /**
  * This type **only** works if the input array `T` is a fixed tuple. For these
@@ -34,16 +25,7 @@ type LiteralChunk<T extends IterableContainer, N extends number> = ChunkRestElem
 type ChunkFixedTuple<T, N extends number, Result = []> = T extends readonly [infer Head, ...infer Rest] ? ChunkFixedTuple<Rest, N, Result extends [
     ...infer Previous extends Array<Array<unknown>>,
     infer Current extends Array<unknown>
-] ? Current['length'] extends N ? [
-    ...Previous,
-    Current,
-    [Head]
-] : [
-    ...Previous,
-    [...Current, Head]
-] : [
-    [Head]
-]> : Result;
+] ? Current['length'] extends N ? [...Previous, Current, [Head]] : [...Previous, [...Current, Head]] : [[Head]]> : Result;
 /**
  * Here lies the main complexity of building the chunk type. It takes the prefix
  * chunks, the rest param item type, and the suffix (not chunked!) and it
@@ -70,21 +52,16 @@ type ChunkRestElement<PrefixChunks, Item, Suffix extends Array<unknown>, N exten
     ],
     ...Array<NTuple<Item, N>>,
     ...SuffixChunk<Suffix, Item, N>
-] : [
-    ...Array<NTuple<Item, N>>,
-    ...SuffixChunk<Suffix, Item, N>
-]>;
+] : [...Array<NTuple<Item, N>>, ...SuffixChunk<Suffix, Item, N>]>;
 /**
  * This type assumes it takes a finite tuple that represents the suffix of our
  * input array. It builds all possible combinations of adding items to the
  * **head** of the suffix in order to pad the suffix until the last chunk is
  * full.
  */
-type SuffixChunk<T extends Array<unknown>, Item, N extends number> = T extends readonly [] ? [
-    ValueOf<{
-        [K in IntRangeInclusive<1, N>]: NTuple<Item, K>;
-    }>
-] : ValueOf<{
+type SuffixChunk<T extends Array<unknown>, Item, N extends number> = T extends readonly [] ? [ValueOf<{
+    [K in IntRangeInclusive<1, N>]: NTuple<Item, K>;
+}>] : ValueOf<{
     [Padding in IntRange<0, N>]: ChunkFixedTuple<[
         ...NTuple<Item, Padding>,
         ...T

package/dist/chunk.js

@@ -1 +1 @@
-import{a}from"./chunk-UWMBE6BM.js";import"./chunk-J6WPJH72.js";import"./chunk-KGPDVVVV.js";export{a as chunk};
+import{a}from"./chunk-UWMBE6BM.js";import"./chunk-J6WPJH72.js";import"./chunk-KGPDVVVV.js";import"./chunk-EK7ODJWE.js";export{a as chunk};

package/dist/clamp.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkRXUYF4A4cjs = require('./chunk-RXUYF4A4.cjs');require('./chunk-XR72I63W.cjs');require('./chunk-GZJMERDJ.cjs');exports.clamp = _chunkRXUYF4A4cjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkRXUYF4A4cjs = require('./chunk-RXUYF4A4.cjs');require('./chunk-XR72I63W.cjs');require('./chunk-GZJMERDJ.cjs');require('./chunk-MBGSSEZN.cjs');exports.clamp = _chunkRXUYF4A4cjs.a;

package/dist/clamp.js

@@ -1 +1 @@
-import{a}from"./chunk-CR5H624Z.js";import"./chunk-J6WPJH72.js";import"./chunk-KGPDVVVV.js";export{a as clamp};
+import{a}from"./chunk-CR5H624Z.js";import"./chunk-J6WPJH72.js";import"./chunk-KGPDVVVV.js";import"./chunk-EK7ODJWE.js";export{a as clamp};

package/dist/clone.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkGFQXVPLPcjs = require('./chunk-GFQXVPLP.cjs');require('./chunk-XR72I63W.cjs');require('./chunk-GZJMERDJ.cjs');exports.clone = _chunkGFQXVPLPcjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkQGF2XNZScjs = require('./chunk-QGF2XNZS.cjs');require('./chunk-XR72I63W.cjs');require('./chunk-GZJMERDJ.cjs');require('./chunk-MBGSSEZN.cjs');exports.clone = _chunkQGF2XNZScjs.a;

package/dist/clone.js

@@ -1 +1 @@
-import{a}from"./chunk-ICYGL2YZ.js";import"./chunk-J6WPJH72.js";import"./chunk-KGPDVVVV.js";export{a as clone};
+import{a}from"./chunk-JYWIRZ2Z.js";import"./chunk-J6WPJH72.js";import"./chunk-KGPDVVVV.js";import"./chunk-EK7ODJWE.js";export{a as clone};

package/dist/concat.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkYJDSLML5cjs = require('./chunk-YJDSLML5.cjs');require('./chunk-XR72I63W.cjs');require('./chunk-GZJMERDJ.cjs');exports.concat = _chunkYJDSLML5cjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkYJDSLML5cjs = require('./chunk-YJDSLML5.cjs');require('./chunk-XR72I63W.cjs');require('./chunk-GZJMERDJ.cjs');require('./chunk-MBGSSEZN.cjs');exports.concat = _chunkYJDSLML5cjs.a;

package/dist/concat.js

@@ -1 +1 @@
-import{a}from"./chunk-32JKKR4M.js";import"./chunk-J6WPJH72.js";import"./chunk-KGPDVVVV.js";export{a as concat};
+import{a}from"./chunk-32JKKR4M.js";import"./chunk-J6WPJH72.js";import"./chunk-KGPDVVVV.js";import"./chunk-EK7ODJWE.js";export{a as concat};

package/dist/conditional.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkWYM2JV5Tcjs = require('./chunk-WYM2JV5T.cjs');exports.conditional = _chunkWYM2JV5Tcjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunk4BTTPOEUcjs = require('./chunk-4BTTPOEU.cjs');require('./chunk-MBGSSEZN.cjs');exports.conditional = _chunk4BTTPOEUcjs.a;

package/dist/conditional.d.cts

@@ -8,9 +8,12 @@
 type GuardType<T, Fallback = never> = T extends (x: any, ...rest: any) => x is infer U ? U : Fallback;
 
 type Case<In, Out, When extends (x: In) => boolean = (x: In) => boolean> = readonly [when: When, then: (x: GuardType<When, In> & In) => Out];
-declare const conditionalPlus: typeof conditional & {
-    defaultCase: typeof defaultCase;
-};
+type DefaultCase<In, Out> = (x: In) => Out;
+interface Utilities {
+    readonly defaultCase: typeof defaultCase;
+}
+type WithUtils<T> = T & Utilities;
+declare const conditionalPlus: WithUtils<typeof conditional>;
 
 /**
  * Executes a transformer function based on the first matching predicate,
@@ -19,13 +22,18 @@ declare const conditionalPlus: typeof conditional & {
  * corresponding transformer, and returns, ignoring any further cases, even if
  * they would match.
  *
- * !IMPORTANT! - Unlike similar implementations in frameworks like Lodash and
- * Ramda, this implementation does **NOT** return a default/fallback
- * `undefined` value when none of the cases match; and instead will **throw** an
- * exception in those cases.
- * To add a default case use the `conditional.defaultCase` helper as the final
- * case of your implementation. By default it returns `undefined`, but could be
- * provided a transformer in order to return something else.
+ * NOTE*: Some type-predicates may fail to narrow the param type of their
+ * transformer; in such cases wrap your type-predicate in an anonymous arrow
+ * function: e.g., instead of
+ * `conditional(..., [myTypePredicate, myTransformer], ...)`, use
+ * `conditional(..., [($) => myTypePredicate($), myTransformer], ...)`.
+ *
+ * To add a a default, catch-all, case you can provide a single callback
+ * function (instead of a 2-tuple) as the last case. This is equivalent to
+ * adding a case with a trivial always-true predicate as it's condition (see
+ * example).
+ *
+ * For simpler cases you should also consider using `when` instead.
  *
  * Due to TypeScript's inability to infer the result of negating a type-
  * predicate we can't refine the types used in subsequent cases based on
@@ -33,30 +41,62 @@ declare const conditionalPlus: typeof conditional & {
  * is recommended for more precise type control when such type narrowing is
  * needed.
  *
- * @param cases - A list of (up to 10) tuples, each defining a case. Each tuple
- * consists of a predicate (or a type-predicate) and a transformer function that
- * processes the data if its case matches.
+ * !IMPORTANT! - Unlike similar implementations in Lodash and Ramda, this
+ * implementation **doesn't** implicitly return `undefined` as a fallback when
+ * when none of the cases match; and instead **throws** an exception in those
+ * cases! You have to explicitly provide a default case, and can use
+ * `constant(undefined)` as your last case to replicate that behavior.
+ *
+ * @param cases - A list of (up to 10) cases. Each case can be either:
+ * - A 2-tuple consisting of a predicate (or type-predicate) and a transformer
+ *   function that processes the data if the predicate matches.
+ * - A single callback function that acts as a default fallback case.
  * @returns The output of the matched transformer. If no cases match, an
  * exception is thrown. The return type is a union of the return types of all
  * provided transformers.
  * @signature
  *   P.conditional(...cases)(data);
  * @example
- *   const nameOrId = 3 as string | number;
+ *   const nameOrId = 3 as string | number | boolean;
+ *
  *   P.pipe(
  *     nameOrId,
  *     P.conditional(
  *       [P.isString, (name) => `Hello ${name}`],
  *       [P.isNumber, (id) => `Hello ID: ${id}`],
- *       P.conditional.defaultCase(
- *         (something) => `Hello something (${JSON.stringify(something)})`,
- *       ),
  *     ),
- *   ); //=> 'Hello ID: 3'
+ *   ); //=> 'Hello ID: 3' (typed as `string`), can throw!.
+ *
+ *   P.pipe(
+ *     nameOrId,
+ *     P.conditional(
+ *       [P.isString, (name) => `Hello ${name}`],
+ *       [P.isNumber, (id) => `Hello ID: ${id}`],
+ *       P.constant(undefined),
+ *     ),
+ *   ); //=> 'Hello ID: 3' (typed as `string | undefined`), won't throw.
+ *
+ *   P.pipe(
+ *     nameOrId,
+ *     P.conditional(
+ *       [P.isString, (name) => `Hello ${name}`],
+ *       [P.isNumber, (id) => `Hello ID: ${id}`],
+ *       (something) => `Hello something (${JSON.stringify(something)})`,
+ *     ),
+ *   ); //=> 'Hello ID: 3' (typed as `string`), won't throw.
  * @dataLast
  * @category Function
  */
-declare function conditional<T, Fn0 extends (x: T) => boolean, Fn1 extends (x: T) => boolean, Fn2 extends (x: T) => boolean, Fn3 extends (x: T) => boolean, Fn4 extends (x: T) => boolean, Fn5 extends (x: T) => boolean, Fn6 extends (x: T) => boolean, Fn7 extends (x: T) => boolean, Fn8 extends (x: T) => boolean, Fn9 extends (x: T) => boolean, Return0, Return1 = never, Return2 = never, Return3 = never, Return4 = never, Return5 = never, Return6 = never, Return7 = never, Return8 = never, Return9 = never>(case0: Case<T, Return0, Fn0>, case1?: Case<T, Return1, Fn1>, case2?: Case<T, Return2, Fn2>, case3?: Case<T, Return3, Fn3>, case4?: Case<T, Return4, Fn4>, case5?: Case<T, Return5, Fn5>, case6?: Case<T, Return6, Fn6>, case7?: Case<T, Return7, Fn7>, case8?: Case<T, Return8, Fn8>, case9?: Case<T, Return9, Fn9>): (data: T) => Return0 | Return1 | Return2 | Return3 | Return4 | Return5 | Return6 | Return7 | Return8 | Return9;
+declare function conditional<T, Fn0 extends (x: T) => boolean, Return0, Fallback = never>(case0: Case<T, Return0, Fn0>, fallback?: DefaultCase<T, Fallback>): (data: T) => Return0 | Fallback;
+declare function conditional<T, Fn0 extends (x: T) => boolean, Fn1 extends (x: T) => boolean, Return0, Return1, Fallback = never>(case0: Case<T, Return0, Fn0>, case1: Case<T, Return1, Fn1>, fallback?: DefaultCase<T, Fallback>): (data: T) => Return0 | Return1 | Fallback;
+declare function conditional<T, Fn0 extends (x: T) => boolean, Fn1 extends (x: T) => boolean, Fn2 extends (x: T) => boolean, Return0, Return1, Return2, Fallback = never>(case0: Case<T, Return0, Fn0>, case1: Case<T, Return1, Fn1>, case2: Case<T, Return2, Fn2>, fallback?: DefaultCase<T, Fallback>): (data: T) => Return0 | Return1 | Return2 | Fallback;
+declare function conditional<T, Fn0 extends (x: T) => boolean, Fn1 extends (x: T) => boolean, Fn2 extends (x: T) => boolean, Fn3 extends (x: T) => boolean, Return0, Return1, Return2, Return3, Fallback = never>(case0: Case<T, Return0, Fn0>, case1: Case<T, Return1, Fn1>, case2: Case<T, Return2, Fn2>, case3: Case<T, Return3, Fn3>, fallback?: DefaultCase<T, Fallback>): (data: T) => Return0 | Return1 | Return2 | Return3 | Fallback;
+declare function conditional<T, Fn0 extends (x: T) => boolean, Fn1 extends (x: T) => boolean, Fn2 extends (x: T) => boolean, Fn3 extends (x: T) => boolean, Fn4 extends (x: T) => boolean, Return0, Return1, Return2, Return3, Return4, Fallback = never>(case0: Case<T, Return0, Fn0>, case1: Case<T, Return1, Fn1>, case2: Case<T, Return2, Fn2>, case3: Case<T, Return3, Fn3>, case4: Case<T, Return4, Fn4>, fallback?: DefaultCase<T, Fallback>): (data: T) => Return0 | Return1 | Return2 | Return3 | Return4 | Fallback;
+declare function conditional<T, Fn0 extends (x: T) => boolean, Fn1 extends (x: T) => boolean, Fn2 extends (x: T) => boolean, Fn3 extends (x: T) => boolean, Fn4 extends (x: T) => boolean, Fn5 extends (x: T) => boolean, Return0, Return1, Return2, Return3, Return4, Return5, Fallback = never>(case0: Case<T, Return0, Fn0>, case1: Case<T, Return1, Fn1>, case2: Case<T, Return2, Fn2>, case3: Case<T, Return3, Fn3>, case4: Case<T, Return4, Fn4>, case5: Case<T, Return5, Fn5>, fallback?: DefaultCase<T, Fallback>): (data: T) => Return0 | Return1 | Return2 | Return3 | Return4 | Return5 | Fallback;
+declare function conditional<T, Fn0 extends (x: T) => boolean, Fn1 extends (x: T) => boolean, Fn2 extends (x: T) => boolean, Fn3 extends (x: T) => boolean, Fn4 extends (x: T) => boolean, Fn5 extends (x: T) => boolean, Fn6 extends (x: T) => boolean, Return0, Return1, Return2, Return3, Return4, Return5, Return6, Fallback = never>(case0: Case<T, Return0, Fn0>, case1: Case<T, Return1, Fn1>, case2: Case<T, Return2, Fn2>, case3: Case<T, Return3, Fn3>, case4: Case<T, Return4, Fn4>, case5: Case<T, Return5, Fn5>, case6: Case<T, Return6, Fn6>, fallback?: DefaultCase<T, Fallback>): (data: T) => Return0 | Return1 | Return2 | Return3 | Return4 | Return5 | Return6 | Fallback;
+declare function conditional<T, Fn0 extends (x: T) => boolean, Fn1 extends (x: T) => boolean, Fn2 extends (x: T) => boolean, Fn3 extends (x: T) => boolean, Fn4 extends (x: T) => boolean, Fn5 extends (x: T) => boolean, Fn6 extends (x: T) => boolean, Fn7 extends (x: T) => boolean, Return0, Return1, Return2, Return3, Return4, Return5, Return6, Return7, Fallback = never>(case0: Case<T, Return0, Fn0>, case1: Case<T, Return1, Fn1>, case2: Case<T, Return2, Fn2>, case3: Case<T, Return3, Fn3>, case4: Case<T, Return4, Fn4>, case5: Case<T, Return5, Fn5>, case6: Case<T, Return6, Fn6>, case7: Case<T, Return7, Fn7>, fallback?: DefaultCase<T, Fallback>): (data: T) => Return0 | Return1 | Return2 | Return3 | Return4 | Return5 | Return6 | Return7 | Fallback;
+declare function conditional<T, Fn0 extends (x: T) => boolean, Fn1 extends (x: T) => boolean, Fn2 extends (x: T) => boolean, Fn3 extends (x: T) => boolean, Fn4 extends (x: T) => boolean, Fn5 extends (x: T) => boolean, Fn6 extends (x: T) => boolean, Fn7 extends (x: T) => boolean, Fn8 extends (x: T) => boolean, Return0, Return1, Return2, Return3, Return4, Return5, Return6, Return7, Return8, Fallback = never>(case0: Case<T, Return0, Fn0>, case1: Case<T, Return1, Fn1>, case2: Case<T, Return2, Fn2>, case3: Case<T, Return3, Fn3>, case4: Case<T, Return4, Fn4>, case5: Case<T, Return5, Fn5>, case6: Case<T, Return6, Fn6>, case7: Case<T, Return7, Fn7>, case8: Case<T, Return8, Fn8>, fallback?: DefaultCase<T, Fallback>): (data: T) => Return0 | Return1 | Return2 | Return3 | Return4 | Return5 | Return6 | Return7 | Return8 | Fallback;
+declare function conditional<T, Fn0 extends (x: T) => boolean, Fn1 extends (x: T) => boolean, Fn2 extends (x: T) => boolean, Fn3 extends (x: T) => boolean, Fn4 extends (x: T) => boolean, Fn5 extends (x: T) => boolean, Fn6 extends (x: T) => boolean, Fn7 extends (x: T) => boolean, Fn8 extends (x: T) => boolean, Fn9 extends (x: T) => boolean, Return0, Return1, Return2, Return3, Return4, Return5, Return6, Return7, Return8, Return9, Fallback = never>(case0: Case<T, Return0, Fn0>, case1: Case<T, Return1, Fn1>, case2: Case<T, Return2, Fn2>, case3: Case<T, Return3, Fn3>, case4: Case<T, Return4, Fn4>, case5: Case<T, Return5, Fn5>, case6: Case<T, Return6, Fn6>, case7: Case<T, Return7, Fn7>, case8: Case<T, Return8, Fn8>, case9: Case<T, Return9, Fn9>, fallback?: DefaultCase<T, Fallback>): (data: T) => Return0 | Return1 | Return2 | Return3 | Return4 | Return5 | Return6 | Return7 | Return8 | Return9 | Fallback;
 /**
  * Executes a transformer function based on the first matching predicate,
  * functioning like a series of `if...else if...` statements. It sequentially
@@ -64,13 +104,18 @@ declare function conditional<T, Fn0 extends (x: T) => boolean, Fn1 extends (x: T
  * corresponding transformer, and returns, ignoring any further cases, even if
  * they would match.
  *
- * !IMPORTANT! - Unlike similar implementations in frameworks like Lodash and
- * Ramda, this implementation does **NOT** return a default/fallback
- * `undefined` value when none of the cases match; and instead will **throw** an
- * exception in those cases.
- * To add a default case use the `conditional.defaultCase` helper as the final
- * case of your implementation. By default it returns `undefined`, but could be
- * provided a transformer in order to return something else.
+ * NOTE*: Some type-predicates may fail to narrow the param type of their
+ * transformer; in such cases wrap your type-predicate in an anonymous arrow
+ * function: e.g., instead of
+ * `conditional(..., [myTypePredicate, myTransformer], ...)`, use
+ * `conditional(..., [($) => myTypePredicate($), myTransformer], ...)`.
+ *
+ * To add a a default, catch-all, case you can provide a single callback
+ * function (instead of a 2-tuple) as the last case. This is equivalent to
+ * adding a case with a trivial always-true predicate as it's condition (see
+ * example).
+ *
+ * For simpler cases you should also consider using `when` instead.
  *
  * Due to TypeScript's inability to infer the result of negating a type-
  * predicate we can't refine the types used in subsequent cases based on
@@ -78,34 +123,76 @@ declare function conditional<T, Fn0 extends (x: T) => boolean, Fn1 extends (x: T
  * is recommended for more precise type control when such type narrowing is
  * needed.
  *
+ * !IMPORTANT! - Unlike similar implementations in Lodash and Ramda, this
+ * implementation **doesn't** implicitly return `undefined` as a fallback when
+ * when none of the cases match; and instead **throws** an exception in those
+ * cases! You have to explicitly provide a default case, and can use
+ * `constant(undefined)` as your last case to replicate that behavior.
+ *
  * @param data - The input data to be evaluated against the provided cases.
- * @param cases - A list of (up to 10) tuples, each defining a case. Each tuple
- * consists of a predicate (or a type-predicate) and a transformer function that
- * processes the data if its case matches.
+ * @param cases - A list of (up to 10) cases. Each case can be either:
+ * - A 2-tuple consisting of a predicate (or type-predicate) and a transformer
+ *   function that processes the data if the predicate matches.
+ * - A single callback function that acts as a default fallback case.
  * @returns The output of the matched transformer. If no cases match, an
  * exception is thrown. The return type is a union of the return types of all
  * provided transformers.
  * @signature
  *   P.conditional(data, ...cases);
  * @example
- *   const nameOrId = 3 as string | number;
+ *   const nameOrId = 3 as string | number | boolean;
+ *
  *   P.conditional(
  *     nameOrId,
  *     [P.isString, (name) => `Hello ${name}`],
  *     [P.isNumber, (id) => `Hello ID: ${id}`],
- *     P.conditional.defaultCase(
- *       (something) => `Hello something (${JSON.stringify(something)})`,
- *     ),
- *   ); //=> 'Hello ID: 3'
+ *   ); //=> 'Hello ID: 3' (typed as `string`), can throw!.
+ *
+ *   P.conditional(
+ *     nameOrId,
+ *     [P.isString, (name) => `Hello ${name}`],
+ *     [P.isNumber, (id) => `Hello ID: ${id}`],
+ *     P.constant(undefined),
+ *   ); //=> 'Hello ID: 3' (typed as `string | undefined`), won't throw.
+ *
+ *   P.conditional(
+ *     nameOrId,
+ *     [P.isString, (name) => `Hello ${name}`],
+ *     [P.isNumber, (id) => `Hello ID: ${id}`],
+ *     (something) => `Hello something (${JSON.stringify(something)})`,
+ *   ); //=> 'Hello ID: 3' (typed as `string`), won't throw.
  * @dataFirst
  * @category Function
  */
-declare function conditional<T, Fn0 extends (x: T) => boolean, Fn1 extends (x: T) => boolean, Fn2 extends (x: T) => boolean, Fn3 extends (x: T) => boolean, Fn4 extends (x: T) => boolean, Fn5 extends (x: T) => boolean, Fn6 extends (x: T) => boolean, Fn7 extends (x: T) => boolean, Fn8 extends (x: T) => boolean, Fn9 extends (x: T) => boolean, Return0, Return1 = never, Return2 = never, Return3 = never, Return4 = never, Return5 = never, Return6 = never, Return7 = never, Return8 = never, Return9 = never>(data: T, case0: Case<T, Return0, Fn0>, case1?: Case<T, Return1, Fn1>, case2?: Case<T, Return2, Fn2>, case3?: Case<T, Return3, Fn3>, case4?: Case<T, Return4, Fn4>, case5?: Case<T, Return5, Fn5>, case6?: Case<T, Return6, Fn6>, case7?: Case<T, Return7, Fn7>, case8?: Case<T, Return8, Fn8>, case9?: Case<T, Return9, Fn9>): Return0 | Return1 | Return2 | Return3 | Return4 | Return5 | Return6 | Return7 | Return8 | Return9;
+declare function conditional<T, Fn0 extends (x: T) => boolean, Return0, Fallback = never>(data: T, case0: Case<T, Return0, Fn0>, fallback?: DefaultCase<T, Fallback>): Return0 | Fallback;
+declare function conditional<T, Fn0 extends (x: T) => boolean, Fn1 extends (x: T) => boolean, Return0, Return1, Fallback = never>(data: T, case0: Case<T, Return0, Fn0>, case1: Case<T, Return1, Fn1>, fallback?: DefaultCase<T, Fallback>): Return0 | Return1 | Fallback;
+declare function conditional<T, Fn0 extends (x: T) => boolean, Fn1 extends (x: T) => boolean, Fn2 extends (x: T) => boolean, Return0, Return1, Return2, Fallback = never>(data: T, case0: Case<T, Return0, Fn0>, case1: Case<T, Return1, Fn1>, case2: Case<T, Return2, Fn2>, fallback?: DefaultCase<T, Fallback>): Return0 | Return1 | Return2 | Fallback;
+declare function conditional<T, Fn0 extends (x: T) => boolean, Fn1 extends (x: T) => boolean, Fn2 extends (x: T) => boolean, Fn3 extends (x: T) => boolean, Return0, Return1, Return2, Return3, Fallback = never>(data: T, case0: Case<T, Return0, Fn0>, case1: Case<T, Return1, Fn1>, case2: Case<T, Return2, Fn2>, case3: Case<T, Return3, Fn3>, fallback?: DefaultCase<T, Fallback>): Return0 | Return1 | Return2 | Return3 | Fallback;
+declare function conditional<T, Fn0 extends (x: T) => boolean, Fn1 extends (x: T) => boolean, Fn2 extends (x: T) => boolean, Fn3 extends (x: T) => boolean, Fn4 extends (x: T) => boolean, Return0, Return1, Return2, Return3, Return4, Fallback = never>(data: T, case0: Case<T, Return0, Fn0>, case1: Case<T, Return1, Fn1>, case2: Case<T, Return2, Fn2>, case3: Case<T, Return3, Fn3>, case4: Case<T, Return4, Fn4>, fallback?: DefaultCase<T, Fallback>): Return0 | Return1 | Return2 | Return3 | Return4 | Fallback;
+declare function conditional<T, Fn0 extends (x: T) => boolean, Fn1 extends (x: T) => boolean, Fn2 extends (x: T) => boolean, Fn3 extends (x: T) => boolean, Fn4 extends (x: T) => boolean, Fn5 extends (x: T) => boolean, Return0, Return1, Return2, Return3, Return4, Return5, Fallback = never>(data: T, case0: Case<T, Return0, Fn0>, case1: Case<T, Return1, Fn1>, case2: Case<T, Return2, Fn2>, case3: Case<T, Return3, Fn3>, case4: Case<T, Return4, Fn4>, case5: Case<T, Return5, Fn5>, fallback?: DefaultCase<T, Fallback>): Return0 | Return1 | Return2 | Return3 | Return4 | Return5 | Fallback;
+declare function conditional<T, Fn0 extends (x: T) => boolean, Fn1 extends (x: T) => boolean, Fn2 extends (x: T) => boolean, Fn3 extends (x: T) => boolean, Fn4 extends (x: T) => boolean, Fn5 extends (x: T) => boolean, Fn6 extends (x: T) => boolean, Return0, Return1, Return2, Return3, Return4, Return5, Return6, Fallback = never>(data: T, case0: Case<T, Return0, Fn0>, case1: Case<T, Return1, Fn1>, case2: Case<T, Return2, Fn2>, case3: Case<T, Return3, Fn3>, case4: Case<T, Return4, Fn4>, case5: Case<T, Return5, Fn5>, case6: Case<T, Return6, Fn6>, fallback?: DefaultCase<T, Fallback>): Return0 | Return1 | Return2 | Return3 | Return4 | Return5 | Return6 | Fallback;
+declare function conditional<T, Fn0 extends (x: T) => boolean, Fn1 extends (x: T) => boolean, Fn2 extends (x: T) => boolean, Fn3 extends (x: T) => boolean, Fn4 extends (x: T) => boolean, Fn5 extends (x: T) => boolean, Fn6 extends (x: T) => boolean, Fn7 extends (x: T) => boolean, Return0, Return1, Return2, Return3, Return4, Return5, Return6, Return7, Fallback = never>(data: T, case0: Case<T, Return0, Fn0>, case1: Case<T, Return1, Fn1>, case2: Case<T, Return2, Fn2>, case3: Case<T, Return3, Fn3>, case4: Case<T, Return4, Fn4>, case5: Case<T, Return5, Fn5>, case6: Case<T, Return6, Fn6>, case7: Case<T, Return7, Fn7>, fallback?: DefaultCase<T, Fallback>): Return0 | Return1 | Return2 | Return3 | Return4 | Return5 | Return6 | Return7 | Fallback;
+declare function conditional<T, Fn0 extends (x: T) => boolean, Fn1 extends (x: T) => boolean, Fn2 extends (x: T) => boolean, Fn3 extends (x: T) => boolean, Fn4 extends (x: T) => boolean, Fn5 extends (x: T) => boolean, Fn6 extends (x: T) => boolean, Fn7 extends (x: T) => boolean, Fn8 extends (x: T) => boolean, Return0, Return1, Return2, Return3, Return4, Return5, Return6, Return7, Return8, Fallback = never>(data: T, case0: Case<T, Return0, Fn0>, case1: Case<T, Return1, Fn1>, case2: Case<T, Return2, Fn2>, case3: Case<T, Return3, Fn3>, case4: Case<T, Return4, Fn4>, case5: Case<T, Return5, Fn5>, case6: Case<T, Return6, Fn6>, case7: Case<T, Return7, Fn7>, case8: Case<T, Return8, Fn8>, fallback?: DefaultCase<T, Fallback>): Return0 | Return1 | Return2 | Return3 | Return4 | Return5 | Return6 | Return7 | Return8 | Fallback;
+declare function conditional<T, Fn0 extends (x: T) => boolean, Fn1 extends (x: T) => boolean, Fn2 extends (x: T) => boolean, Fn3 extends (x: T) => boolean, Fn4 extends (x: T) => boolean, Fn5 extends (x: T) => boolean, Fn6 extends (x: T) => boolean, Fn7 extends (x: T) => boolean, Fn8 extends (x: T) => boolean, Fn9 extends (x: T) => boolean, Return0, Return1, Return2, Return3, Return4, Return5, Return6, Return7, Return8, Return9, Fallback = never>(data: T, case0: Case<T, Return0, Fn0>, case1: Case<T, Return1, Fn1>, case2: Case<T, Return2, Fn2>, case3: Case<T, Return3, Fn3>, case4: Case<T, Return4, Fn4>, case5: Case<T, Return5, Fn5>, case6: Case<T, Return6, Fn6>, case7: Case<T, Return7, Fn7>, case8: Case<T, Return8, Fn8>, case9: Case<T, Return9, Fn9>, fallback?: DefaultCase<T, Fallback>): Return0 | Return1 | Return2 | Return3 | Return4 | Return5 | Return6 | Return7 | Return8 | Return9 | Fallback;
+/**
+ *! **DEPRECATED**: `conditional` now accepts a default, catch-all, callback directly and no longer needs this utility wrapper. Use `constant(undefined)` as your last case instead (see example).
+ *
+ * @example
+ *   const nameOrId = 3 as string | number;
+ *   P.conditional(
+ *     nameOrId,
+ *     [P.isString, (name) => `Hello ${name}`],
+ *     [P.isNumber, (id) => `Hello ID: ${id}`],
+ *     // Was: `P.conditional.defaultCase(),`, Now:
+ *     constant(undefined),
+ *   ); //=> 'Hello ID: 3'
+ * @deprecated `conditional` now accepts a default, catch-all, callback
+ * directly and no longer needs this utility wrapper. Use `constant(undefined)`
+ * as your last case instead (see example).
+ */
+declare function defaultCase(): Case<unknown, undefined>;
 /**
- * A simplified case that accepts all data. Put this as the last case to
- * prevent an exception from being thrown when none of the previous cases
- * match.
- * If this is not the last case it will short-circuit anything after it.
+ *! **DEPRECATED**: `conditional` now accepts a default, catch-all, callback directly and no longer needs this utility wrapper. Simply put your `then` callback as the last case (see example).
  *
  * @param then - You only need to provide the transformer, the predicate is
  * implicit. @default () => undefined, which is how Lodash and Ramda handle
@@ -116,12 +203,15 @@ declare function conditional<T, Fn0 extends (x: T) => boolean, Fn1 extends (x: T
  *     nameOrId,
  *     [P.isString, (name) => `Hello ${name}`],
  *     [P.isNumber, (id) => `Hello ID: ${id}`],
- *     P.conditional.defaultCase(
- *       (something) => `Hello something (${JSON.stringify(something)})`,
- *     ),
+ *     // Was: `P.conditional.defaultCase(
+ *     //  (something) => `Hello something (${JSON.stringify(something)})`,
+ *     //),`, Now:
+ *     (something) => `Hello something (${JSON.stringify(something)})`
  *   ); //=> 'Hello ID: 3'
+ * @deprecated `conditional` now accepts a default, catch-all, callback
+ * directly and no longer needs this utility wrapper. Simply put your `then`
+ * callback as the last case.
  */
-declare function defaultCase(): Case<unknown, undefined>;
 declare function defaultCase<In, Then extends (param: In) => unknown>(then: Then): Case<In, ReturnType<Then>>;
 
 export { conditionalPlus as conditional };