Александр Степанов - РУКОВОДСТВО ПО СТАНДАРТНОЙ БИБЛИОТЕКЕ ШАБЛОНОВ (STL)

#include ‹stl.h›

#include ‹iostream.h›

int numbers[6] = {1, 2, 3, 4, 5, 6};

int main() {

int result[6];

partial_sum(numbers, numbers + 6, result);

for (int i = 0; i ‹ 6; i ++) cout ‹‹ result[i] ‹‹ ' ';

cout ‹‹ endl;

return 0;

}

#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;

}

#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;

}

#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;

}

#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;

}

#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;

}

#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;

}

#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 ‹‹ min("shoe", "shine", str_compare) ‹‹ endl;

return 0;

}

#include ‹stl.h›

#include ‹iostream.h›

int numbers[6] = {5, 2, 4, 3, 1, 6};

int main() {

partial_sort(numbers, numbers + 3, numbers + 6);

for (int i = 0; i ‹ 6; i++) cout ‹‹ numbers[i] ‹‹ ' ';

cout ‹‹ endl;

return 0;

}

#include ‹stl.h›

#include ‹iostream.h›

int numbers[6] = {5, 2, 4, 3, 1, 6};

int main() {

partial_sort(numbers, numbers + 3, numbers + 6);

for (int i = 0; i ‹ 6; i++) cout ‹‹ numbers[i] ‹‹ ' ';

cout ‹‹ endl;

return 0;

}

#include ‹iostream.h›

#include ‹stl.h›

int array[4] = {4, 9, 7, 1};

int main() {

sort(array, array + 4, binary_negate‹greater‹int› ›(greater‹int›()));

for (int i = 0; i ‹ 4; i++) cout ‹‹ array[i] ‹‹ endl;

return 0;

}

#include ‹stl.h›

#include ‹iostream.h›

int numbers[6] = {5, 2, 4, 1, 0, 3};

int main() {

nth_element(numbers, numbers + 3, numbers + 6);

for (int i = 0; i ‹ 6; i++) cout ‹‹ numbers[i] ‹‹ ' ';

cout ‹‹ endl;

return 0;

}

#include ‹iostream.h›

#include ‹stl.h›

int array[] = {1, 5, 2, 3};

int main() {

list‹int› v(array, array + 4);

list‹int›::reverse_iterator r;

for (r = v.rbegin(); r != v.rend(); r++) cout ‹‹ *r ‹‹ endl;

return 0;

}

#include ‹stl.h›

#include ‹iostream.h›

int numbers[10] = {1, 2, 4, 1, 2, 4, 1, 2, 4, 1};

int main() {

int result = 0;

count(numbers, numbers + 10, 1, result);

cout ‹‹ "Found " ‹‹ result ‹‹ " 1's." ‹‹ endl;

return 0;

}

#include ‹iostream.h›

#include ‹stl.h›

int input[3] = {1, 2, 3};

int main() {

int output[3];

transform(input, input + 3, output, negate‹int›());

for (int i = 0; i ‹ 3; i++) cout ‹‹ output[i] ‹‹ endl;

return 0;

}

#include ‹iostream.h›

#include ‹stl.h›

int main() {

priority_queue‹deque‹int›, less‹int› › q;

q.push(42);

q.push(101);

q.push(69);

while (!q.empty()) {

cout ‹‹ q.top() ‹‹ endl;

q.pop();

}

return 0;

}

#include ‹stl.h›

#include ‹iostream.h›

#include ‹stdlib.h›

int main() {

vector‹int› v1(10);

generate_n(v1.begin(), v1.size(), rand);

for (int i = 0; i ‹ 10; i++) cout ‹‹ v1[i] ‹‹ ' ';

cout ‹‹ endl;

return 0;

}

#include ‹stl.h›

#include ‹iostream.h›

int numbers[6] = {0, 1, 2, 3, 4, 5};