@vinicunca/perkakas 1.9.0 → 1.13.0

package/dist/unique-by.d.cts

@@ -1,5 +1,44 @@
-import "./iterable-container-V5sa0V_H.cjs";
-import "./non-empty-array-D3ZRHApS.cjs";
-import "./deduped-CAglY8bF.cjs";
-import { uniqueBy } from "./unique-by-BPYs6c1v.cjs";
-export { uniqueBy };
+import { t as IterableContainer } from "./iterable-container-1TN3AJ3s.cjs";
+import { t as Deduped } from "./deduped-DdwAYzXs.cjs";
+
+//#region src/unique-by.d.ts
+
+/**
+ * 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.
+ *
+ * @param data - The array to filter.
+ * @param keyFunction - Extracts a value that would be used to compare elements.
+ * @signature
+ *    P.uniqueBy(data, keyFunction)
+ * @example
+ *    P.uniqueBy(
+ *     [{ n: 1 }, { n: 2 }, { n: 2 }, { n: 5 }, { n: 1 }, { n: 6 }, { n: 7 }],
+ *     (obj) => obj.n,
+ *    ) // => [{n: 1}, {n: 2}, {n: 5}, {n: 6}, {n: 7}]
+ * @dataFirst
+ * @lazy
+ * @category Array
+ */
+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.
+ *
+ * @param keyFunction - Extracts a value that would be used to compare elements.
+ * @signature
+ *    P.uniqueBy(keyFunction)(data)
+ * @example
+ *    P.pipe(
+ *      [{n: 1}, {n: 2}, {n: 2}, {n: 5}, {n: 1}, {n: 6}, {n: 7}], // only 4 iterations
+ *      P.uniqueBy(obj => obj.n),
+ *      P.take(3)
+ *    ) // => [{n: 1}, {n: 2}, {n: 5}]
+ * @dataLast
+ * @lazy
+ * @category Array
+ */
+declare function uniqueBy<T extends IterableContainer, K>(keyFunction: (item: T[number], index: number, data: T) => K): (data: T) => Deduped<T>;
+//#endregion
+export { uniqueBy };
+//# sourceMappingURL=unique-by.d.cts.map

package/dist/unique-by.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"unique-by.d.cts","names":[],"sources":["../src/unique-by.ts"],"sourcesContent":[],"mappings":";;;;;;;AAwBA;;;;;;;;;AAsBA;;;;;;AAEwB,iBAxBR,QAwBQ,CAAA,UAxBW,iBAwBX,EAAA,CAAA,CAAA,CAAA,IAAA,EAvBhB,CAuBgB,EAAA,WAAA,EAAA,CAAA,IAAA,EAtBF,CAsBE,CAAA,MAAA,CAAA,EAAA,KAAA,EAAA,MAAA,EAAA,IAAA,EAtB8B,CAsB9B,EAAA,GAtBoC,CAsBpC,CAAA,EArBrB,OAqBqB,CArBb,CAqBa,CAAA;;;;;;;;;;;;;;;;;;iBAFR,mBAAmB,0CACb,gCAAgC,MAAM,WAClD,MAAM,QAAQ"}

package/dist/unique-by.d.ts

@@ -1,5 +1,44 @@
-import "./iterable-container-F9CDF7ym.js";
-import "./non-empty-array-BfTfvDYg.js";
-import "./deduped-Dru_XVLX.js";
-import { uniqueBy } from "./unique-by-B06g2psm.js";
-export { uniqueBy };
+import { t as IterableContainer } from "./iterable-container-Dv5vSKht.js";
+import { t as Deduped } from "./deduped-RY-1u-ns.js";
+
+//#region src/unique-by.d.ts
+
+/**
+ * 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.
+ *
+ * @param data - The array to filter.
+ * @param keyFunction - Extracts a value that would be used to compare elements.
+ * @signature
+ *    P.uniqueBy(data, keyFunction)
+ * @example
+ *    P.uniqueBy(
+ *     [{ n: 1 }, { n: 2 }, { n: 2 }, { n: 5 }, { n: 1 }, { n: 6 }, { n: 7 }],
+ *     (obj) => obj.n,
+ *    ) // => [{n: 1}, {n: 2}, {n: 5}, {n: 6}, {n: 7}]
+ * @dataFirst
+ * @lazy
+ * @category Array
+ */
+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.
+ *
+ * @param keyFunction - Extracts a value that would be used to compare elements.
+ * @signature
+ *    P.uniqueBy(keyFunction)(data)
+ * @example
+ *    P.pipe(
+ *      [{n: 1}, {n: 2}, {n: 2}, {n: 5}, {n: 1}, {n: 6}, {n: 7}], // only 4 iterations
+ *      P.uniqueBy(obj => obj.n),
+ *      P.take(3)
+ *    ) // => [{n: 1}, {n: 2}, {n: 5}]
+ * @dataLast
+ * @lazy
+ * @category Array
+ */
+declare function uniqueBy<T extends IterableContainer, K>(keyFunction: (item: T[number], index: number, data: T) => K): (data: T) => Deduped<T>;
+//#endregion
+export { uniqueBy };
+//# sourceMappingURL=unique-by.d.ts.map

package/dist/unique-by.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"unique-by.d.ts","names":[],"sources":["../src/unique-by.ts"],"sourcesContent":[],"mappings":";;;;;;;AAwBA;;;;;;;;;AAsBA;;;;;;AAEwB,iBAxBR,QAwBQ,CAAA,UAxBW,iBAwBX,EAAA,CAAA,CAAA,CAAA,IAAA,EAvBhB,CAuBgB,EAAA,WAAA,EAAA,CAAA,IAAA,EAtBF,CAsBE,CAAA,MAAA,CAAA,EAAA,KAAA,EAAA,MAAA,EAAA,IAAA,EAtB8B,CAsB9B,EAAA,GAtBoC,CAsBpC,CAAA,EArBrB,OAqBqB,CArBb,CAqBa,CAAA;;;;;;;;;;;;;;;;;;iBAFR,mBAAmB,0CACb,gCAAgC,MAAM,WAClD,MAAM,QAAQ"}

package/dist/unique-by.js

@@ -1 +1,2 @@
-import"./utility-evaluators-CnQVdcZv.js";import"./pipe-CtsfTnqv.js";import"./curry-from-lazy-BR-hoRDR.js";import{uniqueBy as e}from"./unique-by-Dh4QjQ3_.js";export{e as uniqueBy};
+import{t as e}from"./utility-evaluators-Boc-TMbq.js";import{t}from"./curry-from-lazy-PQ0BbG-7.js";function n(...e){return t(r,e)}function r(t){let n=new Set;return(r,i,a)=>{let o=t(r,i,a);return n.has(o)?e:(n.add(o),{done:!1,hasNext:!0,next:r})}}export{n as uniqueBy};
+//# sourceMappingURL=unique-by.js.map

