ECMA-262 (12th Edition) ECMAScript 2021 Language Specification - page 12

Number values, but such behaviour is

values as specified in the IEEE Standard for Binary Floating-Point Arithmetic,

except that the 9,007,199,254,740,990 (that is, 2

- 2) distinct “Not-a-Number” values of the IEEE Standard are

represented in ECMAScript as a single special

NaN

value. (Note that the

NaN

value is produced by the program

expression

NaN

.) In some implementations, external code might be able to detect a difference between various Not-a-

implementation-defined

; to ECMAScript code, all

NaN

values are

indistinguishable from each other.

NOTE

There are two other special values, called

positive Infinity

and

negative Infinity

. For brevity, these values are also

referred to for expository purposes by the symbols

∞

𝔽

and

∞

𝔽

, respectively. (Note that these two infinite Number

values are produced by the program expressions

+Infinity

(or simply

Infinity

) and

-Infinity

The first and subsequent editions of ECMAScript have provided, for certain operators, implicit
numeric conversions that could lose precision or truncate. These legacy implicit conversions are
maintained for backward compatibility, but not provided for BigInt in order to minimize
opportunity for programmer error, and to leave open the option of generalized

value types

in a

future edition.

The bit pattern that might be observed in an ArrayBuffer (see

25.1

) or a SharedArrayBuffer (see

25.2

) after a

has been stored into it is not necessarily the same as the internal

representation of that

used by the ECMAScript implementation.

6.1.6.1 The Number Type

The other 18,437,736,874,454,810,624 (that is, 2

- 2

) values are called the finite numbers. Half of these are positive

numbers and half are negative numbers; for every finite positive

there is a corresponding negative

value having the same magnitude.

Note that there is both a

positive zero

and a

negative zero

. For brevity, these values are also referred to for expository

purposes by the symbols

𝔽

and

-0

𝔽

, respectively. (Note that these two different zero Number values are produced by

the program expressions

(or simply

) and

-0

The 18,437,736,874,454,810,622 (that is, 2

- 2

- 2) finite non-zero values are of two kinds:

18,428,729,675,200,069,632 (that is, 2

- 2

) of them are normalized, having the form

where

is 1 or -1,

is an

such that 2

≤

< 2

, and

is an

such that -1074

≤

971.

The remaining 9,007,199,254,740,990 (that is, 2

- 2) values are denormalized, having the form

where

is 1 or -1,

is an

such that 0 <

< 2

, and

is -1074.

Note that all the positive and negative integers whose magnitude is no greater than 2

are representable in the

Number type. The

0 has two representations in the Number type:

𝔽

and

-0

𝔽

A finite number has an

odd significand

if it is non-zero and the

used to express it (in one of the two forms

shown above) is odd. Otherwise, it has an

even significand

In this specification, the phrase “the

Number value

for

” where

represents an exact real mathematical quantity

(which might even be an irrational number such as

) means a

< 0; any other chosen value is used unchanged. The result is the

chosen in the following manner.

Consider the set of all finite values of the Number type, with

-0

𝔽

removed and with two additional values added to it

that are not representable in the Number type, namely 2

1024

(which is +1

971

) and -2

1024

(which is -1

971

). Choose the member of this set that is closest in value to

. If two values of the set are equally close, then the one

with an even significand is chosen; for this purpose, the two extra values 2

1024

and -2

1024

are considered to have even

significands. Finally, if 2

1024

was chosen, replace it with

∞

𝔽

; if -2

1024

was chosen, replace it with

∞

𝔽

; if

𝔽

was

chosen, replace it with

-0

𝔽

if and only if

Number

value

for

. (This procedure corresponds exactly to the behaviour of the

roundTiesToEven mode.)

The

for +

∞

𝔽

, and the

for -

∞

𝔽

Some ECMAScript operators deal only with integers in specific ranges such as -2

through 2

- 1, inclusive, or in the

range 0 through 2

- 1, inclusive. These operators accept any value of the Number type but first convert each such

value to an

value in the expected range. See the descriptions of the numeric conversion operations in

7.1

The Number::unit value is

𝔽

The abstract operation Number::unaryMinus takes argument

(a Number). It performs the following steps when

called:

6.1.6.1.1 Number::unaryMinus (

)

1. If

NaN

, return

NaN

2. Return the result of negating

; that is, compute a Number with the same magnitude but opposite sign.

The abstract operation Number::bitwiseNOT takes argument

(a Number). It performs the following steps when

called:

1. Let

oldValue

be !

2. Return the result of applying bitwise complement to

oldValue

. The

implementation-approximated

of the result is exactly

representable as a 32-bit two's complement bit string.

The abstract operation Number::exponentiate takes arguments

base

(a Number) and

exponent

(a Number). It returns an

value representing the result of raising

base

to the

exponent

power. It performs the

following steps when called:

1. If

exponent

NaN

, return

NaN

2. If

exponent

𝔽

exponent

-0

𝔽

, return

𝔽

3. If

base

NaN

, return

NaN

4. If

base

∞

𝔽

, then

a. If

exponent

𝔽

, return

∞

𝔽

. Otherwise, return

𝔽

5. If

base

∞

𝔽

, then

a. If

exponent

𝔽

, then

i. If

exponent

is an odd

, return

∞

𝔽

. Otherwise, return

∞

𝔽

b. Else,

i. If

exponent

is an odd

, return

-0

𝔽

. Otherwise, return

𝔽

6. If

base

𝔽

, then

a. If

exponent

𝔽

, return

𝔽

. Otherwise, return

∞

𝔽

7. If

base

-0

𝔽

, then

a. If

exponent

𝔽

, then

i. If

exponent

is an odd

, return

-0

𝔽

. Otherwise, return

𝔽

b. Else,

i. If

exponent

is an odd

, return

∞

𝔽

. Otherwise, return

∞

𝔽

base

is finite and is neither

𝔽

nor

-0

𝔽

9. If

exponent

∞

𝔽

, then

a. If

(

base

)) > 1, return

∞

𝔽

b. If

(

base

)) is 1, return

