| Index: cc/resources/prioritized_tile_set.cc
|
| diff --git a/cc/resources/prioritized_tile_set.cc b/cc/resources/prioritized_tile_set.cc
|
| index d1cc5b7f80c5aed7a365fbe842b51d3c43283a11..c59e53e38e37ffa7676237665aa191c0721a787c 100644
|
| --- a/cc/resources/prioritized_tile_set.cc
|
| +++ b/cc/resources/prioritized_tile_set.cc
|
| @@ -51,7 +51,7 @@ typedef std::vector<Tile*> TileVector;
|
| void SortBinTiles(ManagedTileBin bin, TileVector* tiles) {
|
| switch (bin) {
|
| case NOW_AND_READY_TO_DRAW_BIN:
|
| - break;
|
| + return;
|
| case NOW_BIN:
|
| case SOON_BIN:
|
| case EVENTUALLY_AND_ACTIVE_BIN:
|
| @@ -59,16 +59,15 @@ void SortBinTiles(ManagedTileBin bin, TileVector* tiles) {
|
| case NEVER_AND_ACTIVE_BIN:
|
| case NEVER_BIN:
|
| std::sort(tiles->begin(), tiles->end(), BinComparator());
|
| - break;
|
| - default:
|
| - NOTREACHED();
|
| + return;
|
| }
|
| + NOTREACHED();
|
| }
|
|
|
| } // namespace
|
|
|
| PrioritizedTileSet::PrioritizedTileSet() {
|
| - for (int bin = 0; bin < NUM_BINS; ++bin)
|
| + for (int bin = 0; bin < ManagedTileBin_ARRAYSIZE; ++bin)
|
| bin_sorted_[bin] = true;
|
| }
|
|
|
| @@ -80,7 +79,7 @@ void PrioritizedTileSet::InsertTile(Tile* tile, ManagedTileBin bin) {
|
| }
|
|
|
| void PrioritizedTileSet::Clear() {
|
| - for (int bin = 0; bin < NUM_BINS; ++bin) {
|
| + for (int bin = 0; bin < ManagedTileBin_ARRAYSIZE; ++bin) {
|
| tiles_[bin].clear();
|
| bin_sorted_[bin] = true;
|
| }
|
|
|