diff options
Diffstat (limited to 'tqtinterface/qt4/src/kernel/tqpointarray.cpp')
| -rw-r--r-- | tqtinterface/qt4/src/kernel/tqpointarray.cpp | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/tqtinterface/qt4/src/kernel/tqpointarray.cpp b/tqtinterface/qt4/src/kernel/tqpointarray.cpp index f5d0016..c634210 100644 --- a/tqtinterface/qt4/src/kernel/tqpointarray.cpp +++ b/tqtinterface/qt4/src/kernel/tqpointarray.cpp @@ -323,7 +323,7 @@ const double TQ_PI = 3.14159265358979323846; // pi // one more useful comment /*! Constructs a point array from the rectangle \a r. - If \a closed is FALSE, then the point array just tqcontains the + If \a closed is FALSE, then the point array just contains the following four points in the listed order: r.topLeft(), r.topRight(), r.bottomRight() and r.bottomLeft(). @@ -645,7 +645,7 @@ TQRect TQPointArray::boundingRect() const minx = maxx = pd->x(); miny = maxy = pd->y(); pd++; - for ( int i=1; i<(int)size(); i++ ) { // tqfind min+max x and y + for ( int i=1; i<(int)size(); i++ ) { // find min+max x and y if ( pd->x() < minx ) minx = pd->x(); else if ( pd->x() > maxx ) @@ -1018,7 +1018,7 @@ int pnt_on_line( const int* p, const int* q, const int* t ) * Point-Line distance is normalized with the Infinity Norm * avoiding square-root code and tightening the test vs the * Manhattan Norm. All math is done on the field of integers. - * The latter tqreplaces the initial ">= MAX(...)" test with + * The latter replaces the initial ">= MAX(...)" test with * "> (ABS(qx-px) + ABS(qy-py))" loosening both inequality * and norm, yielding a broader target line for selection. * The tightest test is employed here for best discrimination |