vmtest/src/test/java/org/apidesign/bck2brwsr/tck/IntegerArithmeticTest.java
author Jaroslav Tulach <jaroslav.tulach@apidesign.org>
Tue, 15 Jan 2013 12:26:19 +0100
changeset 457 b0e82dcf51fb
parent 454 6506c5925775
child 700 b9bf26ea0118
permissions -rw-r--r--
Initialize multi dimensional arrays with 0 for primitive types
     1 /**
     2  * Back 2 Browser Bytecode Translator
     3  * Copyright (C) 2012 Jaroslav Tulach <jaroslav.tulach@apidesign.org>
     4  *
     5  * This program is free software: you can redistribute it and/or modify
     6  * it under the terms of the GNU General Public License as published by
     7  * the Free Software Foundation, version 2 of the License.
     8  *
     9  * This program is distributed in the hope that it will be useful,
    10  * but WITHOUT ANY WARRANTY; without even the implied warranty of
    11  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    12  * GNU General Public License for more details.
    13  *
    14  * You should have received a copy of the GNU General Public License
    15  * along with this program. Look for COPYING file in the top folder.
    16  * If not, see http://opensource.org/licenses/GPL-2.0.
    17  */
    18 package org.apidesign.bck2brwsr.tck;
    19 
    20 import org.apidesign.bck2brwsr.vmtest.Compare;
    21 import org.apidesign.bck2brwsr.vmtest.VMTest;
    22 import org.testng.annotations.Factory;
    23 
    24 /**
    25  *
    26  * @author Jaroslav Tulach <jtulach@netbeans.org>
    27  */
    28 public class IntegerArithmeticTest {
    29     
    30     private static int add(int x, int y) {
    31         return x + y;
    32     }
    33     
    34     private static int sub(int x, int y) {
    35         return x - y;
    36     }
    37     
    38     private static int mul(int x, int y) {
    39         return x * y;
    40     }
    41     
    42     private static int div(int x, int y) {
    43         return x / y;
    44     }
    45     
    46     private static int mod(int x, int y) {
    47         return x % y;
    48     }
    49     
    50     @Compare public int addOverflow() {
    51         return add(Integer.MAX_VALUE, 1);
    52     }
    53     
    54     @Compare public int subUnderflow() {
    55         return sub(Integer.MIN_VALUE, 1);
    56     }
    57     
    58     @Compare public int addMaxIntAndMaxInt() {
    59         return add(Integer.MAX_VALUE, Integer.MAX_VALUE);
    60     }
    61     
    62     @Compare public int subMinIntAndMinInt() {
    63         return sub(Integer.MIN_VALUE, Integer.MIN_VALUE);
    64     }
    65     
    66     @Compare public int multiplyMaxInt() {
    67         return mul(Integer.MAX_VALUE, 2);
    68     }
    69     
    70     @Compare public int multiplyMaxIntAndMaxInt() {
    71         return mul(Integer.MAX_VALUE, Integer.MAX_VALUE);
    72     }
    73     
    74     @Compare public int multiplyMinInt() {
    75         return mul(Integer.MIN_VALUE, 2);
    76     }
    77     
    78     @Compare public int multiplyMinIntAndMinInt() {
    79         return mul(Integer.MIN_VALUE, Integer.MIN_VALUE);
    80     }
    81     
    82     @Compare public int multiplyPrecision() {
    83         return mul(119106029, 1103515245);
    84     }
    85     
    86     @Compare public int division() {
    87         return div(1, 2);
    88     }
    89     
    90     @Compare public int divisionReminder() {
    91         return mod(1, 2);
    92     }
    93     
    94     @Compare public int sumTwoDimensions() {
    95         int[][] matrix = createMatrix(4, 3);
    96         matrix[0][0] += 10;
    97         return matrix[0][0];
    98     }
    99     
   100     static int[][] createMatrix(int x, int y) {
   101         return new int[x][y];
   102     }
   103     
   104     @Factory
   105     public static Object[] create() {
   106         return VMTest.create(IntegerArithmeticTest.class);
   107     }
   108 }