|I/O Stream Iterators||47|
|Raw Storage Iterator||53|
|Iterator Function Templates||58|
|Modifying Sequence Operations||66|
|Uninitialized Sequence Operations||71|
|Arithmetic and Logical Functors||87|
|Functional Header Replacement||103|
STL Pocket Reference / Edition 1by Ray Lischner
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 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.
Table of Contents
Most Helpful Customer Reviews
See all customer reviews
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.