《泛型編程與STL》是2003年11月中國電力出版社出版的圖書，作者是奧斯滕。該書由知名的C++專家Matthew H.Austern執筆，引導你進入泛型編程思維模型，並將你帶往此一模型的最重要成品：C++ Standard Template Library(STL)。本書揭示STL的奧秘，告訴你STL不僅僅是一組方便運用的容器類(container classes)。對於泛型組件和可互動作用的組件而言，STL是一個具備擴充能力的框架(framework)。
基本介紹
- 書名：泛型編程與STL
- 作者：奧斯滕
- ISBN：9787508318059
- 頁數：548
- 定價：58.0
- 出版社：中國電力出版社
- 出版時間：2003-11
- 裝幀：平裝
內容簡介,作者簡介,圖書目錄,
內容簡介
許多程式設計師可能並不知道，C++不僅是一個面向對象程式語言，它還適用於泛型編程(generic programming)。這項技術可以大大增強你的能力，協助你寫出高效率並可重複運用的軟體組件(software components)。
該書闡述了泛型編程的中心思想：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++標準委員會的一位活躍成員。
圖書目錄
Preface
Part I Introduction to Generic Programming
Chapter 1 A Tour of the STL
1.1 A Simple Example
1.2 Summary
Chapter 2 Algorithms and Ranges
2.1 Linear Search
2.2 Concepts and Modeling
2.3 Iterators
2.4 Refinement
2.5 Summary
Chapter 3 More about Iterators
3.1 Iterator Traits and Associated Types
3.2 Defining New Components
3.3 Summary
Chapter 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 Summary
Chapter 5 Containers
5.1 A Simple Container
5.2 Container Concepts
5.3 Variable Size Container Concepts
5.4 Summary
Part II Reference Manual: STL Concepts
Chapter 6 Basic Concepts
6.1 Assignable
6.2 Default Constructible
6.3 Equality Comparable
6.4 Ordering
Chapter 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 Iterator
Chapter 8 Function Objects
8.1 Basic Function Objects
8.2 Adaptable Function Objects
8.3 Predicates
8.4. Specialized Concepts
Chapter 9 Containers
9.1 General Container Concepts
9.2 Sequences
9.3 Associative Containers
9.4 Allocator
Part III Reference Manual: Algorithms and Classes
Chapter 10 Basic Components
10.1 pair
10.2 Iterator Primitives
10.3 allocator
10.4 Memory Management Primitives
10.5 Temporary Buffers
Chapter 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 Maximum
Chapter 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 Algorithms
Chapter 13 Sorting and Searching
13.1 Sorting Ranges
13.2 Operations on Sorted Ranges
13.3 Heap Operations
Chapter 14 Iterator Classes
14.1 Insert Iterators
14.2 Stream Iterators
14.3 reverse_iterator
14.4 raw_storage_iterator
Chapter 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 Adaptors
Chapter 16 Container Classes
16.1 Sequences
16.2 Associative Containers
16.3 Container Adaptors
Appendix A Portability and Standardization
A. 1 Language Changes
A.2 Library Changes
A.3 Naming and Packaging
Bibliography
Index
Part I Introduction to Generic Programming
Chapter 1 A Tour of the STL
1.1 A Simple Example
1.2 Summary
Chapter 2 Algorithms and Ranges
2.1 Linear Search
2.2 Concepts and Modeling
2.3 Iterators
2.4 Refinement
2.5 Summary
Chapter 3 More about Iterators
3.1 Iterator Traits and Associated Types
3.2 Defining New Components
3.3 Summary
Chapter 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 Summary
Chapter 5 Containers
5.1 A Simple Container
5.2 Container Concepts
5.3 Variable Size Container Concepts
5.4 Summary
Part II Reference Manual: STL Concepts
Chapter 6 Basic Concepts
6.1 Assignable
6.2 Default Constructible
6.3 Equality Comparable
6.4 Ordering
Chapter 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 Iterator
Chapter 8 Function Objects
8.1 Basic Function Objects
8.2 Adaptable Function Objects
8.3 Predicates
8.4. Specialized Concepts
Chapter 9 Containers
9.1 General Container Concepts
9.2 Sequences
9.3 Associative Containers
9.4 Allocator
Part III Reference Manual: Algorithms and Classes
Chapter 10 Basic Components
10.1 pair
10.2 Iterator Primitives
10.3 allocator
10.4 Memory Management Primitives
10.5 Temporary Buffers
Chapter 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 Maximum
Chapter 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 Algorithms
Chapter 13 Sorting and Searching
13.1 Sorting Ranges
13.2 Operations on Sorted Ranges
13.3 Heap Operations
Chapter 14 Iterator Classes
14.1 Insert Iterators
14.2 Stream Iterators
14.3 reverse_iterator
14.4 raw_storage_iterator
Chapter 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 Adaptors
Chapter 16 Container Classes
16.1 Sequences
16.2 Associative Containers
16.3 Container Adaptors
Appendix A Portability and Standardization
A. 1 Language Changes
A.2 Library Changes
A.3 Naming and Packaging
Bibliography
Index
