1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 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.Common;
|
---|
23 | using HeuristicLab.Core;
|
---|
24 | using HeuristicLab.Data;
|
---|
25 | using HeuristicLab.Parameters;
|
---|
26 | using HEAL.Attic;
|
---|
27 |
|
---|
28 | namespace HeuristicLab.Operators {
|
---|
29 | /// <summary>
|
---|
30 | /// An Operator which sorts the sub-scopes of the current scope.
|
---|
31 | /// </summary>
|
---|
32 | [Item("SubScopesSorter", "An operator which sorts the sub-scopes of the current scope.")]
|
---|
33 | [StorableType("39AAED75-CD24-43EF-86C4-0CC4CA03749C")]
|
---|
34 | public sealed class SubScopesSorter : SingleSuccessorOperator {
|
---|
35 | private bool descending;
|
---|
36 | private string actualName;
|
---|
37 |
|
---|
38 | public ScopeTreeLookupParameter<DoubleValue> ValueParameter {
|
---|
39 | get { return (ScopeTreeLookupParameter<DoubleValue>)Parameters["Value"]; }
|
---|
40 | }
|
---|
41 | public ValueLookupParameter<BoolValue> DescendingParameter {
|
---|
42 | get { return (ValueLookupParameter<BoolValue>)Parameters["Descending"]; }
|
---|
43 | }
|
---|
44 | private ScopeParameter CurrentScopeParameter {
|
---|
45 | get { return (ScopeParameter)Parameters["CurrentScope"]; }
|
---|
46 | }
|
---|
47 | public IScope CurrentScope {
|
---|
48 | get { return CurrentScopeParameter.ActualValue; }
|
---|
49 | }
|
---|
50 |
|
---|
51 | [StorableConstructor]
|
---|
52 | private SubScopesSorter(StorableConstructorFlag _) : base(_) { }
|
---|
53 | private SubScopesSorter(SubScopesSorter original, Cloner cloner)
|
---|
54 | : base(original, cloner) {
|
---|
55 | }
|
---|
56 | public SubScopesSorter()
|
---|
57 | : base() {
|
---|
58 | Parameters.Add(new ScopeTreeLookupParameter<DoubleValue>("Value", "The values contained in each sub-scope acording which the sub-scopes of the current scope are sorted."));
|
---|
59 | Parameters.Add(new ValueLookupParameter<BoolValue>("Descending", "True if the sub-scopes should be sorted in descending order, otherwise false."));
|
---|
60 | Parameters.Add(new ScopeParameter("CurrentScope", "The current scope whose sub-scopes are sorted."));
|
---|
61 | }
|
---|
62 |
|
---|
63 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
64 | return new SubScopesSorter(this, cloner);
|
---|
65 | }
|
---|
66 |
|
---|
67 | public override IOperation Apply() {
|
---|
68 | descending = DescendingParameter.ActualValue.Value;
|
---|
69 | actualName = ValueParameter.TranslatedName;
|
---|
70 | CurrentScope.SubScopes.Sort(SortScopes);
|
---|
71 | return base.Apply();
|
---|
72 | }
|
---|
73 |
|
---|
74 | private int SortScopes(IScope x, IScope y) {
|
---|
75 | IVariable var1;
|
---|
76 | IVariable var2;
|
---|
77 | x.Variables.TryGetValue(actualName, out var1);
|
---|
78 | y.Variables.TryGetValue(actualName, out var2);
|
---|
79 | if ((var1 == null) && (var2 == null))
|
---|
80 | return 0;
|
---|
81 | else if ((var1 == null) && (var2 != null))
|
---|
82 | return 1;
|
---|
83 | else if ((var1 != null) && (var2 == null))
|
---|
84 | return -1;
|
---|
85 | else {
|
---|
86 | int result = ((DoubleValue)var1.Value).CompareTo((DoubleValue)var2.Value);
|
---|
87 | if (descending) result = result * -1;
|
---|
88 | return result;
|
---|
89 | }
|
---|
90 | }
|
---|
91 | }
|
---|
92 | }
|
---|