kits/interface/RegionSupport.cpp

57  * given upper-left y coordinate (top) will have the same lower-right y
61  * several shorter rectangles to account for shorter rectangles to its left
99 	((r1)->right > (r2)->left && \
100 	 (r1)->left < (r2)->right && \
108             if ((r)->left < (idRect)->fBounds.left)\
109               (idRect)->fBounds.left = (r)->left;\
140                   ((R-1)->left <= (Rx1)) &&\
147               (r)->left = (rx1);\
163               (r)->left = (rx1);\
178         ( ((r).left <= x)) && \
222 	pReg->fBounds.left = 0;
236      * it must have the largest bottom, because of banding. Initialize left and
240     pExtents->left = pBox->left;
248 	if (pBox->left < pExtents->left)
250 	    pExtents->left = pBox->left;
258     assert(pExtents->left < pExtents->right);
280 	pbox->left += x;
286     pRegion->fBounds.left += x;
412     int  	left;
420 	left = max_c(r1->left,r2->left);
430 	if (left < right)
435 	    pNextRect->left = left;
610             ADDRECTNOX(newReg,rects_, tempRects->left, tempRects->top,
622             ADDRECTNOX(newReg, rects_, tempRects->left,tempRects->top,
720 		if ((pPrevBox->left != pCurBox->left) ||
1011      * Deal with whichever region still has rectangles left.
1116 		assert(r->left < r->right);
1118 		pNextRect->left = r->left;
1136  *	left-most rectangle each time and merges it into the region.
1166 	(pNextRect[-1].right >= r->left))  \
1171 	    assert(pNextRect[-1].left<pNextRect[-1].right); \
1179 	pNextRect->left = r->left;  \
1190 	if (r1->left < r2->left)
1246 	(reg1->fBounds.left <= reg2->fBounds.left) &&
1260 	(reg2->fBounds.left <= reg1->fBounds.left) &&
1273     newReg->fBounds.left = min_c(reg1->fBounds.left, reg2->fBounds.left);
1316 	assert(r->left<r->right);
1318 	pNextRect->left = r->left;
1335  *	Overlapping band subtraction. left is the left-most point not yet
1357     int  	left;
1359     left = r1->left;
1366 	if (r2->right <= left)
1373 	else if (r2->left <= left)
1376 	     * Subtrahend preceeds minuend: nuke left edge of minuend.
1378 	    left = r2->right;
1379 	    if (left >= r1->right)
1383 		 * reset left fence to edge of new minuend.
1387 		    left = r1->left;
1398 	else if (r2->left < r1->right)
1404 	    assert(left<r2->left);
1406 	    pNextRect->left = left;
1408 	    pNextRect->right = r2->left;
1415 	    left = r2->right;
1416 	    if (left >= r1->right)
1423 		    left = r1->left;
1438 	    if (r1->right > left)
1441 		pNextRect->left = left;
1451 		left = r1->left;
1460 	assert(left<r1->right);
1462 	pNextRect->left = left;
1474 	    left = r1->left;
1575     int rx = prect->left;
1599 	   ry = pbox->top;	/* x guaranteed to be == prect->left */
1605 	if (pbox->left > rx)
1607 	   partOut = true;	/* missed part of rectangle to left */
1612 	if (pbox->left < prect->right)
1624 	   rx = prect->left;	/* reset x out to left again */