This header is part of the containers library.
Classes | |
| doubly-linked list (class template) | |
Functions | |
| lexicographically compares the values in the list (function template) | |
specializes the std::swap algorithm (function template) | |
Synopsis
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 | namespace std { #include <initializer_list> template <class T, class Allocator = allocator<T> > class list; template <class T, class Allocator> bool operator==(const list<T,Allocator>& x, const list<T,Allocator>& y);template <class T, class Allocator> bool operator< (const list<T,Allocator>& x, const list<T,Allocator>& y);template <class T, class Allocator> bool operator!=(const list<T,Allocator>& x, const list<T,Allocator>& y);template <class T, class Allocator> bool operator> (const list<T,Allocator>& x, const list<T,Allocator>& y);template <class T, class Allocator> bool operator>=(const list<T,Allocator>& x, const list<T,Allocator>& y);template <class T, class Allocator> bool operator<=(const list<T,Allocator>& x, const list<T,Allocator>& y); template <class T, class Allocator> void swap(list<T,Allocator>& x, list<T,Allocator>& y); } |
Class std::list
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 | template <class T, class Allocator = allocator<T> >class list {public: // types: typedef value_type& reference; typedef const value_type& const_reference; typedef /*implementation-defined*/ iterator; typedef /*implementation-defined*/ const_iterator; typedef /*implementation-defined*/ size_type; typedef /*implementation-defined*/ difference_type; typedef T value_type; typedef Allocator allocator_type; typedef typename allocator_traits<Allocator>::pointer pointer; typedef typename allocator_traits<Allocator>::const_pointer const_pointer; typedef std::reverse_iterator<iterator> reverse_iterator; typedef std::reverse_iterator<const_iterator> const_reverse_iterator; // construct/copy/destroy: explicit list(const Allocator& = Allocator()); explicit list(size_type n); list(size_type n, const T& value,const Allocator& = Allocator()); template <class InputIterator> list(InputIterator first, InputIterator last,const Allocator& = Allocator()); list(const list<T,Allocator>& x); list(list&&); list(const list&, const Allocator&); list(list&&, const Allocator&); list(initializer_list<T>, const Allocator& = Allocator()); ~list(); list<T,Allocator>& operator=(const list<T,Allocator>& x); list<T,Allocator>& operator=(list<T,Allocator>&& x); list& operator=(initializer_list<T>); template <class InputIterator> void assign(InputIterator first, InputIterator last); void assign(size_type n, const T& t); void assign(initializer_list<T>); allocator_type get_allocator() const noexcept; // iterators: iterator begin() noexcept; const_iterator begin() const noexcept; iterator end() noexcept; const_iterator end() const noexcept; reverse_iterator rbegin() noexcept; const_reverse_iterator rbegin() const noexcept; reverse_iterator rend() noexcept; const_reverse_iterator rend() const noexcept; const_iterator cbegin() const noexcept; const_iterator cend() const noexcept; const_reverse_iterator crbegin() const noexcept; const_reverse_iterator crend() const noexcept; // capacity: size_type size() const noexcept; size_type max_size() const noexcept; void resize(size_type sz); void resize(size_type sz, const T& c); bool empty() const noexcept; // element access: reference front(); const_reference front() const; reference back(); const_reference back() const; // modifiers: template <class... Args> void emplace_front(Args&&... args); void pop_front(); template <class... Args> void emplace_back(Args&&... args); void push_front(const T& x); void push_front(T&& x); void push_back(const T& x); void push_back(T&& x); void pop_back(); template <class... Args> iterator emplace(const_iterator position, Args&&... args); iterator insert(const_iterator position, const T& x); iterator insert(const_iterator position, T&& x); iterator insert(const_iterator position, size_type n, const T& x); template <class InputIterator> iterator insert (const_iterator position, InputIterator first, InputIterator last); iterator insert(const_iterator position, initializer_list<T>); iterator erase(const_iterator position); iterator erase(const_iterator first, const_iterator last); void swap(list<T,Allocator>&); void clear() noexcept; // list operations: void splice(const_iterator position, list<T,Allocator>& x); void splice(const_iterator position, list<T,Allocator>&& x); void splice(const_iterator position, list<T,Allocator>& x, const_iterator i); void splice(const_iterator position, list<T,Allocator>&& x, const_iterator i); void splice(const_iterator position, list<T,Allocator>& x, const_iterator first, const_iterator last); void splice(const_iterator position, list<T,Allocator>&& x, const_iterator first, const_iterator last); void remove(const T& value); template <class Predicate> void remove_if(Predicate pred); void unique(); template <class BinaryPredicate> void unique(BinaryPredicate binary_pred); void merge(list<T,Allocator>& x); void merge(list<T,Allocator>&& x); template <class Compare> void merge(list<T,Allocator>& x, Compare comp); template <class Compare> void merge(list<T,Allocator>&& x, Compare comp); void sort(); template <class Compare> void sort(Compare comp); void reverse() noexcept;}; |
Please login to continue.