#region License Information /* HeuristicLab * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL) * * This file is part of HeuristicLab. * * HeuristicLab is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * HeuristicLab is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with HeuristicLab. If not, see . */ #endregion using System; using System.Collections.Generic; using System.Linq; using HeuristicLab.Common; using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding; using HeuristicLab.Persistence.Default.CompositeSerializers.Storable; namespace HeuristicLab.Problems.GeneticProgramming.RoboCode { [StorableClass] public class Subtraction : CodeNode, INumericalOperator { public override int MinimumArity { get { return 2; } } public override int MaximumArity { get { return byte.MaxValue; } } [Storable] public override string Prefix { get; set; } [Storable] public override string Suffix { get; set; } [StorableConstructor] protected Subtraction(bool deserializing) : base(deserializing) { } protected Subtraction(Subtraction original, Cloner cloner) : base(original, cloner) { } public Subtraction() : base("Subtraction", "Subtraction operator.") { Prefix = "("; Suffix = ")"; } public override IDeepCloneable Clone(Cloner cloner) { return new Subtraction(this, cloner); } public override string Interpret(ISymbolicExpressionTreeNode node, IEnumerable children) { if (children.Count() < 2) throw new ArgumentException("Expected at leaset 2 children.", "children"); string result = string.Join(" - ", children.Select(c => ((CodeNode)c.Symbol).Interpret(c, c.Subtrees))); return Prefix + result + Suffix; } } }