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

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

setdiff2.cpp

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

setunon2.cpp

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

unique2.cpp

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

parsrtc1.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 % 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;
}

equal1.cpp

#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);
 if (equal(v1.begin, v1.end, v2.begin)) cout ‹‹ "v1 is equal to v2" ‹‹ endl;
 else cout ‹‹ "v1 is not equal to v2" ‹‹ endl;
 return 0;
}

equal0.cpp

#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] = {1, 2};

int main {
 if (equal(numbers1, numbers1 + 5, numbers2))
 cout ‹‹ "numbers1 is equal to numbers2" ‹‹ endl;
 else cout ‹‹ "numbers1 is not equal to numbers2" ‹‹ endl;
 if (equal(numbers3, numbers3 + 2, numbers1))
 cout ‹‹ "numbers3 is equal to numbers1" ‹‹ endl;
 else cout ‹‹ "numbers3 is not equal to numbers1" ‹‹ endl;
 return 0;
}

genern2.cpp

#include ‹stl.h›
#include ‹iostream.h›
#include ‹stdlib.h›

class Fibonacci {