×

Uh-oh, it looks like your Internet Explorer is out of date.

For a better shopping experience, please upgrade now.

STL Pocket Reference / Edition 1
     

STL Pocket Reference / Edition 1

4.0 1
by Ray Lischner
 

See All Formats & Editions

ISBN-10: 0596005563

ISBN-13: 2900596005565

Pub. Date: 11/10/2003

Publisher: O'Reilly Media, Incorporated

Do you use search() or find() to look for a value in a range? What are the arguments to list::splice? When do you call mem_fun and when do you call mem_fun_ref? If you're like many, you have trouble remembering these details even if you use the C++ standard template library (STL) on a daily basis. Ray Lischner's STL Pocket Reference comes to your rescue as a handy

Overview

Do you use search() or find() to look for a value in a range? What are the arguments to list::splice? When do you call mem_fun and when do you call mem_fun_ref? If you're like many, you have trouble remembering these details even if you use the C++ standard template library (STL) on a daily basis. Ray Lischner's STL Pocket Reference comes to your rescue as a handy memory-aid that answers all your questions concisely. The STL Pocket Reference documents the interface to the containers, iterators, algorithms, and function objects in the C++ STL. You'll find details of function invocations, return types, template parameters, and more. sTogether with its companion volume, the C++ Pocket Reference, this book is sure to be a timesaver. You'll want it on your desk so you can refer to it often.

Product Details

ISBN-13:
2900596005565
Publisher:
O'Reilly Media, Incorporated
Publication date:
11/10/2003
Series:
Pocket Reference (O'Reilly) Series
Edition description:
New Edition
Pages:
130

Table of Contents

Introduction1
Containers3
Standard Containers4
Container Adapters6
Values6
Common Members7
Exceptions16
Deques17
Lists18
Maps20
Priority Queues22
Queues23
Sets24
Stacks25
Strings26
Vectors38
Iterators39
Iterator Categories40
Using Iterators41
Iterator Traits43
@const_iterators45
Insertion Iterators46
I/O Stream Iterators47
Raw Storage Iterator53
Reverse Iterators54
Iterator Function Templates58
Algorithms59
Nonmodifying Operations61
Comparison61
Searching63
Binary Search65
Modifying Sequence Operations66
Uninitialized Sequence Operations71
Sorting72
Merging74
Set Operations74
Heap Operations76
Permutations78
Miscellaneous78
Numerics79
Function Objects80
Using Functors80
Functor Foundations82
Adapters83
Binders86
Arithmetic and Logical Functors87
Comparison Functors88
Miscellaneous89
Allocators89
Bitset92
Pairs95
Smart Pointer96
Boost98
Arrays99
Dynamic Bitsets100
Binders100
Composition102
Adapters103
Functional Header Replacement103
Lambda Functions104
Smart Pointers104
Index107

Customer Reviews

Average Review:

Post to your social network

     

Most Helpful Customer Reviews

See all customer reviews

STL Pocket Reference 4 out of 5 based on 0 ratings. 1 reviews.
Guest More than 1 year ago
Cute, if I may use that term for a computer book! Hopefully, you already are familiar with the constructs described in this nifty little guide. Priority queues, queues, sets, iterators ... The book is strictly an aid to memory. You might consider it the hardcopy kin to online manual pages on each term. Which raises the question. If you have the equivalent information already on your computer, why should you get this book? For some, there is in fact no need. But a surprising (and ironic) number of programmers still prefer hardcopy by their desktops. There is still something appealing about the combined visual, tactile and random access of a good concise reference book which trumps a screen, though we all write to the latter nowadays.