C++11 Standard Library: Usage and Implementation

By Boris Yablonsky

This book contains the usage and implementation of C++11 Standard Library.
I Generic Algorithms

1 Algorithm
2 Iterator Wrapper
3 Modifying Algorithms
copy copy_backward copy_if copy_n copy
fill fill_n
generate generate_n
move move_backward
partitions
is_partitioned partition partition_copy partition_point stable_partition
random shuffle random_shuffle_urng random_shuffle_rand
remove remove_if remove_copy remove_copy_if
replace replace_if replace_copy replace_copy_if
reverse reverse reverse_copy
rotate rotate_copy
swap iter_swap swap_ranges
transform binary_transform unary_transform
unique unique_copy unique with predicate unique_copy with predicate
II Non Modifying Algorithms
adjacent_find adjacent_find with predicate
all_of any_of none_of
count count_if
equal equal with predicate
find find_if find_if_not find_end find_end with predicate find_first_of find_first_of with predicate
for_each
is_permutation
is_permutation with predicate
search
search
search with predicate
search_n
search_n with predicate
mismatch
mismatch
mismatch with predicate

III Sorting and Searching Algorithms

5 Binary Search

binary_search
binary_search with predicate
lower_bound
lower_bound with predicate
upper_bound
upper_bound with predicate
equal_range
equal_range with predicate
6 Heap Operations
is_heap
is_heap with predicate
is_heap_until
is_heap_until with predicate
make_heap
make_heap with predicate
pop_heap
pop_heap with predicate
push_heap
push_heap with predicate
sort_heap
sort_heap with predicate
7 Lexicographical Comparison
lexicographical_compare
lexicographical_compare with predicate
8 Merging Algorithms
merge
merge with predicate
inplace_merge
inplace_merge with predicate
9 Min Max Algorithms
max
max with predicate
max_element
max_element with predicate
max initializer_list
max initializer_list with predicate
min
min with predicate
min_element
min_element with predicate
min initializer_list
min initializer_list with predicate
minmax
minmax with predicate
minmax_element
minmax_element with predicate
minmax initializer_list
minmax initializer_list with predicate

10 nth element

nth_element
nth_element with predicate
11 Permutation Generators
next_permutation
next_permutation with predicate
prev_permutation
prev_permutation with predicate
12 Set Operations
includes
includes with predicate
set_difference set_difference with predicate
set_intersection set_intersection with predicate
set_symmetric_difference
set_symmetric_difference with predicate
set_union
set_union with predicate
13 Sorting Algorithms
is_sorted
is_sorted with predicate
is_sorted_until
is_sorted_until with predicate
partial_sort partial_sort with predicate partial_sort_copy partial_sort_copy with predicate
sort sort with predicate stable_sort stable_sort with predicate
IV Sequential Containers
14 array
15 vector
16 deque
17 forward_list
18 list
IVAssociative Containers
19 map
20 set
V Unordered Containers
21 unordered_map
22 unordered_set
VIContainer Adaptors
23 queue and priority_queue
24 stack
VII terators
VIII Utilities
26 utility
27 tuple
28 type traits
29 numeric
30 scoped_allocator
31 initializer_list
32 functional
IX Multi-threading
33 atomic
34 future
35 thread

• Format: Paperback
• Language: English
• ISBN: 1484120744
• ISBN13: 9781484120743
• Release Date: April 2013
• Publisher: Createspace Independent Publishing Platform
• Length: 828 Pages
• Weight: 3.07 lbs.
• Dimensions: 1.6" x 7.5" x 9.3"