source: branches/Robocode.TrunkInt/HeuristicLab.Problems.Robocode/3.3/Symbols/Branches/WhileLoop.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 WhileLoop : CodeNode {
    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]
    private WhileLoop(bool deserializing) : base(deserializing) { }
    private WhileLoop(WhileLoop original, Cloner cloner)
      : base(original, cloner) {

    }

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

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

    public override string Interpret(ISymbolicExpressionTreeNode node, System.Collections.Generic.IEnumerable<ISymbolicExpressionTreeNode> children) {
      string condition = "", ifTrue = "";
      foreach (ISymbolicExpressionTreeNode c in children) {
        if (c.Symbol is LogicalExpression)
          condition = ((CodeNode)c.Symbol).Interpret(c, c.Subtrees);
        else if (c.Symbol is Block)
          ifTrue = ((CodeNode)c.Symbol).Interpret(c, c.Subtrees);
        else
          throw new System.Exception("Unexpected Child node.");
      }
      return this.Prefix + " " + condition + " " + this.Suffix +
          "\r\n" + ifTrue + "\r\n";
    }
  }
}