aboutsummaryrefslogtreecommitdiff
path: root/node_modules/num2fraction/index.js
diff options
context:
space:
mode:
authorDimitri Staessens <dimitri@ouroboros.rocks>2019-10-06 21:37:45 +0200
committerDimitri Staessens <dimitri@ouroboros.rocks>2019-10-06 21:37:45 +0200
commit3c51c3be85bb0d1bdb87ea0d6632f1c256912f27 (patch)
treec7ccc8279b12c4f7bdbbb4270d617e48f51722e4 /node_modules/num2fraction/index.js
parent412c104bebc507bea9c94fd53b5bdc4b64cbfe31 (diff)
downloadwebsite-3c51c3be85bb0d1bdb87ea0d6632f1c256912f27.tar.gz
website-3c51c3be85bb0d1bdb87ea0d6632f1c256912f27.zip
build: Add some required modules for node
Diffstat (limited to 'node_modules/num2fraction/index.js')
-rw-r--r--node_modules/num2fraction/index.js48
1 files changed, 48 insertions, 0 deletions
diff --git a/node_modules/num2fraction/index.js b/node_modules/num2fraction/index.js
new file mode 100644
index 0000000..659deca
--- /dev/null
+++ b/node_modules/num2fraction/index.js
@@ -0,0 +1,48 @@
+'use strict'
+
+var abs = Math.abs
+var round = Math.round
+
+function almostEq(a, b) {
+ return abs(a - b) <= 9.5367432e-7
+}
+
+//最大公约数 Greatest Common Divisor
+function GCD(a, b) {
+ if (almostEq(b, 0)) return a
+ return GCD(b, a % b)
+}
+
+function findPrecision(n) {
+ var e = 1
+
+ while (!almostEq(round(n * e) / e, n)) {
+ e *= 10
+ }
+
+ return e
+}
+
+function num2fraction(num) {
+ if (num === 0 || num === '0') return '0'
+
+ if (typeof num === 'string') {
+ num = parseFloat(num)
+ }
+
+
+ var precision = findPrecision(num) //精确度
+ var number = num * precision
+ var gcd = abs(GCD(number, precision))
+
+ //分子
+ var numerator = number / gcd
+ //分母
+ var denominator = precision / gcd
+
+ //分数
+ return round(numerator) + '/' + round(denominator)
+}
+
+module.exports = num2fraction
+