@koine/utils 2.0.0-beta.13 → 2.0.0-beta.130

package/isWeakSet.cjs.js

@@ -0,0 +1,14 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', { value: true });
+
+var getType = require('./getType.cjs.js');
+
+/**
+ * Returns whether the payload is a WeakSet
+ *
+ * @category is
+ */let isWeakSet=t=>"WeakSet"===getType.getType(t);
+
+exports.default = isWeakSet;
+exports.isWeakSet = isWeakSet;

package/isWeakSet.cjs.mjs

@@ -0,0 +1,2 @@
+export * from './isWeakSet.cjs.js';
+export { _default as default } from './isWeakSet.cjs.default.js';

package/isWeakSet.d.ts

@@ -1,7 +1,2 @@
-/**
- * Returns whether the payload is a WeakSet
- *
- * @category is
- */
-export declare function isWeakSet(payload: any): payload is WeakSet<any>;
+export declare let isWeakSet: (payload: any) => payload is WeakSet<any>;
 export default isWeakSet;

package/isWeakSet.esm.d.ts

@@ -0,0 +1,2 @@
+export * from "./isWeakSet";
+export { default } from "./isWeakSet";

package/isWeakSet.esm.js

@@ -0,0 +1,9 @@
+import { getType } from './getType.esm.js';
+
+/**
+ * Returns whether the payload is a WeakSet
+ *
+ * @category is
+ */let isWeakSet=t=>"WeakSet"===getType(t);
+
+export { isWeakSet as default, isWeakSet };

package/kbToBytes.cjs.d.ts

@@ -0,0 +1,2 @@
+export * from "./kbToBytes";
+export { default } from "./kbToBytes";

package/kbToBytes.cjs.default.js

@@ -0,0 +1 @@
+exports._default = require('./kbToBytes.cjs.js').default;

package/kbToBytes.cjs.js

@@ -0,0 +1,12 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', { value: true });
+
+/**
+ * Kilobytes to bytes
+ *
+ * @category format
+ */let kbToBytes=e=>1e3*e;
+
+exports.default = kbToBytes;
+exports.kbToBytes = kbToBytes;

package/kbToBytes.cjs.mjs

@@ -0,0 +1,2 @@
+export * from './kbToBytes.cjs.js';
+export { _default as default } from './kbToBytes.cjs.default.js';

package/kbToBytes.d.ts

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

package/kbToBytes.esm.d.ts

@@ -0,0 +1,2 @@
+export * from "./kbToBytes";
+export { default } from "./kbToBytes";

package/kbToBytes.esm.js

@@ -0,0 +1,7 @@
+/**
+ * Kilobytes to bytes
+ *
+ * @category format
+ */let kbToBytes=e=>1e3*e;
+
+export { kbToBytes as default, kbToBytes };

package/location.cjs.d.ts

@@ -0,0 +1 @@
+export * from "./location";

package/location.cjs.default.js

@@ -0,0 +1 @@
+exports._default = require('./location.cjs.js').default;

package/location.cjs.js

@@ -0,0 +1,2 @@
+'use strict';
+

package/location.cjs.mjs

@@ -0,0 +1,2 @@
+export * from './location.cjs.js';
+export { _default as default } from './location.cjs.default.js';

package/location.d.ts

@@ -1,4 +1 @@
-/**
- * @category location
- */
 export type AnyQueryParams = undefined | null | Record<string | number, unknown>;

package/location.esm.d.ts

@@ -0,0 +1 @@
+export * from "./location";

package/location.esm.js

@@ -0,0 +1 @@
+

package/lowercase.cjs.d.ts

@@ -0,0 +1,2 @@
+export * from "./lowercase";
+export { default } from "./lowercase";

package/lowercase.cjs.default.js

@@ -0,0 +1 @@
+exports._default = require('./lowercase.cjs.js').default;

package/lowercase.cjs.js

@@ -0,0 +1,12 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', { value: true });
+
+/**
+ * Replacement for native `toLowercase` tyescript ready (type narrowing ready)
+ *
+ * @category native
+ */let lowercase=e=>(e||"").toLowerCase();
+
+exports.default = lowercase;
+exports.lowercase = lowercase;

