Commit 424d4b72 authored by Kunda's avatar Kunda Committed by Cory Quammen

doxy and misc. typos pt2

doxy and misc. typos pt2
parent dac1771e
......@@ -176,7 +176,7 @@ vtkm::cont::Field Convert(vtkDataArray* input, int association)
// We need to properly deduce the ValueType of the array. This means
// that we need to switch on Float/Double/Int, and then figure out the
// number of components. The upside is that the Convert Method can internally
// figure out the number of components, and not have to generate alot
// figure out the number of components, and not have to generate a lot
// of template to do so
// Investigate using vtkArrayDispatch, AOS for all types, and than SOA for
......
......@@ -45,7 +45,7 @@ MACRO(CHECK_CXX_SOURCE_RUNS SOURCE VAR COMMENT)
SET(${VAR} 1 CACHE INTERNAL "Test ${COMMENT}")
MESSAGE(STATUS "Performing Test ${COMMENT} - Success")
FILE(APPEND ${CMAKE_BINARY_DIR}/CMakeFiles/CMakeOutput.log
"Performing C++ SOURCE FILE Test ${COMMENT} succeded with the following output:\n"
"Performing C++ SOURCE FILE Test ${COMMENT} succeeded with the following output:\n"
"${OUTPUT}\n"
"Source file was:\n${SOURCE}\n")
ELSE()
......
......@@ -85,7 +85,7 @@ include(FindPackageHandleStandardArgs)
#
# The compilers are detected in this order:
#
# 1. Try to find the most generic availble MPI compiler, as this is usually set up by
# 1. Try to find the most generic available MPI compiler, as this is usually set up by
# cluster admins. e.g., if plain old mpicc is available, we'll use it and assume it's
# the right compiler.
#
......
......@@ -160,7 +160,7 @@ endif ()
# will never adequately match the user's setup, so there is no feasible way
# to detect the "best" version to use. The user will have to manually
# select the right files. (Chances are the distributions are shipping their
# custom version of tbb, anyway, so the problem is probably nonexistant.)
# custom version of tbb, anyway, so the problem is probably nonexistent.)
if (WIN32 AND MSVC)
set(COMPILER_PREFIX "vc7.1")
if (MSVC_VERSION EQUAL 1400)
......
......@@ -405,7 +405,7 @@ if(NOT HDF5_FOUND AND NOT HDF5_ROOT)
#if we detect that occurrence clear the suffix
if(_suffix AND NOT TARGET ${HDF5_${_lang}_TARGET}${_suffix})
if(NOT TARGET ${HDF5_${_lang}_TARGET})
#cant find this component with our without the suffix
#can't find this component with our without the suffix
#so bail out, and let the following locate HDF5
set(HDF5_FOUND FALSE)
break()
......
......@@ -72,7 +72,7 @@
# Generates a file called other_name_export.h containing the macros
# OTHER_NAME_EXPORT, OTHER_NAME_NO_EXPORT and OTHER_NAME_DEPRECATED etc.
#
# The BASE_NAME may be overridden by specifiying other options in the function.
# The BASE_NAME may be overridden by specifying other options in the function.
# For example:
#
# add_library(somelib someclass.cpp)
......
......@@ -2,7 +2,7 @@ if(CMAKE_COMPILER_IS_GNUCXX)
include(CheckCXXCompilerFlag)
# Addtional warnings for GCC
# Additional warnings for GCC
set(CMAKE_CXX_FLAGS_WARN "-Wnon-virtual-dtor -Wno-long-long -ansi -Wcast-align -Wchar-subscripts -Wall -Wextra -Wpointer-arith -Wformat-security -Woverloaded-virtual -Wshadow -Wunused-parameter -fno-check-new -fno-common")
# This flag is useful as not returning from a non-void function is an error
......
......@@ -93,11 +93,11 @@ ENDIF()
IF(CMAKE_CXX_COMPILER_ID STREQUAL "PGI")
# --diag_suppress=236 is for constant value asserts used for error handling
# This can be restricted to the implementation and doesn't need to propogate
# This can be restricted to the implementation and doesn't need to propagate
SET(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} --diag_suppress=236")
# --diag_suppress=381 is for redundant semi-colons used in macros
# This needs to propogate to anything that includes VTK headers
# This needs to propagate to anything that includes VTK headers
SET(VTK_REQUIRED_CXX_FLAGS "${VTK_REQUIRED_CXX_FLAGS} --diag_suppress=381")
ENDIF()
......
# This file ensures the appropriate variables are set up for a project extending
# VTK before including vtkModuleMacros. This is the preferred way for a project
# building aginst VTK to use the CMake infrastructure provided for module
# building against VTK to use the CMake infrastructure provided for module
# developers.
if(NOT VTK_FOUND)
......
......@@ -880,7 +880,7 @@ macro(vtk_module_third_party _pkg)
endif()
#a workaround for bad FindHDF5 behavior in which deb or opt can
#end up empty. cmake >= 2.8.12.2 makes this uneccessary
#end up empty. cmake >= 2.8.12.2 makes this unnecessary
string(REGEX MATCH "debug;.*optimized;.*"
_remove_deb_opt "${vtk${_lower}_LIBRARIES}")
if (_remove_deb_opt)
......
......@@ -138,7 +138,7 @@ vtkRecti vtkContextArea::ComputeExpandedDrawAreaGeometry(vtkContext2D *painter)
// Shorter names for compact readability:
vtkRecti &geo = this->Geometry;
// Set the axes positions. We iterate upto 3 times to converge on the margins.
// Set the axes positions. We iterate up to 3 times to converge on the margins.
vtkRecti draw(this->DrawAreaGeometry); // Start with last attempt
vtkRecti lastDraw;
for (int pass = 0; pass < 3; ++pass)
......
......@@ -42,7 +42,7 @@ int TestTimePointUtility(int, char *[])
continue;
}
// The dates October 5, 1582 thru October 14, 1582 do not exist
// The dates October 5, 1582 through October 14, 1582 do not exist
if (y == 1582)
{
if (m == 10)
......
......@@ -57,7 +57,7 @@ public:
* After Initialize() has been called, the iterator is valid
* so long as the Array has not been modified
* (except using the iterator itself).
* If the array is modified, the iterator must be re-intialized.
* If the array is modified, the iterator must be re-initialized.
*/
virtual void Initialize(vtkAbstractArray* array) = 0;
......
......@@ -46,7 +46,7 @@ public:
* After Initialize() has been called, the iterator is valid
* so long as the Array has not been modified
* (except using the iterator itself).
* If the array is modified, the iterator must be re-intialized.
* If the array is modified, the iterator must be re-initialized.
*/
void Initialize(vtkAbstractArray* array) VTK_OVERRIDE;
......
......@@ -38,7 +38,7 @@ public:
* After Initialize() has been called, the iterator is valid
* so long as the Array has not been modified
* (except using the iterator itself).
* If the array is modified, the iterator must be re-intialized.
* If the array is modified, the iterator must be re-initialized.
*/
void Initialize(vtkAbstractArray* array) VTK_OVERRIDE;
......
......@@ -398,7 +398,7 @@ void vtkObjectFactory::PrintSelf(ostream& os, vtkIndent indent)
for(int i =0; i < num; i++)
{
os << indent << "Class : " << this->GetClassOverrideName(i) << endl;
os << indent << "Overriden with: " << this->GetClassOverrideWithName(i)
os << indent << "Overridden with: " << this->GetClassOverrideWithName(i)
<< endl;
os << indent << "Enable flag: " << this->GetEnableFlag(i) << endl;
os << endl;
......@@ -587,7 +587,7 @@ void vtkObjectFactory::Disable(const char* className)
}
}
// 1,0 is the class overriden by className
// 1,0 is the class overridden by className
int vtkObjectFactory::HasOverride(const char* className)
{
for(int i =0; i < this->OverrideArrayLength; i++)
......@@ -600,7 +600,7 @@ int vtkObjectFactory::HasOverride(const char* className)
return 0;
}
// 1,0 is the class overriden by className/subclassName pair
// 1,0 is the class overridden by className/subclassName pair
int vtkObjectFactory::HasOverride(const char* className,
const char* subclassName)
{
......@@ -629,7 +629,7 @@ vtkObjectFactoryCollection* vtkObjectFactory::GetRegisteredFactories()
}
// 1,0 is the className overriden by any registered factories
// 1,0 is the className overridden by any registered factories
int vtkObjectFactory::HasOverrideAny(const char* className)
{
vtkObjectFactory* factory;
......
......@@ -17,7 +17,7 @@
* @brief Factory object override information
*
* vtkOverrideInformation is used to represent the information about
* a class which is overriden in a vtkObjectFactory.
* a class which is overridden in a vtkObjectFactory.
*
*/
......@@ -40,9 +40,9 @@ public:
void PrintSelf(ostream& os, vtkIndent indent) VTK_OVERRIDE;
/**
* Returns the name of the class being overriden. For example,
* Returns the name of the class being overridden. For example,
* if you had a factory that provided an override for
* vtkVertex, then this funciton would return "vtkVertex"
* vtkVertex, then this function would return "vtkVertex"
*/
const char* GetClassOverrideName()
{
......
......@@ -225,7 +225,7 @@ vtkIdType* vtkSortDataArray::InitializeSortIndices(vtkIdType num)
//---------------------------------------------------------------------------
// Efficent function for generating sort ordering specialized to single
// Efficient function for generating sort ordering specialized to single
// component arrays.
void vtkSortDataArray::
GenerateSort1Indices(int dataType, void *dataIn, vtkIdType numKeys,
......
......@@ -115,7 +115,7 @@ int TestAMRBoxCoarsenRefineOperators()
hi[0] = hi[1] = hi[2] = 33;
Construct3DAMRBox( Ar, lo, hi );
// Save the intial AMR box to A0
// Save the initial AMR box to A0
A0 = A;
// Refine the AMR box to Ar
......
......@@ -277,7 +277,7 @@ public:
double Bounds[6]; //the bounds of the entire domain
//-------------------------------------------------------------------------
// Auxillary information that be computed
// Auxiliary information that be computed
//-------------------------------------------------------------------------
vtkSmartPointer<vtkIntArray> Refinement; //refinement ratio between two adjacent levels
vtkSmartPointer<vtkUnsignedIntArray> BlockLevel; //only necessary if need to call ComputeIndexPair
......
......@@ -172,7 +172,7 @@ void vtkAnimationScene::Play()
(this->PlayMode == PLAYMODE_SEQUENCE)? (1.0 / this->FrameRate) : 1;
do
{
this->Initialize(); // Set the Scene in unintialized mode.
this->Initialize(); // Set the Scene in uninitialized mode.
this->AnimationTimer->StartTimer();
double timer_start_time = currenttime;
double deltatime = 0.0;
......
......@@ -29,7 +29,7 @@
* performs the initial magic of constructing input and output arrays. Then
* the input attributes, and output attributes, are passed to initialize the
* internal structures. Essentially these internal structures are pairs of
* arrays of the same type, which can be efficently accessed and
* arrays of the same type, which can be efficiently accessed and
* assigned. The operations on these array pairs (e.g., interpolation) occur
* using a typeless, virtual dispatch base class.
*
......
......@@ -56,7 +56,7 @@
* ~~~
*
* The example above pulls in bits of information as needed to filter out cells
* that aren't relevent. The least expensive lookups are performed first
* that aren't relevant. The least expensive lookups are performed first
* (cell type, then point ids, then points/full cell) to prevent wasted cycles
* fetching unnecessary data. Also note that at the end of the loop, the
* iterator must be deleted as these iterators are vtkObject subclasses.
......
......@@ -61,7 +61,7 @@ public:
/**
* Copies the tree structure from the input. All pointers to non-composite
* data objects are intialized to NULL. This also shallow copies the meta data
* data objects are initialized to NULL. This also shallow copies the meta data
* associated with all the nodes.
*/
virtual void CopyStructure(vtkCompositeDataSet* input)=0;
......
......@@ -65,7 +65,7 @@ public:
/**
* Copies the tree structure from the input. All pointers to non-composite
* data objects are intialized to NULL. This also shallow copies the meta data
* data objects are initialized to NULL. This also shallow copies the meta data
* associated with all the nodes.
*/
void CopyStructure(vtkCompositeDataSet* input) VTK_OVERRIDE;
......
......@@ -502,7 +502,7 @@ protected:
//@{
/**
* These arrays pointers are caches used to avoid a string comparision (when
* These arrays pointers are caches used to avoid a string comparison (when
* getting ghost arrays using GetArray(name))
*/
vtkUnsignedCharArray* PointGhostArray;
......
......@@ -1812,7 +1812,7 @@ vtkDataSetAttributes::FieldList::~FieldList()
}
//----------------------------------------------------------------------------
// To perform intersection of attribute data, use IntializeFieldList() to grab
// To perform intersection of attribute data, use InitializeFieldList() to grab
// an initial vtkDataSetAttributes. Then use IntersectFieldList() to add (and
// intersect) additional vtkDataSetAttributes.
void vtkDataSetAttributes::FieldList::InitializeFieldList(
......
......@@ -429,7 +429,7 @@ void vtkEdgeTable::InsertEdge(vtkIdType p1, vtkIdType p2, void* ptr)
//----------------------------------------------------------------------------
// Intialize traversal of edges in table.
// Initialize traversal of edges in table.
void vtkEdgeTable::InitTraversal()
{
this->Position[0] = 0;
......
......@@ -140,7 +140,7 @@ public:
//@}
/**
* Intialize traversal of edges in table.
* Initialize traversal of edges in table.
*/
void InitTraversal();
......
......@@ -31,7 +31,7 @@
#include <cassert>
#include <vector>
// Some usefull extent macros
// Some useful extent macros
#define EMIN(ext, dim) (ext[2*dim])
#define EMAX(ext, dim) (ext[2*dim+1])
#define IMIN(ext) (ext[0])
......
......@@ -325,7 +325,7 @@ void vtkGenericAttributeCollection::DeepCopy(vtkGenericAttributeCollection *othe
}
this->AttributeInternalVector->Vector[i]->DeepCopy(
other->AttributeInternalVector->Vector[i]);
// Dont need to copy the contents of AttributeIndices: it will be
// Don't need to copy the contents of AttributeIndices: it will be
// recomputed because of the following Moditied call.
}
this->Modified();
......
......@@ -16,7 +16,7 @@
* @brief Backwards compatibility class
*
*
* An empty class for backwards compatiblity
* An empty class for backwards compatibility
*
* @sa
* vtkUniformGridAM vtkOverlappingAMR vtkNonOverlappingAMR
......
......@@ -412,7 +412,7 @@ double vtkKdNode::_GetDistance2ToBoundary(
}
}
// if there are no inner boundaries we dont want to square.
// if there are no inner boundaries we don't want to square.
if(minDistance != VTK_FLOAT_MAX)
{
minDistance *= minDistance;
......
......@@ -69,7 +69,7 @@
* Note that since the implementation class is used as a compile-time template
* parameter in vtkMappedUnstructuredGrid, the above methods do not need be
* virtuals. The compiler will statically bind the calls, making dynamic vtable
* lookups unneccessary and giving a slight performance boost.
* lookups unnecessary and giving a slight performance boost.
*
* Adapting a filter or algorithm to safely traverse the
* vtkMappedUnstructuredGrid's topology requires removing calls the following
......
......@@ -415,7 +415,7 @@ double vtkOctreePointLocatorNode::_GetDistance2ToBoundary(
}
}
// if there are no inner boundaries we dont want to square.
// if there are no inner boundaries we don't want to square.
if(minDistance != VTK_FLOAT_MAX)
{
minDistance *= minDistance;
......
......@@ -168,7 +168,7 @@ public:
bool FindGrid(double q[3], unsigned int& level, unsigned int& gridId);
/**
* Get/Set the interal representation of amr meta meta data
* Get/Set the internal representation of amr meta meta data
*/
vtkAMRInformation* GetAMRInfo() VTK_OVERRIDE
{ return Superclass::GetAMRInfo();}
......
......@@ -263,7 +263,7 @@ void vtkPixelExtent::Merge(deque<vtkPixelExtent> &exts)
vtkPixelExtent &ext0 = tmpExts[t];
if (ext0.Empty())
{
// was merged in preceeding pass
// was merged in preceding pass
continue;
}
......@@ -279,7 +279,7 @@ void vtkPixelExtent::Merge(deque<vtkPixelExtent> &exts)
vtkPixelExtent &ext1 = tmpExts[c];
if (ext1.Empty())
{
// was merged in preceeding pass
// was merged in preceding pass
continue;
}
......
......@@ -18,7 +18,7 @@
*
*
* Class to handle non-contiguous data transfers of data described
* by pixel extents within a process. For transfering data between
* by pixel extents within a process. For transferring data between
* processes see vtkPPixelTransfer.
*
* @sa
......
......@@ -186,14 +186,14 @@ int vtkPolyLine::GenerateSlidingNormals(vtkPoints *pts, vtkCellArray *lines,
//compute rotation vector
vtkVector3d w = sPrev.Cross(normal);
if (w.Normalize() == 0.0) // cant use this segment
if (w.Normalize() == 0.0) // can't use this segment
{
continue;
}
//compute rotation of line segment
vtkVector3d q = sNext.Cross(sPrev);
if (q.Normalize() == 0.0) // cant use this segment
if (q.Normalize() == 0.0) // can't use this segment
{
continue;
}
......
......@@ -146,7 +146,7 @@ public:
* Compute the area of a polygon in 3D. The area is returned, as well as
* the normal (a side effect of using this method). If you desire to
* compute the area of a triangle, use vtkTriangleArea which is faster.
* If pts==NULL, point indexing is suposed to be {0, 1, ..., numPts-1}.
* If pts==NULL, point indexing is supposed to be {0, 1, ..., numPts-1}.
* If you already have a vtkPolygon instantiated, a convenience function,
* ComputeArea() is provided.
*/
......
......@@ -25,7 +25,7 @@
* where point ids 0-5 are the six corner vertices of the wedge; followed by
* six midedge nodes (6-12). Note that these midedge nodes correspond lie
* on the edges defined by (0,1), (1,2), (2,0), (3,4), (4,5), (5,3).
* The Edges (0,3), (1,4), (2,5) dont have midedge nodes.
* The Edges (0,3), (1,4), (2,5) don't have midedge nodes.
*
* @sa
* vtkQuadraticEdge vtkQuadraticTriangle vtkQuadraticTetra
......
......@@ -314,7 +314,7 @@ istream &operator>>(istream &sin, vtkQuadratureSchemeDefinition &def)
vtkGenericWarningMacro("Empty definition found in stream.");
}
// intialize the object
// initialize the object
def.Initialize(cellType,nNodes,nQuadPts,SfWt,QWt);
// clean up
......
......@@ -157,7 +157,7 @@ public:
this->MainNodeTable.FreeZone=1;
// Clear node
this->GetNode(1)->ArcUpId = ((int)-2);
// Intialize DownArc
// Initialize DownArc
this->GetNode(1)->ArcDownId = 0;
this->MainArcTable.FreeZone=1;
// Clear Arc label 1
......
......@@ -1567,7 +1567,7 @@ void vtkSimpleCellTessellator::InsertEdgesIntoEdgeTable(vtkTriangleTile &tri )
pcoords[2] = tri.GetVertex(l)[2] + alpha*(tri.GetVertex(r)[2] - tri.GetVertex(l)[2]);
tri.SetVertex(j+3, pcoords);
// note we dont need to call SetEdgeParent() because
// note we don't need to call SetEdgeParent() because
// if the edge is already in the hashtable it means that
// it is already tessellated. All other point using this
// edge will come from either inside the triangle either from
......
......@@ -1055,7 +1055,7 @@ void vtkCompositeDataPipeline::MarkOutputsGenerated(
size_t count = outInfo->Length(UPDATE_COMPOSITE_INDICES());
int* indices = new int[count];
// assume the source produced the blocks it was asked for:
// the indices recieved are what was requested
// the indices received are what was requested
outInfo->Get(UPDATE_COMPOSITE_INDICES(),indices);
outInfo->Set(DATA_COMPOSITE_INDICES(), indices,
static_cast<int>(count));
......
......@@ -20,7 +20,7 @@
* UPDATE_NUMBER_OF_PIECES where downstream can request that upstream provides
* data partitioned into a certain number of pieces. There are several components
* that make this work. First, the key will copy itself upstream during
* REQUEST_UPDATE_EXTENT. Second, after a successfull execution, it will stor
* REQUEST_UPDATE_EXTENT. Second, after a successful execution, it will stor
* its value into a data object's information using a specific key defined by
* its data member DataKey. Third, before execution, it will check if the requested
* value matched the value in the data object's information. If not, it will ask
......
......@@ -50,7 +50,7 @@ vtkThreadedImageAlgorithm::vtkThreadedImageAlgorithm()
this->SplitPath[2] = 0;
this->SplitPathLength = 3;
// Minumum block size
// Minimum block size
this->MinimumPieceSize[0] = 16;
this->MinimumPieceSize[1] = 1;
this->MinimumPieceSize[2] = 1;
......@@ -435,7 +435,7 @@ static VTK_THREAD_RETURN_TYPE vtkThreadedImageAlgorithmThreadedExecute( void *ar
}
// else
// {
// otherwise don't use this thread. Sometimes the threads dont
// otherwise don't use this thread. Sometimes the threads don't
// break up very well and it is just as efficient to leave a
// few threads idle.
// }
......
......@@ -133,7 +133,7 @@ public:
/**
* Specify which type of function to use for interpolation. By default
* (SetInterpolationFunctionToSpline()), cubic spline interpolation using a
* modifed Kochanek basis is employed. Otherwise, if
* modified Kochanek basis is employed. Otherwise, if
* SetInterpolationFunctionToLinear() is invoked, linear spherical interpolation
* is used between each pair of quaternions.
*/
......
......@@ -1928,7 +1928,7 @@ unsigned char vtkFunctionParser::GetOperandNumber(int currentIndex)
bool scalarVar = false;
size_t currentLen = 0;
//Bug 7396. If a scalar variable name is a subset of a vector var name it will
//casue the scripting to crash. So instead of ending once we find a var name that matches in scalars
//cause the scripting to crash. So instead of ending once we find a var name that matches in scalars
//we will also check vectors
for (int i = 0, max = this->GetNumberOfScalarVariables(); i < max; i++)
{ // Variable
......
......@@ -69,7 +69,7 @@ public:
/**
* Selects set of sockets. Returns 0 on timeout, -1 on error.
* 1 on success. Selected socket's index is returned thru
* 1 on success. Selected socket's index is returned through
* selected_index
*/
static int SelectSockets(const int* sockets_to_select, int size,
......
......@@ -270,7 +270,7 @@ this template explosion in check.
Starting with VTK 7.1, the Array-Of-Structs (AOS) memory layout is no longer
the only `vtkDataArray` implementation provided by the library. The
Struct-Of-Arrays (SOA) memory layout is now available throught the
Struct-Of-Arrays (SOA) memory layout is now available through the
`vtkSOADataArrayTemplate` class. The SOA layout assumes that the components of
an array are stored separately, as in:
......
......@@ -68,7 +68,7 @@ protected:
vtkInformationVector *) VTK_OVERRIDE;
char *FileName;
std::vector<istream::pos_type> file_positions; // to store begining of each tstep
std::vector<istream::pos_type> file_positions; // to store beginning of each tstep
std::vector<double> TimeSteps;
int NumberOfTimeSteps;
......
......@@ -19,7 +19,7 @@ to handle them yourself and maniputlate the camera directly.
In this example the code is a bit more distributed. The C++ code is in
jni/main.cxx while the Java/C++ interface API is defined in JavaVTKLib.java
The bulk of the actual applicaiton logic is in JavaVTKView.java
The bulk of the actual application logic is in JavaVTKView.java
The third example is VolumeRender and this example requires OpenGL ES 3.0
support. Most newer android devices should support OpenGL ES 3.0.
......
......@@ -22,7 +22,7 @@
{
[[self leftVTKView] initializeVTKSupport];
// 'smart pointers' are used because they are very similiar to reference counting in Cocoa.
// 'smart pointers' are used because they are very similar to reference counting in Cocoa.
// Personal Taste Section. I like to use a trackball interactor
vtkSmartPointer<vtkInteractorStyleSwitch> intStyle = vtkSmartPointer<vtkInteractorStyleSwitch>::New();
......@@ -52,14 +52,14 @@
{
[[self rightVTKView] initializeVTKSupport];
// 'smart pointers' are used because they are very similiar to reference counting in Cocoa.
// 'smart pointers' are used because they are very similar to reference counting in Cocoa.
// Personal Taste Section. I like to use a trackball interactor
vtkSmartPointer<vtkInteractorStyleSwitch> intStyle = vtkSmartPointer<vtkInteractorStyleSwitch>::New();
intStyle->SetCurrentStyleToTrackballCamera();
[[self rightVTKView] getInteractor]->SetInteractorStyle(intStyle);
// Create a cyclinder, see the "VTK User's Guide" for details
// Create a cylinder, see the "VTK User's Guide" for details
vtkSmartPointer<vtkCylinderSource> cylinder = vtkSmartPointer<vtkCylinderSource>::New();
cylinder->SetResolution(100);
......
......@@ -65,7 +65,7 @@ ren.AddActor(selectActor)
ren.SetBackground(0.1, 0.2, 0.4)
renWin.SetSize(300, 300)
# This callback funciton does the actual work: updates the vtkPlanes
# This callback function does the actual work: updates the vtkPlanes
# implicit function. This in turn causes the pipeline to update.
def SelectPolygons(object, event):
# object will be the boxWidget
......
......@@ -212,7 +212,7 @@ void __fastcall TvtkBorlandRenderWindow::Paint(void)