1 // <forward_list.tcc> -*- C++ -*-
3 // Copyright (C) 2008 Free Software Foundation, Inc.
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the
7 // terms of the GNU General Public License as published by the
8 // Free Software Foundation; either version 2, or (at your option)
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 // GNU General Public License for more details.
16 // You should have received a copy of the GNU General Public License
17 // along with this library; see the file COPYING. If not, write to
18 // the Free Software Foundation, 51 Franklin Street, Fifth Floor,
19 // Boston, MA 02110-1301, USA.
21 // As a special exception, you may use this file as part of a free software
22 // library without restriction. Specifically, if other files instantiate
23 // templates or use macros or inline functions from this file, or you compile
24 // this file and link it with other files to produce an executable, this
25 // file does not by itself cause the resulting executable to be covered by
26 // the GNU General Public License. This exception does not however
27 // invalidate any other reasons why the executable file might be covered by
28 // the GNU General Public License.
30 /** @file forward_list.tcc
31 * This is a Standard C++ Library header.
34 #ifndef _FORWARD_LIST_TCC
35 #define _FORWARD_LIST_TCC 1
37 _GLIBCXX_BEGIN_NAMESPACE(std)
40 * @brief Sort the singly linked list starting after this node.
41 * This node is assumed to be an empty head node (of type
42 * _Fwd_list_node_base).
44 template<typename _Tp, class _Alloc>
45 template<typename _Comp>
47 _Fwd_list_node<_Tp, _Alloc>::
48 _M_sort_after(_Comp __comp)
50 // If `next' is 0, return immediately.
51 _Pointer __list = __static_pointer_cast<_Pointer>(this->_M_next);
55 unsigned long __insize = 1;
59 _Pointer __p = __list;
63 // Count number of merges we do in this pass.
64 unsigned long __nmerges = 0;
69 // There exists a merge to be done.
70 // Step `insize' places along from p.
72 unsigned long __psize = 0;
73 for (unsigned long __i = 0; __i < __insize; ++__i)
76 __q = __static_pointer_cast<_Pointer>(__q->_M_next);
81 // If q hasn't fallen off end, we have two lists to merge.
82 unsigned long __qsize = __insize;
84 // Now we have two lists; merge them.
85 while (__psize > 0 || (__qsize > 0 && __q))
87 // Decide whether next node of merge comes from p or q.
91 // p is empty; e must come from q.
93 __q = __static_pointer_cast<_Pointer>(__q->_M_next);
96 else if (__qsize == 0 || !__q)
98 // q is empty; e must come from p.
100 __p = __static_pointer_cast<_Pointer>(__p->_M_next);
103 else if (__comp(__p->_M_value, __q->_M_value))
105 // First node of p is lower; e must come from p.
107 __p = __static_pointer_cast<_Pointer>(__p->_M_next);
112 // First node of q is lower; e must come from q.
114 __q = __static_pointer_cast<_Pointer>(__q->_M_next);
118 // Add the next node to the merged list.
120 __tail->_M_next = __e;
126 // Now p has stepped `insize' places along, and q has too.
131 // If we have done only one merge, we're finished.
132 // Allow for nmerges == 0, the empty list case.
135 this->_M_next = __list;
139 // Otherwise repeat, merging lists twice the size.
144 template<typename _Tp, typename _Alloc>
145 _Fwd_list_base<_Tp, _Alloc>::
146 _Fwd_list_base(const _Fwd_list_base& __lst, const _Alloc& __a)
149 this->_M_impl._M_head._M_next = 0;
150 typename _Node_base::_Pointer __to = &this->_M_impl._M_head;
151 typename _Node::_Pointer __curr
152 = __static_pointer_cast<typename _Node::_Pointer>
153 (__lst._M_impl._M_head._M_next);
156 __to->_M_next = _M_create_node(__curr->_M_value);
157 __to = __to->_M_next;
158 __curr = __static_pointer_cast<typename _Node::_Pointer>
163 template<typename _Tp, typename _Alloc>
164 template<typename... _Args>
165 typename _Fwd_list_base<_Tp, _Alloc>::_Node_base::_Pointer
166 _Fwd_list_base<_Tp, _Alloc>::
167 _M_insert_after(const_iterator __pos, _Args&&... __args)
169 typename _Node_base::_Pointer __to
170 = __const_pointer_cast<typename _Node_base::_Pointer>
172 typename _Node::_Pointer __thing
173 = __static_pointer_cast<typename _Node::_Pointer>(
174 _M_create_node(std::forward<_Args>(__args)...) );
175 __thing->_M_next = __to->_M_next;
176 __to->_M_next = __thing;
177 return __static_pointer_cast<typename _Node_base::_Pointer>
181 template<typename _Tp, typename _Alloc>
182 typename _Fwd_list_base<_Tp, _Alloc>::_Node_base::_Pointer
183 _Fwd_list_base<_Tp, _Alloc>::
184 _M_erase_after(typename _Node_base::_Pointer __pos)
186 typename _Node::_Pointer __curr
187 = __static_pointer_cast<typename _Node::_Pointer>(__pos->_M_next);
190 typename _Node_base::_Pointer __next = __curr->_M_next;
191 __pos->_M_next = __next;
192 _M_get_Node_allocator().destroy(__curr);
198 template<typename _Tp, typename _Alloc>
199 typename _Fwd_list_base<_Tp, _Alloc>::_Node_base::_Pointer
200 _Fwd_list_base<_Tp, _Alloc>::
201 _M_erase_after(typename _Node_base::_Pointer __pos,
202 typename _Node_base::_Pointer __last)
204 typename _Node::_Pointer __curr
205 = __static_pointer_cast<typename _Node::_Pointer>(__pos->_M_next);
208 typename _Node::_Pointer __temp = __curr;
209 __curr = __static_pointer_cast<typename _Node::_Pointer>
211 _M_get_Node_allocator().destroy(__temp);
213 __pos->_M_next = __curr;
214 if (__temp == __last)
220 // Called by the range constructor to implement [23.1.1]/9
221 template<typename _Tp, typename _Alloc>
222 template<typename _InputIterator>
224 forward_list<_Tp, _Alloc>::
225 _M_initialize_dispatch(_InputIterator __first, _InputIterator __last,
228 typename _Node_base::_Pointer __to = &this->_M_impl._M_head;
229 for (; __first != __last; ++__first)
231 __to->_M_next = this->_M_create_node(*__first);
232 __to = __to->_M_next;
236 // Called by forward_list(n,v,a), and the range constructor
237 // when it turns out to be the same thing.
238 template<typename _Tp, typename _Alloc>
240 forward_list<_Tp, _Alloc>::
241 _M_fill_initialize(size_type __n, const value_type& __value)
243 typename _Node_base::_Pointer __to = &this->_M_impl._M_head;
244 for (; __n > 0; --__n)
246 __to->_M_next = this->_M_create_node(__value);
247 __to = __to->_M_next;
251 template<typename _Tp, typename _Alloc>
252 forward_list<_Tp, _Alloc>&
253 forward_list<_Tp, _Alloc>::
254 operator=(const forward_list& __list)
258 iterator __prev1 = before_begin();
259 iterator __curr1 = begin();
260 iterator __last1 = end();
261 const_iterator __first2 = __list.cbegin();
262 const_iterator __last2 = __list.cend();
263 while (__curr1 != __last1 && __first2 != __last2)
265 *__curr1 = *__first2;
270 if (__first2 == __last2)
271 erase_after(__prev1, __last1);
273 insert_after(__prev1, __first2, __last2);
278 template<typename _Tp, typename _Alloc>
280 forward_list<_Tp, _Alloc>::
281 resize(size_type __sz, value_type __val)
283 iterator __k = before_begin();
286 while (__k._M_next() != end() && __len < __sz)
292 erase_after(__k, end());
294 insert_after(__k, __sz - __len, __val);
297 template<typename _Tp, typename _Alloc>
299 forward_list<_Tp, _Alloc>::
300 splice_after(const_iterator __pos, forward_list&& __list)
302 if (!__list.empty() && &__list != this)
304 typename _Node_base::_Pointer __tmp
305 = __const_pointer_cast<typename _Node_base::_Pointer>
307 const_iterator __before = __list.cbefore_begin();
308 __tmp->_M_transfer_after(__const_pointer_cast
309 <typename _Node_base::_Pointer>
314 template<typename _Tp, typename _Alloc>
316 forward_list<_Tp, _Alloc>::
317 splice_after(const_iterator __pos, forward_list&& __list,
318 const_iterator __before, const_iterator __last)
320 typename _Node_base::_Pointer __tmp
321 = __const_pointer_cast<typename _Node_base::_Pointer>(__pos._M_node);
322 __tmp->_M_transfer_after(__const_pointer_cast
323 <typename _Node_base::_Pointer>
326 <typename _Node_base::_Pointer>
330 template<typename _Tp, typename _Alloc>
332 forward_list<_Tp, _Alloc>::
333 remove(const _Tp& __val)
335 typename _Node::_Pointer __curr
336 = __static_pointer_cast<typename _Node::_Pointer>
337 (&this->_M_impl._M_head);
338 while (typename _Node::_Pointer __temp =
339 __static_pointer_cast<typename _Node::_Pointer>(__curr->_M_next))
341 if (__temp->_M_value == __val)
342 this->_M_erase_after(__curr);
344 __curr = __static_pointer_cast<typename _Node::_Pointer>
349 template<typename _Tp, typename _Alloc>
350 template<typename _Pred>
352 forward_list<_Tp, _Alloc>::
353 remove_if(_Pred __pred)
355 typename _Node::_Pointer __curr
356 = __static_pointer_cast<typename _Node::_Pointer>
357 (&this->_M_impl._M_head);
358 while (typename _Node::_Pointer __temp =
359 __static_pointer_cast<typename _Node::_Pointer>(__curr->_M_next))
361 if (__pred(__temp->_M_value))
362 this->_M_erase_after(__curr);
364 __curr = __static_pointer_cast<typename _Node::_Pointer>
369 template<typename _Tp, typename _Alloc>
370 template<typename _BinPred>
372 forward_list<_Tp, _Alloc>::
373 unique(_BinPred __binary_pred)
375 iterator __first = begin();
376 iterator __last = end();
377 if (__first == __last)
379 iterator __next = __first;
380 while (++__next != __last)
382 if (__binary_pred(*__first, *__next))
383 erase_after(__first);
390 template<typename _Tp, typename _Alloc>
391 template<typename _Comp>
393 forward_list<_Tp, _Alloc>::
394 merge(forward_list&& __list, _Comp __comp)
396 typename _Node_base::_Pointer __node = &this->_M_impl._M_head;
397 while (__node->_M_next && __list._M_impl._M_head._M_next)
399 if (__comp(__static_pointer_cast<typename _Node::_Pointer>
400 (__list._M_impl._M_head._M_next)->_M_value,
401 __static_pointer_cast<typename _Node::_Pointer>
402 (__node->_M_next)->_M_value))
403 __node->_M_transfer_after(&__list._M_impl._M_head,
404 __list._M_impl._M_head._M_next);
405 __node = __node->_M_next;
407 if (__list._M_impl._M_head._M_next)
409 __node->_M_next = __list._M_impl._M_head._M_next;
410 __list._M_impl._M_head._M_next = 0;
414 template<typename _Tp, typename _Alloc>
416 forward_list<_Tp, _Alloc>::
418 { this->_M_impl._M_head._M_reverse_after(); }
420 template<typename _Tp, typename _Alloc>
422 operator==(const forward_list<_Tp, _Alloc>& __lx,
423 const forward_list<_Tp, _Alloc>& __ly)
425 // We don't have size() so we need to walk through both lists
426 // making sure both iterators are valid.
427 auto __ix = __lx.cbegin();
428 auto __iy = __ly.cbegin();
429 while (__ix != __lx.cend() && __iy != __ly.cend())
436 if (__ix == __lx.cend() && __iy == __ly.cend())
442 _GLIBCXX_END_NAMESPACE // namespace std
444 #endif /* _FORWARD_LIST_TCC */