Software zum Installieren eines Smart-Mirror Frameworks , zum Nutzen von hochschulrelevanten Informationen, auf einem Raspberry-Pi.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

es.number.to-fixed.js 3.2KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125
  1. 'use strict';
  2. var $ = require('../internals/export');
  3. var toInteger = require('../internals/to-integer');
  4. var thisNumberValue = require('../internals/this-number-value');
  5. var repeat = require('../internals/string-repeat');
  6. var fails = require('../internals/fails');
  7. var nativeToFixed = 1.0.toFixed;
  8. var floor = Math.floor;
  9. var pow = function (x, n, acc) {
  10. return n === 0 ? acc : n % 2 === 1 ? pow(x, n - 1, acc * x) : pow(x * x, n / 2, acc);
  11. };
  12. var log = function (x) {
  13. var n = 0;
  14. var x2 = x;
  15. while (x2 >= 4096) {
  16. n += 12;
  17. x2 /= 4096;
  18. }
  19. while (x2 >= 2) {
  20. n += 1;
  21. x2 /= 2;
  22. } return n;
  23. };
  24. var multiply = function (data, n, c) {
  25. var index = -1;
  26. var c2 = c;
  27. while (++index < 6) {
  28. c2 += n * data[index];
  29. data[index] = c2 % 1e7;
  30. c2 = floor(c2 / 1e7);
  31. }
  32. };
  33. var divide = function (data, n) {
  34. var index = 6;
  35. var c = 0;
  36. while (--index >= 0) {
  37. c += data[index];
  38. data[index] = floor(c / n);
  39. c = (c % n) * 1e7;
  40. }
  41. };
  42. var dataToString = function (data) {
  43. var index = 6;
  44. var s = '';
  45. while (--index >= 0) {
  46. if (s !== '' || index === 0 || data[index] !== 0) {
  47. var t = String(data[index]);
  48. s = s === '' ? t : s + repeat.call('0', 7 - t.length) + t;
  49. }
  50. } return s;
  51. };
  52. var FORCED = nativeToFixed && (
  53. 0.00008.toFixed(3) !== '0.000' ||
  54. 0.9.toFixed(0) !== '1' ||
  55. 1.255.toFixed(2) !== '1.25' ||
  56. 1000000000000000128.0.toFixed(0) !== '1000000000000000128'
  57. ) || !fails(function () {
  58. // V8 ~ Android 4.3-
  59. nativeToFixed.call({});
  60. });
  61. // `Number.prototype.toFixed` method
  62. // https://tc39.es/ecma262/#sec-number.prototype.tofixed
  63. $({ target: 'Number', proto: true, forced: FORCED }, {
  64. toFixed: function toFixed(fractionDigits) {
  65. var number = thisNumberValue(this);
  66. var fractDigits = toInteger(fractionDigits);
  67. var data = [0, 0, 0, 0, 0, 0];
  68. var sign = '';
  69. var result = '0';
  70. var e, z, j, k;
  71. if (fractDigits < 0 || fractDigits > 20) throw RangeError('Incorrect fraction digits');
  72. // eslint-disable-next-line no-self-compare -- NaN check
  73. if (number != number) return 'NaN';
  74. if (number <= -1e21 || number >= 1e21) return String(number);
  75. if (number < 0) {
  76. sign = '-';
  77. number = -number;
  78. }
  79. if (number > 1e-21) {
  80. e = log(number * pow(2, 69, 1)) - 69;
  81. z = e < 0 ? number * pow(2, -e, 1) : number / pow(2, e, 1);
  82. z *= 0x10000000000000;
  83. e = 52 - e;
  84. if (e > 0) {
  85. multiply(data, 0, z);
  86. j = fractDigits;
  87. while (j >= 7) {
  88. multiply(data, 1e7, 0);
  89. j -= 7;
  90. }
  91. multiply(data, pow(10, j, 1), 0);
  92. j = e - 1;
  93. while (j >= 23) {
  94. divide(data, 1 << 23);
  95. j -= 23;
  96. }
  97. divide(data, 1 << j);
  98. multiply(data, 1, 1);
  99. divide(data, 2);
  100. result = dataToString(data);
  101. } else {
  102. multiply(data, 0, z);
  103. multiply(data, 1 << -e, 0);
  104. result = dataToString(data) + repeat.call('0', fractDigits);
  105. }
  106. }
  107. if (fractDigits > 0) {
  108. k = result.length;
  109. result = sign + (k <= fractDigits
  110. ? '0.' + repeat.call('0', fractDigits - k) + result
  111. : result.slice(0, k - fractDigits) + '.' + result.slice(k - fractDigits));
  112. } else {
  113. result = sign + result;
  114. } return result;
  115. }
  116. });