Remove uses of std::unary_function and std::binary_function.

components/bookmarks/browser/bookmark_index.cc

 // 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 "components/bookmarks/browser/bookmark_index.h"
 
 #include <stdint.h>
 
 #include <algorithm>
 #include <functional>
@@ skipping 38 matching lines @@
     // This should not happen. Log the error and fall back.
     LOG(ERROR) << "normalization failed: " << u_errorName(status);
     return text;
   }
   return base::string16(unicode_normalized_text.getBuffer(),
                         unicode_normalized_text.length());
 }
 
 // Sort functor for NodeTypedCountPairs. We sort in decreasing order of typed
 // count so that the best matches will always be added to the results.
-struct NodeTypedCountPairSortFunctor
-    : std::binary_function<NodeTypedCountPair, NodeTypedCountPair, bool> {
+struct NodeTypedCountPairSortFunctor {
   bool operator()(const NodeTypedCountPair& a,
                   const NodeTypedCountPair& b) const {
     return a.second > b.second;
   }
 };
 
 // Extract the const Node* stored in a BookmarkClient::NodeTypedCountPair.
-struct NodeTypedCountPairExtractNodeFunctor
-    : std::unary_function<NodeTypedCountPair, const BookmarkNode*> {
+struct NodeTypedCountPairExtractNodeFunctor {
   const BookmarkNode* operator()(const NodeTypedCountPair& pair) const {
     return pair.first;
   }
 };
 
 }  // namespace
 
 BookmarkIndex::BookmarkIndex(BookmarkClient* client,
                              const std::string& languages)
     : client_(client),
@@ skipping 208 matching lines @@
     // We can get here if the node has the same term more than once. For
     // example, a bookmark with the title 'foo foo' would end up here.
     return;
   }
   i->second.erase(node);
   if (i->second.empty())
     index_.erase(i);
 }
 
 }  // namespace bookmarks