Containers library

From cppreference.com

The Containers library is a generic collection of class templates and algorithms that allow programmers to easily implement common data structures like queues, lists and stacks. There are three classes of containers -- sequence containers, associative containers, and unordered associative containers -- each of which is designed to support a different set of operations.

The container manages the storage space that is allocated for its elements and provides member functions to access them, either directly or through iterators (objects with similar properties to pointers).

Most containers have at least several member functions in common, and share functionalities. Which container is the best for the particular application depends not only on the offered functionality, but also on its efficiency for different workloads.


unordered_set (since C++11)	collection of unique keys, hashed by keys (class template)

unordered_map (since C++11)	collection of key-value pairs, hashed by keys, keys are unique (class template)

unordered_multiset (since C++11)	collection of keys, hashed by keys (class template)

unordered_multimap (since C++11)	collection of key-value pairs, hashed by keys (class template)

[edit] Container adaptors

Container adaptors provide a different interface for sequential containers.


stack	adapts a container to provide stack (LIFO data structure) (class template)

queue	adapts a container to provide queue (FIFO data structure) (class template)

priority_queue	adapts a container to provide priority queue (class template)

[edit] Member function table

	- functions present in C++03
	- functions present since C++11

Sequence containers Associative containers Unordered associative containers Container adaptors

Headers <array> <vector> <deque> <forward_list> <list> <set> <map> <unordered_set> <unordered_map> <stack> <queue>

array

vector

deque

forward_list

list

set

map

stack

queue

priority_queue

(constructor)

(implicit)

vector

deque

forward_list

list

set

map

stack

queue

priority_queue

(destructor)

(implicit)

~vector

~deque

~forward_list

~list

~set

~multiset

~map

~multimap

~unordered_set

~unordered_multiset

~unordered_map

~unordered_multimap

~stack

~queue

~priority_queue

operator=

(implicit)

operator=

assign

N/A

assign

N/A

Iterators

begin

cbegin

begin

begin

begin

begin

begin

begin

begin

begin

begin

begin

begin

begin

begin

N/A

end

cend

end

cend

end

cend

end

cend

end

cend

end

cend

end

cend

end

cend

end

cend

end

cend

end

cend

end

cend

end

cend

end

cend

N/A

rbegin

crbegin

N/A

N/A

rend

crend

rend

crend

rend

crend

rend

crend

N/A

rend

crend

rend

crend

rend

crend

rend

crend

rend

crend

N/A

Element
access

at

N/A

at

N/A

at

N/A

operator[]

N/A

operator[]

N/A

operator[]

N/A

front

N/A

front

top

back

N/A

back

N/A

top

back

N/A

Capacity

empty

size

N/A

size

max_size

N/A

resize

N/A

resize

N/A

capacity

N/A

capacity

N/A

reserve

N/A

reserve

N/A

reserve

N/A

shrink_to_fit

N/A

shrink_to_fit

N/A

Modifiers

clear

N/A

clear

N/A

insert

N/A

insert

insert_after

insert

N/A

emplace

N/A

emplace

emplace_after

emplace

N/A

emplace_hint

N/A

emplace_hint

N/A

erase

N/A

erase

erase_after

erase

N/A

push_front

N/A

push_front

N/A

emplace_front

N/A

emplace_front

N/A

pop_front

N/A

pop_front

N/A

pop

N/A

push_back

N/A

push_back

N/A

push_back

N/A

push

emplace_back

N/A

emplace_back

N/A

emplace_back

N/A

emplace

pop_back

N/A

pop_back

N/A

pop_back

N/A

pop

N/A

pop

swap

List operations

merge

N/A

merge

N/A

splice

N/A

splice

N/A

remove

N/A

remove

N/A

remove_if

N/A

remove_if

N/A

reverse

N/A

reverse

N/A

unique

N/A

unique

N/A

sort

N/A

sort

N/A

Lookup

count

N/A

count

N/A

find

N/A

find

N/A

lower_bound

N/A

lower_bound

N/A

upper_bound

N/A

upper_bound

N/A

equal_range

N/A

equal_range

N/A

Observers

key_comp

N/A

key_comp

N/A

value_comp

N/A

value_comp

N/A

hash_function

N/A

hash_function

N/A

key_eq

N/A

key_eq

N/A

Allocator

get_allocator

N/A

get_allocator

N/A

array

vector

deque

forward_list

list

set

map

stack

queue

priority_queue

Sequence containers Associative containers Unordered associative containers Container adaptors

Language
Concepts
Utilities library
Strings library
Containers library
Algorithms library
Iterators library
Numerics library
Input/output library
Localizations library
Regular expressions library (C++11)
Atomic operations library (C++11)
Thread support library (C++11)


array (since C++11)	static contiguous array (class template)

vector	dynamic contiguous array (class template)

deque	double-ended queue (class template)

forward_list (since C++11)	singly-linked list (class template)

list	doubly-linked list (class template)

Containers library

Contents

[edit] Sequence containers

[edit] Associative containers

[edit] Unordered associative containers

[edit] Container adaptors

[edit] Member function table


set	collection of unique keys, sorted by keys (class template)

map	collection of key-value pairs, sorted by keys, keys are unique (class template)

multiset	collection of keys, sorted by keys (class template)

multimap	collection of key-value pairs, sorted by keys (class template)