#region License Information /* HeuristicLab * Copyright (C) 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 System.Collections.Generic; using System.Threading; using HEAL.Attic; using HeuristicLab.Common; using HeuristicLab.Core; using HeuristicLab.Optimization; namespace HeuristicLab.Problems.Programmable { [Item("Single-objective Problem Definition Script", "Script that defines the parameter vector and evaluates the solution for a programmable problem.")] [StorableType("D0B2A649-EDDE-4A6E-A3B5-F40F5FD1B2C0")] public sealed class SingleObjectiveProblemDefinitionScript : ProblemDefinitionScript, ISingleObjectiveProblemDefinition, IStorableContent where TEncoding : class, IEncoding where TEncodedSolution : class, IEncodedSolution { public string Filename { get; set; } private new ISingleObjectiveProblemDefinition CompiledProblemDefinition { get { return (ISingleObjectiveProblemDefinition)base.CompiledProblemDefinition; } } [StorableConstructor] private SingleObjectiveProblemDefinitionScript(StorableConstructorFlag _) : base(_) { } private SingleObjectiveProblemDefinitionScript(SingleObjectiveProblemDefinitionScript original, Cloner cloner) : base(original, cloner) { } public SingleObjectiveProblemDefinitionScript(string codeTemplate) : base(codeTemplate) { } public SingleObjectiveProblemDefinitionScript() { } public override IDeepCloneable Clone(Cloner cloner) { return new SingleObjectiveProblemDefinitionScript(this, cloner); } public bool Maximization => CompiledProblemDefinition.Maximization; ISingleObjectiveEvaluationResult ISingleObjectiveProblemDefinition.Evaluate(TEncodedSolution solution, IRandom random) { return CompiledProblemDefinition.Evaluate(solution, random); } ISingleObjectiveEvaluationResult ISingleObjectiveProblemDefinition.Evaluate(TEncodedSolution solution, IRandom random, CancellationToken cancellationToken) { return CompiledProblemDefinition.Evaluate(solution, random, cancellationToken); } void ISingleObjectiveProblemDefinition.Evaluate(ISingleObjectiveSolutionContext solutionContext, IRandom random) { CompiledProblemDefinition.Evaluate(solutionContext, random, CancellationToken.None); } void ISingleObjectiveProblemDefinition.Evaluate(ISingleObjectiveSolutionContext solutionContext, IRandom random, CancellationToken cancellationToken) { CompiledProblemDefinition.Evaluate(solutionContext, random, cancellationToken); } void ISingleObjectiveProblemDefinition.Analyze(TEncodedSolution[] individuals, double[] qualities, ResultCollection results, IRandom random) { CompiledProblemDefinition.Analyze(individuals, qualities, results, random); } void ISingleObjectiveProblemDefinition.Analyze(ISingleObjectiveSolutionContext[] solutionContexts, ResultCollection results, IRandom random) { CompiledProblemDefinition.Analyze(solutionContexts, results, random); } IEnumerable ISingleObjectiveProblemDefinition.GetNeighbors(TEncodedSolution individual, IRandom random) { return CompiledProblemDefinition.GetNeighbors(individual, random); } IEnumerable> ISingleObjectiveProblemDefinition.GetNeighbors(ISingleObjectiveSolutionContext solutionContext, IRandom random) { return CompiledProblemDefinition.GetNeighbors(solutionContext, random); } public bool IsBetter(double quality, double bestQuality) { return CompiledProblemDefinition.IsBetter(quality, bestQuality); } } }