| 361 | }; |
| 362 | |
| 363 | void ByteMapBuilder::Mark(int lo, int hi) { |
| 364 | DCHECK_GE(lo, 0); |
| 365 | DCHECK_GE(hi, 0); |
| 366 | DCHECK_LE(lo, 255); |
| 367 | DCHECK_LE(hi, 255); |
| 368 | DCHECK_LE(lo, hi); |
| 369 | |
| 370 | // Ignore any [0-255] ranges. They cause us to recolor every range, which |
| 371 | // has no effect on the eventual result and is therefore a waste of time. |
| 372 | if (lo == 0 && hi == 255) |
| 373 | return; |
| 374 | |
| 375 | ranges_.emplace_back(lo, hi); |
| 376 | } |
| 377 | |
| 378 | void ByteMapBuilder::Merge() { |
| 379 | for (std::vector<std::pair<int, int>>::const_iterator it = ranges_.begin(); |
no test coverage detected