实例介绍
【实例简介】The C Standard Template Library
【实例截图】
【核心代码】
Module Table
of Contents
Unit One Basic Concepts
Page
1.1..................................................Origin and History of the Standard Template Library
10
1.2......................................................................................................Why use the STL?
12
1.3.................................................................... What is the Standard Template Library?
14
1.4.......................................................................................Foundational C Concepts
20
Unit Two Generic Programming with Templates
Page
2.1........................................................................................................ Why Templates?
27
2.2....................................................................................................Function Templates
29
2.3........................................................................................................ Class Templates
44
2.4............................................................................................. Template Specialization
50
2.5.....................................................................................Default Template Parameters
55
2.6................................................................................ Non-Type Template Parameters
56
2.7.................................................................................Template Template Parameters
61
2.8..................................................................................Other Template Related Topics
63
2.9........................................................................................................ Using Templates
68
2.10........................................................................................... Components of the STL
73
Unit Three Sequential Containers
Page
3.1..................................................................................................................Containers
76
3.2................................................................................................Sequential Containers
81
3.3..................................................................................................The vector Container
82
3.4.............................................................................................….The deque Container
95
3.5.......................................................................................................The list Container
104Introduction
Page 3
3.6..........................................................................................................The string class
110
3.7...................................................................................................The bitset Container
116
3.8...............................................................................................The valarray Container
119
Unit Four Iterators
Page
4.1....................................................................................................What is an Iterator?
124
4.2.....................................................................................................Iterators in the STL
127
4.3.............................................................................................................Input Iterators
137
4.4.......................................................................................................... Output Iterators
139
4.5........................................................................................................Forward Iterators
135
4.6................................................................................................. Bidirectional Iterators
137
4.7........................................................................................... Random Access Iterators
140
4.8................................................................................. Summary of Iterator Operations
151
Unit Five Associative Containers
Page
5.1...............................................................What is an Ordered Associative Container?
153
5.2..................................................................................................... The pair Container
156
5.3.......................................................................................................The set Container
159
5.4............................................................................................... The multiset Container
166
5.5.................................................................................................... The map Container
170
5.6.............................................................................................The multimap Container
173
5.7......................................................................The Unordered Associative Containers
177
5.8...................................................................................The Unordered Map Container
177
Unit Six Adapted Iterators
Page
6.1....................................................................................... What are Iterator Adaptors?
183
6.2...................................................................................... The inserter Iterator Adaptor
185Introduction
Page 4
6.3...................................................................................... The reverse Iterator Adaptor
193
6.4....................................................................................... The stream Iterator Adaptor
195
Unit Seven Adapted Containers
Page
7.1...................................................................................What are Container Adaptors?
203
7.2......................................................................................The stack Container Adaptor
205
7.3.................................................................................... The queue Container Adaptor
207
7.4........................................................................The priority_queue Container Adaptor
209
Unit Eight Functors
Page
8.1.....................................................................................................What is a Functor?
213
8.2...................................................................................................Classifying Functors
224
8.3...........................................................................................Function Pointers Review
231
8.4.................................................................................................... Arithmetic Functors
237
8.5.................................................................................................... Relational Functors
239
8.6.........................................................................................................Logical Functors
241
Unit Nine Function Adaptors
Page
9.1.....................................................................................What are Function Adaptors?
243
9.2....................................................................................The Binder Function Adaptors
244
9.3................................................................................. The Negator Function Adaptors
247
9.4........................................................................................ Member Function Adaptors
251
9.5................................................................................................. Pointers to Functions
255
9.6............................................................................................... User Defined Functors
259Introduction
Page 5
Unit Ten Non-mutating Algorithms
Page
10.1................................................................................................................Algorithms
262
10.2..........................................................................................Non-Mutating Algorithms
265
10.3.................................................................................................................Searching
267
10.4...................................................................................................................Counting
275
10.5............................................................................................................ Max and Min
277
10.6....................................................................................................Comparing ranges
280
Unit Eleven Mutating Algorithms
Page
11.1................................................................................................. Mutating Algorithms
283
11.2.............................................................................................. Filling and Generating
285
11.3..........................................................................................Manipulating Sequences
290
11.4....................................................................................................................Remove
294
11.5....................................................................................................................Replace
302
11.6........................................................................................................ Sort and Merge
304
Unit Twelve Other Algorithms
Page
12.1...........................................................................................................set algorithms
319
12.2........................................................................................................heap algorithms
328
12.3...................................................................................................numeric algorithms
331
Unit Thirteen Utilities
Page
13.1................................................................................................... Memory Allocators
336
13.2...................................................................................... The smart pointer: auto_ptr
338
13.3........................................................................................... The raw storage iterator
340
13.4........................................................................................ Some relational operators
341Introduction
Page 6
Appendix Resources...................................................................................................... Page
A ................................................................................................................. Optimization
344
B ................................................................................................................... Extensions
349
C ...........................................................................................................................Books
354
D ...................................................................................................................... Websites
355
E ..................................................................................................................... Exercises
356Introduction
Page 7
Introduction
About this course
This material is designed to teach experienced C and C programmers
about the Standard Template Library.
Typographical syntax
Examples in this text of commands will appear in bold text and the outp
好例子网口号：伸出你的我的手 — 分享！
相关软件
小贴士
感谢您为本站写下的评论，您的评论对其它用户来说具有重要的参考价值，所以请认真填写。
- 类似“顶”、“沙发”之类没有营养的文字，对勤劳贡献的楼主来说是令人沮丧的反馈信息。
- 相信您也不想看到一排文字/表情墙，所以请不要反馈意义不大的重复字符，也请尽量不要纯表情的回复。
- 提问之前请再仔细看一遍楼主的说明，或许是您遗漏了。
- 请勿到处挖坑绊人、招贴广告。既占空间让人厌烦，又没人会搭理，于人于己都无利。
关于好例子网
本站旨在为广大IT学习爱好者提供一个非营利性互相学习交流分享平台。本站所有资源都可以被免费获取学习研究。本站资源来自网友分享，对搜索内容的合法性不具有预见性、识别性、控制性，仅供学习研究，请务必在下载后24小时内给予删除，不得用于其他任何用途，否则后果自负。基于互联网的特殊性，平台无法对用户传输的作品、信息、内容的权属或合法性、安全性、合规性、真实性、科学性、完整权、有效性等进行实质审查；无论平台是否已进行审查，用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。本站所有资源不代表本站的观点或立场，基于网友分享，根据中国法律《信息网络传播权保护条例》第二十二与二十三条之规定，若资源存在侵权或相关问题请联系本站客服人员，点此联系我们。关于更多版权及免责申明参见 版权及免责申明
网友评论
我要评论