Comparison of list, vector and deque in C + + [go]

Transfer from http://blog.csdn.net/xiaolajiao8787/article/details/5882609

Type	Vector	Deque	List
Memory management	Poor	Good	Perfect
accessing data using the [] and at () operations	Very Good	Normal	N/A
Iterator speed of access	Good	Very Good	Good
Push_back operation (Post insertion)	Good	Good	Good
Push_front operation (Front insert)	N/A	Very Good	Good
Insert (middle insertion)	Poor	Perfect	Perfect
Erase (Middle delete)	Poor	Perfect	Perfect
Pop_back (Rear delete)	Perfect	Perfect	Normal
Swap (Swap data)	Perfect	Very Good	Good
Traverse	Perfect	Good	Normal

Comparison of list, vector and deque in C + + [go]