Commit 62714d18 authored by Bill Lorensen's avatar Bill Lorensen

DOC: More spelling errors

Mainly
lying -> laying
loose -> lose

Change-Id: Iaa639ebcf5262ea6dfeb25cf21d6c49b5020458b
parent 8fded0d3
......@@ -319,7 +319,7 @@ void vtkCompositeControlPointsItem::MergeTransferFunctions()
this->OpacityFunction->GetNodeValue(i, piecewisePoint);
double rgb[3];
this->ColorTransferFunction->GetColor(piecewisePoint[0], rgb);
// note that we might loose the midpoint/sharpness of the point if any
// note that we might lose the midpoint/sharpness of the point if any
this->ColorTransferFunction->RemovePoint(piecewisePoint[0]);
this->ColorTransferFunction->AddRGBPoint(piecewisePoint[0], rgb[0], rgb[1], rgb[2], piecewisePoint[2], piecewisePoint[3]);
}
......@@ -330,7 +330,7 @@ void vtkCompositeControlPointsItem::MergeTransferFunctions()
double xrgbms[6];
this->ColorTransferFunction->GetNodeValue(i, xrgbms);
double value = this->OpacityFunction->GetValue(xrgbms[0]);
// note that we might loose the midpoint/sharpness of the point if any
// note that we might lose the midpoint/sharpness of the point if any
this->OpacityFunction->RemovePoint(xrgbms[0]);
this->OpacityFunction->AddPoint(xrgbms[0], value, xrgbms[4], xrgbms[5]);
}
......
......@@ -56,7 +56,7 @@ ENDFOREACH (test)
#
# Add the TestCxxFeatures test by itself so that if it doesn't compile
# we don't loose all the tests for common
# we don't lose all the tests for common
#
ADD_EXECUTABLE(TestCxxFeatures TestCxxFeatures.cxx)
TARGET_LINK_LIBRARIES(TestCxxFeatures vtkCommon)
......
......@@ -56,7 +56,7 @@ vtkConeSource cone
# Create a vtkGlyph3D to dispatch the glyph/cone geometry (SetSource) on the
# sphere dataset (SetInput). Each glyph is oriented through the dataset
# normals (SetVectorModeToUseNormal). The resulting dataset is a set
# of cones lying on a sphere surface.
# of cones laying on a sphere surface.
#
vtkGlyph3D glyph
glyph SetInputConnection [sphere GetOutputPort]
......
......@@ -59,7 +59,7 @@ vtkConeSource cone
# Create a vtkGlyph3D to dispatch the glyph/cone geometry (SetSource) on the
# sphere dataset (SetInput). Each glyph is oriented through the dataset
# normals (SetVectorModeToUseNormal). The resulting dataset is a set
# of cones lying on a sphere surface.
# of cones laying on a sphere surface.
#
vtkGlyph3D glyph
glyph SetInputConnection [sphere GetOutputPort]
......
......@@ -3,7 +3,7 @@
# In this example we show the use of the
# vtkBandedPolyDataContourFilter. This filter creates separate,
# constant colored bands for a range of scalar values. Each band is
# bounded by two scalar values, and the cell data lying within the
# bounded by two scalar values, and the cell data laying within the
# value has the same cell scalar value.
import vtk
......
# In this example we show the use of the vtkBandedPolyDataContourFilter.
# This filter creates separate, constant colored bands for a range of scalar
# values. Each band is bounded by two scalar values, and the cell data lying
# values. Each band is bounded by two scalar values, and the cell data laying
# within the value has the same cell scalar value.
package require vtk
......
......@@ -200,7 +200,7 @@ public:
// Description:
// Set/Get world space origin of the data set, The origin
// is the location of the low corner cell's low corner node
// of the data set. Which is not necessarilly the origin of
// of the data set. Which is not necessarily the origin of
// this box! For that use GetBoxOrigin().
const double *GetDataSetOrigin() const { return this->X0; }
void GetDataSetOrigin(double X0[3]) const;
......
......@@ -25,7 +25,7 @@
// twelve midedge nodes (8-19), nodes 20-23 are the center-face nodes. Note that
// these midedge nodes correspond lie
// on the edges defined by (0,1), (1,2), (2,3), (3,0), (4,5), (5,6), (6,7),
// (7,4), (0,4), (1,5), (2,6), (3,7). The center face nodes lying in quad
// (7,4), (0,4), (1,5), (2,6), (3,7). The center face nodes laying in quad
// 22-(0,1,5,4), 21-(1,2,6,5), 23-(2,3,7,6) and 22-(3,0,4,7)
//
// \verbatim
......
......@@ -122,7 +122,7 @@ vtkCell *vtkBiQuadraticQuadraticWedge::GetFace(int faceId)
faceId = (faceId < 0 ? 0 : (faceId > 4 ? 4 : faceId));
// load point id's and coordinates
// be careful with the last two one:
// be careful with the last two:
if (faceId < 2)
{
for (int i = 0; i < 6; i++)
......
......@@ -24,7 +24,7 @@
// nine midedge nodes (6-15) and 3 center-face nodes. Note that these midedge
// nodes correspond lie
// on the edges defined by (0,1), (1,2), (2,0), (3,4), (4,5), (5,3), (0,3),
// (1,4), (2,5), and the center-face nodes are lying in quads 16-(0,1,4,3),
// (1,4), (2,5), and the center-face nodes are laying in quads 16-(0,1,4,3),
// 17-(1,2,5,4) and (2,0,3,5).
//
// .SECTION See Also
......
......@@ -28,7 +28,7 @@
// ExecuteData and ExecuteInformation. For new algorithms you should
// implement RequestData( request, inputVec, outputVec) but for older filters
// there is a default implementation that calls the old ExecuteData(output)
// signature, for even older filters that don;t implement ExecuteData the
// signature, for even older filters that don't implement ExecuteData the
// default implementation calls the even older Execute() signature.
#ifndef __vtkDataObjectAlgorithm_h
......
......@@ -1759,7 +1759,7 @@ void vtkDataSetAttributes::FieldList::UnionFieldList(vtkDataSetAttributes* dsa)
// In InitializeFieldList(), if an array is an active attribute, its
// information is noted only in the first "set". Now since we are
// marking it as not-an-attribute, we still don't want to loose the
// marking it as not-an-attribute, we still don't want to lose the
// array. So we enable it in the second "set". But all DSAIndices until
// the CurrentInput referred to this array in it's location in the
// first "set" so we have to move those as well. That's what's
......
......@@ -195,7 +195,7 @@ vtkGenericEdgeTable::vtkGenericEdgeTable()
// The whole problem is here to find the proper size for a descent hash table
// Since we do not allow check our size as we go the hash table
// Should be big enough from the beginning otherwise we'll loose the
// Should be big enough from the beginning otherwise we'll lose the
// constant time access
// But on the other hand we do not want it to be too big for mem consumption
// A compromise of 4093 was found fo be working in a lot of case
......
......@@ -43,7 +43,7 @@
// guarantees a unique triangulation.
//
// There is another related characteristic of Delaunay triangulations. Given
// a N-dimensional Delaunay triangulation, points lying on a (N-1) dimensional
// a N-dimensional Delaunay triangulation, points laying on a (N-1) dimensional
// plane also form a (N-1) Delaunay triangulation. This means for example,
// that if a 3D cell is defined by a set of (2D) planar faces, then the
// face triangulations are Delaunay. Combining this with the method to
......
......@@ -134,7 +134,7 @@ vtkCell * vtkQuadraticLinearWedge::GetFace (int faceId)
faceId = (faceId < 0 ? 0 : (faceId > 4 ? 4 : faceId));
// load point id's and coordinates
// be careful with the last two one:
// be careful with the last two:
if (faceId < 2)
{
for (int i = 0; i < 6; i++)
......
......@@ -126,7 +126,7 @@ vtkCell *vtkQuadraticWedge::GetFace(int faceId)
faceId = (faceId < 0 ? 0 : (faceId > 4 ? 4 : faceId ));
// load point id's and coordinates
// be careful with the last two one:
// be careful with the last two:
if(faceId < 2)
{
for (int i=0; i<6; i++)
......
......@@ -585,7 +585,7 @@ private:
vtkIdType PointId[3+3];
int SubdivisionLevel;
// bit i (0 to 3) tells if point p (0 to 5) is lying on original edge i.
// bit i (0 to 3) tells if point p (0 to 5) is laying on original edge i.
unsigned char ClassificationState[6];
};
//-----------------------------------------------------------------------------
......@@ -950,8 +950,8 @@ private:
vtkIdType PointId[4+6];
int SubdivisionLevel;
// bit i (0 to 5) tells if point p (0 to 9) is lying on original edge i.
// bit j (6 to 9) tells if point p (0 to 9) is lying on original face j.
// bit i (0 to 5) tells if point p (0 to 9) is laying on original edge i.
// bit j (6 to 9) tells if point p (0 to 9) is laying on original face j.
unsigned short ClassificationState[4+6];
int *EdgeIds;
......
......@@ -768,7 +768,7 @@ void vtkGeoInteractorStyleRenderCallback(vtkObject *caller,
}
//-----------------------------------------------------------------------------
// If anything causes a render we will loose the rubber band rectangle.
// If anything causes a render we will lose the rubber band rectangle.
// The method gets a new background image and redraws the rectangle.
void vtkGeoInteractorStyle::RedrawRectangle()
{
......@@ -895,7 +895,7 @@ void vtkGeoInteractorStyle::DrawRectangle()
}
//-----------------------------------------------------------------------------
// If anything causes a render we will loose the rubber band rectangle.
// If anything causes a render we will lose the rubber band rectangle.
// The callback will draw it again.
void vtkGeoInteractorStyle::EnableRubberBandRedraw()
{
......
......@@ -15,7 +15,7 @@ vtkSampleFunction sample
sample ComputeNormalsOff
# Program a bandpass filter to clip a range of data. What we do is transform the
# scalars so that values lying betweeen (minRange,maxRange) are >= 0.0; all
# scalars so that values laying betweeen (minRange,maxRange) are >= 0.0; all
# others are < 0.0,
vtkImplicitDataSet dataset
dataset SetDataSet [sample GetOutput]
......
......@@ -17,7 +17,7 @@ vtkSampleFunction sample
sample Update
# Program a bandpass filter to clip a range of data. What we do is transform the
# scalars so that values lying betweeen (minRange,maxRange) are >= 0.0; all
# scalars so that values laying betweeen (minRange,maxRange) are >= 0.0; all
# others are < 0.0,
vtkImplicitDataSet dataset
dataset SetDataSet [sample GetOutput]
......
......@@ -788,7 +788,7 @@ void vtkClipHyperOctree::ClipNode(vtkHyperOctreeCursor *cursor,
// has sibling with children that have children, that have children
// on my face, until I reach the root...
// list the 3 faces of the parent, the current node is lying on.
// list the 3 faces of the parent, the current node is laying on.
int faces[3];
int child=cursor->GetChildIndex();
......@@ -924,7 +924,7 @@ void vtkClipHyperOctree::ClipNode(vtkHyperOctreeCursor *cursor,
this->Sibling->ToSameNode(cursor);
this->Sibling->ToParent();
// list the 2 edges of the parent, the current node is lying on.
// list the 2 edges of the parent, the current node is laying on.
edges[0]=(child&1)==1; // false: -x, true: +x
edges[1]=(child&2)==2; // false: -y, true: +y
}
......
......@@ -19,7 +19,7 @@
// type vtkPointSet and subclasses. The output of the filter is a polygonal
// dataset. Usually the output is a triangle mesh, but if a non-zero alpha
// distance value is specified (called the "alpha" value), then only
// triangles, edges, and vertices lying within the alpha radius are
// triangles, edges, and vertices laying within the alpha radius are
// output. In other words, non-zero alpha values may result in arbitrary
// combinations of triangles, lines, and vertices. (The notion of alpha value
// is derived from Edelsbrunner's work on "alpha shapes".) Also, it is
......
......@@ -454,7 +454,7 @@ int vtkDelaunay3D::RequestData(
Mesh = this->InitPointInsertion(center, this->Offset*tol,
numPoints, points);
// Insert each point into triangulation. Points lying "inside"
// Insert each point into triangulation. Points laying "inside"
// of tetra cause tetra to be deleted, leaving a void with bounding
// faces. Combination of point and each face is used to form new
// tetrahedra.
......
......@@ -20,7 +20,7 @@
// output of the filter is an unstructured grid dataset. Usually the
// output is a tetrahedral mesh, but if a non-zero alpha distance
// value is specified (called the "alpha" value), then only tetrahedra,
// triangles, edges, and vertices lying within the alpha radius are
// triangles, edges, and vertices laying within the alpha radius are
// output. In other words, non-zero alpha values may result in arbitrary
// combinations of tetrahedra, triangles, lines, and vertices. (The notion
// of alpha value is derived from Edelsbrunner's work on "alpha shapes".)
......
......@@ -21,7 +21,7 @@
// unstructured grid.
//
// To use this filter you must specify an implicit function. You must also
// specify whethter to extract cells lying inside or outside of the implicit
// specify whethter to extract cells laying inside or outside of the implicit
// function. (The inside of an implicit function is the negative values
// region.) An option exists to extract cells that are neither inside or
// outside (i.e., boundary).
......
......@@ -21,7 +21,7 @@
// filter generates vtkPolyData.
//
// To use this filter you must specify an implicit function. You must also
// specify whether to extract cells lying inside or outside of the implicit
// specify whether to extract cells laying inside or outside of the implicit
// function. (The inside of an implicit function is the negative values
// region.) An option exists to extract cells that are neither inside nor
// outside (i.e., boundary).
......
......@@ -18,7 +18,7 @@
// extract geometry (and associated data) from an unstructured grid
// dataset. The extraction process is controlled by specifying a range
// of point ids, cell ids, or a bounding box (referred to as "Extent").
// Those cells lying within these regions are sent to the output.
// Those cells laying within these regions are sent to the output.
// The user has the choice of merging coincident points (Merging is on)
// or using the original point set (Merging is off).
......
......@@ -736,7 +736,7 @@ void vtkHyperOctreeContourFilter::ContourNode()
// has sibling with children that have children, that have children
// on my face, until I reach the root...
// list the 3 faces of the parent, the current node is lying on.
// list the 3 faces of the parent, the current node is laying on.
int faces[3];
int child=this->Cursor->GetChildIndex();
......@@ -876,7 +876,7 @@ void vtkHyperOctreeContourFilter::ContourNode()
this->Sibling->ToSameNode(this->Cursor);
this->Sibling->ToParent();
// list the 2 edges of the parent, the current node is lying on.
// list the 2 edges of the parent, the current node is laying on.
edges[0]=(child&1)==1; // false: -x, true: +x
edges[1]=(child&2)==2; // false: -y, true: +y
}
......
......@@ -767,7 +767,7 @@ void vtkHyperOctreeCutter::CutNode(vtkHyperOctreeCursor *cursor,
// has sibling with children that have children, that have children
// on my face, until I reach the root...
// list the 3 faces of the parent, the current node is lying on.
// list the 3 faces of the parent, the current node is laying on.
int faces[3];
int child=cursor->GetChildIndex();
......@@ -905,7 +905,7 @@ void vtkHyperOctreeCutter::CutNode(vtkHyperOctreeCursor *cursor,
this->Sibling->ToSameNode(cursor);
this->Sibling->ToParent();
// list the 2 edges of the parent, the current node is lying on.
// list the 2 edges of the parent, the current node is laying on.
edges[0]=(child&1)==1; // false: -x, true: +x
edges[1]=(child&2)==2; // false: -y, true: +y
}
......
......@@ -49,7 +49,7 @@
// a third child node to store objects which straddle split planes. I've not
// seen this published (Yes! - see below), but thought it worth trying. This
// implementation of the BSP tree creates a third child node for storing cells
// lying across split planes, the third cell may overlap the other two, but the
// laying across split planes, the third cell may overlap the other two, but the
// two 'proper' nodes otherwise conform to usual BSP rules.
//
// The advantage of this implementation is cells only ever lie in one node
......
......@@ -12,9 +12,9 @@
PURPOSE. See the above copyright notice for more information.
=========================================================================*/
// .NAME vtkRecursiveDividingCubes - create points lying on isosurface (using recursive approach)
// .NAME vtkRecursiveDividingCubes - create points laying on isosurface (using recursive approach)
// .SECTION Description
// vtkRecursiveDividingCubes is a filter that generates points lying on a
// vtkRecursiveDividingCubes is a filter that generates points laying on a
// surface of constant scalar value (i.e., an isosurface). Dense point
// clouds (i.e., at screen resolution) will appear as a surface. Less dense
// clouds can be used as a source to generate streamlines or to generate
......
......@@ -52,8 +52,8 @@
// controls the output of the filter. If on, then scalar values are
// generated based on distance to the loop lines. Otherwise, the cells
// laying inside the selection loop are output. By default, the mesh
// lying within the loop is output; however, if InsideOut is on, then
// the portion of the mesh lying outside of the loop is output.
// laying within the loop is output; however, if InsideOut is on, then
// the portion of the mesh laying outside of the loop is output.
//
// The filter can be configured to generate the unselected portions of
// the mesh as output by setting GenerateUnselectedOutput. Use the
......
......@@ -900,7 +900,7 @@ int vtkGreedyTerrainDecimation::RequestData(
}
/*----------------------------------------------------------------------
"Scan conversion" routines to update all points lying in a triangle.
"Scan conversion" routines to update all points laying in a triangle.
Divide a triangle into two subtriangles as shown.
......@@ -935,7 +935,7 @@ int vtkGreedyTerrainDecimation::RequestData(
#define VTK_DEGENERATE 3 //should never happen in this application
//---------------------------------------------------------------------------
// Update all points lying in the given triangle. This means indicating the triangle
// Update all points laying in the given triangle. This means indicating the triangle
// that the point is in, plus computing the error in the height field.
//
void vtkGreedyTerrainDecimation::UpdateTriangle(vtkIdType tri, int ij1[2], int ij2[2], int ij3[2],
......
......@@ -457,7 +457,7 @@ void vtkProjectedTerrainPath::ComputeError(vtkIdType edgeId)
e.tNeg = (flip ? (1-t) : t);
}
}
} //if lying on image
} //if laying on image
} //for all x-intersection points
} //if x-intersections
......@@ -506,7 +506,7 @@ void vtkProjectedTerrainPath::ComputeError(vtkIdType edgeId)
e.tNeg = (flip ? (1-t) : t);
}
}
} //if lying on image
} //if laying on image
} //for all x-intersection points
} //if x-intersections
......
......@@ -177,7 +177,7 @@ int vtkOggTheoraWriterInternal::Start()
}
// the stride is in bytes
this->thImage[i].stride = this->thImage[i].width*sizeof(unsigned char);
// make sure there's nothing left lying around...
// make sure there's nothing left laying around...
if (this->thImage[i].data)
delete[] this->thImage[i].data;
// allocate the image plane
......@@ -437,7 +437,7 @@ void vtkOggTheoraWriterInternal::RGB2YCbCr(vtkImageData *id,
*/
#if 0
// interpolate surrounding rgb (subsampling)
// use double in order to not loose too much precision...
// use double in order to not lose too much precision...
double irgb[3];
for (size_t i = 0; i < 3; ++i)
{
......
......@@ -338,7 +338,7 @@ double vtkCellPicker::IntersectActorWithLine(const double p1[3],
// keep track of the cell with the best pick based on parametric
// coordinate (pick the minimum, maximum parametric distance). This
// breaks ties in a reasonable way when cells are the same distance
// from the eye (like cells lying on a 2D plane).
// from the eye (like cells laying on a 2D plane).
vtkDataSet *data = mapper->GetInput();
double tMin = VTK_DOUBLE_MAX;
......
......@@ -48984,7 +48984,7 @@ static int vdbeCommit(vtk_sqlite3 *db, Vdbe *p){
** deleting or truncating journals. If something goes wrong while
** this is happening we don't really care. The integrity of the
** transaction is already guaranteed, but some stray 'cold' journals
** may be lying around. Returning an error code won't help matters.
** may be laying around. Returning an error code won't help matters.
*/
disable_simulated_io_errors();
vtk_sqlite3BeginBenignMalloc();
......@@ -156,7 +156,7 @@ protected:
vtkBoundedPlanePointPlacer();
~vtkBoundedPlanePointPlacer();
// Indicates the projection normal as lying along the
// Indicates the projection normal as laying along the
// XAxis, YAxis, ZAxis, or Oblique. For X, Y, and Z axes,
// the projection normal is assumed to be anchored at
// (0,0,0)
......
......@@ -17,7 +17,7 @@
// .SECTION Description
// vtkDijkstraImageContourLineInterpolator interpolates and places
// contour points on images. The class interpolates nodes by
// computing a graph lying on the image data. By graph, we mean
// computing a graph laying on the image data. By graph, we mean
// that the line interpolating the two end points traverses along
// pixels so as to form a shortest path. A Dijkstra algorithm is
// used to compute the path.
......
......@@ -102,7 +102,7 @@ void vtkFixedSizeHandleRepresentation3D::BuildRepresentation()
this->WorldToDisplay(w_c, d_c);
// Compute current display size of the handle. To do this, we convert
// a point lying at (<current_center> + {radius \times <view_up_vector>})
// a point laying at (<current_center> + {radius \times <view_up_vector>})
// to display coords and see how far it is from the current display position
// of the handle.
......
......@@ -17,7 +17,7 @@
// .SECTION Description
// vtkPolygonalSurfaceContourLineInterpolator interpolates and places
// contour points on polygonal surfaces. The class interpolates nodes by
// computing a \em graph \em geodesic lying on the polygonal data. By \em
// computing a \em graph \em geodesic laying on the polygonal data. By \em
// graph \em Geodesic, we mean that the line interpolating the two end
// points traverses along on the mesh edges so as to form the shortest
// path. A Dijkstra algorithm is used to compute the path. See
......
......@@ -100,7 +100,7 @@ def get_libs():
if vtk_has_configuration_types:
dir = os.path.join(dir, vtk_build_type)
# Enumerate this list of module files.
# Enumerate the list of module files.
for kit in vtk_kit_names:
libs.append(os.path.abspath(os.path.join(dir, prefix+kit+'Python'+suffix)))
if vtk_use_sip:
......@@ -132,7 +132,7 @@ def get_scripts():
if vtk_has_configuration_types:
dir = os.path.join(dir, vtk_build_type)
# Enumerate this list of executable files.
# Enumerate the list of executable files.
for exe in vtk_exe_names:
scripts.append(os.path.abspath(os.path.join(dir, exe+suffix)))
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment