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

cout ‹‹ "\nv2: ";

copy(v2.begin(), v2.end(), iter);

cout ‹‹ endl;

set_difference(v1.begin(), v1.end(), v2.begin(), v2.end(), iter);

cout ‹‹ endl;

return 0;

}

#include ‹stl.h›

#include ‹iostream.h›

int mult(int a_, int b_) {

return a_ * b_;

}

int main() {

vector‹int› v(10);

for (int i = 0; i ‹ v.size(); i++) v[i] = i + 1;

vector‹int› rslt(v.size());

adjacent_difference(v.begin(), v.end(), rslt.begin(), mult);

ostream_iterator‹int› iter(cout, " ");

copy(v.begin(), v.end(), iter);

cout ‹‹ endl;

copy(rslt.begin(), rslt.end(), iter);

cout ‹‹ endl;

return 0;

}

#include ‹stl.h›

#include ‹iostream.h›

int main() {

vector‹int› v1(10);

iota(v1.begin(), v1.end(), 0);

ostream_iterator‹int› iter(cout, " ");

copy(v1.begin(), v1.end(), iter);

cout ‹‹ endl;

for (int i = 0; i ‹ v1.size(); i++) {

rotate(v1.begin(), v1.begin() + i, v1.end());

ostream_iterator ‹int› iter(cout, " ");

copy(v1.begin(), v1.end(), iter);

cout ‹‹ endl;

}

cout ‹‹ endl;

return 0;

}

#include ‹stl.h›

#include ‹iostream.h›

int main() {

vector‹int› v1(10);

iota(v1.begin(), v1.end(), 0);

vector‹int› v2(10);

iota(v2.begin(), v2.end(), 7);

ostream_iterator‹int› iter(cout, " ");

cout ‹‹ "v1: ";

copy(v1.begin(), v1.end(), iter);

cout ‹‹ "\nv2: ";

copy(v2.begin(), v2.end(), iter);

cout ‹‹ endl;

set_union(v1.begin(), v1.end(), v2.begin(), v2.end(), iter);

cout ‹‹ endl;

return 0;

}

#include ‹iostream.h›

#include ‹stl.h›

char* array1[] = {"laurie", "jennifer", "leisa"};

char* array2[] = {"amanda", "saskia", "carrie"};

int main() {

deque‹char*› names(array1, array1 + 3);

deque‹char*›::iterator i = names.begin() + 2;

copy(array2, array2 + 3, insert_iterator‹deque ‹char*› ›(names, i));

deque‹char*›::iterator j;

for (j = names.begin(); j!= names.end(); j++) cout ‹‹ *j ‹‹ endl;

return 0;

}

#include ‹iostream.h›

#include ‹math.h›

#include ‹stl.h›

struct square_root: public unary_function‹double, double› {

square_root() {}

double operator() (double x_) const {return sqrt(x_);}

};

int input[3] = {-1, -4, -16};

int main() {

int output[3];

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

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

return 0;

}

#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() % 10;

ostream_iterator‹int› iter(cout, " ");

copy(v1.begin(), v1.end(), iter);

cout ‹‹ endl;

partial_sort(v1.begin(), v1.begin() + v1.size() / 2, v1.end());

copy(v1.begin(), v1.end(), iter);

cout ‹‹ endl;

return 0;

}

#include ‹stl.h›

#include ‹iostream.h›

bool values_squared(int a_, int b_) {

return (a_ * a_ == b_);

}

int main() {

vector‹int› v1(10);

vector‹int› v2(10);

for (int i = 0; i ‹ v1.size(); i++) {

v1[i] = i;

v2[i] = i * i;

}

if (equal(v1.begin(), v1.end(), v2.begin(), values_squared))

cout ‹‹ "v2[i] == v1[i] * v1[i]" ‹‹ endl;

else cout ‹‹ "v2[i] != v1[i] * v1[i]" ‹‹ endl;

return 0;

}

#include ‹stl.h›

#include ‹iostream.h›

int main() {

vector‹int› v1(10);

for (int i = 0; i ‹ v1.size(); i++) v1[i] = (v1.size() - i - 1) % 5;

ostream_iterator‹int› iter(cout, " ");

copy(v1.begin(), v1.end(), iter);

cout ‹‹ endl;

inplace_merge(v1.begin(), v1.begin() + 5, v1.end(), greater‹int›());

copy(v1.begin(), v1.end(), iter);

cout ‹‹ endl;

return 0;

}

