ArithmeticOperatorTest.java

/*
 * Copyright 2015 S. Webber
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package org.oakgp.function.math;

import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertSame;
import static org.oakgp.NodeSimplifier.simplify;
import static org.oakgp.TestUtils.readNode;
import static org.oakgp.Type.integerType;
import static org.oakgp.function.math.ArithmeticExpressionSimplifier.assertEvaluateToSameResult;

import java.io.File;
import java.io.IOException;
import java.nio.file.Files;
import java.util.List;

import org.junit.Test;
import org.oakgp.Assignments;
import org.oakgp.Type;
import org.oakgp.function.Function;
import org.oakgp.function.Signature;
import org.oakgp.node.Node;

public class ArithmeticOperatorTest {
   private static final File TEST_DATA_FILE = new File("src/test/resources/ArithmeticOperatorTest.txt");
   private static final int TEST_DATA_SIZE = 10000;

   @Test
   public void testGetSignature() {
      Function f = new ArithmeticOperator(Type.integerType()) {
         @Override
         protected Object evaluate(Node arg1, Node arg2, Assignments assignments) {
            throw new UnsupportedOperationException();
         }
      };
      Signature signature = f.getSignature();
      assertSame(integerType(), signature.getReturnType());
      assertEquals(2, signature.getArgumentTypesLength());
      assertSame(integerType(), signature.getArgumentType(0));
      assertSame(integerType(), signature.getArgumentType(1));
   }

   @Test
   public void testSimplification() throws IOException {
      List<String> tests = getTestData();
      assertEquals(TEST_DATA_SIZE, tests.size());
      long inputNodeCtr = 0;
      long outputNodeCtr = 0;
      long start = System.currentTimeMillis();
      for (String test : tests) {
         Node input = readNode(test);
         Node output = simplify(input);
         assertEvaluateToSameResult(input, output);
         inputNodeCtr += input.getNodeCount();
         outputNodeCtr += output.getNodeCount();
      }
      long end = System.currentTimeMillis();
      System.out.println("from " + inputNodeCtr + " to " + outputNodeCtr + " in " + (end - start) + "ms");
   }

   private List<String> getTestData() throws IOException {
      if (!TEST_DATA_FILE.exists()) {
         // createTestData(TEST_DATA_FILE, TEST_DATA_SIZE);
         throw new RuntimeException("Not found: " + TEST_DATA_FILE.getAbsolutePath());
      }
      return Files.readAllLines(TEST_DATA_FILE.toPath());
   }

   // private static void createTestData(File outputFile, int size) throws IOException {
   // ConstantNode[] constants = createConstants(11);
   // int numVariables = 4;
   // TerminalSet terminalSet = new TerminalSet(RANDOM, RATIO_VARIABLES, createTypeArray(numVariables), constants);
   // Set<String> examples = new HashSet<>();
   // try (FileWriter fw = new FileWriter(outputFile)) {
   // while (examples.size() < size) {
   // Node node = makeRandomTree(ARITHMETIC_FUNCTION_SET, terminalSet, 16);
   // String example = writeNode(node);
   // if (node.getNodeCount() > 7 && examples.add(example)) {
   // fw.write(example);
   // fw.write('\n');
   // }
   // }
   // }
   // }
}