[mlpack-git] master: Dash pedantry. (a1662ef)

[gitdub at mlpack.org]

Repository : https://github.com/mlpack/mlpack
On branch  : master
Link       : https://github.com/mlpack/mlpack/compare/e4350fbe841da1b9187c6770c57e6037fa65052e...a1662ef23d326f48b2e7dd3f5a4231a12b29eb42

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

commit a1662ef23d326f48b2e7dd3f5a4231a12b29eb42
Author: Ryan Curtin <ryan at ratml.org>
Date:   Fri Feb 12 12:20:15 2016 -0800

    Dash pedantry.


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

a1662ef23d326f48b2e7dd3f5a4231a12b29eb42
 src/mlpack/core/optimizers/sgd/sgd.hpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/mlpack/core/optimizers/sgd/sgd.hpp b/src/mlpack/core/optimizers/sgd/sgd.hpp
index 767cc82..5e1705a 100644
--- a/src/mlpack/core/optimizers/sgd/sgd.hpp
+++ b/src/mlpack/core/optimizers/sgd/sgd.hpp
@@ -31,7 +31,7 @@ namespace optimization {
  * is chosen according to \f$ j \f$ (the iteration number).  The SGD class
  * supports either scanning through each of the \f$ n \f$ functions \f$ f_i(A)
  * \f$ linearly, or in a random sequence.  The algorithm continues until \f$ j
- * \f$ reaches the maximum number of iterations -- or when a full sequence of
+ * \f$ reaches the maximum number of iterations---or when a full sequence of
  * updates through each of the \f$ n \f$ functions \f$ f_i(A) \f$ produces an
  * improvement within a certain tolerance \f$ \epsilon \f$.  That is,
  *