@vinicunca/perkakas 1.9.0 → 1.12.0

package/dist/narrowed-to-Yf5qTOcD.d.cts

@@ -0,0 +1,15 @@
+import { IsAny } from "type-fest";
+
+//#region src/internal/types/narrowed-to.d.ts
+
+/**
+ * An extension of Extract for type predicates which falls back to the base
+ * in order to narrow the `unknown` case.
+ *
+ * @example
+ *   function isMyType<T>(data: T | MyType): data is NarrowedTo<T, MyType> { ... }
+ */
+type NarrowedTo<T, Base> = Extract<T, Base> extends never ? Base : IsAny<T> extends true ? Base : Extract<T, Base>;
+//#endregion
+export { NarrowedTo as t };
+//# sourceMappingURL=narrowed-to-Yf5qTOcD.d.cts.map

package/dist/narrowed-to-Yf5qTOcD.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"narrowed-to-Yf5qTOcD.d.cts","names":[],"sources":["../src/internal/types/narrowed-to.ts"],"sourcesContent":[],"mappings":";;;;;;AASA;;;;;AAGY,KAHA,UAGA,CAAA,CAAA,EAAA,IAAA,CAAA,GAFR,OAEQ,CAFA,CAEA,EAFG,IAEH,CAAA,SAAA,KAAA,GADN,IACM,GAAN,KAAM,CAAA,CAAA,CAAA,SAAA,IAAA,GACJ,IADI,GAEJ,OAFI,CAEI,CAFJ,EAEO,IAFP,CAAA"}

package/dist/narrowed-to-j75i8Rl2.d.ts

@@ -0,0 +1,15 @@
+import { IsAny } from "type-fest";
+
+//#region src/internal/types/narrowed-to.d.ts
+
+/**
+ * An extension of Extract for type predicates which falls back to the base
+ * in order to narrow the `unknown` case.
+ *
+ * @example
+ *   function isMyType<T>(data: T | MyType): data is NarrowedTo<T, MyType> { ... }
+ */
+type NarrowedTo<T, Base> = Extract<T, Base> extends never ? Base : IsAny<T> extends true ? Base : Extract<T, Base>;
+//#endregion
+export { NarrowedTo as t };
+//# sourceMappingURL=narrowed-to-j75i8Rl2.d.ts.map

package/dist/narrowed-to-j75i8Rl2.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"narrowed-to-j75i8Rl2.d.ts","names":[],"sources":["../src/internal/types/narrowed-to.ts"],"sourcesContent":[],"mappings":";;;;;;AASA;;;;;AAGY,KAHA,UAGA,CAAA,CAAA,EAAA,IAAA,CAAA,GAFR,OAEQ,CAFA,CAEA,EAFG,IAEH,CAAA,SAAA,KAAA,GADN,IACM,GAAN,KAAM,CAAA,CAAA,CAAA,SAAA,IAAA,GACJ,IADI,GAEJ,OAFI,CAEI,CAFJ,EAEO,IAFP,CAAA"}

package/dist/no-infer-BIHbaQcD.d.ts

@@ -0,0 +1,5 @@
+//#region src/internal/types/no-infer.d.ts
+type NoInfer<T> = T extends infer U ? U : never;
+//#endregion
+export { NoInfer as t };
+//# sourceMappingURL=no-infer-BIHbaQcD.d.ts.map

package/dist/no-infer-BIHbaQcD.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"no-infer-BIHbaQcD.d.ts","names":[],"sources":["../src/internal/types/no-infer.ts"],"sourcesContent":[],"mappings":";KACY,aAAa"}

package/dist/no-infer-BVbyldno.d.cts

@@ -0,0 +1,5 @@
+//#region src/internal/types/no-infer.d.ts
+type NoInfer<T> = T extends infer U ? U : never;
+//#endregion
+export { NoInfer as t };
+//# sourceMappingURL=no-infer-BVbyldno.d.cts.map

package/dist/no-infer-BVbyldno.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"no-infer-BVbyldno.d.cts","names":[],"sources":["../src/internal/types/no-infer.ts"],"sourcesContent":[],"mappings":";KACY,aAAa"}

package/dist/non-empty-array-CFG7wGD-.d.cts

@@ -0,0 +1,5 @@
+//#region src/internal/types/non-empty-array.d.ts
+type NonEmptyArray<T> = [T, ...Array<T>];
+//#endregion
+export { NonEmptyArray as t };
+//# sourceMappingURL=non-empty-array-CFG7wGD-.d.cts.map

package/dist/non-empty-array-CFG7wGD-.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"non-empty-array-CFG7wGD-.d.cts","names":[],"sources":["../src/internal/types/non-empty-array.ts"],"sourcesContent":[],"mappings":";KAAY,oBAAoB,MAAM,MAAM"}

package/dist/non-empty-array-DXkY7ynY.d.ts

@@ -0,0 +1,5 @@
+//#region src/internal/types/non-empty-array.d.ts
+type NonEmptyArray<T> = [T, ...Array<T>];
+//#endregion
+export { NonEmptyArray as t };
+//# sourceMappingURL=non-empty-array-DXkY7ynY.d.ts.map

package/dist/non-empty-array-DXkY7ynY.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"non-empty-array-DXkY7ynY.d.ts","names":[],"sources":["../src/internal/types/non-empty-array.ts"],"sourcesContent":[],"mappings":";KAAY,oBAAoB,MAAM,MAAM"}

package/dist/nth-by-Bby4vIbZ.cjs

@@ -0,0 +1 @@
+const e=require(`./curry-order-rules-ClqHrs8_.cjs`),t=require(`./swap-in-place-BHkB_mvV.cjs`);function n(e,t,n){return t<0||t>=e.length?void 0:r([...e],0,e.length-1,t,n)}function r(e,t,n,a,o){if(t===n)return e[t];let s=i(e,t,n,o);return a===s?e[a]:r(e,a<s?t:s+1,a<s?s-1:n,a,o)}function i(e,n,r,i){let a=e[r],o=n;for(let s=n;s<r;s++)i(e[s],a)<0&&(t.t(e,o,s),o+=1);return t.t(e,o,r),o}function a(...t){return e.n(o,t)}function o(e,t,r){return n(e,r>=0?r:e.length+r,t)}Object.defineProperty(exports,`t`,{enumerable:!0,get:function(){return a}});

package/dist/nth-by-Bs6FNGL-.js

@@ -0,0 +1,2 @@
+import{n as e}from"./curry-order-rules-C6bwcUwC.js";import{t}from"./swap-in-place-COm7qHj4.js";function n(e,t,n){return t<0||t>=e.length?void 0:r([...e],0,e.length-1,t,n)}function r(e,t,n,a,o){if(t===n)return e[t];let s=i(e,t,n,o);return a===s?e[a]:r(e,a<s?t:s+1,a<s?s-1:n,a,o)}function i(e,n,r,i){let a=e[r],o=n;for(let s=n;s<r;s++)i(e[s],a)<0&&(t(e,o,s),o+=1);return t(e,o,r),o}function a(...t){return e(o,t)}function o(e,t,r){return n(e,r>=0?r:e.length+r,t)}export{a as t};
+//# sourceMappingURL=nth-by-Bs6FNGL-.js.map

