|
| 1 | +/* |
| 2 | + * #%L |
| 3 | + * SciJava Operations: a framework for reusable algorithms. |
| 4 | + * %% |
| 5 | + * Copyright (C) 2018 SciJava developers. |
| 6 | + * %% |
| 7 | + * Redistribution and use in source and binary forms, with or without |
| 8 | + * modification, are permitted provided that the following conditions are met: |
| 9 | + * |
| 10 | + * 1. Redistributions of source code must retain the above copyright notice, |
| 11 | + * this list of conditions and the following disclaimer. |
| 12 | + * 2. Redistributions in binary form must reproduce the above copyright notice, |
| 13 | + * this list of conditions and the following disclaimer in the documentation |
| 14 | + * and/or other materials provided with the distribution. |
| 15 | + * |
| 16 | + * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
| 17 | + * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 18 | + * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 19 | + * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDERS OR CONTRIBUTORS BE |
| 20 | + * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| 21 | + * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| 22 | + * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| 23 | + * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| 24 | + * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
| 25 | + * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
| 26 | + * POSSIBILITY OF SUCH DAMAGE. |
| 27 | + * #L% |
| 28 | + */ |
| 29 | + |
| 30 | +package org.scijava.ops; |
| 31 | + |
| 32 | +import org.junit.Test; |
| 33 | +import org.scijava.ops.math.Add.MathAddOp; |
| 34 | +import org.scijava.ops.math.Sqrt.MathSqrtOp; |
| 35 | +import org.scijava.ops.util.Computers; |
| 36 | + |
| 37 | +public class ComputersTest extends AbstractTestEnvironment { |
| 38 | + |
| 39 | + @Test |
| 40 | + public void testUnaryComputers() { |
| 41 | + Computer<double[], double[]> sqrtComputer = Computers.unary(ops, MathSqrtOp.class, double[].class, |
| 42 | + double[].class); |
| 43 | + |
| 44 | + double[] result = new double[3]; |
| 45 | + sqrtComputer.compute(new double[] { 4.0, 100.0, 25.0 }, result); |
| 46 | + arrayEquals(result, 2d, 1d, 5d); |
| 47 | + } |
| 48 | + |
| 49 | + @Test |
| 50 | + public void testBinaryComputers() { |
| 51 | + BiComputer<double[], double[], double[]> addComputer = Computers.binary(ops, MathAddOp.class, double[].class, |
| 52 | + double[].class, double[].class); |
| 53 | + |
| 54 | + double[] result = new double[3]; |
| 55 | + addComputer.compute(new double[] { 4.0, 100.0, 25.0 }, new double[] { 4d, 10d, 1.5 }, result); |
| 56 | + arrayEquals(result, 8d, 110d, 26.5); |
| 57 | + } |
| 58 | +} |
0 commit comments