[thirdparty/gcc.git] / libstdc++-v3 / include / bits / forward_list.tcc

// <forward_list.tcc> -*- C++ -*-

// Copyright (C) 2008, 2009 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 3, 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.

// Under Section 7 of GPL version 3, you are granted additional
// permissions described in the GCC Runtime Library Exception, version
// 3.1, as published by the Free Software Foundation.

// You should have received a copy of the GNU General Public License and
// a copy of the GCC Runtime Library Exception along with this program;
// see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
// <http://www.gnu.org/licenses/>.

/** @file forward_list.tcc
 *  This is a Standard C++ Library header.
 */

#ifndef _FORWARD_LIST_TCC
#define _FORWARD_LIST_TCC 1

_GLIBCXX_BEGIN_NAMESPACE(std)

  template<typename _Alloc>
    void
    _Fwd_list_node_base<_Alloc>::
    _M_transfer_after(_Pointer __bbegin)
    {
      _Pointer __bend = __bbegin;
      while (__bend && __bend->_M_next)
	__bend = __bend->_M_next;
      _M_transfer_after(__bbegin, __bend);
    }

  template<typename _Alloc>
    void
    _Fwd_list_node_base<_Alloc>::
    _M_transfer_after(_Pointer __bbegin, _Pointer __bend)
    {
      _Pointer __keep = __bbegin->_M_next;
      if (__bend)
	{
	  __bbegin->_M_next = __bend->_M_next;
	  __bend->_M_next = _M_next;
	}
      else
	__bbegin->_M_next = 0;
      _M_next = __keep;
    }
 
  template<typename _Alloc>
    void
    _Fwd_list_node_base<_Alloc>::
    _M_reverse_after()
    {
      _Pointer __tail = _M_next;
      if (!__tail)
	return;
      while (_Pointer __temp = __tail->_M_next)
	{
	  _Pointer __keep = _M_next;
	  _M_next = __temp;
	  __tail->_M_next = __temp->_M_next;
	  _M_next->_M_next = __keep;
	}
    }

  template<typename _Tp, typename _Alloc>
    _Fwd_list_base<_Tp, _Alloc>::
    _Fwd_list_base(const _Fwd_list_base& __lst, const _Alloc& __a)
    : _M_impl(__a)
    {
      this->_M_impl._M_head._M_next = 0;
      typename _Node_base::_Pointer __to = &this->_M_impl._M_head;
      typename _Node::_Pointer __curr 
        = __static_pointer_cast<typename _Node::_Pointer>
                               (__lst._M_impl._M_head._M_next);
      while (__curr)
        {
          __to->_M_next = _M_create_node(__curr->_M_value);
          __to = __to->_M_next;
          __curr = __static_pointer_cast<typename _Node::_Pointer>
                                        (__curr->_M_next);
        }
    }

  template<typename _Tp, typename _Alloc>
    template<typename... _Args>
      typename _Fwd_list_base<_Tp, _Alloc>::_Node_base::_Pointer
      _Fwd_list_base<_Tp, _Alloc>::
      _M_insert_after(const_iterator __pos, _Args&&... __args)
      {
        typename _Node_base::_Pointer __to 
          = __const_pointer_cast<typename _Node_base::_Pointer>
                                (__pos._M_node);
        typename _Node::_Pointer __thing 
          = __static_pointer_cast<typename _Node::_Pointer>( 
                _M_create_node(std::forward<_Args>(__args)...) );
        __thing->_M_next = __to->_M_next;
        __to->_M_next = __thing;
        return __static_pointer_cast<typename _Node_base::_Pointer>
                                    (__to->_M_next);
      }

  template<typename _Tp, typename _Alloc>
    void
    _Fwd_list_base<_Tp, _Alloc>::
    _M_erase_after(typename _Node_base::_Pointer __pos)
    {
      typename _Node::_Pointer __curr
        = __static_pointer_cast<typename _Node::_Pointer>(__pos->_M_next);
      __pos->_M_next = __curr->_M_next;
      _M_get_Node_allocator().destroy(__curr);
      _M_put_node(__curr);
    }

  template<typename _Tp, typename _Alloc>
    void
    _Fwd_list_base<_Tp, _Alloc>::
    _M_erase_after(typename _Node_base::_Pointer __pos, 
                   typename _Node_base::_Pointer __last)
    {
      typename _Node::_Pointer __curr 
        = __static_pointer_cast<typename _Node::_Pointer>(__pos->_M_next);
      while (__curr != __last)
        {
          typename _Node::_Pointer __temp = __curr;
          __curr = __static_pointer_cast<typename _Node::_Pointer>
                                        (__curr->_M_next);
          _M_get_Node_allocator().destroy(__temp);
          _M_put_node(__temp);
        }
      __pos->_M_next = __last;
    }
  
  // Called by the range constructor to implement [23.1.1]/9
  template<typename _Tp, typename _Alloc>
    template<typename _InputIterator>
      void
      forward_list<_Tp, _Alloc>::
      _M_initialize_dispatch(_InputIterator __first, _InputIterator __last,
                             __false_type)
      {
        typename _Node_base::_Pointer __to = &this->_M_impl._M_head;
        for (; __first != __last; ++__first)
          {
            __to->_M_next = this->_M_create_node(*__first);
            __to = __to->_M_next;
          }
      }

  // Called by forward_list(n,v,a), and the range constructor
  // when it turns out to be the same thing.
  template<typename _Tp, typename _Alloc>
    void
    forward_list<_Tp, _Alloc>::
    _M_fill_initialize(size_type __n, const value_type& __value)
    {
      typename _Node_base::_Pointer __to = &this->_M_impl._M_head;
      for (; __n > 0; --__n)
        {
          __to->_M_next = this->_M_create_node(__value);
          __to = __to->_M_next;
        }
    }

  template<typename _Tp, typename _Alloc>
    forward_list<_Tp, _Alloc>&
    forward_list<_Tp, _Alloc>::
    operator=(const forward_list& __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;
    }

  template<typename _Tp, typename _Alloc>
    void
    forward_list<_Tp, _Alloc>::
    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);
    }

  template<typename _Tp, typename _Alloc>
    void
    forward_list<_Tp, _Alloc>::
    splice_after(const_iterator __pos, forward_list&& __list)
    {
      if (!__list.empty() && &__list != this)
        {
          typename _Node_base::_Pointer __tmp 
            = __const_pointer_cast<typename _Node_base::_Pointer>
                                  (__pos._M_node);
          const_iterator __before = __list.cbefore_begin();
          __tmp->_M_transfer_after(__const_pointer_cast
                                     <typename _Node_base::_Pointer>
                                     (__before._M_node));
        }
    }

  template<typename _Tp, typename _Alloc>
    void
    forward_list<_Tp, _Alloc>::
    splice_after(const_iterator __pos, forward_list&& __list,
                 const_iterator __before, const_iterator __last)
    {
      typename _Node_base::_Pointer __tmp 
        = __const_pointer_cast<typename _Node_base::_Pointer>(__pos._M_node);
      __tmp->_M_transfer_after(__const_pointer_cast
                                 <typename _Node_base::_Pointer>
                                 (__before._M_node),
                               __const_pointer_cast
                                 <typename _Node_base::_Pointer>
                                 (__last._M_node));
    }

  template<typename _Tp, typename _Alloc>
    void
    forward_list<_Tp, _Alloc>::
    remove(const _Tp& __val)
    {
      typename _Node::_Pointer __curr 
        = __static_pointer_cast<typename _Node::_Pointer>
                               (&this->_M_impl._M_head);
      while (typename _Node::_Pointer __temp = 
             __static_pointer_cast<typename _Node::_Pointer>(__curr->_M_next))
        {
          if (__temp->_M_value == __val)
            this->_M_erase_after(__curr);
          else
            __curr = __static_pointer_cast<typename _Node::_Pointer>
                                          (__curr->_M_next);
        }
    }

  template<typename _Tp, typename _Alloc>
    template<typename _Pred>
      void
      forward_list<_Tp, _Alloc>::
      remove_if(_Pred __pred)
      {
        typename _Node::_Pointer __curr 
          = __static_pointer_cast<typename _Node::_Pointer>
                                 (&this->_M_impl._M_head);
        while (typename _Node::_Pointer __temp = 
               __static_pointer_cast<typename _Node::_Pointer>(__curr->_M_next))
          {
            if (__pred(__temp->_M_value))
              this->_M_erase_after(__curr);
            else
              __curr = __static_pointer_cast<typename _Node::_Pointer>
                                            (__curr->_M_next);
          }
      }

  template<typename _Tp, typename _Alloc>
    template<typename _BinPred>
      void
      forward_list<_Tp, _Alloc>::
      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;
        }
      }

  template<typename _Tp, typename _Alloc>
    template<typename _Comp>
      void
      forward_list<_Tp, _Alloc>::
      merge(forward_list&& __list, _Comp __comp)
      {
        typename _Node_base::_Pointer __node = &this->_M_impl._M_head;
        while (__node->_M_next && __list._M_impl._M_head._M_next)
          {
            if (__comp(__static_pointer_cast<typename _Node::_Pointer>
                       (__list._M_impl._M_head._M_next)->_M_value,
                       __static_pointer_cast<typename _Node::_Pointer>
                       (__node->_M_next)->_M_value))
              __node->_M_transfer_after(&__list._M_impl._M_head,
                                        __list._M_impl._M_head._M_next);
            __node = __node->_M_next;
          }
        if (__list._M_impl._M_head._M_next)
          {
            __node->_M_next = __list._M_impl._M_head._M_next;
            __list._M_impl._M_head._M_next = 0;
          }
      }

  template<typename _Tp, typename _Alloc>
    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.
      auto __ix = __lx.cbegin();
      auto __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;
    }

  template<typename _Tp, class _Alloc>
    template<typename _Comp>
      void
      forward_list<_Tp, _Alloc>::
      sort(_Comp __comp)
      {
	typedef typename _Node::_Pointer _Pointer;

        // If `next' is 0, return immediately.
        _Pointer __list =
	  __static_pointer_cast<_Pointer>(this->_M_impl._M_head._M_next);
        if (!__list)
          return;

        unsigned long __insize = 1;

        while (1)
          {
            _Pointer __p = __list;
            __list = 0;
            _Pointer __tail = 0;

            // Count number of merges we do in this pass.
            unsigned long __nmerges = 0;

            while (__p)
              {
                ++__nmerges;
                // There exists a merge to be done.
                // Step `insize' places along from p.
                _Pointer __q = __p;
                unsigned long __psize = 0;
                for (unsigned long __i = 0; __i < __insize; ++__i)
                  {
                    ++__psize;
                    __q = __static_pointer_cast<_Pointer>(__q->_M_next);
                    if (!__q)
                      break;
                  }

                // If q hasn't fallen off end, we have two lists to merge.
                unsigned long __qsize = __insize;

                // Now we have two lists; merge them.
                while (__psize > 0 || (__qsize > 0 && __q))
                  {
                    // Decide whether next node of merge comes from p or q.
                    _Pointer __e;
                    if (__psize == 0)
                      {
                        // p is empty; e must come from q.
                        __e = __q;
                        __q = __static_pointer_cast<_Pointer>(__q->_M_next);
                        --__qsize;
                      }
                    else if (__qsize == 0 || !__q)
                      {
                        // q is empty; e must come from p.
                        __e = __p;
                        __p = __static_pointer_cast<_Pointer>(__p->_M_next);
                        --__psize;
                      }
                    else if (__comp(__p->_M_value, __q->_M_value))
                      {
                        // First node of p is lower; e must come from p.
                        __e = __p;
                        __p = __static_pointer_cast<_Pointer>(__p->_M_next);
                        --__psize;
                      }
                    else
                      {
                        // First node of q is lower; e must come from q.
                        __e = __q;
                        __q = __static_pointer_cast<_Pointer>(__q->_M_next);
                        --__qsize;
                      }

                    // Add the next node to the merged list.
                    if (__tail)
                      __tail->_M_next = __e;
                    else
                      __list = __e;
                    __tail = __e;
                  }

                // Now p has stepped `insize' places along, and q has too.
                __p = __q;
              }
            __tail->_M_next = 0;

            // If we have done only one merge, we're finished.
            // Allow for nmerges == 0, the empty list case.
            if (__nmerges <= 1)
              {
                this->_M_impl._M_head._M_next = __list;
                return;
              }

            // Otherwise repeat, merging lists twice the size.
            __insize *= 2;
          }
      }
 
