Home > Store

C++ Standard Library, The: A Tutorial and Reference, 2nd Edition

Register your product to gain access to bonus material or receive a coupon.

C++ Standard Library, The: A Tutorial and Reference, 2nd Edition


  • Sorry, this book is no longer in print.
Not for Sale

eBook (Watermarked)

  • Your Price: $58.87
  • List Price: $73.59
  • Includes EPUB and PDF
  • About eBook Formats
  • This eBook includes the following formats, accessible from your Account page after purchase:

    ePub EPUB The open industry format known for its reflowable content and usability on supported mobile devices.

    Adobe Reader PDF The popular standard, used most often with the free Acrobat® Reader® software.

    This eBook requires no passwords or activation to read. We customize your eBook by discreetly watermarking it with your name, making it uniquely yours.



  • Thoroughly documents each library component incorporated in the brand-new C++ standard
  • Clearly explains complex concepts, and presents the practical detail programmers need to use the Standard Library effectively
  • Contains many examples of working code, all available for download at an accompanying website


  • Copyright 2012
  • Dimensions: 7-3/8" x 9-1/8"
  • Pages: 1136
  • Edition: 2nd
  • Book
  • ISBN-10: 0-321-62321-5
  • ISBN-13: 978-0-321-62321-8

The Best-Selling C++ Resource

Now Updated for C++11

The C++ standard library provides a set of common classes and interfaces that greatly extend the core C++ language. The library, however, is not self-explanatory. To make full use of its components–and to benefit from their power–you need a resource that does far more than list the classes and their functions.

The C++ Standard Library: A Tutorial and Reference, Second Edition, describes this library as now incorporated into the new ANSI/ISO C++ language standard (C++11). The book provides comprehensive documentation of each library component, including an introduction to its purpose and design; clearly written explanations of complex concepts; the practical programming details needed for effective use; traps and pitfalls; the exact signature and definition of the most important classes and functions; and numerous examples of working code. The book focuses in particular on the Standard Template Library (STL), examining containers, iterators, function objects, and STL algorithms.

The book covers all the new C++11 library components, including

  • Concurrency
  • Fractional arithmetic
  • Clocks and timers
  • Tuples
  • New STL containers
  • New STL algorithms
  • New smart pointers
  • New locale facets
  • Random numbers and distributions
  • Type traits and utilities
  • Regular expressions

The book also examines the new C++ programming style and its effect on the standard library, including lambdas, range-based for loops, move semantics, and variadic templates.

An accompanying Web site, including source code, can be found at www.cppstdlib.com.

Sample Content

Online Sample Chapter

The C++ Standard Library: Utilities

Sample Pages

Download the sample pages (includes sections 5.6 and 5.7 and Index)

Table of Contents

Preface to the Second Edition xxiii

Acknowledgments for the Second Edition xxiv

Preface to the First Edition xxv

Acknowledgments for the First Edition xxvi

Chapter 1: About This Book 1

1.1 Why This Book 1

1.2 Before Reading This Book 2

1.3 Style and Structure of the Book 2

1.4 How to Read This Book 4

1.5 State of the Art 5

1.6 Example Code and Additional Information 5

1.7 Feedback 5

Chapter 2: Introduction to C++ and the Standard Library 7

2.1 History of the C++ Standards 7

2.2 Complexity and Big-O Notation 10

Chapter 3: New Language Features 13

3.1 New C++11 Language Features 13

3.2 Old “New” Language Features 33

Chapter 4: General Concepts 39

4.1 Namespace std 39

4.2 Header Files 40

4.3 Error and Exception Handling 41

4.4 Callable Objects 54

4.5 Concurrency and Multithreading 55

4.6 Allocators 57

Chapter 5: Utilities 59

5.1 Pairs and Tuples 60

5.2 Smart Pointers 76

5.3 Numeric Limits 115

5.4 Type Traits and Type Utilities 122

5.5 Auxiliary Functions 134

5.6 Compile-Time Fractional Arithmetic with Class ratio<> 140

5.7 Clocks and Timers 143

5.8 Header Files <cstddef>, <cstdlib>, and <cstring> 161

Chapter 6: The Standard Template Library 165

6.1 STL Components 165

6.2 Containers 167

6.3 Iterators 188

6.4 Algorithms 199

6.5 Iterator Adapters 210

6.6 User-Defined Generic Functions 216

6.7 Manipulating Algorithms 217

6.8 Functions as Algorithm Arguments 224

6.9 Using Lambdas 229

6.10 Function Objects 233

6.11 Container Elements 244

