#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 <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.GeneticProgramming.Robocode {
  [StorableClass]
  public class Equal : CodeNode, ILogicalComparator {
    public override int MinimumArity { get { return 2; } }
    public override int MaximumArity { get { return 2; } }

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

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

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

    public Equal() : base("Equal", "Equal comparator.") { }

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

    public override string Interpret(ISymbolicExpressionTreeNode node, IEnumerable<ISymbolicExpressionTreeNode> children) {
      ISymbolicExpressionTreeNode lhs = null, rhs = null;
      if (children.Count() != 2)
        throw new Exception("Unexpected number of children. Expected two children.");

      lhs = children.First();
      rhs = children.Last();

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

      return result[0] + " == " + result[1];
    }
  }
}