package/dist/nth-by-Bs6FNGL-.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"nth-by-Bs6FNGL-.js","names":[],"sources":["../src/internal/quick-select.ts","../src/nth-by.ts"],"sourcesContent":["/**\n * A simple implementation of the *QuickSelect* algorithm.\n *\n * @see https://en.wikipedia.org/wiki/Quickselect\n */\n\nimport type { CompareFunction } from './types/compare-function';\nimport { swapInPlace } from './swap-in-place';\n\n/**\n * Perform QuickSelect on the given data. Notice that the data would be cloned\n * shallowly so that it could be mutated in-place, and then discarded once the\n * algorithm is done. This means that running this function multiple times on\n * the same array might be slower then sorting the array before.\n *\n * @param data - The data to perform the selection on.\n * @param index - The index of the item we are looking for.\n * @param compareFn - The compare function to use for sorting.\n * @returns The item at the given index, or `undefined` if the index is out-of-\n * bounds.\n */\nexport function quickSelect<T>(\n  data: ReadonlyArray<T>,\n  index: number,\n  compareFn: CompareFunction<T>,\n): T | undefined {\n  return index < 0 || index >= data.length\n  // Quickselect doesn't work with out-of-bound indices\n    ? undefined\n    : quickSelectImplementation(\n      // We need to clone the array because quickSelect mutates it in-place.\n        [...data],\n        0 /* left */,\n        data.length - 1 /* right */,\n        index,\n        compareFn,\n      );\n}\n\n/**\n * The actual implementation, called recursively.\n */\nfunction quickSelectImplementation<T>(\n  data: Array<T>,\n  left: number,\n  right: number,\n  index: number,\n  compareFn: CompareFunction<T>,\n): T {\n  if (left === right) {\n    return data[left]!;\n  }\n\n  const pivotIndex = partition(data, left, right, compareFn);\n\n  return index === pivotIndex\n    // Once a pivot is chosen it's location is final, so if it matches the\n    // index we found out item!\n    ? data[index]!\n    : quickSelectImplementation(\n        data,\n        // We continue by recursing into the partition where index would be\n        index < pivotIndex ? left : pivotIndex + 1,\n        index < pivotIndex ? pivotIndex - 1 : right,\n        index,\n        compareFn,\n      );\n}\n\nfunction partition<T>(\n  data: Array<T>,\n  left: number,\n  right: number,\n  compareFn: CompareFunction<T>,\n): number {\n  const pivot = data[right]!;\n\n  let i = left;\n  for (let j = left; j < right; j++) {\n    if (compareFn(data[j]!, pivot) < 0) {\n      // Move items smaller then the pivot to the start of the array.\n      swapInPlace(data, i, j);\n      i += 1;\n    }\n  }\n\n  swapInPlace(data, i, right);\n\n  // The location of the pivot by the end of the partition function.\n  return i;\n}\n","import type { OrderRule } from './internal/curry-order-rules';\nimport type { CompareFunction } from './internal/types/compare-function';\nimport type { IterableContainer } from './internal/types/iterable-container';\nimport type { NonEmptyArray } from './internal/types/non-empty-array';\nimport {\n  curryOrderRulesWithArgument,\n\n} from './internal/curry-order-rules';\nimport { quickSelect } from './internal/quick-select';\n\n/**\n * Retrieves the element that would be at the given index if the array were sorted according to specified rules. This function uses the *QuickSelect* algorithm running at an average complexity of *O(n)*. Semantically it is equivalent to `sortBy(data, ...rules).at(index)` which would run at *O(nlogn)*.\n *\n * See also `firstBy` which provides an even more efficient algorithm and a stricter return type, but only for `index === 0`. See `takeFirstBy` to get all the elements up to and including `index`.\n *\n * @param data - The input array.\n * @param index - The zero-based index for selecting the element in the sorted order. Negative indices count backwards from the end.\n * @param rules - A variadic array of order rules defining the sorting criteria. Each order rule is a projection function that extracts a comparable value from the data. Sorting is based on these extracted values using the native `<` and `>` operators. Earlier rules take precedence over later ones. Use the syntax `[projection, \"desc\"]` for descending order.\n * @returns The element at the specified index in the sorted order, or `undefined` if the index is out of bounds.\n * @signature\n *   P.nthBy(data, index, ...rules);\n * @example\n *   P.nthBy([2,1,4,5,3,], 2, identity()); // => 3\n * @dataFirst\n * @category Array\n */\nexport function nthBy<T extends IterableContainer>(\n  data: T,\n  index: number,\n  ...rules: Readonly<NonEmptyArray<OrderRule<T[number]>>>\n): T[number] | undefined;\n\n/**\n * Retrieves the element that would be at the given index if the array were sorted according to specified rules. This function uses the *QuickSelect* algorithm running at an average complexity of *O(n)*. Semantically it is equivalent to `sortBy(data, ...rules)[index]` which would run at *O(nlogn)*.\n *\n * See also `firstBy` which provides an even more efficient algorithm and a stricter return type, but only for `index === 0`. See `takeFirstBy` to get all the elements up to and including `index`.\n *\n * @param index - The zero-based index for selecting the element in the sorted order. Negative indices count backwards from the end.\n * @param rules - A variadic array of order rules defining the sorting criteria. Each order rule is a projection function that extracts a comparable value from the data. Sorting is based on these extracted values using the native `<` and `>` operators. Earlier rules take precedence over later ones. Use the syntax `[projection, \"desc\"]` for descending order.\n * @returns The element at the specified index in the sorted order, or `undefined` if the index is out of bounds.\n * @signature\n *   P.nthBy(index, ...rules)(data);\n * @example\n *   P.pipe([2,1,4,5,3,], P.nthBy(2, identity())); // => 3\n * @dataLast\n * @category Array\n */\nexport function nthBy<T extends IterableContainer>(\n  index: number,\n  ...rules: Readonly<NonEmptyArray<OrderRule<T[number]>>>\n): (data: T) => T[number] | undefined;\n\nexport function nthBy(...args: ReadonlyArray<unknown>): unknown {\n  return curryOrderRulesWithArgument(nthByImplementation, args);\n}\n\nfunction nthByImplementation<T>(\n  data: ReadonlyArray<T>,\n  compareFn: CompareFunction<T>,\n  index: number,\n): T | undefined {\n  return quickSelect(\n    data,\n    // Allow negative indices gracefully\n    index >= 0 ? index : data.length + index,\n    compareFn,\n  );\n}\n"],"mappings":"+FAqBA,SAAgB,EACd,EACA,EACA,EACe,CACf,OAAO,EAAQ,GAAK,GAAS,EAAK,OAE9B,IAAA,GACA,EAEE,CAAC,GAAG,EAAK,CACT,EACA,EAAK,OAAS,EACd,EACA,EACD,CAMP,SAAS,EACP,EACA,EACA,EACA,EACA,EACG,CACH,GAAI,IAAS,EACX,OAAO,EAAK,GAGd,IAAM,EAAa,EAAU,EAAM,EAAM,EAAO,EAAU,CAE1D,OAAO,IAAU,EAGb,EAAK,GACL,EACE,EAEA,EAAQ,EAAa,EAAO,EAAa,EACzC,EAAQ,EAAa,EAAa,EAAI,EACtC,EACA,EACD,CAGP,SAAS,EACP,EACA,EACA,EACA,EACQ,CACR,IAAM,EAAQ,EAAK,GAEf,EAAI,EACR,IAAK,IAAI,EAAI,EAAM,EAAI,EAAO,IACxB,EAAU,EAAK,GAAK,EAAM,CAAG,IAE/B,EAAY,EAAM,EAAG,EAAE,CACvB,GAAK,GAOT,OAHA,EAAY,EAAM,EAAG,EAAM,CAGpB,ECrCT,SAAgB,EAAM,GAAG,EAAuC,CAC9D,OAAO,EAA4B,EAAqB,EAAK,CAG/D,SAAS,EACP,EACA,EACA,EACe,CACf,OAAO,EACL,EAEA,GAAS,EAAI,EAAQ,EAAK,OAAS,EACnC,EACD"}

package/dist/nth-by.cjs

@@ -1 +1 @@
-require(`./curry-order-rules-UcuuWkKd.cjs`),require(`./swap-in-place-CJrU2n1_.cjs`);const e=require(`./nth-by-BZiAVAjT.cjs`);exports.nthBy=e.nthBy;
+const e=require(`./nth-by-Bby4vIbZ.cjs`);exports.nthBy=e.t;

package/dist/nth-by.d.cts

@@ -1,5 +1,42 @@
-import "./iterable-container-V5sa0V_H.cjs";
-import "./non-empty-array-D3ZRHApS.cjs";
-import "./curry-order-rules-1zjlAgqa.cjs";
-import { nthBy } from "./nth-by-CK-aOfcg.cjs";
-export { nthBy };
+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";
+
+//#region src/nth-by.d.ts
+
+/**
+ * Retrieves the element that would be at the given index if the array were sorted according to specified rules. This function uses the *QuickSelect* algorithm running at an average complexity of *O(n)*. Semantically it is equivalent to `sortBy(data, ...rules).at(index)` which would run at *O(nlogn)*.
+ *
+ * See also `firstBy` which provides an even more efficient algorithm and a stricter return type, but only for `index === 0`. See `takeFirstBy` to get all the elements up to and including `index`.
+ *
+ * @param data - The input array.
+ * @param index - The zero-based index for selecting the element in the sorted order. Negative indices count backwards from the end.
+ * @param rules - A variadic array of order rules defining the sorting criteria. Each order rule is a projection function that extracts a comparable value from the data. Sorting is based on these extracted values using the native `<` and `>` operators. Earlier rules take precedence over later ones. Use the syntax `[projection, "desc"]` for descending order.
+ * @returns The element at the specified index in the sorted order, or `undefined` if the index is out of bounds.
+ * @signature
+ *   P.nthBy(data, index, ...rules);
+ * @example
+ *   P.nthBy([2,1,4,5,3,], 2, identity()); // => 3
+ * @dataFirst
+ * @category Array
+ */
+declare function nthBy<T extends IterableContainer>(data: T, index: number, ...rules: Readonly<NonEmptyArray<OrderRule<T[number]>>>): T[number] | undefined;
+/**
+ * Retrieves the element that would be at the given index if the array were sorted according to specified rules. This function uses the *QuickSelect* algorithm running at an average complexity of *O(n)*. Semantically it is equivalent to `sortBy(data, ...rules)[index]` which would run at *O(nlogn)*.
+ *
+ * See also `firstBy` which provides an even more efficient algorithm and a stricter return type, but only for `index === 0`. See `takeFirstBy` to get all the elements up to and including `index`.
+ *
+ * @param index - The zero-based index for selecting the element in the sorted order. Negative indices count backwards from the end.
+ * @param rules - A variadic array of order rules defining the sorting criteria. Each order rule is a projection function that extracts a comparable value from the data. Sorting is based on these extracted values using the native `<` and `>` operators. Earlier rules take precedence over later ones. Use the syntax `[projection, "desc"]` for descending order.
+ * @returns The element at the specified index in the sorted order, or `undefined` if the index is out of bounds.
+ * @signature
+ *   P.nthBy(index, ...rules)(data);
+ * @example
+ *   P.pipe([2,1,4,5,3,], P.nthBy(2, identity())); // => 3
+ * @dataLast
+ * @category Array
+ */
+declare function nthBy<T extends IterableContainer>(index: number, ...rules: Readonly<NonEmptyArray<OrderRule<T[number]>>>): (data: T) => T[number] | undefined;
+//#endregion
+export { nthBy };
+//# sourceMappingURL=nth-by.d.cts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"nth-by.d.cts","names":[],"sources":["../src/nth-by.ts"],"sourcesContent":[],"mappings":";;;;;;;;AA0BA;;;;;;;;;AAqBA;;;;;AAEY,iBAvBI,KAuBJ,CAAA,UAvBoB,iBAuBpB,CAAA,CAAA,IAAA,EAtBJ,CAsBI,EAAA,KAAA,EAAA,MAAA,EAAA,GAAA,KAAA,EApBA,QAoBA,CApBS,aAoBT,CApBuB,SAoBvB,CApBiC,CAoBjC,CAAA,MAAA,CAAA,CAAA,CAAA,CAAA,CAAA,EAnBT,CAmBS,CAAA,MAAA,CAAA,GAAA,SAAA;;;;;;;;;;;;;;;;iBAFI,gBAAgB,4CAEpB,SAAS,cAAc,UAAU,sBACnC,MAAM"}

