본문 바로가기
728x90
반응형

STL24

함수 객체 dualinstance, Predicate, not2, IsMulti, bind2nd, ptr_fun, mem_fun dualinstance, #include #include #include #include using namespace std; void functor1(int a) { printf("%d ",a); }; struct functor2 { void operator()(double a) const { printf("%f\n",a); } }; void main() { int ari[]={1,2,3,4,5}; vector vi(&ari[0],&ari[5]); double ard[]={1.2,3.4,5.6,7.8,9,9}; list ld(&ard[0],&ard[5]); for_each(vi.begin(),vi.end(),functor1); cout 2023. 12. 9.
함수 객체 for_each, functor, functormem, functorctor for_each #include #include #include using namespace std; void print(int a) { printf("%d\n",a); } void main() { int ari[]={2,8,5,1,9}; vector vi(&ari[0],&ari[5]); sort(vi.begin(),vi.end()); for_each(vi.begin(),vi.end(),print); } functor #include #include #include using namespace std; struct print { void operator()(int a) const { printf("%d\n",a); } }; void main() { int ari[]={2,8,5,1,9}; vector v.. 2023. 12. 9.
next_permutation,inner_product,lexicographical,make_heap next_permutation #include #include #include using namespace std; template void dump(const char *desc, C c) { cout.width(12);cout 2023. 12. 9.
merge,minmax,accumulate,adjacent_difference merge #include #include #include using namespace std; template void dump(const char *desc, C c) { cout.width(12);cout 2023. 12. 9.
replace,partition,transform,sort,lower_bound replace #include #include #include using namespace std; template void dump(const char *desc, C c) { cout.width(12);cout 2023. 12. 9.
generate, remove, remove_copy, unique generate #include #include #include using namespace std; template void dump(const char *desc, C c) { cout.width(12);cout 2023. 12. 9.
728x90
반응형