Use std::begin() and std::end() in base::ContainsValue()

base/stl_util.h

 // Copyright (c) 2011 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.
 
 // Derived from google3/util/gtl/stl_util.h
 
 #ifndef BASE_STL_UTIL_H_
 #define BASE_STL_UTIL_H_
 
 #include <algorithm>
@@ skipping 69 matching lines @@
 // Returns true if the key is in the collection.
 template <typename Collection, typename Key>
 bool ContainsKey(const Collection& collection, const Key& key) {
   return collection.find(key) != collection.end();
 }
 
 // Test to see if a collection like a vector contains a particular value.
 // Returns true if the value is in the collection.
 template <typename Collection, typename Value>
 bool ContainsValue(const Collection& collection, const Value& value) {
-  return std::find(collection.begin(), collection.end(), value) !=
-      collection.end();
+  return std::find(std::begin(collection), std::end(collection), value) !=
+         std::end(collection);
 }
 
 // Returns true if the container is sorted.
 template <typename Container>
 bool STLIsSorted(const Container& cont) {
   // Note: Use reverse iterator on container to ensure we only require
   // value_type to implement operator<.
   return std::adjacent_find(cont.rbegin(), cont.rend(),
                             std::less<typename Container::value_type>())
       == cont.rend();
@@ skipping 181 matching lines @@
           class Allocator,
           class Predicate>
 void EraseIf(std::unordered_multiset<Key, Hash, KeyEqual, Allocator>& container,
              Predicate pred) {
   internal::IterateAndEraseIf(container, pred);
 }
 
 }  // namespace base
 
 #endif  // BASE_STL_UTIL_H_