Use C++11 range-based loop for core/clipboard, core/dom and core/testing

Source/core/dom/WeakNodeMap.cpp

 // Copyright 2014 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "config.h"
 #include "core/dom/WeakNodeMap.h"
 
 #include "core/dom/Node.h"
 
 namespace blink {
@@ skipping 37 matching lines @@
     if (mapList->size() == 0) {
         m_nodeToMapList.remove(it);
         return true;
     }
     return false;
 }
 
 void NodeToWeakNodeMaps::nodeDestroyed(Node* node)
 {
     OwnPtr<NodeToWeakNodeMaps::MapList> maps = m_nodeToMapList.take(node);
-    for (size_t i = 0; i < maps->size(); i++)
-        (*maps)[i]->nodeDestroyed(node);
+    for (auto& map : *maps)
+        map->nodeDestroyed(node);
 }
 
 WeakNodeMap::~WeakNodeMap()
 {
     NodeToWeakNodeMaps& allMaps = NodeToWeakNodeMaps::instance();
-    for (NodeToValue::iterator it = m_nodeToValue.begin(); it != m_nodeToValue.end(); ++it) {
-        Node* node = it->key;
+    for (auto& map : m_nodeToValue) {
+        Node* node = map.key;
         if (allMaps.removedFromMap(node, this))
             node->clearFlag(Node::HasWeakReferencesFlag);
     }
 }
 
 void WeakNodeMap::put(Node* node, int value)
 {
     ASSERT(node && !m_nodeToValue.contains(node));
     m_nodeToValue.set(node, value);
     m_valueToNode.set(value, node);
@@ skipping 20 matching lines @@
     m_valueToNode.remove(value);
 }
 
 void WeakNodeMap::notifyNodeDestroyed(Node* node)
 {
     NodeToWeakNodeMaps::instance().nodeDestroyed(node);
 }
 #endif
 
 }