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 <algorithm> |
9 #include <deque> | 10 #include <deque> |
10 #include <limits> | 11 #include <limits> |
11 #include <vector> | 12 #include <vector> |
12 | 13 |
13 #include "base/logging.h" | 14 #include "base/logging.h" |
14 #include "cc/math_util.h" | 15 #include "cc/math_util.h" |
15 #include "cc/render_surface_impl.h" | 16 #include "cc/render_surface_impl.h" |
16 #include <public/WebTransformationMatrix.h> | 17 #include <public/WebTransformationMatrix.h> |
17 | 18 |
18 using namespace std; | 19 using namespace std; |
(...skipping 388 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
407 *it = sortedList[count++]->layer; | 408 *it = sortedList[count++]->layer; |
408 | 409 |
409 DVLOG(2) << "Sorting end ----"; | 410 DVLOG(2) << "Sorting end ----"; |
410 | 411 |
411 m_nodes.clear(); | 412 m_nodes.clear(); |
412 m_edges.clear(); | 413 m_edges.clear(); |
413 m_activeEdges.clear(); | 414 m_activeEdges.clear(); |
414 } | 415 } |
415 | 416 |
416 } // namespace cc | 417 } // namespace cc |
OLD | NEW |