source: trunk/sources/HeuristicLab.Problems.DataAnalysis.Symbolic.Views/3.4/InteractiveSymbolicDataAnalysisSolutionSimplifierView.cs @ 9478

Last change on this file since 9478 was 9478, checked in by swagner, 6 years ago

Removed unnecessary local variable (#1890)

File size: 7.2 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2013 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
22using System;
23using System.Collections.Generic;
24using System.Drawing;
25using System.Linq;
26using System.Windows.Forms;
27using HeuristicLab.Common;
28using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
29using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.Views;
30using HeuristicLab.MainForm.WindowsForms;
31
32namespace HeuristicLab.Problems.DataAnalysis.Symbolic.Views {
33  public abstract partial class InteractiveSymbolicDataAnalysisSolutionSimplifierView : AsynchronousContentView {
34    private Dictionary<ISymbolicExpressionTreeNode, ISymbolicExpressionTreeNode> foldedNodes;
35    private Dictionary<ISymbolicExpressionTreeNode, double> nodeImpacts;
36    private enum TreeState { Valid, Invalid }
37
38    public InteractiveSymbolicDataAnalysisSolutionSimplifierView() {
39      InitializeComponent();
40      foldedNodes = new Dictionary<ISymbolicExpressionTreeNode, ISymbolicExpressionTreeNode>();
41      nodeImpacts = new Dictionary<ISymbolicExpressionTreeNode, double>();
42      this.Caption = "Interactive Solution Simplifier";
43    }
44
45    public new ISymbolicDataAnalysisSolution Content {
46      get { return (ISymbolicDataAnalysisSolution)base.Content; }
47      set { base.Content = value; }
48    }
49
50    protected override void RegisterContentEvents() {
51      base.RegisterContentEvents();
52      Content.ModelChanged += Content_Changed;
53      Content.ProblemDataChanged += Content_Changed;
54    }
55    protected override void DeregisterContentEvents() {
56      base.DeregisterContentEvents();
57      Content.ModelChanged -= Content_Changed;
58      Content.ProblemDataChanged -= Content_Changed;
59    }
60
61    private void Content_Changed(object sender, EventArgs e) {
62      UpdateView();
63    }
64
65    protected override void OnContentChanged() {
66      base.OnContentChanged();
67      foldedNodes = new Dictionary<ISymbolicExpressionTreeNode, ISymbolicExpressionTreeNode>();
68      UpdateView();
69      viewHost.Content = this.Content;
70    }
71
72    private void UpdateView() {
73      if (Content == null || Content.Model == null || Content.ProblemData == null) return;
74      var tree = Content.Model.SymbolicExpressionTree;
75      treeChart.Tree = tree.Root.SubtreeCount > 1 ? new SymbolicExpressionTree(tree.Root) : new SymbolicExpressionTree(tree.Root.GetSubtree(0).GetSubtree(0));
76
77      var replacementValues = CalculateReplacementValues(tree);
78      foreach (var pair in replacementValues.Where(pair => !(pair.Key is ConstantTreeNode))) {
79        foldedNodes[pair.Key] = MakeConstantTreeNode(pair.Value);
80      }
81
82      nodeImpacts = CalculateImpactValues(tree);
83      PaintNodeImpacts();
84    }
85
86    protected abstract Dictionary<ISymbolicExpressionTreeNode, double> CalculateReplacementValues(ISymbolicExpressionTree tree);
87    protected abstract Dictionary<ISymbolicExpressionTreeNode, double> CalculateImpactValues(ISymbolicExpressionTree tree);
88    protected abstract void UpdateModel(ISymbolicExpressionTree tree);
89
90    private static ConstantTreeNode MakeConstantTreeNode(double value) {
91      var constant = new Constant { MinValue = value - 1, MaxValue = value + 1 };
92      var constantTreeNode = (ConstantTreeNode)constant.CreateTreeNode();
93      constantTreeNode.Value = value;
94      return constantTreeNode;
95    }
96
97    private void treeChart_SymbolicExpressionTreeNodeDoubleClicked(object sender, MouseEventArgs e) {
98      var visualNode = (VisualSymbolicExpressionTreeNode)sender;
99      var symbExprTreeNode = (SymbolicExpressionTreeNode)visualNode.SymbolicExpressionTreeNode;
100      if (symbExprTreeNode == null) return;
101      var tree = Content.Model.SymbolicExpressionTree;
102      var parent = symbExprTreeNode.Parent;
103      int indexOfSubtree = parent.IndexOfSubtree(symbExprTreeNode);
104      if (foldedNodes.ContainsKey(symbExprTreeNode)) {
105        // undo node folding
106        SwitchNodeWithReplacementNode(parent, indexOfSubtree);
107      }
108      UpdateModel(tree);
109    }
110
111    private void SwitchNodeWithReplacementNode(ISymbolicExpressionTreeNode parent, int subTreeIndex) {
112      ISymbolicExpressionTreeNode subTree = parent.GetSubtree(subTreeIndex);
113      parent.RemoveSubtree(subTreeIndex);
114      if (foldedNodes.ContainsKey(subTree)) {
115        var replacementNode = foldedNodes[subTree];
116        parent.InsertSubtree(subTreeIndex, replacementNode);
117        // exchange key and value
118        foldedNodes.Remove(subTree);
119        foldedNodes.Add(replacementNode, subTree);
120      }
121    }
122
123    private void PaintNodeImpacts() {
124      var impacts = nodeImpacts.Values;
125      double max = impacts.Max();
126      double min = impacts.Min();
127      foreach (ISymbolicExpressionTreeNode treeNode in Content.Model.SymbolicExpressionTree.IterateNodesPostfix()) {
128        VisualSymbolicExpressionTreeNode visualTree = treeChart.GetVisualSymbolicExpressionTreeNode(treeNode);
129
130        if (!(treeNode is ConstantTreeNode) && nodeImpacts.ContainsKey(treeNode)) {
131          double impact = nodeImpacts[treeNode];
132
133          // impact = 0 if no change
134          // impact < 0 if new solution is better
135          // impact > 0 if new solution is worse
136          if (impact < 0.0) {
137            // min is guaranteed to be < 0
138            visualTree.FillColor = Color.FromArgb((int)(impact / min * 255), Color.Red);
139          } else if (impact.IsAlmost(0.0)) {
140            visualTree.FillColor = Color.White;
141          } else {
142            // max is guaranteed to be > 0
143            visualTree.FillColor = Color.FromArgb((int)(impact / max * 255), Color.Green);
144          }
145          visualTree.ToolTip += Environment.NewLine + "Node impact: " + impact;
146          var constantReplacementNode = foldedNodes[treeNode] as ConstantTreeNode;
147          if (constantReplacementNode != null) {
148            visualTree.ToolTip += Environment.NewLine + "Replacement value: " + constantReplacementNode.Value;
149          }
150        }
151        if (visualTree != null)
152          if (treeNode is ConstantTreeNode && foldedNodes.ContainsKey(treeNode)) {
153            visualTree.LineColor = Color.DarkOrange;
154          }
155      }
156      treeChart.RepaintNodes();
157    }
158
159    private void btnSimplify_Click(object sender, EventArgs e) {
160      var simplifier = new SymbolicDataAnalysisExpressionTreeSimplifier();
161      var simplifiedExpressionTree = simplifier.Simplify(Content.Model.SymbolicExpressionTree);
162      UpdateModel(simplifiedExpressionTree);
163    }
164
165    protected abstract void btnOptimizeConstants_Click(object sender, EventArgs e);
166  }
167}
Note: See TracBrowser for help on using the repository browser.