Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Encodings.IntegerVectorEncoding/3.3/IntegerVectorOperator.cs @ 8721

Last change on this file since 8721 was 8184, checked in by abeham, 12 years ago

#1775:

  • Updated documentation and error messages
  • Added an extra base class to unify the implementation of the round methods
File size: 2.1 KB
Line 
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
22using System;
23using HeuristicLab.Common;
24using HeuristicLab.Core;
25using HeuristicLab.Operators;
26using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
27
28namespace HeuristicLab.Encodings.IntegerVectorEncoding {
29  [Item("IntegerVectorOperator", "Base class for integer vectoro operators.")]
30  [StorableClass]
31  public abstract class IntegerVectorOperator : SingleSuccessorOperator, IIntegerVectorOperator {
32
33    [StorableConstructor]
34    protected IntegerVectorOperator(bool deserializing) : base(deserializing) { }
35    protected IntegerVectorOperator(IntegerVectorOperator original, Cloner cloner) : base(original, cloner) { }
36    public IntegerVectorOperator() : base() { }
37
38    public static int RoundFeasible(int min, int max, int step, double value) {
39      return Math.Max(min, Math.Min(max, (int)Math.Round((value - min) / (double)step) * step + min));
40    }
41    public static int FloorFeasible(int min, int max, int step, double value) {
42      return Math.Max(min, Math.Min(max, (int)Math.Floor((value - min) / (double)step) * step + min));
43    }
44    public static int CeilingFeasible(int min, int max, int step, double value) {
45      return Math.Max(min, Math.Min(max, (int)Math.Ceiling((value - min) / (double)step) * step + min));
46    }
47  }
48}
Note: See TracBrowser for help on using the repository browser.