@vinicunca/perkakas 1.8.0 → 1.12.0

package/dist/add-prop.cjs

@@ -1 +1 @@
-require(`./lazy-data-last-impl-3PAFkslW.cjs`),require(`./curry-BPVIsvo3.cjs`);const e=require(`./add-prop-BxqZdgPd.cjs`);exports.addProp=e.addProp;
+const e=require(`./curry-BsY0Z8jH.cjs`);function t(...t){return e.t(n,t)}function n(e,t,n){return{...e,[t]:n}}exports.addProp=t;

package/dist/add-prop.d.cts

@@ -1,4 +1,46 @@
-import "./is-union-BEGCMhOi.cjs";
-import "./upsert-prop-Dtu5xY0L.cjs";
-import { addProp } from "./add-prop-tIjpXGRH.cjs";
-export { addProp };
+import { t as UpsertProp } from "./upsert-prop-P-aJDDII.cjs";
+
+//#region src/add-prop.d.ts
+
+/**
+ * Add a new property to an object.
+ *
+ * The function doesn't do any checks on the input object. If the property
+ * already exists it will be overwritten, and the type of the new value is not
+ * checked against the previous type.
+ *
+ * Use `set` to override values explicitly with better protections.
+ *
+ * @param obj the target object
+ * @param prop the property name
+ * @param value the property value
+ * @signature
+ *  P.addProp(obj, prop, value)
+ * @example
+ *  P.addProp({ firstName: 'john' }, 'lastName', 'doe'); // => {firstName: 'john', lastName: 'doe'}
+ * @dataFirst
+ * @category Object
+ */
+declare function addProp<T, K extends PropertyKey, V>(obj: T, prop: K, value: V): UpsertProp<T, K, V>;
+/**
+ * Add a new property to an object.
+ *
+ * The function doesn't do any checks on the input object. If the property
+ * already exists it will be overwritten, and the type of the new value is not
+ * checked against the previous type.
+ *
+ * Use `set` to override values explicitly with better protections.
+ *
+ * @param prop the property name
+ * @param value the property value
+ * @signature
+ *  P.addProp(prop, value)(obj)
+ * @example
+ *  P.addProp('lastName', 'doe')({ firstName: 'john' }); // => {firstName: 'john', lastName: 'doe'}
+ * @dataLast
+ * @category Object
+ */
+declare function addProp<T, K extends PropertyKey, V>(prop: K, value: V): (obj: T) => UpsertProp<T, K, V>;
+//#endregion
+export { addProp };
+//# sourceMappingURL=add-prop.d.cts.map

package/dist/add-prop.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"add-prop.d.cts","names":[],"sources":["../src/add-prop.ts"],"sourcesContent":[],"mappings":";;;;;;AAsBA;;;;;;;;;;AAwBA;;;;;;;AAGgC,iBA3BhB,OA2BgB,CAAA,CAAA,EAAA,UA3BK,WA2BL,EAAA,CAAA,CAAA,CAAA,GAAA,EA1BzB,CA0ByB,EAAA,IAAA,EAzBxB,CAyBwB,EAAA,KAAA,EAxBvB,CAwBuB,CAAA,EAvB7B,UAuB6B,CAvBlB,CAuBkB,EAvBf,CAuBe,EAvBZ,CAuBY,CAAA;;;;;;;;;;;;;;;;;;;iBAHhB,qBAAqB,sBAC7B,UACC,UACA,MAAM,WAAW,GAAG,GAAG"}

package/dist/add-prop.d.ts

@@ -1,4 +1,46 @@
-import "./is-union-CBVcM_uW.js";
-import "./upsert-prop-CE7fi_mP.js";
-import { addProp } from "./add-prop-CMZauInB.js";
-export { addProp };
+import { t as UpsertProp } from "./upsert-prop-__xTQQ07.js";
+
+//#region src/add-prop.d.ts
+
+/**
+ * Add a new property to an object.
+ *
+ * The function doesn't do any checks on the input object. If the property
+ * already exists it will be overwritten, and the type of the new value is not
+ * checked against the previous type.
+ *
+ * Use `set` to override values explicitly with better protections.
+ *
+ * @param obj the target object
+ * @param prop the property name
+ * @param value the property value
+ * @signature
+ *  P.addProp(obj, prop, value)
+ * @example
+ *  P.addProp({ firstName: 'john' }, 'lastName', 'doe'); // => {firstName: 'john', lastName: 'doe'}
+ * @dataFirst
+ * @category Object
+ */
+declare function addProp<T, K extends PropertyKey, V>(obj: T, prop: K, value: V): UpsertProp<T, K, V>;
+/**
+ * Add a new property to an object.
+ *
+ * The function doesn't do any checks on the input object. If the property
+ * already exists it will be overwritten, and the type of the new value is not
+ * checked against the previous type.
+ *
+ * Use `set` to override values explicitly with better protections.
+ *
+ * @param prop the property name
+ * @param value the property value
+ * @signature
+ *  P.addProp(prop, value)(obj)
+ * @example
+ *  P.addProp('lastName', 'doe')({ firstName: 'john' }); // => {firstName: 'john', lastName: 'doe'}
+ * @dataLast
+ * @category Object
+ */
+declare function addProp<T, K extends PropertyKey, V>(prop: K, value: V): (obj: T) => UpsertProp<T, K, V>;
+//#endregion
+export { addProp };
+//# sourceMappingURL=add-prop.d.ts.map

package/dist/add-prop.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"add-prop.d.ts","names":[],"sources":["../src/add-prop.ts"],"sourcesContent":[],"mappings":";;;;;;AAsBA;;;;;;;;;;AAwBA;;;;;;;AAGgC,iBA3BhB,OA2BgB,CAAA,CAAA,EAAA,UA3BK,WA2BL,EAAA,CAAA,CAAA,CAAA,GAAA,EA1BzB,CA0ByB,EAAA,IAAA,EAzBxB,CAyBwB,EAAA,KAAA,EAxBvB,CAwBuB,CAAA,EAvB7B,UAuB6B,CAvBlB,CAuBkB,EAvBf,CAuBe,EAvBZ,CAuBY,CAAA;;;;;;;;;;;;;;;;;;;iBAHhB,qBAAqB,sBAC7B,UACC,UACA,MAAM,WAAW,GAAG,GAAG"}

package/dist/add-prop.js

@@ -1 +1,2 @@
-import"./lazy-data-last-impl-7QfM1xXg.js";import"./curry-CzZjDrpv.js";import{addProp as e}from"./add-prop-CX56m6sR.js";export{e as addProp};
+import{t as e}from"./curry-BcQ8Up1_.js";function t(...t){return e(n,t)}function n(e,t,n){return{...e,[t]:n}}export{t as addProp};
+//# sourceMappingURL=add-prop.js.map

package/dist/add-prop.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"add-prop.js","names":[],"sources":["../src/add-prop.ts"],"sourcesContent":["import type { UpsertProp } from './internal/types/upsert-prop';\nimport { curry } from './curry';\n\n/**\n * Add a new property to an object.\n *\n * The function doesn't do any checks on the input object. If the property\n * already exists it will be overwritten, and the type of the new value is not\n * checked against the previous type.\n *\n * Use `set` to override values explicitly with better protections.\n *\n * @param obj the target object\n * @param prop the property name\n * @param value the property value\n * @signature\n *  P.addProp(obj, prop, value)\n * @example\n *  P.addProp({ firstName: 'john' }, 'lastName', 'doe'); // => {firstName: 'john', lastName: 'doe'}\n * @dataFirst\n * @category Object\n */\nexport function addProp<T, K extends PropertyKey, V>(\n  obj: T,\n  prop: K,\n  value: V,\n): UpsertProp<T, K, V>;\n\n/**\n * Add a new property to an object.\n *\n * The function doesn't do any checks on the input object. If the property\n * already exists it will be overwritten, and the type of the new value is not\n * checked against the previous type.\n *\n * Use `set` to override values explicitly with better protections.\n *\n * @param prop the property name\n * @param value the property value\n * @signature\n *  P.addProp(prop, value)(obj)\n * @example\n *  P.addProp('lastName', 'doe')({ firstName: 'john' }); // => {firstName: 'john', lastName: 'doe'}\n * @dataLast\n * @category Object\n */\nexport function addProp<T, K extends PropertyKey, V>(\n  prop: K,\n  value: V,\n): (obj: T) => UpsertProp<T, K, V>;\n\nexport function addProp(...args: ReadonlyArray<unknown>): unknown {\n  return curry(addPropImplementation, args);\n}\n\nfunction addPropImplementation<T, K extends PropertyKey, V>(\n  obj: T,\n  prop: K,\n  value: V,\n): UpsertProp<T, K, V> {\n  // @ts-expect-error [ts2322] TODO: [LOW] - Improve typing\n  return {\n    ...obj,\n    [prop]: value,\n  };\n}\n"],"mappings":"wCAmDA,SAAgB,EAAQ,GAAG,EAAuC,CAChE,OAAO,EAAM,EAAuB,EAAK,CAG3C,SAAS,EACP,EACA,EACA,EACqB,CAErB,MAAO,CACL,GAAG,GACF,GAAO,EACT"}

package/dist/add.cjs

@@ -1 +1 @@
-require(`./lazy-data-last-impl-3PAFkslW.cjs`),require(`./curry-BPVIsvo3.cjs`);const e=require(`./add-CbtGbPU8.cjs`);exports.add=e.add;
+const e=require(`./curry-BsY0Z8jH.cjs`);function t(...t){return e.t(n,t)}function n(e,t){return e+t}exports.add=t;

package/dist/add.d.cts

@@ -1,2 +1,34 @@
-import { add } from "./add-D2WnMolJ.cjs";
-export { add };
+//#region src/add.d.ts
+/**
+ * Adds two numbers.
+ *
+ * @param value - The number.
+ * @param addend - The number to add to the value.
+ * @signature
+ *    P.add(value, addend);
+ * @example
+ *    P.add(10, 5) // => 15
+ *    P.add(10, -5) // => 5
+ * @dataFirst
+ * @category Number
+ */
+declare function add(value: bigint, addend: bigint): bigint;
+declare function add(value: number, addend: number): number;
+/**
+ * Adds two numbers.
+ *
+ * @param addend - The number to add to the value.
+ * @signature
+ *    P.add(addend)(value);
+ * @example
+ *    P.add(5)(10) // => 15
+ *    P.add(-5)(10) // => 5
+ *    P.map([1, 2, 3, 4], P.add(1)) // => [2, 3, 4, 5]
+ * @dataLast
+ * @category Number
+ */
+declare function add(addend: bigint): (value: bigint) => bigint;
+declare function add(addend: number): (value: number) => number;
+//#endregion
+export { add };
+//# sourceMappingURL=add.d.cts.map

package/dist/add.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"add.d.cts","names":[],"sources":["../src/add.ts"],"sourcesContent":[],"mappings":";;AAeA;AACA;AAeA;AACA;;;;;;;;;iBAjBgB,GAAA;iBACA,GAAA;;;;;;;;;;;;;;iBAeA,GAAA;iBACA,GAAA"}

package/dist/add.d.ts

@@ -1,2 +1,34 @@
-import { add } from "./add-im980AO9.js";
-export { add };
+//#region src/add.d.ts
+/**
+ * Adds two numbers.
+ *
+ * @param value - The number.
+ * @param addend - The number to add to the value.
+ * @signature
+ *    P.add(value, addend);
+ * @example
+ *    P.add(10, 5) // => 15
+ *    P.add(10, -5) // => 5
+ * @dataFirst
+ * @category Number
+ */
+declare function add(value: bigint, addend: bigint): bigint;
+declare function add(value: number, addend: number): number;
+/**
+ * Adds two numbers.
+ *
+ * @param addend - The number to add to the value.
+ * @signature
+ *    P.add(addend)(value);
+ * @example
+ *    P.add(5)(10) // => 15
+ *    P.add(-5)(10) // => 5
+ *    P.map([1, 2, 3, 4], P.add(1)) // => [2, 3, 4, 5]
+ * @dataLast
+ * @category Number
+ */
+declare function add(addend: bigint): (value: bigint) => bigint;
+declare function add(addend: number): (value: number) => number;
+//#endregion
+export { add };
+//# sourceMappingURL=add.d.ts.map

package/dist/add.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"add.d.ts","names":[],"sources":["../src/add.ts"],"sourcesContent":[],"mappings":";;AAeA;AACA;AAeA;AACA;;;;;;;;;iBAjBgB,GAAA;iBACA,GAAA;;;;;;;;;;;;;;iBAeA,GAAA;iBACA,GAAA"}

package/dist/add.js

@@ -1 +1,2 @@
-import"./lazy-data-last-impl-7QfM1xXg.js";import"./curry-CzZjDrpv.js";import{add as e}from"./add-XyDHfOBw.js";export{e as add};
+import{t as e}from"./curry-BcQ8Up1_.js";function t(...t){return e(n,t)}function n(e,t){return e+t}export{t as add};
+//# sourceMappingURL=add.js.map

package/dist/add.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"add.js","names":[],"sources":["../src/add.ts"],"sourcesContent":["import { curry } from './curry';\n\n/**\n * Adds two numbers.\n *\n * @param value - The number.\n * @param addend - The number to add to the value.\n * @signature\n *    P.add(value, addend);\n * @example\n *    P.add(10, 5) // => 15\n *    P.add(10, -5) // => 5\n * @dataFirst\n * @category Number\n */\nexport function add(value: bigint, addend: bigint): bigint;\nexport function add(value: number, addend: number): number;\n\n/**\n * Adds two numbers.\n *\n * @param addend - The number to add to the value.\n * @signature\n *    P.add(addend)(value);\n * @example\n *    P.add(5)(10) // => 15\n *    P.add(-5)(10) // => 5\n *    P.map([1, 2, 3, 4], P.add(1)) // => [2, 3, 4, 5]\n * @dataLast\n * @category Number\n */\nexport function add(addend: bigint): (value: bigint) => bigint;\nexport function add(addend: number): (value: number) => number;\n\nexport function add(...args: ReadonlyArray<unknown>): unknown {\n  return curry(addImplementation, args);\n}\n\nfunction addImplementation(value: number, addend: number): number {\n  return value + addend;\n}\n"],"mappings":"wCAkCA,SAAgB,EAAI,GAAG,EAAuC,CAC5D,OAAO,EAAM,EAAmB,EAAK,CAGvC,SAAS,EAAkB,EAAe,EAAwB,CAChE,OAAO,EAAQ"}

package/dist/all-pass.cjs

@@ -1 +1 @@
-require(`./lazy-data-last-impl-3PAFkslW.cjs`),require(`./curry-BPVIsvo3.cjs`);const e=require(`./all-pass-Dm8Dnhq7.cjs`);exports.allPass=e.allPass;
+const e=require(`./curry-BsY0Z8jH.cjs`);function t(...t){return e.t(n,t)}function n(e,t){return t.every(t=>t(e))}exports.allPass=t;

package/dist/all-pass.d.cts

