Typos: source and comments

Found via `codespell`

CMake/CTestCustom.cmake.in

@@ -194,12 +194,12 @@ SET(CTEST_CUSTOM_WARNING_EXCEPTION
 
   # warnings from some Eigen headers:
   #
-  # Eigin has so many warnings using individual suppresions
+  # Eigin has so many warnings using individual suppressions
   # does not work. So many will be suppressed that it exceeds
   # the limit ctest will show making it difficult to see
   # the specifics of an unsuppressed warning unless you have
   # access to the raw build logs. So we suppress everything
-  # that has eigin in the path. The old suppresions are left
+  # that has eigin in the path. The old suppressions are left
   # commented below should they be needed.
   "[Ee]igen/src/.* note:"
   "[Ee]igen/src/.* warning:"

CMake/vtkMobileDevices.cmake

@@ -1,4 +1,4 @@
-# some specific defaults for Andriod to give folks
+# some specific defaults for Android to give folks
 # a reasonable starting point
 if (ANDROID OR APPLE_IOS)
   set(CMAKE_REQUIRE_LARGE_FILE_SUPPORT 2 CACHE STRING "Result from TRY_RUN" FORCE)

CMake/vtkPythonWrapping.cmake

@@ -228,7 +228,7 @@ endfunction()
 
 #------------------------------------------------------------------------------
 # create init header for all python wrapped modules.
-# this uses VTK_PYTHON_WRAPPED global property which is filled with every pyhton
+# this uses VTK_PYTHON_WRAPPED global property which is filled with every python
 # module.
 # Usage: vtk_write_python_modules_header_for_wrapped_modules(
 #           <filename> <out_variable>)

CMake/vtkTargetLinkLibrariesWithDynamicLookup.cmake

@@ -10,7 +10,7 @@
 # library.
 #
 # Specifically, for OSX it uses undefined dynamic_lookup. This is
-# simular to using "-shared" on Linux where undefined symbols are
+# similar to using "-shared" on Linux where undefined symbols are
 # ignored.
 #
 # Additionally, the linker is checked to see if it supports undefined

Charts/Core/vtkPiecewiseFunctionItem.h

@@ -22,7 +22,7 @@
 class vtkPiecewiseFunction;
 class vtkImageData;
 
-/// vtkPiecewiseFunctionItem internall uses vtkPlot::Color, white by default
+/// vtkPiecewiseFunctionItem internal uses vtkPlot::Color, white by default
 class VTKCHARTSCORE_EXPORT vtkPiecewiseFunctionItem: public vtkScalarsToColorsItem
 {
 public:

Charts/Core/vtkScatterPlotMatrix.cxx

@@ -203,7 +203,7 @@ class vtkScatterPlotMatrix::PIMPL
   vtkVector2i                NextActivePlot;
 
   vtkNew<vtkChartXYZ> BigChart3D;
-  vtkNew<vtkAxis>     TestAxis;   // Used to get ranges/numer of ticks
+  vtkNew<vtkAxis>     TestAxis;   // Used to get ranges/number of ticks
   vtkSmartPointer<vtkTooltipItem> TooltipItem;
   vtkSmartPointer<vtkStringArray> IndexedLabelsArray;
 };

Common/Core/Testing/Cxx/TestCxxFeatures.cxx

@@ -295,7 +295,7 @@ int TestNonTypeTemplate()
 
 //----------------------------------------------------------------------------
 
-/* Test mixed type and non-type template arguments in a non-trival way.  */
+/* Test mixed type and non-type template arguments in a non-trivial way.  */
 
 #if !(defined(__BORLANDC__) && (__BORLANDC__ < 0x660))
 // Borland does not support this fancy array template.

Common/Core/Testing/Python/TestVariant.py

@@ -159,7 +159,7 @@ def testVariantExtract(self):
     def testHash(self):
         """Use a variant as a dict key"""
         d = {}
-        # doubles, ints, srings, all hash as strings
+        # doubles, ints, strings, all hash as strings
         d[vtk.vtkVariant(1.0)] = 'double'
         d[vtk.vtkVariant(1)] = 'int'
         self.assertEqual(d[vtk.vtkVariant('1')], 'int')

Common/DataModel/Testing/Cxx/TestPlane.cxx

@@ -140,7 +140,7 @@ int TestPlane(int,char *[])
     arrayOutput->SetNumberOfTuples(nPoints);
 
     std::cout << "Testing FunctionValue:\n";
-    // calcuate function values with the vtkDataArray interface
+    // calculate function values with the vtkDataArray interface
     plane->FunctionValue(input, arrayOutput);
 
     //Calculate the same points using a loop over points.

Common/DataModel/vtkAbstractElectronicData.h

@@ -64,14 +64,14 @@ class VTKCOMMONDATAMODEL_EXPORT vtkAbstractElectronicData : public vtkDataObject
    */
   vtkImageData * GetLUMO() {return this->GetMO(this->GetLUMOOrbitalNumber());}
 
-  // Descripition:
+  // Description:
   // Returns the orbital number of the Highest Occupied Molecular Orbital.
   vtkIdType GetHOMOOrbitalNumber()
   {
     return static_cast<vtkIdType>((this->GetNumberOfElectrons() / 2 ) - 1);
   }
 
-  // Descripition:
+  // Description:
   // Returns the orbital number of the Lowest Unoccupied Molecular Orbital.
   vtkIdType GetLUMOOrbitalNumber()
   {

Common/DataModel/vtkAngularPeriodicDataArray.h

@@ -19,7 +19,7 @@
  * periodic array
  *
  *
- * Map an array into a periodic array. Data from the original array aare
+ * Map an array into a periodic array. Data from the original array are
  * rotated (on the fly) by the specified angle along the specified axis
  * around the specified point. Lookup is not implemented.
  * Creating the array is virtually free, accessing a tuple require some

Common/DataModel/vtkAnimationScene.h

@@ -21,7 +21,7 @@
  * animates with time, while vtkAnimationScene represents scene or setup
  * for the animation, which consists of individual cues or other scenes.
  *
- * A scene can be played in real time mode, or as a seqence of frames
+ * A scene can be played in real time mode, or as a sequence of frames
  * 1/frame rate apart in time.
  * @sa
  * vtkAnimationCue

Common/DataModel/vtkBoundingBox.cxx

@@ -233,7 +233,7 @@ void vtkBoundingBox::Inflate()
 // ---------------------------------------------------------------------------
 int vtkBoundingBox::IntersectBox(const vtkBoundingBox &bbox)
 {
-  // if either box is not valid don't do the opperation
+  // if either box is not valid don't do the operation
   if (!(this->IsValid() && bbox.IsValid()))
   {
     return 0;

Common/DataModel/vtkDataArrayDispatcher.h

@@ -20,7 +20,7 @@
  * vtkDataArrayDispatcher is a class that allows calling a functor based
  * on the data type of the vtkDataArray subclass. This is a wrapper
  * around the vtkTemplateMacro (VTK_TT) to allow easier implementation and
- * readibility, while at the same time the ability to use statefull functors.
+ * readability, while at the same time the ability to use statefull functors.
  *
  * Note: By default the return type is void.
  * Note: The functor parameter must be of type vtkDataArrayDispatcherPointer

Common/DataModel/vtkFieldData.cxx

@@ -838,7 +838,7 @@ void vtkFieldData::SetNumberOfTuples(const vtkIdType number)
 //----------------------------------------------------------------------------
 // Set the jth tuple in source field data at the ith location.
 // Set operations
-// mean that no range chaecking is performed, so they're faster.
+// means that no range checking is performed, so they're faster.
 void vtkFieldData::SetTuple(const vtkIdType i, const vtkIdType j,
   vtkFieldData* source)
 {

Common/DataModel/vtkImageData.cxx

@@ -2223,7 +2223,7 @@ void *vtkImageData::GetArrayPointer(vtkDataArray* array, int coordinate[3])
   }
 
   const int* extent = this->Extent;
-  // error checking: since most acceses will be from pointer arithmetic.
+  // error checking: since most accesses will be from pointer arithmetic.
   // this should not waste much time.
   for (idx = 0; idx < 3; ++idx)
   {

Common/DataModel/vtkKdTree.h

@@ -209,7 +209,7 @@ class VTKCOMMONDATAMODEL_EXPORT vtkKdTree : public vtkLocator
   //@}
 
   /**
-   * Get the number of data sets included in spatial paritioning
+   * Get the number of data sets included in spatial partitioning
    */
   int GetNumberOfDataSets();
 

Common/DataModel/vtkPeriodicDataArray.h

@@ -19,7 +19,7 @@
  * periodic array
  *
  *
- * Map an array into a periodic array. Data from the original array aare
+ * Map an array into a periodic array. Data from the original array are
  * rotated (on the fly) by the specified angle along the specified axis
  * around the specified point. Lookup is not implemented.
  * Creating the array is virtually free, accessing a tuple require some

Common/DataModel/vtkPolyData.cxx

@@ -41,7 +41,7 @@ vtkStandardNewMacro(vtkPolyData);
 //----------------------------------------------------------------------------
 // Initialize static member.  This member is used to simplify traversal
 // of verts, lines, polygons, and triangle strips lists.  It basically
-// "marks" empty lists so that the traveral method "GetNextCell"
+// "marks" empty lists so that the traversal method "GetNextCell"
 // works properly.
 
 struct vtkPolyDataDummyContainter

Common/DataModel/vtkPolyLine.cxx

@@ -103,7 +103,7 @@ int vtkPolyLine::GenerateSlidingNormals(vtkPoints *pts, vtkCellArray *lines,
     vtkVector3d sPrev, sNext;
 
     sNextId = FindNextValidSegment(pts, linePts, 0);
-    if (sNextId != npts) // atleast one valid segment
+    if (sNextId != npts) // at least one valid segment
     {
       vtkVector3d pt1, pt2;
       pts->GetPoint(linePts->GetId(sNextId), pt1.GetData());

Common/DataModel/vtkPolyPlane.cxx

@@ -111,7 +111,7 @@ void vtkPolyPlane::ComputeNormals()
     this->Normals->SetName("Normals");
     this->Normals->SetNumberOfTuples(nLines);
 
-    // Now interate through all the lines and compute normal of each plane
+    // Now iterate through all the lines and compute normal of each plane
     // in the polyplane.
 
     double v1[3], p[3], n[3];

Common/DataModel/vtkPolygon.h

@@ -99,7 +99,7 @@ class VTKCOMMONDATAMODEL_EXPORT vtkPolygon : public vtkCell
   //@{
   /**
    * Computes the unit normal to the polygon. If pts=nullptr, point indexing is
-   * assummed to be {0, 1, ..., numPts-1}.
+   * assumed to be {0, 1, ..., numPts-1}.
    */
   static void ComputeNormal(vtkPoints *p, int numPts, vtkIdType *pts,
                             double n[3]);
@@ -124,7 +124,7 @@ class VTKCOMMONDATAMODEL_EXPORT vtkPolygon : public vtkCell
   //@{
   /**
    * Determine whether or not a polygon is convex. If pts=nullptr, point indexing
-   * is assummed to be {0, 1, ..., numPts-1}.
+   * is assumed to be {0, 1, ..., numPts-1}.
    */
   static bool IsConvex(vtkPoints *p, int numPts, vtkIdType *pts);
   static bool IsConvex(vtkIdTypeArray *ids, vtkPoints *p);

Common/DataModel/vtkPolyhedron.cxx

@@ -1359,7 +1359,7 @@ the *unwanted* triangulation instead of the desired one because it prioritizes t
 inner angles close to 60 degrees, even though it then ends with a triangle with a very large
 internal angle (up to 180 degrees).
 
-Therefore the preffered approach is to triangulate a polygon using a fan triangulation that gives the smallest
+Therefore the preferred approach is to triangulate a polygon using a fan triangulation that gives the smallest
 range of internal angles. This approach will always choose to triangulate starting at (6) in the
 example given above. If (6) is moved out-of-plane as it were (see TestPolyhedron5.cxx) then the
 tetrahedralization gives a face triangulation that includes the edge (1)-(4), but triangulates the face

Common/DataModel/vtkReebGraphSimplificationMetric.h

@@ -40,7 +40,7 @@
  *
  *
  * See Graphics/Testing/Cxx/TestReebGraph.cxx for an example of concrete
- * implemetnation.
+ * implementation.
 */
 
 #ifndef vtkReebGraphSimplificationMetric_h

Common/DataModel/vtkStructuredExtent.h

@@ -42,7 +42,7 @@ class VTKCOMMONDATAMODEL_EXPORT vtkStructuredExtent : public vtkObject
   static void Clamp(int ext[6], const int wholeExt[]);
 
   /**
-   * Returns true if \c ext is fits within \c wholeExt with atleast 1 dimension
+   * Returns true if \c ext is fits within \c wholeExt with at least 1 dimension
    * smaller than the \c wholeExt.
    */
   static bool StrictlySmaller(const int ext[6], const int wholeExt[6]);

Common/DataModel/vtkTriangle.cxx

@@ -69,7 +69,7 @@ double vtkTriangle::ComputeArea()
 
 //----------------------------------------------------------------------------
 // Create a new cell and copy this triangle's information into the cell.
-// Returns a poiner to the new cell created.
+// Returns a pointer to the new cell created.
 int vtkTriangle::EvaluatePosition(double x[3], double* closestPoint,
                                  int& subId, double pcoords[3],
                                  double& dist2, double *weights)
@@ -1014,7 +1014,7 @@ int CoplanarTrianglesIntersect(double p1[2], double q1[2], double r1[2],
                                double p2[2], double q2[2], double r2[2])
 {
   // Determine whether or not triangle T1 = (p1,q1,r1) intersects triangle
-  // T2 = (p2,q2,r2), assumming that they are coplanar. This method is adapted
+  // T2 = (p2,q2,r2), assuming that they are coplanar. This method is adapted
   // from Olivier Devillers, Philippe Guigue. Faster Triangle-Triangle
   // Intersection Tests. RR-4488, IN-RIA. 2002. <inria-00072100>
 

Common/ExecutionModel/vtkCachedStreamingDemandDrivenPipeline.cxx

@@ -238,7 +238,7 @@ ::ExecuteData(vtkInformation* request,
     return 0;
   }
 
-  // first do the ususal thing
+  // first do the usual thing
   int result = this->Superclass::ExecuteData(request, inInfoVec, outInfoVec);
 
   // then save the newly generated data

Common/ExecutionModel/vtkDataSetAlgorithm.h

@@ -22,7 +22,7 @@
  * class you should be aware of. This class defaults such that your filter
  * will have one input port and one output port. If that is not the case
  * simply change it with SetNumberOfInputPorts etc. See this classes
- * contstructor for the default. This class also provides a FillInputPortInfo
+ * constructor for the default. This class also provides a FillInputPortInfo
  * method that by default says that all inputs will be DataSet. If that isn't
  * the case then please override this method in your subclass. This class
  * breaks out the downstream requests into separate functions such as

Common/ExecutionModel/vtkExecutive.h

@@ -71,7 +71,7 @@ class VTKCOMMONEXECUTIONMODEL_EXPORT vtkExecutive : public vtkObject
    * through which the request was made and the resulting modified
    * time.  Note that unlike ProcessRequest the request information
    * object may be nullptr for this method.  It also does not contain a
-   * request identifcation key because the request is known from the
+   * request identification key because the request is known from the
    * method name.
    */
   virtual int

Common/ExecutionModel/vtkPassInputTypeAlgorithm.h

@@ -22,7 +22,7 @@
  * class you should be aware of. This class defaults such that your filter
  * will have one input port and one output port. If that is not the case
  * simply change it with SetNumberOfInputPorts etc. See this classes
- * contstructor for the default. This class also provides a FillInputPortInfo
+ * constructor for the default. This class also provides a FillInputPortInfo
  * method that by default says that all inputs will be DataObject. If that isn't
  * the case then please override this method in your subclass. This class
  * breaks out the downstream requests into separate functions such as

Common/ExecutionModel/vtkPointSetAlgorithm.h

@@ -22,7 +22,7 @@
  * class you should be aware of. This class defaults such that your filter
  * will have one input port and one output port. If that is not the case
  * simply change it with SetNumberOfInputPorts etc. See this classes
- * contstructor for the default. This class also provides a FillInputPortInfo
+ * constructor for the default. This class also provides a FillInputPortInfo
  * method that by default says that all inputs will be PointSet. If that
  * isn't the case then please override this method in your subclass.
  * You should implement the subclass's algorithm into

Common/ExecutionModel/vtkSimpleScalarTree.cxx

@@ -76,7 +76,7 @@ void vtkSimpleScalarTree::Initialize()
 
 //-----------------------------------------------------------------------------
 // Construct the scalar tree from the dataset provided. Checks build times
-// and modified time from input and reconstructs the tree if necessaery.
+// and modified time from input and reconstructs the tree if necessary.
 void vtkSimpleScalarTree::BuildTree()
 {
   vtkIdType cellId, i, j, numScalars;

Common/ExecutionModel/vtkSpanSpace.cxx

@@ -288,7 +288,7 @@ void vtkSpanSpace::Initialize()
 //-----------------------------------------------------------------------------
 // Construct the scalar tree / span space from the dataset
 // provided. Checks build times and modified time from input and
-// reconstructs the tree if necessaery.
+// reconstructs the tree if necessary.
 void vtkSpanSpace::BuildTree()
 {
   vtkIdType numCells;

Filters/AMR/vtkAMRResampleFilter.cxx

@@ -220,7 +220,7 @@ bool vtkAMRResampleFilter::FoundDonor(
 {
   assert( "pre: donor grid is nullptr" && (donorGrid != nullptr) );
   double gbounds[6];
-  // Lets do a trival spatial check
+  // Lets do a trivial spatial check
   this->NumberOfBlocksTested++;
   donorGrid->GetBounds(gbounds);
   if ((q[0] < gbounds[0]) || (q[0] > gbounds[1]) ||

Filters/Core/vtkDelaunay3D.cxx

@@ -760,7 +760,7 @@ int vtkDelaunay3D::RequestData(
 // tetrahedronalizations of points. Its purpose is construct an initial
 // Delaunay triangulation into which to inject other points. You must
 // specify the center of a cubical bounding box and its length, as well
-// as the numer of points to insert. The method returns a pointer to
+// as the number of points to insert. The method returns a pointer to
 // an unstructured grid. Use this pointer to manipulate the mesh as
 // necessary. You must delete (with Delete()) the mesh when done.
 // Note: This initialization method places points forming bounding octahedron

Filters/Core/vtkHull.cxx

@@ -146,7 +146,7 @@ int vtkHull::AddPlane( double plane[3] )
 }
 
 // Set a specific plane - this plane should already have been added with
-// AddPlane, and the return value then used to modifiy the plane normal
+// AddPlane, and the return value then used to modify the plane normal
 // with this method.
 void vtkHull::SetPlane( int i, double A, double B, double C )
 {

Filters/General/vtkDiscreteFlyingEdgesClipper2D.cxx

@@ -264,7 +264,7 @@ class vtkDiscreteClipperAlgorithm
   unsigned char GetConnectivityLength(unsigned char caseNum)
     { return this->VertCases[caseNum][1]; }
 
-  // Return wether an interior vertex is required for a particular case.
+  // Return whether an interior vertex is required for a particular case.
   unsigned char GetInteriorVertex(unsigned char caseNum)
     { return this->VertCases[caseNum][2]; }
 
@@ -394,7 +394,7 @@ class vtkDiscreteClipperAlgorithm
                            vtkImageData *input, int *updateExt);
 };
 
-// The case table is formated: (numPolys, connectityLen, centerPoint,
+// The case table is formatted: (numPolys, connectityLen, centerPoint,
 // vi,vj,vk, vi,vj,vk, ...) referring to the pixel corner points [0,3];
 // points generated on pixel edges [10,13]; and possibly the pixel center
 // point (100) to define polygons. The case number is determined by combining

Filters/General/vtkImageMarchingCubes.cxx

@@ -731,7 +731,7 @@ void vtkImageMarchingCubes::IncrementLocatorZ()
 // (1,1,1)->(0,1,1): 6,  (0,1,1)->(0,0,1): 7,
 // (0,0,0)->(0,0,1): 8,  (1,0,0)->(1,0,1): 9,
 // (0,1,0)->(0,1,1): 10, (1,1,0)->(1,1,1): 11.
-// Shared edges are computed internaly. (no error checking)
+// Shared edges are computed internally. (no error checking)
 void vtkImageMarchingCubes::AddLocatorPoint(int cellX, int cellY, int edge,
                                             vtkIdType ptId)
 {

Filters/Hybrid/vtkEarthSource.cxx

@@ -6922,7 +6922,7 @@ int vtkEarthSource::RequestData(
   }
 
   //
-  // Update ourselves and release memeory
+  // Update ourselves and release memory
   //
   output->SetPoints(newPoints);
   newPoints->Delete();

Filters/Hybrid/vtkProjectedTerrainPath.h

@@ -81,7 +81,7 @@ class VTKFILTERSHYBRID_EXPORT vtkProjectedTerrainPath : public vtkPolyDataAlgori
 public:
   //@{
   /**
-   * Standard methids for printing and determining type information.
+   * Standard methods for printing and determining type information.
    */
   vtkTypeMacro(vtkProjectedTerrainPath,vtkPolyDataAlgorithm);
   void PrintSelf(ostream& os, vtkIndent indent) override;