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

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]
......
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