@@ -1,2 +1,37 @@
-import { allPass } from "./all-pass-BCivJ27h.cjs";
-export { allPass };
+//#region src/all-pass.d.ts
+/**
+ * Determines whether all predicates returns true for the input data.
+ *
+ * @param data - The input data for predicates.
+ * @param fns - The list of predicates.
+ * @signature
+ *    P.allPass(data, fns)
+ * @example
+ *    const isDivisibleBy3 = (x: number) => x % 3 === 0
+ *    const isDivisibleBy4 = (x: number) => x % 4 === 0
+ *    const fns = [isDivisibleBy3, isDivisibleBy4]
+ *    P.allPass(12, fns) // => true
+ *    P.allPass(8, fns) // => false
+ * @dataFirst
+ * @category Array
+ */
+declare function allPass<T>(data: T, fns: ReadonlyArray<(data: T) => boolean>): boolean;
+/**
+ * Determines whether all predicates returns true for the input data.
+ *
+ * @param fns - The list of predicates.
+ * @signature
+ *    P.allPass(fns)(data)
+ * @example
+ *    const isDivisibleBy3 = (x: number) => x % 3 === 0
+ *    const isDivisibleBy4 = (x: number) => x % 4 === 0
+ *    const fns = [isDivisibleBy3, isDivisibleBy4]
+ *    P.allPass(fns)(12) // => true
+ *    P.allPass(fns)(8) // => false
+ * @dataLast
+ * @category Array
+ */
+declare function allPass<T>(fns: ReadonlyArray<(data: T) => boolean>): (data: T) => boolean;
+//#endregion
+export { allPass };
+//# sourceMappingURL=all-pass.d.cts.map

package/dist/all-pass.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"all-pass.d.cts","names":[],"sources":["../src/all-pass.ts"],"sourcesContent":[],"mappings":";;AAkBA;;;;;AAoBA;;;;;;;;;;iBApBgB,iBACR,QACD,qBAAqB;;;;;;;;;;;;;;;;iBAkBZ,gBACT,qBAAqB,wBAClB"}

package/dist/all-pass.d.ts

@@ -1,2 +1,37 @@
-import { allPass } from "./all-pass-DXpE2AMI.js";
-export { allPass };
+//#region src/all-pass.d.ts
+/**
+ * Determines whether all predicates returns true for the input data.
+ *
+ * @param data - The input data for predicates.
+ * @param fns - The list of predicates.
+ * @signature
+ *    P.allPass(data, fns)
+ * @example
+ *    const isDivisibleBy3 = (x: number) => x % 3 === 0
+ *    const isDivisibleBy4 = (x: number) => x % 4 === 0
+ *    const fns = [isDivisibleBy3, isDivisibleBy4]
+ *    P.allPass(12, fns) // => true
+ *    P.allPass(8, fns) // => false
+ * @dataFirst
+ * @category Array
+ */
+declare function allPass<T>(data: T, fns: ReadonlyArray<(data: T) => boolean>): boolean;
+/**
+ * Determines whether all predicates returns true for the input data.
+ *
+ * @param fns - The list of predicates.
+ * @signature
+ *    P.allPass(fns)(data)
+ * @example
+ *    const isDivisibleBy3 = (x: number) => x % 3 === 0
+ *    const isDivisibleBy4 = (x: number) => x % 4 === 0
+ *    const fns = [isDivisibleBy3, isDivisibleBy4]
+ *    P.allPass(fns)(12) // => true
+ *    P.allPass(fns)(8) // => false
+ * @dataLast
+ * @category Array
+ */
+declare function allPass<T>(fns: ReadonlyArray<(data: T) => boolean>): (data: T) => boolean;
+//#endregion
+export { allPass };
+//# sourceMappingURL=all-pass.d.ts.map

package/dist/all-pass.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"all-pass.d.ts","names":[],"sources":["../src/all-pass.ts"],"sourcesContent":[],"mappings":";;AAkBA;;;;;AAoBA;;;;;;;;;;iBApBgB,iBACR,QACD,qBAAqB;;;;;;;;;;;;;;;;iBAkBZ,gBACT,qBAAqB,wBAClB"}

package/dist/all-pass.js

@@ -1 +1,2 @@
-import"./lazy-data-last-impl-7QfM1xXg.js";import"./curry-CzZjDrpv.js";import{allPass as e}from"./all-pass-TOwgGHEo.js";export{e as allPass};
+import{t as e}from"./curry-BcQ8Up1_.js";function t(...t){return e(n,t)}function n(e,t){return t.every(t=>t(e))}export{t as allPass};
+//# sourceMappingURL=all-pass.js.map

package/dist/all-pass.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"all-pass.js","names":[],"sources":["../src/all-pass.ts"],"sourcesContent":["import { curry } from './curry';\n\n/**\n * Determines whether all predicates returns true for the input data.\n *\n * @param data - The input data for predicates.\n * @param fns - The list of predicates.\n * @signature\n *    P.allPass(data, fns)\n * @example\n *    const isDivisibleBy3 = (x: number) => x % 3 === 0\n *    const isDivisibleBy4 = (x: number) => x % 4 === 0\n *    const fns = [isDivisibleBy3, isDivisibleBy4]\n *    P.allPass(12, fns) // => true\n *    P.allPass(8, fns) // => false\n * @dataFirst\n * @category Array\n */\nexport function allPass<T>(\n  data: T,\n  fns: ReadonlyArray<(data: T) => boolean>,\n): boolean;\n\n/**\n * Determines whether all predicates returns true for the input data.\n *\n * @param fns - The list of predicates.\n * @signature\n *    P.allPass(fns)(data)\n * @example\n *    const isDivisibleBy3 = (x: number) => x % 3 === 0\n *    const isDivisibleBy4 = (x: number) => x % 4 === 0\n *    const fns = [isDivisibleBy3, isDivisibleBy4]\n *    P.allPass(fns)(12) // => true\n *    P.allPass(fns)(8) // => false\n * @dataLast\n * @category Array\n */\nexport function allPass<T>(\n  fns: ReadonlyArray<(data: T) => boolean>,\n): (data: T) => boolean;\n\nexport function allPass(...args: ReadonlyArray<unknown>): unknown {\n  return curry(allPassImplementation, args);\n}\n\nfunction allPassImplementation<T>(\n  data: T,\n  fns: ReadonlyArray<(data: T) => boolean>,\n): boolean {\n  return fns.every((fn) => fn(data));\n}\n"],"mappings":"wCA0CA,SAAgB,EAAQ,GAAG,EAAuC,CAChE,OAAO,EAAM,EAAuB,EAAK,CAG3C,SAAS,EACP,EACA,EACS,CACT,OAAO,EAAI,MAAO,GAAO,EAAG,EAAK,CAAC"}

package/dist/any-pass.cjs

@@ -1 +1 @@
-require(`./lazy-data-last-impl-3PAFkslW.cjs`),require(`./curry-BPVIsvo3.cjs`);const e=require(`./any-pass-UiZWZkzr.cjs`);exports.anyPass=e.anyPass;
+const e=require(`./curry-BsY0Z8jH.cjs`);function t(...t){return e.t(n,t)}function n(e,t){return t.some(t=>t(e))}exports.anyPass=t;

package/dist/any-pass.d.cts

