1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2015 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 HEAL.Attic;
|
---|
26 | using HeuristicLab.Common;
|
---|
27 | using HeuristicLab.Core;
|
---|
28 | using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
|
---|
29 | using HeuristicLab.EvolutionTracking;
|
---|
30 |
|
---|
31 | namespace HeuristicLab.Problems.DataAnalysis.Symbolic {
|
---|
32 | [Item("SymbolicDataAnalysisExpressionAfterCrossoverOperator", "An operator that compares the crossover child with the parent and saves the swapped fragment.")]
|
---|
33 | [StorableType("78BA1B31-2064-44E0-A10A-3F94FDD34186")]
|
---|
34 | public class SymbolicDataAnalysisExpressionAfterCrossoverOperator : AfterCrossoverOperator<ISymbolicExpressionTree> {
|
---|
35 | public SymbolicDataAnalysisExpressionAfterCrossoverOperator() { }
|
---|
36 |
|
---|
37 | protected SymbolicDataAnalysisExpressionAfterCrossoverOperator(SymbolicDataAnalysisExpressionAfterCrossoverOperator original, Cloner cloner)
|
---|
38 | : base(original, cloner) {
|
---|
39 | }
|
---|
40 |
|
---|
41 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
42 | return new SymbolicDataAnalysisExpressionAfterCrossoverOperator(this, cloner);
|
---|
43 | }
|
---|
44 |
|
---|
45 | [StorableConstructor]
|
---|
46 | protected SymbolicDataAnalysisExpressionAfterCrossoverOperator(StorableConstructorFlag _) : base(_) { }
|
---|
47 |
|
---|
48 | public override IOperation Apply() {
|
---|
49 | var childVertex = GenealogyGraph.GetByContent(ChildParameter.ActualValue);
|
---|
50 | var arcs = childVertex.InArcs.ToList();
|
---|
51 | var nodes0 = (List<ISymbolicExpressionTreeNode>)arcs[0].Data;
|
---|
52 | var nodes1 = (List<ISymbolicExpressionTreeNode>)arcs[1].Data;
|
---|
53 | var childNodes = childVertex.Data.IterateNodesPrefix().ToList();
|
---|
54 | IFragment<ISymbolicExpressionTreeNode> fragment = null;
|
---|
55 | for (int i = 0; i < Math.Min(nodes0.Count, childNodes.Count); ++i) {
|
---|
56 | if (nodes0[i] == childNodes[i]) continue;
|
---|
57 | fragment = new Fragment<ISymbolicExpressionTreeNode> {
|
---|
58 | Root = childNodes[i],
|
---|
59 | Index1 = i,
|
---|
60 | };
|
---|
61 | fragment.Index2 = nodes1.IndexOf(fragment.Root);
|
---|
62 | break;
|
---|
63 | }
|
---|
64 |
|
---|
65 | // if the fragment is null it means that nodes0 is identical with childNodes (in other words crossover did nothing)
|
---|
66 | arcs[0].Data = null;
|
---|
67 | arcs[1].Data = fragment;
|
---|
68 |
|
---|
69 | return base.Apply();
|
---|
70 | }
|
---|
71 | }
|
---|
72 | }
|
---|