Uniformity and several typo fixes

Mostly removing superflous double whitespace on both user-facing and non-user-facing strings. Some misc. typo fixes sprinkled in as well.

Common/Core/Testing/Cxx/UnitTestMath.cxx

@@ -268,7 +268,7 @@ int TestDegreesFromRadians()
           result, floatDegrees,
           std::numeric_limits<float>::epsilon()*128.0f))
     {
-      std::cout << "Float  Expected " << floatDegrees
+      std::cout << "Float Expected " << floatDegrees
                 << " but got " << result
                 << " difference is " << result - floatDegrees << " ";
       std::cout << "eps ratio is: " << (result - floatDegrees)
@@ -1127,7 +1127,7 @@ int Norm()
           unitNorm, (T) 1.0,
           std::numeric_limits<T>::epsilon()*(T)128.0))
     {
-      std::cout << "Norm  Expected " << 1.0
+      std::cout << "Norm Expected " << 1.0
                 << " but got " << unitNorm;
       std::cout << " eps ratio is: " <<  ((T) 1.0 - unitNorm)
         / std::numeric_limits<T>::epsilon() << std::endl;

Common/Core/vtkArray.h

@@ -140,7 +140,7 @@ public:
    * Returns the number of values stored in the array.  Note that this is
    * the same as calling GetExtents().GetSize(), and represents the
    * maximum number of values that could ever be stored using the current
-   * extents.  This is equal to the number of values stored in a  dense
+   * extents.  This is equal to the number of values stored in a dense
    * array, but may be larger than the number of values stored in a
    * sparse array.
    */

Common/Core/vtkMath.h

@@ -262,7 +262,7 @@ public:
   static double Random();
 
   /**
-   * Generate  pseudo-random numbers distributed according to the uniform
+   * Generate pseudo-random numbers distributed according to the uniform
    * distribution between \a min and \a max.
 
    * DON'T USE Random(), RandomSeed(), GetSeed(), Gaussian()
@@ -290,7 +290,7 @@ public:
   static double Gaussian();
 
   /**
-   * Generate  pseudo-random numbers distributed according to the Gaussian
+   * Generate pseudo-random numbers distributed according to the Gaussian
    * distribution with mean \a mean and standard deviation \a std.
 
    * DON'T USE Random(), RandomSeed(), GetSeed(), Gaussian()

Common/Core/vtkMinimalStandardRandomSequence.h

@@ -16,7 +16,7 @@
  * @brief   Park and Miller Sequence of pseudo random numbers
  *
  * vtkMinimalStandardRandomSequence is a sequence of statistically independent
- * pseudo random numbers uniformly distributed  between 0.0 and 1.0.
+ * pseudo random numbers uniformly distributed between 0.0 and 1.0.
  *
  * The sequence is generated by a prime modulus multiplicative linear
  * congruential generator (PMMLCG) or "Lehmer generator" with multiplier 16807

Common/Core/vtkScalarsToColors.cxx

@@ -1546,7 +1546,7 @@ void vtkScalarsToColors::MapScalarsThroughTable2(
 // The callForAnyType is used to write generic code that works with any
 // vtkDataArray derived types.
 //
-// This  macro calls a template function (on the data type stored in the
+// This macro calls a template function (on the data type stored in the
 // array).  Example usage:
 //   callForAnyType(array, myFunc(static_cast<VTK_TT*>(data), arg2));
 // where 'array' is a vtkDataArray and

Common/Core/vtkSetGet.h

@@ -460,7 +460,7 @@ extern VTKCOMMONCORE_EXPORT void vtkOutputWindowDisplayDebugText(const char*);
       vtkmsg.rdbuf()->freeze(0);}}
 
 //
-// This macro is used for  debug statements in instance methods
+// This macro is used for debug statements in instance methods
 // vtkDebugMacro(<< "this is debug info" << this->SomeVariable);
 //
 #define vtkDebugMacro(x) \

Common/Core/vtkSparseArray.h

@@ -29,7 +29,7 @@
  * complete set of coordinates and the value for each non-null value in the array.
  * While this approach requires slightly more storage than other sparse storage
  * schemes (such as Compressed-Row or Compressed-Column), it is easier and more
- * efficient to work with when implementing algorithms, and  it generalizes well
+ * efficient to work with when implementing algorithms, and it generalizes well
  * for arbitrary numbers of dimensions.
  *
  * In addition to the value retrieval and update methods provided by vtkTypedArray,

Common/Core/vtkWindow.cxx

@@ -18,7 +18,7 @@
 
 
 //-----------------------------------------------------------------------------
-// Construct an instance of  vtkRenderWindow with its screen size
+// Construct an instance of vtkRenderWindow with its screen size
 // set to 300x300, borders turned on, positioned at (0,0), double
 // buffering turned on.
 vtkWindow::vtkWindow()

Common/DataModel/Testing/Cxx/TestPolyDataRemoveCell.cxx

@@ -143,7 +143,7 @@ int TestPolyDataRemoveCell(int , char *[])
     {
       if(pts[j] != data[j+1])
       {
-        cout << "Problem with  point " << j << " for cell " << i << endl;
+        cout << "Problem with point " << j << " for cell " << i << endl;
         return 1;
       }
     }

Common/DataModel/vtkBiQuadraticQuad.h

@@ -33,7 +33,7 @@
  * vtkQuadraticQuad
  *
  * @par Thanks:
- * Thanks to Soeren Gebbert  who developed this class and
+ * Thanks to Soeren Gebbert who developed this class and
  * integrated it into VTK 5.0.
 */
 

Common/DataModel/vtkBiQuadraticQuadraticHexahedron.cxx

@@ -13,7 +13,7 @@
 
 =========================================================================*/
 
-//Thanks to Soeren Gebbert  who developed this class and
+//Thanks to Soeren Gebbert who developed this class and
 //integrated it into VTK 5.0.
 
 #include "vtkBiQuadraticQuadraticHexahedron.h"

Common/DataModel/vtkBiQuadraticQuadraticWedge.cxx

@@ -13,7 +13,7 @@
 
 =========================================================================*/
 
-//Thanks to Soeren Gebbert  who developed this class and
+//Thanks to Soeren Gebbert who developed this class and
 //integrated it into VTK 5.0.
 
 #include "vtkBiQuadraticQuadraticWedge.h"

Common/DataModel/vtkBiQuadraticQuadraticWedge.h

@@ -34,7 +34,7 @@
  * vtkQuadraticHexahedron vtkQuadraticQuad vtkQuadraticPyramid
  *
  * @par Thanks:
- * Thanks to Soeren Gebbert  who developed this class and
+ * Thanks to Soeren Gebbert who developed this class and
  * integrated it into VTK 5.0.
 */
 

Common/DataModel/vtkBoundingBox.h

@@ -85,7 +85,7 @@ public:
   //@{
   /**
    * Set the maximum point of the bounding box - if the max point
-   * is less than the min point then the  min point will also be changed.
+   * is less than the min point then the min point will also be changed.
    */
   void SetMaxPoint(double x, double y, double z);
   void SetMaxPoint(double p[3]);

Common/DataModel/vtkDataObjectTreeIterator.h

@@ -119,7 +119,7 @@ protected:
   // preorder fashion.
   // If the current location is a composite dataset, next is its 1st child dataset.
   // If the current is not a composite dataset, then next is the next dataset.
-  // This method gives no guarantees  whether the current dataset will be
+  // This method gives no guarantees whether the current dataset will be
   // non-null or leaf.
   void NextInternal();
 

Common/DataModel/vtkDataSetAttributes.h

@@ -454,7 +454,7 @@ public:
    * has been invoked before using this method. When copying a field,
    * the following copying rules are
    * followed: 1) Check if a field is an attribute, if yes and if there