@@ -1,2 +1,37 @@
-import { anyPass } from "./any-pass-BUlFAsyd.cjs";
-export { anyPass };
+//#region src/any-pass.d.ts
+/**
+ * Determines whether any predicate returns true for the input data.
+ *
+ * @param data - The input data for predicates.
+ * @param fns - The list of predicates.
+ * @signature
+ *    P.anyPass(data, fns)
+ * @example
+ *    const isDivisibleBy3 = (x: number) => x % 3 === 0
+ *    const isDivisibleBy4 = (x: number) => x % 4 === 0
+ *    const fns = [isDivisibleBy3, isDivisibleBy4]
+ *    P.anyPass(8, fns) // => true
+ *    P.anyPass(11, fns) // => false
+ * @dataFirst
+ * @category Array
+ */
+declare function anyPass<T>(data: T, fns: ReadonlyArray<(data: T) => boolean>): boolean;
+/**
+ * Determines whether any predicate returns true for the input data.
+ *
+ * @param fns - The list of predicates.
+ * @signature
+ *    P.anyPass(fns)(data)
+ * @example
+ *    const isDivisibleBy3 = (x: number) => x % 3 === 0
+ *    const isDivisibleBy4 = (x: number) => x % 4 === 0
+ *    const fns = [isDivisibleBy3, isDivisibleBy4]
+ *    P.anyPass(fns)(8) // => true
+ *    P.anyPass(fns)(11) // => false
+ * @dataLast
+ * @category Array
+ */
+declare function anyPass<T>(fns: ReadonlyArray<(data: T) => boolean>): (data: T) => boolean;
+//#endregion
+export { anyPass };
+//# sourceMappingURL=any-pass.d.cts.map

package/dist/any-pass.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"any-pass.d.cts","names":[],"sources":["../src/any-pass.ts"],"sourcesContent":[],"mappings":";;AAkBA;;;;;AAoBA;;;;;;;;;;iBApBgB,iBACR,QACD,qBAAqB;;;;;;;;;;;;;;;;iBAkBZ,gBACT,qBAAqB,wBAClB"}

package/dist/any-pass.d.ts

@@ -1,2 +1,37 @@
-import { anyPass } from "./any-pass-DODvFXfM.js";
-export { anyPass };
+//#region src/any-pass.d.ts
+/**
+ * Determines whether any predicate returns true for the input data.
+ *
+ * @param data - The input data for predicates.
+ * @param fns - The list of predicates.
+ * @signature
+ *    P.anyPass(data, fns)
+ * @example
+ *    const isDivisibleBy3 = (x: number) => x % 3 === 0
+ *    const isDivisibleBy4 = (x: number) => x % 4 === 0
+ *    const fns = [isDivisibleBy3, isDivisibleBy4]
+ *    P.anyPass(8, fns) // => true
+ *    P.anyPass(11, fns) // => false
+ * @dataFirst
+ * @category Array
+ */
+declare function anyPass<T>(data: T, fns: ReadonlyArray<(data: T) => boolean>): boolean;
+/**
+ * Determines whether any predicate returns true for the input data.
+ *
+ * @param fns - The list of predicates.
+ * @signature
+ *    P.anyPass(fns)(data)
+ * @example
+ *    const isDivisibleBy3 = (x: number) => x % 3 === 0
+ *    const isDivisibleBy4 = (x: number) => x % 4 === 0
+ *    const fns = [isDivisibleBy3, isDivisibleBy4]
+ *    P.anyPass(fns)(8) // => true
+ *    P.anyPass(fns)(11) // => false
+ * @dataLast
+ * @category Array
+ */
+declare function anyPass<T>(fns: ReadonlyArray<(data: T) => boolean>): (data: T) => boolean;
+//#endregion
+export { anyPass };
+//# sourceMappingURL=any-pass.d.ts.map

package/dist/any-pass.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"any-pass.d.ts","names":[],"sources":["../src/any-pass.ts"],"sourcesContent":[],"mappings":";;AAkBA;;;;;AAoBA;;;;;;;;;;iBApBgB,iBACR,QACD,qBAAqB;;;;;;;;;;;;;;;;iBAkBZ,gBACT,qBAAqB,wBAClB"}

package/dist/any-pass.js

@@ -1 +1,2 @@
-import"./lazy-data-last-impl-7QfM1xXg.js";import"./curry-CzZjDrpv.js";import{anyPass as e}from"./any-pass-B1tqZ-S8.js";export{e as anyPass};
+import{t as e}from"./curry-BcQ8Up1_.js";function t(...t){return e(n,t)}function n(e,t){return t.some(t=>t(e))}export{t as anyPass};
+//# sourceMappingURL=any-pass.js.map

package/dist/any-pass.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"any-pass.js","names":[],"sources":["../src/any-pass.ts"],"sourcesContent":["import { curry } from './curry';\n\n/**\n * Determines whether any predicate returns true for the input data.\n *\n * @param data - The input data for predicates.\n * @param fns - The list of predicates.\n * @signature\n *    P.anyPass(data, fns)\n * @example\n *    const isDivisibleBy3 = (x: number) => x % 3 === 0\n *    const isDivisibleBy4 = (x: number) => x % 4 === 0\n *    const fns = [isDivisibleBy3, isDivisibleBy4]\n *    P.anyPass(8, fns) // => true\n *    P.anyPass(11, fns) // => false\n * @dataFirst\n * @category Array\n */\nexport function anyPass<T>(\n  data: T,\n  fns: ReadonlyArray<(data: T) => boolean>,\n): boolean;\n\n/**\n * Determines whether any predicate returns true for the input data.\n *\n * @param fns - The list of predicates.\n * @signature\n *    P.anyPass(fns)(data)\n * @example\n *    const isDivisibleBy3 = (x: number) => x % 3 === 0\n *    const isDivisibleBy4 = (x: number) => x % 4 === 0\n *    const fns = [isDivisibleBy3, isDivisibleBy4]\n *    P.anyPass(fns)(8) // => true\n *    P.anyPass(fns)(11) // => false\n * @dataLast\n * @category Array\n */\nexport function anyPass<T>(\n  fns: ReadonlyArray<(data: T) => boolean>,\n): (data: T) => boolean;\n\nexport function anyPass(...args: ReadonlyArray<unknown>): unknown {\n  return curry(anyPassImplementation, args);\n}\n\nfunction anyPassImplementation<T>(\n  data: T,\n  fns: ReadonlyArray<(data: T) => boolean>,\n): boolean {\n  return fns.some((fn) => fn(data));\n}\n"],"mappings":"wCA0CA,SAAgB,EAAQ,GAAG,EAAuC,CAChE,OAAO,EAAM,EAAuB,EAAK,CAG3C,SAAS,EACP,EACA,EACS,CACT,OAAO,EAAI,KAAM,GAAO,EAAG,EAAK,CAAC"}

package/dist/array-required-prefix-CefHtaKs.d.ts

@@ -0,0 +1,26 @@
+import { t as IterableContainer } from "./iterable-container-BdjPuIjL.js";
+import { t as PerkakasTypeError } from "./perkakas-type-error-DmmsEmEF.js";
+import { t as TupleParts } from "./tuple-parts-Bhbm4jiu.js";
+import { t as ClampedIntegerSubtract } from "./clamped-integer-subtract-sK2BlhSm.js";
+import { t as CoercedArray } from "./coerced-array-1Xs4p4iF.js";
+import { And, GreaterThan, IsEqual, IsLiteral, IsNever, ReadonlyTuple } from "type-fest";
+
+//#region src/internal/types/array-required-prefix.d.ts
+type ArrayRequiredPrefix<T extends IterableContainer, N extends number> = IsLiteral<N> extends true ? T extends unknown ? ClampedIntegerSubtract<N, [...TupleParts<T>['required'], ...TupleParts<T>['suffix']]['length']> extends infer Remainder extends number ? Remainder extends 0 ? T : And<GreaterThan<Remainder, TupleParts<T>['optional']['length']>, IsNever<TupleParts<T>['item']>> extends true ? PerkakasTypeError<'ArrayRequiredPrefix', 'The input tuple cannot satisfy the minimum', {
+  type: never;
+  metadata: [T, N];
+}> : WithSameReadonly<T, [...TupleParts<T>['required'], ...OptionalTupleRequiredPrefix<TupleParts<T>['optional'], Remainder>, ...ReadonlyTuple<TupleParts<T>['item'], ClampedIntegerSubtract<Remainder, TupleParts<T>['optional']['length']>>, ...CoercedArray<TupleParts<T>['item']>, ...TupleParts<T>['suffix']]> : PerkakasTypeError<'ArrayRequiredPrefix', 'Remainder didn\'t compute to a number?!', {
+  type: never;
+  metadata: [T, N];
+}> : PerkakasTypeError<'ArrayRequiredPrefix', 'Failed to distribute union?!', {
+  type: never;
+  metadata: T;
+}> : PerkakasTypeError<'ArrayRequiredPrefix', 'Only literal minimums are supported!', {
+  type: never;
+  metadata: N;
+}>;
+type WithSameReadonly<Source, Destination> = IsEqual<Source, Readonly<Source>> extends true ? Readonly<Destination> : Destination;
+type OptionalTupleRequiredPrefix<T extends Array<unknown>, N, Prefix extends Array<unknown> = []> = Prefix['length'] extends N ? [...Prefix, ...Partial<T>] : T extends readonly [infer Head, ...infer Rest] ? OptionalTupleRequiredPrefix<Rest, N, [...Prefix, Head]> : Prefix;
+//#endregion
+export { ArrayRequiredPrefix as t };
+//# sourceMappingURL=array-required-prefix-CefHtaKs.d.ts.map

