kits/interface/RegionSupport.cpp

58  * coordinate (bottom) and vice versa. If a rectangle has scanlines in a band, it
70  * only if the bottom of one touches the top of the other and they have
96  *  Remember, right and bottom are not in the region
101 	 (r1)->bottom > (r2)->top && \
102 	 (r1)->top < (r2)->bottom)
114             if ((r)->bottom > (idRect)->fBounds.bottom)\
115               (idRect)->fBounds.bottom = (r)->bottom;\
139                   ((R-1)->bottom == (Ry2)) &&\
150               (r)->bottom = (ry2);\
166               (r)->bottom = (ry2);\
179         ( ((r).bottom >  y)) && \
225 	pReg->fBounds.bottom = 0;
236      * it must have the largest bottom, because of banding. Initialize left and
243     pExtents->bottom = pBoxEnd->bottom;
245     assert(pExtents->top < pExtents->bottom);
283 	pbox->bottom += y;
289     pRegion->fBounds.bottom += y;
379      while ((rectCount--) && (rect->bottom <= y))
410     int    	  	bottom)
432 	    assert(top<bottom);
438 	    pNextRect->bottom = bottom;
578     if ((reg1->fBounds.top >= reg2->fBounds.bottom) ||
579         (reg2->fBounds.top >= reg1->fBounds.bottom) )
611 		       tempRects->right, min_c(tempRects->bottom, reg2->fBounds.top));
623 		       tempRects->right, min_c(tempRects->bottom, reg1->fBounds.top));
647  *	    - rectangles in the previous band will have their bottom fields
707 	 * The bands may only be coalesced if the bottom of the previous
710 	if (pPrevBox->bottom == pCurBox->top)
738 	     * The bands may be merged, so set the bottom y of each box
744 		pPrevBox->bottom = pCurBox->bottom;
815         int               bottom),                /* Function to call for over-
822         int      bottom),                /* Function to call for non-
830         int      bottom))                /* Function to call for non-
885      * has points in the band), ybot is the bottom of the most recent
888      * serves to clip the bottom of the rectangles in the current band.
942 	    bot = min_c(r1->bottom,r2->top);
954 	    bot = min_c(r2->bottom,r1->top);
983 	ybot = min_c(r1->bottom, r2->bottom);
997 	 * If we've finished with a band (bottom == ybot) we skip forward
1000 	if (r1->bottom == ybot)
1004 	if (r2->bottom == ybot)
1026 				     max_c(r1->top,ybot), r1->bottom);
1041 				max_c(r2->top,ybot), r2->bottom);
1109     int top, int bottom)
1113 	assert(top < bottom);
1121 		pNextRect->bottom = bottom;
1156     int	bottom)
1165 	(pNextRect[-1].bottom == bottom) &&  \
1178 	pNextRect->bottom = bottom;  \
1187     assert (top<bottom);
1249 	(reg1->fBounds.bottom >= reg2->fBounds.bottom))
1263 	(reg2->fBounds.bottom >= reg1->fBounds.bottom))
1276     newReg->fBounds.bottom = max_c(reg1->fBounds.bottom, reg2->fBounds.bottom);
1306     int   	bottom)
1312     assert(top<bottom);
1321 	pNextRect->bottom = bottom;
1354     int  	bottom)
1361     assert(top<bottom);
1409 	    pNextRect->bottom = bottom;
1444 		pNextRect->bottom = bottom;
1465 	pNextRect->bottom = bottom;
1585     /* can stop when both partOut and partIn are true, or we reach prect->bottom */
1591 	if (pbox->bottom <= ry)
1597 	   if (partIn || (pbox->top >= prect->bottom))
1621 	   ry = pbox->bottom;	/* finished with this band */
1622 	   if (ry >= prect->bottom)
1639     return(partIn ? ((ry < prect->bottom) ? RectanglePart : RectangleIn) :