#region License Information /* HeuristicLab * Copyright (C) 2002-2011 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 HeuristicLab.Common; using HeuristicLab.Core; using HeuristicLab.Persistence.Default.CompositeSerializers.Storable; namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding { /// /// Symbol for function arguments /// [StorableClass] [Item(Argument.ArgumentName, Argument.ArgumentDescription)] public sealed class Argument : Symbol, IReadOnlySymbol { public const string ArgumentName = "Argument"; public const string ArgumentDescription = "Symbol that represents a function argument."; [Storable] private int argumentIndex; public int ArgumentIndex { get { return argumentIndex; } } public override bool CanChangeDescription { get { return false; } } [StorableConstructor] private Argument(bool deserializing) : base(deserializing) { } private Argument(Argument original, Cloner cloner) : base(original, cloner) { argumentIndex = original.argumentIndex; name = "ARG" + original.argumentIndex; } public Argument(int argumentIndex) : base("ARG" + argumentIndex, Argument.ArgumentDescription) { this.argumentIndex = argumentIndex; this.name = "ARG" + argumentIndex; } public override ISymbolicExpressionTreeNode CreateTreeNode() { return new ArgumentTreeNode(this); } public override IDeepCloneable Clone(Cloner cloner) { return new Argument(this, cloner); } } }