Single linked list or so-called linked list consists of individual elements, where each individual will be mutually connected. Each element consists of two parts, namely the data / information that is stored and the other as a liaison with the next element.
Let's See The Library of List :
reference :
http://www.cppreference.com/wiki/container:list:start
Member types
Member type | Definition |
value_type | : T |
allocator_type | : Allocator |
size_type | : Unsigned integral type (usually size_t ) |
difference_type | : Signed integral type (usually ptrdiff_t ) |
reference | : Allocator::reference |
const_reference | : Allocator::const_reference |
pointer | : Allocator::pointer |
const_pointer | : Allocator::const_pointer |
iterator | : Bidirectional iterator |
const_iterator | : Constant bidirectional iterator |
reverse_iterator | : reverse_iterator<iterator> |
const_reverse_iterator | : reverse_iterator<const_iterator> |
front | : access the first element |
back | : access the last element |
begin, cbegin | : returns an iterator to the beginning |
end, cend | : returns an iterator to the end |
rbegin, crbegin | : returns a reverse_iterator to the beginning of reversed container |
rend, crend | : returns a reverse_iterator to the end of reversed container |
empty | : checks whether the container is empty |
size | : returns the number of elements |
max_size | : returns the maximum number of elements |
merge | : merges two sorted lists |
splice | : moves the elements between containers |
remove | : removes elements with specific value |
remove_if | : removes elements meeting specific criteria |
reverse | : reverses the order of the elements |
unique | : removes consecutive duplicate elements |
sort | : sorts the elements | | | |
0 comments on Library of List In C++ language :
Post a Comment and Don't Spam!
Dont Spam please