Chapter 22: Standard Template Library (STL)
-  fig22_05.cpp - iterator
-  fig22_14.cpp - Vector: push_back(), at(), size()
-  fig22_15.cpp - Vecotr: copy(), front(), back(), insert(), erase(), clear(),
empty()
-  fig22_17.cpp - List: push_front(), pop_front(), sort(),
merge(), splice(), remove(), unique(), swap()
-  fig22_18.cpp - Deque: push_front(), pop_front()
-  fig22_19.cpp - Multi-set: count(), insert(), find(),
lower_bound(), upper_bound(), equal_range()
-  fig22_20.cpp - Set: insert()
-  fig22_21.cpp - Multi-map: value_type(), insert(), count()
-  fig22_22.cpp - Map: []
-  fig22_23.cpp - Stack: push(), top(), empty(), pop()
-  fig22_24.cpp - Queue: push(), pop(), empty(), front()
-  fig22_25.cpp - Priority_Queue: top()
-  fig22_26.cpp - fill(), fill_n(), generate(), generate_n()
-  fig22_27.cpp - equal(), mismatch(), lexicographical_compare()
-  fig22_28.cpp - remove(), remove_if(), remove_copy(),
remove_copy_if(), ostream_iterator
-  fig22_29.cpp - replace(), replace_if(), replace_copy(),
replace_copy_if()
-  fig22_30.cpp - random_shuffle(), count(), count_if(),
min_element(), max_element(), accumulate(), for_each(), transform()
-  fig22_31.cpp - Vector: sort(), find(), find_if(), binary_search()
-  fig22_32.cpp - swap(), iter_swap(), swap_ranges()
-  fig22_33.cpp - Vector: copy_backward(), merge(), unique(),
reverse()
-  fig22_34.cpp - inplace_merge(), reverse_copy(),
unique_copy()
-  fig22_35.cpp - includes(), set_difference(),
set_intersection(), set_symmetric_difference(), set_union()
-  fig22_36.cpp -  lower_bound(), upper_bound() and
equal_range() for a sorted sequence of values
-  fig22_37.cpp - push_heap, pop_heap,
make_heap and sort_heap
-  fig22_38.cpp - Alogirithms: min(), max()
-  fig22_40.cpp - Bitset: flip(), reset(), test()
-  fig22_42.cpp - Function Objects