@catbee/utils 0.0.8-rc.1 → 0.0.8-rc.2

package/build/esm/types/api-response.d.ts

@@ -149,4 +149,3 @@ export interface PaginationParams {
  * Type that combines pagination parameters with additional data.
  */
 export type WithPagination<T = {}> = PaginationParams & T;
-//# sourceMappingURL=api-response.d.ts.map

package/build/esm/types/api-response.js

@@ -31,4 +31,3 @@ export var SortDirection;
     /** Descending sort order */
     SortDirection["DESC"] = "desc";
 })(SortDirection || (SortDirection = {}));
-//# sourceMappingURL=api-response.js.map

package/build/esm/types/index.d.ts

@@ -122,4 +122,3 @@ export type Optional2<T, K extends keyof T> = Omit<T, K> & Partial<Pick<T, K>>;
 export type Without<T, U> = {
     [P in keyof T as T[P] extends U ? never : P]: T[P];
 };
-//# sourceMappingURL=index.d.ts.map

package/build/esm/types/index.js

@@ -22,4 +22,3 @@
  * SOFTWARE.
  */
 export {};
-//# sourceMappingURL=index.js.map

package/build/esm/types/server.d.ts

@@ -265,4 +265,3 @@ export interface ServerHooks {
     /** Called before response is sent - good for response modification */
     onResponse?: (req: Request, res: Response, next: NextFunction) => void;
 }
-//# sourceMappingURL=server.d.ts.map

package/build/esm/types/server.js

@@ -22,4 +22,3 @@
  * SOFTWARE.
  */
 export {};
-//# sourceMappingURL=server.js.map

package/build/esm/utils/array.utils.d.ts

@@ -165,4 +165,3 @@ export declare function compact<T>(array: T[]): NonNullable<T>[];
  * @returns {Record<string, number>} Object with counts by key.
  */
 export declare function countBy<T>(array: T[], keyFn: (item: T) => string | number | symbol): Record<string, number>;
-//# sourceMappingURL=array.utils.d.ts.map

package/build/esm/utils/array.utils.js

@@ -21,31 +21,6 @@
  * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  * SOFTWARE.
  */