package/dist/nth-by.d.ts

@@ -1,5 +1,42 @@
-import "./iterable-container-F9CDF7ym.js";
-import "./non-empty-array-BfTfvDYg.js";
-import "./curry-order-rules-D2zI7gpB.js";
-import { nthBy } from "./nth-by-CebpSYpY.js";
-export { nthBy };
+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";
+
+//#region src/nth-by.d.ts
+
+/**
+ * Retrieves the element that would be at the given index if the array were sorted according to specified rules. This function uses the *QuickSelect* algorithm running at an average complexity of *O(n)*. Semantically it is equivalent to `sortBy(data, ...rules).at(index)` which would run at *O(nlogn)*.
+ *
+ * See also `firstBy` which provides an even more efficient algorithm and a stricter return type, but only for `index === 0`. See `takeFirstBy` to get all the elements up to and including `index`.
+ *
+ * @param data - The input array.
+ * @param index - The zero-based index for selecting the element in the sorted order. Negative indices count backwards from the end.
+ * @param rules - A variadic array of order rules defining the sorting criteria. Each order rule is a projection function that extracts a comparable value from the data. Sorting is based on these extracted values using the native `<` and `>` operators. Earlier rules take precedence over later ones. Use the syntax `[projection, "desc"]` for descending order.
+ * @returns The element at the specified index in the sorted order, or `undefined` if the index is out of bounds.
+ * @signature
+ *   P.nthBy(data, index, ...rules);
+ * @example
+ *   P.nthBy([2,1,4,5,3,], 2, identity()); // => 3
+ * @dataFirst
+ * @category Array
+ */
+declare function nthBy<T extends IterableContainer>(data: T, index: number, ...rules: Readonly<NonEmptyArray<OrderRule<T[number]>>>): T[number] | undefined;
+/**
+ * Retrieves the element that would be at the given index if the array were sorted according to specified rules. This function uses the *QuickSelect* algorithm running at an average complexity of *O(n)*. Semantically it is equivalent to `sortBy(data, ...rules)[index]` which would run at *O(nlogn)*.
+ *
+ * See also `firstBy` which provides an even more efficient algorithm and a stricter return type, but only for `index === 0`. See `takeFirstBy` to get all the elements up to and including `index`.
+ *
+ * @param index - The zero-based index for selecting the element in the sorted order. Negative indices count backwards from the end.
+ * @param rules - A variadic array of order rules defining the sorting criteria. Each order rule is a projection function that extracts a comparable value from the data. Sorting is based on these extracted values using the native `<` and `>` operators. Earlier rules take precedence over later ones. Use the syntax `[projection, "desc"]` for descending order.
+ * @returns The element at the specified index in the sorted order, or `undefined` if the index is out of bounds.
+ * @signature
+ *   P.nthBy(index, ...rules)(data);
+ * @example
+ *   P.pipe([2,1,4,5,3,], P.nthBy(2, identity())); // => 3
+ * @dataLast
+ * @category Array
+ */
+declare function nthBy<T extends IterableContainer>(index: number, ...rules: Readonly<NonEmptyArray<OrderRule<T[number]>>>): (data: T) => T[number] | undefined;
+//#endregion
+export { nthBy };
+//# sourceMappingURL=nth-by.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"nth-by.d.ts","names":[],"sources":["../src/nth-by.ts"],"sourcesContent":[],"mappings":";;;;;;;;AA0BA;;;;;;;;;AAqBA;;;;;AAEY,iBAvBI,KAuBJ,CAAA,UAvBoB,iBAuBpB,CAAA,CAAA,IAAA,EAtBJ,CAsBI,EAAA,KAAA,EAAA,MAAA,EAAA,GAAA,KAAA,EApBA,QAoBA,CApBS,aAoBT,CApBuB,SAoBvB,CApBiC,CAoBjC,CAAA,MAAA,CAAA,CAAA,CAAA,CAAA,CAAA,EAnBT,CAmBS,CAAA,MAAA,CAAA,GAAA,SAAA;;;;;;;;;;;;;;;;iBAFI,gBAAgB,4CAEpB,SAAS,cAAc,UAAU,sBACnC,MAAM"}

package/dist/nth-by.js

@@ -1 +1 @@
-import"./curry-order-rules-BuA7D1F4.js";import"./swap-in-place-BBqaxzzG.js";import{nthBy as e}from"./nth-by-Ol9Thsua.js";export{e as nthBy};
+import{t as e}from"./nth-by-Bs6FNGL-.js";export{e as nthBy};

package/dist/obj-of.cjs

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

package/dist/obj-of.d.cts

@@ -1,2 +1,27 @@
-import { objOf } from "./obj-of-CWMITxro.cjs";
-export { objOf };
+//#region src/obj-of.d.ts
+/**
+ * Creates an object containing a single `key:value` pair.
+ *
+ * @param value - The object value.
+ * @param key - The property name.
+ * @signature
+ *    P.objOf(value, key)
+ * @example
+ *    P.objOf(10, 'a') // => { a: 10 }
+ * @category Object
+ */
+declare function objOf<T, K extends string>(value: T, key: K): { [x in K]: T };
+/**
+ * Creates an object containing a single `key:value` pair.
+ *
+ * @param key - The property name.
+ * @signature
+ *    P.objOf(key)(value)
+ * @example
+ *    P.pipe(10, P.objOf('a')) // => { a: 10 }
+ * @category Object
+ */
+declare function objOf<T, K extends string>(key: K): (value: T) => { [x in K]: T };
+//#endregion
+export { objOf };
+//# sourceMappingURL=obj-of.d.cts.map

package/dist/obj-of.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"obj-of.d.cts","names":[],"sources":["../src/obj-of.ts"],"sourcesContent":[],"mappings":";;AAaA;;;;;;AAYA;;;;AAE6B,iBAdb,KAca,CAAA,CAAA,EAAA,UAAA,MAAA,CAAA,CAAA,KAAA,EAdqB,CAcrB,EAAA,GAAA,EAd6B,CAc7B,CAAA,EAAA,QAdyC,CAcxC,GAd4C,CAc5C;;;;;;;;;;;iBAFd,gCACT,YACI,cAAc,IAAI"}

package/dist/obj-of.d.ts

@@ -1,2 +1,27 @@
-import { objOf } from "./obj-of-D8oOjocO.js";
-export { objOf };
+//#region src/obj-of.d.ts
+/**
+ * Creates an object containing a single `key:value` pair.
+ *
+ * @param value - The object value.
+ * @param key - The property name.
+ * @signature
+ *    P.objOf(value, key)
+ * @example
+ *    P.objOf(10, 'a') // => { a: 10 }
+ * @category Object
+ */
+declare function objOf<T, K extends string>(value: T, key: K): { [x in K]: T };
+/**
+ * Creates an object containing a single `key:value` pair.
+ *
+ * @param key - The property name.
+ * @signature
+ *    P.objOf(key)(value)
+ * @example
+ *    P.pipe(10, P.objOf('a')) // => { a: 10 }
+ * @category Object
+ */
+declare function objOf<T, K extends string>(key: K): (value: T) => { [x in K]: T };
+//#endregion
+export { objOf };
+//# sourceMappingURL=obj-of.d.ts.map