_GLIBCXX_END_NAMESPACE // namespace std

#endif /* _FORWARD_LIST_TCC */
Commit	Line	Data
3a63c9cd ESR	1	// <forward_list.tcc> -- C++ --
3a63c9cd ESR	2
4ba8a4cb	3	// Copyright (C) 2008, 2009 Free Software Foundation, Inc.
3a63c9cd ESR	4	//
	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
748086b7	8	// Free Software Foundation; either version 3, or (at your option)
3a63c9cd ESR	9	// any later version.
	10
	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.
	15
748086b7 JJ	16	// Under Section 7 of GPL version 3, you are granted additional
	17	// permissions described in the GCC Runtime Library Exception, version
	18	// 3.1, as published by the Free Software Foundation.
	19
	20	// You should have received a copy of the GNU General Public License and
	21	// a copy of the GCC Runtime Library Exception along with this program;
	22	// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
	23	// <http://www.gnu.org/licenses/>.
3a63c9cd ESR	24
	25	/** @file forward_list.tcc
	26	* This is a Standard C++ Library header.
	27	*/
	28
	29	#ifndef _FORWARD_LIST_TCC
	30	#define _FORWARD_LIST_TCC 1
	31
	32	_GLIBCXX_BEGIN_NAMESPACE(std)
	33
