Lines Matching refs:numRects
1181 int numRects; member
1187 inline QRegionPrivate() : numRects(0), innerArea(-1) {} in QRegionPrivate()
1189 : numRects(1), in QRegionPrivate()
1230 if (numRects == 1) { in vectorize()
1238 { return numRects == 1 ? &extents : rects.data(); } // avoid vectorize() in begin()
1241 { return begin() + numRects; } in end()
1268 return !preg || preg->numRects == 0; in isEmptyHelper()
1355 Q_ASSERT(numRects > 1); in intersect()
1368 int n = numRects; in intersect()
1369 numRects = 0; in intersect()
1375 if (numRects == 0) { in intersect()
1384 const QRect *nextToLast = (numRects > 1 ? dest - 2 : nullptr); in intersect()
1398 ++numRects; in intersect()
1409 QRect *myLast = (numRects == 1 ? &extents : rects.data() + (numRects - 1)); in append()
1411 if (numRects > 1) { in append()
1412 const QRect *nextToTop = (numRects > 2 ? myLast - 2 : nullptr); in append()
1414 --numRects; in append()
1416 } else if (mergeFromBelow(myLast, r, (numRects > 1 ? myLast - 1 : nullptr), nullptr)) { in append()
1420 ++numRects; in append()
1422 if (rects.size() < numRects) in append()
1423 rects.resize(numRects); in append()
1424 rects[numRects - 1] = *r; in append()
1440 if (r->numRects == 1) { in append()
1447 QRect *destRect = rects.data() + numRects; in append()
1449 int numAppend = r->numRects; in append()
1455 const QRect *nextToLast = (numRects > 1 ? myLast - 1 : nullptr); in append()
1464 if (numRects > 1) { in append()
1465 nextToLast = (numRects > 2 ? myLast - 2 : nullptr); in append()
1469 --numRects; in append()
1480 const int newNumRects = numRects + numAppend; in append()
1483 destRect = rects.data() + numRects; in append()
1487 numRects = newNumRects; in append()
1513 if (r->numRects == 1) { in prepend()
1520 int numPrepend = r->numRects; in prepend()
1526 const QRect *nextToFirst = (numRects > 1 ? myFirst + 1 : nullptr); in prepend()
1527 const QRect *rLast = r->rects.constData() + r->numRects - 1; in prepend()
1528 const QRect *rNextToLast = (r->numRects > 1 ? rLast - 1 : nullptr); in prepend()
1537 if (numRects > 1) { in prepend()
1538 nextToFirst = (numRects > 2? myFirst + 2 : nullptr); in prepend()
1541 --numRects; in prepend()
1551 const int newNumRects = numRects + numPrepend; in prepend()
1557 numRects * sizeof(QRect)); in prepend()
1562 numRects = newNumRects; in prepend()
1586 QRect *myFirst = (numRects == 1 ? &extents : rects.data()); in prepend()
1588 if (numRects > 1) { in prepend()
1589 const QRect *nextToFirst = (numRects > 2 ? myFirst + 2 : nullptr); in prepend()
1591 --numRects; in prepend()
1593 numRects * sizeof(QRect)); in prepend()
1596 } else if (mergeFromAbove(myFirst, r, (numRects > 1 ? myFirst + 1 : nullptr), nullptr)) { in prepend()
1600 ++numRects; in prepend()
1618 const QRect *myLast = (numRects == 1) ? &extents : (rects.constData() + (numRects - 1)); in canAppend()
1633 return canAppend(r->numRects == 1 ? &r->extents : r->rects.constData()); in canAppend()
1640 const QRect *myFirst = (numRects == 1) ? &extents : rects.constData(); in canPrepend()
1655 return canPrepend(r->numRects == 1 ? &r->extents : r->rects.constData() + r->numRects - 1); in canPrepend()
1661 if (numRects == 0) { in selfTest()
1669 if (numRects == 1) { in selfTest()
1675 for (int i = 0; i < numRects; ++i) { in selfTest()
1682 for (int i = 1; i < numRects; ++i) { in selfTest()
1801 if ((dest).numRects >= ((dest).rects.size()-1)){\
1803 (rect) = (firstrect).data() + (dest).numRects;\
1911 if (dest.numRects == 0) { in UnionRectWithRegion()
1944 if (dest.numRects == 0) { in miSetExtents()
1954 pBoxEnd = pBox + dest.numRects - 1; in miSetExtents()
1989 int nbox = region.numRects; in OffsetRegion()
2023 pNextRect = dest.rects.data() + dest.numRects; in miIntersectO()
2040 ++dest.numRects; in miIntersectO()
2091 pRegEnd = rData + dest.numRects; in miCoalesce()
2118 pRegEnd = rData + dest.numRects; in miCoalesce()
2144 dest.numRects -= curNumRects; in miCoalesce()
2235 if (reg1->numRects == 1) in miRegionOp()
2239 if (reg2->numRects == 1) in miRegionOp()
2244 r1End = r1 + reg1->numRects; in miRegionOp()
2245 r2End = r2 + reg2->numRects; in miRegionOp()
2258 dest.numRects = 0; in miRegionOp()
2267 dest.rects.resize(qMax(reg1->numRects,reg2->numRects) * 2); in miRegionOp()
2299 curBand = dest.numRects; in miRegionOp()
2348 if (dest.numRects != curBand) in miRegionOp()
2356 curBand = dest.numRects; in miRegionOp()
2360 if (dest.numRects != curBand) in miRegionOp()
2376 curBand = dest.numRects; in miRegionOp()
2397 if (dest.numRects != curBand) in miRegionOp()
2408 if (qMax(4, dest.numRects) < (dest.rects.size() >> 1)) in miRegionOp()
2409 dest.rects.resize(dest.numRects); in miRegionOp()
2438 pNextRect = dest.rects.data() + dest.numRects; in miUnionNonO()
2446 dest.numRects++; in miUnionNonO()
2474 pNextRect = dest.rects.data() + dest.numRects; in miUnionO()
2477 if ((dest.numRects != 0) && \ in miUnionO()
2490 dest.numRects++; \ in miUnionO()
2563 pNextRect = dest.rects.data() + dest.numRects; in miSubtractNonO1()
2571 ++dest.numRects; in miSubtractNonO1()
2601 pNextRect = dest.rects.data() + dest.numRects; in miSubtractO()
2634 ++dest.numRects; in miSubtractO()
2656 ++dest.numRects; in miSubtractO()
2672 ++dest.numRects; in miSubtractO()
2750 if (r1->numRects != r2->numRects) { in EqualRegion()
2752 } else if (r1->numRects == 0) { in EqualRegion()
2756 } else if (r1->numRects == 1 && r2->numRects == 1) { in EqualRegion()
2759 const QRect *rr1 = (r1->numRects == 1) ? &r1->extents : r1->rects.constData(); in EqualRegion()
2760 const QRect *rr2 = (r2->numRects == 1) ? &r2->extents : r2->rects.constData(); in EqualRegion()
2761 for (int i = 0; i < r1->numRects; ++i, ++rr1, ++rr2) { in EqualRegion()
2778 if (pRegion->numRects == 1) in PointInRegion()
2782 for (i = 0; i < pRegion->numRects; ++i) { in PointInRegion()
2797 if (!region || region->numRects == 0 || !EXTENTCHECK(®ion->extents, prect)) in RectInRegion()
2804 pbox = (region->numRects == 1) ? ®ion->extents : region->rects.constData(); in RectInRegion()
2805 pboxEnd = pbox + region->numRects; in RectInRegion()
3605 reg->numRects = reg->rects.size(); in PtsToRegion()
3607 if (reg->numRects) { in PtsToRegion()
3669 region->numRects = 1; in PolygonRegion()
4006 return d == &shared_empty || d->qt_rgn->numRects == 0; in isEmpty()
4011 return d == &shared_empty || d->qt_rgn->numRects == 0; in isNull()
4109 } else if (d->qt_rgn->numRects == 1 && d->qt_rgn->extents == r) { in united()
4149 } else if (d->qt_rgn->numRects == 1 && d->qt_rgn->extents == r) { in operator +=()
4173 if (r.d->qt_rgn->numRects == 1 && d->qt_rgn->numRects == 1) { in intersected()
4177 } else if (r.d->qt_rgn->numRects == 1) { in intersected()
4182 } else if (d->qt_rgn->numRects == 1) { in intersected()
4218 if (d->qt_rgn->numRects == 1) { in intersected()
4300 for (int i = 0; i < region.d->qt_rgn->numRects; ++i) { in qt_region_strictContains()
4322 d->qt_rgn->rects.reserve(d->qt_rgn->numRects); in rects()
4323 d->qt_rgn->rects.resize(d->qt_rgn->numRects); in rects()
4349 d->qt_rgn->numRects = num; in setRects()
4375 return (d->qt_rgn ? d->qt_rgn->numRects : 0); in rectCount()
4400 if (d->qt_rgn->numRects == 1) in intersects()