Free cookie consent management tool by TermsFeed Policy Generator

source: branches/Robocode/HeuristicLab.Problems.Robocode/Symbols/Numerical Expressions/NumericalOperation.cs @ 11760

Last change on this file since 11760 was 9630, checked in by ascheibe, 11 years ago

#2069 fixed cloning constructors and formatting

File size: 2.9 KB
RevLine 
[9565]1using HeuristicLab.Common;
2using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
3using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
4
[9630]5namespace HeuristicLab.Problems.Robocode {
6  [StorableClass]
7  public class NumericalOperation : CodeNode {
8    public override int MinimumArity { get { return 3; } }
9    public override int MaximumArity { get { return 3; } }
[9565]10
[9630]11    [Storable]
12    public override string Prefix { get; set; }
[9565]13
[9630]14    [Storable]
15    public override string Suffix { get; set; }
[9565]16
[9630]17    [StorableConstructor]
18    private NumericalOperation(bool deserializing) : base(deserializing) { }
19    private NumericalOperation(NumericalOperation original, Cloner cloner)
20      : base(original, cloner) {
21    }
[9565]22
[9630]23    public NumericalOperation()
24      : base("NumericalOperation", "An expression consisting of two numbers and an operator.") {
25      this.Prefix = "(";
26      this.Suffix = ")";
27    }
[9565]28
[9630]29    public override IDeepCloneable Clone(Cloner cloner) {
30      return new NumericalOperation(this, cloner);
31    }
32
33    public override string Interpret(ISymbolicExpressionTreeNode node, System.Collections.Generic.IEnumerable<ISymbolicExpressionTreeNode> children) {
34      ISymbolicExpressionTreeNode condition = null, lhs = null, rhs = null;
35      var enumerator = children.GetEnumerator();
36      int childCount = 0;
37      while (enumerator.MoveNext()) {
38        childCount++;
39        switch (childCount) {
40          case 1: condition = enumerator.Current; break;
41          case 2: lhs = enumerator.Current; break;
42          case 3: rhs = enumerator.Current; break;
43          default: throw new System.Exception("Unexpected number of children. Expected 3 children.");
[9565]44        }
[9630]45      }
46      if (childCount < 3) throw new System.Exception("Unexpected number of children. Expected 3 children.");
[9565]47
[9630]48      if (!(condition.Symbol is Addition || condition.Symbol is Division ||
49          condition.Symbol is Modulus || condition.Symbol is Multiplication || condition.Symbol is Subtraction))
50        throw new System.Exception("Unexpected first child for NumericalOperation of type: " +
51            condition.GetType().ToString() + ". Expected " + typeof(Addition).ToString() +
52            " or " + typeof(Division).ToString() +
53            " or " + typeof(Modulus).ToString() +
54            " or " + typeof(Multiplication).ToString() +
55            " or " + typeof(Subtraction).ToString() + ".");
[9565]56
[9630]57      // TODO Check children 2 & 3 for correct types
[9565]58
[9630]59      string[] result = new string[]
[9565]60            {
61                ((CodeNode)condition.Symbol).Interpret(condition, condition.Subtrees),
62                ((CodeNode)lhs.Symbol).Interpret(lhs, lhs.Subtrees),
63                ((CodeNode)rhs.Symbol).Interpret(rhs, rhs.Subtrees)
64            };
65
[9630]66      return this.Prefix + " " + result[1] + " " + result[0] + " " + result[2] + " " + this.Suffix;
[9565]67    }
[9630]68  }
[9565]69}
Note: See TracBrowser for help on using the repository browser.