package/lowercase.cjs.mjs

@@ -0,0 +1,2 @@
+export * from './lowercase.cjs.js';
+export { _default as default } from './lowercase.cjs.default.js';

package/lowercase.d.ts

@@ -1,7 +1,2 @@
-/**
- * Replacement for native `toLowercase` tyescript ready (type narrowing ready)
- *
- * @category native
- */
-export declare const lowercase: <T extends string>(str?: T | null | undefined) => Lowercase<T>;
+export declare let lowercase: <T extends string>(str?: null | T) => Lowercase<T>;
 export default lowercase;

package/lowercase.esm.d.ts

@@ -0,0 +1,2 @@
+export * from "./lowercase";
+export { default } from "./lowercase";

package/{lowercase.mjs → lowercase.esm.js}

@@ -2,5 +2,6 @@
  * Replacement for native `toLowercase` tyescript ready (type narrowing ready)
  *
  * @category native
- */ export const lowercase = (str)=>(str || "").toLowerCase();
-export default lowercase;
+ */let lowercase=e=>(e||"").toLowerCase();
+
+export { lowercase as default, lowercase };

package/mapListBy.cjs.d.ts

@@ -0,0 +1,2 @@
+export * from "./mapListBy";
+export { default } from "./mapListBy";

package/mapListBy.cjs.default.js

@@ -0,0 +1 @@
+exports._default = require('./mapListBy.cjs.js').default;

package/mapListBy.cjs.js

@@ -0,0 +1,12 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', { value: true });
+
+/**
+ * Maps an array of objects into a map keyed with the given key
+ *
+ * @category array
+ */let mapListBy=(e=[],t="")=>e.reduce((e,p)=>(e[p[t]]=p,e),{});
+
+exports.default = mapListBy;
+exports.mapListBy = mapListBy;

package/mapListBy.cjs.mjs

@@ -0,0 +1,2 @@
+export * from './mapListBy.cjs.js';
+export { _default as default } from './mapListBy.cjs.default.js';

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 declare let mapListBy: <T extends Record<string | number | symbol, any>>(array?: T[], key?: keyof T) => Record<T[keyof T], T>;
 export default mapListBy;

package/mapListBy.esm.d.ts

@@ -0,0 +1,2 @@
+export * from "./mapListBy";
+export { default } from "./mapListBy";

package/mapListBy.esm.js

@@ -0,0 +1,7 @@
+/**
+ * Maps an array of objects into a map keyed with the given key
+ *
+ * @category array
+ */let mapListBy=(e=[],t="")=>e.reduce((e,p)=>(e[p[t]]=p,e),{});
+
+export { mapListBy as default, mapListBy };

package/matchSorter.cjs.d.ts

@@ -0,0 +1,2 @@
+export * from "./matchSorter";
+export { default } from "./matchSorter";

package/matchSorter.cjs.default.js

@@ -0,0 +1 @@
+exports._default = require('./matchSorter.cjs.js').default;

package/matchSorter.cjs.js