-   * is a COPYTUPLE copy flag for that attribute (on or off), obey the  flag
+   * is a COPYTUPLE copy flag for that attribute (on or off), obey the flag
    * for that attribute, ignore (2) and (3), 2) if there is a copy field for
    * that field (on or off), obey the flag, ignore (3) 3) obey
    * CopyAllOn/Off

Common/DataModel/vtkFieldData.h

@@ -348,7 +348,7 @@ public:
   void InsertTuple(const vtkIdType i, const vtkIdType j, vtkFieldData* source);
 
   /**
-   * Insert the jth tuple in source field data  at the end of the
+   * Insert the jth tuple in source field data at the end of the
    * tuple matrix. Range checking is performed and memory is allocated
    * as necessary.
    */

Common/DataModel/vtkGenericCellTessellator.h

@@ -116,7 +116,7 @@ public:
   //@{
   /**
    * Specify the list of error metrics used to decide if an edge has to be
-   * splitted or not. It is a collection of vtkGenericSubdivisionErrorMetric-s.
+   * split or not. It is a collection of vtkGenericSubdivisionErrorMetric-s.
    */
   virtual void SetErrorMetrics(vtkCollection *someErrorMetrics);
   vtkGetObjectMacro(ErrorMetrics,vtkCollection);

Common/DataModel/vtkHyperTree.cxx

