#region License Information
/* HeuristicLab
* Copyright (C) 2002-2014 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 .
*/
#endregion
using HeuristicLab.Common;
using HeuristicLab.Core;
using HeuristicLab.Core.Networks;
using HeuristicLab.Operators;
using HeuristicLab.Optimization;
using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
using System;
using System.Collections.Generic;
using System.Linq;
using System.Threading;
namespace HeuristicLab.Networks {
[Item("AlgorithmNode", "A node of a network which contains a HeuristicLab algorithm.")]
[StorableClass]
public class AlgorithmNode : Node, IAlgorithmNode {
private object locker = new object();
new public PortCollection Ports {
get { return base.Ports; }
}
[Storable]
private IAlgorithm algorithm;
public IAlgorithm Algorithm {
get { return algorithm; }
set {
if (value != algorithm) {
algorithm = value;
OnAlgorithmChanged();
}
}
}
[Storable]
private RunCollection runs;
public RunCollection Runs {
get { return runs; }
}
[StorableConstructor]
protected AlgorithmNode(bool deserializing) : base(deserializing) { }
protected AlgorithmNode(AlgorithmNode original, Cloner cloner)
: base(original, cloner) {
algorithm = cloner.Clone(original.algorithm);
runs = cloner.Clone(original.runs);
}
public AlgorithmNode()
: base("AlgorithmNode") {
runs = new RunCollection();
}
public AlgorithmNode(string name)
: base(name) {
runs = new RunCollection();
}
public AlgorithmNode(string name, string description)
: base(name, description) {
runs = new RunCollection();
}
public override IDeepCloneable Clone(Cloner cloner) {
return new AlgorithmNode(this, cloner);
}
protected virtual void Configure(IConfigurationPort port, IMessage message, CancellationToken token) {
// set algorithm and problem parameters
lock (locker) {
if (algorithm != null) {
foreach (var v in message.Values) {
IParameter param = null;
if (Algorithm.Parameters.TryGetValue(v.Name, out param)) {
var vp = param as IValueParameter;
if (vp != null) vp.Value = v.Value;
}
if (Algorithm.Problem.Parameters.TryGetValue(v.Name, out param)) {
var vp = param as IValueParameter;
if (vp != null) vp.Value = v.Value;
}
}
}
}
}
protected virtual void Execute(IExecutionPort port, IMessage message, CancellationToken token) {
if (Algorithm == null) throw new InvalidOperationException("Algorithm is null");
IAlgorithm algorithm;
lock (locker) {
// prevent cloning of ports in hook operators
var cloner = new Cloner();
foreach (var hook in Algorithm.GetObjectGraphObjects(new HashSet