Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 // Copyright 2015 The Chromium Authors. All rights reserved. | 1 // Copyright 2015 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/base/rtree.h" | 5 #include "cc/base/rtree.h" |
| 6 | 6 |
| 7 #include <stddef.h> | 7 #include <stddef.h> |
| 8 | 8 |
| 9 #include "testing/gtest/include/gtest/gtest.h" | 9 #include "testing/gtest/include/gtest/gtest.h" |
| 10 | 10 |
| 11 namespace cc { | 11 namespace cc { |
| 12 | 12 |
| 13 TEST(RTreeTest, ReserveNodesDoesntDcheck) { | |
| 14 // Make sure that anywhere between 0 and 1000 rects, our reserve math in rtree | |
| 15 // is correct. (This test would DCHECK if broken). | |
|
danakj
2016/12/19 22:20:50
say where it would
vmpstr
2016/12/19 22:51:27
Done.
| |
| 16 for (int i = 0; i < 1000; ++i) { | |
| 17 std::vector<gfx::Rect> rects; | |
| 18 for (int j = 0; j < i; ++j) | |
| 19 rects.push_back(gfx::Rect(j, i, 1, 1)); | |
| 20 RTree rtree; | |
| 21 rtree.Build(rects); | |
| 22 } | |
| 23 } | |
| 24 | |
| 13 TEST(RTreeTest, NoOverlap) { | 25 TEST(RTreeTest, NoOverlap) { |
| 14 std::vector<gfx::Rect> rects; | 26 std::vector<gfx::Rect> rects; |
| 15 for (int y = 0; y < 50; ++y) { | 27 for (int y = 0; y < 50; ++y) { |
| 16 for (int x = 0; x < 50; ++x) { | 28 for (int x = 0; x < 50; ++x) { |
| 17 rects.push_back(gfx::Rect(x, y, 1, 1)); | 29 rects.push_back(gfx::Rect(x, y, 1, 1)); |
| 18 } | 30 } |
| 19 } | 31 } |
| 20 | 32 |
| 21 RTree rtree; | 33 RTree rtree; |
| 22 rtree.Build(rects); | 34 rtree.Build(rects); |
| (...skipping 65 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 88 rects.push_back(gfx::Rect(0, 0, 10, 10)); | 100 rects.push_back(gfx::Rect(0, 0, 10, 10)); |
| 89 rects.push_back(gfx::Rect(5, 5, 5, 5)); | 101 rects.push_back(gfx::Rect(5, 5, 5, 5)); |
| 90 | 102 |
| 91 RTree rtree; | 103 RTree rtree; |
| 92 rtree.Build(rects); | 104 rtree.Build(rects); |
| 93 | 105 |
| 94 ASSERT_EQ(gfx::Rect(0, 0, 10, 10), rtree.GetBounds()); | 106 ASSERT_EQ(gfx::Rect(0, 0, 10, 10), rtree.GetBounds()); |
| 95 } | 107 } |
| 96 | 108 |
| 97 } // namespace cc | 109 } // namespace cc |
| OLD | NEW |