[mlpack-git] master: We use C++11 now; update the comment. (661cf30)

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

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

On branch  : master
Link       : https://github.com/mlpack/mlpack/compare/fab25eaf7b9630076fd3b980e43a25363a936d28...b34381d94ec4d8f026a2954f8376b9df5a4d661d

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

commit 661cf304c1e339555a358b653674e83b77e4111f
Author: Ryan Curtin <ryan at ratml.org>
Date:   Mon Aug 31 15:25:45 2015 +0000

    We use C++11 now; update the comment.


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

661cf304c1e339555a358b653674e83b77e4111f
 src/mlpack/core/tree/tree_traits.hpp | 11 +++++------
 1 file changed, 5 insertions(+), 6 deletions(-)

diff --git a/src/mlpack/core/tree/tree_traits.hpp b/src/mlpack/core/tree/tree_traits.hpp
index ea701ab..44d5134 100644
--- a/src/mlpack/core/tree/tree_traits.hpp
+++ b/src/mlpack/core/tree/tree_traits.hpp
@@ -58,12 +58,11 @@ namespace tree {
  * parameter which allows that function to be called when the boolean is true.
  *
  * Each trait must be a static const value and not a function; only const values
- * can be used as template parameters (with the exception of constexprs, which
- * are a C++11 feature; but MLPACK is not using C++11).  By default (the
- * unspecialized implementation of TreeTraits), each parameter is set to make as
- * few assumptions about the tree as possible; so, even if TreeTraits is not
- * specialized for a particular tree type, tree-based algorithms should still
- * work.
+ * can be used as template parameters (or constexprs can be used too).  By
+ * default (the unspecialized implementation of TreeTraits), each parameter is
+ * set to make as few assumptions about the tree as possible; so, even if
+ * TreeTraits is not specialized for a particular tree type, tree-based
+ * algorithms should still work.
  *
  * When you write your own tree, you must specialize the TreeTraits class to
  * your tree type and set the corresponding values appropriately.  See