[2] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[3404] | 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 |
|
---|
| 22 | using System;
|
---|
| 23 | using HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Data;
|
---|
[3404] | 25 | using HeuristicLab.Parameters;
|
---|
| 26 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
[2] | 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>
|
---|
[3404] | 32 | [Item("SubScopesMixer", "Changes the order of the sub-scopes by repartitioning the sub-scopes such that each new partition contains one scope from each old partition.")]
|
---|
| 33 | [StorableClass]
|
---|
| 34 | public class SubScopesMixer : SingleSuccessorOperator {
|
---|
| 35 | public ValueParameter<IntValue> PartitionsParameter {
|
---|
| 36 | get { return (ValueParameter<IntValue>)Parameters["Partitions"]; }
|
---|
[2] | 37 | }
|
---|
[3404] | 38 |
|
---|
| 39 | public IntValue Partitions {
|
---|
| 40 | get { return PartitionsParameter.Value; }
|
---|
| 41 | set { PartitionsParameter.Value = value; }
|
---|
| 42 | }
|
---|
| 43 |
|
---|
[788] | 44 | /// <summary>
|
---|
| 45 | /// Initializes a new instance of <see cref="SubScopesMixer"/> with one variable infos
|
---|
| 46 | /// (<c>Partitions</c>) and the <c>Local</c> flag set to <c>true</c>.
|
---|
| 47 | /// </summary>
|
---|
[2] | 48 | public SubScopesMixer()
|
---|
| 49 | : base() {
|
---|
[3404] | 50 | Parameters.Add(new ValueParameter<IntValue>("Partitions", "The number of equal-sized partitions.", new IntValue(2)));
|
---|
[2] | 51 | }
|
---|
| 52 |
|
---|
[788] | 53 | /// <summary>
|
---|
[3404] | 54 | /// Mixes the sub-scopes of the scope this operator is applied on.
|
---|
[788] | 55 | /// </summary>
|
---|
[3404] | 56 | /// <remarks>Mixing of sub-scopes is based on the number of partitions.
|
---|
| 57 | /// <example>12 sub-scopes and 3 partitions:<br/>
|
---|
| 58 | /// Partition 1 contains scopes 1-4, partition 2 scopes 5-8 and partition 3 scopes 9-12. <br/>
|
---|
| 59 | /// Mixing is realized by selecting at the beginning the first scope from partition one, then the
|
---|
| 60 | /// first scope from partition 2, afterwards first scope from partition 3,
|
---|
| 61 | /// then the second scope from the first partition and so on. <br/>
|
---|
[788] | 62 | /// In the end the new sorting of the sub scopes is 1-5-9-2-6-10-3-7-11-4-8-12.
|
---|
| 63 | /// </example>
|
---|
| 64 | /// </remarks>
|
---|
[801] | 65 | /// <exception cref="ArgumentException">Thrown when the number of sub scopes cannot be divided by
|
---|
| 66 | /// the number of partitions without remainder.</exception>
|
---|
[788] | 67 | /// <param name="scope">The scope whose sub scopes should be mixed.</param>
|
---|
| 68 | /// <returns><c>null</c>.</returns>
|
---|
[3404] | 69 | public override IOperation Apply() {
|
---|
| 70 | int partitions = Partitions.Value;
|
---|
| 71 | IScope scope = ExecutionContext.Scope;
|
---|
| 72 | int count = scope.SubScopes.Count;
|
---|
| 73 | if ((count % partitions) != 0)
|
---|
| 74 | throw new ArgumentException(Name + ": The number of sub-scopes is not divisible by the number of partitions without remainder.");
|
---|
| 75 | int partitionSize = count / partitions;
|
---|
[2] | 76 |
|
---|
[3404] | 77 | IScope[] reorderedSubScopes = new IScope[count];
|
---|
| 78 |
|
---|
[2] | 79 | // mix sub-scopes -> alternately take one sub-scope from each partition
|
---|
| 80 | for (int i = 0; i < partitionSize; i++) {
|
---|
[3404] | 81 | for (int j = 0; j < partitions; j++) {
|
---|
| 82 | reorderedSubScopes[i * partitions + j] = scope.SubScopes[j * partitionSize + i];
|
---|
| 83 | }
|
---|
[2] | 84 | }
|
---|
[3404] | 85 | scope.SubScopes.Clear();
|
---|
| 86 | scope.SubScopes.AddRange(reorderedSubScopes);
|
---|
[2] | 87 |
|
---|
[3404] | 88 | return base.Apply();
|
---|
[2] | 89 | }
|
---|
| 90 | }
|
---|
| 91 | }
|
---|