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

#include ‹stl.h›

#include ‹iostream.h›

bool odd(int a_) {

 return a_ % 2;

}

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

int main {

 remove_if(numbers, numbers + 6, odd);

 for (int i = 0; i ‹ 6; i++)

 cout ‹‹ numbers[i] ‹‹ ' ';

 cout ‹‹ endl;

 return 0;

}

foreach1.cpp

#include ‹stl.h›

#include ‹iostream.h›

void print_sqr(int a_) {

 cout ‹‹ a_ * a_ ‹‹ " ";

}

int main {

 vector‹int› v1(10);

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

 for_each(v1.begin, v1.end, print_sqr);

 cout ‹‹ endl;

 return 0;

}

parsrtc0.cpp

#include ‹stl.h›

#include ‹iostream.h›

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

int main {

 int result[3];

 partial_sort_copy(numbers, numbers + 6, result, result + 3);

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

 cout ‹‹ endl;

 return 0;

}

pqueue2.cpp

#include ‹iostream.h›

#include ‹stl.h›

int main {

 priority_queue‹deque‹char*›, greater_s› q;

 q.push((char*) "cat");

 q.push((char*) "dog");

 q.push((char*) "ape");

 while (!q.empty) {

  cout ‹‹ q.top ‹‹ endl;

  q.pop;

 }

 return 0;

}

binsrch1.cpp

#include ‹stl.h›

#include ‹iostream.h›

int main {

 int vector[100];

 for (int i = 0; i ‹ 100; i++) vector[i] = i;

 if (binary_search(vector, vector + 100, 42)) cout ‹‹ "found 42" ‹‹ endl;

 else cout ‹‹ "did not find 42" ‹‹ endl;

 return 0;

}

ptrunf2.cpp

#include ‹iostream.h›

#include ‹stl.h›

bool even(int n_) {

 return (n_ % 2) == 0;

}

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

int main {

 int* p = find_if(array, array + 3, ptr_fun(even));

 if (p != array + 3) cout ‹‹ *p ‹‹ " is even" ‹‹ endl;

 return 0;

}

rotcopy0.cpp

#include ‹stl.h›

#include ‹iostream.h›

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

int main {

 int result[6];

 rotate_copy(numbers, numbers + 3, numbers + 6, result);

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

 cout ‹‹ endl;

 return 0;

}

mkheap0.cpp

#include ‹stl.h›

#include ‹iostream.h›

int numbers[6] = {5, 10, 4, 13, 11, 19};

int main {

 make_heap(numbers, numbers + 6);

 for (int i = 6; i ›= 1; i--) {

  cout ‹‹ numbers[0] ‹‹ endl;

  pop_heap(numbers, numbers + i);

 }

 return 0;

}

copy1.cpp

#include ‹stl.h›

#include ‹iostream.h›

#include ‹string.h›

char string[23] = "A string to be copied.";

int main {

 char result[23];

 copy(string, string + 23, result);

 cout ‹‹ " Src: " ‹‹ string ‹‹ "\nDest: " ‹‹ result ‹‹ endl;

 return 0;

}

find0.cpp

#include ‹stl.h›

#include ‹iostream.h›

int numbers[10] = {0, 1, 4, 9, 16, 25, 36, 49, 64};

int main {

 int* location;

 location = find(numbers, numbers + 10, 25);

 cout ‹‹ "Found 25 at offset " ‹‹ (location - numbers) ‹‹ endl;

 return 0;

}

partsum0.cpp

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