C++七种序列容器详解

你的名字 2022-11-14 11:49 169阅读 0赞

# 1，vector-向量 #

**vector模板类是最简单的序列类型，除非其他类型的特殊优点能更好地满足需求，否则应默认使用vector。**

底层数据结构为**数组**

*  自动内存管理
 *  随机访问元素
 *  在尾部插入或删除元素，固定时间–O(1)
 *  在头部插入和删除元素，线性时间—O(n)
 *  可反转容器（rbegin(),rend()）

> member functions:
> 
>  *  [vector::assign][vector_assign]
>  *  [vector::at][vector_at]
>  *  [vector::back][vector_back]
>  *  [vector::begin][vector_begin]
>  *  [vector::capacity][vector_capacity]
>  *  [vector::cbegin][vector_cbegin]
>  *  [vector::cend][vector_cend]
>  *  [vector::clear][vector_clear]
>  *  [vector::crbegin][vector_crbegin]
>  *  [vector::crend][vector_crend]
>  *  [vector::data][vector_data]
>  *  [vector::emplace][vector_emplace]
>  *  [vector::emplace\_back][vector_emplace_back]
>  *  [vector::empty][vector_empty]
>  *  [vector::end][vector_end]
>  *  [vector::erase][vector_erase]
>  *  [vector::front][vector_front]
>  *  [vector::get\_allocator][vector_get_allocator]
>  *  [vector::insert][vector_insert]
>  *  [vector::max\_size][vector_max_size]
>  *  [vector::operator=][vector_operator]
>  *  [vector::operator\[\]][vector_operator 1]
>  *  [vector::pop\_back][vector_pop_back]
>  *  [vector::push\_back][vector_push_back]
>  *  [vector::rbegin][vector_rbegin]
>  *  [vector::rend][vector_rend]
>  *  [vector::reserve][vector_reserve]
>  *  [vector::resize][vector_resize]
>  *  [vector::shrink\_to\_fit][vector_shrink_to_fit]
>  *  [vector::size][vector_size]
>  *  [vector::swap][vector_swap]

# 2，deque-双端队列 #

底层数据结构：一个中央控制器和多个缓冲区，特定的库可以以不同的方式实现deque，通常是作为某种形式的动态数组。

*  自动内存管理
 *  **随机访问元素**
 *  **首尾快速增删**：在头部和尾部插入或删除元素都是固定时间—O(1)  
    如果多数操作发生在序列的起始和结尾出，则应考虑使用deque数据结构。deque对象的设计比vector对象更复杂一些。

> member functions:
> 
>  *  [deque::assign][deque_assign]
>  *  [deque::at][deque_at]
>  *  [deque::back][deque_back]
>  *  [deque::begin][deque_begin]
>  *  [deque::cbegin][deque_cbegin]
>  *  [deque::cend][deque_cend]
>  *  [deque::clear][deque_clear]
>  *  [deque::crbegin][deque_crbegin]
>  *  [deque::crend][deque_crend]
>  *  [deque::emplace][deque_emplace]
>  *  [deque::emplace\_back][deque_emplace_back]
>  *  [deque::emplace\_front][deque_emplace_front]
>  *  [deque::empty][deque_empty]
>  *  [deque::end][deque_end]
>  *  [deque::erase][deque_erase]
>  *  [deque::front][deque_front]
>  *  [deque::get\_allocator][deque_get_allocator]
>  *  [deque::insert][deque_insert]
>  *  [deque::max\_size][deque_max_size]
>  *  [deque::operator=][deque_operator]
>  *  [deque::operator\[\]][deque_operator 1]
>  *  [deque::pop\_back][deque_pop_back]
>  *  [deque::pop\_front][deque_pop_front]
>  *  [deque::push\_back][deque_push_back]
>  *  [deque::push\_front][deque_push_front]
>  *  [deque::rbegin][deque_rbegin]
>  *  [deque::rend][deque_rend]
>  *  [deque::resize][deque_resize]
>  *  [deque::shrink\_to\_fit][deque_shrink_to_fit]
>  *  [deque::size][deque_size]
>  *  [deque::swap][deque_swap]

