[mlpack-git] master: Remove unused file from other repository. (67a12fc)

[gitdub at mlpack.org]

Repository : https://github.com/mlpack/mlpack
On branch  : master
Link       : https://github.com/mlpack/mlpack/compare/04551164d9950dbdb3738f0c9d87e2d498fd8192...68018ae4eb4f579ff12e693515ce1ed03f81bf31

>---------------------------------------------------------------

commit 67a12fc40d94c35e99aa09301223ace82d499158
Author: Ryan Curtin <ryan at ratml.org>
Date:   Thu Nov 3 09:39:39 2016 -0400

    Remove unused file from other repository.


>---------------------------------------------------------------

67a12fc40d94c35e99aa09301223ace82d499158
 src/mlpack/methods/approx_kfn/qdafn_main.cpp | 103 ---------------------------
 1 file changed, 103 deletions(-)

diff --git a/src/mlpack/methods/approx_kfn/qdafn_main.cpp b/src/mlpack/methods/approx_kfn/qdafn_main.cpp
deleted file mode 100644
index bdb2dbe..0000000
--- a/src/mlpack/methods/approx_kfn/qdafn_main.cpp
+++ /dev/null
@@ -1,103 +0,0 @@
-/**
- * @file qdafn_main.cpp
- * @author Ryan Curtin
- *
- * Command-line program for the QDAFN algorithm.
- *
- * mlpack is free software; you may redistribute it and/or modify it under the
- * terms of the 3-clause BSD license.  You should have received a copy of the
- * 3-clause BSD license along with mlpack.  If not, see
- * http://www.opensource.org/licenses/BSD-3-Clause for more information.
- */
-#include <mlpack/core.hpp>
-#include "qdafn.hpp"
-#include <mlpack/methods/neighbor_search/neighbor_search.hpp>
-
-using namespace qdafn;
-using namespace mlpack;
-using namespace std;
-
-PROGRAM_INFO("Query-dependent approximate furthest neighbor search",
-    "This program implements the algorithm from the SISAP 2015 paper titled "
-    "'Approximate Furthest Neighbor in High Dimensions' by R. Pagh, F. "
-    "Silvestri, J. Sivertsen, and M. Skala.  Specify a reference set (set to "
-    "search in) with --reference_file, specify a query set (set to search for) "
-    "with --query_file, and specify algorithm parameters with --num_tables and "
-    "--num_projections (or don't, and defaults will be used).  Also specify "
-    "the number of points to search for with --k.  Each of those options has "
-    "short names too; see the detailed parameter documentation below."
-    "\n\n"
-    "Results for each query point are stored in the files specified by "
-    "--neighbors_file and --distances_file.  This is in the same format as the "
-    "mlpack KFN and KNN programs: each row holds the k distances or neighbor "
-    "indices for each query point.");
-
-PARAM_STRING_REQ("reference_file", "File containing reference points.", "r");
-PARAM_STRING_REQ("query_file", "File containing query points.", "q");
-
-PARAM_INT_REQ("k", "Number of furthest neighbors to search for.", "k");
-
-PARAM_INT("num_tables", "Number of hash tables to use.", "t", 10);
-PARAM_INT("num_projections", "Number of projections to use in each hash table.",
-    "p", 30);
-
-PARAM_STRING("neighbors_file", "File to save furthest neighbor indices to.",
-    "n", "");
-PARAM_STRING("distances_file", "File to save furthest neighbor distances to.",
-    "d", "");
-
-PARAM_FLAG("calculate_error", "If set, calculate the average distance error.",
-    "e");
-
-int main(int argc, char** argv)
-{
-  CLI::ParseCommandLine(argc, argv);
-
-  const string referenceFile = CLI::GetParam<string>("reference_file");
-  const string queryFile = CLI::GetParam<string>("query_file");
-  const size_t k = (size_t) CLI::GetParam<int>("k");
-  const size_t numTables = (size_t) CLI::GetParam<int>("num_tables");
-  const size_t numProjections = (size_t) CLI::GetParam<int>("num_projections");
-
-  // Load the data.
-  arma::mat referenceData, queryData;
-  data::Load(referenceFile, referenceData, true);
-  data::Load(queryFile, queryData, true);
-
-  // Construct the object.
-  Timer::Start("qdafn_construct");
-  QDAFN<> q(referenceData, numTables, numProjections);
-  Timer::Stop("qdafn_construct");
-
-  // Do the search.
-  arma::Mat<size_t> neighbors;
-  arma::mat distances;
-  Timer::Start("qdafn_search");
-  q.Search(queryData, k, neighbors, distances);
-  Timer::Stop("qdafn_search");
-
-  // Print the number of base cases.
-  Log::Info << "Total distance evaluations: " <<
-      (queryData.n_cols * numProjections) << "." << endl;
-
-  if (CLI::HasParam("calculate_error"))
-  {
-    neighbor::AllkFN kfn(referenceData);
-
-    arma::Mat<size_t> trueNeighbors;
-    arma::mat trueDistances;
-
-    kfn.Search(queryData, 1, trueNeighbors, trueDistances);
-
-    const double averageError = arma::sum(trueDistances / distances.row(0)) /
-        distances.n_cols;
-
-    Log::Info << "Average error: " << averageError << "." << endl;
-  }
-
-  // Save the results.
-  if (CLI::HasParam("neighbors_file"))
-    data::Save(CLI::GetParam<string>("neighbors_file"), neighbors);
-  if (CLI::HasParam("distances_file"))
-    data::Save(CLI::GetParam<string>("distances_file"), distances);
-}