mozilla
/
pjs
зеркало из https://github.com/mozilla/pjs.git
1
0
Форкнуть 0
Код Задачи Пакеты Проекты Релизы Вики Активность

bug 361312, fix tamarin tests of case Math.pow(Infinity,-1)=0 and variants, r=wsharp

This commit is contained in:
dschaffe%adobe.com 2006-12-07 14:30:29 +00:00
Родитель 45c4dc9b46
Коммит c40d701178
1 изменённых файлов: 5 добавлений и 5 удалений
Показать статистику Скачать Patch файл Скачать Diff файл Показать все файлы Свернуть все файлы

10
js/tamarin/test/ecma3/Math/e15_8_2_13.as
Просмотреть файл

@ -80,7 +80,7 @@ function getTestCases() {
array[item++] = new TestCase( SECTION, "Math.pow(Infinity, .00000000001)", Number.POSITIVE_INFINITY, Math.pow(Number.POSITIVE_INFINITY,.00000000001) );
array[item++] = new TestCase( SECTION, "Math.pow(Infinity, 1)", Number.POSITIVE_INFINITY, Math.pow(Number.POSITIVE_INFINITY, 1) );
array[item++] = new TestCase( SECTION, "Math.pow(Infinity, -.00000000001)",0, Math.pow(Number.POSITIVE_INFINITY, -.00000000001) );
array[item++] = new TestCase( SECTION, "Math.pow(Infinity, -1)", Number.NaN, Math.pow(Number.POSITIVE_INFINITY, -1) );
array[item++] = new TestCase( SECTION, "Math.pow(Infinity, -1)", 0, Math.pow(Number.POSITIVE_INFINITY, -1) );
array[item++] = new TestCase( SECTION, "Math.pow(-Infinity, 1)", Number.NEGATIVE_INFINITY, Math.pow(Number.NEGATIVE_INFINITY, 1) );
array[item++] = new TestCase( SECTION, "Math.pow(-Infinity, 333)", Number.NEGATIVE_INFINITY, Math.pow(Number.NEGATIVE_INFINITY, 333) );
array[item++] = new TestCase( SECTION, "Math.pow(Infinity, 2)", Number.POSITIVE_INFINITY, Math.pow(Number.POSITIVE_INFINITY, 2) );
@ -88,11 +88,11 @@ function getTestCases() {
array[item++] = new TestCase( SECTION, "Math.pow(-Infinity, 0.5)", Number.POSITIVE_INFINITY, Math.pow(Number.NEGATIVE_INFINITY, 0.5) );
array[item++] = new TestCase( SECTION, "Math.pow(-Infinity, Infinity)", Number.POSITIVE_INFINITY, Math.pow(Number.NEGATIVE_INFINITY, Number.POSITIVE_INFINITY) );
array[item++] = new TestCase( SECTION, "Math.pow(-Infinity, -1)", Number.NaN, Math.pow(Number.NEGATIVE_INFINITY, -1) );
array[item++] = new TestCase( SECTION, "Infinity/Math.pow(-Infinity, -1)", Number.NaN, Infinity/Math.pow(Number.NEGATIVE_INFINITY, -1) );
array[item++] = new TestCase( SECTION, "Math.pow(-Infinity, -1)", 0, Math.pow(Number.NEGATIVE_INFINITY, -1) );
array[item++] = new TestCase( SECTION, "Infinity/Math.pow(-Infinity, -1)", Number.NEGATIVE_INFINITY, Infinity/Math.pow(Number.NEGATIVE_INFINITY, -1) );
array[item++] = new TestCase( SECTION, "Math.pow(-Infinity, -3)", Number.NaN, Math.pow(Number.NEGATIVE_INFINITY, -3) );
array[item++] = new TestCase( SECTION, "Math.pow(-Infinity, -2)", Number.NaN, Math.pow(Number.NEGATIVE_INFINITY, -2) );
array[item++] = new TestCase( SECTION, "Math.pow(-Infinity, -3)", 0, Math.pow(Number.NEGATIVE_INFINITY, -3) );
array[item++] = new TestCase( SECTION, "Math.pow(-Infinity, -2)", 0, Math.pow(Number.NEGATIVE_INFINITY, -2) );
array[item++] = new TestCase( SECTION, "Math.pow(-Infinity, -0.5)", 0, Math.pow(Number.NEGATIVE_INFINITY,-0.5) );
array[item++] = new TestCase( SECTION, "Math.pow(-Infinity, -Infinity)", 0, Math.pow(Number.NEGATIVE_INFINITY, Number.NEGATIVE_INFINITY) );
array[item++] = new TestCase( SECTION, "Math.pow(0, 1)", 0, Math.pow(0,1) );