Notes On: C++

Templates

Good coverage in Chapter 15 of Deitel and Deitel Book. Starts on page 625.

vector

From Deitel and Deitel Book page 631

• A vector's elements are stored in a contiguous block of memory. When that block is full and you add a new element, the vector performs the expensive operation of allocating a larger contiguous block of memory and copying or moving the old elements into that new block.

• A deque is typically implemented as a list of fixed-size, built-in arrays--with new ones added as necessary. No existing elements are copied or moved when new items are added to the deque's front or back.

References

• Deitel and Deitel Book