[mlpack-git] master: Handle the k == 0 case without crashing. (c84287b)

gitdub at big.cc.gt.atl.ga.us gitdub at big.cc.gt.atl.ga.us
Fri Nov 20 17:33:28 EST 2015


Repository : https://github.com/mlpack/mlpack

On branch  : master
Link       : https://github.com/mlpack/mlpack/compare/962a37fe8374913c435054aa50e12d912bdfa01c...a7d8231fe7526dcfaadae0bf37d67b50d286e45d

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

commit c84287b2612018edf32ac1b3e67f8180bda1b3a3
Author: Ryan Curtin <ryan at ratml.org>
Date:   Fri Nov 20 21:36:17 2015 +0000

    Handle the k == 0 case without crashing.


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

c84287b2612018edf32ac1b3e67f8180bda1b3a3
 src/mlpack/methods/lsh/lsh_search_impl.hpp | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/src/mlpack/methods/lsh/lsh_search_impl.hpp b/src/mlpack/methods/lsh/lsh_search_impl.hpp
index 41de73b..8f6d167 100644
--- a/src/mlpack/methods/lsh/lsh_search_impl.hpp
+++ b/src/mlpack/methods/lsh/lsh_search_impl.hpp
@@ -291,6 +291,10 @@ Search(const size_t k,
   distances.fill(SortPolicy::WorstDistance());
   resultingNeighbors.fill(referenceSet->n_cols);
 
+  // If the user asked for 0 nearest neighbors... uh... we're done.
+  if (k == 0)
+    return;
+
   size_t avgIndicesReturned = 0;
 
   Timer::Start("computing_neighbors");



More information about the mlpack-git mailing list