Minor cleanup before finishing up the distributed tree.

fastlib/trunk/contrib/dongryel/thesis_research/core/tree/general_spacetree.h

@@ -38,6 +38,10 @@ namespace core {
 namespace tree {
 template < class TreeSpecType >
 class GeneralBinarySpaceTree {
+  private:
+
+    friend class boost::serialization::access;
+
   public:
     typedef typename TreeSpecType::BoundType BoundType;
 
@@ -45,18 +49,12 @@ class GeneralBinarySpaceTree {
 
     typedef typename TreeSpecType::StatisticType StatisticType;
 
+  private:
+
     /** @brief The bound for the node.
      */
     BoundType bound_;
 
-    /** @brief The pointer to the left node.
-     */
-    boost::interprocess::offset_ptr<GeneralBinarySpaceTree> left_;
-
-    /** @brief The pointer to the right node.
-     */
-    boost::interprocess::offset_ptr<GeneralBinarySpaceTree> right_;
-
     /** @brief The beginning index.
      */
     int begin_;
@@ -69,7 +67,15 @@ class GeneralBinarySpaceTree {
      */
     StatisticType stat_;
 
-    friend class boost::serialization::access;
+    /** @brief The pointer to the left node.
+     */
+    boost::interprocess::offset_ptr<GeneralBinarySpaceTree> left_;
+
+    /** @brief The pointer to the right node.
+     */
+    boost::interprocess::offset_ptr<GeneralBinarySpaceTree> right_;
+
+  public:
 
     template<class Archive>
     void save(Archive &ar, const unsigned int version) const {
@@ -122,8 +128,6 @@ class GeneralBinarySpaceTree {
       count_ = -1;
     }
 
-  public:
-
     void Init(int begin_in, int count_in) {
       begin_ = begin_in;
       count_ = count_in;