[mlpack-git] master, mlpack-1.0.x: Inline the simple R tree descent heuristic. (304e256)

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

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

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

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

commit 304e25620760b51540901a3f64c5b96d52913428
Author: Ryan Curtin <ryan at ratml.org>
Date:   Wed Jun 11 20:23:37 2014 +0000

    Inline the simple R tree descent heuristic.


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

304e25620760b51540901a3f64c5b96d52913428
 src/mlpack/core/tree/rectangle_tree/r_tree_descent_heuristic_impl.hpp | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/mlpack/core/tree/rectangle_tree/r_tree_descent_heuristic_impl.hpp b/src/mlpack/core/tree/rectangle_tree/r_tree_descent_heuristic_impl.hpp
index 8ca04da..7c15a22 100644
--- a/src/mlpack/core/tree/rectangle_tree/r_tree_descent_heuristic_impl.hpp
+++ b/src/mlpack/core/tree/rectangle_tree/r_tree_descent_heuristic_impl.hpp
@@ -13,7 +13,7 @@
 namespace mlpack {
 namespace tree {
 
-double RTreeDescentHeuristic::EvalNode(const HRectBound<>& bound, const arma::vec& point)
+inline double RTreeDescentHeuristic::EvalNode(const HRectBound<>& bound, const arma::vec& point)
 {
   return bound.Contains(point) ? 0 : bound.MinDistance(point);
 }