| 1 | #region License Information
|
|---|
| 2 | /* HeuristicLab
|
|---|
| 3 | * Copyright (C) 2002-2010 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 HeuristicLab.Common;
|
|---|
| 23 | using HeuristicLab.Core;
|
|---|
| 24 | using HeuristicLab.Data;
|
|---|
| 25 | using HeuristicLab.Operators;
|
|---|
| 26 | using HeuristicLab.Optimization;
|
|---|
| 27 | using HeuristicLab.Parameters;
|
|---|
| 28 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
|---|
| 29 |
|
|---|
| 30 | namespace HeuristicLab.Encodings.IntegerVectorEncoding {
|
|---|
| 31 | /// <summary>
|
|---|
| 32 | /// A base class for operators creating int-valued vectors.
|
|---|
| 33 | /// </summary>
|
|---|
| 34 | [Item("IntegerVectorCreator", "A base class for operators creating int-valued vectors.")]
|
|---|
| 35 | [StorableClass]
|
|---|
| 36 | public abstract class IntegerVectorCreator : SingleSuccessorOperator, IIntegerVectorCreator, IStochasticOperator {
|
|---|
| 37 | public ILookupParameter<IRandom> RandomParameter {
|
|---|
| 38 | get { return (LookupParameter<IRandom>)Parameters["Random"]; }
|
|---|
| 39 | }
|
|---|
| 40 | public ILookupParameter<IntegerVector> IntegerVectorParameter {
|
|---|
| 41 | get { return (ILookupParameter<IntegerVector>)Parameters["IntegerVector"]; }
|
|---|
| 42 | }
|
|---|
| 43 | public IValueLookupParameter<IntValue> LengthParameter {
|
|---|
| 44 | get { return (IValueLookupParameter<IntValue>)Parameters["Length"]; }
|
|---|
| 45 | }
|
|---|
| 46 | public IValueLookupParameter<IntValue> MinimumParameter {
|
|---|
| 47 | get { return (IValueLookupParameter<IntValue>)Parameters["Minimum"]; }
|
|---|
| 48 | }
|
|---|
| 49 | public IValueLookupParameter<IntValue> MaximumParameter {
|
|---|
| 50 | get { return (IValueLookupParameter<IntValue>)Parameters["Maximum"]; }
|
|---|
| 51 | }
|
|---|
| 52 |
|
|---|
| 53 | protected IntegerVectorCreator()
|
|---|
| 54 | : base() {
|
|---|
| 55 | Parameters.Add(new LookupParameter<IRandom>("Random", "The pseudo random number generator which should be used for stochastic manipulation operators."));
|
|---|
| 56 | Parameters.Add(new LookupParameter<IntegerVector>("IntegerVector", "The vector which should be manipulated."));
|
|---|
| 57 | Parameters.Add(new ValueLookupParameter<IntValue>("Length", "The length of the vector."));
|
|---|
| 58 | Parameters.Add(new ValueLookupParameter<IntValue>("Minimum", "The lower bound for each element in the vector."));
|
|---|
| 59 | Parameters.Add(new ValueLookupParameter<IntValue>("Maximum", "The upper bound for each element in the vector."));
|
|---|
| 60 | }
|
|---|
| 61 |
|
|---|
| 62 | public sealed override IOperation Apply() {
|
|---|
| 63 | IntegerVectorParameter.ActualValue = Create(RandomParameter.ActualValue, LengthParameter.ActualValue, MinimumParameter.ActualValue, MaximumParameter.ActualValue);
|
|---|
| 64 | return base.Apply();
|
|---|
| 65 | }
|
|---|
| 66 |
|
|---|
| 67 | protected abstract IntegerVector Create(IRandom random, IntValue length, IntValue minimum, IntValue maximum);
|
|---|
| 68 | }
|
|---|
| 69 | }
|
|---|
