planetazuzu
5d7a6500fe
- ✅ Ticket 1.1: Estructura Clean Architecture en backend - ✅ Ticket 1.2: Schemas Zod compartidos - ✅ Ticket 1.3: Refactorización drugs.ts (1362 → 8 archivos modulares) - ✅ Ticket 1.4: Refactorización procedures.ts (3583 → 6 archivos modulares) - ✅ Ticket 1.5: Eliminación de duplicidades (~50 líneas) Cambios principales: - Creada estructura Clean Architecture en backend/src/ - Schemas Zod compartidos en backend/src/shared/schemas/ - Refactorización modular de drugs y procedures - Utilidades genéricas en src/utils/ (filter, validation) - Eliminados scripts obsoletos y documentación antigua - Corregidos errores: QueryClient, import test-error-handling - Build verificado y funcionando correctamente
55 lines
1.1 KiB
JavaScript
55 lines
1.1 KiB
JavaScript
/*
|
|
Fraction.js v5.0.0 10/1/2024
|
|
https://raw.org/article/rational-numbers-in-javascript/
|
|
|
|
Copyright (c) 2024, Robert Eisele (https://raw.org/)
|
|
Licensed under the MIT license.
|
|
*/
|
|
const Fraction = require('fraction.js');
|
|
|
|
// Another rational approximation, not using Farey Sequences but Binary Search using the mediant
|
|
function approximate(p, precision) {
|
|
|
|
var num1 = Math.floor(p);
|
|
var den1 = 1;
|
|
|
|
var num2 = num1 + 1;
|
|
var den2 = 1;
|
|
|
|
if (p !== num1) {
|
|
|
|
while (den1 <= precision && den2 <= precision) {
|
|
|
|
var m = (num1 + num2) / (den1 + den2);
|
|
|
|
if (p === m) {
|
|
|
|
if (den1 + den2 <= precision) {
|
|
den1 += den2;
|
|
num1 += num2;
|
|
den2 = precision + 1;
|
|
} else if (den1 > den2) {
|
|
den2 = precision + 1;
|
|
} else {
|
|
den1 = precision + 1;
|
|
}
|
|
break;
|
|
|
|
} else if (p < m) {
|
|
num2 += num1;
|
|
den2 += den1;
|
|
} else {
|
|
num1 += num2;
|
|
den1 += den2;
|
|
}
|
|
}
|
|
}
|
|
|
|
if (den1 > precision) {
|
|
den1 = den2;
|
|
num1 = num2;
|
|
}
|
|
return new Fraction(num1, den1);
|
|
}
|
|
|