Commit 35af19e0 authored by luz.paz's avatar luz.paz

Misc. typos

found via `codespell` 
parent 826a02ce
......@@ -224,7 +224,7 @@ if(CMAKE_C_COMPILER_LOADED)
endforeach()
set(OpenMP_C_FLAGS "${OpenMP_C_FLAGS_INTERNAL}"
CACHE STRING "C compiler flags for OpenMP parallization")
CACHE STRING "C compiler flags for OpenMP parallelization")
list(APPEND _OPENMP_REQUIRED_VARS OpenMP_C_FLAGS)
unset(OpenMP_C_FLAG_CANDIDATES)
......@@ -273,7 +273,7 @@ if(CMAKE_CXX_COMPILER_LOADED)
endforeach()
set(OpenMP_CXX_FLAGS "${OpenMP_CXX_FLAGS_INTERNAL}"
CACHE STRING "C++ compiler flags for OpenMP parallization")
CACHE STRING "C++ compiler flags for OpenMP parallelization")
list(APPEND _OPENMP_REQUIRED_VARS OpenMP_CXX_FLAGS)
unset(OpenMP_CXX_FLAG_CANDIDATES)
......@@ -322,7 +322,7 @@ if(CMAKE_Fortran_COMPILER_LOADED)
endforeach()
set(OpenMP_Fortran_FLAGS "${OpenMP_Fortran_FLAGS_INTERNAL}"
CACHE STRING "Fortran compiler flags for OpenMP parallization")
CACHE STRING "Fortran compiler flags for OpenMP parallelization")
list(APPEND _OPENMP_REQUIRED_VARS OpenMP_Fortran_FLAGS)
unset(OpenMP_Fortran_FLAG_CANDIDATES)
......
......@@ -37,7 +37,7 @@
# ----------------------------------------------------------------------------
# Note:
# PostgreSQL_ADDITIONAL_VERSIONS is a variable that can be used to set the
# version mumber of the implementation of PostgreSQL.
# version number of the implementation of PostgreSQL.
# In Windows the default installation of PostgreSQL uses that as part of the path.
# E.g C:\Program Files\PostgreSQL\8.4.
# Currently, the following version numbers are known to this module:
......
......@@ -15,7 +15,7 @@ endif()
# Ensure a framework path is set
if (NOT EXISTS "@CMAKE_FRAMEWORK_INSTALL_PREFIX@")
message(FATAL_ERROR
"Please specifiy a CMAKE_FRAMEWORK_INSTALL_PREFIX.")
"Please specify a CMAKE_FRAMEWORK_INSTALL_PREFIX.")
endif()
# Glob all input libs
......
......@@ -43,7 +43,7 @@ function(vtk_add_java_wrapping module_name module_srcs module_hdrs)
vtk_target_export(${module_name}Java)
set_property(TARGET ${module_name}Java APPEND
PROPERTY INCLUDE_DIRECTORIES ${_java_include_dirs})
# Force JavaClasses to build in the right order by adding a depenency.
# Force JavaClasses to build in the right order by adding a dependency.
add_dependencies(${module_name}JavaJavaClasses ${module_name}Java)
if(${module_name}_IMPLEMENTS)
set_property(TARGET ${module_name}Java PROPERTY COMPILE_DEFINITIONS
......
......@@ -172,7 +172,7 @@ endforeach()
if (NOT VTK_BUILD_ALL_MODULES_FOR_TESTS)
# If VTK_BUILD_ALL_MODULES_FOR_TESTS is OFF, it implies that we didn't add any
# test modules to the dependecy graph. We now add the test modules for all
# test modules to the dependency graph. We now add the test modules for all
# enabled modules if all the test dependencies are already satisfied
# (BUG #13297).
foreach(vtk-module IN LISTS VTK_MODULES_ENABLED)
......
......@@ -39,7 +39,7 @@ mark_as_advanced(VTK_OPENGL_HAS_OSMESA)
set(default_has_egl OFF)
if(DEFINED VTK_USE_OFFSCREEN_EGL AND VTK_USE_OFFSCREEN_EGL)
message(DEPRECATION "`VTK_USE_OFFSCREEN_EGL` cache variable is replaced by "
"`VTK_OPENGL_HAS_EGL`. Plase use it instead. The new name "
"`VTK_OPENGL_HAS_EGL`. Please use it instead. The new name "
"better reflects the variable's purpose.")
set(default_has_egl ${VTK_USE_OFFSCREEN_EGL})
endif()
......@@ -121,7 +121,7 @@ if(VTK_OPENGL_HAS_EGL)
endif()
if(VTK_CAN_DO_ONSCREEN)
# OpenGL libraries are explicity needed if windowing system-based API is being
# OpenGL libraries are explicitly needed if windowing system-based API is being
# used. Otherwise, if only doing OFFSCREEN, the GL API is provided by the
# offscreen library be it EGL or OSMESA.
find_package(OpenGL REQUIRED)
......
......@@ -13,7 +13,7 @@
if(MPIEXEC)
set(VTK_MPIRUN_EXE ${MPIEXEC} CACHE FILEPATH "The full path to mpirun command" FORCE)
set(VTK_MPI_PRENUMPROC_FLAGS ${MPIEXEC_PREFLAGS} CACHE STRING
"These flags will be directly before the number of processess flag (see ${CMAKE_CURRENT_SOURCE_DIR}/CMakeLists.txt for more info.)" FORCE)
"These flags will be directly before the number of processes flag (see ${CMAKE_CURRENT_SOURCE_DIR}/CMakeLists.txt for more info.)" FORCE)
if(NOT ${MPI_NUMPROC_FLAG})
set(VTK_MPI_NUMPROC_FLAG "-np" CACHE STRING
"Flag used by mpi to specify the number of processes, the next option will be the number of processes. (see ${CMAKE_CURRENT_SOURCE_DIR}/CMakeLists.txt for more info.)" FORCE)
......
......@@ -156,7 +156,7 @@ public:
//@{
/**
* Get the vtkTextProperty that governs how the axis lables are displayed.
* Get the vtkTextProperty that governs how the axis labels are displayed.
* Note that the alignment properties are not used.
*/
vtkGetObjectMacro(LabelProperties, vtkTextProperty);
......
......@@ -812,7 +812,7 @@ void vtkScatterPlotMatrix::SetInput(vtkTable *table)
{
if(table && table->GetNumberOfRows() == 0)
{
// do nothing if the table is emtpy
// do nothing if the table is empty
return;
}
......
......@@ -20,7 +20,7 @@
vtkStandardNewMacro(vtkKochanekSpline);
//----------------------------------------------------------------------------
// Construct a KochanekSpline wth the following defaults:
// Construct a KochanekSpline with the following defaults:
// DefaultBias = 0,
// DefaultTension = 0,
// DefaultContinuity = 0.
......
......@@ -130,7 +130,7 @@ static Slot* LookupSlot(HashTableArray *array, ThreadIdType threadId,
size_t mask = array->Size - 1u;
Slot *slot = nullptr;
// since load factor is maintained bellow 0.5, this loop should hit an
// since load factor is maintained below 0.5, this loop should hit an
// empty slot if the queried slot does not exist in this array
for (size_t idx = hash & mask; ; idx = (idx + 1) & mask) // linear probing
{
......
......@@ -19,7 +19,7 @@ int TestDataArrayComponentNames(int,char *[])
if ( array->GetComponentName(-1) != nullptr || array->GetComponentName(3) != nullptr )
{
cerr
<< " Unable to return nullptr when asking for a component name outside the the valid range";
<< " Unable to return nullptr when asking for a component name outside the valid range";
array->Delete();
return 1;
}
......
......@@ -214,7 +214,7 @@ int TestErrorsAndWarnings()
array->AddObserver(vtkCommand::ErrorEvent, errorObserver);
array->AddObserver(vtkCommand::WarningEvent, errorObserver);
// ERROR: Not implmented
// ERROR: Not implemented
array->SetVoidArray(nullptr, 1, 1);
if (errorObserver->GetError())
{
......@@ -228,7 +228,7 @@ int TestErrorsAndWarnings()
}
errorObserver->Clear();
// ERROR: Not implmented
// ERROR: Not implemented
array->NewIterator();
if (errorObserver->GetError())
{
......
......@@ -481,7 +481,7 @@ def CheckPythonVersion(ver):
Check the Python version.
:param: ver - the minimum required version number as hexadecimal.
:return: True if if the Python version is greater than or equal to ver.
:return: True if the Python version is greater than or equal to ver.
'''
if sys.hexversion < ver:
return False
......
......@@ -389,7 +389,7 @@ def CheckPythonVersion(ver):
Check the Python version.
:param: ver - the minimum required version number as hexadecimal.
:return: True if if the Python version is greater than or equal to ver.
:return: True if the Python version is greater than or equal to ver.
'''
if sys.hexversion < ver:
return False
......
......@@ -63,7 +63,7 @@ class TestSubclass(Testing.vtkTest):
self.assertEqual(id(o.GetExtraObject()), id(extra))
def testCallUnboundMethods(self):
"""Test calling an unbound method in an overridded method"""
"""Test calling an unbound method in an overridden method"""
o = vtkCustomObject()
a = vtk.vtkIntArray()
o.SetExtraObject(a)
......
......@@ -119,7 +119,7 @@ void vtkAbstractArray::SetComponentName( vtkIdType component, const char *name )
this->ComponentNames->resize( index+1, nullptr );
}
//replace an exisiting element
//replace an existing element
vtkStdString *compName = this->ComponentNames->at(index);
if ( !compName )
{
......
......@@ -545,13 +545,13 @@ public:
/**
* Copy information instance. Arrays use information objects
* in a variety of ways. It is important to have flexibility in
* this regard because certain keys should not be coppied, while
* this regard because certain keys should not be copied, while
* others must be.
* NOTE: Subclasses must always call their superclass's CopyInformation
* method, so that all classes in the hierarchy get a chance to remove
* keys they do not wish to be coppied. The subclass will not need to
* explicilty copy the keys as it's handled here.
* keys they do not wish to be copied. The subclass will not need to
* explicitly copy the keys as it's handled here.
*/
virtual int CopyInformation(vtkInformation *infoFrom, int deep=1);
......
......@@ -115,7 +115,7 @@ public:
* Triggers a Tick event if currenttime >= StartTime and
* currenttime <= EndTime.
* Whenever the state of the cue changes,
* either StartEvent or EndEvent is triggerred depending upon
* either StartEvent or EndEvent is triggered depending upon
* whether the cue entered Active state or quit active state respectively.
* The current time is relative to the start of the container Scene
* (when in Relative time mode) or is normalized
......
......@@ -101,7 +101,7 @@ public:
/**
* Resizes the array to the given extents (number of dimensions and
* size of each dimension). Note that concrete implementations of
* vtkArray may place constraints on the the extents that they will
* vtkArray may place constraints on the extents that they will
* store, so you cannot assume that GetExtents() will always return
* the same value passed to Resize().
......
......@@ -50,7 +50,7 @@
* that use those arrays.
* - ValueType restriction: If both SoA and AoS arrays need to be supported,
* but only certain ValueTypes are expected, the dispatcher can restrict
* itself to only use arrays that match this critera.
* itself to only use arrays that match this criteria.
* - Application-wide array restrictions: If a VTK application uses only a few
* arraytype / valuetype combinations, certain dispatchers will eliminate
* paths using unsupported arrays at compile time.
......
......@@ -45,7 +45,7 @@ public:
/**
* Set the memory buffer that this vtkBuffer object will manage. @a array
* is a pointer to the buffer data and @a size is the size of the bufffer (in
* is a pointer to the buffer data and @a size is the size of the buffer (in
* number of elements). If @a save is true, the buffer will not be freed when
* this vtkBuffer object is deleted or resize -- otherwise, @a deleteMethod
* is a function that will be called to free the buffer
......
......@@ -405,7 +405,7 @@ public:
}
/**
* The the range of the data array values will be returned in the provided
* The range of the data array values will be returned in the provided
* range array argument. If the data array has multiple components, then
* this will return the range of only the first component (component zero).
* The range is computend and then cached, and will not be re-computed on
......@@ -460,7 +460,7 @@ public:
}
/**
* The the range of the data array values will be returned in the provided
* The range of the data array values will be returned in the provided
* range array argument. If the data array has multiple components, then
* this will return the range of only the first component (component zero).
* The range is computend and then cached, and will not be re-computed on
......@@ -545,7 +545,7 @@ public:
* in a variety of ways. It is important to have flexibility in
* this regard because certain keys should not be copied, while
* others must be. NOTE: Up to the implmenter to make sure that
* keys not inteneded to be coppied are excluded here.
* keys not intended to be copied are excluded here.
*/
int CopyInformation(vtkInformation *infoFrom, int deep=1) override;
......
......@@ -36,7 +36,7 @@ public:
/**
* Convenient method to return a value given the mean and standard deviation
* of the Gaussian distribution from the the Gaussian distribution of mean=0
* of the Gaussian distribution from the Gaussian distribution of mean=0
* and standard deviation=1.0. There is an initial implementation that can
* be overridden by a subclass.
*/
......
......@@ -43,7 +43,7 @@ public:
* Providing "requiredClass" name one can insure that only
* objects of type "requiredClass" are stored in vectors
* associated with the instance of this key type created.
* These should be string literals as they are not coppied.
* These should be string literals as they are not copied.
*/
vtkInformationObjectBaseVectorKey(const char* name,
const char* location,
......
......@@ -24,7 +24,7 @@
*
* vtkMappedDataArrayNewInstanceMacro is used by subclasses to implement
* NewInstanceInternal such that a non-mapped vtkDataArray is returned by
* NewInstance(). This prevents the mapped array type from propogating
* NewInstance(). This prevents the mapped array type from propagating
* through the pipeline.
*
* @attention
......
......@@ -157,7 +157,7 @@ public:
static T Min(const T & a, const T & b);
/**
* Returns the maximum of the two arugments provided.
* Returns the maximum of the two arguments provided.
*/
template<class T>
static T Max(const T & a, const T & b);
......
......@@ -92,7 +92,7 @@
// If the isnan or isinf function does not exist, then our next attempt is to
// use comparisons to determine if the number is not finite. Although these
// comparisons should be valid, some systems raise execeptions anyway (possibly
// comparisons should be valid, some systems raise exceptions anyway (possibly
// because exceptions for really bad operations like division by 0 are on).
// This flag will instruct vtkMath not to make these comparisons. (The next
// fallback is to do IEEE-754 bit comparisons.)
......
......@@ -378,7 +378,7 @@ void vtkObjectFactory::PrintSelf(ostream& os, vtkIndent indent)
}
os << indent << "Factory description: " << this->GetDescription() << endl;
int num = this->GetNumberOfOverrides();
os << indent << "Factory overides " << num << " classes:" << endl;
os << indent << "Factory overrides " << num << " classes:" << endl;
indent = indent.GetNextIndent();
for(int i =0; i < num; i++)
{
......
......@@ -331,7 +331,7 @@ public:
* the annotations were set).
* Subclasses must implement this and interpret how to treat the index.
* vtkLookupTable simply returns GetTableValue(\a index % \a this->GetNumberOfTableValues()).
* vtkColorTransferFunction returns the color assocated with node \a index % \a this->GetSize().
* vtkColorTransferFunction returns the color associated with node \a index % \a this->GetSize().
* Note that implementations *must* set the opacity (alpha) component of the color, even if they
* do not provide opacity values in their colormaps. In that case, alpha = 1 should be used.
......
......@@ -56,7 +56,7 @@ struct lengthCheckFunctor
};
//accumlates the length of all arrays used with this functor
//accumulates the length of all arrays used with this functor
struct storeLengthFunctor
{
vtkIdType length;
......
......@@ -52,7 +52,7 @@ int TestGenericCell(int , char *[])
// Those on the corner points indeed define the parametric center
// The dof node (center mid points) by definition have the same parametric center
// and taking into account the center point only add a 0 vector to the sum
// therefore we do not need to differenciate corner from the rest in this sum:
// therefore we do not need to differentiate corner from the rest in this sum:
for(int j=0; j<numPts; ++j)
{
double *point = pcoords + 3*j;
......
......@@ -125,7 +125,7 @@ int TestHigherOrderCell(int , char *[])
const int numEdges = linCell->GetNumberOfEdges();
const int numFaces = linCell->GetNumberOfFaces();
const int dim = linCell->GetCellDimension();
// First check consistancy across cell of higher dimension:
// First check consistency across cell of higher dimension:
// Technically doing the loop from 1 to depth will be redundant when doing the
// CompareHigherOrderCell on the quadratic cell since we will compare the exactly
// same cell...
......
......@@ -129,7 +129,7 @@ template<typename T> int TestCell(const VTKCellType cellType,
int status = 0;;
std::cout << "Testing " << aCell->GetClassName() << std::endl;
std::cout << " Testing Print of an unitialized cell...";
std::cout << " Testing Print of an uninitialized cell...";
std::ostringstream cellPrint;
aCell->Print(cellPrint);
std::cout << "PASSED" << std::endl;
......
......@@ -859,7 +859,7 @@ template<typename T> int TestOneCell(const VTKCellType cellType,
int status = 0;
std::cout << "Testing " << aCell->GetClassName() << std::endl;
std::cout << " Testing Print of an unitialized cell...";
std::cout << " Testing Print of an uninitialized cell...";
std::ostringstream cellPrint;
aCell->Print(cellPrint);
std::cout << "PASSED" << std::endl;
......
......@@ -200,7 +200,7 @@ public:
/**
* Return a pointer to Children of a block. The first entry is the number
* of children the block has followed by its childern ids in level+1.
* of children the block has followed by its children ids in level+1.
* If none exits it returns nullptr.
*/
unsigned int *GetChildren(unsigned int level, unsigned int index, unsigned int& numChildren);
......
......@@ -134,7 +134,7 @@ public:
/**
* Compute a list of the Ids of all regions that
* intersect the given cell. If you alrady
* intersect the given cell. If you already
* know the region that the cell centroid lies in, provide
* that as the last argument to make the computation quicker.
* Returns the number of regions the cell intersects.
......
......@@ -138,7 +138,7 @@ void vtkCell3D::Contour(double value, vtkDataArray *cellScalars,
// For each edge intersection point, insert into triangulation. Edge
// intersections come from contouring value. Have to be careful of
// intersections near exisiting points (causes bad Delaunay behavior).
// intersections near existing points (causes bad Delaunay behavior).
// Intersections near existing points are collapsed to existing point.
double pc[3], *pc1, *pc2;
for (int edgeNum=0; edgeNum < numEdges; edgeNum++)
......@@ -344,7 +344,7 @@ void vtkCell3D::Clip(double value, vtkDataArray *cellScalars,
// For each edge intersection point, insert into triangulation. Edge
// intersections come from clipping value. Have to be careful of
// intersections near exisiting points (causes bad Delaunay behavior).
// intersections near existing points (causes bad Delaunay behavior).
// Intersections near existing points are collapsed to existing point.
double pc[3], *pc1, *pc2;
for (int edgeNum=0; edgeNum < numEdges; edgeNum++)
......
......@@ -370,7 +370,7 @@ public:
/**
* This method checks to see if the cell and point attributes
* match the geometry. Many filters will crash if the number of
* tupples in an array is less than the number of points/cells.
* tuples in an array is less than the number of points/cells.
* This method returns 1 if there is a mismatch,
* and 0 if everything is ok. It prints an error if an
* array is too short, and a warning if an array is too long.
......
......@@ -86,7 +86,7 @@ vtkDataSetAttributes::vtkDataSetAttributes()
//Global IDs should not be interpolated because they are labels, not "numbers"
//Global IDs should not be copied either, unless doing so preserves meaning.
//Passing through is ussually OK because it is 1:1.
//Passing through is usually OK because it is 1:1.
this->CopyAttributeFlags[COPYTUPLE][GLOBALIDS] = 0;
this->CopyAttributeFlags[INTERPOLATE][GLOBALIDS] = 0;
......@@ -1937,7 +1937,7 @@ void vtkDataSetAttributes::FieldList::UnionFieldList(vtkDataSetAttributes* dsa)
this->NumberOfTuples += aa->GetNumberOfTuples();
}
// unlike Intersection, with Union the the total number of fields may change,
// unlike Intersection, with Union the total number of fields may change,
// so we have to be careful with that.
std::vector<int> dsaIndices;
dsaIndices.resize(this->NumberOfFields, -1);
......
......@@ -527,7 +527,7 @@ public:
vtkPointData *pd, vtkCellData* cd,
vtkUnsignedCharArray *types);
// The following methods are for the internals of the tesselation algorithm
// The following methods are for the internals of the tessellation algorithm
// (the hash table in particular)
/**
......
......@@ -286,7 +286,7 @@ protected:
vtkGenericAttributeCollection *Attributes;
//Main helper class to tesselate a higher order cell into linear ones.
//Main helper class to tessellate a higher order cell into linear ones.
vtkGenericCellTessellator *Tessellator;
double Bounds[6]; // (xmin,xmax, ymin,ymax, zmin,zmax) geometric bounds
......
......@@ -211,7 +211,7 @@ public:
int Reference; //signed char
int ToSplit; //signed char
vtkIdType PtId;
vtkIdType CellId; //CellId the edge refer to at a step in tesselation
vtkIdType CellId; //CellId the edge refer to at a step in tessellation
EdgeEntry()
{
......
......@@ -395,7 +395,7 @@ public:
//--------------------------------------------------------------------------
// Methods that apply to any array (not just scalars).
// I am starting to experiment with generalizing imaging fitlers
// I am starting to experiment with generalizing imaging filters
// to operate on more than just scalars.
//@{
......
......@@ -358,7 +358,7 @@ private:
const double point[3], double * dist2 );
/**
* This function may not be directly called. Please use the follwing two ones:
* This function may not be directly called. Please use the following two ones:
* FindClosestPointInSphereWithTolerance() for point insertion and
* FindClosestPointInSphereWithoutTolerance() for point location. Arguments
* refDist2 and the initialization of minDist2 determine which version is used.
......
......@@ -327,7 +327,7 @@ int vtkInformationQuadratureSchemeDefinitionVectorKey::SaveState(
{
continue;
}
// Nest XML representaion.
// Nest XML representation.
vtkXMLDataElement *e=vtkXMLDataElement::New();
def->SaveState(e);
root->AddNestedElement(e);
......
......@@ -94,17 +94,17 @@
* vtkMappedUnstructuredGrid with a specified implementation, cell iterator,
* and export declaration. They are:
* - vtkMakeMappedUnstructuredGrid(_className, _impl)
* - Create a subclass of vtkMappedUnstructuredGrid using _impl implemenation
* - Create a subclass of vtkMappedUnstructuredGrid using _impl implementation
* that is named _className.
* - vtkMakeMappedUnstructuredGridWithIter(_className, _impl, _cIter)
* - Create a subclass of vtkMappedUnstructuredGrid using _impl implemenation
* - Create a subclass of vtkMappedUnstructuredGrid using _impl implementation
* and _cIter vtkCellIterator that is named _className.
* - vtkMakeExportedMappedUnstructuredGrid(_className, _impl, _exportDecl)
* - Create a subclass of vtkMappedUnstructuredGrid using _impl implemenation
* - Create a subclass of vtkMappedUnstructuredGrid using _impl implementation
* that is named _className. _exportDecl is used to decorate the class
* declaration.
* - vtkMakeExportedMappedUnstructuredGridWithIter(_className, _impl, _cIter, _exportDecl)
* - Create a subclass of vtkMappedUnstructuredGrid using _impl implemenation
* - Create a subclass of vtkMappedUnstructuredGrid using _impl implementation
* and _cIter vtkCellIterator that is named _className. _exportDecl is used
* to decorate the class declaration.
*
......
......@@ -51,7 +51,7 @@
*
* Both of the above methods will produce the same molecule, two
* hydrogens connected with a 1.0 Angstrom single bond, aligned to the
* z-axis. The second example also demostrates the use of VTK's
* z-axis. The second example also demonstrates the use of VTK's
* vtkVector class, which is fully supported by the Chemistry kit.
*
* The vtkMolecule object is intended to be used with the
......
......@@ -149,7 +149,7 @@ public:
/**
* Return a pointer to Children of a block. The first entry is the number
* of children the block has followed by its childern ids in level+1.
* of children the block has followed by its children ids in level+1.
* If none exits it returns nullptr.
*/
unsigned int *GetChildren(unsigned int level, unsigned int index, unsigned int& numChildren);
......
......@@ -191,7 +191,7 @@ public:
/**
* Clears out the current function. A newly created vtkPiecewiseFunction
* is alreay initialized, so there is no need to call this method which
* is already initialized, so there is no need to call this method which
* in turn simply calls RemoveAllPoints()
*/
void Initialize() override;
......
......@@ -199,7 +199,7 @@ void vtkPixelExtent::Subtract(
return;
}
// split left and bellow this cells
// split left and below this cells
I.CellToNode();
deque<vtkPixelExtent> tmpA0;
......
......@@ -108,7 +108,7 @@ public:
//@{
/**
* Return non-zero if this extent conatins the other.
* Return non-zero if this extent contains the other.
*/
int Contains(const vtkPixelExtent &other) const;
int Contains(int i, int j) const;
......
......@@ -606,7 +606,7 @@ void vtkPlanesIntersection::SetPlaneEquations()
}
}
// Compute region vertices if not set explicity ********************
// Compute region vertices if not set explicitly ********************
void vtkPlanesIntersection::ComputeRegionVertices()
{
......
......@@ -604,7 +604,7 @@ int vtkPolygon::ParameterizePolygon(double *p0, double *p10, double& l10,
return 0;
}
// Now evalute all polygon points to determine min/max parametric
// Now evaluate all polygon points to determine min/max parametric
// coordinate values.
//
// first vertex has (s,t) = (0,0)
......
......@@ -247,7 +247,7 @@ protected:
vtkQuad *Quad;
vtkPolygon *Polygon;
vtkTetra *Tetra;
vtkIdTypeArray *GlobalFaces; //these are numbered in gloabl id space
vtkIdTypeArray *GlobalFaces; //these are numbered in global id space
vtkIdTypeArray *FaceLocations;
// vtkCell has the data members Points (x,y,z coordinates) and PointIds
......
......@@ -25,7 +25,7 @@
* vertices; and point ids 4-9 are the midedge nodes between (0,1), (1,2),
* (2,0), (0,3), (1,3), and (2,3).
*
* Note that this class uses an internal linear tesselation for some internal operations
* Note that this class uses an internal linear tessellation for some internal operations
* (e.g., clipping and contouring). This means that some artifacts may appear trying to
* represent a non-linear interpolation function with linear tets.
*
......
......@@ -74,7 +74,7 @@ public:
/**
* Release all allocated resources and set the
* object to an unitialized state.
* object to an uninitialized state.
*/
void Clear();
......
......@@ -304,7 +304,7 @@ public:
*/
void CloseStream();
// Descrition:
// Description:
// Implements deep copy
void DeepCopy(vtkDataObject *src) override;
......
......@@ -53,7 +53,7 @@ static int TRIANGLE_EDGES_TABLE[3][2] = {{0, 1}, {1, 2}, {2, 0}};
// The last case is only a sentinel to avoid stepping out of table
// If we consider edge 3 the first edge, 4 the second and 5 the last one
// 'Index' can be computed by the decimal evaluation of the binary representing
// which is is split ex: 3 and 5 are split is noted:
// which is split ex: 3 and 5 are split is noted:
// {1, 0, 1} = 1*2^0 + 0*2^1 + 1*2^2 = 5
// [case][triangle][vertex]
static signed char vtkTessellatorTriangleCases[9][4][3] = {
......
......@@ -164,7 +164,7 @@ void vtkSphereComputeBoundingSphere(T *pts, vtkIdType numPts, T sphere[4],
#define VTK_ASSIGN_SPHERE(_x,_y) {_x[0]=_y[0];_x[1]=_y[1];_x[2]=_y[2];_x[3]=_y[3];}
// An approximation to the bounding sphere of a set of spheres. The algorithm
// creates an iniitial approximation from two spheres that are expected to be
// the farthest apart (taking into accout their radius). A second pass may
// the farthest apart (taking into account their radius). A second pass may
// grow the bounding sphere if the remaining spheres are not contained within
// it. The hints[2] array indicates two spheres that are expected to be the
// farthest apart.
......
......@@ -18,7 +18,7 @@
//----------------------------------------------------------------------------
// Construct a spline wth the folloing defaults:
// Construct a spline with the following defaults: