[mlpack-git] master: 80 columns max. (c2cf437)

[gitdub at big.cc.gt.atl.ga.us]

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

On branch  : master
Link       : https://github.com/mlpack/mlpack/compare/4a97187bbba7ce8a6191b714949dd818ef0f37d2...e5905e62c15d1bcff21e6359b11efcd7ab6d7ca0

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

commit c2cf437257a1cdac3f81731898864198c72261e6
Author: Ryan Curtin <ryan at ratml.org>
Date:   Fri Jul 10 22:57:42 2015 +0000

    80 columns max.


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

c2cf437257a1cdac3f81731898864198c72261e6
 src/mlpack/methods/neighbor_search/neighbor_search.hpp | 9 +++++----
 1 file changed, 5 insertions(+), 4 deletions(-)

diff --git a/src/mlpack/methods/neighbor_search/neighbor_search.hpp b/src/mlpack/methods/neighbor_search/neighbor_search.hpp
index 42054e8..038ea9a 100644
--- a/src/mlpack/methods/neighbor_search/neighbor_search.hpp
+++ b/src/mlpack/methods/neighbor_search/neighbor_search.hpp
@@ -154,10 +154,11 @@ class NeighborSearch
   /**
    * Search for the nearest neighbors of every point in the reference set.  This
    * is basically equivalent to calling any other overload of Search() with the
-   * reference set as the query set; so, this lets you do all-k-nearest-neighbors
-   * search.  The results are stored in the given matrices.  The matrices will
-   * be set to the size of n columns by k rows, where n is the number of points
-   * in the query dataset and k is the number of neighbors being searched for.
+   * reference set as the query set; so, this lets you do
+   * all-k-nearest-neighbors search.  The results are stored in the given
+   * matrices.  The matrices will be set to the size of n columns by k rows,
+   * where n is the number of points in the query dataset and k is the number of
+   * neighbors being searched for.
    *
    * @param k Number of neighbors to search for.
    * @param neighbors Matrix storing lists of neighbors for each query point.