Free cookie consent management tool by TermsFeed Policy Generator

source: branches/HL-3.2-MonoMigration/HeuristicLab.Operators/SubScopesMixer.cs @ 980

Last change on this file since 980 was 2, checked in by swagner, 17 years ago

Added HeuristicLab 3.0 sources from former SVN repository at revision 52

File size: 2.0 KB
Line 
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
22using System;
23using System.Collections.Generic;
24using System.Text;
25using HeuristicLab.Core;
26using HeuristicLab.Data;
27
28namespace HeuristicLab.Operators {
29  public class SubScopesMixer : OperatorBase {
30    public override string Description {
31      get { return @"TODO\r\nOperator description still missing ..."; }
32    }
33
34    public SubScopesMixer()
35      : base() {
36      AddVariableInfo(new VariableInfo("Partitions", "Number of partitions to mix", typeof(IntData), VariableKind.In));
37      GetVariableInfo("Partitions").Local = true;
38      AddVariable(new Variable("Partitions", new IntData(2)));
39    }
40
41    public override IOperation Apply(IScope scope) {
42      int partitions = GetVariableValue<IntData>("Partitions", scope, true).Data;
43      int[] sequence = new int[scope.SubScopes.Count];
44      int partitionSize = sequence.Length / partitions;
45
46      // mix sub-scopes -> alternately take one sub-scope from each partition
47      for (int i = 0; i < partitionSize; i++) {
48        for (int j = 0; j < partitions; j++)
49          sequence[i * partitions + j] = j * partitionSize + i;
50      }
51      scope.ReorderSubScopes(sequence);
52
53      return null;
54    }
55  }
56}
Note: See TracBrowser for help on using the repository browser.