The document provides examples of using various C++ standard library containers and algorithms. It shows how to define a phone book using map and unordered_map containers and retrieve phone numbers by name. It also lists different container types and their characteristics, and provides examples of algorithms like sort, find, copy, and equal_range.

2. Map
Unordered Map
Algorithms

3. 01. int get_number(const string& s)
02. {
03. for (const auto& x : phone_book)
04. if (x.name==s)
05. return x.number;
06. return 0; // use 0 to represent "number not found"
07. }

5. 01. map<string,int> phone_book {
02. {"David Hume",123456},
03. {"Karl Popper",234567},
04. {"Bertrand Arthur William Russell",345678}
05. };
01. int get_number(const string& s)
02. {
03. return phone_book[s];
04. }

6. 01. unordered_map<string,int> phone_book {
02. {"David Hume",123456},
03. {"Karl Popper",234567},
04. {"Bertrand Arthur William Russell",345678}
05. };
01. int get_number(const string& s)
02. {
03. return phone_book[s];
04. }

7. vector<T> A variable size vector
list<T> A doubly-linked list
forward_list<T> A singly-linked list
deque<T> A doubly-ended queue
set<T> A set
multiset<T> A set in which a value can occur many times
map<K,V> An associative array
multimap<K,V> A map in which a key can occur may times
unordered_map<k,V> A map using a hashed lookup
unordered_multimap<K,V> A multimap using a hashed lookup
unordered_set<T> A set using a hashed lookup
unordered_multiset<T> A multiset using a hashed lookup

8.  begin() , end()
 push_back()
 size()

9. 01. bool operator<(const Entry& x, const Entry& y)
02. {
03. return x.name<y.name;// order Entrys by their names
04. }
05.
06. void f(vector<Entry>& vec, list<Entry>& lst)
07. {
08. // use < for order
09. sort(vec.begin(),vec.end());
10. // don't copy adjacent equal elements
11. unique_copy(vec.begin(),vec.end(),lst.begin());
12. }

10. 01. // does s contain the character c?
02. bool has_c(const string& s, char c)
03. {
04. auto p = find(s.begin(),s.end(),c);
05. if (p!=s.end())
06. return true;
07. else
08. return false;
09. }
01. bool has_c(const string& s, char c(
02. {
03. return find(s.begin(),s.end(),c)!=s.end();
04. }

11. p=find(b,e,x) p is the first p in [b:e) so that p==x
p=find_if(b,e,f) p is the first p in [b:e) so that f(p)==true
n=count(b,e,x) n is the number of elemes q in [b:e) so that q==x
n=count_if(b,e,f) n is the number of elems q in [b:e) so that f(q, x)
replace(b,e,v,v2) Replace elements q in [b:e) so that q==v by v2
replace_if(b,e,f,v2) Replace elements q in [b:e) so that f(q) by v2
p=copy(b,e,out) Copy [b:e) to [out:p)
p=copy_if(b,e,out,f) Copy elements q form [b:e) so that f(q) to [out:p)
p=unique_copy(b,e,out) Copy [b:e) to [out:p); don't copy duplicates
sort(b,e) Sort elems of [b:e) using < as the sorting criterion
sort(b,e,f) Sort elems of [b:e) using f as the sorting criterion
(p1,p2)=equal_range(b,e,v) [p1:p2) is the subsequence of the sorted sequence
[b:e) with the value v
p=merge(b,e,b2,e2,out) Merge two sorted sequences [b:e) and [b2:e2)
into [out:p)