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

tools/gn/label_ptr.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.
 
 #ifndef TOOLS_GN_LABEL_PTR_H_
 #define TOOLS_GN_LABEL_PTR_H_
 
 #include <stddef.h>
 
 #include <functional>
@@ skipping 38 matching lines @@
 typedef LabelPtrPair<Target> LabelTargetPair;
 
 typedef std::vector<LabelConfigPair> LabelConfigVector;
 typedef std::vector<LabelTargetPair> LabelTargetVector;
 
 // Comparison and search functions ---------------------------------------------
 
 // To do a brute-force search by label:
 // std::find_if(vect.begin(), vect.end(), LabelPtrLabelEquals<Config>(label));
 template<typename T>
-struct LabelPtrLabelEquals : public std::unary_function<Label, bool> {
+struct LabelPtrLabelEquals {
   explicit LabelPtrLabelEquals(const Label& l) : label(l) {}
 
   bool operator()(const LabelPtrPair<T>& arg) const {
     return arg.label == label;
   }
 
   const Label& label;
 };
 
 // To do a brute-force search by object pointer:
 // std::find_if(vect.begin(), vect.end(), LabelPtrPtrEquals<Config>(config));
 template<typename T>
-struct LabelPtrPtrEquals : public std::unary_function<T, bool> {
+struct LabelPtrPtrEquals {
   explicit LabelPtrPtrEquals(const T* p) : ptr(p) {}
 
   bool operator()(const LabelPtrPair<T>& arg) const {
     return arg.ptr == ptr;
   }
 
   const T* ptr;
 };
 
 // To sort by label:
 // std::sort(vect.begin(), vect.end(), LabelPtrLabelLess<Config>());
 template<typename T>
-struct LabelPtrLabelLess : public std::binary_function<LabelPtrPair<T>,
-                                                       LabelPtrPair<T>,
-                                                       bool> {
+struct LabelPtrLabelLess {
   bool operator()(const LabelPtrPair<T>& a, const LabelPtrPair<T>& b) const {
     return a.label < b.label;
   }
 };
 
 // Default comparison operators -----------------------------------------------
 //
 // The default hash and comparison operators operate on the label, which should
 // always be valid, whereas the pointer is sometimes null.
 
@@ skipping 12 matching lines @@
 template<typename T> struct hash< LabelPtrPair<T> > {
   std::size_t operator()(const LabelPtrPair<T>& v) const {
     BASE_HASH_NAMESPACE::hash<Label> h;
     return h(v.label);
   }
 };
 
 }  // namespace BASE_HASH_NAMESPACE
 
 #endif  // TOOLS_GN_LABEL_PTR_H_