-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathOpsTest.java
More file actions
209 lines (195 loc) · 6.82 KB
/
OpsTest.java
File metadata and controls
209 lines (195 loc) · 6.82 KB
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
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
/*
* #%L
* SciJava Operations: a framework for reusable algorithms.
* %%
* Copyright (C) 2016 - 2019 SciJava Ops developers.
* %%
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
* #L%
*/
package org.scijava.ops;
import java.util.function.BiFunction;
import java.util.function.Function;
import org.junit.Test;
import org.scijava.ops.core.computer.BiComputer;
import org.scijava.ops.core.computer.Computer;
import org.scijava.ops.core.computer.NullaryComputer;
import org.scijava.ops.core.inplace.BiInplaceFirst;
import org.scijava.ops.core.inplace.Inplace;
import org.scijava.ops.types.Nil;
public class OpsTest extends AbstractTestEnvironment {
private static Nil<Double> nilDouble = new Nil<Double>() {
};
private static Nil<double[]> nilDoubleArray = new Nil<double[]>() {
};
@Test
public void unaryFunction() {
// Look up a function type safe
Function<Double, Double> sqrtFunction = ops.findOp( //
"math.sqrt", new Nil<Function<Double, Double>>() {
}, //
new Nil[] { nilDouble }, //
nilDouble//
);
double answer = sqrtFunction.apply(16.0);
assert 4.0 == answer;
}
@Test
public void binaryFunction() {
// look up a function: Double result = math.add(Double v1, Double v2)
BiFunction<Double, Double, Double> addFunction = ops.findOp( //
"math.add", new Nil<BiFunction<Double, Double, Double>>() {
}, //
new Nil[] { nilDouble, nilDouble }, //
nilDouble//
);
assert 3.0 == addFunction.apply(1.0, 2.0);
}
@Test
public void nullaryComputer() {
NullaryComputer<double[]> sqrtComputer = ops.findOp( //
"math.zero", new Nil<NullaryComputer<double[]>>() {
}, //
new Nil[] { nilDoubleArray }, //
nilDoubleArray//
);
double[] result = new double[] { 1.2323, 13231.1232, 37373773};
sqrtComputer.compute(result);
assert arrayEquals(result, 0.0, 0.0, 0.0);
}
@Test
public void unaryComputer() {
Computer<double[], double[]> sqrtComputer = ops.findOp( //
"math.sqrt", new Nil<Computer<double[], double[]>>() {
}, //
new Nil[] { nilDoubleArray, nilDoubleArray }, //
nilDoubleArray//
);
double[] result = new double[2];
sqrtComputer.compute(new double[] { 16.0, 81.0 }, result);
assert arrayEquals(result, 4.0, 9.0);
}
@Test
public void binaryComputer() {
BiComputer<double[], double[], double[]> computer = ops.findOp( //
"math.add", new Nil<BiComputer<double[], double[], double[]>>() {
}, //
new Nil[] { nilDoubleArray, nilDoubleArray, nilDoubleArray }, //
nilDoubleArray//
);
double[] a1 = { 3, 5, 7 };
double[] a2 = { 2, 4, 9 };
double[] result = new double[a2.length];
computer.compute(a1, a2, result);
assert arrayEquals(result, 5.0, 9.0, 16.0);
}
@Test
public void unaryInplace() {
Inplace<double[]> inplaceSqrt = ops.findOp( //
"math.sqrt", new Nil<Inplace<double[]>>() {
}, //
new Nil[] { nilDoubleArray }, //
nilDoubleArray//
);
double[] a1 = { 4, 100, 36 };
inplaceSqrt.mutate(a1);
assert arrayEquals(a1, 2.0, 10.0, 6.0);
}
@Test
public void binaryInplace() {
BiInplaceFirst<double[], double[]> inplaceAdd = ops.findOp( //
"math.add", new Nil<BiInplaceFirst<double[], double[]>>() {
}, //
new Nil[] { nilDoubleArray, nilDoubleArray }, //
nilDoubleArray//
);
double[] a1 = { 3, 5, 7 };
double[] a2 = { 2, 4, 9 };
inplaceAdd.mutate(a1, a2);
assert arrayEquals(a1, 5.0, 9.0, 16.0);
}
// @Test
// public void genericFunction() {
// Nil<Iterable<Double>> nilIterableDouble = new Nil<Iterable<Double>>() {};
//
// // Generic typed BiFunction matches, however the given input types do not
// Exception error = null;
// try {
// @SuppressWarnings("unused")
// BiFunction<Iterable<Double>, Iterable<Double>, Iterable<Double>> addDoubleIters = ops.findOp( //
// "math.add", //
// new Nil<BiFunction<Iterable<Double>, Iterable<Double>, Iterable<Double>>>() {
// }, //
// new Nil[] { new Nil<Double>() {}, nilIterableDouble }, //
// nilIterableDouble//
// );
// } catch (Exception e) {
// error = e;
// }
// assert error != null;
// error = null;
//
// // Generic typed BiFunction does not matches
// try {
// @SuppressWarnings("unused")
// BiFunction<Double, Iterable<Double>, Iterable<Double>> addDoubleIters = ops.findOp( //
// "math.add", //
// new Nil<BiFunction<Double, Iterable<Double>, Iterable<Double>>>() {
// }, //
// new Nil[] { nilIterableDouble, nilIterableDouble }, //
// nilIterableDouble//
// );
// } catch (Exception e) {
// error = e;
// }
// assert error != null;
// error = null;
//
// // Output does not match
// try {
// @SuppressWarnings("unused")
// BiFunction<Iterable<Double>, Iterable<Double>, Iterable<Double>> addDoubleIters = ops.findOp( //
// "math.add", //
// new Nil<BiFunction<Iterable<Double>, Iterable<Double>, Iterable<Double>>>() {
// }, //
// new Nil[] { nilIterableDouble, nilIterableDouble }, //
// new Nil<Double>() {}//
// );
// } catch (Exception e) {
// error = e;
// }
// assert error != null;
// error = null;
//
// // We have a generic function which adds two iterables of numbers and gives an iterable of double
// BiFunction<Iterable<Double>, Iterable<Double>, Iterable<Double>> addDoubleIters = ops.findOp( //
// "math.add", //
// new Nil<BiFunction<Iterable<Double>, Iterable<Double>, Iterable<Double>>>() {
// }, //
// new Nil[] { nilIterableDouble, nilIterableDouble }, //
// nilIterableDouble//
// );
//
// Iterable<Double> res = addDoubleIters.apply(Arrays.asList(1d, 2d, 3d, 4d), Arrays.asList(1.5, 1.6, 2.3, 2.0));
// arrayEquals(Streams.stream(res).mapToDouble(d -> d).toArray(), 2.5, 3.6, 5.3, 6.0);
// }
}