Home > Store

C++ Templates: The Complete Guide

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

C++ Templates: The Complete Guide

Book

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

eBook (Watermarked)

  • Your Price: $63.99
  • About Watermarked eBooks
  • This PDF will be accessible from your Account page after purchase and requires the free Adobe® Reader® software to read it.

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

    Watermarked eBook FAQ

Description

  • Copyright 2003
  • Dimensions: 7-3/8" x 9-1/4"
  • Pages: 560
  • Edition: 1st
  • Book
  • ISBN-10: 0-201-73484-2
  • ISBN-13: 978-0-201-73484-3
  • eBook (Watermarked)
  • ISBN-10: 0-672-33412-7
  • ISBN-13: 978-0-672-33412-2

This book will be the next C++ classic. Although templates have been part of C++ for well over a decade, they still lead to misunderstanding, misuse, and controversy. At the same time, they are increasingly found to be powerful instruments for the development of cleaner, faster, and smarter software. This has made templates one of the hottest topics in the C++ community. This book will be both a complete reference as well as a tutorial. It will emphasize the practical use of templates, and will include real-world examples. Every working C++ programmer will need a copy of this book for his or her library.

Sample Content

Online Sample Chapters

C++ Templates: Metaprograms

Templates and Inheritance Interacting in C++

Downloadable Sample Chapter

Click below for Sample Chapter(s) related to this title:
Sample Chapter 17

Sample Pages

Download the sample pages (includes Chapter 16 and Index)

Table of Contents



Preface.


Acknowledgments.


1. About This Book.

What You Should Know Before Reading This Book.

Overall Structure of the Book.

How to Read This Book.

Some Remarks About Programming Style.

The Standard versus Reality.

Example Code and Additional Information.

Feedback.

I. THE BASICS.

2. Function Templates.

A First Look at Function Templates.

Defining the Template.

Using the Template.

Argument Deduction.

Template Parameters.

Overloading Function Templates.

Summary.

3. Class Templates.

Implementation of Class Template Stack.

Declaration of Class Templates.

Implementation of Member Functions.

Use of Class Template Stack.

Specializations of Class Templates.

Partial Specialization.

Default Template Arguments.

Summary.

4. Nontype Template Parameters.

Nontype Class Template Parameters.

Nontype Function Template Parameters.

Restrictions for Nontype Template Parameters.

Summary.

5. Tricky Basics.

Keyword typename.

Using this->.

Member Templates.

Template Template Parameters.

Zero Initialization.

Using String Literals as Arguments for Function Templates.

Summary.

6. Using Templates in Practice.

The Inclusion Model.

Linker Errors.

Templates in Header Files.

Explicit Instantiation.

Example of Explicit Instantiation.

Combining the Inclusion Model and Explicit Instantiation.

The Separation Model.

The Keyword export.

Limitations of the Separation Model.

Preparing for the Separation Model.

Templates and inline.

Precompiled Headers.

Debugging Templates.

Decoding the Error Novel.

Shallow Instantiation.

Long Symbols.

Tracers.

Oracles.

Archetypes.

Afternotes.

Summary.

7. Basic Template Terminology.

“Class Template” or “Template Class”?

Instantiation and Specialization.

Declarations versus Definitions.

The One-Definition Rule.

Template Arguments versus Template Parameters.

II. TEMPLATES IN DEPTH.

8. Fundamentals in Depth.

Parameterized Declarations.

Virtual Member Functions.

Linkage of Templates.

Primary Templates.

Template Parameters.

Type Parameters.

Nontype Parameters.

Template Template Parameters.

Default Template Arguments.

Template Arguments.

Function Template Arguments.

Type Arguments.

Nontype Arguments.

Template Template Arguments.

Equivalence.

Friends.

Friend Functions.

Friend Templates.

Afternotes.

9. Names in Templates.

Name Taxonomy.

Looking Up Names.

Argument-Dependent Lookup.

Friend Name Injection.

Injected Class Names.

Parsing Templates.

Context Sensitivity in Nontemplates.

Dependent Names of Types.

Dependent Names of Templates.

Dependent Names in Using-Declarations.

ADL and Explicit Template Arguments.

Derivation and Class Templates.

Nondependent Base Classes.

Dependent Base Classes.

Afternotes.

10. Instantiation.

On-Demand Instantiation.

Lazy Instantiation.

The C++ Instantiation Model.

Two-Phase Lookup.

Points of Instantiation.

The Inclusion and Separation Models.

Looking Across Translation Units.

Examples.

Implementation Schemes.

Greedy Instantiation.

Queried Instantiation.

Iterated Instantiation.

Explicit Instantiation.

Afternotes.

11. Template Argument Deduction.

The Deduction Process.

Deduced Contexts.

Special Deduction Situations.

Allowable Argument Conversions.

Class Template Parameters.

Default Call Arguments.

The Barton-Nackman Trick.

Afternotes.

12. Specialization and Overloading.

When “Generic Code” Doesn't Quite Cut It.

Transparent Customization.

Semantic Transparency.

Overloading Function Templates.

Signatures.

