KEMBAR78
CPP STL Containers Functions | PDF
Scribd
Upload
4 views1 page

CPP STL Containers Functions

The document provides an overview of C++ Standard Template Library (STL) containers along with their corresponding headers and common functions. It lists various containers such as vector, list, deque, stack, queue, and others, detailing functions like push, pop, insert, and find. This serves as a quick reference for developers to understand the functionalities associated with each STL container.

Uploaded by

selvajenars44
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views1 page

CPP STL Containers Functions

The document provides an overview of C++ Standard Template Library (STL) containers along with their corresponding headers and common functions. It lists various containers such as vector, list, deque, stack, queue, and others, detailing functions like push, pop, insert, and find. This serves as a quick reference for developers to understand the functionalities associated with each STL container.

Uploaded by

selvajenars44
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

C++ STL Containers and Their Common Functions

STL Container Header Common Functions

vector <vector> push_back(), pop_back(), size(), at(), front(), back(), begin(),

end(), insert(), erase()

list <list> push_back(), push_front(), pop_back(), pop_front(), sort(),

reverse(), remove()

deque <deque> push_back(), push_front(), pop_back(), pop_front(), at(), front(),

back()

stack <stack> push(), pop(), top(), empty(), size()

queue <queue> push(), pop(), front(), back(), empty(), size()

priority_queue <queue> push(), pop(), top(), empty(), size()

set <set> insert(), find(), erase(), count(), size(), clear(), begin(), end()

unordered_set <unordered_set> insert(), find(), erase(), count(), size()

map <map> insert(), find(), erase(), [], count(), size(), begin(), end()

unordered_map <unordered_map> insert(), find(), erase(), [], count(), size()

multiset <set> insert(), erase(), count()

multimap <map> insert(), find(), count(), erase()

bitset <bitset> set(), reset(), flip(), test(), count(), size(), to_string()

array <array> at(), size(), front(), back(), fill(), begin(), end()

forward_list <forward_list> push_front(), pop_front(), insert_after(), erase_after()

You might also like