|
|
| list (const element_allocator_type &alloc) |
| |
|
| list (const list &source) |
| |
|
| list (const list &source, const allocator_type &alloc) |
| |
|
| list (const size_type fill_number, const element_type &element, const element_allocator_type &alloc=element_allocator_type()) |
| |
|
template<typename iterator_type > |
| | list (const typename plf_enable_if_c<!std::numeric_limits< iterator_type >::is_integer, iterator_type >::type &first, const iterator_type &last, const element_allocator_type &alloc=element_allocator_type()) |
| |
|
iterator | begin () PLF_LIST_NOEXCEPT |
| |
|
const_iterator | begin () const PLF_LIST_NOEXCEPT |
| |
|
iterator | end () PLF_LIST_NOEXCEPT |
| |
|
const_iterator | end () const PLF_LIST_NOEXCEPT |
| |
|
const_iterator | cbegin () const PLF_LIST_NOEXCEPT |
| |
|
const_iterator | cend () const PLF_LIST_NOEXCEPT |
| |
|
reverse_iterator | rbegin () const PLF_LIST_NOEXCEPT |
| |
|
reverse_iterator | rend () const PLF_LIST_NOEXCEPT |
| |
|
const_reverse_iterator | crbegin () const PLF_LIST_NOEXCEPT |
| |
|
const_reverse_iterator | crend () const PLF_LIST_NOEXCEPT |
| |
|
reference | front () |
| |
|
const_reference | front () const |
| |
|
reference | back () |
| |
|
const_reference | back () const |
| |
|
void | clear () PLF_LIST_NOEXCEPT |
| |
|
iterator | insert (const const_iterator it, const element_type &element) |
| |
|
PLF_LIST_FORCE_INLINE void | push_back (const element_type &element) |
| |
|
PLF_LIST_FORCE_INLINE void | push_front (const element_type &element) |
| |
|
iterator | insert (const_iterator position, const size_type number_of_elements, const element_type &element) |
| |
|
template<class iterator_type > |
| iterator | insert (const const_iterator position, typename plf_enable_if_c<!std::numeric_limits< iterator_type >::is_integer, iterator_type >::type first, const iterator_type last) |
| |
|
iterator | erase (const const_iterator it) |
| |
|
iterator | erase (const_iterator iterator1, const const_iterator iterator2) |
| |
|
void | pop_back () |
| |
|
void | pop_front () |
| |
|
list & | operator= (const list &source) |
| |
|
bool | operator== (const list &rh) const PLF_LIST_NOEXCEPT |
| |
|
bool | operator!= (const list &rh) const PLF_LIST_NOEXCEPT |
| |
|
bool | empty () const PLF_LIST_NOEXCEPT |
| |
|
size_type | size () const PLF_LIST_NOEXCEPT |
| |
|
size_type | max_size () const PLF_LIST_NOEXCEPT |
| |
|
size_type | capacity () const PLF_LIST_NOEXCEPT |
| |
|
size_type | memory () const PLF_LIST_NOEXCEPT |
| |
|
template<class comparison_function > |
| void | sort (comparison_function compare) |
| |
|
void | sort () |
| |
|
void | reorder (const iterator position, const iterator first, const iterator last) PLF_LIST_NOEXCEPT |
| |
|
void | reorder (const iterator position, const iterator location) PLF_LIST_NOEXCEPT |
| |
|
void | reserve (size_type reserve_amount) |
| |
|
PLF_LIST_FORCE_INLINE void | free_unused_memory () PLF_LIST_NOEXCEPT |
| |
|
void | shrink_to_fit () |
| |
|
void | splice (iterator position, list &source) |
| |
|
template<class comparison_function > |
| void | merge (list &source, comparison_function compare) |
| |
|
void | merge (list &source) |
| |
|
void | reverse () PLF_LIST_NOEXCEPT |
| |
|
template<class comparison_function > |
| size_type | unique (comparison_function compare) |
| |
|
size_type | unique () |
| |
|
template<class predicate_function > |
| size_type | remove_if (predicate_function predicate) |
| |
|
size_type | remove (const element_type &value) |
| |
|
void | resize (const size_type number_of_elements, const element_type &value=element_type()) |
| |
|
template<class iterator_type > |
| void | assign (const typename plf_enable_if_c<!std::numeric_limits< iterator_type >::is_integer, iterator_type >::type first, const iterator_type last) |
| |
|
void | assign (const size_type number_of_elements, const element_type &value) |
| |
|
allocator_type | get_allocator () const PLF_LIST_NOEXCEPT |
| |
|
iterator | unordered_find_single (const element_type &element_to_match) const PLF_LIST_NOEXCEPT |
| |
|
list< iterator > | unordered_find_multiple (const element_type &element_to_match, const size_type number_to_find) const |
| |
|
list< iterator > | unordered_find_all (const element_type &element_to_match) const |
| |
|
void | swap (list &source) PLF_LIST_NOEXCEPT_SWAP(allocator_type) |
| |