[mlpack-git] master: Minor tabbing fix; still testing gitdub. (eb9fb58)

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

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

On branch  : master
Link       : https://github.com/mlpack/mlpack/compare/904762495c039e345beba14c1142fd719b3bd50e...f94823c800ad6f7266995c700b1b630d5ffdcf40

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

commit eb9fb58ba12d236471e01458f9a5098992a38900
Author: ryan <ryan at ratml.org>
Date:   Sun Dec 21 21:31:51 2014 -0500

    Minor tabbing fix; still testing gitdub.


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

eb9fb58ba12d236471e01458f9a5098992a38900
 .../core/tree/rectangle_tree/x_tree_split.hpp      | 69 +++++++++++-----------
 1 file changed, 35 insertions(+), 34 deletions(-)

diff --git a/src/mlpack/core/tree/rectangle_tree/x_tree_split.hpp b/src/mlpack/core/tree/rectangle_tree/x_tree_split.hpp
index fb8b76f..850f6a5 100644
--- a/src/mlpack/core/tree/rectangle_tree/x_tree_split.hpp
+++ b/src/mlpack/core/tree/rectangle_tree/x_tree_split.hpp
@@ -33,44 +33,45 @@ template<typename DescentType,
          typename MatType>
 class XTreeSplit
 {
-public:
+ public:
+  /**
+   * Split a leaf node using the algorithm described in "The R*-tree: An
+   * Efficient and Robust Access method for Points and Rectangles."  If
+   * necessary, this split will propagate upwards through the tree.
+   */
+  static void SplitLeafNode(RectangleTree<XTreeSplit<DescentType, StatisticType, MatType>, DescentType, StatisticType, MatType>* tree, std::vector<bool>& relevels);
 
-/**
- * Split a leaf node using the algorithm described in "The R*-tree: An Efficient and Robust Access method
- * for Points and Rectangles."  If necessary, this split will propagate
- * upwards through the tree.
- */
-static void SplitLeafNode(RectangleTree<XTreeSplit<DescentType, StatisticType, MatType>, DescentType, StatisticType, MatType>* tree, std::vector<bool>& relevels);
+  /**
+   * Split a non-leaf node using the "default" algorithm.  If this is a root node, the
+   * tree increases in depth.
+   */
+  static bool SplitNonLeafNode(RectangleTree<XTreeSplit<DescentType, StatisticType, MatType>, DescentType, StatisticType, MatType>* tree, std::vector<bool>& relevels);
 
-/**
- * Split a non-leaf node using the "default" algorithm.  If this is a root node, the
- * tree increases in depth.
- */
-static bool SplitNonLeafNode(RectangleTree<XTreeSplit<DescentType, StatisticType, MatType>, DescentType, StatisticType, MatType>* tree, std::vector<bool>& relevels);
+ private:
+  /**
+   * Class to allow for faster sorting.
+   */
+  class sortStruct
+  {
+   public:
+    double d;
+    int n;
+  };
 
-private:
-/**
- * Class to allow for faster sorting.
- */
-class sortStruct {
-public:
-  double d;
-  int n;
-};
+  /**
+   * Comparator for sorting with sortStruct.
+   */
+  static bool structComp(const sortStruct& s1, const sortStruct& s2)
+  {
+    return s1.d < s2.d;
+  }
 
-/**
- * Comparator for sorting with sortStruct.
- */
-static bool structComp(const sortStruct& s1, const sortStruct& s2) {
-  return s1.d < s2.d;
-}
-
-/**
-  * Insert a node into another node.
-  */
-static void InsertNodeIntoTree(
-    RectangleTree<XTreeSplit<DescentType, StatisticType, MatType>, DescentType, StatisticType, MatType>* destTree,
-    RectangleTree<XTreeSplit<DescentType, StatisticType, MatType>, DescentType, StatisticType, MatType>* srcNode);
+  /**
+   * Insert a node into another node.
+   */
+  static void InsertNodeIntoTree(
+      RectangleTree<XTreeSplit<DescentType, StatisticType, MatType>, DescentType, StatisticType, MatType>* destTree,
+      RectangleTree<XTreeSplit<DescentType, StatisticType, MatType>, DescentType, StatisticType, MatType>* srcNode);
 
 };