Windows apps
Collapse the table of content
Expand the table of content
Information
The topic you requested is included in another documentation set. For convenience, it's displayed below. Choose Switch to see the topic in its original location.

binder1st Class

 

The new home for Visual Studio documentation is Visual Studio 2017 Documentation on docs.microsoft.com.

The latest version of this topic can be found at binder1st Class.

A template class providing a constructor that converts a binary function object into a unary function object by binding the first argument of the binary function to a specified value.

template <class Operation>
class binder1st
 : public unary_function <typename Operation::second_argument_type,
    typename Operation::result_type>  
{
    public:
 typedef typename Operation::argument_type argument_type;
    typedef typename Operation::result_type result_type;
    binder1st(
 const Operation& _Func,
    const typename Operation::first_argument_type& left);

    result_type operator()(
    const argument_type& right) const;

    result_type operator()(
    const argument_type& right) const;

    protected:
 Operation op;
    typename Operation::first_argument_type value;
 };

Parameters

_Func
The binary function object to be converted to a unary function object.

left
The value to which the first argument of the binary function object is to be bound.

right
The value of the argument that the adapted binary object compares to the fixed value of the second argument.

The unary function object that results from binding the first argument of the binary function object to the value left.

The template class stores a copy of a binary function object _Func in op, and a copy of left in value. It defines its member function operator() as returning op( value, right).

If _Func is an object of type Operation and c is a constant , then bind1st ( _Func, c ) is equivalent to the binder1st class constructor binder1st< Operation> ( _Func, c ) and more convenient.

// functional_binder1st.cpp  
// compile with: /EHsc  
#include <vector>  
#include <functional>  
#include <algorithm>  
#include <iostream>  
  
using namespace std;  
  
int main()  
{  
    vector<int> v1;  
    vector<int>::iterator Iter;  
  
    int i;  
    for (i = 0; i <= 5; i++)  
    {  
        v1.push_back(5 * i);  
    }  
  
    cout << "The vector v1 = ( ";  
    for (Iter = v1.begin(); Iter != v1.end(); Iter++)  
        cout << *Iter << " ";  
    cout << ")" << endl;  
  
    // Count the number of integers > 10 in the vector  
    vector<int>::iterator::difference_type result1;  
    result1 = count_if(v1.begin(), v1.end(),  
        binder1st<less<int> >(less<int>(), 10));  
    cout << "The number of elements in v1 greater than 10 is: "  
         << result1 << "." << endl;  
  
    // Compare use of binder2nd fixing 2nd argument:  
    // count the number of integers < 10 in the vector  
    vector<int>::iterator::difference_type result2;  
    result2 = count_if(v1.begin(), v1.end(),  
        binder2nd<less<int> >(less<int>(), 10));  
    cout << "The number of elements in v1 less than 10 is: "  
         << result2 << "." << endl;  
}  
\* Output:   
The vector v1 = ( 0 5 10 15 20 25 )  
The number of elements in v1 greater than 10 is: 3.  
The number of elements in v1 less than 10 is: 2.  
*\  

Header: <functional>

Namespace: std

Thread Safety in the C++ Standard Library
Standard Template Library

Show:
© 2017 Microsoft