Free cookie consent management tool by TermsFeed Policy Generator

Ignore:
Timestamp:
05/04/17 17:19:35 (8 years ago)
Author:
gkronber
Message:

#2520: changed all usages of StorableClass to use StorableType with an auto-generated GUID (did not add StorableType to other type definitions yet)

Location:
branches/PersistenceReintegration/HeuristicLab.Problems.LinearAssignment/3.3
Files:
6 edited

Legend:

Unmodified
Added
Removed
  • branches/PersistenceReintegration/HeuristicLab.Problems.LinearAssignment/3.3/Analyzers/BestLAPSolutionAnalyzer.cs

    r14185 r14927  
    2828using HeuristicLab.Optimization;
    2929using HeuristicLab.Parameters;
    30 using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
     30using HeuristicLab.Persistence;
    3131
    3232namespace HeuristicLab.Problems.LinearAssignment {
    3333  [Item("BestLAPSolutionAnalyzer", "Analyzes the best solution found.")]
    34   [StorableClass]
     34  [StorableType("0bc3daf5-f711-4f6b-af2f-22c67b0e9e19")]
    3535  public class BestLAPSolutionAnalyzer : SingleSuccessorOperator, IAnalyzer, ISingleObjectiveOperator {
    3636    public bool EnabledByDefault { get { return true; } }
  • branches/PersistenceReintegration/HeuristicLab.Problems.LinearAssignment/3.3/HungarianAlgorithm.cs

    r14185 r14927  
    2828using HeuristicLab.Optimization;
    2929using HeuristicLab.Parameters;
    30 using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
     30using HeuristicLab.Persistence;
    3131
    3232namespace HeuristicLab.Problems.LinearAssignment {
     
    3636  [Item("Hungarian Algorithm", "The Hungarian algorithm can be used to solve the linear assignment problem in O(n^3). It is also known as the Kuhn–Munkres algorithm or Munkres assignment algorithm.")]
    3737  [Creatable(CreatableAttribute.Categories.SingleSolutionAlgorithms, Priority = 170)]
    38   [StorableClass]
     38  [StorableType("d98ab8f9-a84d-4bcd-b60c-c345d5bd5fa5")]
    3939  public sealed class HungarianAlgorithm : EngineAlgorithm, IStorableContent {
    4040    public string Filename { get; set; }
  • branches/PersistenceReintegration/HeuristicLab.Problems.LinearAssignment/3.3/LAPAssignment.cs

    r14185 r14927  
    2525using HeuristicLab.Data;
    2626using HeuristicLab.Encodings.PermutationEncoding;
    27 using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
     27using HeuristicLab.Persistence;
    2828
    2929namespace HeuristicLab.Problems.LinearAssignment {
    3030  [Item("LAP Assignment", "Represents a solution to the LAP.")]
    31   [StorableClass]
     31  [StorableType("0b2b44c9-c63e-49fa-bf90-eefbc7e9ba02")]
    3232  public sealed class LAPAssignment : Item, INotifyPropertyChanged, IStorableContent {
    3333    public string Filename { get; set; }
  • branches/PersistenceReintegration/HeuristicLab.Problems.LinearAssignment/3.3/LAPEvaluator.cs

    r14185 r14927  
    2222
    2323using HeuristicLab.Operators;
    24 using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
     24using HeuristicLab.Persistence;
    2525using HeuristicLab.Core;
    2626using HeuristicLab.Common;
     
    3131namespace HeuristicLab.Problems.LinearAssignment {
    3232  [Item("LAPEvaluator", "Evaluates a solution to the linear assignment problem.")]
    33   [StorableClass]
     33  [StorableType("c68af5f7-008a-4346-ace9-d7fd142789ed")]
    3434  public class LAPEvaluator : InstrumentedOperator, ILAPEvaluator {
    3535
  • branches/PersistenceReintegration/HeuristicLab.Problems.LinearAssignment/3.3/LinearAssignmentProblem.cs

    r14185 r14927  
    2929using HeuristicLab.Optimization;
    3030using HeuristicLab.Parameters;
    31 using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
     31using HeuristicLab.Persistence;
    3232using HeuristicLab.PluginInfrastructure;
    3333
     
    3535  [Item("Linear Assignment Problem (LAP)", "In the linear assignment problem (LAP) an assignment of workers to jobs has to be found such that each worker is assigned to exactly one job, each job is assigned to exactly one worker and the sum of the resulting costs is minimal (or maximal).")]
    3636  [Creatable(CreatableAttribute.Categories.CombinatorialProblems, Priority = 130)]
    37   [StorableClass]
     37  [StorableType("218583e0-bb6a-443f-8736-a871f389b7d1")]
    3838  public sealed class LinearAssignmentProblem : SingleObjectiveHeuristicOptimizationProblem<ILAPEvaluator, IPermutationCreator>, IStorableContent {
    3939    public static readonly string CostsDescription = "The cost matrix that describes the assignment of rows to columns.";
  • branches/PersistenceReintegration/HeuristicLab.Problems.LinearAssignment/3.3/LinearAssignmentProblemSolver.cs

    r14185 r14927  
    2727using HeuristicLab.Optimization;
    2828using HeuristicLab.Parameters;
    29 using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
     29using HeuristicLab.Persistence;
    3030
    3131namespace HeuristicLab.Problems.LinearAssignment {
    3232  [Item("LinearAssignmentProblemSolver", "Uses the hungarian algorithm to solve linear assignment problems.")]
    33   [StorableClass]
     33  [StorableType("55aaa503-cd86-43a1-8580-543c1ba97319")]
    3434  public sealed class LinearAssignmentProblemSolver : SingleSuccessorOperator, ISingleObjectiveOperator {
    3535    private const int UNASSIGNED = -1;
Note: See TracChangeset for help on using the changeset viewer.