Modern C++ Design: Generic Programming and Design Patterns Applied By UAndrei AlexandrescuU

Transcription

1 I RuBoard UTable of ContentsU Modern C++ Design: Generic Programming and Design Patterns Applied By UAndrei AlexandrescuU : Publisher Addison Wesley : Pub Date February 01, 2001 : ISBN Pages : 352 UCopyrightU UForewordU UForewordU UPrefaceU UAudienceU ULokiU UOrganizationU UAcknowledgmentsU UPart I. TechniquesU UChapter 1. Policy-Based Class DesignU USection 1.1. The Multiplicity of Software DesignU USection 1.2. The Failure of the Do-It-All InterfaceU USection 1.3. Multiple Inheritance to the Rescue?U USection 1.4. The Benefit of TemplatesU USection 1.5. Policies and Policy ClassesU USection 1.6. Enriched PoliciesU USection 1.7. Destructors of Policy ClassesU USection 1.8. Optional Functionality Through Incomplete InstantiationU USection 1.9. Combining Policy ClassesU USection Customizing Structure with Policy ClassesU USection Compatible and Incompatible PoliciesU USection Decomposing a Class into PoliciesU USection SummaryU UChapter 2. TechniquesU

2 USection 2.1. Compile-Time AssertionsU USection 2.2. Partial Template SpecializationU USection 2.3. Local ClassesU USection 2.4. Mapping Integral Constants to TypesU USection 2.5. Type-to-Type MappingU USection 2.6. Type SelectionU USection 2.7. Detecting Convertibility and Inheritance at Compile Time U USection 2.8. A Wrapper Around type_infou USection 2.9. NullType and EmptyTypeU USection Type TraitsU USection SummaryU UChapter 3. Typelists U USection 3.1. The Need for TypelistsU USection 3.2. Defining TypelistsU USection 3.3. Linearizing Typelist CreationU USection 3.4. Calculating LengthU USection 3.5. Intermezzo U USection 3.6. Indexed AccessU USection 3.7. Searching TypelistsU USection 3.8. Appending to TypelistsU USection 3.9. Erasing a Type from a Typelist U USection Erasing DuplicatesU USection Replacing an Element in a TypelistU USection Partially Ordering Typelists U USection Class Generation with TypelistsU USection SummaryU USection Typelist Quick FactsU UChapter 4. Small-Object AllocationU USection 4.1. The Default Free Store Allocator U USection 4.2. The Workings of a Memory Allocator U USection 4.3. A Small-Object AllocatorU USection 4.4. ChunksU USection 4.5. The Fixed-Size AllocatorU USection 4.6. The SmallObjAllocator Class U USection 4.7. A Hat TrickU USection 4.8. Simple, Complicated, Yet Simple in the EndU USection 4.9. AdministriviaU USection SummaryU USection Small-Object Allocator Quick FactsU UPart II. ComponentsU UChapter 5. Generalized FunctorsU USection 5.1. The Command Design PatternU

3 USection 5.2. Command in the Real WorldU USection 5.3. C++ Callable EntitiesU USection 5.4. The Functor Class Template SkeletonU USection 5.5. Implementing the Forwarding Functor::operator()U USection 5.6. Handling FunctorsU USection 5.7. Build One, Get One FreeU USection 5.8. Argument and Return Type ConversionsU USection 5.9. Handling Pointers to Member FunctionsU USection Binding U USection Chaining RequestsU USection Real-World Issues I: The Cost of Forwarding FunctionsU USection Real-World Issues II: Heap AllocationU USection Implementing Undo and Redo with FunctorU USection SummaryU USection Functor Quick FactsU UChapter 6. Implementing SingletonsU USection 6.1. Static Data + Static Functions!= SingletonU USection 6.2. The Basic C++ Idioms Supporting SingletonsU USection 6.3. Enforcing the Singleton's UniquenessU USection 6.4. Destroying the SingletonU USection 6.5. The Dead Reference ProblemU USection 6.6. Addressing the Dead Reference Problem (I): The Phoenix SingletonU USection 6.7. Addressing the Dead Reference Problem (II): Singletons with LongevityU USection 6.8. Implementing Singletons with LongevityU USection 6.9. Living in a Multithreaded WorldU USection Putting It All Together U USection Working with SingletonHolderU USection SummaryU USection SingletonHolder Class Template Quick FactsU UChapter 7. Smart PointersU USection 7.1. Smart Pointers 101U USection 7.2. The DealU USection 7.3. Storage of Smart PointersU USection 7.4. Smart Pointer Member FunctionsU USection 7.5. Ownership-Handling StrategiesU USection 7.6. The Address-of OperatorU USection 7.7. Implicit Conversion to Raw Pointer TypesU USection 7.8. Equality and InequalityU USection 7.9. Ordering ComparisonsU USection Checking and Error ReportingU USection Smart Pointers to const and const Smart PointersU USection ArraysU

4 USection Smart Pointers and MultithreadingU USection Putting It All Together U USection SummaryU USection SmartPtr Quick FactsU UChapter 8. Object FactoriesU USection 8.1. The Need for Object FactoriesU USection 8.2. Object Factories in C++: Classes and ObjectsU USection 8.3. Implementing an Object FactoryU USection 8.4. Type IdentifiersU USection 8.5. GeneralizationU USection 8.6. Minutiae U USection 8.7. Clone FactoriesU USection 8.8. Using Object Factories with Other Generic ComponentsU USection 8.9. SummaryU USection Factory Class Template Quick FactsU USection CloneFactory Class Template Quick FactsU UChapter 9. Abstract FactoryU USection 9.1. The Architectural Role of Abstract FactoryU USection 9.2. A Generic Abstract Factory InterfaceU USection 9.3. Implementing AbstractFactoryU USection 9.4. A Prototype-Based Abstract Factory ImplementationU USection 9.5. SummaryU USection 9.6. AbstractFactory and ConcreteFactory Quick FactsU UChapter 10. Visitor U USection Visitor Basics U USection Overloading and the Catch-All FunctionU USection An Implementation Refinement: The Acyclic VisitorU USection A Generic Implementation of Visitor U USection Back to the "Cyclic" Visitor U USection Hooking VariationsU USection SummaryU USection Visitor Generic Components Quick FactsU UChapter 11. Multimethods U USection What Are Multimethods?U USection When Are Multimethods Needed?U USection Double Switch-on-Type: Brute ForceU USection The Brute-Force Approach AutomatedU USection Symmetry with the Brute-Force DispatcherU USection The Logarithmic Double DispatcherU USection FnDispatcher and SymmetryU USection Double Dispatch to FunctorsU USection Converting Arguments: static_cast or dynamic_cast?u

5 USection Constant-Time Multimethods: Raw SpeedU USection BasicDispatcher and BasicFastDispatcher as PoliciesU USection Looking ForwardU USection SummaryU USection Double Dispatcher Quick FactsU UAppendix A Minimalist Multithreading LibraryU USection A.1. A Critique of Multithreading U USection A.2. Loki's ApproachU USection A.3. Atomic Operations on Integral Types U USection A.4. MutexesU USection A.5. Locking Semantics in Object-Oriented ProgrammingU USection A.6. Optional volatile Modifier U USection A.7. Semaphores, Events, and Other Good ThingsU USection A.8. SummaryU UBibliographyU I l@ve RuBoard