4ba8a4cb PC	34	template<typename _Alloc>
	35	void
	36	_Fwd_list_node_base<_Alloc>::
	37	_M_transfer_after(_Pointer __bbegin)
	38	{
	39	_Pointer __bend = __bbegin;
	40	while (__bend && __bend->_M_next)
	41	__bend = __bend->_M_next;
	42	_M_transfer_after(__bbegin, __bend);
	43	}
	44
	45	template<typename _Alloc>
	46	void
	47	_Fwd_list_node_base<_Alloc>::
	48	_M_transfer_after(_Pointer __bbegin, _Pointer __bend)
	49	{
	50	_Pointer __keep = __bbegin->_M_next;
	51	if (__bend)
	52	{
	53	__bbegin->_M_next = __bend->_M_next;
	54	__bend->_M_next = _M_next;
	55	}
	56	else
	57	__bbegin->_M_next = 0;
	58	_M_next = __keep;
	59	}
	60
	61	template<typename _Alloc>
	62	void
	63	_Fwd_list_node_base<_Alloc>::
	64	_M_reverse_after()
	65	{
	66	_Pointer __tail = _M_next;
	67	if (!__tail)
	68	return;
	69	while (_Pointer __temp = __tail->_M_next)
	70	{
	71	_Pointer __keep = _M_next;
	72	_M_next = __temp;
	73	__tail->_M_next = __temp->_M_next;
	74	_M_next->_M_next = __keep;
	75	}
	76	}
	77
