1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2019 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 |
|
---|
22 | using HeuristicLab.Common;
|
---|
23 | using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
|
---|
24 | using HEAL.Attic;
|
---|
25 |
|
---|
26 | namespace HeuristicLab.Problems.GeneticProgramming.Robocode {
|
---|
27 | [StorableType("885EE784-E3EC-44D7-B957-A72EBF556F90")]
|
---|
28 | public class BooleanValue : Symbol {
|
---|
29 | public override int MinimumArity { get { return 0; } }
|
---|
30 | public override int MaximumArity { get { return 0; } }
|
---|
31 |
|
---|
32 | [StorableConstructor]
|
---|
33 | protected BooleanValue(StorableConstructorFlag _) : base(_) { }
|
---|
34 | protected BooleanValue(BooleanValue original, Cloner cloner) : base(original, cloner) { }
|
---|
35 |
|
---|
36 | public BooleanValue() : base("BooleanValue", "A Boolean value.") { }
|
---|
37 |
|
---|
38 | public override ISymbolicExpressionTreeNode CreateTreeNode() {
|
---|
39 | return new BooleanTreeNode(this);
|
---|
40 | }
|
---|
41 |
|
---|
42 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
43 | return new BooleanValue(this, cloner);
|
---|
44 | }
|
---|
45 | }
|
---|
46 | }
|
---|