@vinicunca/perkakas 1.12.0 → 1.13.0

package/dist/{reordered-array-B2klHneX.d.ts → reordered-array-BWG6tVSK.d.ts}

@@ -1,7 +1,7 @@
-import { t as IterableContainer } from "./iterable-container-BdjPuIjL.js";
+import { t as IterableContainer } from "./iterable-container-Dv5vSKht.js";
 
 //#region src/internal/types/reordered-array.d.ts
 type ReorderedArray<T extends IterableContainer> = { -readonly [P in keyof T]: T[number] };
 //#endregion
 export { ReorderedArray as t };
-//# sourceMappingURL=reordered-array-B2klHneX.d.ts.map
+//# sourceMappingURL=reordered-array-BWG6tVSK.d.ts.map

package/dist/reordered-array-BWG6tVSK.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reordered-array-BWG6tVSK.d.ts","names":[],"sources":["../src/internal/types/reordered-array.ts"],"sourcesContent":[],"mappings":";;;KAEY,yBAAyB,6CACb,IAAI,WAD5B"}

package/dist/{reordered-array-BsUBOnYh.d.cts → reordered-array-CmReuxDi.d.cts}

@@ -1,7 +1,7 @@
-import { t as IterableContainer } from "./iterable-container-OFsaw8WL.cjs";
+import { t as IterableContainer } from "./iterable-container-1TN3AJ3s.cjs";
 
 //#region src/internal/types/reordered-array.d.ts
 type ReorderedArray<T extends IterableContainer> = { -readonly [P in keyof T]: T[number] };
 //#endregion
 export { ReorderedArray as t };
-//# sourceMappingURL=reordered-array-BsUBOnYh.d.cts.map
+//# sourceMappingURL=reordered-array-CmReuxDi.d.cts.map

package/dist/reordered-array-CmReuxDi.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reordered-array-CmReuxDi.d.cts","names":[],"sources":["../src/internal/types/reordered-array.ts"],"sourcesContent":[],"mappings":";;;KAEY,yBAAyB,6CACb,IAAI,WAD5B"}

package/dist/reverse.js

@@ -1,2 +1,2 @@
-import{t as e}from"./curry-BcQ8Up1_.js";function t(...t){return e(n,t)}function n(e){return[...e].reverse()}export{t as reverse};
+import{t as e}from"./curry-NmniqyJ0.js";function t(...t){return e(n,t)}function n(e){return[...e].reverse()}export{t as reverse};
 //# sourceMappingURL=reverse.js.map

package/dist/round.js

@@ -1,2 +1,2 @@
-import{t as e}from"./curry-BcQ8Up1_.js";import{t}from"./with-precision-CWWiMmxZ.js";function n(...n){return e(t(Math.round),n)}export{n as round};
+import{t as e}from"./curry-NmniqyJ0.js";import{t}from"./with-precision-CQ90Walk.js";function n(...n){return e(t(Math.round),n)}export{n as round};
 //# sourceMappingURL=round.js.map

package/dist/sample.d.cts

@@ -1,8 +1,8 @@
-import { t as IterableContainer } from "./iterable-container-OFsaw8WL.cjs";
-import { t as NTuple } from "./n-tuple-Bu1e7UH_.cjs";
-import { t as PartialArray } from "./partial-array-CoV_xxyQ.cjs";
-import { t as TupleParts } from "./tuple-parts-BJQEORxn.cjs";
-import { t as CoercedArray } from "./coerced-array-DS7cKtbA.cjs";
+import { t as IterableContainer } from "./iterable-container-1TN3AJ3s.cjs";
+import { t as NTuple } from "./n-tuple-BkMobYQ9.cjs";
+import { t as PartialArray } from "./partial-array-CQF5oggb.cjs";
+import { t as TupleParts } from "./tuple-parts-CzQQupgi.cjs";
+import { t as CoercedArray } from "./coerced-array-BKR9Bvsl.cjs";
 import { FixedLengthArray, IsEqual, IsNever, NonNegativeInteger, Or, Writable } from "type-fest";
 
 //#region src/sample.d.ts

package/dist/sample.d.ts

@@ -1,8 +1,8 @@
-import { t as IterableContainer } from "./iterable-container-BdjPuIjL.js";
-import { t as NTuple } from "./n-tuple-DoE0z7Kl.js";
-import { t as PartialArray } from "./partial-array-CeoXpbZU.js";
-import { t as TupleParts } from "./tuple-parts-Bhbm4jiu.js";
-import { t as CoercedArray } from "./coerced-array-1Xs4p4iF.js";
+import { t as IterableContainer } from "./iterable-container-Dv5vSKht.js";
+import { t as NTuple } from "./n-tuple-zo5g_mSL.js";
+import { t as PartialArray } from "./partial-array-DU-2Vkyx.js";
+import { t as TupleParts } from "./tuple-parts-BYI4o8Vk.js";
+import { t as CoercedArray } from "./coerced-array-BfTLxqLo.js";
 import { FixedLengthArray, IsEqual, IsNever, NonNegativeInteger, Or, Writable } from "type-fest";
 
 //#region src/sample.d.ts

package/dist/sample.js

@@ -1,2 +1,2 @@
-import{t as e}from"./curry-BcQ8Up1_.js";function t(...t){return e(n,t)}function n(e,t){if(t<=0)return[];if(t>=e.length)return[...e];let n=Math.min(t,e.length-t),r=new Set;for(;r.size<n;){let t=Math.floor(Math.random()*e.length);r.add(t)}return t===n?[...r].sort((e,t)=>e-t).map(t=>e[t]):e.filter((e,t)=>!r.has(t))}export{t as sample};
+import{t as e}from"./curry-NmniqyJ0.js";function t(...t){return e(n,t)}function n(e,t){if(t<=0)return[];if(t>=e.length)return[...e];let n=Math.min(t,e.length-t),r=new Set;for(;r.size<n;){let t=Math.floor(Math.random()*e.length);r.add(t)}return t===n?[...r].sort((e,t)=>e-t).map(t=>e[t]):e.filter((e,t)=>!r.has(t))}export{t as sample};
 //# sourceMappingURL=sample.js.map

package/dist/set-path.d.cts

@@ -1,4 +1,4 @@
-import { t as PerkakasTypeError } from "./perkakas-type-error-BERl_sWR.cjs";
+import { t as PerkakasTypeError } from "./perkakas-type-error-ClCCHBW1.cjs";
 import { ValueOf } from "type-fest";
 
 //#region src/set-path.d.ts

package/dist/set-path.d.ts

@@ -1,4 +1,4 @@
-import { t as PerkakasTypeError } from "./perkakas-type-error-DmmsEmEF.js";
+import { t as PerkakasTypeError } from "./perkakas-type-error-B9ULNhW0.js";
 import { ValueOf } from "type-fest";
 
 //#region src/set-path.d.ts

package/dist/set-path.js

