base: Remove the string logging from CHECK().

net/base/linked_hash_map.h

 // Copyright (c) 2013 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.
 //
 // This is a simplistic insertion-ordered map.  It behaves similarly to an STL
 // map, but only implements a small subset of the map's methods.  Internally, we
 // just keep a map and a list going in parallel.
 //
 // This class provides no thread safety guarantees, beyond what you would
 // normally see with std::list.
@@ skipping 121 matching lines @@
     return 1;
   }
 
   // Erases the item that 'position' points to. Returns an iterator that points
   // to the item that comes immediately after the deleted item in the list, or
   // end().
   // If the provided iterator is invalid or there is inconsistency between the
   // map and list, a CHECK() error will occur.
   iterator erase(iterator position) {
     typename MapType::iterator found = map_.find(position->first);
-    CHECK(found->second == position)
-        << "Inconsisent iterator for map and list, or the iterator is invalid.";
+    // Inconsisent iterator for map and list, or the iterator is invalid.
+    CHECK(found->second == position);
 
     map_.erase(found);
     return list_.erase(position);
   }
 
   // Erases all the items in the range [first, last).  Returns an iterator that
   // points to the item that comes immediately after the last deleted item in
   // the list, or end().
   iterator erase(iterator first, iterator last) {
     while (first != last && first != end()) {
@@ skipping 58 matching lines @@
     if (found != map_.end()) return std::make_pair(found->second, false);
 
     // Otherwise, insert into the list first.
     list_.push_back(pair);
 
     // Obtain an iterator to the newly added element.  We do -- instead of -
     // since list::iterator doesn't implement operator-().
     typename ListType::iterator last = list_.end();
     --last;
 
-    CHECK(map_.insert(std::make_pair(pair.first, last)).second)
-        << "Map and list are inconsistent";
+    // Map and list are inconsistent
+    CHECK(map_.insert(std::make_pair(pair.first, last)).second);
 
     return std::make_pair(last, true);
   }
 
   size_type size() const {
     return list_.size();
   }
 
   template <typename... Args>
   std::pair<iterator, bool> emplace(Args&&... args) {
@@ skipping 21 matching lines @@
   ListType list_;
 
   // |map_| contains iterators to |list_|, therefore a default copy constructor
   // or copy assignment operator would result in an inconsistent state.
   DISALLOW_COPY_AND_ASSIGN(linked_hash_map);
 };
 
 }  // namespace net
 
 #endif  // UTIL_GTL_LINKED_HASH_MAP_H_