Commit 6cdde9e5 authored by luz.paz's avatar luz.paz Committed by luz paz

Typos: source and comments

Found via `codespell`
parent 041101a1
......@@ -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:"
......
# 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)
......
......@@ -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>)
......
......@@ -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
......
......@@ -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:
......
......@@ -203,7 +203,7 @@ public:
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;
};
......
......@@ -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.
......
......@@ -159,7 +159,7 @@ class TestVariant(Testing.vtkTest):
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')
......
......@@ -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.
......
......@@ -64,14 +64,14 @@ public:
*/
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()
{
......
......@@ -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
......
......@@ -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
......
......@@ -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;
......
......@@ -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
......
......@@ -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)
{
......
......@@ -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)
{
......
......@@ -209,7 +209,7 @@ public:
//@}
/**
* Get the number of data sets included in spatial paritioning
* Get the number of data sets included in spatial partitioning
*/
int GetNumberOfDataSets();
......
......@@ -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
......
......@@ -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
......
......@@ -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());
......
......@@ -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];
......
......@@ -99,7 +99,7 @@ public:
//@{
/**
* 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 @@ public:
//@{
/**
* 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);
......
......@@ -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
......
......@@ -40,7 +40,7 @@
*
*
* See Graphics/Testing/Cxx/TestReebGraph.cxx for an example of concrete
* implemetnation.
* implementation.
*/
#ifndef vtkReebGraphSimplificationMetric_h
......
......@@ -42,7 +42,7 @@ public:
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]);
......
......@@ -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>
......
......@@ -238,7 +238,7 @@ int vtkCachedStreamingDemandDrivenPipeline
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
......
......@@ -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
......
......@@ -71,7 +71,7 @@ public:
* 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
......
......@@ -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
......
......@@ -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
......
......@@ -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;
......
......@@ -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;
......
......@@ -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]) ||
......
......@@ -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
......
......@@ -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 )
{
......
......@@ -264,7 +264,7 @@ public:
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 @@ public:
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
......
......@@ -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)
{
......
......@@ -6922,7 +6922,7 @@ int vtkEarthSource::RequestData(
}
//
// Update ourselves and release memeory
// Update ourselves and release memory
//
output->SetPoints(newPoints);
newPoints->Delete();
......
......@@ -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;
......
......@@ -56,7 +56,7 @@ def ButtonCallback (x,y,__vtk__temp0=0,__vtk__temp1=0):
x = lindex(pt,0)
y = lindex(pt,1)
z = lindex(pt,2)
# Had to move away from mose events (sgi RT problems)
# Had to move away from mouse events (sgi RT problems)
i = 0
while i <= 100:
puzzle.SetPoint(x,y,z)
......
......@@ -56,7 +56,7 @@ public:
//@{
/**
* Standard methids for printing and determining type information.
* Standard methods for printing and determining type information.
*/
vtkTypeMacro(vtkDijkstraGraphGeodesicPath,vtkGraphGeodesicPath);
void PrintSelf(ostream& os, vtkIndent indent) override;
......
......@@ -67,7 +67,7 @@ public:
//@{
/**
* Standard methids for printing and determining type information.
* Standard methods for printing and determining type information.
*/
vtkTypeMacro( vtkDijkstraImageGeodesicPath, vtkDijkstraGraphGeodesicPath );
void PrintSelf( ostream& os, vtkIndent indent ) override;
......
......@@ -34,7 +34,7 @@ public:
//@{
/**
* Standard methids for printing and determining type information.
* Standard methods for printing and determining type information.
*/
vtkTypeMacro(vtkGeodesicPath,vtkPolyDataAlgorithm);
void PrintSelf(ostream& os, vtkIndent indent) override;
......
......@@ -34,7 +34,7 @@ class VTKFILTERSMODELING_EXPORT vtkGraphGeodesicPath : public vtkGeodesicPath
public:
//@{
/**
* Standard methids for printing and determining type information.
* Standard methods for printing and determining type information.
*/
vtkTypeMacro(vtkGraphGeodesicPath,vtkGeodesicPath);
void PrintSelf(ostream& os, vtkIndent indent) override;
......
......@@ -435,7 +435,7 @@ int vtkSelectPolyData::RequestData(
nextFront->Reset();
} //while still advancing
// Now may have to invert fill value depending on what we wan to extract
// Now may have to invert fill value depending on what we want to extract
if ( this->SelectionMode == VTK_INSIDE_SMALLEST_REGION )
{
for (i=0; i < numCells; i++)
......
......@@ -224,7 +224,7 @@ int vtkPSphereSource::RequestData(
}
}
//
// Update ourselves and release memeory
// Update ourselves and release memory
//
newPoints->Squeeze();
output->SetPoints(newPoints);
......
......@@ -374,7 +374,7 @@ inline void GetGlobalFieldMetaData(diy::mpi::communicator &comm,
int source;
diy::mpi::all_reduce(comm, rank, source, diy::mpi::minimum<int>());
if (source < comm.size()) // atleast one process has field meta data
if (source < comm.size()) // at least one process has field meta data
{
diy::MemoryBuffer bb;
if (comm.rank() == source)
......
......@@ -168,7 +168,7 @@ int vtkConnectedPointsFilter::RequestData(
vtkIdType *labels = static_cast<vtkIdType*>(this->RegionLabels->GetVoidPointer(0));
std::fill_n(labels, numPts, -1);
// This is an incremental (propagating wave) traveral of the points. The
// This is an incremental (propagating wave) traversal of the points. The
// traversal is a function of proximity, planarity, and/or position on a
// plane
vtkIdType ptId;
......
......@@ -140,7 +140,7 @@ public:
//@{
/**
* Multiply the Gaussian splat distribution by this value. If UseScalars is
* on and a scalar aray is provided, then the scalar value will be
* on and a scalar array is provided, then the scalar value will be
* multiplied by the ScaleFactor times the Gaussian function.
*/
vtkSetClampMacro(ScaleFactor,double,0.0,VTK_DOUBLE_MAX);
......
......@@ -91,7 +91,7 @@ public:
//@{
/**
* Specify the vtkHierarchicalBinningFilter to query for relavant
* Specify the vtkHierarchicalBinningFilter to query for relevant
* information. Make sure that this filter has executed prior to the execution of
* this filter. (This is generally a safe bet if connected in a pipeline.)
*/
......
......@@ -248,7 +248,7 @@ int vtkPCANormalEstimation::RequestData(
this->NormalOrientation, this->OrientationPoint, this->FlipNormals));
}
// Orient the normals in a consistent fashion (if requested). This requires a traveral
// Orient the normals in a consistent fashion (if requested). This requires a traversal
// across the point cloud, traversing neighbors that are in close proximity.
if ( this->NormalOrientation == vtkPCANormalEstimation::GRAPH_TRAVERSAL )
{
......
......@@ -281,7 +281,7 @@ int vtkSphereSource::RequestData(
this->UpdateProgress (0.70 + 0.30*i/static_cast<double>(localThetaResolution));
}
// Update ourselves and release memeory
// Update ourselves and release memory
//
newPoints->Squeeze();
output->SetPoints(newPoints);
......
......@@ -142,7 +142,7 @@ int vtkTexturedSphereSource::RequestData(
}
}
//
// Update ourselves and release memeory
// Update ourselves and release memory
//
output->SetPoints(newPoints);
newPoints->Delete();
......
......@@ -43,7 +43,7 @@
* above sea level ???? should we make this from center of earth ????
* ???? what about equatorial bulge ????
* Heading in degrees: (-180->180)
* Relative to Logitude and Latitude.
* Relative to Longitude and Latitude.
* 0 is north.
* 90 is east. ???? what is the standard ????
* 180 is south.
......@@ -129,7 +129,7 @@ public:
//@{
/**
* Heading is in degrees: (-180->180)
* Relative to Logitude and Latitude.
* Relative to Longitude and Latitude.
* 0 is north.
* 90 is east. ???? what is the standard ????
* 180 is south.
......
......@@ -337,7 +337,7 @@ int vtkGlobeSource::RequestData(
}
// Update ourselves and release memeory
// Update ourselves and release memory
//
newPoints->Squeeze();
output->SetPoints(newPoints);
......
......@@ -188,7 +188,7 @@ int vtkEnSightReader::RequestData(
// This overrides the ivar.
if(outInfo->Has(vtkStreamingDemandDrivenPipeline::UPDATE_TIME_STEP()) && tsLength>0)
{
// Get the requested time step. We only supprt requests of a single time
// Get the requested time step. We only support requests of a single time
// step in this reader right now
double requestedTimeStep =
outInfo->Get(vtkStreamingDemandDrivenPipeline::UPDATE_TIME_STEP());
......
......@@ -472,7 +472,7 @@ void vtkGDALRasterReader::vtkGDALRasterReaderInternal::GenericReadData()
(void)err; //unused
const double* d = GetGeoCornerPoints();
// 4,5 are the x,y coordinates for the oposite corner to 0,1
// 4,5 are the x,y coordinates for the opposite corner to 0,1
double geoSpacing[] = {(d[4]-d[0])/this->Reader->RasterDimensions[0],
(d[5]-d[1])/this->Reader->RasterDimensions[1],
1};
......
......@@ -462,7 +462,7 @@ bool vtkGeoJSONFeature::IsLineString(const Json::Value& root)
if ( root.size() < 1 )
{
vtkErrorMacro (<< "Expected atleast 1 value at " << root);
vtkErrorMacro (<< "Expected at least 1 value at " << root);
return false;
}
......@@ -489,7 +489,7 @@ bool vtkGeoJSONFeature::IsMultiLineString(const Json::Value& root)
if ( root.size() < 1 )
{
vtkErrorMacro (<< "Expected atleast 1 value at " << root);
vtkErrorMacro (<< "Expected at least 1 value at " << root);
return false;
}
......@@ -544,7 +544,7 @@ bool vtkGeoJSONFeature::IsMultiPoint(const Json::Value& root)
if( root.size() < 1 )
{
vtkErrorMacro (<< "Expected atleast 1 value at " << root << " for multipoint");
vtkErrorMacro (<< "Expected at least 1 value at " << root << " for multipoint");
return false;
}
......@@ -571,7 +571,7 @@ bool vtkGeoJSONFeature::IsPolygon(const Json::Value& root)
if ( root.size() < 1 )
{
vtkErrorMacro (<< "Expected atleast 1 value at " << root << "for polygon");
vtkErrorMacro (<< "Expected at least 1 value at " << root << "for polygon");
return false;
}
......@@ -600,7 +600,7 @@ bool vtkGeoJSONFeature::IsMultiPolygon(const Json::Value& root)
if ( root.size() < 1 )
{
vtkErrorMacro (<< "Expected atleast 1 value at " << root << " for multi polygon");
vtkErrorMacro (<< "Expected at least 1 value at " << root << " for multi polygon");
return false;
}
......
......@@ -906,7 +906,7 @@ void vtkLSDynaPart::BuildCells()
vtkIdTypeArray *cellArray = vtkIdTypeArray::New();
cellArray->SetVoidArray(&this->Cells->data[0],cellDataSize,1);
//set the idtype aray as the cellarray
//set the idtype array as the cellarray
vtkCellArray *cells = vtkCellArray::New();
cells->SetCells(this->NumberOfCells,cellArray);
cellArray->FastDelete();
......
......@@ -443,7 +443,7 @@ int vtkPlot3DMetaReader::RequestData(
double timeValue = 0;
if (outInfo->Has(vtkStreamingDemandDrivenPipeline::UPDATE_TIME_STEP()))
{
// Get the requested time step. We only supprt requests of a single time
// Get the requested time step. We only support requests of a single time
// step in this reader right now
timeValue =
outInfo->Get(vtkStreamingDemandDrivenPipeline::UPDATE_TIME_STEP());
......
......@@ -596,7 +596,7 @@ int vtkXMLReader::RequestData(vtkInformation *vtkNotUsed(request),
if (steps &&
outInfo->Has(vtkStreamingDemandDrivenPipeline::UPDATE_TIME_STEP()))
{
// Get the requested time step. We only supprt requests of a single time