package/dist/array-required-prefix-CefHtaKs.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-required-prefix-CefHtaKs.d.ts","names":[],"sources":["../src/internal/types/array-required-prefix.ts"],"sourcesContent":[],"mappings":";;;;;;;;KAcY,8BAA8B,uCACtC,UAAU,kBAER,oBACE,uBACA,OACI,WAAW,gBANX,GAM8B,UAN9B,CAMyC,CANzC,CAAA,CAAA,QAAmB,CAAA,CAAW,CAAA,QAAA,CAAA,CAAA,SAAA,KAAA,mBAAA,MAAA,GAAA,SAAA,SAAA,CAAA,GAW9B,CAX8B,GAY9B,GAZ8B,CAe9B,WAf8B,CAelB,SAfkB,EAeP,UAfO,CAeI,CAfJ,CAAA,CAAA,UAAA,CAAA,CAAA,QAAA,CAAA,CAAA,EAiB9B,OAjB8B,CAiBtB,UAjBsB,CAiBX,CAjBW,CAAA,CAAA,MAAA,CAAA,CAAA,CAAA,SAAA,IAAA,GAmB5B,iBAnB4B,CAAA,qBAAA,EAAA,4CAAA,EAAA;EAC5B,IAAA,EAAA,KAAA;EAAV,QAAA,EAAA,CAuBuB,CAvBvB,EAuB0B,CAvB1B,CAAA;CAEE,CAAA,GA4BQ,gBA5BR,CA6BQ,CA7BR,EAAA,CAEE,GA+BW,UA/BX,CA+BsB,CA/BtB,CAAA,CAAA,UAAA,CAAA,EACe,GAoCJ,2BApCI,CAqCL,UArCK,CAqCM,CArCN,CAAA,CAAA,UAAA,CAAA,EAsCL,SAtCK,CAAA,EAAX,GA4CO,aA5CP,CA6CM,UA7CN,CA6CiB,CA7CjB,CAAA,CAAA,MAAA,CAAA,EA8CM,sBA9CN,CA+CQ,SA/CR,EAgDQ,UAhDR,CAgDmB,CAhDnB,CAAA,CAAA,UAAA,CAAA,CAAA,QAAA,CAAA,CAAA,CAAA,EAAyC,GAsDlC,YAtDkC,CAsDrB,UAtDqB,CAsDV,CAtDU,CAAA,CAAA,MAAA,CAAA,CAAA,EAAX,GAuDvB,UAvDuB,CAuDZ,CAvDY,CAAA,CAAA,QAAA,CAAA,CAFlC,CAAA,GA4DE,iBA5DF,CAAA,qBAAA,EAAA,yCAAA,EAAA;EAOI,IAAA,EAAA,KAAA;EAIY,QAAA,EAAA,CAsDD,CAtDC,EAsDE,CAtDF,CAAA;CAAsB,CAAA,GAyDtC,iBAzDsC,CAAA,qBAAA,EAAA,8BAAA,EAAA;EAAX,IAAA,EAAA,KAAA;EAAvB,QAAA,EA8DQ,CA9DR;CAEmB,CAAA,GA+DzB,iBA/DyB,CAAA,qBAAA,EAAA,sCAAA,EAAA;EAAX,IAAA,EAAA,KAAA;EAAR,QAAA,EAoEM,CApEN;CALA,CAAA;KA+EP,gBAnEsB,CAAA,MAAA,EAAA,WAAA,CAAA,GAoEvB,OApEuB,CAoEf,MApEe,EAoEP,QApEO,CAoEE,MApEF,CAAA,CAAA,SAAA,IAAA,GAqErB,QArEqB,CAqEZ,WArEY,CAAA,GAsErB,WAtEqB;KA4EtB,2BA5EyB,CAAA,UA6ElB,KA7EkB,CAAA,OAAA,CAAA,EAAA,CAAA,EAAA,eA+Eb,KA/Ea,CAAA,OAAA,CAAA,GAAA,EAAA,CAAA,GAgF1B,MAhF0B,CAAA,QAAA,CAAA,SAgFD,CAhFC,GAAA,CAAA,GAqFtB,MArFsB,EAAA,GAqFX,OArFW,CAqFH,CArFG,CAAA,CAAA,GAsF1B,CAtF0B,SAAA,SAAA,CAAA,KAAA,KAAA,EAAA,GAAA,KAAA,KAAA,CAAA,GAuFxB,2BAvFwB,CAuFI,IAvFJ,EAuFU,CAvFV,EAAA,CAAA,GAuFiB,MAvFjB,EAuFyB,IAvFzB,CAAA,CAAA,GA2FxB,MA3FwB"}

package/dist/array-required-prefix-DxzEAAwi.d.cts

@@ -0,0 +1,26 @@
+import { t as IterableContainer } from "./iterable-container-OFsaw8WL.cjs";
+import { t as PerkakasTypeError } from "./perkakas-type-error-BERl_sWR.cjs";
+import { t as TupleParts } from "./tuple-parts-BJQEORxn.cjs";
+import { t as ClampedIntegerSubtract } from "./clamped-integer-subtract-oLs8msYu.cjs";
+import { t as CoercedArray } from "./coerced-array-DS7cKtbA.cjs";
+import { And, GreaterThan, IsEqual, IsLiteral, IsNever, ReadonlyTuple } from "type-fest";
+
+//#region src/internal/types/array-required-prefix.d.ts
+type ArrayRequiredPrefix<T extends IterableContainer, N extends number> = IsLiteral<N> extends true ? T extends unknown ? ClampedIntegerSubtract<N, [...TupleParts<T>['required'], ...TupleParts<T>['suffix']]['length']> extends infer Remainder extends number ? Remainder extends 0 ? T : And<GreaterThan<Remainder, TupleParts<T>['optional']['length']>, IsNever<TupleParts<T>['item']>> extends true ? PerkakasTypeError<'ArrayRequiredPrefix', 'The input tuple cannot satisfy the minimum', {
+  type: never;
+  metadata: [T, N];
+}> : WithSameReadonly<T, [...TupleParts<T>['required'], ...OptionalTupleRequiredPrefix<TupleParts<T>['optional'], Remainder>, ...ReadonlyTuple<TupleParts<T>['item'], ClampedIntegerSubtract<Remainder, TupleParts<T>['optional']['length']>>, ...CoercedArray<TupleParts<T>['item']>, ...TupleParts<T>['suffix']]> : PerkakasTypeError<'ArrayRequiredPrefix', 'Remainder didn\'t compute to a number?!', {
+  type: never;
+  metadata: [T, N];
+}> : PerkakasTypeError<'ArrayRequiredPrefix', 'Failed to distribute union?!', {
+  type: never;
+  metadata: T;
+}> : PerkakasTypeError<'ArrayRequiredPrefix', 'Only literal minimums are supported!', {
+  type: never;
+  metadata: N;
+}>;
+type WithSameReadonly<Source, Destination> = IsEqual<Source, Readonly<Source>> extends true ? Readonly<Destination> : Destination;
+type OptionalTupleRequiredPrefix<T extends Array<unknown>, N, Prefix extends Array<unknown> = []> = Prefix['length'] extends N ? [...Prefix, ...Partial<T>] : T extends readonly [infer Head, ...infer Rest] ? OptionalTupleRequiredPrefix<Rest, N, [...Prefix, Head]> : Prefix;
+//#endregion
+export { ArrayRequiredPrefix as t };
+//# sourceMappingURL=array-required-prefix-DxzEAAwi.d.cts.map

