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

Source/core/fetch/ResourceClientWalker.h

 /*
     Copyright (C) 1998 Lars Knoll (knoll@mpi-hd.mpg.de)
     Copyright (C) 2001 Dirk Mueller <mueller@kde.org>
     Copyright (C) 2004, 2005, 2006, 2007 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 20 matching lines @@
 
 namespace blink {
 
 // Call this "walker" instead of iterator so people won't expect Qt or STL-style iterator interface.
 // Just keep calling next() on this. It's safe from deletions of items.
 template<typename T> class ResourceClientWalker {
 public:
     ResourceClientWalker(const HashCountedSet<ResourceClient*>& set)
         : m_clientSet(set), m_clientVector(set.size()), m_index(0)
     {
-        typedef HashCountedSet<ResourceClient*>::const_iterator Iterator;
-        Iterator end = set.end();
         size_t clientIndex = 0;
-        for (Iterator current = set.begin(); current != end; ++current)
-            m_clientVector[clientIndex++] = current->key;
+        for (const auto& resourceClient : set)
+            m_clientVector[clientIndex++] = resourceClient.key;
     }
 
     T* next()
     {
         size_t size = m_clientVector.size();
         while (m_index < size) {
             ResourceClient* next = m_clientVector[m_index++];
             if (m_clientSet.contains(next)) {
                 ASSERT(T::expectedType() == ResourceClient::expectedType() || next->resourceClientType() == T::expectedType());
                 return static_cast<T*>(next);
             }
         }
 
         return 0;
     }
 private:
     const HashCountedSet<ResourceClient*>& m_clientSet;
     Vector<ResourceClient*> m_clientVector;
     size_t m_index;
 };
 
 }
 
 #endif