3a63c9cd ESR	78	template<typename _Tp, typename _Alloc>
	79	_Fwd_list_base<_Tp, _Alloc>::
	80	_Fwd_list_base(const _Fwd_list_base& __lst, const _Alloc& __a)
	81	: _M_impl(__a)
	82	{
	83	this->_M_impl._M_head._M_next = 0;
1b32e4e5 BW	84	typename _Node_base::_Pointer __to = &this->_M_impl._M_head;
	85	typename _Node::_Pointer __curr
	86	= __static_pointer_cast<typename _Node::_Pointer>
	87	(__lst._M_impl._M_head._M_next);
3a63c9cd	88	while (__curr)
1b32e4e5 BW	89	{
	90	__to->_M_next = _M_create_node(__curr->_M_value);
	91	__to = __to->_M_next;
	92	__curr = __static_pointer_cast<typename _Node::_Pointer>
	93	(__curr->_M_next);
	94	}
3a63c9cd ESR	95	}
3a63c9cd ESR	96
2a7ee2f9 PC	97	template<typename _Tp, typename _Alloc>
2a7ee2f9 PC	98	template<typename... _Args>
1b32e4e5	99	typename _Fwd_list_base<_Tp, _Alloc>::_Node_base::_Pointer
2a7ee2f9 PC	100	_Fwd_list_base<_Tp, _Alloc>::
	101	_M_insert_after(const_iterator __pos, _Args&&... __args)
	102	{
1b32e4e5 BW	103	typename _Node_base::_Pointer __to
	104	= __const_pointer_cast<typename _Node_base::_Pointer>
	105	(__pos._M_node);
	106	typename _Node::_Pointer __thing
	107	= __static_pointer_cast<typename _Node::_Pointer>(
	108	_M_create_node(std::forward<_Args>(__args)...) );
	109	__thing->_M_next = __to->_M_next;
	110	__to->_M_next = __thing;
	111	return __static_pointer_cast<typename _Node_base::_Pointer>
	112	(__to->_M_next);
2a7ee2f9 PC	113	}
2a7ee2f9 PC	114
3a63c9cd	115	template<typename _Tp, typename _Alloc>
33913cfa	116	void
3a63c9cd	117	_Fwd_list_base<_Tp, _Alloc>::
1b32e4e5	118	_M_erase_after(typename _Node_base::_Pointer __pos)
3a63c9cd	119	{
33913cfa	120	typename _Node::_Pointer __curr
1b32e4e5	121	= __static_pointer_cast<typename _Node::_Pointer>(__pos->_M_next);
33913cfa PC	122	__pos->_M_next = __curr->_M_next;
	123	_M_get_Node_allocator().destroy(__curr);
	124	_M_put_node(__curr);
3a63c9cd ESR	125	}
	126
	127	template<typename _Tp, typename _Alloc>
