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 |
|
---|
22 | using HeuristicLab.Core;
|
---|
23 | using HeuristicLab.Core.Views;
|
---|
24 | using HeuristicLab.MainForm;
|
---|
25 | using HeuristicLab.MainForm.WindowsForms;
|
---|
26 | using HeuristicLab.Optimization;
|
---|
27 | using HeuristicLab.Problems.DataAnalysis;
|
---|
28 | using HeuristicLab.Problems.DataAnalysis.Views;
|
---|
29 | using Control = System.Windows.Forms.Control;
|
---|
30 |
|
---|
31 | namespace HeuristicLab.DataPreprocessing {
|
---|
32 | public class DataPreprocessorStarter : IDataPreprocessorStarter {
|
---|
33 |
|
---|
34 | public void Start(IDataAnalysisProblemData problemData, View currentView) {
|
---|
35 | IAlgorithm algorithm;
|
---|
36 | IProblem problem;
|
---|
37 | IItem parentItem = GetMostOuterContent(currentView, out algorithm, out problem);
|
---|
38 | var context = new PreprocessingContext(problemData, parentItem, algorithm, problem);
|
---|
39 | MainFormManager.MainForm.ShowContent(context);
|
---|
40 | }
|
---|
41 |
|
---|
42 | private IItem GetMostOuterContent(Control control, out IAlgorithm algorithm, out IProblem problem) {
|
---|
43 | algorithm = null;
|
---|
44 | problem = null;
|
---|
45 | ItemView itemView = null;
|
---|
46 | do {
|
---|
47 | control = control.Parent;
|
---|
48 | if (control is ItemView) {
|
---|
49 | itemView = (ItemView)control;
|
---|
50 | if (itemView.Content is IAlgorithm) {
|
---|
51 | algorithm = (IAlgorithm)itemView.Content;
|
---|
52 | }
|
---|
53 | if (itemView.Content is IProblem) {
|
---|
54 | problem = (IProblem)itemView.Content;
|
---|
55 | }
|
---|
56 | }
|
---|
57 | } while (control != null);
|
---|
58 |
|
---|
59 | return itemView.Content;
|
---|
60 | }
|
---|
61 | }
|
---|
62 | }
|
---|