1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/rt/emul/compacttest/src/test/java/org/apidesign/bck2brwsr/tck/CompareByteArrayTest.java	Wed Nov 19 19:32:00 2014 +0100
     1.3 @@ -0,0 +1,103 @@
     1.4 +/**
     1.5 + * Back 2 Browser Bytecode Translator
     1.6 + * Copyright (C) 2012 Jaroslav Tulach <jaroslav.tulach@apidesign.org>
     1.7 + *
     1.8 + * This program is free software: you can redistribute it and/or modify
     1.9 + * it under the terms of the GNU General Public License as published by
    1.10 + * the Free Software Foundation, version 2 of the License.
    1.11 + *
    1.12 + * This program is distributed in the hope that it will be useful,
    1.13 + * but WITHOUT ANY WARRANTY; without even the implied warranty of
    1.14 + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    1.15 + * GNU General Public License for more details.
    1.16 + *
    1.17 + * You should have received a copy of the GNU General Public License
    1.18 + * along with this program. Look for COPYING file in the top folder.
    1.19 + * If not, see http://opensource.org/licenses/GPL-2.0.
    1.20 + */
    1.21 +package org.apidesign.bck2brwsr.tck;
    1.22 +
    1.23 +import org.apidesign.bck2brwsr.vmtest.Compare;
    1.24 +import org.apidesign.bck2brwsr.vmtest.VMTest;
    1.25 +import org.testng.annotations.Factory;
    1.26 +
    1.27 +/**
    1.28 + *
    1.29 + * @author Jaroslav Tulach <jtulach@netbeans.org>
    1.30 + */
    1.31 +public class CompareByteArrayTest {
    1.32 +    @Compare public int byteArraySum() {
    1.33 +        byte[] arr = createArray();
    1.34 +        return sumByteArr(arr);
    1.35 +    }
    1.36 +    
    1.37 +    @Compare public int countZeros() {
    1.38 +        int zeros = 0;
    1.39 +        for (Byte b : createArray()) {
    1.40 +            if (b == 0) {
    1.41 +                zeros++;
    1.42 +            }
    1.43 +        }
    1.44 +        return zeros;
    1.45 +    }
    1.46 +    
    1.47 +    private static int sumByteArr(byte[] arr) {
    1.48 +        int sum = 0;
    1.49 +        for (int i = 0; i < arr.length; i++) {
    1.50 +            sum += arr[i];
    1.51 +        }
    1.52 +        return sum;
    1.53 +    }
    1.54 +    
    1.55 +    @Compare public String noOutOfBounds() {
    1.56 +        return atIndex(1);
    1.57 +    }
    1.58 +
    1.59 +    @Compare public String outOfBounds() {
    1.60 +        return atIndex(5);
    1.61 +    }
    1.62 +
    1.63 +    @Compare public String outOfBoundsMinus() {
    1.64 +        return atIndex(-1);
    1.65 +    }
    1.66 +
    1.67 +    @Compare public String toOfBounds() {
    1.68 +        return toIndex(5);
    1.69 +    }
    1.70 +
    1.71 +    @Compare public String toOfBoundsMinus() {
    1.72 +        return toIndex(-1);
    1.73 +    }
    1.74 +    
    1.75 +    @Compare public int multiArrayLength() {
    1.76 +         int[][] arr = new int[1][0];
    1.77 +         return arr[0].length;
    1.78 +    }
    1.79 +
    1.80 +    @Compare public int multiObjectArrayLength() {
    1.81 +         Object[][] arr = new Object[1][0];
    1.82 +         return arr[0].length;
    1.83 +    }
    1.84 +
    1.85 +    private static final int[] arr = { 0, 1, 2 };
    1.86 +    public static String atIndex(int at) {
    1.87 +        return "at@" + arr[at];
    1.88 +    }
    1.89 +    public static String toIndex(int at) {
    1.90 +        arr[at] = 10;
    1.91 +        return "ok";
    1.92 +    }
    1.93 +    
    1.94 +    
    1.95 +    @Factory
    1.96 +    public static Object[] create() {
    1.97 +        return VMTest.create(CompareByteArrayTest.class);
    1.98 +    }
    1.99 +
   1.100 +    private byte[] createArray() {
   1.101 +        byte[] arr = new byte[10];
   1.102 +        arr[5] = 3;
   1.103 +        arr[7] = 8;
   1.104 +        return arr;
   1.105 +    }
   1.106 +}