Second wave of Win64 warning cleanup

src/pdf/SkTSet.h

 /*
  * Copyright 2012 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 #ifndef SkTSet_DEFINED
 #define SkTSet_DEFINED
 
@@ skipping 273 matching lines @@
             return false;
         }
         if (fOrderedArray->count() == 0) {
             return true;
         }
 
         // Copy and sort fOrderedArray, then compare to fSetArray.
         // 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;
             }
         }
 
         return true;
     }
 #endif
 
 private:
@@ skipping 37 matching lines @@
             } else {
                 *posToInsertSorted = iMin + 1;
             }
         }
 
         return -1;
     }
 };
 
 #endif