Leading Christian Resource for Avid Readers, Support New Schools with Every Purchase.

C++11 Standard Library

Paperback |English |1484120744 | 9781484120743

C++11 Standard Library

Paperback |English |1484120744 | 9781484120743
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
ISBN: 1484120744
ISBN13: 9781484120743
Author: Boris Yablonsky
Publisher: CreateSpace Independent Publishing Platform
Format: Paperback
PublicationDate: 2013-04-15
Language: English
PageCount: 828
Dimensions: 7.5 x 1.87 x 9.25 inches
Weight: 49.12 ounces
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

Books - New and Used

The following guidelines apply to books:

  • New: A brand-new copy with cover and original protective wrapping intact. Books with markings of any kind on the cover or pages, books marked as "Bargain" or "Remainder," or with any other labels attached, may not be listed as New condition.
  • Used - Good: All pages and cover are intact (including the dust cover, if applicable). Spine may show signs of wear. Pages may include limited notes and highlighting. May include "From the library of" labels. Shrink wrap, dust covers, or boxed set case may be missing. Item may be missing bundled media.
  • Used - Acceptable: All pages and the cover are intact, but shrink wrap, dust covers, or boxed set case may be missing. Pages may include limited notes, highlighting, or minor water damage but the text is readable. Item may but the dust cover may be missing. Pages may include limited notes and highlighting, but the text cannot be obscured or unreadable.

Note: Some electronic material access codes are valid only for one user. For this reason, used books, including books listed in the Used – Like New condition, may not come with functional electronic material access codes.

Shipping Fees

  • Stevens Books offers FREE SHIPPING everywhere in the United States for ALL non-book orders, and $3.99 for each book.
  • Packages are shipped from Monday to Friday.
  • No additional fees and charges.

Delivery Times

The usual time for processing an order is 24 hours (1 business day), but may vary depending on the availability of products ordered. This period excludes delivery times, which depend on your geographic location.

Estimated delivery times:

  • Standard Shipping: 5-8 business days
  • Expedited Shipping: 3-5 business days

Shipping method varies depending on what is being shipped.  

Tracking
All orders are shipped with a tracking number. Once your order has left our warehouse, a confirmation e-mail with a tracking number will be sent to you. You will be able to track your package at all times. 

Damaged Parcel
If your package has been delivered in a PO Box, please note that we are not responsible for any damage that may result (consequences of extreme temperatures, theft, etc.). 

If you have any questions regarding shipping or want to know about the status of an order, please contact us or email to support@stevensbooks.com.

You may return most items within 30 days of delivery for a full refund.

To be eligible for a return, your item must be unused and in the same condition that you received it. It must also be in the original packaging.

Several types of goods are exempt from being returned. Perishable goods such as food, flowers, newspapers or magazines cannot be returned. We also do not accept products that are intimate or sanitary goods, hazardous materials, or flammable liquids or gases.

Additional non-returnable items:

  • Gift cards
  • Downloadable software products
  • Some health and personal care items

To complete your return, we require a tracking number, which shows the items which you already returned to us.
There are certain situations where only partial refunds are granted (if applicable)

  • Book with obvious signs of use
  • CD, DVD, VHS tape, software, video game, cassette tape, or vinyl record that has been opened
  • Any item not in its original condition, is damaged or missing parts for reasons not due to our error
  • Any item that is returned more than 30 days after delivery

Items returned to us as a result of our error will receive a full refund,some returns may be subject to a restocking fee of 7% of the total item price, please contact a customer care team member to see if your return is subject. Returns that arrived on time and were as described are subject to a restocking fee.

Items returned to us that were not the result of our error, including items returned to us due to an invalid or incomplete address, will be refunded the original item price less our standard restocking fees.

If the item is returned to us for any of the following reasons, a 15% restocking fee will be applied to your refund total and you will be asked to pay for return shipping:

  • Item(s) no longer needed or wanted.
  • Item(s) returned to us due to an invalid or incomplete address.
  • Item(s) returned to us that were not a result of our error.

You should expect to receive your refund within four weeks of giving your package to the return shipper, however, in many cases you will receive a refund more quickly. This time period includes the transit time for us to receive your return from the shipper (5 to 10 business days), the time it takes us to process your return once we receive it (3 to 5 business days), and the time it takes your bank to process our refund request (5 to 10 business days).

If you need to return an item, please Contact Us with your order number and details about the product you would like to return. We will respond quickly with instructions for how to return items from your order.


Shipping Cost


We'll pay the return shipping costs if the return is a result of our error (you received an incorrect or defective item, etc.). In other cases, you will be responsible for paying for your own shipping costs for returning your item. Shipping costs are non-refundable. If you receive a refund, the cost of return shipping will be deducted from your refund.

Depending on where you live, the time it may take for your exchanged product to reach you, may vary.

If you are shipping an item over $75, you should consider using a trackable shipping service or purchasing shipping insurance. We don’t guarantee that we will receive your returned item.

