diff options
Diffstat (limited to 'src/kernel/tqpolygonscanner.cpp')
| -rw-r--r-- | src/kernel/tqpolygonscanner.cpp | 16 |
1 files changed, 8 insertions, 8 deletions
diff --git a/src/kernel/tqpolygonscanner.cpp b/src/kernel/tqpolygonscanner.cpp index 2df631730..54a075c66 100644 --- a/src/kernel/tqpolygonscanner.cpp +++ b/src/kernel/tqpolygonscanner.cpp @@ -432,7 +432,7 @@ miInsertEdgeInET(EdgeTable *ET, EdgeTableEntry *ETE, tmpSLLBlock = (ScanLineListBlock *)malloc(sizeof(ScanLineListBlock)); if (!tmpSLLBlock) - return FALSE; + return false; (*SLLBlock)->next = tmpSLLBlock; tmpSLLBlock->next = 0; *SLLBlock = tmpSLLBlock; @@ -462,7 +462,7 @@ miInsertEdgeInET(EdgeTable *ET, EdgeTableEntry *ETE, prev->next = ETE; else pSLL->edgelist = ETE; - return TRUE; + return true; } /* @@ -525,7 +525,7 @@ miCreateETandAET(int count, DDXPointPtr pts, EdgeTable *ET, int dy; - if (count < 2) return TRUE; + if (count < 2) return true; /* * initialize the Active Edge Table @@ -584,7 +584,7 @@ miCreateETandAET(int count, DDXPointPtr pts, EdgeTable *ET, if (!miInsertEdgeInET(ET, pETEs, top->y, &pSLLBlock, &iSLLBlock)) { miFreeStorage(pSLLBlock->next); - return FALSE; + return false; } ET->ymax = TQMAX(ET->ymax, PrevPt->y); @@ -594,7 +594,7 @@ miCreateETandAET(int count, DDXPointPtr pts, EdgeTable *ET, PrevPt = CurrPt; } - return TRUE; + return true; } /* @@ -729,13 +729,13 @@ miInsertionSort(EdgeTableEntry *AET) */ void TQPolygonScanner::scan(const TQPointArray& pa, bool winding, int index, int npoints) { - scan( pa, winding, index, npoints, TRUE ); + scan( pa, winding, index, npoints, true ); } /*! \overload - If \a stitchable is FALSE, the right and bottom edges of the + If \a stitchable is false, the right and bottom edges of the polygon are included. This causes adjacent polygons to overlap. */ void TQPolygonScanner::scan(const TQPointArray& pa, bool winding, int index, int npoints, bool stitchable) @@ -748,7 +748,7 @@ void TQPolygonScanner::scan(const TQPointArray& pa, bool winding, int index, int Calls processSpans() for all scanlines of the polygon defined by \a npoints starting at \a index in \a pa. - If \a winding is TRUE, the Winding algorithm rather than the + If \a winding is true, the Winding algorithm rather than the Odd-Even rule is used. The \a edges is any bitwise combination of: |