Use range-based for loops

Author: Owen Jones

src/goto-instrument/code_contracts.cpp

@@ -388,10 +388,8 @@ void code_contractst::operator()()
     goto_functions.function_map.find(CPROVER_PREFIX "initialize");
   assert(i_it!=goto_functions.function_map.end());
 
-  for(std::unordered_set<irep_idt>::const_iterator it = summarized.begin();
-      it != summarized.end();
-      ++it)
-    add_contract_check(*it, i_it->second.body);
+  for(const auto &contract : summarized)
+    add_contract_check(contract, i_it->second.body);
 
   // remove skips
   remove_skip(i_it->second.body);

src/linking/linking.cpp

@@ -1195,20 +1195,18 @@ void linkingt::do_type_dependencies(
 
   while(!queue.empty())
   {
-    irep_idt id=queue.top();
+    irep_idt id = queue.top();
     queue.pop();
 
     const std::unordered_set<irep_idt> &u = used_by[id];
 
-    for(std::unordered_set<irep_idt>::const_iterator d_it = u.begin();
-        d_it != u.end();
-        d_it++)
-      if(needs_to_be_renamed.insert(*d_it).second)
+    for(const auto &dep : u)
+      if(needs_to_be_renamed.insert(dep).second)
       {
-        queue.push(*d_it);
+        queue.push(dep);
         #ifdef DEBUG
         debug() << "LINKING: needs to be renamed (dependency): "
-                << *d_it << eom;
+                << dep << eom;
         #endif
       }
   }