Home > Store

Embracing Modern C++ Safely

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

Embracing Modern C++ Safely

Best Value Purchase

Book + eBook Bundle

  • Your Price: $90.94
  • List Price: $156.98
  • 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.

More Purchase Options


  • Your Price: $63.99
  • List Price: $79.99
  • Usually ships in 24 hours.

eBook (Watermarked)

  • Your Price: $61.59
  • List Price: $76.99
  • 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.



  • Focused on what experienced C++ developers need to succeed with C++14, C++11, and other modern versions of C++
  • Stresses real-life application issues, and problems that arise when engineers with diverse C++ experience collaborate
  • Fact-based, data-driven, objective, and packed with realistic examples from the deep C++ experience the authors possess


  • Copyright 2022
  • Dimensions: 7-3/8" x 9-1/8"
  • Pages: 1376
  • Edition: 1st
  • Book
  • ISBN-10: 0-13-738035-6
  • ISBN-13: 978-0-13-738035-0

Maximize Reward and Minimize Risk with Modern C++

Embracing Modern C++ Safely shows you how to make effective use of the new and enhanced language features of modern C++ without falling victim to their potential pitfalls.

Based on their years of experience with large, mission-critical projects, four leading C++ authorities divide C++11/14 language features into three categories: Safe, Conditionally Safe, and Unsafe. Safe features offer compelling value, are easy to use productively, and are relatively difficult to misuse. Conditionally safe features offer significant value but come with risks that require significant expertise and familiarity before use. Unsafe features have an especially poor risk/reward ratio, are easy to misuse, and are beneficial in only the most specialized circumstances.

This book distills the C++ community's years of experience applying C++11 and C++14 features and will help you make effective and safe design decisions that reflect real-world, economic engineering tradeoffs in large-scale, diverse software development environments. The authors use examples derived from real code bases to illustrate every finding objectively and to illuminate key issues. Each feature identifies the sound use cases, hidden pitfalls, and shortcomings of that language feature. After reading this book, you will

  • Understand what each C++11/14 feature does and where it works best
  • Recognize how to work around show-stopping pitfalls and annoying corner cases
  • Know which features demand additional training, experience, and peer review
  • Gain insights for preparing coding standards and style guides that suit your organization's needs
  • Be equipped to introduce modern C++ incrementally and judiciously into established code bases

Seasoned C++ developers, team leads, and technical managers who want to improve productivity, code quality, and maintainability will find the insights in this modular, meticulously organized reference indispensable.

Register your book for convenient access to downloads, updates, and/or corrections as they become available. See inside book for details.


Author's Site

Please visit the author's site at emcpps.com.

Sample Content

Online Sample Chapter

Embracing Modern C++ Safely - Excerpt

Sample Pages

Download the sample pages

Table of Contents

Foreword by Shawn Edwards xiii
Foreword by Andrei Alexandrescu xv
Acknowledgments xix
About the Authors xxv

Chapter 0: Introduction 1

What Makes This Book Different 1
Scope for the First Edition 2
The EMC++S Guiding Principles 3
What Do We Mean by Safely? 4
A Safe Feature 5
A Conditionally Safe Feature 5
An Unsafe Feature 6
Modern C++ Feature Catalog 6
How to Use This Book 8

Chapter 1: Safe Features 11

1.1 C++11 11
Attribute Syntax | Generalized Attribute Support 12
Consecutive >s | Consecutive Right-Angle Brackets 21
decltype | Operator for Extracting Expression Types 25
Defaulted Functions | Using = default for Special Member Functions 33
Delegating Ctors | Constructors Calling Other Constructors 46
Deleted Functions | Using = delete for Arbitrary Functions 53
explicit Operators | Explicit Conversion Operators 61
Function static '11 | Thread-Safe Function-Scope static Variables 68
Local Types '11 | Local/Unnamed Types as Template Arguments 83
long long | The long long (64 bits) Integral Type 89
noreturn | The [[noreturn]] Attribute 95
nullptr | The Null-Pointer-Literal Keyword 99
override | The override Member-Function Specifier 104
Raw String Literals | Syntax for Unprocessed String Contents 108
static_assert | Compile-Time Assertions 115
Trailing Return | Trailing Function Return Types 124
Unicode Literals | Unicode String Literals 129
using Aliases | Type/Template Aliases (Extended typedef) 133

1.2 C++14 138
Aggregate Init '14 | Aggregates Having Default Member Initializers 138
Binary Literals | Binary Literals: The 0b Prefix 142
deprecated | The [[deprecated]] Attribute 147
Digit Separators | The Digit Separator (') 152
Variable Templates | Templated Variable Declarations/Definitions 157

Chapter 2: Conditionally Safe Features 167

2.1 C++11 167
alignas | The alignas Specifier 168
alignof | The alignof Operator 184
auto Variables | Variables of Automatically Deduced Type 195
Braced Init | Braced-Initialization Syntax: {} 215
constexpr Functions | Compile-Time Invocable Functions 257
constexpr Variables | Compile-Time Accessible Variables 302
Default Member Init | Default class/union Member Initializers 318
enum class | Strongly Typed, Scoped Enumerations 332
extern template | Explicit-Instantiation Declarations 353
Forwarding References | Forwarding References (T&&) 377
Generalized PODs '11 | Trivial and Standard-Layout Types 401
Inheriting Ctors | Inheriting Base-Class Constructors 535
initializer_list | List Initialization: std::initializer_list<T> 553
Lambdas | Anonymous Function Objects (Closures) 573
noexcept Operator | Asking if an Expression Cannot throw 615
Opaque enums | Opaque Enumeration Declarations 660
Range for | Range-Based for Loops 679
Rvalue References | Move Semantics and Rvalue References (&&) 710
Underlying Type '11 | Explicit Enumeration Underlying Type 829
User-Defined Literals | User-Defined Literal Operators 835
Variadic Templates | Variable-Argument-Count Templates 873

2.2 C++14 958
constexpr Functions '14 | Relaxed Restrictions on constexpr Functions 959
Generic Lambdas | Lambdas Having a Templated Call Operator 968
Lambda Captures | Lambda-Capture Expressions 986

Chapter 3: Unsafe Features 997

3.1 C++11 997
carries_dependency | The [[carries_dependency]] Attribute 998
final | Prohibiting Overriding and Derivation 1007
friend '11 | Extended friend Declarations 1031
inline namespace | Transparently Nested Namespaces 1055
noexcept Specifier | The noexcept Function Specification 1085
Ref-Qualifiers | Reference-Qualified Member Functions 1153
union '11 | Unions Having Non-Trivial Members 1174

3.2 C++14 1182
auto Return | Function (auto) Return-Type Deduction 1182
decltype(auto) | Deducing Types Using decltype Semantics 1205

Afterword: Looking Back and Looking Forward 1215

Glossary 1217
Bibliography 1281
Index 1305


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