[2] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[2817] | 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 |
|
---|
[2830] | 22 | using System.Collections.Generic;
|
---|
[3376] | 23 | using HeuristicLab.Common;
|
---|
[2] | 24 | using HeuristicLab.Core;
|
---|
[3138] | 25 | using HeuristicLab.Optimization;
|
---|
[2817] | 26 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
[2] | 27 |
|
---|
| 28 | namespace HeuristicLab.Selection {
|
---|
[817] | 29 | /// <summary>
|
---|
[2817] | 30 | /// An operator which reduces to the sub-scopes of the rightmost sub-scope of the current scope.
|
---|
[817] | 31 | /// </summary>
|
---|
[2817] | 32 | [Item("RightReducer", "An operator which reduces to the sub-scopes of the rightmost sub-scope of the current scope.")]
|
---|
[3017] | 33 | [StorableClass]
|
---|
[3138] | 34 | public sealed class RightReducer : Reducer, IReducer {
|
---|
[2817] | 35 | public RightReducer() : base() { }
|
---|
[2] | 36 |
|
---|
[2830] | 37 | protected override List<IScope> Reduce(List<IScope> scopes) {
|
---|
| 38 | List<IScope> reduced = new List<IScope>();
|
---|
[2817] | 39 | if (scopes.Count > 0) reduced.AddRange(scopes[scopes.Count - 1].SubScopes);
|
---|
| 40 | return reduced;
|
---|
[2] | 41 | }
|
---|
| 42 | }
|
---|
| 43 | }
|
---|