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

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

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

cout ‹‹ endl;

}

cout ‹‹ endl;

return 0;

}

#include ‹stl.h›

#include ‹iostream.h›

#include ‹string.h›

char chars[] = "aabbccddggghhklllmqqqqssyyzz";

int main() {

const unsigned count = sizeof(chars) - 1;

ostream_iterator‹char› iter(cout);

cout ‹‹ "Within the collection:\n\t";

copy(chars, chars + count, iter);

pair‹char*, char*› range;

range = equal_range(chars, chars + count, 'q', less‹char›());

cout ‹‹ "\nq can be inserted from before index " ‹‹ (range.first - chars) ‹‹ " to before index "

‹‹ (range.second - chars) ‹‹ endl;

return 0;

}

#include ‹stl.h›

#include ‹iostream.h›

class X {

public:

X(int i_): i(i_) {}

~X() {cout ‹‹ "Delete X(" ‹‹ i ‹‹ ")" ‹‹ endl;}

int i;

};

ostream& operator ‹‹ (ostream& stream_, const X& x_) {

return stream_ ‹‹ "X(" ‹‹ x_.i ‹‹ ")";

}

int main() {

vector‹X*› v;

v.push_back(new X(2));

v.push_back(new X(1));

v.push_back(new X(4));

vector‹X*›::iterator i;

for (i = v.begin(); i!= v.end(); i++) cout ‹‹ *(*i) ‹‹ endl;

release(v.begin(), v.end()); // Delete heap-based objects.

return 0;

}

#include ‹stl.h›

#include ‹iostream.h›

int main() {

vector‹int› v1(10);

vector‹int› v2(3);

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

v1[i] = i;

}

if (includes(v1.begin(), v1.end(), v2.begin(), v2.end())) cout ‹‹ "v1 includes v2" ‹‹ endl;

else cout ‹‹ "v1 does not include v2" ‹‹ endl;

for (i = 0; i ‹ v2.size(); i++) v2[i] = i + 3;

if (includes(v1.begin(), v1.end(), v2.begin(), v2.end())) cout ‹‹ "v1 includes v2" ‹‹ endl;

else cout ‹‹ "v1 does not include v2" ‹‹ endl;

return 0;

}

#include ‹stl.h›

#include ‹iostream.h›

#include ‹string.h›

char* word1 = "ABCDEFGHIJKLMNO";

char* word2 = "LMNOPQRSTUVWXYZ";

int main() {

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

cout ‹‹ "word1: ";

copy(word1, word1 + ::strlen(word1), iter);

cout ‹‹ "\nword2: ";

copy(word2, word2 + ::strlen(word2), iter);

cout ‹‹ endl;

set_intersection(word1, word1 + ::strlen(word1), word2, word2 + ::strlen(word2), iter, less‹char›());

cout ‹‹ endl;

return 0;

}

#include ‹stl.h›

#include ‹iostream.h›

#include ‹string.h›

int main() {

vector‹int› v1(3);

vector‹int› v2(v1.size());

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

v1[i] = i + 1;

v2[i] = v1.size() - i;

}

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

cout ‹‹ "Inner product(sum of products) of:\n\t";

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

cout ‹‹ "\n\t";

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

int result = inner_product(v1.begin(), v1.end(), v2.begin(), 0);

cout ‹‹ "\nis: " ‹‹ result ‹‹ endl;

return 0;

}

#include ‹stl.h›

#include ‹iostream.h›

int main() {

vector‹int› v1(5);

vector‹int› v2(v1.size());

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

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

vector‹int› result(v1.size() + v2.size());

merge(v1.begin(), v1.end(), v2.begin(), v2.end(), result.begin());

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

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

cout ‹‹ endl;

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

cout ‹‹ endl;

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

cout ‹‹ endl;

return 0;

}

#include ‹iostream.h›

#include ‹stl.h›

struct odd: public unary_function‹int, bool› {

odd() {}

bool operator() (int n_) const {return (n_ % 2) - 1;}

};

