mirror of https://github.com/tc39/test262.git
85 lines
2.5 KiB
JavaScript
85 lines
2.5 KiB
JavaScript
// Copyright 2009 the Sputnik authors. All rights reserved.
|
|
// This code is governed by the BSD license found in the LICENSE file.
|
|
|
|
/*---
|
|
info: |
|
|
The result of a ECMAScript floating-point remainder operation is
|
|
determined by the rules of IEEE arithmetics
|
|
es5id: 11.5.3_A4_T6
|
|
description: >
|
|
If dividend is a zero and the divisor is nonzero finite, the
|
|
result equals the dividend
|
|
---*/
|
|
|
|
//CHECK#1
|
|
if (0 % 1 !== 0) {
|
|
throw new Test262Error('#1.1: 0 % 1 === 0. Actual: ' + (0 % 1));
|
|
} else {
|
|
if (1 / (0 % 1) !== Number.POSITIVE_INFINITY) {
|
|
throw new Test262Error('#1.2: 0 % 1 === + 0. Actual: -0');
|
|
}
|
|
}
|
|
|
|
//CHECK#2
|
|
if (0 % -1 !== 0) {
|
|
throw new Test262Error('#2.1: 0 % -1 === 0. Actual: ' + (0 % -1));
|
|
} else {
|
|
if (1 / (0 % -1) !== Number.POSITIVE_INFINITY) {
|
|
throw new Test262Error('#2.2: 0 % -1 === + 0. Actual: -0');
|
|
}
|
|
}
|
|
|
|
//CHECK#3
|
|
if (-0 % 1 !== -0) {
|
|
throw new Test262Error('#3.1: -0 % 1 === 0. Actual: ' + (-0 % 1));
|
|
} else {
|
|
if (1 / (-0 % 1) !== Number.NEGATIVE_INFINITY) {
|
|
throw new Test262Error('#3.2: -0 % 1 === - 0. Actual: +0');
|
|
}
|
|
}
|
|
|
|
//CHECK#4
|
|
if (-0 % -1 !== -0) {
|
|
throw new Test262Error('#4.1: -0 % -1 === 0. Actual: ' + (-0 % -1));
|
|
} else {
|
|
if (1 / (-0 % -1) !== Number.NEGATIVE_INFINITY) {
|
|
throw new Test262Error('#4.2: 0 % -1 === - 0. Actual: +0');
|
|
}
|
|
}
|
|
|
|
//CHECK#5
|
|
if (0 % Number.MAX_VALUE !== 0) {
|
|
throw new Test262Error('#5.1: 0 % Number.MAX_VALUE === 0. Actual: ' + (0 % Number.MAX_VALUE));
|
|
} else {
|
|
if (1 / (0 % Number.MAX_VALUE) !== Number.POSITIVE_INFINITY) {
|
|
throw new Test262Error('#5.2: 0 % Number.MAX_VALUE === + 0. Actual: -0');
|
|
}
|
|
}
|
|
|
|
//CHECK#6
|
|
if (0 % Number.MIN_VALUE !== 0) {
|
|
throw new Test262Error('#6.1: 0 % Number.MIN_VALUE === 0. Actual: ' + (0 % Number.MIN_VALUE));
|
|
} else {
|
|
if (1 / (0 % Number.MIN_VALUE) !== Number.POSITIVE_INFINITY) {
|
|
throw new Test262Error('#6.2: 0 % Number.MIN_VALUE === + 0. Actual: -0');
|
|
}
|
|
}
|
|
|
|
//CHECK#7
|
|
if (-0 % Number.MAX_VALUE !== -0) {
|
|
throw new Test262Error('#7.1: -0 % Number.MAX_VALUE === 0. Actual: ' + (-0 % Number.MAX_VALUE));
|
|
} else {
|
|
if (1 / (-0 % Number.MAX_VALUE) !== Number.NEGATIVE_INFINITY) {
|
|
throw new Test262Error('#7.2: -0 % Number.MAX_VALUE === - 0. Actual: +0');
|
|
}
|
|
}
|
|
|
|
//CHECK#8
|
|
if (-0 % Number.MIN_VALUE !== -0) {
|
|
throw new Test262Error('#8.1: -0 % Number.MIN_VALUE === 0. Actual: ' + (-0 % Number.MIN_VALUE));
|
|
} else {
|
|
if (1 / (-0 % Number.MIN_VALUE) !== Number.NEGATIVE_INFINITY) {
|
|
throw new Test262Error('#8.2: 0 % Number.MIN_VALUE === - 0. Actual: +0');
|
|
}
|
|
}
|