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