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 "config.h" | 5 #include "config.h" |
6 | 6 |
7 #include "cc/layer_sorter.h" | 7 #include "cc/layer_sorter.h" |
8 | 8 |
9 #include "cc/layer_impl.h" | 9 #include "cc/layer_impl.h" |
10 #include "cc/math_util.h" | 10 #include "cc/math_util.h" |
11 #include "cc/single_thread_proxy.h" | 11 #include "cc/single_thread_proxy.h" |
12 #include "testing/gtest/include/gtest/gtest.h" | 12 #include "testing/gtest/include/gtest/gtest.h" |
13 #include <public/WebTransformationMatrix.h> | 13 #include <public/WebTransformationMatrix.h> |
14 | 14 |
15 using namespace cc; | |
16 using WebKit::WebTransformationMatrix; | 15 using WebKit::WebTransformationMatrix; |
17 | 16 |
| 17 namespace cc { |
18 namespace { | 18 namespace { |
19 | 19 |
20 // Note: In the following overlap tests, the "camera" is looking down the negati
ve Z axis, | 20 // Note: In the following overlap tests, the "camera" is looking down the negati
ve Z axis, |
21 // meaning that layers with smaller z values (more negative) are further from th
e camera | 21 // meaning that layers with smaller z values (more negative) are further from th
e camera |
22 // and therefore must be drawn before layers with higher z values. | 22 // and therefore must be drawn before layers with higher z values. |
23 | 23 |
24 TEST(LayerSorterTest, BasicOverlap) | 24 TEST(LayerSorterTest, BasicOverlap) |
25 { | 25 { |
26 LayerSorter::ABCompareResult overlapResult; | 26 LayerSorter::ABCompareResult overlapResult; |
27 const float zThreshold = 0.1f; | 27 const float zThreshold = 0.1f; |
(...skipping 227 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
255 layerSorter.sort(layerList.begin(), layerList.end()); | 255 layerSorter.sort(layerList.begin(), layerList.end()); |
256 | 256 |
257 ASSERT_EQ(static_cast<size_t>(5), layerList.size()); | 257 ASSERT_EQ(static_cast<size_t>(5), layerList.size()); |
258 EXPECT_EQ(3, layerList[0]->id()); | 258 EXPECT_EQ(3, layerList[0]->id()); |
259 EXPECT_EQ(4, layerList[1]->id()); | 259 EXPECT_EQ(4, layerList[1]->id()); |
260 EXPECT_EQ(1, layerList[2]->id()); | 260 EXPECT_EQ(1, layerList[2]->id()); |
261 EXPECT_EQ(2, layerList[3]->id()); | 261 EXPECT_EQ(2, layerList[3]->id()); |
262 EXPECT_EQ(5, layerList[4]->id()); | 262 EXPECT_EQ(5, layerList[4]->id()); |
263 } | 263 } |
264 | 264 |
265 } // anonymous namespace | 265 } // namespace |
| 266 } // namespace cc |
OLD | NEW |