JS中數值常量的含義,數值的運算
JS採用雙精度浮點數(Double-precision floating-point format, Binary64)表示數值(Number),關於計算機中浮點數的表示,可參考這裡。
1 數值常量的含義
- Number.MAX_VALUE
The largest number thar can be represented in JavaScript. Equal to approximately 1.79E+308.
二進位制表示:0111 1111 1110 52個1
計算公式:
// true, 約等於1.79E+308
Number.MAX_VALUE === (2 - Math.pow(2, -52)) * Math.pow(2, 1023)
- Number.MIN_VALUE
The closest number to zero that can be represented in JavaScript. Equal to approximately to 5.00E-304.
二進位制表示:0000 0000 0000 48個0 0001
計算公式(指數位全0)是:
// true, 約等於5E-304
Number.MIN_VALUE === Math.pow(2, -52) * Math.pow(2, -1022)
- Number.MAX_SAFE_INTEGER Number.MIN_SAFE_INTEGER
The value of the largest(smallest) integer n such that n and n+1 are both exactly representable as a Number value. Equal to 9007199254740991(-9007199254740991).
二進位制表示:0100 0011 0011 52個1
計算公式:
// Number.MIN_SAFE_INTEGER is the opposite of Number.MAX_SAFE_INTEGER
// true, 9007199254740991
Number.MAX_SAFE_INTEGER === Math.pow(2, 53) - 1
- Number.EPSILON
The difference of 1 and the smallest value of number greater than 1 that is representable as Number value. Equal to approximately 2.22E-16.
二進位制表示:0100 0011 0011 48個0 0001
計算公式:
// true, 約等於2.22E-16
Number.EPSILON === Math.pow(2, -52)
- Number.NaN
A value that is not a number. In equality comparations, NaN dose not equal to any value, including itself. To test whether a value is equalvalant to NaN, use isNaN function.
二進位制表示:0111 1111 1111 52個不全為0
// isNaN先將引數toNumber, Number.isNaN要求引數必須是Number
isNaN === Number.isNaN() // false
isNaN('a') // true
isNaN('NaN') // true
Number.isNaN('a') // false
Number.isNaN('NaN') // false
- Number.POSITIVE_INFINITY Number.NEGETIVE_INFINITY
A value greater than the largest number that can be represented in JavaScript. JavaScript displays it as infinity.
二進位制表示:0111 1111 1111 52個不全為0
// isFinite先將引數toNumber, Number.isFinite要求引數必須是Number
isFinite === Number.isFinite // false
isFinite('2') // true
Number.isFinite('2') // false
2 數值運算
- 0.1和0.2的二進位制表示
// 0.0001100110011001100110011001100110011001100110011001101
// JS採用Binary64,已有精度損失,是最接近0.1的number
0.1.toString(2)
// 十進位制:7205759403792794, 實際的53有效數字
let a = 0b11001100110011001100110011001100110011001100110011010
// 十進位制:7205759403792793
let b = 0b11001100110011001100110011001100110011001100110011001
// JS:0.1, 計算器:0.10000000000000000555111512312578
let x = a * Math.pow(2, -56)
// JS:0.09999999999999999, 計算器:0.09999999999999999167332731531133
let y = b * Math.pow(2, -56)
// x比y更接近於0.1
// 0.001100110011001100110011001100110011001100110011001101
// 已有精度損失,是最接近0.2的number, 0.2 = 0.1 * 2
0.2.toString(2)
// 52位有效數字和0.1相同, Binary64中的52位有效數字也和0.1相同
// JS:0.2, 計算器:0.20000000000000001110223024625157
let x = a * Math.pow(2, -55)
// JS:0.19999999999999998, 計算器:0.19999999999999998334665463062265
let y = b * Math.pow(2, -55)
// x比y更接近於0.2
- 0.1 + 0.2 = ?
// 0.30000000000000004
0.1 + 0.2
// JS: 0.30000000000000004
// 計算器:0.30000000000000001665334536937735
0.10000000000000000555111512312578 + 0.20000000000000001110223024625157
// 0.0100110011001100110011001100110011001100110011001101
0.30000000000000004.toString(2)
// 十進位制:5404319552844596, a = b + 1
let a = 10011001100110011001100110011001100110011001100110100
// 十進位制:5404319552844595
let b = 10011001100110011001100110011001100110011001100110011
// JS:0.2, 計算器:0.30000000000000004440892098500626
let x = a * Math.pow(2, -55)
// JS:0.19999999999999998, 計算器:0.29999999999999998889776975374843
let y = b * Math.pow(2, -55)
let z = 0.30000000000000001665334536937735
x === z // true
y === z // false
// x比y更接近於z
x - z = 0.00000000000000002775557561562891 = 2.775557561562891E-17
z - y = 0.00000000000000002775557561562892 = 2.775557561562892E-17
3 數值的Binary64表示
- 整數的Binary64表示,MAX_SAFE_INTEGER的由來
0 ~ MAX_SAFE_INTEGER
間的整數,正數的符號位是0
關鍵是確定指數位E
和有效數字S
,指數位有1023
的偏移,011 1111 1111
例子1:S = 0b1.001,E = 0b1000 = ,value = 9
例子2:S = 1.11…還有50個1
,E = 100…還有50個0
=
小數點後的有效數字最多有52位,而E的範圍足夠大,能夠使小數變成整數。
最後1位有效數字的權重最小,為 ,E從小變大,權重也在增大,能表達的數值間隔也在增大。
- 0.1的Binary64表示
// 0.0001100110011001100110011001100110011001100110011001101
0.1.toString(2)
小數點後55
位,有效數字52
位,有效數字前面去掉1
,後面補上0
Binary64中52位有效數字是:1001100110011001100110011001100110011001100110011010
符號位和指數位: 0011 1111 1011 52位有效數字