std::set template < class T, // set::key_type/value_type class Compare = less<T>, // set::key_compare/value_compare class Alloc = allocator<T> // set::allocator_type > class set; Set Sets are containers that store unique elements followi…
std::list template < class T, class Alloc = allocator > class list; List Lists are sequence containers that allow constant time insert and erase operations anywhere within the sequence, and iteration in both directions. List containers are implement…
std::forward_list template < class T, class Alloc = allocator > class forward_list; Forward list Forward lists are sequence containers that allow constant time insert and erase operations anywhere within the sequence. Forward lists are implemented a…
std::deque template < class T, class Alloc = allocator > class deque; Double ended queue deque means double enden queue; deque (usually pronounced like "deck") is an irregular acronym of double-ended queue. Double-ended queues are sequence…
http://www.cplusplus.com/reference/vector/vector/?kw=vector C++中,vector<bool>为了达到节省内存的目的,专门做了特化,大概方式就是用bit位来存储数组中的元素.代价就是,这个容器里面的内置类型乱掉了: member type definition notes value_type The first template parameter (bool) allocator_type The second template…