Free cookie consent management tool by TermsFeed Policy Generator

source: branches/ProgrammableProblem/HeuristicLab.Problems.Programmable/3.3/Datastructures/IntegerParameterConfiguration.cs @ 11396

Last change on this file since 11396 was 11363, checked in by abeham, 10 years ago

#2174:

  • Removed SimSharp reference (not the purpose of this branch anymore)
  • Fixed bugs regarding parameter names when no parameter have been defined
  • Added a method to the problem definition to retrieve a neighborhood solution
    • Programmable problem now works with LocalSearch and SimulatedAnnealing
File size: 3.6 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2014 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
22using System;
23using System.Collections.Generic;
24using System.Linq;
25using HeuristicLab.Common;
26using HeuristicLab.Core;
27using HeuristicLab.Data;
28using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
29
30namespace HeuristicLab.Problems.Programmable {
31  [Item("IntegerParameterConfiguration", "")]
32  [StorableClass]
33  public class IntegerParameterConfiguration : ParameterConfiguration {
34    [Storable]
35    private IntValue length;
36    public IntValue Length {
37      get { return length; }
38      set {
39        if (length == value) return;
40        length = value;
41        OnParameterConfigurationChanged();
42      }
43    }
44
45    [Storable]
46    private IntMatrix bounds;
47    public IntMatrix Bounds {
48      get { return bounds; }
49      set {
50        if (bounds == value) return;
51        bounds = value;
52        OnParameterConfigurationChanged();
53      }
54    }
55
56    [StorableConstructor]
57    protected IntegerParameterConfiguration(bool deserializing) : base(deserializing) { }
58    protected IntegerParameterConfiguration(IntegerParameterConfiguration original, Cloner cloner)
59      : base(original, cloner) {
60      length = cloner.Clone(original.length);
61      bounds = cloner.Clone(original.bounds);
62    }
63    public IntegerParameterConfiguration(int length, int min, int max, int? step = null) {
64      if (min >= max) throw new ArgumentException("min must be less than max", "min");
65      if (step.HasValue && step.Value <= 0) throw new ArgumentException("step must be greater than zero or null", "step");
66      this.length = new IntValue(length);
67      bounds = new IntMatrix(1, step.HasValue ? 3 : 2);
68      bounds[0, 0] = min;
69      bounds[0, 1] = max;
70      if (step.HasValue) bounds[0, 2] = step.Value;
71    }
72    public IntegerParameterConfiguration(int length, IList<int> min, IList<int> max, IList<int> step = null) {
73      if (min.Count == 0) throw new ArgumentException("Bounds must be given for the integer parameters.");
74      if (min.Count != max.Count) throw new ArgumentException("min must be of the same length as max", "min");
75      if (step != null && min.Count != step.Count) throw new ArgumentException("step must be of the same length as min or null", "step");
76      if (min.Zip(max, (mi, ma) => mi >= ma).Any(x => x)) throw new ArgumentException("min must be less than max in each dimension", "min");
77      this.length = new IntValue(length);
78      bounds = new IntMatrix(min.Count, step != null ? 3 : 2);
79      for (int i = 0; i < min.Count; i++) {
80        bounds[i, 0] = min[i];
81        bounds[i, 1] = max[i];
82        if (step != null) bounds[i, 2] = step[i];
83      }
84    }
85
86    public override IDeepCloneable Clone(Cloner cloner) {
87      return new IntegerParameterConfiguration(this, cloner);
88    }
89
90  }
91}
Note: See TracBrowser for help on using the repository browser.