Changeset 17655
- Timestamp:
- 07/07/20 17:46:40 (4 years ago)
- Location:
- branches/2521_ProblemRefactoring
- Files:
-
- 10 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/2521_ProblemRefactoring/HeuristicLab.Algorithms.DataAnalysis/3.4/GaussianProcess/GaussianProcessCovarianceOptimizationProblem.cs
r17520 r17655 181 181 Encoding.TreeLength = 10; 182 182 Encoding.TreeDepth = 5; 183 Encoding.GrammarParameter.ReadOnly = false;184 183 Encoding.Grammar = g; 185 Encoding.GrammarParameter.ReadOnly = true;184 Encoding.GrammarParameter.ReadOnly = GrammarRefParameter.ReadOnly = true; 186 185 } 187 186 -
branches/2521_ProblemRefactoring/HeuristicLab.Problems.Binary/3.3/DeceptiveTrapProblem.cs
r17570 r17655 58 58 Parameters.Add(TrapSizeParameter = new FixedValueParameter<IntValue>("Trap Size", "", new IntValue(7))); 59 59 Parameters.Add(NumberOfTrapsParameter = new FixedValueParameter<IntValue>("Number of Traps", "", new IntValue(7))); 60 DimensionRefParameter.ReadOnly = true;60 Encoding.LengthParameter.ReadOnly = DimensionRefParameter.ReadOnly = true; 61 61 Dimension = TrapSize * NumberOfTraps; 62 62 -
branches/2521_ProblemRefactoring/HeuristicLab.Problems.GeneticProgramming/3.3/ArtificialAnt/Problem.cs
r17382 r17655 126 126 Encoding.TreeLength = 20; 127 127 Encoding.TreeDepth = 10; 128 Encoding.GrammarParameter.ReadOnly = false;129 128 Encoding.Grammar = g; 130 Encoding.GrammarParameter.ReadOnly = true;129 Encoding.GrammarParameter.ReadOnly = GrammarRefParameter.ReadOnly = true; 131 130 132 131 BestKnownQuality = 89; -
branches/2521_ProblemRefactoring/HeuristicLab.Problems.GeneticProgramming/3.3/BasicSymbolicRegression/Problem.cs
r17520 r17655 175 175 } 176 176 177 Encoding.GrammarParameter.ReadOnly = false;178 177 Encoding.Grammar = g; 179 Encoding.GrammarParameter.ReadOnly = true;178 Encoding.GrammarParameter.ReadOnly = GrammarRefParameter.ReadOnly = true; 180 179 } 181 180 #endregion -
branches/2521_ProblemRefactoring/HeuristicLab.Problems.GeneticProgramming/3.3/Boolean/EvenParityProblem.cs
r17382 r17655 95 95 g.AddTerminalSymbol(string.Format("{0}", i)); 96 96 97 Encoding.GrammarParameter.ReadOnly = false;98 97 Encoding.Grammar = g; 99 Encoding.GrammarParameter.ReadOnly = true;98 Encoding.GrammarParameter.ReadOnly = GrammarRefParameter.ReadOnly = true; 100 99 101 BestKnownQualityParameter.ReadOnly = false;102 100 BestKnownQuality = Math.Pow(2, NumberOfBits); // this is a benchmark problem (the best achievable quality is known for a given number of bits) 103 101 BestKnownQualityParameter.ReadOnly = true; -
branches/2521_ProblemRefactoring/HeuristicLab.Problems.GeneticProgramming/3.3/Boolean/MultiplexerProblem.cs
r17382 r17655 109 109 g.AddTerminalSymbol(string.Format("d{0}", i)); 110 110 111 Encoding.GrammarParameter.ReadOnly = false;112 111 Encoding.Grammar = g; 113 Encoding.GrammarParameter.ReadOnly = true; 114 115 BestKnownQualityParameter.ReadOnly = false; 112 Encoding.GrammarParameter.ReadOnly = GrammarRefParameter.ReadOnly = true; 113 116 114 BestKnownQuality = Math.Pow(2, NumberOfBits); // this is a benchmark problem (the best achievable quality is known for a given number of bits) 117 115 BestKnownQualityParameter.ReadOnly = true; -
branches/2521_ProblemRefactoring/HeuristicLab.Problems.GeneticProgramming/3.3/LawnMower/Problem.cs
r17382 r17655 76 76 Encoding.TreeLength = 1000; 77 77 Encoding.TreeDepth = 17; 78 Encoding.GrammarParameter.ReadOnly = false;79 78 Encoding.Grammar = g; 80 Encoding.GrammarParameter.ReadOnly = true;79 Encoding.GrammarParameter.ReadOnly = GrammarRefParameter.ReadOnly = true; 81 80 } 82 81 -
branches/2521_ProblemRefactoring/HeuristicLab.Problems.GeneticProgramming/3.3/robocode/Problem.cs
r17382 r17655 88 88 Encoding.FunctionArguments = 0; 89 89 Encoding.FunctionDefinitions = 0; 90 Encoding.GrammarParameter.ReadOnly = GrammarRefParameter.ReadOnly = true; 90 91 91 92 RegisterEventHandlers(); -
branches/2521_ProblemRefactoring/HeuristicLab.Problems.GraphColoring/3.3/GraphColoringProblem.cs
r17544 r17655 74 74 public GraphColoringProblem() { 75 75 Maximization = false; 76 Parameters.Add(adjacencyListParameter = new ValueParameter<IntMatrix>("Adjacency List", "The adjacency list that describes the (symmetric) edges in the graph with nodes from 0 to N-1.") );76 Parameters.Add(adjacencyListParameter = new ValueParameter<IntMatrix>("Adjacency List", "The adjacency list that describes the (symmetric) edges in the graph with nodes from 0 to N-1.") { ReadOnly = true }); 77 77 Parameters.Add(fitnessFunctionParameter = new ValueParameter<EnumValue<FitnessFunction>>("Fitness Function", "The function to use for evaluating the quality of a solution.", new EnumValue<FitnessFunction>(FitnessFunction.Penalized))); 78 Parameters.Add(bestKnownColorsParameter = new OptionalValueParameter<IntValue>("BestKnownColors", "The least amount of colors in a valid coloring.") );78 Parameters.Add(bestKnownColorsParameter = new OptionalValueParameter<IntValue>("BestKnownColors", "The least amount of colors in a valid coloring.") { ReadOnly = true }); 79 79 80 80 var imat = new IntMatrix(defaultInstance.Length, 2); … … 84 84 } 85 85 Dimension = defaultInstanceNodes; 86 Encoding.LengthParameter.ReadOnly = DimensionRefParameter.ReadOnly = true; 86 87 AdjacencyListParameter.Value = imat; 87 88 BestKnownQualityParameter.Value = null; -
branches/2521_ProblemRefactoring/HeuristicLab.Problems.Knapsack/3.3/KnapsackProblem.cs
r17570 r17655 77 77 public KnapsackProblem() 78 78 : base(new BinaryVectorEncoding("Selection")) { 79 DimensionRefParameter.ReadOnly = true;79 Encoding.LengthParameter.ReadOnly = DimensionRefParameter.ReadOnly = true; 80 80 Maximization = true; 81 81 Parameters.Add(KnapsackCapacityParameter = new ValueParameter<IntValue>("KnapsackCapacity", "Capacity of the Knapsack.", new IntValue(1)));
Note: See TracChangeset
for help on using the changeset viewer.