Fix files with lines > 80 cols. Part 2.

chrome/common/stl_util-inl.h

 //
 // Copyright (c) 2006-2008 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.
 //
 // STL utility functions.  Usually, these replace built-in, but slow(!),
 // STL functions with more efficient versions.
 //
 
 #ifndef CHROME_COMMON_STL_UTIL_INL_H__
@@ skipping 178 matching lines @@
 // because the == operator in the STL can return false when the maps/sets
 // contain identical elements.  This is because it compares the internal hash
 // tables which may be different if the order of insertions and deletions
 // differed.
 
 template <class HashSet>
 inline bool
 HashSetEquality(const HashSet& set_a,
                 const HashSet& set_b) {
   if (set_a.size() != set_b.size()) return false;
-  for (typename HashSet::const_iterator i = set_a.begin(); i != set_a.end(); ++i)
-    if (set_b.find(*i) == set_b.end()) return false;
+  for (typename HashSet::const_iterator i = set_a.begin();
+       i != set_a.end();
+       ++i) {
+    if (set_b.find(*i) == set_b.end())
+      return false;
+  }
   return true;
 }
 
 template <class HashMap>
 inline bool
 HashMapEquality(const HashMap& map_a,
                 const HashMap& map_b) {
   if (map_a.size() != map_b.size()) return false;
   for (typename HashMap::const_iterator i = map_a.begin();
        i != map_a.end(); ++i) {
@@ skipping 228 matching lines @@
 // Translates a set into a vector.
 template<typename T>
 std::vector<T> SetToVector(const std::set<T>& values) {
   std::vector<T> result;
   result.reserve(values.size());
   result.insert(result.begin(), values.begin(), values.end());
   return result;
 }
 
 #endif  // CHROME_COMMON_STL_UTIL_INL_H__