1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2008 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;
|
---|
23 | using System.Collections.Generic;
|
---|
24 | using System.Text;
|
---|
25 | using HeuristicLab.Core;
|
---|
26 | using HeuristicLab.Data;
|
---|
27 |
|
---|
28 | namespace HeuristicLab.Operators {
|
---|
29 | public class Sorter : OperatorBase {
|
---|
30 | public override string Description {
|
---|
31 | get { return @"TODO\r\nOperator description still missing ..."; }
|
---|
32 | }
|
---|
33 |
|
---|
34 | public Sorter()
|
---|
35 | : base() {
|
---|
36 | AddVariableInfo(new VariableInfo("Descending", "Sort in descending order", typeof(BoolData), VariableKind.In));
|
---|
37 | AddVariableInfo(new VariableInfo("Value", "Sorting value", typeof(DoubleData), VariableKind.In));
|
---|
38 | }
|
---|
39 |
|
---|
40 | public override IOperation Apply(IScope scope) {
|
---|
41 | bool descending = GetVariableValue<BoolData>("Descending", scope, true).Data;
|
---|
42 | double[] keys = new double[scope.SubScopes.Count];
|
---|
43 | int[] sequence = new int[keys.Length];
|
---|
44 |
|
---|
45 | for (int i = 0; i < keys.Length; i++) {
|
---|
46 | keys[i] = scope.SubScopes[i].GetVariableValue<DoubleData>(GetVariableInfo("Value").ActualName, false).Data;
|
---|
47 | sequence[i] = i;
|
---|
48 | }
|
---|
49 |
|
---|
50 | Array.Sort<double, int>(keys, sequence);
|
---|
51 |
|
---|
52 | if (descending) {
|
---|
53 | int temp;
|
---|
54 | for (int i = 0; i < sequence.Length / 2; i++) {
|
---|
55 | temp = sequence[i];
|
---|
56 | sequence[i] = sequence[sequence.Length - 1 - i];
|
---|
57 | sequence[sequence.Length - 1 - i] = temp;
|
---|
58 | }
|
---|
59 | }
|
---|
60 | scope.ReorderSubScopes(sequence);
|
---|
61 |
|
---|
62 | return null;
|
---|
63 | }
|
---|
64 | }
|
---|
65 | }
|
---|