[14414] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[15584] | 3 | * Copyright (C) 2002-2018 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[14414] | 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 |
|
---|
[15249] | 22 | using System.Collections;
|
---|
[14414] | 23 | using System.Collections.Generic;
|
---|
| 24 | using HeuristicLab.Common;
|
---|
| 25 | using HeuristicLab.Core;
|
---|
| 26 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 27 |
|
---|
[14512] | 28 | namespace HeuristicLab.Algorithms.DataAnalysis {
|
---|
[14414] | 29 | [StorableClass]
|
---|
| 30 | public abstract class DistanceBase<T> : Item, IDistance<T> {
|
---|
[15249] | 31 | #region HLConstructors & Cloning
|
---|
[14414] | 32 | [StorableConstructor]
|
---|
| 33 | protected DistanceBase(bool deserializing) : base(deserializing) { }
|
---|
| 34 | protected DistanceBase(DistanceBase<T> original, Cloner cloner) : base(original, cloner) { }
|
---|
| 35 | protected DistanceBase() { }
|
---|
| 36 | #endregion
|
---|
| 37 |
|
---|
| 38 | public abstract double Get(T a, T b);
|
---|
| 39 |
|
---|
| 40 | public IComparer<T> GetDistanceComparer(T item) {
|
---|
| 41 | return new DistanceComparer(item, this);
|
---|
| 42 | }
|
---|
| 43 |
|
---|
[15249] | 44 | public double Get(object x, object y) {
|
---|
[15571] | 45 | return Get((T) x, (T) y);
|
---|
[15249] | 46 | }
|
---|
| 47 |
|
---|
| 48 | public IComparer GetDistanceComparer(object item) {
|
---|
[15571] | 49 | return new DistanceComparer((T) item, this);
|
---|
[15249] | 50 | }
|
---|
| 51 |
|
---|
[15571] | 52 | internal class DistanceComparer : IComparer<T>, IComparer {
|
---|
[14414] | 53 | private readonly T item;
|
---|
| 54 | private readonly IDistance<T> dist;
|
---|
| 55 |
|
---|
| 56 | public DistanceComparer(T item, IDistance<T> dist) {
|
---|
| 57 | this.dist = dist;
|
---|
| 58 | this.item = item;
|
---|
| 59 | }
|
---|
| 60 |
|
---|
| 61 | public int Compare(T x, T y) {
|
---|
| 62 | return dist.Get(x, item).CompareTo(dist.Get(y, item));
|
---|
| 63 | }
|
---|
[15249] | 64 |
|
---|
| 65 | public int Compare(object x, object y) {
|
---|
[15571] | 66 | return Compare((T) x, (T) y);
|
---|
[15249] | 67 | }
|
---|
[14414] | 68 | }
|
---|
| 69 | }
|
---|
| 70 | } |
---|