package/dist/array-required-prefix-DxzEAAwi.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-required-prefix-DxzEAAwi.d.cts","names":[],"sources":["../src/internal/types/array-required-prefix.ts"],"sourcesContent":[],"mappings":";;;;;;;;KAcY,8BAA8B,uCACtC,UAAU,kBAER,oBACE,uBACA,OACI,WAAW,gBANX,GAM8B,UAN9B,CAMyC,CANzC,CAAA,CAAA,QAAmB,CAAA,CAAW,CAAA,QAAA,CAAA,CAAA,SAAA,KAAA,mBAAA,MAAA,GAAA,SAAA,SAAA,CAAA,GAW9B,CAX8B,GAY9B,GAZ8B,CAe9B,WAf8B,CAelB,SAfkB,EAeP,UAfO,CAeI,CAfJ,CAAA,CAAA,UAAA,CAAA,CAAA,QAAA,CAAA,CAAA,EAiB9B,OAjB8B,CAiBtB,UAjBsB,CAiBX,CAjBW,CAAA,CAAA,MAAA,CAAA,CAAA,CAAA,SAAA,IAAA,GAmB5B,iBAnB4B,CAAA,qBAAA,EAAA,4CAAA,EAAA;EAC5B,IAAA,EAAA,KAAA;EAAV,QAAA,EAAA,CAuBuB,CAvBvB,EAuB0B,CAvB1B,CAAA;CAEE,CAAA,GA4BQ,gBA5BR,CA6BQ,CA7BR,EAAA,CAEE,GA+BW,UA/BX,CA+BsB,CA/BtB,CAAA,CAAA,UAAA,CAAA,EACe,GAoCJ,2BApCI,CAqCL,UArCK,CAqCM,CArCN,CAAA,CAAA,UAAA,CAAA,EAsCL,SAtCK,CAAA,EAAX,GA4CO,aA5CP,CA6CM,UA7CN,CA6CiB,CA7CjB,CAAA,CAAA,MAAA,CAAA,EA8CM,sBA9CN,CA+CQ,SA/CR,EAgDQ,UAhDR,CAgDmB,CAhDnB,CAAA,CAAA,UAAA,CAAA,CAAA,QAAA,CAAA,CAAA,CAAA,EAAyC,GAsDlC,YAtDkC,CAsDrB,UAtDqB,CAsDV,CAtDU,CAAA,CAAA,MAAA,CAAA,CAAA,EAAX,GAuDvB,UAvDuB,CAuDZ,CAvDY,CAAA,CAAA,QAAA,CAAA,CAFlC,CAAA,GA4DE,iBA5DF,CAAA,qBAAA,EAAA,yCAAA,EAAA;EAOI,IAAA,EAAA,KAAA;EAIY,QAAA,EAAA,CAsDD,CAtDC,EAsDE,CAtDF,CAAA;CAAsB,CAAA,GAyDtC,iBAzDsC,CAAA,qBAAA,EAAA,8BAAA,EAAA;EAAX,IAAA,EAAA,KAAA;EAAvB,QAAA,EA8DQ,CA9DR;CAEmB,CAAA,GA+DzB,iBA/DyB,CAAA,qBAAA,EAAA,sCAAA,EAAA;EAAX,IAAA,EAAA,KAAA;EAAR,QAAA,EAoEM,CApEN;CALA,CAAA;KA+EP,gBAnEsB,CAAA,MAAA,EAAA,WAAA,CAAA,GAoEvB,OApEuB,CAoEf,MApEe,EAoEP,QApEO,CAoEE,MApEF,CAAA,CAAA,SAAA,IAAA,GAqErB,QArEqB,CAqEZ,WArEY,CAAA,GAsErB,WAtEqB;KA4EtB,2BA5EyB,CAAA,UA6ElB,KA7EkB,CAAA,OAAA,CAAA,EAAA,CAAA,EAAA,eA+Eb,KA/Ea,CAAA,OAAA,CAAA,GAAA,EAAA,CAAA,GAgF1B,MAhF0B,CAAA,QAAA,CAAA,SAgFD,CAhFC,GAAA,CAAA,GAqFtB,MArFsB,EAAA,GAqFX,OArFW,CAqFH,CArFG,CAAA,CAAA,GAsF1B,CAtF0B,SAAA,SAAA,CAAA,KAAA,KAAA,EAAA,GAAA,KAAA,KAAA,CAAA,GAuFxB,2BAvFwB,CAuFI,IAvFJ,EAuFU,CAvFV,EAAA,CAAA,GAuFiB,MAvFjB,EAuFyB,IAvFzB,CAAA,CAAA,GA2FxB,MA3FwB"}

package/dist/binary-search-cutoff-index-ClkmTCR5.cjs

@@ -0,0 +1 @@
+function e(e,t){let n=0,r=e.length;for(;n<r;){let i=n+r>>>1,a=e[i];t(a,i,e)?n=i+1:r=i}return r}Object.defineProperty(exports,`t`,{enumerable:!0,get:function(){return e}});

package/dist/binary-search-cutoff-index-yQ2qcJHb.js

@@ -0,0 +1,2 @@
+function e(e,t){let n=0,r=e.length;for(;n<r;){let i=n+r>>>1,a=e[i];t(a,i,e)?n=i+1:r=i}return r}export{e as t};
+//# sourceMappingURL=binary-search-cutoff-index-yQ2qcJHb.js.map

package/dist/binary-search-cutoff-index-yQ2qcJHb.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"binary-search-cutoff-index-yQ2qcJHb.js","names":[],"sources":["../src/internal/binary-search-cutoff-index.ts"],"sourcesContent":["/**\n * A binary search implementation that finds the index at which `predicate`\n * stops returning `true` and starts returning `false` (consistently) when run\n * on the items of the array. It **assumes** that mapping the array via the\n * predicate results in the shape `[...true[], ...false[]]`. *For any other case\n * the result is unpredictable*.\n *\n * This is the base implementation of the `sortedIndex` functions which define\n * the predicate for the user, for common use-cases.\n *\n * It is similar to `findIndex`, but runs at O(logN), whereas the latter is\n * general purpose function which runs on any array and predicate, but runs at\n * O(N) time.\n */\nexport function binarySearchCutoffIndex<T>(\n  array: ReadonlyArray<T>,\n  predicate: (value: T, index: number, data: ReadonlyArray<T>) => boolean,\n): number {\n  let lowIndex = 0;\n  let highIndex = array.length;\n\n  while (lowIndex < highIndex) {\n    const pivotIndex = (lowIndex + highIndex) >>> 1;\n    const pivot = array[pivotIndex]!;\n\n    if (predicate(pivot, pivotIndex, array)) {\n      lowIndex = pivotIndex + 1;\n    } else {\n      highIndex = pivotIndex;\n    }\n  }\n\n  return highIndex;\n}\n"],"mappings":"AAcA,SAAgB,EACd,EACA,EACQ,CACR,IAAI,EAAW,EACX,EAAY,EAAM,OAEtB,KAAO,EAAW,GAAW,CAC3B,IAAM,EAAc,EAAW,IAAe,EACxC,EAAQ,EAAM,GAEhB,EAAU,EAAO,EAAY,EAAM,CACrC,EAAW,EAAa,EAExB,EAAY,EAIhB,OAAO"}

