mirror of
https://gitcode.com/GitHub_Trending/ji/jitsi-meet.git
synced 2025-12-30 11:22:31 +00:00
* add denoise effect * denoise prototype * improve rnnoise / add comments * revert some unnecessary changes * Add noise suppressor worklet * Send notification on failure * address code review * additional comments * additional comments * update package-lock * fix rebase changes * update rnnoise npm package * sort lang * adjust webpack performance hint * address code review * address code review * switch ns files to typescript * fix null-loader version, lang sort * fix lint * missing import * fix lint / address code review * use single action for ns state * move activation to thunk * increase node heap * copy noise-suppressor to deploy * fix ts lint
38 lines
917 B
TypeScript
38 lines
917 B
TypeScript
/**
|
|
* Compute the greatest common divisor using Euclid's algorithm.
|
|
*
|
|
* @param {number} num1 - First number.
|
|
* @param {number} num2 - Second number.
|
|
* @returns {number}
|
|
*/
|
|
export function greatestCommonDivisor(num1: number, num2: number) {
|
|
let number1: number = num1;
|
|
let number2: number = num2;
|
|
|
|
while (number1 !== number2) {
|
|
if (number1 > number2) {
|
|
number1 = number1 - number2;
|
|
} else {
|
|
number2 = number2 - number1;
|
|
}
|
|
}
|
|
|
|
return number2;
|
|
}
|
|
|
|
/**
|
|
* Calculate least common multiple using gcd.
|
|
*
|
|
* @param {number} num1 - First number.
|
|
* @param {number} num2 - Second number.
|
|
* @returns {number}
|
|
*/
|
|
export function leastCommonMultiple(num1: number, num2: number) {
|
|
const number1: number = num1;
|
|
const number2: number = num2;
|
|
|
|
const gcd: number = greatestCommonDivisor(number1, number2);
|
|
|
|
return (number1 * number2) / gcd;
|
|
}
|