Update indentation

Author: nyalldawson

src/analysis/interpolation/DualEdgeTriangulation.h

@@ -98,6 +98,7 @@ class ANALYSIS_EXPORT DualEdgeTriangulation: public Triangulation
     virtual bool swapEdge( double x, double y ) override;
     //! Returns a value list with the numbers of the four points, which would be affected by an edge swap. This function is e.g. needed by NormVecDecorator to know the points, for which the normals have to be recalculated. The returned ValueList has to be deleted by the code which calls the method
     virtual QList<int>* getPointsAroundEdge( double x, double y ) override;
+
     /** Saves the triangulation as a (line) shapefile
     @return true in case of success*/
     virtual bool saveAsShapefile( const QString& fileName ) const override;

src/analysis/interpolation/NormVecDecorator.h

@@ -52,6 +52,7 @@ class ANALYSIS_EXPORT NormVecDecorator: public TriDecorator
     Vector3D* getNormal( int n ) const;
     //! Finds out, in which triangle a point with coordinates x and y is and assigns the triangle points to p1, p2, p3 and the estimated normals to v1, v2, v3. The vectors are normaly taken from 'mNormVec', exept if p1, p2 or p3 is a point on a breakline. In this case, the normal is calculated on-the-fly. Returns false, if something went wrong and true otherwise
     bool getTriangle( double x, double y, Point3D* p1, Vector3D* v1, Point3D* p2, Vector3D* v2, Point3D* p3, Vector3D* v3 );
+
     /** This function behaves similar to the one above. Additionally, the numbers of the points are returned (ptn1, ptn2, ptn3) as well as the pointStates of the triangle points (state1, state2, state3)
       * @note not available in Python bindings
      */
@@ -62,6 +63,7 @@ class ANALYSIS_EXPORT NormVecDecorator: public TriDecorator
     void setTriangleInterpolator( TriangleInterpolator* inter ) override;
     //! Swaps the edge which is closest to the point with x and y coordinates (if this is possible) and forces recalculation of the concerned normals (if alreadyestimated is true)
     virtual bool swapEdge( double x, double y ) override;
+
     /** Saves the triangulation as a (line) shapefile
       @return true in case of success*/
     virtual bool saveAsShapefile( const QString& fileName ) const override;

src/analysis/interpolation/ParametricLine.h

@@ -37,6 +37,7 @@ class ANALYSIS_EXPORT ParametricLine
   public:
     //! Default constructor
     ParametricLine();
+
     /** Constructor, par is a pointer to the parent object, controlpoly the controlpolygon
       */
     ParametricLine( ParametricLine* par, QVector<Point3D*>* controlpoly );

src/analysis/interpolation/qgsinterpolator.h

@@ -69,6 +69,7 @@ class ANALYSIS_EXPORT QgsInterpolator
     const QList<LayerData>& layerData() const { return mLayerData; }
 
   protected:
+
     /** Caches the vertex and value data from the provider. All the vertex data
      will be held in virtual memory
     @return 0 in case of success*/
@@ -84,6 +85,7 @@ class ANALYSIS_EXPORT QgsInterpolator
 
   private:
     QgsInterpolator(); //forbidden
+
     /** Helper method that adds the vertices of a geometry to the mCachedBaseData
        @param geom the geometry
        @param zCoord true if the z-coordinate of the geometry is to be interpolated

src/analysis/interpolation/qgstininterpolator.h

@@ -63,6 +63,7 @@ class ANALYSIS_EXPORT QgsTINInterpolator: public QgsInterpolator
 
     //! Create dual edge triangulation
     void initialize();
+
     /** Inserts the vertices of a feature into the triangulation
       @param f the feature
       @param zCoord true if the z coordinate is the interpolation attribute

src/analysis/network/qgsarcproperter.h

@@ -32,6 +32,7 @@
 class ANALYSIS_EXPORT QgsArcProperter
 {
   public:
+
     /**
      * default constructor
      */

src/analysis/network/qgsgraph.h

@@ -88,6 +88,7 @@ typedef QList< int > QgsGraphArcIdList;
 class ANALYSIS_EXPORT QgsGraphVertex
 {
   public:
+
     /**
      * default constructor. It need for QT's container, e.g. QVector
      */
@@ -134,6 +135,7 @@ class ANALYSIS_EXPORT QgsGraph
     QgsGraph();
 
     // begin graph constructing methods
+
     /**
      * add vertex to a grap
      */

src/analysis/network/qgsgraphanalyzer.h

@@ -31,6 +31,7 @@ class QgsGraph;
 class ANALYSIS_EXPORT QgsGraphAnalyzer
 {
   public:
+
     /**
      * solve shortest path problem using dijkstra algorithm
      * @param source The source graph

src/analysis/network/qgsgraphbuilder.h

@@ -36,6 +36,7 @@ class QgsGraph;
 class ANALYSIS_EXPORT QgsGraphBuilder : public QgsGraphBuilderInterface
 {
   public:
+
     /**
      * default constructor
      */

src/analysis/network/qgsgraphbuilderintr.h

@@ -34,6 +34,7 @@
 class ANALYSIS_EXPORT QgsGraphBuilderInterface
 {
   public:
+
     /**
      * QgsGraphBuilderInterface constructor
      * @param crs Coordinate reference system for new graph vertex