@@ -1,2 +1,2 @@
-import{t as e}from"./curry-BcQ8Up1_.js";function t(...t){return e(n,t)}function n(e,t,r){let[i,...a]=t;if(i===void 0)return r;if(Array.isArray(e)){let t=[...e];return t[i]=n(e[i],a,r),t}let{[i]:o,...s}=e;return{...s,[i]:n(o,a,r)}}export{t as setPath};
+import{t as e}from"./curry-NmniqyJ0.js";function t(...t){return e(n,t)}function n(e,t,r){let[i,...a]=t;if(i===void 0)return r;if(Array.isArray(e)){let t=[...e];return t[i]=n(e[i],a,r),t}let{[i]:o,...s}=e;return{...s,[i]:n(o,a,r)}}export{t as setPath};
 //# sourceMappingURL=set-path.js.map

package/dist/set.d.cts

@@ -1,4 +1,4 @@
-import { t as UpsertProp } from "./upsert-prop-P-aJDDII.cjs";
+import { t as UpsertProp } from "./upsert-prop-0hwik6JJ.cjs";
 
 //#region src/set.d.ts
 

package/dist/set.d.ts

@@ -1,4 +1,4 @@
-import { t as UpsertProp } from "./upsert-prop-__xTQQ07.js";
+import { t as UpsertProp } from "./upsert-prop-_NpaZwm4.js";
 
 //#region src/set.d.ts
 

package/dist/set.js

@@ -1,2 +1,2 @@
-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 set};
+import{t as e}from"./curry-NmniqyJ0.js";function t(...t){return e(n,t)}function n(e,t,n){return{...e,[t]:n}}export{t as set};
 //# sourceMappingURL=set.js.map

package/dist/shuffle.d.cts

@@ -1,5 +1,5 @@
-import { t as IterableContainer } from "./iterable-container-OFsaw8WL.cjs";
-import { t as ReorderedArray } from "./reordered-array-BsUBOnYh.cjs";
+import { t as IterableContainer } from "./iterable-container-1TN3AJ3s.cjs";
+import { t as ReorderedArray } from "./reordered-array-CmReuxDi.cjs";
 
 //#region src/shuffle.d.ts
 

package/dist/shuffle.d.ts

@@ -1,5 +1,5 @@
-import { t as IterableContainer } from "./iterable-container-BdjPuIjL.js";
-import { t as ReorderedArray } from "./reordered-array-B2klHneX.js";
+import { t as IterableContainer } from "./iterable-container-Dv5vSKht.js";
+import { t as ReorderedArray } from "./reordered-array-BWG6tVSK.js";
 
 //#region src/shuffle.d.ts
 

package/dist/shuffle.js

@@ -1,2 +1,2 @@
-import{t as e}from"./curry-BcQ8Up1_.js";function t(...t){return e(n,t)}function n(e){let t=[...e];for(let n=0;n<e.length;n++){let r=n+Math.floor(Math.random()*(e.length-n)),i=t[r];t[r]=t[n],t[n]=i}return t}export{t as shuffle};
+import{t as e}from"./curry-NmniqyJ0.js";function t(...t){return e(n,t)}function n(e){let t=[...e];for(let n=0;n<e.length;n++){let r=n+Math.floor(Math.random()*(e.length-n)),i=t[r];t[r]=t[n],t[n]=i}return t}export{t as shuffle};
 //# sourceMappingURL=shuffle.js.map

package/dist/sort-by.d.cts

@@ -1,7 +1,7 @@
-import { t as IterableContainer } from "./iterable-container-OFsaw8WL.cjs";
-import { t as NonEmptyArray } from "./non-empty-array-CFG7wGD-.cjs";
-import { t as OrderRule } from "./curry-order-rules-cezUWcSx.cjs";
-import { t as ReorderedArray } from "./reordered-array-BsUBOnYh.cjs";
+import { t as IterableContainer } from "./iterable-container-1TN3AJ3s.cjs";
+import { t as NonEmptyArray } from "./non-empty-array-NDjbHRjk.cjs";
+import { t as OrderRule } from "./curry-order-rules-BoF09Dq2.cjs";
+import { t as ReorderedArray } from "./reordered-array-CmReuxDi.cjs";
 
 //#region src/sort-by.d.ts
 

package/dist/sort-by.d.ts

@@ -1,7 +1,7 @@
-import { t as IterableContainer } from "./iterable-container-BdjPuIjL.js";
-import { t as NonEmptyArray } from "./non-empty-array-DXkY7ynY.js";
-import { t as OrderRule } from "./curry-order-rules-BCcwbNxd.js";
-import { t as ReorderedArray } from "./reordered-array-B2klHneX.js";
+import { t as IterableContainer } from "./iterable-container-Dv5vSKht.js";
+import { t as NonEmptyArray } from "./non-empty-array-DHAKSw6t.js";
+import { t as OrderRule } from "./curry-order-rules-CoO4bk5I.js";
+import { t as ReorderedArray } from "./reordered-array-BWG6tVSK.js";
 
 //#region src/sort-by.d.ts
 

package/dist/sort-by.js

@@ -1,2 +1,2 @@
-import{t as e}from"./curry-order-rules-C6bwcUwC.js";function t(...t){return e(n,t)}function n(e,t){return[...e].sort(t)}export{t as sortBy};
+import{t as e}from"./curry-order-rules-DwrF-_P1.js";function t(...t){return e(n,t)}function n(e,t){return[...e].sort(t)}export{t as sortBy};
 //# sourceMappingURL=sort-by.js.map

package/dist/sort.d.cts

@@ -1,5 +1,5 @@
-import { t as IterableContainer } from "./iterable-container-OFsaw8WL.cjs";
-import { t as ReorderedArray } from "./reordered-array-BsUBOnYh.cjs";
+import { t as IterableContainer } from "./iterable-container-1TN3AJ3s.cjs";
+import { t as ReorderedArray } from "./reordered-array-CmReuxDi.cjs";
 
 //#region src/sort.d.ts
 

package/dist/sort.d.ts

@@ -1,5 +1,5 @@
-import { t as IterableContainer } from "./iterable-container-BdjPuIjL.js";
-import { t as ReorderedArray } from "./reordered-array-B2klHneX.js";
+import { t as IterableContainer } from "./iterable-container-Dv5vSKht.js";
+import { t as ReorderedArray } from "./reordered-array-BWG6tVSK.js";
 
 //#region src/sort.d.ts
 

package/dist/sort.js

@@ -1,2 +1,2 @@
-import{t as e}from"./curry-BcQ8Up1_.js";function t(...t){return e(n,t)}function n(e,t){let n=[...e];return n.sort(t),n}export{t as sort};
+import{t as e}from"./curry-NmniqyJ0.js";function t(...t){return e(n,t)}function n(e,t){let n=[...e];return n.sort(t),n}export{t as sort};
 //# sourceMappingURL=sort.js.map

package/dist/sorted-index-by.js

@@ -1,2 +1,2 @@
-import{t as e}from"./curry-BcQ8Up1_.js";import{t}from"./binary-search-cutoff-index-yQ2qcJHb.js";function n(...t){return e(r,t)}function r(e,n,r){let i=r(n,void 0,e);return t(e,(t,n)=>r(t,n,e)<i)}export{n as sortedIndexBy};
+import{t as e}from"./curry-NmniqyJ0.js";import{t}from"./binary-search-cutoff-index-CN25H71A.js";function n(...t){return e(r,t)}function r(e,n,r){let i=r(n,void 0,e);return t(e,(t,n)=>r(t,n,e)<i)}export{n as sortedIndexBy};
 //# sourceMappingURL=sorted-index-by.js.map

