X && y) 126 | bankruptcy eleven: Numbers Changing bits of number1 through number2 • And: retains purely these bits of number1 which are set in number2. This operation is usually referred to as overlaying, with number2 being the masks. • Or: units all bits of number1 which are set in number2 and retains all different bits unchanged. • Xor: Inverts all bits of number1 which are set in number2 and retains all different bits unchanged. Bitwise Shift Operators JavaScript has 3 bitwise shift operators: • quantity << digitCount (left shift): > (parseInt('1', 2) << 1). toString(2) '10' • quantity >> digitCount (signed correct shift): The 32-bit binary quantity is interpreted as signed (see the previous section). while transferring correct, the signal is preserved: > (parseInt('11111111111111111111111111111110', 2) >> 1). toString(2) '-1' now we have right-shifted –2. the end result, –1, is comparable to a 32-bit integer whose digits are all 1 (the twos’ supplement of 1). In different phrases, a signed correct shift by way of one digit divides either adverse and confident integers by way of . • quantity >>> digitCount` (unsigned correct shift): > (parseInt('11100', 2) >>> 1). toString(2) '1110' As one can find, this operator shifts in zeros from the left. The functionality quantity The functionality quantity will be invoked in methods: Number(value) As a typical functionality, it converts price to a primitive quantity (see “Converting to quantity” on web page 104): > Number('123') 123 > typeof Number(3) 'number' // no swap The functionality quantity | 127 new Number(num) As a undefined, it creates a brand new example of quantity (see “Wrapper items for Primitives” on web page 75), an item that wraps num (after changing it to a number). for instance: > typeof new Number(3) 'object' the previous invocation is the typical one. quantity houses the thing quantity has the next homes: quantity. MAX_VALUE the most important confident quantity that may be represented. Internally, all digits of its frac‐ tion are ones and the exponent is maximal, at 1023. in the event you try and increment the exponent via multiplying it through , the result's the mistake price Infinity (see “In‐ finity” on web page 107): > quantity. MAX_VALUE 1. 7976931348623157e+308 > quantity. MAX_VALUE * 2 Infinity quantity. MIN_VALUE The smallest representable optimistic quantity (greater than 0, a tiny fraction): > quantity. MIN_VALUE 5e-324 quantity. NaN an analogous worth because the international NaN. quantity. NEGATIVE_INFINITY an identical worth as -Infinity: > quantity. NEGATIVE_INFINITY === -Infinity actual quantity. POSITIVE_INFINITY an analogous price as Infinity: > quantity. POSITIVE_INFINITY === Infinity precise quantity Prototype tools All tools of primitive numbers are kept in quantity. prototype (see “Primitives Borrow Their equipment from Wrappers” on web page 77). 128 | bankruptcy eleven: Numbers Number. prototype. toFixed(fractionDigits? ) quantity. prototype. toFixed(fractionDigits? ) returns an exponent-free representa‐ tion of the quantity, rounded to fractionDigits digits. If the parameter is passed over, the worth zero is used: > zero. 0000003. toFixed(10) '0. 0000003000' > zero. 0000003. toString() '3e-7' If the quantity is bigger than or equivalent to 1021, then this technique works similar to toString().