[3841] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[15584] | 3 | * Copyright (C) 2002-2018 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[3841] | 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.Core;
|
---|
[4068] | 24 | using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
|
---|
[3841] | 25 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
[5532] | 26 | namespace HeuristicLab.Problems.DataAnalysis.Symbolic {
|
---|
[3841] | 27 | [StorableClass]
|
---|
| 28 | [Item("LaggedVariable", "Represents a variable value with a time offset.")]
|
---|
[15131] | 29 | public class LaggedVariable : VariableBase {
|
---|
[3841] | 30 | [Storable]
|
---|
| 31 | private int minLag;
|
---|
| 32 | public int MinLag {
|
---|
| 33 | get { return minLag; }
|
---|
| 34 | set { minLag = value; }
|
---|
| 35 | }
|
---|
| 36 | [Storable]
|
---|
| 37 | private int maxLag;
|
---|
| 38 | public int MaxLag {
|
---|
| 39 | get { return maxLag; }
|
---|
| 40 | set { maxLag = value; }
|
---|
| 41 | }
|
---|
[4722] | 42 | [StorableConstructor]
|
---|
[8798] | 43 | protected LaggedVariable(bool deserializing) : base(deserializing) { }
|
---|
| 44 | protected LaggedVariable(LaggedVariable original, Cloner cloner)
|
---|
[4722] | 45 | : base(original, cloner) {
|
---|
| 46 | minLag = original.minLag;
|
---|
| 47 | maxLag = original.maxLag;
|
---|
| 48 | }
|
---|
[8798] | 49 | public LaggedVariable() : this("LaggedVariable", "Represents a variable value with a time offset.") { }
|
---|
| 50 | protected LaggedVariable(string name, string description)
|
---|
| 51 | : base(name, description) {
|
---|
| 52 | MinLag = -1;
|
---|
| 53 | MaxLag = -1;
|
---|
[3841] | 54 | }
|
---|
| 55 |
|
---|
[5532] | 56 | public override ISymbolicExpressionTreeNode CreateTreeNode() {
|
---|
[3841] | 57 | return new LaggedVariableTreeNode(this);
|
---|
| 58 | }
|
---|
| 59 |
|
---|
| 60 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
[4722] | 61 | return new LaggedVariable(this, cloner);
|
---|
[3841] | 62 | }
|
---|
| 63 | }
|
---|
| 64 | }
|
---|