| Contents: |
1 Concept of the C++ Standard Template Library 3 --
1.1 Genericity of components 4 --
1.2 Abstract and implicit data types 4 --
1.3 Fundamental concept 5 --
1.4 Internal functioning 9 --
1.5 Complexity 14 --
1.6 Auxiliary classes and functions 19 --
1.7 Some conventions 28 --
2 Iterators 29 --
2.1 Iterator properties 30 --
2.2 Stream iterators 37 --
3 Containers 47 --
3.1 Data type interface 47 --
3.2 Container methods 48 --
3.3 Sequences 50 --
3.4 Iterator categories and containers 60 --
3.5 Iterators for insertion into containers 66 --
4 Abstract data types 73 --
4.1 Stack 73 --
4.2 Queue 74 --
4.3 Priority queue 76 --
4.4 Sorted associative containers 78 --
Part II Algorithms 87 --
5 Standard algorithms 89 --
5.1 Copying algorithms 89 --
5.2 Algorithms with predicates 90 --
5.3 Nonmutating sequence operations 91 --
5.4 Mutating sequence operations 105 --
5.5 Sorting, merging, and related operations 126 --
5.6 Set operations on sorted structures 139 --
5.7 Heap algorithms 146 --
5.8 Minimum and maximum 155 --
5.9 Lexicographical comparison 156 --
5.10 Permutations 157 --
5.11 Numeric algorithms 158 --
Part III Beyond the STL: components and applications 165 --
6 Set operations on associative containers 167 --
6.1 Subset relation 168 --
6.2 Union 168 --
6.3 Intersection 169 --
6.4 Difference 170 --
6.5 Symmetric difference 170 --
6.6 Example 171 --
7 Fast associative containers 175 --
7.1 Fundamentals 175 --
7.3 Set 188 --
7.4 Overloaded operators for sets 188 --
8 Various applications 193 --
8.1 Cross-reference 193 --
8.2 Permuted index 195 --
8.3 Thesaurus 198 --
9 Vectors and matrices 203 --
9.1 Checked vectors 203 --
9.2 Matrices as nested containers 205 --
9.3 Matrices for different memory models 212 --
9.4 Sparse matrices 218 --
10 External sorting 231 --
10.1 External sorting by merging 231 --
10.2 External sorting with accelerator 238 --
11 Graphs 243 --
11.1 Class Graph 246 --
11.2 Dynamic priority queue 255 --
11.3 Graph algorithms 263 --
A.1 Auxiliary programs 275 --
A.1.1 Reading the thesaurus file roget.dat 275 --
A.1.2 Reading a graph file 276 --
A.1.3 Creation of vertices with random coordinates 277 --
A.1.4 Connecting neighboring vertices 278 --
A.1.5 Creating a LATEX file 279 --
A.3 Solutions to selected exercises 282 --
A.4 Overview of the sample files 287 --
A.4.1 Additions to the include directory 288 --
A.4.2 Files for the introductory examples 288 --
A.4.3 Files for the standard algorithms 288 --
A.4.4 Files for applications and extensions 288. |
Finding libraries that hold this item...
Cite/Export
Book : English : Updated edView all editions and formats
