STL容器 成员函数 时间复杂度表
Sequence containers |
Associative containers |
|
||||||||
Headers |
<vector> |
<deque> |
<list> |
<set> |
|
<bitset> |
||||
Members |
complex |
vector |
deque |
list |
set |
multiset |
map |
multimap |
bitset |
|
constructor |
* |
constructor |
constructor |
constructor |
constructor |
constructor |
constructor |
constructor |
constructor |
|
destructor |
O(n) |
destructor |
destructor |
destructor |
destructor |
destructor |
destructor |
destructor |
||
operator= |
O(n) |
operator= |
operator= |
operator= |
operator= |
operator= |
operator= |
operator= |
operators |
|
iterators |
begin |
O(1) |
begin |
begin |
begin |
begin |
begin |
begin |
begin |
|
end |
O(1) |
end |
end |
end |
end |
end |
end |
end |
||
rbegin |
O(1) |
rbegin |
rbegin |
rbegin |
rbegin |
rbegin |
rbegin |
rbegin |
||
rend |
O(1) |
rend |
rend |
rend |
rend |
rend |
rend |
rend |
||
capacity |
size |
* |
size |
size |
size |
size |
size |
size |
size |
size |
max_size |
* |
max_size |
max_size |
max_size |
max_size |
max_size |
max_size |
max_size |
||
empty |
O(1) |
empty |
empty |
empty |
empty |
empty |
empty |
empty |
||
resize |
O(n) |
resize |
resize |
resize |
||||||
element access |
front |
O(1) |
front |
front |
front |
|||||
back |
O(1) |
back |
back |
back |
||||||
operator[] |
* |
operator[] |
operator[] |
operator[] |
operator[] |
|||||
at |
O(1) |
at |
at |
|||||||
modifiers |
assign |
O(n) |
assign |
assign |
assign |
|||||
insert |
* |
insert |
insert |
insert |
insert |
insert |
insert |
insert |
||
erase |
* |
erase |
erase |
erase |
erase |
erase |
erase |
erase |
||
swap |
O(1) |
swap |
swap |
swap |
swap |
swap |
swap |
swap |
||
clear |
O(n) |
clear |
clear |
clear |
clear |
clear |
clear |
clear |
||
push_front |
O(1) |
push_front |
push_front |
|||||||
pop_front |
O(1) |
pop_front |
pop_front |
|||||||
push_back |
O(1) |
push_back |
push_back |
push_back |
||||||
pop_back |
O(1) |
pop_back |
pop_back |
pop_back |
||||||
observers |
key_comp |
O(1) |
key_comp |
key_comp |
key_comp |
key_comp |
||||
value_comp |
O(1) |
value_comp |
value_comp |
value_comp |
value_comp |
|||||
operations |
find |
O(log n) |
find |
find |
find |
find |
||||
count |
O(log n) |
count |
count |
count |
count |
count |
||||
lower_bound |
O(log n) |
lower_bound |
lower_bound |
lower_bound |
lower_bound |
|||||
upper_bound |
O(log n) |
upper_bound |
upper_bound |
upper_bound |
upper_bound |
|||||
equal_range |
O(log n) |
equal_range |
equal_range |
equal_range |
equal_range |
|||||
unique members |
capacity |
splice |
set |
最新文章
- 【转】Android各大发布市场
- Python if 和 for 的多种写法
- display:inline-block 和float:left 的区别
- null 和 NULL 判断
- Verilog学习笔记基本语法篇(十三)...............Gate门
- [转]ASP.Net篇之Session与Cookie
- DELPHI控件:DBLookupComboBOX组件的使用方法
- How to Detect and Track Object With OpenCV
- EasyUI 在aspx页面显示高度不正常解决办法
- JavaScript 代码片段
- GET和POST的区别,就是明信片和信封的区别
- 第四章 USB库介绍
- 前端(js/jquery) 日期和时间戳的转换
- vmware克隆centos6.5 导致 system eth0 不可用解决办法
- Spark-用户应用程序入门
- js禁止默认的右键菜单或出现自定义右键菜单
- ubuntu安装greenplum依赖包
- .net C# 苹果消息推送 工具类
- <;!DOCTYPE>; 声明 引发的错误
- jQuery extend 方法使用 (转)