jaroslav@106
|
1 |
/**
|
jaroslav@106
|
2 |
* Back 2 Browser Bytecode Translator
|
jaroslav@106
|
3 |
* Copyright (C) 2012 Jaroslav Tulach <jaroslav.tulach@apidesign.org>
|
jaroslav@106
|
4 |
*
|
jaroslav@106
|
5 |
* This program is free software: you can redistribute it and/or modify
|
jaroslav@106
|
6 |
* it under the terms of the GNU General Public License as published by
|
jaroslav@106
|
7 |
* the Free Software Foundation, version 2 of the License.
|
jaroslav@106
|
8 |
*
|
jaroslav@106
|
9 |
* This program is distributed in the hope that it will be useful,
|
jaroslav@106
|
10 |
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
jaroslav@106
|
11 |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
jaroslav@106
|
12 |
* GNU General Public License for more details.
|
jaroslav@106
|
13 |
*
|
jaroslav@106
|
14 |
* You should have received a copy of the GNU General Public License
|
jaroslav@106
|
15 |
* along with this program. Look for COPYING file in the top folder.
|
jaroslav@106
|
16 |
* If not, see http://opensource.org/licenses/GPL-2.0.
|
jaroslav@106
|
17 |
*/
|
jaroslav@22
|
18 |
package org.apidesign.vm4brwsr;
|
jaroslav@21
|
19 |
|
jaroslav@21
|
20 |
/**
|
jaroslav@21
|
21 |
*
|
jaroslav@21
|
22 |
* @author Jaroslav Tulach <jtulach@netbeans.org>
|
jaroslav@21
|
23 |
*/
|
jaroslav@21
|
24 |
public class Array {
|
jaroslav@21
|
25 |
byte[] bytes = { 1 };
|
jaroslav@21
|
26 |
short[] shorts = { 2, 3 };
|
jaroslav@21
|
27 |
int[] ints = { 4, 5, 6 };
|
jaroslav@21
|
28 |
float[] floats = { 7, 8, 9, 10 };
|
jaroslav@21
|
29 |
double[][] doubles = { {11}, {12}, {13}, {14}, {15} };
|
jaroslav@21
|
30 |
char[] chars = { 'a', 'b' };
|
jaroslav@21
|
31 |
|
jaroslav@21
|
32 |
private Array() {
|
jaroslav@21
|
33 |
}
|
jaroslav@21
|
34 |
|
jaroslav@21
|
35 |
byte bytes() {
|
jaroslav@21
|
36 |
return bytes[0];
|
jaroslav@21
|
37 |
}
|
jaroslav@21
|
38 |
short shorts() {
|
jaroslav@21
|
39 |
return shorts[1];
|
jaroslav@21
|
40 |
}
|
jaroslav@21
|
41 |
|
jaroslav@32
|
42 |
int[] ints() {
|
jaroslav@32
|
43 |
return ints;
|
jaroslav@21
|
44 |
}
|
jaroslav@21
|
45 |
|
jaroslav@21
|
46 |
float floats() {
|
jaroslav@21
|
47 |
return floats[3];
|
jaroslav@21
|
48 |
}
|
jaroslav@21
|
49 |
|
jaroslav@21
|
50 |
double doubles() {
|
jaroslav@21
|
51 |
return doubles[4][0];
|
jaroslav@21
|
52 |
}
|
jaroslav@21
|
53 |
|
jaroslav@457
|
54 |
static double[][] dbls = new double[1][2];
|
jaroslav@457
|
55 |
public static double twoDoubles() {
|
jaroslav@457
|
56 |
return dbls[0][0] + dbls[0][0];
|
jaroslav@457
|
57 |
}
|
jaroslav@457
|
58 |
|
jaroslav@457
|
59 |
static int[][] tints = new int[1][2];
|
jaroslav@457
|
60 |
public static int twoInts() {
|
jaroslav@457
|
61 |
return tints[0][0] + tints[0][0];
|
jaroslav@457
|
62 |
}
|
jaroslav@457
|
63 |
|
jaroslav@21
|
64 |
private static final Array[] ARR = { new Array(), new Array(), new Array() };
|
jaroslav@21
|
65 |
|
jtulach@128
|
66 |
private static Array[][] arr() {
|
jtulach@128
|
67 |
Array[][] matrix = new Array[3][3];
|
jtulach@128
|
68 |
for (int i = 0; i < ARR.length; i++) {
|
jtulach@128
|
69 |
matrix[i][i] = ARR[i];
|
jtulach@128
|
70 |
}
|
jtulach@128
|
71 |
return matrix;
|
jaroslav@33
|
72 |
}
|
jaroslav@33
|
73 |
private static <T> T[] filter(T[] in) {
|
jaroslav@33
|
74 |
return in;
|
jaroslav@33
|
75 |
}
|
jaroslav@33
|
76 |
|
jaroslav@21
|
77 |
public static double sum() {
|
jaroslav@21
|
78 |
double sum = 0.0;
|
jtulach@128
|
79 |
for (Array[] row : arr()) {
|
jtulach@128
|
80 |
int indx = -1;
|
jtulach@128
|
81 |
for (Array a : row) {
|
jtulach@128
|
82 |
indx++;
|
jtulach@128
|
83 |
if (a == null) {
|
jtulach@128
|
84 |
continue;
|
jtulach@128
|
85 |
}
|
jtulach@128
|
86 |
sum += a.bytes();
|
jtulach@128
|
87 |
sum += a.shorts();
|
jtulach@128
|
88 |
sum += a.ints()[2];
|
jtulach@128
|
89 |
sum += a.floats();
|
jtulach@128
|
90 |
sum += filter(row)[indx].doubles();
|
jtulach@128
|
91 |
}
|
jaroslav@21
|
92 |
}
|
jaroslav@21
|
93 |
return sum;
|
jaroslav@21
|
94 |
}
|
jaroslav@402
|
95 |
private static final int[] arr = { 0, 1, 2, 3, 4, 5 };
|
jaroslav@402
|
96 |
public static int simple(boolean clone) {
|
jaroslav@402
|
97 |
int[] ar;
|
jaroslav@402
|
98 |
if (clone) {
|
jaroslav@402
|
99 |
ar = arr.clone();
|
jaroslav@402
|
100 |
} else {
|
jaroslav@402
|
101 |
ar = arr;
|
jaroslav@402
|
102 |
}
|
jaroslav@21
|
103 |
|
jaroslav@21
|
104 |
int sum = 0;
|
jaroslav@402
|
105 |
for (int a : ar) {
|
jtulach@128
|
106 |
sum += a;
|
jaroslav@21
|
107 |
}
|
jaroslav@21
|
108 |
return sum;
|
jaroslav@21
|
109 |
}
|
jaroslav@104
|
110 |
|
jaroslav@567
|
111 |
public static String objectArrayClass() {
|
jaroslav@567
|
112 |
return Object[].class.getName();
|
jaroslav@567
|
113 |
}
|
jaroslav@567
|
114 |
|
jaroslav@571
|
115 |
public static boolean instanceOfArray(Object obj) {
|
jaroslav@571
|
116 |
return obj instanceof Object[];
|
jaroslav@571
|
117 |
}
|
jaroslav@571
|
118 |
|
jaroslav@446
|
119 |
public static int sum(int size) {
|
jaroslav@446
|
120 |
int[] arr = new int[size];
|
jaroslav@446
|
121 |
return arr[0] + arr[1];
|
jaroslav@446
|
122 |
}
|
jaroslav@446
|
123 |
|
jaroslav@104
|
124 |
static void arraycopy(char[] value, int srcBegin, char[] dst, int dstBegin, int count) {
|
jaroslav@104
|
125 |
while (count-- > 0) {
|
jaroslav@104
|
126 |
dst[dstBegin++] = value[srcBegin++];
|
jaroslav@104
|
127 |
}
|
jaroslav@104
|
128 |
}
|
jaroslav@104
|
129 |
|
jaroslav@104
|
130 |
public static char copyArray() {
|
jaroslav@104
|
131 |
char[] arr = { '0' };
|
jtulach@128
|
132 |
arraycopy(arr()[0][0].chars, 0, arr, 0, 1);
|
jaroslav@104
|
133 |
return arr[0];
|
jaroslav@104
|
134 |
}
|
jaroslav@21
|
135 |
}
|