Index: src/core/SkRTree.cpp |
diff --git a/src/core/SkRTree.cpp b/src/core/SkRTree.cpp |
index 2fded6f72bd396be27b3e49d7614639bab99937e..bae2fdce3f86f79806a44423009cd11c6286021f 100644 |
--- a/src/core/SkRTree.cpp |
+++ b/src/core/SkRTree.cpp |
@@ -161,13 +161,13 @@ SkRTree::Branch SkRTree::bulkLoad(SkTDArray<Branch>* branches, int level) { |
return this->bulkLoad(branches, level + 1); |
} |
-void SkRTree::search(const SkRect& query, SkTDArray<unsigned>* results) const { |
+void SkRTree::search(const SkRect& query, SkTDArray<int>* results) const { |
if (fCount > 0 && SkRect::Intersects(fRoot.fBounds, query)) { |
this->search(fRoot.fSubtree, query, results); |
} |
} |
-void SkRTree::search(Node* node, const SkRect& query, SkTDArray<unsigned>* results) const { |
+void SkRTree::search(Node* node, const SkRect& query, SkTDArray<int>* results) const { |
for (int i = 0; i < node->fNumChildren; ++i) { |
if (SkRect::Intersects(node->fChildren[i].fBounds, query)) { |
if (0 == node->fLevel) { |