| [12136] | 1 | #region License Information
|
|---|
| 2 | /* HeuristicLab
|
|---|
| 3 | * Copyright (C) 2002-2015 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.Algorithms.ALPS.SteadyState {
|
|---|
| 31 | [Item("RandomIntAssigner", "An operator which sets a random value to a parameter")]
|
|---|
| 32 | [StorableClass]
|
|---|
| [12571] | 33 | public sealed class RandomIntAssigner : SingleSuccessorOperator, IStochasticOperator {
|
|---|
| [12223] | 34 | public LookupParameter<IntValue> LeftSideParameter {
|
|---|
| 35 | get { return (LookupParameter<IntValue>)Parameters["LeftSide"]; }
|
|---|
| [12136] | 36 | }
|
|---|
| 37 | public ValueLookupParameter<IntValue> MinimumParameter {
|
|---|
| 38 | get { return (ValueLookupParameter<IntValue>)Parameters["Minimum"]; }
|
|---|
| 39 | }
|
|---|
| 40 | public ValueLookupParameter<IntValue> MaximumParameter {
|
|---|
| 41 | get { return (ValueLookupParameter<IntValue>)Parameters["Maximum"]; }
|
|---|
| 42 | }
|
|---|
| 43 | public ILookupParameter<IRandom> RandomParameter {
|
|---|
| 44 | get { return (ILookupParameter<IRandom>)Parameters["Random"]; }
|
|---|
| 45 | }
|
|---|
| 46 |
|
|---|
| 47 | [StorableConstructor]
|
|---|
| 48 | private RandomIntAssigner(bool deserializing) : base(deserializing) { }
|
|---|
| 49 | private RandomIntAssigner(RandomIntAssigner original, Cloner cloner)
|
|---|
| 50 | : base(original, cloner) {
|
|---|
| 51 | }
|
|---|
| 52 | public RandomIntAssigner()
|
|---|
| 53 | : base() {
|
|---|
| [12223] | 54 | Parameters.Add(new LookupParameter<IntValue>("LeftSide", "The parameter whose value gets assigned."));
|
|---|
| [12136] | 55 | Parameters.Add(new ValueLookupParameter<IntValue>("Minimum", new IntValue(0)));
|
|---|
| 56 | Parameters.Add(new ValueLookupParameter<IntValue>("Maximum", new IntValue(10)));
|
|---|
| 57 | Parameters.Add(new LookupParameter<IRandom>("Random", "The random number generator to use."));
|
|---|
| 58 | }
|
|---|
| 59 |
|
|---|
| 60 | public override IDeepCloneable Clone(Cloner cloner) {
|
|---|
| 61 | return new RandomIntAssigner(this, cloner);
|
|---|
| 62 | }
|
|---|
| 63 |
|
|---|
| 64 | public override IOperation Apply() {
|
|---|
| 65 | var random = RandomParameter.ActualValue;
|
|---|
| 66 | int min = MinimumParameter.ActualValue.Value;
|
|---|
| 67 | int max = MaximumParameter.ActualValue.Value;
|
|---|
| 68 | LeftSideParameter.ActualValue = new IntValue(random.Next(min, max));
|
|---|
| 69 | return base.Apply();
|
|---|
| 70 | }
|
|---|
| 71 | }
|
|---|
| 72 | } |
|---|