package/dist/obj-of.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"obj-of.d.ts","names":[],"sources":["../src/obj-of.ts"],"sourcesContent":[],"mappings":";;AAaA;;;;;;AAYA;;;;AAE6B,iBAdb,KAca,CAAA,CAAA,EAAA,UAAA,MAAA,CAAA,CAAA,KAAA,EAdqB,CAcrB,EAAA,GAAA,EAd6B,CAc7B,CAAA,EAAA,QAdyC,CAcxC,GAd4C,CAc5C;;;;;;;;;;;iBAFd,gCACT,YACI,cAAc,IAAI"}

package/dist/obj-of.js

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

package/dist/obj-of.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"obj-of.js","names":[],"sources":["../src/obj-of.ts"],"sourcesContent":["import { curry } from './curry';\n\n/**\n * Creates an object containing a single `key:value` pair.\n *\n * @param value - The object value.\n * @param key - The property name.\n * @signature\n *    P.objOf(value, key)\n * @example\n *    P.objOf(10, 'a') // => { a: 10 }\n * @category Object\n */\nexport function objOf<T, K extends string>(value: T, key: K): { [x in K]: T };\n\n/**\n * Creates an object containing a single `key:value` pair.\n *\n * @param key - The property name.\n * @signature\n *    P.objOf(key)(value)\n * @example\n *    P.pipe(10, P.objOf('a')) // => { a: 10 }\n * @category Object\n */\nexport function objOf<T, K extends string>(\n  key: K,\n): (value: T) => { [x in K]: T };\n\nexport function objOf(...args: ReadonlyArray<unknown>): unknown {\n  return curry(objOfImplementation, args);\n}\n\nfunction objOfImplementation<T, K extends string>(\n  value: T,\n  key: K,\n): { [x in K]: T } {\n  // @ts-expect-error [ts2322] - I'm not sure how to get the type right here...\n  return ({ [key]: value });\n}\n"],"mappings":"wCA6BA,SAAgB,EAAM,GAAG,EAAuC,CAC9D,OAAO,EAAM,EAAqB,EAAK,CAGzC,SAAS,EACP,EACA,EACiB,CAEjB,MAAQ,EAAG,GAAM,EAAO"}

package/dist/omit-by.cjs

@@ -1 +1 @@
-require(`./lazy-data-last-impl-3PAFkslW.cjs`),require(`./curry-BPVIsvo3.cjs`);const e=require(`./omit-by-DO-qeqAW.cjs`);exports.omitBy=e.omitBy;
+const e=require(`./curry-BsY0Z8jH.cjs`);function t(...t){return e.t(n,t)}function n(e,t){let n={...e};for(let[r,i]of Object.entries(n))t(i,r,e)&&delete n[r];return n}exports.omitBy=t;

package/dist/omit-by.d.cts

@@ -1,6 +1,52 @@
-import "./is-bounded-record-kpsb1wQA.cjs";
-import "./to-string-gK5yUyfp.cjs";
-import "./enumerable-string-key-of-D2OpyD6n.cjs";
-import "./enumerable-string-keyed-value-of-aov5dXss.cjs";
-import { omitBy } from "./omit-by-DXSSUFwz.cjs";
-export { omitBy };
+import { t as IsBoundedRecord } from "./is-bounded-record-D9YK_OC8.cjs";
+import { t as EnumerableStringKeyOf } from "./enumerable-string-key-of-FUg082M_.cjs";
+import { t as EnumerableStringKeyedValueOf } from "./enumerable-string-keyed-value-of-CEclDoqe.cjs";
+import { IsNever, Or, Simplify } from "type-fest";
+
+//#region src/omit-by.d.ts
+type PickSymbolKeys<T extends object> = { -readonly [P in keyof T as P extends symbol ? P : never]: T[P] };
+type PartialEnumerableKeys<T extends object> = T extends unknown ? Simplify<IsBoundedRecord<T> extends true ? PickSymbolKeys<T> & { -readonly [P in keyof T as P extends symbol ? never : P]?: Required<T>[P] } : Record<EnumerableStringKeyOf<T>, EnumerableStringKeyedValueOf<T>>> : never;
+type PartialEnumerableKeysNarrowed<T extends object, S> = Simplify<ExactProps<T, S> & PartialProps<T, S> & PickSymbolKeys<T>>;
+type ExactProps<T, S> = { -readonly [P in keyof T as IsExactProp<T, P, S> extends true ? P : never]: Exclude<T[P], S> };
+type PartialProps<T, S> = { -readonly [P in keyof T as IsPartialProp<T, P, S> extends true ? P : never]?: Exclude<T[P], S> };
+type IsExactProp<T, P$1 extends keyof T, S> = P$1 extends symbol ? false : T[P$1] extends Exclude<T[P$1], S> ? S extends T[P$1] ? false : true : false;
+type IsPartialProp<T, P$1 extends keyof T, S> = P$1 extends symbol ? false : Or<IsExactProp<T, P$1, S>, IsNever<Exclude<Required<T>[P$1], S>>> extends true ? false : true;
+/**
+ * Creates a shallow copy of the data, and then removes any keys that the
+ * predicate rejects. Symbol keys are not passed to the predicate and would be
+ * passed through to the output as-is.
+ *
+ * See `pickBy` for a complementary function which starts with an empty object
+ * and adds the entries that the predicate accepts. Because it is additive,
+ * symbol keys will not be passed through to the output object.
+ *
+ * @param data - The target object.
+ * @param predicate - A function that takes the value, key, and the data itself
+ * and returns `true` if the entry shouldn't be part of the output object, or
+ * `false` to keep it. If the function is a type-guard on the value the output
+ * type would be narrowed accordingly.
+ * @returns A shallow copy of the input object with the rejected entries
+ * removed.
+ * @signature P.omitBy(data, predicate)
+ * @example
+ *    P.omitBy({a: 1, b: 2, A: 3, B: 4}, (val, key) => key.toUpperCase() === key) // => {a: 1, b: 2}
+ * @dataFirst
+ * @category Object
+ */
+declare function omitBy<T extends object, S extends EnumerableStringKeyedValueOf<T>>(data: T, predicate: (value: EnumerableStringKeyedValueOf<T>, key: EnumerableStringKeyOf<T>, data: T) => value is S): PartialEnumerableKeysNarrowed<T, S>;
+declare function omitBy<T extends object>(data: T, predicate: (value: EnumerableStringKeyedValueOf<T>, key: EnumerableStringKeyOf<T>, data: T) => boolean): PartialEnumerableKeys<T>;
+/**
+ * Returns a partial copy of an object omitting the keys matching predicate.
+ *
+ * @param predicate - The predicate.
+ * @signature P.omitBy(fn)(object)
+ * @example
+ *    P.omitBy((val, key) => key.toUpperCase() === key)({a: 1, b: 2, A: 3, B: 4}) // => {a: 1, b: 2}
+ * @dataLast
+ * @category Object
+ */
+declare function omitBy<T extends object, S extends EnumerableStringKeyedValueOf<T>>(predicate: (value: EnumerableStringKeyedValueOf<T>, key: EnumerableStringKeyOf<T>, data: T) => value is S): (data: T) => PartialEnumerableKeysNarrowed<T, S>;
+declare function omitBy<T extends object>(predicate: (value: EnumerableStringKeyedValueOf<T>, key: EnumerableStringKeyOf<T>, data: T) => boolean): (data: T) => PartialEnumerableKeys<T>;
+//#endregion
+export { omitBy };
+//# sourceMappingURL=omit-by.d.cts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"omit-by.d.cts","names":[],"sources":["../src/omit-by.ts"],"sourcesContent":[],"mappings":";;;;;;KAUK,2DACmB,KAAK,mBAAmB,YAAY,EAAE,IARY;KAerE,qBAPmB,CAAA,UAAA,MAAA,CAAA,GAUpB,CAVoB,SAAA,OAAA,GAWlB,QAXkB,CAYhB,eAZgB,CAYA,CAZA,CAAA,SAAA,IAAA,GAYkB,cAZlB,CAYiC,CAZjC,CAAA,GAAA,kBAAK,MAaG,CAbH,IAaQ,CAbR,SAAA,MAAA,GAAA,KAAA,GAef,CAfe,IAeV,QAfU,CAeD,CAfC,CAAA,CAeE,CAfF,CAAA,EAAmB,GAmBpC,MAnBoC,CAmB7B,qBAnB6B,CAmBP,CAnBO,CAAA,EAmBH,4BAnBG,CAmB0B,CAnB1B,CAAA,CAAA,CAAA,GAAA,KAAA;KAiC3C,6BAjCuD,CAAA,UAAA,MAAA,EAAA,CAAA,CAAA,GAiCF,QAjCE,CAkC1D,UAlC0D,CAkC/C,CAlC+C,EAkC5C,CAlC4C,CAAA,GAkCvC,YAlCuC,CAkC1B,CAlC0B,EAkCvB,CAlCuB,CAAA,GAkClB,cAlCkB,CAkCH,CAlCG,CAAA,CAAA;KAsCvD,UAtCyD,CAAA,CAAA,EAAA,CAAA,CAAA,GAAA,kBAAC,MAuCvC,CAvCuC,IAuClC,WAvCkC,CAuCtB,CAvCsB,EAuCnB,CAvCmB,EAuChB,CAvCgB,CAAA,SAAA,IAAA,GAwCzD,CAxCyD,GAAA,KAAA,GAyCjD,OAzCiD,CAyCzC,CAzCyC,CAyCvC,CAzCuC,CAAA,EAyCnC,CAzCmC,CAAA,EAAA;KA8C1D,YApCD,CAAA,CAAA,EAAA,CAAA,CAAA,GAAA,kBAEoB,MAmCA,CAnCA,IAmCK,aAnCL,CAmCmB,CAnCnB,EAmCsB,CAnCtB,EAmCyB,CAnCzB,CAAA,SAAA,IAAA,GAoClB,CApCkB,GAAA,KAAA,IAqCT,OArCS,CAqCD,CArCC,CAqCC,CArCD,CAAA,EAqCK,CArCL,CAAA,EAAhB;KA2CH,WA3CoD,CAAA,CAAA,EAAA,YAAA,MA2CrB,CA3CqB,EAAA,CAAA,CAAA,GA2Cb,GA3Ca,SAAA,MAAA,GAAA,KAAA,GA8CrD,CA9CqD,CA8CnD,GA9CmD,CAAA,SA8CxC,OA9CwC,CA8ChC,CA9CgC,CA8C9B,GA9C8B,CAAA,EA8C1B,CA9C0B,CAAA,GA+CnD,CA/CmD,SA+CzC,CA/CyC,CA+CvC,GA/CuC,CAAA,GAAA,KAAA,GAAA,IAAA,GAAA,KAAA;KA6DpD,aA7DqC,CAAA,CAAA,EAAA,YAAA,MA6DJ,CA7DI,EAAA,CAAA,CAAA,GA6DI,GA7DJ,SAAA,MAAA,GAAA,KAAA,GAgEtC,EAhEsC,CAgEnC,WAhEmC,CAgEvB,CAhEuB,EAgEpB,GAhEoB,EAgEjB,CAhEiB,CAAA,EAgEb,OAhEa,CAgEL,OAhEK,CAgEG,QAhEH,CAgEY,CAhEZ,CAAA,CAgEe,GAhEf,CAAA,EAgEmB,CAhEnB,CAAA,CAAA,CAAA,SAAA,IAAA,GAAA,KAAA,GAAA,IAAA;;;;;;;;;;;;;;AAD5B;;;;;;;;;AAsB4C,iBAqE1C,MArE0C,CAAA,UAAA,MAAA,EAAA,UAuE9C,4BAvE8C,CAuEjB,CAvEiB,CAAA,CAAA,CAAA,IAAA,EAyElD,CAzEkD,EAAA,SAAA,EAAA,CAAA,KAAA,EA2E/C,4BA3E+C,CA2ElB,CA3EkB,CAAA,EAAA,GAAA,EA4EjD,qBA5EiD,CA4E3B,CA5E2B,CAAA,EAAA,IAAA,EA6EhD,CA7EgD,EAAA,GAAA,KAAA,IA8E1C,CA9E0C,CAAA,EA+EvD,6BA/EuD,CA+EzB,CA/EyB,EA+EtB,CA/EsB,CAAA;AAAQ,iBAgFlD,MAhFkD,CAAA,UAAA,MAAA,CAAA,CAAA,IAAA,EAiF1D,CAjF0D,EAAA,SAAA,EAAA,CAAA,KAAA,EAmFvD,4BAnFuD,CAmF1B,CAnF0B,CAAA,EAAA,GAAA,EAoFzD,qBApFyD,CAoFnC,CApFmC,CAAA,EAAA,IAAA,EAqFxD,CArFwD,EAAA,GAAA,OAAA,CAAA,EAuF/D,qBAvF+D,CAuFzC,CAvFyC,CAAA;AAAA;;;;;;;;;;AAQpD,iBA2FE,MA3FF,CAAA,UAAA,MAAA,EAAA,UA6FF,4BA7FE,CA6F2B,CA7F3B,CAAA,CAAA,CAAA,SAAA,EAAA,CAAA,KAAA,EAgGH,4BAhGG,CAgG0B,CAhG1B,CAAA,EAAA,GAAA,EAiGL,qBAjGK,CAiGiB,CAjGjB,CAAA,EAAA,IAAA,EAkGJ,CAlGI,EAAA,GAAA,KAAA,IAmGE,CAnGF,CAAA,EAAA,CAAA,IAAA,EAoGJ,CApGI,EAAA,GAoGE,6BApGF,CAoGgC,CApGhC,EAoGmC,CApGnC,CAAA;AAAO,iBAqGL,MArGK,CAAA,UAAA,MAAA,CAAA,CAAA,SAAA,EAAA,CAAA,KAAA,EAuGV,4BAvGU,CAuGmB,CAvGnB,CAAA,EAAA,GAAA,EAwGZ,qBAxGY,CAwGU,CAxGV,CAAA,EAAA,IAAA,EAyGX,CAzGW,EAAA,GAAA,OAAA,CAAA,EAAA,CAAA,IAAA,EA2GX,CA3GW,EAAA,GA2GL,qBA3GK,CA2GiB,CA3GjB,CAAA"}

