Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 // Copyright 2012 The Chromium Authors. All rights reserved. | 1 // Copyright 2012 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #include "cc/resources/picture_layer_tiling_set.h" | 5 #include "cc/resources/picture_layer_tiling_set.h" |
| 6 | 6 |
| 7 #include <map> | 7 #include <map> |
| 8 #include <vector> | 8 #include <vector> |
| 9 | 9 |
| 10 #include "cc/resources/resource_pool.h" | 10 #include "cc/resources/resource_pool.h" |
| (...skipping 214 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 225 EXPECT_TRUE(tiling->TilingRect().Contains(tiling->live_tiles_rect())); | 225 EXPECT_TRUE(tiling->TilingRect().Contains(tiling->live_tiles_rect())); |
| 226 | 226 |
| 227 std::vector<Tile*> tiles = tiling->AllTilesForTesting(); | 227 std::vector<Tile*> tiles = tiling->AllTilesForTesting(); |
| 228 for (size_t i = 0; i < tiles.size(); ++i) { | 228 for (size_t i = 0; i < tiles.size(); ++i) { |
| 229 const Tile* tile = tiles[i]; | 229 const Tile* tile = tiles[i]; |
| 230 ASSERT_TRUE(!!tile); | 230 ASSERT_TRUE(!!tile); |
| 231 EXPECT_EQ(tile->picture_pile(), pile); | 231 EXPECT_EQ(tile->picture_pile(), pile); |
| 232 EXPECT_TRUE(tile->content_rect().Intersects(tiling->live_tiles_rect())) | 232 EXPECT_TRUE(tile->content_rect().Intersects(tiling->live_tiles_rect())) |
| 233 << "All tiles must be inside the live tiles rect."; | 233 << "All tiles must be inside the live tiles rect."; |
| 234 } | 234 } |
| 235 | |
| 236 for (PictureLayerTiling::CoverageIterator iter( | |
| 237 tiling, tiling->contents_scale(), tiling->live_tiles_rect()); | |
| 238 iter; | |
| 239 ++iter) { | |
| 240 EXPECT_TRUE(*iter) << "The live tiles rect must be full."; | |
|
vmpstr
2014/07/02 23:51:29
That's now a lie.
| |
| 241 } | |
| 242 } | 235 } |
| 243 | 236 |
| 244 gfx::Size tile_size_; | 237 gfx::Size tile_size_; |
| 245 | 238 |
| 246 FakePictureLayerTilingClient source_client_; | 239 FakePictureLayerTilingClient source_client_; |
| 247 gfx::Size source_bounds_; | 240 gfx::Size source_bounds_; |
| 248 scoped_ptr<PictureLayerTilingSet> source_; | 241 scoped_ptr<PictureLayerTilingSet> source_; |
| 249 | 242 |
| 250 FakePictureLayerTilingClient target_client_; | 243 FakePictureLayerTilingClient target_client_; |
| 251 gfx::Size target_bounds_; | 244 gfx::Size target_bounds_; |
| (...skipping 157 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 409 std::vector<Tile*> new_tiles = target_->tiling_at(0)->AllTilesForTesting(); | 402 std::vector<Tile*> new_tiles = target_->tiling_at(0)->AllTilesForTesting(); |
| 410 for (size_t i = 0; i < original_tiles.size(); ++i) { | 403 for (size_t i = 0; i < original_tiles.size(); ++i) { |
| 411 std::vector<Tile*>::iterator find = | 404 std::vector<Tile*>::iterator find = |
| 412 std::find(new_tiles.begin(), new_tiles.end(), original_tiles[i]); | 405 std::find(new_tiles.begin(), new_tiles.end(), original_tiles[i]); |
| 413 EXPECT_TRUE(find == new_tiles.end()); | 406 EXPECT_TRUE(find == new_tiles.end()); |
| 414 } | 407 } |
| 415 } | 408 } |
| 416 | 409 |
| 417 } // namespace | 410 } // namespace |
| 418 } // namespace cc | 411 } // namespace cc |
| OLD | NEW |