#region License Information /* HeuristicLab * Copyright (C) Heuristic and Evolutionary Algorithms Laboratory (HEAL) * * This file is part of HeuristicLab. * * HeuristicLab is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * HeuristicLab is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with HeuristicLab. If not, see . */ #endregion using System; using System.Collections.Generic; using HeuristicLab.Common; using HeuristicLab.Core; using HEAL.Attic; namespace HeuristicLab.Algorithms.DataAnalysis { [StorableType("1D3FE1D5-E524-4DEC-B845-34C940F5BA61")] [Item("EuclideanDistance", "A norm function that uses Euclidean distance")] public class EuclideanDistance : DistanceBase> { #region HLConstructors & Cloning [StorableConstructor] protected EuclideanDistance(StorableConstructorFlag _) : base(_) { } protected EuclideanDistance(EuclideanDistance original, Cloner cloner) : base(original, cloner) { } public override IDeepCloneable Clone(Cloner cloner) { return new EuclideanDistance(this, cloner); } public EuclideanDistance() { } #endregion public static double GetDistance(IEnumerable point1, IEnumerable point2) { using (IEnumerator p1Enum = point1.GetEnumerator(), p2Enum = point2.GetEnumerator()) { var sum = 0.0; while (p1Enum.MoveNext() & p2Enum.MoveNext()) { var d = p1Enum.Current - p2Enum.Current; sum += d * d; } if (p1Enum.MoveNext() || p2Enum.MoveNext()) throw new ArgumentException("Euclidean distance not defined on vectors of different length"); return Math.Sqrt(sum); } } public override double Get(IEnumerable a, IEnumerable b) { return GetDistance(a, b); } } }