package/dist/unique-by.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"unique-by.js","names":[],"sources":["../src/unique-by.ts"],"sourcesContent":["import type { Deduped } from './internal/types/deduped';\nimport type { IterableContainer } from './internal/types/iterable-container';\nimport type { LazyEvaluator } from './internal/types/lazy-evaluator';\n\nimport { curryFromLazy } from './internal/curry-from-lazy';\nimport { SKIP_ITEM } from './internal/utility-evaluators';\n\n/**\n * Returns a new array containing only one copy of each element in the original\n * list transformed by a function. Elements are compared by reference using Set.\n *\n * @param data - The array to filter.\n * @param keyFunction - Extracts a value that would be used to compare elements.\n * @signature\n *    P.uniqueBy(data, keyFunction)\n * @example\n *    P.uniqueBy(\n *     [{ n: 1 }, { n: 2 }, { n: 2 }, { n: 5 }, { n: 1 }, { n: 6 }, { n: 7 }],\n *     (obj) => obj.n,\n *    ) // => [{n: 1}, {n: 2}, {n: 5}, {n: 6}, {n: 7}]\n * @dataFirst\n * @lazy\n * @category Array\n */\nexport function uniqueBy<T extends IterableContainer, K>(\n  data: T,\n  keyFunction: (item: T[number], index: number, data: T) => K,\n): Deduped<T>;\n\n/**\n * Returns a new array containing only one copy of each element in the original\n * list transformed by a function. Elements are compared by reference using Set.\n *\n * @param keyFunction - Extracts a value that would be used to compare elements.\n * @signature\n *    P.uniqueBy(keyFunction)(data)\n * @example\n *    P.pipe(\n *      [{n: 1}, {n: 2}, {n: 2}, {n: 5}, {n: 1}, {n: 6}, {n: 7}], // only 4 iterations\n *      P.uniqueBy(obj => obj.n),\n *      P.take(3)\n *    ) // => [{n: 1}, {n: 2}, {n: 5}]\n * @dataLast\n * @lazy\n * @category Array\n */\nexport function uniqueBy<T extends IterableContainer, K>(\n  keyFunction: (item: T[number], index: number, data: T) => K,\n): (data: T) => Deduped<T>;\n\nexport function uniqueBy(...args: ReadonlyArray<unknown>): unknown {\n  return curryFromLazy(lazyImplementation, args);\n}\n\nfunction lazyImplementation<T, K>(\n  keyFunction: (item: T, index: number, data: ReadonlyArray<T>) => K,\n): LazyEvaluator<T> {\n  const set = new Set<K>();\n  return (value, index, data) => {\n    const key = keyFunction(value, index, data);\n    if (set.has(key)) {\n      return SKIP_ITEM;\n    }\n\n    set.add(key);\n    return { done: false, hasNext: true, next: value };\n  };\n}\n"],"mappings":"kGAkDA,SAAgB,EAAS,GAAG,EAAuC,CACjE,OAAO,EAAc,EAAoB,EAAK,CAGhD,SAAS,EACP,EACkB,CAClB,IAAM,EAAM,IAAI,IAChB,OAAQ,EAAO,EAAO,IAAS,CAC7B,IAAM,EAAM,EAAY,EAAO,EAAO,EAAK,CAM3C,OALI,EAAI,IAAI,EAAI,CACP,GAGT,EAAI,IAAI,EAAI,CACL,CAAE,KAAM,GAAO,QAAS,GAAM,KAAM,EAAO"}

package/dist/unique-with.cjs

@@ -1 +1 @@
-require(`./utility-evaluators-DqJcWENu.cjs`),require(`./pipe-DlFjc4Wf.cjs`),require(`./curry-from-lazy-BDH06qZ-.cjs`);const e=require(`./unique-with-DMT11QX0.cjs`);exports.uniqueWith=e.uniqueWith;
+const e=require(`./utility-evaluators-CAbODbuk.cjs`),t=require(`./curry-from-lazy-BCGvmhyS.cjs`);function n(...e){return t.t(r,e)}function r(t){return(n,r,i)=>i.findIndex((e,i)=>r===i||t(n,e))===r?{done:!1,hasNext:!0,next:n}:e.t}exports.uniqueWith=n;

package/dist/unique-with.d.cts

@@ -1,5 +1,46 @@
-import "./iterable-container-V5sa0V_H.cjs";
-import "./non-empty-array-D3ZRHApS.cjs";
-import "./deduped-CAglY8bF.cjs";
-import { uniqueWith } from "./unique-with-CLhkmrmv.cjs";
-export { uniqueWith };
+import { t as IterableContainer } from "./iterable-container-1TN3AJ3s.cjs";
+import { t as Deduped } from "./deduped-DdwAYzXs.cjs";
+
+//#region src/unique-with.d.ts
+type IsEquals<T> = (a: T, b: T) => boolean;
+/**
+ * Returns a new array containing only one copy of each element in the original
+ * list. Elements are compared by custom comparator isEquals.
+ *
+ * @param data - The array to filter.
+ * @param isEquals - The comparator.
+ * @signature
+ *    P.uniqueWith(array, isEquals)
+ * @example
+ *    P.uniqueWith(
+ *      [{a: 1}, {a: 2}, {a: 2}, {a: 5}, {a: 1}, {a: 6}, {a: 7}],
+ *      P.equals,
+ *    ) // => [{a: 1}, {a: 2}, {a: 5}, {a: 6}, {a: 7}]
+ * @dataFirst
+ * @lazy
+ * @category Array
+ */
+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.
+ *
+ * @param isEquals - The comparator.
+ * @signature P.uniqueWith(isEquals)(array)
+ * @example
+ *    P.uniqueWith(P.equals)(
+ *      [{a: 1}, {a: 2}, {a: 2}, {a: 5}, {a: 1}, {a: 6}, {a: 7}],
+ *    ) // => [{a: 1}, {a: 2}, {a: 5}, {a: 6}, {a: 7}]
+ *    P.pipe(
+ *      [{a: 1}, {a: 2}, {a: 2}, {a: 5}, {a: 1}, {a: 6}, {a: 7}], // only 4 iterations
+ *      P.uniqueWith(P.equals),
+ *      P.take(3)
+ *    ) // => [{a: 1}, {a: 2}, {a: 5}]
+ * @dataLast
+ * @lazy
+ * @category Array
+ */
+declare function uniqueWith<T extends IterableContainer>(isEquals: IsEquals<T[number]>): (data: T) => Deduped<T>;
+//#endregion
+export { uniqueWith };
+//# sourceMappingURL=unique-with.d.cts.map

package/dist/unique-with.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"unique-with.d.cts","names":[],"sources":["../src/unique-with.ts"],"sourcesContent":[],"mappings":";;;;KAMK,kBAAkB,MAAM;;AALgD;AAwB7E;;;;;;;;AAwBA;;;;;;;AAEuB,iBA1BP,UA0BO,CAAA,UA1Bc,iBA0Bd,CAAA,CAAA,IAAA,EAzBf,CAyBe,EAAA,QAAA,EAxBX,QAwBW,CAxBF,CAwBE,CAAA,MAAA,CAAA,CAAA,CAAA,EAvBpB,OAuBoB,CAvBZ,CAuBY,CAAA;;;;;;;;;;;;;;;;;;;;iBAFP,qBAAqB,6BACzB,SAAS,oBACX,MAAM,QAAQ"}

