РУКОВОДСТВО ПО СТАНДАРТНОЙ БИБЛИОТЕКЕ ШАБЛОНОВ (STL)

adjdiff1.cpp

#include ‹stl.h›
#include ‹iostream.h›
int main() {
 vector‹int› v(10);
 for (int i = 0; i ‹ v.size(); i++) v[i] = i * i;
 vector‹int› result(v.size());
 adjacent_difference(v.begin(), v.end(), result.begin());
 ostream_iterator‹int› iter(cout, ' ');
 copy(v.begin(), v.end(), iter);
 cout ‹‹ endl;
 copy(result.begin(), result.end(), iter);
 cout ‹‹ endl;
 return 0;
}

stblptn1.cpp

#include ‹stl.h›
#include ‹stdlib.h›
#include ‹iostream.h›
int main() {
 vector‹int› v1(10);
 for (int i = 0; i ‹ v1.size(); i++) v1[i] = rand() % 20;
 ostream_iterator‹int› iter(cout, ' ');
 copy(v1.begin(), v1.end(), iter);
 cout ‹‹ endl;
 stable_partition(v1.begin(), v1.end(), bind2nd(less‹int›(), 11));
 copy(v1.begin(), v1.end(), iter);
 cout ‹‹ endl;
 return 0;
}

ptition1.cpp

#include ‹stl.h›
#include ‹stdlib.h›
#include ‹iostream.h›
int main() {
 vector‹int› v1(10);
 for (int i = 0; i ‹ v1.size(); i++) v1[i] = rand() % 20;
 ostream_iterator ‹int› iter(cout, ' ');
 copy(v1.begin(), v1.end(), iter);
 cout ‹‹ endl;
 partition(v1.begin(), v1.end(), bind2nd(less‹int›(), 11));
 copy(v1.begin(), v1.end(), iter);
 cout ‹‹ endl;
 return 0;
}

vec1.cpp

#include ‹iostream.h›
#include ‹stl.h›
int main() {
 vector‹int› v1; // Empty vector of integers.
 cout ‹‹ 'empty = ' ‹‹ v1.empty() ‹‹ endl;
 cout ‹‹ 'size = ' ‹‹ v1.size() ‹‹ endl;
 cout ‹‹ 'max_size = ' ‹‹ v1.max_size() ‹‹ endl;
 v1.push_back(42); // Add an integer to the vector.
 cout ‹‹ 'size = ' ‹‹ v1.size() ‹‹ endl;
 cout ‹‹ 'v1[0] = ' ‹‹ v1[0] ‹‹ endl;
 return 0;
}

sort2.cpp

#include ‹stl.h›
#include ‹iostream.h›
int array[] = {1, 50, -10, 11, 42, 19};
int main() {
 int count = sizeof(array) / sizeof(array[0]);
 ostream_iterator ‹int› iter(cout, ' ');
 cout ‹‹ 'before: ';
 copy(array, array + count, iter);
 cout ‹‹ '
after: ';
 sort(array, array + count, greater‹int›());
 copy(array, array + count, iter);
 cout ‹‹ endl;
 return 0;
}