# 3，list-双向链表 #

除了第一个元素和最后一个元素外，每个元素都与前后相连。可以实现双向遍历链表。

底层数据结构：双向链表

*  在任意位置插入和删除元素都是固定的。**强调元素的快速删除和插入**。
 *  不支持数组表示法和随机访问。
 *  可反转容器。
 *  具有链表专用成员函数。

> member functions:
> 
>  *  [list::assign][list_assign]
>  *  [list::back][list_back]
>  *  [list::begin][list_begin]
>  *  [list::cbegin][list_cbegin]
>  *  [list::cend][list_cend]
>  *  [list::clear][list_clear]
>  *  [list::crbegin][list_crbegin]
>  *  [list::crend][list_crend]
>  *  [list::emplace][list_emplace]
>  *  [list::emplace\_back][list_emplace_back]
>  *  [list::emplace\_front][list_emplace_front]
>  *  [list::empty][list_empty]
>  *  [list::end][list_end]
>  *  [list::erase][list_erase]
>  *  [list::front][list_front]
>  *  [list::get\_allocator][list_get_allocator]
>  *  [list::insert][list_insert]
>  *  [list::max\_size][list_max_size]
>  *  [list::merge][list_merge]
>  *  [list::operator=][list_operator]
>  *  [list::pop\_back][list_pop_back]
>  *  [list::pop\_front][list_pop_front]
>  *  [list::push\_back][list_push_back]
>  *  [list::push\_front][list_push_front]
>  *  [list::rbegin][list_rbegin]
>  *  [list::remove][list_remove]
>  *  [list::remove\_if][list_remove_if]
>  *  [list::rend][list_rend]
>  *  [list::resize][list_resize]
>  *  [list::reverse][list_reverse]
>  *  [list::size][list_size]
>  *  [list::sort][list_sort]
>  *  [list::splice][list_splice]
>  *  [list::swap][list_swap]
>  *  [list::unique][list_unique]

<table> 
 <tbody> 
  <tr> 
   <td colspan="2" style="text-align:center;vertical-align:middle;">list成员函数</td> 
  </tr> 
  <tr> 
   <td style="width:299px;">void merge(list&lt;T,Alloc&gt; &amp; x)</td> 
   <td style="width:500px;">将链表x与调用链表合并，两个链表必须已经排序。合并后的经过排序的链表保存在调用链表中，x为空。时间复杂度为O(n)</td> 
  </tr> 
  <tr> 
   <td style="width:299px;">void remove(const T &amp; val)</td> 
   <td style="width:500px;">从链表中删除val的所有实例，时间复杂度为O(n)</td> 
  </tr> 
  <tr> 
   <td style="width:299px;">void sort()</td> 
   <td style="width:500px;">使用运算符&lt;对链表进行排序（从小到大），时间复杂度为O(n log n)</td> 
  </tr> 
  <tr> 
   <td style="width:299px;">void splice(iterator pos, list&lt;T,Alloc&gt; x)</td> 
   <td style="width:500px;">将链表x的内容插入到pos的前面，x将为空，时间复杂度为O(1)</td> 
  </tr> 
  <tr> 
   <td style="width:299px;">void unique()</td> 
   <td style="width:500px;">将连续相同的元素压缩为单个元素，时间复杂度为O(n)</td> 
  </tr> 
 </tbody> 
</table>