NaN

c. If

(

base

)) < 1, return

𝔽

10. If

exponent

∞

𝔽

, then

a. If

(

base

)) > 1, return

𝔽

b. If

(

base

)) is 1, return

NaN

c. If

(

base

)) < 1, return

∞

𝔽

11.

exponent

is finite and is neither

𝔽

nor

-0

𝔽

12. If

base

𝔽

and

exponent

is not an

implementation-approximated

, return

NaN

13. Return an

value representing the result of raising

base

) to the

exponent

)

6.1.6.1.2 Number::bitwiseNOT (

)

6.1.6.1.3 Number::exponentiate (

base

exponent

)

power.

NOTE

The abstract operation Number::multiply takes arguments

(a Number) and

(a Number). It performs multiplication

according to the rules of

binary double-precision arithmetic, producing the product of

and

. It

performs the following steps when called:

1. If

NaN

, return

NaN

2. If

∞

𝔽

∞

𝔽

, then

a. If

𝔽

-0

𝔽

, return

NaN

b. If

𝔽

, return

c. Return -

3. If

∞

𝔽

∞

𝔽

, then

a. If

𝔽

-0

𝔽

, return

NaN

b. If

𝔽

, return

c. Return -

4. Return

(

)

(

)).

NOTE

The abstract operation Number::divide takes arguments

(a Number) and

(a Number). It performs division

according to the rules of

binary double-precision arithmetic, producing the quotient of

and

where

is the dividend and

is the divisor. It performs the following steps when called:

1. If

NaN

, return

NaN

2. If

∞

𝔽

∞

𝔽

, then

a. If

∞

𝔽

∞

𝔽

, return

NaN

b. If

𝔽

, return

c. Return -

3. If

∞

𝔽

, then

a. If

𝔽

, return

𝔽

