diff options
author | 2015-08-19 09:51:00 -0700 | |
---|---|---|
committer | 2015-08-19 09:51:01 -0700 | |
commit | c6ad06acefa096716f8dabed5342f9b89dc43dfe (patch) | |
tree | d7f0f880609d4e7876790a846cdbab4702590109 /src/core/SkRTree.cpp | |
parent | 4b013296bf67df6c8d119a8f5a2b3dd6530c0b6f (diff) |
unsigned -> int for counts and indices in picture-related code
also, (C)
BUG=skia:
Review URL: https://codereview.chromium.org/1300163002
Diffstat (limited to 'src/core/SkRTree.cpp')
-rw-r--r-- | src/core/SkRTree.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/core/SkRTree.cpp b/src/core/SkRTree.cpp index 2fded6f72b..bae2fdce3f 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) { |