mirror of
https://github.com/reactos/reactos.git
synced 2025-02-28 19:32:59 +00:00
149 lines
3.3 KiB
C++
149 lines
3.3 KiB
C++
#include <algorithm>
|
|
#include <functional>
|
|
|
|
#include "cppunit/cppunit_proxy.h"
|
|
|
|
#if !defined (STLPORT) || defined(_STLP_USE_NAMESPACES)
|
|
using namespace std;
|
|
#endif
|
|
|
|
//
|
|
// TestCase class
|
|
//
|
|
class BindTest : public CPPUNIT_NS::TestCase
|
|
{
|
|
CPPUNIT_TEST_SUITE(BindTest);
|
|
CPPUNIT_TEST(bind1st1);
|
|
CPPUNIT_TEST(bind2nd1);
|
|
CPPUNIT_TEST(bind2nd2);
|
|
#if !defined (STLPORT) || \
|
|
defined (_STLP_NO_EXTENSIONS) || !defined (_STLP_CLASS_PARTIAL_SPECIALIZATION)
|
|
CPPUNIT_IGNORE;
|
|
#endif
|
|
CPPUNIT_TEST(bind2nd3);
|
|
CPPUNIT_TEST(bind_memfn);
|
|
CPPUNIT_TEST_SUITE_END();
|
|
|
|
protected:
|
|
void bind1st1();
|
|
void bind2nd1();
|
|
void bind2nd2();
|
|
void bind2nd3();
|
|
void bind_memfn();
|
|
};
|
|
|
|
CPPUNIT_TEST_SUITE_REGISTRATION(BindTest);
|
|
|
|
class pre_increment : public binary_function<int, int, int> {
|
|
public:
|
|
int operator()(int incr, int& val) const
|
|
{ return val += incr; }
|
|
};
|
|
|
|
class post_increment : public binary_function<int, int, int> {
|
|
public:
|
|
int operator()(int& val, int incr) const
|
|
{ return val += incr; }
|
|
};
|
|
|
|
|
|
//
|
|
// tests implementation
|
|
//
|
|
void BindTest::bind1st1()
|
|
{
|
|
int array [3] = { 1, 2, 3 };
|
|
int* p = remove_if((int*)array, (int*)array + 3, bind1st(less<int>(), 2));
|
|
|
|
CPPUNIT_ASSERT(p == &array[2]);
|
|
CPPUNIT_ASSERT(array[0] == 1);
|
|
CPPUNIT_ASSERT(array[1] == 2);
|
|
|
|
for_each((int*)array, (int*)array + 3, bind1st(pre_increment(), 1));
|
|
CPPUNIT_ASSERT(array[0] == 2);
|
|
CPPUNIT_ASSERT(array[1] == 3);
|
|
CPPUNIT_ASSERT(array[2] == 4);
|
|
|
|
for_each((int*)array, (int*)array + 3, bind2nd(post_increment(), 1));
|
|
CPPUNIT_ASSERT(array[0] == 3);
|
|
CPPUNIT_ASSERT(array[1] == 4);
|
|
CPPUNIT_ASSERT(array[2] == 5);
|
|
}
|
|
|
|
void BindTest::bind2nd1()
|
|
{
|
|
int array [3] = { 1, 2, 3 };
|
|
replace_if(array, array + 3, binder2nd<greater<int> >(greater<int>(), 2), 4);
|
|
|
|
CPPUNIT_ASSERT(array[0]==1);
|
|
CPPUNIT_ASSERT(array[1]==2);
|
|
CPPUNIT_ASSERT(array[2]==4);
|
|
}
|
|
void BindTest::bind2nd2()
|
|
{
|
|
int array [3] = { 1, 2, 3 };
|
|
replace_if(array, array + 3, bind2nd(greater<int>(), 2), 4);
|
|
CPPUNIT_ASSERT(array[0]==1);
|
|
CPPUNIT_ASSERT(array[1]==2);
|
|
CPPUNIT_ASSERT(array[2]==4);
|
|
}
|
|
|
|
int test_func1 (const int ¶m1, const int ¶m2) {
|
|
return param1 + param2;
|
|
}
|
|
|
|
int test_func2 (int ¶m1, int param2) {
|
|
param1 += param2;
|
|
return param1 + param2;
|
|
}
|
|
|
|
void BindTest::bind2nd3()
|
|
{
|
|
#if defined (STLPORT) && \
|
|
!defined (_STLP_NO_EXTENSIONS) && defined (_STLP_CLASS_PARTIAL_SPECIALIZATION)
|
|
int array[3] = { 1, 2, 3 };
|
|
transform(array, array + 3, array, bind2nd(ptr_fun(test_func1), 1));
|
|
transform(array, array + 3, array, bind1st(ptr_fun(test_func1), -1));
|
|
CPPUNIT_ASSERT(array[0] == 1);
|
|
CPPUNIT_ASSERT(array[1] == 2);
|
|
CPPUNIT_ASSERT(array[2] == 3);
|
|
|
|
transform(array, array + 3, array, bind2nd(ptr_fun(test_func2), 10));
|
|
CPPUNIT_ASSERT(array[0] == 21);
|
|
CPPUNIT_ASSERT(array[1] == 22);
|
|
CPPUNIT_ASSERT(array[2] == 23);
|
|
#endif
|
|
}
|
|
|
|
class A
|
|
{
|
|
public:
|
|
A() : m_n( 0 )
|
|
{}
|
|
|
|
void f( int n ) const {
|
|
#if defined (STLPORT)
|
|
_STLP_MUTABLE(A, m_n) = n;
|
|
#else
|
|
m_n = n;
|
|
#endif
|
|
}
|
|
|
|
int v() const
|
|
{ return m_n; }
|
|
|
|
private:
|
|
mutable int m_n;
|
|
};
|
|
|
|
void BindTest::bind_memfn()
|
|
{
|
|
#if defined (STLPORT) && \
|
|
!defined (_STLP_NO_EXTENSIONS) && defined (_STLP_CLASS_PARTIAL_SPECIALIZATION)
|
|
A array[3];
|
|
|
|
for_each( array, array + 3, bind2nd( mem_fun_ref(&A::f), 12 ) );
|
|
|
|
CPPUNIT_CHECK( array[0].v() == 12 );
|
|
#endif
|
|
}
|