[oilpan] Fix iterators over member collections to return Result<T>

Source/heap/tests/HeapTest.cpp

 /*
  * Copyright (c) 2013, Google Inc. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions are
  * met:
  *
  *     * Redistributions of source code must retain the above copyright
  * notice, this list of conditions and the following disclaimer.
  *     * Redistributions in binary form must reproduce the above
@@ skipping 1128 matching lines @@
         EXPECT_EQ(afterGC2.totalObjectSpace(), afterOneAdd.totalObjectSpace());
 
         for (int i = 1; i < 1000; i++)
             set->add(IntWrapper::create(i), &set);
 
         HeapStats afterAdding1000;
         Heap::getStats(&afterAdding1000);
         EXPECT_TRUE(afterAdding1000.totalObjectSpace() > afterGC2.totalObjectSpace());
 
         EXPECT_EQ(set->size(), 1000);
-        int i = 0, ninetyNines = 0;
+        int i = 0, ninetyNines = 0, threeSixties = 0;
         for (HeapSet::iterator it(set->begin(&set)), end(set->end(&set)); it != end; ++it) {
             HandleScope forScope;
-            if (Handle<IntWrapper>(*it.get())->value() == 99)
+            if (it.get()->value() == 99)
                 ninetyNines++;
+            if (it->value() == 360)
+                threeSixties++;
             i++;
         }
         EXPECT_EQ(i, 1000);
         EXPECT_EQ(ninetyNines, 1);
+        EXPECT_EQ(threeSixties, 1);
 
         // Equality is by underlying pointer, so there are two different
         // IntWrappers in there now that contain '1'. We add one of them
         // again, that should not matter.
         set->add(one, &set);
         EXPECT_EQ(set->size(), 1000);
     }
 
     Heap::collectGarbage();
     EXPECT_EQ(IntWrapper::s_destructorCalls, 1000);
@@ skipping 70 matching lines @@
 {
     HeapTester::hashMapMembers();
 }
 
 TEST(heap, HashMapOfMembers2)
 {
     HeapTester::hashMapMembers2();
 }
 
 } // namespace WebCore