Home | History | Annotate | Download | only in mjsunit
      1 // Copyright 2010 the V8 project authors. All rights reserved.
      2 // Redistribution and use in source and binary forms, with or without
      3 // modification, are permitted provided that the following conditions are
      4 // met:
      5 //
      6 //     * Redistributions of source code must retain the above copyright
      7 //       notice, this list of conditions and the following disclaimer.
      8 //     * Redistributions in binary form must reproduce the above
      9 //       copyright notice, this list of conditions and the following
     10 //       disclaimer in the documentation and/or other materials provided
     11 //       with the distribution.
     12 //     * Neither the name of Google Inc. nor the names of its
     13 //       contributors may be used to endorse or promote products derived
     14 //       from this software without specific prior written permission.
     15 //
     16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
     17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
     18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
     19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
     20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
     21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
     22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
     23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
     24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
     25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
     26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
     27 
     28 function foo() {
     29   for (var i = 1; i < 100; i++) {
     30     var answer = 1;
     31     for (var j = 1; j < 100; j++) {
     32       if (answer == i) answer = 0;
     33       // Positive case.
     34       print(j + " % " + i + " = " + answer);
     35       m = j % i;
     36       assertEquals(answer, m, j + " % " + i);
     37       m = j % (-i);
     38       assertEquals(answer, m, j + " % -" + i);
     39       // Negative case.
     40       m = (-j) % i;
     41       assertEquals(-answer, m, j + " % " + i);
     42       // Check for negative zero.
     43       if (answer == 0) assertEquals(-Infinity, 1/m);
     44       m = (-j) % (-i);
     45       assertEquals(-answer, m, j + " % -" + i);
     46       // Check for negative zero.
     47       if (answer == 0) assertEquals(-Infinity, 1/m);
     48       answer++;
     49     }
     50   }
     51 }
     52 
     53 foo();
     54