STL source code-sequence container (1)

1. vector, list, And deque

Iterator

Original vector pointer

List random iterator

Deque custom iterator, which can be operated by + n

Iterator failed

The insertion and deletion of a vector after the insertion and deletion points will become invalid (excluding the end; insertion will become invalid if it is re-allocated; it is clear that all values will also become invalid.

The list will not expire except the deleted vertex.

Deque will expire except the end and end

Underlying Storage

Vector is similar to continuous storage of arrays.

Random list Storage

Deque pseudo-continuous storage, with a map controlling each buffer zone

 

Ii. adapters such as stack and queue

No iterator; you can specify the containers implemented at the underlying layer. The default value is deque.

STL source code-sequence container (1)