1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/rt/vm/src/test/java/org/apidesign/vm4brwsr/Array.java	Tue Feb 26 16:54:16 2013 +0100
     1.3 @@ -0,0 +1,135 @@
     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.vm4brwsr;
    1.22 +
    1.23 +/**
    1.24 + *
    1.25 + * @author Jaroslav Tulach <jtulach@netbeans.org>
    1.26 + */
    1.27 +public class Array {
    1.28 +    byte[] bytes = { 1 };
    1.29 +    short[] shorts = { 2, 3 };
    1.30 +    int[] ints = { 4, 5, 6 };
    1.31 +    float[] floats = { 7, 8, 9, 10 };
    1.32 +    double[][] doubles = { {11}, {12}, {13}, {14}, {15} };
    1.33 +    char[] chars = { 'a', 'b' };
    1.34 +    
    1.35 +    private Array() {
    1.36 +    }
    1.37 +    
    1.38 +    byte bytes() {
    1.39 +        return bytes[0];
    1.40 +    }
    1.41 +    short shorts() {
    1.42 +        return shorts[1];
    1.43 +    }
    1.44 +    
    1.45 +    int[] ints() {
    1.46 +        return ints;
    1.47 +    }
    1.48 +    
    1.49 +    float floats() {
    1.50 +        return floats[3];
    1.51 +    }
    1.52 +    
    1.53 +    double doubles() {
    1.54 +        return doubles[4][0];
    1.55 +    }
    1.56 +    
    1.57 +    static double[][] dbls = new double[1][2];
    1.58 +    public static double twoDoubles() {
    1.59 +        return dbls[0][0] + dbls[0][0];
    1.60 +    }
    1.61 +
    1.62 +    static int[][] tints = new int[1][2];
    1.63 +    public static int twoInts() {
    1.64 +        return tints[0][0] + tints[0][0];
    1.65 +    }
    1.66 +    
    1.67 +    private static final Array[] ARR = { new Array(), new Array(), new Array() };
    1.68 +    
    1.69 +    private static Array[][] arr() {
    1.70 +        Array[][] matrix = new Array[3][3];
    1.71 +        for (int i = 0; i < ARR.length; i++) {
    1.72 +            matrix[i][i] = ARR[i];
    1.73 +        }
    1.74 +        return matrix;
    1.75 +    }
    1.76 +    private static <T> T[] filter(T[] in) {
    1.77 +        return in;
    1.78 +    }
    1.79 +    
    1.80 +    public static double sum() {
    1.81 +        double sum = 0.0;
    1.82 +        for (Array[] row : arr()) {
    1.83 +            int indx = -1;
    1.84 +            for (Array a : row) {
    1.85 +                indx++;
    1.86 +                if (a == null) {
    1.87 +                    continue;
    1.88 +                }
    1.89 +                sum += a.bytes();
    1.90 +                sum += a.shorts();
    1.91 +                sum += a.ints()[2];
    1.92 +                sum += a.floats();
    1.93 +                sum += filter(row)[indx].doubles();
    1.94 +            }
    1.95 +        }
    1.96 +        return sum;
    1.97 +    }
    1.98 +    private static final int[] arr = { 0, 1, 2, 3, 4, 5 };
    1.99 +    public static int simple(boolean clone) {
   1.100 +        int[] ar;
   1.101 +        if (clone) {
   1.102 +            ar = arr.clone();
   1.103 +        } else {
   1.104 +            ar = arr;
   1.105 +        }
   1.106 +        
   1.107 +        int sum = 0;
   1.108 +        for (int a : ar) {
   1.109 +            sum += a;
   1.110 +        }
   1.111 +        return sum;
   1.112 +    }
   1.113 +    
   1.114 +    public static String objectArrayClass() {
   1.115 +        return Object[].class.getName();
   1.116 +    }
   1.117 +    
   1.118 +    public static boolean instanceOfArray(Object obj) {
   1.119 +        return obj instanceof Object[];
   1.120 +    }
   1.121 +    
   1.122 +    public static int sum(int size) {
   1.123 +        int[] arr = new int[size];
   1.124 +        return arr[0] + arr[1];
   1.125 +    }
   1.126 +    
   1.127 +    static void arraycopy(char[] value, int srcBegin, char[] dst, int dstBegin, int count) {
   1.128 +        while (count-- > 0) {
   1.129 +            dst[dstBegin++] = value[srcBegin++];
   1.130 +        }
   1.131 +    }
   1.132 +
   1.133 +    public static char copyArray() {
   1.134 +        char[] arr = { '0' };
   1.135 +        arraycopy(arr()[0][0].chars, 0, arr, 0, 1);
   1.136 +        return arr[0];
   1.137 +    }
   1.138 +}