ISBN 10: 1484120744 / ISBN 13: 9781484120743
Gebraucht / Anzahl: 0
Bei weiteren Verkäufern erhältlich
Alle  Exemplare dieses Buches anzeigen

Über dieses Buch

Leider ist dieses Exemplar nicht mehr verfügbar. Wir haben Ihnen weitere Exemplare dieses Titels unten aufgelistet.

Beschreibung:

This Book is in Good Condition. Clean Copy With Light Amount of Wear. 100% Guaranteed. Summary: 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. Buchnummer des Verkäufers

Über diesen Titel:

Bewertung (bereitgestellt von GoodReads):
0 durchschnittlich
(0 Bewertungen)

Inhaltsangabe: 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

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Bibliografische Details

Titel: $listing_disp.getBaseListing().getTitle()



Zustand: Used

Beste Suchergebnisse bei AbeBooks

1.

Boris Yablonsky
Verlag: Createspace, United States (2013)
ISBN 10: 1484120744 ISBN 13: 9781484120743
Neu Paperback Anzahl: 10
Print-on-Demand
Anbieter
The Book Depository US
(London, Vereinigtes Königreich)
Bewertung
[?]

Buchbeschreibung Createspace, United States, 2013. Paperback. Buchzustand: New. 235 x 190 mm. Language: English . Brand New Book ***** Print on Demand *****. 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. Buchnummer des Verkäufers APC9781484120743

Weitere Informationen zu diesem Verkäufer | Frage an den Anbieter

Neu kaufen
EUR 39,23
Währung umrechnen

In den Warenkorb

Versand: Gratis
Von Vereinigtes Königreich nach USA
Versandziele, Kosten & Dauer

2.

Yablonsky, Boris
Verlag: CreateSpace Independent Publishing Platform
ISBN 10: 1484120744 ISBN 13: 9781484120743
Neu PAPERBACK Anzahl: > 20
Anbieter
Russell Books
(Victoria, BC, Kanada)
Bewertung
[?]

Buchbeschreibung CreateSpace Independent Publishing Platform. PAPERBACK. Buchzustand: New. 1484120744 Special order direct from the distributor. Buchnummer des Verkäufers ING9781484120743

Weitere Informationen zu diesem Verkäufer | Frage an den Anbieter

Neu kaufen
EUR 32,50
Währung umrechnen

In den Warenkorb

Versand: EUR 6,54
Von Kanada nach USA
Versandziele, Kosten & Dauer

3.

Boris Yablonsky
Verlag: Createspace, United States (2013)
ISBN 10: 1484120744 ISBN 13: 9781484120743
Neu Paperback Anzahl: 10
Print-on-Demand
Anbieter
The Book Depository
(London, Vereinigtes Königreich)
Bewertung
[?]

Buchbeschreibung Createspace, United States, 2013. Paperback. Buchzustand: New. 235 x 190 mm. Language: English . Brand New Book ***** Print on Demand *****.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. Buchnummer des Verkäufers APC9781484120743

Weitere Informationen zu diesem Verkäufer | Frage an den Anbieter

Neu kaufen
EUR 59,35
Währung umrechnen

In den Warenkorb

Versand: Gratis
Von Vereinigtes Königreich nach USA
Versandziele, Kosten & Dauer

4.

Boris Yablonsky
Verlag: Createspace
ISBN 10: 1484120744 ISBN 13: 9781484120743
Neu Paperback Anzahl: 20
Print-on-Demand
Anbieter
BuySomeBooks
(Las Vegas, NV, USA)
Bewertung
[?]

Buchbeschreibung Createspace. Paperback. Buchzustand: New. This item is printed on demand. Paperback. 828 pages. Dimensions: 9.2in. x 7.5in. x 1.9in.This book contains the usage and implementation of C11 Standard Library. I Generic Algorithms 1 Algorithm 2 Iterator Wrapper 3 Modifying Algorithms copy copybackward copyif copyn copy fill filln generate generaten move movebackward partitions ispartitioned partition partitioncopy partitionpoint stablepartition random shuffle randomshuffleurng randomshufflerand remove removeif removecopy removecopyif replace replaceif replacecopy replacecopyif reverse reverse reversecopy rotate rotatecopy swap iterswap swapranges transform binarytransform unarytransform unique uniquecopy unique with predicate uniquecopy with predicate II Non Modifying Algorithms adjacentfind adjacentfind with predicate allof anyof noneof count countif equal equal with predicate find findif findifnot findend findend with predicate findfirstof findfirstof with predicate foreach ispermutation ispermutation with predicate search search search with predicate searchn searchn with predicate mismatch mismatch mismatch with predicate III Sorting and Searching Algorithms 5 Binary Search binarysearch binarysearch with predicate lowerbound lowerbound with predicate upperbound upperbound with predicate equalrange equalrange with predicate 6 Heap Operations isheap isheap with predicate isheapuntil isheapuntil with predicate makeheap makeheap with predicate popheap popheap with predicate pushheap pushheap with predicate sortheap sortheap with predicate 7 Lexicographical Comparison lexicographicalcompare lexicographicalcompare with predicate 8 Merging Algorithms merge merge with predicate inplacemerge inplacemerge with predicate 9 Min Max Algorithms max max with predicate maxelement maxelement with predicate max initializerlist max initializerlist with predicate min min with predicate minelement minelement with predicate min initializerlist min initializerlist with predicate minmax minmax with predicate minmaxelement minmaxelement with predicate minmax initializerlist minmax initializerlist with predicate 10 nth element nthelement nthelement with predicate 11 Permutation Generators nextpermutation nextpermutation with predicate prevpermutation prevpermutation with predicate 12 Set Operations includes includes with predicate setdifference setdifference with predicate setintersection setintersection with predicate setsymmetricdifference setsymmetricdifference with predicate setunion setunion with predicate 13 Sorting Algorithms issorted issorted with predicate issorteduntil issorteduntil with predicate partialsort partialsort with predicate partialsortcopy partialsortcopy with predicate sort sort with predicate stablesort stablesort with predicate IV Sequential Containers 14 array 15 vector 16 deque 17 forwardlist 18 list IVAssociative Containers 19 map 20 set V Unordered Containers 21 unorderedmap 22 unorderedset VIContainer Adaptors 23 queue and priorityqueue 24 stack VII terators VIII Utilities 26 utility 27 tuple 28 type traits 29 numeric 30 scopedallocator 31 initializerlist 32 functional IX Multi-threading 33 atomic 34 future 35 thread This item ships from La Vergne,TN. Paperback. Buchnummer des Verkäufers 9781484120743

Weitere Informationen zu diesem Verkäufer | Frage an den Anbieter

Neu kaufen
EUR 78,33
Währung umrechnen

In den Warenkorb

Versand: EUR 3,69
Innerhalb USA
Versandziele, Kosten & Dauer