#include <iostream>
    #include<list>
    #include<iterator>
    #include<algorithm>
    using std::cout;
    using std::cin;
    using std::endl;
    using namespace std;
    
    void outint(int n) {
    	cout << n <<" " ;
    }
    int main(void) {
    	//声明一个名为one的由5个2组成的双向链表
    	list<int> one(5, 2);
    
    	int stuff[5] = { 1,2,3,8,6 };
    	list<int> two;
    	two.insert(two.begin(), stuff, stuff + 5);
    	int more[6] = { 6,4,2,4,6,5 };
    	
    	//使用拷贝构造函数
    	list<int> three(two);
    	three.insert(three.end(), more, more + 6);
    
    	cout << "List one:" << endl;
    	for_each(one.begin(), one.end(), outint);
    
    	cout<<endl << "List two:" << endl;
    	for_each(two.begin(), two.end(), outint);
    
    	cout<<endl << "List three:" << endl;
    	for_each(three.begin(), three.end(), outint);
    	
    	//remove(const T & val)---从链表中删除所有val的实例
    	three.remove(2);//删除three中所有的2
    	cout << endl << "After removing,List three:" << endl;
    	for_each(three.begin(), three.end(), outint);
    
    	//splice(pos,x)--将链表x的内容插入到pos前面，x将为空，复杂度为O(1)
    	three.splice(three.begin(), one);
    	cout << endl << "After splicing,List three:" << endl;
    	for_each(three.begin(), three.end(), outint);
    
    	cout<<endl << "List one:" << endl;
    	for_each(one.begin(), one.end(), outint);
    	cout << endl << "List one'size: "<<one.size() << endl;
    
    	//unique()--将连续重复的元素压缩成单个元素--O(1)
    	three.unique();
    	cout << endl << "After unique,List three:" << endl;
    	for_each(three.begin(), three.end(), outint);
    
    	//sort()--使用运算符“<”对链表元素进行排序：n个元素的复杂度为 nlogn
    	three.sort();
    	three.unique();
    	cout << endl << "After sorting and unique,List three:" << endl;
    	for_each(three.begin(), three.end(), outint);
    
    	two.sort();
    	cout << endl << "After sorting,List two:" << endl;
    	for_each(three.begin(), three.end(), outint);
    	//merge(x)融合两个已排序的链表，合并后的链表保存在调用链表中，被融合的x将为空。复杂度为O(1)
    	three.merge(two);
    	cout << endl << "Sorted two merged into three,List three:" << endl;
    	for_each(three.begin(), three.end(), outint);
    	cout << endl << "List two'size: " << two.size() << endl;
    
    	return 0;
    }
    /*
    结果：
    List one:
    2 2 2 2 2
    List two:
    1 2 3 8 6
    List three:
    1 2 3 8 6 6 4 2 4 6 5
    After removing,List three:
    1 3 8 6 6 4 4 6 5
    After splicing,List three:
    2 2 2 2 2 1 3 8 6 6 4 4 6 5
    List one:
    
    List one'size: 0
    
    After unique,List three:
    2 1 3 8 6 4 6 5
    After sorting and unique,List three:
    1 2 3 4 5 6 8
    After sorting,List two:
    1 2 3 4 5 6 8
    Sorted two merged into three,List three:
    1 1 2 2 3 3 4 5 6 6 8 8
    List two'size: 0
    */

*  **remove**(const T & val)—从链表中删除所有val的实例
 *  **splice**(pos,x)–将链表x的内容插入到pos前面，**x将为空**，复杂度为O(1)
 *  **insert和splice的区别**：insert是将原始区间的副本插入到目标地址，而splice则将原始区间移到目标地址。因此，在one的内容和three合并后，one为空，但是splice方法执行后，迭代器仍然有效，也就是说如果迭代器设置为指向one中的某个元素，在执行three.splice(three.begin(),one)之后,该迭代器仍然指向相同的元素。可以把迭代器看作是指针，只要该迭代器指向的内存没有被释放，该迭代器仍然指向该元素。
 *  **unique**()–将连续重复的元素压缩成单个元素–O(1)
 *  **sort**()–使用运算符“<”对链表元素进行排序：n个元素的复杂度为 nlogn
 *  **merge**(x)融合两个已排序的链表，合并后的链表保存在调用链表中，**被融合的x将为空**。复杂度为O(1)

# 4，forward\_list-单链表（C++11） #

在单链表中，每个节点都只链接到下一个节点。它不可反转，相对于list，forward\_list更简单、更紧凑，但功能也更少。

