{"product_id":"c-11-standard-library-usage-and-implementation-9781484120743","title":"C++11 Standard Library: Usage and Implementation","description":"\u003cp\u003e • Author(s): Boris Yablonsky\u003cbr\u003e • Publisher: Createspace Independent Publishing Platform\u003cbr\u003e • Publisher Imprint: Createspace Independent Publishing Platform\u003cbr\u003e • BISAC: Programming Languages - C++\u003c\/p\u003e\u003cp\u003eThis book contains the usage and implementation of C++11 Standard Library.\u003cbr\u003e I Generic Algorithms \u003c\/p\u003e\u003cp\u003e\u003c\/p\u003e 1 Algorithm \u003cbr\u003e 2 Iterator Wrapper \u003cbr\u003e 3 Modifying Algorithms \u003cbr\u003e copy copy_backward copy_if copy_n copy \u003cbr\u003e fill fill_n \u003cbr\u003e generate generate_n \u003cbr\u003e move move_backward \u003cbr\u003e partitions \u003cbr\u003e is_partitioned partition partition_copy partition_point stable_partition \u003cbr\u003e random shuffle random_shuffle_urng random_shuffle_rand \u003cbr\u003e remove remove_if remove_copy remove_copy_if \u003cbr\u003e replace replace_if replace_copy replace_copy_if \u003cbr\u003e reverse reverse reverse_copy \u003cbr\u003e rotate rotate_copy \u003cbr\u003e swap iter_swap swap_ranges \u003cbr\u003e transform binary_transform unary_transform \u003cbr\u003e unique unique_copy unique with predicate unique_copy with predicate \u003cbr\u003e II Non Modifying Algorithms \u003cbr\u003e adjacent_find adjacent_find with predicate \u003cbr\u003e all_of any_of none_of \u003cbr\u003e count count_if \u003cbr\u003e equal equal with predicate \u003cbr\u003e find find_if find_if_not find_end find_end with predicate find_first_of find_first_of with predicate \u003cbr\u003e for_each \u003cbr\u003e is_permutation \u003cbr\u003e is_permutation with predicate \u003cbr\u003e search \u003cbr\u003e search \u003cbr\u003e search with predicate \u003cbr\u003e search_n \u003cbr\u003e search_n with predicate \u003cbr\u003e mismatch \u003cbr\u003e mismatch \u003cbr\u003e mismatch with predicate \u003cp\u003e\u003c\/p\u003e III Sorting and Searching Algorithms \u003cp\u003e\u003c\/p\u003e 5 Binary Search \u003cp\u003e\u003c\/p\u003e binary_search \u003cbr\u003e binary_search with predicate \u003cbr\u003e lower_bound \u003cbr\u003e lower_bound with predicate \u003cbr\u003e upper_bound \u003cbr\u003e upper_bound with predicate \u003cbr\u003e equal_range \u003cbr\u003e equal_range with predicate \u003cbr\u003e 6 Heap Operations \u003cbr\u003e is_heap \u003cbr\u003e is_heap with predicate \u003cbr\u003e is_heap_until \u003cbr\u003e is_heap_until with predicate \u003cbr\u003e make_heap \u003cbr\u003e make_heap with predicate \u003cbr\u003e pop_heap \u003cbr\u003e pop_heap with predicate \u003cbr\u003e push_heap \u003cbr\u003e push_heap with predicate \u003cbr\u003e sort_heap \u003cbr\u003e sort_heap with predicate \u003cbr\u003e 7 Lexicographical Comparison \u003cbr\u003e lexicographical_compare \u003cbr\u003e lexicographical_compare with predicate \u003cbr\u003e 8 Merging Algorithms \u003cbr\u003e merge \u003cbr\u003e merge with predicate \u003cbr\u003e inplace_merge \u003cbr\u003e inplace_merge with predicate \u003cbr\u003e 9 Min Max Algorithms \u003cbr\u003e max \u003cbr\u003e max with predicate \u003cbr\u003e max_element \u003cbr\u003e max_element with predicate \u003cbr\u003e max initializer_list \u003cbr\u003e max initializer_list with predicate \u003cbr\u003e min \u003cbr\u003e min with predicate \u003cbr\u003e min_element \u003cbr\u003e min_element with predicate \u003cbr\u003e min initializer_list \u003cbr\u003e min initializer_list with predicate \u003cbr\u003e minmax \u003cbr\u003e minmax with predicate \u003cbr\u003e minmax_element \u003cbr\u003e minmax_element with predicate \u003cbr\u003e minmax initializer_list \u003cbr\u003e minmax initializer_list with predicate \u003cp\u003e\u003c\/p\u003e 10 nth element \u003cp\u003e\u003c\/p\u003e nth_element \u003cbr\u003e nth_element with predicate \u003cbr\u003e 11 Permutation Generators \u003cbr\u003e next_permutation \u003cbr\u003e next_permutation with predicate \u003cbr\u003e prev_permutation \u003cbr\u003e prev_permutation with predicate \u003cbr\u003e 12 Set Operations \u003cbr\u003e includes \u003cbr\u003e includes with predicate \u003cbr\u003e set_difference set_difference with predicate \u003cbr\u003e set_intersection set_intersection with predicate \u003cbr\u003e set_symmetric_difference \u003cbr\u003e set_symmetric_difference with predicate \u003cbr\u003e set_union \u003cbr\u003e set_union with predicate \u003cbr\u003e 13 Sorting Algorithms \u003cbr\u003e is_sorted \u003cbr\u003e is_sorted with predicate \u003cbr\u003e is_sorted_until \u003cbr\u003e is_sorted_until with predicate \u003cbr\u003e partial_sort partial_sort with predicate partial_sort_copy partial_sort_copy with predicate \u003cbr\u003e sort sort with predicate stable_sort stable_sort with predicate \u003cbr\u003e IV Sequential Containers \u003cbr\u003e 14 array \u003cbr\u003e 15 vector \u003cbr\u003e 16 deque \u003cbr\u003e 17 forward_list \u003cbr\u003e 18 list \u003cbr\u003e IVAssociative Containers \u003cbr\u003e 19 map \u003cbr\u003e 20 set \u003cbr\u003e V Unordered Containers \u003cbr\u003e 21 unordered_map \u003cbr\u003e 22 unordered_set \u003cbr\u003e VIContainer Adaptors \u003cbr\u003e 23 queue and priority_queue \u003cbr\u003e 24 stack \u003cbr\u003e VII terators \u003cbr\u003e VIII Utilities \u003cbr\u003e 26 utility \u003cbr\u003e 27 tuple \u003cbr\u003e 28 type traits \u003cbr\u003e 29 numeric \u003cbr\u003e 30 scoped_allocator \u003cbr\u003e 31 initializer_list \u003cbr\u003e 32 functional \u003cbr\u003e IX Multi-threading \u003cbr\u003e 33 atomic \u003cbr\u003e 34 future \u003cbr\u003e 35 thread","brand":"Createspace Independent Publishing Platform","offers":[{"title":"Paperback","offer_id":45504914981015,"sku":"9781484120743","price":5466.0,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0666\/3471\/1191\/files\/9781484120743.webp?v=1767455867","url":"https:\/\/atlanticbooks.com\/products\/c-11-standard-library-usage-and-implementation-9781484120743","provider":"Atlantic Books","version":"1.0","type":"link"}