Partial Ordering of Overloaded Function Templates.

Formal Ordering Rules.

Templates and Nontemplates.

Explicit Specialization.

Full Class Template Specialization.

Full Function Template Specialization.

Full Member Specialization.

Partial Class Template Specialization.

Afternotes.

13. Future Directions.

The Angle Bracket Hack.

Relaxed typename Rules.

Default Function Template Arguments.

String Literal and Floating-Point Template Arguments.

Relaxed Matching of Template Template Parameters.

Typedef Templates.

Partial Specialization of Function Templates.

The typeof Operator.

Named Template Arguments.

Static Properties.

Custom Instantiation Diagnostics ..

Overloaded Class Templates.

List Parameters.

Layout Control.

Initializer Deduction.

Function Expressions.

Afternotes.

III. TEMPLATES AND DESIGN.

14. The Polymorphic Power of Templates.

Dynamic Polymorphism.

Static Polymorphism.

Dynamic versus Static Polymorphism.

New Forms of Design Patterns.

Generic Programming.

Afternotes.

15. Traits and Policy Classes.

An Example: Accumulating a Sequence.

Fixed Traits.

Value Traits.

Parameterized Traits.

Policies and Policy Classes.

Traits and Policies: What's the Difference?

Member Templates versus Template Template Parameters.

Combining Multiple Policies and/or Traits.

Accumulation with General Iterators.

Type Functions.

Determining Element Types.

Determining Class Types.

References and Qualifiers.

Promotion Traits.

Policy Traits.

Read-only Parameter Types.

Copying, Swapping, and Moving.

Afternotes.

16. Templates and Inheritance.

Named Template Arguments.

The Empty Base Class Optimization (EBCO).

Layout Principles.

Members as Base Classes.

The Curiously Recurring Template Pattern (CRTP).

Parameterized Virtuality.

Afternotes.

17. Metaprograms.

A First Example of a Metaprogram.

Enumeration Values versus Static Constants.

A Second Example: Computing the Square Root.

Using Induction Variables.

Computational Completeness.

Recursive Instantiation versus Recursive Template Arguments.

Using Metaprograms to Unroll Loops.

Afternotes.

18. Expression Templates.

Temporaries and Split Loops.

Encoding Expressions in Template Arguments.

Operands of the Expression Templates.

The Array Type.

The Operators.

Review.

Expression Templates Assignments.

Performance and Limitations of Expression Templates.

Afternotes.

IV. ADVANCED APPLICATIONS.

19. Type Classification.

Determining Fundamental Types.

Determining Compound Types.

Identifying Function Types.

Enumeration Classification with Overload Resolution.

Determining Class Types.

Putting It All Together.

Afternotes.

20. Smart Pointers.

Holders and Trules.

Protecting Against Exceptions.

Holders.

Holders as Members.

Resource Acquisition Is Initialization.

Holder Limitations.

Copying Holders.

Copying Holders Across Function Calls.

Trules.

Reference Counting.

Where Is the Counter?

Concurrent Counter Access.

Destruction and Deallocation.

The CountingPtr Template.

A Simple Noninvasive Counter.

A Simple Invasive Counter Template.

Constness.

Implicit Conversions.

Comparisons.

Afternotes.

21. Tuples.

Duos.

Recursive Duos.

Number of Fields.

Type of Fields.

Value of Fields.

Tuple Construction.

Afternotes.

22. Function Objects and Callbacks.

Direct, Indirect, and Inline Calls.

Pointers and References to Functions.

Pointer-to-Member Functions.

Class Type Functors.

A First Example of Class Type Functors.

Type of Class Type Functors.

Specifying Functors.

Functors as Template Type Arguments.

Functors as Function Call Arguments.

Combining Function Call Parameters and Template Type Parameters.

Functors as Nontype Template Arguments.

Function Pointer Encapsulation.

Introspection.

Analyzing a Functor Type.

Accessing Parameter Types.

Encapsulating Function Pointers.

Function Object Composition.

Simple Composition.

Mixed Type Composition.

Reducing the Number of Parameters.

Value Binders.

Selecting the Binding.

Bound Signature.

Argument Selection.

Convenience Functions.

Functor Operations: A Complete Implementation.

Afternotes.

APPENDIXES.

A: The One-Definition Rule.

Translation Units.

Declarations and Definitions.

The One-Definition Rule in Detail.

One-per-Program Constraints.

One-per-Translation Unit Constraints.

Cross-Translation Unit Equivalence Constraints.

B: Overload Resolution.

When Does Overload Resolution Kick In?

Simplified Overload Resolution.

The Implied Argument for Member Functions.

Refining the Perfect Match.

Overloading Details.

Prefer Nontemplates.

Conversion Sequences.

Pointer Conversions.

Functors and Surrogate Functions.

Other Overloading Contexts.

Bibliography.
Newsgroups.
Books and Web Sites.
Glossary.
Index. 0201734842T10072002

Preface