> member functions:
> 
>  *  [forward\_list::assign][forward_list_assign]
>  *  [forward\_list::before\_begin][forward_list_before_begin]
>  *  [forward\_list::begin][forward_list_begin]
>  *  [forward\_list::cbefore\_begin][forward_list_cbefore_begin]
>  *  [forward\_list::cbegin][forward_list_cbegin]
>  *  [forward\_list::cend][forward_list_cend]
>  *  [forward\_list::clear][forward_list_clear]
>  *  [forward\_list::emplace\_after][forward_list_emplace_after]
>  *  [forward\_list::emplace\_front][forward_list_emplace_front]
>  *  [forward\_list::empty][forward_list_empty]
>  *  [forward\_list::end][forward_list_end]
>  *  [forward\_list::erase\_after][forward_list_erase_after]
>  *  [forward\_list::front][forward_list_front]
>  *  [forward\_list::get\_allocator][forward_list_get_allocator]
>  *  [forward\_list::insert\_after][forward_list_insert_after]
>  *  [forward\_list::max\_size][forward_list_max_size]
>  *  [forward\_list::merge][forward_list_merge]
>  *  [forward\_list::operator=][forward_list_operator]
>  *  [forward\_list::pop\_front][forward_list_pop_front]
>  *  [forward\_list::push\_front][forward_list_push_front]
>  *  [forward\_list::remove][forward_list_remove]
>  *  [forward\_list::remove\_if][forward_list_remove_if]
>  *  [forward\_list::resize][forward_list_resize]
>  *  [forward\_list::reverse][forward_list_reverse]
>  *  [forward\_list::sort][forward_list_sort]
>  *  [forward\_list::splice\_after][forward_list_splice_after]
>  *  [forward\_list::swap][forward_list_swap]
>  *  [forward\_list::unique][forward_list_unique]

# 5，queue-队列（适配器） #

队列的规则是FIFO，先进先出，可以将元素添加到队尾，从队首删除元素。

底层是用list和deque实现的，和stack一样，stack和queue其实是适配器，而不叫容器，因为是对容器的再封装。

> member functions:
> 
>  *  [queue::back][queue_back]
>  *  [queue::emplace][queue_emplace]
>  *  [queue::empty][queue_empty]
>  *  [queue::front][queue_front]
>  *  [queue::pop][queue_pop]
>  *  [queue::push][queue_push]
>  *  [queue::size][queue_size]
>  *  [queue::swap][queue_swap]

<table> 
 <tbody> 
  <tr> 
   <td colspan="2" style="text-align:center;vertical-align:middle;">quque常用函数</td> 
  </tr> 
  <tr> 
   <td style="width:364px;">bool empty() const</td> 
   <td style="width:435px;">如果队列为空，返回true，否则返回false</td> 
  </tr> 
  <tr> 
   <td style="width:364px;">size_type size() const</td> 
   <td style="width:435px;">返回队列中元素的数目</td> 
  </tr> 
  <tr> 
   <td style="width:364px;">T &amp; front（）</td> 
   <td style="width:435px;">返回指向队首元素的引用</td> 
  </tr> 
  <tr> 
   <td style="width:364px;">T &amp; back()</td> 
   <td style="width:435px;">返回队尾元素的引用</td> 
  </tr> 
  <tr> 
   <td style="width:364px;">void push(const T &amp; x)</td> 
   <td style="width:435px;">在队尾插入x</td> 
  </tr> 
  <tr> 
   <td style="width:364px;">void pop()</td> 
   <td style="width:435px;">删除队首元素</td> 
  </tr> 
 </tbody> 
</table>

# 6，priority\_queue-优先队列 #

它支持和queue相同的操作，但在优先队列中，最大的元素被移到队首。

内部的区别在于，**默认的底层类是vector**。堆heap为处理规则来管理底层容器。

可以修改用于确定哪个元素放到队首的比较方式。方法是提供一个可选的构造函数参数。

> member functions:
> 
>  *  [priority\_queue::emplace][priority_queue_emplace]
>  *  [priority\_queue::empty][priority_queue_empty]
>  *  [priority\_queue::pop][priority_queue_pop]
>  *  [priority\_queue::push][priority_queue_push]
>  *  [priority\_queue::size][priority_queue_size]
>  *  [priority\_queue::swap][priority_queue_swap]
>  *  [priority\_queue::top][priority_queue_top]

