Skip to content

v0.2.52..v0.2.53 changeset RTreeNode.h

Garret Voltz edited this page Feb 12, 2020 · 1 revision
diff --git a/tgs/src/main/cpp/tgs/RStarTree/RTreeNode.h b/tgs/src/main/cpp/tgs/RStarTree/RTreeNode.h
index 8b97edc..a718d43 100644
--- a/tgs/src/main/cpp/tgs/RStarTree/RTreeNode.h
+++ b/tgs/src/main/cpp/tgs/RStarTree/RTreeNode.h
@@ -22,7 +22,7 @@
  * This will properly maintain the copyright information. DigitalGlobe
  * copyrights will be updated automatically.
  *
- * @copyright Copyright (C) 2015, 2017, 2018, 2019 DigitalGlobe (http://www.digitalglobe.com/)
+ * @copyright Copyright (C) 2015, 2017, 2018, 2019, 2020 DigitalGlobe (http://www.digitalglobe.com/)
  */
 
 #ifndef __TGS__RTREE_NODE_H__
@@ -88,6 +88,7 @@ public:
   Box toBox() const;
 
 private:
+
   friend class RTreeNode;
 
   BoxInternalData(int dimensions, const char* data);
@@ -98,7 +99,6 @@ private:
 
 };
 
-
 inline double BoxInternalData::getLowerBoundRaw(int d) const
 {
   const double* v = (const double*)_data;
@@ -111,7 +111,6 @@ inline double BoxInternalData::getUpperBoundRaw(int d) const
   return v[d * 2 + 1];
 }
 
-
 /**
  * This class is filled with yucky pointer math. If you aren't "old school" you probably want
  * to turn tail and run.
@@ -122,6 +121,7 @@ inline double BoxInternalData::getUpperBoundRaw(int d) const
 class TGS_EXPORT RTreeNode
 {
 public:
+
   virtual ~RTreeNode();
 
   /**
@@ -237,6 +237,7 @@ public:
   void updateChild(int childIndex, int id, const Box& b);
 
 private:
+
   friend class RTreeNodeStore;
   friend class RTreeNodeTest;
 
@@ -276,8 +277,6 @@ private:
 
   static int _getHeaderSize() { return sizeof(Header); }
 
-
-
   int _maxChildCount;
   int _dimensions;
   mutable std::shared_ptr<Page> _pageSp;
Clone this wiki locally