Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Selection/3.3/BestSelector.cs @ 5049

Last change on this file since 5049 was 4722, checked in by swagner, 14 years ago

Merged cloning refactoring branch back into trunk (#922)

File size: 3.0 KB
RevLine 
[2]1#region License Information
2/* HeuristicLab
[2805]3 * Copyright (C) 2002-2010 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
[2]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
[3138]22using System.Collections.Generic;
[3096]23using System.Linq;
[4722]24using HeuristicLab.Common;
[2]25using HeuristicLab.Core;
[3138]26using HeuristicLab.Data;
27using HeuristicLab.Optimization;
[2805]28using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
[2]29
30namespace HeuristicLab.Selection {
[817]31  /// <summary>
[3096]32  /// A selection operator which considers a single double quality value and selects the best.
[817]33  /// </summary>
[3096]34  [Item("BestSelector", "A selection operator which considers a single double quality value and selects the best.")]
[3017]35  [StorableClass]
[3138]36  public sealed class BestSelector : SingleObjectiveSelector, ISingleObjectiveSelector {
[3096]37    public BestSelector() : base() { }
[4722]38    [StorableConstructor]
39    private BestSelector(bool deserializing) : base(deserializing) { }
40    private BestSelector(BestSelector original, Cloner cloner)
41      : base(original, cloner) {
42    }
43    public override IDeepCloneable Clone(Cloner cloner) {
44      return new BestSelector(this, cloner);
45    }
[2]46
[4722]47
[2830]48    protected override IScope[] Select(List<IScope> scopes) {
[2805]49      int count = NumberOfSelectedSubScopesParameter.ActualValue.Value;
50      bool copy = CopySelectedParameter.Value.Value;
[3096]51      bool maximization = MaximizationParameter.ActualValue.Value;
52      ItemArray<DoubleValue> qualities = QualityParameter.ActualValue;
[2830]53      IScope[] selected = new IScope[count];
[2805]54
[3096]55      // create a list for each scope that contains the scope's index in the original scope list
56      var temp = qualities.Select((x, index) => new { index, x.Value });
57      if (maximization)
58        temp = temp.OrderByDescending(x => x.Value);
59      else
60        temp = temp.OrderBy(x => x.Value);
61      var list = temp.ToList();
62
[3128]63      if (copy) {
[3137]64        int j = 0;
65        for (int i = 0; i < count; i++) {
66          selected[i] = (IScope)scopes[list[j].index].Clone();
67          j++;
[3128]68          if (j >= list.Count) j = 0;
[2]69        }
[3128]70      } else {
[3137]71        for (int i = 0; i < count; i++) {
72          selected[i] = scopes[list[0].index];
73          scopes[list[0].index] = null;
74          list.RemoveAt(0);
[3128]75        }
[3137]76        scopes.RemoveAll(x => x == null);
[2]77      }
[2817]78      return selected;
[2]79    }
80  }
81}
Note: See TracBrowser for help on using the repository browser.