es-toolkit 1.8.0 → 1.9.0-dev.170

package/dist/array/tail.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/array/tail.ts"],"sourcesContent":["/**\n * Returns an empty array when the input is a single-element array.\n *\n * @param {readonly [T]} arr - The single-element array to process.\n * @returns {[]} An empty array.\n *\n * @example\n * const arr = [1];\n * const result = tail(arr);\n * // result will be []\n */\nexport function tail<T>(arr: readonly [T]): [];\n\n/**\n * Returns an empty array when the input is an empty array.\n *\n * @param {readonly []} arr - The empty array to process.\n * @returns {[]} An empty array.\n *\n * @example\n * const arr = [];\n * const result = tail(arr);\n * // result will be []\n */\nexport function tail(arr: readonly []): [];\n\n/**\n * Returns a new array with all elements except for the first when the input is a tuple array.\n *\n * @param {readonly [T, ...U[]]} arr - The tuple array to process.\n * @returns {U[]} A new array containing all elements of the input array except for the first one.\n *\n * @example\n * const arr = [1, 2, 3];\n * const result = tail(arr);\n * // result will be [2, 3]\n */\nexport function tail<T, U>(arr: readonly [T, ...U[]]): U[];\n\n/**\n * Returns a new array with all elements except for the first.\n *\n * This function takes an array and returns a new array containing all the elements\n * except for the first one. If the input array is empty or has only one element,\n * an empty array is returned.\n *\n * @param {readonly T[]} arr - The array to get the tail of.\n * @returns {T[]} A new array containing all elements of the input array except for the first one.\n *\n * @example\n * const arr1 = [1, 2, 3];\n * const result = tail(arr1);\n * // result will be [2, 3]\n *\n * const arr2 = [1];\n * const result2 = tail(arr2);\n * // result2 will be []\n *\n * const arr3 = [];\n * const result3 = tail(arr3);\n * // result3 will be []\n */\nexport function tail<T>(arr: readonly T[]): T[] {\n  const len = arr.length;\n  if (len <= 1) {\n    return [];\n  }\n  const result = new Array(len - 1);\n  for (let i = 1; i < len; i++) {\n    result[i - 1] = arr[i];\n  }\n  return result;\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AA8DO,SAAS,KAAQ,KAAwB;AAC9C,QAAM,MAAM,IAAI;AAChB,MAAI,OAAO,GAAG;AACZ,WAAO,CAAC;AAAA,EACV;AACA,QAAM,SAAS,IAAI,MAAM,MAAM,CAAC;AAChC,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,WAAO,IAAI,CAAC,IAAI,IAAI,CAAC;AAAA,EACvB;AACA,SAAO;AACT;","names":[]}

package/dist/array/tail.mjs

@@ -0,0 +1,8 @@
+import {
+  tail
+} from "../chunk-OF6NM4G7.mjs";
+import "../chunk-2MM5EJJX.mjs";
+export {
+  tail
+};
+//# sourceMappingURL=tail.mjs.map

package/dist/array/tail.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}

package/dist/array/unzip.d.mts

@@ -0,0 +1,18 @@
+/**
+ * Gathers elements in the same position in an internal array
+ * from a grouped array of elements and returns them as a new array.
+ *
+ * @param zipped - The nested array to unzip.
+ * @returns A new array of unzipped elements.
+ *
+ * @example
+ * const zipped = [['a', true, 1],['b', false, 2]];
+ * const result = unzip(zipped);
+ * // result will be [['a', 'b'], [true, false], [1, 2]]
+ */
+declare function unzip<T extends unknown[]>(zipped: Array<[...T]>): Unzip<T>;
+type Unzip<K extends unknown[]> = {
+    [I in keyof K]: Array<K[I]>;
+};
+
+export { unzip };

package/dist/array/unzip.d.ts