package/dist/sorted-index-with.js

@@ -1,2 +1,2 @@
-import{t as e}from"./curry-BcQ8Up1_.js";import{t}from"./binary-search-cutoff-index-yQ2qcJHb.js";function n(...n){return e(t,n)}export{n as sortedIndexWith};
+import{t as e}from"./curry-NmniqyJ0.js";import{t}from"./binary-search-cutoff-index-CN25H71A.js";function n(...n){return e(t,n)}export{n as sortedIndexWith};
 //# sourceMappingURL=sorted-index-with.js.map

package/dist/sorted-index.js

@@ -1,2 +1,2 @@
-import{t as e}from"./curry-BcQ8Up1_.js";import{t}from"./binary-search-cutoff-index-yQ2qcJHb.js";function n(...t){return e(r,t)}function r(e,n){return t(e,e=>e<n)}export{n as sortedIndex};
+import{t as e}from"./curry-NmniqyJ0.js";import{t}from"./binary-search-cutoff-index-CN25H71A.js";function n(...t){return e(r,t)}function r(e,n){return t(e,e=>e<n)}export{n as sortedIndex};
 //# sourceMappingURL=sorted-index.js.map

package/dist/sorted-last-index-by.js

@@ -1,2 +1,2 @@
-import{t as e}from"./curry-BcQ8Up1_.js";import{t}from"./binary-search-cutoff-index-yQ2qcJHb.js";function n(...t){return e(r,t)}function r(e,n,r){let i=r(n,void 0,e);return t(e,(t,n)=>r(t,n,e)<=i)}export{n as sortedLastIndexBy};
+import{t as e}from"./curry-NmniqyJ0.js";import{t}from"./binary-search-cutoff-index-CN25H71A.js";function n(...t){return e(r,t)}function r(e,n,r){let i=r(n,void 0,e);return t(e,(t,n)=>r(t,n,e)<=i)}export{n as sortedLastIndexBy};
 //# sourceMappingURL=sorted-last-index-by.js.map

package/dist/sorted-last-index.js

@@ -1,2 +1,2 @@
-import{t as e}from"./curry-BcQ8Up1_.js";import{t}from"./binary-search-cutoff-index-yQ2qcJHb.js";function n(...t){return e(r,t)}function r(e,n){return t(e,e=>e<=n)}export{n as sortedLastIndex};
+import{t as e}from"./curry-NmniqyJ0.js";import{t}from"./binary-search-cutoff-index-CN25H71A.js";function n(...t){return e(r,t)}function r(e,n){return t(e,e=>e<=n)}export{n as sortedLastIndex};
 //# sourceMappingURL=sorted-last-index.js.map

package/dist/splice.js

@@ -1,2 +1,2 @@
-import{t as e}from"./curry-BcQ8Up1_.js";function t(...t){return e(n,t)}function n(e,t,n,r){let i=[...e];return i.splice(t,n,...r),i}export{t as splice};
+import{t as e}from"./curry-NmniqyJ0.js";function t(...t){return e(n,t)}function n(e,t,n,r){let i=[...e];return i.splice(t,n,...r),i}export{t as splice};
 //# sourceMappingURL=splice.js.map

package/dist/split-at.js

@@ -1,2 +1,2 @@
-import{t as e}from"./curry-BcQ8Up1_.js";function t(...t){return e(n,t)}function n(e,t){let n=Math.max(Math.min(t<0?e.length+t:t,e.length),0);return[e.slice(0,n),e.slice(n)]}export{t as splitAt};
+import{t as e}from"./curry-NmniqyJ0.js";function t(...t){return e(n,t)}function n(e,t){let n=Math.max(Math.min(t<0?e.length+t:t,e.length),0);return[e.slice(0,n),e.slice(n)]}export{t as splitAt};
 //# sourceMappingURL=split-at.js.map

package/dist/split-when.js

@@ -1,2 +1,2 @@
-import{t as e}from"./curry-BcQ8Up1_.js";function t(...t){return e(n,t)}function n(e,t){let n=e.findIndex(t);return n===-1?[[...e],[]]:[e.slice(0,n),e.slice(n)]}export{t as splitWhen};
+import{t as e}from"./curry-NmniqyJ0.js";function t(...t){return e(n,t)}function n(e,t){let n=e.findIndex(t);return n===-1?[[...e],[]]:[e.slice(0,n),e.slice(n)]}export{t as splitWhen};
 //# sourceMappingURL=split-when.js.map

package/dist/split.d.cts

@@ -20,11 +20,11 @@ type Split$1<S extends string, Separator extends string, N extends number | unde
  * @returns An Array of strings, split at each point where the separator occurs
  * in the given string.
  * @signature
- *   R.split(data, separator, limit);
+ *   P.split(data, separator, limit);
  * @example
- *   R.split("a,b,c", ","); //=> ["a", "b", "c"]
- *   R.split("a,b,c", ",", 2); //=> ["a", "b"]
- *   R.split("a1b2c3d", /\d/u); //=> ["a", "b", "c", "d"]
+ *   P.split("a,b,c", ","); //=> ["a", "b", "c"]
+ *   P.split("a,b,c", ",", 2); //=> ["a", "b"]
+ *   P.split("a1b2c3d", /\d/u); //=> ["a", "b", "c", "d"]
  * @dataFirst
  * @category String
  */
@@ -47,11 +47,11 @@ declare function split<S extends string, Separator extends string, N extends num
  * @returns An Array of strings, split at each point where the separator occurs
  * in the given string.
  * @signature
- *   R.split(separator, limit)(data);
+ *   P.split(separator, limit)(data);
  * @example
- *   R.pipe("a,b,c", R.split(",")); //=> ["a", "b", "c"]
- *   R.pipe("a,b,c", R.split(",", 2)); //=> ["a", "b"]
- *   R.pipe("a1b2c3d", R.split(/\d/u)); //=> ["a", "b", "c", "d"]
+ *   P.pipe("a,b,c", P.split(",")); //=> ["a", "b", "c"]
+ *   P.pipe("a,b,c", P.split(",", 2)); //=> ["a", "b"]
+ *   P.pipe("a1b2c3d", P.split(/\d/u)); //=> ["a", "b", "c", "d"]
  * @dataLast
  * @category String
  */

