source: branches/Robocode.TrunkInt/HeuristicLab.Problems.Robocode/3.3/Symbols/Logical Expressions/LogicalExpression.cs @ 12209

#region License Information
/* HeuristicLab
 * Copyright (C) 2002-2013 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 <http://www.gnu.org/licenses/>.
 */
#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.Robocode {
  [StorableClass]
  public class LogicalExpression : CodeNode {
    public override int MinimumArity { get { return 1; } }
    public override int MaximumArity { get { return 1; } }

    [Storable]
    public override string Prefix { get; set; }

    [Storable]
    public override string Suffix { get; set; }

    [StorableConstructor]
    protected LogicalExpression(bool deserializing) : base(deserializing) { }
    protected LogicalExpression(LogicalExpression original, Cloner cloner) : base(original, cloner) { }

    public LogicalExpression() : base("LogicalExpression", "A logical expression.") { }

    public override IDeepCloneable Clone(Cloner cloner) {
      return new LogicalExpression(this, cloner);
    }

    public override string Interpret(ISymbolicExpressionTreeNode node, IEnumerable<ISymbolicExpressionTreeNode> children) {
      if (children.Count() != 1)
        throw new ArgumentException("Expected 1 child in LogicalExpression.", "children");

      var exprTree = children.Single();
      var symbol = exprTree.Symbol;
      if (!(symbol is LogicalValue || symbol is Conjunction || symbol is Disjunction || symbol is Negation))
        throw new System.Exception("LogicalExpression was given a child of type " + symbol.GetType() +
            ". The expected child must be of type " + typeof(LogicalValue)
                                           + " or " + typeof(Conjunction)
                                           + " or " + typeof(Disjunction)
                                           + " or " + typeof(Negation) + ".");

      return Prefix + ((CodeNode)symbol).Interpret(exprTree, exprTree.Subtrees) + Suffix;
    }
  }
}