@@ -0,0 +1,18 @@
+/**
+ * Gathers elements in the same position in an internal array
+ * from a grouped array of elements and returns them as a new array.
+ *
+ * @param zipped - The nested array to unzip.
+ * @returns A new array of unzipped elements.
+ *
+ * @example
+ * const zipped = [['a', true, 1],['b', false, 2]];
+ * const result = unzip(zipped);
+ * // result will be [['a', 'b'], [true, false], [1, 2]]
+ */
+declare function unzip<T extends unknown[]>(zipped: Array<[...T]>): Unzip<T>;
+type Unzip<K extends unknown[]> = {
+    [I in keyof K]: Array<K[I]>;
+};
+
+export { unzip };

package/dist/array/unzip.js

@@ -0,0 +1,46 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+
+// src/array/unzip.ts
+var unzip_exports = {};
+__export(unzip_exports, {
+  unzip: () => unzip
+});
+module.exports = __toCommonJS(unzip_exports);
+function unzip(zipped) {
+  let maxLen = 0;
+  for (let i = 0; i < zipped.length; i++) {
+    if (zipped[i].length > maxLen) {
+      maxLen = zipped[i].length;
+    }
+  }
+  const result = new Array(maxLen);
+  for (let i = 0; i < maxLen; i++) {
+    result[i] = new Array(zipped.length);
+    for (let j = 0; j < zipped.length; j++) {
+      result[i][j] = zipped[j][i];
+    }
+  }
+  return result;
+}
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  unzip
+});
+//# sourceMappingURL=unzip.js.map

package/dist/array/unzip.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/array/unzip.ts"],"sourcesContent":["/**\n * Gathers elements in the same position in an internal array \n * from a grouped array of elements and returns them as a new array.\n *\n * @param zipped - The nested array to unzip.\n * @returns A new array of unzipped elements.\n *\n * @example\n * const zipped = [['a', true, 1],['b', false, 2]];\n * const result = unzip(zipped);\n * // result will be [['a', 'b'], [true, false], [1, 2]]\n */\nexport function unzip<T extends unknown[]>(zipped: Array<[...T]>): Unzip<T> {\n  // For performance reasons, use this implementation instead of\n  // const maxLen = Math.max(...zipped.map(arr => arr.length));\n  let maxLen = 0;\n\n  for (let i = 0; i < zipped.length; i++) {\n    if (zipped[i].length > maxLen) {\n      maxLen = zipped[i].length;\n    }\n  }\n\n  const result = new Array(maxLen) as Unzip<T>;\n\n  for (let i = 0; i < maxLen; i++) {\n    result[i] = new Array(zipped.length);\n    for (let j = 0; j < zipped.length; j++) {\n      result[i][j] = zipped[j][i];\n    }\n  }\n\n  return result;\n}\n\ntype Unzip<K extends unknown[]> = { [I in keyof K]: Array<K[I]> };\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAYO,SAAS,MAA2B,QAAiC;AAG1E,MAAI,SAAS;AAEb,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,QAAI,OAAO,CAAC,EAAE,SAAS,QAAQ;AAC7B,eAAS,OAAO,CAAC,EAAE;AAAA,IACrB;AAAA,EACF;AAEA,QAAM,SAAS,IAAI,MAAM,MAAM;AAE/B,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,WAAO,CAAC,IAAI,IAAI,MAAM,OAAO,MAAM;AACnC,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,aAAO,CAAC,EAAE,CAAC,IAAI,OAAO,CAAC,EAAE,CAAC;AAAA,IAC5B;AAAA,EACF;AAEA,SAAO;AACT;","names":[]}

package/dist/array/unzip.mjs

@@ -0,0 +1,8 @@
+import {
+  unzip
+} from "../chunk-UYZKMBDO.mjs";
+import "../chunk-2MM5EJJX.mjs";
+export {
+  unzip
+};
+//# sourceMappingURL=unzip.mjs.map

package/dist/array/unzip.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}

package/dist/chunk-33MSBDC6.mjs

@@ -0,0 +1,21 @@
+// src/array/flatten.ts
+function flatten(arr, depth = 1) {
+  const result = [];
+  const flooredDepth = Math.floor(depth);
+  const recursive = (arr2, currentDepth) => {
+    for (const item of arr2) {
+      if (Array.isArray(item) && currentDepth < flooredDepth) {
+        recursive(item, currentDepth + 1);
+      } else {
+        result.push(item);
+      }
+    }
+  };
+  recursive(arr, 0);
+  return result;
+}
+
+export {
+  flatten
+};
+//# sourceMappingURL=chunk-33MSBDC6.mjs.map

