Use C++11 range-based loop in core/fetch

Source/core/fetch/MemoryCache.cpp

 /*
     Copyright (C) 1998 Lars Knoll (knoll@mpi-hd.mpg.de)
     Copyright (C) 2001 Dirk Mueller (mueller@kde.org)
     Copyright (C) 2002 Waldo Bastian (bastian@kde.org)
     Copyright (C) 2004, 2005, 2006, 2007, 2008 Apple Inc. All rights reserved.
 
     This library is free software; you can redistribute it and/or
     modify it under the terms of the GNU Library General Public
     License as published by the Free Software Foundation; either
     version 2 of the License, or (at your option) any later version.
@@ skipping 44 matching lines @@
     ASSERT(WTF::isMainThread());
     if (!gMemoryCache)
         gMemoryCache = new OwnPtrWillBePersistent<MemoryCache>(MemoryCache::create());
     return gMemoryCache->get();
 }
 
 PassOwnPtrWillBeRawPtr<MemoryCache> replaceMemoryCacheForTesting(PassOwnPtrWillBeRawPtr<MemoryCache> cache)
 {
 #if ENABLE(OILPAN)
     // Move m_liveResources content to keep Resource objects alive.
-    for (HeapHashSet<Member<Resource> >::iterator i = memoryCache()->m_liveResources.begin();
-        i != memoryCache()->m_liveResources.end();
-        ++i) {
-        cache->m_liveResources.add(*i);
-    }
+    for (const auto& resource : memoryCache()->m_liveResources)
+        cache->m_liveResources.add(resource);
     memoryCache()->m_liveResources.clear();
 #else
     // Make sure we have non-empty gMemoryCache.
     memoryCache();
 #endif
     OwnPtrWillBeRawPtr<MemoryCache> oldCache = gMemoryCache->release();
     *gMemoryCache = cache;
     return oldCache.release();
 }
 
@@ skipping 529 matching lines @@
     decodedSize += o->decodedSize();
     encodedSize += o->encodedSize();
     encodedSizeDuplicatedInDataURLs += o->url().protocolIsData() ? o->encodedSize() : 0;
     purgeableSize += purgeable ? pageSize : 0;
     purgedSize += purged ? pageSize : 0;
 }
 
 MemoryCache::Statistics MemoryCache::getStatistics()
 {
     Statistics stats;
-    ResourceMap::iterator e = m_resources.end();
-    for (ResourceMap::iterator i = m_resources.begin(); i != e; ++i) {
-        Resource* resource = i->value->m_resource.get();
+    for (const auto& resourceIter : m_resources) {
+        Resource* resource = resourceIter.value->m_resource.get();
         switch (resource->type()) {
         case Resource::Image:
             stats.images.addResource(resource);
             break;
         case Resource::CSSStyleSheet:
             stats.cssStyleSheets.addResource(resource);
             break;
         case Resource::Script:
             stats.scripts.addResource(resource);
             break;
@@ skipping 157 matching lines @@
                 printf("(%.1fK, %.1fK, %uA, %dR, %d, %d); ", current->decodedSize() / 1024.0f, (current->encodedSize() + current->overheadSize()) / 1024.0f, current->accessCount(), current->hasClients(), current->isPurgeable(), current->wasPurged());
 
             current = prev;
         }
     }
 }
 
 #endif // MEMORY_CACHE_STATS
 
 } // namespace blink