[mlpack-git] master: Fix -Wunused warnings when using clang. (061f683)

[gitdub at mlpack.org]

Repository : https://github.com/mlpack/mlpack
On branch  : master
Link       : https://github.com/mlpack/mlpack/compare/448b5a86904abd266316eecc72eadc860825799d...d7287ac8851d399a1e94bf1b66ead70800c87cf4

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

commit 061f6833d7b0b61c55e808eb172ae022a2353ad4
Author: Marcus Edel <marcus.edel at fu-berlin.de>
Date:   Fri Jul 8 00:20:06 2016 +0200

    Fix -Wunused warnings when using clang.


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

061f6833d7b0b61c55e808eb172ae022a2353ad4
 src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp     | 2 +-
 .../core/tree/rectangle_tree/hilbert_r_tree_descent_heuristic_impl.hpp  | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp b/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp
index 2ad92bc..6495927 100644
--- a/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp
+++ b/src/mlpack/core/tree/rectangle_tree/discrete_hilbert_value_impl.hpp
@@ -318,7 +318,7 @@ void DiscreteHilbertValue<TreeElemType>::InsertNode(TreeType* node)
 template<typename TreeElemType>
 template<typename TreeType>
 void DiscreteHilbertValue<TreeElemType>::
-DeletePoint(TreeType* node, const size_t localIndex)
+DeletePoint(TreeType* /* node */, const size_t localIndex)
 {
 
   // Delete the Hilbert value from the local dataset
diff --git a/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_descent_heuristic_impl.hpp b/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_descent_heuristic_impl.hpp
index 471fafb..052d501 100644
--- a/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_descent_heuristic_impl.hpp
+++ b/src/mlpack/core/tree/rectangle_tree/hilbert_r_tree_descent_heuristic_impl.hpp
@@ -31,7 +31,7 @@ size_t HilbertRTreeDescentHeuristic::ChooseDescentNode(
 template<typename TreeType>
 size_t HilbertRTreeDescentHeuristic::ChooseDescentNode(
     const TreeType* node,
-    const TreeType* insertedNode)
+    const TreeType* /* insertedNode */)
 {
   size_t bestIndex = 0;