33913cfa	128	void
3a63c9cd	129	_Fwd_list_base<_Tp, _Alloc>::
1b32e4e5 BW	130	_M_erase_after(typename _Node_base::_Pointer __pos,
1b32e4e5 BW	131	typename _Node_base::_Pointer __last)
3a63c9cd	132	{
1b32e4e5 BW	133	typename _Node::_Pointer __curr
1b32e4e5 BW	134	= __static_pointer_cast<typename _Node::_Pointer>(__pos->_M_next);
33913cfa	135	while (__curr != __last)
1b32e4e5 BW	136	{
	137	typename _Node::_Pointer __temp = __curr;
	138	__curr = __static_pointer_cast<typename _Node::_Pointer>
	139	(__curr->_M_next);
	140	_M_get_Node_allocator().destroy(__temp);
	141	_M_put_node(__temp);
1b32e4e5	142	}
33913cfa	143	__pos->_M_next = __last;
3a63c9cd ESR	144	}
3a63c9cd ESR	145
e73d6fe8	146	// Called by the range constructor to implement [23.1.1]/9
3a63c9cd ESR	147	template<typename _Tp, typename _Alloc>
3a63c9cd ESR	148	template<typename _InputIterator>
e73d6fe8	149	void
3a63c9cd	150	forward_list<_Tp, _Alloc>::
e73d6fe8 ESR	151	_M_initialize_dispatch(_InputIterator __first, _InputIterator __last,
e73d6fe8 ESR	152	__false_type)
3a63c9cd	153	{
1b32e4e5	154	typename _Node_base::_Pointer __to = &this->_M_impl._M_head;
27caad2e	155	for (; __first != __last; ++__first)
3a63c9cd	156	{
27caad2e	157	__to->_M_next = this->_M_create_node(*__first);
3a63c9cd	158	__to = __to->_M_next;
3a63c9cd ESR	159	}
	160	}
	161
