@koine/utils 2.0.0-beta.2 → 2.0.0-beta.21

package/mapListBy.d.ts

@@ -1,7 +1,2 @@
-/**
- * Maps an array of objects into a map keyed with the given key
- *
- * @category array
- */
 export declare function mapListBy<T extends Record<string | number | symbol, any>>(array?: T[], key?: keyof T): Record<T[keyof T], T>;
 export default mapListBy;

package/mapListBy.js

@@ -1,12 +1,4 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.mapListBy = void 0;
-/**
- * Maps an array of objects into a map keyed with the given key
- *
- * @category array
- */
-function mapListBy(array, key) {
+export function mapListBy(array, key) {
     if (array === void 0) { array = []; }
     if (key === void 0) { key = ""; }
     return array.reduce(function (obj, item) {
@@ -14,5 +6,4 @@ function mapListBy(array, key) {
         return obj;
     }, {});
 }
-exports.mapListBy = mapListBy;
-exports.default = mapListBy;
+export default mapListBy;

package/matchSorter.d.ts

@@ -48,13 +48,6 @@ declare const RANKING_MATCHES = 1;
 declare const RANKING_NO_MATCH = 0;
 type Ranking = typeof RANKING_CASE_SENSITIVE_EQUAL | typeof RANKING_EQUAL | typeof RANKING_STARTS_WITH | typeof RANKING_WORD_STARTS_WITH | typeof RANKING_CONTAINS | typeof RANKING_ACRONYM | typeof RANKING_MATCHES | typeof RANKING_NO_MATCH;
 declare const defaultBaseSortFn: BaseSorter<unknown>;
-/**
- * Takes an array of items and a value and returns a new array with the items that match the given value
- * @param {Array} items - the items to sort
- * @param {String} value - the value to use for ranking
- * @param {Object} options - Some options to configure the sorter
- * @return {Array} - the new sorted array
- */
 declare function matchSorter<ItemType = string>(items: ReadonlyArray<ItemType>, value: string, options?: MatchSorterOptions<ItemType>): Array<ItemType>;
 export { matchSorter, defaultBaseSortFn };
 export type { MatchSorterOptions, KeyAttributesOptions, KeyOption, KeyAttributes, RankingInfo, ValueGetterKey, };

package/matchSorter.js

@@ -1,24 +1,5 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.defaultBaseSortFn = exports.matchSorter = void 0;
-var tslib_1 = require("tslib");
-/**
- * @file
- *
- * Slightly adapted from Kent C. Dodd's [match-sorter](https://github.com/kentcdodds/match-sorter)
- * differences are:
- * - less exports
- * - smaller output
- * - no external deps
- *
- * TODO: turn objects into arrays for smaller output?
- *
- * @name match-sorter
- * @license MIT license.
- * @copyright (c) 2020 Kent C. Dodds
- * @author Kent C. Dodds <me@kentcdodds.com> (https://kentcdodds.com)
- */
-var removeAccents_1 = tslib_1.__importDefault(require("./removeAccents"));
+import { __assign, __read, __spreadArray } from "tslib";
+import removeAccents from "./removeAccents.js";
 var RANKING_CASE_SENSITIVE_EQUAL = 7;
 var RANKING_EQUAL = 6;
 var RANKING_STARTS_WITH = 5;
@@ -30,14 +11,6 @@ var RANKING_NO_MATCH = 0;
 var defaultBaseSortFn = function (a, b) {
     return String(a.rankedValue).localeCompare(String(b.rankedValue));
 };
-exports.defaultBaseSortFn = defaultBaseSortFn;
-/**
- * Takes an array of items and a value and returns a new array with the items that match the given value
- * @param {Array} items - the items to sort
- * @param {String} value - the value to use for ranking
- * @param {Object} options - Some options to configure the sorter
- * @return {Array} - the new sorted array
- */
 function matchSorter(items, value, options) {
     if (options === void 0) { options = {}; }
     var keys = options.keys, _a = options.threshold, threshold = _a === void 0 ? RANKING_MATCHES : _a, _b = options.baseSort, baseSort = _b === void 0 ? defaultBaseSortFn : _b, _c = options.sorter, sorter = _c === void 0 ? function (matchedItems) {
@@ -52,26 +25,15 @@ function matchSorter(items, value, options) {
         var rankingInfo = getHighestRanking(item, keys, value, options);
         var rank = rankingInfo.rank, _a = rankingInfo.keyThreshold, keyThreshold = _a === void 0 ? threshold : _a;
         if (rank >= keyThreshold) {
-            matches.push(tslib_1.__assign(tslib_1.__assign({}, rankingInfo), { item: item, index: index }));
+            matches.push(__assign(__assign({}, rankingInfo), { item: item, index: index }));
         }
         return matches;
     }
 }
-exports.matchSorter = matchSorter;
-/**
- * Gets the highest ranking for value for the given item based on its values for the given keys
- * @param {*} item - the item to rank
- * @param {Array} keys - the keys to get values from the item for the ranking
- * @param {String} value - the value to rank against
- * @param {Object} options - options to control the ranking
- * @return {{rank: Number, keyIndex: Number, keyThreshold: Number}} - the highest ranking
- */
 function getHighestRanking(item, keys, value, options) {
     if (!keys) {
-        // if keys is not specified, then we assume the item given is ready to be matched
         var stringItem = item;
         return {
-            // ends up being duplicate of 'item' in matches but consistent
             rankedValue: stringItem,
             rank: getMatchRanking(stringItem, value, options),
             keyIndex: -1,
@@ -105,63 +67,37 @@ function getHighestRanking(item, keys, value, options) {
         keyThreshold: options.threshold,
     });
 }
-/**
- * Gives a rankings score based on how well the two strings match.
- * @param {String} testString - the string to test against
- * @param {String} stringToRank - the string to rank
- * @param {Object} options - options for the match (like keepDiacritics for comparison)
- * @returns {Number} the ranking for how well stringToRank matches testString
- */
 function getMatchRanking(testString, stringToRank, options) {
     testString = prepareValueForComparison(testString, options);
     stringToRank = prepareValueForComparison(stringToRank, options);
-    // too long
     if (stringToRank.length > testString.length) {
         return RANKING_NO_MATCH;
     }
-    // case sensitive equals
     if (testString === stringToRank) {
         return RANKING_CASE_SENSITIVE_EQUAL;
     }
-    // Lower casing before further comparison
     testString = testString.toLowerCase();
     stringToRank = stringToRank.toLowerCase();
-    // case insensitive equals
     if (testString === stringToRank) {
         return RANKING_EQUAL;
     }
-    // starts with
     if (testString.startsWith(stringToRank)) {
         return RANKING_STARTS_WITH;
     }
-    // word starts with
     if (testString.includes(" ".concat(stringToRank))) {
         return RANKING_WORD_STARTS_WITH;
     }
-    // contains
     if (testString.includes(stringToRank)) {
         return RANKING_CONTAINS;
     }
     else if (stringToRank.length === 1) {
-        // If the only character in the given stringToRank
-        //   isn't even contained in the testString, then
-        //   it's definitely not a match.
         return RANKING_NO_MATCH;
     }
-    // acronym
     if (getAcronym(testString).includes(stringToRank)) {
         return RANKING_ACRONYM;
     }
-    // will return a number between RANKING_MATCHES and
-    // RANKING_MATCHES + 1 depending  on how close of a match it is.
     return getClosenessRanking(testString, stringToRank);
 }
-/**
- * Generates an acronym for a string.
- *
- * @param {String} string the string for which to produce the acronym
- * @returns {String} the acronym
- */
 function getAcronym(string) {
     var acronym = "";
     var wordsInString = string.split(" ");
@@ -173,16 +109,6 @@ function getAcronym(string) {
     });
     return acronym;
 }
-/**
- * Returns a score based on how spread apart the
- * characters from the stringToRank are within the testString.
- * A number close to RANKING_MATCHES represents a loose match. A number close
- * to RANKING_MATCHES + 1 represents a tighter match.
- * @param {String} testString - the string to test against
- * @param {String} stringToRank - the string to rank
- * @returns {Number} the number between RANKING_MATCHES and
- * RANKING_MATCHES + 1 for how well stringToRank matches testString
- */
 function getClosenessRanking(testString, stringToRank) {
     var matchingInOrderCharCount = 0;
     var charNumber = 0;
@@ -218,12 +144,6 @@ function getClosenessRanking(testString, stringToRank) {
     var spread = charNumber - firstIndex;
     return getRanking(spread);
 }
-/**
- * Sorts items that have a rank, index, and keyIndex
- * @param {Object} a - the first item to sort
- * @param {Object} b - the second item to sort
- * @return {Number} -1 if a should come first, 1 if b should come first, 0 if equal
- */
 function sortRankedValues(a, b, baseSort) {
     var aFirst = -1;
     var bFirst = 1;
@@ -232,7 +152,6 @@ function sortRankedValues(a, b, baseSort) {
     var same = aRank === bRank;
     if (same) {
         if (aKeyIndex === bKeyIndex) {
-            // use the base sort function as a tie-breaker
             return baseSort(a, b);
         }
         else {
@@ -243,28 +162,14 @@ function sortRankedValues(a, b, baseSort) {
         return aRank > bRank ? aFirst : bFirst;
     }
 }
-/**
- * Prepares value for comparison by stringifying it, removing diacritics (if specified)
- * @param {String} value - the value to clean
- * @param {Object} options - {keepDiacritics: whether to remove diacritics}
- * @return {String} the prepared value
- */
 function prepareValueForComparison(value, _a) {
     var keepDiacritics = _a.keepDiacritics;
-    // value might not actually be a string at this point (we don't get to choose)
-    // so part of preparing the value for comparison is ensure that it is a string
-    value = "".concat(value); // toString
+    value = "".concat(value);
     if (!keepDiacritics) {
-        value = (0, removeAccents_1.default)(value);
+        value = removeAccents(value);
     }
     return value;
 }
-/**
- * Gets value for key in item at arbitrarily nested keypath
- * @param {Object} item - the item
- * @param {Object|Function} key - the potentially nested keypath or property callback
- * @return {Array} - an array containing the value(s) at the nested keypath
- */
 function getItemValues(item, key) {
     if (typeof key === "object") {
         key = key.key;
@@ -280,13 +185,11 @@ function getItemValues(item, key) {
         value = item[key];
     }
     else if (key.includes(".")) {
-        // eslint-disable-next-line @typescript-eslint/no-unsafe-call
         return getNestedValues(key, item);
     }
     else {
         value = null;
     }
-    // because `value` can also be undefined
     if (value == null) {
         return [];
     }
@@ -295,13 +198,6 @@ function getItemValues(item, key) {
     }
     return [String(value)];
 }
-/**
- * Given path: "foo.bar.baz"
- * And item: {foo: {bar: {baz: 'buzz'}}}
- *   -> 'buzz'
- * @param path a dot-separated set of keys
- * @param item the item to get the value from
- */
 function getNestedValues(path, item) {
     var keys = path.split(".");
     var values = [item];
@@ -319,28 +215,17 @@ function getNestedValues(path, item) {
                 }
             }
             else if (nestedKey === "*") {
-                // ensure that values is an array
                 nestedValues = nestedValues.concat(nestedItem);
             }
         }
         values = nestedValues;
     }
     if (Array.isArray(values[0])) {
-        // keep allowing the implicit wildcard for an array of strings at the end of
-        // the path; don't use `.flat()` because that's not available in node.js v10
         var result = [];
-        return result.concat.apply(result, values);
+        return result.concat.apply(result, __spreadArray([], __read(values), false));
     }
-    // Based on our logic it should be an array of strings by now...
-    // assuming the user's path terminated in strings
     return values;
 }
-/**
- * Gets all the values for the given keys in the given item and returns an array of those values
- * @param item - the item from which the values will be retrieved
- * @param keys - the keys to use to retrieve the values
- * @return objects with {itemValue, attributes}
- */
 function getAllValuesToRank(item, keys) {
     var allValues = [];
     for (var j = 0, J = keys.length; j < J; j++) {
@@ -360,15 +245,11 @@ var defaultKeyAttributes = {
     maxRanking: Infinity,
     minRanking: -Infinity,
 };
-/**
- * Gets all the attributes for the given key
- * @param key - the key from which the attributes will be retrieved
- * @return object containing the key's attributes
- */
 function getKeyAttributes(key) {
     if (typeof key === "string") {
         return defaultKeyAttributes;
     }
-    return tslib_1.__assign(tslib_1.__assign({}, defaultKeyAttributes), key);
+    return __assign(__assign({}, defaultKeyAttributes), key);
 }
-exports.default = matchSorter;
+export { matchSorter, defaultBaseSortFn };
+export default matchSorter;

package/mbToBytes.d.ts

@@ -1,7 +1,2 @@
-/**
- * Megabytes to bytes
- *
- * @category format
- */
 export declare const mbToBytes: (bytes: number) => number;
 export default mbToBytes;

package/mbToBytes.js

@@ -1,11 +1,2 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.mbToBytes = void 0;
-/**
- * Megabytes to bytes
- *
- * @category format
- */
-var mbToBytes = function (bytes) { return bytes * 1000 * 1000; };
-exports.mbToBytes = mbToBytes;
-exports.default = exports.mbToBytes;
+export var mbToBytes = function (bytes) { return bytes * 1000 * 1000; };
+export default mbToBytes;

package/mergeObjects.d.ts

@@ -1,7 +1 @@
-/**
- * Merge two or more objects together. It mutates the target object.
- *
- * @category objects
- * @see https://stackoverflow.com/a/46973278/1938970
- */
-export declare const mergeObjects: <T extends object = object>(target: T, ...sources: T[]) => T;
+export declare const mergeObjects: <T extends object = object>(target: T, ...sources: Partial<T>[]) => T;

package/mergeObjects.js

@@ -1,15 +1,7 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.mergeObjects = void 0;
-var tslib_1 = require("tslib");
-var isObject_1 = require("./isObject");
-/**
- * Merge two or more objects together. It mutates the target object.
- *
- * @category objects
- * @see https://stackoverflow.com/a/46973278/1938970
- */
-var mergeObjects = function (target) {
+import { __read, __spreadArray } from "tslib";
+import { isObject } from "./isObject.js";
+import { isUndefined } from "./isUndefined.js";
+export var mergeObjects = function (target) {
     var sources = [];
     for (var _i = 1; _i < arguments.length; _i++) {
         sources[_i - 1] = arguments[_i];
@@ -21,21 +13,21 @@ var mergeObjects = function (target) {
     if (source === undefined) {
         return target;
     }
-    if ((0, isObject_1.isObject)(target) && (0, isObject_1.isObject)(source)) {
+    if (isObject(target) && isObject(source)) {
         Object.keys(source).forEach(function (_key) {
             var key = _key;
-            if ((0, isObject_1.isObject)(source[key])) {
+            if (isObject(source[key])) {
                 if (!target[key]) {
-                    // @ts-expect-error FIXME: ...
                     target[key] = {};
                 }
-                (0, exports.mergeObjects)(target[key], source[key]);
+                mergeObjects(target[key], source[key]);
             }
             else {
-                target[key] = source[key];
+                if (!isUndefined(source[key])) {
+                    target[key] = source[key];
+                }
             }
         });
     }
-    return exports.mergeObjects.apply(void 0, tslib_1.__spreadArray([target], sources, false));
+    return mergeObjects.apply(void 0, __spreadArray([target], __read(sources), false));
 };
-exports.mergeObjects = mergeObjects;

package/mergeUrlQueryParams.d.ts

@@ -1,9 +1,3 @@
-import { type AnyQueryParams } from "./location";
-/**
- * Merge query parameters objects, it *mutates* the first given object argument
- *
- * @category location
- * @pure
- */
+import { type AnyQueryParams } from "./location.js";
 export declare function mergeUrlQueryParams<T extends AnyQueryParams>(oldParams?: NonNullable<AnyQueryParams>, newParams?: NonNullable<AnyQueryParams>): T;
 export default mergeUrlQueryParams;

package/mergeUrlQueryParams.js

@@ -1,20 +1,10 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.mergeUrlQueryParams = void 0;
-var tslib_1 = require("tslib");
-var isNull_1 = tslib_1.__importDefault(require("./isNull"));
-/**
- * Merge query parameters objects, it *mutates* the first given object argument
- *
- * @category location
- * @pure
- */
-function mergeUrlQueryParams(oldParams, newParams) {
+import isNull from "./isNull.js";
+export function mergeUrlQueryParams(oldParams, newParams) {
     if (oldParams === void 0) { oldParams = {}; }
     if (newParams === void 0) { newParams = {}; }
     for (var key in newParams) {
         var value = newParams[key];
-        if (oldParams[key] && (0, isNull_1.default)(value)) {
+        if (oldParams[key] && isNull(value)) {
             delete oldParams[key];
         }
         else {
@@ -23,5 +13,4 @@ function mergeUrlQueryParams(oldParams, newParams) {
     }
     return oldParams;
 }
-exports.mergeUrlQueryParams = mergeUrlQueryParams;
-exports.default = mergeUrlQueryParams;
+export default mergeUrlQueryParams;

package/moveSortableArrayItemByKey.d.ts

@@ -1,9 +1,2 @@
-/**
- * Move item from one place to another in a sortable array of objects, re-ordering
- * the array accrodingly (no swapping of position).
- * This is useful for drag and drop functionalities
- *
- * @category arrays, dnd
- */
 export declare function moveSortableArrayItemByKey<T, K extends keyof T>(items: T[], key: K, fromItem: Pick<T, K>, toItem: Pick<T, K>): T[];
 export default moveSortableArrayItemByKey;

package/moveSortableArrayItemByKey.js

@@ -1,21 +1,10 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.moveSortableArrayItemByKey = void 0;
-var tslib_1 = require("tslib");
-/**
- * Move item from one place to another in a sortable array of objects, re-ordering
- * the array accrodingly (no swapping of position).
- * This is useful for drag and drop functionalities
- *
- * @category arrays, dnd
- */
-function moveSortableArrayItemByKey(items, key, fromItem, toItem) {
+import { __read, __spreadArray } from "tslib";
+export function moveSortableArrayItemByKey(items, key, fromItem, toItem) {
     var itemsKeys = items.map(function (item) { return item[key]; });
     var idxFrom = itemsKeys.indexOf(fromItem[key]);
     var idxTo = itemsKeys.indexOf(toItem[key]);
-    var item = items.splice(idxFrom, 1)[0];
+    var _a = __read(items.splice(idxFrom, 1), 1), item = _a[0];
     items.splice(idxTo, 0, item);
-    return tslib_1.__spreadArray([], items, true);
+    return __spreadArray([], __read(items), false);
 }
-exports.moveSortableArrayItemByKey = moveSortableArrayItemByKey;
-exports.default = moveSortableArrayItemByKey;
+export default moveSortableArrayItemByKey;

package/noop.d.ts

@@ -1,7 +1,2 @@
-/**
- * No operation function
- *
- * @category native
- */
 export declare const noop: () => void | undefined;
 export default noop;

package/noop.js

@@ -1,11 +1,2 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.noop = void 0;
-/**
- * No operation function
- *
- * @category native
- */
-var noop = function () { return void 0; };
-exports.noop = noop;
-exports.default = exports.noop;
+export var noop = function () { return void 0; };
+export default noop;

package/normaliseUrl.d.ts

@@ -1,11 +1,2 @@
-/**
- * Normalise URL, it works both for absolute and relative URLs
- *
- * - replaces too many consecutive slashes (except `http{s}://`)
- * - removes the trailing slash
- *
- * @category location
- * @see https://stackoverflow.com/a/40649435/1938970
- */
 export declare function normaliseUrl(absoluteUrl?: string): string;
 export default normaliseUrl;

package/normaliseUrl.js

@@ -1,20 +1,6 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.normaliseUrl = void 0;
-var tslib_1 = require("tslib");
-var removeTrailingSlash_1 = tslib_1.__importDefault(require("./removeTrailingSlash"));
-/**
- * Normalise URL, it works both for absolute and relative URLs
- *
- * - replaces too many consecutive slashes (except `http{s}://`)
- * - removes the trailing slash
- *
- * @category location
- * @see https://stackoverflow.com/a/40649435/1938970
- */
-function normaliseUrl(absoluteUrl) {
+import removeTralingSlash from "./removeTrailingSlash.js";
+export function normaliseUrl(absoluteUrl) {
     if (absoluteUrl === void 0) { absoluteUrl = ""; }
-    return (0, removeTrailingSlash_1.default)(absoluteUrl.replace(/(:\/\/)|(\/)+/g, "$1$2"));
+    return removeTralingSlash(absoluteUrl.replace(/(:\/\/)|(\/)+/g, "$1$2"));
 }
-exports.normaliseUrl = normaliseUrl;
-exports.default = normaliseUrl;
+export default normaliseUrl;

package/normaliseUrlPathname.d.ts

@@ -1,10 +1,2 @@
-/**
- * Normalise URL pathname (relative URL)
- *
- * - replaces too many consecutive slashes
- * - removes the trailing slash
- *
- * @category location
- */
 export declare function normaliseUrlPathname(pathname?: string): string;
 export default normaliseUrlPathname;

package/normaliseUrlPathname.js

@@ -1,19 +1,6 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.normaliseUrlPathname = void 0;
-var tslib_1 = require("tslib");
-var removeTrailingSlash_1 = tslib_1.__importDefault(require("./removeTrailingSlash"));
-/**
- * Normalise URL pathname (relative URL)
- *
- * - replaces too many consecutive slashes
- * - removes the trailing slash
- *
- * @category location
- */
-function normaliseUrlPathname(pathname) {
+import removeTralingSlash from "./removeTrailingSlash.js";
+export function normaliseUrlPathname(pathname) {
     if (pathname === void 0) { pathname = ""; }
-    return (0, removeTrailingSlash_1.default)(pathname.replace(/\/+/g, "/"));
+    return removeTralingSlash(pathname.replace(/\/+/g, "/"));
 }
-exports.normaliseUrlPathname = normaliseUrlPathname;
-exports.default = normaliseUrlPathname;
+export default normaliseUrlPathname;

package/objectFlip.d.ts

@@ -0,0 +1,2 @@
+export declare function objectFlip<T extends PropertyKey, U extends PropertyKey>(input: Record<T, U>, keyTransformer?: (key: string) => T): Record<U, T>;
+export default objectFlip;

package/objectFlip.js

@@ -0,0 +1,11 @@
+import { __read } from "tslib";
+export function objectFlip(input, keyTransformer) {
+    return Object.fromEntries(Object.entries(input).map(function (_a) {
+        var _b = __read(_a, 2), key = _b[0], value = _b[1];
+        return [
+            value,
+            keyTransformer ? keyTransformer(key) : key,
+        ];
+    }));
+}
+export default objectFlip;

package/objectOmit.d.ts

@@ -1,11 +1,2 @@
-/**
- * Omit object properties by removing the given keys, it returns a
- * new object.
- *
- * NOTE: most of the time using a normal [destructuring assignment](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Destructuring_assignment) is enough,
- * use this utility only when it makes sense.
- *
- * @category objects
- */
 export declare function objectOmit<T extends object, Keys extends (keyof T)[]>(object: T, keys: Keys): Omit<T, Keys[number]>;
 export default objectOmit;

package/objectOmit.js

@@ -1,16 +1,4 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.objectOmit = void 0;
-/**
- * Omit object properties by removing the given keys, it returns a
- * new object.
- *
- * NOTE: most of the time using a normal [destructuring assignment](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Destructuring_assignment) is enough,
- * use this utility only when it makes sense.
- *
- * @category objects
- */
-function objectOmit(object, keys) {
+export function objectOmit(object, keys) {
     return Object.keys(object).reduce(function (output, key) {
         if (!keys.includes(key)) {
             output[key] =
@@ -19,5 +7,4 @@ function objectOmit(object, keys) {
         return output;
     }, {});
 }
-exports.objectOmit = objectOmit;
-exports.default = objectOmit;
+export default objectOmit;

package/objectPick.d.ts

@@ -1,8 +1,2 @@
-/**
- * Pick object properties by selecting only the given keys, it returns a
- * new object.
- *
- * @category objects
- */
 export declare function objectPick<T extends object, Keys extends (keyof T)[]>(object: T, keys: Keys): Pick<T, Keys[number]>;
 export default objectPick;