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 System;
|
---|
23 | using HeuristicLab.Core;
|
---|
24 | using HeuristicLab.Data;
|
---|
25 | using HeuristicLab.Parameters;
|
---|
26 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
27 |
|
---|
28 | namespace HeuristicLab.Operators {
|
---|
29 | /// <summary>
|
---|
30 | /// An operator which compares two items.
|
---|
31 | /// </summary>
|
---|
32 | [Item("Comparator", "An operator which compares two items.")]
|
---|
33 | [EmptyStorableClass]
|
---|
34 | [Creatable("Test")]
|
---|
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 | }
|
---|
42 | private ValueParameter<ComparisonData> ComparisonParameter {
|
---|
43 | get { return (ValueParameter<ComparisonData>)Parameters["Comparison"]; }
|
---|
44 | }
|
---|
45 | public LookupParameter<BoolData> ResultParameter {
|
---|
46 | get { return (LookupParameter<BoolData>)Parameters["Result"]; }
|
---|
47 | }
|
---|
48 | public ComparisonData Comparison {
|
---|
49 | get { return ComparisonParameter.Value; }
|
---|
50 | set { ComparisonParameter.Value = value; }
|
---|
51 | }
|
---|
52 |
|
---|
53 | public Comparator()
|
---|
54 | : base() {
|
---|
55 | Parameters.Add(new LookupParameter<IItem>("LeftSide", "The left side of the comparison."));
|
---|
56 | Parameters.Add(new ValueLookupParameter<IItem>("RightSide", "The right side of the comparison."));
|
---|
57 | Parameters.Add(new ValueParameter<ComparisonData>("Comparison", "The type of comparison.", new ComparisonData()));
|
---|
58 | Parameters.Add(new LookupParameter<BoolData>("Result", "The result of the comparison."));
|
---|
59 | }
|
---|
60 |
|
---|
61 | public override IOperation Apply() {
|
---|
62 | IItem left = LeftSideParameter.ActualValue;
|
---|
63 | IItem right = RightSideParameter.ActualValue;
|
---|
64 | IComparable comparable = left as IComparable;
|
---|
65 | if (comparable == null) throw new InvalidOperationException();
|
---|
66 |
|
---|
67 | int i = comparable.CompareTo(right);
|
---|
68 | bool b = false;
|
---|
69 | switch (Comparison.Value) {
|
---|
70 | case HeuristicLab.Data.Comparison.Less:
|
---|
71 | b = i < 0; break;
|
---|
72 | case HeuristicLab.Data.Comparison.LessOrEqual:
|
---|
73 | b = i <= 0; break;
|
---|
74 | case HeuristicLab.Data.Comparison.Equal:
|
---|
75 | b = i == 0; break;
|
---|
76 | case HeuristicLab.Data.Comparison.GreaterOrEqual:
|
---|
77 | b = i >= 0; break;
|
---|
78 | case HeuristicLab.Data.Comparison.Greater:
|
---|
79 | b = i > 0; break;
|
---|
80 | case HeuristicLab.Data.Comparison.NotEqual:
|
---|
81 | b = i != 0; break;
|
---|
82 | }
|
---|
83 | ResultParameter.ActualValue = new BoolData(b);
|
---|
84 | return base.Apply();
|
---|
85 | }
|
---|
86 | }
|
---|
87 | }
|
---|