struct positive: public unary_function‹int, bool› {

positive() {}

bool operator() (int n_) const {return n_ ›= 0;}

};

int array[6] = {-2, -1, 0, 1, 2, 3};

int main() {

int* p = find_if(array, array + 6, compose2(logical_and‹bool›(), odd(), positive()));

if (p != array + 6) cout ‹‹ *p ‹‹ " is odd and positive" ‹‹ endl;

return 0;

}

#include ‹stl.h›

// Compile this code without defining OS_USE_EXCEPTIONS.

void my_handler(int code_, const char* str_) {

cout ‹‹ "Caught " ‹‹ str_ ‹‹ "[code " ‹‹ code_ ‹‹ "]" ‹‹ endl;

}

int main() {

os_handler_function_t old_h = os_set_error_handler(my_handler);

vector‹int› v;

v.pop_back(); // Generates an empty object error.

cout ‹‹ "returned from pop_back()" ‹‹ endl;

os_set_error_handler(old_h);

v.pop_back(); // Generates an empty object error.

cout ‹‹ "successful termination" ‹‹ endl;

return 0;

}

#include ‹stl.h›

#include ‹iostream.h›

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

int numbers2[5] = {1, 2, 4, 8, 16};

int numbers3[2] = {4, 8};

int main() {

if (includes(numbers1, numbers1 + 5, numbers3, numbers3 + 2))

cout ‹‹ "numbers1 includes numbers3" ‹‹ endl;

else cout ‹‹ "numbers1 does not include numbers3" ‹‹ endl;

if (includes(numbers2, numbers2 + 5, numbers3, numbers3 + 2))

cout ‹‹ "numbers2 includes numbers3" ‹‹ endl;

else cout ‹‹ "numbers2 does not include numbers3" ‹‹ endl;

return 0;

}

#include ‹stl.h›

#include ‹iostream.h›

#include ‹string.h›

char* word1 = "ABCDEFGHIJKLMNO";

char* word2 = "LMNOPQRSTUVWXYZ";

int main() {

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

cout ‹‹ "word1: ";

copy(word1, word1 + ::strlen(word1), iter);

cout ‹‹ "\nword2: ";

copy(word2, word2 + ::strlen(word2), iter);

cout ‹‹ endl;

set_difference(word1, word1 + ::strlen(word1), word2, word2 + ::strlen(word2), iter, less‹char›());

cout ‹‹ endl;

return 0;

}

#include ‹stl.h›

#include ‹iostream.h›

#include ‹string.h›

char* word1 = "ABCDEFGHIJKLMNO";

char* word2 = "LMNOPQRSTUVWXYZ";

int main() {

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

cout ‹‹ "word1: ";

copy(word1, word1 + ::strlen(word1), iter);

cout ‹‹ "\nword2: ";

copy(word2, word2 + ::strlen(word2), iter);

cout ‹‹ endl;

set_union(word1, word1 + ::strlen(word1), word2, word2 + ::strlen(word2), iter, less‹char›());

cout ‹‹ endl;

return 0;

}

#include ‹stl.h›

#include ‹iostream.h›

#include ‹string.h›

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

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

}

char* labels[] = {"Q","Q","W","W","E","E","R","T","T","Y","Y"};

int main() {

const unsigned count = sizeof(labels) / sizeof(labels[0]);

ostream_iterator‹char*› iter(cout);

copy(labels, labels + count, iter);

cout ‹‹ endl;

unique(labels, labels + count, str_equal);

copy(labels, labels + count, 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;

vector‹int› result(5);

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

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

cout ‹‹ endl;

partial_sort_copy(v1.begin(), v1.end(), result.begin(), result.end());

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

cout ‹‹ 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] = i;

vector‹int› v2(10);

if (equal(v1.begin(), v1.end(), v2.begin())) cout ‹‹ "v1 is equal to v2" ‹‹ endl;

else cout ‹‹ "v1 is not equal to v2" ‹‹ endl;

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