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>
45 template<typename _Comp>
48 _M_sort_after(_Comp __comp)
50 // If `next' is 0, return immediately.
51 _Fwd_list_node* __list = static_cast<_Fwd_list_node*>(this->_M_next);
55 unsigned long __insize = 1;
59 _Fwd_list_node* __p = __list;
61 _Fwd_list_node* __tail = 0;
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.
71 _Fwd_list_node* __q = __p;
72 unsigned long __psize = 0;
73 for (unsigned long __i = 0; __i < __insize; ++__i)
76 __q = static_cast<_Fwd_list_node*>(__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.
88 _Fwd_list_node<_Tp>* __e;
91 // p is empty; e must come from q.
93 __q = static_cast<_Fwd_list_node*>(__q->_M_next);
96 else if (__qsize == 0 || !__q)
98 // q is empty; e must come from p.
100 __p = static_cast<_Fwd_list_node*>(__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_cast<_Fwd_list_node*>(__p->_M_next);
112 // First node of q is lower; e must come from q.
114 __q = static_cast<_Fwd_list_node*>(__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 _Fwd_list_node_base* __to = &this->_M_impl._M_head;
151 _Node* __curr = static_cast<_Node*>(__lst._M_impl._M_head._M_next);
154 __to->_M_next = _M_create_node(__curr->_M_value);
155 __to = __to->_M_next;
156 __curr = static_cast<_Node*>(__curr->_M_next);
160 template<typename _Tp, typename _Alloc>
161 template<typename... _Args>
163 _Fwd_list_base<_Tp, _Alloc>::
164 _M_insert_after(const_iterator __pos, _Args&&... __args)
166 _Fwd_list_node_base* __to
167 = const_cast<_Fwd_list_node_base*>(__pos._M_node);
168 _Node* __thing = _M_create_node(std::forward<_Args>(__args)...);
169 __thing->_M_next = __to->_M_next;
170 __to->_M_next = __thing;
171 return __to->_M_next;
174 template<typename _Tp, typename _Alloc>
176 _Fwd_list_base<_Tp, _Alloc>::
177 _M_erase_after(_Fwd_list_node_base* __pos)
179 _Node* __curr = static_cast<_Node*>(__pos->_M_next);
182 _Fwd_list_node_base* __next = __curr->_M_next;
183 __pos->_M_next = __next;
184 _M_get_Node_allocator().destroy(__curr);
190 template<typename _Tp, typename _Alloc>
192 _Fwd_list_base<_Tp, _Alloc>::
193 _M_erase_after(_Fwd_list_node_base* __pos, _Fwd_list_node_base* __last)
195 _Node* __curr = static_cast<_Node*>(__pos->_M_next);
198 _Node* __temp = __curr;
199 __curr = static_cast<_Node*>(__curr->_M_next);
200 _M_get_Node_allocator().destroy(__temp);
202 __pos->_M_next = __curr;
203 if (__temp == __last)
209 // Called by the range constructor to implement [23.1.1]/9
210 template<typename _Tp, typename _Alloc>
211 template<typename _InputIterator>
213 forward_list<_Tp, _Alloc>::
214 _M_initialize_dispatch(_InputIterator __first, _InputIterator __last,
217 _Fwd_list_node_base* __to = &this->_M_impl._M_head;
218 for (; __first != __last; ++__first)
220 __to->_M_next = this->_M_create_node(*__first);
221 __to = __to->_M_next;
225 // Called by forward_list(n,v,a), and the range constructor
226 // when it turns out to be the same thing.
227 template<typename _Tp, typename _Alloc>
229 forward_list<_Tp, _Alloc>::
230 _M_fill_initialize(size_type __n, const value_type& __value)
232 _Fwd_list_node_base* __to = &this->_M_impl._M_head;
233 for (; __n > 0; --__n)
235 __to->_M_next = this->_M_create_node(__value);
236 __to = __to->_M_next;
240 template<typename _Tp, typename _Alloc>
241 forward_list<_Tp, _Alloc>&
242 forward_list<_Tp, _Alloc>::
243 operator=(const forward_list& __list)
247 iterator __prev1 = before_begin();
248 iterator __curr1 = begin();
249 iterator __last1 = end();
250 const_iterator __first2 = __list.cbegin();
251 const_iterator __last2 = __list.cend();
252 while (__curr1 != __last1 && __first2 != __last2)
254 *__curr1 = *__first2;
259 if (__first2 == __last2)
260 erase_after(__prev1, __last1);
262 insert_after(__prev1, __first2, __last2);
267 template<typename _Tp, typename _Alloc>
269 forward_list<_Tp, _Alloc>::
270 resize(size_type __sz, value_type __val)
272 iterator __k = before_begin();
275 while (__k._M_next() != end() && __len < __sz)
281 erase_after(__k, end());
283 insert_after(__k, __sz - __len, __val);
286 template<typename _Tp, typename _Alloc>
288 forward_list<_Tp, _Alloc>::
289 splice_after(const_iterator __pos, forward_list&& __list)
291 if (!__list.empty() && &__list != this)
293 _Fwd_list_node_base* __tmp
294 = const_cast<_Fwd_list_node_base*>(__pos._M_node);
295 const_iterator __before = __list.cbefore_begin();
296 __tmp->_M_transfer_after(const_cast<_Fwd_list_node_base*>
301 template<typename _Tp, typename _Alloc>
303 forward_list<_Tp, _Alloc>::
304 splice_after(const_iterator __pos, forward_list&& __list,
305 const_iterator __before, const_iterator __last)
307 _Fwd_list_node_base* __tmp
308 = const_cast<_Fwd_list_node_base*>(__pos._M_node);
309 __tmp->_M_transfer_after(const_cast<_Fwd_list_node_base*>
311 const_cast<_Fwd_list_node_base*>
315 template<typename _Tp, typename _Alloc>
317 forward_list<_Tp, _Alloc>::
318 remove(const _Tp& __val)
320 _Node* __curr = static_cast<_Node*>(&this->_M_impl._M_head);
321 while (_Node* __temp = static_cast<_Node*>(__curr->_M_next))
323 if (__temp->_M_value == __val)
324 this->_M_erase_after(__curr);
326 __curr = static_cast<_Node*>(__curr->_M_next);
330 template<typename _Tp, typename _Alloc>
331 template<typename _Pred>
333 forward_list<_Tp, _Alloc>::
334 remove_if(_Pred __pred)
336 _Node* __curr = static_cast<_Node*>(&this->_M_impl._M_head);
337 while (_Node* __temp = static_cast<_Node*>(__curr->_M_next))
339 if (__pred(__temp->_M_value))
340 this->_M_erase_after(__curr);
342 __curr = static_cast<_Node*>(__curr->_M_next);
346 template<typename _Tp, typename _Alloc>
347 template<typename _BinPred>
349 forward_list<_Tp, _Alloc>::
350 unique(_BinPred __binary_pred)
352 iterator __first = begin();
353 iterator __last = end();
354 if (__first == __last)
356 iterator __next = __first;
357 while (++__next != __last)
359 if (__binary_pred(*__first, *__next))
360 erase_after(__first);
367 template<typename _Tp, typename _Alloc>
368 template<typename _Comp>
370 forward_list<_Tp, _Alloc>::
371 merge(forward_list&& __list, _Comp __comp)
373 _Fwd_list_node_base* __node = &this->_M_impl._M_head;
374 while (__node->_M_next && __list._M_impl._M_head._M_next)
376 if (__comp(static_cast<_Node*>
377 (__list._M_impl._M_head._M_next)->_M_value,
379 (__node->_M_next)->_M_value))
380 __node->_M_transfer_after(&__list._M_impl._M_head,
381 __list._M_impl._M_head._M_next);
382 __node = __node->_M_next;
384 if (__list._M_impl._M_head._M_next)
386 __node->_M_next = __list._M_impl._M_head._M_next;
387 __list._M_impl._M_head._M_next = 0;
391 template<typename _Tp, typename _Alloc>
393 forward_list<_Tp, _Alloc>::
395 { this->_M_impl._M_head._M_reverse_after(); }
397 template<typename _Tp, typename _Alloc>
399 operator==(const forward_list<_Tp, _Alloc>& __lx,
400 const forward_list<_Tp, _Alloc>& __ly)
402 // We don't have size() so we need to walk through both lists
403 // making sure both iterators are valid.
404 auto __ix = __lx.cbegin();
405 auto __iy = __ly.cbegin();
406 while (__ix != __lx.cend() && __iy != __ly.cend())
413 if (__ix == __lx.cend() && __iy == __ly.cend())
419 _GLIBCXX_END_NAMESPACE // namespace std
421 #endif /* _FORWARD_LIST_TCC */