how to use a static member function in find_if

[want.to.be.professer]

#include <iostream>
#include <list>
#include <algorithm>
#include <functional>
using namespace std;

class T
{
public:
static bool IsEqual( int n, int m )
{
return m ==n;
}
static void print ( int n )
{
std::cout << " " << n << std::endl;
}
};

int main()
{
T cT;
int a[10] = {12, 12,23,35, 23,12, 12,23,35, 23};
int* q = std::find_if(a, a + 10, std::bind1st( (&T::IsEqual),
35 ) ); // Error!!!!!!!!!!!!!!!!!!!!!!!!!
for_each( a, a + 10,
&T:rint ); // Work
Fine
//std::cout << "-------" << *q << std::endl;
return 0;
}

But How can I use IsEqual function?

 

[puzzlecracker]

#include <iostream>
#include <list>
#include <algorithm>
#include <functional>
using namespace std;

class T
{
public:
    static bool IsEqual( int n, int m )
    {
        return m ==n;
    }
    static void print ( int n )
    {
        std::cout << "   " << n << std::endl;
    }
};

int main()
{
    T cT;
    int a[10] = {12, 12,23,35, 23,12, 12,23,35, 23};
    int* q = std::find_if(a, a + 10, std::bind1st( (&T::IsEqual),
35 ) );    // Error!!!!!!!!!!!!!!!!!!!!!!!!!

int* q = find_if( a, a + 10, bind1st( ptr_fun( &T::IsEqual ) ), 35 );

http://www.sgi.com/tech/stl/ptr_fun.html

    for_each( a, a + 10,
&T:rint );                                                   // Work
Fine
    //std::cout << "-------" << *q << std::endl;
    return 0;
}

But How can I use IsEqual function?

why do you need ptr_fun here?

 

[Jerry Coffin]

#include <iostream>
#include <list>
#include <algorithm>
#include <functional>
using namespace std;

class T
{
public:
static bool IsEqual( int n, int m )
{
return m ==n;
}
static void print ( int n )
{
std::cout << " " << n << std::endl;
}
};

int main()
{
T cT;
int a[10] = {12, 12,23,35, 23,12, 12,23,35, 23};
int* q = std::find_if(a, a + 10, std::bind1st( (&T::IsEqual),
35 ) ); // Error!!!!!!!!!!!!!!!!!!!!!!!!!

Better question: Why would you use find_if at all? The reason to use
find_if is that you're NOT just looking for a specific value. In this
case, you're just creating a complicated imitation of std::find:

int *q = std::find(a, a+10, 35);