Index: cc/base/rtree_unittest.cc |
diff --git a/cc/base/rtree_unittest.cc b/cc/base/rtree_unittest.cc |
index 83288832a9a6c6e27f4a4d72b328c1e15cbb32fa..054e5f3a6d48231f9898114e4958506da8b2eee3 100644 |
--- a/cc/base/rtree_unittest.cc |
+++ b/cc/base/rtree_unittest.cc |
@@ -10,6 +10,18 @@ |
namespace cc { |
+TEST(RTreeTest, ReserveNodesDoesntDcheck) { |
+ // Make sure that anywhere between 0 and 1000 rects, our reserve math in rtree |
+ // 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.
|
+ for (int i = 0; i < 1000; ++i) { |
+ std::vector<gfx::Rect> rects; |
+ for (int j = 0; j < i; ++j) |
+ rects.push_back(gfx::Rect(j, i, 1, 1)); |
+ RTree rtree; |
+ rtree.Build(rects); |
+ } |
+} |
+ |
TEST(RTreeTest, NoOverlap) { |
std::vector<gfx::Rect> rects; |
for (int y = 0; y < 50; ++y) { |