| /external/libcxx/test/depr/depr.lib.binders/depr.lib.bind.2nd/ |
| bind2nd.pass.cpp | 14 // bind2nd(const Fn& op, const T& x);
23 assert(std::bind2nd(test_func(1), 5)(10) == 5.);
|
| Android.mk | 19 test_name := depr/depr.lib.binders/depr.lib.bind.2nd/bind2nd
20 test_src := bind2nd.pass.cpp
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/depr/depr.lib.binders/depr.lib.bind.2nd/ |
| bind2nd.pass.cpp | 14 // bind2nd(const Fn& op, const T& x);
23 assert(std::bind2nd(test_func(1), 5)(10) == 5.);
|
| /external/libcxx/test/algorithms/alg.nonmodifying/alg.count/ |
| count_if.pass.cpp | 29 std::bind2nd(std::equal_to<int>(),2)) == 3);
32 std::bind2nd(std::equal_to<int>(),7)) == 0);
35 std::bind2nd(std::equal_to<int>(),2)) == 0);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.count/ |
| count_if.pass.cpp | 29 std::bind2nd(std::equal_to<int>(),2)) == 3);
32 std::bind2nd(std::equal_to<int>(),7)) == 0);
35 std::bind2nd(std::equal_to<int>(),2)) == 0);
|
| /external/libcxx/test/algorithms/alg.nonmodifying/alg.find/ |
| find_if.pass.cpp | 29 std::bind2nd(std::equal_to<int>(), 3));
33 std::bind2nd(std::equal_to<int>(), 10));
|
| find_if_not.pass.cpp | 29 std::bind2nd(std::not_equal_to<int>(), 3));
33 std::bind2nd(std::not_equal_to<int>(), 10));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.find/ |
| find_if.pass.cpp | 29 std::bind2nd(std::equal_to<int>(), 3));
33 std::bind2nd(std::equal_to<int>(), 10));
|
| find_if_not.pass.cpp | 29 std::bind2nd(std::not_equal_to<int>(), 3));
33 std::bind2nd(std::not_equal_to<int>(), 10));
|
| /external/libcxx/test/algorithms/alg.modifying.operations/alg.replace/ |
| replace_if.pass.cpp | 31 std::replace_if(Iter(ia), Iter(ia+sa), std::bind2nd(std::equal_to<int>(), 2), 5);
|
| replace_copy_if.pass.cpp | 34 std::bind2nd(std::equal_to<int>(), 2), 5);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.replace/ |
| replace_if.pass.cpp | 31 std::replace_if(Iter(ia), Iter(ia+sa), std::bind2nd(std::equal_to<int>(), 2), 5);
|
| replace_copy_if.pass.cpp | 34 std::bind2nd(std::equal_to<int>(), 2), 5);
|
| /external/stlport/test/unit/ |
| bind_test.cpp | 67 for_each((int*)array, (int*)array + 3, bind2nd(post_increment(), 1));
85 replace_if(array, array + 3, bind2nd(greater<int>(), 2), 4);
105 transform(array, array + 3, array, bind2nd(ptr_fun(test_func1), 1));
111 transform(array, array + 3, array, bind2nd(ptr_fun(test_func2), 10));
145 for_each( array, array + 3, bind2nd( mem_fun_ref(&A::f), 12 ) );
|
| mfunptr_test.cpp | 211 // step 2, just check that compiler understand what pass to bind2nd:
212 binder2nd<const_mem_fun1_ref_t<bool,V,int> > b2 = bind2nd( pmf, 2 );
215 binder2nd<const_mem_fun1_ref_t<bool,V,int> > b3 = bind2nd( mem_fun_ref( &V::f ), 2 );
222 vector<V>::iterator k = find_if( v.begin(), v.end(), bind2nd( mem_fun_ref( &V::f ), 2 ) );
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| bind_test.cpp | 67 for_each((int*)array, (int*)array + 3, bind2nd(post_increment(), 1));
85 replace_if(array, array + 3, bind2nd(greater<int>(), 2), 4);
105 transform(array, array + 3, array, bind2nd(ptr_fun(test_func1), 1));
111 transform(array, array + 3, array, bind2nd(ptr_fun(test_func2), 10));
145 for_each( array, array + 3, bind2nd( mem_fun_ref(&A::f), 12 ) );
|
| mfunptr_test.cpp | 211 // step 2, just check that compiler understand what pass to bind2nd:
212 binder2nd<const_mem_fun1_ref_t<bool,V,int> > b2 = bind2nd( pmf, 2 );
215 binder2nd<const_mem_fun1_ref_t<bool,V,int> > b3 = bind2nd( mem_fun_ref( &V::f ), 2 );
222 vector<V>::iterator k = find_if( v.begin(), v.end(), bind2nd( mem_fun_ref( &V::f ), 2 ) );
|
| /ndk/tests/device/test-stlport/unit/ |
| bind_test.cpp | 67 for_each((int*)array, (int*)array + 3, bind2nd(post_increment(), 1));
85 replace_if(array, array + 3, bind2nd(greater<int>(), 2), 4);
105 transform(array, array + 3, array, bind2nd(ptr_fun(test_func1), 1));
111 transform(array, array + 3, array, bind2nd(ptr_fun(test_func2), 10));
145 for_each( array, array + 3, bind2nd( mem_fun_ref(&A::f), 12 ) );
|
| mfunptr_test.cpp | 211 // step 2, just check that compiler understand what pass to bind2nd:
212 binder2nd<const_mem_fun1_ref_t<bool,V,int> > b2 = bind2nd( pmf, 2 );
215 binder2nd<const_mem_fun1_ref_t<bool,V,int> > b3 = bind2nd( mem_fun_ref( &V::f ), 2 );
222 vector<V>::iterator k = find_if( v.begin(), v.end(), bind2nd( mem_fun_ref( &V::f ), 2 ) );
|
| /external/chromium_org/third_party/libaddressinput/src/cpp/src/ |
| address_formatter.cc | 83 std::bind2nd(EqualToTolowerString(), base_language)) !=
90 std::bind2nd(EqualToTolowerString(), base_language)) !=
98 std::bind2nd(EqualToTolowerString(), base_language)) !=
|
| /external/libcxx/test/algorithms/alg.modifying.operations/alg.remove/ |
| remove_copy_if.pass.cpp | 32 std::bind2nd(std::equal_to<int>(), 2));
|
| remove_if.pass.cpp | 33 int* r = std::remove_if(ia, ia+sa, std::bind2nd(std::equal_to<int>(), 2));
|
| /external/libcxx/test/algorithms/alg.modifying.operations/alg.transform/ |
| unary_transform.pass.cpp | 32 std::bind2nd(std::plus<int>(), 1));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.remove/ |
| remove_copy_if.pass.cpp | 32 std::bind2nd(std::equal_to<int>(), 2));
|
| remove_if.pass.cpp | 33 int* r = std::remove_if(ia, ia+sa, std::bind2nd(std::equal_to<int>(), 2));
|