package/dist/split.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"split.d.cts","names":[],"sources":["../src/split.ts"],"sourcesContent":[],"mappings":";;;KAOK,+GAIc,IACf,+BACe,YACb,+BACe,IACb,gBAEF,QAAQ,kBACJ,gBACA,WAIE,MAAU,GAAG,eAIb,mBAAmB,YAAY;;AAvBxB;;;;;;;;;;;;;;;;;;AAoDnB;AAKA;;;;;;AAIiE,iBATjD,KAAA,CASiD,IAAA,EAAA,MAAA,EAAA,SAAA,EAPpD,MAOoD,EAAA,KAAA,CAAA,EAAA,MAAA,CAAA,EAL9D,KAK8D,CAAA,MAAA,CAAA;AAApB,iBAJ7B,KAI6B,CAAA,UAAA,MAAA,EAAA,kBAAA,MAAA,EAAA,UAAA,MAAA,GAAA,SAAA,GAAA,SAAA,CAAA,CAAA,IAAA,EAArC,CAAqC,EAAA,SAAA,EAAvB,SAAuB,EAAA,KAAA,CAAA,EAAJ,CAAI,CAAA,EAAA,OAAA,CAAM,CAAN,EAAS,SAAT,EAAoB,CAApB,CAAA;;AA2B7C;AAIA;;;;;;;;;;;;;;;;;;;;;;;iBAJgB,KAAA,YACH,2CAEQ;iBACL,uGAIH,mBAAmB,WAAW,MAAM,QAAM,GAAG,WAAW"}
+{"version":3,"file":"split.d.cts","names":[],"sources":["../src/split.ts"],"sourcesContent":[],"mappings":";;;KAOK,+GAIc,IACf,+BACe,YACb,+BACe,IACb,gBAEA,QAAQ,kBACN,gBACA,WAIA,MAAU,GAAG,eAIb,mBAAmB,YAAY;;AAvBtB;;;;;;;;;;;;;;;;;;AAoDnB;AAKA;;;;;;AAIiE,iBATjD,KAAA,CASiD,IAAA,EAAA,MAAA,EAAA,SAAA,EAPpD,MAOoD,EAAA,KAAA,CAAA,EAAA,MAAA,CAAA,EAL9D,KAK8D,CAAA,MAAA,CAAA;AAApB,iBAJ7B,KAI6B,CAAA,UAAA,MAAA,EAAA,kBAAA,MAAA,EAAA,UAAA,MAAA,GAAA,SAAA,GAAA,SAAA,CAAA,CAAA,IAAA,EAArC,CAAqC,EAAA,SAAA,EAAvB,SAAuB,EAAA,KAAA,CAAA,EAAJ,CAAI,CAAA,EAAA,OAAA,CAAM,CAAN,EAAS,SAAT,EAAoB,CAApB,CAAA;;AA2B7C;AAIA;;;;;;;;;;;;;;;;;;;;;;;iBAJgB,KAAA,YACH,2CAEQ;iBACL,uGAIH,mBAAmB,WAAW,MAAM,QAAM,GAAG,WAAW"}

package/dist/split.d.ts

@@ -20,11 +20,11 @@ type Split$1<S extends string, Separator extends string, N extends number | unde
  * @returns An Array of strings, split at each point where the separator occurs
  * in the given string.
  * @signature
- *   R.split(data, separator, limit);
+ *   P.split(data, separator, limit);
  * @example
- *   R.split("a,b,c", ","); //=> ["a", "b", "c"]
- *   R.split("a,b,c", ",", 2); //=> ["a", "b"]
- *   R.split("a1b2c3d", /\d/u); //=> ["a", "b", "c", "d"]
+ *   P.split("a,b,c", ","); //=> ["a", "b", "c"]
+ *   P.split("a,b,c", ",", 2); //=> ["a", "b"]
+ *   P.split("a1b2c3d", /\d/u); //=> ["a", "b", "c", "d"]
  * @dataFirst
  * @category String
  */
@@ -47,11 +47,11 @@ declare function split<S extends string, Separator extends string, N extends num
  * @returns An Array of strings, split at each point where the separator occurs
  * in the given string.
  * @signature
- *   R.split(separator, limit)(data);
+ *   P.split(separator, limit)(data);
  * @example
- *   R.pipe("a,b,c", R.split(",")); //=> ["a", "b", "c"]
- *   R.pipe("a,b,c", R.split(",", 2)); //=> ["a", "b"]
- *   R.pipe("a1b2c3d", R.split(/\d/u)); //=> ["a", "b", "c", "d"]
+ *   P.pipe("a,b,c", P.split(",")); //=> ["a", "b", "c"]
+ *   P.pipe("a,b,c", P.split(",", 2)); //=> ["a", "b"]
+ *   P.pipe("a1b2c3d", P.split(/\d/u)); //=> ["a", "b", "c", "d"]
  * @dataLast
  * @category String
  */

package/dist/split.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"split.d.ts","names":[],"sources":["../src/split.ts"],"sourcesContent":[],"mappings":";;;KAOK,+GAIc,IACf,+BACe,YACb,+BACe,IACb,gBAEF,QAAQ,kBACJ,gBACA,WAIE,MAAU,GAAG,eAIb,mBAAmB,YAAY;;AAvBxB;;;;;;;;;;;;;;;;;;AAoDnB;AAKA;;;;;;AAIiE,iBATjD,KAAA,CASiD,IAAA,EAAA,MAAA,EAAA,SAAA,EAPpD,MAOoD,EAAA,KAAA,CAAA,EAAA,MAAA,CAAA,EAL9D,KAK8D,CAAA,MAAA,CAAA;AAApB,iBAJ7B,KAI6B,CAAA,UAAA,MAAA,EAAA,kBAAA,MAAA,EAAA,UAAA,MAAA,GAAA,SAAA,GAAA,SAAA,CAAA,CAAA,IAAA,EAArC,CAAqC,EAAA,SAAA,EAAvB,SAAuB,EAAA,KAAA,CAAA,EAAJ,CAAI,CAAA,EAAA,OAAA,CAAM,CAAN,EAAS,SAAT,EAAoB,CAApB,CAAA;;AA2B7C;AAIA;;;;;;;;;;;;;;;;;;;;;;;iBAJgB,KAAA,YACH,2CAEQ;iBACL,uGAIH,mBAAmB,WAAW,MAAM,QAAM,GAAG,WAAW"}
+{"version":3,"file":"split.d.ts","names":[],"sources":["../src/split.ts"],"sourcesContent":[],"mappings":";;;KAOK,+GAIc,IACf,+BACe,YACb,+BACe,IACb,gBAEA,QAAQ,kBACN,gBACA,WAIA,MAAU,GAAG,eAIb,mBAAmB,YAAY;;AAvBtB;;;;;;;;;;;;;;;;;;AAoDnB;AAKA;;;;;;AAIiE,iBATjD,KAAA,CASiD,IAAA,EAAA,MAAA,EAAA,SAAA,EAPpD,MAOoD,EAAA,KAAA,CAAA,EAAA,MAAA,CAAA,EAL9D,KAK8D,CAAA,MAAA,CAAA;AAApB,iBAJ7B,KAI6B,CAAA,UAAA,MAAA,EAAA,kBAAA,MAAA,EAAA,UAAA,MAAA,GAAA,SAAA,GAAA,SAAA,CAAA,CAAA,IAAA,EAArC,CAAqC,EAAA,SAAA,EAAvB,SAAuB,EAAA,KAAA,CAAA,EAAJ,CAAI,CAAA,EAAA,OAAA,CAAM,CAAN,EAAS,SAAT,EAAoB,CAApB,CAAA;;AA2B7C;AAIA;;;;;;;;;;;;;;;;;;;;;;;iBAJgB,KAAA,YACH,2CAEQ;iBACL,uGAIH,mBAAmB,WAAW,MAAM,QAAM,GAAG,WAAW"}

package/dist/split.js.map

