[8517] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
| 3 | * Copyright (C) 2002-2012 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 |
|
---|
| 22 | using System;
|
---|
| 23 | using System.Collections.Generic;
|
---|
| 24 | using HeuristicLab.Common;
|
---|
| 25 | using HeuristicLab.Core;
|
---|
| 26 | using HeuristicLab.Data;
|
---|
| 27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 28 |
|
---|
| 29 | namespace HeuristicLab.Encodings.ParameterConfigurationEncoding {
|
---|
| 30 | [StorableClass]
|
---|
| 31 | public class IntValueRange : Range<IntValue> {
|
---|
[8535] | 32 | #region Constructors and Cloning
|
---|
[8517] | 33 | [StorableConstructor]
|
---|
| 34 | protected IntValueRange(bool deserializing) : base(deserializing) { }
|
---|
| 35 | protected IntValueRange(IntValueRange original, Cloner cloner) : base(original, cloner) { }
|
---|
[8535] | 36 | public IntValueRange(IntValue lowerBound, IntValue upperBound, IntValue stepSize) : base(lowerBound, upperBound, stepSize) { }
|
---|
[8517] | 37 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 38 | return new IntValueRange(this, cloner);
|
---|
| 39 | }
|
---|
[8535] | 40 | #endregion
|
---|
[8517] | 41 |
|
---|
| 42 | protected override IntValue GetRandomSample(IRandom random) {
|
---|
| 43 | int val;
|
---|
| 44 | do {
|
---|
| 45 | val = random.Next(LowerBound.Value / StepSize.Value, UpperBound.Value / StepSize.Value + 1) * StepSize.Value;
|
---|
| 46 | } while (!IsInRange(val));
|
---|
| 47 | return new IntValue(val);
|
---|
| 48 | }
|
---|
| 49 |
|
---|
| 50 | public int ApplyStepSize(int value) {
|
---|
| 51 | return ((int)Math.Round(value / (double)this.StepSize.Value, 0)) * this.StepSize.Value;
|
---|
| 52 | }
|
---|
| 53 |
|
---|
| 54 | public bool IsInRange(int value) {
|
---|
| 55 | return value <= this.UpperBound.Value && value >= this.LowerBound.Value;
|
---|
| 56 | }
|
---|
| 57 |
|
---|
| 58 | public override IEnumerable<IntValue> GetCombinations() {
|
---|
| 59 | var solutions = new List<IntValue>();
|
---|
| 60 | int value = this.LowerBound.Value;
|
---|
| 61 |
|
---|
| 62 | while (value <= this.UpperBound.Value) {
|
---|
| 63 | solutions.Add(new IntValue(value));
|
---|
| 64 | value += this.StepSize.Value;
|
---|
| 65 | }
|
---|
| 66 | return solutions;
|
---|
| 67 | }
|
---|
| 68 |
|
---|
| 69 | protected override double CalculateSimilarityValue(IntValue a, IntValue b) {
|
---|
| 70 | double range = UpperBound.Value - LowerBound.Value;
|
---|
| 71 | double diff = Math.Abs(a.Value - b.Value);
|
---|
| 72 | return Math.Max(0, (range - (diff * 2)) / range);
|
---|
| 73 | }
|
---|
| 74 | }
|
---|
| 75 | }
|
---|