1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 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 HeuristicLab.Collections;
|
---|
23 | using HeuristicLab.Common;
|
---|
24 | using HeuristicLab.Core;
|
---|
25 | using HEAL.Attic;
|
---|
26 |
|
---|
27 | namespace HeuristicLab.Algorithms.DataAnalysis {
|
---|
28 | [StorableType("D6D34B11-7618-4F8E-AFC3-3E42DAA1E38C")]
|
---|
29 | [Item("IndexedItemDistance", "A distance wrapper for indexed items")]
|
---|
30 | internal class IndexedItemDistance<T> : DistanceBase<IndexedItem<T>> {
|
---|
31 | [Storable]
|
---|
32 | private readonly IDistance<T> dist;
|
---|
33 |
|
---|
34 | #region HLConstructors & Cloning
|
---|
35 |
|
---|
36 | [StorableConstructor]
|
---|
37 | protected IndexedItemDistance(StorableConstructorFlag _) : base(_) {
|
---|
38 | }
|
---|
39 |
|
---|
40 | protected IndexedItemDistance(IndexedItemDistance<T> original, Cloner cloner) : base(original, cloner) {
|
---|
41 | dist = cloner.Clone(original.dist);
|
---|
42 | }
|
---|
43 | public override IDeepCloneable Clone(Cloner cloner) { return new IndexedItemDistance<T>(this, cloner); }
|
---|
44 | public IndexedItemDistance(IDistance<T> distance) {
|
---|
45 | dist = distance;
|
---|
46 | }
|
---|
47 | #endregion
|
---|
48 |
|
---|
49 | public override double Get(IndexedItem<T> a, IndexedItem<T> b) {
|
---|
50 | return dist.Get(a.Value, b.Value);
|
---|
51 | }
|
---|
52 | }
|
---|
53 | }
|
---|
54 |
|
---|