1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
|
package util;
import java.util.Arrays;
public class ArrayMath {
public static double dotProduct(double[] v1, double[] v2) {
assert(v1.length == v2.length);
double result = 0;
for(int i = 0; i < v1.length; i++)
result += v1[i]*v2[i];
return result;
}
public static double twoNormSquared(double[] v) {
double result = 0;
for(double d : v)
result += d*d;
return result;
}
public static boolean containsInvalid(double[] v) {
for(int i = 0; i < v.length; i++)
if(Double.isNaN(v[i]) || Double.isInfinite(v[i]))
return true;
return false;
}
public static double safeAdd(double[] toAdd) {
// Make sure there are no positive infinities
double sum = 0;
for(int i = 0; i < toAdd.length; i++) {
assert(!(Double.isInfinite(toAdd[i]) && toAdd[i] > 0));
assert(!Double.isNaN(toAdd[i]));
sum += toAdd[i];
}
return sum;
}
/* Methods for filling integer and double arrays (of up to four dimensions) with the given value. */
public static void set(int[][][][] array, int value) {
for(int i = 0; i < array.length; i++) {
set(array[i], value);
}
}
public static void set(int[][][] array, int value) {
for(int i = 0; i < array.length; i++) {
set(array[i], value);
}
}
public static void set(int[][] array, int value) {
for(int i = 0; i < array.length; i++) {
set(array[i], value);
}
}
public static void set(int[] array, int value) {
Arrays.fill(array, value);
}
public static void set(double[][][][] array, double value) {
for(int i = 0; i < array.length; i++) {
set(array[i], value);
}
}
public static void set(double[][][] array, double value) {
for(int i = 0; i < array.length; i++) {
set(array[i], value);
}
}
public static void set(double[][] array, double value) {
for(int i = 0; i < array.length; i++) {
set(array[i], value);
}
}
public static void set(double[] array, double value) {
Arrays.fill(array, value);
}
public static void setEqual(double[][][][] dest, double[][][][] source){
for (int i = 0; i < source.length; i++) {
setEqual(dest[i],source[i]);
}
}
public static void setEqual(double[][][] dest, double[][][] source){
for (int i = 0; i < source.length; i++) {
set(dest[i],source[i]);
}
}
public static void set(double[][] dest, double[][] source){
for (int i = 0; i < source.length; i++) {
setEqual(dest[i],source[i]);
}
}
public static void setEqual(double[] dest, double[] source){
System.arraycopy(source, 0, dest, 0, source.length);
}
public static void plusEquals(double[][][][] array, double val){
for (int i = 0; i < array.length; i++) {
plusEquals(array[i], val);
}
}
public static void plusEquals(double[][][] array, double val){
for (int i = 0; i < array.length; i++) {
plusEquals(array[i], val);
}
}
public static void plusEquals(double[][] array, double val){
for (int i = 0; i < array.length; i++) {
plusEquals(array[i], val);
}
}
public static void plusEquals(double[] array, double val){
for (int i = 0; i < array.length; i++) {
array[i] += val;
}
}
public static double sum(double[] array) {
double res = 0;
for (int i = 0; i < array.length; i++) res += array[i];
return res;
}
public static double[][] deepclone(double[][] in){
double[][] res = new double[in.length][];
for (int i = 0; i < res.length; i++) {
res[i] = in[i].clone();
}
return res;
}
public static double[][][] deepclone(double[][][] in){
double[][][] res = new double[in.length][][];
for (int i = 0; i < res.length; i++) {
res[i] = deepclone(in[i]);
}
return res;
}
public static double cosine(double[] a,
double[] b) {
return (dotProduct(a, b)+1e-5)/(Math.sqrt(dotProduct(a, a)+1e-5)*Math.sqrt(dotProduct(b, b)+1e-5));
}
public static double max(double[] ds) {
double max = Double.NEGATIVE_INFINITY;
for(double d:ds) max = Math.max(d,max);
return max;
}
public static void exponentiate(double[] a) {
for (int i = 0; i < a.length; i++) {
a[i] = Math.exp(a[i]);
}
}
public static int sum(int[] array) {
int res = 0;
for (int i = 0; i < array.length; i++) res += array[i];
return res;
}
}
|