@@ -1 +1 @@
-{"version":3,"file":"split.js","names":[],"sources":["../src/split.ts"],"sourcesContent":["import type {\n  ArraySlice,\n  IsFloat,\n  NonNegative,\n  Split as SplitBase,\n} from 'type-fest';\n\ntype Split<\n  S extends string,\n  Separator extends string,\n  N extends number | undefined = undefined,\n> = string extends S\n  ? Array<string>\n  : string extends Separator\n    ? Array<string>\n    : number extends N\n      ? Array<string>\n      : // TODO: We need a way to \"floor\" non-integer numbers, until then we return a lower fidelity type instead.\n      IsFloat<N> extends true\n        ? Array<string>\n        : ArraySlice<\n            // We can use the base (type-fest) split **only** if all the params\n            // are literals. For all other cases it would return the wrong type\n            // so we fallback to the built-in Array.prototype.split return type.\n            SplitBase<S, Separator>,\n            0,\n            // `undefined` and negative numbers are treated as non-limited\n            // splits, which is what we'd get when using `never` for ArraySlice.\n            N extends number ? NonNegative<N> : never\n          >;\n\n/**\n * Takes a pattern and divides this string into an ordered list of substrings by\n * searching for the pattern, puts these substrings into an array, and returns\n * the array. This function mirrors the built-in [`String.prototype.split`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/split)\n * method.\n *\n * @param data - The string to split.\n * @param separator - The pattern describing where each split should occur. Can\n * be a string, or a regular expression.\n * @param limit - A non-negative integer specifying a limit on the number of\n * substrings to be included in the array. If provided, splits the string at\n * each occurrence of the specified separator, but stops when limit entries have\n * been placed in the array. Any leftover text is not included in the array at\n * all. The array may contain fewer entries than limit if the end of the string\n * is reached before the limit is reached. If limit is 0, [] is returned.\n * @returns An Array of strings, split at each point where the separator occurs\n * in the given string.\n * @signature\n *   R.split(data, separator, limit);\n * @example\n *   R.split(\"a,b,c\", \",\"); //=> [\"a\", \"b\", \"c\"]\n *   R.split(\"a,b,c\", \",\", 2); //=> [\"a\", \"b\"]\n *   R.split(\"a1b2c3d\", /\\d/u); //=> [\"a\", \"b\", \"c\", \"d\"]\n * @dataFirst\n * @category String\n */\nexport function split(\n  data: string,\n  separator: RegExp,\n  limit?: number,\n): Array<string>;\nexport function split<\n  S extends string,\n  Separator extends string,\n  N extends number | undefined = undefined,\n>(data: S, separator: Separator, limit?: N): Split<S, Separator, N>;\n\n/**\n * Takes a pattern and divides this string into an ordered list of substrings by\n * searching for the pattern, puts these substrings into an array, and returns\n * the array. This function mirrors the built-in [`String.prototype.split`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/split)\n * method.\n *\n * @param separator - The pattern describing where each split should occur. Can\n * be a string, or a regular expression.\n * @param limit - A non-negative integer specifying a limit on the number of\n * substrings to be included in the array. If provided, splits the string at\n * each occurrence of the specified separator, but stops when limit entries have\n * been placed in the array. Any leftover text is not included in the array at\n * all. The array may contain fewer entries than limit if the end of the string\n * is reached before the limit is reached. If limit is 0, [] is returned.\n * @returns An Array of strings, split at each point where the separator occurs\n * in the given string.\n * @signature\n *   R.split(separator, limit)(data);\n * @example\n *   R.pipe(\"a,b,c\", R.split(\",\")); //=> [\"a\", \"b\", \"c\"]\n *   R.pipe(\"a,b,c\", R.split(\",\", 2)); //=> [\"a\", \"b\"]\n *   R.pipe(\"a1b2c3d\", R.split(/\\d/u)); //=> [\"a\", \"b\", \"c\", \"d\"]\n * @dataLast\n * @category String\n */\nexport function split(\n  separator: RegExp,\n  limit?: number,\n): (data: string) => Array<string>;\nexport function split<\n  S extends string,\n  Separator extends string,\n  N extends number | undefined = undefined,\n>(separator: Separator, limit?: N): (data: S) => Split<S, Separator, N>;\n\nexport function split(\n  dataOrSeparator: RegExp | string,\n  separatorOrLimit?: RegExp | number | string,\n  limit?: number,\n): unknown {\n  return typeof separatorOrLimit === 'number' || separatorOrLimit === undefined\n    // dataLast\n    ? (data: string) => data.split(dataOrSeparator, separatorOrLimit)\n    // dataFirst\n    : (dataOrSeparator as string).split(separatorOrLimit, limit);\n}\n"],"mappings":"AAuGA,SAAgB,EACd,EACA,EACA,EACS,CACT,OAAO,OAAO,GAAqB,UAAY,IAAqB,IAAA,GAE/D,GAAiB,EAAK,MAAM,EAAiB,EAAiB,CAE9D,EAA2B,MAAM,EAAkB,EAAM"}
+{"version":3,"file":"split.js","names":[],"sources":["../src/split.ts"],"sourcesContent":["import type {\n  ArraySlice,\n  IsFloat,\n  NonNegative,\n  Split as SplitBase,\n} from 'type-fest';\n\ntype Split<\n  S extends string,\n  Separator extends string,\n  N extends number | undefined = undefined,\n> = string extends S\n  ? Array<string>\n  : string extends Separator\n    ? Array<string>\n    : number extends N\n      ? Array<string>\n      // TODO: We need a way to \"floor\" non-integer numbers, until then we return a lower fidelity type instead.\n      : IsFloat<N> extends true\n        ? Array<string>\n        : ArraySlice<\n          // We can use the base (type-fest) split **only** if all the params\n          // are literals. For all other cases it would return the wrong type\n          // so we fallback to the built-in Array.prototype.split return type.\n          SplitBase<S, Separator>,\n          0,\n          // `undefined` and negative numbers are treated as non-limited\n          // splits, which is what we'd get when using `never` for ArraySlice.\n          N extends number ? NonNegative<N> : never\n        >;\n\n/**\n * Takes a pattern and divides this string into an ordered list of substrings by\n * searching for the pattern, puts these substrings into an array, and returns\n * the array. This function mirrors the built-in [`String.prototype.split`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/split)\n * method.\n *\n * @param data - The string to split.\n * @param separator - The pattern describing where each split should occur. Can\n * be a string, or a regular expression.\n * @param limit - A non-negative integer specifying a limit on the number of\n * substrings to be included in the array. If provided, splits the string at\n * each occurrence of the specified separator, but stops when limit entries have\n * been placed in the array. Any leftover text is not included in the array at\n * all. The array may contain fewer entries than limit if the end of the string\n * is reached before the limit is reached. If limit is 0, [] is returned.\n * @returns An Array of strings, split at each point where the separator occurs\n * in the given string.\n * @signature\n *   P.split(data, separator, limit);\n * @example\n *   P.split(\"a,b,c\", \",\"); //=> [\"a\", \"b\", \"c\"]\n *   P.split(\"a,b,c\", \",\", 2); //=> [\"a\", \"b\"]\n *   P.split(\"a1b2c3d\", /\\d/u); //=> [\"a\", \"b\", \"c\", \"d\"]\n * @dataFirst\n * @category String\n */\nexport function split(\n  data: string,\n  separator: RegExp,\n  limit?: number,\n): Array<string>;\nexport function split<\n  S extends string,\n  Separator extends string,\n  N extends number | undefined = undefined,\n>(data: S, separator: Separator, limit?: N): Split<S, Separator, N>;\n\n/**\n * Takes a pattern and divides this string into an ordered list of substrings by\n * searching for the pattern, puts these substrings into an array, and returns\n * the array. This function mirrors the built-in [`String.prototype.split`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/split)\n * method.\n *\n * @param separator - The pattern describing where each split should occur. Can\n * be a string, or a regular expression.\n * @param limit - A non-negative integer specifying a limit on the number of\n * substrings to be included in the array. If provided, splits the string at\n * each occurrence of the specified separator, but stops when limit entries have\n * been placed in the array. Any leftover text is not included in the array at\n * all. The array may contain fewer entries than limit if the end of the string\n * is reached before the limit is reached. If limit is 0, [] is returned.\n * @returns An Array of strings, split at each point where the separator occurs\n * in the given string.\n * @signature\n *   P.split(separator, limit)(data);\n * @example\n *   P.pipe(\"a,b,c\", P.split(\",\")); //=> [\"a\", \"b\", \"c\"]\n *   P.pipe(\"a,b,c\", P.split(\",\", 2)); //=> [\"a\", \"b\"]\n *   P.pipe(\"a1b2c3d\", P.split(/\\d/u)); //=> [\"a\", \"b\", \"c\", \"d\"]\n * @dataLast\n * @category String\n */\nexport function split(\n  separator: RegExp,\n  limit?: number,\n): (data: string) => Array<string>;\nexport function split<\n  S extends string,\n  Separator extends string,\n  N extends number | undefined = undefined,\n>(separator: Separator, limit?: N): (data: S) => Split<S, Separator, N>;\n\nexport function split(\n  dataOrSeparator: RegExp | string,\n  separatorOrLimit?: RegExp | number | string,\n  limit?: number,\n): unknown {\n  return typeof separatorOrLimit === 'number' || separatorOrLimit === undefined\n    // dataLast\n    // eslint-disable-next-line sonar/argument-type\n    ? (data: string) => data.split(dataOrSeparator, separatorOrLimit)\n    // dataFirst\n    : (dataOrSeparator as string).split(separatorOrLimit, limit);\n}\n"],"mappings":"AAuGA,SAAgB,EACd,EACA,EACA,EACS,CACT,OAAO,OAAO,GAAqB,UAAY,IAAqB,IAAA,GAG/D,GAAiB,EAAK,MAAM,EAAiB,EAAiB,CAE9D,EAA2B,MAAM,EAAkB,EAAM"}

