mirror of
https://github.com/tc39/test262.git
synced 2025-10-31 11:44:31 +01:00
35 lines
1.3 KiB
JavaScript
35 lines
1.3 KiB
JavaScript
// Copyright 2009 the Sputnik authors. All rights reserved.
|
|
// This code is governed by the BSD license found in the LICENSE file.
|
|
|
|
/*---
|
|
info: |
|
|
Compute the mathematical integer value
|
|
that is represented by Z in radix-R notation, using the
|
|
letters A-Z and a-z for digits with values 10 through 35.
|
|
Compute the number value for Result(16)
|
|
esid: sec-parseint-string-radix
|
|
description: Complex test. Check algorithm
|
|
---*/
|
|
|
|
//CHECK#
|
|
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(parseInt(str, i), num, 'parseInt("str + R_digit2[k - 2], i) must return the value of num');
|
|
}
|
|
}
|