Free cookie consent management tool by TermsFeed Policy Generator

source: branches/HeuristicLab.MetaOptimization/HeuristicLab.Problems.MetaOptimization/3.3/Encoding/RangeConstraints/IntValueRange.cs @ 5207

Last change on this file since 5207 was 5207, checked in by cneumuel, 13 years ago

#1215

  • lots of memory-consumption improvements
  • validValues -> validTypes (this saves memory!)
  • changed manipulators; modifications are less significant, out-of-bound-values are resampled instead of set to lower or upper bound
  • changed the way a base-level algorithm gets executed -> introduced AlgorithmExecutor
File size: 1.7 KB
Line 
1using System;
2using System.Collections.Generic;
3using System.Linq;
4using System.Text;
5using HeuristicLab.Data;
6using HeuristicLab.Common;
7using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
8using HeuristicLab.Core;
9
10namespace HeuristicLab.Problems.MetaOptimization {
11  [StorableClass]
12  public class IntValueRange : Range<IntValue> {
13
14    public IntValueRange(IntValue lowerBound, IntValue upperBound, IntValue stepSize) : base(lowerBound, upperBound, stepSize) { }
15    public IntValueRange() { }
16    [StorableConstructor]
17    protected IntValueRange(bool deserializing) : base(deserializing) { }
18    protected IntValueRange(IntValueRange original, Cloner cloner) : base(original, cloner) { }
19    public override IDeepCloneable Clone(Cloner cloner) {
20      return new IntValueRange(this, cloner);
21    }
22
23    protected override IntValue GetRandomSample(IRandom random) {
24      int val;
25      do {
26        val = random.Next(LowerBound.Value / StepSize.Value, UpperBound.Value / StepSize.Value + 1) * StepSize.Value;
27      } while (!IsInRange(val));
28      return new IntValue(val);
29    }
30
31    public void ApplyStepSize(IntValue value) {
32      value.Value = ((int)Math.Round(value.Value / (double)this.StepSize.Value, 0)) * this.StepSize.Value;
33    }
34
35    public bool IsInRange(int value) {
36      return value <= this.UpperBound.Value && value >= this.LowerBound.Value;
37    }
38
39    public override IEnumerable<IntValue> GetCombinations() {
40      var solutions = new List<IntValue>();
41      int value = this.LowerBound.Value;
42
43      while (value <= this.UpperBound.Value) {
44        solutions.Add(new IntValue(value));
45        value += this.StepSize.Value;
46      }
47      return solutions;
48    }
49  }
50}
Note: See TracBrowser for help on using the repository browser.