1 files changed, 0 insertions, 68 deletions
diff --git a/src/de/lmu/ifi/dbs/elki/index/tree/query/GenericDistanceSearchCandidate.java b/src/de/lmu/ifi/dbs/elki/index/tree/query/GenericDistanceSearchCandidate.java
deleted file mode 100644
index 278dec60..00000000
--- a/src/de/lmu/ifi/dbs/elki/index/tree/query/GenericDistanceSearchCandidate.java
+++ /dev/null
@@ -1,68 +0,0 @@
-package de.lmu.ifi.dbs.elki.index.tree.query;
-
-/*
- This file is part of ELKI:
- Environment for Developing KDD-Applications Supported by Index-Structures
-
- Copyright (C) 2013
- Ludwig-Maximilians-Universität München
- Lehr- und Forschungseinheit für Datenbanksysteme
- ELKI Development Team
-
- This program is free software: you can redistribute it and/or modify
- it under the terms of the GNU Affero General Public License as published by
- the Free Software Foundation, either version 3 of the License, or
- (at your option) any later version.
-
- This program 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 Affero General Public License for more details.
-
- You should have received a copy of the GNU Affero General Public License
- along with this program.  If not, see <http://www.gnu.org/licenses/>.
- */
-
-import de.lmu.ifi.dbs.elki.distance.distancevalue.Distance;
-
-/**
- * Candidate for expansion in a distance search (generic implementation).
- * 
- * @author Erich Schubert
- * 
- * @param <D> Distance type
- */
-public class GenericDistanceSearchCandidate<D extends Distance<D>> implements Comparable<GenericDistanceSearchCandidate<D>> {
-  /**
-   * Distance value
-   */
-  public D mindist;
-
-  /**
-   * Page id
-   */
-  public int nodeID;
-
-  /**
-   * Constructor.
-   * 
-   * @param mindist The minimum distance to this candidate
-   * @param pagenr The page number of this candidate
-   */
-  public GenericDistanceSearchCandidate(final D mindist, final int pagenr) {
-    super();
-    this.mindist = mindist;
-    this.nodeID = pagenr;
-  }
-
-  @Override
-  public boolean equals(Object obj) {
-    final GenericDistanceSearchCandidate<?> other = (GenericDistanceSearchCandidate<?>) obj;
-    return this.nodeID == other.nodeID;
-  }
-
-  @Override
-  public int compareTo(GenericDistanceSearchCandidate<D> o) {
-    return this.mindist.compareTo(o.mindist);
-  }
-}
-\ No newline at end of file