[2] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[5445] | 3 | * Copyright (C) 2002-2011 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;
|
---|
[5193] | 23 | using System.Threading;
|
---|
[4722] | 24 | using HeuristicLab.Common;
|
---|
[2] | 25 | using HeuristicLab.Core;
|
---|
[1853] | 26 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
[2] | 27 |
|
---|
| 28 | namespace HeuristicLab.SequentialEngine {
|
---|
[851] | 29 | /// <summary>
|
---|
[5193] | 30 | /// Engine for sequential execution of algorithms.
|
---|
[851] | 31 | /// </summary>
|
---|
[3017] | 32 | [StorableClass]
|
---|
[2546] | 33 | [Item("Sequential Engine", "Engine for sequential execution of algorithms.")]
|
---|
[2664] | 34 | public class SequentialEngine : Engine {
|
---|
[4722] | 35 | [StorableConstructor]
|
---|
| 36 | protected SequentialEngine(bool deserializing) : base(deserializing) { }
|
---|
| 37 | protected SequentialEngine(SequentialEngine original, Cloner cloner) : base(original, cloner) { }
|
---|
| 38 | public SequentialEngine() : base() { }
|
---|
| 39 |
|
---|
| 40 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 41 | return new SequentialEngine(this, cloner);
|
---|
| 42 | }
|
---|
| 43 |
|
---|
[5193] | 44 | protected override void Run(CancellationToken cancellationToken) {
|
---|
| 45 | IOperation next;
|
---|
| 46 | OperationCollection coll;
|
---|
| 47 | IAtomicOperation operation;
|
---|
| 48 |
|
---|
| 49 | while (ExecutionStack.Count > 0) {
|
---|
| 50 | cancellationToken.ThrowIfCancellationRequested();
|
---|
| 51 |
|
---|
| 52 | next = ExecutionStack.Pop();
|
---|
| 53 | if (next is OperationCollection) {
|
---|
| 54 | coll = (OperationCollection)next;
|
---|
| 55 | for (int i = coll.Count - 1; i >= 0; i--)
|
---|
| 56 | if (coll[i] != null) ExecutionStack.Push(coll[i]);
|
---|
| 57 | } else if (next is IAtomicOperation) {
|
---|
| 58 | operation = (IAtomicOperation)next;
|
---|
| 59 | try {
|
---|
| 60 | next = operation.Operator.Execute((IExecutionContext)operation, cancellationToken);
|
---|
| 61 | }
|
---|
| 62 | catch (Exception ex) {
|
---|
| 63 | ExecutionStack.Push(operation);
|
---|
| 64 | if (ex is OperationCanceledException) throw ex;
|
---|
| 65 | else throw new OperatorExecutionException(operation.Operator, ex);
|
---|
| 66 | }
|
---|
| 67 | if (next != null) ExecutionStack.Push(next);
|
---|
| 68 |
|
---|
| 69 | if (operation.Operator.Breakpoint) {
|
---|
| 70 | Log.LogMessage(string.Format("Breakpoint: {0}", operation.Operator.Name != string.Empty ? operation.Operator.Name : operation.Operator.ItemName));
|
---|
| 71 | Pause();
|
---|
| 72 | }
|
---|
[2818] | 73 | }
|
---|
[2] | 74 | }
|
---|
| 75 | }
|
---|
| 76 | }
|
---|
| 77 | }
|
---|