es-toolkit 1.8.0-dev.167 → 1.8.0-dev.169

package/dist/array/index.mjs

@@ -1,4 +1,7 @@
-import "../chunk-467PWPPF.mjs";
+import "../chunk-LOY6PATI.mjs";
+import {
+  without
+} from "../chunk-PYEYV7BY.mjs";
 import {
   xor
 } from "../chunk-L7FQX5MN.mjs";
@@ -17,12 +20,18 @@ import {
 import {
   zipWith
 } from "../chunk-4KYXHZ4R.mjs";
+import {
+  union
+} from "../chunk-R6QA7PLZ.mjs";
 import {
   unionBy
 } from "../chunk-NFS7RWWE.mjs";
 import {
   unionWith
 } from "../chunk-2ZCITDMK.mjs";
+import {
+  uniq
+} from "../chunk-DVK2N4KC.mjs";
 import {
   uniqBy
 } from "../chunk-OXAZEEGP.mjs";
@@ -35,9 +44,6 @@ import {
 import {
   unzipWith
 } from "../chunk-IFNXROZR.mjs";
-import {
-  without
-} from "../chunk-PYEYV7BY.mjs";
 import {
   sample
 } from "../chunk-2KNLZB7V.mjs";
@@ -49,6 +55,9 @@ import "../chunk-SYWMYQYJ.mjs";
 import {
   shuffle
 } from "../chunk-G7UQ5PUR.mjs";
+import {
+  tail
+} from "../chunk-OF6NM4G7.mjs";
 import {
   take
 } from "../chunk-ME352XO7.mjs";
@@ -61,12 +70,6 @@ import {
 import {
   takeWhile
 } from "../chunk-2IXFGSUA.mjs";
-import {
-  union
-} from "../chunk-R6QA7PLZ.mjs";
-import {
-  uniq
-} from "../chunk-DVK2N4KC.mjs";
 import {
   intersection
 } from "../chunk-FVVSE2F2.mjs";
@@ -91,9 +94,6 @@ import {
 import {
   partition
 } from "../chunk-DN3NOZ3H.mjs";
-import {
-  dropRight
-} from "../chunk-JEKUA56R.mjs";
 import {
   dropRightWhile
 } from "../chunk-JE6JKZU3.mjs";
@@ -103,6 +103,9 @@ import {
 import {
   fill
 } from "../chunk-C4WE4GLC.mjs";
+import {
+  flatten
+} from "../chunk-33MSBDC6.mjs";
 import {
   forEachRight
 } from "../chunk-IEA53J7P.mjs";
@@ -133,6 +136,9 @@ import {
 import {
   drop
 } from "../chunk-S3CORED5.mjs";
+import {
+  dropRight
+} from "../chunk-JEKUA56R.mjs";
 import "../chunk-2MM5EJJX.mjs";
 export {
   chunk,
@@ -146,6 +152,7 @@ export {
   dropRightWhile,
   dropWhile,
   fill,
+  flatten,
   forEachRight,
   groupBy,
   head,
@@ -160,6 +167,7 @@ export {
   sample,
   sampleSize,
   shuffle,
+  tail,
   take,
   takeRight,
   takeRightWhile,

package/dist/array/tail.d.mts

@@ -0,0 +1,38 @@
+/**
+ * Returns an empty array when the input is a single-element array.
+ *
+ * @param {readonly [T]} arr - The single-element array to process.
+ * @returns {[]} An empty array.
+ *
+ * @example
+ * const arr = [1];
+ * const result = tail(arr);
+ * // result will be []
+ */
+declare function tail<T>(arr: readonly [T]): [];
+/**
+ * Returns an empty array when the input is an empty array.
+ *
+ * @param {readonly []} arr - The empty array to process.
+ * @returns {[]} An empty array.
+ *
+ * @example
+ * const arr = [];
+ * const result = tail(arr);
+ * // result will be []
+ */
+declare function tail(arr: readonly []): [];
+/**
+ * Returns a new array with all elements except for the first when the input is a tuple array.
+ *
+ * @param {readonly [T, ...U[]]} arr - The tuple array to process.
+ * @returns {U[]} A new array containing all elements of the input array except for the first one.
+ *
+ * @example
+ * const arr = [1, 2, 3];
+ * const result = tail(arr);
+ * // result will be [2, 3]
+ */
+declare function tail<T, U>(arr: readonly [T, ...U[]]): U[];
+
+export { tail };

package/dist/array/tail.d.ts

@@ -0,0 +1,38 @@
+/**
+ * Returns an empty array when the input is a single-element array.
+ *
+ * @param {readonly [T]} arr - The single-element array to process.
+ * @returns {[]} An empty array.
+ *
+ * @example
+ * const arr = [1];
+ * const result = tail(arr);
+ * // result will be []
+ */
+declare function tail<T>(arr: readonly [T]): [];
+/**
+ * Returns an empty array when the input is an empty array.
+ *
+ * @param {readonly []} arr - The empty array to process.
+ * @returns {[]} An empty array.
+ *
+ * @example
+ * const arr = [];
+ * const result = tail(arr);
+ * // result will be []
+ */
+declare function tail(arr: readonly []): [];
+/**
+ * Returns a new array with all elements except for the first when the input is a tuple array.
+ *
+ * @param {readonly [T, ...U[]]} arr - The tuple array to process.
+ * @returns {U[]} A new array containing all elements of the input array except for the first one.
+ *
+ * @example
+ * const arr = [1, 2, 3];
+ * const result = tail(arr);
+ * // result will be [2, 3]
+ */
+declare function tail<T, U>(arr: readonly [T, ...U[]]): U[];
+
+export { tail };

package/dist/array/tail.js

@@ -0,0 +1,41 @@
+"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/tail.ts
+var tail_exports = {};
+__export(tail_exports, {
+  tail: () => tail
+});
+module.exports = __toCommonJS(tail_exports);
+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;
+}
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  tail
+});
+//# sourceMappingURL=tail.js.map

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/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-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/function/index.mjs

@@ -1,4 +1,7 @@
 import "../chunk-N6EM6ETS.mjs";
+import {
+  debounce
+} from "../chunk-3IP4JVLL.mjs";
 import {
   noop
 } from "../chunk-LKXCOLNY.mjs";
@@ -8,9 +11,6 @@ import {
 import {
   throttle
 } from "../chunk-QOJGMVVR.mjs";
-import {
-  debounce
-} from "../chunk-3IP4JVLL.mjs";
 import "../chunk-2MM5EJJX.mjs";
 export {
   debounce,

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';
@@ -42,6 +43,7 @@ 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';
@@ -42,6 +43,7 @@ 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,6 +49,7 @@ __export(src_exports, {
   dropRightWhile: () => dropRightWhile,
   dropWhile: () => dropWhile,
   fill: () => fill,
+  flatten: () => flatten,
   forEachRight: () => forEachRight,
   groupBy: () => groupBy,
   head: () => head,
@@ -82,6 +83,7 @@ __export(src_exports, {
   sampleSize: () => sampleSize,
   shuffle: () => shuffle,
   sum: () => sum,
+  tail: () => tail,
   take: () => take,
   takeRight: () => takeRight,
   takeRightWhile: () => takeRightWhile,
@@ -201,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--) {
@@ -557,6 +576,19 @@ 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") {
@@ -800,6 +832,7 @@ function delay(ms, { signal } = {}) {
   dropRightWhile,
   dropWhile,
   fill,
+  flatten,
   forEachRight,
   groupBy,
   head,
@@ -833,6 +866,7 @@ function delay(ms, { signal } = {}) {
   sampleSize,
   shuffle,
   sum,
+  tail,
   take,
   takeRight,
   takeRightWhile,