@@ -768,7 +768,7 @@ public:
     // Compute memory used in kibibytes (1024 bytes)
     unsigned int mem = static_cast<unsigned int>( size / 1024 );
 
-    // Return  upper bound of 1 kiB if footprint is smaller
+    // Return upper bound of 1 kiB if footprint is smaller
     return ( mem ? mem : 1 );
   }
 

Common/DataModel/vtkHyperTree.h

@@ -126,7 +126,7 @@
  *
  * @par Thanks:
  * This class was written by Philippe Pebay, Joachim Pouderoux, and Charles Law, Kitware 2013
- * This class was modified by Guenole Harel and  Jacques-Bernard Lekien 2014
+ * This class was modified by Guenole Harel and Jacques-Bernard Lekien 2014
  * This class was modified by Philippe Pebay, 2016
  * This work was supported by Commissariat a l'Energie Atomique (CEA/DIF)
 */

Common/DataModel/vtkHyperTreeGrid.h

@@ -576,7 +576,7 @@ public:
                                          unsigned int& );
 
   /**
-   * Convert the Cartesian coordinates of a root in the grid  to its global index.
+   * Convert the Cartesian coordinates of a root in the grid to its global index.
    */
   void GetIndexFromLevelZeroCoordinates( vtkIdType&,
                                          unsigned int,

Common/DataModel/vtkIncrementalOctreeNode.cxx

@@ -243,7 +243,7 @@ void vtkIncrementalOctreeNode::SeperateExactlyDuplicatePointsFromNewInsertion
 {
   // the number of points already maintained in this leaf node
   // >= maxPts AND all of them are exactly duplicate with one another
-  //           BUT the new point is  not a duplicate of them any more
+  //           BUT the new point is not a duplicate of them any more
 
   int         i;
   double      dupPnt[3];
@@ -333,10 +333,10 @@ int vtkIncrementalOctreeNode::CreateChildNodes
   //
   // (1) the number of points already maintained in this leaf node
   //     == maxPts AND not all of them are exactly duplicate
-  //               AND the new point is  not a duplicate of them all
+  //               AND the new point is not a duplicate of them all
   // (2) the number of points already maintained in this leaf node
   //     >= maxPts AND all of them are exactly duplicate with one another
-  //               BUT the new point is  not a duplicate of them any more
+  //               BUT the new point is not a duplicate of them any more
 
   // address case (2) first if necessary
   double    sample[3];

Common/DataModel/vtkIncrementalOctreePointLocator.h

@@ -270,7 +270,7 @@ public:
    * Return the id of the already inserted point if true, otherwise return -1.
    * InitPointInsertion() should have been called in advance.
    */
-  vtkIdType IsInsertedPoint( double x, double  y, double z ) override;
+  vtkIdType IsInsertedPoint( double x, double y, double z ) override;
 
   /**
    * Insert a point to the octree unless there has been a duplciate point.

Common/DataModel/vtkIncrementalPointLocator.h

@@ -97,7 +97,7 @@ public:
    * the already inserted point if true, else return -1. InitPointInsertion()
    * should have been called in advance.
    */
-  virtual vtkIdType IsInsertedPoint( double x, double  y, double z ) = 0;
+  virtual vtkIdType IsInsertedPoint( double x, double y, double z ) = 0;
 
   /**
    * Determine whether or not a given point has been inserted. Return the id of

Common/DataModel/vtkIterativeClosestPointTransform.h

@@ -77,7 +77,7 @@ public:
 
   //@{
   /**
-   * Set/Get the  maximum number of iterations. Default is 50.
+   * Set/Get the maximum number of iterations. Default is 50.
    */
   vtkSetMacro(MaximumNumberOfIterations, int);
   vtkGetMacro(MaximumNumberOfIterations, int);

Common/DataModel/vtkKdTree.h

@@ -298,7 +298,7 @@ public:
    * the cell lists for all regions are created.
 
    * When CreateCellLists is called again, the lists created
-   * on the previous call  are deleted.
+   * on the previous call are deleted.
    */
 
   void CreateCellLists(int dataSetIndex, int *regionReqList,
@@ -348,7 +348,7 @@ public:
   /**
 
    * For a list of regions, get two cell lists.  The first lists
-   * the IDs  all cells whose centroids lie in one of the regions.
+   * the IDs all cells whose centroids lie in one of the regions.
    * The second lists the IDs of all cells that intersect the regions,
    * but whose centroid lies in a region not on the list.
 

Common/DataModel/vtkMergePoints.h

@@ -44,7 +44,7 @@ public:
    * -1.
    */
   vtkIdType IsInsertedPoint(const double x[3]) override;
-  vtkIdType IsInsertedPoint(double x, double  y, double z) override
+  vtkIdType IsInsertedPoint(double x, double y, double z) override
     {return this->vtkPointLocator::IsInsertedPoint(x, y, z); };
   //@}
 

Common/DataModel/vtkMultiBlockDataSet.h

@@ -19,7 +19,7 @@
  *
  * vtkMultiBlockDataSet is a vtkCompositeDataSet that stores
  * a hierarchy of datasets. The dataset collection consists of
- * multiple blocks. Each  block can itself be a vtkMultiBlockDataSet, thus
+ * multiple blocks. Each block can itself be a vtkMultiBlockDataSet, thus
  * providing for a full tree structure.
  * Sub-blocks are usually used to distribute blocks across processors.
  * For example, a 1 block dataset can be distributed as following:

Common/DataModel/vtkPointLocator.h

@@ -153,7 +153,7 @@ public:
    * Return id of previously inserted point if this is true, otherwise return
    * -1. This method is thread safe.
    */
-  vtkIdType IsInsertedPoint(double x, double  y, double z) override
+  vtkIdType IsInsertedPoint(double x, double y, double z) override
   {
     double xyz[3];
     xyz[0] = x; xyz[1] = y; xyz[2] = z;

Common/DataModel/vtkPolyData.h

@@ -249,7 +249,7 @@ public:
 
   /**
    * Create data structure that allows random access of cells. BuildCells is
-   * expensive but necessary to make use of the faster  non-virtual implementations
+   * expensive but necessary to make use of the faster non-virtual implementations
    * of GetCell/GetCellPoints. One may check if cells need to be built via
    * NeedToBuilds before invoking. Cells always need to be built/re-built after
    * low level direct modifications to verts, lines, polys or strips cell arrays.

Common/DataModel/vtkPolygon.cxx

@@ -95,7 +95,7 @@ bool vtkPolygon::IsConvex()
 // Compute the polygon normal from a points list, and a list of point ids
 // that index into the points list. Parameter pts can be nullptr, indicating that
 // the polygon indexing is {0, 1, ..., numPts-1}. This version will handle
-// non-convex  polygons.
+// non-convex polygons.
 void vtkPolygon::ComputeNormal(vtkPoints *p, int numPts, vtkIdType *pts,
                                double *n)
 {
@@ -1725,7 +1725,7 @@ int vtkPolygon::Triangulate(int vtkNotUsed(index), vtkIdList *ptIds,
 // system and projects vectors into 3D model coordinate system.
 // Note that the results are usually inaccurate because
 // this method actually returns the derivative of the interpolation
-// function  which  is obtained using 1/r**2 normalized sum.
+// function which is obtained using 1/r**2 normalized sum.
 #define VTK_SAMPLE_DISTANCE 0.01
 void vtkPolygon::Derivatives(int vtkNotUsed(subId), double pcoords[3],
                              double *values, int dim, double *derivs)

Common/DataModel/vtkPolygon.h

@@ -265,7 +265,7 @@ protected:
   // Helper methods for triangulation------------------------------
   /**
    * A fast triangulation method. Uses recursive divide and
-   * conquer based on plane splitting  to reduce loop into triangles.
+   * conquer based on plane splitting to reduce loop into triangles.
    * The cell (e.g., triangle) is presumed properly initialized (i.e.,
    * Points and PointIds).
    */
@@ -273,7 +273,7 @@ protected:
 
   /**
    * A fast triangulation method. Uses recursive divide and
-   * conquer based on plane splitting  to reduce loop into triangles.
+   * conquer based on plane splitting to reduce loop into triangles.
    * The cell (e.g., triangle) is presumed properly initialized (i.e.,
    * Points and PointIds). Unlike EarCutTriangulation(), vertices are visited
    * sequentially without preference to angle.

Common/DataModel/vtkPolyhedron.cxx

@@ -1483,7 +1483,7 @@ void vtkPolyhedron::ConstructLocator()
 
   this->ConstructPolyData();
 
-  // With the polydata set up, we can assign it to the  locator
+  // With the polydata set up, we can assign it to the locator
   this->CellLocator->Initialize();
   this->CellLocator->SetDataSet(this->PolyData);
   this->CellLocator->BuildLocator();

Common/DataModel/vtkQuadraticLinearWedge.cxx

@@ -13,7 +13,7 @@
 
 =========================================================================*/
 
-//Thanks to Soeren Gebbert  who developed this class and
+//Thanks to Soeren Gebbert who developed this class and
 //integrated it into VTK 5.0.
 
 #include "vtkQuadraticLinearWedge.h"

Common/DataModel/vtkQuadraticLinearWedge.h

@@ -32,7 +32,7 @@
  * vtkQuadraticHexahedron vtkQuadraticQuad vtkQuadraticPyramid
  *
  * @par Thanks:
- * Thanks to Soeren Gebbert  who developed this class and
+ * Thanks to Soeren Gebbert who developed this class and
  * integrated it into VTK 5.0.
 */
 
@@ -73,7 +73,7 @@ public:
 
   //@{
   /**
-   * The quadratic linear wege is splitted into 4 linear wedges,
+   * The quadratic linear wedge is split into 4 linear wedges,
    * each of them is contoured by a provided scalar value
    */
   void Contour (double value, vtkDataArray * cellScalars,

Common/DataModel/vtkRectilinearGrid.h

@@ -185,7 +185,7 @@ public:
   /**
    * Different ways to set the extent of the data array.  The extent
    * should be set before the "Scalars" are set or allocated.
-   * The Extent is stored  in the order (X, Y, Z).
+   * The Extent is stored in the order (X, Y, Z).
    */
   void SetExtent(int extent[6]);
   void SetExtent(int x1, int x2, int y1, int y2, int z1, int z2);

Common/DataModel/vtkSmoothErrorMetric.h

@@ -63,7 +63,7 @@ public:
    * Set the flatness threshold with an angle in degrees. Internally
    * compute the cosine. value is supposed to be in ]90,180[, if not
    * it is clamped in [90.1,179.9].
-   * For instance 178  will give better result than 150.
+   * For instance 178 will give better result than 150.
    */
   void SetAngleTolerance(double value);
 

Common/DataModel/vtkStructuredGrid.h

@@ -126,7 +126,7 @@ public:
   /**
    * Different ways to set the extent of the data array.  The extent
    * should be set before the "Scalars" are set or allocated.
-   * The Extent is stored  in the order (X, Y, Z).
+   * The Extent is stored in the order (X, Y, Z).
    */
   void SetExtent(int extent[6]);
   void SetExtent(int x1, int x2, int y1, int y2, int z1, int z2);

Common/DataModel/vtkTriQuadraticHexahedron.cxx

@@ -13,7 +13,7 @@
 
 =========================================================================*/
 
-//Thanks to Soeren Gebbert  who developed this class and
+//Thanks to Soeren Gebbert who developed this class and
 //integrated it into VTK 5.0.
 
 #include "vtkTriQuadraticHexahedron.h"

Common/DataModel/vtkTriQuadraticHexahedron.h

@@ -64,7 +64,7 @@
  * vtkBiQuadraticQuad
  *
  * @par Thanks:
- * Thanks to Soeren Gebbert  who developed this class and
+ * Thanks to Soeren Gebbert who developed this class and
  * integrated it into VTK 5.0.
 */
 

Common/DataModel/vtkUniformGridAMR.h

@@ -99,7 +99,7 @@ public:
   vtkUniformGrid* GetDataSet(unsigned int level, unsigned int idx);
 
   // Description:
-  // Retrieves the composite index  associated with the data at the given
+  // Retrieves the composite index associated with the data at the given
   // (level,index) pair.
   int GetCompositeIndex( const unsigned int level, const unsigned int index );
 

Common/ExecutionModel/vtkAlgorithm.h

@@ -794,7 +794,7 @@ protected:
    * this signature. This will override the connection id that the
    * user set in SetInputArrayToProcess() with the connection id
    * passed. This way, the user specifies one array to process and
-   * that information is  used to obtain arrays for all the connection
+   * that information is used to obtain arrays for all the connection
    * on the port with the appropriate connection id substituted.
    */
   vtkDataArray *GetInputArrayToProcess(int idx,
@@ -828,7 +828,7 @@ protected:
    * this signature. This will override the connection id that the
    * user set in SetInputArrayToProcess() with the connection id
    * passed. This way, the user specifies one array to process and
-   * that information is  used to obtain arrays for all the connection
+   * that information is used to obtain arrays for all the connection
    * on the port with the appropriate connection id substituted.
    */
   vtkAbstractArray *GetInputAbstractArrayToProcess(int idx,

Common/ExecutionModel/vtkImageAlgorithm.h

@@ -17,7 +17,7 @@
  * @brief   Generic algorithm superclass for image algs
  *
  * vtkImageAlgorithm is a filter superclass that hides much of the
- * pipeline  complexity. It handles breaking the pipeline execution
+ * pipeline complexity. It handles breaking the pipeline execution
  * into smaller extents so that the vtkImageData limits are observed. It
  * also provides support for multithreading. If you don't need any of this
  * functionality, consider using vtkSimpleImageToImageFilter instead.

Common/Math/Testing/Cxx/TestQuaternion.cxx

@@ -187,7 +187,7 @@ int TestQuaternionConjugationAndInversion() //this test uses vtkQuaternionf
   int retVal = 0;
 
   //
-  // Test conjugate and inverse  at the same time.
+  // Test conjugate and inverse at the same time.
   // [inv(q) = conj(q)/norm2(q)]
   vtkQuaternionf toConjugate(2.0f);
   vtkQuaternionf conjugate = toConjugate.Conjugated();

Common/Math/vtkAmoebaMinimizer.h

@@ -175,7 +175,7 @@ public:
 
   //@{
   /**
-   * Return the number of interations that have been performed.  This
+   * Return the number of iterations that have been performed.  This
    * is not necessarily the same as the number of function evaluations.
    */
   vtkGetMacro(Iterations,int);

Common/Math/vtkFunctionSet.h

@@ -19,7 +19,7 @@
  * vtkFunctionSet specifies an abstract interface for set of functions
  * of the form F_i = F_i(x_j) where F (with i=1..m) are the functions
  * and x (with j=1..n) are the independent variables.
- * The only supported operation is the  function evaluation at x_j.
+ * The only supported operation is the function evaluation at x_j.
  *
  * @sa
  * vtkImplicitDataSet vtkInterpolatedVelocityField

Common/Math/vtkPolynomialSolversUnivariate.cxx

@@ -337,7 +337,7 @@ inline double vtkNormalizePolyCoeff( double d, double* div = nullptr )
 // Does not store Q and stores -R instead of R. This premultiplies Ai by mul and
 // then divides mR by div. mR MUST have at least the size of m+1, because it is
 // used as temporary storage besides as the return value.
-// This shouldn't be too  much slower than the version without mul and div. It
+// This shouldn't be too much slower than the version without mul and div. It
 // has to copy mul*Ai into mR at the beginning. So it has m+1 extra
 // multiplications and assignments. When it assigns final values into mR it
 // divides by div. So it has deg(mR) extra divisions.

Common/System/vtkSocket.h

@@ -62,7 +62,7 @@ public:
   int Receive(void* data, int length, int readFully=1);
 
   /**
-   * Provides access to  the internal socket descriptor. This is valid only when
+   * Provides access to the internal socket descriptor. This is valid only when
    * GetConnected() returns true.
    */
   vtkGetMacro(SocketDescriptor, int);

Common/System/vtkTimerLog.cxx

@@ -376,7 +376,7 @@ vtkTimerLogEntry::LogEntryType vtkTimerLog::GetEventType(int idx)
 
 //----------------------------------------------------------------------------
 // Write the timing table out to a file.  Calculate some helpful
-// statistics (deltas and  percentages) in the process.
+// statistics (deltas and percentages) in the process.
 void vtkTimerLog::DumpLogWithIndents(ostream *os, double threshold)
 {
 #ifndef _WIN32_WCE

Common/System/vtkTimerLog.h

@@ -116,7 +116,7 @@ public:
   //@{
   /**
    * Write the timing table out to a file.  Calculate some helpful
-   * statistics (deltas and  percentages) in the process.
+   * statistics (deltas and percentages) in the process.
    */
   static void DumpLog(const char *filename);
   //@}

Examples/Infovis/Cxx/CustomLinkView/CustomLinkView.h

@@ -17,7 +17,7 @@
 //
 // .SECTION Description
 // CustomLinkView shows an alternate way to link various views using
-// vtkEventQtSlotConnect where selection  in a particular view sets
+// vtkEventQtSlotConnect where selection in a particular view sets
 // the same selection in all other views associated.
 
 // Other way to get the same functionality is by using vtkAnnotationLink

Filters/AMR/vtkAMRResampleFilter.cxx

@@ -1297,7 +1297,7 @@ bool vtkAMRResampleFilter::IsParallel()
 vtkUniformGrid* vtkAMRResampleFilter::GetReferenceGrid(
     vtkOverlappingAMR *amrds)
 {
-  assert( "pre:AMR dataset is  nullptr" && (amrds != nullptr) );
+  assert( "pre:AMR dataset is nullptr" && (amrds != nullptr) );
 
   unsigned int numLevels = amrds->GetNumberOfLevels();
   for(unsigned int l=0; l < numLevels; ++l )