package/dist/omit-by.d.ts

@@ -1,6 +1,52 @@
-import "./is-bounded-record-DEQ2a3_Y.js";
-import "./to-string-B9YWszXY.js";
-import "./enumerable-string-key-of-nnI9DYHk.js";
-import "./enumerable-string-keyed-value-of-D0kMm_yz.js";
-import { omitBy } from "./omit-by-DTipg3uJ.js";
-export { omitBy };
+import { t as IsBoundedRecord } from "./is-bounded-record-BGclJjRX.js";
+import { t as EnumerableStringKeyOf } from "./enumerable-string-key-of-DMAkBhMk.js";
+import { t as EnumerableStringKeyedValueOf } from "./enumerable-string-keyed-value-of-B2F2aTB7.js";
+import { IsNever, Or, Simplify } from "type-fest";
+
+//#region src/omit-by.d.ts
+type PickSymbolKeys<T extends object> = { -readonly [P in keyof T as P extends symbol ? P : never]: T[P] };
+type PartialEnumerableKeys<T extends object> = T extends unknown ? Simplify<IsBoundedRecord<T> extends true ? PickSymbolKeys<T> & { -readonly [P in keyof T as P extends symbol ? never : P]?: Required<T>[P] } : Record<EnumerableStringKeyOf<T>, EnumerableStringKeyedValueOf<T>>> : never;
+type PartialEnumerableKeysNarrowed<T extends object, S> = Simplify<ExactProps<T, S> & PartialProps<T, S> & PickSymbolKeys<T>>;
+type ExactProps<T, S> = { -readonly [P in keyof T as IsExactProp<T, P, S> extends true ? P : never]: Exclude<T[P], S> };
+type PartialProps<T, S> = { -readonly [P in keyof T as IsPartialProp<T, P, S> extends true ? P : never]?: Exclude<T[P], S> };
+type IsExactProp<T, P$1 extends keyof T, S> = P$1 extends symbol ? false : T[P$1] extends Exclude<T[P$1], S> ? S extends T[P$1] ? false : true : false;
+type IsPartialProp<T, P$1 extends keyof T, S> = P$1 extends symbol ? false : Or<IsExactProp<T, P$1, S>, IsNever<Exclude<Required<T>[P$1], S>>> extends true ? false : true;
+/**
+ * Creates a shallow copy of the data, and then removes any keys that the
+ * predicate rejects. Symbol keys are not passed to the predicate and would be
+ * passed through to the output as-is.
+ *
+ * See `pickBy` for a complementary function which starts with an empty object
+ * and adds the entries that the predicate accepts. Because it is additive,
+ * symbol keys will not be passed through to the output object.
+ *
+ * @param data - The target object.
+ * @param predicate - A function that takes the value, key, and the data itself
+ * and returns `true` if the entry shouldn't be part of the output object, or
+ * `false` to keep it. If the function is a type-guard on the value the output
+ * type would be narrowed accordingly.
+ * @returns A shallow copy of the input object with the rejected entries
+ * removed.
+ * @signature P.omitBy(data, predicate)
+ * @example
+ *    P.omitBy({a: 1, b: 2, A: 3, B: 4}, (val, key) => key.toUpperCase() === key) // => {a: 1, b: 2}
+ * @dataFirst
+ * @category Object
+ */
+declare function omitBy<T extends object, S extends EnumerableStringKeyedValueOf<T>>(data: T, predicate: (value: EnumerableStringKeyedValueOf<T>, key: EnumerableStringKeyOf<T>, data: T) => value is S): PartialEnumerableKeysNarrowed<T, S>;
+declare function omitBy<T extends object>(data: T, predicate: (value: EnumerableStringKeyedValueOf<T>, key: EnumerableStringKeyOf<T>, data: T) => boolean): PartialEnumerableKeys<T>;
+/**
+ * Returns a partial copy of an object omitting the keys matching predicate.
+ *
+ * @param predicate - The predicate.
+ * @signature P.omitBy(fn)(object)
+ * @example
+ *    P.omitBy((val, key) => key.toUpperCase() === key)({a: 1, b: 2, A: 3, B: 4}) // => {a: 1, b: 2}
+ * @dataLast
+ * @category Object
+ */
+declare function omitBy<T extends object, S extends EnumerableStringKeyedValueOf<T>>(predicate: (value: EnumerableStringKeyedValueOf<T>, key: EnumerableStringKeyOf<T>, data: T) => value is S): (data: T) => PartialEnumerableKeysNarrowed<T, S>;
+declare function omitBy<T extends object>(predicate: (value: EnumerableStringKeyedValueOf<T>, key: EnumerableStringKeyOf<T>, data: T) => boolean): (data: T) => PartialEnumerableKeys<T>;
+//#endregion
+export { omitBy };
+//# sourceMappingURL=omit-by.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"omit-by.d.ts","names":[],"sources":["../src/omit-by.ts"],"sourcesContent":[],"mappings":";;;;;;KAUK,2DACmB,KAAK,mBAAmB,YAAY,EAAE,IARY;KAerE,qBAPmB,CAAA,UAAA,MAAA,CAAA,GAUpB,CAVoB,SAAA,OAAA,GAWlB,QAXkB,CAYhB,eAZgB,CAYA,CAZA,CAAA,SAAA,IAAA,GAYkB,cAZlB,CAYiC,CAZjC,CAAA,GAAA,kBAAK,MAaG,CAbH,IAaQ,CAbR,SAAA,MAAA,GAAA,KAAA,GAef,CAfe,IAeV,QAfU,CAeD,CAfC,CAAA,CAeE,CAfF,CAAA,EAAmB,GAmBpC,MAnBoC,CAmB7B,qBAnB6B,CAmBP,CAnBO,CAAA,EAmBH,4BAnBG,CAmB0B,CAnB1B,CAAA,CAAA,CAAA,GAAA,KAAA;KAiC3C,6BAjCuD,CAAA,UAAA,MAAA,EAAA,CAAA,CAAA,GAiCF,QAjCE,CAkC1D,UAlC0D,CAkC/C,CAlC+C,EAkC5C,CAlC4C,CAAA,GAkCvC,YAlCuC,CAkC1B,CAlC0B,EAkCvB,CAlCuB,CAAA,GAkClB,cAlCkB,CAkCH,CAlCG,CAAA,CAAA;KAsCvD,UAtCyD,CAAA,CAAA,EAAA,CAAA,CAAA,GAAA,kBAAC,MAuCvC,CAvCuC,IAuClC,WAvCkC,CAuCtB,CAvCsB,EAuCnB,CAvCmB,EAuChB,CAvCgB,CAAA,SAAA,IAAA,GAwCzD,CAxCyD,GAAA,KAAA,GAyCjD,OAzCiD,CAyCzC,CAzCyC,CAyCvC,CAzCuC,CAAA,EAyCnC,CAzCmC,CAAA,EAAA;KA8C1D,YApCD,CAAA,CAAA,EAAA,CAAA,CAAA,GAAA,kBAEoB,MAmCA,CAnCA,IAmCK,aAnCL,CAmCmB,CAnCnB,EAmCsB,CAnCtB,EAmCyB,CAnCzB,CAAA,SAAA,IAAA,GAoClB,CApCkB,GAAA,KAAA,IAqCT,OArCS,CAqCD,CArCC,CAqCC,CArCD,CAAA,EAqCK,CArCL,CAAA,EAAhB;KA2CH,WA3CoD,CAAA,CAAA,EAAA,YAAA,MA2CrB,CA3CqB,EAAA,CAAA,CAAA,GA2Cb,GA3Ca,SAAA,MAAA,GAAA,KAAA,GA8CrD,CA9CqD,CA8CnD,GA9CmD,CAAA,SA8CxC,OA9CwC,CA8ChC,CA9CgC,CA8C9B,GA9C8B,CAAA,EA8C1B,CA9C0B,CAAA,GA+CnD,CA/CmD,SA+CzC,CA/CyC,CA+CvC,GA/CuC,CAAA,GAAA,KAAA,GAAA,IAAA,GAAA,KAAA;KA6DpD,aA7DqC,CAAA,CAAA,EAAA,YAAA,MA6DJ,CA7DI,EAAA,CAAA,CAAA,GA6DI,GA7DJ,SAAA,MAAA,GAAA,KAAA,GAgEtC,EAhEsC,CAgEnC,WAhEmC,CAgEvB,CAhEuB,EAgEpB,GAhEoB,EAgEjB,CAhEiB,CAAA,EAgEb,OAhEa,CAgEL,OAhEK,CAgEG,QAhEH,CAgEY,CAhEZ,CAAA,CAgEe,GAhEf,CAAA,EAgEmB,CAhEnB,CAAA,CAAA,CAAA,SAAA,IAAA,GAAA,KAAA,GAAA,IAAA;;;;;;;;;;;;;;AAD5B;;;;;;;;;AAsB4C,iBAqE1C,MArE0C,CAAA,UAAA,MAAA,EAAA,UAuE9C,4BAvE8C,CAuEjB,CAvEiB,CAAA,CAAA,CAAA,IAAA,EAyElD,CAzEkD,EAAA,SAAA,EAAA,CAAA,KAAA,EA2E/C,4BA3E+C,CA2ElB,CA3EkB,CAAA,EAAA,GAAA,EA4EjD,qBA5EiD,CA4E3B,CA5E2B,CAAA,EAAA,IAAA,EA6EhD,CA7EgD,EAAA,GAAA,KAAA,IA8E1C,CA9E0C,CAAA,EA+EvD,6BA/EuD,CA+EzB,CA/EyB,EA+EtB,CA/EsB,CAAA;AAAQ,iBAgFlD,MAhFkD,CAAA,UAAA,MAAA,CAAA,CAAA,IAAA,EAiF1D,CAjF0D,EAAA,SAAA,EAAA,CAAA,KAAA,EAmFvD,4BAnFuD,CAmF1B,CAnF0B,CAAA,EAAA,GAAA,EAoFzD,qBApFyD,CAoFnC,CApFmC,CAAA,EAAA,IAAA,EAqFxD,CArFwD,EAAA,GAAA,OAAA,CAAA,EAuF/D,qBAvF+D,CAuFzC,CAvFyC,CAAA;AAAA;;;;;;;;;;AAQpD,iBA2FE,MA3FF,CAAA,UAAA,MAAA,EAAA,UA6FF,4BA7FE,CA6F2B,CA7F3B,CAAA,CAAA,CAAA,SAAA,EAAA,CAAA,KAAA,EAgGH,4BAhGG,CAgG0B,CAhG1B,CAAA,EAAA,GAAA,EAiGL,qBAjGK,CAiGiB,CAjGjB,CAAA,EAAA,IAAA,EAkGJ,CAlGI,EAAA,GAAA,KAAA,IAmGE,CAnGF,CAAA,EAAA,CAAA,IAAA,EAoGJ,CApGI,EAAA,GAoGE,6BApGF,CAoGgC,CApGhC,EAoGmC,CApGnC,CAAA;AAAO,iBAqGL,MArGK,CAAA,UAAA,MAAA,CAAA,CAAA,SAAA,EAAA,CAAA,KAAA,EAuGV,4BAvGU,CAuGmB,CAvGnB,CAAA,EAAA,GAAA,EAwGZ,qBAxGY,CAwGU,CAxGV,CAAA,EAAA,IAAA,EAyGX,CAzGW,EAAA,GAAA,OAAA,CAAA,EAAA,CAAA,IAAA,EA2GX,CA3GW,EAAA,GA2GL,qBA3GK,CA2GiB,CA3GjB,CAAA"}

