[2] | 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 {
|
---|
[788] | 29 | /// <summary>
|
---|
| 30 | /// Mixes the sub scopes of a specified scope according to a specified number of partitions.
|
---|
| 31 | /// </summary>
|
---|
[2] | 32 | public class SubScopesMixer : OperatorBase {
|
---|
[788] | 33 | /// <inheritdoc select="summary"/>
|
---|
[2] | 34 | public override string Description {
|
---|
| 35 | get { return @"TODO\r\nOperator description still missing ..."; }
|
---|
| 36 | }
|
---|
[788] | 37 | /// <summary>
|
---|
| 38 | /// Initializes a new instance of <see cref="SubScopesMixer"/> with one variable infos
|
---|
| 39 | /// (<c>Partitions</c>) and the <c>Local</c> flag set to <c>true</c>.
|
---|
| 40 | /// </summary>
|
---|
[2] | 41 | public SubScopesMixer()
|
---|
| 42 | : base() {
|
---|
| 43 | AddVariableInfo(new VariableInfo("Partitions", "Number of partitions to mix", typeof(IntData), VariableKind.In));
|
---|
| 44 | GetVariableInfo("Partitions").Local = true;
|
---|
| 45 | AddVariable(new Variable("Partitions", new IntData(2)));
|
---|
| 46 | }
|
---|
| 47 |
|
---|
[788] | 48 | /// <summary>
|
---|
| 49 | /// Mixes the subscopes of the given <paramref name="scope"/>.
|
---|
| 50 | /// </summary>
|
---|
| 51 | /// <remarks>Calls <see cref="IScope.ReorderSubScopes"/>.<br/>
|
---|
| 52 | /// Mixing of sub scopes is based on the number of partitions.
|
---|
| 53 | /// <example>12 sub scopes and 3 partitions:<br/>
|
---|
| 54 | /// Partition 1 contains sub scopes 1-4, partition 2 sub scopes 5-8 and partition 3 sub scopes 9-12. <br/>
|
---|
| 55 | /// Mixing is realized by selecting at the beginning the first sub scope from partition one, then the
|
---|
| 56 | /// first sub scope from partition 2, afterwards first sub scope from partition 3,
|
---|
| 57 | /// then the second sub scope from the first partition and so on. <br/>
|
---|
| 58 | /// In the end the new sorting of the sub scopes is 1-5-9-2-6-10-3-7-11-4-8-12.
|
---|
| 59 | /// </example>
|
---|
| 60 | /// </remarks>
|
---|
| 61 | /// <param name="scope">The scope whose sub scopes should be mixed.</param>
|
---|
| 62 | /// <returns><c>null</c>.</returns>
|
---|
[2] | 63 | public override IOperation Apply(IScope scope) {
|
---|
| 64 | int partitions = GetVariableValue<IntData>("Partitions", scope, true).Data;
|
---|
| 65 | int[] sequence = new int[scope.SubScopes.Count];
|
---|
[788] | 66 | if ((sequence.Length % partitions) != 0)
|
---|
| 67 | throw new ArgumentException("The number of subScopes is not divisible by the number of partitions without remainder.");
|
---|
[2] | 68 | int partitionSize = sequence.Length / partitions;
|
---|
| 69 |
|
---|
| 70 | // mix sub-scopes -> alternately take one sub-scope from each partition
|
---|
| 71 | for (int i = 0; i < partitionSize; i++) {
|
---|
| 72 | for (int j = 0; j < partitions; j++)
|
---|
| 73 | sequence[i * partitions + j] = j * partitionSize + i;
|
---|
| 74 | }
|
---|
| 75 | scope.ReorderSubScopes(sequence);
|
---|
| 76 |
|
---|
| 77 | return null;
|
---|
| 78 | }
|
---|
| 79 | }
|
---|
| 80 | }
|
---|