package/dist/strict-function-BBgKFNUw.d.ts

@@ -0,0 +1,26 @@
+//#region src/internal/types/strict-function.d.ts
+/**
+ * TypeScript compares function parameters using [contra-variance and not
+ * co-variance](https://en.wikipedia.org/wiki/Covariance_and_contravariance_(computer_science)#Function_types).
+ * To accept all functions we **can't** use `readonly unknown[]` (which only
+ * accepts functions with an actual variadic param). Instead, contrary to
+ * intuition, we need to use `never` (which extends **everything!** and thus
+ * would catch all cases). Another way to think about it is that a function
+ * with `never` parameters is effectively un-callable, making functions that
+ * take anything else callable, and thus are "extensions" of it.
+ *
+ * It's important to note that the resulting type is "academic", but not very
+ * useful because of a known, and [reported](https://github.com/microsoft/TypeScript/issues/61750), limitation of TypeScript that stems
+ * from the fact that TypeScript infers types parameterized by generic types
+ * too eagerly, making it impossible to rely on parts of a generic type
+ * generically too. Internally use `@ts-expect-error` in those cases and
+ * explain what the expected type should have been, this is so that if the issue
+ * is resolved in future versions of TypeScript we can easily find these places
+ * and fix them.
+ *
+ * @see https://www.typescriptlang.org/play/?#code/C4TwDgpgBA6glsAFgJQgQwCYHsB2AbEAVRwGscsB3HAHgBUA+KAXilqggA9gIcMBnKAAoAdKLQAnAOZ8AXFHHps+EFACupclQDaAXQCUzRurKUcAKChQA-FGDjVEC1DkAzNHj4QA3GbOhIsAiIAII4IHSMLGyc3LwCImJSslBoYQZMRhqm1rb20K7unj5+4NDwSAByEABuEOIRzKzsXDz8QqLCEtJyODV16ZkmVDl2Ds5Qbh7evv7QtBB8wABi6gDGjYJoPaoAtgBG-YZQi+JwOJLFs1AAGgAMjeUoirgExEM084srOKv0PgD0-0sUAAelYZqUbgBGB5BULhT7LNZ-MyA4FgiEBa4AJlhlT69UR31+AKBljBQA
+ */
+type StrictFunction = (...args: never) => unknown;
+//#endregion
+export { StrictFunction as t };
+//# sourceMappingURL=strict-function-BBgKFNUw.d.ts.map

package/dist/strict-function-BBgKFNUw.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"strict-function-BBgKFNUw.d.ts","names":[],"sources":["../src/internal/types/strict-function.ts"],"sourcesContent":[],"mappings":";;AAqBA;;;;;;;;;;;;;;;;;;;;KAAY,cAAA"}

package/dist/strict-function-CPTwDgnZ.d.cts

@@ -0,0 +1,26 @@
+//#region src/internal/types/strict-function.d.ts
+/**
+ * TypeScript compares function parameters using [contra-variance and not
+ * co-variance](https://en.wikipedia.org/wiki/Covariance_and_contravariance_(computer_science)#Function_types).
+ * To accept all functions we **can't** use `readonly unknown[]` (which only
+ * accepts functions with an actual variadic param). Instead, contrary to
+ * intuition, we need to use `never` (which extends **everything!** and thus
+ * would catch all cases). Another way to think about it is that a function
+ * with `never` parameters is effectively un-callable, making functions that
+ * take anything else callable, and thus are "extensions" of it.
+ *
+ * It's important to note that the resulting type is "academic", but not very
+ * useful because of a known, and [reported](https://github.com/microsoft/TypeScript/issues/61750), limitation of TypeScript that stems
+ * from the fact that TypeScript infers types parameterized by generic types
+ * too eagerly, making it impossible to rely on parts of a generic type
+ * generically too. Internally use `@ts-expect-error` in those cases and
+ * explain what the expected type should have been, this is so that if the issue
+ * is resolved in future versions of TypeScript we can easily find these places
+ * and fix them.
+ *
+ * @see https://www.typescriptlang.org/play/?#code/C4TwDgpgBA6glsAFgJQgQwCYHsB2AbEAVRwGscsB3HAHgBUA+KAXilqggA9gIcMBnKAAoAdKLQAnAOZ8AXFHHps+EFACupclQDaAXQCUzRurKUcAKChQA-FGDjVEC1DkAzNHj4QA3GbOhIsAiIAII4IHSMLGyc3LwCImJSslBoYQZMRhqm1rb20K7unj5+4NDwSAByEABuEOIRzKzsXDz8QqLCEtJyODV16ZkmVDl2Ds5Qbh7evv7QtBB8wABi6gDGjYJoPaoAtgBG-YZQi+JwOJLFs1AAGgAMjeUoirgExEM084srOKv0PgD0-0sUAAelYZqUbgBGB5BULhT7LNZ-MyA4FgiEBa4AJlhlT69UR31+AKBljBQA
+ */
+type StrictFunction = (...args: never) => unknown;
+//#endregion
+export { StrictFunction as t };
+//# sourceMappingURL=strict-function-CPTwDgnZ.d.cts.map

