OLD | NEW |
1 // Copyright 2014 The Chromium Authors. All rights reserved. | 1 // Copyright 2014 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 "ui/gfx/geometry/r_tree.h" | 5 #include "ui/gfx/geometry/r_tree.h" |
6 | 6 |
7 #include <algorithm> | 7 #include <algorithm> |
8 #include <limits> | 8 #include <limits> |
9 | 9 |
10 #include "base/logging.h" | 10 #include "base/logging.h" |
(...skipping 730 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
741 int starting_level = -1; | 741 int starting_level = -1; |
742 InsertNode(orphans[i], &starting_level); | 742 InsertNode(orphans[i], &starting_level); |
743 } | 743 } |
744 | 744 |
745 // Clear out the orphans list without deleting any of the children, as they | 745 // Clear out the orphans list without deleting any of the children, as they |
746 // have been re-inserted into the tree. | 746 // have been re-inserted into the tree. |
747 orphans.weak_clear(); | 747 orphans.weak_clear(); |
748 } | 748 } |
749 | 749 |
750 } // namespace gfx | 750 } // namespace gfx |
OLD | NEW |