return 0;
}
bvec1.cpp
#include ‹iostream.h›
#include ‹stl.h›
int main() {
bit_vector b(3);
for (int i = 0; i ‹ b.size(); i++) cout ‹‹ b[i];
cout ‹‹ endl;
b[0] = b[2] = 1;
for (i = 0; i ‹ b.size(); i++) cout ‹‹ b[i];
cout ‹‹ endl;
return 0;
}
bind2nd1.cpp
#include ‹iostream.h›
#include ‹stl.h›
int array[3] = {1, 2, 3};
int main() {
replace_if(array, array + 3, binder2nd‹greater‹int› ›(greater‹int›(), 2), 4);
for (int i = 0; i ‹ 3; i++) cout ‹‹ array[i] ‹‹ endl;
return 0;
}
bind1st1.cpp
#include ‹iostream.h›
#include ‹stl.h›
int array[3] = {1, 2, 3};
int main() {
int* p = remove_if(array, array + 3, binder1st‹less‹int› ›(less‹int›(), 2));
for (int* i = array; i != p; i++) cout ‹‹ *i ‹‹ endl;
return 0;
}
reviter2.cpp
#include ‹iostream.h›
#include ‹stl.h›
int array[] = {1, 5, 2, 3};
int main() {
vector‹int› v(array, array + 4);
vector‹int›::reverse_iterator r;
for (r = v.rbegin(); r != v.rend(); r++) cout ‹‹ *r ‹‹ endl;
return 0;
}
copy2.cpp
#include ‹stl.h›
#include ‹iostream.h›
int main() {
vector‹int› v(10);
for (int i = 0; i ‹ v.size(); i++) v[i] = i;
ostream_iterator‹int› iter(cout, ' ');
copy(v.begin(), v.end(), iter);
cout ‹‹ endl;
return 0;
}
max2.cpp
#include ‹stl.h›
#include ‹iostream.h›
#include ‹string.h›
bool str_compare(const char* a_, const char* b_) {
return ::strcmp(a_, b_) ‹ 0 ? 1 : 0;
}
int main() {
cout ‹‹ max('shoe', 'shine', str_compare) ‹‹ endl;
return 0;
}