menu
{ "item_title" : "C++11 Standard Library", "item_author" : [" Boris Yablonsky "], "item_description" : "This book contains the usage and implementation of C]+11 Standard Library.I Generic Algorithms 1 Algorithm2 Iterator Wrapper3 Modifying Algorithmscopy copy_backward copy_if copy_n copyfill fill_ngenerate generate_nmove move_backwardpartitionsis_partitioned partition partition_copy partition_point stable_partitionrandom shuffle random_shuffle_urng random_shuffle_randremove remove_if remove_copy remove_copy_ifreplace replace_if replace_copy replace_copy_ifreverse reverse reverse_copyrotate rotate_copyswap iter_swap swap_rangestransform binary_transform unary_transformunique unique_copy unique with predicate unique_copy with predicateII Non Modifying Algorithmsadjacent_find adjacent_find with predicateall_of any_of none_ofcount count_ifequal equal with predicatefind find_if find_if_not find_end find_end with predicate find_first_of find_first_of with predicatefor_eachis_permutationis_permutation with predicatesearchsearchsearch with predicatesearch_nsearch_n with predicatemismatchmismatchmismatch with predicate III Sorting and Searching Algorithms 5 Binary Search binary_searchbinary_search with predicatelower_boundlower_bound with predicateupper_boundupper_bound with predicateequal_rangeequal_range with predicate6 Heap Operationsis_heapis_heap with predicateis_heap_untilis_heap_until with predicatemake_heapmake_heap with predicatepop_heappop_heap with predicatepush_heappush_heap with predicatesort_heapsort_heap with predicate7 Lexicographical Comparisonlexicographical_comparelexicographical_compare with predicate8 Merging Algorithmsmergemerge with predicateinplace_mergeinplace_merge with predicate9 Min Max Algorithmsmaxmax with predicatemax_elementmax_element with predicatemax initializer_listmax initializer_list with predicateminmin with predicatemin_elementmin_element with predicatemin initializer_listmin initializer_list with predicateminmaxminmax with predicateminmax_elementminmax_element with predicateminmax initializer_listminmax initializer_list with predicate 10 nth element nth_elementnth_element with predicate11 Permutation Generatorsnext_permutationnext_permutation with predicateprev_permutationprev_permutation with predicate12 Set Operationsincludesincludes with predicateset_difference set_difference with predicateset_intersection set_intersection with predicateset_symmetric_differenceset_symmetric_difference with predicateset_unionset_union with predicate13 Sorting Algorithmsis_sortedis_sorted with predicateis_sorted_untilis_sorted_until with predicatepartial_sort partial_sort with predicate partial_sort_copy partial_sort_copy with predicatesort sort with predicate stable_sort stable_sort with predicateIV Sequential Containers14 array15 vector16 deque17 forward_list18 listIVAssociative Containers19 map20 setV Unordered Containers21 unordered_map22 unordered_setVIContainer Adaptors23 queue and priority_queue24 stackVII teratorsVIII Utilities26 utility27 tuple28 type traits29 numeric30 scoped_allocator31 initializer_list32 functionalIX Multi-threading33 atomic34 future35 thread", "item_img_path" : "https://covers4.booksamillion.com/covers/bam/1/48/412/074/1484120744_b.jpg", "price_data" : { "retail_price" : "59.99", "online_price" : "59.99", "our_price" : "59.99", "club_price" : "59.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
C++11 Standard Library|Boris Yablonsky

C++11 Standard Library : Usage and Implementation

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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

This item is Non-Returnable

Details

  • ISBN-13: 9781484120743
  • ISBN-10: 1484120744
  • Publisher: Createspace Independent Publishing Platform
  • Publish Date: April 2013
  • Dimensions: 9.25 x 7.52 x 1.64 inches
  • Shipping Weight: 3.07 pounds
  • Page Count: 828

Related Categories

You May Also Like...

    1

BAM Customer Reviews