Container Creates an empty slist. slist(size_type n) Sequence Creates an slist with n elements, each of which is a copy of T(). slist(size_type n, const T& t) Sequence Creates an slist with n copies of t. slist(const slist&) Container The copy constructor. template <class InputIterator> slist(InputIterator f, InputIterator l) [3] Sequence Creates an slist with a copy of a range. ~slist() Container The destructor. slist& operator=(const slist&) Container The assignment operator void swap(slist&) Container Swaps the contents of two slists. reference front() Front Insertion Sequence Returns the first element. const_reference front() const Front Insertion Sequence Returns the first element. void push_front(const T&) Front Insertion Sequence Inserts a new element at the beginning. void pop_front() Front Insertion Sequence Removes the first element. iterator previous(iterator pos) slist See below const_iterator previous(const_iterator pos) slist See below iterator insert(iterator pos, const T& x) Sequence Inserts x before pos. template<class InputIterator> void insert(iterator pos, InputIterator f, InputIterator l) [3] Sequence Inserts the range [first, last) before pos. void insert(iterator pos, size_type n, const value_type& x) Sequence Inserts n copies of x before pos. iterator erase(iterator pos) Sequence Erases the element at position pos. iterator erase(iterator first, iterator last) Sequence Erases the range [first, last)
Добавить отзыв
ВСЕ ОТЗЫВЫ О КНИГЕ В ИЗБРАННОЕ

0

Вы можете отметить интересные вам фрагменты текста, которые будут доступны по уникальной ссылке в адресной строке браузера.

Отметить Добавить цитату