package/dist/chunk-33MSBDC6.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/array/flatten.ts"],"sourcesContent":["/**\n * Flattens an array up to the specified depth.\n *\n * @template T - The type of elements within the array.\n * @template D - The depth to which the array should be flattened.\n * @param {T[]} arr - The array to flatten.\n * @param {D} depth - The depth level specifying how deep a nested array structure should be flattened. Defaults to 1.\n * @returns {Array<FlatArray<T[], D>>} A new array that has been flattened.\n *\n * @example\n * const arr = flatten([1, [2, 3], [4, [5, 6]]], 1);\n * // Returns: [1, 2, 3, 4, [5, 6]]\n *\n * const arr = flatten([1, [2, 3], [4, [5, 6]]], 2);\n * // Returns: [1, 2, 3, 4, 5, 6]\n */\nexport function flatten<T, D extends number = 1>(arr: readonly T[], depth = 1 as D): Array<FlatArray<T[], D>> {\n  const result: Array<FlatArray<T[], D>> = [];\n  const flooredDepth = Math.floor(depth);\n\n  const recursive = (arr: readonly T[], currentDepth: number) => {\n    for (const item of arr) {\n      if (Array.isArray(item) && currentDepth < flooredDepth) {\n        recursive(item, currentDepth + 1);\n      } else {\n        result.push(item as FlatArray<T[], D>);\n      }\n    }\n  };\n\n  recursive(arr, 0);\n  return result;\n}\n"],"mappings":";AAgBO,SAAS,QAAiC,KAAmB,QAAQ,GAAkC;AAC5G,QAAM,SAAmC,CAAC;AAC1C,QAAM,eAAe,KAAK,MAAM,KAAK;AAErC,QAAM,YAAY,CAACA,MAAmB,iBAAyB;AAC7D,eAAW,QAAQA,MAAK;AACtB,UAAI,MAAM,QAAQ,IAAI,KAAK,eAAe,cAAc;AACtD,kBAAU,MAAM,eAAe,CAAC;AAAA,MAClC,OAAO;AACL,eAAO,KAAK,IAAyB;AAAA,MACvC;AAAA,IACF;AAAA,EACF;AAEA,YAAU,KAAK,CAAC;AAChB,SAAO;AACT;","names":["arr"]}

package/dist/{chunk-FLTT2MGF.mjs → chunk-74WWMNZS.mjs}