package/dist/omit-by.js

@@ -1 +1,2 @@
-import"./lazy-data-last-impl-7QfM1xXg.js";import"./curry-CzZjDrpv.js";import{omitBy as e}from"./omit-by-QzqJAuk3.js";export{e as omitBy};
+import{t as e}from"./curry-BcQ8Up1_.js";function t(...t){return e(n,t)}function n(e,t){let n={...e};for(let[r,i]of Object.entries(n))t(i,r,e)&&delete n[r];return n}export{t as omitBy};
+//# sourceMappingURL=omit-by.js.map

package/dist/omit-by.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"omit-by.js","names":["out: Partial<Record<string, unknown>>"],"sources":["../src/omit-by.ts"],"sourcesContent":["import type { IsNever, Or, Simplify } from 'type-fest';\nimport type { EnumerableStringKeyOf } from './internal/types/enumerable-string-key-of';\nimport type { EnumerableStringKeyedValueOf } from './internal/types/enumerable-string-keyed-value-of';\nimport type { IsBoundedRecord } from './internal/types/is-bounded-record';\nimport { curry } from './curry';\n\n// Symbols are not passed to the predicate (because they can't be enumerated\n// with the `Object.entries` function) and the output object is built from a\n// shallow copy of the input; meaning symbols would just be passed through as-\n// is.\ntype PickSymbolKeys<T extends object> = {\n  -readonly [P in keyof T as P extends symbol ? P : never]: T[P];\n};\n\n// When we don't use a type-predicate we can't say anything about what props\n// would be omitted from the output, so we need to assume any of them could be\n// filtered out. This means that we effectively make all (enumerable) keys\n// optional.\ntype PartialEnumerableKeys<T extends object>\n  // `extends unknown` is always going to be the case and is used to convert any\n  // union into a [distributive conditional type](https://www.typescriptlang.org/docs/handbook/release-notes/typescript-2-8.html#distributive-conditional-types).\n  = T extends unknown\n    ? Simplify<\n        IsBoundedRecord<T> extends true ? PickSymbolKeys<T> & {\n          -readonly [P in keyof T as P extends symbol\n            ? never\n            : P]?: Required<T>[P];\n        }\n          // This is the type you'd get from doing:\n          // `Object.fromEntries(Object.entries(x))`.\n          : Record<EnumerableStringKeyOf<T>, EnumerableStringKeyedValueOf<T>>\n      >\n    : never;\n\n// When the predicate is a type-guard we have more information to work with when\n// constructing the type of the output object. We can safely remove any property\n// which value would always be true for the predicate, AND we can also\n// assume that properties that are rejected by the predicate perfectly would\n// **always** show up in the output object. Hence to build the output object we\n// need to build and merge 2 output objects: One for the properties which have a\n// value of at type that would always yield a `false` result from the predicate,\n// these are the \"matches\", which would not change the \"optionality\" of the\n// input object's props, and one for partial matches which would also make the\n// props optional (as they could have a value that would be filtered out).\ntype PartialEnumerableKeysNarrowed<T extends object, S> = Simplify<\n  ExactProps<T, S> & PartialProps<T, S> & PickSymbolKeys<T>\n>;\n\n// The exact case, props here would always be part of the output object\ntype ExactProps<T, S> = {\n  -readonly [P in keyof T as IsExactProp<T, P, S> extends true\n    ? P\n    : never]: Exclude<T[P], S>;\n};\n\n// The partial case, props here might be part of the output object, but might\n// not be, hence they are optional.\ntype PartialProps<T, S> = {\n  -readonly [P in keyof T as IsPartialProp<T, P, S> extends true\n    ? P\n    : never]?: Exclude<T[P], S>;\n};\n\n// If the input object's value type extends itself when the type-guard is\n// excluded from it we can safely assume that the predicate would always return\n// `false` for any value of that property.\ntype IsExactProp<T, P extends keyof T, S> = P extends symbol\n  // Symbols are passed through via the PickSymbolKeys type\n  ? false\n  : T[P] extends Exclude<T[P], S>\n    ? S extends T[P]\n      // If S extends the T[P] it means the type the predicate is narrowing to\n      // can't narrow the rejected value any further, so we can't say what\n      // would happen for a concrete value in runtime (e.g. if T[P] is\n      // `number` and S is `1`: `Exclude<number, 1> === number`.\n      ? false\n      : true\n    : false;\n\n// ...and if the input object's value type isn't an exact match, but still has\n// some partial match (i.g. the extracted type-guard isn't completely disjoint)\n// then we can assume that the property can sometimes return true, and sometimes\n// false when passed to the predicate, hence it should be optional in the\n// output.\ntype IsPartialProp<T, P extends keyof T, S> = P extends symbol\n  // Symbols are passed through via the PickSymbolKeys type\n  ? false\n  : Or<IsExactProp<T, P, S>, IsNever<Exclude<Required<T>[P], S>>> extends true\n    ? false\n    : true;\n\n/**\n * Creates a shallow copy of the data, and then removes any keys that the\n * predicate rejects. Symbol keys are not passed to the predicate and would be\n * passed through to the output as-is.\n *\n * See `pickBy` for a complementary function which starts with an empty object\n * and adds the entries that the predicate accepts. Because it is additive,\n * symbol keys will not be passed through to the output object.\n *\n * @param data - The target object.\n * @param predicate - A function that takes the value, key, and the data itself\n * and returns `true` if the entry shouldn't be part of the output object, or\n * `false` to keep it. If the function is a type-guard on the value the output\n * type would be narrowed accordingly.\n * @returns A shallow copy of the input object with the rejected entries\n * removed.\n * @signature P.omitBy(data, predicate)\n * @example\n *    P.omitBy({a: 1, b: 2, A: 3, B: 4}, (val, key) => key.toUpperCase() === key) // => {a: 1, b: 2}\n * @dataFirst\n * @category Object\n */\nexport function omitBy<\n  T extends object,\n  S extends EnumerableStringKeyedValueOf<T>,\n>(\n  data: T,\n  predicate: (\n    value: EnumerableStringKeyedValueOf<T>,\n    key: EnumerableStringKeyOf<T>,\n    data: T,\n  ) => value is S,\n): PartialEnumerableKeysNarrowed<T, S>;\nexport function omitBy<T extends object>(\n  data: T,\n  predicate: (\n    value: EnumerableStringKeyedValueOf<T>,\n    key: EnumerableStringKeyOf<T>,\n    data: T,\n  ) => boolean,\n): PartialEnumerableKeys<T>;\n\n/**\n * Returns a partial copy of an object omitting the keys matching predicate.\n *\n * @param predicate - The predicate.\n * @signature P.omitBy(fn)(object)\n * @example\n *    P.omitBy((val, key) => key.toUpperCase() === key)({a: 1, b: 2, A: 3, B: 4}) // => {a: 1, b: 2}\n * @dataLast\n * @category Object\n */\nexport function omitBy<\n  T extends object,\n  S extends EnumerableStringKeyedValueOf<T>,\n>(\n  predicate: (\n    value: EnumerableStringKeyedValueOf<T>,\n    key: EnumerableStringKeyOf<T>,\n    data: T,\n  ) => value is S,\n): (data: T) => PartialEnumerableKeysNarrowed<T, S>;\nexport function omitBy<T extends object>(\n  predicate: (\n    value: EnumerableStringKeyedValueOf<T>,\n    key: EnumerableStringKeyOf<T>,\n    data: T,\n  ) => boolean,\n): (data: T) => PartialEnumerableKeys<T>;\n\nexport function omitBy(...args: ReadonlyArray<unknown>): unknown {\n  return curry(omitByImplementation, args);\n}\n\nfunction omitByImplementation<T extends object>(\n  data: T,\n  predicate: (value: unknown, key: string, data: T) => boolean,\n): Record<string, unknown> {\n  const out: Partial<Record<string, unknown>> = { ...data };\n\n  for (const [key, value] of Object.entries(out)) {\n    if (predicate(value, key, data)) {\n      // eslint-disable-next-line ts/no-dynamic-delete -- This is the best way to do it!\n      delete out[key];\n    }\n  }\n\n  return out;\n}\n"],"mappings":"wCAiKA,SAAgB,EAAO,GAAG,EAAuC,CAC/D,OAAO,EAAM,EAAsB,EAAK,CAG1C,SAAS,EACP,EACA,EACyB,CACzB,IAAMA,EAAwC,CAAE,GAAG,EAAM,CAEzD,IAAK,GAAM,CAAC,EAAK,KAAU,OAAO,QAAQ,EAAI,CACxC,EAAU,EAAO,EAAK,EAAK,EAE7B,OAAO,EAAI,GAIf,OAAO"}

