mirror of
https://github.com/tc39/test262.git
synced 2025-11-07 15:29:44 +01:00
54 lines
2.0 KiB
JavaScript
54 lines
2.0 KiB
JavaScript
// Copyright (C) 2017 Igalia, S.L. All rights reserved.
|
|
// This code is governed by the BSD license found in the LICENSE file.
|
|
|
|
/*---
|
|
esid: sec-bigint-parseint-string-radix
|
|
description: Mixed-case digits
|
|
info: >
|
|
BigInt.parseInt ( string, radix )
|
|
|
|
The parseInt function produces a BigInt value dictated by
|
|
interpretation of the contents of the string argument according to
|
|
the specified radix.
|
|
|
|
The algorithm is the same as 18.2.5 but with the following edits:
|
|
|
|
* For all cases which result in returning NaN, throw a SyntaxError
|
|
exception.
|
|
* For all cases which result in returning -0, return 0n.
|
|
* Replace the second to last step, which casts mathInt to a Number,
|
|
with casting mathInt to a BigInt.
|
|
|
|
18.2.5 parseInt ( string, radix )
|
|
|
|
The parseInt function produces an integer value dictated by
|
|
interpretation of the contents of the string argument according to the
|
|
specified radix. Leading white space in string is ignored. If radix is
|
|
undefined or 0, it is assumed to be 10 except when the number begins
|
|
with the code unit pairs 0x or 0X, in which case a radix of 16 is
|
|
assumed. If radix is 16, the number may also optionally begin with the
|
|
code unit pairs 0x or 0X.
|
|
features: [BigInt]
|
|
---*/
|
|
|
|
var R_digit1 = ["1", "2", "3", "4", "5", "6", "7", "8", "9", "A", "B", "C", "D", "E", "F", "G", "H", "I", "J", "K", "L", "M", "N", "O", "P", "Q", "R", "S", "T", "U", "V", "W", "X", "Y", "Z"];
|
|
var R_digit2 = ["1", "2", "3", "4", "5", "6", "7", "8", "9", "a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r", "s", "t", "u", "v", "w", "x", "y", "z"];
|
|
for (var i = 2; i <= 36; i++) {
|
|
for (var j = 0; j < 10; j++) {
|
|
var str = "";
|
|
var num = 0;
|
|
var pow = 1;
|
|
var k0 = Math.max(2, i - j);
|
|
for (var k = k0; k <= i; k++) {
|
|
if (k % 2 === 0) {
|
|
str = str + R_digit1[k - 2];
|
|
} else {
|
|
str = str + R_digit2[k - 2];
|
|
}
|
|
num = num + (i + (k0 - k) - 1) * pow;
|
|
pow = pow * i;
|
|
}
|
|
assert.sameValue(BigInt.parseInt(str, i), BigInt(num));
|
|
}
|
|
}
|