e73d6fe8 ESR	162	// Called by forward_list(n,v,a), and the range constructor
e73d6fe8 ESR	163	// when it turns out to be the same thing.
3a63c9cd	164	template<typename _Tp, typename _Alloc>
e73d6fe8	165	void
3a63c9cd	166	forward_list<_Tp, _Alloc>::
e73d6fe8	167	_M_fill_initialize(size_type __n, const value_type& __value)
3a63c9cd	168	{
1b32e4e5	169	typename _Node_base::_Pointer __to = &this->_M_impl._M_head;
e73d6fe8 ESR	170	for (; __n > 0; --__n)
	171	{
	172	__to->_M_next = this->_M_create_node(__value);
	173	__to = __to->_M_next;
	174	}
3a63c9cd ESR	175	}
	176
	177	template<typename _Tp, typename _Alloc>
	178	forward_list<_Tp, _Alloc>&
	179	forward_list<_Tp, _Alloc>::
	180	operator=(const forward_list& __list)
	181	{
	182	if (&__list != this)
1b32e4e5 BW	183	{
	184	iterator __prev1 = before_begin();
	185	iterator __curr1 = begin();
	186	iterator __last1 = end();
	187	const_iterator __first2 = __list.cbegin();
	188	const_iterator __last2 = __list.cend();
	189	while (__curr1 != __last1 && __first2 != __last2)
	190	{
	191	__curr1 = __first2;
	192	++__prev1;
	193	++__curr1;
	194	++__first2;
	195	}
	196	if (__first2 == __last2)
	197	erase_after(__prev1, __last1);
	198	else
	199	insert_after(__prev1, __first2, __last2);
	200	}
3a63c9cd ESR	201	return *this;
	202	}
	203
