1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 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 HeuristicLab.Common;
|
---|
24 | using HeuristicLab.Core;
|
---|
25 | using HEAL.Attic;
|
---|
26 | namespace HeuristicLab.Problems.DataAnalysis.Symbolic {
|
---|
27 | [StorableType("0B35397B-5634-44DB-9350-9EC41E5D4A45")]
|
---|
28 | public sealed class LaggedVariableTreeNode : VariableTreeNodeBase, ILaggedTreeNode {
|
---|
29 | public new LaggedVariable Symbol {
|
---|
30 | get { return (LaggedVariable)base.Symbol; }
|
---|
31 | }
|
---|
32 | [Storable]
|
---|
33 | private int lag;
|
---|
34 | public int Lag {
|
---|
35 | get { return lag; }
|
---|
36 | set { lag = value; }
|
---|
37 | }
|
---|
38 |
|
---|
39 | public override bool HasLocalParameters {
|
---|
40 | get { return true; }
|
---|
41 | }
|
---|
42 |
|
---|
43 | [StorableConstructor]
|
---|
44 | private LaggedVariableTreeNode(StorableConstructorFlag _) : base(_) { }
|
---|
45 | private LaggedVariableTreeNode(LaggedVariableTreeNode original, Cloner cloner)
|
---|
46 | : base(original, cloner) {
|
---|
47 | lag = original.lag;
|
---|
48 | }
|
---|
49 |
|
---|
50 | public LaggedVariableTreeNode(LaggedVariable variableSymbol) : base(variableSymbol) { }
|
---|
51 |
|
---|
52 |
|
---|
53 | public override void ResetLocalParameters(IRandom random) {
|
---|
54 | base.ResetLocalParameters(random);
|
---|
55 | lag = random.Next(Symbol.MinLag, Symbol.MaxLag + 1);
|
---|
56 | }
|
---|
57 |
|
---|
58 | public override void ShakeLocalParameters(IRandom random, double shakingFactor) {
|
---|
59 | base.ShakeLocalParameters(random, shakingFactor);
|
---|
60 | lag = Math.Min(Symbol.MaxLag, Math.Max(Symbol.MinLag, lag + random.Next(-1, 2)));
|
---|
61 | }
|
---|
62 |
|
---|
63 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
64 | return new LaggedVariableTreeNode(this, cloner);
|
---|
65 | }
|
---|
66 |
|
---|
67 | public override string ToString() {
|
---|
68 | return base.ToString() +
|
---|
69 | " (t" + (lag > 0 ? "+" : "") + lag + ")";
|
---|
70 | }
|
---|
71 | }
|
---|
72 | }
|
---|