umt 2.1.2 → 2.2.0

package/module/Array/index.d.ts

@@ -4,6 +4,7 @@ export * from "./checkFlagAlignment";
 export * from "./chunk";
 export * from "./compact";
 export * from "./drop";
+export * from "./dualPivotQuickSort";
 export * from "./first";
 export * from "./generateNumberArray";
 export * from "./getArraysCommon";

package/module/Array/index.js

@@ -4,6 +4,7 @@ export * from "./checkFlagAlignment";
 export * from "./chunk";
 export * from "./compact";
 export * from "./drop";
+export * from "./dualPivotQuickSort";
 export * from "./first";
 export * from "./generateNumberArray";
 export * from "./getArraysCommon";

package/module/Array/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/Array/index.ts"],"names":[],"mappings":"AAAA,cAAc,cAAc,CAAC;AAC7B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,sBAAsB,CAAC;AACrC,cAAc,SAAS,CAAC;AACxB,cAAc,WAAW,CAAC;AAC1B,cAAc,QAAQ,CAAC;AACvB,cAAc,SAAS,CAAC;AACxB,cAAc,uBAAuB,CAAC;AACtC,cAAc,mBAAmB,CAAC;AAClC,cAAc,iBAAiB,CAAC;AAChC,cAAc,WAAW,CAAC;AAC1B,cAAc,iBAAiB,CAAC;AAChC,cAAc,aAAa,CAAC;AAC5B,cAAc,OAAO,CAAC;AACtB,cAAc,aAAa,CAAC;AAC5B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,SAAS,CAAC;AACxB,cAAc,WAAW,CAAC;AAC1B,cAAc,kBAAkB,CAAC;AACjC,cAAc,OAAO,CAAC;AACtB,cAAc,WAAW,CAAC;AAC1B,cAAc,OAAO,CAAC;AACtB,cAAc,cAAc,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/Array/index.ts"],"names":[],"mappings":"AAAA,cAAc,cAAc,CAAC;AAC7B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,sBAAsB,CAAC;AACrC,cAAc,SAAS,CAAC;AACxB,cAAc,WAAW,CAAC;AAC1B,cAAc,QAAQ,CAAC;AACvB,cAAc,sBAAsB,CAAC;AACrC,cAAc,SAAS,CAAC;AACxB,cAAc,uBAAuB,CAAC;AACtC,cAAc,mBAAmB,CAAC;AAClC,cAAc,iBAAiB,CAAC;AAChC,cAAc,WAAW,CAAC;AAC1B,cAAc,iBAAiB,CAAC;AAChC,cAAc,aAAa,CAAC;AAC5B,cAAc,OAAO,CAAC;AACtB,cAAc,aAAa,CAAC;AAC5B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,SAAS,CAAC;AACxB,cAAc,WAAW,CAAC;AAC1B,cAAc,kBAAkB,CAAC;AACjC,cAAc,OAAO,CAAC;AACtB,cAAc,WAAW,CAAC;AAC1B,cAAc,OAAO,CAAC;AACtB,cAAc,cAAc,CAAC"}

package/module/Array/insertionSort.d.ts

@@ -1,11 +1,12 @@
+import type { CompareFunction } from "../types/array/compareFunction";
 /**
- * 挿入ソートを使用して配列をソート
+ * Sort an array using insertion sort algorithm
  *
- * @param array ソートする配列
- * @param compareFunction 比較関数
- * @param start ソートを開始する配列のインデックス
- * @param end ソートを終了する配列のインデックス
- * @returns ソートされた配列
+ * @param array Array to sort
+ * @param compareFunction Function to compare two elements
+ * @param start Starting index for sorting (inclusive)
+ * @param end Ending index for sorting (inclusive)
+ * @returns Sorted array
  *
  * @example
  * const numbers = [4, 2, 7, 1, 3];
@@ -19,4 +20,4 @@
  * const numbers = [4, 2, 7, 1, 3];
  * insertionSort(numbers, undefined, 1, 3); // [4, 1, 2, 7, 3]
  */
-export declare const insertionSort: <T>(array: T[], compareFunction?: (a: T, b: T) => number, start?: number, end?: number) => T[];
+export declare const insertionSort: <T>(array: T[], compareFunction?: CompareFunction<T>, start?: number, end?: number) => T[];

package/module/Array/insertionSort.js

@@ -1,12 +1,12 @@
 import { compareFunctionDefault } from "./compareFunctionDefault";
 /**
- * 挿入ソートを使用して配列をソート
+ * Sort an array using insertion sort algorithm
  *
- * @param array ソートする配列
- * @param compareFunction 比較関数
- * @param start ソートを開始する配列のインデックス
- * @param end ソートを終了する配列のインデックス
- * @returns ソートされた配列
+ * @param array Array to sort
+ * @param compareFunction Function to compare two elements
+ * @param start Starting index for sorting (inclusive)
+ * @param end Ending index for sorting (inclusive)
+ * @returns Sorted array
  *
  * @example
  * const numbers = [4, 2, 7, 1, 3];

package/module/Array/insertionSort.js.map

@@ -1 +1 @@
-{"version":3,"file":"insertionSort.js","sourceRoot":"","sources":["../../src/Array/insertionSort.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAElE;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAC3B,KAAU,EACV,kBAA0C,CAAA,sBAAyB,CAAA,EACnE,KAAK,GAAG,CAAC,EACT,MAAc,KAAK,CAAC,MAAM,GAAG,CAAC,EACzB,EAAE;IACP,KAAK,IAAI,KAAK,GAAG,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC;QAClD,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QAC5B,OAAO,MAAM,GAAG,KAAK,IAAI,eAAe,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;YACxE,KAAK,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAClC,MAAM,EAAE,CAAC;QACX,CAAC;QACD,KAAK,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC;IACzB,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC,CAAC"}
+{"version":3,"file":"insertionSort.js","sourceRoot":"","sources":["../../src/Array/insertionSort.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAIlE;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAC3B,KAAU,EACV,kBAAsC,CAAA,sBAAyB,CAAA,EAC/D,KAAK,GAAG,CAAC,EACT,MAAc,KAAK,CAAC,MAAM,GAAG,CAAC,EACzB,EAAE;IACP,KAAK,IAAI,KAAK,GAAG,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC;QAClD,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QAC5B,OAAO,MAAM,GAAG,KAAK,IAAI,eAAe,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;YACxE,KAAK,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAClC,MAAM,EAAE,CAAC;QACX,CAAC;QACD,KAAK,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC;IACzB,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC,CAAC"}

package/module/Array/mergeSort.d.ts

@@ -1,8 +1,9 @@
+import type { CompareFunction } from "../types/array/compareFunction";
 /**
- * マージソート
- * @param  {T[]} array 配列
- * @param  {(a: T, b: T) => number} compareFunction 比較関数
- * @returns T[]
+ * Merge sort implementation
+ * @param  {T[]} array Array to sort
+ * @param  {(a: T, b: T) => number} compareFunction Comparison function
+ * @returns {T[]} Sorted array
  * @example mergeSort([1, 3, 2, 4, 5], (a, b) => a - b); // [1, 2, 3, 4, 5]
  */
