Robson Using the STL

The C++ Standard Template Library
Erscheinungsjahr 2012
ISBN: 978-1-4684-0531-6
Verlag: Springer US
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, 421 Seiten, eBook

Programming languages evolve in steps. They began with weakly typed lan guages like FORTRAN and progressed to strongly typed languages like PAS CAL. This had the positive effect of moving the detection of many programming errors from run-time to compile-time. Unfortunately, it was soon recognized that it had the negative effect of limiting the generality of functions since they were now bound to a specific data type. This virtually eliminated the writing of reusable software components. The result was that programmers had to re-implement common algorithms and data structures over and over again. Newer languages, like C++, provide a way to decouple algorithms and data structures from the data types upon which they operate. C++ provides this capa bility via the template mechanism. Suddenly, it became possible to write generic algorithms and data structures that could be reused. In effect, this provides de bugged software components that can be combined to form programs much faster than by re-implementing the components each time they are needed. At the same time that programming languages were evolving, computer hard ware was becoming incredibly inexpensive compared to programmers' salaries. This provided a strong incentive to reduce costs by increasing programmer pro ductivity. Software reuse was seen as one way to increase programmer productivity.

Zielgruppe

Professional/practitioner

Autoren/Hrsg.

Robson, Robert

Inhaltsverzeichnis

1 Introduction.- 1.1 What Is STL?.- 1.2 History.- 1.3 STL Components.- 1.4 Generic Algorithms.- 1.5 Iterators.- 1.6 Complexity.- 1.7 Overview of this Book.- 2 Iterators.- 2.1 Introduction.- 2.2 Pointers as Iterators.- 2.3 Iterator Classes.- 2.4 Using Iterators.- 2.5 Iterator Functions.- 3 The STL Algorithms.- 3.1 Introduction.- 3.2 Operators.- 3.3 Function Objects.- 3.4 The STL Algorithms.- 4 Sequence Algorithms.- 4.1 Introduction.- 4.2 Preliminaries.- 4.3 Non-Mutating Sequence Algorithms.- 4.4 Mutating Sequence Algorithms.- 5 Sorting and Related Algorithms.- 5.1 Introduction.- 5.2 Preliminaries.- 5.3 Sorting.- 5.4 Searching Algorithms.- 5.5 Set Algorithms.- 5.6 Heap Algorithms.- 5.7 Miscellaneous Algorithms.- 6 Generalized Numeric Algorithms.- 6.1 Numeric Algorithms.- 6.2 Accumulation.- 6.3 Inner Product.- 6.4 Partial Sum.- 6.5 Adjacent Difference.- 7 Sequence Containers.- 7.1 Introduction.- 7.2 Container Operations.- 7.3 Vectors.- 7.4 Lists.- 7.5 Deques.- 7.6 Choosing a Sequence Container.- 8 Associative Containers.- 8.1 Introduction.- 8.2 Associative Container Operations.- 8.3 Sets.- 8.4 Multisets.- 8.5 Maps.- 8.6 Associative Container Implementation.- 8.7 Experimental Hash Table Implementation.- 8.8 Container Selection.- 9 Adaptors.- 9.1 Introduction.- 9.2 Container Adaptors.- 9.3 The Stack.- 9.4 Queues.- 9.5 Priority Queues.- 9.6 Iterator Adaptors.- 9.7 Summary.- 10 Allocators.- 10.1 Introduction.- 10.2 The PC Memory Model.- 10.3 The Allocator Solution.- 10.4 Summary.- 11 Putting the STL to Work.- 11.1 Introduction.- 11.2 A Banking Problem.- 11.3 Symbol Tables.- 11.4 Reversing Sequences.- 12: The Story Continues.- 12.1 Introduction.- 12.2 The Future.- 12.3 Summary.- References.- Appendix A: The STL Reference.