Free cookie consent management tool by TermsFeed Policy Generator

source: branches/Robocode.TrunkInt/HeuristicLab.Problems.Robocode/3.3/Symbols/Logical Expressions/Disjunction.cs @ 12214

Last change on this file since 12214 was 10046, checked in by ascheibe, 11 years ago

#2069 simplified Interpret methods of symbols

File size: 2.3 KB
RevLine 
[9790]1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2013 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
4 *
5 * This file is part of HeuristicLab.
6 *
7 * HeuristicLab is free software: you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation, either version 3 of the License, or
10 * (at your option) any later version.
11 *
12 * HeuristicLab is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
15 * GNU General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License
18 * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
19 */
20#endregion
21
[10046]22using System;
[10011]23using System.Collections.Generic;
24using System.Linq;
[9790]25using HeuristicLab.Common;
[9565]26using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
27using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
28
[9630]29namespace HeuristicLab.Problems.Robocode {
30  [StorableClass]
31  public class Disjunction : CodeNode {
[10011]32    public override int MinimumArity { get { return 2; } }
33    public override int MaximumArity { get { return byte.MaxValue; } }
[9565]34
[9630]35    [Storable]
36    public override string Prefix { get; set; }
[9565]37
[9630]38    [Storable]
39    public override string Suffix { get; set; }
[9565]40
[9630]41    [StorableConstructor]
[10011]42    protected Disjunction(bool deserializing) : base(deserializing) { }
43    protected Disjunction(Disjunction original, Cloner cloner) : base(original, cloner) { }
[9565]44
[9630]45    public Disjunction()
46      : base("Disjunction", "Disjunction comparator.") {
[10011]47      Prefix = "(";
48      Suffix = ")";
[9630]49    }
[9565]50
[9630]51    public override IDeepCloneable Clone(Cloner cloner) {
52      return new Disjunction(this, cloner);
53    }
[9565]54
[10011]55    public override string Interpret(ISymbolicExpressionTreeNode node, IEnumerable<ISymbolicExpressionTreeNode> children) {
[10046]56      if (children.Count() < 2)
57        throw new ArgumentException("Expected at leaset 2 children.", "children");
58
[10011]59      string result = string.Join(" || ", children.Select(c => ((CodeNode)c.Symbol).Interpret(c, c.Subtrees)));
60      return Prefix + result + Suffix;
[9565]61    }
[9630]62  }
[9565]63}
Note: See TracBrowser for help on using the repository browser.