umt 1.8.2 → 2.0.0

package/module/Advance/rangeAdvance.js

@@ -11,7 +11,9 @@ const rangeAdvance = (start, end, conditionalExpression) => {
     if (conditionalExpression) {
         const array = [];
         for (let index = start; index < end; index++) {
-            conditionalExpression(index) && array.push(index);
+            if (conditionalExpression(index)) {
+                array.push(index);
+            }
         }
         return array;
     }

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,qBAAqB,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpD,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;;;;;;;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"}

package/module/Array/arraysJoin.d.ts

@@ -1,7 +1,7 @@
 /**
  * 重複をしないで結合
  * @param  {unknown[]} array
- * @param  {unknown[]} ...arrays
+ * @param  {unknown[]} arrays
  * @returns unknown[]
  * @example arraysJoin([1, 2, 3], [2, 3, 4]); // [1, 2, 3, 4]
  */

package/module/Array/arraysJoin.js

@@ -1,7 +1,7 @@
 /**
  * 重複をしないで結合
  * @param  {unknown[]} array
- * @param  {unknown[]} ...arrays
+ * @param  {unknown[]} arrays
  * @returns unknown[]
  * @example arraysJoin([1, 2, 3], [2, 3, 4]); // [1, 2, 3, 4]
  */

package/module/Array/binarySearch.d.ts

@@ -0,0 +1,6 @@
+/**
+ * 二分探索法
+ * @param arr sortされたnumberの配列
+ * @param target 探索する値
+ */
+export declare const binarySearch: (array: number[], target: number) => number;

package/module/Array/binarySearch.js

@@ -0,0 +1,24 @@
+/**
+ * 二分探索法
+ * @param arr sortされたnumberの配列
+ * @param target 探索する値
+ */
+export const binarySearch = (array, target) => {
+    let left = 0;
+    let right = array.length - 1;
+    while (left <= right) {
+        const mid = Math.floor((left + right) / 2);
+        const midValue = array[mid];
+        if (midValue === target) {
+            return mid;
+        }
+        if (midValue < target) {
+            left = mid + 1;
+        }
+        else {
+            right = mid - 1;
+        }
+    }
+    return -1;
+};
+//# sourceMappingURL=binarySearch.js.map

package/module/Array/binarySearch.js.map

@@ -0,0 +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"}

package/module/Array/chunk.d.ts

@@ -1,8 +1,7 @@
-import type { ChunkArrayType } from "../types/arrayType";
-/**
+import type { ChunkArrayType } from "../types/array/chunk"; /**
  * 配列を指定した数で分割する
- * @param arr 配列
- * @param n 分割数
+ * @param {T} array 配列
+ * @param {N} n 分割数
  * @returns 分割された配列
  * @example chunk([1, 2, 3, 4, 5, 6, 7, 8, 9], 3); // [[1, 2, 3], [4, 5, 6], [7, 8, 9]]
  */

package/module/Array/chunk.js

@@ -1,10 +1,3 @@
-/**
- * 配列を指定した数で分割する
- * @param arr 配列
- * @param n 分割数
- * @returns 分割された配列
- * @example chunk([1, 2, 3, 4, 5, 6, 7, 8, 9], 3); // [[1, 2, 3], [4, 5, 6], [7, 8, 9]]
- */
 export const chunk = (array, n) => {
     const result = [];
     for (let index = 0; index < array.length; index += n) {

package/module/Array/chunk.js.map

@@ -1 +1 @@
-{"version":3,"file":"chunk.js","sourceRoot":"","sources":["../../src/Array/chunk.ts"],"names":[],"mappings":"AACA;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,CACnB,KAAQ,EACR,CAAI,EACkB,EAAE;IACxB,MAAM,MAAM,GAAU,EAAE,CAAC;IACzB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;QACrD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,CAAmB,CAAC,CAAC;IAC/D,CAAC;IACD,OAAO,MAA8B,CAAC;AACxC,CAAC,CAAC"}
+{"version":3,"file":"chunk.js","sourceRoot":"","sources":["../../src/Array/chunk.ts"],"names":[],"mappings":"AAOA,MAAM,CAAC,MAAM,KAAK,GAAG,CACnB,KAAQ,EACR,CAAI,EACkB,EAAE;IACxB,MAAM,MAAM,GAAU,EAAE,CAAC;IACzB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;QACrD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,CAAmB,CAAC,CAAC;IAC/D,CAAC;IACD,OAAO,MAA8B,CAAC;AACxC,CAAC,CAAC"}

package/module/Array/compact.d.ts

@@ -0,0 +1 @@
+export declare const compact: <T>(array: T[]) => T[];

package/module/Array/compact.js

@@ -0,0 +1,2 @@
+export const compact = (array) => array.filter(Boolean);
+//# sourceMappingURL=compact.js.map

package/module/Array/compact.js.map

@@ -0,0 +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"}

package/module/Array/first.d.ts

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

package/module/Array/first.js

@@ -5,6 +5,6 @@
  * @example first([1, 2, 3]); // 1
  */
 export const first = (array) => {
-    return array.length > 0 ? array[0] : undefined;
+    return (array.length > 0 ? array[0] : undefined);
 };
 //# sourceMappingURL=first.js.map

package/module/Array/first.js.map

@@ -1 +1 @@
-{"version":3,"file":"first.js","sourceRoot":"","sources":["../../src/Array/first.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,CAAI,KAAU,EAAiB,EAAE;IACpD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AACjD,CAAC,CAAC"}
+{"version":3,"file":"first.js","sourceRoot":"","sources":["../../src/Array/first.ts"],"names":[],"mappings":"AAEA;;;;;GAKG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,CACnB,KAAQ,EACmD,EAAE;IAC7D,OAAO,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAEnC,CAAC;AACf,CAAC,CAAC"}

package/module/Array/getArraysCommon.d.ts

@@ -1,8 +1,8 @@
 /**
- * 共通の要素をとりだす
- * @param  {any[]} array
- * @param  {any[]} ...arrays
- * @returns unknown[]
- * @example getArraysCommon([1, 2, 3], [2, 3, 4]); // [2, 3]
+ * 共通の要素を取り出す
+ * @param {T[]} array 最初の配列
+ * @param {T[][]} arrays 他の配列群
+ * @returns {O} 共通の要素を含む配列
+ * @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,9 +1,9 @@
 /**
- * 共通の要素をとりだす
- * @param  {any[]} array
- * @param  {any[]} ...arrays
- * @returns unknown[]
- * @example getArraysCommon([1, 2, 3], [2, 3, 4]); // [2, 3]
+ * 共通の要素を取り出す
+ * @param {T[]} array 最初の配列
+ * @param {T[][]} arrays 他の配列群
+ * @returns {O} 共通の要素を含む配列
+ * @example getArraysCommon([1, 2, 3], [2, 3, 4], [2, 5, 3]); // [2, 3]
  */
 export const getArraysCommon = (array, ...arrays) => {
     const result = [array, ...arrays].reduce((previous, current) => {

package/module/Array/getArraysCommon.js.map

@@ -1 +1 @@
-{"version":3,"file":"getArraysCommon.js","sourceRoot":"","sources":["../../src/Array/getArraysCommon.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,MAAM,CAAC,MAAM,eAAe,GAAG,CAC7B,KAAQ,EACR,GAAG,MAAW,EACd,EAAE;IACF,MAAM,MAAM,GAAG,CAAC,KAAK,EAAE,GAAG,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,OAAO,EAAE,EAAE;QAC7D,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAa,EAAE,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAM,CAAC;IACzE,CAAC,CAAC,CAAC;IACH,OAAO,MAAsB,CAAC;AAChC,CAAC,CAAC"}
+{"version":3,"file":"getArraysCommon.js","sourceRoot":"","sources":["../../src/Array/getArraysCommon.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,CAC7B,KAAQ,EACR,GAAG,MAAW,EACX,EAAE;IACL,MAAM,MAAM,GAAG,CAAC,KAAK,EAAE,GAAG,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,OAAO,EAAE,EAAE;QAC7D,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAa,EAAE,EAAE,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAM,CAAC;IACzE,CAAC,CAAC,CAAC;IACH,OAAO,MAAsB,CAAC;AAChC,CAAC,CAAC"}

package/module/Array/getArraysDiff.d.ts

@@ -1,7 +1,7 @@
 /**
  * 共通しない要素をとりだす
- * @param  {unknown[]} array
- * @param  {unknown[]} ...arrays
+ * @param  {T[]} array
+ * @param  {T[]} arrays
  * @returns unknown[]
  * @example getArraysDiff([1, 2, 3], [2, 3, 4]); // [1, 4]
  */

package/module/Array/getArraysDiff.js

@@ -1,7 +1,7 @@
 /**
  * 共通しない要素をとりだす
- * @param  {unknown[]} array
- * @param  {unknown[]} ...arrays
+ * @param  {T[]} array
+ * @param  {T[]} arrays
  * @returns unknown[]
  * @example getArraysDiff([1, 2, 3], [2, 3, 4]); // [1, 4]
  */

package/module/Array/index.d.ts

@@ -1,6 +1,8 @@
 export * from "./arraysJoin";
+export * from "./binarySearch";
 export * from "./checkFlagAlignment";
 export * from "./chunk";
+export * from "./compact";
 export * from "./drop";
 export * from "./first";
 export * from "./generateNumberArray";
@@ -9,6 +11,7 @@ export * from "./getArraysDiff";
 export * from "./groupBy";
 export * from "./insertionSort";
 export * from "./mergeSort";
+export * from "./pop";
 export * from "./quickSort";
 export * from "./randomSelect";
 export * from "./range";

package/module/Array/index.js

@@ -1,6 +1,8 @@
 export * from "./arraysJoin";
+export * from "./binarySearch";
 export * from "./checkFlagAlignment";
 export * from "./chunk";
+export * from "./compact";
 export * from "./drop";
 export * from "./first";
 export * from "./generateNumberArray";
@@ -9,6 +11,7 @@ export * from "./getArraysDiff";
 export * from "./groupBy";
 export * from "./insertionSort";
 export * from "./mergeSort";
+export * from "./pop";
 export * from "./quickSort";
 export * from "./randomSelect";
 export * from "./range";

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,sBAAsB,CAAC;AACrC,cAAc,SAAS,CAAC;AACxB,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,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,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/pop.d.ts

@@ -0,0 +1,6 @@
+/**
+ * Removes the last element from an array and returns it.
+ * @param {T[]} array - The array to remove the last element from.
+ * @returns {T | undefined} - The last element of the array, or undefined if the array is empty.
+ */
+export declare const pop: <T>(array: T[]) => T | undefined;

package/module/Array/pop.js

@@ -0,0 +1,9 @@
+/**
+ * Removes the last element from an array and returns it.
+ * @param {T[]} array - The array to remove the last element from.
+ * @returns {T | undefined} - The last element of the array, or undefined if the array is empty.
+ */
+export const pop = (array) => {
+    return [...array].pop();
+};
+//# sourceMappingURL=pop.js.map

package/module/Array/pop.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pop.js","sourceRoot":"","sources":["../../src/Array/pop.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,MAAM,CAAC,MAAM,GAAG,GAAG,CAAI,KAAU,EAAE,EAAE;IACnC,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,EAAE,CAAC;AAC1B,CAAC,CAAC"}

package/module/Array/quickSort.d.ts

@@ -1,12 +1,14 @@
+type CompareFunction<T> = (a: T, b: T) => number;
 /**
  * 配列を高速にソート
  * QuickSortとInsertionSortを組み合わせたアルゴリズムで配列を高速にソートします
- * @param  {T[]} array 配列
- * @param  {(a: T, b: T) => number} compareFn 比較関数
- * @param  {number} startID 開始インデックス
- * @param  {number} endID 終了インデックス
- * @param  {number} insertionSortThreshold 挿入ソートの閾値
+ * @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]
  */
-export declare const quickSort: <T>(array: T[], compareFunction?: (a: T, b: T) => number, startID?: number, endID?: number, insertionSortThreshold?: number) => T[];
+export declare const quickSort: <T>(array: T[], compareFunction?: CompareFunction<T>, startIndex?: number, endIndex?: number, insertionSortThreshold?: number) => T[];
+export {};

package/module/Array/quickSort.js

@@ -1,77 +1,89 @@
 import { compareFunctionDefault } from "./compareFunctionDefault";
 const medianOfThree = (array, a, b, c, compareFunction) => {
     const ab = compareFunction(array[a], array[b]);
-    const ac = compareFunction(array[a], array[c]);
-    const bc = compareFunction(array[b], array[c]);
     if (ab < 0) {
+        const bc = compareFunction(array[b], array[c]);
         if (bc < 0) {
             return array[b];
         }
-        return ac < 0 ? array[c] : array[a];
+        if (compareFunction(array[a], array[c]) < 0) {
+            return array[c];
+        }
+        return array[a];
     }
+    const ac = compareFunction(array[a], array[c]);
     if (ac < 0) {
         return array[a];
     }
-    return bc < 0 ? array[c] : array[b];
+    if (compareFunction(array[b], array[c]) < 0) {
+        return array[c];
+    }
+    return array[b];
+};
+const partition = (array, low, high, compareFunction) => {
+    const pivot = medianOfThree(array, low, Math.floor((low + high) / 2), high, compareFunction);
+    let left = low - 1;
+    let right = high + 1;
+    while (true) {
+        do {
+            left++;
+        } while (compareFunction(array[left], pivot) < 0);
+        do {
+            right--;
+        } while (compareFunction(array[right], pivot) > 0);
+        if (left >= right) {
+            return right;
+        }
+        [array[left], array[right]] = [array[right], array[left]];
+    }
+};
+const insertionSort = (array, low, high, compareFunction) => {
+    for (let index = low + 1; index <= high; index++) {
+        const key = array[index];
+        let currentIndex = index - 1;
+        while (currentIndex >= low &&
+            compareFunction(array[currentIndex], key) > 0) {
+            array[currentIndex + 1] = array[currentIndex];
+            currentIndex--;
+        }
+        array[currentIndex + 1] = key;
+    }
+};
+const sortImpl = (array, lowInit, highInit, compareFunction, insertionSortThreshold) => {
+    let low = lowInit;
+    let high = highInit;
+    while (low < high) {
+        if (high - low < insertionSortThreshold) {
+            insertionSort(array, low, high, compareFunction);
+            return;
+        }
+        const pivotIndex = partition(array, low, high, compareFunction);
+        if (pivotIndex - low < high - pivotIndex) {
+            sortImpl(array, low, pivotIndex, compareFunction, insertionSortThreshold);
+            low = pivotIndex + 1;
+        }
+        else {
+            sortImpl(array, pivotIndex + 1, high, compareFunction, insertionSortThreshold);
+            high = pivotIndex;
+        }
+    }
 };
 /**
  * 配列を高速にソート
  * QuickSortとInsertionSortを組み合わせたアルゴリズムで配列を高速にソートします
- * @param  {T[]} array 配列
- * @param  {(a: T, b: T) => number} compareFn 比較関数
- * @param  {number} startID 開始インデックス
- * @param  {number} endID 終了インデックス
- * @param  {number} insertionSortThreshold 挿入ソートの閾値
+ * @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]
  */
-export const quickSort = (array, compareFunction = (compareFunctionDefault), startID = 0, endID = array.length - 1, insertionSortThreshold = 10) => {
-    const partition = (low, high) => {
-        const pivot = medianOfThree(array, low, Math.floor((low + high) / 2), high, compareFunction);
-        let index = low - 1;
-        let index_ = high + 1;
-        while (true) {
-            do {
-                index++;
-            } while (compareFunction(array[index], pivot) < 0);
-            do {
-                index_--;
-            } while (compareFunction(array[index_], pivot) > 0);
-            if (index >= index_) {
-                return index_;
-            }
-            [array[index], array[index_]] = [array[index_], array[index]];
-        }
-    };
-    const insertionSort = (low, high) => {
-        for (let index = low + 1; index <= high; index++) {
-            const key = array[index];
-            let index_ = index - 1;
-            while (index_ >= low && compareFunction(array[index_], key) > 0) {
-                array[index_ + 1] = array[index_];
-                index_--;
-            }
-            array[index_ + 1] = key;
-        }
-    };
-    const sort = (low, high) => {
-        while (low < high) {
-            if (high - low < insertionSortThreshold) {
-                insertionSort(low, high);
-                break;
-            }
-            const pi = partition(low, high);
-            if (pi - low < high - pi) {
-                sort(low, pi);
-                low = pi + 1;
-            }
-            else {
-                sort(pi + 1, high);
-                high = pi;
-            }
-        }
-    };
-    sort(startID, endID);
+export const quickSort = (array, compareFunction = (compareFunctionDefault), startIndex = 0, endIndex = array.length - 1, insertionSortThreshold = 10) => {
+    // 有効な範囲内でのみソートを行う
+    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);
     return array;
 };
 //# sourceMappingURL=quickSort.js.map

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;AAElE,MAAM,aAAa,GAAG,CACpB,KAAU,EACV,CAAS,EACT,CAAS,EACT,CAAS,EACT,eAAuC,EACpC,EAAE;IACL,MAAM,EAAE,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/C,MAAM,EAAE,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/C,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,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;YACX,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;QAClB,CAAC;QACD,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC;IACD,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;QACX,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC;IACD,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AACtC,CAAC,CAAC;AAEF;;;;;;;;;;GAUG;AACH,MAAM,CAAC,MAAM,SAAS,GAAG,CACvB,KAAU,EACV,kBAA0C,CAAA,sBAAyB,CAAA,EACnE,OAAO,GAAG,CAAC,EACX,QAAgB,KAAK,CAAC,MAAM,GAAG,CAAC,EAChC,sBAAsB,GAAG,EAAE,EACtB,EAAE;IACP,MAAM,SAAS,GAAG,CAAC,GAAW,EAAE,IAAY,EAAU,EAAE;QACtD,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;QACF,IAAI,KAAK,GAAG,GAAG,GAAG,CAAC,CAAC;QACpB,IAAI,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC;QACtB,OAAO,IAAI,EAAE,CAAC;YACZ,GAAG,CAAC;gBACF,KAAK,EAAE,CAAC;YACV,CAAC,QAAQ,eAAe,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE;YACnD,GAAG,CAAC;gBACF,MAAM,EAAE,CAAC;YACX,CAAC,QAAQ,eAAe,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE;YACpD,IAAI,KAAK,IAAI,MAAM,EAAE,CAAC;gBACpB,OAAO,MAAM,CAAC;YAChB,CAAC;YACD,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QAChE,CAAC;IACH,CAAC,CAAC;IAEF,MAAM,aAAa,GAAG,CAAC,GAAW,EAAE,IAAY,EAAE,EAAE;QAClD,KAAK,IAAI,KAAK,GAAG,GAAG,GAAG,CAAC,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC;YACjD,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;YACzB,IAAI,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC;YACvB,OAAO,MAAM,IAAI,GAAG,IAAI,eAAe,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAChE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;gBAClC,MAAM,EAAE,CAAC;YACX,CAAC;YACD,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC;QAC1B,CAAC;IACH,CAAC,CAAC;IAEF,MAAM,IAAI,GAAG,CAAC,GAAW,EAAE,IAAY,EAAE,EAAE;QACzC,OAAO,GAAG,GAAG,IAAI,EAAE,CAAC;YAClB,IAAI,IAAI,GAAG,GAAG,GAAG,sBAAsB,EAAE,CAAC;gBACxC,aAAa,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;gBACzB,MAAM;YACR,CAAC;YACD,MAAM,EAAE,GAAG,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YAChC,IAAI,EAAE,GAAG,GAAG,GAAG,IAAI,GAAG,EAAE,EAAE,CAAC;gBACzB,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;gBACd,GAAG,GAAG,EAAE,GAAG,CAAC,CAAC;YACf,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;gBACnB,IAAI,GAAG,EAAE,CAAC;YACZ,CAAC;QACH,CAAC;IACH,CAAC,CAAC;IAEF,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;IACrB,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,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"}

package/module/Array/range.d.ts

@@ -2,8 +2,10 @@
  * 連続した数値の配列を生成する
  * @param start 開始数値
  * @param end 終了数値 (省略した場合は0からstartまでの配列を生成)
+ * @param step ステップ数 (省略した場合は1)
  * @returns 連続した数値の配列
  * @example range(5); // [0, 1, 2, 3, 4]
+ * @example range(2, 10, 2); // [2, 4, 6, 8]
  */
-declare const range: (start: number, end?: number) => number[];
+declare const range: (start: number, end?: number, step?: number) => number[];
 export { range };

package/module/Array/range.js

@@ -2,18 +2,20 @@
  * 連続した数値の配列を生成する
  * @param start 開始数値
  * @param end 終了数値 (省略した場合は0からstartまでの配列を生成)
+ * @param step ステップ数 (省略した場合は1)
  * @returns 連続した数値の配列
  * @example range(5); // [0, 1, 2, 3, 4]
+ * @example range(2, 10, 2); // [2, 4, 6, 8]
  */
-const range = (start, end) => {
+const range = (start, end, step = 1) => {
     const array = [];
     if (end) {
-        for (let index = start; index < end; index++) {
+        for (let index = start; index < end; index += step) {
             array.push(index);
         }
     }
     else {
-        for (let index = 0; index < start; index++) {
+        for (let index = 0; index < start; index += step) {
             array.push(index);
         }
     }

package/module/Array/range.js.map

@@ -1 +1 @@
-{"version":3,"file":"range.js","sourceRoot":"","sources":["../../src/Array/range.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,KAAK,GAAG,CAAC,KAAa,EAAE,GAAY,EAAE,EAAE;IAC5C,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,GAAG,EAAE,CAAC;QACR,KAAK,IAAI,KAAK,GAAG,KAAK,EAAE,KAAK,GAAG,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC;YAC7C,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,EAAE,EAAE,CAAC;YAC3C,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;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"}

package/module/Array/timSort.d.ts

@@ -1,13 +1,15 @@
+type CompareFunction<T> = (a: T, b: T) => number;
 /**
  * TimSortアルゴリズムを実装した関数です。
  * 挿入ソートとマージソートの良い特性を組み合わせたソートアルゴリズムで、
  * 安定なソートを提供し、最悪のケースでもO(n log n)の時間複雑度を持ちます。
  *
  * @param {T[]} array - ソートする配列
- * @param {(a: T, b: T) => number} [compareFunction=compareFunctionDefault<T>] -
+ * @param {CompareFunction<T>} [compareFunction=compareFunctionDefault<T>] -
  *        要素比較のための関数
  * @param {number} [start=0] - ソートを開始する配列のインデックス
  * @param {number} [end=array.length - 1] - ソートを終了する配列のインデックス
  * @returns {T[]} - ソートされた配列
  */
-export declare const timSort: <T>(array: T[], compareFunction?: (a: T, b: T) => number, start?: number, end?: number) => T[];
+export declare const timSort: <T>(array: T[], compareFunction?: CompareFunction<T>, start?: number, end?: number) => T[];
+export {};