. Otherwise, return

-0

𝔽

4. If

∞

𝔽

, then

a. If

𝔽

, return

-0

𝔽

. Otherwise, return

𝔽

5. If

𝔽

-0

𝔽

, then

a. If

𝔽

-0

𝔽

, return

NaN

b. If

𝔽

, return

c. Return -

6. If

𝔽

, then

The result of

base

exponent

when

base

𝔽

-1

𝔽

and

exponent

∞

𝔽

∞

𝔽

, or when

base

𝔽

and

exponent

NaN

, differs from

. The first edition of ECMAScript specified a

result of

NaN

for this operation, whereas later versions of

specified

𝔽

. The

historical ECMAScript behaviour is preserved for compatibility reasons.

Finite-precision multiplication is commutative, but not always associative.

6.1.6.1.4 Number::multiply (

)

6.1.6.1.5 Number::divide (

)

a. If

𝔽

, return

∞

𝔽

. Otherwise, return

∞

𝔽

7. If

-0

𝔽

, then

a. If

𝔽

, return

∞

𝔽

. Otherwise, return

∞

𝔽

8. Return

(

) /

(

)).

The abstract operation Number::remainder takes arguments

(a Number) and

(a Number). It yields the remainder

from an implied division of its operands where

is the dividend and

is the divisor. It performs the following steps

when called:

1. If

NaN

, return

NaN

2. If

∞

𝔽

∞

𝔽

, return

NaN

3. If

∞

𝔽

∞

𝔽

, return

4. If

𝔽

-0

𝔽

, return

NaN

5. If

𝔽

-0

𝔽

, return

and

are finite and non-zero.

7. Let

(

) - (

(

)

) where

is an

that is negative if and only if

and

have opposite sign, and

) /

(

8. Return

NOTE 1

NOTE 2

The abstract operation Number::add takes arguments

(a Number) and

(a Number). It performs addition according

to the rules of

binary double-precision arithmetic, producing the sum of its arguments. It performs the

following steps when called:

1. If

NaN

, return

NaN

2. If

∞

𝔽

and

∞

𝔽

, return

NaN

3. If

∞

𝔽

and

∞

𝔽

, return

NaN

4. If

∞

𝔽

∞

𝔽

, return

5. If

∞

𝔽

∞

𝔽

, return

and

are both finite.

7. If

-0

𝔽

and

-0

𝔽

, return

-0

𝔽

8. Return

(

) +

(

)).

In C and C++, the remainder operator accepts only integral operands; in ECMAScript, it also
accepts floating-point operands.

The result of a floating-point remainder operation as computed by the

operator is not the same

as the “remainder” operation defined by

. The

“remainder”

operation computes the remainder from a rounding division, not a truncating division, and so its
behaviour is not analogous to that of the usual integer remainder operator. Instead the
ECMAScript language defines

on floating-point operations to behave in a manner analogous to

that of the Java integer remainder operator; this may be compared with the C library function
fmod.

6.1.6.1.6 Number::remainder (

)

6.1.6.1.7 Number::add (

)

NOTE

The abstract operation Number::subtract takes arguments

(a Number) and

(a Number). It performs subtraction,

producing the difference of its operands;

is the minuend and

is the subtrahend. It performs the following steps

when called:

1. Return Number::add(

, Number::unaryMinus(

)).

NOTE

The abstract operation Number::leftShift takes arguments

(a Number) and

(a Number). It performs the following

steps when called:

1. Let

lnum

be !

2. Let

rnum

be !

3. Let

shiftCount

rnum

)

32.

4. Return the result of left shifting

lnum

shiftCount

bits. The

of the result is exactly

representable as a 32-bit two's complement bit string.

The abstract operation Number::signedRightShift takes arguments

(a Number) and

(a Number). It performs the

following steps when called:

1. Let

lnum

be !

2. Let

rnum

be !

3. Let

shiftCount

rnum

)

32.

4. Return the result of performing a sign-extending right shift of

