source: branches/Persistence Test/HeuristicLab.Operators/3.2/UniformSequentialSubScopesProcessor.cs @ 4121

#region License Information
/* HeuristicLab
 * Copyright (C) 2002-2008 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
 *
 * This file is part of HeuristicLab.
 *
 * HeuristicLab is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * HeuristicLab is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
 */
#endregion

using System;
using System.Collections.Generic;
using System.Text;
using HeuristicLab.Core;
using HeuristicLab.Data;

namespace HeuristicLab.Operators {
  /// <summary>
  /// Performs the same operator on all existing sub scopes of a given scope, 
  /// must be executed sequentially.
  /// </summary>
  public class UniformSequentialSubScopesProcessor : OperatorBase {
    /// <inheritdoc select="summary"/>
    public override string Description {
      get { return @"TODO\r\nOperator description still missing ..."; }
    }

    /// <summary>
    /// Applies one operator on all the sub scopes of the given <paramref name="scope"/>.
    /// </summary>
    /// <param name="scope">The scope on whose sub scopes the operator is applied.</param>
    /// <returns>A new <see cref="CompositeOperation"/> with one operator and all sub scopes.</returns>
    public override IOperation Apply(IScope scope) {
      CompositeOperation next = new CompositeOperation();
      for (int i = 0; i < scope.SubScopes.Count; i++)
        next.AddOperation(new AtomicOperation(SubOperators[0], scope.SubScopes[i]));
      return next;
    }
  }
}