full screen
Home > Computer & Internet > Computer programming / software development > Software engineering > C++11 Standard Library
C++11 Standard Library

C++11 Standard Library


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
About the Book

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


Best Sellers



Product Details
  • ISBN-13: 9781484120743
  • Publisher: Createspace Independent Publishing Platform
  • Publisher Imprint: Createspace Independent Publishing Platform
  • Height: 235 mm
  • No of Pages: 828
  • Series Title: English
  • Sub Title: Usage and Implementation
  • Width: 191 mm
  • ISBN-10: 1484120744
  • Publisher Date: 15 Apr 2013
  • Binding: Paperback
  • Language: English
  • Returnable: N
  • Spine Width: 42 mm
  • Weight: 1441 gr


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
C++11 Standard Library
Createspace Independent Publishing Platform -
C++11 Standard Library
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

C++11 Standard Library

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Booksbay (the "CRR Service").


    By submitting any content to Booksbay, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Booksbay (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Booksbay a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Booksbay may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Booksbay's sole discretion. Booksbay reserves the right to change, condense, withhold publication, remove or delete any content on Booksbay's website that Booksbay deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Booksbay does not guarantee that you will have any recourse through Booksbay to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Booksbay reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Booksbay, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Booksbay, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals



    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!