1  #region License Information


2  /* HeuristicLab


3  * Copyright (C) 20022018 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.Collections;


23  using System.Collections.Generic;


24  using HeuristicLab.Core;


25 


26  namespace HeuristicLab.Algorithms.DataAnalysis {


27  public interface IDistance<in T> : IDistance {


28  /// <summary>


29  /// Calculates a distance measure between two objects.


30  /// 1.) nonnegative d(x,y) >= 0


31  /// 2.) symmetric d(x,y) = d(y,x)


32  /// 3.) zeroreflexive d(x,x) = 0;


33  /// </summary>


34  /// <returns>d(x,y)</returns>


35  double Get(T x, T y);


36 


37  /// <summary>


38  /// Returns a comparator wich compares the distances to item. (allows for sorting nearest/farthest neighbours)


39  /// </summary>


40  /// <param name="item"></param>


41  /// <returns></returns>


42  IComparer<T> GetDistanceComparer(T item);


43  }


44 


45 


46  public interface IDistance : IItem {


47  double Get(object x, object y);


48  IComparer GetDistanceComparer(object item);


49  }


50  }

