1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2016 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 System.Drawing;
|
---|
24 | using HeuristicLab.Common;
|
---|
25 | using HeuristicLab.Common.Resources;
|
---|
26 | using HeuristicLab.Core;
|
---|
27 | using HeuristicLab.Encodings.BinaryVectorEncoding;
|
---|
28 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
29 |
|
---|
30 | namespace HeuristicLab.Analysis.FitnessLandscape.DistanceCalculators {
|
---|
31 |
|
---|
32 | [Item("BinaryVectorDistanceCalculator", "Calculates the hamming distance of two binary vectors")]
|
---|
33 | [StorableClass]
|
---|
34 | public class BinaryVectorDistanceCalculator : NamedItem, IItemDistanceCalculator {
|
---|
35 |
|
---|
36 | #region Properties
|
---|
37 |
|
---|
38 | public override bool CanChangeName { get { return false; } }
|
---|
39 | public override bool CanChangeDescription { get { return false; } }
|
---|
40 | public static new Image StaticItemImage { get { return VSImageLibrary.Function; } }
|
---|
41 |
|
---|
42 | #endregion
|
---|
43 |
|
---|
44 | #region Construction & Cloning
|
---|
45 |
|
---|
46 | [StorableConstructor]
|
---|
47 | protected BinaryVectorDistanceCalculator(bool deserializing) : base(deserializing) { }
|
---|
48 |
|
---|
49 | protected BinaryVectorDistanceCalculator(BinaryVectorDistanceCalculator original, Cloner cloner)
|
---|
50 | : base(original, cloner) {
|
---|
51 | }
|
---|
52 |
|
---|
53 | public BinaryVectorDistanceCalculator() {
|
---|
54 | name = ItemName;
|
---|
55 | description = ItemDescription;
|
---|
56 | }
|
---|
57 |
|
---|
58 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
59 | return new BinaryVectorDistanceCalculator(this, cloner);
|
---|
60 | }
|
---|
61 |
|
---|
62 | #endregion
|
---|
63 |
|
---|
64 | #region IItemDistanceCalculator Members
|
---|
65 |
|
---|
66 | public Type ItemType {
|
---|
67 | get { return typeof(BinaryVector); }
|
---|
68 | }
|
---|
69 |
|
---|
70 | public double Distance(IItem x, IItem y) {
|
---|
71 | BinaryVector a = (BinaryVector)x;
|
---|
72 | BinaryVector b = (BinaryVector)y;
|
---|
73 | if (a.Length != b.Length)
|
---|
74 | throw new InvalidOperationException("Cannot compare vectors of different lengths");
|
---|
75 | double nEqualBits = 0;
|
---|
76 | for (int i = 0; i < a.Length; i++) {
|
---|
77 | if (a[i] == b[i])
|
---|
78 | nEqualBits++;
|
---|
79 | }
|
---|
80 | return Math.Max(a.Length, b.Length) - nEqualBits;
|
---|
81 | }
|
---|
82 |
|
---|
83 | #endregion
|
---|
84 | }
|
---|
85 | }
|
---|