Second wave of Win64 warning cleanup
https://codereview.chromium.org/27343002/
git-svn-id: http://skia.googlecode.com/svn/trunk@11778 2bbb7eff-a529-9590-31e7-b0007b416f81
diff --git a/src/pdf/SkPDFResourceDict.cpp b/src/pdf/SkPDFResourceDict.cpp
index 0102b3c..6f5d167 100644
--- a/src/pdf/SkPDFResourceDict.cpp
+++ b/src/pdf/SkPDFResourceDict.cpp
@@ -65,7 +65,7 @@
// Actual sub-dicts will be lazily added later
fTypes.setCount(kResourceTypeCount);
- for (size_t i=0; i < kResourceTypeCount; i++) {
+ for (int i=0; i < kResourceTypeCount; i++) {
fTypes[i] = NULL;
}
}
diff --git a/src/pdf/SkTSet.h b/src/pdf/SkTSet.h
index c2d2785..1609a9d 100644
--- a/src/pdf/SkTSet.h
+++ b/src/pdf/SkTSet.h
@@ -291,12 +291,12 @@
// A O(n log n) algorithm is necessary as O(n^2) will choke some GMs.
SkAutoMalloc sortedArray(fOrderedArray->bytes());
T* sortedBase = reinterpret_cast<T*>(sortedArray.get());
- size_t count = fOrderedArray->count();
+ int count = fOrderedArray->count();
fOrderedArray->copyRange(sortedBase, 0, count);
SkTQSort<T>(sortedBase, sortedBase + count - 1);
- for (size_t i = 0; i < count; ++i) {
+ for (int i = 0; i < count; ++i) {
if (sortedBase[i] != (*fSetArray)[i]) {
return false;
}