package/dist/unique-with.d.ts

@@ -1,5 +1,46 @@
-import "./iterable-container-F9CDF7ym.js";
-import "./non-empty-array-BfTfvDYg.js";
-import "./deduped-Dru_XVLX.js";
-import { uniqueWith } from "./unique-with-nNna0tkx.js";
-export { uniqueWith };
+import { t as IterableContainer } from "./iterable-container-Dv5vSKht.js";
+import { t as Deduped } from "./deduped-RY-1u-ns.js";
+
+//#region src/unique-with.d.ts
+type IsEquals<T> = (a: T, b: T) => boolean;
+/**
+ * Returns a new array containing only one copy of each element in the original
+ * list. Elements are compared by custom comparator isEquals.
+ *
+ * @param data - The array to filter.
+ * @param isEquals - The comparator.
+ * @signature
+ *    P.uniqueWith(array, isEquals)
+ * @example
+ *    P.uniqueWith(
+ *      [{a: 1}, {a: 2}, {a: 2}, {a: 5}, {a: 1}, {a: 6}, {a: 7}],
+ *      P.equals,
+ *    ) // => [{a: 1}, {a: 2}, {a: 5}, {a: 6}, {a: 7}]
+ * @dataFirst
+ * @lazy
+ * @category Array
+ */
+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.
+ *
+ * @param isEquals - The comparator.
+ * @signature P.uniqueWith(isEquals)(array)
+ * @example
+ *    P.uniqueWith(P.equals)(
+ *      [{a: 1}, {a: 2}, {a: 2}, {a: 5}, {a: 1}, {a: 6}, {a: 7}],
+ *    ) // => [{a: 1}, {a: 2}, {a: 5}, {a: 6}, {a: 7}]
+ *    P.pipe(
+ *      [{a: 1}, {a: 2}, {a: 2}, {a: 5}, {a: 1}, {a: 6}, {a: 7}], // only 4 iterations
+ *      P.uniqueWith(P.equals),
+ *      P.take(3)
+ *    ) // => [{a: 1}, {a: 2}, {a: 5}]
+ * @dataLast
+ * @lazy
+ * @category Array
+ */
+declare function uniqueWith<T extends IterableContainer>(isEquals: IsEquals<T[number]>): (data: T) => Deduped<T>;
+//#endregion
+export { uniqueWith };
+//# sourceMappingURL=unique-with.d.ts.map

package/dist/unique-with.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"unique-with.d.ts","names":[],"sources":["../src/unique-with.ts"],"sourcesContent":[],"mappings":";;;;KAMK,kBAAkB,MAAM;;AALgD;AAwB7E;;;;;;;;AAwBA;;;;;;;AAEuB,iBA1BP,UA0BO,CAAA,UA1Bc,iBA0Bd,CAAA,CAAA,IAAA,EAzBf,CAyBe,EAAA,QAAA,EAxBX,QAwBW,CAxBF,CAwBE,CAAA,MAAA,CAAA,CAAA,CAAA,EAvBpB,OAuBoB,CAvBZ,CAuBY,CAAA;;;;;;;;;;;;;;;;;;;;iBAFP,qBAAqB,6BACzB,SAAS,oBACX,MAAM,QAAQ"}

package/dist/unique-with.js

@@ -1 +1,2 @@
-import"./utility-evaluators-CnQVdcZv.js";import"./pipe-CtsfTnqv.js";import"./curry-from-lazy-BR-hoRDR.js";import{uniqueWith as e}from"./unique-with-hw-xxeGX.js";export{e as uniqueWith};
+import{t as e}from"./utility-evaluators-Boc-TMbq.js";import{t}from"./curry-from-lazy-PQ0BbG-7.js";function n(...e){return t(r,e)}function r(t){return(n,r,i)=>i.findIndex((e,i)=>r===i||t(n,e))===r?{done:!1,hasNext:!0,next:n}:e}export{n as uniqueWith};
+//# sourceMappingURL=unique-with.js.map

package/dist/unique-with.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"unique-with.js","names":[],"sources":["../src/unique-with.ts"],"sourcesContent":["import type { Deduped } from './internal/types/deduped';\nimport type { IterableContainer } from './internal/types/iterable-container';\nimport type { LazyEvaluator } from './internal/types/lazy-evaluator';\nimport { curryFromLazy } from './internal/curry-from-lazy';\nimport { SKIP_ITEM } from './internal/utility-evaluators';\n\ntype IsEquals<T> = (a: T, b: T) => boolean;\n\n/**\n * Returns a new array containing only one copy of each element in the original\n * list. Elements are compared by custom comparator isEquals.\n *\n * @param data - The array to filter.\n * @param isEquals - The comparator.\n * @signature\n *    P.uniqueWith(array, isEquals)\n * @example\n *    P.uniqueWith(\n *      [{a: 1}, {a: 2}, {a: 2}, {a: 5}, {a: 1}, {a: 6}, {a: 7}],\n *      P.equals,\n *    ) // => [{a: 1}, {a: 2}, {a: 5}, {a: 6}, {a: 7}]\n * @dataFirst\n * @lazy\n * @category Array\n */\nexport function uniqueWith<T extends IterableContainer>(\n  data: T,\n  isEquals: IsEquals<T[number]>,\n): Deduped<T>;\n\n/**\n * Returns a new array containing only one copy of each element in the original\n * list. Elements are compared by custom comparator isEquals.\n *\n * @param isEquals - The comparator.\n * @signature P.uniqueWith(isEquals)(array)\n * @example\n *    P.uniqueWith(P.equals)(\n *      [{a: 1}, {a: 2}, {a: 2}, {a: 5}, {a: 1}, {a: 6}, {a: 7}],\n *    ) // => [{a: 1}, {a: 2}, {a: 5}, {a: 6}, {a: 7}]\n *    P.pipe(\n *      [{a: 1}, {a: 2}, {a: 2}, {a: 5}, {a: 1}, {a: 6}, {a: 7}], // only 4 iterations\n *      P.uniqueWith(P.equals),\n *      P.take(3)\n *    ) // => [{a: 1}, {a: 2}, {a: 5}]\n * @dataLast\n * @lazy\n * @category Array\n */\nexport function uniqueWith<T extends IterableContainer>(\n  isEquals: IsEquals<T[number]>,\n): (data: T) => Deduped<T>;\n\nexport function uniqueWith(...args: ReadonlyArray<unknown>): unknown {\n  return curryFromLazy(lazyImplementation, args);\n}\n\nfunction lazyImplementation<T>(isEquals: IsEquals<T>): LazyEvaluator<T> {\n  return (value, index, data) => {\n    const firstEqualIndex = data.findIndex(\n      (otherValue, otherIndex) =>\n        index === otherIndex || isEquals(value, otherValue),\n    );\n\n    // skip items that aren't at the first equal index.\n    return firstEqualIndex === index\n      ? { done: false, hasNext: true, next: value }\n      : SKIP_ITEM;\n  };\n}\n"],"mappings":"kGAqDA,SAAgB,EAAW,GAAG,EAAuC,CACnE,OAAO,EAAc,EAAoB,EAAK,CAGhD,SAAS,EAAsB,EAAyC,CACtE,OAAQ,EAAO,EAAO,IACI,EAAK,WAC1B,EAAY,IACX,IAAU,GAAc,EAAS,EAAO,EAAW,CACtD,GAG0B,EACvB,CAAE,KAAM,GAAO,QAAS,GAAM,KAAM,EAAO,CAC3C"}

