[8288] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[16565] | 3 | * Copyright (C) 2002-2019 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[8288] | 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.Common;
|
---|
| 23 | using HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Data;
|
---|
| 25 | using HeuristicLab.Operators.Programmable;
|
---|
| 26 | using HeuristicLab.Parameters;
|
---|
[16565] | 27 | using HEAL.Attic;
|
---|
[8288] | 28 |
|
---|
| 29 | namespace HeuristicLab.Optimization.Operators {
|
---|
| 30 |
|
---|
| 31 | [Item("ProgrammableAnalyzer", "An analyzer that can be programmed for arbitrary needs.")]
|
---|
[16565] | 32 | [StorableType("6C821E9E-098E-409B-B281-9B530C1F5835")]
|
---|
[8288] | 33 | public class ProgrammableAnalyzer : ProgrammableSingleSuccessorOperator, IAnalyzer {
|
---|
| 34 | public virtual bool EnabledByDefault {
|
---|
| 35 | get { return false; }
|
---|
| 36 | }
|
---|
| 37 |
|
---|
| 38 | [StorableConstructor]
|
---|
[16565] | 39 | protected ProgrammableAnalyzer(StorableConstructorFlag _) : base(_) { }
|
---|
[8288] | 40 | protected ProgrammableAnalyzer(ProgrammableAnalyzer original, Cloner cloner)
|
---|
| 41 | : base(original, cloner) {
|
---|
| 42 | }
|
---|
| 43 | public ProgrammableAnalyzer()
|
---|
| 44 | : base() {
|
---|
| 45 | Parameters.Add(new LookupParameter<BoolValue>("Maximization", "True if the problem is a maximization problem."));
|
---|
| 46 | Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Quality", "The qualities of the solutions."));
|
---|
| 47 | Parameters.Add(new ValueLookupParameter<ResultCollection>("Results", "The result collection where the solution should be stored."));
|
---|
| 48 | Parameters.ForEach(x => x.Hidden = false);
|
---|
| 49 |
|
---|
| 50 | SelectNamespace("HeuristicLab.Optimization");
|
---|
| 51 | SelectNamespace("HeuristicLab.Optimization.Operators");
|
---|
| 52 | Assemblies[typeof(HeuristicLab.Optimization.ResultCollection).Assembly] = true;
|
---|
| 53 | Assemblies[typeof(HeuristicLab.Optimization.Operators.ProgrammableAnalyzer).Assembly] = true;
|
---|
| 54 | }
|
---|
| 55 |
|
---|
| 56 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 57 | return new ProgrammableAnalyzer(this, cloner);
|
---|
| 58 | }
|
---|
| 59 | }
|
---|
| 60 | }
|
---|