lnum

shiftCount

bits. The most significant bit

is propagated. The

of the result is exactly representable as a 32-bit two's complement bit

string.

The abstract operation Number::unsignedRightShift takes arguments

(a Number) and

(a Number). It performs the

following steps when called:

1. Let

lnum

be !

(

2. Let

rnum

be !

3. Let

shiftCount

rnum

)

32.

4. Return the result of performing a zero-filling right shift of

lnum

shiftCount

bits. Vacated bits are filled with

zero. The

of the result is exactly representable as a 32-bit unsigned bit string.

The abstract operation Number::lessThan takes arguments

(a Number) and

(a Number). It performs the following

Finite-precision addition is commutative, but not always associative.

It is always the case that

x - y

produces the same result as

x + (-y)

6.1.6.1.8 Number::subtract (

)

6.1.6.1.9 Number::leftShift (

)

6.1.6.1.10 Number::signedRightShift (

)

6.1.6.1.11 Number::unsignedRightShift (

)

6.1.6.1.12 Number::lessThan (

)

steps when called:

1. If

NaN

, return

undefined

2. If

NaN

, return

undefined

3. If

and

are the same

, return

false

4. If

𝔽

and

-0

𝔽

, return

false

5. If

-0

𝔽

and

𝔽

, return

false

6. If

∞

𝔽

, return

false

7. If

∞

𝔽

, return

true

8. If

∞

𝔽

, return

false

9. If

∞

𝔽

, return

true

10.

and

are finite and non-zero.

), return

true

. Otherwise, return

false

The abstract operation Number::equal takes arguments

(a Number) and

(a Number). It performs the following

steps when called:

1. If

NaN

, return

false

2. If

NaN

, return

false

3. If

is the same

, return

true

4. If

𝔽

and

-0

𝔽

, return

true

5. If

-0

𝔽

and

𝔽

, return

true

6. Return

false

The abstract operation Number::sameValue takes arguments

(a Number) and

(a Number). It performs the

following steps when called:

1. If

NaN

and

NaN

, return

true

2. If

𝔽

and

-0

𝔽

, return

false

3. If

-0

𝔽

and

𝔽

, return

false

4. If

is the same

, return

true

5. Return

false

The abstract operation Number::sameValueZero takes arguments

(a Number) and

(a Number). It performs the

following steps when called:

1. If

NaN

and

NaN

, return

true

2. If

𝔽

and

-0

𝔽

, return

true

3. If

-0

𝔽

and

𝔽

, return

true

4. If

is the same

, return

true

5. Return

false

6.1.6.1.13 Number::equal (

)

6.1.6.1.14 Number::sameValue (

)

6.1.6.1.15 Number::sameValueZero (

)

6.1.6.1.16 NumberBitwiseOp (

)

The abstract operation NumberBitwiseOp takes arguments

(a sequence of Unicode code points),

, and

. It

performs the following steps when called:

, or

2. Let

lnum

be !

3. Let

rnum

be !

