/* * 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.choice; import static org.oakgp.node.NodeType.isFunction; import java.util.ArrayList; import java.util.List; import org.oakgp.Arguments; import org.oakgp.Assignments; import org.oakgp.Type; import org.oakgp.function.Function; import org.oakgp.function.Signature; import org.oakgp.node.FunctionNode; import org.oakgp.node.Node; /** Returns the first argument if not {@code null}, else returns the second argument. */ public final class OrElse implements Function { private final Signature signature; /** Constructs a selection operator that returns values of the specified type. */ public OrElse(Type type) { signature = Signature.createSignature(type, Type.nullableType(type), type); } @Override public Object evaluate(Arguments arguments, Assignments assignments) { Object result = arguments.firstArg().evaluate(assignments); if (result == null) { return arguments.secondArg().evaluate(assignments); } else { return result; } } @Override public Signature getSignature() { return signature; } @Override public Node simplify(Arguments arguments) { List<Node> nodes = new ArrayList<>(); nodes.add(arguments.firstArg()); Node next = arguments.secondArg(); int indexOfLastDuplicate = 0; Node nodeAfterLastDuplicate = null; while (isFunction(next) && ((FunctionNode) next).getFunction() == this) { FunctionNode fn = ((FunctionNode) next); Arguments args = fn.getArguments(); if (nodes.contains(args.firstArg())) { indexOfLastDuplicate = nodes.size(); nodeAfterLastDuplicate = args.secondArg(); } else { nodes.add(args.firstArg()); } next = args.secondArg(); } if (indexOfLastDuplicate == 0) { return null; } Node n = nodeAfterLastDuplicate; for (int i = indexOfLastDuplicate - 1; i > -1; i--) { n = new FunctionNode(this, nodes.get(i), n); } return n; } }