Merge pull request #1116 from acxz/include-guards

examples/SFMdata.h

@@ -22,6 +22,8 @@
  * Passing function argument allows to specificy an initial position, a pose increment and step count.
  */
 
+#pragma once
+
 // As this is a full 3D problem, we will use Pose3 variables to represent the camera
 // positions and Point3 variables (x, y, z) to represent the landmark coordinates.
 // Camera observations of landmarks (i.e. pixel coordinates) will be stored as Point2 (x, y).
@@ -66,4 +68,4 @@ std::vector<gtsam::Pose3> createPoses(
   }
 
   return poses;
-}
+}

gtsam/discrete/DiscreteJunctionTree.h

@@ -16,6 +16,8 @@
  * @author Richard Roberts
  */
 
+#pragma once
+
 #include <gtsam/discrete/DiscreteFactorGraph.h>
 #include <gtsam/discrete/DiscreteBayesTree.h>
 #include <gtsam/inference/JunctionTree.h>

gtsam/geometry/Cyclic.h

@@ -15,6 +15,8 @@
  * @author Frank Dellaert
  **/
 
+#pragma once
+
 #include <gtsam/base/Group.h>
 #include <gtsam/base/Testable.h>
 

gtsam/linear/GaussianJunctionTree.h

@@ -16,6 +16,8 @@
  * @author Richard Roberts
  */
 
+#pragma once
+
 #include <gtsam/linear/GaussianFactorGraph.h>
 #include <gtsam/linear/GaussianBayesTree.h>
 #include <gtsam/inference/JunctionTree.h>

gtsam/linear/linearAlgorithms-inst.h

@@ -15,6 +15,8 @@
  * @author  Richard Roberts
  */
 
+#pragma once
+
 #include <gtsam/linear/VectorValues.h>
 #include <gtsam/linear/GaussianConditional.h>
 #include <gtsam/base/treeTraversal-inst.h>

gtsam/linear/tests/powerMethodExample.h

@@ -19,6 +19,8 @@
  * PowerMethod/AcceleratedPowerMethod
  */
 
+#pragma once
+
 #include <gtsam/inference/Symbol.h>
 
 #include <iostream>

gtsam/navigation/ConstantVelocityFactor.h

@@ -15,6 +15,8 @@
  * @author  Asa Hammond
  */
 
+#pragma once
+
 #include <gtsam/navigation/NavState.h>
 #include <gtsam/nonlinear/NonlinearFactor.h>
 

gtsam/navigation/MagFactor.h

@@ -16,6 +16,8 @@
  * @date   January 29, 2014
  */
 
+#pragma once
+
 #include <gtsam/nonlinear/NonlinearFactor.h>
 #include <gtsam/geometry/Rot2.h>
 #include <gtsam/geometry/Rot3.h>

gtsam/nonlinear/WhiteNoiseFactor.h

@@ -17,6 +17,8 @@
  * @date   September 2011
  */
 
+#pragma once
+
 #include <gtsam/nonlinear/NonlinearFactor.h>
 #include <gtsam/linear/HessianFactor.h>
 #include <cmath>

gtsam/nonlinear/internal/LevenbergMarquardtState.h

@@ -16,6 +16,8 @@
  * @date    April 2016
  */
 
+#pragma once
+
 #include "NonlinearOptimizerState.h"
 
 #include <gtsam/nonlinear/Values.h>

gtsam/sfm/TranslationRecovery.h

@@ -16,6 +16,8 @@
  * @brief Recovering translations in an epipolar graph when rotations are given.
  */
 
+#pragma once
+
 #include <map>
 #include <set>
 #include <utility>

gtsam/slam/TriangulationFactor.h

@@ -15,6 +15,8 @@
  * @author Frank Dellaert
  */
 
+#pragma once
+
 #include <gtsam/nonlinear/NonlinearFactor.h>
 #include <gtsam/geometry/CalibratedCamera.h>
 #include <boost/make_shared.hpp>

gtsam/symbolic/SymbolicJunctionTree.h

@@ -16,6 +16,8 @@
  * @author Richard Roberts
  */
 
+#pragma once
+
 #include <gtsam/symbolic/SymbolicFactorGraph.h>
 #include <gtsam/symbolic/SymbolicBayesTree.h>
 #include <gtsam/inference/JunctionTree.h>

gtsam_unstable/base/BTree.h

@@ -17,6 +17,8 @@
  * @date Feb 3, 2010
  */
 
+#pragma once
+
 #include <stack>
 #include <sstream>
 #include <boost/shared_ptr.hpp>

gtsam_unstable/base/Dummy.h

@@ -17,6 +17,8 @@
  * @date June 14, 2012
  */
 
+#pragma once
+
 #include <gtsam/global_includes.h>
 #include <gtsam_unstable/dllexport.h>
 #include <string>

gtsam_unstable/linear/ActiveSetSolver-inl.h

@@ -17,6 +17,8 @@
  * @date     2/11/16
  */
 
+#pragma once
+
 #include <gtsam_unstable/linear/InfeasibleInitialValues.h>
 
 /******************************************************************************/
@@ -283,4 +285,4 @@ Template std::pair<VectorValues, VectorValues> This::optimize() const {
 }
 
 #undef Template
-#undef This
+#undef This

gtsam_unstable/linear/LPSolver.h

@@ -17,6 +17,8 @@
  * @date     6/16/16
  */
 
+#pragma once
+
 #include <gtsam_unstable/linear/LP.h>
 #include <gtsam_unstable/linear/ActiveSetSolver.h>
 #include <gtsam_unstable/linear/LPInitSolver.h>

gtsam_unstable/linear/QPSolver.h

@@ -17,6 +17,8 @@
  * @date     6/16/16
  */
 
+#pragma once
+
 #include <gtsam_unstable/linear/QP.h>
 #include <gtsam_unstable/linear/ActiveSetSolver.h>
 #include <gtsam_unstable/linear/QPInitSolver.h>
@@ -45,4 +47,4 @@ struct QPPolicy {
 
 using QPSolver = ActiveSetSolver<QP, QPPolicy, QPInitSolver>;
 
-}
+}

gtsam_unstable/partition/FindSeparator.h

@@ -6,6 +6,8 @@
  *  Description: find the separator of bisectioning for a given graph
  */
 
+#pragma once
+
 #include <map>
 #include <vector>
 #include <boost/optional.hpp>

timing/timeSFMBAL.h

@@ -16,6 +16,8 @@
  * @date    July 5, 2015
  */
 
+#pragma once
+
 #include <gtsam/sfm/SfmData.h>
 #include <gtsam/slam/dataset.h>
 #include <gtsam/nonlinear/LevenbergMarquardtOptimizer.h>