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

Vector is not just the most useful standard container, it is also provides examples of some of the most important/powerful/interesting implementation techniques. In this, we go through a series of increasingly sophisticated vector implementations, seeing classical problems related to use of memory and providing solutions. Here, we discuss free store (heap storage) management, and pointers. | Chapter 17 vector and Free Store Bjarne Stroustrup Abstract Vector is not just the most useful standard container, it is also provides examples of some of the most important/powerful/interesting implementation techniques. In this and the following lectures, we go through a series of increasingly sophisticated vector implementations, seeing classical problems related to use of memory and providing solutions. Here, we discuss free store (heap storage) management, and pointers. Stroustrup/Programming Overview Vector revisited How are they implemented? Pointers and free store Allocation (new) Access Arrays and subscripting: [] Dereferencing: * Deallocation (delete) Destructors Initialization Copy and move Arrays Array and pointer problems Changing size Templates Range checking and exceptions Stroustrup/Programming Vector Vector is the most useful container Simple Compactly stores elements of a given type Efficient access Expands to hold any number .

• Kỹ thuật lập trình
• Programming principles
• Programming C++
• Practical C++ programming
• Programming languages
• Vector revisited
• Free store
• 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
• Copy semantics
• Representing vector
• Pointer problems
• Parameterization of algorithms
• Associative containers
• 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