C++ Templates

The Complete Guide

Inbunden, Engelska, 2017

533 kr

Beställningsvara. Skickas inom 7-10 vardagar. Fri frakt över 249 kr.

Beskrivning

Templates are among the most powerful features of C++, but they remain misunderstood and underutilized, even as the C++ language and development community have advanced. In C++ Templates, Second Edition, three pioneering C++ experts show why, when, and how to use modern templates to build software that’s cleaner, faster, more efficient, and easier to maintain.

Now extensively updated for the C++11, C++14, and C++17 standards, this new edition presents state-of-the-art techniques for a wider spectrum of applications. The authors provide authoritative explanations of all new language features that either improve templates or interact with them, including variadic templates, generic lambdas, class template argument deduction, compile-time if, forwarding references, and user-defined literals. They also deeply delve into fundamental language concepts (like value categories) and fully cover all standard type traits.

The book starts with an insightful tutorial on basic concepts and relevant language features. The remainder of the book serves as a comprehensive reference, focusing first on language details and then on coding techniques, advanced applications, and sophisticated idioms. Throughout, examples clearly illustrate abstract concepts and demonstrate best practices for exploiting all that C++ templates can do.

Understand exactly how templates behave, and avoid common pitfalls
Use templates to write more efficient, flexible, and maintainable software
Master today’s most effective idioms and techniques
Reuse source code without compromising performance or safety
Benefit from utilities for generic programming in the C++ Standard Library
Preview the upcoming concepts feature

The companion website, tmplbook.com, contains sample code and additional updates.

Produktinformation

Utgivningsdatum:2017-11-21
Mått:198 x 234 x 43 mm
Vikt:1 540 g
Format:Inbunden
Språk:Engelska
Antal sidor:832
Upplaga:2
Förlag:Pearson Education
ISBN:9780321714121

Utforska kategorier

Programspråk inom Data och IT

Mer om författaren

David Vandevoorde started programming C++ in the late 1980s. After obtaining a PhD from the Rensselaer Polytechnic Institute, he became technical lead of Hewlett-Packard’s C++ compiler team. In 1999 he joined the Edison Design Group (EDG), whose C++ compiler technology is widely recognized as the industry’s most advanced. He is an active member of the C++ Standard Committee and a moderator of the newsgroup comp.lang.c++.moderated (which he co-founded). He is the author of C++ Solutions, the companion to The C++ Programming Language, 3rd Edition.Nicolai M. Josuttis is well known for his best-selling de-facto standard bookThe C++ Standard Library - A Tutorial and Reference. He is an independent technical consultant who designs object-oriented software for the telecommunications, traffic, finance, and manufacturing industries. He is an active member of the C++ Standard Committee and a partner at System Bauhaus, a German group of prominent object-oriented system development experts. Josuttis has written several other books on object-oriented programming and C++.Douglas Gregor is Senior Swift/C++/Objective-C Compiler Engineer at Apple. He holds a PhD in computer science from Rensselaer Polytechnic Institute, and did post-doctoral work at Indiana University.

Innehållsförteckning

