| commit | 4813458d89fb276680168848bd861b307cf83f51 | [log] [tgz] |
|---|---|---|
| author | rileya@google.com <rileya@google.com@2bbb7eff-a529-9590-31e7-b0007b416f81> | Tue Sep 11 15:41:50 2012 +0000 |
| committer | rileya@google.com <rileya@google.com@2bbb7eff-a529-9590-31e7-b0007b416f81> | Tue Sep 11 15:41:50 2012 +0000 |
| tree | b6f1f71891ea40c8857d8a66603a267a16674c3e | |
| parent | 9fd7f8d2906365637dc25f98ffdede87d631ef71 [diff] [blame] |
Make BBoxHierarchy ref-counted, fix leak in RTreeTest. Review URL: https://codereview.appspot.com/6489108 git-svn-id: http://skia.googlecode.com/svn/trunk@5484 2bbb7eff-a529-9590-31e7-b0007b416f81
diff --git a/tests/RTreeTest.cpp b/tests/RTreeTest.cpp index 61e6b67..d60bf0c 100644 --- a/tests/RTreeTest.cpp +++ b/tests/RTreeTest.cpp
@@ -82,6 +82,7 @@ DataRect rects[NUM_RECTS]; SkRandom rand; SkRTree* rtree = SkRTree::Create(MIN_CHILDREN, MAX_CHILDREN); + SkAutoUnref au(rtree); REPORTER_ASSERT(reporter, NULL != rtree); int expectedDepthMin = -1;