package/dist/bounded-partial-D6ouPlXl.d.cts

@@ -0,0 +1,17 @@
+import { t as IsBoundedRecord } from "./is-bounded-record-D9YK_OC8.cjs";
+
+//#region src/internal/types/bounded-partial.d.ts
+
+/**
+ * Records with an unbounded set of keys have different semantics to those with
+ * a bounded set of keys when using 'noUncheckedIndexedAccess', the former
+ * being implicitly `Partial` whereas the latter are implicitly `Required`.
+ *
+ * @example
+ *    BoundedPartial<{ a: number }>; //=> { a?: number }
+ *    BoundedPartial<Record<string, number>>; //=> Record<string, number>
+ */
+type BoundedPartial<T> = IsBoundedRecord<T> extends true ? Partial<T> : T;
+//#endregion
+export { BoundedPartial as t };
+//# sourceMappingURL=bounded-partial-D6ouPlXl.d.cts.map

package/dist/bounded-partial-D6ouPlXl.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bounded-partial-D6ouPlXl.d.cts","names":[],"sources":["../src/internal/types/bounded-partial.ts"],"sourcesContent":[],"mappings":";;;;;;AAWA;;;;;;;KAAY,oBAAoB,gBAAgB,kBAAkB,QAAQ,KAAK"}

package/dist/bounded-partial-DBIIClPU.d.ts

@@ -0,0 +1,17 @@
+import { t as IsBoundedRecord } from "./is-bounded-record-BGclJjRX.js";
+
+//#region src/internal/types/bounded-partial.d.ts
+
+/**
+ * Records with an unbounded set of keys have different semantics to those with
+ * a bounded set of keys when using 'noUncheckedIndexedAccess', the former
+ * being implicitly `Partial` whereas the latter are implicitly `Required`.
+ *
+ * @example
+ *    BoundedPartial<{ a: number }>; //=> { a?: number }
+ *    BoundedPartial<Record<string, number>>; //=> Record<string, number>
+ */
+type BoundedPartial<T> = IsBoundedRecord<T> extends true ? Partial<T> : T;
+//#endregion
+export { BoundedPartial as t };
+//# sourceMappingURL=bounded-partial-DBIIClPU.d.ts.map

package/dist/bounded-partial-DBIIClPU.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bounded-partial-DBIIClPU.d.ts","names":[],"sources":["../src/internal/types/bounded-partial.ts"],"sourcesContent":[],"mappings":";;;;;;AAWA;;;;;;;KAAY,oBAAoB,gBAAgB,kBAAkB,QAAQ,KAAK"}

package/dist/case.transform-CCMWrBmz.js

@@ -0,0 +1,2 @@
+const e=/([\p{Ll}\d])(\p{Lu})/gu,t=/(\p{Lu})(\p{Lu}\p{Ll})/gu,n=/(\d)\p{Ll}|(\p{L})\d/u,r=/[^\p{L}\d]+/giu,i=`$1\0$2`;function a(e,t={}){let n=t.splitFn??(t.separateNumbers?l:o),r=t.prefixCharacters??``,i=t.suffixCharacters??``,a=0,s=e.length;for(;a<e.length;){let t=e.charAt(a);if(!r.includes(t))break;a++}for(;s>a;){let t=s-1,n=e.charAt(t);if(!i.includes(n))break;s=t}return[e.slice(0,a),n(e.slice(a,s)),e.slice(s)]}function o(n){let a=n.trim();a=a.replace(e,i).replace(t,i),a=a.replace(r,`\0`);let o=0,s=a.length;for(;a.charAt(o)===`\0`;)o++;if(o===s)return[];for(;a.charAt(s-1)===`\0`;)s--;return a.slice(o,s).split(/\0/)}function s(){return e=>e[0].toUpperCase()+e.slice(1).toLowerCase()}function c(){return(e,t)=>{let n=e[0];return(t>0&&n>=`0`&&n<=`9`?`_${n}`:n.toUpperCase())+e.slice(1).toLowerCase()}}function l(e){let t=o(e);for(let e=0;e<t.length;e++){let r=t[e],i=n.exec(r);if(i){let n=i.index+(i[1]??i[2]).length;t.splice(e,1,r.slice(0,n),r.slice(n))}}return t}export{c as n,a as r,s as t};
+//# sourceMappingURL=case.transform-CCMWrBmz.js.map

