source: trunk/HeuristicLab.Algorithms.DataAnalysis/3.4/TSNE/Distances/IndexedItemDistance.cs

#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 <http://www.gnu.org/licenses/>.
 */
#endregion

using HeuristicLab.Collections;
using HeuristicLab.Common;
using HeuristicLab.Core;
using HEAL.Attic;

namespace HeuristicLab.Algorithms.DataAnalysis {
  [StorableType("D6D34B11-7618-4F8E-AFC3-3E42DAA1E38C")]
  [Item("IndexedItemDistance", "A distance wrapper for indexed items")]
  internal class IndexedItemDistance<T> : DistanceBase<IndexedItem<T>> {
    [Storable]
    private readonly IDistance<T> dist;

    #region HLConstructors & Cloning

    [StorableConstructor]
    protected IndexedItemDistance(StorableConstructorFlag _) : base(_) {
    }

    protected IndexedItemDistance(IndexedItemDistance<T> original, Cloner cloner) : base(original, cloner) {
      dist = cloner.Clone(original.dist);
    }
    public override IDeepCloneable Clone(Cloner cloner) { return new IndexedItemDistance<T>(this, cloner); }
    public IndexedItemDistance(IDistance<T> distance) {
      dist = distance;
    }
    #endregion

    public override double Get(IndexedItem<T> a, IndexedItem<T> b) {
      return dist.Get(a.Value, b.Value);
    }
  }
}