Chinaunix

标题: 关于c++ stl 容器 效率的比较 表格 [打印本页]

---

作者: titer1    时间: 2012-08-09 15:13
标题: 关于c++ stl 容器 效率的比较 表格


看到前面有个帖子在 问：是否知道stl里所有容器的各种操作效率和占用空间大小?
不懂，在google找到个表格，与大家共勉。

Member mapThis is a comparison chart with the different member functions present on each of the different containers:

			Sequence containers			Associative containers
Headers			<vector>	<deque>	<list>	<set>		<map>		<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)	[url=http://www.cplusplus.com/vector:perator=]operator=[/url]	[url=http://www.cplusplus.com/deque:perator=]operator=[/url]	[url=http://www.cplusplus.com/list:perator=]operator=[/url]	[url=http://www.cplusplus.com/set:perator=]operator=[/url]	[url=http://www.cplusplus.com/multiset:perator=]operator=[/url]	[url=http://www.cplusplus.com/map:perator=]operator=[/url]	[url=http://www.cplusplus.com/multimap:perator=]operator=[/url]	[url=http://www.cplusplus.com/bitset:perator]operators[/url]
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[]	*	[url=http://www.cplusplus.com/vector:perator[]]operator[][/url]	[url=http://www.cplusplus.com/deque:perator[]]operator[][/url]				[url=http://www.cplusplus.com/map::operator[]]operator[][/url]		[url=http://www.cplusplus.com/bitset::operator[]]operator[][/url]
	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 reserve		splice remove remove_if unique merge sort reverse					set reset flip to_ulong to_string test any none

Amortized complexity shown. Legend: O(1) constant < O(log n) logarithmic < O(n) linear; *=depends


来源：http://www.cplusplus.com/reference/stl/

---

作者: titer1    时间: 2012-08-09 15:19
不好意思，原来表格怎么 排版就是i 放不下。

要看文字的，请点连接

如果不方面，就看图片吧。

---

欢迎光临 Chinaunix (http://bbs.chinaunix.net/)

Powered by Discuz! X3.2