1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2011 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.Drawing;
|
---|
23 | using HeuristicLab.Core;
|
---|
24 | using HeuristicLab.Optimization;
|
---|
25 |
|
---|
26 | namespace HeuristicLab.Clients.Hive {
|
---|
27 | public class NewTaskTreeNodeAction : IItemTreeNodeAction<HiveTask> {
|
---|
28 | private ItemCollection<HiveTask> hiveJobs;
|
---|
29 |
|
---|
30 | public NewTaskTreeNodeAction(ItemCollection<HiveTask> hiveJobs) {
|
---|
31 | this.hiveJobs = hiveJobs;
|
---|
32 | }
|
---|
33 |
|
---|
34 | public string Name {
|
---|
35 | get { return "New Task..."; }
|
---|
36 | }
|
---|
37 |
|
---|
38 | public Image Image {
|
---|
39 | get { return HeuristicLab.Common.Resources.VSImageLibrary.NewDocument; }
|
---|
40 | }
|
---|
41 |
|
---|
42 | public void Execute(HiveTask item, HiveTask parentItem) {
|
---|
43 | if (item != null) {
|
---|
44 | var experiment = item.ItemTask.Item as Experiment;
|
---|
45 | experiment.Optimizers.Add(new Experiment());
|
---|
46 | } else {
|
---|
47 | hiveJobs.Add(new OptimizerHiveTask(new Experiment()));
|
---|
48 | }
|
---|
49 | }
|
---|
50 | }
|
---|
51 | }
|
---|