package/dist/case.transform-CCMWrBmz.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"case.transform-CCMWrBmz.js","names":[],"sources":["../src/internal/case.transform.ts"],"sourcesContent":["import type { ChangeCaseOptions } from './case.types';\n\n// Regexps involved with splitting words in various case formats.\nconst SPLIT_LOWER_UPPER_RE = /([\\p{Ll}\\d])(\\p{Lu})/gu;\nconst SPLIT_UPPER_UPPER_RE = /(\\p{Lu})(\\p{Lu}\\p{Ll})/gu;\n\n// Used to iterate over the initial split result and separate numbers.\nconst SPLIT_SEPARATE_NUMBER_RE = /(\\d)\\p{Ll}|(\\p{L})\\d/u;\n\n// Regexp involved with stripping non-word characters from the result.\nconst DEFAULT_STRIP_REGEXP = /[^\\p{L}\\d]+/giu;\n\n// The replacement value for splits.\nconst SPLIT_REPLACE_VALUE = '$1\\0$2';\n\n// The default characters to keep after transforming case.\nconst DEFAULT_PREFIX_SUFFIX_CHARACTERS = '';\n\nexport function splitPrefixSuffix(\n  input: string,\n  options: ChangeCaseOptions = {},\n): [string, Array<string>, string] {\n  const splitFn = options.splitFn ?? (\n    options.separateNumbers\n      ? splitSeparateNumbers\n      : splitImplementation\n  );\n  const prefixCharacters\n    = options.prefixCharacters ?? DEFAULT_PREFIX_SUFFIX_CHARACTERS;\n  const suffixCharacters\n    = options.suffixCharacters ?? DEFAULT_PREFIX_SUFFIX_CHARACTERS;\n  let prefixIndex = 0;\n  let suffixIndex = input.length;\n\n  while (prefixIndex < input.length) {\n    const char = input.charAt(prefixIndex);\n    if (!prefixCharacters.includes(char)) {\n      break;\n    }\n    prefixIndex++;\n  }\n\n  while (suffixIndex > prefixIndex) {\n    const index = suffixIndex - 1;\n    const char = input.charAt(index);\n    if (!suffixCharacters.includes(char)) {\n      break;\n    }\n    suffixIndex = index;\n  }\n\n  return [\n    input.slice(0, prefixIndex),\n    splitFn(input.slice(prefixIndex, suffixIndex)),\n    input.slice(suffixIndex),\n  ];\n}\n\n/**\n * Split any cased input strings into an array of words.\n */\nexport function splitImplementation(value: string): Array<string> {\n  let result = value.trim();\n\n  result = result\n    .replace(SPLIT_LOWER_UPPER_RE, SPLIT_REPLACE_VALUE)\n    .replace(SPLIT_UPPER_UPPER_RE, SPLIT_REPLACE_VALUE);\n\n  result = result.replace(DEFAULT_STRIP_REGEXP, '\\0');\n\n  let start = 0;\n  let end = result.length;\n\n  // Trim the delimiter from around the output string.\n  while (result.charAt(start) === '\\0') {\n    start++;\n  }\n\n  if (start === end) {\n    return [];\n  }\n\n  while (result.charAt(end - 1) === '\\0') {\n    end--;\n  }\n\n  return result.slice(start, end).split(/\\0/);\n}\n\nexport function capitalCaseTransformFactory() {\n  return (word: string): string => word[0]!.toUpperCase() + word.slice(1).toLowerCase();\n}\n\nexport function pascalCaseTransformFactory() {\n  return (word: string, index: number): string => {\n    const char0 = word[0]!;\n    const initial = index > 0 && char0 >= '0' && char0 <= '9'\n      ? `_${char0}`\n      : char0.toUpperCase();\n    return initial + word.slice(1).toLowerCase();\n  };\n}\n\n/**\n * Split the input string into an array of words, separating numbers.\n */\nexport function splitSeparateNumbers(value: string): Array<string> {\n  const words = splitImplementation(value);\n  for (let i = 0; i < words.length; i++) {\n    const word = words[i]!;\n    const match = SPLIT_SEPARATE_NUMBER_RE.exec(word);\n    if (match) {\n      const offset = match.index + (match[1] ?? match[2])!.length;\n      words.splice(i, 1, word.slice(0, offset), word.slice(offset));\n    }\n  }\n  return words;\n}\n"],"mappings":"AAGA,MAAM,EAAuB,yBACvB,EAAuB,2BAGvB,EAA2B,wBAG3B,EAAuB,iBAGvB,EAAsB,SAK5B,SAAgB,EACd,EACA,EAA6B,EAAE,CACE,CACjC,IAAM,EAAU,EAAQ,UACtB,EAAQ,gBACJ,EACA,GAEA,EACF,EAAQ,kBAAoB,GAC1B,EACF,EAAQ,kBAAoB,GAC5B,EAAc,EACd,EAAc,EAAM,OAExB,KAAO,EAAc,EAAM,QAAQ,CACjC,IAAM,EAAO,EAAM,OAAO,EAAY,CACtC,GAAI,CAAC,EAAiB,SAAS,EAAK,CAClC,MAEF,IAGF,KAAO,EAAc,GAAa,CAChC,IAAM,EAAQ,EAAc,EACtB,EAAO,EAAM,OAAO,EAAM,CAChC,GAAI,CAAC,EAAiB,SAAS,EAAK,CAClC,MAEF,EAAc,EAGhB,MAAO,CACL,EAAM,MAAM,EAAG,EAAY,CAC3B,EAAQ,EAAM,MAAM,EAAa,EAAY,CAAC,CAC9C,EAAM,MAAM,EAAY,CACzB,CAMH,SAAgB,EAAoB,EAA8B,CAChE,IAAI,EAAS,EAAM,MAAM,CAEzB,EAAS,EACN,QAAQ,EAAsB,EAAoB,CAClD,QAAQ,EAAsB,EAAoB,CAErD,EAAS,EAAO,QAAQ,EAAsB,KAAK,CAEnD,IAAI,EAAQ,EACR,EAAM,EAAO,OAGjB,KAAO,EAAO,OAAO,EAAM,GAAK,MAC9B,IAGF,GAAI,IAAU,EACZ,MAAO,EAAE,CAGX,KAAO,EAAO,OAAO,EAAM,EAAE,GAAK,MAChC,IAGF,OAAO,EAAO,MAAM,EAAO,EAAI,CAAC,MAAM,KAAK,CAG7C,SAAgB,GAA8B,CAC5C,MAAQ,IAAyB,EAAK,GAAI,aAAa,CAAG,EAAK,MAAM,EAAE,CAAC,aAAa,CAGvF,SAAgB,GAA6B,CAC3C,OAAQ,EAAc,IAA0B,CAC9C,IAAM,EAAQ,EAAK,GAInB,OAHgB,EAAQ,GAAK,GAAS,KAAO,GAAS,IAClD,IAAI,IACJ,EAAM,aAAa,EACN,EAAK,MAAM,EAAE,CAAC,aAAa,EAOhD,SAAgB,EAAqB,EAA8B,CACjE,IAAM,EAAQ,EAAoB,EAAM,CACxC,IAAK,IAAI,EAAI,EAAG,EAAI,EAAM,OAAQ,IAAK,CACrC,IAAM,EAAO,EAAM,GACb,EAAQ,EAAyB,KAAK,EAAK,CACjD,GAAI,EAAO,CACT,IAAM,EAAS,EAAM,OAAS,EAAM,IAAM,EAAM,IAAK,OACrD,EAAM,OAAO,EAAG,EAAG,EAAK,MAAM,EAAG,EAAO,CAAE,EAAK,MAAM,EAAO,CAAC,EAGjE,OAAO"}

package/dist/case.transform-FNx2XsC3.cjs

@@ -0,0 +1 @@
+const e=/([\p{Ll}\d])(\p{Lu})/gu,t=/(\p{Lu})(\p{Lu}\p{Ll})/gu,n=/(\d)\p{Ll}|(\p{L})\d/u,r=/[^\p{L}\d]+/giu,i=`$1\0$2`,a=``;function o(e,t={}){let n=t.splitFn??(t.separateNumbers?u:s),r=t.prefixCharacters??``,i=t.suffixCharacters??``,a=0,o=e.length;for(;a<e.length;){let t=e.charAt(a);if(!r.includes(t))break;a++}for(;o>a;){let t=o-1,n=e.charAt(t);if(!i.includes(n))break;o=t}return[e.slice(0,a),n(e.slice(a,o)),e.slice(o)]}function s(n){let a=n.trim();a=a.replace(e,i).replace(t,i),a=a.replace(r,`\0`);let o=0,s=a.length;for(;a.charAt(o)===`\0`;)o++;if(o===s)return[];for(;a.charAt(s-1)===`\0`;)s--;return a.slice(o,s).split(/\0/)}function c(){return e=>e[0].toUpperCase()+e.slice(1).toLowerCase()}function l(){return(e,t)=>{let n=e[0];return(t>0&&n>=`0`&&n<=`9`?`_${n}`:n.toUpperCase())+e.slice(1).toLowerCase()}}function u(e){let t=s(e);for(let e=0;e<t.length;e++){let r=t[e],i=n.exec(r);if(i){let n=i.index+(i[1]??i[2]).length;t.splice(e,1,r.slice(0,n),r.slice(n))}}return t}Object.defineProperty(exports,`n`,{enumerable:!0,get:function(){return l}}),Object.defineProperty(exports,`r`,{enumerable:!0,get:function(){return o}}),Object.defineProperty(exports,`t`,{enumerable:!0,get:function(){return c}});

package/dist/case.types-BxuWJgN1.d.cts

@@ -0,0 +1,19 @@
+//#region src/internal/case.types.d.ts
+
+/**
+ * Options used for converting strings to any case.
+ */
+interface ChangeCaseOptions {
+  delimiter?: string;
+  /**
+   * Options used for converting strings to pascal/camel case.
+   */
+  mergeAmbiguousCharacters?: boolean;
+  prefixCharacters?: string;
+  separateNumbers?: boolean;
+  splitFn?: (value: string) => Array<string>;
+  suffixCharacters?: string;
+}
+//#endregion
+export { ChangeCaseOptions as t };
+//# sourceMappingURL=case.types-BxuWJgN1.d.cts.map

package/dist/case.types-BxuWJgN1.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"case.types-BxuWJgN1.d.cts","names":[],"sources":["../src/internal/case.types.ts"],"sourcesContent":[],"mappings":";;;;;UAUiB,iBAAA;;;;;;;;+BAQc"}