@vinicunca/perkakas 1.0.3 → 1.0.4

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

@@ -0,0 +1,2 @@
+
+export {  }

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

@@ -0,0 +1,2 @@
+
+export {  }

package/dist/take-last-while.spec-d-.js

@@ -0,0 +1 @@
+import{a as r}from"./chunk-KAA6IVBL.js";import{a as t}from"./chunk-6ALZHU2N.js";import"./chunk-MYLYERXO.js";import{a}from"./chunk-T5XG33UI.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";describe("data-first",()=>{test("empty array",()=>{let e=r([],a(!0));expectTypeOf(e).toEqualTypeOf()}),test("regular array",()=>{let e=r([],a(!0));expectTypeOf(e).toEqualTypeOf()}),test("regular array with union type",()=>{let e=r([],a(!0));expectTypeOf(e).toEqualTypeOf()}),test("prefix array",()=>{let e=r([1],a(!0));expectTypeOf(e).toEqualTypeOf()}),test("suffix array",()=>{let e=r([1],a(!0));expectTypeOf(e).toEqualTypeOf()}),test("array with suffix and prefix",()=>{let e=r([1,"a"],a(!0));expectTypeOf(e).toEqualTypeOf()}),test("tuple",()=>{let e=r([1,"a",!0],a(!0));expectTypeOf(e).toEqualTypeOf()}),test("union of arrays",()=>{let e=r([],a(!0));expectTypeOf(e).toEqualTypeOf()})});describe("data-last",()=>{test("empty array",()=>{let e=t([],r(a(!0)));expectTypeOf(e).toEqualTypeOf()}),test("regular array",()=>{let e=t([],r(a(!0)));expectTypeOf(e).toEqualTypeOf()}),test("regular array with union type",()=>{let e=t([],r(a(!0)));expectTypeOf(e).toEqualTypeOf()}),test("prefix array",()=>{let e=t([1],r(a(!0)));expectTypeOf(e).toEqualTypeOf()}),test("suffix array",()=>{let e=t([1],r(a(!0)));expectTypeOf(e).toEqualTypeOf()}),test("array with suffix and prefix",()=>{let e=t([1,"a"],r(a(!0)));expectTypeOf(e).toEqualTypeOf()}),test("tuple",()=>{let e=t([1,"a",!0],r(a(!0)));expectTypeOf(e).toEqualTypeOf()}),test("union of arrays",()=>{let e=t([],r(a(!0)));expectTypeOf(e).toEqualTypeOf()}),describe("predicate is typed correctly",()=>{test("empty array",()=>{t([],r((e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("regular array",()=>{t([],r((e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("regular array with union type",()=>{t([],r((e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("prefix array",()=>{t([1],r((e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("suffix array",()=>{t([1],r((e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("array with suffix and prefix",()=>{t([1,"a"],r((e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("tuple",()=>{t([1,"a",!0],r((e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("union of arrays",()=>{t([],r((e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))})})});

package/dist/take-last.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkRSJJRJTHcjs = require('./chunk-RSJJRJTH.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');exports.takeLast = _chunkRSJJRJTHcjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunk3DFX2FQGcjs = require('./chunk-3DFX2FQG.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');exports.takeLast = _chunk3DFX2FQGcjs.a;

package/dist/take-last.d.cts

@@ -1,3 +1,6 @@
+import { I as IterableContainer } from './types-BE3YOWVA.cjs';
+import 'type-fest';
+
 /**
  * Takes the last `n` elements from the `array`.
  *
@@ -10,7 +13,7 @@
  * @dataFirst
  * @category Array
  */
-declare function takeLast<T>(array: ReadonlyArray<T>, n: number): Array<T>;
+declare function takeLast<T extends IterableContainer>(array: T, n: number): Array<T[number]>;
 /**
  * Take the last `n` elements from the `array`.
  *
@@ -22,6 +25,6 @@ declare function takeLast<T>(array: ReadonlyArray<T>, n: number): Array<T>;
  * @dataLast
  * @category Array
  */
-declare function takeLast<T>(n: number): (array: ReadonlyArray<T>) => Array<T>;
+declare function takeLast<T extends IterableContainer>(n: number): (array: T) => Array<T[number]>;
 
 export { takeLast };

package/dist/take-last.d.ts

@@ -1,3 +1,6 @@
+import { I as IterableContainer } from './types-BE3YOWVA.js';
+import 'type-fest';
+
 /**
  * Takes the last `n` elements from the `array`.
  *
@@ -10,7 +13,7 @@
  * @dataFirst
  * @category Array
  */
-declare function takeLast<T>(array: ReadonlyArray<T>, n: number): Array<T>;
+declare function takeLast<T extends IterableContainer>(array: T, n: number): Array<T[number]>;
 /**
  * Take the last `n` elements from the `array`.
  *
@@ -22,6 +25,6 @@ declare function takeLast<T>(array: ReadonlyArray<T>, n: number): Array<T>;
  * @dataLast
  * @category Array
  */
-declare function takeLast<T>(n: number): (array: ReadonlyArray<T>) => Array<T>;
+declare function takeLast<T extends IterableContainer>(n: number): (array: T) => Array<T[number]>;
 
 export { takeLast };

package/dist/take-last.js

@@ -1 +1 @@
-import{a}from"./chunk-CIF6WEFP.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";export{a as takeLast};
+import{a}from"./chunk-OJ2QGTFS.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";export{a as takeLast};

package/dist/take-last.spec-d.cjs

@@ -0,0 +1 @@
+"use strict";var _chunk3DFX2FQGcjs = require('./chunk-3DFX2FQG.cjs');var _chunkI6VXEY44cjs = require('./chunk-I6VXEY44.cjs');require('./chunk-3X6SAJDQ.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');describe("data-first",()=>{test("empty array",()=>{let r=_chunk3DFX2FQGcjs.a.call(void 0, [],2);expectTypeOf(r).toEqualTypeOf()}),test("regular array",()=>{let r=_chunk3DFX2FQGcjs.a.call(void 0, [],2);expectTypeOf(r).toEqualTypeOf()}),test("regular array with union type",()=>{let r=_chunk3DFX2FQGcjs.a.call(void 0, [],2);expectTypeOf(r).toEqualTypeOf()}),test("prefix array",()=>{let r=_chunk3DFX2FQGcjs.a.call(void 0, [1],2);expectTypeOf(r).toEqualTypeOf()}),test("suffix array",()=>{let r=_chunk3DFX2FQGcjs.a.call(void 0, [1],2);expectTypeOf(r).toEqualTypeOf()}),test("array with suffix and prefix",()=>{let r=_chunk3DFX2FQGcjs.a.call(void 0, [1,"a"],2);expectTypeOf(r).toEqualTypeOf()}),test("tuple",()=>{let r=_chunk3DFX2FQGcjs.a.call(void 0, [1,"a",!0],2);expectTypeOf(r).toEqualTypeOf()}),test("union of arrays",()=>{let r=_chunk3DFX2FQGcjs.a.call(void 0, [],2);expectTypeOf(r).toEqualTypeOf()})});describe("data-last",()=>{test("empty array",()=>{let r=_chunkI6VXEY44cjs.a.call(void 0, [],_chunk3DFX2FQGcjs.a.call(void 0, 2));expectTypeOf(r).toEqualTypeOf()}),test("regular array",()=>{let r=_chunkI6VXEY44cjs.a.call(void 0, [],_chunk3DFX2FQGcjs.a.call(void 0, 2));expectTypeOf(r).toEqualTypeOf()}),test("regular array with union type",()=>{let r=_chunkI6VXEY44cjs.a.call(void 0, [],_chunk3DFX2FQGcjs.a.call(void 0, 2));expectTypeOf(r).toEqualTypeOf()}),test("prefix array",()=>{let r=_chunkI6VXEY44cjs.a.call(void 0, [1],_chunk3DFX2FQGcjs.a.call(void 0, 2));expectTypeOf(r).toEqualTypeOf()}),test("suffix array",()=>{let r=_chunkI6VXEY44cjs.a.call(void 0, [1],_chunk3DFX2FQGcjs.a.call(void 0, 2));expectTypeOf(r).toEqualTypeOf()}),test("array with suffix and prefix",()=>{let r=_chunkI6VXEY44cjs.a.call(void 0, [1,"a"],_chunk3DFX2FQGcjs.a.call(void 0, 2));expectTypeOf(r).toEqualTypeOf()}),test("tuple",()=>{let r=_chunkI6VXEY44cjs.a.call(void 0, [1,"a",!0],_chunk3DFX2FQGcjs.a.call(void 0, 2));expectTypeOf(r).toEqualTypeOf()}),test("union of arrays",()=>{let r=_chunkI6VXEY44cjs.a.call(void 0, [],_chunk3DFX2FQGcjs.a.call(void 0, 2));expectTypeOf(r).toEqualTypeOf()})});

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

@@ -0,0 +1,2 @@
+
+export {  }

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

@@ -0,0 +1,2 @@
+
+export {  }

package/dist/take-last.spec-d.js

@@ -0,0 +1 @@
+import{a as e}from"./chunk-OJ2QGTFS.js";import{a as t}from"./chunk-6ALZHU2N.js";import"./chunk-MYLYERXO.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";describe("data-first",()=>{test("empty array",()=>{let r=e([],2);expectTypeOf(r).toEqualTypeOf()}),test("regular array",()=>{let r=e([],2);expectTypeOf(r).toEqualTypeOf()}),test("regular array with union type",()=>{let r=e([],2);expectTypeOf(r).toEqualTypeOf()}),test("prefix array",()=>{let r=e([1],2);expectTypeOf(r).toEqualTypeOf()}),test("suffix array",()=>{let r=e([1],2);expectTypeOf(r).toEqualTypeOf()}),test("array with suffix and prefix",()=>{let r=e([1,"a"],2);expectTypeOf(r).toEqualTypeOf()}),test("tuple",()=>{let r=e([1,"a",!0],2);expectTypeOf(r).toEqualTypeOf()}),test("union of arrays",()=>{let r=e([],2);expectTypeOf(r).toEqualTypeOf()})});describe("data-last",()=>{test("empty array",()=>{let r=t([],e(2));expectTypeOf(r).toEqualTypeOf()}),test("regular array",()=>{let r=t([],e(2));expectTypeOf(r).toEqualTypeOf()}),test("regular array with union type",()=>{let r=t([],e(2));expectTypeOf(r).toEqualTypeOf()}),test("prefix array",()=>{let r=t([1],e(2));expectTypeOf(r).toEqualTypeOf()}),test("suffix array",()=>{let r=t([1],e(2));expectTypeOf(r).toEqualTypeOf()}),test("array with suffix and prefix",()=>{let r=t([1,"a"],e(2));expectTypeOf(r).toEqualTypeOf()}),test("tuple",()=>{let r=t([1,"a",!0],e(2));expectTypeOf(r).toEqualTypeOf()}),test("union of arrays",()=>{let r=t([],e(2));expectTypeOf(r).toEqualTypeOf()})});

package/dist/take-while.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkAE5HI6VGcjs = require('./chunk-AE5HI6VG.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');exports.takeWhile = _chunkAE5HI6VGcjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkZO4ND36Ncjs = require('./chunk-ZO4ND36N.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');exports.takeWhile = _chunkZO4ND36Ncjs.a;

package/dist/take-while.d.cts

@@ -1,3 +1,6 @@
+import { I as IterableContainer } from './types-BE3YOWVA.cjs';
+import 'type-fest';
+
 /**
  * Returns elements from the array until predicate returns false.
  *
@@ -10,7 +13,7 @@
  * @dataFirst
  * @category Array
  */
-declare function takeWhile<T>(data: ReadonlyArray<T>, predicate: (item: T, index: number, data: ReadonlyArray<T>) => boolean): Array<T>;
+declare function takeWhile<T extends IterableContainer>(data: T, predicate: (item: T[number], index: number, data: T) => boolean): Array<T[number]>;
 /**
  * Returns elements from the array until predicate returns false.
  *
@@ -22,6 +25,6 @@ declare function takeWhile<T>(data: ReadonlyArray<T>, predicate: (item: T, index
  * @dataLast
  * @category Array
  */
-declare function takeWhile<T>(predicate: (item: T, index: number, data: ReadonlyArray<T>) => boolean): (array: ReadonlyArray<T>) => Array<T>;
+declare function takeWhile<T extends IterableContainer>(predicate: (item: T[number], index: number, data: T) => boolean): (array: T) => Array<T[number]>;
 
 export { takeWhile };

package/dist/take-while.d.ts

@@ -1,3 +1,6 @@
+import { I as IterableContainer } from './types-BE3YOWVA.js';
+import 'type-fest';
+
 /**
  * Returns elements from the array until predicate returns false.
  *
@@ -10,7 +13,7 @@
  * @dataFirst
  * @category Array
  */
-declare function takeWhile<T>(data: ReadonlyArray<T>, predicate: (item: T, index: number, data: ReadonlyArray<T>) => boolean): Array<T>;
+declare function takeWhile<T extends IterableContainer>(data: T, predicate: (item: T[number], index: number, data: T) => boolean): Array<T[number]>;
 /**
  * Returns elements from the array until predicate returns false.
  *
@@ -22,6 +25,6 @@ declare function takeWhile<T>(data: ReadonlyArray<T>, predicate: (item: T, index
  * @dataLast
  * @category Array
  */
-declare function takeWhile<T>(predicate: (item: T, index: number, data: ReadonlyArray<T>) => boolean): (array: ReadonlyArray<T>) => Array<T>;
+declare function takeWhile<T extends IterableContainer>(predicate: (item: T[number], index: number, data: T) => boolean): (array: T) => Array<T[number]>;
 
 export { takeWhile };

package/dist/take-while.js

@@ -1 +1 @@
-import{a}from"./chunk-LOPUNSWJ.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";export{a as takeWhile};
+import{a}from"./chunk-VN2OAM2N.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";export{a as takeWhile};

package/dist/take-white.spec-d.cjs

@@ -0,0 +1 @@
+"use strict";var _chunkZO4ND36Ncjs = require('./chunk-ZO4ND36N.cjs');var _chunkI6VXEY44cjs = require('./chunk-I6VXEY44.cjs');require('./chunk-3X6SAJDQ.cjs');var _chunkWLNQOMKLcjs = require('./chunk-WLNQOMKL.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');describe("data-first",()=>{test("empty array",()=>{let e=_chunkZO4ND36Ncjs.a.call(void 0, [],_chunkWLNQOMKLcjs.a.call(void 0, !0));expectTypeOf(e).toEqualTypeOf()}),test("regular array",()=>{let e=_chunkZO4ND36Ncjs.a.call(void 0, [],_chunkWLNQOMKLcjs.a.call(void 0, !0));expectTypeOf(e).toEqualTypeOf()}),test("regular array with union type",()=>{let e=_chunkZO4ND36Ncjs.a.call(void 0, [],_chunkWLNQOMKLcjs.a.call(void 0, !0));expectTypeOf(e).toEqualTypeOf()}),test("prefix array",()=>{let e=_chunkZO4ND36Ncjs.a.call(void 0, [1],_chunkWLNQOMKLcjs.a.call(void 0, !0));expectTypeOf(e).toEqualTypeOf()}),test("suffix array",()=>{let e=_chunkZO4ND36Ncjs.a.call(void 0, [1],_chunkWLNQOMKLcjs.a.call(void 0, !0));expectTypeOf(e).toEqualTypeOf()}),test("array with suffix and prefix",()=>{let e=_chunkZO4ND36Ncjs.a.call(void 0, [1,"a"],_chunkWLNQOMKLcjs.a.call(void 0, !0));expectTypeOf(e).toEqualTypeOf()}),test("tuple",()=>{let e=_chunkZO4ND36Ncjs.a.call(void 0, [1,"a",!0],_chunkWLNQOMKLcjs.a.call(void 0, !0));expectTypeOf(e).toEqualTypeOf()}),test("union of arrays",()=>{let e=_chunkZO4ND36Ncjs.a.call(void 0, [],_chunkWLNQOMKLcjs.a.call(void 0, !0));expectTypeOf(e).toEqualTypeOf()})});describe("data-last",()=>{test("empty array",()=>{let e=_chunkI6VXEY44cjs.a.call(void 0, [],_chunkZO4ND36Ncjs.a.call(void 0, _chunkWLNQOMKLcjs.a.call(void 0, !0)));expectTypeOf(e).toEqualTypeOf()}),test("regular array",()=>{let e=_chunkI6VXEY44cjs.a.call(void 0, [],_chunkZO4ND36Ncjs.a.call(void 0, _chunkWLNQOMKLcjs.a.call(void 0, !0)));expectTypeOf(e).toEqualTypeOf()}),test("regular array with union type",()=>{let e=_chunkI6VXEY44cjs.a.call(void 0, [],_chunkZO4ND36Ncjs.a.call(void 0, _chunkWLNQOMKLcjs.a.call(void 0, !0)));expectTypeOf(e).toEqualTypeOf()}),test("prefix array",()=>{let e=_chunkI6VXEY44cjs.a.call(void 0, [1],_chunkZO4ND36Ncjs.a.call(void 0, _chunkWLNQOMKLcjs.a.call(void 0, !0)));expectTypeOf(e).toEqualTypeOf()}),test("suffix array",()=>{let e=_chunkI6VXEY44cjs.a.call(void 0, [1],_chunkZO4ND36Ncjs.a.call(void 0, _chunkWLNQOMKLcjs.a.call(void 0, !0)));expectTypeOf(e).toEqualTypeOf()}),test("array with suffix and prefix",()=>{let e=_chunkI6VXEY44cjs.a.call(void 0, [1,"a"],_chunkZO4ND36Ncjs.a.call(void 0, _chunkWLNQOMKLcjs.a.call(void 0, !0)));expectTypeOf(e).toEqualTypeOf()}),test("tuple",()=>{let e=_chunkI6VXEY44cjs.a.call(void 0, [1,"a",!0],_chunkZO4ND36Ncjs.a.call(void 0, _chunkWLNQOMKLcjs.a.call(void 0, !0)));expectTypeOf(e).toEqualTypeOf()}),test("union of arrays",()=>{let e=_chunkI6VXEY44cjs.a.call(void 0, [],_chunkZO4ND36Ncjs.a.call(void 0, _chunkWLNQOMKLcjs.a.call(void 0, !0)));expectTypeOf(e).toEqualTypeOf()}),describe("predicate is typed correctly",()=>{test("empty array",()=>{_chunkI6VXEY44cjs.a.call(void 0, [],_chunkZO4ND36Ncjs.a.call(void 0, (e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("regular array",()=>{_chunkI6VXEY44cjs.a.call(void 0, [],_chunkZO4ND36Ncjs.a.call(void 0, (e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("regular array with union type",()=>{_chunkI6VXEY44cjs.a.call(void 0, [],_chunkZO4ND36Ncjs.a.call(void 0, (e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("prefix array",()=>{_chunkI6VXEY44cjs.a.call(void 0, [1],_chunkZO4ND36Ncjs.a.call(void 0, (e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("suffix array",()=>{_chunkI6VXEY44cjs.a.call(void 0, [1],_chunkZO4ND36Ncjs.a.call(void 0, (e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("array with suffix and prefix",()=>{_chunkI6VXEY44cjs.a.call(void 0, [1,"a"],_chunkZO4ND36Ncjs.a.call(void 0, (e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("tuple",()=>{_chunkI6VXEY44cjs.a.call(void 0, [1,"a",!0],_chunkZO4ND36Ncjs.a.call(void 0, (e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("union of arrays",()=>{_chunkI6VXEY44cjs.a.call(void 0, [],_chunkZO4ND36Ncjs.a.call(void 0, (e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))})})});

package/dist/take-white.spec-d.d.cts

@@ -0,0 +1,2 @@
+
+export {  }

package/dist/take-white.spec-d.d.ts

@@ -0,0 +1,2 @@
+
+export {  }

package/dist/take-white.spec-d.js

@@ -0,0 +1 @@
+import{a as r}from"./chunk-VN2OAM2N.js";import{a as t}from"./chunk-6ALZHU2N.js";import"./chunk-MYLYERXO.js";import{a}from"./chunk-T5XG33UI.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";describe("data-first",()=>{test("empty array",()=>{let e=r([],a(!0));expectTypeOf(e).toEqualTypeOf()}),test("regular array",()=>{let e=r([],a(!0));expectTypeOf(e).toEqualTypeOf()}),test("regular array with union type",()=>{let e=r([],a(!0));expectTypeOf(e).toEqualTypeOf()}),test("prefix array",()=>{let e=r([1],a(!0));expectTypeOf(e).toEqualTypeOf()}),test("suffix array",()=>{let e=r([1],a(!0));expectTypeOf(e).toEqualTypeOf()}),test("array with suffix and prefix",()=>{let e=r([1,"a"],a(!0));expectTypeOf(e).toEqualTypeOf()}),test("tuple",()=>{let e=r([1,"a",!0],a(!0));expectTypeOf(e).toEqualTypeOf()}),test("union of arrays",()=>{let e=r([],a(!0));expectTypeOf(e).toEqualTypeOf()})});describe("data-last",()=>{test("empty array",()=>{let e=t([],r(a(!0)));expectTypeOf(e).toEqualTypeOf()}),test("regular array",()=>{let e=t([],r(a(!0)));expectTypeOf(e).toEqualTypeOf()}),test("regular array with union type",()=>{let e=t([],r(a(!0)));expectTypeOf(e).toEqualTypeOf()}),test("prefix array",()=>{let e=t([1],r(a(!0)));expectTypeOf(e).toEqualTypeOf()}),test("suffix array",()=>{let e=t([1],r(a(!0)));expectTypeOf(e).toEqualTypeOf()}),test("array with suffix and prefix",()=>{let e=t([1,"a"],r(a(!0)));expectTypeOf(e).toEqualTypeOf()}),test("tuple",()=>{let e=t([1,"a",!0],r(a(!0)));expectTypeOf(e).toEqualTypeOf()}),test("union of arrays",()=>{let e=t([],r(a(!0)));expectTypeOf(e).toEqualTypeOf()}),describe("predicate is typed correctly",()=>{test("empty array",()=>{t([],r((e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("regular array",()=>{t([],r((e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("regular array with union type",()=>{t([],r((e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("prefix array",()=>{t([1],r((e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("suffix array",()=>{t([1],r((e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("array with suffix and prefix",()=>{t([1,"a"],r((e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("tuple",()=>{t([1,"a",!0],r((e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))}),test("union of arrays",()=>{t([],r((e,u,y)=>(expectTypeOf(e).toEqualTypeOf(),expectTypeOf(u).toEqualTypeOf(),expectTypeOf(y).toEqualTypeOf(),!0)))})})});

package/dist/take.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkX6AB3I7Zcjs = require('./chunk-X6AB3I7Z.cjs');require('./chunk-3X6SAJDQ.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');exports.take = _chunkX6AB3I7Zcjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkZ5UEQBZPcjs = require('./chunk-Z5UEQBZP.cjs');require('./chunk-3X6SAJDQ.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');exports.take = _chunkZ5UEQBZPcjs.a;

package/dist/take.d.cts

@@ -1,3 +1,6 @@
+import { I as IterableContainer } from './types-BE3YOWVA.cjs';
+import 'type-fest';
+
 /**
  * Returns the first `n` elements of `array`.
  *
@@ -11,7 +14,7 @@
  * @lazy
  * @category Array
  */
-declare function take<T>(array: ReadonlyArray<T>, n: number): Array<T>;
+declare function take<T extends IterableContainer>(array: T, n: number): Array<T[number]>;
 /**
  * Returns the first `n` elements of `array`.
  *
@@ -24,6 +27,6 @@ declare function take<T>(array: ReadonlyArray<T>, n: number): Array<T>;
  * @lazy
  * @category Array
  */
-declare function take<T>(n: number): (array: ReadonlyArray<T>) => Array<T>;
+declare function take(n: number): <T extends IterableContainer>(array: T) => Array<T[number]>;
 
 export { take };

package/dist/take.d.ts

@@ -1,3 +1,6 @@
+import { I as IterableContainer } from './types-BE3YOWVA.js';
+import 'type-fest';
+
 /**
  * Returns the first `n` elements of `array`.
  *
@@ -11,7 +14,7 @@
  * @lazy
  * @category Array
  */
-declare function take<T>(array: ReadonlyArray<T>, n: number): Array<T>;
+declare function take<T extends IterableContainer>(array: T, n: number): Array<T[number]>;
 /**
  * Returns the first `n` elements of `array`.
  *
@@ -24,6 +27,6 @@ declare function take<T>(array: ReadonlyArray<T>, n: number): Array<T>;
  * @lazy
  * @category Array
  */
-declare function take<T>(n: number): (array: ReadonlyArray<T>) => Array<T>;
+declare function take(n: number): <T extends IterableContainer>(array: T) => Array<T[number]>;
 
 export { take };

package/dist/take.js

@@ -1 +1 @@
-import{a}from"./chunk-LIKMH7XD.js";import"./chunk-MYLYERXO.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";export{a as take};
+import{a}from"./chunk-EPHUNAE5.js";import"./chunk-MYLYERXO.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";export{a as take};

package/dist/take.spec-d.cjs

@@ -0,0 +1 @@
+"use strict";var _chunkZ5UEQBZPcjs = require('./chunk-Z5UEQBZP.cjs');var _chunkI6VXEY44cjs = require('./chunk-I6VXEY44.cjs');require('./chunk-3X6SAJDQ.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');describe("data-first",()=>{test("empty array",()=>{let r=_chunkZ5UEQBZPcjs.a.call(void 0, [],2);expectTypeOf(r).toEqualTypeOf()}),test("regular array",()=>{let r=_chunkZ5UEQBZPcjs.a.call(void 0, [],2);expectTypeOf(r).toEqualTypeOf()}),test("regular array with union type",()=>{let r=_chunkZ5UEQBZPcjs.a.call(void 0, [],2);expectTypeOf(r).toEqualTypeOf()}),test("prefix array",()=>{let r=_chunkZ5UEQBZPcjs.a.call(void 0, [1],2);expectTypeOf(r).toEqualTypeOf()}),test("suffix array",()=>{let r=_chunkZ5UEQBZPcjs.a.call(void 0, [1],2);expectTypeOf(r).toEqualTypeOf()}),test("array with suffix and prefix",()=>{let r=_chunkZ5UEQBZPcjs.a.call(void 0, [1,"a"],2);expectTypeOf(r).toEqualTypeOf()}),test("tuple",()=>{let r=_chunkZ5UEQBZPcjs.a.call(void 0, [1,"a",!0],2);expectTypeOf(r).toEqualTypeOf()}),test("union of arrays",()=>{let r=_chunkZ5UEQBZPcjs.a.call(void 0, [],2);expectTypeOf(r).toEqualTypeOf()})});describe("data-last",()=>{test("empty array",()=>{let r=_chunkI6VXEY44cjs.a.call(void 0, [],_chunkZ5UEQBZPcjs.a.call(void 0, 2));expectTypeOf(r).toEqualTypeOf()}),test("regular array",()=>{let r=_chunkI6VXEY44cjs.a.call(void 0, [],_chunkZ5UEQBZPcjs.a.call(void 0, 2));expectTypeOf(r).toEqualTypeOf()}),test("regular array with union type",()=>{let r=_chunkI6VXEY44cjs.a.call(void 0, [],_chunkZ5UEQBZPcjs.a.call(void 0, 2));expectTypeOf(r).toEqualTypeOf()}),test("prefix array",()=>{let r=_chunkI6VXEY44cjs.a.call(void 0, [1],_chunkZ5UEQBZPcjs.a.call(void 0, 2));expectTypeOf(r).toEqualTypeOf()}),test("suffix array",()=>{let r=_chunkI6VXEY44cjs.a.call(void 0, [1],_chunkZ5UEQBZPcjs.a.call(void 0, 2));expectTypeOf(r).toEqualTypeOf()}),test("array with suffix and prefix",()=>{let r=_chunkI6VXEY44cjs.a.call(void 0, [1,"a"],_chunkZ5UEQBZPcjs.a.call(void 0, 2));expectTypeOf(r).toEqualTypeOf()}),test("tuple",()=>{let r=_chunkI6VXEY44cjs.a.call(void 0, [1,"a",!0],_chunkZ5UEQBZPcjs.a.call(void 0, 2));expectTypeOf(r).toEqualTypeOf()}),test("union of arrays",()=>{let r=_chunkI6VXEY44cjs.a.call(void 0, [],_chunkZ5UEQBZPcjs.a.call(void 0, 2));expectTypeOf(r).toEqualTypeOf()})});

package/dist/take.spec-d.d.cts

@@ -0,0 +1,2 @@
+
+export {  }

package/dist/take.spec-d.d.ts

@@ -0,0 +1,2 @@
+
+export {  }

package/dist/take.spec-d.js

@@ -0,0 +1 @@
+import{a as e}from"./chunk-EPHUNAE5.js";import{a as t}from"./chunk-6ALZHU2N.js";import"./chunk-MYLYERXO.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";describe("data-first",()=>{test("empty array",()=>{let r=e([],2);expectTypeOf(r).toEqualTypeOf()}),test("regular array",()=>{let r=e([],2);expectTypeOf(r).toEqualTypeOf()}),test("regular array with union type",()=>{let r=e([],2);expectTypeOf(r).toEqualTypeOf()}),test("prefix array",()=>{let r=e([1],2);expectTypeOf(r).toEqualTypeOf()}),test("suffix array",()=>{let r=e([1],2);expectTypeOf(r).toEqualTypeOf()}),test("array with suffix and prefix",()=>{let r=e([1,"a"],2);expectTypeOf(r).toEqualTypeOf()}),test("tuple",()=>{let r=e([1,"a",!0],2);expectTypeOf(r).toEqualTypeOf()}),test("union of arrays",()=>{let r=e([],2);expectTypeOf(r).toEqualTypeOf()})});describe("data-last",()=>{test("empty array",()=>{let r=t([],e(2));expectTypeOf(r).toEqualTypeOf()}),test("regular array",()=>{let r=t([],e(2));expectTypeOf(r).toEqualTypeOf()}),test("regular array with union type",()=>{let r=t([],e(2));expectTypeOf(r).toEqualTypeOf()}),test("prefix array",()=>{let r=t([1],e(2));expectTypeOf(r).toEqualTypeOf()}),test("suffix array",()=>{let r=t([1],e(2));expectTypeOf(r).toEqualTypeOf()}),test("array with suffix and prefix",()=>{let r=t([1,"a"],e(2));expectTypeOf(r).toEqualTypeOf()}),test("tuple",()=>{let r=t([1,"a",!0],e(2));expectTypeOf(r).toEqualTypeOf()}),test("union of arrays",()=>{let r=t([],e(2));expectTypeOf(r).toEqualTypeOf()})});

package/dist/tap.spec-d.cjs

@@ -1 +1 @@
-"use strict";var _chunkYWO7TFODcjs = require('./chunk-YWO7TFOD.cjs');var _chunkKLQZU5J4cjs = require('./chunk-KLQZU5J4.cjs');var _chunk7IYJC2PMcjs = require('./chunk-7IYJC2PM.cjs');var _chunkWW7P3TAUcjs = require('./chunk-WW7P3TAU.cjs');var _chunkI6VXEY44cjs = require('./chunk-I6VXEY44.cjs');require('./chunk-3X6SAJDQ.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');it("should work in the middle of pipe sequence",()=>{_chunkI6VXEY44cjs.a.call(void 0, [-1,2],_chunk7IYJC2PMcjs.a.call(void 0, e=>e>0),_chunkYWO7TFODcjs.a.call(void 0, e=>{expectTypeOf(e).toEqualTypeOf()}),_chunkWW7P3TAUcjs.a.call(void 0, _chunkKLQZU5J4cjs.a.call(void 0, 2)))});it("should infer types after tapping function reference with parameter type any",()=>{_chunkI6VXEY44cjs.a.call(void 0, [-1,2],_chunk7IYJC2PMcjs.a.call(void 0, e=>e>0),_chunkYWO7TFODcjs.a.call(void 0, i),_chunkWW7P3TAUcjs.a.call(void 0, e=>(expectTypeOf(e).toEqualTypeOf(),e*2)))});function i(e){return e}
+"use strict";var _chunkYWO7TFODcjs = require('./chunk-YWO7TFOD.cjs');var _chunkKLQZU5J4cjs = require('./chunk-KLQZU5J4.cjs');var _chunkWW7P3TAUcjs = require('./chunk-WW7P3TAU.cjs');var _chunk7IYJC2PMcjs = require('./chunk-7IYJC2PM.cjs');var _chunkI6VXEY44cjs = require('./chunk-I6VXEY44.cjs');require('./chunk-3X6SAJDQ.cjs');require('./chunk-Y74ER22O.cjs');require('./chunk-7T4AVFYJ.cjs');it("should work in the middle of pipe sequence",()=>{_chunkI6VXEY44cjs.a.call(void 0, [-1,2],_chunk7IYJC2PMcjs.a.call(void 0, e=>e>0),_chunkYWO7TFODcjs.a.call(void 0, e=>{expectTypeOf(e).toEqualTypeOf()}),_chunkWW7P3TAUcjs.a.call(void 0, _chunkKLQZU5J4cjs.a.call(void 0, 2)))});it("should infer types after tapping function reference with parameter type any",()=>{_chunkI6VXEY44cjs.a.call(void 0, [-1,2],_chunk7IYJC2PMcjs.a.call(void 0, e=>e>0),_chunkYWO7TFODcjs.a.call(void 0, i),_chunkWW7P3TAUcjs.a.call(void 0, e=>(expectTypeOf(e).toEqualTypeOf(),e*2)))});function i(e){return e}

package/dist/tap.spec-d.js

@@ -1 +1 @@
-import{a as o}from"./chunk-ENIRKKU6.js";import{a as n}from"./chunk-MBYBX5B3.js";import{a as p}from"./chunk-BGPRJNRQ.js";import{a as t}from"./chunk-QRDGUNHT.js";import{a as r}from"./chunk-6ALZHU2N.js";import"./chunk-MYLYERXO.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";it("should work in the middle of pipe sequence",()=>{r([-1,2],p(e=>e>0),o(e=>{expectTypeOf(e).toEqualTypeOf()}),t(n(2)))});it("should infer types after tapping function reference with parameter type any",()=>{r([-1,2],p(e=>e>0),o(i),t(e=>(expectTypeOf(e).toEqualTypeOf(),e*2)))});function i(e){return e}
+import{a as o}from"./chunk-ENIRKKU6.js";import{a as n}from"./chunk-MBYBX5B3.js";import{a as t}from"./chunk-QRDGUNHT.js";import{a as p}from"./chunk-BGPRJNRQ.js";import{a as r}from"./chunk-6ALZHU2N.js";import"./chunk-MYLYERXO.js";import"./chunk-JFXZ246Y.js";import"./chunk-KQGY2DBY.js";it("should work in the middle of pipe sequence",()=>{r([-1,2],p(e=>e>0),o(e=>{expectTypeOf(e).toEqualTypeOf()}),t(n(2)))});it("should infer types after tapping function reference with parameter type any",()=>{r([-1,2],p(e=>e>0),o(i),t(e=>(expectTypeOf(e).toEqualTypeOf(),e*2)))});function i(e){return e}

package/dist/{types-BMu1PIvo.d.cts → types-BE3YOWVA.d.cts}

@@ -19,7 +19,7 @@ type Mapped<T extends IterableContainer, K> = {
  * We would've named this `ArrayLike`, but that's already used by typescript...
  * @see This was inspired by the type-definition of Promise.all (https://github.com/microsoft/TypeScript/blob/1df5717b120cddd325deab8b0f2b2c3eecaf2b01/src/lib/es2015.promise.d.ts#L21)
  */
-type IterableContainer<T = unknown> = ReadonlyArray<T> | readonly [];
+type IterableContainer<T = unknown> = readonly [] | ReadonlyArray<T>;
 /**
  * Check if a type is guaranteed to be a bounded record: a record with a finite
  * set of keys.
@@ -111,5 +111,48 @@ type InternalIsUnion<T, U = T> = (IsNever<T> extends true ? false : T extends an
  * type Result = GuardType<TypeGuardFn>; // `string`
  */
 type GuardType<T, Fallback = never> = T extends (x: any, ...rest: any) => x is infer U ? U : Fallback;
+/**
+ * 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]>;
+/**
+ * Takes an array and returns the types that make up it's parts. The suffix is
+ * anything before the rest parameter (if any), the prefix is anything after the
+ * rest parameter (if any), and the item is the type of the rest parameter.
+ *
+ * The output could be used to reconstruct the input: `[
+ *   ...TupleParts<T>["prefix"],
+ *   ...Array<TupleParts<T>["item"]>,
+ *   ...TupleParts<T>["suffix"],
+ * ]`.
+ */
+type TupleParts<T, Prefix extends Array<unknown> = [], Suffix extends Array<unknown> = []> = T extends readonly [infer Head, ...infer Tail] ? TupleParts<Tail, [...Prefix, Head], Suffix> : T extends readonly [...infer Head, infer Tail] ? TupleParts<Head, Prefix, [Tail, ...Suffix]> : T extends ReadonlyArray<infer Item> ? {
+    prefix: Prefix;
+    item: Item;
+    suffix: Suffix;
+} : never;
+/**
+ * The result of running a function that would dedupe an array (`unique`,
+ * `uniqueBy`, and `uniqueWith`).
+ *
+ * There are certain traits of the output which are unique to a deduped array
+ * that allow us to create a better type; see comments inline.
+ *
+ * !Note: We can build better types for each of the unique functions
+ * _separately_ by taking advantage of _other_ characteristics that are unique
+ * to each one (e.g. in `unique` we know that each item that has a disjoint type
+ * to all previous items would be part of the output, even when it isn't the
+ * first), but to make this utility the most useful we kept it simple and
+ * generic for now.
+ */
+type Deduped<T extends IterableContainer> = T extends readonly [] ? [
+] : T extends readonly [infer Head, ...infer Rest] ? [
+    Head,
+    ...Array<Rest[number]>
+] : T extends readonly [...Array<unknown>, unknown] ? NonEmptyArray<T[number]> : Array<T[number]>;
 
-export type { Branded as B, EnumerableStringKeyedValueOf as E, GuardType as G, IterableContainer as I, Mapped as M, NonEmptyArray as N, ReconstructedRecord as R, UpsertProp as U, EnumerableStringKeyOf as a, ExactRecord as b, NarrowedTo as c, IsUnion as d, IfBoundedRecord as e, ReorderedArray as f };
+export type { Branded as B, Deduped as D, EnumerableStringKeyedValueOf as E, GuardType as G, IterableContainer as I, Mapped as M, NTuple as N, ReconstructedRecord as R, TupleParts as T, UpsertProp as U, NonEmptyArray as a, EnumerableStringKeyOf as b, ExactRecord as c, NarrowedTo as d, IsUnion as e, IfBoundedRecord as f, ReorderedArray as g };

package/dist/{types-BMu1PIvo.d.ts → types-BE3YOWVA.d.ts}

@@ -19,7 +19,7 @@ type Mapped<T extends IterableContainer, K> = {
  * We would've named this `ArrayLike`, but that's already used by typescript...
  * @see This was inspired by the type-definition of Promise.all (https://github.com/microsoft/TypeScript/blob/1df5717b120cddd325deab8b0f2b2c3eecaf2b01/src/lib/es2015.promise.d.ts#L21)
  */
-type IterableContainer<T = unknown> = ReadonlyArray<T> | readonly [];
+type IterableContainer<T = unknown> = readonly [] | ReadonlyArray<T>;
 /**
  * Check if a type is guaranteed to be a bounded record: a record with a finite
  * set of keys.
@@ -111,5 +111,48 @@ type InternalIsUnion<T, U = T> = (IsNever<T> extends true ? false : T extends an
  * type Result = GuardType<TypeGuardFn>; // `string`
  */
 type GuardType<T, Fallback = never> = T extends (x: any, ...rest: any) => x is infer U ? U : Fallback;
+/**
+ * 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]>;
+/**
+ * Takes an array and returns the types that make up it's parts. The suffix is
+ * anything before the rest parameter (if any), the prefix is anything after the
+ * rest parameter (if any), and the item is the type of the rest parameter.
+ *
+ * The output could be used to reconstruct the input: `[
+ *   ...TupleParts<T>["prefix"],
+ *   ...Array<TupleParts<T>["item"]>,
+ *   ...TupleParts<T>["suffix"],
+ * ]`.
+ */
+type TupleParts<T, Prefix extends Array<unknown> = [], Suffix extends Array<unknown> = []> = T extends readonly [infer Head, ...infer Tail] ? TupleParts<Tail, [...Prefix, Head], Suffix> : T extends readonly [...infer Head, infer Tail] ? TupleParts<Head, Prefix, [Tail, ...Suffix]> : T extends ReadonlyArray<infer Item> ? {
+    prefix: Prefix;
+    item: Item;
+    suffix: Suffix;
+} : never;
+/**
+ * The result of running a function that would dedupe an array (`unique`,
+ * `uniqueBy`, and `uniqueWith`).
+ *
+ * There are certain traits of the output which are unique to a deduped array
+ * that allow us to create a better type; see comments inline.
+ *
+ * !Note: We can build better types for each of the unique functions
+ * _separately_ by taking advantage of _other_ characteristics that are unique
+ * to each one (e.g. in `unique` we know that each item that has a disjoint type
+ * to all previous items would be part of the output, even when it isn't the
+ * first), but to make this utility the most useful we kept it simple and
+ * generic for now.
+ */
+type Deduped<T extends IterableContainer> = T extends readonly [] ? [
+] : T extends readonly [infer Head, ...infer Rest] ? [
+    Head,
+    ...Array<Rest[number]>
+] : T extends readonly [...Array<unknown>, unknown] ? NonEmptyArray<T[number]> : Array<T[number]>;
 
-export type { Branded as B, EnumerableStringKeyedValueOf as E, GuardType as G, IterableContainer as I, Mapped as M, NonEmptyArray as N, ReconstructedRecord as R, UpsertProp as U, EnumerableStringKeyOf as a, ExactRecord as b, NarrowedTo as c, IsUnion as d, IfBoundedRecord as e, ReorderedArray as f };
+export type { Branded as B, Deduped as D, EnumerableStringKeyedValueOf as E, GuardType as G, IterableContainer as I, Mapped as M, NTuple as N, ReconstructedRecord as R, TupleParts as T, UpsertProp as U, NonEmptyArray as a, EnumerableStringKeyOf as b, ExactRecord as c, NarrowedTo as d, IsUnion as e, IfBoundedRecord as f, ReorderedArray as g };

package/dist/unique-by.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkDWPHE3F2cjs = require('./chunk-DWPHE3F2.cjs');require('./chunk-NLX7PGPI.cjs');require('./chunk-I6VXEY44.cjs');require('./chunk-3X6SAJDQ.cjs');exports.uniqueBy = _chunkDWPHE3F2cjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkMADDQNARcjs = require('./chunk-MADDQNAR.cjs');require('./chunk-NLX7PGPI.cjs');require('./chunk-I6VXEY44.cjs');require('./chunk-3X6SAJDQ.cjs');exports.uniqueBy = _chunkMADDQNARcjs.a;

package/dist/unique-by.d.cts

@@ -1,3 +1,6 @@
+import { I as IterableContainer, D as Deduped } from './types-BE3YOWVA.cjs';
+import 'type-fest';
+
 /**
  * Returns a new array containing only one copy of each element in the original
  * list transformed by a function. Elements are compared by reference using Set.
@@ -15,7 +18,7 @@
  * @lazy
  * @category Array
  */
-declare function uniqueBy<T, K>(data: ReadonlyArray<T>, keyFunction: (item: T, index: number, data: ReadonlyArray<T>) => K): Array<T>;
+declare function uniqueBy<T extends IterableContainer, K>(data: T, keyFunction: (item: T[number], index: number, data: T) => K): Deduped<T>;
 /**
  * Returns a new array containing only one copy of each element in the original
  * list transformed by a function. Elements are compared by reference using Set.
@@ -33,6 +36,6 @@ declare function uniqueBy<T, K>(data: ReadonlyArray<T>, keyFunction: (item: T, i
  * @lazy
  * @category Array
  */
-declare function uniqueBy<T, K>(keyFunction: (item: T, index: number, data: ReadonlyArray<T>) => K): (data: ReadonlyArray<T>) => Array<T>;
+declare function uniqueBy<T extends IterableContainer, K>(keyFunction: (item: T[number], index: number, data: T) => K): (data: T) => Deduped<T>;
 
 export { uniqueBy };

package/dist/unique-by.d.ts

@@ -1,3 +1,6 @@
+import { I as IterableContainer, D as Deduped } from './types-BE3YOWVA.js';
+import 'type-fest';
+
 /**
  * Returns a new array containing only one copy of each element in the original
  * list transformed by a function. Elements are compared by reference using Set.
@@ -15,7 +18,7 @@
  * @lazy
  * @category Array
  */
-declare function uniqueBy<T, K>(data: ReadonlyArray<T>, keyFunction: (item: T, index: number, data: ReadonlyArray<T>) => K): Array<T>;
+declare function uniqueBy<T extends IterableContainer, K>(data: T, keyFunction: (item: T[number], index: number, data: T) => K): Deduped<T>;
 /**
  * Returns a new array containing only one copy of each element in the original
  * list transformed by a function. Elements are compared by reference using Set.
@@ -33,6 +36,6 @@ declare function uniqueBy<T, K>(data: ReadonlyArray<T>, keyFunction: (item: T, i
  * @lazy
  * @category Array
  */
-declare function uniqueBy<T, K>(keyFunction: (item: T, index: number, data: ReadonlyArray<T>) => K): (data: ReadonlyArray<T>) => Array<T>;
+declare function uniqueBy<T extends IterableContainer, K>(keyFunction: (item: T[number], index: number, data: T) => K): (data: T) => Deduped<T>;
 
 export { uniqueBy };

package/dist/unique-by.js

@@ -1 +1 @@
-import{a}from"./chunk-DUKQ2ODK.js";import"./chunk-C6L5NLLB.js";import"./chunk-6ALZHU2N.js";import"./chunk-MYLYERXO.js";export{a as uniqueBy};
+import{a}from"./chunk-WRKGH4XX.js";import"./chunk-C6L5NLLB.js";import"./chunk-6ALZHU2N.js";import"./chunk-MYLYERXO.js";export{a as uniqueBy};

package/dist/unique-with.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkXQOKSJ5Rcjs = require('./chunk-XQOKSJ5R.cjs');require('./chunk-NLX7PGPI.cjs');require('./chunk-I6VXEY44.cjs');require('./chunk-3X6SAJDQ.cjs');exports.uniqueWith = _chunkXQOKSJ5Rcjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkE6RBEL5Zcjs = require('./chunk-E6RBEL5Z.cjs');require('./chunk-NLX7PGPI.cjs');require('./chunk-I6VXEY44.cjs');require('./chunk-3X6SAJDQ.cjs');exports.uniqueWith = _chunkE6RBEL5Zcjs.a;

package/dist/unique-with.d.cts

@@ -1,3 +1,6 @@
+import { I as IterableContainer, D as Deduped } from './types-BE3YOWVA.cjs';
+import 'type-fest';
+
 type IsEquals<T> = (a: T, b: T) => boolean;
 /**
  * Returns a new array containing only one copy of each element in the original
@@ -16,7 +19,7 @@ type IsEquals<T> = (a: T, b: T) => boolean;
  * @lazy
  * @category Array
  */
-declare function uniqueWith<T>(data: ReadonlyArray<T>, isEquals: IsEquals<T>): Array<T>;
+declare function uniqueWith<T extends IterableContainer>(data: T, isEquals: IsEquals<T[number]>): Deduped<T>;
 /**
  * Returns a new array containing only one copy of each element in the original
  * list. Elements are compared by custom comparator isEquals.
@@ -36,6 +39,6 @@ declare function uniqueWith<T>(data: ReadonlyArray<T>, isEquals: IsEquals<T>): A
  * @lazy
  * @category Array
  */
-declare function uniqueWith<T>(isEquals: IsEquals<T>): (data: ReadonlyArray<T>) => Array<T>;
+declare function uniqueWith<T extends IterableContainer>(isEquals: IsEquals<T[number]>): (data: T) => Deduped<T>;
 
 export { uniqueWith };

package/dist/unique-with.d.ts

@@ -1,3 +1,6 @@
+import { I as IterableContainer, D as Deduped } from './types-BE3YOWVA.js';
+import 'type-fest';
+
 type IsEquals<T> = (a: T, b: T) => boolean;
 /**
  * Returns a new array containing only one copy of each element in the original
@@ -16,7 +19,7 @@ type IsEquals<T> = (a: T, b: T) => boolean;
  * @lazy
  * @category Array
  */
-declare function uniqueWith<T>(data: ReadonlyArray<T>, isEquals: IsEquals<T>): Array<T>;
+declare function uniqueWith<T extends IterableContainer>(data: T, isEquals: IsEquals<T[number]>): Deduped<T>;
 /**
  * Returns a new array containing only one copy of each element in the original
  * list. Elements are compared by custom comparator isEquals.
@@ -36,6 +39,6 @@ declare function uniqueWith<T>(data: ReadonlyArray<T>, isEquals: IsEquals<T>): A
  * @lazy
  * @category Array
  */
-declare function uniqueWith<T>(isEquals: IsEquals<T>): (data: ReadonlyArray<T>) => Array<T>;
+declare function uniqueWith<T extends IterableContainer>(isEquals: IsEquals<T[number]>): (data: T) => Deduped<T>;
 
 export { uniqueWith };

package/dist/unique-with.js

@@ -1 +1 @@
-import{a}from"./chunk-YQKPA3BB.js";import"./chunk-C6L5NLLB.js";import"./chunk-6ALZHU2N.js";import"./chunk-MYLYERXO.js";export{a as uniqueWith};
+import{a}from"./chunk-AKGWT6GC.js";import"./chunk-C6L5NLLB.js";import"./chunk-6ALZHU2N.js";import"./chunk-MYLYERXO.js";export{a as uniqueWith};

package/dist/unique.cjs

@@ -1 +1 @@
-"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkYIUDV3OAcjs = require('./chunk-YIUDV3OA.cjs');require('./chunk-NLX7PGPI.cjs');require('./chunk-I6VXEY44.cjs');require('./chunk-3X6SAJDQ.cjs');exports.unique = _chunkYIUDV3OAcjs.a;
+"use strict";Object.defineProperty(exports, "__esModule", {value: true});var _chunkHTO3K3VAcjs = require('./chunk-HTO3K3VA.cjs');require('./chunk-NLX7PGPI.cjs');require('./chunk-I6VXEY44.cjs');require('./chunk-3X6SAJDQ.cjs');exports.unique = _chunkHTO3K3VAcjs.a;

package/dist/unique.d.cts

@@ -1,8 +1,11 @@
+import { I as IterableContainer, D as Deduped } from './types-BE3YOWVA.cjs';
+import 'type-fest';
+
 /**
  * Returns a new array containing only one copy of each element in the original
  * list. Elements are compared by reference using Set.
  *
- * @param array - The array to filter.
+ * @param data - The array to filter.
  * @signature
  *    P.unique(array)
  * @example
@@ -11,7 +14,7 @@
  * @lazy
  * @category Array
  */
-declare function unique<T>(array: ReadonlyArray<T>): Array<T>;
+declare function unique<T extends IterableContainer>(data: T): Deduped<T>;
 /**
  * Returns a new array containing only one copy of each element in the original
  * list. Elements are compared by reference using Set.
@@ -28,6 +31,6 @@ declare function unique<T>(array: ReadonlyArray<T>): Array<T>;
  * @lazy
  * @category Array
  */
-declare function unique<T>(): (array: ReadonlyArray<T>) => Array<T>;
+declare function unique(): <T extends IterableContainer>(data: T) => Deduped<T>;
 
 export { unique };

package/dist/unique.d.ts

@@ -1,8 +1,11 @@
+import { I as IterableContainer, D as Deduped } from './types-BE3YOWVA.js';
+import 'type-fest';
+
 /**
  * Returns a new array containing only one copy of each element in the original
  * list. Elements are compared by reference using Set.
  *
- * @param array - The array to filter.
+ * @param data - The array to filter.
  * @signature
  *    P.unique(array)
  * @example
@@ -11,7 +14,7 @@
  * @lazy
  * @category Array
  */
-declare function unique<T>(array: ReadonlyArray<T>): Array<T>;
+declare function unique<T extends IterableContainer>(data: T): Deduped<T>;
 /**
  * Returns a new array containing only one copy of each element in the original
  * list. Elements are compared by reference using Set.
@@ -28,6 +31,6 @@ declare function unique<T>(array: ReadonlyArray<T>): Array<T>;
  * @lazy
  * @category Array
  */
-declare function unique<T>(): (array: ReadonlyArray<T>) => Array<T>;
+declare function unique(): <T extends IterableContainer>(data: T) => Deduped<T>;
 
 export { unique };

package/dist/unique.js

@@ -1 +1 @@
-import{a}from"./chunk-MENOHSYF.js";import"./chunk-C6L5NLLB.js";import"./chunk-6ALZHU2N.js";import"./chunk-MYLYERXO.js";export{a as unique};
+import{a}from"./chunk-WQDEYM64.js";import"./chunk-C6L5NLLB.js";import"./chunk-6ALZHU2N.js";import"./chunk-MYLYERXO.js";export{a as unique};

package/dist/values.d.cts

@@ -1,4 +1,4 @@
-import { I as IterableContainer, E as EnumerableStringKeyedValueOf } from './types-BMu1PIvo.cjs';
+import { I as IterableContainer, E as EnumerableStringKeyedValueOf } from './types-BE3YOWVA.cjs';
 import 'type-fest';
 
 type Values<T extends object> = T extends IterableContainer ? Array<T[number]> : Array<EnumerableStringKeyedValueOf<T>>;

package/dist/values.d.ts

@@ -1,4 +1,4 @@
-import { I as IterableContainer, E as EnumerableStringKeyedValueOf } from './types-BMu1PIvo.js';
+import { I as IterableContainer, E as EnumerableStringKeyedValueOf } from './types-BE3YOWVA.js';
 import 'type-fest';
 
 type Values<T extends object> = T extends IterableContainer ? Array<T[number]> : Array<EnumerableStringKeyedValueOf<T>>;

package/dist/zip-with.d.cts

@@ -1,4 +1,4 @@
-import { I as IterableContainer } from './types-BMu1PIvo.cjs';
+import { I as IterableContainer } from './types-BE3YOWVA.cjs';
 import 'type-fest';
 
 type ZippingFunction<T1 extends IterableContainer = IterableContainer, T2 extends IterableContainer = IterableContainer, Value = unknown> = (first: T1[number], second: T2[number], index: number, data: readonly [first: T1, second: T2]) => Value;