C++ Reference: Standard C++ Library reference: Containers: list: list

C++参考链接:https://cplusplus.com/reference/list/list/

类模板 
<list>
std::list
template < class T, class Alloc = allocator<T> > class list;
list
list是顺序容器,允许在序列中的任何位置进行固定时间的插入和删除操作,并允许双向迭代。
list容器被实现为双链表;双链表可以将它们包含的每个元素存储在不同的、不相关的存储位置。顺序在内部通过与前面元素的链接和后面元素的链接的每个元素的关联来保持。
它们与forward_list非常相似:主要的区别是forward_list对象是单链表,因此它们只能向前迭代,以换取更小和更高效。
与其他基本标准顺序容器(arrayvectordeque)相比,list在插入、提取元素和移动元素到容器内已经获得iterator的任何位置方面通常表现得更好,因此在大量使用这些元素的算法(如排序算法)中也表现得更好。
与其他顺序容器相比,lists和forward_list的主要缺点是它们不能通过位置直接访问元素;例如,要访问list中的第6个元素,必须从已知位置(如开始或结束)迭代到该位置,这需要以这些位置之间的距离为线性的时间。它们还消耗一些额外的内存来保持与每个元素相关联的链接信息(这可能是包含小型元素的大型的list的一个重要因素)。

容器的属性
按顺序排列的 
顺序容器中的元素按照严格的线性顺序排列。各个元素通过它们在该序列中的位置进行访问。
双向链接链表
每个元素都保存关于如何定位下一个和上一个元素的信息,允许在特定元素之前或之后(甚至是整个范围)进行固定时间的插入和删除操作,但不能直接随机访问。
能够感知的allocator
容器使用allocator对象动态处理其存储需求。

模板形参 
T
元素的类型。
别名为成员类型list::value_type。
Alloc
用于定义存储分配模型的allocator对象的类型。默认情况下,使用allocator类模板,它定义了最简单的内存分配模型,并且与值无关。
别名为成员类型list::allocator_type。

成员类型
C++98

member typedefinitionnotes
value_typeThe first template parameter (T)
allocator_typeThe second template parameter (Alloc)defaults to: allocator<value_type>
referenceallocator_type::referencefor the default allocator: value_type&
const_referenceallocator_type::const_referencefor the default allocator: const value_type&
pointerallocator_type::pointerfor the default allocator: value_type*
const_pointerallocator_type::const_pointerfor the default allocator: const value_type*
iteratorbidirectional iterator to value_typeconvertible to const_iterator
const_iteratorbidirectional iterator to const value_type
reverse_iteratorreverse_iterator<iterator>
const_reverse_iteratorreverse_iterator<const_iterator>
difference_typea signed integral type, identical to: iterator_traits<iterator>::difference_typeusually the same as ptrdiff_t
size_typean unsigned integral type that can represent any non-negative value of difference_typeusually the same as size_t

C++11

member typedefinitionnotes
value_typeThe first template parameter (T)
allocator_typeThe second template parameter (Alloc)defaults to: allocator<value_type>
referencevalue_type&
const_referenceconst value_type&
pointerallocator_traits<allocator_type>::pointerfor the default allocator: value_type*
const_pointerallocator_traits<allocator_type>::const_pointerfor the default allocator: const value_type*
iteratorbidirectional iterator to value_typeconvertible to const_iterator
const_iteratorbidirectional iterator to const value_type
reverse_iteratorreverse_iterator<iterator>
const_reverse_iteratorreverse_iterator<const_iterator>
difference_typea signed integral type, identical to:
iterator_traits<iterator>::difference_type
usually the same as ptrdiff_t
size_typean unsigned integral type that can represent any non-negative value of difference_typeusually the same as size_t

成员函数 
(constructor)    Construct list (public member function)
(destructor)   List destructor (public member function)
operator=    Assign content (public member function)

迭代器: 
begin    Return iterator to beginning (public member function)
end    Return iterator to end (public member function)
rbegin    Return reverse iterator to reverse beginning (public member function)
rend    Return reverse iterator to reverse end (public member function)
cbegin    Return const_iterator to beginning (public member function)
cend    Return const_iterator to end (public member function)
crbegin    Return const_reverse_iterator to reverse beginning (public member function)
crend    Return const_reverse_iterator to reverse end (public member function)

容量: 
empty    Test whether container is empty (public member function)
size    Return size (public member function)
max_size    Return maximum size (public member function)

元素访问: 
front    Access first element (public member function)
back    Access last element (public member function)

修改器: 
assign    Assign new content to container (public member function)
emplace_front    Construct and insert element at beginning (public member function)
push_front    Insert element at beginning (public member function)
pop_front    Delete first element (public member function)
emplace_back    Construct and insert element at the end (public member function)
push_back    Add element at the end (public member function)
pop_back    Delete last element (public member function)
emplace    Construct and insert element (public member function)
insert    Insert elements (public member function)
erase    Erase elements (public member function)
swap    Swap content (public member function)
resize    Change size (public member function)
clear    Clear content (public member function)

操作: 
splice    Transfer elements from list to list (public member function)
remove    Remove elements with specific value (public member function)
remove_if    Remove elements fulfilling condition (public member function template)
unique    Remove duplicate values (public member function)
merge    Merge sorted lists (public member function)
sort    Sort elements in container (public member function)
reverse    Reverse the order of elements (public member function)

观测器: 
get_allocator    Get allocator (public member function)

非成员函数重载 
relational operators (list)    Relational operators for list (function)
swap (list)    Exchanges the contents of two lists (function template) 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 打赏
    打赏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

weixin_40186813

你的能量无可限量。

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值