$92.33
Out of Stock
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
ISBN: 1484120744
ISBN13: 9781484120743
Author: Boris Yablonsky
Publisher: CreateSpace Independent Publishing Platform
Format: Paperback
PublicationDate: 2013-04-15
Language: English
PageCount: 828
Dimensions: 7.5 x 1.87 x 9.25 inches
Weight: 49.12 ounces
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

Books - New and Used

The following guidelines apply to books:

  • New: A brand-new copy with cover and original protective wrapping intact. Books with markings of any kind on the cover or pages, books marked as "Bargain" or "Remainder," or with any other labels attached, may not be listed as New condition.
  • Used - Good: All pages and cover are intact (including the dust cover, if applicable). Spine may show signs of wear. Pages may include limited notes and highlighting. May include "From the library of" labels. Shrink wrap, dust covers, or boxed set case may be missing. Item may be missing bundled media.
  • Used - Acceptable: All pages and the cover are intact, but shrink wrap, dust covers, or boxed set case may be missing. Pages may include limited notes, highlighting, or minor water damage but the text is readable. Item may but the dust cover may be missing. Pages may include limited notes and highlighting, but the text cannot be obscured or unreadable.

Note: Some electronic material access codes are valid only for one user. For this reason, used books, including books listed in the Used – Like New condition, may not come with functional electronic material access codes.

Shipping Fees

  • Stevens Books offers FREE SHIPPING everywhere in the United States for ALL non-book orders, and $3.99 for each book.
  • Packages are shipped from Monday to Friday.
  • No additional fees and charges.

Delivery Times

The usual time for processing an order is 24 hours (1 business day), but may vary depending on the availability of products ordered. This period excludes delivery times, which depend on your geographic location.

Estimated delivery times:

  • Standard Shipping: 5-8 business days
  • Expedited Shipping: 3-5 business days

Shipping method varies depending on what is being shipped.  

Tracking
All orders are shipped with a tracking number. Once your order has left our warehouse, a confirmation e-mail with a tracking number will be sent to you. You will be able to track your package at all times. 

Damaged Parcel
If your package has been delivered in a PO Box, please note that we are not responsible for any damage that may result (consequences of extreme temperatures, theft, etc.). 

If you have any questions regarding shipping or want to know about the status of an order, please contact us or email to support@stevensbooks.com.

You may return most items within 30 days of delivery for a full refund.

To be eligible for a return, your item must be unused and in the same condition that you received it. It must also be in the original packaging.

Several types of goods are exempt from being returned. Perishable goods such as food, flowers, newspapers or magazines cannot be returned. We also do not accept products that are intimate or sanitary goods, hazardous materials, or flammable liquids or gases.

Additional non-returnable items:

  • Gift cards
  • Downloadable software products
  • Some health and personal care items

To complete your return, we require a tracking number, which shows the items which you already returned to us.
There are certain situations where only partial refunds are granted (if applicable)

  • Book with obvious signs of use
  • CD, DVD, VHS tape, software, video game, cassette tape, or vinyl record that has been opened
  • Any item not in its original condition, is damaged or missing parts for reasons not due to our error
  • Any item that is returned more than 30 days after delivery

Items returned to us as a result of our error will receive a full refund,some returns may be subject to a restocking fee of 7% of the total item price, please contact a customer care team member to see if your return is subject. Returns that arrived on time and were as described are subject to a restocking fee.

Items returned to us that were not the result of our error, including items returned to us due to an invalid or incomplete address, will be refunded the original item price less our standard restocking fees.

If the item is returned to us for any of the following reasons, a 15% restocking fee will be applied to your refund total and you will be asked to pay for return shipping:

  • Item(s) no longer needed or wanted.
  • Item(s) returned to us due to an invalid or incomplete address.
  • Item(s) returned to us that were not a result of our error.

You should expect to receive your refund within four weeks of giving your package to the return shipper, however, in many cases you will receive a refund more quickly. This time period includes the transit time for us to receive your return from the shipper (5 to 10 business days), the time it takes us to process your return once we receive it (3 to 5 business days), and the time it takes your bank to process our refund request (5 to 10 business days).

If you need to return an item, please Contact Us with your order number and details about the product you would like to return. We will respond quickly with instructions for how to return items from your order.


Shipping Cost


We'll pay the return shipping costs if the return is a result of our error (you received an incorrect or defective item, etc.). In other cases, you will be responsible for paying for your own shipping costs for returning your item. Shipping costs are non-refundable. If you receive a refund, the cost of return shipping will be deducted from your refund.

Depending on where you live, the time it may take for your exchanged product to reach you, may vary.

If you are shipping an item over $75, you should consider using a trackable shipping service or purchasing shipping insurance. We don’t guarantee that we will receive your returned item.

X

Oops!

Sorry, it looks like some products are not available in selected quantity.

OK

Sign up to the Stevens Books Newsletter

For the latest books, recommendations, author interviews and more

By signing up, I confirm that I'm over 16. To find out what personal data we collect and how we use it, please visit. our Privacy Policy.