[3253] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[16676] | 3 | * Copyright (C) 2002-2019 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[3253] | 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 |
|
---|
[4722] | 22 | using HeuristicLab.Common;
|
---|
[16676] | 23 | using HEAL.Attic;
|
---|
[5532] | 24 | namespace HeuristicLab.Problems.DataAnalysis.Symbolic {
|
---|
[16676] | 25 | [StorableType("E60C4216-A6BA-48DE-BA66-389B9946B70A")]
|
---|
[14826] | 26 | public sealed class VariableTreeNode : VariableTreeNodeBase {
|
---|
[3269] | 27 | public new Variable Symbol {
|
---|
| 28 | get { return (Variable)base.Symbol; }
|
---|
| 29 | }
|
---|
[4722] | 30 | [StorableConstructor]
|
---|
[16676] | 31 | private VariableTreeNode(StorableConstructorFlag _) : base(_) { }
|
---|
[14826] | 32 | private VariableTreeNode(VariableTreeNode original, Cloner cloner)
|
---|
[4722] | 33 | : base(original, cloner) {
|
---|
[3253] | 34 | }
|
---|
[14826] | 35 | private VariableTreeNode() { }
|
---|
[3253] | 36 | public VariableTreeNode(Variable variableSymbol) : base(variableSymbol) { }
|
---|
| 37 |
|
---|
[4722] | 38 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 39 | return new VariableTreeNode(this, cloner);
|
---|
[3253] | 40 | }
|
---|
| 41 | }
|
---|
| 42 | }
|
---|