package/dist/unique.cjs

@@ -1 +1 @@
-require(`./utility-evaluators-DqJcWENu.cjs`),require(`./pipe-DlFjc4Wf.cjs`),require(`./curry-from-lazy-BDH06qZ-.cjs`);const e=require(`./unique-BMVWEHgx.cjs`);exports.unique=e.unique;
+const e=require(`./utility-evaluators-CAbODbuk.cjs`),t=require(`./curry-from-lazy-BCGvmhyS.cjs`);function n(...e){return t.t(r,e)}function r(){let t=new Set;return n=>t.has(n)?e.t:(t.add(n),{done:!1,hasNext:!0,next:n})}exports.unique=n;

package/dist/unique.d.cts

@@ -1,5 +1,39 @@
-import "./iterable-container-V5sa0V_H.cjs";
-import "./non-empty-array-D3ZRHApS.cjs";
-import "./deduped-CAglY8bF.cjs";
-import { unique } from "./unique-Dlp6H7Md.cjs";
-export { unique };
+import { t as IterableContainer } from "./iterable-container-1TN3AJ3s.cjs";
+import { t as Deduped } from "./deduped-DdwAYzXs.cjs";
+
+//#region src/unique.d.ts
+
+/**
+ * Returns a new array containing only one copy of each element in the original
+ * list. Elements are compared by reference using Set.
+ *
+ * @param data - The array to filter.
+ * @signature
+ *    P.unique(array)
+ * @example
+ *    P.unique([1, 2, 2, 5, 1, 6, 7]) // => [1, 2, 5, 6, 7]
+ * @dataFirst
+ * @lazy
+ * @category Array
+ */
+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.
+ *
+ * @signature
+ *    P.unique()(array)
+ * @example
+ *    P.pipe(
+ *      [1, 2, 2, 5, 1, 6, 7], // only 4 iterations
+ *      P.unique(),
+ *      P.take(3)
+ *    ) // => [1, 2, 5]
+ * @dataLast
+ * @lazy
+ * @category Array
+ */
+declare function unique(): <T extends IterableContainer>(data: T) => Deduped<T>;
+//#endregion
+export { unique };
+//# sourceMappingURL=unique.d.cts.map

package/dist/unique.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"unique.d.cts","names":[],"sources":["../src/unique.ts"],"sourcesContent":[],"mappings":";;;;;;;AAmBA;;;;;;AAkBA;;;;;AAA2E,iBAlB3D,MAkB2D,CAAA,UAlB1C,iBAkB0C,CAAA,CAAA,IAAA,EAlBjB,CAkBiB,CAAA,EAlBb,OAkBa,CAlBL,CAkBK,CAAA;;;;;;;;;;;;;;;;;iBAA3D,MAAA,CAAA,cAAqB,yBAAyB,MAAM,QAAQ"}

package/dist/unique.d.ts

@@ -1,5 +1,39 @@
-import "./iterable-container-F9CDF7ym.js";
-import "./non-empty-array-BfTfvDYg.js";
-import "./deduped-Dru_XVLX.js";
-import { unique } from "./unique-DQ6D857b.js";
-export { unique };
+import { t as IterableContainer } from "./iterable-container-Dv5vSKht.js";
+import { t as Deduped } from "./deduped-RY-1u-ns.js";
+
+//#region src/unique.d.ts
+
+/**
+ * Returns a new array containing only one copy of each element in the original
+ * list. Elements are compared by reference using Set.
+ *
+ * @param data - The array to filter.
+ * @signature
+ *    P.unique(array)
+ * @example
+ *    P.unique([1, 2, 2, 5, 1, 6, 7]) // => [1, 2, 5, 6, 7]
+ * @dataFirst
+ * @lazy
+ * @category Array
+ */
+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.
+ *
+ * @signature
+ *    P.unique()(array)
+ * @example
+ *    P.pipe(
+ *      [1, 2, 2, 5, 1, 6, 7], // only 4 iterations
+ *      P.unique(),
+ *      P.take(3)
+ *    ) // => [1, 2, 5]
+ * @dataLast
+ * @lazy
+ * @category Array
+ */
+declare function unique(): <T extends IterableContainer>(data: T) => Deduped<T>;
+//#endregion
+export { unique };
+//# sourceMappingURL=unique.d.ts.map

package/dist/unique.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"unique.d.ts","names":[],"sources":["../src/unique.ts"],"sourcesContent":[],"mappings":";;;;;;;AAmBA;;;;;;AAkBA;;;;;AAA2E,iBAlB3D,MAkB2D,CAAA,UAlB1C,iBAkB0C,CAAA,CAAA,IAAA,EAlBjB,CAkBiB,CAAA,EAlBb,OAkBa,CAlBL,CAkBK,CAAA;;;;;;;;;;;;;;;;;iBAA3D,MAAA,CAAA,cAAqB,yBAAyB,MAAM,QAAQ"}

package/dist/unique.js

@@ -1 +1,2 @@
-import"./utility-evaluators-CnQVdcZv.js";import"./pipe-CtsfTnqv.js";import"./curry-from-lazy-BR-hoRDR.js";import{unique as e}from"./unique-BiGTIN5e.js";export{e as unique};
+import{t as e}from"./utility-evaluators-Boc-TMbq.js";import{t}from"./curry-from-lazy-PQ0BbG-7.js";function n(...e){return t(r,e)}function r(){let t=new Set;return n=>t.has(n)?e:(t.add(n),{done:!1,hasNext:!0,next:n})}export{n as unique};
+//# sourceMappingURL=unique.js.map

