[14386] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[17180] | 3 | * Copyright (C) Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[14386] | 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.Collections.Generic;
|
---|
| 24 | using HeuristicLab.Common;
|
---|
| 25 | using HeuristicLab.Core;
|
---|
[16565] | 26 | using HEAL.Attic;
|
---|
[14386] | 27 |
|
---|
| 28 | namespace HeuristicLab.Algorithms.DataAnalysis {
|
---|
[16565] | 29 | [StorableType("65C04216-1441-41EE-91B7-A80B2AD5E332")]
|
---|
[14500] | 30 | [Item("ManhattanDistance", "A distance function that uses block distance")]
|
---|
| 31 | public class ManhattanDistance : DistanceBase<IEnumerable<double>> {
|
---|
[15207] | 32 | #region HLConstructors & Cloning
|
---|
[14386] | 33 | [StorableConstructor]
|
---|
[16565] | 34 | protected ManhattanDistance(StorableConstructorFlag _) : base(_) { }
|
---|
[14386] | 35 | [StorableHook(HookType.AfterDeserialization)]
|
---|
| 36 | private void AfterDeserialization() { }
|
---|
[14500] | 37 | protected ManhattanDistance(ManhattanDistance original, Cloner cloner)
|
---|
[14386] | 38 | : base(original, cloner) { }
|
---|
[14500] | 39 | public ManhattanDistance() { }
|
---|
[14386] | 40 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
[14500] | 41 | return new ManhattanDistance(this, cloner);
|
---|
[14386] | 42 | }
|
---|
| 43 | #endregion
|
---|
| 44 |
|
---|
[15532] | 45 | public static double GetDistance(IEnumerable<double> point1, IEnumerable<double> point2) {
|
---|
| 46 | using (IEnumerator<double> p1Enum = point1.GetEnumerator(), p2Enum = point2.GetEnumerator()) {
|
---|
| 47 | var sum = 0.0;
|
---|
| 48 | while (p1Enum.MoveNext() & p2Enum.MoveNext())
|
---|
| 49 | sum += Math.Abs(p1Enum.Current - p2Enum.Current);
|
---|
| 50 | if (p1Enum.MoveNext() || p2Enum.MoveNext()) throw new ArgumentException("Manhattan distance not defined on vectors of different length");
|
---|
| 51 | return sum;
|
---|
| 52 | }
|
---|
[14386] | 53 | }
|
---|
| 54 |
|
---|
| 55 | public override double Get(IEnumerable<double> a, IEnumerable<double> b) {
|
---|
[15532] | 56 | return GetDistance(a, b);
|
---|
[14386] | 57 | }
|
---|
| 58 | }
|
---|
[15532] | 59 | } |
---|