Alexandrescu, Andrei

CERN Document Server

Modern C++ DesignGeneric Programmingand Design Patterns AppliedAndrei Alexandrescu.~Addison-WesleyBoston " San Francisco " New York " Toronto " MontrealLondon " Munich " Paris " MadridCapetown " Sydney + Tokyo " Singapore " Mexico CityContentsForeword by Scott Meyers	xiForeword by John Vlissides xvPreface xviiAcknowledgments xxiPart I TechniquesChapter 1 Policy-Based Class Design1.1 The Multiplicity of Software Design 31.2 The Failure of the Do-It-All Interface1.3 Multiple Inheritance to the Rescue? 51.4 The Benefit of Templates1.5 Policies and Policy Classes 71 .6 Enriched Policies 121 .7 Destructors of Policy Classes 121 .8 Optional Functionality Through Incomplete Instantiation 131.9 CombiningPolicy Classes 141.10 Customizing Structure with Policy Classes 161.11 Compatible and Incompatible Policies 171.12 Decomposing a Class into Policies 191.13 Summary 20Vi ContentsChapter 2	Techniques2.1 Compile-Time Assertions2,2 Partial Template Specialization2.3 Local Classes2.4 Mapping Integral Constants to Types2.5 Type-to-Type Mapping2.6 Type Selection2.7 Detecting Convertibility and Inheritance at Compile Time2.8 A Wrapper Around type-i nfo2.9 NuIlType and EmptyType2.10 Type Traits2.11 SummaryChapter 3 Typelists 493.1 The Need for Typelists 493.2 Defining Typelists 513.3 Linearizing Typelist Creation 523.4 Calculating Length 533.5 Intermezzo 543.6 Indexed Access 553.7 Searching Typelists 563.8 Appending to Typelists 573.9 Erasing a Type from a Typelist 583.10 Erasing Duplicates 593.11 Replacing an Element in a Typelist 603.12 Partially Ordering Typelists 613,13 Class Generation with Typelists 643.14 Summary 743.15 Typel i st Quick Facts 75Chapter 4 Small-Object Allocation4.1 The Default Free Store Allocator4.2 The Workings of a Memory Allocator4.3 A Small-Object Allocator4.4 Chunks4.5 The Fixed-Size Allocator4.6 The Smal 1 objAl 1 ocator Class4.7 A Hat Trick4.8 Simple, Complicated, Yet Simple in the End4.9 Admirtistrivia4.10 Summary4.11 Small-ObjectAllocator Quick Facts232326282931333437394046777878808184878992939494Contents ViiPart 11	Components 97Chapter 5 Generalized Functors 995.1 The CommandDesign Pattern 1005 .2 Command in the Real World 1025 .3 C++ Callable Entities 1035 .4 The Fun ctor Class Template Skeleton 1045 .5 Implementing the Forwarding Functor : :operator() 1085.6 Handling Functors 1105.7 Build One, Get One Free 1125.8 Argument andReturn Type Conversions 1145.9 Handling Pointers to Member Functions 1155.10 Binding 1195.11 Chaining Requests 1225.12 Real-World Issues 1. The Cost of Forwarding Functions 1225.13 Real-World Issues u: Heap Allocation 1245.14 Implementing Undo andRedo with Functor 1255.15 Summary 1265.16 Functor Quick Facts 126Chapter 6 Implementing Singletons 1296,1 Static Data + Static Functions != Singleton 1306.2 The Basic C++ Idioms Supporting Singleton 1316.3 Enforcing the Singleton's Uniqueness 1326.4 Destroying the Singleton 1336.5 The Dead Reference Problem 1356.6 Addressing the Dead Reference Problem (I):The Phoenix Singleton 1376.7 Addressing the Dead Reference Problem (1:C) :Singletons with Longevity 1396.8 Implementing Singletons with Longevity 1426.9 Living in a Multithreaded World 1456.10 Putting It All Together 1486.11 Working with Si ngl etonHoi der 1536.12 Summary 1556.13 51 ngl etonHoi der Class Template Quick Facts 155Chapter 7 Smart Pointers 1577.1 SmartPointers 101 1577.2 The Deal 1587.3 Storage of SmartPointers 1607.4 SmartPointer Member Functions 161viii Contents7.5	Ownership-Handling Strategies7.6 The Address-of Operator7.7 Implicit Conversion to Raw Pointer Types7.8 Equality and Inequality7.9 Ordering Comparisons7.10 Checking and Error Reporting7.11 Smart Pointers to const and const Smart Pointers7.12 Arrays7.13 Smart Pointers and Multithreading7.14 Putting It All Together7.15 Summary7.16 SmartPtr Quick Facts .163170177 .173178181182183184187194194Chapter 8 Object Factories 1978.1 The Need for Object Factories 1988.2 Object Factories in C++: Classes and Objects 2008.3 Implementing an Object Factory 2018.4 Type Identifiers 2068.5 Generalization 2078.6 Minutiae 2108.7 Clone Factories 2118.8 Using Object Factories with Other Generic Components 2158.9 Summary 2168.10 Facto ry Class Template Quick Facts 2168.11 C1 oneFactory Class Template Quick Facts 217Chapter 9 Abstract Factory 2199.1 The Architectural Role of Abstract Factory 2199.2 A Generic Abstract Factory Interface 2239.3 Implementing AbstractFactory 2269.4 A Prototype-Based Abstract Factory Implementation 2289.5 Summary2339.6 AbstractFacto ry and ConcreteFactory Quick Facts 233Chapter 10 Visitor23510.1 Visitor Basics23510.2 Overloading and the Catch-All Function 24210.3 An Implementation Refinement : The Acyclic Visitor 24310.4 A Generic Implementation of Visitor 24810.5 Back to the "Cyclic" Visitor 25510.6 Hooking Variations25810.7 Summary 26010.8 Vi sitor Generic Component Quick Facts 261Contents ixChapter 11	Multimethods 26311.1 What Are Multimethods? 26411.2 When Are Multimethods Needed? 26411.3 Double Switch-on-Type : Brute Force 26511.4 The Brute-Force Approach Automated 26811.5 Symmetry with the Brute-Force Dispatcher 27311.6 The Logarithmic Double Dispatcher 27611.7 FnDi spatcher andSymmetry 28211.8 Double Dispatch to Functors 28211.9 Converting Arguments: stati c_cast or dynami c_cast? 28511.10 Constant-Time Multimethods : Raw Speed 29011.11 Bas-icDispatcherandBasicFastDispatcherasPolicies 29311.12 LookingForward 29411.13 Summary 29611.14 Double Dispatcher Quick Facts 297Appendix A Minimalist Multithreading Library 307.A.1 ACritique o£ Multithreading 302A.2 Loki's Approach 303A.3 Atomic Operations on Integral Types 303A.4 Mutexes 305A.5 Locking Semantics in Object-Oriented Programming 306A.6 Optional volatile Modifier 308A.7 Semaphores, Events, and Other Good Things 309A.8 Summary 309Bibliography 317.

Modern C++ Design: generic programming and design patterns applied

Abstract

Similar works

Full text

Available Versions

CERN Document Server