package/dist/unique.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"unique.js","names":[],"sources":["../src/unique.ts"],"sourcesContent":["import type { Deduped } from './internal/types/deduped';\nimport type { IterableContainer } from './internal/types/iterable-container';\nimport type { LazyEvaluator } from './internal/types/lazy-evaluator';\nimport { curryFromLazy } from './internal/curry-from-lazy';\nimport { SKIP_ITEM } from './internal/utility-evaluators';\n\n/**\n * Returns a new array containing only one copy of each element in the original\n * list. Elements are compared by reference using Set.\n *\n * @param data - The array to filter.\n * @signature\n *    P.unique(array)\n * @example\n *    P.unique([1, 2, 2, 5, 1, 6, 7]) // => [1, 2, 5, 6, 7]\n * @dataFirst\n * @lazy\n * @category Array\n */\nexport function unique<T extends IterableContainer>(data: T): Deduped<T>;\n\n/**\n * Returns a new array containing only one copy of each element in the original\n * list. Elements are compared by reference using Set.\n *\n * @signature\n *    P.unique()(array)\n * @example\n *    P.pipe(\n *      [1, 2, 2, 5, 1, 6, 7], // only 4 iterations\n *      P.unique(),\n *      P.take(3)\n *    ) // => [1, 2, 5]\n * @dataLast\n * @lazy\n * @category Array\n */\nexport function unique(): <T extends IterableContainer>(data: T) => Deduped<T>;\n\nexport function unique(...args: ReadonlyArray<unknown>): unknown {\n  return curryFromLazy(lazyImplementation, args);\n}\n\nfunction lazyImplementation<T>(): LazyEvaluator<T> {\n  const set = new Set<T>();\n  return (value) => {\n    if (set.has(value)) {\n      return SKIP_ITEM;\n    }\n    set.add(value);\n    return { done: false, hasNext: true, next: value };\n  };\n}\n"],"mappings":"kGAuCA,SAAgB,EAAO,GAAG,EAAuC,CAC/D,OAAO,EAAc,EAAoB,EAAK,CAGhD,SAAS,GAA0C,CACjD,IAAM,EAAM,IAAI,IAChB,MAAQ,IACF,EAAI,IAAI,EAAM,CACT,GAET,EAAI,IAAI,EAAM,CACP,CAAE,KAAM,GAAO,QAAS,GAAM,KAAM,EAAO"}

package/dist/upsert-prop-0hwik6JJ.d.cts

@@ -0,0 +1,8 @@
+import { IsLiteral, IsUnion, Simplify, Writable } from "type-fest";
+
+//#region src/internal/types/upsert-prop.d.ts
+type UpsertProp<T, K extends PropertyKey, V> = Simplify<Omit<T, K> & (IsSingleLiteral<K> extends true ? Writable<Required<Record<K, V>>> : { -readonly [P in keyof T as P extends K ? P : never]: T[P] | V } & { -readonly [P in K as P extends keyof T ? never : P]?: V })>;
+type IsSingleLiteral<K> = IsLiteral<K> extends true ? (IsUnion<K> extends true ? false : true) : false;
+//#endregion
+export { UpsertProp as t };
+//# sourceMappingURL=upsert-prop-0hwik6JJ.d.cts.map

package/dist/upsert-prop-0hwik6JJ.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"upsert-prop-0hwik6JJ.d.cts","names":[],"sources":["../src/internal/types/upsert-prop.ts"],"sourcesContent":[],"mappings":";;;KAEY,wBAAwB,kBAAkB,SAEpD,KAAK,GAAG,MAEL,gBAAgB,kBAEf,SAAS,SAAS,OAAO,GAAG,+BAKN,KAAK,UAAU,IAAI,YAAY,EAAE,KAAK,GAXlE,GAAY,kBAeU,CAfc,IAeT,CAfS,SAAA,MAeO,CAfP,GAAA,KAAA,GAemB,CAfnB,IAewB,CAfxB,EAE7B,CAAA,CAAA;KAmBF,eAnBK,CAAA,CAAA,CAAA,GAoBN,SApBM,CAoBI,CApBJ,CAAA,SAAA,IAAA,GAAA,CAoBuB,OApBvB,CAoB+B,CApB/B,CAAA,SAAA,IAAA,GAAA,KAAA,GAAA,IAAA,CAAA,GAAA,KAAA"}

package/dist/upsert-prop-_NpaZwm4.d.ts

@@ -0,0 +1,8 @@
+import { IsLiteral, IsUnion, Simplify, Writable } from "type-fest";
+
+//#region src/internal/types/upsert-prop.d.ts
+type UpsertProp<T, K extends PropertyKey, V> = Simplify<Omit<T, K> & (IsSingleLiteral<K> extends true ? Writable<Required<Record<K, V>>> : { -readonly [P in keyof T as P extends K ? P : never]: T[P] | V } & { -readonly [P in K as P extends keyof T ? never : P]?: V })>;
+type IsSingleLiteral<K> = IsLiteral<K> extends true ? (IsUnion<K> extends true ? false : true) : false;
+//#endregion
+export { UpsertProp as t };
+//# sourceMappingURL=upsert-prop-_NpaZwm4.d.ts.map

package/dist/upsert-prop-_NpaZwm4.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"upsert-prop-_NpaZwm4.d.ts","names":[],"sources":["../src/internal/types/upsert-prop.ts"],"sourcesContent":[],"mappings":";;;KAEY,wBAAwB,kBAAkB,SAEpD,KAAK,GAAG,MAEL,gBAAgB,kBAEf,SAAS,SAAS,OAAO,GAAG,+BAKN,KAAK,UAAU,IAAI,YAAY,EAAE,KAAK,GAXlE,GAAY,kBAeU,CAfc,IAeT,CAfS,SAAA,MAeO,CAfP,GAAA,KAAA,GAemB,CAfnB,IAewB,CAfxB,EAE7B,CAAA,CAAA;KAmBF,eAnBK,CAAA,CAAA,CAAA,GAoBN,SApBM,CAoBI,CApBJ,CAAA,SAAA,IAAA,GAAA,CAoBuB,OApBvB,CAoB+B,CApB/B,CAAA,SAAA,IAAA,GAAA,KAAA,GAAA,IAAA,CAAA,GAAA,KAAA"}

package/dist/utility-evaluators-Boc-TMbq.js

@@ -0,0 +1,2 @@
+const e={done:!0,hasNext:!1},t={done:!1,hasNext:!1};function n(){return e}function r(e){return{hasNext:!0,next:e,done:!1}}export{n,r,t};
+//# sourceMappingURL=utility-evaluators-Boc-TMbq.js.map

package/dist/utility-evaluators-Boc-TMbq.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"utility-evaluators-Boc-TMbq.js","names":[],"sources":["../src/internal/utility-evaluators.ts"],"sourcesContent":["import type { LazyResult } from './types/lazy-result';\n\nconst EMPTY_PIPE = { done: true, hasNext: false } as const;\n\n/**\n * A singleton value for skipping an item in a lazy evaluator.\n */\nexport const SKIP_ITEM = { done: false, hasNext: false } as const;\n\n/**\n * A helper evaluator when we want to return an empty result. It memoizes both\n * the result and the evaluator itself to reduce memory usage.\n */\nexport function lazyEmptyEvaluator<T>(): LazyResult<T> {\n  return EMPTY_PIPE;\n};\n\n/**\n * A helper evaluator when we want to return a shallow clone of the input. It\n * memoizes both the evaluator itself to reduce memory usage.\n */\nexport function lazyIdentityEvaluator<T>(value: T): LazyResult<T> {\n  return ({\n    hasNext: true,\n    next: value,\n    done: false,\n  }) as const;\n}\n"],"mappings":"AAEA,MAAM,EAAa,CAAE,KAAM,GAAM,QAAS,GAAO,CAKpC,EAAY,CAAE,KAAM,GAAO,QAAS,GAAO,CAMxD,SAAgB,GAAuC,CACrD,OAAO,EAOT,SAAgB,EAAyB,EAAyB,CAChE,MAAQ,CACN,QAAS,GACT,KAAM,EACN,KAAM,GACP"}

