[mlpack-git] mlpack-1.0.x: Some clarification on the leaf size. (afb40c7)

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

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

On branch  : mlpack-1.0.x
Link       : https://github.com/mlpack/mlpack/compare/904762495c039e345beba14c1142fd719b3bd50e...f94823c800ad6f7266995c700b1b630d5ffdcf40

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

commit afb40c7cd1cc6dabe32ddf0c0ac4a286ab605c13
Author: Ryan Curtin <ryan at ratml.org>
Date:   Mon Jul 28 14:37:45 2014 +0000

    Some clarification on the leaf size.


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

afb40c7cd1cc6dabe32ddf0c0ac4a286ab605c13
 doc/tutorials/range_search/range_search.txt | 9 +++++----
 1 file changed, 5 insertions(+), 4 deletions(-)

diff --git a/doc/tutorials/range_search/range_search.txt b/doc/tutorials/range_search/range_search.txt
index 927cc99..3be6203 100644
--- a/doc/tutorials/range_search/range_search.txt
+++ b/doc/tutorials/range_search/range_search.txt
@@ -175,10 +175,11 @@ $ range_search -q query_dataset.csv -r reference_dataset.csv -n \
 
 @subsection cli_ex3_rstut One dataset, range [4.1 4.2], leaf size of 15 points
 
-The \b mlpack implementation of range search is a dual-tree method, meaning that
-the leaf size of the tree can be changed.  Depending on the characteristics of
-the dataset, a larger or smaller leaf size can provide faster computation.  The
-leaf size is modifiable through the command-line interface, as shown below.
+The \b mlpack implementation of range search is a dual-tree algorithm; when
+\f$kd\f$-trees are used, the leaf size of the tree can be changed.  Depending on
+the characteristics of the dataset, a larger or smaller leaf size can provide
+faster computation.  The leaf size is modifiable through the command-line
+interface, as shown below.
 
 @code
 $ range_search -r dataset.csv -n neighbors_out.csv -d distances_out.csv -m 4.1 \