(

4. Let

lbits

be the 32-bit two's complement bit string representing

lnum

5. Let

rbits

rnum

6. If

, let

result

be the result of applying the bitwise AND operation to

lbits

and

rbits

7. Else if

, let

result

be the result of applying the bitwise exclusive OR (XOR) operation to

lbits

and

rbits

8. Else,

. Let

result

be the result of applying the bitwise inclusive OR operation to

lbits

and

rbits

9. Return the

for the

represented by the 32-bit two's complement bit string

result

The abstract operation Number::bitwiseAND takes arguments

(a Number) and

(a Number). It performs the

following steps when called:

1. Return

NumberBitwiseOp

(

The abstract operation Number::bitwiseXOR takes arguments

(a Number) and

(a Number). It performs the

following steps when called:

1. Return

NumberBitwiseOp

(

The abstract operation Number::bitwiseOR takes arguments

(a Number) and

(a Number). It performs the

following steps when called:

1. Return

NumberBitwiseOp

(

The abstract operation Number::toString takes argument

(a Number). It converts

to String format. It performs the

following steps when called:

1. If

NaN

, return the String

"NaN"

2. If

𝔽

-0

𝔽

, return the String

"0"

3. If

𝔽

, return the

"-"

and !

Number::toString

4. If

∞

𝔽

, return the String

"Infinity"

5. Otherwise, let

, and

be integers such that

≥

1, 10

- 1

≤

< 10

(

), and

is as small as

possible. Note that

is the number of digits in the decimal representation of

, that

is not divisible by 10, and

that the least significant digit of

is not necessarily uniquely determined by these criteria.

6. If

≤

21, return the

of:

the code units of the

digits of the decimal representation of

(in order, with no leading zeroes)

occurrences of the code unit 0x0030 (DIGIT ZERO)

7. If 0 <

≤

21, return the

of:

6.1.6.1.17 Number::bitwiseAND (

)

6.1.6.1.18 Number::bitwiseXOR (

)

6.1.6.1.19 Number::bitwiseOR (

)

6.1.6.1.20 Number::toString (

)

the code units of the most significant

digits of the decimal representation of

the code unit 0x002E (FULL STOP)
the code units of the remaining

digits of the decimal representation of

8. If -6 <

≤

0, return the

of:

the code unit 0x0030 (DIGIT ZERO)
the code unit 0x002E (FULL STOP)
-

occurrences of the code unit 0x0030 (DIGIT ZERO)

the code units of the

digits of the decimal representation of

9. Otherwise, if

= 1, return the

of:

the code unit of the single digit of

the code unit 0x0065 (LATIN SMALL LETTER E)
the code unit 0x002B (PLUS SIGN) or the code unit 0x002D (HYPHEN-MINUS) according to whether

1 is positive or negative
the code units of the decimal representation of the

- 1) (with no leading zeroes)

10. Return the

of:

the code units of the most significant digit of the decimal representation of

the code unit 0x002E (FULL STOP)
the code units of the remaining

- 1 digits of the decimal representation of

the code unit 0x0065 (LATIN SMALL LETTER E)
the code unit 0x002B (PLUS SIGN) or the code unit 0x002D (HYPHEN-MINUS) according to whether

1 is positive or negative
the code units of the decimal representation of the

- 1) (with no leading zeroes)

NOTE 1

NOTE 2

The following observations may be useful as guidelines for implementations, but are not part of
the normative requirements of this Standard:

If x is any

other than

-0

𝔽

, then

ToNumber

ToString

(x)) is exactly the same

as x.

The least significant digit of s is not always uniquely determined by the requirements
listed in step

For implementations that provide more accurate conversions than required by the rules above, it
is recommended that the following alternative version of step

be used as a guideline:

5. Otherwise, let

, and

be integers such that

≥

1, 10

- 1

≤

< 10

(

), and

is as small as possible. If there are multiple possibilities for

, choose the value of

for

which

). If there are two such possible values of

, choose

the one that is even. Note that

is the number of digits in the decimal representation of

and that

is not divisible by 10.

NOTE 3

The BigInt type represents an

value. The value may be any size and is not limited to a particular bit-width.

Generally, where not otherwise noted, operations are designed to return exact mathematically-based answers. For
binary operations, BigInts act as two's complement binary strings, with negative numbers treated as having bits set
infinitely to the left.

The BigInt::unit value is

ℤ

The abstract operation BigInt::unaryMinus takes argument

(a BigInt). It performs the following steps when called:

1. If

ℤ

, return

ℤ

The abstract operation BigInt::bitwiseNOT takes argument

(a BigInt). It returns the one's complement of

; that is, -

ℤ

The abstract operation BigInt::exponentiate takes arguments

base

(a BigInt) and

exponent

(a BigInt). It performs the

following steps when called:

1. If

exponent

ℤ

, throw a

RangeError

exception.

2. If

base

ℤ

and

exponent