package/dist/utility-evaluators-CAbODbuk.cjs

@@ -0,0 +1 @@
+const e={done:!0,hasNext:!1},t={done:!1,hasNext:!1};function n(){return e}function r(e){return{hasNext:!0,next:e,done:!1}}Object.defineProperty(exports,`n`,{enumerable:!0,get:function(){return n}}),Object.defineProperty(exports,`r`,{enumerable:!0,get:function(){return r}}),Object.defineProperty(exports,`t`,{enumerable:!0,get:function(){return t}});

package/dist/values.cjs

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

package/dist/values.d.cts

@@ -1,4 +1,38 @@
-import "./iterable-container-V5sa0V_H.cjs";
-import "./enumerable-string-keyed-value-of-aov5dXss.cjs";
-import { values } from "./values-Ysa_tL5c.cjs";
-export { values };
+import { t as IterableContainer } from "./iterable-container-1TN3AJ3s.cjs";
+import { t as EnumerableStringKeyedValueOf } from "./enumerable-string-keyed-value-of-icm2q60J.cjs";
+
+//#region src/values.d.ts
+type Values<T extends object> = T extends IterableContainer ? Array<T[number]> : Array<EnumerableStringKeyedValueOf<T>>;
+/**
+ * Returns a new array containing the values of the array or object.
+ *
+ * @param data - Either an array or an object.
+ * @signature
+ *    P.values(source)
+ * @example
+ *    P.values(['x', 'y', 'z']) // => ['x', 'y', 'z']
+ *    P.values({ a: 'x', b: 'y', c: 'z' }) // => ['x', 'y', 'z']
+ * @dataFirst
+ * @category Object
+ */
+declare function values<T extends object>(data: T): Values<T>;
+/**
+ * Returns a new array containing the values of the array or object.
+ *
+ * @signature
+ *    P.values()(source)
+ * @example
+ *    P.pipe(['x', 'y', 'z'], P.values()) // => ['x', 'y', 'z']
+ *    P.pipe({ a: 'x', b: 'y', c: 'z' }, P.values()) // => ['x', 'y', 'z']
+ *    P.pipe(
+ *      { a: 'x', b: 'y', c: 'z' },
+ *      P.values(),
+ *      P.first(),
+ *    ) // => 'x'
+ * @dataLast
+ * @category Object
+ */
+declare function values(): <T extends object>(data: T) => Values<T>;
+//#endregion
+export { values };
+//# sourceMappingURL=values.d.cts.map

package/dist/values.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"values.d.cts","names":[],"sources":["../src/values.ts"],"sourcesContent":[],"mappings":";;;;KAIK,2BAA2B,UAAU,oBACtC,MAAM,aACN,MAAM,6BAA6B;;AALsC;;;;;;;;;AAmB7E;;AAA0D,iBAA1C,MAA0C,CAAA,UAAA,MAAA,CAAA,CAAA,IAAA,EAAX,CAAW,CAAA,EAAP,MAAO,CAAA,CAAA,CAAA;;;AAkB1D;;;;;;;;;;;;;;iBAAgB,MAAA,CAAA,4BAAmC,MAAM,OAAO"}

package/dist/values.d.ts

@@ -1,4 +1,38 @@
-import "./iterable-container-F9CDF7ym.js";
-import "./enumerable-string-keyed-value-of-D0kMm_yz.js";
-import { values } from "./values-q2WIUOzl.js";
-export { values };
+import { t as IterableContainer } from "./iterable-container-Dv5vSKht.js";
+import { t as EnumerableStringKeyedValueOf } from "./enumerable-string-keyed-value-of-CRlVAvdp.js";
+
+//#region src/values.d.ts
+type Values<T extends object> = T extends IterableContainer ? Array<T[number]> : Array<EnumerableStringKeyedValueOf<T>>;
+/**
+ * Returns a new array containing the values of the array or object.
+ *
+ * @param data - Either an array or an object.
+ * @signature
+ *    P.values(source)
+ * @example
+ *    P.values(['x', 'y', 'z']) // => ['x', 'y', 'z']
+ *    P.values({ a: 'x', b: 'y', c: 'z' }) // => ['x', 'y', 'z']
+ * @dataFirst
+ * @category Object
+ */
+declare function values<T extends object>(data: T): Values<T>;
+/**
+ * Returns a new array containing the values of the array or object.
+ *
+ * @signature
+ *    P.values()(source)
+ * @example
+ *    P.pipe(['x', 'y', 'z'], P.values()) // => ['x', 'y', 'z']
+ *    P.pipe({ a: 'x', b: 'y', c: 'z' }, P.values()) // => ['x', 'y', 'z']
+ *    P.pipe(
+ *      { a: 'x', b: 'y', c: 'z' },
+ *      P.values(),
+ *      P.first(),
+ *    ) // => 'x'
+ * @dataLast
+ * @category Object
+ */
+declare function values(): <T extends object>(data: T) => Values<T>;
+//#endregion
+export { values };
+//# sourceMappingURL=values.d.ts.map

package/dist/values.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"values.d.ts","names":[],"sources":["../src/values.ts"],"sourcesContent":[],"mappings":";;;;KAIK,2BAA2B,UAAU,oBACtC,MAAM,aACN,MAAM,6BAA6B;;AALsC;;;;;;;;;AAmB7E;;AAA0D,iBAA1C,MAA0C,CAAA,UAAA,MAAA,CAAA,CAAA,IAAA,EAAX,CAAW,CAAA,EAAP,MAAO,CAAA,CAAA,CAAA;;;AAkB1D;;;;;;;;;;;;;;iBAAgB,MAAA,CAAA,4BAAmC,MAAM,OAAO"}

package/dist/values.js

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

package/dist/values.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"values.js","names":[],"sources":["../src/values.ts"],"sourcesContent":["import type { EnumerableStringKeyedValueOf } from './internal/types/enumerable-string-keyed-value-of';\nimport type { IterableContainer } from './internal/types/iterable-container';\nimport { curry } from './curry';\n\ntype Values<T extends object> = T extends IterableContainer\n  ? Array<T[number]>\n  : Array<EnumerableStringKeyedValueOf<T>>;\n\n/**\n * Returns a new array containing the values of the array or object.\n *\n * @param data - Either an array or an object.\n * @signature\n *    P.values(source)\n * @example\n *    P.values(['x', 'y', 'z']) // => ['x', 'y', 'z']\n *    P.values({ a: 'x', b: 'y', c: 'z' }) // => ['x', 'y', 'z']\n * @dataFirst\n * @category Object\n */\nexport function values<T extends object>(data: T): Values<T>;\n\n/**\n * Returns a new array containing the values of the array or object.\n *\n * @signature\n *    P.values()(source)\n * @example\n *    P.pipe(['x', 'y', 'z'], P.values()) // => ['x', 'y', 'z']\n *    P.pipe({ a: 'x', b: 'y', c: 'z' }, P.values()) // => ['x', 'y', 'z']\n *    P.pipe(\n *      { a: 'x', b: 'y', c: 'z' },\n *      P.values(),\n *      P.first(),\n *    ) // => 'x'\n * @dataLast\n * @category Object\n */\nexport function values(): <T extends object>(data: T) => Values<T>;\n\nexport function values(...args: ReadonlyArray<unknown>): unknown {\n  return curry(Object.values, args);\n}\n"],"mappings":"wCAwCA,SAAgB,EAAO,GAAG,EAAuC,CAC/D,OAAO,EAAM,OAAO,OAAQ,EAAK"}

