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 System.Threading;
|
---|
27 |
|
---|
28 | namespace HeuristicLab.SequentialEngine {
|
---|
29 | public class SequentialEngine : EngineBase, IEditable {
|
---|
30 | private IOperator currentOperator;
|
---|
31 |
|
---|
32 | public override IView CreateView() {
|
---|
33 | return new SequentialEngineEditor(this);
|
---|
34 | }
|
---|
35 | public virtual IEditor CreateEditor() {
|
---|
36 | return new SequentialEngineEditor(this);
|
---|
37 | }
|
---|
38 |
|
---|
39 | public override void Abort() {
|
---|
40 | base.Abort();
|
---|
41 | if (currentOperator != null)
|
---|
42 | currentOperator.Abort();
|
---|
43 | }
|
---|
44 |
|
---|
45 | protected override void ProcessNextOperation() {
|
---|
46 | IOperation operation = myExecutionStack.Pop();
|
---|
47 | if (operation is AtomicOperation) {
|
---|
48 | AtomicOperation atomicOperation = (AtomicOperation)operation;
|
---|
49 | IOperation next = null;
|
---|
50 | try {
|
---|
51 | currentOperator = atomicOperation.Operator;
|
---|
52 | next = atomicOperation.Operator.Execute(atomicOperation.Scope);
|
---|
53 | }
|
---|
54 | catch (Exception ex) {
|
---|
55 | // push operation on stack again
|
---|
56 | myExecutionStack.Push(atomicOperation);
|
---|
57 | Abort();
|
---|
58 | ThreadPool.QueueUserWorkItem(delegate(object state) { OnExceptionOccurred(ex);});
|
---|
59 | }
|
---|
60 | if (next != null)
|
---|
61 | myExecutionStack.Push(next);
|
---|
62 | OnOperationExecuted(atomicOperation);
|
---|
63 | if (atomicOperation.Operator.Breakpoint) Abort();
|
---|
64 | } else if (operation is CompositeOperation) {
|
---|
65 | CompositeOperation compositeOperation = (CompositeOperation)operation;
|
---|
66 | for (int i = compositeOperation.Operations.Count - 1; i >= 0; i--)
|
---|
67 | myExecutionStack.Push(compositeOperation.Operations[i]);
|
---|
68 | }
|
---|
69 | }
|
---|
70 | }
|
---|
71 | }
|
---|