[2757] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[12012] | 3 | * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[2757] | 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;
|
---|
[4722] | 23 | using HeuristicLab.Common;
|
---|
[2757] | 24 | using HeuristicLab.Core;
|
---|
| 25 | using HeuristicLab.Data;
|
---|
| 26 | using HeuristicLab.Parameters;
|
---|
| 27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 28 |
|
---|
| 29 | namespace HeuristicLab.Operators {
|
---|
| 30 | /// <summary>
|
---|
[2794] | 31 | /// An operator which compares two items.
|
---|
[2757] | 32 | /// </summary>
|
---|
| 33 | [Item("Comparator", "An operator which compares two items.")]
|
---|
[3017] | 34 | [StorableClass]
|
---|
[2757] | 35 | public sealed class Comparator : SingleSuccessorOperator {
|
---|
| 36 | public LookupParameter<IItem> LeftSideParameter {
|
---|
| 37 | get { return (LookupParameter<IItem>)Parameters["LeftSide"]; }
|
---|
| 38 | }
|
---|
| 39 | public ValueLookupParameter<IItem> RightSideParameter {
|
---|
| 40 | get { return (ValueLookupParameter<IItem>)Parameters["RightSide"]; }
|
---|
| 41 | }
|
---|
[3048] | 42 | private ValueParameter<Comparison> ComparisonParameter {
|
---|
| 43 | get { return (ValueParameter<Comparison>)Parameters["Comparison"]; }
|
---|
[2757] | 44 | }
|
---|
[3048] | 45 | public LookupParameter<BoolValue> ResultParameter {
|
---|
| 46 | get { return (LookupParameter<BoolValue>)Parameters["Result"]; }
|
---|
[2757] | 47 | }
|
---|
[3048] | 48 | public Comparison Comparison {
|
---|
[2757] | 49 | get { return ComparisonParameter.Value; }
|
---|
| 50 | set { ComparisonParameter.Value = value; }
|
---|
| 51 | }
|
---|
| 52 |
|
---|
[4722] | 53 | [StorableConstructor]
|
---|
| 54 | private Comparator(bool deserializing) : base(deserializing) { }
|
---|
| 55 | private Comparator(Comparator original, Cloner cloner)
|
---|
| 56 | : base(original, cloner) {
|
---|
| 57 | }
|
---|
[2757] | 58 | public Comparator()
|
---|
| 59 | : base() {
|
---|
| 60 | Parameters.Add(new LookupParameter<IItem>("LeftSide", "The left side of the comparison."));
|
---|
| 61 | Parameters.Add(new ValueLookupParameter<IItem>("RightSide", "The right side of the comparison."));
|
---|
[3048] | 62 | Parameters.Add(new ValueParameter<Comparison>("Comparison", "The type of comparison.", new Comparison(Data.ComparisonType.Equal)));
|
---|
| 63 | Parameters.Add(new LookupParameter<BoolValue>("Result", "The result of the comparison."));
|
---|
[2757] | 64 | }
|
---|
| 65 |
|
---|
[4722] | 66 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 67 | return new Comparator(this, cloner);
|
---|
| 68 | }
|
---|
| 69 |
|
---|
[2834] | 70 | public override IOperation Apply() {
|
---|
[2757] | 71 | IItem left = LeftSideParameter.ActualValue;
|
---|
| 72 | IItem right = RightSideParameter.ActualValue;
|
---|
| 73 | IComparable comparable = left as IComparable;
|
---|
| 74 | if (comparable == null) throw new InvalidOperationException();
|
---|
| 75 |
|
---|
| 76 | int i = comparable.CompareTo(right);
|
---|
| 77 | bool b = false;
|
---|
| 78 | switch (Comparison.Value) {
|
---|
[3048] | 79 | case HeuristicLab.Data.ComparisonType.Less:
|
---|
[2757] | 80 | b = i < 0; break;
|
---|
[3048] | 81 | case HeuristicLab.Data.ComparisonType.LessOrEqual:
|
---|
[2757] | 82 | b = i <= 0; break;
|
---|
[3048] | 83 | case HeuristicLab.Data.ComparisonType.Equal:
|
---|
[2757] | 84 | b = i == 0; break;
|
---|
[3048] | 85 | case HeuristicLab.Data.ComparisonType.GreaterOrEqual:
|
---|
[2831] | 86 | b = i >= 0; break;
|
---|
[3048] | 87 | case HeuristicLab.Data.ComparisonType.Greater:
|
---|
[2757] | 88 | b = i > 0; break;
|
---|
[3048] | 89 | case HeuristicLab.Data.ComparisonType.NotEqual:
|
---|
[2757] | 90 | b = i != 0; break;
|
---|
| 91 | }
|
---|
[3048] | 92 | ResultParameter.ActualValue = new BoolValue(b);
|
---|
[2757] | 93 | return base.Apply();
|
---|
| 94 | }
|
---|
| 95 | }
|
---|
| 96 | }
|
---|