-export declare const mergeSort: <T>(array: T[], compareFunction?: (a: T, b: T) => number) => T[];
+export declare const mergeSort: <T>(array: T[], compareFunction?: CompareFunction<T>) => T[];

package/module/Array/mergeSort.js

@@ -1,9 +1,9 @@
 import { compareFunctionDefault } from "./compareFunctionDefault";
 /**
- * マージソート
- * @param  {T[]} array 配列
- * @param  {(a: T, b: T) => number} compareFunction 比較関数
- * @returns T[]
+ * Merge sort implementation
+ * @param  {T[]} array Array to sort
+ * @param  {(a: T, b: T) => number} compareFunction Comparison function
+ * @returns {T[]} Sorted array
  * @example mergeSort([1, 3, 2, 4, 5], (a, b) => a - b); // [1, 2, 3, 4, 5]
  */
 export const mergeSort = (array, compareFunction = compareFunctionDefault) => {
@@ -16,11 +16,11 @@ export const mergeSort = (array, compareFunction = compareFunctionDefault) => {
     return merge(mergeSort(left, compareFunction), mergeSort(right, compareFunction), compareFunction);
 };
 /**
- * 2つの配列をマージする関数
- * @param left - マージする左の配列
- * @param right - マージする右の配列
- * @param compareFunction - 比較関数
- * @returns マージされた新しい配列
+ * Helper function to merge two sorted arrays
+ * @param left Left array to merge
+ * @param right Right array to merge
+ * @param compareFunction Comparison function to determine order
+ * @returns New merged array in sorted order
  */
 function merge(left, right, compareFunction) {
     const array = [];

package/module/Array/mergeSort.js.map

@@ -1 +1 @@
-{"version":3,"file":"mergeSort.js","sourceRoot":"","sources":["../../src/Array/mergeSort.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAElE;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,CACvB,KAAU,EACV,kBAA0C,sBAAsB,EAC3D,EAAE;IACP,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACtB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC5C,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IACpC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAElC,OAAO,KAAK,CACV,SAAS,CAAC,IAAI,EAAE,eAAe,CAAC,EAChC,SAAS,CAAC,KAAK,EAAE,eAAe,CAAC,EACjC,eAAe,CAChB,CAAC;AACJ,CAAC,CAAC;AAEF;;;;;;GAMG;AACH,SAAS,KAAK,CACZ,IAAS,EACT,KAAU,EACV,eAAuC;IAEvC,MAAM,KAAK,GAAQ,EAAE,CAAC;IACtB,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,MAAM,GAAG,CAAC,CAAC;IAEf,OAAO,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QACrD,IAAI,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YACtD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC7B,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;AACtE,CAAC"}
+{"version":3,"file":"mergeSort.js","sourceRoot":"","sources":["../../src/Array/mergeSort.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAIlE;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,CACvB,KAAU,EACV,kBAAsC,sBAAsB,EACvD,EAAE;IACP,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACtB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC5C,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;IACpC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAElC,OAAO,KAAK,CACV,SAAS,CAAC,IAAI,EAAE,eAAe,CAAC,EAChC,SAAS,CAAC,KAAK,EAAE,eAAe,CAAC,EACjC,eAAe,CAChB,CAAC;AACJ,CAAC,CAAC;AAEF;;;;;;GAMG;AACH,SAAS,KAAK,CACZ,IAAS,EACT,KAAU,EACV,eAAuC;IAEvC,MAAM,KAAK,GAAQ,EAAE,CAAC;IACtB,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,MAAM,GAAG,CAAC,CAAC;IAEf,OAAO,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,MAAM,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QACrD,IAAI,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YACtD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC7B,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;AACtE,CAAC"}

package/module/Array/quickSort.d.ts

@@ -1,14 +1,15 @@
-type CompareFunction<T> = (a: T, b: T) => number;
+import type { CompareFunction } from "../types/array/compareFunction";
 /**
- * 配列を高速にソート
- * QuickSortとInsertionSortを組み合わせたアルゴリズムで配列を高速にソートします
- * @param {T[]} array 配列
- * @param {CompareFunction<T>} compareFunction 比較関数
- * @param {number} startIndex 開始インデックス
- * @param {number} endIndex 終了インデックス
- * @param {number} insertionSortThreshold 挿入ソートの閾値
- * @returns T[]
- * @example quickSort([1, 3, 2, 4, 5], (a, b) => a - b); // [1, 2, 3, 4, 5]
+ * Sorts an array using a hybrid algorithm combining QuickSort and InsertionSort
+ * @param {T[]} array Array to sort
+ * @param {CompareFunction<T>} compareFunction Comparison function that returns negative if a < b, zero if a = b, positive if a > b
+ * @param {number} startIndex Starting index for the sort range (default: 0)
+ * @param {number} endIndex Ending index for the sort range (default: array.length - 1)
+ * @param {number} insertionSortThreshold Threshold for switching to insertion sort (default: 10)
+ * @returns {T[]} Sorted array
+ * @example
+ * quickSort([1, 3, 2, 4, 5]); // [1, 2, 3, 4, 5]
+ * quickSort([1, 3, 2], (a, b) => b - a); // [3, 2, 1]
+ * quickSort(['b', 'a', 'c']); // ['a', 'b', 'c']
  */
 export declare const quickSort: <T>(array: T[], compareFunction?: CompareFunction<T>, startIndex?: number, endIndex?: number, insertionSortThreshold?: number) => T[];
-export {};

package/module/Array/quickSort.js

@@ -1,4 +1,13 @@
 import { compareFunctionDefault } from "./compareFunctionDefault";
+/**
+ * Finds the median value among three elements in the array
+ * @param array The array containing the elements
+ * @param a Index of first element
+ * @param b Index of second element
+ * @param c Index of third element
+ * @param compareFunction Function to compare elements
+ * @returns The median value among the three elements
+ */
 const medianOfThree = (array, a, b, c, compareFunction) => {
     const ab = compareFunction(array[a], array[b]);
     if (ab < 0) {
@@ -20,6 +29,14 @@ const medianOfThree = (array, a, b, c, compareFunction) => {
     }
     return array[b];
 };
+/**
+ * Partitions the array around a pivot element using median-of-three strategy
+ * @param array Array to partition
+ * @param low Starting index of the partition range
+ * @param high Ending index of the partition range
+ * @param compareFunction Function to compare elements
+ * @returns Index of the partition point
+ */
 const partition = (array, low, high, compareFunction) => {
     const pivot = medianOfThree(array, low, Math.floor((low + high) / 2), high, compareFunction);
     let left = low - 1;
@@ -37,6 +54,13 @@ const partition = (array, low, high, compareFunction) => {
         [array[left], array[right]] = [array[right], array[left]];
     }
 };
+/**
+ * Sorts a portion of the array using insertion sort algorithm
+ * @param array Array to sort
+ * @param low Starting index of the range to sort
+ * @param high Ending index of the range to sort
+ * @param compareFunction Function to compare elements
+ */
 const insertionSort = (array, low, high, compareFunction) => {
     for (let index = low + 1; index <= high; index++) {
         const key = array[index];
@@ -49,6 +73,14 @@ const insertionSort = (array, low, high, compareFunction) => {
         array[currentIndex + 1] = key;
     }
 };
+/**
+ * Internal implementation of the quicksort algorithm with tail-call optimization
+ * @param array Array to sort
+ * @param lowInit Initial low index of the range to sort
+ * @param highInit Initial high index of the range to sort
+ * @param compareFunction Function to compare elements
+ * @param insertionSortThreshold Size threshold for switching to insertion sort
+ */
 const sortImpl = (array, lowInit, highInit, compareFunction, insertionSortThreshold) => {
     let low = lowInit;
     let high = highInit;
@@ -69,18 +101,20 @@ const sortImpl = (array, lowInit, highInit, compareFunction, insertionSortThresh
     }
 };
 /**
- * 配列を高速にソート
- * QuickSortとInsertionSortを組み合わせたアルゴリズムで配列を高速にソートします
- * @param {T[]} array 配列
- * @param {CompareFunction<T>} compareFunction 比較関数
- * @param {number} startIndex 開始インデックス
- * @param {number} endIndex 終了インデックス
- * @param {number} insertionSortThreshold 挿入ソートの閾値
- * @returns T[]
- * @example quickSort([1, 3, 2, 4, 5], (a, b) => a - b); // [1, 2, 3, 4, 5]
+ * Sorts an array using a hybrid algorithm combining QuickSort and InsertionSort
+ * @param {T[]} array Array to sort
+ * @param {CompareFunction<T>} compareFunction Comparison function that returns negative if a < b, zero if a = b, positive if a > b
+ * @param {number} startIndex Starting index for the sort range (default: 0)
+ * @param {number} endIndex Ending index for the sort range (default: array.length - 1)
+ * @param {number} insertionSortThreshold Threshold for switching to insertion sort (default: 10)
+ * @returns {T[]} Sorted array
+ * @example
+ * quickSort([1, 3, 2, 4, 5]); // [1, 2, 3, 4, 5]
+ * quickSort([1, 3, 2], (a, b) => b - a); // [3, 2, 1]
+ * quickSort(['b', 'a', 'c']); // ['a', 'b', 'c']
  */
 export const quickSort = (array, compareFunction = (compareFunctionDefault), startIndex = 0, endIndex = array.length - 1, insertionSortThreshold = 10) => {
-    // 有効な範囲内でのみソートを行う
+    // Only sort within valid range
     const validStartIndex = Math.max(0, Math.min(startIndex, array.length - 1));
     const validEndIndex = Math.max(validStartIndex, Math.min(endIndex, array.length - 1));
     sortImpl(array, validStartIndex, validEndIndex, compareFunction, insertionSortThreshold);

package/module/Array/quickSort.js.map

@@ -1 +1 @@
-{"version":3,"file":"quickSort.js","sourceRoot":"","sources":["../../src/Array/quickSort.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAIlE,MAAM,aAAa,GAAG,CACpB,KAAU,EACV,CAAS,EACT,CAAS,EACT,CAAS,EACT,eAAmC,EAChC,EAAE;IACL,MAAM,EAAE,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/C,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;QACX,MAAM,EAAE,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/C,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;YACX,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;QAClB,CAAC;QACD,IAAI,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;YAC5C,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;QAClB,CAAC;QACD,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IACD,MAAM,EAAE,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/C,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;QACX,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IACD,IAAI,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QAC5C,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IACD,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;AAClB,CAAC,CAAC;AAEF,MAAM,SAAS,GAAG,CAChB,KAAU,EACV,GAAW,EACX,IAAY,EACZ,eAAmC,EAC3B,EAAE;IACV,MAAM,KAAK,GAAG,aAAa,CACzB,KAAK,EACL,GAAG,EACH,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAC5B,IAAI,EACJ,eAAe,CAChB,CAAC;IACF,IAAI,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC;IACnB,IAAI,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC;IAErB,OAAO,IAAI,EAAE,CAAC;QACZ,GAAG,CAAC;YACF,IAAI,EAAE,CAAC;QACT,CAAC,QAAQ,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE;QAClD,GAAG,CAAC;YACF,KAAK,EAAE,CAAC;QACV,CAAC,QAAQ,eAAe,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE;QAEnD,IAAI,IAAI,IAAI,KAAK,EAAE,CAAC;YAClB,OAAO,KAAK,CAAC;QACf,CAAC;QAED,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;IAC5D,CAAC;AACH,CAAC,CAAC;AAEF,MAAM,aAAa,GAAG,CACpB,KAAU,EACV,GAAW,EACX,IAAY,EACZ,eAAmC,EAC7B,EAAE;IACR,KAAK,IAAI,KAAK,GAAG,GAAG,GAAG,CAAC,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QACjD,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QACzB,IAAI,YAAY,GAAG,KAAK,GAAG,CAAC,CAAC;QAC7B,OACE,YAAY,IAAI,GAAG;YACnB,eAAe,CAAC,KAAK,CAAC,YAAY,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,EAC7C,CAAC;YACD,KAAK,CAAC,YAAY,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,YAAY,CAAC,CAAC;YAC9C,YAAY,EAAE,CAAC;QACjB,CAAC;QACD,KAAK,CAAC,YAAY,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;IAChC,CAAC;AACH,CAAC,CAAC;AAEF,MAAM,QAAQ,GAAG,CACf,KAAU,EACV,OAAe,EACf,QAAgB,EAChB,eAAmC,EACnC,sBAA8B,EACxB,EAAE;IACR,IAAI,GAAG,GAAG,OAAO,CAAC;IAClB,IAAI,IAAI,GAAG,QAAQ,CAAC;IAEpB,OAAO,GAAG,GAAG,IAAI,EAAE,CAAC;QAClB,IAAI,IAAI,GAAG,GAAG,GAAG,sBAAsB,EAAE,CAAC;YACxC,aAAa,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,eAAe,CAAC,CAAC;YACjD,OAAO;QACT,CAAC;QACD,MAAM,UAAU,GAAG,SAAS,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,eAAe,CAAC,CAAC;QAChE,IAAI,UAAU,GAAG,GAAG,GAAG,IAAI,GAAG,UAAU,EAAE,CAAC;YACzC,QAAQ,CAAC,KAAK,EAAE,GAAG,EAAE,UAAU,EAAE,eAAe,EAAE,sBAAsB,CAAC,CAAC;YAC1E,GAAG,GAAG,UAAU,GAAG,CAAC,CAAC;QACvB,CAAC;aAAM,CAAC;YACN,QAAQ,CACN,KAAK,EACL,UAAU,GAAG,CAAC,EACd,IAAI,EACJ,eAAe,EACf,sBAAsB,CACvB,CAAC;YACF,IAAI,GAAG,UAAU,CAAC;QACpB,CAAC;IACH,CAAC;AACH,CAAC,CAAC;AAEF;;;;;;;;;;GAUG;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,CACvB,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,kBAAkB;IAClB,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,QAAQ,CACN,KAAK,EACL,eAAe,EACf,aAAa,EACb,eAAe,EACf,sBAAsB,CACvB,CAAC;IACF,OAAO,KAAK,CAAC;AACf,CAAC,CAAC"}
+{"version":3,"file":"quickSort.js","sourceRoot":"","sources":["../../src/Array/quickSort.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAIlE;;;;;;;;GAQG;AACH,MAAM,aAAa,GAAG,CACpB,KAAU,EACV,CAAS,EACT,CAAS,EACT,CAAS,EACT,eAAmC,EAChC,EAAE;IACL,MAAM,EAAE,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/C,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;QACX,MAAM,EAAE,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/C,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;YACX,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;QAClB,CAAC;QACD,IAAI,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;YAC5C,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;QAClB,CAAC;QACD,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IACD,MAAM,EAAE,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/C,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;QACX,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IACD,IAAI,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;QAC5C,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IACD,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;AAClB,CAAC,CAAC;AAEF;;;;;;;GAOG;AACH,MAAM,SAAS,GAAG,CAChB,KAAU,EACV,GAAW,EACX,IAAY,EACZ,eAAmC,EAC3B,EAAE;IACV,MAAM,KAAK,GAAG,aAAa,CACzB,KAAK,EACL,GAAG,EACH,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAC5B,IAAI,EACJ,eAAe,CAChB,CAAC;IACF,IAAI,IAAI,GAAG,GAAG,GAAG,CAAC,CAAC;IACnB,IAAI,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC;IAErB,OAAO,IAAI,EAAE,CAAC;QACZ,GAAG,CAAC;YACF,IAAI,EAAE,CAAC;QACT,CAAC,QAAQ,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE;QAClD,GAAG,CAAC;YACF,KAAK,EAAE,CAAC;QACV,CAAC,QAAQ,eAAe,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE;QAEnD,IAAI,IAAI,IAAI,KAAK,EAAE,CAAC;YAClB,OAAO,KAAK,CAAC;QACf,CAAC;QAED,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;IAC5D,CAAC;AACH,CAAC,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,aAAa,GAAG,CACpB,KAAU,EACV,GAAW,EACX,IAAY,EACZ,eAAmC,EAC7B,EAAE;IACR,KAAK,IAAI,KAAK,GAAG,GAAG,GAAG,CAAC,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;QACjD,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QACzB,IAAI,YAAY,GAAG,KAAK,GAAG,CAAC,CAAC;QAC7B,OACE,YAAY,IAAI,GAAG;YACnB,eAAe,CAAC,KAAK,CAAC,YAAY,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,EAC7C,CAAC;YACD,KAAK,CAAC,YAAY,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,YAAY,CAAC,CAAC;YAC9C,YAAY,EAAE,CAAC;QACjB,CAAC;QACD,KAAK,CAAC,YAAY,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;IAChC,CAAC;AACH,CAAC,CAAC;AAEF;;;;;;;GAOG;AACH,MAAM,QAAQ,GAAG,CACf,KAAU,EACV,OAAe,EACf,QAAgB,EAChB,eAAmC,EACnC,sBAA8B,EACxB,EAAE;IACR,IAAI,GAAG,GAAG,OAAO,CAAC;IAClB,IAAI,IAAI,GAAG,QAAQ,CAAC;IAEpB,OAAO,GAAG,GAAG,IAAI,EAAE,CAAC;QAClB,IAAI,IAAI,GAAG,GAAG,GAAG,sBAAsB,EAAE,CAAC;YACxC,aAAa,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,eAAe,CAAC,CAAC;YACjD,OAAO;QACT,CAAC;QACD,MAAM,UAAU,GAAG,SAAS,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,eAAe,CAAC,CAAC;QAChE,IAAI,UAAU,GAAG,GAAG,GAAG,IAAI,GAAG,UAAU,EAAE,CAAC;YACzC,QAAQ,CAAC,KAAK,EAAE,GAAG,EAAE,UAAU,EAAE,eAAe,EAAE,sBAAsB,CAAC,CAAC;YAC1E,GAAG,GAAG,UAAU,GAAG,CAAC,CAAC;QACvB,CAAC;aAAM,CAAC;YACN,QAAQ,CACN,KAAK,EACL,UAAU,GAAG,CAAC,EACd,IAAI,EACJ,eAAe,EACf,sBAAsB,CACvB,CAAC;YACF,IAAI,GAAG,UAAU,CAAC;QACpB,CAAC;IACH,CAAC;AACH,CAAC,CAAC;AAEF;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,CACvB,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,+BAA+B;IAC/B,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,QAAQ,CACN,KAAK,EACL,eAAe,EACf,aAAa,EACb,eAAe,EACf,sBAAsB,CACvB,CAAC;IACF,OAAO,KAAK,CAAC;AACf,CAAC,CAAC"}

package/module/Array/randomSelect.d.ts

@@ -1,9 +1,9 @@
 /**
- * 配列から指定された数の要素をランダムに選択する
- * @param array 元の配列
- * @param count 選択する要素の数
- * @param allowDuplicates 重複を許すかどうか (デフォルトは false)
- * @returns ランダムに選択された要素の配列
+ * Randomly selects a specified number of elements from an array
+ * @param array Source array
+ * @param count Number of elements to select
+ * @param allowDuplicates Whether to allow duplicate selections (default: false)
+ * @returns Array of randomly selected elements
  * @example randomSelect([1, 2, 3, 4, 5], 2); // [3, 1]
  */
 export declare const randomSelect: <T>(array: T[], count: number, allowDuplicates?: boolean) => T[];

package/module/Array/randomSelect.js

@@ -1,9 +1,9 @@
 /**
- * 配列から指定された数の要素をランダムに選択する
- * @param array 元の配列
- * @param count 選択する要素の数
- * @param allowDuplicates 重複を許すかどうか (デフォルトは false)
- * @returns ランダムに選択された要素の配列
+ * Randomly selects a specified number of elements from an array
+ * @param array Source array
+ * @param count Number of elements to select
+ * @param allowDuplicates Whether to allow duplicate selections (default: false)
+ * @returns Array of randomly selected elements
  * @example randomSelect([1, 2, 3, 4, 5], 2); // [3, 1]
  */
 export const randomSelect = (array, count, allowDuplicates = false) => {

package/module/Array/range.d.ts

@@ -1,9 +1,9 @@
 /**
- * 連続した数値の配列を生成する
- * @param start 開始数値
- * @param end 終了数値 (省略した場合は0からstartまでの配列を生成)
- * @param step ステップ数 (省略した場合は1)
- * @returns 連続した数値の配列
+ * Generates an array of sequential numbers
+ * @param start Starting number
+ * @param end Ending number (if omitted, generates array from 0 to start)
+ * @param step Step value (defaults to 1)
+ * @returns Array of sequential numbers
  * @example range(5); // [0, 1, 2, 3, 4]
  * @example range(2, 10, 2); // [2, 4, 6, 8]
  */

package/module/Array/range.js

@@ -1,22 +1,38 @@
 /**
- * 連続した数値の配列を生成する
- * @param start 開始数値
- * @param end 終了数値 (省略した場合は0からstartまでの配列を生成)
- * @param step ステップ数 (省略した場合は1)
- * @returns 連続した数値の配列
+ * Generates an array of sequential numbers
+ * @param start Starting number
+ * @param end Ending number (if omitted, generates array from 0 to start)
+ * @param step Step value (defaults to 1)
+ * @returns Array of sequential numbers
  * @example range(5); // [0, 1, 2, 3, 4]
  * @example range(2, 10, 2); // [2, 4, 6, 8]
  */
 const range = (start, end, step = 1) => {
     const array = [];
-    if (end) {
-        for (let index = start; index < end; index += step) {
-            array.push(index);
+    // Handle invalid step
+    if (step === 0) {
+        return array;
+    }
+    const actualStart = end === undefined ? 0 : start;
+    const actualEnd = end === undefined ? start : end;
+    // Return empty array if invalid range
+    if ((step > 0 && actualStart >= actualEnd) ||
+        (step < 0 && actualStart <= actualEnd)) {
+        return array;
+    }
+    // Handle both positive and negative steps
+    if (step > 0) {
+        for (let index = actualStart; index < actualEnd; index += step) {
+            // Handle floating point precision
+            const roundedValue = Number((Math.round(index * 1e10) / 1e10).toFixed(10));
+            array.push(roundedValue);
         }
     }
     else {
-        for (let index = 0; index < start; index += step) {
-            array.push(index);
+        for (let index = actualStart; index > actualEnd; index += step) {
+            // Handle floating point precision
+            const roundedValue = Number((Math.round(index * 1e10) / 1e10).toFixed(10));
+            array.push(roundedValue);
         }
     }
     return array;

package/module/Array/range.js.map

@@ -1 +1 @@
-{"version":3,"file":"range.js","sourceRoot":"","sources":["../../src/Array/range.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,MAAM,KAAK,GAAG,CAAC,KAAa,EAAE,GAAY,EAAE,IAAI,GAAG,CAAC,EAAE,EAAE;IACtD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,GAAG,EAAE,CAAC;QACR,KAAK,IAAI,KAAK,GAAG,KAAK,EAAE,KAAK,GAAG,GAAG,EAAE,KAAK,IAAI,IAAI,EAAE,CAAC;YACnD,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;SAAM,CAAC;QACN,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,EAAE,KAAK,IAAI,IAAI,EAAE,CAAC;YACjD,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC,CAAC;AACF,OAAO,EAAE,KAAK,EAAE,CAAC"}
+{"version":3,"file":"range.js","sourceRoot":"","sources":["../../src/Array/range.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,MAAM,KAAK,GAAG,CAAC,KAAa,EAAE,GAAY,EAAE,IAAI,GAAG,CAAC,EAAE,EAAE;IACtD,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,sBAAsB;IACtB,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;QACf,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,WAAW,GAAG,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;IAClD,MAAM,SAAS,GAAG,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC;IAElD,sCAAsC;IACtC,IACE,CAAC,IAAI,GAAG,CAAC,IAAI,WAAW,IAAI,SAAS,CAAC;QACtC,CAAC,IAAI,GAAG,CAAC,IAAI,WAAW,IAAI,SAAS,CAAC,EACtC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,0CAA0C;IAC1C,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;QACb,KAAK,IAAI,KAAK,GAAG,WAAW,EAAE,KAAK,GAAG,SAAS,EAAE,KAAK,IAAI,IAAI,EAAE,CAAC;YAC/D,kCAAkC;YAClC,MAAM,YAAY,GAAG,MAAM,CACzB,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAC9C,CAAC;YACF,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC;SAAM,CAAC;QACN,KAAK,IAAI,KAAK,GAAG,WAAW,EAAE,KAAK,GAAG,SAAS,EAAE,KAAK,IAAI,IAAI,EAAE,CAAC;YAC/D,kCAAkC;YAClC,MAAM,YAAY,GAAG,MAAM,CACzB,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAC9C,CAAC;YACF,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC,CAAC;AACF,OAAO,EAAE,KAAK,EAAE,CAAC"}

package/module/Array/shuffle.d.ts

@@ -1,7 +1,7 @@
 /**
- * 配列の要素をランダムにシャッフルする
- * @param array シャッフルする配列
- * @returns シャッフルされた配列
+ * Randomly shuffles the elements of an array
+ * @param array Array to shuffle
+ * @returns New array with shuffled elements
  * @example shuffle([1, 2, 3, 4, 5]); // [3, 5, 2, 4, 1]
  */
 export declare const shuffle: <T>(array: T[]) => T[];

package/module/Array/shuffle.js

@@ -1,7 +1,7 @@
 /**
- * 配列の要素をランダムにシャッフルする
- * @param array シャッフルする配列
- * @returns シャッフルされた配列
+ * Randomly shuffles the elements of an array
+ * @param array Array to shuffle
+ * @returns New array with shuffled elements
  * @example shuffle([1, 2, 3, 4, 5]); // [3, 5, 2, 4, 1]
  */
 export const shuffle = (array) => {

package/module/Array/shuffle2DArray.d.ts

@@ -1,9 +1,9 @@
 /**
- * 2次元配列全体の配列をシャッフルします。
- * @param array シャッフルする2次元配列
- * @returns シャッフルされた2次元配列
+ * Shuffles all elements in a 2D array while maintaining the row lengths
+ * @param array The 2D array to shuffle
+ * @returns A new 2D array with shuffled elements
  * @example
  * shuffle2DArray([[1, 2], [3, 4], [5, 6]]);
- * // 例: [[1, 3], [6, 4], [2, 5]]
+ * // Result: [[1, 3], [6, 4], [2, 5]]
  */
 export declare const shuffle2DArray: <T>(array: T[][]) => T[][];

package/module/Array/shuffle2DArray.js

@@ -1,13 +1,13 @@
 /**
- * 2次元配列全体の配列をシャッフルします。
- * @param array シャッフルする2次元配列
- * @returns シャッフルされた2次元配列
+ * Shuffles all elements in a 2D array while maintaining the row lengths
+ * @param array The 2D array to shuffle
+ * @returns A new 2D array with shuffled elements
  * @example
  * shuffle2DArray([[1, 2], [3, 4], [5, 6]]);
- * // 例: [[1, 3], [6, 4], [2, 5]]
+ * // Result: [[1, 3], [6, 4], [2, 5]]
  */
 export const shuffle2DArray = (array) => {
-    // 2次元配列の要素を1次元配列に平坦化し、シャッフルする
+    // Flatten the 2D array into 1D and shuffle it
     const flatArray = [];
     for (const subArray of array) {
         flatArray.push(...subArray);
@@ -19,7 +19,7 @@ export const shuffle2DArray = (array) => {
             flatArray[index],
         ];
     }
-    // シャッフルされた1次元配列を2次元配列に再構成する
+    // Reconstruct the 2D array from the shuffled flat array
     let rowIndex = 0;
     return array.map((subArray) => {
         const newRow = flatArray.slice(rowIndex, rowIndex + subArray.length);

package/module/Array/shuffle2DArray.js.map

@@ -1 +1 @@
-{"version":3,"file":"shuffle2DArray.js","sourceRoot":"","sources":["../../src/Array/shuffle2DArray.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,CAAI,KAAY,EAAS,EAAE;IACvD,8BAA8B;IAC9B,MAAM,SAAS,GAAQ,EAAE,CAAC;IAC1B,KAAK,MAAM,QAAQ,IAAI,KAAK,EAAE,CAAC;QAC7B,SAAS,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC;IAC9B,CAAC;IACD,KAAK,IAAI,KAAK,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;QAC1D,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;QACvD,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG;YACtC,SAAS,CAAC,MAAM,CAAC;YACjB,SAAS,CAAC,KAAK,CAAC;SACjB,CAAC;IACJ,CAAC;IAED,4BAA4B;IAC5B,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE;QAC5B,MAAM,MAAM,GAAG,SAAS,CAAC,KAAK,CAAC,QAAQ,EAAE,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;QACrE,QAAQ,IAAI,QAAQ,CAAC,MAAM,CAAC;QAC5B,OAAO,MAAM,CAAC;IAChB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC"}
+{"version":3,"file":"shuffle2DArray.js","sourceRoot":"","sources":["../../src/Array/shuffle2DArray.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,CAAI,KAAY,EAAS,EAAE;IACvD,8CAA8C;IAC9C,MAAM,SAAS,GAAQ,EAAE,CAAC;IAC1B,KAAK,MAAM,QAAQ,IAAI,KAAK,EAAE,CAAC;QAC7B,SAAS,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC;IAC9B,CAAC;IACD,KAAK,IAAI,KAAK,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;QAC1D,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;QACvD,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC,GAAG;YACtC,SAAS,CAAC,MAAM,CAAC;YACjB,SAAS,CAAC,KAAK,CAAC;SACjB,CAAC;IACJ,CAAC;IAED,wDAAwD;IACxD,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE;QAC5B,MAAM,MAAM,GAAG,SAAS,CAAC,KAAK,CAAC,QAAQ,EAAE,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC;QACrE,QAAQ,IAAI,QAAQ,CAAC,MAAM,CAAC;QAC5B,OAAO,MAAM,CAAC;IAChB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC"}

package/module/Array/sum.d.ts

@@ -1,7 +1,7 @@
 /**
- * 配列の合計を返す
- * @param {number[]} x 数値型の配列
- * @returns 配列の合計
+ * Returns the sum of an array of numbers
+ * @param {number[]} x Array of numbers
+ * @returns Sum of the array elements
  * @example sum([1, 2, 3]); // 6
  */
 export declare const sum: (x: number[]) => number;

package/module/Array/sum.js

@@ -1,11 +1,11 @@
 import { addition } from "../Math/addition";
 /**
- * 配列の合計を返す
- * @param {number[]} x 数値型の配列
- * @returns 配列の合計
+ * Returns the sum of an array of numbers
+ * @param {number[]} x Array of numbers
+ * @returns Sum of the array elements
  * @example sum([1, 2, 3]); // 6
  */
 export const sum = (x) => {
-    return x.reduce((a, b) => addition(a, b));
+    return x.reduce((a, b) => addition(a, b), 0);
 };
 //# sourceMappingURL=sum.js.map

package/module/Array/sum.js.map

@@ -1 +1 @@
-{"version":3,"file":"sum.js","sourceRoot":"","sources":["../../src/Array/sum.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAC3C;;;;;GAKG;AACH,MAAM,CAAC,MAAM,GAAG,GAAG,CAAC,CAAW,EAAE,EAAE;IACjC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AAC5C,CAAC,CAAC"}
+{"version":3,"file":"sum.js","sourceRoot":"","sources":["../../src/Array/sum.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAC3C;;;;;GAKG;AACH,MAAM,CAAC,MAAM,GAAG,GAAG,CAAC,CAAW,EAAE,EAAE;IACjC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC/C,CAAC,CAAC"}

package/module/Array/timSort.d.ts

@@ -1,15 +1,17 @@
-type CompareFunction<T> = (a: T, b: T) => number;
+import type { CompareFunction } from "../types/array/compareFunction";
 /**
- * TimSortアルゴリズムを実装した関数です。
- * 挿入ソートとマージソートの良い特性を組み合わせたソートアルゴリズムで、
- * 安定なソートを提供し、最悪のケースでもO(n log n)の時間複雑度を持ちます。
+ * Implementation of the TimSort algorithm, which combines the best features of
+ * insertion sort and merge sort. It provides a stable sort with O(n log n)
+ * worst-case time complexity.
  *
- * @param {T[]} array - ソートする配列
- * @param {CompareFunction<T>} [compareFunction=compareFunctionDefault<T>] -
- *        要素比較のための関数
- * @param {number} [start=0] - ソートを開始する配列のインデックス
- * @param {number} [end=array.length - 1] - ソートを終了する配列のインデックス
- * @returns {T[]} - ソートされた配列
+ * @param {T[]} array Array to sort
+ * @param {CompareFunction<T>} [compareFunction=compareFunctionDefault<T>]
+ *        Function to compare elements
+ * @param {number} [start=0] Starting index for the sort range
+ * @param {number} [end=array.length - 1] Ending index for the sort range
+ * @returns {T[]} Sorted array
+ * @example
+ * timSort([3, 1, 4, 1, 5]); // [1, 1, 3, 4, 5]
+ * timSort(['b', 'a', 'c']); // ['a', 'b', 'c']
  */
 export declare const timSort: <T>(array: T[], compareFunction?: CompareFunction<T>, start?: number, end?: number) => T[];
-export {};

package/module/Array/timSort.js

@@ -1,5 +1,12 @@
 import { compareFunctionDefault } from "./compareFunctionDefault";
 const MIN_RUN = 32;
+/**
+ * Sorts a portion of the array using insertion sort algorithm
+ * @param array Array to sort
+ * @param start Starting index of the range to sort
+ * @param end Ending index of the range to sort
+ * @param compareFunction Function to compare elements
+ */
 const insertionSort = (array, start, end, compareFunction) => {
     for (let index = start + 1; index <= end; index++) {
         const temporary = array[index];
@@ -12,6 +19,14 @@ const insertionSort = (array, start, end, compareFunction) => {
         array[currentIndex + 1] = temporary;
     }
 };
+/**
+ * Merges two sorted portions of the array
+ * @param array Array containing the portions to merge
+ * @param start Starting index of the first portion
+ * @param mid Middle index separating the two portions
+ * @param end Ending index of the second portion
+ * @param compareFunction Function to compare elements
+ */
 const merge = (array, start, mid, end, compareFunction) => {
     const left = array.slice(start, mid + 1);
     const right = array.slice(mid + 1, end + 1);
@@ -40,6 +55,12 @@ const merge = (array, start, mid, end, compareFunction) => {
         arrayIndex++;
     }
 };
+/**
+ * Calculates the minimum length of a run for the given input size
+ * This is used to determine the size of runs for the initial insertion sort phase
+ * @param input Size of the array to be sorted
+ * @returns Minimum length of a run
+ */
 const getMinRunLength = (input) => {
     let n = input;
     let r = 0;
@@ -50,16 +71,19 @@ const getMinRunLength = (input) => {
     return n + r;
 };
 /**
- * TimSortアルゴリズムを実装した関数です。
- * 挿入ソートとマージソートの良い特性を組み合わせたソートアルゴリズムで、
- * 安定なソートを提供し、最悪のケースでもO(n log n)の時間複雑度を持ちます。
+ * Implementation of the TimSort algorithm, which combines the best features of
+ * insertion sort and merge sort. It provides a stable sort with O(n log n)
+ * worst-case time complexity.
  *
- * @param {T[]} array - ソートする配列
- * @param {CompareFunction<T>} [compareFunction=compareFunctionDefault<T>] -
- *        要素比較のための関数
- * @param {number} [start=0] - ソートを開始する配列のインデックス
- * @param {number} [end=array.length - 1] - ソートを終了する配列のインデックス
- * @returns {T[]} - ソートされた配列
+ * @param {T[]} array Array to sort
+ * @param {CompareFunction<T>} [compareFunction=compareFunctionDefault<T>]
+ *        Function to compare elements
+ * @param {number} [start=0] Starting index for the sort range
+ * @param {number} [end=array.length - 1] Ending index for the sort range
+ * @returns {T[]} Sorted array
+ * @example
+ * timSort([3, 1, 4, 1, 5]); // [1, 1, 3, 4, 5]
+ * timSort(['b', 'a', 'c']); // ['a', 'b', 'c']
  */
 export const timSort = (array, compareFunction = (compareFunctionDefault), start = 0, end = array.length - 1) => {
     const n = end - start + 1;

package/module/Array/timSort.js.map

@@ -1 +1 @@
-{"version":3,"file":"timSort.js","sourceRoot":"","sources":["../../src/Array/timSort.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAIlE,MAAM,OAAO,GAAG,EAAE,CAAC;AAEnB,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,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QAC/B,IAAI,YAAY,GAAG,KAAK,GAAG,CAAC,CAAC;QAC7B,OACE,YAAY,IAAI,KAAK;YACrB,eAAe,CAAC,KAAK,CAAC,YAAY,CAAC,EAAE,SAAS,CAAC,GAAG,CAAC,EACnD,CAAC;YACD,KAAK,CAAC,YAAY,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,YAAY,CAAC,CAAC;YAC9C,YAAY,EAAE,CAAC;QACjB,CAAC;QACD,KAAK,CAAC,YAAY,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC;IACtC,CAAC;AACH,CAAC,CAAC;AAEF,MAAM,KAAK,GAAG,CACZ,KAAU,EACV,KAAa,EACb,GAAW,EACX,GAAW,EACX,eAAmC,EAC7B,EAAE;IACR,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;IACzC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;IAC5C,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,UAAU,GAAG,KAAK,CAAC;IAEvB,OAAO,SAAS,GAAG,IAAI,CAAC,MAAM,IAAI,UAAU,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QAC5D,IAAI,eAAe,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7D,KAAK,CAAC,UAAU,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;YACpC,SAAS,EAAE,CAAC;QACd,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,UAAU,CAAC,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC;YACtC,UAAU,EAAE,CAAC;QACf,CAAC;QACD,UAAU,EAAE,CAAC;IACf,CAAC;IAED,OAAO,SAAS,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAC/B,KAAK,CAAC,UAAU,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;QACpC,SAAS,EAAE,CAAC;QACZ,UAAU,EAAE,CAAC;IACf,CAAC;IAED,OAAO,UAAU,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QACjC,KAAK,CAAC,UAAU,CAAC,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC;QACtC,UAAU,EAAE,CAAC;QACb,UAAU,EAAE,CAAC;IACf,CAAC;AACH,CAAC,CAAC;AAEF,MAAM,eAAe,GAAG,CAAC,KAAa,EAAU,EAAE;IAChD,IAAI,CAAC,GAAG,KAAK,CAAC;IACd,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,IAAI,OAAO,EAAE,CAAC;QACpB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACX,CAAC,KAAK,CAAC,CAAC;IACV,CAAC;IACD,OAAO,CAAC,GAAG,CAAC,CAAC;AACf,CAAC,CAAC;AAEF;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CACrB,KAAU,EACV,kBAAsC,CAAA,sBAAyB,CAAA,EAC/D,KAAK,GAAG,CAAC,EACT,MAAc,KAAK,CAAC,MAAM,GAAG,CAAC,EACzB,EAAE;IACP,MAAM,CAAC,GAAG,GAAG,GAAG,KAAK,GAAG,CAAC,CAAC;IAC1B,MAAM,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;IAElC,KAAK,IAAI,KAAK,GAAG,KAAK,EAAE,KAAK,IAAI,GAAG,EAAE,KAAK,IAAI,MAAM,EAAE,CAAC;QACtD,aAAa,CACX,KAAK,EACL,KAAK,EACL,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,OAAO,GAAG,CAAC,EAAE,GAAG,CAAC,EAClC,eAAe,CAChB,CAAC;IACJ,CAAC;IAED,KAAK,IAAI,IAAI,GAAG,MAAM,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QAC5C,KAAK,IAAI,IAAI,GAAG,KAAK,EAAE,IAAI,IAAI,GAAG,EAAE,IAAI,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC;YACrD,MAAM,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC;YAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;YAEjD,IAAI,GAAG,GAAG,KAAK,EAAE,CAAC;gBAChB,KAAK,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,eAAe,CAAC,CAAC;YAClD,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC,CAAC"}
+{"version":3,"file":"timSort.js","sourceRoot":"","sources":["../../src/Array/timSort.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAIlE,MAAM,OAAO,GAAG,EAAE,CAAC;AAEnB;;;;;;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,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QAC/B,IAAI,YAAY,GAAG,KAAK,GAAG,CAAC,CAAC;QAC7B,OACE,YAAY,IAAI,KAAK;YACrB,eAAe,CAAC,KAAK,CAAC,YAAY,CAAC,EAAE,SAAS,CAAC,GAAG,CAAC,EACnD,CAAC;YACD,KAAK,CAAC,YAAY,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,YAAY,CAAC,CAAC;YAC9C,YAAY,EAAE,CAAC;QACjB,CAAC;QACD,KAAK,CAAC,YAAY,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC;IACtC,CAAC;AACH,CAAC,CAAC;AAEF;;;;;;;GAOG;AACH,MAAM,KAAK,GAAG,CACZ,KAAU,EACV,KAAa,EACb,GAAW,EACX,GAAW,EACX,eAAmC,EAC7B,EAAE;IACR,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;IACzC,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;IAC5C,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,UAAU,GAAG,KAAK,CAAC;IAEvB,OAAO,SAAS,GAAG,IAAI,CAAC,MAAM,IAAI,UAAU,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QAC5D,IAAI,eAAe,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7D,KAAK,CAAC,UAAU,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;YACpC,SAAS,EAAE,CAAC;QACd,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,UAAU,CAAC,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC;YACtC,UAAU,EAAE,CAAC;QACf,CAAC;QACD,UAAU,EAAE,CAAC;IACf,CAAC;IAED,OAAO,SAAS,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAC/B,KAAK,CAAC,UAAU,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;QACpC,SAAS,EAAE,CAAC;QACZ,UAAU,EAAE,CAAC;IACf,CAAC;IAED,OAAO,UAAU,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QACjC,KAAK,CAAC,UAAU,CAAC,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC;QACtC,UAAU,EAAE,CAAC;QACb,UAAU,EAAE,CAAC;IACf,CAAC;AACH,CAAC,CAAC;AAEF;;;;;GAKG;AACH,MAAM,eAAe,GAAG,CAAC,KAAa,EAAU,EAAE;IAChD,IAAI,CAAC,GAAG,KAAK,CAAC;IACd,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,OAAO,CAAC,IAAI,OAAO,EAAE,CAAC;QACpB,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACX,CAAC,KAAK,CAAC,CAAC;IACV,CAAC;IACD,OAAO,CAAC,GAAG,CAAC,CAAC;AACf,CAAC,CAAC;AAEF;;;;;;;;;;;;;;GAcG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CACrB,KAAU,EACV,kBAAsC,CAAA,sBAAyB,CAAA,EAC/D,KAAK,GAAG,CAAC,EACT,MAAc,KAAK,CAAC,MAAM,GAAG,CAAC,EACzB,EAAE;IACP,MAAM,CAAC,GAAG,GAAG,GAAG,KAAK,GAAG,CAAC,CAAC;IAC1B,MAAM,MAAM,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;IAElC,KAAK,IAAI,KAAK,GAAG,KAAK,EAAE,KAAK,IAAI,GAAG,EAAE,KAAK,IAAI,MAAM,EAAE,CAAC;QACtD,aAAa,CACX,KAAK,EACL,KAAK,EACL,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,OAAO,GAAG,CAAC,EAAE,GAAG,CAAC,EAClC,eAAe,CAChB,CAAC;IACJ,CAAC;IAED,KAAK,IAAI,IAAI,GAAG,MAAM,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;QAC5C,KAAK,IAAI,IAAI,GAAG,KAAK,EAAE,IAAI,IAAI,GAAG,EAAE,IAAI,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC;YACrD,MAAM,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC;YAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;YAEjD,IAAI,GAAG,GAAG,KAAK,EAAE,CAAC;gBAChB,KAAK,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,eAAe,CAAC,CAAC;YAClD,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC,CAAC"}

package/module/Array/zip.d.ts

@@ -1,7 +1,10 @@
 import type { ZipArrayType } from "../types/array/zip";
 /**
- * 複数の配列を受け取り、それらの配列の要素を組み合わせて新しい配列を作成します。
- * @param {T} arrays - 組み合わせる配列のリスト
- * @returns {ZipArrayType<T>} - 各配列の要素が組み合わされた新しい配列
+ * Creates a new array by combining elements from multiple arrays at corresponding positions
+ * @param {T} arrays List of arrays to combine
+ * @returns {ZipArrayType<T>} New array with combined elements from each input array
+ * @example
+ * zip([1, 2], ['a', 'b']); // [[1, 'a'], [2, 'b']]
+ * zip([1, 2, 3], ['a', 'b']); // [[1, 'a'], [2, 'b']]
  */
 export declare const zip: <T extends unknown[][]>(...arrays: T) => ZipArrayType<T>;