priority_queue<int> pq1;//默认声明
    priority_queue<int> pq2(greater<int>);//使用greater去排序

greater<>()函数是一个预定义的函数对象。

# 7，stack-栈 #

栈的规则是LIFO，后进先出。栈的限制有很多，不能随机访问栈元素，甚至不允许遍历栈。只能将元素从栈顶压入或者从栈顶弹出。

> member functions:
> 
>  *  [stack::emplace][stack_emplace]
>  *  [stack::empty][stack_empty]
>  *  [stack::pop][stack_pop]
>  *  [stack::push][stack_push]
>  *  [stack::size][stack_size]
>  *  [stack::swap][stack_swap]
>  *  [stack::top][stack_top]

# 8，array-数组类（非STL容器） #

因为array类对象的长度是固定的，不能调整容器的大小。所以它不是STL容器。但是许多STL算法适用于array对象。比如：operator 和 at()，copy()和for\_each().

> member functions:
> 
>  *  [array::at][array_at]
>  *  [array::back][array_back]
>  *  [array::begin][array_begin]
>  *  [array::cbegin][array_cbegin]
>  *  [array::cend][array_cend]
>  *  [array::crbegin][array_crbegin]
>  *  [array::crend][array_crend]
>  *  [array::data][array_data]
>  *  [array::empty][array_empty]
>  *  [array::end][array_end]
>  *  [array::fill][array_fill]
>  *  [array::front][array_front]
>  *  [array::max\_size][array_max_size]
>  *  [array::operator\[\]][array_operator]
>  *  [array::rbegin][array_rbegin]
>  *  [array::rend][array_rend]
>  *  [array::size][array_size]
>  *  [array::swap][array_swap]

