泛型编程与STL

PrefacePart I Introduction to Generic ProgrammingChapter 1 A Tour of the STL 1.1 A Simple Example 1.2 SummaryChapter 2 Algorithms and Ranges 2.1 Linear Search 2.2 Concepts and Modeling 2.3 Iterators 2.4 Refinement 2.5 SummaryChapter 3 More about Iterators 3.1 Iterator Traits and Associated Types 3.2 Defining New Components 3.3 Summary

PrefacePart I Introduction to Generic ProgrammingChapter 1 A Tour of the STL 1.1 A Simple Example 1.2 SummaryChapter 2 Algorithms and Ranges 2.1 Linear Search 2.2 Concepts and Modeling 2.3 Iterators 2.4 Refinement 2.5 SummaryChapter 3 More about Iterators 3.1 Iterator Traits and Associated Types 3.2 Defining New Components 3.3 SummaryChapter 4 Function Objects 4.1 Generalizing Linear Search 4.2 Function Object Concepts 4.3 Function Object Adaptors 4.4 Predefined Function Objects 4.5 SummaryChapter 5 Containers 5.1 A Simple Container 5.2 Container Concepts 5.3 Variable Size Container Concepts 5.4 SummaryPart II Reference Manual: STL ConceptsChapter 6 Basic Concepts 6.1 Assignable 6.2 Default Constructible 6.3 Equality Comparable 6.4 OrderingChapter 7 Iterators 7.1 Trivial Iterator 7.2 Input Iterator 7.3 Output Iterator 7.4 Forward Iterator 7.5 Bidirectional Iterator 7.6 Random Access IteratorChapter 8 Function Objects 8.1 Basic Function Objects 8.2 Adaptable Function Objects 8.3 Predicates 8.4. Specialized ConceptsChapter 9 Containers 9.1 General Container Concepts 9.2 Sequences 9.3 Associative Containers 9.4 AllocatorPart III Reference Manual: Algorithms and ClassesChapter 10 Basic Components 10.1 pair 10.2 Iterator Primitives 10.3 allocator 10.4 Memory Management Primitives 10.5 Temporary BuffersChapter 11 Nonmutating Algorithms 11.1 Linear Search 11.2 Subsequence Matching 11.3 Counting Elements 11.4 for_each 11.5 Comparing Two Ranges 11.6 Minimum and MaximumChapter 12 Basic Mutating Algorithms 12.1 Copying Ranges 12.2 Swapping Elements 12.3 transform 12.4 Replacing Elements 12.5 Filling Ranges 12.6 Removing Elements 12.7 Permuting Algorithms 12.8 Partitions 12.9 Random Shuffling and Sampling 12.10 Generalized Numeric AlgorithmsChapter 13 Sorting and Searching 13.1 Sorting Ranges 13.2 Operations on Sorted Ranges 13.3 Heap OperationsChapter 14 Iterator Classes 14.1 Insert Iterators 14.2 Stream Iterators 14.3 reverse_iterator 14.4 raw_storage_iteratorChapter 15 Function Object Classes 15.1 Function Object Base Classes 15.2 Arithmetic Operations 15.3 Comparisons 15.4 Logical Operations 15.5 Identity and Projection 15.6 Specialized Function Objects 15.7 Member Function Adaptors 15.8 Other AdaptorsChapter 16 Container Classes 16.1 Sequences 16.2 Associative Containers 16.3 Container AdaptorsAppendix A Portability and Standardization A. 1 Language Changes A.2 Library Changes A.3 Naming and PackagingBibliographyIndex

许多程序员可能并不知道，C++不仅是一个面向对象程序语言，它还适用于泛型编程(generic programming)。这项技术可以大大增强你的能力，协助你写出高效率并可重复运用的软件组件(software components)。
本书由知名的C++专家Matthew H.Austern执笔，引导你进入泛型编程思维模型，并将你带往此一模型的最重要成品：C++ Standard Template Library(STL)。本书揭示STL的奥秘，告诉你STL不仅仅是一组方便运用的容器类(container classes)。对于泛型组件和可交互作用的组件而言，STL是一个具备扩充能力的框架(framework)。
本书阐述了泛型编程的中心思想：concepts、modeling、refinement，并为你展示这些思想如何导出STL的基础概念：iterators、containers、function Objects。循此路线，你可以把STL想像为一个由concepts(而非明确之functions或classes)组成的程序库。你将学习其正式结构并因此获得其潜在威力所带采的完整优势。

作者简介
Matthew H.Austern：拥有博士学位，曾于MIT和UC Berkeley做研究。现任职于Silicon Graphics编译器团队，是SGI STL的主要作者。他是Dr.Dobb's Journal和C++Report两本刊物的撰稿人，并主持newsgroup comp.std.c++，同时也是ISO/ANSI C++标准委员会的一位活跃成员。

本书由知名的C++专家Matthew H.Austern执笔，引导你进入泛型编程思维模型，并将你带往此一模型的最重要成品：C++ Standard Template Library(STL)。本书揭示STL的奥秘，告诉你STL不仅仅是一组方便运用的容器类(container classes)。对于泛型组件和可交互作用的组件而言，STL是一个具备扩充能力的框架(framework)。