package/dist/with-precision-CQ90Walk.js

@@ -0,0 +1,2 @@
+function e(e){return(t,n)=>{if(n===0)return e(t);if(!Number.isInteger(n))throw TypeError(`precision must be an integer: ${n.toString()}`);if(n>15||n<-15)throw RangeError(`precision must be between -15 and 15`);if(Number.isNaN(t)||!Number.isFinite(t))return e(t);if(n>0){let r=10**n;return e(t*r)/r}let r=10**-n;return e(t/r)*r}}export{e as t};
+//# sourceMappingURL=with-precision-CQ90Walk.js.map

package/dist/with-precision-CQ90Walk.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"with-precision-CQ90Walk.js","names":[],"sources":["../src/internal/with-precision.ts"],"sourcesContent":["/**\n * ECMAScript doesn't support more decimal places than 15,\n * so supporting higher values doesn't make a lot of sense.\n * Considering Number.MAX_SAFE_INTEGER < 10**16\n * we can also use -15 for the negative precision limit.\n */\nconst MAX_PRECISION = 15;\n\nconst RADIX = 10;\n\nexport function withPrecision(roundingFn: (value: number) => number) {\n  return (value: number, precision: number): number => {\n    if (precision === 0) {\n      return roundingFn(value);\n    }\n\n    if (!Number.isInteger(precision)) {\n      throw new TypeError(\n        `precision must be an integer: ${precision.toString()}`,\n      );\n    }\n\n    if (precision > MAX_PRECISION || precision < -MAX_PRECISION) {\n      throw new RangeError('precision must be between -15 and 15');\n    }\n\n    if (Number.isNaN(value) || !Number.isFinite(value)) {\n      return roundingFn(value);\n    }\n\n    if (precision > 0) {\n      const multiplier = RADIX ** precision;\n      return roundingFn(value * multiplier) / multiplier;\n    }\n\n    // Avoid losing precision by dividing first.\n    const divisor = RADIX ** -precision;\n    return roundingFn(value / divisor) * divisor;\n  };\n}\n"],"mappings":"AAUA,SAAgB,EAAc,EAAuC,CACnE,OAAQ,EAAe,IAA8B,CACnD,GAAI,IAAc,EAChB,OAAO,EAAW,EAAM,CAG1B,GAAI,CAAC,OAAO,UAAU,EAAU,CAC9B,MAAU,UACR,iCAAiC,EAAU,UAAU,GACtD,CAGH,GAAI,EAAY,IAAiB,EAAY,IAC3C,MAAU,WAAW,uCAAuC,CAG9D,GAAI,OAAO,MAAM,EAAM,EAAI,CAAC,OAAO,SAAS,EAAM,CAChD,OAAO,EAAW,EAAM,CAG1B,GAAI,EAAY,EAAG,CACjB,IAAM,EAAa,IAAS,EAC5B,OAAO,EAAW,EAAQ,EAAW,CAAG,EAI1C,IAAM,EAAU,IAAS,CAAC,EAC1B,OAAO,EAAW,EAAQ,EAAQ,CAAG"}

package/dist/with-precision-dQAYLrgr.cjs

@@ -0,0 +1 @@
+const e=15,t=10;function n(e){return(t,n)=>{if(n===0)return e(t);if(!Number.isInteger(n))throw TypeError(`precision must be an integer: ${n.toString()}`);if(n>15||n<-15)throw RangeError(`precision must be between -15 and 15`);if(Number.isNaN(t)||!Number.isFinite(t))return e(t);if(n>0){let r=10**n;return e(t*r)/r}let r=10**-n;return e(t/r)*r}}Object.defineProperty(exports,`t`,{enumerable:!0,get:function(){return n}});

package/dist/words-DQCM5umD.js

@@ -0,0 +1,3 @@
+const e=new Set([`-`,`_`,...`	.
+.\v.\f.\r. .….\xA0. . . . . . . . . . . . .\u2028.\u2029. . .　.`.split(`.`)]);function t(t){let n=[],r=``,i=()=>{r.length>0&&(n.push(r),r=``)};for(let n of t){if(e.has(n)){i();continue}if(/[a-z]$/u.test(r)&&/[A-Z]/u.test(n))i();else if(/[A-Z][A-Z]$/u.test(r)&&/[a-z]/u.test(n)){let e=r.slice(-1);r=r.slice(0,-1),i(),r=e}else /\d$/u.test(r)!==/\d/u.test(n)&&i();r+=n}return i(),n}export{t};
+//# sourceMappingURL=words-DQCM5umD.js.map