6.12 Errors and Exceptions inside the STL 245

6.13 Extending the STL 250

Chapter 7: STL Containers 253

7.1 Common Container Abilities and Operations 254

7.2 Arrays 261

7.3 Vectors 270

7.4 Deques 283

7.5 Lists 290

7.6 Forward Lists 300

7.7 Sets and Multisets 314

7.8 Maps and Multimaps 331

7.9 Unordered Containers 355

7.10 Other STL Containers 385

7.11 Implementing Reference Semantics 388

7.12 When to Use Which Container 392

Chapter 8: STL Container Members in Detail 397

8.1 Type Definitions 397

8.2 Create, Copy, and Destroy Operations 400

8.3 Nonmodifying Operations 403

8.4 Assignments 406

8.5 Direct Element Access 408

8.6 Operations to Generate Iterators 410

8.7 Inserting and Removing Elements 411

8.8 Special Member Functions for Lists and Forward Lists 420

8.9 Container Policy Interfaces 427

8.10 Allocator Support 430

Chapter 9: STL Iterators 433

9.1 Header Files for Iterators 433

9.2 Iterator Categories 433

9.3 Auxiliary Iterator Functions 441

9.4 Iterator Adapters 448

9.5 Iterator Traits 466

9.6 Writing User-Defined Iterators 471

Chapter 10: STL Function Objects and Using Lambdas 475

10.1 The Concept of Function Objects 475

10.2 Predefined Function Objects and Binders 486

10.3 Using Lambdas 499

Chapter 11: STL Algorithms 505

11.1 Algorithm Header Files 505

11.2 Algorithm Overview 505

11.3 Auxiliary Functions 517

11.4 The for_each() Algorithm 519

11.5 Nonmodifying Algorithms 524

11.6 Modifying Algorithms 557

11.7 Removing Algorithms 575

11.8 Mutating Algorithms 583

11.9 Sorting Algorithms 596

11.10 Sorted-Range Algorithms 608

11.11 Numeric Algorithms 623

Chapter 12: Special Containers 631

12.1 Stacks 632

12.2 Queues 638

12.3 Priority Queues 641

12.4 Container Adapters in Detail 645

12.5 Bitsets 650

Chapter 13: Strings 655

13.1 Purpose of the String Classes 656

13.2 Description of the String Classes 663

13.3 String Class in Detail 693

Chapter 14: Regular Expressions 717

14.1 The Regex Match and Search Interface 717

14.2 Dealing with Subexpressions 720

14.3 Regex Iterators 726

14.4 Regex Token Iterators 727

14.5 Replacing Regular Expressions 730

14.6 Regex Flags 732

14.7 Regex Exceptions 735

14.8 The Regex ECMA Script Grammar 738

14.9 Other Grammars 739

14.10 Basic Regex Signatures in Detail 740

Chapter 15: Input/Output Using Stream Classes 743

15.1 Common Background of I/O Streams 744

15.2 Fundamental Stream Classes and Objects 748

15.3 Standard Stream Operators << and >> 753

15.4 State of Streams 758

15.5 Standard Input/Output Functions 767

15.6 Manipulators 774

15.7 Formatting 779

15.8 Internationalization 790

15.9 File Access 791

15.10 Stream Classes for Strings 802

15.11 Input/Output Operators for User-Defined Types 810

15.12 Connecting Input and Output Streams 819

15.13 The Stream Buffer Classes 826

15.14 Performance Issues 844

Chapter 16: Internationalization 849

16.1 Character Encodings and Character Sets 850

16.2 The Concept of Locales 857

16.3 Locales in Detail 866

16.4 Facets in Detail 869

Chapter 17: Numerics 907

17.1 Random Numbers and Distributions 907

17.2 Complex Numbers 925

17.3 Global Numeric Functions 941

17.4 Valarrays 943

Chapter 18: Concurrency 945

18.1 The High-Level Interface: async() and Futures 946

18.2 The Low-Level Interface: Threads and Promises 964

18.3 Starting a Thread in Detail 973

18.4 Synchronizing Threads, or the Problem of Concurrency 982

18.5 Mutexes and Locks 989

18.6 Condition Variables 1003

18.7 Atomics 1012

Chapter 19: Allocators 1023

19.1 Using Allocators as an Application Programmer 1023

19.2 A User-Defined Allocator 1024

19.3 Using Allocators as a Library Programmer 1026

Bibliography 1031

Index 1037


Submit Errata

More Information

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information

To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.


Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.


If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information

Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.


This site is not directed to children under the age of 13.


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information

If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information

Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents

California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure

Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact

Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice

We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020