kits/interface/RegionSupport.cpp

57  * given upper-left y coordinate (top) will have the same lower-right y
70  * only if the bottom of one touches the top of the other and they have
101 	 (r1)->bottom > (r2)->top && \
102 	 (r1)->top < (r2)->bottom)
110             if ((r)->top < (idRect)->fBounds.top)\
111               (idRect)->fBounds.top = (r)->top;\
138                   ((R-1)->top == (Ry1)) &&\
148               (r)->top = (ry1);\
164               (r)->top = (ry1);\
180         ( ((r).top <= y)) )
223 	pReg->fBounds.top = 0;
235      * smallest top and since pBoxEnd is the last rectangle in the region,
241     pExtents->top = pBox->top;
245     assert(pExtents->top < pExtents->bottom);
282 	pbox->top += y;
288     pRegion->fBounds.top += y;
409     int    	  	top,
432 	    assert(top<bottom);
436 	    pNextRect->top = top;
528     if (reg1->fBounds.top > reg2->fBounds.top)
578     if ((reg1->fBounds.top >= reg2->fBounds.bottom) ||
579         (reg2->fBounds.top >= reg1->fBounds.bottom) )
604     if (reg1->fBounds.top < reg2->fBounds.top)
607         while(tempRects->top < reg2->fBounds.top)
610             ADDRECTNOX(newReg,rects_, tempRects->left, tempRects->top,
611 		       tempRects->right, min_c(tempRects->bottom, reg2->fBounds.top));
616     if (reg2->fBounds.top < reg1->fBounds.top)
619         while (tempRects->top < reg1->fBounds.top)
622             ADDRECTNOX(newReg, rects_, tempRects->left,tempRects->top,
623 		       tempRects->right, min_c(tempRects->bottom, reg1->fBounds.top));
679     bandY1 = pCurBox->top;
681 	 (pCurBox != pRegEnd) && (pCurBox->top == bandY1);
696 	while (pRegEnd[-1].top == pRegEnd->top)
708 	 * matches the top scanline of the current.
710 	if (pPrevBox->bottom == pCurBox->top)
814         int               top,
821         int      top,
829         int      top,
847     int     	  	top;	    	    	/* Top of non-overlapping
886      * intersection and thus clips the top of the rectangles in that band.
887      * ytop is the top of the next intersection between the two regions and
890      * the top of the rectangles of both regions and ybot clips the bottoms.
892     if (reg1->fBounds.top < reg2->fBounds.top)
893 	ybot = reg1->fBounds.top;
895 	ybot = reg2->fBounds.top;
920 	while ((r1BandEnd != r1End) && (r1BandEnd->top == r1->top))
926 	while ((r2BandEnd != r2End) && (r2BandEnd->top == r2->top))
939 	if (r1->top < r2->top)
941 	    top = max_c(r1->top,ybot);
942 	    bot = min_c(r1->bottom,r2->top);
944 	    if ((top != bot) && (nonOverlap1Func != NULL))
946 		(* nonOverlap1Func) (newReg, r1, r1BandEnd, top, bot);
949 	    ytop = r2->top;
951 	else if (r2->top < r1->top)
953 	    top = max_c(r2->top,ybot);
954 	    bot = min_c(r2->bottom,r1->top);
956 	    if ((top != bot) && (nonOverlap2Func != NULL))
958 		(* nonOverlap2Func) (newReg, r2, r2BandEnd, top, bot);
961 	    ytop = r1->top;
965 	    ytop = r1->top;
1021 		while ((r1BandEnd < r1End) && (r1BandEnd->top == r1->top))
1026 				     max_c(r1->top,ybot), r1->bottom);
1036 	    while ((r2BandEnd < r2End) && (r2BandEnd->top == r2->top))
1041 				max_c(r2->top,ybot), r2->bottom);
1109     int top, int bottom)
1113 	assert(top < bottom);
1119 		pNextRect->top = top;
1155     int	top,
1164 	(pNextRect[-1].top == top) &&  \
1177 	pNextRect->top = top;  \
1187     assert (top<bottom);
1247 	(reg1->fBounds.top <= reg2->fBounds.top) &&
1261 	(reg2->fBounds.top <= reg1->fBounds.top) &&
1274     newReg->fBounds.top = min_c(reg1->fBounds.top, reg2->fBounds.top);
1305     int  	top,
1312     assert(top<bottom);
1319 	pNextRect->top = top;
1353     int  	top,
1361     assert(top<bottom);
1407 	    pNextRect->top = top;
1442 		pNextRect->top = top;
1463 	pNextRect->top = top;
1576     int ry = prect->top;
1594 	if (pbox->top > ry)
1597 	   if (partIn || (pbox->top >= prect->bottom))
1599 	   ry = pbox->top;	/* x guaranteed to be == prect->left */