@@ -0,0 +1,103 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', { value: true });
+
+var isString = require('./isString.cjs.js');
+var removeAccents = require('./removeAccents.cjs.js');
+
+let r=(e,t)=>String(e.rankedValue).localeCompare(String(t.rankedValue)),/**
+ * Takes an array of items and a value and returns a new array with the items that match the given value
+ *
+ * @borrows [kentcdodds/match-sorter](https://github.com/kentcdodds/match-sorter)
+ *
+ * @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
+ */l=(e,t,l={})=>{let{keys:u,threshold:a=1,baseSort:o=r,sorter:s=e=>e.sort((e,t)=>i(e,t,o))}=l;return s(e.reduce(function(e,r,o){let i=n(r,u,t,l),{rank:s,keyThreshold:h=a}=i;return s>=h&&e.push({...i,item:r,index:o}),e},[])).map(({item:e})=>e)},/**
+ * 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
+ */n=(e,t,r,l)=>t?c(e,t).reduce(({rank:e,rankedValue:t,keyIndex:n,keyThreshold:a},{itemValue:o,attributes:i},s)=>{let h=u(o,r,l),f=t,{minRanking:c,maxRanking:d,threshold:k}=i;return h<c&&h>=1?h=c:h>d&&(h=d),h>e&&(e=h,n=s,a=k,f=o),{rankedValue:f,rank:e,keyIndex:n,keyThreshold:a}},{rankedValue:e,rank:0,keyIndex:-1,keyThreshold:l.threshold}):{// ends up being duplicate of 'item' in matches but consistent
+    rankedValue:// if keys is not specified, then we assume the item given is ready to be matched
+    e,rank:u(e,r,l),keyIndex:-1,keyThreshold:l.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
+ */u=(e,t,r)=>// too long
+    (e=s(e,r),(t=s(t,r)).length>e.length)?0:// case sensitive equals
+    e===t?7:// case insensitive equals
+    // Lower casing before further comparison
+    (e=e.toLowerCase())===(t=t.toLowerCase())?6:// starts with
+    e.startsWith(t)?5:// word starts with
+    e.includes(` ${t}`)?4:// contains
+    e.includes(t)?3:1===t.length?0:// If the only character in the given stringToRank
+    //   isn't even contained in the testString, then
+    //   it's definitely not a match.
+    // acronym
+    a(e).includes(t)?2:// will return a number between RANKING_MATCHES and
+    // RANKING_MATCHES + 1 depending  on how close of a match it is.
+    o(e,t),/**
+ * Generates an acronym for a string.
+ *
+ * @param {String} string the string for which to produce the acronym
+ * @returns {String} the acronym
+ */a=e=>{let t="";return e.split(" ").forEach(e=>{e.split("-").forEach(e=>{t+=e.substring(0,1);});}),t},/**
+ * 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
+ */o=(e,t)=>{let r=0,l=0;function n(e,t,l){for(let n=l,u=t.length;n<u;n++)if(t[n]===e)return r+=1,n+1;return -1}let u=n(t[0],e,0);if(u<0)return 0;l=u;for(let r=1,u=t.length;r<u;r++)if(!((l=n(t[r],e,l))>-1))return 0;return 1+1/(l-u)*(r/t.length)},/**
+ * 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
+ */i=(e,t,r)=>{let{rank:l,keyIndex:n}=e,{rank:u,keyIndex:a}=t;return l!==u?l>u?-1:1:n===a?// use the base sort function as a tie-breaker
+r(e,t):n<a?-1:1},/**
+ * 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
+ */s=(e,{keepDiacritics:r})=>(// 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
+    e=`${e}`,// toString
+    r||(e=removeAccents.removeAccents(e)),e),/**
+ * 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
+ */h=(e,t)=>{let r;if("object"==typeof t&&(t=t.key),"function"==typeof t)r=t(e);else if(null==e)r=null;else if(Object.hasOwnProperty.call(e,t))r=e[t];else {if(t.includes("."))return f(t,e);r=null;}return(// because `value` can also be undefined
+null==r?[]:Array.isArray(r)?r:[String(r)])},/**
+ * 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
+ */f=(e,t)=>{let r=e.split("."),l=[t];for(let e=0,t=r.length;e<t;e++){let t=r[e],n=[];for(let e=0,r=l.length;e<r;e++){let r=l[e];if(null!=r){if(Object.hasOwnProperty.call(r,t)){let e=r[t];null!=e&&n.push(e);}else "*"===t&&// ensure that values is an array
+(n=n.concat(r));}}l=n;}return Array.isArray(l[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
+[].concat(...l):// Based on our logic it should be an array of strings by now...
+// assuming the user's path terminated in strings
+l},/**
+ * 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}
+ */c=(e,t)=>{let r=[];for(let l=0,n=t.length;l<n;l++){let n=t[l],u=k(n),a=h(e,n);for(let e=0,t=a.length;e<t;e++)r.push({itemValue:a[e],attributes:u});}return r},d={maxRanking:1/0,minRanking:-1/0},/**
+ * 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
+ */k=t=>isString.isString(t)?d:{...d,...t};
+
+exports.default = l;
+exports.defaultBaseSortFn = r;
+exports.matchSorter = l;

package/matchSorter.cjs.mjs

@@ -0,0 +1,2 @@
+export * from './matchSorter.cjs.js';
+export { _default as default } from './matchSorter.cjs.default.js';

package/matchSorter.d.ts

@@ -47,15 +47,8 @@ declare const RANKING_ACRONYM = 2;
 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>;
+declare let defaultBaseSortFn: BaseSorter<unknown>;
+declare let matchSorter: <ItemType = string>(items: ReadonlyArray<ItemType>, value: string, options?: MatchSorterOptions<ItemType>) => Array<ItemType>;
 export { matchSorter, defaultBaseSortFn };
 export type { MatchSorterOptions, KeyAttributesOptions, KeyOption, KeyAttributes, RankingInfo, ValueGetterKey, };
 export default matchSorter;

package/matchSorter.esm.d.ts

@@ -0,0 +1,2 @@
+export * from "./matchSorter";
+export { default } from "./matchSorter";

package/matchSorter.esm.js

@@ -0,0 +1,97 @@
+import { isString } from './isString.esm.js';
+import { removeAccents } from './removeAccents.esm.js';
+
+let r=(e,t)=>String(e.rankedValue).localeCompare(String(t.rankedValue)),/**
+ * Takes an array of items and a value and returns a new array with the items that match the given value
+ *
+ * @borrows [kentcdodds/match-sorter](https://github.com/kentcdodds/match-sorter)
+ *
+ * @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
+ */l=(e,t,l={})=>{let{keys:u,threshold:a=1,baseSort:o=r,sorter:s=e=>e.sort((e,t)=>i(e,t,o))}=l;return s(e.reduce(function(e,r,o){let i=n(r,u,t,l),{rank:s,keyThreshold:h=a}=i;return s>=h&&e.push({...i,item:r,index:o}),e},[])).map(({item:e})=>e)},/**
+ * 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
+ */n=(e,t,r,l)=>t?c(e,t).reduce(({rank:e,rankedValue:t,keyIndex:n,keyThreshold:a},{itemValue:o,attributes:i},s)=>{let h=u(o,r,l),f=t,{minRanking:c,maxRanking:d,threshold:k}=i;return h<c&&h>=1?h=c:h>d&&(h=d),h>e&&(e=h,n=s,a=k,f=o),{rankedValue:f,rank:e,keyIndex:n,keyThreshold:a}},{rankedValue:e,rank:0,keyIndex:-1,keyThreshold:l.threshold}):{// ends up being duplicate of 'item' in matches but consistent
+    rankedValue:// if keys is not specified, then we assume the item given is ready to be matched
+    e,rank:u(e,r,l),keyIndex:-1,keyThreshold:l.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
+ */u=(e,t,r)=>// too long
+    (e=s(e,r),(t=s(t,r)).length>e.length)?0:// case sensitive equals
+    e===t?7:// case insensitive equals
+    // Lower casing before further comparison
+    (e=e.toLowerCase())===(t=t.toLowerCase())?6:// starts with
+    e.startsWith(t)?5:// word starts with
+    e.includes(` ${t}`)?4:// contains
+    e.includes(t)?3:1===t.length?0:// If the only character in the given stringToRank
+    //   isn't even contained in the testString, then
+    //   it's definitely not a match.
+    // acronym
+    a(e).includes(t)?2:// will return a number between RANKING_MATCHES and
+    // RANKING_MATCHES + 1 depending  on how close of a match it is.
+    o(e,t),/**
+ * Generates an acronym for a string.
+ *
+ * @param {String} string the string for which to produce the acronym
+ * @returns {String} the acronym
+ */a=e=>{let t="";return e.split(" ").forEach(e=>{e.split("-").forEach(e=>{t+=e.substring(0,1);});}),t},/**
+ * 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
+ */o=(e,t)=>{let r=0,l=0;function n(e,t,l){for(let n=l,u=t.length;n<u;n++)if(t[n]===e)return r+=1,n+1;return -1}let u=n(t[0],e,0);if(u<0)return 0;l=u;for(let r=1,u=t.length;r<u;r++)if(!((l=n(t[r],e,l))>-1))return 0;return 1+1/(l-u)*(r/t.length)},/**
+ * 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
+ */i=(e,t,r)=>{let{rank:l,keyIndex:n}=e,{rank:u,keyIndex:a}=t;return l!==u?l>u?-1:1:n===a?// use the base sort function as a tie-breaker
+r(e,t):n<a?-1:1},/**
+ * 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
+ */s=(e,{keepDiacritics:r})=>(// 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
+    e=`${e}`,// toString
+    r||(e=removeAccents(e)),e),/**
+ * 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
+ */h=(e,t)=>{let r;if("object"==typeof t&&(t=t.key),"function"==typeof t)r=t(e);else if(null==e)r=null;else if(Object.hasOwnProperty.call(e,t))r=e[t];else {if(t.includes("."))return f(t,e);r=null;}return(// because `value` can also be undefined
+null==r?[]:Array.isArray(r)?r:[String(r)])},/**
+ * 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
+ */f=(e,t)=>{let r=e.split("."),l=[t];for(let e=0,t=r.length;e<t;e++){let t=r[e],n=[];for(let e=0,r=l.length;e<r;e++){let r=l[e];if(null!=r){if(Object.hasOwnProperty.call(r,t)){let e=r[t];null!=e&&n.push(e);}else "*"===t&&// ensure that values is an array
+(n=n.concat(r));}}l=n;}return Array.isArray(l[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
+[].concat(...l):// Based on our logic it should be an array of strings by now...
+// assuming the user's path terminated in strings
+l},/**
+ * 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}
+ */c=(e,t)=>{let r=[];for(let l=0,n=t.length;l<n;l++){let n=t[l],u=k(n),a=h(e,n);for(let e=0,t=a.length;e<t;e++)r.push({itemValue:a[e],attributes:u});}return r},d={maxRanking:1/0,minRanking:-1/0},/**
+ * 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
+ */k=t=>isString(t)?d:{...d,...t};
+
+export { l as default, r as defaultBaseSortFn, l as matchSorter };

package/mbToBytes.cjs.d.ts

@@ -0,0 +1,2 @@
+export * from "./mbToBytes";
+export { default } from "./mbToBytes";

package/mbToBytes.cjs.default.js

@@ -0,0 +1 @@
+exports._default = require('./mbToBytes.cjs.js').default;

package/mbToBytes.cjs.js

@@ -0,0 +1,12 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', { value: true });
+
+/**
+ * Megabytes to bytes
+ *
+ * @category format
+ */let mbToBytes=e=>1e6*e;
+
+exports.default = mbToBytes;
+exports.mbToBytes = mbToBytes;

package/mbToBytes.cjs.mjs

@@ -0,0 +1,2 @@
+export * from './mbToBytes.cjs.js';
+export { _default as default } from './mbToBytes.cjs.default.js';

package/mbToBytes.d.ts

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

package/mbToBytes.esm.d.ts

@@ -0,0 +1,2 @@
+export * from "./mbToBytes";
+export { default } from "./mbToBytes";

package/mbToBytes.esm.js

@@ -0,0 +1,7 @@
+/**
+ * Megabytes to bytes
+ *
+ * @category format
+ */let mbToBytes=e=>1e6*e;
+
+export { mbToBytes as default, mbToBytes };

package/mergeObjects.cjs.d.ts

@@ -0,0 +1,2 @@
+export * from "./mergeObjects";
+export { default } from "./mergeObjects";

package/mergeObjects.cjs.default.js

@@ -0,0 +1 @@
+exports._default = require('./mergeObjects.cjs.js').default;

package/mergeObjects.cjs.js

@@ -0,0 +1,18 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', { value: true });
+
+var isObject = require('./isObject.cjs.js');
+var isUndefined = require('./isUndefined.cjs.js');
+
+/**
+ * Merge two or more objects together. It mutates the target object.
+ *
+ * @category object
+ * @see https://stackoverflow.com/a/46973278/1938970
+ */let mergeObjects=(r,...i)=>{if(!i.length)return r;let m=i.shift();return void 0===m?r:(isObject.isObject(r)&&isObject.isObject(m)&&Object.keys(m).forEach(i=>{isObject.isObject(m[i])?(r[i]||(r[i]={}),mergeObjects(r[i],m[i])):isUndefined.isUndefined(m[i])||// FIXME: assertion here should not be needed but isUndefined does not
+// narrow the type here
+(r[i]=m[i]);}),mergeObjects(r,...i))};
+
+exports.default = mergeObjects;
+exports.mergeObjects = mergeObjects;

package/mergeObjects.cjs.mjs

@@ -0,0 +1,2 @@
+export * from './mergeObjects.cjs.js';
+export { _default as default } from './mergeObjects.cjs.default.js';

package/mergeObjects.d.ts

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

package/mergeObjects.esm.d.ts

@@ -0,0 +1,2 @@
+export * from "./mergeObjects";
+export { default } from "./mergeObjects";

package/mergeObjects.esm.js

@@ -0,0 +1,13 @@
+import { isObject } from './isObject.esm.js';
+import { isUndefined } from './isUndefined.esm.js';
+
+/**
+ * Merge two or more objects together. It mutates the target object.
+ *
+ * @category object
+ * @see https://stackoverflow.com/a/46973278/1938970
+ */let mergeObjects=(r,...i)=>{if(!i.length)return r;let m=i.shift();return void 0===m?r:(isObject(r)&&isObject(m)&&Object.keys(m).forEach(i=>{isObject(m[i])?(r[i]||(r[i]={}),mergeObjects(r[i],m[i])):isUndefined(m[i])||// FIXME: assertion here should not be needed but isUndefined does not
+// narrow the type here
+(r[i]=m[i]);}),mergeObjects(r,...i))};
+
+export { mergeObjects as default, mergeObjects };

package/mergeUrlQueryParams.cjs.d.ts

@@ -0,0 +1,2 @@
+export * from "./mergeUrlQueryParams";
+export { default } from "./mergeUrlQueryParams";

package/mergeUrlQueryParams.cjs.default.js

@@ -0,0 +1 @@
+exports._default = require('./mergeUrlQueryParams.cjs.js').default;

package/mergeUrlQueryParams.cjs.js

@@ -0,0 +1,14 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', { value: true });
+
+var isNull = require('./isNull.cjs.js');
+
+/**
+ * Merge query parameters objects, it *mutates* the first given object argument
+ *
+ * @category location
+ */let mergeUrlQueryParams=(r={},l={})=>{for(let t in l){let m=l[t];r[t]&&isNull.isNull(m)?delete r[t]:r[t]=m;}return r};
+
+exports.default = mergeUrlQueryParams;
+exports.mergeUrlQueryParams = mergeUrlQueryParams;

package/mergeUrlQueryParams.cjs.mjs

@@ -0,0 +1,2 @@
+export * from './mergeUrlQueryParams.cjs.js';
+export { _default as default } from './mergeUrlQueryParams.cjs.default.js';

package/mergeUrlQueryParams.d.ts

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

package/mergeUrlQueryParams.esm.d.ts

@@ -0,0 +1,2 @@
+export * from "./mergeUrlQueryParams";
+export { default } from "./mergeUrlQueryParams";

package/mergeUrlQueryParams.esm.js

@@ -0,0 +1,9 @@
+import { isNull } from './isNull.esm.js';
+
+/**
+ * Merge query parameters objects, it *mutates* the first given object argument
+ *
+ * @category location
+ */let mergeUrlQueryParams=(r={},l={})=>{for(let t in l){let m=l[t];r[t]&&isNull(m)?delete r[t]:r[t]=m;}return r};
+
+export { mergeUrlQueryParams as default, mergeUrlQueryParams };

package/moveSortableArrayItemByKey.cjs.d.ts

@@ -0,0 +1,2 @@
+export * from "./moveSortableArrayItemByKey";
+export { default } from "./moveSortableArrayItemByKey";