ℤ

, return

ℤ

3. Return the BigInt value that represents

(

base

exponent

The abstract operation BigInt::multiply takes arguments

(a BigInt) and

(a BigInt). It returns the BigInt value that

represents the result of multiplying

and

NOTE

Implementers of ECMAScript may find useful the paper and code written by David M. Gay for
binary-to-decimal conversion of floating-point numbers:

Gay, David M. Correctly Rounded Binary-Decimal and Decimal-Binary Conversions. Numerical
Analysis, Manuscript 90-10. AT&T Bell Laboratories (Murray Hill, New Jersey). 30 November
1990. Available as

http://ampl.com/REFS/abstracts.html#rounding

. Associated code available as

http://netlib.sandia.gov/fp/dtoa.c

and as

http://netlib.sandia.gov/fp/g_fmt.c

and may also be found at the various

netlib

mirror sites.

Even if the result has a much larger bit width than the input, the exact mathematical answer is
given.

6.1.6.2 The BigInt Type

6.1.6.2.1 BigInt::unaryMinus (

)

6.1.6.2.2 BigInt::bitwiseNOT (

)

6.1.6.2.3 BigInt::exponentiate (

base

exponent

)

6.1.6.2.4 BigInt::multiply (

)

The abstract operation BigInt::divide takes arguments

(a BigInt) and

(a BigInt). It performs the following steps

when called:

1. If

ℤ

, throw a

RangeError

exception.

2. Let

quotient

(

3. Return the BigInt value that represents

quotient

rounded towards 0 to the next

value.

The abstract operation BigInt::remainder takes arguments

(a BigInt) and

(a BigInt). It performs the following steps

when called:

1. If

ℤ

, throw a

RangeError

exception.

2. If

ℤ

, return

ℤ

3. Let

be the BigInt defined by the mathematical relation

- (

) where

is a BigInt that is negative only if

is negative and positive only if

is positive, and whose magnitude is as large as possible without

exceeding the magnitude of the true mathematical quotient of

and

4. Return

NOTE

The abstract operation BigInt::add takes arguments

(a BigInt) and

(a BigInt). It returns the BigInt value that

represents the sum of

and

The abstract operation BigInt::subtract takes arguments

(a BigInt) and

(a BigInt). It returns the BigInt value that

represents the difference

minus

The abstract operation BigInt::leftShift takes arguments

(a BigInt) and

(a BigInt). It performs the following steps

when called:

1. If

ℤ

, then

a. Return the BigInt value that represents

(

) / 2

, rounding down to the nearest

, including for

negative numbers.

2. Return the BigInt value that represents

(

)

NOTE

The abstract operation BigInt::signedRightShift takes arguments

(a BigInt) and

(a BigInt). It performs the following

The sign of the result equals the sign of the dividend.

Semantics here should be equivalent to a bitwise shift, treating the BigInt as an infinite length
string of binary two's complement digits.

6.1.6.2.5 BigInt::divide (

)

6.1.6.2.6 BigInt::remainder (

)

6.1.6.2.7 BigInt::add (

)

6.1.6.2.8 BigInt::subtract (

)

6.1.6.2.9 BigInt::leftShift (

)

6.1.6.2.10 BigInt::signedRightShift (

)

steps when called:

1. Return BigInt::leftShift(

, -

The abstract operation BigInt::unsignedRightShift takes arguments

(a BigInt) and

(a BigInt). It performs the

following steps when called:

1. Throw a

TypeError

exception.

The abstract operation BigInt::lessThan takes arguments

(a BigInt) and

(a BigInt). It returns

true

(

) and

false

otherwise.

The abstract operation BigInt::equal takes arguments

(a BigInt) and

(a BigInt). It returns

true

) and

false

otherwise.

The abstract operation BigInt::sameValue takes arguments

(a BigInt) and

(a BigInt). It performs the following steps

when called:

1. Return BigInt::equal(

The abstract operation BigInt::sameValueZero takes arguments

(a BigInt) and

(a BigInt). It performs the following

steps when called:

1. Return BigInt::equal(

The abstract operation BinaryAnd takes arguments

and

. It performs the following steps when called:

is 0 or 1.

is 0 or 1.

3. If

is 1 and

is 1, return 1.

4. Else, return 0.

The abstract operation BinaryOr takes arguments

and

. It performs the following steps when called:

is 0 or 1.

is 0 or 1.

3. If

is 1 or

is 1, return 1.

4. Else, return 0.

6.1.6.2.11 BigInt::unsignedRightShift (

)

6.1.6.2.12 BigInt::lessThan (

)

6.1.6.2.13 BigInt::equal (

)

6.1.6.2.14 BigInt::sameValue (

)

6.1.6.2.15 BigInt::sameValueZero (

)

6.1.6.2.16 BinaryAnd (

)

6.1.6.2.17 BinaryOr (

)

The abstract operation BinaryXor takes arguments

and

. It performs the following steps when called:

is 0 or 1.

is 0 or 1.

3. If

is 1 and

is 0, return 1.

4. Else if

is 0 and

is 1, return 1.

5. Else, return 0.

The abstract operation BigIntBitwiseOp takes arguments

(a sequence of Unicode code points),

(a BigInt), and

BigInt). It performs the following steps when called:

, or

2. Set

(

3. Set

(

4. Let

result

be 0.

5. Let

shift

be 0.

6. Repeat, until (

= 0 or

= -1) and (

= 0 or

= -1),

a. Let

xDigit

b. Let

yDigit

c. If

, set

result

+ 2

shift

BinaryAnd

(

xDigit

yDigit

d. Else if

, set

result

+ 2

shift

BinaryOr

(

xDigit

yDigit

e. Else,

ii. Set

result

+ 2

shift

BinaryXor

xDigit

yDigit

f. Set

shift

+ 1.

g. Set

to (

xDigit

) / 2.

h. Set

to (

yDigit

) / 2.

7. If

, let

tmp

8. Else if

, let

tmp

9. Else,

b. Let

tmp

10. If

tmp

≠

0, then

a. Set

result

- 2

shift

b. NOTE: This extends the sign.

11. Return the BigInt value for

result

The abstract operation BigInt::bitwiseAND takes arguments

(a BigInt) and

(a BigInt). It performs the following

steps when called:

1. Return

BigIntBitwiseOp

(

6.1.6.2.18 BinaryXor (

)

6.1.6.2.19 BigIntBitwiseOp (

)

6.1.6.2.20 BigInt::bitwiseAND (

)

6.1.6.2.21 BigInt::bitwiseXOR (

)

The abstract operation BigInt::bitwiseXOR takes arguments

(a BigInt) and

(a BigInt). It performs the following

steps when called:

1. Return

BigIntBitwiseOp

(

The abstract operation BigInt::bitwiseOR takes arguments

(a BigInt) and

(a BigInt). It performs the following steps

when called:

1. Return

BigIntBitwiseOp

(

The abstract operation BigInt::toString takes argument

(a BigInt). It converts

to String format. It performs the

following steps when called:

1. If

ℤ

, return the

ECMAScript language value

of the String

"-"

and !

BigInt::toString

2. Return the String value consisting of the code units of the digits of the decimal representation of

An Object is logically a collection of properties. Each property is either a data property, or an accessor property:

data property

associates a key value with an

and a set of Boolean attributes.

accessor property

associates a key value with one or two accessor functions, and a set of Boolean attributes.

The accessor functions are used to store or retrieve an

ECMAScript language value

that is associated with the

property.

Properties are identified using key values. A property key value is either an ECMAScript String value or a Symbol
value. All String and Symbol values, including the empty String, are valid as property keys. A

property name

is a

property key that is a String value.

integer index

is a String-valued property key that is a canonical numeric String (see

7.1.21

) and whose numeric

value is either

𝔽

or a positive