-var __read = (this && this.__read) || function (o, n) {
-    var m = typeof Symbol === "function" && o[Symbol.iterator];
-    if (!m) return o;
-    var i = m.call(o), r, ar = [], e;
-    try {
-        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
-    }
-    catch (error) { e = { error: error }; }
-    finally {
-        try {
-            if (r && !r.done && (m = i["return"])) m.call(i);
-        }
-        finally { if (e) throw e.error; }
-    }
-    return ar;
-};
-var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
-    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
-        if (ar || !(i in from)) {
-            if (!ar) ar = Array.prototype.slice.call(from, 0, i);
-            ar[i] = from[i];
-        }
-    }
-    return to.concat(ar || Array.prototype.slice.call(from));
-};
 import { getValueByPath } from './obj.utils';
 /**
  * Splits an array into chunks of the specified size.
@@ -64,7 +39,7 @@ export function chunk(array, size) {
         return [];
     if (!Number.isInteger(size) || size <= 0)
         throw new Error('Chunk size must be a positive integer');
-    return Array.from({ length: Math.ceil(array.length / size) }, function (_, i) { return array.slice(i * size, i * size + size); });
+    return Array.from({ length: Math.ceil(array.length / size) }, (_, i) => array.slice(i * size, i * size + size));
 }
 /**
  * Removes duplicate values from an array.
@@ -80,9 +55,9 @@ export function unique(array, keyFn) {
         return [];
     if (!keyFn)
         return Array.from(new Set(array));
-    var seen = new Set();
-    return array.filter(function (item) {
-        var key = keyFn(item);
+    const seen = new Set();
+    return array.filter(item => {
+        const key = keyFn(item);
         if (seen.has(key))
             return false;
         seen.add(key);
@@ -99,9 +74,9 @@ export function unique(array, keyFn) {
 export function flattenDeep(array) {
     if (!Array.isArray(array))
         return [];
-    return array.reduce(function (acc, val) {
+    return array.reduce((acc, val) => {
         if (Array.isArray(val)) {
-            acc.push.apply(acc, __spreadArray([], __read(flattenDeep(val)), false));
+            acc.push(...flattenDeep(val));
         }
         else {
             acc.push(val);
@@ -124,9 +99,9 @@ export function random(array) {
 export function groupBy(array, keyOrFn) {
     if (!Array.isArray(array) || array.length === 0)
         return {};
-    var keyFn = typeof keyOrFn === 'function' ? keyOrFn : function (item) { return item[keyOrFn]; };
-    return array.reduce(function (acc, item) {
-        var key = keyFn(item);
+    const keyFn = typeof keyOrFn === 'function' ? keyOrFn : (item) => item[keyOrFn];
+    return array.reduce((acc, item) => {
+        const key = keyFn(item);
         if (!acc[key])
             acc[key] = [];
         acc[key].push(item);
@@ -143,13 +118,12 @@ export function groupBy(array, keyOrFn) {
  * @throws {TypeError} If array is not an array.
  */
 export function shuffle(array) {
-    var _a;
     if (!Array.isArray(array))
         throw new TypeError('Expected an array');
-    var copy = array.slice();
-    for (var i = copy.length - 1; i > 0; i--) {
-        var j = Math.floor(Math.random() * (i + 1));
-        _a = __read([copy[j], copy[i]], 2), copy[i] = _a[0], copy[j] = _a[1];
+    const copy = array.slice();
+    for (let i = copy.length - 1; i > 0; i--) {
+        const j = Math.floor(Math.random() * (i + 1));
+        [copy[i], copy[j]] = [copy[j], copy[i]];
     }
     return copy;
 }
@@ -165,7 +139,7 @@ export function shuffle(array) {
 export function pluck(array, key) {
     if (!Array.isArray(array))
         return [];
-    return array.map(function (item) { return item[key]; });
+    return array.map(item => item[key]);
 }
 /**
  * Returns values in array A that are not in array B.
@@ -178,8 +152,8 @@ export function pluck(array, key) {
 export function difference(a, b) {
     if (!Array.isArray(a) || !Array.isArray(b))
         return [];
-    var setB = new Set(b);
-    return a.filter(function (item) { return !setB.has(item); });
+    const setB = new Set(b);
+    return a.filter(item => !setB.has(item));
 }
 /**
  * Returns common values between arrays A and B.
@@ -192,8 +166,8 @@ export function difference(a, b) {
 export function intersect(a, b) {
     if (!Array.isArray(a) || !Array.isArray(b))
         return [];
-    var setB = new Set(b);
-    return a.filter(function (item) { return setB.has(item); });
+    const setB = new Set(b);
+    return a.filter(item => setB.has(item));
 }
 /**
  * Sorts an array of objects by a nested key using Merge Sort (O(n log n)).
@@ -206,16 +180,15 @@ export function intersect(a, b) {
  * @returns {T[]} A new sorted array.
  * @throws {TypeError} If array is not an array.
  */
-export function mergeSort(array, key, direction) {
-    if (direction === void 0) { direction = 'asc'; }
+export function mergeSort(array, key, direction = 'asc') {
     if (!Array.isArray(array))
         throw new TypeError('Expected array');
     if (array.length <= 1)
         return array.slice();
-    var keyFn = typeof key === 'function' ? key : function (item) { return getValueByPath(item, key); };
-    var compare = function (a, b) {
-        var aVal = keyFn(a);
-        var bVal = keyFn(b);
+    const keyFn = typeof key === 'function' ? key : (item) => getValueByPath(item, key);
+    const compare = (a, b) => {
+        const aVal = keyFn(a);
+        const bVal = keyFn(b);
         // Sorts undefined/null last for "asc", first for "desc"
         if (aVal === bVal)
             return 0;
@@ -225,9 +198,9 @@ export function mergeSort(array, key, direction) {
             return direction === 'asc' ? -1 : 1;
         return direction === 'asc' ? (aVal < bVal ? -1 : 1) : aVal > bVal ? -1 : 1;
     };
-    var merge = function (left, right) {
-        var result = [];
-        var i = 0, j = 0;
+    const merge = (left, right) => {
+        const result = [];
+        let i = 0, j = 0;
         while (i < left.length && j < right.length) {
             if (compare(left[i], right[j]) <= 0)
                 result.push(left[i++]);
@@ -236,12 +209,12 @@ export function mergeSort(array, key, direction) {
         }
         return result.concat(left.slice(i)).concat(right.slice(j));
     };
-    var sort = function (arr) {
+    const sort = (arr) => {
         if (arr.length <= 1)
             return arr;
-        var mid = Math.floor(arr.length / 2);
-        var left = sort(arr.slice(0, mid));
-        var right = sort(arr.slice(mid));
+        const mid = Math.floor(arr.length / 2);
+        const left = sort(arr.slice(0, mid));
+        const right = sort(arr.slice(mid));
         return merge(left, right);
     };
     return sort(array);
@@ -254,23 +227,16 @@ export function mergeSort(array, key, direction) {
  * @param {...Array<T>[]} arrays - Two or more arrays to zip together.
  * @returns {Array<T[]>} Array of grouped elements.
  */
-export function zip() {
-    var arrays = [];
-    for (var _i = 0; _i < arguments.length; _i++) {
-        arrays[_i] = arguments[_i];
-    }
+export function zip(...arrays) {
     if (arrays.length === 0)
         return [];
-    if (arrays.some(function (arr) { return !Array.isArray(arr); })) {
+    if (arrays.some(arr => !Array.isArray(arr))) {
         throw new TypeError('All arguments must be arrays');
     }
-    var minLength = Math.min.apply(Math, __spreadArray([], __read(arrays.map(function (arr) { return arr.length; })), false));
-    var result = [];
-    var _loop_1 = function (i) {
-        result.push(arrays.map(function (arr) { return arr[i]; }));
-    };
-    for (var i = 0; i < minLength; i++) {
-        _loop_1(i);
+    const minLength = Math.min(...arrays.map(arr => arr.length));
+    const result = [];
+    for (let i = 0; i < minLength; i++) {
+        result.push(arrays.map(arr => arr[i]));
     }
     return result;
 }
@@ -285,9 +251,8 @@ export function zip() {
 export function partition(array, predicate) {
     if (!Array.isArray(array))
         return [[], []];
-    return array.reduce(function (_a, item, index) {
-        var _b = __read(_a, 2), pass = _b[0], fail = _b[1];
-        return predicate(item, index, array) ? [__spreadArray(__spreadArray([], __read(pass), false), [item], false), fail] : [pass, __spreadArray(__spreadArray([], __read(fail), false), [item], false)];
+    return array.reduce(([pass, fail], item, index) => {
+        return predicate(item, index, array) ? [[...pass, item], fail] : [pass, [...fail, item]];
     }, [[], []]);
 }
 /**
@@ -298,20 +263,19 @@ export function partition(array, predicate) {
  * @param {number} [step=1] - Step between numbers.
  * @returns {number[]} Array of numbers in range.
  */
-export function range(start, end, step) {
-    if (step === void 0) { step = 1; }
+export function range(start, end, step = 1) {
     if (!Number.isFinite(start) || !Number.isFinite(end) || !Number.isFinite(step)) {
         throw new TypeError('Arguments must be finite numbers');
     }
     if (step === 0)
         throw new Error('Step cannot be zero');
-    var isAscending = step > 0;
+    const isAscending = step > 0;
     if ((isAscending && start >= end) || (!isAscending && start <= end)) {
         return [];
     }
-    var length = Math.max(Math.ceil((end - start) / step), 0);
-    var result = new Array(length);
-    for (var i = 0, value = start; i < length; i++, value += step) {
+    const length = Math.max(Math.ceil((end - start) / step), 0);
+    const result = new Array(length);
+    for (let i = 0, value = start; i < length; i++, value += step) {
         result[i] = value;
     }
     return result;
@@ -324,8 +288,7 @@ export function range(start, end, step) {
  * @param {number} [n=1] - Number of elements to take.
  * @returns {T[]} New array with first n elements.
  */
-export function take(array, n) {
-    if (n === void 0) { n = 1; }
+export function take(array, n = 1) {
     if (!Array.isArray(array) || n <= 0)
         return [];
     return array.slice(0, n);
@@ -341,8 +304,8 @@ export function take(array, n) {
 export function takeWhile(array, predicate) {
     if (!Array.isArray(array))
         return [];
-    var result = [];
-    for (var i = 0; i < array.length; i++) {
+    const result = [];
+    for (let i = 0; i < array.length; i++) {
         if (!predicate(array[i], i))
             break;
         result.push(array[i]);
@@ -373,10 +336,9 @@ export function compact(array) {
 export function countBy(array, keyFn) {
     if (!Array.isArray(array))
         return {};
-    return array.reduce(function (acc, item) {
-        var key = String(keyFn(item));
+    return array.reduce((acc, item) => {
+        const key = String(keyFn(item));
         acc[key] = (acc[key] || 0) + 1;
         return acc;
     }, {});
 }
-//# sourceMappingURL=array.utils.js.map

package/build/esm/utils/async.utils.d.ts

@@ -262,4 +262,3 @@ export declare function runWithConcurrency<T>(tasks: Array<() => Promise<T>>, op
     /** Abort signal to cancel execution */
     signal?: AbortSignal;
 }): Promise<T[]>;
-//# sourceMappingURL=async.utils.d.ts.map