Commit 5c48371e authored by Cory Quammen's avatar Cory Quammen Committed by Kitware Robot

Merge topic 'typos'

e52bd798 Last minute typos found
4606f46b More follow-up typos
c58cee2d Follow-up typo
f971f725 Added more typos
d28a2cc0 Added more typos
5475d5e8 Add more misc. typos
960f7875 Removed duplicate line
6cdde9e5 Typos: source and comments
Acked-by: Kitware Robot's avatarKitware Robot <kwrobot@kitware.com>
Merge-request: !4222
parents 81453d22 e52bd798
......@@ -154,7 +154,7 @@ if(TARGET vtkm::cuda)
# Temporarily suppress "has address taken but no possible call to it" warnings,
# until we figure out its implications.
# We are diabling all warnings as nvlink has no known way to suppress
# We are disabling all warnings as nvlink has no known way to suppress
# individual warning types.
set(CMAKE_CUDA_FLAGS "${CMAKE_CUDA_FLAGS} -Xnvlink -w")
......
......@@ -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
......
......@@ -108,7 +108,7 @@ public:
* - @a Expand: The default behavior. The draw area will automatically resize
* to take up as much of @a Geometry as possible. Margin sizes are
* minimized based on the space required for axis labels/tick marks.
* - FixedAspect: Same as Expand, but a fixed aspected ratio is enforced.
* - FixedAspect: Same as Expand, but a fixed aspect ratio is enforced.
* See SetFixedAspect.
* - FixedRect: Draw area is always constrained to a fixed rectangle.
* See SetFixedRect.
......
......@@ -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:
......
......@@ -18,7 +18,7 @@
* @brief Class for drawing box plots.
*
*
* Plots to draw box plots given columns from a vtkTable that may contains
* Plots to draw box plots given columns from a vtkTable that may contain
* 5 lines with quartiles and median.
*/
......
......@@ -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;
};
......@@ -648,7 +648,7 @@ void vtkScatterPlotMatrix::AdvanceAnimation()
// 1: Remove decoration from the big chart.
// 2: Set three dimensions to plot in the BigChart3D.
// 3: Make BigChart inivisible, and BigChart3D visible.
// 3: Make BigChart invisible, and BigChart3D visible.
// 4: Rotate between the two dimensions we are transitioning between.
// -> Loop from start to end angle to complete the effect.
// 5: Make the new dimensionality active, update BigChart.
......
......@@ -277,8 +277,8 @@ void vtkKochanekSpline::Fit1D (int size, double *x, double *y,
break;
case 3:
// desired secord derivative at leftmost point is leftValue
// times secod derivative at first interior point
// desired second derivative at leftmost point is leftValue
// times second derivative at first interior point
if ((leftValue > (-2.0 + VTK_EPSILON)) ||
(leftValue < (-2.0 - VTK_EPSILON)))
{
......@@ -312,8 +312,8 @@ void vtkKochanekSpline::Fit1D (int size, double *x, double *y,
break;
case 3:
// desired secord derivative at rightmost point is rightValue
// times secord derivative at last interior point
// desired second derivative at rightmost point is rightValue
// times second derivative at last interior point
if ((rightValue > (-2.0 + VTK_EPSILON)) ||
(rightValue < (-2.0 - VTK_EPSILON)))
{
......
......@@ -69,7 +69,7 @@ public:
// Description:
// Returns an object of type T that is local to the current thread.
// This needs to be called mainly within a threaded execution path.
// It will create a new object (local to the tread so each thread
// It will create a new object (local to the thread so each thread
// get their own when calling Local) which is a copy of exemplar as passed
// to the constructor (or a default object if no exemplar was provided)
// the first time it is called. After the first time, it will return
......
......@@ -66,7 +66,7 @@ public:
// Description:
// Returns an object of type T that is local to the current thread.
// This needs to be called mainly within a threaded execution path.
// It will create a new object (local to the tread so each thread
// It will create a new object (local to the thread so each thread
// get their own when calling Local) which is a copy of exemplar as passed
// to the constructor (or a default object if no exemplar was provided)
// the first time it is called. After the first time, it will return
......
......@@ -98,7 +98,7 @@ public:
// Description:
// Returns an object of type T that is local to the current thread.
// This needs to be called mainly within a threaded execution path.
// It will create a new object (local to the tread so each thread
// It will create a new object (local to the thread so each thread
// get their own when calling Local) which is a copy of exemplar as passed
// to the constructor (or a default object if no exemplar was provided)
// the first time it is called. After the first time, it will return
......
......@@ -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.
......
......@@ -3482,7 +3482,7 @@ int TestGetAdjustedScalarRange()
if (range[0] != uc->GetDataTypeMin() ||
range[1] != uc->GetDataTypeMax())
{
std::cout << " GetAjustedScalarRange(unsigned char) expected "
std::cout << " GetAdjustedScalarRange(unsigned char) expected "
<< uc->GetDataTypeMin() << ", " << uc->GetDataTypeMax()
<< " but got " << range[0] << ", " << range[1]
<< std::endl;
......@@ -3509,7 +3509,7 @@ int TestGetAdjustedScalarRange()
if (range[0] != us->GetDataTypeMin() ||
range[1] != us->GetDataTypeMax())
{
std::cout << " GetAjustedScalarRange(unsigned short) expected "
std::cout << " GetAdjustedScalarRange(unsigned short) expected "
<< us->GetDataTypeMin() << ", " << us->GetDataTypeMax()
<< " but got " << range[0] << ", " << range[1]
<< std::endl;
......@@ -3520,7 +3520,7 @@ int TestGetAdjustedScalarRange()
if (range[0] != us->GetDataTypeMin() ||
range[1] != 4095.0)
{
std::cout << " GetAjustedScalarRange(unsigned short) expected "
std::cout << " GetAdjustedScalarRange(unsigned short) expected "
<< us->GetDataTypeMin() << ", " << 4095.0
<< " but got " << range[0] << ", " << range[1]
<< std::endl;
......@@ -3531,7 +3531,7 @@ int TestGetAdjustedScalarRange()
if (range[0] != us->GetDataTypeMin() ||
range[1] >= uc->GetDataTypeMax())
{
std::cout << " GetAjustedScalarRange(unsigned short) expected "
std::cout << " GetAdjustedScalarRange(unsigned short) expected "
<< us->GetDataTypeMin() << ", " << ">= " << uc->GetDataTypeMax()
<< " but got " << range[0] << ", " << range[1]
<< std::endl;
......@@ -3541,7 +3541,7 @@ int TestGetAdjustedScalarRange()
// Test nullptr array
if (vtkMath::GetAdjustedScalarRange(nullptr, 1000, nullptr))
{
std::cout << " GetAjustedScalarRange with a nullptr array expected "
std::cout << " GetAdjustedScalarRange with a nullptr array expected "
<< 0
<< " but got " << 1
<< std::endl;
......
......@@ -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')
......
......@@ -475,7 +475,7 @@ int vtkMath::InvertMatrix(double **A, double **AI, int size)
}
//----------------------------------------------------------------------------
// Factor linear equations Ax = b using LU decompostion A = LU where L is
// Factor linear equations Ax = b using LU decomposition A = LU where L is
// lower triangular matrix and U is upper triangular matrix. Input is
// square matrix A, integer array of pivot indices index[0->n-1], and size
// of square matrix n. Output factorization LU is in matrix A. If error is
......@@ -581,7 +581,7 @@ int vtkMath::LUFactorLinearSystem(double **A, int *index, int size)
}
//----------------------------------------------------------------------------
// Solve linear equations Ax = b using LU decompostion A = LU where L is
// Solve linear equations Ax = b using LU decomposition A = LU where L is
// lower triangular matrix and U is upper triangular matrix. Input is
// factored matrix A=LU, integer array of pivot indices index[0->n-1],
// load vector x[0->n-1], and size of square matrix n. Note that A=LU and
......@@ -1270,7 +1270,7 @@ int vtkMath::InvertMatrix(double **A, double **AI, int size,
// Factor linear equations Ax = b using LU decompostion A = LU where L is
// Factor linear equations Ax = b using LU decomposition A = LU where L is
// lower triangular matrix and U is upper triangular matrix. Input is
// square matrix A, integer array of pivot indices index[0->n-1], and size
// of square matrix n. Output factorization LU is in matrix A. If error is
......
......@@ -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.
......
......@@ -76,7 +76,7 @@ int otherCellTypes(int, char *[])
{
TestOCT();
// Might need to be ajusted if vtkCellTypes changes
// Might need to be adjusted if vtkCellTypes changes
bool fail1 = (VTK_NUMBER_OF_CELL_TYPES <= VTK_HIGHER_ORDER_HEXAHEDRON);
// vtkUnstructuredGrid uses uchar to store cellId
......
......@@ -113,7 +113,7 @@ void vtkAMRUtilities::CopyFieldData(
vtkDataArray *srcArray = source->GetArray( arrayIdx );
assert( "pre: target array is nullptr!" && (targetArray != nullptr) );
assert( "pre: source array is nullptr!" && (srcArray != nullptr) );
assert( "pre: targer/source array number of components mismatch!" &&
assert( "pre: target/source array number of components mismatch!" &&
(targetArray->GetNumberOfComponents()==
srcArray->GetNumberOfComponents() ) );
assert( "pre: target/source array names mismatch!" &&
......
......@@ -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
......
......@@ -87,7 +87,7 @@ void vtkAnimationScene::SetTimeMode(int mode)
{
if (mode == vtkAnimationCue::TIMEMODE_NORMALIZED)
{
// If noralized time mode is being set on the scene,
// If normalized time mode is being set on the scene,
// ensure that none of the contained cues need relative times.
vtkCollectionIterator *it = this->AnimationCuesIterator;
for (it->InitTraversal(); !it->IsDoneWithTraversal(); it->GoToNextItem())
......@@ -97,7 +97,7 @@ void vtkAnimationScene::SetTimeMode(int mode)
if (cue && cue->GetTimeMode() != vtkAnimationCue::TIMEMODE_NORMALIZED)
{
vtkErrorMacro("Scene contains a cue in relative mode. It must be removed "
"or chaged to normalized mode before changing the scene time mode");
"or changed to normalized mode before changing the scene time mode");
return;
}
}
......@@ -108,7 +108,7 @@ void vtkAnimationScene::SetTimeMode(int mode)
//----------------------------------------------------------------------------
void vtkAnimationScene::InitializeChildren()
{
// run thr all the cues and init them.
// run through all the cues and init them.
vtkCollectionIterator *it = this->AnimationCuesIterator;
for (it->InitTraversal(); !it->IsDoneWithTraversal(); it->GoToNextItem())
{
......
......@@ -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)
{
......
......@@ -149,7 +149,7 @@ public:
/**
* If this node is not a leaf node, there are leaf nodes below it whose
* regions represent a partitioning of this region. The IDs of these
* leaf nodes form a contigous set. Set/Get the range of the IDs of
* leaf nodes form a contiguous set. Set/Get the range of the IDs of
* the leaf nodes below this node. If this is already a leaf node, these
* values should be the same as the ID.
*/
......
......@@ -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();
......@@ -847,7 +847,6 @@ protected:
static int __ConvexSubRegions(int *ids, int len, vtkKdNode *tree, vtkKdNode **nodes);
static int FoundId(vtkIntArray *idArray, int id);
void NewParitioningRequest(int req);
void SetInputDataInfo(int i,
int dims[3], double origin[3], double spacing[3]);
int CheckInputDataInfo(int i,
......
......@@ -167,7 +167,7 @@ public:
/**
* If this node is not a leaf node, there are leaf nodes below it whose
* regions represent a partitioning of this region. The IDs of these
* leaf nodes form a contigous set. Get the first of the first point's
* leaf nodes form a contiguous set. Get the first of the first point's
* ID that is contained in this node.
*/
vtkGetMacro(MinID, int);
......
......@@ -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
......
......@@ -184,7 +184,7 @@ public:
/**
* Divide the extent in half in the given direction. The
* operation is done in-place the other half of the split
* extent is returned. The retunr will be empty if the split
* extent is returned. The return will be empty if the split
* could not be made.
*/
vtkPixelExtent Split(int dir);
......
......@@ -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
......
......@@ -210,8 +210,8 @@ class vtkSelection::vtkInternals
return false;
}
// higher the value, higher the precendence.
inline int precendence(char op) const
// higher the value, higher the precedence.
inline int precedence(char op) const
{
switch (op)
{
......@@ -303,7 +303,7 @@ public:
}
else if (term[0] == '&' || term[0] == '|' || term[0] == '!')
{
while (op_stack.size() > 0 && (precendence(term[0]) < precendence(op_stack.back())) &&
while (op_stack.size() > 0 && (precedence(term[0]) < precedence(op_stack.back())) &&
this->ApplyBack(op_stack, var_stack))
{
}
......
......@@ -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>
......
......@@ -223,14 +223,14 @@ int TestMultiOutputSimpleFilter(int argc, char* argv[])
}
std::string inputAMR = data_dir;
std::string inputMutliblock = data_dir;
std::string inputMultiblock = data_dir;
inputAMR += "/Data/AMR/HierarchicalBoxDataset.v1.1.vthb";
inputMutliblock += "/Data/many_blocks/many_blocks.vtm";
inputMultiblock += "/Data/many_blocks/many_blocks.vtm";
delete[] data_dir;
int retVal = TestComposite(inputAMR, true);
retVal |= TestComposite(inputMutliblock, false);
retVal |= TestComposite(inputMultiblock, false);
return retVal;
}
......@@ -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()