STL Tutorial and Reference Guide: C++ Programming with the Standard, 2/e(Hardcover) (STL 教學與參考指南：C++ 標準程式設計（第二版）)
David R. Musser, Gillmer J. Derge, Atul Saini
- 出版商: Addison Wesley
- 出版日期: 2001-04-06
- 定價: $1,980
- 售價: 9.0 折 $1,782
- 語言: 英文
- 頁數: 560
- 裝訂: Hardcover
- ISBN: 0201379236
- ISBN-13: 9780201379235
-
相關分類:
C++ 程式語言
立即出貨(限量)
買這商品的人也買了...
-
$1,029Fundamentals of Data Structures in C++ -
計算機組織與設計--軟硬體界面第二版 (Computer Organization & Design, 2/e)$680$537 -
Data Mining: Concepts and Techniques$2,620$2,489 -
FreeHand 10 中文版繪圖新視代$680$578 -
C++ Primer, 3/e 中文版$980$774 -
$970Introduction to Algorithms, 2/e -
Digital Image Processing, 2/e(IE)(美國版ISBN:0201180758)$1,150$1,127 -
Perl 學習手冊 (Learning Perl, 3/e)$580$458 -
LPI Linux 資格檢定 (LPI Linux Certification in a Nutshell)$880$695 -
ASP.NET 程式設計徹底研究$590$466 -
CorelDRAW 11 中文版繪圖 VS 動畫大作戰$550$435 -
數位影像處理 (Digital Image Processing, 2/e)$820$804 -
鳥哥的 Linux 私房菜－伺服器架設篇$750$638 -
鳥哥的 Linux 私房菜─基礎學習篇增訂版$560$476 -
大師談 Java 遊戲設計 (Developing Games in Java)$680$578 -
SCJP‧SCJD 專業認證指南 (Sun Certified Programmer & Developer for Java 2 #310-305 與310-027)$850$723 -
人月神話：軟體專案管理之道 (20 週年紀念版)(The Mythical Man-Month: Essays on Software Engineering, Anniversary Edition, 2/e)$480$379 -
JSP 2.0 技術手冊$750$593 -
建構嵌入式 Linux 系統$780$616 -
$1,078Operating System Principles, 7/e(IE) (美國版ISBN:0471694665－Operating System Concepts, 7/e) (平裝) -
多媒體理論與應用$620$558 -
$950Assembly Language for Intel-Based Computers, 5/e (IE) (美國版ISBN:0132383101) -
$774Concepts of Programming Languages, 8/e(美國版ISBN: 0321493621) -
Project 2007 EPM 專案管理實務$520$442 -
$650Ivor Horton's Beginning Visual C++ 2010 (Paperback)
相關主題
商品描述
Description
The STL Tutorial and Reference Guide is highly acclaimed as the most accessible, comprehensive, and practical introduction to the Standard Template Library (STL). Encompassing a set of C++ generic data structures and algorithms, STL provides reusable, interchangeable components adaptable to many different uses without sacrificing efficiency. Written by authors who have been instrumental in the creation and practical application of STL, STL Tutorial and Reference Guide, Second Edition includes a tutorial, a thorough description of each element of the library, numerous sample applications, and a comprehensive reference. Many new code examples throughout the book illustrate individual concepts and techniques, while larger sample programs demonstrate the use of the STL in real-world C++ software development. 
C++--Intermediate Programming.
Features
-
NEW!
Table Of Contents
Foreword.Foreword to the First Edition.
Preface.
I. TUTORIAL INTRODUCTION TO STL.
1. Introduction. Who Should Read This Book.
What Generic Programming Is and Why It's Important.
How C++ Templates Enable Generic Programming.
The "Code Bloat" Problem with Templates.
Understanding STL's Performance Guarantees.
What Generic Programming Is and Why It's Important.
How C++ Templates Enable Generic Programming.
The "Code Bloat" Problem with Templates.
Understanding STL's Performance Guarantees.
2. Overview of STL Components.
Containers.
Generic Algorithms.
Iterators.
Function Objects.
Adaptors.
Allocators.
Generic Algorithms.
Iterators.
Function Objects.
Adaptors.
Allocators.
3. How STL Differs from Other Libraries.
Extensibility.
Component Interchangeability.
Algorithm/Container Compatibility.
Component Interchangeability.
Algorithm/Container Compatibility.
4. Iterators.
Input Iterators.
Output Iterators.
Forward Iterators.
Bidirectional Iterators.
Random Access Iterators.
The STL Iterator Hierarchy: Combining Algorithms and Containers Efficiently.
Insert Iterators.
Revisiting Input and Output: Stream Iterators.
Specification of Iterator Categories Required by STL Algorithms.
Designing Generic Algorithms.
Why Some Algorithms Require More Powerful Iterators.
Choosing the Right Algorithm.
Constant Versus Mutable Iterator Types.
Iterator Categories Provided by STL Containers.
Output Iterators.
Forward Iterators.
Bidirectional Iterators.
Random Access Iterators.
The STL Iterator Hierarchy: Combining Algorithms and Containers Efficiently.
Insert Iterators.
Revisiting Input and Output: Stream Iterators.
Specification of Iterator Categories Required by STL Algorithms.
Designing Generic Algorithms.
Why Some Algorithms Require More Powerful Iterators.
Choosing the Right Algorithm.
Constant Versus Mutable Iterator Types.
Iterator Categories Provided by STL Containers.
5. Generic Algorithms.
Basic Algorithm Organization in STL.
Nonmutating Sequence Algorithms.
Mutating Sequence Algorithms.
Sorting-Related Algorithms.
Generalized Numeric Algorithms.
Nonmutating Sequence Algorithms.
Mutating Sequence Algorithms.
Sorting-Related Algorithms.
Generalized Numeric Algorithms.
6. Sequence Containers.
Vectors.
Deques.
Lists.
Deques.
Lists.
7. Sorted Associative Containers.
Sets and Multisets.
Maps and Multimaps.
Maps and Multimaps.
8. Function Objects.
Passing Functions via Function Pointers.
Advantages of Specifying Function Objects with Template Parameters.
STL-Provided Function Objects.
Advantages of Specifying Function Objects with Template Parameters.
STL-Provided Function Objects.
9. Container Adaptors.
Stack Container Adaptor.
Queue Container Adaptor.
Priority Queue Container Adaptor.
Queue Container Adaptor.
Priority Queue Container Adaptor.
10. Iterator Adaptors.
11. Function Adaptors.
Binders.
Negators.
Adaptors for Pointers to Functions.
Negators.
Adaptors for Pointers to Functions.
II. PUTTING IT TOGETHER: EXAMPLE PROGRAMS.
12. Program for Searching a Dictionary.
Finding Anagrams of a Given Word.
Interacting with the Standard String and I/O Streams Classes.
Generating Permutations and Searching the Dictionary.
Complete Program.
How Fast Is It?
Interacting with the Standard String and I/O Streams Classes.
Generating Permutations and Searching the Dictionary.
Complete Program.
How Fast Is It?
13. Program for Finding All Anagram Groups.
Finding Anagram Groups.
Defining a Data Structure to Work with STL.
Creating Function Objects for Comparisons.
Complete Anagram Group Finding Program.
Reading the Dictionary into a Vector of PS Objects.
Using a Comparison Object to Sort Word Pairs.
Using an Equality Predicate Object to Search for Adjacent Equal Elements.
Using a Function Adaptor to Obtain a Predicate Object.
Copying the Anagram Group to the Output Stream.
Output of the Anagram Program.
Defining a Data Structure to Work with STL.
Creating Function Objects for Comparisons.
Complete Anagram Group Finding Program.
Reading the Dictionary into a Vector of PS Objects.
Using a Comparison Object to Sort Word Pairs.
Using an Equality Predicate Object to Search for Adjacent Equal Elements.
Using a Function Adaptor to Obtain a Predicate Object.
Copying the Anagram Group to the Output Stream.
Output of the Anagram Program.
14. Better Anagram Program: Using the List and Map Containers.
Data Structure Holding Iterator Pairs.
Storing Information in a Map of Lists.
Outputting the Anagram Groups in Order of Size.
Better Anagram Program.
Output of the Program.
Why Use a Map Container?
Storing Information in a Map of Lists.
Outputting the Anagram Groups in Order of Size.
Better Anagram Program.
Output of the Program.
Why Use a Map Container?
15. Faster Anagram Program: Using Multimaps.
Finding Anagram Groups, Version 3.
Declaration of the Multimap.
Reading the Dictionary into the Multimap.
Finding the Anagram Groups in the Multimap.
Outputting the Anagram Groups in Order of Size.
Output of the Program.
How Fast Is It?
Declaration of the Multimap.
Reading the Dictionary into the Multimap.
Finding the Anagram Groups in the Multimap.
Outputting the Anagram Groups in Order of Size.
Output of the Program.
How Fast Is It?
16. Defining an Iterator Class.
New Kind of Iterator: Counting Iterator.
Counting Iterator Class.
Counting Iterator Class.
17. Combining STL with Object-Oriented Programming.
Using Inheritance and Virtual Functions.
Avoiding "Code Bloat" from Container Instances.
Avoiding "Code Bloat" from Container Instances.
18. Program for Displaying Theoretical Computer Science Genealogy.
Sorting Students by Date.
Associating Students with Advisors.
Finding the Roots of the Tree.
Reading the File.
Printing the Results.
Complete "Genealogy" Program.
Associating Students with Advisors.
Finding the Roots of the Tree.
Reading the File.
Printing the Results.
Complete "Genealogy" Program.
19. Class for Timing Generic Algorithms.
Obstacles to Accurate Timing of Algorithms.
Overcoming the Obstacles.
Refining the Approach.
Automated Analysis with a Timer Class.
Timing the STL Sort Algorithms.
Overcoming the Obstacles.
Refining the Approach.
Automated Analysis with a Timer Class.
Timing the STL Sort Algorithms.
III. STL REFERENCE GUIDE.
20. Iterator Reference Guide.
Input Iterator Requirements.
Output Iterator Requirements.
Forward Iterator Requirements.
Bidirectional Iterator Requirements.
Random Access Iterator Requirements.
Iterator Traits.
Iterator Operations.
Istream Iterators.
Ostream Iterators.
Reverse Iterators.
Back Insert Iterators.
Front Insert Iterators.
Insert Iterators.
Output Iterator Requirements.
Forward Iterator Requirements.
Bidirectional Iterator Requirements.
Random Access Iterator Requirements.
Iterator Traits.
Iterator Operations.
Istream Iterators.
Ostream Iterators.
Reverse Iterators.
Back Insert Iterators.
Front Insert Iterators.
Insert Iterators.
21. Container Reference Guide.
Requirements.
Organization of the Container Class Descriptions.
Vector.
Deque.
List.
Set.
Multiset.
Map.
Multimap.
Stack Container Adaptor.
Queue Container Adaptor.
Priority Queue Container Adaptor.
Organization of the Container Class Descriptions.
Vector.
Deque.
List.
Set.
Multiset.
Map.
Multimap.
Stack Container Adaptor.
Queue Container Adaptor.
Priority Queue Container Adaptor.
22. Generic Algorithm Reference Guide.
Organization of the Algorithm Descriptions.
Nonmutating Sequence Algorithm Overview.
For Each.
Find.
Find First.
Adjacent Find.
Count.
Mismatch.
Equal.
Search.
Search N.
Find End.
Mutating Sequence Algorithm Overview.
Copy.
Swap.
Transform.
Replace.
Fill.
Generate.
Remove.
Unique.
Reverse.
Rotate.
Random Shuffle.
Partition.
Sorting-Related Algorithms Overview.
Sort.
Nth Element.
Binary Search.
Merge.
Set Operations on Sorted Structures.
Heap Operations.
Min and Max.
Lexicographical Comparison.
Permutation Generators.
Generalized Numeric Algorithms Overview.
Accumulate.
Inner Product.
Partial Sum.
Adjacent Difference.
Nonmutating Sequence Algorithm Overview.
For Each.
Find.
Find First.
Adjacent Find.
Count.
Mismatch.
Equal.
Search.
Search N.
Find End.
Mutating Sequence Algorithm Overview.
Copy.
Swap.
Transform.
Replace.
Fill.
Generate.
Remove.
Unique.
Reverse.
Rotate.
Random Shuffle.
Partition.
Sorting-Related Algorithms Overview.
Sort.
Nth Element.
Binary Search.
Merge.
Set Operations on Sorted Structures.
Heap Operations.
Min and Max.
Lexicographical Comparison.
Permutation Generators.
Generalized Numeric Algorithms Overview.
Accumulate.
Inner Product.
Partial Sum.
Adjacent Difference.
23. Function Object and Function Adaptor Reference Guide.
Requirements.
Base Classes.
Arithmetic Operations.
Comparison Operations.
Logical Operations.
Negator Adaptors.
Binder Adaptors.
Adaptors for Pointers to Functions.
Adaptors for Pointers to Member Functions.
Base Classes.
Arithmetic Operations.
Comparison Operations.
Logical Operations.
Negator Adaptors.
Binder Adaptors.
Adaptors for Pointers to Functions.
Adaptors for Pointers to Member Functions.
24. Allocator Reference Guide.
Introduction.
Allocator Requirements.
Default Allocator.
Custom Allocators 448
Allocator Requirements.
Default Allocator.
Custom Allocators 448
25. Utilities Reference Guide.
Introduction.
Comparison Functions.
Pairs.
Comparison Functions.
Pairs.
Appendix A: STL Header Files.
Appendix B: String Reference Guide.
String Classes.
Character Traits.
Character Traits.
Appendix C: STL Include Files Used in Example Programs.
Files Used in Example 17.1.
Appendix D: STL Resources.
Internet Addresses for SGI Reference Implementation of ST.
World Wide Web Address for Source Code for Examples in this Book.
STL-Compatible Compilers.
Other Related STL and C++ Documents.
Generic Programming and STL Discussion List.
World Wide Web Address for Source Code for Examples in this Book.
STL-Compatible Compilers.
Other Related STL and C++ Documents.
Generic Programming and STL Discussion List.
References.
Index. 0201379236T04062001
商品描述(中文翻譯)
《STL教程與參考指南》被廣泛認為是最易於理解、全面且實用的標準模板庫（STL）介紹。STL是一組C++通用數據結構和算法，提供可重用、可互換的組件，適用於多種不同的用途，同時保證效率。《STL教程與參考指南，第二版》由STL的創建和實際應用中起到重要作用的作者撰寫，包括教程、對庫中每個元素的詳細描述、大量的樣例應用和全面的參考資料。書中的許多新代碼示例展示了個別概念和技術，而更大的樣例程序則展示了STL在實際的C++軟件開發中的應用。
適合的課程：C++中級編程。
特點：
- 新增！
- ...
目錄：
- 前言
- 第一版前言
- 前言
- 第一部分：STL教程介紹
- 第1章：介紹
- 第2章：STL組件概述
- 第3章：STL與其他庫的區別
- 第4章：迭代器
- 第5章：通用算法
- 第6章：序列容器
- 第7章：有序關聯容器
- 第8章：函數對象
- 第9章：容器適配器
- ...