package/dist/omit.cjs

@@ -1 +1 @@
-require(`./lazy-data-last-impl-3PAFkslW.cjs`),require(`./curry-BPVIsvo3.cjs`),require(`./has-at-least-D-ahiJB6.cjs`);const e=require(`./omit-Ljg-nRSD.cjs`);exports.omit=e.omit;
+const e=require(`./curry-BsY0Z8jH.cjs`),t=require(`./has-at-least-BXwOPLQK.cjs`);function n(...t){return e.t(r,t)}function r(e,n){if(!t.t(n,1))return{...e};if(!t.t(n,2)){let{[n[0]]:t,...r}=e;return r}let r={...e};for(let e of n)delete r[e];return r}exports.omit=n;

package/dist/omit.d.cts

@@ -1,2 +1,29 @@
-import { omit } from "./omit-DJ4Q7wfp.cjs";
-export { omit };
+//#region src/omit.d.ts
+/**
+ * Returns a partial copy of an object omitting the keys specified.
+ *
+ * @param propNames - The property names.
+ * @signature
+ *    P.omit(names)(obj);
+ * @example
+ *    P.pipe({ a: 1, b: 2, c: 3, d: 4 }, P.omit(['a', 'd'])) // => { b: 2, c: 3 }
+ * @dataLast
+ * @category Object
+ */
+declare function omit<T extends object, K extends keyof T>(propNames: ReadonlyArray<K>): (data: T) => Omit<T, K>;
+/**
+ * Returns a partial copy of an object omitting the keys specified.
+ *
+ * @param data - The object.
+ * @param propNames - The property names.
+ * @signature
+ *    P.omit(obj, names);
+ * @example
+ *    P.omit({ a: 1, b: 2, c: 3, d: 4 }, ['a', 'd']) // => { b: 2, c: 3 }
+ * @dataFirst
+ * @category Object
+ */
+declare function omit<T extends object, K extends keyof T>(data: T, propNames: ReadonlyArray<K>): Omit<T, K>;
+//#endregion
+export { omit };
+//# sourceMappingURL=omit.d.cts.map

