| Line | Source Code | Coverage |
|---|
| 1 | | - |
| 2 | | - |
| 3 | | - |
| 4 | | - |
| 5 | QRect QRect::normalized() const | - |
| 6 | { | - |
| 7 | QRect r; | - |
| 8 | if (x2 < x1 - 1) { evaluated: x2 < x1 - 1| yes Evaluation Count:807 | yes Evaluation Count:14790 |
| 807-14790 |
| 9 | r.x1 = x2; | - |
| 10 | r.x2 = x1; | - |
| 11 | } else { executed: }Execution Count:807 | 807 |
| 12 | r.x1 = x1; | - |
| 13 | r.x2 = x2; | - |
| 14 | } executed: }Execution Count:14790 | 14790 |
| 15 | if (y2 < y1 - 1) { evaluated: y2 < y1 - 1| yes Evaluation Count:391 | yes Evaluation Count:15206 |
| 391-15206 |
| 16 | r.y1 = y2; | - |
| 17 | r.y2 = y1; | - |
| 18 | } else { executed: }Execution Count:391 | 391 |
| 19 | r.y1 = y1; | - |
| 20 | r.y2 = y2; | - |
| 21 | } executed: }Execution Count:15206 | 15206 |
| 22 | return r; executed: return r;Execution Count:15597 | 15597 |
| 23 | } | - |
| 24 | bool QRect::contains(const QPoint &p, bool proper) const | - |
| 25 | { | - |
| 26 | int l, r; | - |
| 27 | if (x2 < x1 - 1) { evaluated: x2 < x1 - 1| yes Evaluation Count:24 | yes Evaluation Count:22383 |
| 24-22383 |
| 28 | l = x2; | - |
| 29 | r = x1; | - |
| 30 | } else { executed: }Execution Count:24 | 24 |
| 31 | l = x1; | - |
| 32 | r = x2; | - |
| 33 | } executed: }Execution Count:22383 | 22383 |
| 34 | if (proper) { evaluated: proper| yes Evaluation Count:27 | yes Evaluation Count:22380 |
| 27-22380 |
| 35 | if (p.x() <= l || p.x() >= r) evaluated: p.x() <= l| yes Evaluation Count:7 | yes Evaluation Count:20 |
evaluated: p.x() >= r| yes Evaluation Count:11 | yes Evaluation Count:9 |
| 7-20 |
| 36 | return false; executed: return false;Execution Count:18 | 18 |
| 37 | } else { executed: }Execution Count:9 | 9 |
| 38 | if (p.x() < l || p.x() > r) evaluated: p.x() < l| yes Evaluation Count:1097 | yes Evaluation Count:21283 |
evaluated: p.x() > r| yes Evaluation Count:12947 | yes Evaluation Count:8336 |
| 1097-21283 |
| 39 | return false; executed: return false;Execution Count:14044 | 14044 |
| 40 | } executed: }Execution Count:8336 | 8336 |
| 41 | int t, b; | - |
| 42 | if (y2 < y1 - 1) { evaluated: y2 < y1 - 1| yes Evaluation Count:14 | yes Evaluation Count:8331 |
| 14-8331 |
| 43 | t = y2; | - |
| 44 | b = y1; | - |
| 45 | } else { executed: }Execution Count:14 | 14 |
| 46 | t = y1; | - |
| 47 | b = y2; | - |
| 48 | } executed: }Execution Count:8331 | 8331 |
| 49 | if (proper) { evaluated: proper| yes Evaluation Count:9 | yes Evaluation Count:8336 |
| 9-8336 |
| 50 | if (p.y() <= t || p.y() >= b) evaluated: p.y() <= t| yes Evaluation Count:3 | yes Evaluation Count:6 |
partially evaluated: p.y() >= b| no Evaluation Count:0 | yes Evaluation Count:6 |
| 0-6 |
| 51 | return false; executed: return false;Execution Count:3 | 3 |
| 52 | } else { executed: }Execution Count:6 | 6 |
| 53 | if (p.y() < t || p.y() > b) evaluated: p.y() < t| yes Evaluation Count:565 | yes Evaluation Count:7771 |
evaluated: p.y() > b| yes Evaluation Count:566 | yes Evaluation Count:7205 |
| 565-7771 |
| 54 | return false; executed: return false;Execution Count:1131 | 1131 |
| 55 | } executed: }Execution Count:7205 | 7205 |
| 56 | return true; executed: return true;Execution Count:7211 | 7211 |
| 57 | } | - |
| 58 | bool QRect::contains(const QRect &r, bool proper) const | - |
| 59 | { | - |
| 60 | if (isNull() || r.isNull()) evaluated: isNull()| yes Evaluation Count:2 | yes Evaluation Count:2287 |
evaluated: r.isNull()| yes Evaluation Count:3 | yes Evaluation Count:2284 |
| 2-2287 |
| 61 | return false; executed: return false;Execution Count:5 | 5 |
| 62 | | - |
| 63 | int l1 = x1; | - |
| 64 | int r1 = x1; | - |
| 65 | if (x2 - x1 + 1 < 0) evaluated: x2 - x1 + 1 < 0| yes Evaluation Count:4 | yes Evaluation Count:2280 |
| 4-2280 |
| 66 | l1 = x2; executed: l1 = x2;Execution Count:4 | 4 |
| 67 | else | - |
| 68 | r1 = x2; executed: r1 = x2;Execution Count:2280 | 2280 |
| 69 | | - |
| 70 | int l2 = r.x1; | - |
| 71 | int r2 = r.x1; | - |
| 72 | if (r.x2 - r.x1 + 1 < 0) evaluated: r.x2 - r.x1 + 1 < 0| yes Evaluation Count:4 | yes Evaluation Count:2280 |
| 4-2280 |
| 73 | l2 = r.x2; executed: l2 = r.x2;Execution Count:4 | 4 |
| 74 | else | - |
| 75 | r2 = r.x2; executed: r2 = r.x2;Execution Count:2280 | 2280 |
| 76 | | - |
| 77 | if (proper) { partially evaluated: proper| no Evaluation Count:0 | yes Evaluation Count:2284 |
| 0-2284 |
| 78 | if (l2 <= l1 || r2 >= r1) never evaluated: l2 <= l1 never evaluated: r2 >= r1 | 0 |
| 79 | return false; never executed: return false; | 0 |
| 80 | } else { | 0 |
| 81 | if (l2 < l1 || r2 > r1) evaluated: l2 < l1| yes Evaluation Count:87 | yes Evaluation Count:2197 |
evaluated: r2 > r1| yes Evaluation Count:362 | yes Evaluation Count:1835 |
| 87-2197 |
| 82 | return false; executed: return false;Execution Count:449 | 449 |
| 83 | } executed: }Execution Count:1835 | 1835 |
| 84 | | - |
| 85 | int t1 = y1; | - |
| 86 | int b1 = y1; | - |
| 87 | if (y2 - y1 + 1 < 0) evaluated: y2 - y1 + 1 < 0| yes Evaluation Count:2 | yes Evaluation Count:1833 |
| 2-1833 |
| 88 | t1 = y2; executed: t1 = y2;Execution Count:2 | 2 |
| 89 | else | - |
| 90 | b1 = y2; executed: b1 = y2;Execution Count:1833 | 1833 |
| 91 | | - |
| 92 | int t2 = r.y1; | - |
| 93 | int b2 = r.y1; | - |
| 94 | if (r.y2 - r.y1 + 1 < 0) evaluated: r.y2 - r.y1 + 1 < 0| yes Evaluation Count:2 | yes Evaluation Count:1833 |
| 2-1833 |
| 95 | t2 = r.y2; executed: t2 = r.y2;Execution Count:2 | 2 |
| 96 | else | - |
| 97 | b2 = r.y2; executed: b2 = r.y2;Execution Count:1833 | 1833 |
| 98 | | - |
| 99 | if (proper) { partially evaluated: proper| no Evaluation Count:0 | yes Evaluation Count:1835 |
| 0-1835 |
| 100 | if (t2 <= t1 || b2 >= b1) never evaluated: t2 <= t1 never evaluated: b2 >= b1 | 0 |
| 101 | return false; never executed: return false; | 0 |
| 102 | } else { | 0 |
| 103 | if (t2 < t1 || b2 > b1) evaluated: t2 < t1| yes Evaluation Count:81 | yes Evaluation Count:1754 |
evaluated: b2 > b1| yes Evaluation Count:141 | yes Evaluation Count:1613 |
| 81-1754 |
| 104 | return false; executed: return false;Execution Count:222 | 222 |
| 105 | } executed: }Execution Count:1613 | 1613 |
| 106 | | - |
| 107 | return true; executed: return true;Execution Count:1613 | 1613 |
| 108 | } | - |
| 109 | QRect QRect::operator|(const QRect &r) const | - |
| 110 | { | - |
| 111 | if (isNull()) evaluated: isNull()| yes Evaluation Count:875 | yes Evaluation Count:166634 |
| 875-166634 |
| 112 | return r; executed: return r;Execution Count:875 | 875 |
| 113 | if (r.isNull()) evaluated: r.isNull()| yes Evaluation Count:82348 | yes Evaluation Count:84286 |
| 82348-84286 |
| 114 | return *this; executed: return *this;Execution Count:82348 | 82348 |
| 115 | | - |
| 116 | int l1 = x1; | - |
| 117 | int r1 = x1; | - |
| 118 | if (x2 - x1 + 1 < 0) evaluated: x2 - x1 + 1 < 0| yes Evaluation Count:37 | yes Evaluation Count:84249 |
| 37-84249 |
| 119 | l1 = x2; executed: l1 = x2;Execution Count:37 | 37 |
| 120 | else | - |
| 121 | r1 = x2; executed: r1 = x2;Execution Count:84249 | 84249 |
| 122 | | - |
| 123 | int l2 = r.x1; | - |
| 124 | int r2 = r.x1; | - |
| 125 | if (r.x2 - r.x1 + 1 < 0) evaluated: r.x2 - r.x1 + 1 < 0| yes Evaluation Count:118 | yes Evaluation Count:84168 |
| 118-84168 |
| 126 | l2 = r.x2; executed: l2 = r.x2;Execution Count:118 | 118 |
| 127 | else | - |
| 128 | r2 = r.x2; executed: r2 = r.x2;Execution Count:84168 | 84168 |
| 129 | | - |
| 130 | int t1 = y1; | - |
| 131 | int b1 = y1; | - |
| 132 | if (y2 - y1 + 1 < 0) evaluated: y2 - y1 + 1 < 0| yes Evaluation Count:4 | yes Evaluation Count:84282 |
| 4-84282 |
| 133 | t1 = y2; executed: t1 = y2;Execution Count:4 | 4 |
| 134 | else | - |
| 135 | b1 = y2; executed: b1 = y2;Execution Count:84282 | 84282 |
| 136 | | - |
| 137 | int t2 = r.y1; | - |
| 138 | int b2 = r.y1; | - |
| 139 | if (r.y2 - r.y1 + 1 < 0) evaluated: r.y2 - r.y1 + 1 < 0| yes Evaluation Count:4 | yes Evaluation Count:84282 |
| 4-84282 |
| 140 | t2 = r.y2; executed: t2 = r.y2;Execution Count:4 | 4 |
| 141 | else | - |
| 142 | b2 = r.y2; executed: b2 = r.y2;Execution Count:84282 | 84282 |
| 143 | | - |
| 144 | QRect tmp; | - |
| 145 | tmp.x1 = qMin(l1, l2); | - |
| 146 | tmp.x2 = qMax(r1, r2); | - |
| 147 | tmp.y1 = qMin(t1, t2); | - |
| 148 | tmp.y2 = qMax(b1, b2); | - |
| 149 | return tmp; executed: return tmp;Execution Count:84286 | 84286 |
| 150 | } | - |
| 151 | QRect QRect::operator&(const QRect &r) const | - |
| 152 | { | - |
| 153 | if (isNull() || r.isNull()) evaluated: isNull()| yes Evaluation Count:172 | yes Evaluation Count:179644 |
evaluated: r.isNull()| yes Evaluation Count:153 | yes Evaluation Count:179491 |
| 153-179644 |
| 154 | return QRect(); executed: return QRect();Execution Count:325 | 325 |
| 155 | | - |
| 156 | int l1 = x1; | - |
| 157 | int r1 = x1; | - |
| 158 | if (x2 - x1 + 1 < 0) evaluated: x2 - x1 + 1 < 0| yes Evaluation Count:10 | yes Evaluation Count:179481 |
| 10-179481 |
| 159 | l1 = x2; executed: l1 = x2;Execution Count:10 | 10 |
| 160 | else | - |
| 161 | r1 = x2; executed: r1 = x2;Execution Count:179481 | 179481 |
| 162 | | - |
| 163 | int l2 = r.x1; | - |
| 164 | int r2 = r.x1; | - |
| 165 | if (r.x2 - r.x1 + 1 < 0) evaluated: r.x2 - r.x1 + 1 < 0| yes Evaluation Count:4 | yes Evaluation Count:179487 |
| 4-179487 |
| 166 | l2 = r.x2; executed: l2 = r.x2;Execution Count:4 | 4 |
| 167 | else | - |
| 168 | r2 = r.x2; executed: r2 = r.x2;Execution Count:179487 | 179487 |
| 169 | | - |
| 170 | if (l1 > r2 || l2 > r1) evaluated: l1 > r2| yes Evaluation Count:549 | yes Evaluation Count:178942 |
evaluated: l2 > r1| yes Evaluation Count:179 | yes Evaluation Count:178763 |
| 179-178942 |
| 171 | return QRect(); executed: return QRect();Execution Count:728 | 728 |
| 172 | | - |
| 173 | int t1 = y1; | - |
| 174 | int b1 = y1; | - |
| 175 | if (y2 - y1 + 1 < 0) evaluated: y2 - y1 + 1 < 0| yes Evaluation Count:4 | yes Evaluation Count:178759 |
| 4-178759 |
| 176 | t1 = y2; executed: t1 = y2;Execution Count:4 | 4 |
| 177 | else | - |
| 178 | b1 = y2; executed: b1 = y2;Execution Count:178759 | 178759 |
| 179 | | - |
| 180 | int t2 = r.y1; | - |
| 181 | int b2 = r.y1; | - |
| 182 | if (r.y2 - r.y1 + 1 < 0) evaluated: r.y2 - r.y1 + 1 < 0| yes Evaluation Count:3 | yes Evaluation Count:178760 |
| 3-178760 |
| 183 | t2 = r.y2; executed: t2 = r.y2;Execution Count:3 | 3 |
| 184 | else | - |
| 185 | b2 = r.y2; executed: b2 = r.y2;Execution Count:178760 | 178760 |
| 186 | | - |
| 187 | if (t1 > b2 || t2 > b1) evaluated: t1 > b2| yes Evaluation Count:257 | yes Evaluation Count:178506 |
evaluated: t2 > b1| yes Evaluation Count:114 | yes Evaluation Count:178392 |
| 114-178506 |
| 188 | return QRect(); executed: return QRect();Execution Count:371 | 371 |
| 189 | | - |
| 190 | QRect tmp; | - |
| 191 | tmp.x1 = qMax(l1, l2); | - |
| 192 | tmp.x2 = qMin(r1, r2); | - |
| 193 | tmp.y1 = qMax(t1, t2); | - |
| 194 | tmp.y2 = qMin(b1, b2); | - |
| 195 | return tmp; executed: return tmp;Execution Count:178392 | 178392 |
| 196 | } | - |
| 197 | bool QRect::intersects(const QRect &r) const | - |
| 198 | { | - |
| 199 | if (isNull() || r.isNull()) evaluated: isNull()| yes Evaluation Count:554 | yes Evaluation Count:8681 |
evaluated: r.isNull()| yes Evaluation Count:526 | yes Evaluation Count:8155 |
| 526-8681 |
| 200 | return false; executed: return false;Execution Count:1080 | 1080 |
| 201 | | - |
| 202 | int l1 = x1; | - |
| 203 | int r1 = x1; | - |
| 204 | if (x2 - x1 + 1 < 0) evaluated: x2 - x1 + 1 < 0| yes Evaluation Count:4 | yes Evaluation Count:8151 |
| 4-8151 |
| 205 | l1 = x2; executed: l1 = x2;Execution Count:4 | 4 |
| 206 | else | - |
| 207 | r1 = x2; executed: r1 = x2;Execution Count:8151 | 8151 |
| 208 | | - |
| 209 | int l2 = r.x1; | - |
| 210 | int r2 = r.x1; | - |
| 211 | if (r.x2 - r.x1 + 1 < 0) evaluated: r.x2 - r.x1 + 1 < 0| yes Evaluation Count:7 | yes Evaluation Count:8148 |
| 7-8148 |
| 212 | l2 = r.x2; executed: l2 = r.x2;Execution Count:7 | 7 |
| 213 | else | - |
| 214 | r2 = r.x2; executed: r2 = r.x2;Execution Count:8148 | 8148 |
| 215 | | - |
| 216 | if (l1 > r2 || l2 > r1) evaluated: l1 > r2| yes Evaluation Count:350 | yes Evaluation Count:7805 |
evaluated: l2 > r1| yes Evaluation Count:122 | yes Evaluation Count:7683 |
| 122-7805 |
| 217 | return false; executed: return false;Execution Count:472 | 472 |
| 218 | | - |
| 219 | int t1 = y1; | - |
| 220 | int b1 = y1; | - |
| 221 | if (y2 - y1 + 1 < 0) evaluated: y2 - y1 + 1 < 0| yes Evaluation Count:3 | yes Evaluation Count:7680 |
| 3-7680 |
| 222 | t1 = y2; executed: t1 = y2;Execution Count:3 | 3 |
| 223 | else | - |
| 224 | b1 = y2; executed: b1 = y2;Execution Count:7680 | 7680 |
| 225 | | - |
| 226 | int t2 = r.y1; | - |
| 227 | int b2 = r.y1; | - |
| 228 | if (r.y2 - r.y1 + 1 < 0) evaluated: r.y2 - r.y1 + 1 < 0| yes Evaluation Count:6 | yes Evaluation Count:7677 |
| 6-7677 |
| 229 | t2 = r.y2; executed: t2 = r.y2;Execution Count:6 | 6 |
| 230 | else | - |
| 231 | b2 = r.y2; executed: b2 = r.y2;Execution Count:7677 | 7677 |
| 232 | | - |
| 233 | if (t1 > b2 || t2 > b1) evaluated: t1 > b2| yes Evaluation Count:182 | yes Evaluation Count:7501 |
evaluated: t2 > b1| yes Evaluation Count:133 | yes Evaluation Count:7368 |
| 133-7501 |
| 234 | return false; executed: return false;Execution Count:315 | 315 |
| 235 | | - |
| 236 | return true; executed: return true;Execution Count:7368 | 7368 |
| 237 | } | - |
| 238 | QDataStream &operator<<(QDataStream &s, const QRect &r) | - |
| 239 | { | - |
| 240 | if (s.version() == 1) partially evaluated: s.version() == 1| no Evaluation Count:0 | yes Evaluation Count:102 |
| 0-102 |
| 241 | s << (qint16)r.left() << (qint16)r.top() | 0 |
| 242 | << (qint16)r.right() << (qint16)r.bottom(); never executed: s << (qint16)r.left() << (qint16)r.top() << (qint16)r.right() << (qint16)r.bottom(); | 0 |
| 243 | else | - |
| 244 | s << (qint32)r.left() << (qint32)r.top() | 102 |
| 245 | << (qint32)r.right() << (qint32)r.bottom(); executed: s << (qint32)r.left() << (qint32)r.top() << (qint32)r.right() << (qint32)r.bottom();Execution Count:102 | 102 |
| 246 | return s; executed: return s;Execution Count:102 | 102 |
| 247 | } | - |
| 248 | QDataStream &operator>>(QDataStream &s, QRect &r) | - |
| 249 | { | - |
| 250 | if (s.version() == 1) { partially evaluated: s.version() == 1| no Evaluation Count:0 | yes Evaluation Count:106 |
| 0-106 |
| 251 | qint16 x1, y1, x2, y2; | - |
| 252 | s >> x1; s >> y1; s >> x2; s >> y2; | - |
| 253 | r.setCoords(x1, y1, x2, y2); | - |
| 254 | } | 0 |
| 255 | else { | - |
| 256 | qint32 x1, y1, x2, y2; | - |
| 257 | s >> x1; s >> y1; s >> x2; s >> y2; | - |
| 258 | r.setCoords(x1, y1, x2, y2); | - |
| 259 | } executed: }Execution Count:106 | 106 |
| 260 | return s; executed: return s;Execution Count:106 | 106 |
| 261 | } | - |
| 262 | | - |
| 263 | | - |
| 264 | | - |
| 265 | | - |
| 266 | | - |
| 267 | QDebug operator<<(QDebug dbg, const QRect &r) { | - |
| 268 | dbg.nospace() << "QRect(" << r.x() << ',' << r.y() << ' ' | - |
| 269 | << r.width() << 'x' << r.height() << ')'; | - |
| 270 | return dbg.space(); executed: return dbg.space();Execution Count:4 | 4 |
| 271 | } | - |
| 272 | QRectF QRectF::normalized() const | - |
| 273 | { | - |
| 274 | QRectF r = *this; | - |
| 275 | if (r.w < 0) { evaluated: r.w < 0| yes Evaluation Count:1 | yes Evaluation Count:3280 |
| 1-3280 |
| 276 | r.xp += r.w; | - |
| 277 | r.w = -r.w; | - |
| 278 | } executed: }Execution Count:1 | 1 |
| 279 | if (r.h < 0) { partially evaluated: r.h < 0| no Evaluation Count:0 | yes Evaluation Count:3281 |
| 0-3281 |
| 280 | r.yp += r.h; | - |
| 281 | r.h = -r.h; | - |
| 282 | } | 0 |
| 283 | return r; executed: return r;Execution Count:3281 | 3281 |
| 284 | } | - |
| 285 | bool QRectF::contains(const QPointF &p) const | - |
| 286 | { | - |
| 287 | qreal l = xp; | - |
| 288 | qreal r = xp; | - |
| 289 | if (w < 0) evaluated: w < 0| yes Evaluation Count:12 | yes Evaluation Count:1268 |
| 12-1268 |
| 290 | l += w; executed: l += w;Execution Count:12 | 12 |
| 291 | else | - |
| 292 | r += w; executed: r += w;Execution Count:1268 | 1268 |
| 293 | if (l == r) evaluated: l == r| yes Evaluation Count:4 | yes Evaluation Count:1276 |
| 4-1276 |
| 294 | return false; executed: return false;Execution Count:4 | 4 |
| 295 | | - |
| 296 | if (p.x() < l || p.x() > r) evaluated: p.x() < l| yes Evaluation Count:114 | yes Evaluation Count:1162 |
evaluated: p.x() > r| yes Evaluation Count:42 | yes Evaluation Count:1120 |
| 42-1162 |
| 297 | return false; executed: return false;Execution Count:156 | 156 |
| 298 | | - |
| 299 | qreal t = yp; | - |
| 300 | qreal b = yp; | - |
| 301 | if (h < 0) evaluated: h < 0| yes Evaluation Count:12 | yes Evaluation Count:1108 |
| 12-1108 |
| 302 | t += h; executed: t += h;Execution Count:12 | 12 |
| 303 | else | - |
| 304 | b += h; executed: b += h;Execution Count:1108 | 1108 |
| 305 | if (t == b) evaluated: t == b| yes Evaluation Count:1 | yes Evaluation Count:1119 |
| 1-1119 |
| 306 | return false; executed: return false;Execution Count:1 | 1 |
| 307 | | - |
| 308 | if (p.y() < t || p.y() > b) evaluated: p.y() < t| yes Evaluation Count:18 | yes Evaluation Count:1101 |
evaluated: p.y() > b| yes Evaluation Count:58 | yes Evaluation Count:1043 |
| 18-1101 |
| 309 | return false; executed: return false;Execution Count:76 | 76 |
| 310 | | - |
| 311 | return true; executed: return true;Execution Count:1043 | 1043 |
| 312 | } | - |
| 313 | bool QRectF::contains(const QRectF &r) const | - |
| 314 | { | - |
| 315 | qreal l1 = xp; | - |
| 316 | qreal r1 = xp; | - |
| 317 | if (w < 0) evaluated: w < 0| yes Evaluation Count:4 | yes Evaluation Count:3039 |
| 4-3039 |
| 318 | l1 += w; executed: l1 += w;Execution Count:4 | 4 |
| 319 | else | - |
| 320 | r1 += w; executed: r1 += w;Execution Count:3039 | 3039 |
| 321 | if (l1 == r1) evaluated: l1 == r1| yes Evaluation Count:10 | yes Evaluation Count:3033 |
| 10-3033 |
| 322 | return false; executed: return false;Execution Count:10 | 10 |
| 323 | | - |
| 324 | qreal l2 = r.xp; | - |
| 325 | qreal r2 = r.xp; | - |
| 326 | if (r.w < 0) evaluated: r.w < 0| yes Evaluation Count:4 | yes Evaluation Count:3029 |
| 4-3029 |
| 327 | l2 += r.w; executed: l2 += r.w;Execution Count:4 | 4 |
| 328 | else | - |
| 329 | r2 += r.w; executed: r2 += r.w;Execution Count:3029 | 3029 |
| 330 | if (l2 == r2) evaluated: l2 == r2| yes Evaluation Count:1 | yes Evaluation Count:3032 |
| 1-3032 |
| 331 | return false; executed: return false;Execution Count:1 | 1 |
| 332 | | - |
| 333 | if (l2 < l1 || r2 > r1) evaluated: l2 < l1| yes Evaluation Count:48 | yes Evaluation Count:2984 |
evaluated: r2 > r1| yes Evaluation Count:105 | yes Evaluation Count:2879 |
| 48-2984 |
| 334 | return false; executed: return false;Execution Count:153 | 153 |
| 335 | | - |
| 336 | qreal t1 = yp; | - |
| 337 | qreal b1 = yp; | - |
| 338 | if (h < 0) evaluated: h < 0| yes Evaluation Count:3 | yes Evaluation Count:2876 |
| 3-2876 |
| 339 | t1 += h; executed: t1 += h;Execution Count:3 | 3 |
| 340 | else | - |
| 341 | b1 += h; executed: b1 += h;Execution Count:2876 | 2876 |
| 342 | if (t1 == b1) partially evaluated: t1 == b1| no Evaluation Count:0 | yes Evaluation Count:2879 |
| 0-2879 |
| 343 | return false; never executed: return false; | 0 |
| 344 | | - |
| 345 | qreal t2 = r.yp; | - |
| 346 | qreal b2 = r.yp; | - |
| 347 | if (r.h < 0) evaluated: r.h < 0| yes Evaluation Count:2 | yes Evaluation Count:2877 |
| 2-2877 |
| 348 | t2 += r.h; executed: t2 += r.h;Execution Count:2 | 2 |
| 349 | else | - |
| 350 | b2 += r.h; executed: b2 += r.h;Execution Count:2877 | 2877 |
| 351 | if (t2 == b2) partially evaluated: t2 == b2| no Evaluation Count:0 | yes Evaluation Count:2879 |
| 0-2879 |
| 352 | return false; never executed: return false; | 0 |
| 353 | | - |
| 354 | if (t2 < t1 || b2 > b1) evaluated: t2 < t1| yes Evaluation Count:5 | yes Evaluation Count:2874 |
evaluated: b2 > b1| yes Evaluation Count:42 | yes Evaluation Count:2832 |
| 5-2874 |
| 355 | return false; executed: return false;Execution Count:47 | 47 |
| 356 | | - |
| 357 | return true; executed: return true;Execution Count:2832 | 2832 |
| 358 | } | - |
| 359 | QRectF QRectF::operator|(const QRectF &r) const | - |
| 360 | { | - |
| 361 | if (isNull()) evaluated: isNull()| yes Evaluation Count:1492 | yes Evaluation Count:1849 |
| 1492-1849 |
| 362 | return r; executed: return r;Execution Count:1492 | 1492 |
| 363 | if (r.isNull()) evaluated: r.isNull()| yes Evaluation Count:2 | yes Evaluation Count:1847 |
| 2-1847 |
| 364 | return *this; executed: return *this;Execution Count:2 | 2 |
| 365 | | - |
| 366 | qreal left = xp; | - |
| 367 | qreal right = xp; | - |
| 368 | if (w < 0) evaluated: w < 0| yes Evaluation Count:4 | yes Evaluation Count:1843 |
| 4-1843 |
| 369 | left += w; executed: left += w;Execution Count:4 | 4 |
| 370 | else | - |
| 371 | right += w; executed: right += w;Execution Count:1843 | 1843 |
| 372 | | - |
| 373 | if (r.w < 0) { evaluated: r.w < 0| yes Evaluation Count:4 | yes Evaluation Count:1843 |
| 4-1843 |
| 374 | left = qMin(left, r.xp + r.w); | - |
| 375 | right = qMax(right, r.xp); | - |
| 376 | } else { executed: }Execution Count:4 | 4 |
| 377 | left = qMin(left, r.xp); | - |
| 378 | right = qMax(right, r.xp + r.w); | - |
| 379 | } executed: }Execution Count:1843 | 1843 |
| 380 | | - |
| 381 | qreal top = yp; | - |
| 382 | qreal bottom = yp; | - |
| 383 | if (h < 0) evaluated: h < 0| yes Evaluation Count:4 | yes Evaluation Count:1843 |
| 4-1843 |
| 384 | top += h; executed: top += h;Execution Count:4 | 4 |
| 385 | else | - |
| 386 | bottom += h; executed: bottom += h;Execution Count:1843 | 1843 |
| 387 | | - |
| 388 | if (r.h < 0) { evaluated: r.h < 0| yes Evaluation Count:4 | yes Evaluation Count:1843 |
| 4-1843 |
| 389 | top = qMin(top, r.yp + r.h); | - |
| 390 | bottom = qMax(bottom, r.yp); | - |
| 391 | } else { executed: }Execution Count:4 | 4 |
| 392 | top = qMin(top, r.yp); | - |
| 393 | bottom = qMax(bottom, r.yp + r.h); | - |
| 394 | } executed: }Execution Count:1843 | 1843 |
| 395 | | - |
| 396 | return QRectF(left, top, right - left, bottom - top); executed: return QRectF(left, top, right - left, bottom - top);Execution Count:1847 | 1847 |
| 397 | } | - |
| 398 | QRectF QRectF::operator&(const QRectF &r) const | - |
| 399 | { | - |
| 400 | qreal l1 = xp; | - |
| 401 | qreal r1 = xp; | - |
| 402 | if (w < 0) evaluated: w < 0| yes Evaluation Count:8 | yes Evaluation Count:1525 |
| 8-1525 |
| 403 | l1 += w; executed: l1 += w;Execution Count:8 | 8 |
| 404 | else | - |
| 405 | r1 += w; executed: r1 += w;Execution Count:1525 | 1525 |
| 406 | if (l1 == r1) evaluated: l1 == r1| yes Evaluation Count:19 | yes Evaluation Count:1514 |
| 19-1514 |
| 407 | return QRectF(); executed: return QRectF();Execution Count:19 | 19 |
| 408 | | - |
| 409 | qreal l2 = r.xp; | - |
| 410 | qreal r2 = r.xp; | - |
| 411 | if (r.w < 0) evaluated: r.w < 0| yes Evaluation Count:4 | yes Evaluation Count:1510 |
| 4-1510 |
| 412 | l2 += r.w; executed: l2 += r.w;Execution Count:4 | 4 |
| 413 | else | - |
| 414 | r2 += r.w; executed: r2 += r.w;Execution Count:1510 | 1510 |
| 415 | if (l2 == r2) evaluated: l2 == r2| yes Evaluation Count:3 | yes Evaluation Count:1511 |
| 3-1511 |
| 416 | return QRectF(); executed: return QRectF();Execution Count:3 | 3 |
| 417 | | - |
| 418 | if (l1 >= r2 || l2 >= r1) partially evaluated: l1 >= r2| no Evaluation Count:0 | yes Evaluation Count:1511 |
evaluated: l2 >= r1| yes Evaluation Count:16 | yes Evaluation Count:1495 |
| 0-1511 |
| 419 | return QRectF(); executed: return QRectF();Execution Count:16 | 16 |
| 420 | | - |
| 421 | qreal t1 = yp; | - |
| 422 | qreal b1 = yp; | - |
| 423 | if (h < 0) evaluated: h < 0| yes Evaluation Count:3 | yes Evaluation Count:1492 |
| 3-1492 |
| 424 | t1 += h; executed: t1 += h;Execution Count:3 | 3 |
| 425 | else | - |
| 426 | b1 += h; executed: b1 += h;Execution Count:1492 | 1492 |
| 427 | if (t1 == b1) partially evaluated: t1 == b1| no Evaluation Count:0 | yes Evaluation Count:1495 |
| 0-1495 |
| 428 | return QRectF(); never executed: return QRectF(); | 0 |
| 429 | | - |
| 430 | qreal t2 = r.yp; | - |
| 431 | qreal b2 = r.yp; | - |
| 432 | if (r.h < 0) evaluated: r.h < 0| yes Evaluation Count:3 | yes Evaluation Count:1492 |
| 3-1492 |
| 433 | t2 += r.h; executed: t2 += r.h;Execution Count:3 | 3 |
| 434 | else | - |
| 435 | b2 += r.h; executed: b2 += r.h;Execution Count:1492 | 1492 |
| 436 | if (t2 == b2) evaluated: t2 == b2| yes Evaluation Count:4 | yes Evaluation Count:1491 |
| 4-1491 |
| 437 | return QRectF(); executed: return QRectF();Execution Count:4 | 4 |
| 438 | | - |
| 439 | if (t1 >= b2 || t2 >= b1) evaluated: t1 >= b2| yes Evaluation Count:1 | yes Evaluation Count:1490 |
partially evaluated: t2 >= b1| no Evaluation Count:0 | yes Evaluation Count:1490 |
| 0-1490 |
| 440 | return QRectF(); executed: return QRectF();Execution Count:1 | 1 |
| 441 | | - |
| 442 | QRectF tmp; | - |
| 443 | tmp.xp = qMax(l1, l2); | - |
| 444 | tmp.yp = qMax(t1, t2); | - |
| 445 | tmp.w = qMin(r1, r2) - tmp.xp; | - |
| 446 | tmp.h = qMin(b1, b2) - tmp.yp; | - |
| 447 | return tmp; executed: return tmp;Execution Count:1490 | 1490 |
| 448 | } | - |
| 449 | bool QRectF::intersects(const QRectF &r) const | - |
| 450 | { | - |
| 451 | qreal l1 = xp; | - |
| 452 | qreal r1 = xp; | - |
| 453 | if (w < 0) evaluated: w < 0| yes Evaluation Count:4 | yes Evaluation Count:1127 |
| 4-1127 |
| 454 | l1 += w; executed: l1 += w;Execution Count:4 | 4 |
| 455 | else | - |
| 456 | r1 += w; executed: r1 += w;Execution Count:1127 | 1127 |
| 457 | if (l1 == r1) evaluated: l1 == r1| yes Evaluation Count:2 | yes Evaluation Count:1129 |
| 2-1129 |
| 458 | return false; executed: return false;Execution Count:2 | 2 |
| 459 | | - |
| 460 | qreal l2 = r.xp; | - |
| 461 | qreal r2 = r.xp; | - |
| 462 | if (r.w < 0) evaluated: r.w < 0| yes Evaluation Count:4 | yes Evaluation Count:1125 |
| 4-1125 |
| 463 | l2 += r.w; executed: l2 += r.w;Execution Count:4 | 4 |
| 464 | else | - |
| 465 | r2 += r.w; executed: r2 += r.w;Execution Count:1125 | 1125 |
| 466 | if (l2 == r2) evaluated: l2 == r2| yes Evaluation Count:1 | yes Evaluation Count:1128 |
| 1-1128 |
| 467 | return false; executed: return false;Execution Count:1 | 1 |
| 468 | | - |
| 469 | if (l1 >= r2 || l2 >= r1) evaluated: l1 >= r2| yes Evaluation Count:26 | yes Evaluation Count:1102 |
evaluated: l2 >= r1| yes Evaluation Count:18 | yes Evaluation Count:1084 |
| 18-1102 |
| 470 | return false; executed: return false;Execution Count:44 | 44 |
| 471 | | - |
| 472 | qreal t1 = yp; | - |
| 473 | qreal b1 = yp; | - |
| 474 | if (h < 0) evaluated: h < 0| yes Evaluation Count:3 | yes Evaluation Count:1081 |
| 3-1081 |
| 475 | t1 += h; executed: t1 += h;Execution Count:3 | 3 |
| 476 | else | - |
| 477 | b1 += h; executed: b1 += h;Execution Count:1081 | 1081 |
| 478 | if (t1 == b1) partially evaluated: t1 == b1| no Evaluation Count:0 | yes Evaluation Count:1084 |
| 0-1084 |
| 479 | return false; never executed: return false; | 0 |
| 480 | | - |
| 481 | qreal t2 = r.yp; | - |
| 482 | qreal b2 = r.yp; | - |
| 483 | if (r.h < 0) evaluated: r.h < 0| yes Evaluation Count:3 | yes Evaluation Count:1081 |
| 3-1081 |
| 484 | t2 += r.h; executed: t2 += r.h;Execution Count:3 | 3 |
| 485 | else | - |
| 486 | b2 += r.h; executed: b2 += r.h;Execution Count:1081 | 1081 |
| 487 | if (t2 == b2) partially evaluated: t2 == b2| no Evaluation Count:0 | yes Evaluation Count:1084 |
| 0-1084 |
| 488 | return false; never executed: return false; | 0 |
| 489 | | - |
| 490 | if (t1 >= b2 || t2 >= b1) evaluated: t1 >= b2| yes Evaluation Count:17 | yes Evaluation Count:1067 |
evaluated: t2 >= b1| yes Evaluation Count:74 | yes Evaluation Count:993 |
| 17-1067 |
| 491 | return false; executed: return false;Execution Count:91 | 91 |
| 492 | | - |
| 493 | return true; executed: return true;Execution Count:993 | 993 |
| 494 | } | - |
| 495 | QRect QRectF::toAlignedRect() const | - |
| 496 | { | - |
| 497 | int xmin = int(qFloor(xp)); | - |
| 498 | int xmax = int(qCeil(xp + w)); | - |
| 499 | int ymin = int(qFloor(yp)); | - |
| 500 | int ymax = int(qCeil(yp + h)); | - |
| 501 | return QRect(xmin, ymin, xmax - xmin, ymax - ymin); executed: return QRect(xmin, ymin, xmax - xmin, ymax - ymin);Execution Count:33136 | 33136 |
| 502 | } | - |
| 503 | QDataStream &operator<<(QDataStream &s, const QRectF &r) | - |
| 504 | { | - |
| 505 | s << double(r.x()) << double(r.y()) << double(r.width()) << double(r.height()); | - |
| 506 | return s; executed: return s;Execution Count:72 | 72 |
| 507 | } | - |
| 508 | QDataStream &operator>>(QDataStream &s, QRectF &r) | - |
| 509 | { | - |
| 510 | double x, y, w, h; | - |
| 511 | s >> x; | - |
| 512 | s >> y; | - |
| 513 | s >> w; | - |
| 514 | s >> h; | - |
| 515 | r.setRect(qreal(x), qreal(y), qreal(w), qreal(h)); | - |
| 516 | return s; executed: return s;Execution Count:75 | 75 |
| 517 | } | - |
| 518 | | - |
| 519 | | - |
| 520 | | - |
| 521 | | - |
| 522 | | - |
| 523 | QDebug operator<<(QDebug dbg, const QRectF &r) { | - |
| 524 | dbg.nospace() << "QRectF(" << r.x() << ',' << r.y() << ' ' | - |
| 525 | << r.width() << 'x' << r.height() << ')'; | - |
| 526 | return dbg.space(); executed: return dbg.space();Execution Count:1 | 1 |
| 527 | } | - |
| 528 | | - |
| 529 | | - |
| 530 | | - |
| 531 | | - |
| | |