1.1 --- a/rt/vmtest/src/test/java/org/apidesign/bck2brwsr/tck/CompareIntArrayTest.java Wed Feb 27 17:50:47 2013 +0100
1.2 +++ /dev/null Thu Jan 01 00:00:00 1970 +0000
1.3 @@ -1,63 +0,0 @@
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 CompareIntArrayTest {
1.32 - @Compare public int integerArraySum() {
1.33 - int[] arr = createArray();
1.34 - return sumIntArr(arr);
1.35 - }
1.36 -
1.37 - @Compare public int countZeros() {
1.38 - int zeros = 0;
1.39 - for (Integer i : createArray()) {
1.40 - if (i == 0) {
1.41 - zeros++;
1.42 - }
1.43 - }
1.44 - return zeros;
1.45 - }
1.46 -
1.47 - private static int sumIntArr(int[] 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 - @Factory
1.56 - public static Object[] create() {
1.57 - return VMTest.create(CompareIntArrayTest.class);
1.58 - }
1.59 -
1.60 - private int[] createArray() {
1.61 - int[] arr = new int[10];
1.62 - arr[5] = 3;
1.63 - arr[7] = 8;
1.64 - return arr;
1.65 - }
1.66 -}