...
 
Commits (4)
......@@ -102,6 +102,9 @@ set(vtk_cmake_patch_files
patches/3.10/FindMPI/test_mpi.c
patches/3.10/FindMPI/test_mpi.f90.in
patches/3.10/FindMPI.cmake
patches/3.13/FindPython/Support.cmake
patches/3.13/FindPython2.cmake
patches/3.13/FindPython3.cmake
patches/3.13/FindZLIB.cmake
patches/99/FindGDAL.cmake
patches/99/FindJPEG.cmake
......
......@@ -1342,7 +1342,7 @@ endfunction ()
#[==[.md INTERNAL
## VTK module properties
The VTK module system leverages CMake's target propogation and storage. As
The VTK module system leverages CMake's target propagation and storage. As
such, there are a number of properties added to the targets representing
modules. These properties are intended for use by the module system and
associated functionality. In particular, more properties may be available by
......@@ -1378,12 +1378,12 @@ mentioned in the previous section.
is used by the autoinit subsystem and generally is not required.
* `implementable`: If set, this module provides registries which may be
populated by dependent modules. It is used to check the `implements`
property to help minimize unnecessary work from the autoinit sybsystem.
property to help minimize unnecessary work from the autoinit subsystem.
* `needs_autoinit`: If set, linking to this module requires the autoinit
subsystem to ensure that registries in modules are fully populated.
* `headers`: Paths to the public headers from the module. These are the
headers which should be handled by language wrappers.
* `hierarchy`: The path to the hierarchy file describing inheritence of the
* `hierarchy`: The path to the hierarchy file describing inheritance of the
classes for use in language wrappers.
In order to add new module properties to a module, the
......@@ -1433,7 +1433,7 @@ _vtk_module_export_properties(
The `MODULE`, `BUILD_FILE`, and `INSTALL_FILE` arguments are required. The
`MODULE` argument holds the name of the module that will have properties
exported. The `BUILD_FILE` and `INSTALL_FILE` paths are *appended to*. As such,
when setting up these files, it should be preceeded with:
when setting up these files, it should be preceded with:
```cmake
file(WRITE "${build_file}")
......@@ -2695,7 +2695,7 @@ the associated files are not installed or available for wrapping.
* `SOURCES`: A list of source files which require compilation.
* `HEADERS`: A list of header files which will be available for wrapping and
installed.
* `TEMPLATES`: A list of tempalte files which will be installed.
* `TEMPLATES`: A list of template files which will be installed.
#]==]
function (vtk_module_add_module name)
if (NOT name STREQUAL _vtk_build_module)
......
......@@ -139,7 +139,7 @@ public:
VTK_ITER_INLINE GenericTupleSize(vtkDataArray *) {}
};
// Specialize for dynamic types, mimicing integral_constant API:
// Specialize for dynamic types, mimicking integral_constant API:
template <>
struct GenericTupleSize<DynamicTupleSize>
{
......
......@@ -2702,7 +2702,7 @@ void vtkHyperTreeGrid::ShiftDualCornerFromMaskedLeaf2D( vtkHyperTreeGridNonOrien
vtkIdType idS = cursorS->GetGlobalNodeIndex();
if (! mask->GetValue( idS ) )
{
// Dual point must be adusted
// Dual point must be adjusted
this->PointShifted[idS] = true;
this->PointShifts[axisSN][idS] = cursorS->GetTree()->GetScale( axisSN )
* this->ReductionFactors[cursorS->GetLevel()];
......@@ -2715,7 +2715,7 @@ void vtkHyperTreeGrid::ShiftDualCornerFromMaskedLeaf2D( vtkHyperTreeGridNonOrien
vtkIdType idW = cursorW->GetGlobalNodeIndex();
if ( ! mask->GetValue( idW ) )
{
// Dual point must be adusted
// Dual point must be adjusted
this->PointShifted[idW] = true;
this->PointShifts[axisWE][idW] = cursorW->GetTree()->GetScale( axisWE )
* this->ReductionFactors[cursorW->GetLevel()];
......@@ -2728,7 +2728,7 @@ void vtkHyperTreeGrid::ShiftDualCornerFromMaskedLeaf2D( vtkHyperTreeGridNonOrien
vtkIdType idE = cursorE->GetGlobalNodeIndex();
if ( ! mask->GetValue( idE ) )
{
// Dual point must be adusted
// Dual point must be adjusted
this->PointShifted[idE] = true;
this->PointShifts[axisWE][idE] = - cursorE->GetTree()->GetScale( axisWE )
* this->ReductionFactors[cursorE->GetLevel()];
......@@ -2741,7 +2741,7 @@ void vtkHyperTreeGrid::ShiftDualCornerFromMaskedLeaf2D( vtkHyperTreeGridNonOrien
vtkIdType idN = cursorN->GetGlobalNodeIndex();
if ( ! mask->GetValue( idN ) )
{
// Dual point must be adusted
// Dual point must be adjusted
this->PointShifted[idN] = true;
this->PointShifts[axisSN][idN] = - cursorN->GetTree()->GetScale( axisSN )
* this->ReductionFactors[cursorN->GetLevel()];
......@@ -2754,7 +2754,7 @@ void vtkHyperTreeGrid::ShiftDualCornerFromMaskedLeaf2D( vtkHyperTreeGridNonOrien
vtkIdType idSE = cursorSE->GetGlobalNodeIndex();
if ( ! mask->GetValue( idSE ) && ! this->PointShifted[idSE] )
{
// Dual point must be adusted
// Dual point must be adjusted
double shift[3];
cursorSE->GetTree()->GetScale( shift );
double factor = this->ReductionFactors[cursorSE->GetLevel()];
......@@ -2769,7 +2769,7 @@ void vtkHyperTreeGrid::ShiftDualCornerFromMaskedLeaf2D( vtkHyperTreeGridNonOrien
vtkIdType idSW = cursorSW->GetGlobalNodeIndex();
if ( ! mask->GetValue( idSW ) && ! this->PointShifted[idSW] )
{
// Dual point must be adusted
// Dual point must be adjusted
double shift[3];
cursorSW->GetTree()->GetScale( shift );
double factor = this->ReductionFactors[cursorSW->GetLevel()];
......@@ -2784,7 +2784,7 @@ void vtkHyperTreeGrid::ShiftDualCornerFromMaskedLeaf2D( vtkHyperTreeGridNonOrien
vtkIdType idNW = cursorNW->GetGlobalNodeIndex();
if( ! mask->GetValue( idNW ) && ! this->PointShifted[idNW] )
{
// Dual point must be adusted
// Dual point must be adjusted
double shift[3];
cursorNW->GetTree()->GetScale( shift );
double factor = this->ReductionFactors[cursorNW->GetLevel()];
......@@ -2799,7 +2799,7 @@ void vtkHyperTreeGrid::ShiftDualCornerFromMaskedLeaf2D( vtkHyperTreeGridNonOrien
vtkIdType idNE = cursorNE->GetGlobalNodeIndex();
if( ! mask->GetValue( idNE ) && ! this->PointShifted[idNE] )
{
// Dual point must be adusted
// Dual point must be adjusted
double shift[3];
cursorNE->GetTree()->GetScale( shift );
double factor = this->ReductionFactors[cursorNE->GetLevel()];
......@@ -2870,7 +2870,7 @@ void vtkHyperTreeGrid::ShiftDualCornerFromMaskedLeaf3D( vtkHyperTreeGridNonOrien
vtkIdType idE = cursorE->GetGlobalNodeIndex();
if ( ! mask->GetValue( idE ) && ! this->PointShifted[idE] )
{
// Dual point must be adusted
// Dual point must be adjusted
this->PointShifted[idE] = true;
double shift[3];
cursorE->GetTree()->GetScale( shift );
......@@ -2899,7 +2899,7 @@ void vtkHyperTreeGrid::ShiftDualCornerFromMaskedLeaf3D( vtkHyperTreeGridNonOrien
vtkIdType idC = cursorC->GetGlobalNodeIndex();
if ( ! mask->GetValue( idC ) && ! this->PointShifted[idC] )
{
// Dual point must be adusted
// Dual point must be adjusted
this->PointShifted[idC] = true;
double shift[3];
cursorC->GetTree()->GetScale( shift );
......
......@@ -16,8 +16,8 @@
* @class vtkHyperTreeGridEntry
* @brief Entries are cache data for cursors
*
* Entries are relevant for cursor/supercursor developpers. Filters
* developpers should have a look at cursors/supercursors documentation.
* Entries are relevant for cursor/supercursor developers. Filters
* developers should have a look at cursors/supercursors documentation.
* (cf. vtkHyperTreeGridNonOrientedCursor). When writing a new cursor or
* supercursor the choice of the entry is very important: it will drive
* the performance and memory cost. This is even more important for
......
......@@ -548,7 +548,7 @@ bool vtkHyperTreeGridNonOrientedMooreSuperCursor::GetCornerCursors( unsigned int
cursorIdx = CornerNeighborCursorsTable3D[c][l];
break;
default:
vtkErrorMacro("unexpected neigborhood");
vtkErrorMacro("unexpected neighborhood");
return false;
} // switch ( N )
......
......@@ -549,7 +549,7 @@ bool vtkHyperTreeGridNonOrientedMooreSuperCursorLight::GetCornerCursors( unsigne
cursorIdx = CornerNeighborCursorsTable3D[c][l];
break;
default:
vtkErrorMacro("unexpected neigborhood");
vtkErrorMacro("unexpected neighborhood");
return false;
} // switch ( N )
......
......@@ -255,7 +255,7 @@ void vtkIncrementalOctreeNode::SeperateExactlyDuplicatePointsFromNewInsertion
vtkIncrementalOctreeNode * duplic = this;
vtkIncrementalOctreeNode * single = this;
// the coordiate of the duplicate points: note pntIds == this->PointIdSet
// the coordinate of the duplicate points: note pntIds == this->PointIdSet
points->GetPoint( pntIds->GetId( 0 ), dupPnt );
while ( duplic == single ) // as long as separation has not been achieved
......
......@@ -218,7 +218,7 @@ public:
vtkIdType &numUniqueEdges);
/**
* This method contructs the edge locator to be used when searching for
* This method constructs the edge locator to be used when searching for
* edges. Basically it does a sort of the provided numEdges edges (which
* likely contains duplicates), and builds an offset table to provide rapid
* access to edge (v0,v1). The sort is performed via a parallel
......
......@@ -106,7 +106,7 @@ struct BaseCell
// Set up the case table. This is done by accessing standard VTK cells and
// repackaging the case table for efficiency. The format of the case table
// is as follows: a linear array, organized into two parts: 1) offets into
// is as follows: a linear array, organized into two parts: 1) offsets into
// the second part, and 2) the cases. The first 2^NumVerts entries are the
// offsets which refer to the 2^NumVerts cases in the second part. Each
// case is represented by the number of edges, followed by pairs of
......@@ -392,7 +392,7 @@ struct CellIter
const unsigned short *Cases;
vtkIdType Incr;
// Refernces to unstructured grid for cell traversal.
// References to unstructured grid for cell traversal.
vtkIdType NumCells;
const unsigned char *Types;
const vtkIdType *Conn;
......@@ -806,7 +806,7 @@ struct ContourCellsST : public ContourCellsBase<TIP,TOP,TS>
};//ContourCellsST
// Dispath method for Fast path processing. Handles template dispatching etc.
// Dispatch method for Fast path processing. Handles template dispatching etc.
template <typename TS>
void ProcessFastPath(vtkIdType numCells, vtkPoints *inPts, CellIter *cellIter,
TS *s, double isoValue, vtkScalarTree *st, vtkPoints *outPts,
......
......@@ -187,7 +187,7 @@ def GetBitcodeFromConditional( conditional, indices ):
# This edge pair is unimportant (inequality contains
# more constraints than are required to characterize
# this case). Print warning and skip:
print('*** WARNING *** Edge comparison %s %s %s unneccessary!' % ( v[i-1], v[i], v[i+1] ))
print('*** WARNING *** Edge comparison %s %s %s unnecessary!' % ( v[i-1], v[i], v[i+1] ))
continue
if v[i] == ',':
continue
......
......@@ -72,7 +72,7 @@
* the Voronoi tessellation requires unique input points.
*
* @warning
* This is a novel approach which implements an embarrasingly parallel
* This is a novel approach which implements an embarrassingly parallel
* algorithm. At the core of the algorithm a locator is used to determine
* points close to a specified position. A vtkStaticPointLocator2D is used
* because it is both threaded (when constructed) and supports thread-safe
......
......@@ -370,7 +370,7 @@ public:
int &localAssignedCount);
/**
* give each one a uniqu ID. We need to use MPI to find out
* give each one a unique ID. We need to use MPI to find out
* who is using which numbers.
*/
virtual void AssignUniqueIds(
......
......@@ -311,7 +311,7 @@ public:
int &LocalAssignedCount);
/**
* give each one a uniqu ID. We need to use MPI to find out
* give each one a unique ID. We need to use MPI to find out
* who is using which numbers.
*/
virtual void AssignUniqueIds(
......
......@@ -2836,7 +2836,7 @@ namespace vtkYoungsMaterialInterfaceCellCutInternals
/*
Computes the area of the intersection between the plane, orthognal to the 'normal' vector,
Computes the area of the intersection between the plane, orthogonal to the 'normal' vector,
that passes through P1 (resp. P2), and the given tetrahedron.
the resulting area function, is a function of the intersection area given the distance of the cutting plane to the origin.
*/
......
......@@ -443,12 +443,12 @@ void vtkAdaptiveDataSetSurfaceFilter::RecursivelyProcessTreeNot3D(
if ( this->CircleSelection )
{
//JB On determine si la maille correspondant au current node of the tree
//JB is going to be renedered.
//JB is going to be rendered.
//JB Pour cela, on fait une premiere approximation en considerant la maille
//JB carre qui l'englobe en conservant la meme origine et en fixant sa demi-largeur
//JB a la valeur maximale entre les valeurs de demi-largeur et demi-longueur.
double half = std::max( halfAxis1, halfAxis2 );
//JB This cell must to be rendered si le centre de cette maille se trouve a moins de
//JB This cell must be rendered si le centre de cette maille se trouve a moins de
//JB Radius + half * sqrt(2) du camera focal point. Radius est le rayon minimal du cercle
//JB centre sur la camera focal point couvrant la fenetre de rendu.
//JB Le centre de la maille se trouve a Origin + half, par direction.
......@@ -466,7 +466,7 @@ void vtkAdaptiveDataSetSurfaceFilter::RecursivelyProcessTreeNot3D(
if ( insideBB && this->BBSelection )
{
//JB On determine si la maille correspondant au current node of the tree
//JB is going to be renedered.
//JB is going to be rendered.
//JB Pour cela, on verifie si la maille est dans une boite englobante correspondant a la
//JB projection de l'ecran dans le monde du maillage.
insideBB = ( ( originAxis1 + 2 * halfAxis1 >= this->WindowBounds[0] )
......
......@@ -20,7 +20,7 @@
* of the major continents of the earth. The OnRatio determines
* how much of the data is actually used. The radius defines the radius
* of the sphere at which the continents are placed. Obtains data from
* an imbedded array of coordinates.
* an embedded array of coordinates.
*/
#ifndef vtkEarthSource_h
......
......@@ -130,7 +130,7 @@ protected:
double Plane[4];
/**
* Decide wether output mesh should be a computed on dual grid
* Decide whether output mesh should be a computed on dual grid
*/
int Dual;
......
......@@ -251,7 +251,7 @@ bool vtkHyperTreeGridThreshold::RecursivelyProcessTree( vtkHyperTreeGridNonOrien
} // if ( ! inCursor->IsLeaf() && inCursor->GetCurrentDepth() < this->Depth )
else
{
// Input cursor is at leaf, check whether it is withing range
// Input cursor is at leaf, check whether it is within range
double value = this->InScalars->GetTuple1( inId );
if( ! ( this->InMaterialMask && this->InMaterialMask->GetValue( inId ) )
&& value >= this->LowerThreshold && value <= this->UpperThreshold )
......@@ -303,7 +303,7 @@ bool vtkHyperTreeGridThreshold::RecursivelyProcessTreeWithCreateNewMask( vtkHype
} // if ( ! inCursor->IsLeaf() && inCursor->GetCurrentDepth() < this->Depth )
else
{
// Input cursor is at leaf, check whether it is withing range
// Input cursor is at leaf, check whether it is within range
double value = this->InScalars->GetTuple1( outId );
discard = value < this->LowerThreshold || value > this->UpperThreshold;
} // else
......
......@@ -86,7 +86,7 @@ protected:
int &localAssignedCount) override;
/**
* give each one a uniqu ID. We need to use MPI to find out
* give each one a unique ID. We need to use MPI to find out
* who is using which numbers.
*/
virtual void AssignUniqueIds(
......
......@@ -99,7 +99,7 @@ public:
int &LocalAssignedCount) override;
/**
* give each one a uniqu ID. We need to use MPI to find out
* give each one a unique ID. We need to use MPI to find out
* who is using which numbers.
*/
virtual void AssignUniqueIds(
......
......@@ -43,7 +43,7 @@ int TestRasterReprojectionFilter(int argc, char* argv[])
reader->SetFileName(fname);
delete[] fname;
// test that we read the NoData value corectly
// test that we read the NoData value correctly
reader->Update();
double nodata = reader->GetInvalidValue(0);
double expectedNodata = -32768;
......
......@@ -34,7 +34,7 @@
* The leafs of the multiblock dataset (which are polygonal datasets)
* have a field array with one element called "gml_id" which
* coresponds to the gml:id for gml:TriangulatedSurface,
* corresponds to the gml:id for gml:TriangulatedSurface,
* gml:MultiSurface or gml:CompositeSurface in the CityGML file. If
* the poly dataset has a texture, we specify this with a point array
* called "tcoords" and a field array with one element called
......
......@@ -471,7 +471,7 @@ static void vtkThreadSleep(double time)
{
if (i == 0 && count % 100 == 0)
{
cerr << "dropped frames, now beind by " << remaining << " seconds\n";
cerr << "dropped frames, now behind by " << remaining << " seconds\n";
}
break;
}
......
......@@ -127,7 +127,7 @@ public:
void InternalGrab() override;
// is the video at the end of file?
// Usefull for while loops
// Useful for while loops
vtkGetMacro(EndOfFile,bool);
// Is the video stream stereo 3d
......
......@@ -76,7 +76,7 @@ int TestGDALRasterNoDataValue(int argc, char** argv)
++numErrors;
}
// test that we read the NoData value corectly
// test that we read the NoData value correctly
double nodata = reader->GetInvalidValue(0);
double expectedNodata = -3.40282346638529993e+38;
double tolerance = 1e+26;
......
......@@ -77,7 +77,7 @@ public:
/**
* Get/Set if bands are collated in one scalar array.
* Currently we collate RGB, RGBA, gray alpha and pallete.
* Currently we collate RGB, RGBA, gray alpha and palette.
* The default is true.
*/
vtkSetMacro(CollateBands, bool);
......
......@@ -46,7 +46,7 @@ int TestOpenFOAMReaderRegEx(int argc, char* argv[])
// Now, this is what we expect to be read from the OpenFOAM test case.
// Every time a field at a given patch is read and verified, its data
// are erased from this data structure, until at the end it shoud remain
// are erased from this data structure, until at the end it should remain
// totally empty.
std::map<std::string,std::map<std::string, std::vector<double>>> expected_data =
{
......
......@@ -4337,7 +4337,7 @@ void vtkFoamEntry::Read(vtkFoamIOobject& io)
// keyword nor list type specifier (i. e. `0()';
// e. g. simpleEngine/0/polyMesh/pointZones) requires special
// care (one with nonuniform prefix is treated within
// vtkFoamEntryValue::read()). still this causes errornous
// vtkFoamEntryValue::read()). still this causes erroneous
// behavior for `0 nonuniform 0()' but this should be extremely
// rare
if (lastValue.GetType() == vtkFoamToken::EMPTYLIST && secondLastValue
......
......@@ -30,7 +30,7 @@
* read. Thus to read an image set ImageRange[0] = ImageRange[1] = slice
* number. The default behavior is to read a single file (i.e., image slice 1).
*
* The DataMask instance variable is used to read data files with imbedded
* The DataMask instance variable is used to read data files with embedded
* connectivity or segmentation information. For example, some data has
* the high order bit set to indicate connected surface. The DataMask allows
* you to select this data. Other important ivars include HeaderSize, which
......
......@@ -30,7 +30,7 @@
* read. Thus to read an image set ImageRange[0] = ImageRange[1] = slice
* number. The default behavior is to read a single file (i.e., image slice 1).
*
* The DataMask instance variable is used to read data files with imbedded
* The DataMask instance variable is used to read data files with embedded
* connectivity or segmentation information. For example, some data has
* the high order bit set to indicate connected surface. The DataMask allows
* you to select this data. Other important ivars include HeaderSize, which
......
......@@ -15,7 +15,7 @@ PURPOSE. See the above copyright notice for more information.
*
* vtkAxisActor creates an axis with tick marks, labels, and/or a title,
* depending on the particular instance variable settings. It is assumed that
* the axes is part of a bounding box and is orthoganal to one of the
* the axes is part of a bounding box and is orthogonal to one of the
* coordinate axes. To use this class, you typically specify two points
* defining the start and end points of the line (xyz definition using
* vtkCoordinate class), the axis type (X, Y or Z), the axis location in
......
......@@ -50,7 +50,7 @@ public:
/**
* Reads the given file of materials and creates the in memory data
* structures needed to display objects with them. Returns false only if
* file could not be meaningfully interpretted.
* file could not be meaningfully interpreted.
*/
bool ReadFile(const char*FileName);
......@@ -62,7 +62,7 @@ public:
/**
* DeSerialize contents from an in memory buffer as ReadFile does from a
* file or set of files. Returns false only if buffer could not be
* meaningfully interpretted.
* meaningfully interpreted.
*/
bool ReadBuffer(const char*Buffer);
......
......@@ -162,7 +162,7 @@ public:
void SetIsPicking(vtkTypeBool isPicking) override;
/**
* Overriden to invoke vtkCommand::CursorChangedEvent
* Overridden to invoke vtkCommand::CursorChangedEvent
*/
void SetCurrentCursor(int cShape) override;
......
......@@ -16,7 +16,7 @@
* @class vtkPanoramicProjectionPass
* @brief Render pass that render the scene in a cubemap and project
* these six renderings to a single quad.
* There are currently two differents projections implemented (Equirectangular and Azimuthal).
* There are currently two different projections implemented (Equirectangular and Azimuthal).
* This pass can be used to produce images that can be visualize with specific devices that re-maps
* the distorted image to a panoramic view (for instance VR headsets, domes, panoramic screens)
*
......
......@@ -22,7 +22,7 @@
* - Reinhard: maps the color using formula: x/(x+1)
* - Exponential: maps the colors using a coefficient and the formula: 1-exp(-a*x)
*
* Advanced tone maping like Reinhard or Exponential can be useful when several lights
* Advanced tone mapping like Reinhard or Exponential can be useful when several lights
* are added to the renderer.
*
* @sa
......