Description:
Written by its inventors, The C++ Standard Template Library is a must-have for any serious intermediate or advanced C++ developer. Containing a full reference to all available Standard Template Library (STL) features and filled with expert advice, this book will give you the means to use this powerful library more effectively. As most C++ developers know, the STL bundles robust container classes and nearly 100 algorithms (used to efficiently search, sort, and manipulate data). However, tapping its power can be a challenge. Many books on STL resort to the arcane syntax of templates and can be couched in the language of computer science. The C++ Standard Template Library breaks this mold with a clearly presented tour of STL from top to bottom, based on the individual header files that make up this library. Because it was written by its original inventors, you get a true insider's perspective. Starting with iterators (used to navigate through data) and an in-depth guide to STL algorithms, you'll learn the right way to use STL from the ground up, including specific features and APIs. Each chapter is organized so that newcomers can learn the basics first, with a reference and guide to APIs and how to use them. The nitty-gritty details follow. (Each chapter includes the full source code from Hewlett-Packard's implementation of each STL header file, along with annotations and suggested programming exercises to try out on your own.) Besides full source code, expert readers will benefit from the description of the design choices made by the STL author/inventors, as well as tips for performance. The book closes with a full tour of STL containers (including the vector, list, set, and map classes), plus hints for selecting the right containers based on your programming needs. (It helps that the discussion on containers occurs after the material on algorithms, making STL containers even more flexible.) In all, The C++ Standard Template Library looks to be an important book, one that will help anyone with some C++ experience get productive with STL. --Richard Dragan Topics covered: - Introduction to the Standard Template Library (STL)
- Guidelines for using STL features and test code
- Programming exercises
- Iterators (output and input iterators, forward, bidirectional, and random access iterators)
- Utility templates
- Allocators and memory templates (including smart pointers with auto_ptr)
- Guide to over 90 STL algorithms (including searching, sorting, and manipulating STL data)
- Numeric templates
- Templates for function objects
- Guide to STL containers
- Vector and resizable arrays
- List and linked lists
- Deque and double-ended queues
- STL associative containers (set and map containers, trees (including balanced, mostly balanced, and red-black trees), multisets and multimaps, stacks, queues, and priority queues
- Reference and tutorial to all STL classes and APIs
- Full source code for the Hewlett-Packard implementation of STL
- Sample programming exercises
| 