3a63c9cd ESR	204	template<typename _Tp, typename _Alloc>
	205	void
	206	forward_list<_Tp, _Alloc>::
	207	resize(size_type __sz, value_type __val)
	208	{
	209	iterator __k = before_begin();
	210
	211	size_type __len = 0;
	212	while (__k._M_next() != end() && __len < __sz)
1b32e4e5 BW	213	{
	214	++__k;
	215	++__len;
	216	}
3a63c9cd	217	if (__len == __sz)
1b32e4e5	218	erase_after(__k, end());
3a63c9cd	219	else
1b32e4e5	220	insert_after(__k, __sz - __len, __val);
3a63c9cd ESR	221	}
3a63c9cd ESR	222
2a7ee2f9 PC	223	template<typename _Tp, typename _Alloc>
	224	void
	225	forward_list<_Tp, _Alloc>::
	226	splice_after(const_iterator __pos, forward_list&& __list)
	227	{
	228	if (!__list.empty() && &__list != this)
1b32e4e5 BW	229	{
	230	typename _Node_base::_Pointer __tmp
	231	= __const_pointer_cast<typename _Node_base::_Pointer>
	232	(__pos._M_node);
	233	const_iterator __before = __list.cbefore_begin();
	234	__tmp->_M_transfer_after(__const_pointer_cast
	235	<typename _Node_base::_Pointer>
	236	(__before._M_node));
	237	}
2a7ee2f9 PC	238	}
	239
	240	template<typename _Tp, typename _Alloc>
	241	void
	242	forward_list<_Tp, _Alloc>::
	243	splice_after(const_iterator __pos, forward_list&& __list,
1b32e4e5	244	const_iterator __before, const_iterator __last)
2a7ee2f9	245	{
1b32e4e5 BW	246	typename _Node_base::_Pointer __tmp
	247	= __const_pointer_cast<typename _Node_base::_Pointer>(__pos._M_node);
	248	__tmp->_M_transfer_after(__const_pointer_cast
	249	<typename _Node_base::_Pointer>
	250	(__before._M_node),
	251	__const_pointer_cast
	252	<typename _Node_base::_Pointer>
	253	(__last._M_node));
2a7ee2f9 PC	254	}
2a7ee2f9 PC	255
3a63c9cd ESR	256	template<typename _Tp, typename _Alloc>
	257	void
	258	forward_list<_Tp, _Alloc>::
	259	remove(const _Tp& __val)
	260	{
1b32e4e5 BW	261	typename _Node::_Pointer __curr
	262	= __static_pointer_cast<typename _Node::_Pointer>
	263	(&this->_M_impl._M_head);
	264	while (typename _Node::_Pointer __temp =
	265	__static_pointer_cast<typename _Node::_Pointer>(__curr->_M_next))
	266	{
	267	if (__temp->_M_value == __val)
	268	this->_M_erase_after(__curr);
	269	else
	270	__curr = __static_pointer_cast<typename _Node::_Pointer>
	271	(__curr->_M_next);
	272	}
3a63c9cd ESR	273	}
	274
	275	template<typename _Tp, typename _Alloc>
	276	template<typename _Pred>
	277	void
	278	forward_list<_Tp, _Alloc>::
	279	remove_if(_Pred __pred)
	280	{
1b32e4e5 BW	281	typename _Node::_Pointer __curr
	282	= __static_pointer_cast<typename _Node::_Pointer>
	283	(&this->_M_impl._M_head);
	284	while (typename _Node::_Pointer __temp =
	285	__static_pointer_cast<typename _Node::_Pointer>(__curr->_M_next))
	286	{
	287	if (__pred(__temp->_M_value))
	288	this->_M_erase_after(__curr);
	289	else
	290	__curr = __static_pointer_cast<typename _Node::_Pointer>
	291	(__curr->_M_next);
	292	}
3a63c9cd ESR	293	}
3a63c9cd ESR	294
3a63c9cd ESR	295	template<typename _Tp, typename _Alloc>
	296	template<typename _BinPred>
	297	void
	298	forward_list<_Tp, _Alloc>::
	299	unique(_BinPred __binary_pred)
	300	{
	301	iterator __first = begin();
	302	iterator __last = end();
	303	if (__first == __last)
1b32e4e5	304	return;
3a63c9cd ESR	305	iterator __next = __first;
3a63c9cd ESR	306	while (++__next != __last)
1b32e4e5 BW	307	{
	308	if (__binary_pred(__first, __next))
	309	erase_after(__first);
	310	else
	311	__first = __next;
	312	__next = __first;
	313	}
3a63c9cd ESR	314	}
	315
	316	template<typename _Tp, typename _Alloc>
	317	template<typename _Comp>
	318	void
	319	forward_list<_Tp, _Alloc>::
	320	merge(forward_list&& __list, _Comp __comp)
	321	{
1b32e4e5	322	typename _Node_base::_Pointer __node = &this->_M_impl._M_head;
3a63c9cd ESR	323	while (__node->_M_next && __list._M_impl._M_head._M_next)
3a63c9cd ESR	324	{
1b32e4e5 BW	325	if (__comp(__static_pointer_cast<typename _Node::_Pointer>
	326	(__list._M_impl._M_head._M_next)->_M_value,
	327	__static_pointer_cast<typename _Node::_Pointer>
	328	(__node->_M_next)->_M_value))
3a63c9cd ESR	329	__node->_M_transfer_after(&__list._M_impl._M_head,
	330	__list._M_impl._M_head._M_next);
	331	__node = __node->_M_next;
	332	}
	333	if (__list._M_impl._M_head._M_next)
	334	{
	335	__node->_M_next = __list._M_impl._M_head._M_next;
	336	__list._M_impl._M_head._M_next = 0;
	337	}
	338	}
	339
