OLD | NEW |
1 // Copyright 2011 The Chromium Authors. All rights reserved. | 1 // Copyright 2011 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/layer_sorter.h" | 5 #include "cc/layer_sorter.h" |
6 | 6 |
| 7 #include "cc/base/math_util.h" |
7 #include "cc/layer_impl.h" | 8 #include "cc/layer_impl.h" |
8 #include "cc/math_util.h" | |
9 #include "cc/single_thread_proxy.h" | 9 #include "cc/single_thread_proxy.h" |
10 #include "cc/test/fake_impl_proxy.h" | 10 #include "cc/test/fake_impl_proxy.h" |
11 #include "cc/test/fake_layer_tree_host_impl.h" | 11 #include "cc/test/fake_layer_tree_host_impl.h" |
12 #include "testing/gtest/include/gtest/gtest.h" | 12 #include "testing/gtest/include/gtest/gtest.h" |
13 #include "ui/gfx/transform.h" | 13 #include "ui/gfx/transform.h" |
14 | 14 |
15 namespace cc { | 15 namespace cc { |
16 namespace { | 16 namespace { |
17 | 17 |
18 // Note: In the following overlap tests, the "camera" is looking down the | 18 // Note: In the following overlap tests, the "camera" is looking down the |
(...skipping 298 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
317 layer_sorter.Sort(layer_list.begin(), layer_list.end()); | 317 layer_sorter.Sort(layer_list.begin(), layer_list.end()); |
318 | 318 |
319 ASSERT_EQ(2u, layer_list.size()); | 319 ASSERT_EQ(2u, layer_list.size()); |
320 EXPECT_EQ(1, layer_list[0]->id()); | 320 EXPECT_EQ(1, layer_list[0]->id()); |
321 EXPECT_EQ(2, layer_list[1]->id()); | 321 EXPECT_EQ(2, layer_list[1]->id()); |
322 } | 322 } |
323 | 323 |
324 } // namespace | 324 } // namespace |
325 } // namespace cc | 325 } // namespace cc |
326 | 326 |
OLD | NEW |