[9089] | 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 HeuristicLab.Common;
|
---|
| 23 | using HeuristicLab.Core;
|
---|
[9090] | 24 | using HeuristicLab.Data;
|
---|
[9089] | 25 | using HeuristicLab.Operators;
|
---|
| 26 | using HeuristicLab.Parameters;
|
---|
| 27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 28 |
|
---|
| 29 | namespace HeuristicLab.Encodings.ConditionActionEncoding {
|
---|
| 30 | [Item("CountNumberOfUniqueActions", "")]
|
---|
| 31 | [StorableClass]
|
---|
| 32 | public class CountNumberOfUniqueActions : SingleSuccessorOperator {
|
---|
| 33 |
|
---|
| 34 | public ILookupParameter<ItemArray<IClassifier>> ClassifiersParameter {
|
---|
| 35 | get { return (ILookupParameter<ItemArray<IClassifier>>)Parameters["Classifiers"]; }
|
---|
| 36 | }
|
---|
[9194] | 37 | public ILookupParameter<IClassifierComparer> ClassifierComparerParameter {
|
---|
| 38 | get { return (ILookupParameter<IClassifierComparer>)Parameters["ClassifierComparer"]; }
|
---|
[9089] | 39 | }
|
---|
[9194] | 40 | public IValueLookupParameter<IItemSet<IAction>> UniqueActionsParameter {
|
---|
| 41 | get { return (IValueLookupParameter<IItemSet<IAction>>)Parameters["UniqueActions"]; }
|
---|
| 42 | }
|
---|
[9090] | 43 | public IValueLookupParameter<IntValue> NumberOfUniqueActionsParameter {
|
---|
| 44 | get { return (IValueLookupParameter<IntValue>)Parameters["NumberOfUniqueActions"]; }
|
---|
| 45 | }
|
---|
[9089] | 46 |
|
---|
| 47 | [StorableConstructor]
|
---|
| 48 | protected CountNumberOfUniqueActions(bool deserializing) : base(deserializing) { }
|
---|
| 49 | protected CountNumberOfUniqueActions(CountNumberOfUniqueActions original, Cloner cloner)
|
---|
| 50 | : base(original, cloner) {
|
---|
| 51 | }
|
---|
| 52 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 53 | return new CountNumberOfUniqueActions(this, cloner);
|
---|
| 54 | }
|
---|
| 55 | public CountNumberOfUniqueActions()
|
---|
| 56 | : base() {
|
---|
| 57 | Parameters.Add(new ScopeTreeLookupParameter<IClassifier>("Classifiers"));
|
---|
[9194] | 58 | Parameters.Add(new LookupParameter<IClassifierComparer>("ClassifierComparer"));
|
---|
| 59 | Parameters.Add(new ValueLookupParameter<IItemSet<IAction>>("UniqueActions"));
|
---|
[9090] | 60 | Parameters.Add(new ValueLookupParameter<IntValue>("NumberOfUniqueActions"));
|
---|
[9089] | 61 | }
|
---|
[9090] | 62 |
|
---|
[9089] | 63 | public override IOperation Apply() {
|
---|
[9194] | 64 | ItemSet<IAction> actions = new ItemSet<IAction>(ClassifierComparerParameter.ActualValue);
|
---|
[9089] | 65 | foreach (var classifier in ClassifiersParameter.ActualValue) {
|
---|
| 66 | actions.Add(classifier.Action);
|
---|
| 67 | }
|
---|
[9090] | 68 | UniqueActionsParameter.ActualValue = actions;
|
---|
| 69 | NumberOfUniqueActionsParameter.ActualValue = new IntValue(actions.Count);
|
---|
[9089] | 70 | return base.Apply();
|
---|
| 71 | }
|
---|
| 72 | }
|
---|
| 73 | }
|
---|