Preface xxiiiAcknowledgments for the Second Edition xxvAcknowledgments for the First Edition xxviiAbout This Book xxixPart I: The Basics 1Chapter 1: Function Templates 31.1 A First Look at Function Templates 31.2 Template Argument Deduction 71.3 Multiple Template Parameters 91.4 Default Template Arguments 131.5 Overloading Function Templates 151.6 But, Shouldn’t We . . . ? 201.7 Summary 21Chapter 2: Class Templates 232.1 Implementation of Class Template Stack 232.2 Use of Class Template Stack 272.3 Partial Usage of Class Templates 292.4 Friends 302.5 Specializations of Class Templates 312.6 Partial Specialization 332.7 Default Class Template Arguments 362.8 Type Aliases382.9 Class Template Argument Deduction 402.10 Templatized Aggregates 432.11 Summary 44Chapter 3: Nontype Template Parameters 453.1 Nontype Class Template Parameters 453.2 Nontype Function Template Parameters 483.3 Restrictions for Nontype Template Parameters 493.4 Template Parameter Type auto 503.5 Summary 54Chapter 4: Variadic Templates 554.1 Variadic Templates 554.2 Fold Expressions 584.3 Application of Variadic Templates 604.4 Variadic Class Templates and Variadic Expressions 614.5 Summary 66Chapter 5: Tricky Basics 675.1 Keyword typename 675.2 Zero Initialization 685.3 Using this-> 705.4 Templates for Raw Arrays and String Literals 715.5 Member Templates 745.6 Variable Templates 805.7 Template Template Parameters 835.8 Summary 89Chapter 6: Move Semantics and enable_if<> 916.1 Perfect Forwarding 916.2 Special Member Function Templates 956.3 Disable Templates with enable_if<> 986.4 Using enable_if<> 996.5 Using Concepts to Simplify enable_if<> Expressions 1036.6 Summary 104Chapter 7: By Value or by Reference? 1057.1 Passing by Value 1067.2 Passing by Reference 1087.3 Using std::ref() and std::cref() 1127.4 Dealing with String Literals and Raw Arrays 1157.5 Dealing with Return Values 1177.6 Recommended Template Parameter Declarations 1187.7 Summary 121Chapter 8: Compile-Time Programming 1238.1 Template Metaprogramming 1238.2 Computing with constexpr 1258.3 Execution Path Selection with Partial Specialization 1278.4 SFINAE (Substitution Failure Is Not An Error) 1298.5 Compile-Time if 1348.6 Summary 135Chapter 9: Using Templates in Practice 1379.1 The Inclusion Model 1379.2 Templates and inline 1409.3 Precompiled Headers 1419.4 Decoding the Error Novel 1439.5 Afternotes 1499.6 Summary 150Chapter 10: Basic Template Terminology 15110.1 “Class Template” or “Template Class”? 15110.2 Substitution, Instantiation, and Specialization 15210.3 Declarations versus Definitions 15310.4 The One-Definition Rule 15410.5 Template Arguments versus Template Parameters 15510.6 Summary 156Chapter 11: Generic Libraries 15711.1 Callables 15711.2 Other Utilities to Implement Generic Libraries 16411.3 Perfect Forwarding Temporaries 16711.4 References as Template Parameters 16711.5 Defer Evaluations 17111.6 Things to Consider When Writing Generic Libraries 17211.7 Summary 173Part II: Templates in Depth 175Chapter 12: Fundamentals in Depth 17712.1 Parameterized Declarations 17712.2 Template Parameters 18512.3 Template Arguments 19212.4 Variadic Templates 20012.5 Friends 20912.6 Afternotes 213Chapter 13: Names in Templates 21513.1 Name Taxonomy 21513.2 Looking Up Names 21713.3 Parsing Templates 22413.4 Inheritance and Class Templates 23613.5 Afternotes 240Chapter 14: Instantiation 24314.1 On-Demand Instantiation 24314.2 Lazy Instantiation 24514.3 The C++ Instantiation Model 24914.4 Implementation Schemes 25514.5 Explicit Instantiation 26014.6 Compile-Time if Statements 26314.7 In the Standard Library 26514.8 Afternotes 266Chapter 15: Template Argument Deduction 26915.1 The Deduction Process 26915.2 Deduced Contexts 27115.3 Special Deduction Situations 27315.4 Initializer Lists 27415.5 Parameter Packs 27515.6 Rvalue References 27715.7 SFINAE (Substitution Failure Is Not An Error) 28415.8 Limitations of Deduction 28615.9 Explicit Function Template Arguments 29115.10 Deduction from Initializers and Expressions 29315.11 Alias Templates 31215.12 Class Template Argument Deduction 31315.13 Afternotes 321Chapter 16: Specialization and Overloading 32316.1 When “Generic Code” Doesn’t Quite Cut It 32316.2 Overloading Function Templates 32616.3 Explicit Specialization 33816.4 Partial Class Template Specialization 34716.5 Partial Variable Template Specialization 35116.6 Afternotes 352Chapter 17: Future Directions 35317.1 Relaxed typename Rules 35417.2 Generalized Nontype Template Parameters 35417.3 Partial Specialization of Function Templates 35617.4 Named Template Arguments 35817.5 Overloaded Class Templates 35917.6 Deduction for Nonfinal Pack Expansions 36017.7 Regularization of void 36117.8 Type Checking for Templates 36117.9 Reflective Metaprogramming 36317.10 Pack Facilities 36517.11 Modules 366Part III: Templates and Design 367Chapter 18: The Polymorphic Power of Templates 36918.1 Dynamic Polymorphism 36918.2 Static Polymorphism 37218.3 Dynamic versus Static Polymorphism 37518.4 Using Concepts 37718.5 New Forms of Design Patterns 37918.6 Generic Programming 38018.7 Afternotes 383Chapter 19: Implementing Traits 38519.1 An Example: Accumulating a Sequence 38519.2 Traits versus Policies and Policy Classes 39419.3 Type Functions 40119.4 SFINAE-Based Traits 41619.5 IsConvertibleT 42819.6 Detecting Members 43119.7 Other Traits Techniques 44019.8 Type Classification 44819.9 Policy Traits 45819.10 In the Standard Library 46119.11 Afternotes 462Chapter 20: Overloading on Type Properties 46520.1 Algorithm Specialization 46520.2 Tag Dispatching 46720.3 Enabling/Disabling Function Templates 46920.4 Class Specialization 47720.5 Instantiation-Safe Templates 48220.6 In the Standard Library 48720.7 Afternotes 488Chapter 21: Templates and Inheritance 48921.1 The Empty Base Class Optimization (EBCO) 48921.2 The Curiously Recurring Template Pattern (CRTP) 49521.3 Mixins 50821.4 Named Template Arguments 51221.5 Afternotes 515Chapter 22: Bridging Static and Dynamic Polymorphism 51722.1 Function Objects, Pointers, and std::function<> 51722.2 Generalized Function Pointers 51922.3 Bridge Interface 52222.4 Type Erasure 52322.5 Optional Bridging 52522.6 Performance Considerations 52722.7 Afternotes 528Chapter 23: Metaprogramming 52923.1 The State of Modern C++ Metaprogramming 52923.2 The Dimensions of Reflective Metaprogramming 53723.3 The Cost of Recursive Instantiation 53923.4 Computational Completeness 54223.5 Recursive Instantiation versus Recursive Template Arguments 54223.6 Enumeration Values versus Static Constants 54323.7 Afternotes 545Chapter 24: Typelists 54924.1 Anatomy of a Typelist 54924.2 Typelist Algorithms 55124.3 Nontype Typelists 56624.4 Optimizing Algorithms with Pack Expansions 56924.5 Cons-style Typelists 57124.6 Afternotes 573Chapter 25: Tuples 57525.1 Basic Tuple Design 57625.2 Basic Tuple Operations 57925.3 Tuple Algorithms 58125.4 Expanding Tuples 59225.5 Optimizing Tuple 59325.6 Tuple Subscript 59925.7 Afternotes 601Chapter 26: Discriminated Unions 60326.1 Storage 60426.2 Design 60626.3 Value Query and Extraction 61026.4 Element Initialization, Assignment and Destruction 61126.5 Visitors 61726.6 Variant Initialization and Assignment 62426.7 Afternotes 628Chapter 27: Expression Templates 62927.1 Temporaries and Split Loops 63027.2 Encoding Expressions in Template Arguments 63527.3 Performance and Limitations of Expression Templates 64627.4 Afternotes 647Chapter 28: Debugging Templates 65128.1 Shallow Instantiation 65228.2 Static Assertions 65428.3 Archetypes 65528.4 Tracers 65728.5 Oracles 66228.6 Afternotes 662Appendixes 663Appendix A: The One-Definition Rule 663A.1 Translation Units 663A.2 Declarations and Definitions 664A.3 The One-Definition Rule in Detail 665Appendix B: Value Categories 673B.1 Traditional Lvalues and Rvalues 673B.2 Value Categories Since C++11 674B.3 Checking Value Categories with decltype 678B.4 Reference Types 679Appendix C: Overload Resolution 681C.1 When Does Overload Resolution Kick In? 681C.2 Simplified Overload Resolution 682C.3 Overloading Details 688Appendix D: Standard Type Utilities 697D.1 Using Type Traits 697D.2 Primary and Composite Type Categories 702D.3 Type Properties and Operations 709D.4 Type Construction 728D.5 Other Traits 732D.6 Combining Type Traits 734D.7 Other Utilities 737Appendix E: Concepts 739E.1 Using Concepts 739E.2 Defining Concepts 742E.3 Overloading on Constraints 743E.4 Concept Tips 746Bibliography 749Glossary 759Index 771