diff options
Diffstat (limited to 'tqtinterface/qt4/src/kernel/tqpolygonscanner.cpp')
| -rw-r--r-- | tqtinterface/qt4/src/kernel/tqpolygonscanner.cpp | 14 |
1 files changed, 7 insertions, 7 deletions
diff --git a/tqtinterface/qt4/src/kernel/tqpolygonscanner.cpp b/tqtinterface/qt4/src/kernel/tqpolygonscanner.cpp index 78e35ab..20f65da 100644 --- a/tqtinterface/qt4/src/kernel/tqpolygonscanner.cpp +++ b/tqtinterface/qt4/src/kernel/tqpolygonscanner.cpp @@ -137,7 +137,7 @@ from the X Consortium. * * Written by Brian Kelleher; Jan 1985 * - * This file tqcontains a few macros to help track + * This file contains a few macros to help track * the edge of a filled object. The object is assumed * to be filled in scanline order, and thus the * algorithm used is an extension of Bresenham's line @@ -220,7 +220,7 @@ from the X Consortium. /* - * This structure tqcontains all of the information needed + * This structure contains all of the information needed * to run the bresenham algorithm. * The variables may be hardcoded into the declarations * instead of using this structure to make use of @@ -390,7 +390,7 @@ SOFTWARE. * * Written by Brian Kelleher; Oct. 1985 * - * This module tqcontains all of the utility functions + * This module contains all of the utility functions * needed to scan convert a polygon. * */ @@ -398,8 +398,8 @@ SOFTWARE. * InsertEdgeInET * * Insert the given edge into the edge table. - * First we must tqfind the correct bucket in the - * Edge table, then tqfind the right slot in the + * First we must find the correct bucket in the + * Edge table, then find the right slot in the * bucket. Finally, we can insert it. * */ @@ -412,7 +412,7 @@ miInsertEdgeInET(EdgeTable *ET, EdgeTableEntry *ETE, ScanLineListBlock *tmpSLLBlock; /* - * tqfind the right bucket to put the edge into + * find the right bucket to put the edge into */ pPrevSLL = &ET->scanlines; pSLL = pPrevSLL->next; @@ -555,7 +555,7 @@ miCreateETandAET(int count, DDXPointPtr pts, EdgeTable *ET, CurrPt = pts++; /* - * tqfind out which point is above and which is below. + * find out which point is above and which is below. */ if (PrevPt->y > CurrPt->y) { |