source: branches/Robocode.TrunkInt/HeuristicLab.Problems.Robocode/3.3/Symbols/Logical Expressions/LogicalComparison.cs @ 9790

#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 HeuristicLab.Common;
using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;

namespace HeuristicLab.Problems.Robocode {
  [StorableClass]
  public class LogicalComparison : CodeNode {
    public override int MinimumArity { get { return 3; } }
    public override int MaximumArity { get { return 3; } }

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

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

    [StorableConstructor]
    private LogicalComparison(bool deserializing) : base(deserializing) { }
    private LogicalComparison(LogicalComparison original, Cloner cloner)
      : base(original, cloner) {
    }

    public LogicalComparison()
      : base("LogicalComparison", "A LogicalComparison.") {
      this.Prefix = "(";
      this.Suffix = ")";
    }

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

    public override string Interpret(ISymbolicExpressionTreeNode node, System.Collections.Generic.IEnumerable<ISymbolicExpressionTreeNode> children) {
      ISymbolicExpressionTreeNode condition = null, lhs = null, rhs = null;
      var enumerator = children.GetEnumerator();
      int childCount = 0;
      while (enumerator.MoveNext()) {
        childCount++;
        switch (childCount) {
          case 1: condition = enumerator.Current; break;
          case 2: lhs = enumerator.Current; break;
          case 3: rhs = enumerator.Current; break;
          default: throw new System.Exception("Unexpected number of children. Expected 3 children.");
        }
      }
      if (childCount < 3) throw new System.Exception("Unexpected number of children. Expected 3 children.");

      if (!(condition.Symbol is Conjunction || condition.Symbol is Disjunction))
        throw new System.Exception("Unexpected first child for LogicalComparison of type: " +
            condition.GetType().ToString() + ". Expected " + typeof(Conjunction).ToString() +
            " or " + typeof(Disjunction).ToString() + ".");

      // TODO Check children 2 & 3 for correct types

      string[] result = new string[]
            {
                ((CodeNode)condition.Symbol).Interpret(condition, condition.Subtrees),
                ((CodeNode)lhs.Symbol).Interpret(lhs, lhs.Subtrees),
                ((CodeNode)rhs.Symbol).Interpret(rhs, rhs.Subtrees)
            };

      return this.Prefix + " " + result[1] + " " + result[0] + " " + result[2] + " " + this.Suffix;
    }
  }
}