package/dist/omit.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"omit.d.cts","names":[],"sources":["../src/omit.ts"],"sourcesContent":[],"mappings":";;AAcA;;;;;;;;;AAgBA;AAAuD,iBAhBvC,IAgBuC,CAAA,UAAA,MAAA,EAAA,UAAA,MAhBA,CAgBA,CAAA,CAAA,SAAA,EAf1C,aAe0C,CAf5B,CAe4B,CAAA,CAAA,EAAA,CAAA,IAAA,EAd7C,CAc6C,EAAA,GAdvC,IAcuC,CAdlC,CAckC,EAd/B,CAc+B,CAAA;;;;;;;;;;;;;iBAAvC,uCAAuC,SAC/C,cACK,cAAc,KACxB,KAAK,GAAG"}

package/dist/omit.d.ts

@@ -1,2 +1,29 @@
-import { omit } from "./omit-DY21j6I-.js";
-export { omit };
+//#region src/omit.d.ts
+/**
+ * Returns a partial copy of an object omitting the keys specified.
+ *
+ * @param propNames - The property names.
+ * @signature
+ *    P.omit(names)(obj);
+ * @example
+ *    P.pipe({ a: 1, b: 2, c: 3, d: 4 }, P.omit(['a', 'd'])) // => { b: 2, c: 3 }
+ * @dataLast
+ * @category Object
+ */
+declare function omit<T extends object, K extends keyof T>(propNames: ReadonlyArray<K>): (data: T) => Omit<T, K>;
+/**
+ * Returns a partial copy of an object omitting the keys specified.
+ *
+ * @param data - The object.
+ * @param propNames - The property names.
+ * @signature
+ *    P.omit(obj, names);
+ * @example
+ *    P.omit({ a: 1, b: 2, c: 3, d: 4 }, ['a', 'd']) // => { b: 2, c: 3 }
+ * @dataFirst
+ * @category Object
+ */
+declare function omit<T extends object, K extends keyof T>(data: T, propNames: ReadonlyArray<K>): Omit<T, K>;
+//#endregion
+export { omit };
+//# sourceMappingURL=omit.d.ts.map

package/dist/omit.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"omit.d.ts","names":[],"sources":["../src/omit.ts"],"sourcesContent":[],"mappings":";;AAcA;;;;;;;;;AAgBA;AAAuD,iBAhBvC,IAgBuC,CAAA,UAAA,MAAA,EAAA,UAAA,MAhBA,CAgBA,CAAA,CAAA,SAAA,EAf1C,aAe0C,CAf5B,CAe4B,CAAA,CAAA,EAAA,CAAA,IAAA,EAd7C,CAc6C,EAAA,GAdvC,IAcuC,CAdlC,CAckC,EAd/B,CAc+B,CAAA;;;;;;;;;;;;;iBAAvC,uCAAuC,SAC/C,cACK,cAAc,KACxB,KAAK,GAAG"}

package/dist/omit.js

@@ -1 +1,2 @@
-import"./lazy-data-last-impl-7QfM1xXg.js";import"./curry-CzZjDrpv.js";import"./has-at-least-6iRvhsST.js";import{omit as e}from"./omit-CbVbZe6B.js";export{e as omit};
+import{t as e}from"./curry-BcQ8Up1_.js";import{t}from"./has-at-least-DyIhWZJH.js";function n(...t){return e(r,t)}function r(e,n){if(!t(n,1))return{...e};if(!t(n,2)){let{[n[0]]:t,...r}=e;return r}let r={...e};for(let e of n)delete r[e];return r}export{n as omit};
+//# sourceMappingURL=omit.js.map

package/dist/omit.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"omit.js","names":[],"sources":["../src/omit.ts"],"sourcesContent":["import { curry } from './curry';\nimport { hasAtLeast } from './has-at-least';\n\n/**\n * Returns a partial copy of an object omitting the keys specified.\n *\n * @param propNames - The property names.\n * @signature\n *    P.omit(names)(obj);\n * @example\n *    P.pipe({ a: 1, b: 2, c: 3, d: 4 }, P.omit(['a', 'd'])) // => { b: 2, c: 3 }\n * @dataLast\n * @category Object\n */\nexport function omit<T extends object, K extends keyof T>(\n  propNames: ReadonlyArray<K>,\n): (data: T) => Omit<T, K>;\n\n/**\n * Returns a partial copy of an object omitting the keys specified.\n *\n * @param data - The object.\n * @param propNames - The property names.\n * @signature\n *    P.omit(obj, names);\n * @example\n *    P.omit({ a: 1, b: 2, c: 3, d: 4 }, ['a', 'd']) // => { b: 2, c: 3 }\n * @dataFirst\n * @category Object\n */\nexport function omit<T extends object, K extends keyof T>(\n  data: T,\n  propNames: ReadonlyArray<K>,\n): Omit<T, K>;\n\nexport function omit(...args: ReadonlyArray<unknown>): unknown {\n  return curry(omitImplementation, args);\n}\n\nfunction omitImplementation<T extends object, K extends keyof T>(\n  data: T,\n  propNames: ReadonlyArray<K>,\n): Omit<T, K> {\n  if (!hasAtLeast(propNames, 1)) {\n    // No props to omit at all!\n    return { ...data };\n  }\n\n  if (!hasAtLeast(propNames, 2)) {\n    // Only one prop to omit.\n    const { [propNames[0]]: _omitted, ...remaining } = data;\n    return remaining;\n  }\n\n  // Multiple props to omit...\n\n  const out = { ...data };\n  for (const prop of propNames) {\n    // eslint-disable-next-line ts/no-dynamic-delete -- This is the best way to do it!\n    delete out[prop];\n  }\n  return out;\n}\n"],"mappings":"kFAmCA,SAAgB,EAAK,GAAG,EAAuC,CAC7D,OAAO,EAAM,EAAoB,EAAK,CAGxC,SAAS,EACP,EACA,EACY,CACZ,GAAI,CAAC,EAAW,EAAW,EAAE,CAE3B,MAAO,CAAE,GAAG,EAAM,CAGpB,GAAI,CAAC,EAAW,EAAW,EAAE,CAAE,CAE7B,GAAM,EAAG,EAAU,IAAK,EAAU,GAAG,GAAc,EACnD,OAAO,EAKT,IAAM,EAAM,CAAE,GAAG,EAAM,CACvB,IAAK,IAAM,KAAQ,EAEjB,OAAO,EAAI,GAEb,OAAO"}

package/dist/once.cjs

@@ -1 +1 @@
-const e=require(`./once-BrpjaAJS.cjs`);exports.once=e.once;
+function e(e){let t=!1,n;return()=>(t||=(n=e(),!0),n)}exports.once=e;

package/dist/once.d.cts

@@ -1,2 +1,17 @@
-import { once } from "./once-Cr_DJNbf.cjs";
-export { once };
+//#region src/once.d.ts
+/**
+ * Creates a function that is restricted to invoking `func` once. Repeat calls to the function return the value of the first invocation.
+ *
+ * @param fn - The function to wrap.
+ * @signature P.once(fn)
+ * @example
+ * const initialize = P.once(createApplication);
+ * initialize();
+ * initialize();
+ * // => `createApplication` is invoked once
+ * @category Function
+ */
+declare function once<T>(fn: () => T): () => T;
+//#endregion
+export { once };
+//# sourceMappingURL=once.d.cts.map

package/dist/once.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"once.d.cts","names":[],"sources":["../src/once.ts"],"sourcesContent":[],"mappings":";;AAYA;;;;;;;;;;;iBAAgB,kBAAkB,UAAU"}