umt 2.1.1 → 2.2.0

package/module/Math/min.d.ts

@@ -1,7 +1,8 @@
 /**
- * 最小値を返す
- * @param {number[]} number_
- * @returns number
+ * Returns the minimum value from the input numbers
+ * @param {number[]} number_ Array of numbers
+ * @returns {number} Minimum value
  * @example min(1, 2, 3); // 1
+ * @description Automatically removes duplicates using Set
  */
 export declare const min: (...number_: number[]) => number;

package/module/Math/min.js

@@ -1,8 +1,9 @@
 /**
- * 最小値を返す
- * @param {number[]} number_
- * @returns number
+ * Returns the minimum value from the input numbers
+ * @param {number[]} number_ Array of numbers
+ * @returns {number} Minimum value
  * @example min(1, 2, 3); // 1
+ * @description Automatically removes duplicates using Set
  */
 export const min = (...number_) => Reflect.apply(Math.min, null, [...new Set(number_)]);
 //# sourceMappingURL=min.js.map

package/module/Math/min.js.map

@@ -1 +1 @@
-{"version":3,"file":"min.js","sourceRoot":"","sources":["../../src/Math/min.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,MAAM,CAAC,MAAM,GAAG,GAAG,CAAC,GAAG,OAAiB,EAAE,EAAE,CAC1C,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC"}
+{"version":3,"file":"min.js","sourceRoot":"","sources":["../../src/Math/min.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,GAAG,GAAG,CAAC,GAAG,OAAiB,EAAE,EAAE,CAC1C,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC"}

package/module/Math/multiples.d.ts

@@ -1,8 +1,8 @@
 /**
- * 倍数
- * @param  {number} x
- * @param  {number} n
- * @returns number[]
+ * Generate an array of multiples of a number
+ * @param  {number} x Base number
+ * @param  {number} n Number of multiples to generate
+ * @returns {number[]} Array of multiples
  * @example multiples(2, 5); // [2, 4, 6, 8, 10]
  */
 export declare const multiples: (x: number, n: number) => number[];

package/module/Math/multiples.js

@@ -1,8 +1,8 @@
 /**
- * 倍数
- * @param  {number} x
- * @param  {number} n
- * @returns number[]
+ * Generate an array of multiples of a number
+ * @param  {number} x Base number
+ * @param  {number} n Number of multiples to generate
+ * @returns {number[]} Array of multiples
  * @example multiples(2, 5); // [2, 4, 6, 8, 10]
  */
 export const multiples = (x, n) => {

package/module/Math/multiplication.d.ts

@@ -1,7 +1,7 @@
 /**
- * 誤差のない掛け算を任意長の引数で行う
- * @param  {...number[]} numbers
- * @returns number
+ * Performs multiplication without floating point errors for any number of arguments
+ * @param  {...number[]} numbers Numbers to multiply
+ * @returns {number} Product of all numbers
  * @example multiplication(0.1, 0.2, 0.3); // 0.006
  */
 export declare const multiplication: (...numbers: number[]) => number;

package/module/Math/multiplication.js

@@ -1,8 +1,8 @@
 import { getDecimalLength } from "./getDecimalLength";
 /**
- * 誤差のない掛け算を任意長の引数で行う
- * @param  {...number[]} numbers
- * @returns number
+ * Performs multiplication without floating point errors for any number of arguments
+ * @param  {...number[]} numbers Numbers to multiply
+ * @returns {number} Product of all numbers
  * @example multiplication(0.1, 0.2, 0.3); // 0.006
  */
 export const multiplication = (...numbers) => {

package/module/Math/nCr.d.ts

@@ -1,8 +1,11 @@
 /**
- * n個からr個を選ぶ組み合わせ（nCr）を計算します。
- * @param n - 選ぶ元となる全体の数
- * @param r - 選ぶ個数
- * @returns 組み合わせの結果、または引数が無効な場合はNaN
+ * Calculates combinations (nCr) - number of ways to choose r items from n items
+ * @param n - Total number of items
+ * @param r - Number of items to choose
+ * @returns {number} Number of combinations, or NaN for invalid arguments
  * @example nCr(5, 2); // 10
+ * @description
+ * Calculates the number of ways to choose r items from a set of n items,
+ * where the order doesn't matter. Uses the formula nCr = nPr / r!
  */
 export declare const nCr: (n: number, r: number) => number;

package/module/Math/nCr.js

@@ -1,10 +1,13 @@
 import { nPr } from "./nPr";
 /**
- * n個からr個を選ぶ組み合わせ（nCr）を計算します。
- * @param n - 選ぶ元となる全体の数
- * @param r - 選ぶ個数
- * @returns 組み合わせの結果、または引数が無効な場合はNaN
+ * Calculates combinations (nCr) - number of ways to choose r items from n items
+ * @param n - Total number of items
+ * @param r - Number of items to choose
+ * @returns {number} Number of combinations, or NaN for invalid arguments
  * @example nCr(5, 2); // 10
+ * @description
+ * Calculates the number of ways to choose r items from a set of n items,
+ * where the order doesn't matter. Uses the formula nCr = nPr / r!
  */
 export const nCr = (n, r) => {
     if (n === 0 || r === 0 || n < r) {

package/module/Math/nCr.js.map

@@ -1 +1 @@
-{"version":3,"file":"nCr.js","sourceRoot":"","sources":["../../src/Math/nCr.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,MAAM,OAAO,CAAC;AAE5B;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE;IAClD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAChC,OAAO,MAAM,CAAC,GAAG,CAAC;IACpB,CAAC;IAED,MAAM,SAAS,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5B,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;QACxC,WAAW,IAAI,KAAK,CAAC;IACvB,CAAC;IAED,MAAM,MAAM,GAAG,SAAS,GAAG,WAAW,CAAC;IAEvC,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC"}
+{"version":3,"file":"nCr.js","sourceRoot":"","sources":["../../src/Math/nCr.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,MAAM,OAAO,CAAC;AAE5B;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE;IAClD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAChC,OAAO,MAAM,CAAC,GAAG,CAAC;IACpB,CAAC;IAED,MAAM,SAAS,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5B,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;QACxC,WAAW,IAAI,KAAK,CAAC;IACvB,CAAC;IAED,MAAM,MAAM,GAAG,SAAS,GAAG,WAAW,CAAC;IAEvC,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC"}

package/module/Math/nHr.d.ts

@@ -1,8 +1,11 @@
 /**
- * n個からr個を重複を許して選ぶ組み合わせ（nHr）を計算します。
- * @param n - 選ぶ元となる全体の数
- * @param r - 選ぶ個数
- * @returns 重複組み合わせの結果、または引数が無効な場合はNaN
+ * Calculates combinations with repetition (nHr) - ways to choose r items from n items with repetition allowed
+ * @param n - Total number of items
+ * @param r - Number of items to choose
+ * @returns {number} Number of combinations with repetition, or NaN for invalid arguments
  * @example nHr(5, 2); // 15
+ * @description
+ * Also known as "stars and bars" problem or "multichoose".
+ * Uses the formula nHr = (n+r-1)Cr
  */
 export declare const nHr: (n: number, r: number) => number;

package/module/Math/nHr.js

@@ -1,10 +1,13 @@
 import { nCr } from "./nCr";
 /**
- * n個からr個を重複を許して選ぶ組み合わせ（nHr）を計算します。
- * @param n - 選ぶ元となる全体の数
- * @param r - 選ぶ個数
- * @returns 重複組み合わせの結果、または引数が無効な場合はNaN
+ * Calculates combinations with repetition (nHr) - ways to choose r items from n items with repetition allowed
+ * @param n - Total number of items
+ * @param r - Number of items to choose
+ * @returns {number} Number of combinations with repetition, or NaN for invalid arguments
  * @example nHr(5, 2); // 15
+ * @description
+ * Also known as "stars and bars" problem or "multichoose".
+ * Uses the formula nHr = (n+r-1)Cr
  */
 export const nHr = (n, r) => {
     if (n === 0 || r === 0 || n < 0 || r < 0) {

package/module/Math/nHr.js.map

@@ -1 +1 @@
-{"version":3,"file":"nHr.js","sourceRoot":"","sources":["../../src/Math/nHr.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,MAAM,OAAO,CAAC;AAE5B;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE;IAClD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACzC,OAAO,MAAM,CAAC,GAAG,CAAC;IACpB,CAAC;IAED,MAAM,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAEjC,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC"}
+{"version":3,"file":"nHr.js","sourceRoot":"","sources":["../../src/Math/nHr.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,MAAM,OAAO,CAAC;AAE5B;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE;IAClD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACzC,OAAO,MAAM,CAAC,GAAG,CAAC;IACpB,CAAC;IAED,MAAM,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAEjC,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC"}

package/module/Math/nPr.d.ts

@@ -1,8 +1,11 @@
 /**
- * n個からr個を選ぶ順列（nPr）を計算します。
- * @param n - 選ぶ元となる全体の数
- * @param r - 選ぶ個数
- * @returns 順列の結果、または引数が無効な場合はNaN
+ * Calculates permutations (nPr) - number of ways to arrange r items from n items
+ * @param n - Total number of items
+ * @param r - Number of items to arrange
+ * @returns {number} Number of permutations, or NaN for invalid arguments
  * @example nPr(5, 2); // 20
+ * @description
+ * Calculates permutations where order matters, using the formula:
+ * nPr = n * (n-1) * (n-2) * ... * (n-r+1)
  */
 export declare const nPr: (n: number, r: number) => number;

package/module/Math/nPr.js

@@ -1,9 +1,12 @@
 /**
- * n個からr個を選ぶ順列（nPr）を計算します。
- * @param n - 選ぶ元となる全体の数
- * @param r - 選ぶ個数
- * @returns 順列の結果、または引数が無効な場合はNaN
+ * Calculates permutations (nPr) - number of ways to arrange r items from n items
+ * @param n - Total number of items
+ * @param r - Number of items to arrange
+ * @returns {number} Number of permutations, or NaN for invalid arguments
  * @example nPr(5, 2); // 20
+ * @description
+ * Calculates permutations where order matters, using the formula:
+ * nPr = n * (n-1) * (n-2) * ... * (n-r+1)
  */
 export const nPr = (n, r) => {
     if (n === 0 || r === 0 || n < r) {

package/module/Math/nPr.js.map

@@ -1 +1 @@
-{"version":3,"file":"nPr.js","sourceRoot":"","sources":["../../src/Math/nPr.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE;IAClD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAChC,OAAO,MAAM,CAAC,GAAG,CAAC;IACpB,CAAC;IACD,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;QACvC,MAAM,IAAI,CAAC,GAAG,KAAK,CAAC;IACtB,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC"}
+{"version":3,"file":"nPr.js","sourceRoot":"","sources":["../../src/Math/nPr.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE;IAClD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QAChC,OAAO,MAAM,CAAC,GAAG,CAAC;IACpB,CAAC;IACD,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;QACvC,MAAM,IAAI,CAAC,GAAG,KAAK,CAAC;IACtB,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC"}

package/module/Math/primeFactorization.d.ts

@@ -1,8 +1,11 @@
 /**
- * 素因数分解
- * @param  {number} x
- * @returns {number: number; count: number}[]
+ * Performs prime factorization of a number
+ * @param  {number} x Number to factorize
+ * @returns {Array<{number: number; count: number}>} Array of prime factors and their counts
  * @example primeFactorization(12); // [{number: 2, count: 2}, {number: 3, count: 1}]
+ * @description
+ * Returns an array of objects containing prime factors and their counts.
+ * For example, 12 = 2^2 * 3^1 is represented as [{number: 2, count: 2}, {number: 3, count: 1}]
  */
 export declare const primeFactorization: (x: number) => {
     number: number;

package/module/Math/primeFactorization.js

@@ -1,19 +1,22 @@
 /**
- * 素因数分解
- * @param  {number} x
- * @returns {number: number; count: number}[]
+ * Performs prime factorization of a number
+ * @param  {number} x Number to factorize
+ * @returns {Array<{number: number; count: number}>} Array of prime factors and their counts
  * @example primeFactorization(12); // [{number: 2, count: 2}, {number: 3, count: 1}]
+ * @description
+ * Returns an array of objects containing prime factors and their counts.
+ * For example, 12 = 2^2 * 3^1 is represented as [{number: 2, count: 2}, {number: 3, count: 1}]
  */
 export const primeFactorization = (x) => {
     let n = 0;
-    let cooyX = x;
+    let copyX = x;
     const out = [];
-    for (let index = 2; index <= cooyX; index++) {
-        if (cooyX % index === 0) {
+    for (let index = 2; index <= copyX; index++) {
+        if (copyX % index === 0) {
             n = 0;
-            while (cooyX % index === 0) {
+            while (copyX % index === 0) {
                 n++;
-                cooyX /= index;
+                copyX /= index;
             }
             out.push({ number: index, count: n });
         }

package/module/Math/primeFactorization.js.map

@@ -1 +1 @@
-{"version":3,"file":"primeFactorization.js","sourceRoot":"","sources":["../../src/Math/primeFactorization.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,CAAS,EAAE,EAAE;IAC9C,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,GAAG,GAAwC,EAAE,CAAC;IACpD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC;QAC5C,IAAI,KAAK,GAAG,KAAK,KAAK,CAAC,EAAE,CAAC;YACxB,CAAC,GAAG,CAAC,CAAC;YACN,OAAO,KAAK,GAAG,KAAK,KAAK,CAAC,EAAE,CAAC;gBAC3B,CAAC,EAAE,CAAC;gBACJ,KAAK,IAAI,KAAK,CAAC;YACjB,CAAC;YACD,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QACxC,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC,CAAC"}
+{"version":3,"file":"primeFactorization.js","sourceRoot":"","sources":["../../src/Math/primeFactorization.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,CAAS,EAAE,EAAE;IAC9C,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,GAAG,GAAwC,EAAE,CAAC;IACpD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC;QAC5C,IAAI,KAAK,GAAG,KAAK,KAAK,CAAC,EAAE,CAAC;YACxB,CAAC,GAAG,CAAC,CAAC;YACN,OAAO,KAAK,GAAG,KAAK,KAAK,CAAC,EAAE,CAAC;gBAC3B,CAAC,EAAE,CAAC;gBACJ,KAAK,IAAI,KAAK,CAAC;YACjB,CAAC;YACD,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QACxC,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC,CAAC"}

package/module/Math/quotient.d.ts

@@ -1,8 +1,11 @@
 /**
- * あまりの割り算
- * @param  {number} x
- * @param  {number} y
- * @returns number[]
+ * Computes quotient and remainder of division
+ * @param  {number} x Dividend
+ * @param  {number} y Divisor
+ * @returns {number[]} Array containing [quotient, remainder]
  * @example quotient(5, 2); // [2, 1]
+ * @description
+ * Returns an array where the first element is the quotient (integer division result)
+ * and the second element is the remainder
  */
 export declare const quotient: (x: number, y: number) => number[];

package/module/Math/quotient.js

@@ -1,9 +1,12 @@
 /**
- * あまりの割り算
- * @param  {number} x
- * @param  {number} y
- * @returns number[]
+ * Computes quotient and remainder of division
+ * @param  {number} x Dividend
+ * @param  {number} y Divisor
+ * @returns {number[]} Array containing [quotient, remainder]
  * @example quotient(5, 2); // [2, 1]
+ * @description
+ * Returns an array where the first element is the quotient (integer division result)
+ * and the second element is the remainder
  */
 export const quotient = (x, y) => [
     (x - (x % y)) / y,

package/module/Math/quotient.js.map

@@ -1 +1 @@
-{"version":3,"file":"quotient.js","sourceRoot":"","sources":["../../src/Math/quotient.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC;IAChD,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;IACjB,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC;CACZ,CAAC"}
+{"version":3,"file":"quotient.js","sourceRoot":"","sources":["../../src/Math/quotient.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC;IAChD,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;IACjB,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC;CACZ,CAAC"}

package/module/Math/radToDeg.d.ts

@@ -1,7 +1,9 @@
 /**
- * ラジアンを角度に変換
- * @param  {number} x
- * @returns number
+ * Converts radians to degrees
+ * @param  {number} x Angle in radians
+ * @returns {number} Angle in degrees
  * @example radToDeg(Math.PI); // 180
+ * @description
+ * Uses the formula: degrees = radians * (180/π)
  */
 export declare const radToDeg: (x: number) => number;

package/module/Math/radToDeg.js

@@ -1,9 +1,11 @@
 import { division } from "./division";
 /**
- * ラジアンを角度に変換
- * @param  {number} x
- * @returns number
+ * Converts radians to degrees
+ * @param  {number} x Angle in radians
+ * @returns {number} Angle in degrees
  * @example radToDeg(Math.PI); // 180
+ * @description
+ * Uses the formula: degrees = radians * (180/π)
  */
 export const radToDeg = (x) => division(x, division(Math.PI, 180));
 //# sourceMappingURL=radToDeg.js.map

package/module/Math/radToDeg.js.map

@@ -1 +1 @@
-{"version":3,"file":"radToDeg.js","sourceRoot":"","sources":["../../src/Math/radToDeg.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAEtC;;;;;GAKG;AACH,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC"}
+{"version":3,"file":"radToDeg.js","sourceRoot":"","sources":["../../src/Math/radToDeg.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAEtC;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC"}

package/module/Math/random.d.ts

@@ -1,8 +1,9 @@
 /**
- * 整数の乱数
- * @param  {number} max 最大値
- * @param  {number} min 最小値
- * @return {number}
- * @example random(10); // 0~10
+ * Generates a random integer between min and max (inclusive)
+ * @param  {number} max Maximum value (inclusive)
+ * @param  {number} min Minimum value (inclusive, default: 0)
+ * @returns {number} Random integer between min and max
+ * @example random(10); // returns number between 0 and 10
+ * @example random(10, 5); // returns number between 5 and 10
  */
 export declare const random: (max: number, min?: number) => number;

package/module/Math/random.js

@@ -1,9 +1,10 @@
 /**
- * 整数の乱数
- * @param  {number} max 最大値
- * @param  {number} min 最小値
- * @return {number}
- * @example random(10); // 0~10
+ * Generates a random integer between min and max (inclusive)
+ * @param  {number} max Maximum value (inclusive)
+ * @param  {number} min Minimum value (inclusive, default: 0)
+ * @returns {number} Random integer between min and max
+ * @example random(10); // returns number between 0 and 10
+ * @example random(10, 5); // returns number between 5 and 10
  */
 export const random = (max, min = 0) => Math.floor(Math.random() * (max - min + 1)) + min;
 //# sourceMappingURL=random.js.map

package/module/Math/random.js.map

@@ -1 +1 @@
-{"version":3,"file":"random.js","sourceRoot":"","sources":["../../src/Math/random.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,GAAW,EAAE,GAAG,GAAG,CAAC,EAAU,EAAE,CACrD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC"}
+{"version":3,"file":"random.js","sourceRoot":"","sources":["../../src/Math/random.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,GAAW,EAAE,GAAG,GAAG,CAAC,EAAU,EAAE,CACrD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC"}

package/module/Math/reduce.d.ts

@@ -1,9 +1,14 @@
 /**
- * 約分
- * @param  {number} x
- * @param  {number} y
- * @returns {x: number, y: number, gcd: number}
+ * Reduces a fraction to its lowest terms
+ * @param  {number} x Numerator
+ * @param  {number} y Denominator
+ * @returns {{x: number, y: number, gcd: number}} Reduced fraction and the GCD
  * @example reduce(2, 4); // {x: 1, y: 2, gcd: 2}
+ * @description
+ * Returns an object containing:
+ * - x: reduced numerator
+ * - y: reduced denominator
+ * - gcd: greatest common divisor used for reduction
  */
 export declare const reduce: (x: number, y: number) => {
     x: number;

package/module/Math/reduce.js

@@ -1,16 +1,26 @@
 import { gcd } from "./gcd";
 /**
- * 約分
- * @param  {number} x
- * @param  {number} y
- * @returns {x: number, y: number, gcd: number}
+ * Reduces a fraction to its lowest terms
+ * @param  {number} x Numerator
+ * @param  {number} y Denominator
+ * @returns {{x: number, y: number, gcd: number}} Reduced fraction and the GCD
  * @example reduce(2, 4); // {x: 1, y: 2, gcd: 2}
+ * @description
+ * Returns an object containing:
+ * - x: reduced numerator
+ * - y: reduced denominator
+ * - gcd: greatest common divisor used for reduction
  */
 export const reduce = (x, y) => {
     if (x === 0 || y === 0) {
         return { x: Number.NaN, y: Number.NaN };
     }
-    const n = gcd(x, y);
-    return { x: x / n, y: y / n, gcd: gcd(x, y) };
+    const gcdValue = gcd(Math.abs(x), Math.abs(y));
+    const sign = y < 0 ? -1 : 1;
+    return {
+        x: (x / gcdValue) * sign,
+        y: Math.abs(y / gcdValue),
+        gcd: gcdValue,
+    };
 };
 //# sourceMappingURL=reduce.js.map

package/module/Math/reduce.js.map

@@ -1 +1 @@
-{"version":3,"file":"reduce.js","sourceRoot":"","sources":["../../src/Math/reduce.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,MAAM,OAAO,CAAC;AAC5B;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE;IAC7C,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,EAAE,CAAC,EAAE,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE,MAAM,CAAC,GAAG,EAAE,CAAC;IAC1C,CAAC;IACD,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACpB,OAAO,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;AAChD,CAAC,CAAC"}
+{"version":3,"file":"reduce.js","sourceRoot":"","sources":["../../src/Math/reduce.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,MAAM,OAAO,CAAC;AAC5B;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE;IAC7C,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,EAAE,CAAC,EAAE,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE,MAAM,CAAC,GAAG,EAAE,CAAC;IAC1C,CAAC;IACD,MAAM,QAAQ,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/C,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5B,OAAO;QACL,CAAC,EAAE,CAAC,CAAC,GAAG,QAAQ,CAAC,GAAG,IAAI;QACxB,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC;QACzB,GAAG,EAAE,QAAQ;KACd,CAAC;AACJ,CAAC,CAAC"}

package/module/Math/repeatedTrial.d.ts

@@ -1,9 +1,9 @@
 /**
- * 反復的な思考
- * @param  {number} n
- * @param  {number} r
- * @param  {{x:number;y:number}} p
- * @return {number[]}
+ * Calculate probability in repeated trials
+ * @param  {number} n Number of trials
+ * @param  {number} r Number of successes
+ * @param  {{x:number;y:number}} p Probability fraction (x/y)
+ * @returns {number[]} Array containing [numerator, denominator]
  * @example repeatedTrial(5, 2, {x: 1/3, y: 2/3}); // [10, 27]
  */
 export declare const repeatedTrial: (n: number, r: number, p: {

package/module/Math/repeatedTrial.js

@@ -1,11 +1,11 @@
 import { gcd } from "./gcd";
 import { nCr } from "./nCr";
 /**
- * 反復的な思考
- * @param  {number} n
- * @param  {number} r
- * @param  {{x:number;y:number}} p
- * @return {number[]}
+ * Calculate probability in repeated trials
+ * @param  {number} n Number of trials
+ * @param  {number} r Number of successes
+ * @param  {{x:number;y:number}} p Probability fraction (x/y)
+ * @returns {number[]} Array containing [numerator, denominator]
  * @example repeatedTrial(5, 2, {x: 1/3, y: 2/3}); // [10, 27]
  */
 export const repeatedTrial = (n, r, p) => {

package/module/Math/roundOf.d.ts

@@ -1,8 +1,10 @@
 /**
- * 四捨五入
- * @param {number} number_ - 四捨五入する数値
- * @param {number} precision - 四捨五入する桁数
- * @returns number
+ * Rounds a number to specified decimal places
+ * @param {number} value - Number to round
+ * @param {number} precision - Number of decimal places (default: 0)
+ * @returns {number} Rounded number
  * @example roundOf(1.234, 2); // 1.23
+ * @example roundOf(1.235, 2); // 1.24
+ * @example roundOf(-1.234, 2); // -1.23
  */
-export declare const roundOf: (number_: number, precision?: number) => number;
+export declare const roundOf: (value: number, precision?: number) => number;

package/module/Math/roundOf.js

@@ -1,11 +1,13 @@
 /**
- * 四捨五入
- * @param {number} number_ - 四捨五入する数値
- * @param {number} precision - 四捨五入する桁数
- * @returns number
+ * Rounds a number to specified decimal places
+ * @param {number} value - Number to round
+ * @param {number} precision - Number of decimal places (default: 0)
+ * @returns {number} Rounded number
  * @example roundOf(1.234, 2); // 1.23
+ * @example roundOf(1.235, 2); // 1.24
+ * @example roundOf(-1.234, 2); // -1.23
  */
-export const roundOf = (number_, precision = 0) => {
-    return Math.round(number_ * 10 ** precision) / 10 ** precision;
+export const roundOf = (value, precision = 0) => {
+    return Math.round(value * 10 ** precision) / 10 ** precision;
 };
 //# sourceMappingURL=roundOf.js.map

package/module/Math/roundOf.js.map

@@ -1 +1 @@
-{"version":3,"file":"roundOf.js","sourceRoot":"","sources":["../../src/Math/roundOf.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,OAAe,EAAE,SAAS,GAAG,CAAC,EAAE,EAAE;IACxD,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,EAAE,IAAI,SAAS,CAAC,GAAG,EAAE,IAAI,SAAS,CAAC;AACjE,CAAC,CAAC"}
+{"version":3,"file":"roundOf.js","sourceRoot":"","sources":["../../src/Math/roundOf.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,KAAa,EAAE,SAAS,GAAG,CAAC,EAAE,EAAE;IACtD,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,EAAE,IAAI,SAAS,CAAC,GAAG,EAAE,IAAI,SAAS,CAAC;AAC/D,CAAC,CAAC"}

package/module/Math/solveEquation.d.ts

@@ -1,19 +1,18 @@
 /**
- * 連立一次方程式を解く
- * @param {number[][]} coefficients - 係数
- * @param {number[]} constants - 定数
- * @returns {number[]} 解
+ * Solves a system of linear equations using Gaussian elimination
+ * @param {number[][]} coefficients Matrix of coefficients
+ * @param {number[]} constants Vector of constants
+ * @returns {number[]} Solution vector
  * @example
+ * // Solves the system:
  * // x + y = 4
  * // x + 2y = 10
- * solveEquation(
- * {
- * 	coefficients: [
- * 		[1, 1],
- * 		[1, 2],
- * 	],
- * 	constants: [4, 10],
- * },
- * ); // [-2, 6]
+ * solveEquation([
+ *   [1, 1],
+ *   [1, 2]
+ * ], [4, 10]); // returns [-2, 6]
+ * @description
+ * Uses Gaussian elimination with partial pivoting to solve a system of linear equations.
+ * The solution is rounded to 1 decimal place.
  */
 export declare const solveEquation: (coefficients: number[][], constants: number[]) => number[];