2a7ee2f9 PC	340	template<typename _Tp, typename _Alloc>
	341	bool
	342	operator==(const forward_list<_Tp, _Alloc>& __lx,
	343	const forward_list<_Tp, _Alloc>& __ly)
	344	{
	345	// We don't have size() so we need to walk through both lists
	346	// making sure both iterators are valid.
919e5c5e PC	347	auto __ix = __lx.cbegin();
919e5c5e PC	348	auto __iy = __ly.cbegin();
2a7ee2f9 PC	349	while (__ix != __lx.cend() && __iy != __ly.cend())
	350	{
	351	if (__ix != __iy)
	352	return false;
	353	++__ix;
	354	++__iy;
	355	}
	356	if (__ix == __lx.cend() && __iy == __ly.cend())
	357	return true;
	358	else
	359	return false;
	360	}
	361
fc52f99d PC	362	template<typename _Tp, class _Alloc>
	363	template<typename _Comp>
	364	void
	365	forward_list<_Tp, _Alloc>::
	366	sort(_Comp __comp)
	367	{
	368	typedef typename _Node::_Pointer _Pointer;
	369
	370	// If `next' is 0, return immediately.
	371	_Pointer __list =
	372	__static_pointer_cast<_Pointer>(this->_M_impl._M_head._M_next);
	373	if (!__list)
	374	return;
	375
	376	unsigned long __insize = 1;
	377
	378	while (1)
	379	{
	380	_Pointer __p = __list;
	381	__list = 0;
	382	_Pointer __tail = 0;
	383
	384	// Count number of merges we do in this pass.
	385	unsigned long __nmerges = 0;
	386
	387	while (__p)
	388	{
	389	++__nmerges;
	390	// There exists a merge to be done.
	391	// Step `insize' places along from p.
	392	_Pointer __q = __p;
	393	unsigned long __psize = 0;
	394	for (unsigned long __i = 0; __i < __insize; ++__i)
	395	{
	396	++__psize;
	397	__q = __static_pointer_cast<_Pointer>(__q->_M_next);
	398	if (!__q)
	399	break;
	400	}
	401
	402	// If q hasn't fallen off end, we have two lists to merge.
	403	unsigned long __qsize = __insize;
	404
	405	// Now we have two lists; merge them.
	406	while (__psize > 0 \|\| (__qsize > 0 && __q))
	407	{
	408	// Decide whether next node of merge comes from p or q.
	409	_Pointer __e;
	410	if (__psize == 0)
	411	{
	412	// p is empty; e must come from q.
	413	__e = __q;
	414	__q = __static_pointer_cast<_Pointer>(__q->_M_next);
	415	--__qsize;
	416	}
	417	else if (__qsize == 0 \|\| !__q)
	418	{
	419	// q is empty; e must come from p.
	420	__e = __p;
	421	__p = __static_pointer_cast<_Pointer>(__p->_M_next);
	422	--__psize;
	423	}
	424	else if (__comp(__p->_M_value, __q->_M_value))
	425	{
426	// First node of p is lower; e must come from p.
427	__e = __p;
428	__p = __static_pointer_cast<_Pointer>(__p->_M_next);
429	--__psize;
430	}
431	else
432	{
433	// First node of q is lower; e must come from q.
434	__e = __q;
435	__q = __static_pointer_cast<_Pointer>(__q->_M_next);
436	--__qsize;
437	}
438
439	// Add the next node to the merged list.
440	if (__tail)
441	__tail->_M_next = __e;
442	else
443	__list = __e;
444	__tail = __e;
445	}
446
447	// Now p has stepped `insize' places along, and q has too.
448	__p = __q;
449	}
450	__tail->_M_next = 0;
451
452	// If we have done only one merge, we're finished.
453	// Allow for nmerges == 0, the empty list case.
454	if (__nmerges <= 1)
455	{
456	this->_M_impl._M_head._M_next = __list;
457	return;
458	}
459
460	// Otherwise repeat, merging lists twice the size.
461	__insize *= 2;
462	}
463	}
464
3a63c9cd ESR	465	_GLIBCXX_END_NAMESPACE // namespace std
	466
	467	#endif /* _FORWARD_LIST_TCC */
	468