package/dist/strict-function-CPTwDgnZ.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"strict-function-CPTwDgnZ.d.cts","names":[],"sources":["../src/internal/types/strict-function.ts"],"sourcesContent":[],"mappings":";;AAqBA;;;;;;;;;;;;;;;;;;;;KAAY,cAAA"}

package/dist/subtract.js

@@ -1,2 +1,2 @@
-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 subtract};
+import{t as e}from"./curry-NmniqyJ0.js";function t(...t){return e(n,t)}function n(e,t){return e-t}export{t as subtract};
 //# sourceMappingURL=subtract.js.map

package/dist/sum-by.d.cts

@@ -1,4 +1,4 @@
-import { t as IterableContainer } from "./iterable-container-OFsaw8WL.cjs";
+import { t as IterableContainer } from "./iterable-container-1TN3AJ3s.cjs";
 
 //#region src/sum-by.d.ts
 type SumBy<T extends IterableContainer, U extends bigint | number> = T extends readonly [] ? 0 : T extends readonly [unknown, ...ReadonlyArray<unknown>] ? U : 0 | U;

package/dist/sum-by.d.ts

@@ -1,4 +1,4 @@
-import { t as IterableContainer } from "./iterable-container-BdjPuIjL.js";
+import { t as IterableContainer } from "./iterable-container-Dv5vSKht.js";
 
 //#region src/sum-by.d.ts
 type SumBy<T extends IterableContainer, U extends bigint | number> = T extends readonly [] ? 0 : T extends readonly [unknown, ...ReadonlyArray<unknown>] ? U : 0 | U;

package/dist/sum-by.js

@@ -1,2 +1,2 @@
-import{t as e}from"./curry-BcQ8Up1_.js";function t(...t){return e(n,t)}function n(e,t){let n=e.entries(),r=n.next();if(`done`in r&&r.done)return 0;let{value:[,i]}=r,a=t(i,0,e);for(let[r,i]of n){let n=t(i,r,e);a+=n}return a}export{t as sumBy};
+import{t as e}from"./curry-NmniqyJ0.js";function t(...t){return e(n,t)}function n(e,t){let n=e.entries(),r=n.next();if(`done`in r&&r.done)return 0;let{value:[,i]}=r,a=t(i,0,e);for(let[r,i]of n){let n=t(i,r,e);a+=n}return a}export{t as sumBy};
 //# sourceMappingURL=sum-by.js.map

package/dist/sum.d.cts

@@ -1,4 +1,4 @@
-import { t as IterableContainer } from "./iterable-container-OFsaw8WL.cjs";
+import { t as IterableContainer } from "./iterable-container-1TN3AJ3s.cjs";
 
 //#region src/sum.d.ts
 type Sum<T extends IterableContainer<bigint> | IterableContainer<number>> = T extends readonly [] ? 0 : T extends readonly [bigint, ...ReadonlyArray<unknown>] ? bigint : T[number] extends bigint ? 0 | bigint : number;

package/dist/sum.d.ts

@@ -1,4 +1,4 @@
-import { t as IterableContainer } from "./iterable-container-BdjPuIjL.js";
+import { t as IterableContainer } from "./iterable-container-Dv5vSKht.js";
 
 //#region src/sum.d.ts
 type Sum<T extends IterableContainer<bigint> | IterableContainer<number>> = T extends readonly [] ? 0 : T extends readonly [bigint, ...ReadonlyArray<unknown>] ? bigint : T[number] extends bigint ? 0 | bigint : number;

package/dist/sum.js

@@ -1,2 +1,2 @@
-import{t as e}from"./curry-BcQ8Up1_.js";function t(...t){return e(n,t)}function n(e){let t=typeof e[0]==`bigint`?0n:0;for(let n of e)t+=n;return t}export{t as sum};
+import{t as e}from"./curry-NmniqyJ0.js";function t(...t){return e(n,t)}function n(e){let t=typeof e[0]==`bigint`?0n:0;for(let n of e)t+=n;return t}export{t as sum};
 //# sourceMappingURL=sum.js.map

package/dist/{swap-in-place-COm7qHj4.js → swap-in-place-C_jXKHuD.js}

@@ -1,2 +1,2 @@
 function e(e,t,n){[e[t],e[n]]=[e[n],e[t]]}export{e as t};
-//# sourceMappingURL=swap-in-place-COm7qHj4.js.map
+//# sourceMappingURL=swap-in-place-C_jXKHuD.js.map

package/dist/{swap-in-place-COm7qHj4.js.map → swap-in-place-C_jXKHuD.js.map}

@@ -1 +1 @@
-{"version":3,"file":"swap-in-place-COm7qHj4.js","names":[],"sources":["../src/internal/swap-in-place.ts"],"sourcesContent":["/**\n * An efficient hack to swap the values at two indices in an array *in-place*.\n */\nexport function swapInPlace(\n\n  data: Array<unknown>,\n  i: number,\n  j: number,\n): void {\n  // We use destructuring to perform an in-place swap *without* needing a\n  // temporary variable\n  [data[i], data[j]] = [data[j], data[i]];\n}\n"],"mappings":"AAGA,SAAgB,EAEd,EACA,EACA,EACM,CAGN,CAAC,EAAK,GAAI,EAAK,IAAM,CAAC,EAAK,GAAI,EAAK,GAAG"}
+{"version":3,"file":"swap-in-place-C_jXKHuD.js","names":[],"sources":["../src/internal/swap-in-place.ts"],"sourcesContent":["/**\n * An efficient hack to swap the values at two indices in an array *in-place*.\n */\nexport function swapInPlace(\n\n  data: Array<unknown>,\n  i: number,\n  j: number,\n): void {\n  // We use destructuring to perform an in-place swap *without* needing a\n  // temporary variable\n  [data[i], data[j]] = [data[j], data[i]];\n}\n"],"mappings":"AAGA,SAAgB,EAEd,EACA,EACA,EACM,CAGN,CAAC,EAAK,GAAI,EAAK,IAAM,CAAC,EAAK,GAAI,EAAK,GAAG"}

package/dist/swap-indices.d.cts

@@ -1,4 +1,4 @@
-import { t as IterableContainer } from "./iterable-container-OFsaw8WL.cjs";
+import { t as IterableContainer } from "./iterable-container-1TN3AJ3s.cjs";
 import { Join } from "type-fest";
 
 //#region src/swap-indices.d.ts

package/dist/swap-indices.d.ts

@@ -1,4 +1,4 @@
-import { t as IterableContainer } from "./iterable-container-BdjPuIjL.js";
+import { t as IterableContainer } from "./iterable-container-Dv5vSKht.js";
 import { Join } from "type-fest";
 
 //#region src/swap-indices.d.ts