The idea of templates in C++ is more than ten years old; they were already documented in 1990 in the so-called "ARM" (see page 653) and had been described before that in more specialized publications. However, well over a decade later we found no book on the market that concentrates on the fundamental concepts and advanced techniques of this fascinating, complex, and powerful C++ feature. We wanted to address that issue and decided to write the book about templates (with perhaps a slight lack of humility).

However, we approached the task with different backgrounds and with different intention. David, as an experienced compiler implementer and member of the C++ Standard Committee Core Language Working Group was interested in an exact and detailed description of all the power (and problems) of templates based on the actual C++ Standard. Nico, as an "ordinary" application programmer and member of the C++ Standard Committee Library Working Group was interested to understand all the techniques of templates in a way that he could use and benefit from them. But we both wanted to share this knowledge with you, the reader, and the whole community to help to avoid further misunderstanding, confusion, and/or apprehension.

As a consequence, you will see both conceptual introductions with day-to-day examples and detailed descriptions of the exact behavior of templates. Starting from the basic principles of templates and working up to the "art of template programming" you will discover (or rediscover) techniques such as static polymorphism, policy classes, metaprogramming, and expression templates. You will also gain a deeper understanding of the C++ standard library, in which almost all code involves templates. We learned a lot. And we hope you will do the same with as much fun as we had writing this book. Enjoy!

Acknowledgments

This book presents ideas, concepts, solutions, and examples from many sources. In a way it does not seem fair that our names are the only ones on the cover. We'd like to thank all the people and companies who helped and supported us during the past few years. First, we'd like to thank all the reviewers and everyone else who gave us their opinion on early manuscripts. These people endow the book with a quality it would never have had without their input. The reviewers for this book were Kyle Blaney, Thomas Gschwind, Dennis Mancl, Patrick McKillen, and Jan Christiaan van Winkel. Special thanks to Dietmar Kuhl who meticulously reviewed and edited the whole book. His feedback was an incredible contribution to the quality of this book. We'd also like to thank all the people and companies who gave us the opportunity to test our examples on different platforms with different compilers. Many thanks to the Edison Design Groupfor their great compiler and their support. It was a big help during the standardization process and the writing of this book. Many thanks also go to all the developers of the free GNU and egcs compilers (Jason Merrill was especially responsive), and to Microsoft for an evaluation version of Visual C++ (Jonathan Caves, Herb Sutter and Jason Shirk were our contacts there).

Much of the existing "C++ Wisdom" was collectively created by the online C++ community. Most of that comes from the moderated Usenet groups comp.lang.c++.moderated and comp.std.c++. We are therefore especially indebted to the active moderators of those groups, who keep the discussions useful and constructive. We also much appreciate all those who over the years have taken the time to describe and explain their ideas for us all to share.The Addison Wesley team did another great job. We are most indebted to Debbie Lafferty (our editor) for her gentle prodding, good advice, and relentless hard work in support of this book. We're grateful also to Marina Lang who first sponsored this book within Addison Wesley. Susan Winer contributed an early round of editing that helped shape our later work.

Nico's Acknowledgments

My first personal thanks goes with a lot kisses to my family: Ulli, Lucas, Anica, and Frederic did support this book with a lot patience, consideration, and spur. In addition, I want to thank David. His expertise turned out to be incredible. But, his patience was even better (sometimes I ask really silly questions). It is a lot of fun to work with him.

David's Acknowledgments

My wife Karina has been instrumental in this book coming to a conclusion and I am immensely grateful for the role that she plays in my life. Writing "in your spare time" quickly becomes erratic when many other activities vie for your schedule. Karina helped me to manage that schedule, taught me to say "No" in order to make the time needed to make regular progress in the writing process,and above all was amazingly supportive of this project. I thank God every day for her friendship and love.

I'm also tremendously grateful to have been able to work with Nico. Besides his directly visible contributions to the text, his experience and discipline moved us from my pitiful doodling to a well organized production.John "Mr. Template" Spicer and Steve "Mr. Overload" Adamczyk are wonderful friends and colleagues, but in my opinion they are (together) also the ultimate authority regarding the core C++ language. They clarified many of the trickier issues described in this book, and should you find an error in the description of a C++ language element, it is almost certainly attributable to my failing toconsult with them.

Finally, I want to express my appreciation to those who were supportive of this project without necessarily contributing to it directly (the power of cheer cannot be understated). First are my parents: Their love for me and their encouragements make all the difference. And then, there are the numerous friends constantly asking "How is the book going?"; they too were a source of encouragement: Michael Beckmann, Brett and Julie Beene, Jarran Carr, Simon Chang, Ho and Sarah Cho, Christophe De Dinechin, Peter and Ewa Deelman, Neil and Tammy Eberle, Sassan Hazeghi, Vikram Kumar, Jim and Lindsay Long, Franklin Luk, Richard and Marianna Morgan, Ragu Raghavendra, Jim and Phuong Sharp, Gregg Vaughn, and John Wiegley.



0201734842P07172002

Index

Click below to download the Index file related to this title:
Index

Updates

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.

Overview


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.

Surveys

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.

Newsletters

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.

Security


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

Children


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

Marketing


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.

Choice/Opt-out


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.

Links


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