package/dist/words-DQCM5umD.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"words-DQCM5umD.js","names":["results: Array<string>"],"sources":["../src/internal/words.ts"],"sourcesContent":["import type { Words } from 'type-fest';\n\n// @see https://github.com/sindresorhus/type-fest/blob/main/source/internal/characters.d.ts#L5-L31\nconst WHITESPACE = [\n  '\\u{9}', // '\\t'\n  '\\u{A}', // '\\n'\n  '\\u{B}', // '\\v'\n  '\\u{C}', // '\\f'\n  '\\u{D}', // '\\r'\n  '\\u{20}', // ' '\n  '\\u{85}',\n  '\\u{A0}',\n  '\\u{1680}',\n  '\\u{2000}',\n  '\\u{2001}',\n  '\\u{2002}',\n  '\\u{2003}',\n  '\\u{2004}',\n  '\\u{2005}',\n  '\\u{2006}',\n  '\\u{2007}',\n  '\\u{2008}',\n  '\\u{2009}',\n  '\\u{200A}',\n  '\\u{2028}',\n  '\\u{2029}',\n  '\\u{202F}',\n  '\\u{205F}',\n  '\\u{3000}',\n  '\\u{FEFF}',\n] as const;\n\n// @see https://github.com/sindresorhus/type-fest/blob/main/source/internal/characters.d.ts#L33\nconst WORD_SEPARATORS = new Set(['-', '_', ...WHITESPACE]);\n\nexport function words<S extends string>(data: S): string extends S ? Array<string> : Words<S> {\n  const results: Array<string> = [];\n  let word = '';\n\n  const flush = (): void => {\n    if (word.length > 0) {\n      results.push(word);\n      word = '';\n    }\n  };\n\n  for (const character of data) {\n    if (WORD_SEPARATORS.has(character)) {\n      // Separator encountered; flush the current word & exclude the separator.\n      flush();\n      continue;\n    }\n\n    // Detect transitions:\n    // 1. Lowercase to uppercase (e.g., \"helloWorld\")\n    if (/[a-z]$/u.test(word) && /[A-Z]/u.test(character)) {\n      flush();\n    } else if (/[A-Z][A-Z]$/u.test(word) && /[a-z]/u.test(character)) {\n      // 2. Uppercase to lowercase following multiple uppercase letters (e.g., \"HELLOWorld\")\n      // When the text transitions from 2 upper case letters to a lower case\n      // letter. (one upper case letter is considered part of the word, e.g.\n      // \"Dog\").\n      const lastCharacter = word.slice(-1);\n      word = word.slice(0, -1);\n      flush();\n      word = lastCharacter;\n    } else if (/\\d$/u.test(word) !== /\\d/u.test(character)) {\n      // 3. Digit to non-digit or non-digit to digit (e.g., \"123abc\" or \"abc123\")\n      flush();\n    }\n\n    // Add the current character to the current word.\n    word += character;\n  }\n\n  // Flush any remaining word.\n  flush();\n\n  // @ts-expect-error [ts2322] -- TypeScript can't infer this type...\n  return results;\n}\n"],"mappings":"AAiCA,MAAM,EAAkB,IAAI,IAAI,CAAC,IAAK,IAAK,GA9BxB;4EA2BlB,CAGwD,CAAC,CAE1D,SAAgB,EAAwB,EAAsD,CAC5F,IAAMA,EAAyB,EAAE,CAC7B,EAAO,GAEL,MAAoB,CACpB,EAAK,OAAS,IAChB,EAAQ,KAAK,EAAK,CAClB,EAAO,KAIX,IAAK,IAAM,KAAa,EAAM,CAC5B,GAAI,EAAgB,IAAI,EAAU,CAAE,CAElC,GAAO,CACP,SAKF,GAAI,UAAU,KAAK,EAAK,EAAI,SAAS,KAAK,EAAU,CAClD,GAAO,SACE,eAAe,KAAK,EAAK,EAAI,SAAS,KAAK,EAAU,CAAE,CAKhE,IAAM,EAAgB,EAAK,MAAM,GAAG,CACpC,EAAO,EAAK,MAAM,EAAG,GAAG,CACxB,GAAO,CACP,EAAO,OACE,OAAO,KAAK,EAAK,GAAK,MAAM,KAAK,EAAU,EAEpD,GAAO,CAIT,GAAQ,EAOV,OAHA,GAAO,CAGA"}

package/dist/words-DRQKxzLU.cjs

@@ -0,0 +1,2 @@
+const e=new Set([`-`,`_`,...`	.
+.\v.\f.\r. .….\xA0. . . . . . . . . . . . .\u2028.\u2029. . .　.`.split(`.`)]);function t(t){let n=[],r=``,i=()=>{r.length>0&&(n.push(r),r=``)};for(let n of t){if(e.has(n)){i();continue}if(/[a-z]$/u.test(r)&&/[A-Z]/u.test(n))i();else if(/[A-Z][A-Z]$/u.test(r)&&/[a-z]/u.test(n)){let e=r.slice(-1);r=r.slice(0,-1),i(),r=e}else /\d$/u.test(r)!==/\d/u.test(n)&&i();r+=n}return i(),n}Object.defineProperty(exports,`t`,{enumerable:!0,get:function(){return t}});

package/dist/zip-with.cjs

@@ -1 +1 @@
-require(`./lazy-data-last-impl-3PAFkslW.cjs`);const e=require(`./zip-with-CxR_nx2Y.cjs`);exports.zipWith=e.zipWith;
+const e=require(`./lazy-data-last-impl-D4kLybyP.cjs`);function t(t,i,a){return typeof t==`function`?(e,r)=>n(e,r,t):typeof i==`function`?e.t(n,[t,i],r):n(t,i,a)}function n(e,t,n){let r=[e,t];return e.length<t.length?e.map((e,i)=>n(e,t[i],i,r)):t.map((t,i)=>n(e[i],t,i,r))}function r(e,t){return(n,r,i)=>({next:t(n,e[r],r,[i,e]),hasNext:!0,done:r>=e.length-1})}exports.zipWith=t;

package/dist/zip-with.d.cts

@@ -1,3 +1,50 @@
-import "./iterable-container-V5sa0V_H.cjs";
-import { zipWith } from "./zip-with-CYcCKziW.cjs";
-export { zipWith };
+import { t as IterableContainer } from "./iterable-container-1TN3AJ3s.cjs";
+
+//#region src/zip-with.d.ts
+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;
+/**
+ * Creates a new list from two supplied lists by calling the supplied function
+ * with the same-positioned element from each list.
+ *
+ * @param fn - The function applied to each position of the list.
+ * @signature
+ *   P.zipWith(fn)(first, second)
+ * @example
+ *   P.zipWith((a: string, b: string) => a + b)(['1', '2', '3'], ['a', 'b', 'c']) // => ['1a', '2b', '3c']
+ * @category Array
+ */
+declare function zipWith<TItem1, TItem2, Value>(fn: ZippingFunction<ReadonlyArray<TItem1>, ReadonlyArray<TItem2>, Value>): <T1 extends IterableContainer<TItem1>, T2 extends IterableContainer<TItem2>>(first: T1, second: T2) => Array<Value>;
+/**
+ * Creates a new list from two supplied lists by calling the supplied function
+ * with the same-positioned element from each list.
+ *
+ * @param second - The second input list.
+ * @param fn - The function applied to each position of the list.
+ * @signature
+ *   P.zipWith(second, fn)(first)
+ * @example
+ *   P.pipe(['1', '2', '3'], P.zipWith(['a', 'b', 'c'], (a, b) => a + b)) // => ['1a', '2b', '3c']
+ * @dataLast
+ * @lazy
+ * @category Array
+ */
+declare function zipWith<T1 extends IterableContainer, T2 extends IterableContainer, Value>(second: T2, fn: ZippingFunction<T1, T2, Value>): (first: T1) => Array<Value>;
+/**
+ * Creates a new list from two supplied lists by calling the supplied function
+ * with the same-positioned element from each list.
+ *
+ * @param first - The first input list.
+ * @param second - The second input list.
+ * @param fn - The function applied to each position of the list.
+ * @signature
+ *   P.zipWith(first, second, fn)
+ * @example
+ *   P.zipWith(['1', '2', '3'], ['a', 'b', 'c'], (a, b) => a + b) // => ['1a', '2b', '3c']
+ * @dataFirst
+ * @lazy
+ * @category Array
+ */
+declare function zipWith<T1 extends IterableContainer, T2 extends IterableContainer, Value>(first: T1, second: T2, fn: ZippingFunction<T1, T2, Value>): Array<Value>;
+//#endregion
+export { zipWith };
+//# sourceMappingURL=zip-with.d.cts.map