// -*- C++ -*- // Copyright (C) 2008 // Free Software Foundation, Inc. // // This file is part of the GNU ISO C++ Library. This library is free // software; you can redistribute it and/or modify it under the // terms of the GNU General Public License as published by the // Free Software Foundation; either version 2, or (at your option) // any later version. // This library is distributed in the hope that it will be useful, // but WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the // GNU General Public License for more details. // You should have received a copy of the GNU General Public License // along with this library; see the file COPYING. If not, write to // the Free Software Foundation, 51 Franklin Street, Fifth Floor, // Boston, MA 02110-1301, USA. // As a special exception, you may use this file as part of a free software // library without restriction. Specifically, if other files instantiate // templates or use macros or inline functions from this file, or you compile // this file and link it with other files to produce an executable, this // file does not by itself cause the resulting executable to be covered by // the GNU General Public License. This exception does not however // invalidate any other reasons why the executable file might be covered by // the GNU General Public License. /** @file forward_list * This is a Standard C++ Library header. */ #ifndef _GLIBCXX_FORWARD_LIST #define _GLIBCXX_FORWARD_LIST 1 #pragma GCC system_header #ifndef __GXX_EXPERIMENTAL_CXX0X__ # include #else #include #include namespace std { /** * @brief A helper basic node class for @forward_list. * This is just a linked list with nothing inside it. * There are purely list shuffling utility methods here. */ struct _Fwd_list_node_base { _Fwd_list_node_base(void) : _M_next(0) { } _Fwd_list_node_base* _M_next; void _M_transfer_after(_Fwd_list_node_base* __bbegin, _Fwd_list_node_base* __bend) { _Fwd_list_node_base* __keep = __bbegin->_M_next; __bbegin->_M_next = __bend->_M_next; __bend->_M_next = this->_M_next; this->_M_next = __keep; } void _M_transfer_after(_Fwd_list_node_base* __bbegin) { _Fwd_list_node_base* __bend = __bbegin; while (__bend && __bend->_M_next != 0) __bend = __bend->_M_next; _M_transfer_after(__bbegin, __bend); } void _M_reverse_after(void) { _Fwd_list_node_base* __tail = this->_M_next; if (! __tail) return; while(_Fwd_list_node_base* __temp = __tail->_M_next) { _Fwd_list_node_base* __keep = this->_M_next; this->_M_next = __temp; __tail->_M_next = __temp->_M_next; this->_M_next->_M_next = __keep; } } }; /** * @brief A helper node class for @forward_list. * This is just a linked list with a data value in each node. * There is a sorting utility method. */ struct _Fwd_list_node_base { template struct _Fwd_list_node : public _Fwd_list_node_base { _Fwd_list_node(const _Tp& __val) : _Fwd_list_node_base(), _M_value(__val) { } _Tp _M_value; template void _M_sort_after(_Comp __comp); }; /** * @brief A forward_list::iterator. * * All the functions are op overloads. */ template struct _Fwd_list_iterator { typedef _Fwd_list_iterator<_Tp> _Self; typedef _Fwd_list_node<_Tp> _Node; typedef _Tp value_type; typedef _Tp* pointer; typedef _Tp& reference; typedef ptrdiff_t difference_type; typedef std::forward_iterator_tag iterator_category; _Fwd_list_iterator(void) : _M_node() { } explicit _Fwd_list_iterator(_Fwd_list_node_base* __n) : _M_node(__n) { } reference operator*(void) const { return static_cast<_Node*>(_M_node)->_M_value; } pointer operator->(void) const { return &static_cast<_Node*>(_M_node)->_M_value; } _Self& operator++(void) { _M_node = _M_node->_M_next; return *this; } _Self operator++(int) { _Self __tmp(*this); _M_node = _M_node->_M_next; return __tmp; } bool operator==(const _Self& __x) const { return _M_node == __x._M_node; } bool operator!=(const _Self& __x) const { return _M_node != __x._M_node; } const _Self& _M_next(void) const { if (_M_node) return _Fwd_list_iterator(_M_node->_M_next); else return _Fwd_list_iterator(0); } _Fwd_list_node_base* _M_node; }; /** * @brief A forward_list::const_iterator. * * All the functions are op overloads. */ template struct _Fwd_list_const_iterator { typedef _Fwd_list_const_iterator<_Tp> _Self; typedef const _Fwd_list_node<_Tp> _Node; typedef _Fwd_list_iterator<_Tp> iterator; typedef _Tp value_type; typedef const _Tp* pointer; typedef const _Tp& reference; typedef ptrdiff_t difference_type; typedef std::forward_iterator_tag iterator_category; _Fwd_list_const_iterator(void) : _M_node() { } explicit _Fwd_list_const_iterator(const _Fwd_list_node_base* __n) : _M_node(__n) { } _Fwd_list_const_iterator(const iterator& __iter) : _M_node(__iter._M_node) { } reference operator*(void) const { return static_cast<_Node*>(_M_node)->_M_value; } pointer operator->(void) const { return &static_cast<_Node*>(_M_node)->_M_value; } _Self& operator++(void) { _M_node = _M_node->_M_next; return *this; } _Self operator++(int) { _Self __tmp(*this); _M_node = _M_node->_M_next; return __tmp; } bool operator==(const _Self& __x) const { return _M_node == __x._M_node; } bool operator!=(const _Self& __x) const { return _M_node != __x._M_node; } const _Self& _M_next(void) const { if (_M_node) return _Fwd_list_const_iterator(_M_node->_M_next); else return _Fwd_list_const_iterator(0); } const _Fwd_list_node_base* _M_node; }; /** * */ template inline bool operator==(const _Fwd_list_iterator<_Tp>& __x, const _Fwd_list_const_iterator<_Tp>& __y) { return __x._M_node == __y._M_node; } /** * */ template inline bool operator!=(const _Fwd_list_iterator<_Tp>& __x, const _Fwd_list_const_iterator<_Tp>& __y) { return __x._M_node != __y._M_node; } /** * @brief Base class for @forward_list. */ template struct _Fwd_list_base : public _Alloc::template rebind<_Fwd_list_node<_Tp>>::other { typedef typename _Alloc::template rebind<_Fwd_list_node<_Tp>>::other _Node_alloc; typedef _Alloc allocator_type; typedef _Fwd_list_iterator<_Tp> iterator; typedef _Fwd_list_const_iterator<_Tp> const_iterator; typedef _Fwd_list_node<_Tp> _Node; allocator_type get_allocator(void) const { return *static_cast(this); } _Fwd_list_base(const allocator_type& __a) : _Node_alloc(__a) { _M_head._M_next = 0; } ~_Fwd_list_base(void) { _M_erase_after(&_M_head, 0); } protected: _Fwd_list_node_base _M_head; _Node* _M_get_node(void) { return _Node_alloc::allocate(1); } template _Node* _M_create_node(_Args&&... __args) { _Node* __node = this->_M_get_node(); try { get_allocator().construct(&__node->_M_value, std::forward<_Args>(__args)...); __node->_M_next = 0; } catch(...) { this->_M_put_node(__node); __throw_exception_again; } return __node; } template void _M_insert_after(const_iterator __pos, _Args&&... __args) { _Fwd_list_node_base* __to = const_cast<_Fwd_list_node_base* const>(__pos._M_node); _Node* __thing = _M_create_node(std::forward<_Args>(__args)...); __thing->_M_next = __to->_M_next; __to->_M_next = __thing; } void _M_put_node(_Node* __p) { _Node_alloc::deallocate(__p, 1); } _Fwd_list_node_base* _M_erase_after(_Fwd_list_node_base* __pos) { _Node* __curr = static_cast<_Node*>(__pos->_M_next); _Fwd_list_node_base* __next = __curr->_M_next; __pos->_M_next = __next; get_allocator().destroy(&__curr->_M_value); _M_put_node(__curr); return __next; } _Fwd_list_node_base* _M_erase_after(_Fwd_list_node_base* __pos, _Fwd_list_node_base* __last) { _Node* __curr = static_cast<_Node*>(__pos->_M_next); while (__curr != __last) { _Node* __temp = __curr; __curr = static_cast<_Node*>(__curr->_M_next); get_allocator().destroy(&__temp->_M_value); _M_put_node(__temp); } __pos->_M_next = __last; return __last; } }; /** * @brief A standard container with linear time access to elements, * and fixed time insertion/deletion at any point in the sequence. * * @ingroup Containers * @ingroup Sequences * * Meets the requirements of a container, a * sequence, including the * optional sequence requirements with the * %exception of @c at and @c operator[]. * * This is a @e singly @e linked %list. Traversal up and down the * %list requires linear time, but adding and removing elements (or * @e nodes) is done in constant time, regardless of where the * change takes place. Unlike std::vector and std::deque, * random-access iterators are not provided, so subscripting ( @c * [] ) access is not allowed. For algorithms which only need * sequential access, this lack makes no difference. * * Also unlike the other standard containers, std::forward_list provides * specialized algorithms %unique to linked lists, such as * splicing, sorting, and in-place reversal. * * A couple points on memory allocation for forward_list: * * First, we never actually allocate a Tp, we allocate * List_node's and trust [20.1.5]/4 to DTRT. This is to ensure * that after elements from %forward_list are spliced into * %forward_list, destroying the memory of the second %list is a * valid operation, i.e., Alloc1 giveth and Alloc2 taketh away. */ template > class forward_list : private _Fwd_list_base<_Tp,_Alloc> { private: typedef _Fwd_list_base<_Tp,_Alloc> _Base; public: // types: typedef typename _Alloc::reference reference; typedef typename _Alloc::const_reference const_reference; typedef _Fwd_list_iterator<_Tp> iterator; typedef _Fwd_list_const_iterator<_Tp> const_iterator; typedef size_t size_type; typedef ptrdiff_t difference_type; typedef _Tp value_type; typedef typename _Base::allocator_type allocator_type; typedef typename _Alloc::pointer pointer; typedef typename _Alloc::const_pointer const_pointer; // 23.2.3.1 construct/copy/destroy: /** * @brief Creates a %list with no elements. * @param al An allocator object. */ explicit forward_list(const _Alloc& __al = _Alloc()) : _Base(__al) { return; } /** * @brief Creates a %forward_list with copies of the default element type. * @param n The number of elements to initially create. * * This constructor fills the %forward_list with @a n copies of * the default value. */ explicit forward_list(size_type __n) : _Base(_Alloc()) { _Fwd_list_node_base* __to = &this->_M_head; for (size_type __i = 0; __i < __n; ++__i) { __to->_M_next = _M_create_node(_Tp()); __to = __to->_M_next; } return; } /** * @brief Creates a %forward_list with copies of an exemplar element. * @param n The number of elements to initially create. * @param value An element to copy. * @param al An allocator object. * * This constructor fills the %forward_list with @a n copies of @a value. */ forward_list(size_type __n, const _Tp& __value, const _Alloc& __al = _Alloc()) : _Base(__al) { _Fwd_list_node_base* __to = &this->_M_head; for (size_type __i = 0; __i < __n; ++__i) { __to->_M_next = _M_create_node(__value); __to = __to->_M_next; } return; } /** * @brief Builds a %forward_list from a range. * @param first An input iterator. * @param last An input iterator. * @param al An allocator object. * * Create a %forward_list consisting of copies of the elements from * [@a first,@a last). This is linear in N (where N is * distance(@a first,@a last)). */ template forward_list(_InputIterator __first, _InputIterator __last, const _Alloc& __al = _Alloc()) : _Base(__al) { _Fwd_list_node_base* __to = &this->_M_head; _InputIterator __curr = __first; while (__curr != __last) { __to->_M_next = _M_create_node(*__curr); __to = __to->_M_next; ++__curr; } return; } /** * @brief The %forward_list copy constructor. * @param list A %forward_list of identical element and allocator types. * * The newly-created %forward_list uses a copy of the allocation object * used by @a list. */ forward_list(const forward_list<_Tp,_Alloc>& __list) : _Base(__list.get_allocator()) { const _Fwd_list_node_base* __from = &__list._M_head; _Fwd_list_node_base* __to = &this->_M_head; while (__from->_M_next != 0) { const _Node* __temp = static_cast<_Node*>(__from->_M_next); __to->_M_next = _M_create_node(__temp->_M_value); __from = __from->_M_next; __to = __to->_M_next; } return; } /** * @brief The %forward_list move constructor. * @param list A %forward_list of identical element and allocator types. * * The newly-created %forward_list contains the exact contents of @a list. * The contents of @a list are a valid, but unspecified %forward_list. */ forward_list(forward_list<_Tp,_Alloc>&& __list) : _Base(std::move(__list.get_allocator())) { const _Fwd_list_node_base* __from = &std::move(__list._M_head); _Fwd_list_node_base* __to = &this->_M_head; while (__from->_M_next != 0) { const _Node* __temp = static_cast<_Node*>(__from->_M_next); __to->_M_next = _M_create_node(__temp->_M_value); __from = __from->_M_next; __to = __to->_M_next; } return; } /** * @brief Builds a %forward_list from an initializer_list * @param il An initializer_list of value_type. * @param al An allocator object. * * Create a %forward_list consisting of copies of the elements in the * initializer_list @a il. This is linear in il.size(). */ forward_list(std::initializer_list<_Tp> __il, const _Alloc& __al = _Alloc()) : _Base(__al) { _Fwd_list_node_base* __to = &this->_M_head; for (const _Tp* __item = __il.begin(); __item != __il.end(); ++__item) { __to->_M_next = _M_create_node(*__item); __to = __to->_M_next; } return; } /** * @brief The forward_list dtor. */ ~forward_list(void) { _M_erase_after(&this->_M_head, 0); } /** * @brief The %forward_list assignment operator. * @param list A %forward_list of identical element and allocator types. * * All the elements of @a list are copied, but unlike the copy * constructor, the allocator object is not copied. */ forward_list<_Tp,_Alloc>& operator=(const forward_list<_Tp,_Alloc>& __list) { if (&__list != this) { iterator __prev1 = before_begin(); iterator __curr1 = begin(); iterator __last1 = end(); const_iterator __first2 = __list.cbegin(); const_iterator __last2 = __list.cend(); while (__curr1 != __last1 && __first2 != __last2) { *__curr1 = *__first2; ++__prev1; ++__curr1; ++__first2; } if (__first2 == __last2) erase_after(__prev1, __last1); else insert_after(__prev1, __first2, __last2); } return *this; } /** * @brief The %forward_list move assignment operator. * @param list A %forward_list of identical element and allocator types. * * The contents of @a list are moved into this %forward_list (without copying). * @a list is a valid, but unspecified %forward_list */ forward_list<_Tp,_Alloc>& operator=(forward_list<_Tp,_Alloc>&& __list) { if (&__list != this) { this->clear(); this->swap(__list); } return *this; } /** * @brief The %forward_list initializer list assignment operator. * @param il An initializer_list of value_type. * * Replace the contents of the %forward_list with copies of the elements * in the initializer_list @a il. This is linear in il.size(). */ forward_list operator=(std::initializer_list<_Tp> __il) { assign(__il); return *this; } /** * @brief Assigns a range to a %forward_list. * @param first An input iterator. * @param last An input iterator. * * This function fills a %forward_list with copies of the elements in the * range [@a first,@a last). * * Note that the assignment completely changes the %forward_list and * that the resulting %forward_list's size is the same as the number of * elements assigned. Old data may be lost. */ template void assign(InputIterator __first, InputIterator __last) { clear(); insert_after(cbefore_begin(), __first, __last); } /** * @brief Assigns a given value to a %forward_list. * @param n Number of elements to be assigned. * @param val Value to be assigned. * * This function fills a %forward_list with @a n copies of the given * value. Note that the assignment completely changes the %forward_list * and that the resulting %forward_list's size is the same as the number * of elements assigned. Old data may be lost. */ void assign(size_type __n, const _Tp& __val) { clear(); insert_after(cbefore_begin(), __n, __val); } /** * @brief Assigns an initializer_list to a %forward_list. * @param il An initializer_list of value_type. * * Replace the contents of the %forward_list with copies of the elements * in the initializer_list @a il. This is linear in il.size(). */ void assign(std::initializer_list<_Tp> __il) { clear(); insert_after(cbefore_begin(), __il); } /// Get a copy of the memory allocation object. allocator_type get_allocator(void) const { return _Base::get_allocator(); } // 23.2.3.2 iterators: /** * Returns a read/write iterator that points before the first element * in the %forward_list. Iteration is done in ordinary element order. */ iterator before_begin(void) { return iterator(&this->_M_head); } /** * Returns a read-only (constant) iterator that points before the first * element in the %forward_list. Iteration is done in ordinary element order. */ const_iterator before_begin(void) const { return const_iterator(&this->_M_head); } /** * Returns a read/write iterator that points to the first element * in the %forward_list. Iteration is done in ordinary element order. */ iterator begin(void) { return iterator(this->_M_head._M_next); } /** * Returns a read-only (constant) iterator that points to the first * element in the %forward_list. Iteration is done in ordinary element order. */ const_iterator begin(void) const { return const_iterator(this->_M_head._M_next); } /** * Returns a read/write iterator that points one past the last * element in the %forward_list. Iteration is done in ordinary element * order. */ iterator end(void) { return iterator(0); } /** * Returns a read-only iterator that points one past the last * element in the %forward_list. Iteration is done in ordinary element * order. */ const_iterator end(void) const { return const_iterator(0); } /** * Returns a read-only (constant) iterator that points to the * first element in the %forward_list. Iteration is done in ordinary * element order. */ const_iterator cbegin(void) const { return const_iterator(this->_M_head._M_next); } /** * Returns a read-only (constant) iterator that points before the * first element in the %forward_list. Iteration is done in ordinary * element order. */ const_iterator cbefore_begin(void) const { return const_iterator(&this->_M_head); } /** * Returns a read-only (constant) iterator that points one past * the last element in the %forward_list. Iteration is done in ordinary * element order. */ const_iterator cend(void) const { return const_iterator(0); } /** * Returns true if the %forward_list is empty. (Thus begin() would equal * end().) */ bool empty(void) const { return this->_M_head._M_next == 0; } /** * Returns the largest possible size of %forward_list. */ size_type max_size(void) const { return _Alloc().max_size(); } // 23.2.3.3 element access: /** * Returns a read/write reference to the data at the first * element of the %forward_list. */ reference front(void) { _Node* __front = static_cast<_Node*>(this->_M_head._M_next); return __front->_M_value; } /** * Returns a read-only (constant) reference to the data at the first * element of the %forward_list. */ const_reference front(void) const { _Node* __front = static_cast<_Node*>(this->_M_head._M_next); return __front->_M_value; } // 23.2.3.4 modiļ¬ers: /** * @brief Constructs object in %forward_list at the front of the list. * @param args Arguments. * * This function will insert an object of type T constructed * with T(std::forward(args)...) at the front of the list * Due to the nature of a %forward_list this operation can * be done in constant time, and does not invalidate iterators * and references. */ template void emplace_front(_Args&&... __args) { _M_insert_after(cbefore_begin(), std::forward<_Args>(__args)...); } /** * @brief Add data to the front of the %forward_list. * @param val Data to be added. * * This is a typical stack operation. The function creates an * element at the front of the %forward_list and assigns the given data * to it. Due to the nature of a %forward_list this operation can be * done in constant time, and does not invalidate iterators and * references. */ void push_front(const _Tp& __val) { _M_insert_after(cbefore_begin(), __val); } /** * */ void push_front(_Tp&& __val) { _M_insert_after(cbefore_begin(), std::move(__val)); } /** * @brief Removes first element. * * This is a typical stack operation. It shrinks the %forward_list by * one. Due to the nature of a %forward_list this operation can be done * in constant time, and only invalidates iterators/references to * the element being removed. * * Note that no data is returned, and if the first element's data * is needed, it should be retrieved before pop_front() is * called. */ void pop_front(void) { _M_erase_after(&this->_M_head); return; } /** * @brief Constructs object in %forward_list after the specified iterator. * @param pos A const_iterator into the %forward_list. * @param args Arguments. * @return An iterator that points to the inserted data. * * This function will insert an object of type T constructed * with T(std::forward(args)...) after the specified * location. Due to the nature of a %forward_list this operation can * be done in constant time, and does not invalidate iterators * and references. */ template iterator emplace_after(const_iterator __pos, _Args&&... __args) { _M_insert_after(__pos, std::forward<_Args>(__args)...); } /** * @brief Inserts given value into %forward_list after specified iterator. * @param pos An iterator into the %forward_list. * @param val Data to be inserted. * @return An iterator that points to the inserted data. * * This function will insert a copy of the given value after * the specified location. Due to the nature of a %forward_list this * operation can be done in constant time, and does not * invalidate iterators and references. */ iterator insert_after(const_iterator __pos, const _Tp& __val) { _Fwd_list_node_base* __to = const_cast<_Fwd_list_node_base* const>(__pos._M_node); _Node* __thing = _M_create_node(__val); __thing->_M_next = __to->_M_next; __to->_M_next = __thing; return iterator(__to->_M_next); } /** * */ iterator insert_after(const_iterator __pos, _Tp&& __val) { _Fwd_list_node_base* __to = const_cast<_Fwd_list_node_base* const>(__pos._M_node); _Node* __thing = _M_create_node(std::move(__val)); __thing->_M_next = __to->_M_next; __to->_M_next = __thing; return iterator(__to->_M_next); } /** * @brief Inserts a number of copies of given data into the %forward_list. * @param pos An iterator into the %list. * @param n Number of elements to be inserted. * @param val Data to be inserted. * * This function will insert a specified number of copies of the * given data after the location specified by @a pos. * * This operation is linear in the number of elements inserted and * does not invalidate iterators and references. */ void insert_after(const_iterator __pos, size_type __n, const _Tp& __val) { _Fwd_list_node_base* __to = const_cast<_Fwd_list_node_base* const>(__pos._M_node); _Fwd_list_node_base* __keep = __to->_M_next; for (size_type __i = 0; __i < __n; ++__i) { __to->_M_next = _M_create_node(__val); __to = __to->_M_next; } __to->_M_next = __keep; return; } /** * @brief Inserts a range into the %forward_list. * @param position An iterator into the %forward_list. * @param first An input iterator. * @param last An input iterator. * * This function will insert copies of the data in the range [@a * first,@a last) into the %forward_list after the location specified by * @a position. * * This operation is linear in the number of elements inserted and * does not invalidate iterators and references. */ template void insert_after(const_iterator __pos, _InputIterator __first, _InputIterator __last) { _Fwd_list_node_base* __to = const_cast<_Fwd_list_node_base* const>(__pos._M_node); _Fwd_list_node_base* __keep = __to->_M_next; _InputIterator __curr = __first; while (__curr != __last) { __to->_M_next = _M_create_node(*__curr); __to = __to->_M_next; ++__curr; } __to->_M_next = __keep; return; } /** * @brief Inserts the contents of an initializer_list into %forward_list * after the specified iterator. * @param pos An iterator into the %forward_list. * @param il An initializer_list of value_type. * * This function will insert copies of the data in the * initializer_list @a il into the %forward_list before the location * specified by @a pos. * * This operation is linear in the number of elements inserted and * does not invalidate iterators and references. */ void insert_after(const_iterator __pos, std::initializer_list<_Tp> __il) { _Fwd_list_node_base* __to = const_cast<_Fwd_list_node_base* const>(__pos._M_node); _Fwd_list_node_base* __keep = __to->_M_next; const _Tp* __item = __il.begin(); while (__item != __il.end()) { __to->_M_next = _M_create_node(*__item); __to = __to->_M_next; ++__item; } __to->_M_next = __keep; return; } /** * @brief Removes the element pointed to by the iterator following @c pos. * @param pos Iterator pointing to element to be erased. * @return An iterator pointing to the next element (or end()). * * This function will erase the element at the given position and thus * shorten the %forward_list by one. * * Due to the nature of a %forward_list this operation can be done in * constant time, and only invalidates iterators/references to * the element being removed. The user is also cautioned that * this function only erases the element, and that if the element * is itself a pointer, the pointed-to memory is not touched in * any way. Managing the pointer is the user's responsibility. */ iterator erase_after(const_iterator __pos) { _Fwd_list_node_base* __temp = const_cast<_Fwd_list_node_base* const>(__pos._M_node); if (__temp) return iterator(_Base::_M_erase_after(__temp)); else return end(); } /** * @brief Remove a range of elements. * @param pos Iterator pointing before the first element to be erased. * @param last Iterator pointing to one past the last element to be * erased. * @return An iterator pointing to the element pointed to by @a last * prior to erasing (or end()). * * This function will erase the elements in the range @a * (pos,last) and shorten the %forward_list accordingly. * * This operation is linear time in the size of the range and only * invalidates iterators/references to the element being removed. * The user is also cautioned that this function only erases the * elements, and that if the elements themselves are pointers, the * pointed-to memory is not touched in any way. Managing the pointer * is the user's responsibility. */ iterator erase_after(const_iterator __pos, iterator __last) { _Fwd_list_node_base* __temp = const_cast<_Fwd_list_node_base* const>(__pos._M_node); return iterator(_M_erase_after(__temp, __last._M_node)); } /** * @brief Swaps data with another %forward_list. * @param list A %forward_list of the same element and allocator types. * * This exchanges the elements between two lists in constant * time. Note that the global std::swap() function is * specialized such that std::swap(l1,l2) will feed to this * function. */ void swap(forward_list<_Tp,_Alloc>&& __list) { // I'm sure I'm missing something here. _Fwd_list_node_base* __temp_node = this->_M_head._M_next; this->_M_head._M_next = __list._M_head._M_next; __list._M_head._M_next = __temp_node; // 431. Swapping containers with unequal allocators. ///@todo FIXME //std::swap(this->get_allocator(), __list.get_allocator()); //_Alloc __temp_alloc = _M_alloc; //_M_alloc = __list._M_alloc; //__list._M_alloc = __temp_alloc; } /** * @brief Resizes the %forward_list to the specified number of elements. * @param sz Number of elements the %forward_list should contain. * * This function will %resize the %forward_list to the specified number * of elements. If the number is smaller than the %forward_list's * current size the %forward_list is truncated, otherwise the %forward_list is * extended and new elements are populated with given data. */ void resize(size_type __sz) { resize(__sz, _Tp(0)); } /** * @brief Resizes the %forward_list to the specified number of elements. * @param sz Number of elements the %forward_list should contain. * @param val Data with which new elements should be populated. * * This function will %resize the %forward_list to the specified number * of elements. If the number is smaller than the %forward_list's * current size the %forward_list is truncated, otherwise the %forward_list is * extended and new elements are populated with given data. */ void resize(size_type __sz, value_type __val) { iterator __k = before_begin(); size_type __len = 0; while (__k._M_next() != end() && __len < __sz) { ++__k; ++__len; } if (__len == __sz) erase_after(__k, end()); else insert_after(__k, __sz - __len, __val); } /** * @brief Erases all the elements. * * Note that this function only erases * the elements, and that if the elements themselves are * pointers, the pointed-to memory is not touched in any way. * Managing the pointer is the user's responsibility. */ void clear(void) { _M_erase_after(&this->_M_head, 0); } // 23.2.3.5 forward_list operations: /** * @brief Insert contents of another %forward_list. * @param pos Iterator referencing the element to insert after. * @param list Source list. * * The elements of @a list are inserted in constant time after * the element referenced by @a pos. @a list becomes an empty * list. * * Requires this != @a x. */ void splice_after(const_iterator __pos, forward_list<_Tp,_Alloc>&& __list) { if (!__list.empty()) { _Fwd_list_node_base* __temp = const_cast<_Fwd_list_node_base* const>(__pos._M_node); const_iterator __before = __list.cbefore_begin(); __temp->_M_transfer_after(const_cast<_Fwd_list_node_base* const>(__before._M_node)); } } /** * @brief Insert element from another %forward_list. * @param pos Iterator referencing the element to insert after. * @param list Source list. * @param it Iterator referencing the element before the element to move. * * Removes the element in list @a list referenced by @a i and * inserts it into the current list after @a pos. */ void splice_after(const_iterator __pos, forward_list<_Tp,_Alloc>&& __list, const_iterator __it) { this->splice_after(__pos, __list, __it, __it._M_next()); } /** * @brief Insert range from another %forward_list. * @param pos Iterator referencing the element to insert after. * @param list Source list. * @param before Iterator referencing before the start of range in list. * @param last Iterator referencing the end of range in list. * * Removes elements in the range (before,last) and inserts them * after @a pos in constant time. * * Undefined if @a pos is in (before,last). */ void splice_after(const_iterator __pos, forward_list<_Tp,_Alloc>&& __list, const_iterator __before, const_iterator __last) { _Fwd_list_node_base* __temp = const_cast<_Fwd_list_node_base* const>(__pos._M_node); __temp->_M_transfer_after(const_cast<_Fwd_list_node_base* const>(__before._M_node), const_cast<_Fwd_list_node_base* const>(__last._M_node)); } /** * @brief Remove all elements equal to value. * @param val The value to remove. * * Removes every element in the list equal to @a value. * Remaining elements stay in list order. Note that this * function only erases the elements, and that if the elements * themselves are pointers, the pointed-to memory is not * touched in any way. Managing the pointer is the user's * responsibility. */ void remove(const _Tp& __val) { _Node* __curr = static_cast<_Node*>(&this->_M_head); while (_Node* __temp = static_cast<_Node*>(__curr->_M_next)) { if (__temp->_M_value == __val) _M_erase_after(__curr); else __curr = static_cast<_Node*>(__curr->_M_next); } } /** * @brief Remove all elements satisfying a predicate. * @param pred Unary predicate function or object. * * Removes every element in the list for which the predicate * returns true. Remaining elements stay in list order. Note * that this function only erases the elements, and that if the * elements themselves are pointers, the pointed-to memory is * not touched in any way. Managing the pointer is the user's * responsibility. */ template void remove_if(_Pred __pred) { _Node* __curr = static_cast<_Node*>(&this->_M_head); while (_Node* __temp = static_cast<_Node*>(__curr->_M_next)) { if (__pred(__temp->_M_value)) _M_erase_after(__curr); else __curr = static_cast<_Node*>(__curr->_M_next); } } /** * @brief Remove consecutive duplicate elements. * * For each consecutive set of elements with the same value, * remove all but the first one. Remaining elements stay in * list order. Note that this function only erases the * elements, and that if the elements themselves are pointers, * the pointed-to memory is not touched in any way. Managing * the pointer is the user's responsibility. */ void unique(void) { iterator __first = begin(); iterator __last = end(); if (__first == __last) return; iterator __next = __first; while (++__next != __last) { if (*__first == *__next) erase_after(__first); else __first = __next; __next = __first; } } /** * @brief Remove consecutive elements satisfying a predicate. * @param binary_pred Binary predicate function or object. * * For each consecutive set of elements [first,last) that * satisfy predicate(first,i) where i is an iterator in * [first,last), remove all but the first one. Remaining * elements stay in list order. Note that this function only * erases the elements, and that if the elements themselves are * pointers, the pointed-to memory is not touched in any way. * Managing the pointer is the user's responsibility. */ template void unique(_BinPred __binary_pred) { iterator __first = begin(); iterator __last = end(); if (__first == __last) return; iterator __next = __first; while (++__next != __last) { if (__binary_pred(*__first, *__next)) erase_after(__first); else __first = __next; __next = __first; } } /** * @brief Merge sorted lists. * @param list Sorted list to merge. * * Assumes that both @a list and this list are sorted according to * operator<(). Merges elements of @a list into this list in * sorted order, leaving @a list empty when complete. Elements in * this list precede elements in @a list that are equal. */ void merge(forward_list<_Tp,_Alloc>&& __list) { this->merge(__list, std::less<_Tp>()); } /** * @brief Merge sorted lists according to comparison function. * @param list Sorted list to merge. * @param comp Comparison function defining sort order. * * Assumes that both @a list and this list are sorted according to * comp. Merges elements of @a list into this list * in sorted order, leaving @a list empty when complete. Elements * in this list precede elements in @a list that are equivalent * according to comp(). */ template void merge(forward_list<_Tp,_Alloc>&& __list, _Comp __comp) { _Fwd_list_node_base* __node = &this->_M_head; while (__node->_M_next && __list._M_head._M_next) { if (__comp(static_cast<_Node*>(__list._M_head._M_next)->_M_value, static_cast<_Node*>(__node->_M_next)->_M_value)) __node->_M_transfer_after(&__list._M_head, __list._M_head._M_next); __node = __node->_M_next; } if (__list._M_head._M_next) { __node->_M_next = __list._M_head._M_next; __list._M_head._M_next = 0; } } /** * @brief Sort the elements of the list. * * Sorts the elements of this list in NlogN time. Equivalent * elements remain in list order. */ void sort(void) { _Node* _temp = static_cast<_Node*>(&this->_M_head); _temp->_M_sort_after(std::less<_Tp>()); } /** * @brief Sort the forward_list using a comparison function. * * Sorts the elements of this list in NlogN time. Equivalent * elements remain in list order. */ template void sort(_Comp __comp) { _Node* _temp = static_cast<_Node*>(&this->_M_head); _temp->_M_sort_after(__comp); } /** * @brief Reverse the elements in list. * * Reverse the order of elements in the list in linear time. */ void reverse(void) { this->_M_head._M_reverse_after(); } private: typedef _Fwd_list_node<_Tp> _Node; }; /** * @brief Forward list equality comparison. * @param lx A %forward_list * @param ly A %forward_list of the same type as @a lx. * @return True iff the size and elements of the forward lists are equal. * * This is an equivalence relation. It is linear in the size of the * forward lists. Deques are considered equivalent if corresponding * elements compare equal. */ template inline bool operator==(const forward_list<_Tp,_Alloc>& __lx, const forward_list<_Tp,_Alloc>& __ly) { // We don't have size() so we need to walk through both lists // making sure both iterators are valid. typename std::forward_list<_Tp,_Alloc>::const_iterator __ix = __lx.cbegin(); typename std::forward_list<_Tp,_Alloc>::const_iterator __iy = __ly.cbegin(); while (__ix != __lx.cend() && __iy != __ly.cend()) { if (*__ix != *__iy) return false; ++__ix; ++__iy; } if (__ix == __lx.cend() && __iy == __ly.cend()) return true; else return false; } /** * @brief Forward list ordering relation. * @param lx A %forward_list. * @param ly A %forward_list of the same type as @a lx. * @return True iff @a lx is lexicographically less than @a ly. * * This is a total ordering relation. It is linear in the size of the * forward lists. The elements must be comparable with @c <. * * See std::lexicographical_compare() for how the determination is made. */ template inline bool operator<(const forward_list<_Tp,_Alloc>& __lx, const forward_list<_Tp,_Alloc>& __ly) { return std::lexicographical_compare(__lx.cbegin(), __lx.cend(), __ly.cbegin(), __ly.cend()); } /// Based on operator== template inline bool operator!=(const forward_list<_Tp,_Alloc>& __lx, const forward_list<_Tp,_Alloc>& __ly) { return ! (__lx == __ly); } /// Based on operator< template inline bool operator>(const forward_list<_Tp,_Alloc>& __lx, const forward_list<_Tp,_Alloc>& __ly) { return (__ly < __lx); } /// Based on operator< template inline bool operator>=(const forward_list<_Tp,_Alloc>& __lx, const forward_list<_Tp,_Alloc>& __ly) { return ! (__lx < __ly); } /// Based on operator< template inline bool operator<=(const forward_list<_Tp,_Alloc>& __lx, const forward_list<_Tp,_Alloc>& __ly) { return ! (__ly < __lx); } /// See std::list::forward_swap(). template inline void swap(forward_list<_Tp,_Alloc>& __lx, forward_list<_Tp,_Alloc>& __ly) { __lx.swap(__ly); } /// See std::list::forward_swap(). template inline void swap(forward_list<_Tp,_Alloc>&& __lx, forward_list<_Tp,_Alloc>& __ly) { __lx.swap(__ly); } /// See std::list::forward_swap(). template inline void swap(forward_list<_Tp,_Alloc>& __lx, forward_list<_Tp,_Alloc>&& __ly) { __lx.swap(__ly); } } // namespace std #include "forward_list.tcc" #endif // __GXX_EXPERIMENTAL_CXX0X__ #endif // _GLIBCXX_FORWARD_LIST