#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() % 10;

ostream_iterator‹int› iter(cout, " ");

copy(v1.begin(), v1.end(), iter);

cout ‹‹ endl;

nth_element(v1.begin(), v1.begin() + v1.size() / 2, v1.end());

copy(v1.begin(), v1.end(), iter);

cout ‹‹ endl;

return 0;

}

#include ‹iostream.h›

#include ‹stl.h›

int main() {

vector‹int› v(4);

v[0] = 1;

v[1] = 4;

v[2] = 9;

v[3] = 16;

cout ‹‹ "front = " ‹‹ v.front() ‹‹ endl;

cout ‹‹ "back = " ‹‹ v.back() ‹‹ ", size = " ‹‹ v.size() ‹‹ endl;

v.push_back(25);

cout ‹‹ "back = " ‹‹ v.back() ‹‹ ", size = " ‹‹ v.size() ‹‹ endl;

v.pop_back();

cout ‹‹ "back = " ‹‹ v.back() ‹‹ ", size = " ‹‹ v.size() ‹‹ endl;

return 0;

}

#include ‹stl.h›

#include ‹iostream.h›

#include ‹string.h›

bool char_str_less(const char* a_, const char* b_) {

return ::strcmp(a_, b_) ‹ 0 ? 1 : 0;

}

char* str[] = {"a", "a", "b", "b", "q", "w", "z"};

int main() {

const unsigned strCt = sizeof(str)/sizeof(str[0]);

cout ‹‹ "d can be inserted at index: "

‹‹ (lower_bound(str, str + strCt, "d", char_str_less) - str) ‹‹ endl;

return 0;

}

#include ‹stl.h›

#include ‹iostream.h›

int main() {

vector‹int› v;

v.push_back(1);

v.push_back(20);

v.push_back(4);

make_heap(v.begin(), v.end(), greater‹int›());

v.push_back(7);

push_heap(v.begin(), v.end(), greater‹int›());

sort_heap(v.begin(), v.end(), greater‹int›());

ostream_iterator‹int› iter(cout, " ");

copy(v.begin(), v.end(), iter);

cout ‹‹ endl;

return 0;

}

#include ‹iostream.h›

#include ‹stl.h›

char* array1[] = {"laurie", "jennifer", "leisa"};

char* array2[] = {"amanda", "saskia", "carrie"};

int main() {

deque‹char*› names(array1, array1 + 3);

deque‹char*›::iterator i = names.begin() + 2;

copy(array2, array2 + 3, inserter(names, i));

deque‹char*›::iterator j;

for (j = names.begin(); j!= names.end(); j++) cout ‹‹ *j ‹‹ endl;

return 0;

}

#include ‹stl.h›

#include ‹iostream.h›

#include ‹string.h›

bool char_str_less(const char* a_, const char* b_) {

return ::strcmp(a_, b_) ‹ 0 ? 1 : 0;

}

char* str[] = {"a", "a", "b", "b", "q", "w", "z"};

int main() {

const unsigned strCt = sizeof(str)/sizeof(str[0]);

cout ‹‹ "d can be inserted at index: "

‹‹ upper_bound(str, str + strCt, "d", char_str_less) - str ‹‹ endl;

return 0;

}

#include ‹iostream.h›

#include ‹stl.h›

int main() {

vector‹char› v1; // Empty vector of characters.

v1.push_back('h');

v1.push_back('i');

cout ‹‹ "v1 = " ‹‹ v1[0] ‹‹ v1[1] ‹‹ endl;

vector‹char› v2(v1);

v2[1] = 'o'; // Replace second character.

cout ‹‹ "v2 = " ‹‹ v2[0] ‹‹ v2[1] ‹‹ endl;

cout ‹‹ "(v1 == v2) = " ‹‹ (v1 == v2) ‹‹ endl;

cout ‹‹ "(v1 ‹ v2) = " ‹‹ (v1 ‹ v2) ‹‹ endl;

return 0;

}

#include ‹iostream.h›

#include ‹stl.h›

int main() {

vector‹int› v; // Empty vector of integers.

v.push_back(1);

v.push_back(2);

v.push_back(3);

// Position immediately after last item.

vector‹int›::iterator i = v.end();

// Move back one and then access.

cout ‹‹ "last element is " ‹‹ *--i ‹‹ endl;