TAILIEUCHUNG - Lecture Programming principles and practice using C++: Chapter 20 - Bjarne Stroustrup

Chapter 20 present the STL – the containers and algorithms part of the C++ standard library. The STL is an extensible framework dealing with data in a C++ program. First, this chapter present the general ideal, then the fundamental concepts, and finally examples of containers and algorithms. | Chapter 20 The STL (containers, iterators, and algorithms) Bjarne Stroustrup Abstract This lecture and the next present the STL – the containers and algorithms part of the C++ standard library The STL is an extensible framework dealing with data in a C++ program. First, I will present the general ideal, then the fundamental concepts, and finally examples of containers and algorithms. The key notions of sequence and iterator used to tie data together with algorithms (for general processing) are also presented. Stroustrup/Programming - Nov'13 Overview Common tasks and ideals Generic programming Containers, algorithms, and iterators The simplest algorithm: find() Parameterization of algorithms find_if() and function objects Sequence containers vector and list Associative containers map, set Standard algorithms copy, sort, Input iterators and output iterators List of useful facilities Headers, algorithms, containers, function objects .

• Kỹ thuật lập trình
• Programming principles
• Programming C++
• Practical C++ programming
• Programming languages
• Parameterization of algorithms
• Associative containers
• programming experience
• code programming
• programming languages​​
• computer programming
• design tips
• programming documentation
• programming skills
• the Ruby programming document
• methods Ruby programming language
• Embedded systems programming
• Embedded systems
• The C programming language
• C++ interoperability
• Programming hard
• Completing a program
• Token streams
• Language technicalities
• Header files
• Operator overloading
• Output streams
• Input streams
• Numeric output
• Customizing I O
• Graphics model
• Display model
• Graphics classes
• Interface classes
• Graph class design
• Class shape
• Graphing functions
• Classes defined
• Graphical user interfaces
• Layers of software
• Vector revisited
• Free store
• Copy semantics
• Representing vector
• Pointer problems
• Standard algorithms
• Software ideals
• Language designers
• Text processing
• Application domains
• Random numbers
• Complex numbers
• Testing GUIs
• Design for testing
• String I O
• Integer I O
• Language constructs
• Language features