[vector_assign]: http://www.cplusplus.com/reference/vector/vector/assign/
[vector_at]: http://www.cplusplus.com/reference/vector/vector/at/
[vector_back]: http://www.cplusplus.com/reference/vector/vector/back/
[vector_begin]: http://www.cplusplus.com/reference/vector/vector/begin/
[vector_capacity]: http://www.cplusplus.com/reference/vector/vector/capacity/
[vector_cbegin]: http://www.cplusplus.com/reference/vector/vector/cbegin/
[vector_cend]: http://www.cplusplus.com/reference/vector/vector/cend/
[vector_clear]: http://www.cplusplus.com/reference/vector/vector/clear/
[vector_crbegin]: http://www.cplusplus.com/reference/vector/vector/crbegin/
[vector_crend]: http://www.cplusplus.com/reference/vector/vector/crend/
[vector_data]: http://www.cplusplus.com/reference/vector/vector/data/
[vector_emplace]: http://www.cplusplus.com/reference/vector/vector/emplace/
[vector_emplace_back]: http://www.cplusplus.com/reference/vector/vector/emplace_back/
[vector_empty]: http://www.cplusplus.com/reference/vector/vector/empty/
[vector_end]: http://www.cplusplus.com/reference/vector/vector/end/
[vector_erase]: http://www.cplusplus.com/reference/vector/vector/erase/
[vector_front]: http://www.cplusplus.com/reference/vector/vector/front/
[vector_get_allocator]: http://www.cplusplus.com/reference/vector/vector/get_allocator/
[vector_insert]: http://www.cplusplus.com/reference/vector/vector/insert/
[vector_max_size]: http://www.cplusplus.com/reference/vector/vector/max_size/
[vector_operator]: http://www.cplusplus.com/reference/vector/vector/operator=/
[vector_operator 1]: http://www.cplusplus.com/reference/vector/vector/operator%5B%5D/
[vector_pop_back]: http://www.cplusplus.com/reference/vector/vector/pop_back/
[vector_push_back]: http://www.cplusplus.com/reference/vector/vector/push_back/
[vector_rbegin]: http://www.cplusplus.com/reference/vector/vector/rbegin/
[vector_rend]: http://www.cplusplus.com/reference/vector/vector/rend/
[vector_reserve]: http://www.cplusplus.com/reference/vector/vector/reserve/
[vector_resize]: http://www.cplusplus.com/reference/vector/vector/resize/
[vector_shrink_to_fit]: http://www.cplusplus.com/reference/vector/vector/shrink_to_fit/
[vector_size]: http://www.cplusplus.com/reference/vector/vector/size/
[vector_swap]: http://www.cplusplus.com/reference/vector/vector/swap/
[deque_assign]: http://www.cplusplus.com/reference/deque/deque/assign/
[deque_at]: http://www.cplusplus.com/reference/deque/deque/at/
[deque_back]: http://www.cplusplus.com/reference/deque/deque/back/
[deque_begin]: http://www.cplusplus.com/reference/deque/deque/begin/
[deque_cbegin]: http://www.cplusplus.com/reference/deque/deque/cbegin/
[deque_cend]: http://www.cplusplus.com/reference/deque/deque/cend/
[deque_clear]: http://www.cplusplus.com/reference/deque/deque/clear/
[deque_crbegin]: http://www.cplusplus.com/reference/deque/deque/crbegin/
[deque_crend]: http://www.cplusplus.com/reference/deque/deque/crend/
[deque_emplace]: http://www.cplusplus.com/reference/deque/deque/emplace/
[deque_emplace_back]: http://www.cplusplus.com/reference/deque/deque/emplace_back/
[deque_emplace_front]: http://www.cplusplus.com/reference/deque/deque/emplace_front/
[deque_empty]: http://www.cplusplus.com/reference/deque/deque/empty/
[deque_end]: http://www.cplusplus.com/reference/deque/deque/end/
[deque_erase]: http://www.cplusplus.com/reference/deque/deque/erase/
[deque_front]: http://www.cplusplus.com/reference/deque/deque/front/
[deque_get_allocator]: http://www.cplusplus.com/reference/deque/deque/get_allocator/
[deque_insert]: http://www.cplusplus.com/reference/deque/deque/insert/
[deque_max_size]: http://www.cplusplus.com/reference/deque/deque/max_size/
[deque_operator]: http://www.cplusplus.com/reference/deque/deque/operator=/
[deque_operator 1]: http://www.cplusplus.com/reference/deque/deque/operator%5B%5D/
[deque_pop_back]: http://www.cplusplus.com/reference/deque/deque/pop_back/
[deque_pop_front]: http://www.cplusplus.com/reference/deque/deque/pop_front/
[deque_push_back]: http://www.cplusplus.com/reference/deque/deque/push_back/
[deque_push_front]: http://www.cplusplus.com/reference/deque/deque/push_front/
[deque_rbegin]: http://www.cplusplus.com/reference/deque/deque/rbegin/
[deque_rend]: http://www.cplusplus.com/reference/deque/deque/rend/
[deque_resize]: http://www.cplusplus.com/reference/deque/deque/resize/
[deque_shrink_to_fit]: http://www.cplusplus.com/reference/deque/deque/shrink_to_fit/
[deque_size]: http://www.cplusplus.com/reference/deque/deque/size/
[deque_swap]: http://www.cplusplus.com/reference/deque/deque/swap/
[list_assign]: http://www.cplusplus.com/reference/list/list/assign/
[list_back]: http://www.cplusplus.com/reference/list/list/back/
[list_begin]: http://www.cplusplus.com/reference/list/list/begin/
[list_cbegin]: http://www.cplusplus.com/reference/list/list/cbegin/
[list_cend]: http://www.cplusplus.com/reference/list/list/cend/
[list_clear]: http://www.cplusplus.com/reference/list/list/clear/
[list_crbegin]: http://www.cplusplus.com/reference/list/list/crbegin/
[list_crend]: http://www.cplusplus.com/reference/list/list/crend/
[list_emplace]: http://www.cplusplus.com/reference/list/list/emplace/
[list_emplace_back]: http://www.cplusplus.com/reference/list/list/emplace_back/
[list_emplace_front]: http://www.cplusplus.com/reference/list/list/emplace_front/
[list_empty]: http://www.cplusplus.com/reference/list/list/empty/
[list_end]: http://www.cplusplus.com/reference/list/list/end/
[list_erase]: http://www.cplusplus.com/reference/list/list/erase/
[list_front]: http://www.cplusplus.com/reference/list/list/front/
[list_get_allocator]: http://www.cplusplus.com/reference/list/list/get_allocator/
[list_insert]: http://www.cplusplus.com/reference/list/list/insert/
[list_max_size]: http://www.cplusplus.com/reference/list/list/max_size/
[list_merge]: http://www.cplusplus.com/reference/list/list/merge/
[list_operator]: http://www.cplusplus.com/reference/list/list/operator=/
[list_pop_back]: http://www.cplusplus.com/reference/list/list/pop_back/
[list_pop_front]: http://www.cplusplus.com/reference/list/list/pop_front/
[list_push_back]: http://www.cplusplus.com/reference/list/list/push_back/
[list_push_front]: http://www.cplusplus.com/reference/list/list/push_front/
[list_rbegin]: http://www.cplusplus.com/reference/list/list/rbegin/
[list_remove]: http://www.cplusplus.com/reference/list/list/remove/
[list_remove_if]: http://www.cplusplus.com/reference/list/list/remove_if/
[list_rend]: http://www.cplusplus.com/reference/list/list/rend/
[list_resize]: http://www.cplusplus.com/reference/list/list/resize/
[list_reverse]: http://www.cplusplus.com/reference/list/list/reverse/
[list_size]: http://www.cplusplus.com/reference/list/list/size/
[list_sort]: http://www.cplusplus.com/reference/list/list/sort/
[list_splice]: http://www.cplusplus.com/reference/list/list/splice/
[list_swap]: http://www.cplusplus.com/reference/list/list/swap/
[list_unique]: http://www.cplusplus.com/reference/list/list/unique/
[forward_list_assign]: http://www.cplusplus.com/reference/forward_list/forward_list/assign/
[forward_list_before_begin]: http://www.cplusplus.com/reference/forward_list/forward_list/before_begin/
[forward_list_begin]: http://www.cplusplus.com/reference/forward_list/forward_list/begin/
[forward_list_cbefore_begin]: http://www.cplusplus.com/reference/forward_list/forward_list/cbefore_begin/
[forward_list_cbegin]: http://www.cplusplus.com/reference/forward_list/forward_list/cbegin/
[forward_list_cend]: http://www.cplusplus.com/reference/forward_list/forward_list/cend/
[forward_list_clear]: http://www.cplusplus.com/reference/forward_list/forward_list/clear/
[forward_list_emplace_after]: http://www.cplusplus.com/reference/forward_list/forward_list/emplace_after/
[forward_list_emplace_front]: http://www.cplusplus.com/reference/forward_list/forward_list/emplace_front/
[forward_list_empty]: http://www.cplusplus.com/reference/forward_list/forward_list/empty/
[forward_list_end]: http://www.cplusplus.com/reference/forward_list/forward_list/end/
[forward_list_erase_after]: http://www.cplusplus.com/reference/forward_list/forward_list/erase_after/
[forward_list_front]: http://www.cplusplus.com/reference/forward_list/forward_list/front/
[forward_list_get_allocator]: http://www.cplusplus.com/reference/forward_list/forward_list/get_allocator/
[forward_list_insert_after]: http://www.cplusplus.com/reference/forward_list/forward_list/insert_after/
[forward_list_max_size]: http://www.cplusplus.com/reference/forward_list/forward_list/max_size/
[forward_list_merge]: http://www.cplusplus.com/reference/forward_list/forward_list/merge/
[forward_list_operator]: http://www.cplusplus.com/reference/forward_list/forward_list/operator=/
[forward_list_pop_front]: http://www.cplusplus.com/reference/forward_list/forward_list/pop_front/
[forward_list_push_front]: http://www.cplusplus.com/reference/forward_list/forward_list/push_front/
[forward_list_remove]: http://www.cplusplus.com/reference/forward_list/forward_list/remove/
[forward_list_remove_if]: http://www.cplusplus.com/reference/forward_list/forward_list/remove_if/
[forward_list_resize]: http://www.cplusplus.com/reference/forward_list/forward_list/resize/
[forward_list_reverse]: http://www.cplusplus.com/reference/forward_list/forward_list/reverse/
[forward_list_sort]: http://www.cplusplus.com/reference/forward_list/forward_list/sort/
[forward_list_splice_after]: http://www.cplusplus.com/reference/forward_list/forward_list/splice_after/
[forward_list_swap]: http://www.cplusplus.com/reference/forward_list/forward_list/swap/
[forward_list_unique]: http://www.cplusplus.com/reference/forward_list/forward_list/unique/
[queue_back]: http://www.cplusplus.com/reference/queue/queue/back/
[queue_emplace]: http://www.cplusplus.com/reference/queue/queue/emplace/
[queue_empty]: http://www.cplusplus.com/reference/queue/queue/empty/
[queue_front]: http://www.cplusplus.com/reference/queue/queue/front/
[queue_pop]: http://www.cplusplus.com/reference/queue/queue/pop/
[queue_push]: http://www.cplusplus.com/reference/queue/queue/push/
[queue_size]: http://www.cplusplus.com/reference/queue/queue/size/
[queue_swap]: http://www.cplusplus.com/reference/queue/queue/swap/
[priority_queue_emplace]: http://www.cplusplus.com/reference/queue/priority_queue/emplace/
[priority_queue_empty]: http://www.cplusplus.com/reference/queue/priority_queue/empty/
[priority_queue_pop]: http://www.cplusplus.com/reference/queue/priority_queue/pop/
[priority_queue_push]: http://www.cplusplus.com/reference/queue/priority_queue/push/
[priority_queue_size]: http://www.cplusplus.com/reference/queue/priority_queue/size/
[priority_queue_swap]: http://www.cplusplus.com/reference/queue/priority_queue/swap/
[priority_queue_top]: http://www.cplusplus.com/reference/queue/priority_queue/top/
[stack_emplace]: http://www.cplusplus.com/reference/stack/stack/emplace/
[stack_empty]: http://www.cplusplus.com/reference/stack/stack/empty/
[stack_pop]: http://www.cplusplus.com/reference/stack/stack/pop/
[stack_push]: http://www.cplusplus.com/reference/stack/stack/push/
[stack_size]: http://www.cplusplus.com/reference/stack/stack/size/
[stack_swap]: http://www.cplusplus.com/reference/stack/stack/swap/
[stack_top]: http://www.cplusplus.com/reference/stack/stack/top/
[array_at]: http://www.cplusplus.com/reference/array/array/at/
[array_back]: http://www.cplusplus.com/reference/array/array/back/
[array_begin]: http://www.cplusplus.com/reference/array/array/begin/
[array_cbegin]: http://www.cplusplus.com/reference/array/array/cbegin/
[array_cend]: http://www.cplusplus.com/reference/array/array/cend/
[array_crbegin]: http://www.cplusplus.com/reference/array/array/crbegin/
[array_crend]: http://www.cplusplus.com/reference/array/array/crend/
[array_data]: http://www.cplusplus.com/reference/array/array/data/
[array_empty]: http://www.cplusplus.com/reference/array/array/empty/
[array_end]: http://www.cplusplus.com/reference/array/array/end/
[array_fill]: http://www.cplusplus.com/reference/array/array/fill/
[array_front]: http://www.cplusplus.com/reference/array/array/front/
[array_max_size]: http://www.cplusplus.com/reference/array/array/max_size/
[array_operator]: http://www.cplusplus.com/reference/array/array/operator%5B%5D/
[array_rbegin]: http://www.cplusplus.com/reference/array/array/rbegin/
[array_rend]: http://www.cplusplus.com/reference/array/array/rend/
[array_size]: http://www.cplusplus.com/reference/array/array/size/
[array_swap]: http://www.cplusplus.com/reference/array/array/swap/