FM / examples

/opt/canhelp/node_modules/fraction.js/examples/

/opt/canhelp/node_modules/fraction.js/examples

Name	Size	Mode	Actions
angles.js	569	0644	edit dl rm
approx.js	1093	0644	edit dl rm
egyptian.js	585	0644	edit dl rm
hesse-convergence.js	2027	0644	edit dl rm
integrate.js	1872	0644	edit dl rm
ratio-chain.js	869	0644	edit dl rm
rational-pow.js	704	0644	edit dl rm
tape-measure.js	408	0644	edit dl rm
toFraction.js	701	0644	edit dl rm
valueOfPi.js	1175	0644	edit dl rm

Edit: /opt/canhelp/node_modules/fraction.js/examples/approx.js (1093B)

/*
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);
}

/* 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); }