@@ -11,4 +11,4 @@ function invert(obj) {
 export {
   invert
 };
-//# sourceMappingURL=chunk-FLTT2MGF.mjs.map
+//# sourceMappingURL=chunk-74WWMNZS.mjs.map

package/dist/{chunk-FLTT2MGF.mjs.map → chunk-74WWMNZS.mjs.map}

@@ -1 +1 @@
-{"version":3,"sources":["../src/object/invert.ts"],"sourcesContent":["/**\n * Inverts the keys and values of an object. The keys of the input object become the values of the output object and vice versa.\n *\n * This function takes an object and creates a new object by inverting its keys and values. If the input object has duplicate values,\n * the key of the last occurrence will be used as the value for the new key in the output object. It effectively creates a reverse mapping\n * of the input object's key-value pairs.\n *\n * @template K - Type of the keys in the input object (string, number, symbol)\n * @template V - Type of the values in the input object (string, number, symbol)\n * @param {Record<K, V>} obj - The input object whose keys and values are to be inverted\n * @returns {{ [key in V]: K }} - A new object with keys and values inverted\n *\n * @example\n * invert({ a: 1, b: 2, c: 3 }); // { 1: 'a', 2: 'b', 3: 'c' }\n * invert({ 1: 'a', 2: 'b', 3: 'c' }); // { a: '1', b: '2', c: '3' }\n * invert({ a: 1, 2: 'b', c: 3, 4: 'd' }); // { 1: 'a', b: '2', 3: 'c', d: '4' }\n * invert({ a: Symbol('sym1'), b: Symbol('sym2') }); // { [Symbol('sym1')]: 'a', [Symbol('sym2')]: 'b' }\n */\n\ntype PropertyKey = string | number | symbol;\n\nexport function invert<K extends PropertyKey, V extends PropertyKey>(obj: Record<K, V>): { [key in V]: K } {\n  const result = {} as { [key in V]: K };\n\n  for (const key in obj) {\n    const value = obj[key as K] as V;\n    result[value] = key;\n  }\n\n  return result;\n}\n"],"mappings":";AAqBO,SAAS,OAAqD,KAAsC;AACzG,QAAM,SAAS,CAAC;AAEhB,aAAW,OAAO,KAAK;AACrB,UAAM,QAAQ,IAAI,GAAQ;AAC1B,WAAO,KAAK,IAAI;AAAA,EAClB;AAEA,SAAO;AACT;","names":[]}
+{"version":3,"sources":["../src/object/invert.ts"],"sourcesContent":["/**\n * Inverts the keys and values of an object. The keys of the input object become the values of the output object and vice versa.\n *\n * This function takes an object and creates a new object by inverting its keys and values. If the input object has duplicate values,\n * the key of the last occurrence will be used as the value for the new key in the output object. It effectively creates a reverse mapping\n * of the input object's key-value pairs.\n *\n * @template K - Type of the keys in the input object (string, number, symbol)\n * @template V - Type of the values in the input object (string, number, symbol)\n * @param {Record<K, V>} obj - The input object whose keys and values are to be inverted\n * @returns {{ [key in V]: K }} - A new object with keys and values inverted\n *\n * @example\n * invert({ a: 1, b: 2, c: 3 }); // { 1: 'a', 2: 'b', 3: 'c' }\n * invert({ 1: 'a', 2: 'b', 3: 'c' }); // { a: '1', b: '2', c: '3' }\n * invert({ a: 1, 2: 'b', c: 3, 4: 'd' }); // { 1: 'a', b: '2', 3: 'c', d: '4' }\n * invert({ a: Symbol('sym1'), b: Symbol('sym2') }); // { [Symbol('sym1')]: 'a', [Symbol('sym2')]: 'b' }\n */\nexport function invert<K extends PropertyKey, V extends PropertyKey>(obj: Record<K, V>): { [key in V]: K } {\n  const result = {} as { [key in V]: K };\n\n  for (const key in obj) {\n    const value = obj[key as K] as V;\n    result[value] = key;\n  }\n\n  return result;\n}\n"],"mappings":";AAkBO,SAAS,OAAqD,KAAsC;AACzG,QAAM,SAAS,CAAC;AAEhB,aAAW,OAAO,KAAK;AACrB,UAAM,QAAQ,IAAI,GAAQ;AAC1B,WAAO,KAAK,IAAI;AAAA,EAClB;AAEA,SAAO;AACT;","names":[]}

package/dist/{chunk-UNLX2F2Y.mjs → chunk-DPH2KE6O.mjs}

@@ -21,4 +21,4 @@ function range(start, end, step) {
 export {
   range
 };
-//# sourceMappingURL=chunk-UNLX2F2Y.mjs.map
+//# sourceMappingURL=chunk-DPH2KE6O.mjs.map

package/dist/chunk-DPH2KE6O.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/math/range.ts"],"sourcesContent":["/**\n * Returns an array of numbers from `start` to `end`, incrementing by `step`.\n *\n * If `step` is not provided, it defaults to `1`.\n *\n * @param {number} start - The starting number of the range (inclusive).\n * @param {number} [end] - The end number of the range (exclusive).\n * @param {number} [step] - The step value for the range. (default: 1)\n * @returns {number[]} An array of numbers from `start` to `end` with the specified `step`.\n *\n * @example\n * // Returns [0, 1, 2, 3]\n * range(4);\n *\n * @example\n * // Returns [0, 5, 10, 15]\n * range(0, 20, 5);\n *\n * @example\n * // Returns [0, -1, -2, -3]\n * range(0, -4, -1);\n *\n * @example\n * // Throws an error: The step value must be a non-zero integer.\n * range(1, 4, 0);\n */\nexport function range(end: number): number[];\nexport function range(start: number, end: number): number[];\nexport function range(start: number, end: number, step: number): number[];\nexport function range(start: number, end?: number, step?: number): number[] {\n  if (end == null) {\n    end = start;\n    start = 0;\n  }\n\n  if (step == null) {\n    step = 1;\n  }\n\n  if (!Number.isInteger(step) || step === 0) {\n    throw new Error(`The step value must be a non-zero integer.`);\n  }\n\n  const length = Math.max(Math.ceil((end - start) / step), 0);\n  const result = new Array(length);\n\n  for (let i = 0; i < length; i++) {\n    result[i] = start + i * step;\n  }\n\n  return result;\n}\n"],"mappings":";AA6BO,SAAS,MAAM,OAAe,KAAc,MAAyB;AAC1E,MAAI,OAAO,MAAM;AACf,UAAM;AACN,YAAQ;AAAA,EACV;AAEA,MAAI,QAAQ,MAAM;AAChB,WAAO;AAAA,EACT;AAEA,MAAI,CAAC,OAAO,UAAU,IAAI,KAAK,SAAS,GAAG;AACzC,UAAM,IAAI,MAAM,4CAA4C;AAAA,EAC9D;AAEA,QAAM,SAAS,KAAK,IAAI,KAAK,MAAM,MAAM,SAAS,IAAI,GAAG,CAAC;AAC1D,QAAM,SAAS,IAAI,MAAM,MAAM;AAE/B,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,WAAO,CAAC,IAAI,QAAQ,IAAI;AAAA,EAC1B;AAEA,SAAO;AACT;","names":[]}

package/dist/chunk-HM2JT2RX.mjs

@@ -0,0 +1,9 @@
+// src/array/head.ts
+function head(arr) {
+  return arr[0];
+}
+
+export {
+  head
+};
+//# sourceMappingURL=chunk-HM2JT2RX.mjs.map

package/dist/chunk-HM2JT2RX.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/array/head.ts"],"sourcesContent":["/**\n * Returns the first element of an array.\n *\n * This function takes an array and returns the first element of the array.\n * If the array is empty, the function returns `undefined`.\n *\n * @param {T[]} arr - The array from which to get the first element.\n * @returns {T | undefined} The first element of the array, or `undefined` if the array is empty.\n *\n * @example\n * const arr = [1, 2, 3];\n * const firstElement = head(arr);\n * // firstElement will be 1\n *\n * const emptyArr: number[] = [];\n * const noElement = head(emptyArr);\n * // noElement will be undefined\n */\nexport function head<T>(arr: readonly [T, ...T[]]): T;\nexport function head<T>(arr: readonly T[]): T | undefined;\nexport function head<T>(arr: readonly T[]): T | undefined {\n  return arr[0];\n}\n"],"mappings":";AAoBO,SAAS,KAAQ,KAAkC;AACxD,SAAO,IAAI,CAAC;AACd;","names":[]}

package/dist/chunk-LOY6PATI.mjs

@@ -0,0 +1 @@
+//# sourceMappingURL=chunk-LOY6PATI.mjs.map

package/dist/chunk-LOY6PATI.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"sourcesContent":[],"mappings":"","names":[]}

package/dist/chunk-OF6NM4G7.mjs

@@ -0,0 +1,17 @@
+// src/array/tail.ts
+function tail(arr) {
+  const len = arr.length;
+  if (len <= 1) {
+    return [];
+  }
+  const result = new Array(len - 1);
+  for (let i = 1; i < len; i++) {
+    result[i - 1] = arr[i];
+  }
+  return result;
+}
+
+export {
+  tail
+};
+//# sourceMappingURL=chunk-OF6NM4G7.mjs.map

package/dist/chunk-OF6NM4G7.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/array/tail.ts"],"sourcesContent":["/**\n * Returns an empty array when the input is a single-element array.\n *\n * @param {readonly [T]} arr - The single-element array to process.\n * @returns {[]} An empty array.\n *\n * @example\n * const arr = [1];\n * const result = tail(arr);\n * // result will be []\n */\nexport function tail<T>(arr: readonly [T]): [];\n\n/**\n * Returns an empty array when the input is an empty array.\n *\n * @param {readonly []} arr - The empty array to process.\n * @returns {[]} An empty array.\n *\n * @example\n * const arr = [];\n * const result = tail(arr);\n * // result will be []\n */\nexport function tail(arr: readonly []): [];\n\n/**\n * Returns a new array with all elements except for the first when the input is a tuple array.\n *\n * @param {readonly [T, ...U[]]} arr - The tuple array to process.\n * @returns {U[]} A new array containing all elements of the input array except for the first one.\n *\n * @example\n * const arr = [1, 2, 3];\n * const result = tail(arr);\n * // result will be [2, 3]\n */\nexport function tail<T, U>(arr: readonly [T, ...U[]]): U[];\n\n/**\n * Returns a new array with all elements except for the first.\n *\n * This function takes an array and returns a new array containing all the elements\n * except for the first one. If the input array is empty or has only one element,\n * an empty array is returned.\n *\n * @param {readonly T[]} arr - The array to get the tail of.\n * @returns {T[]} A new array containing all elements of the input array except for the first one.\n *\n * @example\n * const arr1 = [1, 2, 3];\n * const result = tail(arr1);\n * // result will be [2, 3]\n *\n * const arr2 = [1];\n * const result2 = tail(arr2);\n * // result2 will be []\n *\n * const arr3 = [];\n * const result3 = tail(arr3);\n * // result3 will be []\n */\nexport function tail<T>(arr: readonly T[]): T[] {\n  const len = arr.length;\n  if (len <= 1) {\n    return [];\n  }\n  const result = new Array(len - 1);\n  for (let i = 1; i < len; i++) {\n    result[i - 1] = arr[i];\n  }\n  return result;\n}\n"],"mappings":";AA8DO,SAAS,KAAQ,KAAwB;AAC9C,QAAM,MAAM,IAAI;AAChB,MAAI,OAAO,GAAG;AACZ,WAAO,CAAC;AAAA,EACV;AACA,QAAM,SAAS,IAAI,MAAM,MAAM,CAAC;AAChC,WAAS,IAAI,GAAG,IAAI,KAAK,KAAK;AAC5B,WAAO,IAAI,CAAC,IAAI,IAAI,CAAC;AAAA,EACvB;AACA,SAAO;AACT;","names":[]}

package/dist/chunk-UYZKMBDO.mjs

@@ -0,0 +1,22 @@
+// src/array/unzip.ts
+function unzip(zipped) {
+  let maxLen = 0;
+  for (let i = 0; i < zipped.length; i++) {
+    if (zipped[i].length > maxLen) {
+      maxLen = zipped[i].length;
+    }
+  }
+  const result = new Array(maxLen);
+  for (let i = 0; i < maxLen; i++) {
+    result[i] = new Array(zipped.length);
+    for (let j = 0; j < zipped.length; j++) {
+      result[i][j] = zipped[j][i];
+    }
+  }
+  return result;
+}
+
+export {
+  unzip
+};
+//# sourceMappingURL=chunk-UYZKMBDO.mjs.map

package/dist/chunk-UYZKMBDO.mjs.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../src/array/unzip.ts"],"sourcesContent":["/**\n * Gathers elements in the same position in an internal array \n * from a grouped array of elements and returns them as a new array.\n *\n * @param zipped - The nested array to unzip.\n * @returns A new array of unzipped elements.\n *\n * @example\n * const zipped = [['a', true, 1],['b', false, 2]];\n * const result = unzip(zipped);\n * // result will be [['a', 'b'], [true, false], [1, 2]]\n */\nexport function unzip<T extends unknown[]>(zipped: Array<[...T]>): Unzip<T> {\n  // For performance reasons, use this implementation instead of\n  // const maxLen = Math.max(...zipped.map(arr => arr.length));\n  let maxLen = 0;\n\n  for (let i = 0; i < zipped.length; i++) {\n    if (zipped[i].length > maxLen) {\n      maxLen = zipped[i].length;\n    }\n  }\n\n  const result = new Array(maxLen) as Unzip<T>;\n\n  for (let i = 0; i < maxLen; i++) {\n    result[i] = new Array(zipped.length);\n    for (let j = 0; j < zipped.length; j++) {\n      result[i][j] = zipped[j][i];\n    }\n  }\n\n  return result;\n}\n\ntype Unzip<K extends unknown[]> = { [I in keyof K]: Array<K[I]> };\n"],"mappings":";AAYO,SAAS,MAA2B,QAAiC;AAG1E,MAAI,SAAS;AAEb,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,QAAI,OAAO,CAAC,EAAE,SAAS,QAAQ;AAC7B,eAAS,OAAO,CAAC,EAAE;AAAA,IACrB;AAAA,EACF;AAEA,QAAM,SAAS,IAAI,MAAM,MAAM;AAE/B,WAAS,IAAI,GAAG,IAAI,QAAQ,KAAK;AAC/B,WAAO,CAAC,IAAI,IAAI,MAAM,OAAO,MAAM;AACnC,aAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,aAAO,CAAC,EAAE,CAAC,IAAI,OAAO,CAAC,EAAE,CAAC;AAAA,IAC5B;AAAA,EACF;AAEA,SAAO;AACT;","names":[]}

package/dist/index.d.mts

@@ -9,6 +9,7 @@ export { dropRight } from './array/dropRight.mjs';
 export { dropRightWhile } from './array/dropRightWhile.mjs';
 export { dropWhile } from './array/dropWhile.mjs';
 export { fill } from './array/fill.mjs';
+export { flatten } from './array/flatten.mjs';
 export { forEachRight } from './array/forEachRight.mjs';
 export { groupBy } from './array/groupBy.mjs';
 export { intersection } from './array/intersection.mjs';
@@ -32,6 +33,7 @@ export { unionWith } from './array/unionWith.mjs';
 export { uniq } from './array/uniq.mjs';
 export { uniqBy } from './array/uniqBy.mjs';
 export { uniqWith } from './array/uniqWith.mjs';
+export { unzip } from './array/unzip.mjs';
 export { unzipWith } from './array/unzipWith.mjs';
 export { xor } from './array/xor.mjs';
 export { xorBy } from './array/xorBy.mjs';
@@ -40,6 +42,8 @@ export { zip } from './array/zip.mjs';
 export { zipObject } from './array/zipObject.mjs';
 export { zipWith } from './array/zipWith.mjs';
 export { without } from './array/without.mjs';
+export { head } from './array/head.mjs';
+export { tail } from './array/tail.mjs';
 export { AbortError } from './error/AbortError.mjs';
 export { debounce } from './function/debounce.mjs';
 export { noop } from './function/noop.mjs';

package/dist/index.d.ts

@@ -9,6 +9,7 @@ export { dropRight } from './array/dropRight.js';
 export { dropRightWhile } from './array/dropRightWhile.js';
 export { dropWhile } from './array/dropWhile.js';
 export { fill } from './array/fill.js';
+export { flatten } from './array/flatten.js';
 export { forEachRight } from './array/forEachRight.js';
 export { groupBy } from './array/groupBy.js';
 export { intersection } from './array/intersection.js';
@@ -32,6 +33,7 @@ export { unionWith } from './array/unionWith.js';
 export { uniq } from './array/uniq.js';
 export { uniqBy } from './array/uniqBy.js';
 export { uniqWith } from './array/uniqWith.js';
+export { unzip } from './array/unzip.js';
 export { unzipWith } from './array/unzipWith.js';
 export { xor } from './array/xor.js';
 export { xorBy } from './array/xorBy.js';
@@ -40,6 +42,8 @@ export { zip } from './array/zip.js';
 export { zipObject } from './array/zipObject.js';
 export { zipWith } from './array/zipWith.js';
 export { without } from './array/without.js';
+export { head } from './array/head.js';
+export { tail } from './array/tail.js';
 export { AbortError } from './error/AbortError.js';
 export { debounce } from './function/debounce.js';
 export { noop } from './function/noop.js';

package/dist/index.js

@@ -49,8 +49,10 @@ __export(src_exports, {
   dropRightWhile: () => dropRightWhile,
   dropWhile: () => dropWhile,
   fill: () => fill,
+  flatten: () => flatten,
   forEachRight: () => forEachRight,
   groupBy: () => groupBy,
+  head: () => head,
   inRange: () => inRange,
   intersection: () => intersection,
   intersectionBy: () => intersectionBy,
@@ -81,6 +83,7 @@ __export(src_exports, {
   sampleSize: () => sampleSize,
   shuffle: () => shuffle,
   sum: () => sum,
+  tail: () => tail,
   take: () => take,
   takeRight: () => takeRight,
   takeRightWhile: () => takeRightWhile,
@@ -92,6 +95,7 @@ __export(src_exports, {
   uniq: () => uniq,
   uniqBy: () => uniqBy,
   uniqWith: () => uniqWith,
+  unzip: () => unzip,
   unzipWith: () => unzipWith,
   without: () => without,
   xor: () => xor,
@@ -199,6 +203,23 @@ function fill(arr, value, start = 0, end = arr.length) {
   return arr;
 }
 
+// src/array/flatten.ts
+function flatten(arr, depth = 1) {
+  const result = [];
+  const flooredDepth = Math.floor(depth);
+  const recursive = (arr2, currentDepth) => {
+    for (const item of arr2) {
+      if (Array.isArray(item) && currentDepth < flooredDepth) {
+        recursive(item, currentDepth + 1);
+      } else {
+        result.push(item);
+      }
+    }
+  };
+  recursive(arr, 0);
+  return result;
+}
+
 // src/array/forEachRight.ts
 function forEachRight(arr, callback) {
   for (let i = arr.length - 1; i >= 0; i--) {
@@ -457,6 +478,24 @@ function uniqBy(arr, mapper) {
   return Array.from(map.values());
 }
 
+// src/array/unzip.ts
+function unzip(zipped) {
+  let maxLen = 0;
+  for (let i = 0; i < zipped.length; i++) {
+    if (zipped[i].length > maxLen) {
+      maxLen = zipped[i].length;
+    }
+  }
+  const result = new Array(maxLen);
+  for (let i = 0; i < maxLen; i++) {
+    result[i] = new Array(zipped.length);
+    for (let j = 0; j < zipped.length; j++) {
+      result[i][j] = zipped[j][i];
+    }
+  }
+  return result;
+}
+
 // src/array/unzipWith.ts
 function unzipWith(target, iteratee) {
   const maxLength = Math.max(...target.map((innerArray) => innerArray.length));
@@ -532,6 +571,24 @@ function without(array, ...values) {
   return array.filter((item) => !valuesSet.has(item));
 }
 
+// src/array/head.ts
+function head(arr) {
+  return arr[0];
+}
+
+// src/array/tail.ts
+function tail(arr) {
+  const len = arr.length;
+  if (len <= 1) {
+    return [];
+  }
+  const result = new Array(len - 1);
+  for (let i = 1; i < len; i++) {
+    result[i - 1] = arr[i];
+  }
+  return result;
+}
+
 // src/error/AbortError.ts
 var AbortError = class extends Error {
   constructor(message = "The operation was aborted") {
@@ -775,8 +832,10 @@ function delay(ms, { signal } = {}) {
   dropRightWhile,
   dropWhile,
   fill,
+  flatten,
   forEachRight,
   groupBy,
+  head,
   inRange,
   intersection,
   intersectionBy,
@@ -807,6 +866,7 @@ function delay(ms, { signal } = {}) {
   sampleSize,
   shuffle,
   sum,
+  tail,
   take,
   takeRight,
   takeRightWhile,
@@ -818,6 +878,7 @@ function delay(ms, { signal } = {}) {
   uniq,
   uniqBy,
   uniqWith,
+  unzip,
   unzipWith,
   without,
   xor,