package/dist/swap-indices.js

@@ -1,2 +1,2 @@
-import{t as e}from"./curry-BcQ8Up1_.js";function t(...t){return e(n,t)}function n(e,t,n){return typeof e==`string`?r([...e],t,n).join(``):r(e,t,n)}function r(e,t,n){let r=[...e];if(Number.isNaN(t)||Number.isNaN(n))return r;let i=t<0?e.length+t:t,a=n<0?e.length+n:n;return i<0||i>e.length||a<0||a>e.length?r:(r[i]=e[a],r[a]=e[i],r)}export{t as swapIndices};
+import{t as e}from"./curry-NmniqyJ0.js";function t(...t){return e(n,t)}function n(e,t,n){return typeof e==`string`?r([...e],t,n).join(``):r(e,t,n)}function r(e,t,n){let r=[...e];if(Number.isNaN(t)||Number.isNaN(n))return r;let i=t<0?e.length+t:t,a=n<0?e.length+n:n;return i<0||i>e.length||a<0||a>e.length?r:(r[i]=e[a],r[a]=e[i],r)}export{t as swapIndices};
 //# sourceMappingURL=swap-indices.js.map

package/dist/swap-props.js

@@ -1,2 +1,2 @@
-import{t as e}from"./curry-BcQ8Up1_.js";function t(...t){return e(n,t)}function n(e,t,n){let{[t]:r,[n]:i}=e;return{...e,[t]:i,[n]:r}}export{t as swapProps};
+import{t as e}from"./curry-NmniqyJ0.js";function t(...t){return e(n,t)}function n(e,t,n){let{[t]:r,[n]:i}=e;return{...e,[t]:i,[n]:r}}export{t as swapProps};
 //# sourceMappingURL=swap-props.js.map

package/dist/take-first-by.d.cts

@@ -1,5 +1,5 @@
-import { t as NonEmptyArray } from "./non-empty-array-CFG7wGD-.cjs";
-import { t as OrderRule } from "./curry-order-rules-cezUWcSx.cjs";
+import { t as NonEmptyArray } from "./non-empty-array-NDjbHRjk.cjs";
+import { t as OrderRule } from "./curry-order-rules-BoF09Dq2.cjs";
 
 //#region src/take-first-by.d.ts
 

package/dist/take-first-by.d.ts

@@ -1,5 +1,5 @@
-import { t as NonEmptyArray } from "./non-empty-array-DXkY7ynY.js";
-import { t as OrderRule } from "./curry-order-rules-BCcwbNxd.js";
+import { t as NonEmptyArray } from "./non-empty-array-DHAKSw6t.js";
+import { t as OrderRule } from "./curry-order-rules-CoO4bk5I.js";
 
 //#region src/take-first-by.d.ts
 

package/dist/take-first-by.js

@@ -1,2 +1,2 @@
-import{n as e}from"./curry-order-rules-C6bwcUwC.js";import{n as t,t as n}from"./heap-bARaRULU.js";function r(...t){return e(i,t)}function i(e,r,i){if(i<=0)return[];if(i>=e.length)return[...e];let a=e.slice(0,i);t(a,r);let o=e.slice(i);for(let e of o)n(a,r,e);return a}export{r as takeFirstBy};
+import{n as e}from"./curry-order-rules-DwrF-_P1.js";import{n as t,t as n}from"./heap-BhpfhYWj.js";function r(...t){return e(i,t)}function i(e,r,i){if(i<=0)return[];if(i>=e.length)return[...e];let a=e.slice(0,i);t(a,r);let o=e.slice(i);for(let e of o)n(a,r,e);return a}export{r as takeFirstBy};
 //# sourceMappingURL=take-first-by.js.map

package/dist/take-last-while.d.cts

@@ -1,4 +1,4 @@
-import { t as IterableContainer } from "./iterable-container-OFsaw8WL.cjs";
+import { t as IterableContainer } from "./iterable-container-1TN3AJ3s.cjs";
 
 //#region src/take-last-while.d.ts
 

package/dist/take-last-while.d.ts

@@ -1,4 +1,4 @@
-import { t as IterableContainer } from "./iterable-container-BdjPuIjL.js";
+import { t as IterableContainer } from "./iterable-container-Dv5vSKht.js";
 
 //#region src/take-last-while.d.ts
 

package/dist/take-last-while.js

@@ -1,2 +1,2 @@
-import{t as e}from"./curry-BcQ8Up1_.js";function t(...t){return e(n,t)}function n(e,t){for(let n=e.length-1;n>=0;n--)if(!t(e[n],n,e))return e.slice(n+1);return[...e]}export{t as takeLastWhile};
+import{t as e}from"./curry-NmniqyJ0.js";function t(...t){return e(n,t)}function n(e,t){for(let n=e.length-1;n>=0;n--)if(!t(e[n],n,e))return e.slice(n+1);return[...e]}export{t as takeLastWhile};
 //# sourceMappingURL=take-last-while.js.map

package/dist/take-last.d.cts

@@ -1,4 +1,4 @@
-import { t as IterableContainer } from "./iterable-container-OFsaw8WL.cjs";
+import { t as IterableContainer } from "./iterable-container-1TN3AJ3s.cjs";
 
 //#region src/take-last.d.ts
 

package/dist/take-last.d.ts

@@ -1,4 +1,4 @@
-import { t as IterableContainer } from "./iterable-container-BdjPuIjL.js";
+import { t as IterableContainer } from "./iterable-container-Dv5vSKht.js";
 
 //#region src/take-last.d.ts
 

package/dist/take-last.js

@@ -1,2 +1,2 @@
-import{t as e}from"./curry-BcQ8Up1_.js";function t(...t){return e(n,t)}function n(e,t){return t>0?e.slice(Math.max(0,e.length-t)):[]}export{t as takeLast};
+import{t as e}from"./curry-NmniqyJ0.js";function t(...t){return e(n,t)}function n(e,t){return t>0?e.slice(Math.max(0,e.length-t)):[]}export{t as takeLast};
 //# sourceMappingURL=take-last.js.map

package/dist/take-while.d.cts

@@ -1,4 +1,4 @@
-import { t as IterableContainer } from "./iterable-container-OFsaw8WL.cjs";
+import { t as IterableContainer } from "./iterable-container-1TN3AJ3s.cjs";
 
 //#region src/take-while.d.ts
 

package/dist/take-while.d.ts

@@ -1,4 +1,4 @@
-import { t as IterableContainer } from "./iterable-container-BdjPuIjL.js";
+import { t as IterableContainer } from "./iterable-container-Dv5vSKht.js";
 
 //#region src/take-while.d.ts
 

package/dist/take-while.js

@@ -1,2 +1,2 @@
-import{t as e}from"./curry-BcQ8Up1_.js";function t(...t){return e(n,t)}function n(e,t){let n=[];for(let[r,i]of e.entries()){if(!t(i,r,e))break;n.push(i)}return n}export{t as takeWhile};
+import{t as e}from"./curry-NmniqyJ0.js";function t(...t){return e(n,t)}function n(e,t){let n=[];for(let[r,i]of e.entries()){if(!t(i,r,e))break;n.push(i)}return n}export{t as takeWhile};
 //# sourceMappingURL=take-while.js.map