umt 2.1.1 → 2.2.0

package/module/Advance/rangeAdvance.d.ts

@@ -1,10 +1,14 @@
 /**
- * 条件式を満たす数値の配列を返す
- * @param start 開始数値
- * @param end 終了数値
- * @param conditionalExpression 条件式
- * @returns 条件式を満たす数値の配列
- * @example rangeAdvance(1, 10, (number) => number % 2 === 0); // [2, 4, 6, 8]
+ * Returns an array of numbers that satisfy the conditional expression
+ * @param start - Starting number
+ * @param end - Ending number (exclusive)
+ * @param conditionalExpression - Function that determines which numbers to include
+ * @returns Array of numbers that satisfy the conditional expression
+ *
+ * @example
+ * ```ts
+ * rangeAdvance(1, 10, (number) => number % 2 === 0); // [2, 4, 6, 8]
+ * ```
  */
 declare const rangeAdvance: (start: number, end?: number, conditionalExpression?: (number_: number) => boolean) => number[];
 export { rangeAdvance };

package/module/Advance/rangeAdvance.js

@@ -1,11 +1,15 @@
 import { range } from "../Array/range";
 /**
- * 条件式を満たす数値の配列を返す
- * @param start 開始数値
- * @param end 終了数値
- * @param conditionalExpression 条件式
- * @returns 条件式を満たす数値の配列
- * @example rangeAdvance(1, 10, (number) => number % 2 === 0); // [2, 4, 6, 8]
+ * Returns an array of numbers that satisfy the conditional expression
+ * @param start - Starting number
+ * @param end - Ending number (exclusive)
+ * @param conditionalExpression - Function that determines which numbers to include
+ * @returns Array of numbers that satisfy the conditional expression
+ *
+ * @example
+ * ```ts
+ * rangeAdvance(1, 10, (number) => number % 2 === 0); // [2, 4, 6, 8]
+ * ```
  */
 const rangeAdvance = (start, end, conditionalExpression) => {
     if (conditionalExpression) {

package/module/Advance/rangeAdvance.js.map

@@ -1 +1 @@
-{"version":3,"file":"rangeAdvance.js","sourceRoot":"","sources":["../../src/Advance/rangeAdvance.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,eAAe,CAAC;AAEtC;;;;;;;GAOG;AACH,MAAM,YAAY,GAAG,CACnB,KAAa,EACb,GAAY,EACZ,qBAAoD,EAC1C,EAAE;IACZ,IAAI,qBAAqB,EAAE,CAAC;QAC1B,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,IAAI,KAAK,GAAG,KAAK,EAAE,KAAK,GAAI,GAAc,EAAE,KAAK,EAAE,EAAE,CAAC;YACzD,IAAI,qBAAqB,CAAC,KAAK,CAAC,EAAE,CAAC;gBACjC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;AAC3B,CAAC,CAAC;AACF,OAAO,EAAE,YAAY,EAAE,CAAC"}
+{"version":3,"file":"rangeAdvance.js","sourceRoot":"","sources":["../../src/Advance/rangeAdvance.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,eAAe,CAAC;AAEtC;;;;;;;;;;;GAWG;AACH,MAAM,YAAY,GAAG,CACnB,KAAa,EACb,GAAY,EACZ,qBAAoD,EAC1C,EAAE;IACZ,IAAI,qBAAqB,EAAE,CAAC;QAC1B,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,IAAI,KAAK,GAAG,KAAK,EAAE,KAAK,GAAI,GAAc,EAAE,KAAK,EAAE,EAAE,CAAC;YACzD,IAAI,qBAAqB,CAAC,KAAK,CAAC,EAAE,CAAC;gBACjC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,OAAO,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;AAC3B,CAAC,CAAC;AACF,OAAO,EAAE,YAAY,EAAE,CAAC"}

package/module/Array/arraysJoin.d.ts

@@ -1,8 +1,8 @@
 /**
- * 重複をしないで結合
- * @param  {unknown[]} array
- * @param  {unknown[]} arrays
- * @returns unknown[]
+ * Join arrays without duplicates
+ * @param  {unknown[]} array - First array to join
+ * @param  {unknown[]} arrays - Additional arrays to join
+ * @returns {unknown[]} Array with unique elements from all input arrays
  * @example arraysJoin([1, 2, 3], [2, 3, 4]); // [1, 2, 3, 4]
  */
 export declare const arraysJoin: <A extends unknown[]>(array: unknown[], ...arrays: unknown[]) => A;

package/module/Array/arraysJoin.js

@@ -1,8 +1,8 @@
 /**
- * 重複をしないで結合
- * @param  {unknown[]} array
- * @param  {unknown[]} arrays
- * @returns unknown[]
+ * Join arrays without duplicates
+ * @param  {unknown[]} array - First array to join
+ * @param  {unknown[]} arrays - Additional arrays to join
+ * @returns {unknown[]} Array with unique elements from all input arrays
  * @example arraysJoin([1, 2, 3], [2, 3, 4]); // [1, 2, 3, 4]
  */
 export const arraysJoin = (array, ...arrays) => {

package/module/Array/binarySearch.d.ts

@@ -1,6 +1,7 @@
 /**
- * 二分探索法
- * @param arr sortされたnumberの配列
- * @param target 探索する値
+ * Binary search implementation
+ * @param array A sorted array of numbers
+ * @param target The value to search for
+ * @returns The index of the target value in the array, or -1 if not found
  */
 export declare const binarySearch: (array: number[], target: number) => number;

package/module/Array/binarySearch.js

@@ -1,7 +1,8 @@
 /**
- * 二分探索法
- * @param arr sortされたnumberの配列
- * @param target 探索する値
+ * Binary search implementation
+ * @param array A sorted array of numbers
+ * @param target The value to search for
+ * @returns The index of the target value in the array, or -1 if not found
  */
 export const binarySearch = (array, target) => {
     let left = 0;

package/module/Array/binarySearch.js.map

@@ -1 +1 @@
-{"version":3,"file":"binarySearch.js","sourceRoot":"","sources":["../../src/Array/binarySearch.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,KAAe,EAAE,MAAc,EAAU,EAAE;IACtE,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,KAAK,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IAE7B,OAAO,IAAI,IAAI,KAAK,EAAE,CAAC;QACrB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3C,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;QAE5B,IAAI,QAAQ,KAAK,MAAM,EAAE,CAAC;YACxB,OAAO,GAAG,CAAC;QACb,CAAC;QACD,IAAI,QAAQ,GAAG,MAAM,EAAE,CAAC;YACtB,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC;QACjB,CAAC;aAAM,CAAC;YACN,KAAK,GAAG,GAAG,GAAG,CAAC,CAAC;QAClB,CAAC;IACH,CAAC;IAED,OAAO,CAAC,CAAC,CAAC;AACZ,CAAC,CAAC"}
+{"version":3,"file":"binarySearch.js","sourceRoot":"","sources":["../../src/Array/binarySearch.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,KAAe,EAAE,MAAc,EAAU,EAAE;IACtE,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,KAAK,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IAE7B,OAAO,IAAI,IAAI,KAAK,EAAE,CAAC;QACrB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3C,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;QAE5B,IAAI,QAAQ,KAAK,MAAM,EAAE,CAAC;YACxB,OAAO,GAAG,CAAC;QACb,CAAC;QACD,IAAI,QAAQ,GAAG,MAAM,EAAE,CAAC;YACtB,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC;QACjB,CAAC;aAAM,CAAC;YACN,KAAK,GAAG,GAAG,GAAG,CAAC,CAAC;QAClB,CAAC;IACH,CAAC;IAED,OAAO,CAAC,CAAC,CAAC;AACZ,CAAC,CAAC"}

package/module/Array/checkFlagAlignment.d.ts

@@ -1,7 +1,7 @@
 /**
- * フラグが揃っているかどうかをチェックする
- * @param matrix フラグを持つセルの二次元配列
- * @returns フラグが揃っているかどうか
+ * Check if flags are aligned in any direction (horizontal, vertical, or diagonal)
+ * @param matrix Two-dimensional array of cells containing flags
+ * @returns True if flags are aligned in any direction, false otherwise
  * @example checkFlagAlignment([
  *  [{ value: 1, flag: true }, { value: 2, flag: false }, { value: 3, flag: true }],
  *  [{ value: 4, flag: false }, { value: 5, flag: true }, { value: 6, flag: false }],

package/module/Array/checkFlagAlignment.js

@@ -1,7 +1,7 @@
 /**
- * フラグが揃っているかどうかをチェックする
- * @param matrix フラグを持つセルの二次元配列
- * @returns フラグが揃っているかどうか
+ * Check if flags are aligned in any direction (horizontal, vertical, or diagonal)
+ * @param matrix Two-dimensional array of cells containing flags
+ * @returns True if flags are aligned in any direction, false otherwise
  * @example checkFlagAlignment([
  *  [{ value: 1, flag: true }, { value: 2, flag: false }, { value: 3, flag: true }],
  *  [{ value: 4, flag: false }, { value: 5, flag: true }, { value: 6, flag: false }],
@@ -11,23 +11,23 @@
 export const checkFlagAlignment = (matrix) => {
     const rows = matrix.length;
     const cols = matrix[0].length;
-    // 横方向のチェック
+    // Check horizontal alignment
     for (let index = 0; index < rows; index++) {
         if (matrix[index].every((cell) => cell.flag)) {
             return true;
         }
     }
-    // 縦方向のチェック
+    // Check vertical alignment
     for (let index = 0; index < cols; index++) {
         if (matrix.every((row) => row[index].flag)) {
             return true;
         }
     }
-    // 斜め方向のチェック (左上から右下へ)
+    // Check diagonal alignment (top-left to bottom-right)
     if (matrix.every((row, index) => row[index].flag)) {
         return true;
     }
-    // 斜め方向のチェック (左下から右上へ)
+    // Check diagonal alignment (bottom-left to top-right)
     if (matrix.every((row, index) => row[cols - index - 1].flag)) {
         return true;
     }

package/module/Array/checkFlagAlignment.js.map

@@ -1 +1 @@
-{"version":3,"file":"checkFlagAlignment.js","sourceRoot":"","sources":["../../src/Array/checkFlagAlignment.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAChC,MAAa,EACJ,EAAE;IACX,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC;IAC3B,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAE9B,WAAW;IACX,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QAC1C,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7C,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED,WAAW;IACX,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QAC1C,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YAC3C,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED,sBAAsB;IACtB,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QAClD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,sBAAsB;IACtB,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QAC7D,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC,CAAC"}
+{"version":3,"file":"checkFlagAlignment.js","sourceRoot":"","sources":["../../src/Array/checkFlagAlignment.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAChC,MAAa,EACJ,EAAE;IACX,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC;IAC3B,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAE9B,6BAA6B;IAC7B,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QAC1C,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7C,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED,2BAA2B;IAC3B,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QAC1C,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YAC3C,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED,sDAAsD;IACtD,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QAClD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,sDAAsD;IACtD,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QAC7D,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC,CAAC"}

package/module/Array/chunk.d.ts

@@ -1,8 +1,8 @@
 import type { ChunkArrayType } from "../types/array/chunk"; /**
- * 配列を指定した数で分割する
- * @param {T} array 配列
- * @param {N} n 分割数
- * @returns 分割された配列
+ * Split an array into smaller chunks of specified size
+ * @param {T} array The array to split
+ * @param {N} n The size of each chunk
+ * @returns Array of chunks
  * @example chunk([1, 2, 3, 4, 5, 6, 7, 8, 9], 3); // [[1, 2, 3], [4, 5, 6], [7, 8, 9]]
  */
 export declare const chunk: <T extends unknown[], N extends number>(array: T, n: N) => ChunkArrayType<T, N>;

package/module/Array/compact.d.ts

@@ -1 +1,9 @@
+/**
+ * Creates an array with all falsey values removed
+ * @param {T[]} array The array to compact
+ * @returns {T[]} Returns the new array of filtered values
+ * @example
+ * compact([0, 1, false, 2, '', 3]); // [1, 2, 3]
+ * compact([null, undefined, NaN, 0, false, '']); // []
+ */
 export declare const compact: <T>(array: T[]) => T[];

package/module/Array/compact.js

@@ -1,2 +1,10 @@
+/**
+ * Creates an array with all falsey values removed
+ * @param {T[]} array The array to compact
+ * @returns {T[]} Returns the new array of filtered values
+ * @example
+ * compact([0, 1, false, 2, '', 3]); // [1, 2, 3]
+ * compact([null, undefined, NaN, 0, false, '']); // []
+ */
 export const compact = (array) => array.filter(Boolean);
 //# sourceMappingURL=compact.js.map

package/module/Array/compact.js.map

@@ -1 +1 @@
-{"version":3,"file":"compact.js","sourceRoot":"","sources":["../../src/Array/compact.ts"],"names":[],"mappings":"AAAA,MAAM,CAAC,MAAM,OAAO,GAAG,CAAI,KAAU,EAAO,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAQ,CAAC"}
+{"version":3,"file":"compact.js","sourceRoot":"","sources":["../../src/Array/compact.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CAAI,KAAU,EAAO,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAQ,CAAC"}

package/module/Array/compareFunctionDefault.d.ts

@@ -1 +1,14 @@
+/**
+ * Default comparison function that returns:
+ * - 1 if a > b
+ * - -1 if a < b
+ * - 0 if a equals b
+ * @param {T} a First value to compare
+ * @param {T} b Second value to compare
+ * @returns {number} Comparison result (-1, 0, or 1)
+ * @example
+ * compareFunctionDefault(2, 1); // 1
+ * compareFunctionDefault(1, 2); // -1
+ * compareFunctionDefault(2, 2); // 0
+ */
 export declare const compareFunctionDefault: <T>(a: T, b: T) => number;

package/module/Array/compareFunctionDefault.js

@@ -1,2 +1,15 @@
+/**
+ * Default comparison function that returns:
+ * - 1 if a > b
+ * - -1 if a < b
+ * - 0 if a equals b
+ * @param {T} a First value to compare
+ * @param {T} b Second value to compare
+ * @returns {number} Comparison result (-1, 0, or 1)
+ * @example
+ * compareFunctionDefault(2, 1); // 1
+ * compareFunctionDefault(1, 2); // -1
+ * compareFunctionDefault(2, 2); // 0
+ */
 export const compareFunctionDefault = (a, b) => a > b ? 1 : a < b ? -1 : 0;
 //# sourceMappingURL=compareFunctionDefault.js.map

package/module/Array/compareFunctionDefault.js.map

@@ -1 +1 @@
-{"version":3,"file":"compareFunctionDefault.js","sourceRoot":"","sources":["../../src/Array/compareFunctionDefault.ts"],"names":[],"mappings":"AAAA,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAI,CAAI,EAAE,CAAI,EAAU,EAAE,CAC9D,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC"}
+{"version":3,"file":"compareFunctionDefault.js","sourceRoot":"","sources":["../../src/Array/compareFunctionDefault.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAI,CAAI,EAAE,CAAI,EAAU,EAAE,CAC9D,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC"}

package/module/Array/drop.d.ts

@@ -1,9 +1,9 @@
 /**
- * 配列の先頭からn個の要素を除外した新しい配列を返します。
- * @param {T[]} array 対象の配列
- * @param {number} n 除外する要素の数
- * @param {"left" | "right" | "between"} direction 除外する方向
- * @returns n個の要素を除外した新しい配列
+ * Returns a new array with n elements removed from the specified direction
+ * @param {T[]} array The target array
+ * @param {number} n The number of elements to remove
+ * @param {"left" | "right" | "between"} direction The direction to remove elements from
+ * @returns A new array with n elements removed
  *
  * @example drop([1, 2, 3, 4, 5], 2); // [3, 4, 5]
  * @example drop([1, 2, 3, 4, 5], 2, "left"); // [3, 4, 5]

package/module/Array/drop.js

@@ -1,9 +1,9 @@
 /**
- * 配列の先頭からn個の要素を除外した新しい配列を返します。
- * @param {T[]} array 対象の配列
- * @param {number} n 除外する要素の数
- * @param {"left" | "right" | "between"} direction 除外する方向
- * @returns n個の要素を除外した新しい配列
+ * Returns a new array with n elements removed from the specified direction
+ * @param {T[]} array The target array
+ * @param {number} n The number of elements to remove
+ * @param {"left" | "right" | "between"} direction The direction to remove elements from
+ * @returns A new array with n elements removed
  *
  * @example drop([1, 2, 3, 4, 5], 2); // [3, 4, 5]
  * @example drop([1, 2, 3, 4, 5], 2, "left"); // [3, 4, 5]

package/module/Array/dualPivotQuickSort.d.ts

@@ -0,0 +1,16 @@
+type CompareFunction<T> = (a: T, b: T) => number;
+/**
+ * Sort array using dual-pivot quicksort algorithm
+ * More efficient than traditional quicksort for arrays with many duplicate values
+ * @param array - Array to be sorted
+ * @param compareFunction - Optional comparison function
+ * @param startIndex - Optional starting index (default: 0)
+ * @param endIndex - Optional ending index (default: array.length - 1)
+ * @param insertionSortThreshold - Optional threshold for insertion sort (default: 10)
+ * @returns Sorted array
+ * @example
+ * dualPivotQuickSort([3, 1, 4, 1, 5, 9, 2, 6, 5, 3]); // [1, 1, 2, 3, 3, 4, 5, 5, 6, 9]
+ * dualPivotQuickSort(['banana', 'apple', 'orange']); // ['apple', 'banana', 'orange']
+ */
+export declare const dualPivotQuickSort: <T>(array: T[], compareFunction?: CompareFunction<T>, startIndex?: number, endIndex?: number, insertionSortThreshold?: number) => T[];
+export {};

package/module/Array/dualPivotQuickSort.js

@@ -0,0 +1,152 @@
+import { compareFunctionDefault } from "./compareFunctionDefault";
+/**
+ * Get the median of three elements in the array
+ * @param array - The input array
+ * @param a - Index of the first element
+ * @param b - Index of the second element
+ * @param c - Index of the third element
+ * @param compareFunction - Comparison function
+ * @returns Index of the median element
+ */
+const medianOfThree = (array, a, b, c, compareFunction) => {
+    // Return the index of the median value
+    const values = [
+        { index: a, value: array[a] },
+        { index: b, value: array[b] },
+        { index: c, value: array[c] },
+    ];
+    // Sort and return the middle element's index
+    values.sort((x, y) => compareFunction(x.value, y.value));
+    return values[1].index;
+};
+/**
+ * Select dual pivots and partition the array into three parts
+ * @param array - Array to be partitioned
+ * @param low - Starting index
+ * @param high - Ending index
+ * @param compareFunction - Comparison function
+ * @returns Object containing left and right pivot indices
+ */
+const partition = (array, low, high, compareFunction) => {
+    // Select pivot candidates
+    const length = high - low;
+    const gap = Math.max(1, Math.floor(length / 3));
+    // Find optimal pivot positions
+    const leftPivotIndex = medianOfThree(array, low, low + gap, Math.min(low + 2 * gap, high), compareFunction);
+    const rightPivotIndex = medianOfThree(array, Math.max(low, high - 2 * gap), high - gap, high, compareFunction);
+    // Move pivots to ends
+    if (leftPivotIndex !== low) {
+        [array[low], array[leftPivotIndex]] = [array[leftPivotIndex], array[low]];
+    }
+    if (rightPivotIndex !== high) {
+        [array[high], array[rightPivotIndex]] = [
+            array[rightPivotIndex],
+            array[high],
+        ];
+    }
+    // Swap pivots if needed
+    if (compareFunction(array[low], array[high]) > 0) {
+        [array[low], array[high]] = [array[high], array[low]];
+    }
+    // Initialize partition boundaries
+    let left = low + 1;
+    let right = high - 1;
+    let current = left;
+    // Partition into three parts
+    while (current <= right) {
+        // Handle elements smaller than left pivot
+        if (compareFunction(array[current], array[low]) < 0) {
+            [array[current], array[left]] = [array[left], array[current]];
+            left++;
+        }
+        // Handle elements larger than right pivot
+        else if (compareFunction(array[current], array[high]) > 0) {
+            // Find suitable position from right
+            while (current < right &&
+                compareFunction(array[right], array[high]) > 0) {
+                right--;
+            }
+            [array[current], array[right]] = [array[right], array[current]];
+            right--;
+            // Check if swapped element is smaller than left pivot
+            if (compareFunction(array[current], array[low]) < 0) {
+                [array[current], array[left]] = [array[left], array[current]];
+                left++;
+            }
+        }
+        current++;
+    }
+    // Move pivots to their final positions
+    left--;
+    right++;
+    [array[low], array[left]] = [array[left], array[low]];
+    [array[high], array[right]] = [array[right], array[high]];
+    return { leftPivotIndex: left, rightPivotIndex: right };
+};
+/**
+ * Sort small arrays using selection sort
+ * @param array - Array to be sorted
+ * @param start - Starting index
+ * @param end - Ending index
+ * @param compareFunction - Comparison function
+ */
+const insertionSort = (array, start, end, compareFunction) => {
+    for (let index = start + 1; index <= end; index++) {
+        const current = array[index];
+        let index_ = index - 1;
+        while (index_ >= start && compareFunction(array[index_], current) > 0) {
+            array[index_ + 1] = array[index_];
+            index_--;
+        }
+        array[index_ + 1] = current;
+    }
+};
+/**
+ * Internal implementation of dual-pivot quicksort
+ * @param array - Array to be sorted
+ * @param start - Starting index
+ * @param end - Ending index
+ * @param compareFunction - Comparison function
+ * @param insertionSortThreshold - Threshold for switching to insertion sort
+ */
+const sortRange = (array, start, end, compareFunction, insertionSortThreshold) => {
+    // Use insertion sort for small arrays
+    if (end - start + 1 <= insertionSortThreshold) {
+        insertionSort(array, start, end, compareFunction);
+        return;
+    }
+    // Get partition indices
+    const { leftPivotIndex, rightPivotIndex } = partition(array, start, end, compareFunction);
+    // Sort left partition
+    sortRange(array, start, leftPivotIndex - 1, compareFunction, insertionSortThreshold);
+    // Sort middle partition
+    if (rightPivotIndex - leftPivotIndex > 1) {
+        sortRange(array, leftPivotIndex + 1, rightPivotIndex - 1, compareFunction, insertionSortThreshold);
+    }
+    // Sort right partition
+    sortRange(array, rightPivotIndex + 1, end, compareFunction, insertionSortThreshold);
+};
+/**
+ * Sort array using dual-pivot quicksort algorithm
+ * More efficient than traditional quicksort for arrays with many duplicate values
+ * @param array - Array to be sorted
+ * @param compareFunction - Optional comparison function
+ * @param startIndex - Optional starting index (default: 0)
+ * @param endIndex - Optional ending index (default: array.length - 1)
+ * @param insertionSortThreshold - Optional threshold for insertion sort (default: 10)
+ * @returns Sorted array
+ * @example
+ * dualPivotQuickSort([3, 1, 4, 1, 5, 9, 2, 6, 5, 3]); // [1, 1, 2, 3, 3, 4, 5, 5, 6, 9]
+ * dualPivotQuickSort(['banana', 'apple', 'orange']); // ['apple', 'banana', 'orange']
+ */
+export const dualPivotQuickSort = (array, compareFunction = (compareFunctionDefault), startIndex = 0, endIndex = array.length - 1, insertionSortThreshold = 10) => {
+    // Validate and adjust indices
+    const validStartIndex = Math.max(0, Math.min(startIndex, array.length - 1));
+    const validEndIndex = Math.max(validStartIndex, Math.min(endIndex, array.length - 1));
+    // Sort array if valid range exists
+    if (validEndIndex >= validStartIndex) {
+        sortRange(array, validStartIndex, validEndIndex, compareFunction, insertionSortThreshold);
+    }
+    return array;
+};
+//# sourceMappingURL=dualPivotQuickSort.js.map

package/module/Array/dualPivotQuickSort.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dualPivotQuickSort.js","sourceRoot":"","sources":["../../src/Array/dualPivotQuickSort.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AASlE;;;;;;;;GAQG;AACH,MAAM,aAAa,GAAG,CACpB,KAAU,EACV,CAAS,EACT,CAAS,EACT,CAAS,EACT,eAAmC,EAC3B,EAAE;IACV,uCAAuC;IACvC,MAAM,MAAM,GAAG;QACb,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE;QAC7B,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE;QAC7B,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE;KAC9B,CAAC;IAEF,6CAA6C;IAC7C,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACzD,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;AACzB,CAAC,CAAC;AAEF;;;;;;;GAOG;AACH,MAAM,SAAS,GAAG,CAChB,KAAU,EACV,GAAW,EACX,IAAY,EACZ,eAAmC,EAClB,EAAE;IACnB,0BAA0B;IAC1B,MAAM,MAAM,GAAG,IAAI,GAAG,GAAG,CAAC;IAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAEhD,+BAA+B;IAC/B,MAAM,cAAc,GAAG,aAAa,CAClC,KAAK,EACL,GAAG,EACH,GAAG,GAAG,GAAG,EACT,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,EAAE,IAAI,CAAC,EAC7B,eAAe,CAChB,CAAC;IAEF,MAAM,eAAe,GAAG,aAAa,CACnC,KAAK,EACL,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,EAC7B,IAAI,GAAG,GAAG,EACV,IAAI,EACJ,eAAe,CAChB,CAAC;IAEF,sBAAsB;IACtB,IAAI,cAAc,KAAK,GAAG,EAAE,CAAC;QAC3B,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,cAAc,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,cAAc,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5E,CAAC;IACD,IAAI,eAAe,KAAK,IAAI,EAAE,CAAC;QAC7B,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,eAAe,CAAC,CAAC,GAAG;YACtC,KAAK,CAAC,eAAe,CAAC;YACtB,KAAK,CAAC,IAAI,CAAC;SACZ,CAAC;IACJ,CAAC;IAED,wBAAwB;IACxB,IAAI,eAAe,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QACjD,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IACxD,CAAC;IAED,kCAAkC;IAClC,IAAI,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC;IACnB,IAAI,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC;IACrB,IAAI,OAAO,GAAG,IAAI,CAAC;IAEnB,6BAA6B;IAC7B,OAAO,OAAO,IAAI,KAAK,EAAE,CAAC;QACxB,0CAA0C;QAC1C,IAAI,eAAe,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;YACpD,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;YAC9D,IAAI,EAAE,CAAC;QACT,CAAC;QACD,0CAA0C;aACrC,IAAI,eAAe,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;YAC1D,oCAAoC;YACpC,OACE,OAAO,GAAG,KAAK;gBACf,eAAe,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,EAC9C,CAAC;gBACD,KAAK,EAAE,CAAC;YACV,CAAC;YACD,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;YAChE,KAAK,EAAE,CAAC;YACR,sDAAsD;YACtD,IAAI,eAAe,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;gBACpD,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;gBAC9D,IAAI,EAAE,CAAC;YACT,CAAC;QACH,CAAC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,uCAAuC;IACvC,IAAI,EAAE,CAAC;IACP,KAAK,EAAE,CAAC;IACR,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IACtD,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;IAE1D,OAAO,EAAE,cAAc,EAAE,IAAI,EAAE,eAAe,EAAE,KAAK,EAAE,CAAC;AAC1D,CAAC,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,aAAa,GAAG,CACpB,KAAU,EACV,KAAa,EACb,GAAW,EACX,eAAmC,EAC7B,EAAE;IACR,KAAK,IAAI,KAAK,GAAG,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC;QAClD,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QAC7B,IAAI,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC;QAEvB,OAAO,MAAM,IAAI,KAAK,IAAI,eAAe,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACtE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;YAClC,MAAM,EAAE,CAAC;QACX,CAAC;QAED,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC;IAC9B,CAAC;AACH,CAAC,CAAC;AAEF;;;;;;;GAOG;AACH,MAAM,SAAS,GAAG,CAChB,KAAU,EACV,KAAa,EACb,GAAW,EACX,eAAmC,EACnC,sBAA8B,EACxB,EAAE;IACR,sCAAsC;IACtC,IAAI,GAAG,GAAG,KAAK,GAAG,CAAC,IAAI,sBAAsB,EAAE,CAAC;QAC9C,aAAa,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,eAAe,CAAC,CAAC;QAClD,OAAO;IACT,CAAC;IAED,wBAAwB;IACxB,MAAM,EAAE,cAAc,EAAE,eAAe,EAAE,GAAG,SAAS,CACnD,KAAK,EACL,KAAK,EACL,GAAG,EACH,eAAe,CAChB,CAAC;IAEF,sBAAsB;IACtB,SAAS,CACP,KAAK,EACL,KAAK,EACL,cAAc,GAAG,CAAC,EAClB,eAAe,EACf,sBAAsB,CACvB,CAAC;IAEF,wBAAwB;IACxB,IAAI,eAAe,GAAG,cAAc,GAAG,CAAC,EAAE,CAAC;QACzC,SAAS,CACP,KAAK,EACL,cAAc,GAAG,CAAC,EAClB,eAAe,GAAG,CAAC,EACnB,eAAe,EACf,sBAAsB,CACvB,CAAC;IACJ,CAAC;IAED,uBAAuB;IACvB,SAAS,CACP,KAAK,EACL,eAAe,GAAG,CAAC,EACnB,GAAG,EACH,eAAe,EACf,sBAAsB,CACvB,CAAC;AACJ,CAAC,CAAC;AAEF;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAChC,KAAU,EACV,kBAAsC,CAAA,sBAAyB,CAAA,EAC/D,UAAU,GAAG,CAAC,EACd,QAAQ,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAC3B,sBAAsB,GAAG,EAAE,EACtB,EAAE;IACP,8BAA8B;IAC9B,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IAC5E,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAC5B,eAAe,EACf,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CACrC,CAAC;IAEF,mCAAmC;IACnC,IAAI,aAAa,IAAI,eAAe,EAAE,CAAC;QACrC,SAAS,CACP,KAAK,EACL,eAAe,EACf,aAAa,EACb,eAAe,EACf,sBAAsB,CACvB,CAAC;IACJ,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC,CAAC"}

package/module/Array/first.d.ts

@@ -1,8 +1,8 @@
 import type { First } from "../types/logic/first";
 /**
- * 配列の先頭の要素を返す
- * @param array 配列
- * @returns 配列の先頭の要素
+ * Returns the first element of an array
+ * @param array The input array
+ * @returns The first element of the array, or undefined if the array is empty
  * @example first([1, 2, 3]); // 1
  */
 export declare const first: <T extends unknown[]>(array: T) => First<T> extends never ? T[number] | undefined : First<T>;

package/module/Array/first.js

@@ -1,7 +1,7 @@
 /**
- * 配列の先頭の要素を返す
- * @param array 配列
- * @returns 配列の先頭の要素
+ * Returns the first element of an array
+ * @param array The input array
+ * @returns The first element of the array, or undefined if the array is empty
  * @example first([1, 2, 3]); // 1
  */
 export const first = (array) => {

package/module/Array/generateNumberArray.d.ts

@@ -1,10 +1,10 @@
 /**
- * 指定された要素数まで数値型の配列を生成する
- * @param length 配列の長さ
- * @param min 最小値 (デフォルト: 0)
- * @param max 最大値 (デフォルト: length - 1)
- * @param random ランダムな値を生成するかどうか (デフォルト: false)
- * @returns 数値型の配列
+ * Generates an array of numbers with the specified length
+ * @param length The length of the array
+ * @param min The minimum value (default: 0)
+ * @param max The maximum value (default: length - 1)
+ * @param random Whether to generate random values (default: false)
+ * @returns Array of numbers
  * @example generateNumberArray(5); // [0, 1, 2, 3, 4]
  * @example generateNumberArray(5, 10, 14); // [10, 11, 12, 13, 14]
  */

package/module/Array/generateNumberArray.js

@@ -1,10 +1,10 @@
 /**
- * 指定された要素数まで数値型の配列を生成する
- * @param length 配列の長さ
- * @param min 最小値 (デフォルト: 0)
- * @param max 最大値 (デフォルト: length - 1)
- * @param random ランダムな値を生成するかどうか (デフォルト: false)
- * @returns 数値型の配列
+ * Generates an array of numbers with the specified length
+ * @param length The length of the array
+ * @param min The minimum value (default: 0)
+ * @param max The maximum value (default: length - 1)
+ * @param random Whether to generate random values (default: false)
+ * @returns Array of numbers
  * @example generateNumberArray(5); // [0, 1, 2, 3, 4]
  * @example generateNumberArray(5, 10, 14); // [10, 11, 12, 13, 14]
  */

package/module/Array/getArraysCommon.d.ts

@@ -1,8 +1,8 @@
 /**
- * 共通の要素を取り出す
- * @param {T[]} array 最初の配列
- * @param {T[][]} arrays 他の配列群
- * @returns {O} 共通の要素を含む配列
+ * Extract common elements from multiple arrays
+ * @param {T[]} array The first array
+ * @param {T[][]} arrays Additional arrays to compare
+ * @returns {O} Array containing common elements
  * @example getArraysCommon([1, 2, 3], [2, 3, 4], [2, 5, 3]); // [2, 3]
  */
 export declare const getArraysCommon: <O, T extends unknown[] = unknown[]>(array: T, ...arrays: T[]) => O;

package/module/Array/getArraysCommon.js

@@ -1,8 +1,8 @@
 /**
- * 共通の要素を取り出す
- * @param {T[]} array 最初の配列
- * @param {T[][]} arrays 他の配列群
- * @returns {O} 共通の要素を含む配列
+ * Extract common elements from multiple arrays
+ * @param {T[]} array The first array
+ * @param {T[][]} arrays Additional arrays to compare
+ * @returns {O} Array containing common elements
  * @example getArraysCommon([1, 2, 3], [2, 3, 4], [2, 5, 3]); // [2, 3]
  */
 export const getArraysCommon = (array, ...arrays) => {

package/module/Array/getArraysDiff.d.ts

@@ -1,8 +1,8 @@
 /**
- * 共通しない要素をとりだす
- * @param  {T[]} array
- * @param  {T[]} arrays
- * @returns unknown[]
+ * Extract elements that are not common between arrays
+ * @param  {T[]} array The first array
+ * @param  {T[]} arrays Additional arrays to compare
+ * @returns {unknown[]} Array containing elements that appear only once across all arrays
  * @example getArraysDiff([1, 2, 3], [2, 3, 4]); // [1, 4]
  */
 export declare const getArraysDiff: <O, T extends unknown[] = unknown[]>(array: T, ...arrays: T[]) => O;

package/module/Array/getArraysDiff.js

@@ -1,8 +1,8 @@
 /**
- * 共通しない要素をとりだす
- * @param  {T[]} array
- * @param  {T[]} arrays
- * @returns unknown[]
+ * Extract elements that are not common between arrays
+ * @param  {T[]} array The first array
+ * @param  {T[]} arrays Additional arrays to compare
+ * @returns {unknown[]} Array containing elements that appear only once across all arrays
  * @example getArraysDiff([1, 2, 3], [2, 3, 4]); // [1, 4]
  */
 export const getArraysDiff = (array, ...arrays) => {

package/module/Array/groupBy.d.ts

@@ -1,7 +1,11 @@
 /**
- * 配列の要素をグループ化する
- * @param array グループ化する配列
- * @param iteratee 各要素に適用するグループ化関数
- * @returns グループ化されたオブジェクト
+ * Groups elements of an array based on a given iteratee function
+ * @param array Array to group
+ * @param iteratee Function to determine the group key for each element
+ * @returns Object with grouped elements
+ * @example
+ * groupBy([6.1, 4.2, 6.3], Math.floor); // { '4': [4.2], '6': [6.1, 6.3] }
+ * groupBy(["one", "two", "three"], (str) => str.length); // { '3': ['one', 'two'], '5': ['three'] }
+ * groupBy(["apple", "banana", "carrot"], (str) => str[0]); // { 'a': ['apple'], 'b': ['banana'], 'c': ['carrot'] }
  */
 export declare const groupBy: <T, K extends string | number>(array: T[], iteratee: (value: T, index: number, array: T[]) => K) => Record<K, T[]>;

package/module/Array/groupBy.js

@@ -1,8 +1,12 @@
 /**
- * 配列の要素をグループ化する
- * @param array グループ化する配列
- * @param iteratee 各要素に適用するグループ化関数
- * @returns グループ化されたオブジェクト
+ * Groups elements of an array based on a given iteratee function
+ * @param array Array to group
+ * @param iteratee Function to determine the group key for each element
+ * @returns Object with grouped elements
+ * @example
+ * groupBy([6.1, 4.2, 6.3], Math.floor); // { '4': [4.2], '6': [6.1, 6.3] }
+ * groupBy(["one", "two", "three"], (str) => str.length); // { '3': ['one', 'two'], '5': ['three'] }
+ * groupBy(["apple", "banana", "carrot"], (str) => str[0]); // { 'a': ['apple'], 'b': ['banana'], 'c': ['carrot'] }
  */
 export const groupBy = (array, iteratee) => {
     return array.reduce((accumulator, value, index, array) => {

package/module/Array/groupBy.js.map

@@ -1 +1 @@
-{"version":3,"file":"groupBy.js","sourceRoot":"","sources":["../../src/Array/groupBy.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CACrB,KAAU,EACV,QAAoD,EACpC,EAAE;IAClB,OAAO,KAAK,CAAC,MAAM,CACjB,CAAC,WAAW,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE;QACnC,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QAC1C,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC;YACtB,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;QACxB,CAAC;QACD,WAAW,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC7B,OAAO,WAAW,CAAC;IACrB,CAAC,EACD,EAAoB,CACrB,CAAC;AACJ,CAAC,CAAC"}
+{"version":3,"file":"groupBy.js","sourceRoot":"","sources":["../../src/Array/groupBy.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CACrB,KAAU,EACV,QAAoD,EACpC,EAAE;IAClB,OAAO,KAAK,CAAC,MAAM,CACjB,CAAC,WAAW,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE;QACnC,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QAC1C,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC;YACtB,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;QACxB,CAAC;QACD,WAAW,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC7B,OAAO,WAAW,CAAC;IACrB,CAAC,EACD,EAAoB,CACrB,CAAC;AACJ,CAAC,CAAC"}