1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2011 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 System;
|
---|
23 | using System.Collections.Generic;
|
---|
24 | using System.Linq;
|
---|
25 | using HeuristicLab.Common;
|
---|
26 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
27 |
|
---|
28 | namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding {
|
---|
29 | [StorableClass]
|
---|
30 | public abstract class SymbolicExpressionTreeTerminalNode : SymbolicExpressionTreeNode {
|
---|
31 | public override IEnumerable<ISymbolicExpressionTreeNode> Subtrees {
|
---|
32 | get {
|
---|
33 | return Enumerable.Empty<ISymbolicExpressionTreeNode>();
|
---|
34 | }
|
---|
35 | }
|
---|
36 |
|
---|
37 | [StorableConstructor]
|
---|
38 | protected SymbolicExpressionTreeTerminalNode(bool deserializing) : base(deserializing) { }
|
---|
39 | // don't call cloning constructor of base to prevent allocation of sub-trees list in base!
|
---|
40 | protected SymbolicExpressionTreeTerminalNode(SymbolicExpressionTreeTerminalNode original, Cloner cloner)
|
---|
41 | : base() {
|
---|
42 | // symbols are reused
|
---|
43 | this.Symbol = original.Symbol;
|
---|
44 | }
|
---|
45 | protected SymbolicExpressionTreeTerminalNode() : base() { }
|
---|
46 |
|
---|
47 | protected SymbolicExpressionTreeTerminalNode(Symbol symbol)
|
---|
48 | : base() {
|
---|
49 | // symbols are reused
|
---|
50 | this.Symbol = symbol;
|
---|
51 | }
|
---|
52 |
|
---|
53 | public override int IndexOfSubtree(ISymbolicExpressionTreeNode tree) {
|
---|
54 | return -1;
|
---|
55 | }
|
---|
56 | public override ISymbolicExpressionTreeNode GetSubtree(int index) {
|
---|
57 | throw new NotSupportedException();
|
---|
58 | }
|
---|
59 | public override void AddSubtree(ISymbolicExpressionTreeNode tree) {
|
---|
60 | throw new NotSupportedException();
|
---|
61 | }
|
---|
62 | public override void InsertSubtree(int index, ISymbolicExpressionTreeNode tree) {
|
---|
63 | throw new NotSupportedException();
|
---|
64 | }
|
---|
65 | public override void RemoveSubtree(int index) {
|
---|
66 | throw new NotSupportedException();
|
---|
67 | }
|
---|
68 | }
|
---|
69 | }
|
---|