williamr@4: /*
williamr@4:  *
williamr@4:  * Copyright (c) 1994
williamr@4:  * Hewlett-Packard Company
williamr@4:  *
williamr@4:  * Copyright (c) 1996,1997
williamr@4:  * Silicon Graphics Computer Systems, Inc.
williamr@4:  *
williamr@4:  * Copyright (c) 1997
williamr@4:  * Moscow Center for SPARC Technology
williamr@4:  *
williamr@4:  * Copyright (c) 1999
williamr@4:  * Boris Fomitchev
williamr@4:  *
williamr@4:  * This material is provided "as is", with absolutely no warranty expressed
williamr@4:  * or implied. Any use is at your own risk.
williamr@4:  *
williamr@4:  * Permission to use or copy this software for any purpose is hereby granted
williamr@4:  * without fee, provided the above notices are retained on all copies.
williamr@4:  * Permission to modify the code and to distribute modified code is granted,
williamr@4:  * provided the above notices are retained, and a notice that the code was
williamr@4:  * modified is included with the above copyright notice.
williamr@4:  *
williamr@4:  */
williamr@4: 
williamr@4: /* NOTE: This is an internal header file, included by other STL headers.
williamr@4:  *   You should not attempt to use it directly.
williamr@4:  */
williamr@4: 
williamr@4: #ifndef _STLP_INTERNAL_LIST_IMPL_H
williamr@4: #define _STLP_INTERNAL_LIST_IMPL_H
williamr@4: 
williamr@4: #ifndef _STLP_INTERNAL_ALGOBASE_H
williamr@4: #  include <stl/_algobase.h>
williamr@4: #endif
williamr@4: 
williamr@4: #ifndef _STLP_INTERNAL_ALLOC_H
williamr@4: #  include <stl/_alloc.h>
williamr@4: #endif
williamr@4: 
williamr@4: #ifndef _STLP_INTERNAL_ITERATOR_H
williamr@4: #  include <stl/_iterator.h>
williamr@4: #endif
williamr@4: 
williamr@4: #ifndef _STLP_INTERNAL_CONSTRUCT_H
williamr@4: #  include <stl/_construct.h>
williamr@4: #endif
williamr@4: 
williamr@4: #ifndef _STLP_INTERNAL_FUNCTION_BASE_H
williamr@4: #  include <stl/_function_base.h>
williamr@4: #endif
williamr@4: 
williamr@4: _STLP_BEGIN_NAMESPACE
williamr@4: 
williamr@4: _STLP_MOVE_TO_PRIV_NAMESPACE
williamr@4: 
williamr@4: struct _List_node_base {
williamr@4:   _List_node_base* _M_next;
williamr@4:   _List_node_base* _M_prev;
williamr@4: };
williamr@4: 
williamr@4: template <class _Dummy>
williamr@4: class _List_global {
williamr@4: public:
williamr@4:   typedef _List_node_base _Node_base;
williamr@4:   static void  _STLP_CALL _Transfer(_Node_base* __pos,
williamr@4:                                     _Node_base* __first, _Node_base* __last);
williamr@4: };
williamr@4: 
williamr@4: #if defined (_STLP_USE_TEMPLATE_EXPORT)
williamr@4: _STLP_EXPORT_TEMPLATE_CLASS _List_global<bool>;
williamr@4: #endif
williamr@4: typedef _List_global<bool> _List_global_inst;
williamr@4: 
williamr@4: template <class _Tp>
williamr@4: class _List_node : public _List_node_base {
williamr@4: public:
williamr@4:   _Tp _M_data;
williamr@4:   __TRIVIAL_STUFF(_List_node)
williamr@4: };
williamr@4: 
williamr@4: struct _List_iterator_base {
williamr@4:   typedef size_t                     size_type;
williamr@4:   typedef ptrdiff_t                  difference_type;
williamr@4:   typedef bidirectional_iterator_tag iterator_category;
williamr@4: 
williamr@4:   _List_node_base* _M_node;
williamr@4: 
williamr@4:   _List_iterator_base(_List_node_base* __x) : _M_node(__x) {}
williamr@4: 
williamr@4:   void _M_incr() { _M_node = _M_node->_M_next; }
williamr@4:   void _M_decr() { _M_node = _M_node->_M_prev; }
williamr@4: };
williamr@4: 
williamr@4: 
williamr@4: template<class _Tp, class _Traits>
williamr@4: struct _List_iterator : public _List_iterator_base {
williamr@4:   typedef _Tp value_type;
williamr@4:   typedef typename _Traits::pointer    pointer;
williamr@4:   typedef typename _Traits::reference  reference;
williamr@4: 
williamr@4:   typedef _List_iterator<_Tp, _Traits>         _Self;
williamr@4:   typedef typename _Traits::_NonConstTraits    _NonConstTraits;
williamr@4:   typedef _List_iterator<_Tp, _NonConstTraits> iterator;
williamr@4:   typedef typename _Traits::_ConstTraits       _ConstTraits;
williamr@4:   typedef _List_iterator<_Tp, _ConstTraits>    const_iterator;
williamr@4: 
williamr@4:   typedef bidirectional_iterator_tag iterator_category;
williamr@4:   typedef _List_node<_Tp> _Node;
williamr@4:   typedef size_t size_type;
williamr@4:   typedef ptrdiff_t difference_type;
williamr@4: 
williamr@4:   explicit _List_iterator(_List_node_base* __x) : _List_iterator_base(__x) {}
williamr@4:   _List_iterator() : _List_iterator_base(0) {}
williamr@4:   //copy constructor for iterator and constructor from iterator for const_iterator
williamr@4:   _List_iterator(const iterator& __x) :  _List_iterator_base(__x._M_node) {}
williamr@4: 
williamr@4:   reference operator*() const { return __STATIC_CAST(_Node*, this->_M_node)->_M_data; }
williamr@4: 
williamr@4:   _STLP_DEFINE_ARROW_OPERATOR
williamr@4: 
williamr@4:   _Self& operator++() {
williamr@4:     this->_M_incr();
williamr@4:     return *this;
williamr@4:   }
williamr@4:   _Self operator++(int) {
williamr@4:     _Self __tmp = *this;
williamr@4:     this->_M_incr();
williamr@4:     return __tmp;
williamr@4:   }
williamr@4:   _Self& operator--() {
williamr@4:     this->_M_decr();
williamr@4:     return *this;
williamr@4:   }
williamr@4:   _Self operator--(int) {
williamr@4:     _Self __tmp = *this;
williamr@4:     this->_M_decr();
williamr@4:     return __tmp;
williamr@4:   }
williamr@4:   bool operator==(const_iterator __y ) const {
williamr@4:     return this->_M_node == __y._M_node;
williamr@4:   }
williamr@4:   bool operator!=(const_iterator __y ) const {
williamr@4:     return this->_M_node != __y._M_node;
williamr@4:   }
williamr@4: };
williamr@4: 
williamr@4: #if defined (_STLP_CLASS_PARTIAL_SPECIALIZATION)
williamr@4: _STLP_MOVE_TO_STD_NAMESPACE
williamr@4: template <class _Tp, class _Traits>
williamr@4: struct __type_traits<_STLP_PRIV _List_iterator<_Tp, _Traits> > {
williamr@4:   typedef __false_type   has_trivial_default_constructor;
williamr@4:   typedef __true_type    has_trivial_copy_constructor;
williamr@4:   typedef __true_type    has_trivial_assignment_operator;
williamr@4:   typedef __true_type    has_trivial_destructor;
williamr@4:   typedef __false_type   is_POD_type;
williamr@4: };
williamr@4: _STLP_MOVE_TO_PRIV_NAMESPACE
williamr@4: #endif /* _STLP_CLASS_PARTIAL_SPECIALIZATION */
williamr@4: 
williamr@4: #if defined (_STLP_USE_OLD_HP_ITERATOR_QUERIES)
williamr@4: _STLP_MOVE_TO_STD_NAMESPACE
williamr@4: template <class _Tp, class _Traits>
williamr@4: inline _Tp* value_type(const _STLP_PRIV _List_iterator<_Tp, _Traits>&) { return 0; }
williamr@4: inline bidirectional_iterator_tag iterator_category(const _STLP_PRIV _List_iterator_base&) { return bidirectional_iterator_tag();}
williamr@4: inline ptrdiff_t* distance_type(const _STLP_PRIV _List_iterator_base&) { return 0; }
williamr@4: _STLP_MOVE_TO_PRIV_NAMESPACE
williamr@4: #endif
williamr@4: 
williamr@4: // Base class that encapsulates details of allocators and helps
williamr@4: // to simplify EH
williamr@4: 
williamr@4: template <class _Tp, class _Alloc>
williamr@4: class _List_base {
williamr@4: protected:
williamr@4:   _STLP_FORCE_ALLOCATORS(_Tp, _Alloc)
williamr@4:   typedef _List_node_base _Node_base;
williamr@4:   typedef _List_node<_Tp> _Node;
williamr@4:   typedef _List_base<_Tp, _Alloc> _Self;
williamr@4:   typedef typename _Alloc_traits<_Node, _Alloc>::allocator_type _Node_allocator_type;
williamr@4: public:
williamr@4:   typedef _STLP_alloc_proxy<_Node_base, _Node, _Node_allocator_type> _AllocProxy;
williamr@4:   typedef typename _Alloc_traits<_Tp, _Alloc>::allocator_type allocator_type;
williamr@4: 
williamr@4:   allocator_type get_allocator() const
williamr@4:   { return _STLP_CONVERT_ALLOCATOR((const _Node_allocator_type&)_M_node, _Tp); }
williamr@4: 
williamr@4:   _List_base(const allocator_type& __a) : _M_node(_STLP_CONVERT_ALLOCATOR(__a, _Node), _Node_base())
williamr@4:   { _M_empty_initialize(); }
williamr@4:   _List_base(__move_source<_Self> src) :
williamr@4:     _M_node(__move_source<_AllocProxy>(src.get()._M_node)) {
williamr@4:     if (src.get().empty())
williamr@4:       //We force this to empty.
williamr@4:       _M_empty_initialize();
williamr@4:     else {
williamr@4:       src.get()._M_empty_initialize();
williamr@4:       _M_node._M_data._M_prev->_M_next = _M_node._M_data._M_next->_M_prev = &_M_node._M_data;
williamr@4:     }
williamr@4:   }
williamr@4: 
williamr@4:   ~_List_base()
williamr@4:   { clear(); }
williamr@4: 
williamr@4:   void clear();
williamr@4:   bool empty() const { return _M_node._M_data._M_next == &_M_node._M_data; }
williamr@4: 
williamr@4:   void _M_empty_initialize() {
williamr@4:     _M_node._M_data._M_next = &_M_node._M_data;
williamr@4:     _M_node._M_data._M_prev = _M_node._M_data._M_next;
williamr@4:   }
williamr@4: 
williamr@4: public:
williamr@4:   _AllocProxy _M_node;
williamr@4: };
williamr@4: 
williamr@4: #if defined (_STLP_USE_PTR_SPECIALIZATIONS)
williamr@4: #  define list _STLP_PTR_IMPL_NAME(list)
williamr@4: #elif defined (_STLP_DEBUG)
williamr@4: #  define list _STLP_NON_DBG_NAME(list)
williamr@4: #else
williamr@4: _STLP_MOVE_TO_STD_NAMESPACE
williamr@4: #endif
williamr@4: 
williamr@4: template <class _Tp, _STLP_DEFAULT_ALLOCATOR_SELECT(_Tp) >
williamr@4: class list;
williamr@4: 
williamr@4: #if !defined (list)
williamr@4: _STLP_MOVE_TO_PRIV_NAMESPACE
williamr@4: #endif
williamr@4: 
williamr@4: // helper functions to reduce code duplication
williamr@4: template <class _Tp, class _Alloc, class _Predicate>
williamr@4: void _S_remove_if(list<_Tp, _Alloc>& __that, _Predicate __pred);
williamr@4: 
williamr@4: template <class _Tp, class _Alloc, class _BinaryPredicate>
williamr@4: void _S_unique(list<_Tp, _Alloc>& __that, _BinaryPredicate __binary_pred);
williamr@4: 
williamr@4: template <class _Tp, class _Alloc, class _StrictWeakOrdering>
williamr@4: void _S_merge(list<_Tp, _Alloc>& __that, list<_Tp, _Alloc>& __x,
williamr@4:               _StrictWeakOrdering __comp);
williamr@4: 
williamr@4: template <class _Tp, class _Alloc, class _StrictWeakOrdering>
williamr@4: void _S_sort(list<_Tp, _Alloc>& __that, _StrictWeakOrdering __comp);
williamr@4: 
williamr@4: #if !defined (list)
williamr@4: _STLP_MOVE_TO_STD_NAMESPACE
williamr@4: #endif
williamr@4: 
williamr@4: template <class _Tp, class _Alloc>
williamr@4: class list : public _STLP_PRIV _List_base<_Tp, _Alloc>
williamr@4: #if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND) && !defined (list)
williamr@4:            , public __stlport_class<list<_Tp, _Alloc> >
williamr@4: #endif
williamr@4: {
williamr@4:   typedef _STLP_PRIV _List_base<_Tp, _Alloc> _Base;
williamr@4:   typedef list<_Tp, _Alloc> _Self;
williamr@4:   typedef _STLP_PRIV _List_node<_Tp> _Node;
williamr@4:   typedef _STLP_PRIV _List_node_base _Node_base;
williamr@4: public:
williamr@4:   typedef _Tp value_type;
williamr@4:   typedef value_type* pointer;
williamr@4:   typedef const value_type* const_pointer;
williamr@4:   typedef value_type& reference;
williamr@4:   typedef const value_type& const_reference;
williamr@4:   typedef size_t size_type;
williamr@4:   typedef ptrdiff_t difference_type;
williamr@4:   _STLP_FORCE_ALLOCATORS(_Tp, _Alloc)
williamr@4:   typedef typename _Base::allocator_type allocator_type;
williamr@4:   typedef bidirectional_iterator_tag _Iterator_category;
williamr@4: 
williamr@4: public:
williamr@4:   typedef _STLP_PRIV _List_iterator<_Tp, _Nonconst_traits<_Tp> > iterator;
williamr@4:   typedef _STLP_PRIV _List_iterator<_Tp, _Const_traits<_Tp> >    const_iterator;
williamr@4:   _STLP_DECLARE_BIDIRECTIONAL_REVERSE_ITERATORS;
williamr@4: 
williamr@4: protected:
williamr@4: #if !defined(_STLP_DONT_SUP_DFLT_PARAM)
williamr@4:   _Node_base* _M_create_node(const_reference __x = value_type()) {
williamr@4: #else
williamr@4:   _Node_base* _M_create_node(const_reference __x) {
williamr@4: #endif /*!_STLP_DONT_SUP_DFLT_PARAM*/
williamr@4:     _Node* __p = this->_M_node.allocate(1);
williamr@4:     _STLP_TRY {
williamr@4:       _Copy_Construct(&__p->_M_data, __x);
williamr@4:     }
williamr@4:     _STLP_UNWIND(this->_M_node.deallocate(__p, 1))
williamr@4:     return __p;
williamr@4:   }
williamr@4: 
williamr@4: #if defined(_STLP_DONT_SUP_DFLT_PARAM)
williamr@4:   _Node_base* _M_create_node() {
williamr@4:     _Node* __p = this->_M_node.allocate(1);
williamr@4:     _STLP_TRY {
williamr@4:       _STLP_STD::_Construct(&__p->_M_data);
williamr@4:     }
williamr@4:     _STLP_UNWIND(this->_M_node.deallocate(__p, 1))
williamr@4:     return __p;
williamr@4:   }
williamr@4: #endif /*_STLP_DONT_SUP_DFLT_PARAM*/
williamr@4: 
williamr@4: public:
williamr@4: #if !defined (_STLP_DONT_SUP_DFLT_PARAM)
williamr@4:   explicit list(size_type __n, const_reference __val = _STLP_DEFAULT_CONSTRUCTED(value_type),
williamr@4:                 const allocator_type& __a = allocator_type())
williamr@4: #else
williamr@4:   explicit list(size_type __n)
williamr@4:     : _STLP_PRIV _List_base<_Tp, _Alloc>(allocator_type())
williamr@4:     { this->insert(begin(), __n, _STLP_DEFAULT_CONSTRUCTED(value_type)); }
williamr@4:   list(size_type __n, const_reference __val)
williamr@4:     : _STLP_PRIV _List_base<_Tp, _Alloc>(allocator_type())
williamr@4:     { this->insert(begin(), __n, __val); }
williamr@4:   list(size_type __n, const_reference __val, const allocator_type& __a)
williamr@4: #endif /*_STLP_DONT_SUP_DFLT_PARAM*/
williamr@4:     : _STLP_PRIV _List_base<_Tp, _Alloc>(__a)
williamr@4:     { this->insert(begin(), __n, __val); }
williamr@4: 
williamr@4: #if defined (_STLP_MEMBER_TEMPLATES)
williamr@4:   // We don't need any dispatching tricks here, because insert does all of
williamr@4:   // that anyway.
williamr@4:   template <class _InputIterator>
williamr@4:   list(_InputIterator __first, _InputIterator __last,
williamr@4:        const allocator_type& __a _STLP_ALLOCATOR_TYPE_DFL)
williamr@4:     : _STLP_PRIV _List_base<_Tp, _Alloc>(__a)
williamr@4:   { _M_insert(begin(), __first, __last); }
williamr@4: 
williamr@4: #  if defined (_STLP_NEEDS_EXTRA_TEMPLATE_CONSTRUCTORS)
williamr@4:   template <class _InputIterator>
williamr@4:   list(_InputIterator __first, _InputIterator __last)
williamr@4:     : _STLP_PRIV _List_base<_Tp, _Alloc>(allocator_type())
williamr@4:   { _M_insert(begin(), __first, __last); }
williamr@4: #  endif
williamr@4: #else /* _STLP_MEMBER_TEMPLATES */
williamr@4:   list(const value_type* __first, const value_type* __last,
williamr@4:        const allocator_type& __a = allocator_type())
williamr@4:     : _STLP_PRIV _List_base<_Tp, _Alloc>(__a)
williamr@4:     { _M_insert(begin(), __first, __last); }
williamr@4:   list(const_iterator __first, const_iterator __last,
williamr@4:        const allocator_type& __a = allocator_type())
williamr@4:     : _STLP_PRIV _List_base<_Tp, _Alloc>(__a)
williamr@4:     { _M_insert(begin(), __first, __last); }
williamr@4: #endif /* _STLP_MEMBER_TEMPLATES */
williamr@4: 
williamr@4: #if !defined (_STLP_DONT_SUP_DFLT_PARAM)
williamr@4:   explicit list(const allocator_type& __a = allocator_type())
williamr@4: #else
williamr@4:   list()
williamr@4:     : _STLP_PRIV _List_base<_Tp, _Alloc>(allocator_type()) {}
williamr@4:   list(const allocator_type& __a)
williamr@4: #endif
williamr@4:     : _STLP_PRIV _List_base<_Tp, _Alloc>(__a) {}
williamr@4: 
williamr@4:   list(const _Self& __x) : _STLP_PRIV _List_base<_Tp, _Alloc>(__x.get_allocator())
williamr@4:   { _M_insert(begin(), __x.begin(), __x.end()); }
williamr@4: 
williamr@4:   list(__move_source<_Self> src)
williamr@4:     : _STLP_PRIV _List_base<_Tp, _Alloc>(__move_source<_Base>(src.get())) {}
williamr@4: 
williamr@4:   ~list() {}
williamr@4: 
williamr@4:   _Self& operator = (const _Self& __x);
williamr@4: 
williamr@4:   iterator begin()                      { return iterator(this->_M_node._M_data._M_next); }
williamr@4:   const_iterator begin() const          { return const_iterator(this->_M_node._M_data._M_next); }
williamr@4: 
williamr@4:   iterator end()                        { return iterator(&this->_M_node._M_data); }
williamr@4:   const_iterator end() const            { return const_iterator(__CONST_CAST(_Node_base*, &this->_M_node._M_data)); }
williamr@4: 
williamr@4:   reverse_iterator rbegin()             { return reverse_iterator(end()); }
williamr@4:   const_reverse_iterator rbegin() const { return const_reverse_iterator(end()); }
williamr@4: 
williamr@4:   reverse_iterator rend()               { return reverse_iterator(begin()); }
williamr@4:   const_reverse_iterator rend() const   { return const_reverse_iterator(begin()); }
williamr@4: 
williamr@4:   size_type size() const {
williamr@4:     size_type __result = distance(begin(), end());
williamr@4:     return __result;
williamr@4:   }
williamr@4:   size_type max_size() const { return size_type(-1); }
williamr@4: 
williamr@4:   reference front()             { return *begin(); }
williamr@4:   const_reference front() const { return *begin(); }
williamr@4:   reference back()              { return *(--end()); }
williamr@4:   const_reference back() const  { return *(--end()); }
williamr@4: 
williamr@4: private:
williamr@4:   void _M_swap_aux(_Self& __x) {
williamr@4:     __x._M_node._M_swap_alloc(this->_M_node);
williamr@4:     __x._M_node._M_data._M_next = this->_M_node._M_data._M_next;
williamr@4:     __x._M_node._M_data._M_next->_M_prev = &__x._M_node._M_data;
williamr@4:     __x._M_node._M_data._M_prev = this->_M_node._M_data._M_prev;
williamr@4:     __x._M_node._M_data._M_prev->_M_next = &__x._M_node._M_data;
williamr@4:     this->_M_empty_initialize();
williamr@4:   }
williamr@4: 
williamr@4: public:
williamr@4:   void swap(_Self& __x) {
williamr@4:     if (__x.empty()) {
williamr@4:       if (this->empty()) {
williamr@4:         return;
williamr@4:       }
williamr@4:       this->_M_swap_aux(__x);
williamr@4:     } else if (this->empty()) {
williamr@4:       __x._M_swap_aux(*this);
williamr@4:     } else {
williamr@4:       this->_M_node.swap(__x._M_node);
williamr@4:       _STLP_STD::swap(this->_M_node._M_data._M_prev->_M_next, __x._M_node._M_data._M_prev->_M_next);
williamr@4:       _STLP_STD::swap(this->_M_node._M_data._M_next->_M_prev, __x._M_node._M_data._M_next->_M_prev);
williamr@4:     }
williamr@4:   }
williamr@4: 
williamr@4: #if !defined(_STLP_DONT_SUP_DFLT_PARAM) && !defined(_STLP_NO_ANACHRONISMS)
williamr@4:   iterator insert(iterator __pos, const_reference __x = value_type()) {
williamr@4: #else
williamr@4:   iterator insert(iterator __pos, const_reference __x) {
williamr@4: #endif /*!_STLP_DONT_SUP_DFLT_PARAM && !_STLP_NO_ANACHRONISMS*/
williamr@4:     _Node_base* __tmp = _M_create_node(__x);
williamr@4:     _Node_base* __n = __pos._M_node;
williamr@4:     _Node_base* __p = __n->_M_prev;
williamr@4:     __tmp->_M_next = __n;
williamr@4:     __tmp->_M_prev = __p;
williamr@4:     __p->_M_next = __tmp;
williamr@4:     __n->_M_prev = __tmp;
williamr@4:     return iterator(__tmp);
williamr@4:   }
williamr@4: 
williamr@4: private:
williamr@4: #if defined (_STLP_MEMBER_TEMPLATES)
williamr@4:   template <class _InputIterator>
williamr@4:   void _M_insert(iterator __pos, _InputIterator __first, _InputIterator __last) {
williamr@4:     typedef typename _IsIntegral<_InputIterator>::_Ret _Integral;
williamr@4:     _M_insert_dispatch(__pos, __first, __last, _Integral());
williamr@4:   }
williamr@4: 
williamr@4:   // Check whether it's an integral type.  If so, it's not an iterator.
williamr@4:   template<class _Integer>
williamr@4:   void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x,
williamr@4:                           const __true_type& /*_IsIntegral*/) {
williamr@4:     _M_fill_insert(__pos, __n, __x);
williamr@4:   }
williamr@4:   template <class _InputIter>
williamr@4:   void _M_insert_dispatch(iterator __pos,
williamr@4:                           _InputIter __first, _InputIter __last,
williamr@4:                           const __false_type& /*_IsIntegral*/) {
williamr@4: #else /* _STLP_MEMBER_TEMPLATES */
williamr@4:   void _M_insert(iterator __pos, const value_type* __first, const value_type* __last) {
williamr@4:     for (; __first != __last; ++__first)
williamr@4:       insert(__pos, *__first);
williamr@4:   }
williamr@4:   void _M_insert(iterator __pos, const_iterator __first, const_iterator __last) {
williamr@4: #endif /* _STLP_MEMBER_TEMPLATES */
williamr@4:     //We use a temporary list to avoid the auto reference troubles (infinite loop)
williamr@4:     for (; __first != __last; ++__first)
williamr@4:       insert(__pos, *__first);
williamr@4:   }
williamr@4: 
williamr@4: public:
williamr@4: #if defined (_STLP_MEMBER_TEMPLATES)
williamr@4:   template <class _InputIterator>
williamr@4:   void insert(iterator __pos, _InputIterator __first, _InputIterator __last) {
williamr@4:     typedef typename _IsIntegral<_InputIterator>::_Ret _Integral;
williamr@4:     _M_splice_insert_dispatch(__pos, __first, __last, _Integral());
williamr@4:   }
williamr@4: 
williamr@4: private:
williamr@4:   // Check whether it's an integral type.  If so, it's not an iterator.
williamr@4:   template<class _Integer>
williamr@4:   void _M_splice_insert_dispatch(iterator __pos, _Integer __n, _Integer __x,
williamr@4:                           const __true_type& /*_IsIntegral*/) {
williamr@4:     _M_fill_insert(__pos, __n, __x);
williamr@4:   }
williamr@4:   template <class _InputIter>
williamr@4:   void _M_splice_insert_dispatch(iterator __pos,
williamr@4:                           _InputIter __first, _InputIter __last,
williamr@4:                           const __false_type& /*_IsIntegral*/) {
williamr@4: #else /* _STLP_MEMBER_TEMPLATES */
williamr@4:   void insert(iterator __pos, const value_type* __first, const value_type* __last) {
williamr@4:     _Self __tmp(__first, __last, this->get_allocator());
williamr@4:     splice(__pos, __tmp);
williamr@4:   }
williamr@4:   void insert(iterator __pos, const_iterator __first, const_iterator __last) {
williamr@4: #endif /* _STLP_MEMBER_TEMPLATES */
williamr@4:     //We use a temporary list to avoid the auto reference troubles (infinite loop)
williamr@4:     _Self __tmp(__first, __last, this->get_allocator());
williamr@4:     splice(__pos, __tmp);
williamr@4:   }
williamr@4: 
williamr@4: public:
williamr@4:   void insert(iterator __pos, size_type __n, const_reference __x)
williamr@4:   { _M_fill_insert(__pos, __n, __x); }
williamr@4: 
williamr@4: private:
williamr@4:   void _M_fill_insert(iterator __pos, size_type __n, const_reference __x) {
williamr@4:     for ( ; __n > 0; --__n)
williamr@4:       insert(__pos, __x);
williamr@4:   }
williamr@4: 
williamr@4: public:
williamr@4:   void push_front(const_reference __x) { insert(begin(), __x); }
williamr@4:   void push_back (const_reference __x) { insert(end(), __x); }
williamr@4: 
williamr@4: #if defined (_STLP_DONT_SUP_DFLT_PARAM) && !defined (_STLP_NO_ANACHRONISMS)
williamr@4:   iterator insert(iterator __pos)
williamr@4:   { return insert(__pos, _STLP_DEFAULT_CONSTRUCTED(value_type)); }
williamr@4:   void push_front() {insert(begin());}
williamr@4:   void push_back() {insert(end());}
williamr@4: # endif /*_STLP_DONT_SUP_DFLT_PARAM && !_STLP_NO_ANACHRONISMS*/
williamr@4: 
williamr@4:   iterator erase(iterator __pos) {
williamr@4:     _Node_base* __next_node = __pos._M_node->_M_next;
williamr@4:     _Node_base* __prev_node = __pos._M_node->_M_prev;
williamr@4:     _Node* __n = __STATIC_CAST(_Node*, __pos._M_node);
williamr@4:     __prev_node->_M_next = __next_node;
williamr@4:     __next_node->_M_prev = __prev_node;
williamr@4:     _STLP_STD::_Destroy(&__n->_M_data);
williamr@4:     this->_M_node.deallocate(__n, 1);
williamr@4:     return iterator(__next_node);
williamr@4:   }
williamr@4: 
williamr@4:   iterator erase(iterator __first, iterator __last) {
williamr@4:     while (__first != __last)
williamr@4:       erase(__first++);
williamr@4:     return __last;
williamr@4:   }
williamr@4: 
williamr@4: #if !defined (_STLP_DONT_SUP_DFLT_PARAM)
williamr@4:   void resize(size_type __new_size, const_reference __x = value_type());
williamr@4: #else
williamr@4:   void resize(size_type __new_size, const_reference __x);
williamr@4:   void resize(size_type __new_size)
williamr@4:   { this->resize(__new_size, _STLP_DEFAULT_CONSTRUCTED(value_type)); }
williamr@4: #endif /*!_STLP_DONT_SUP_DFLT_PARAM*/
williamr@4: 
williamr@4:   void pop_front() { erase(begin()); }
williamr@4:   void pop_back() {
williamr@4:     iterator __tmp = end();
williamr@4:     erase(--__tmp);
williamr@4:   }
williamr@4: 
williamr@4: public:
williamr@4:   // assign(), a generalized assignment member function.  Two
williamr@4:   // versions: one that takes a count, and one that takes a range.
williamr@4:   // The range version is a member template, so we dispatch on whether
williamr@4:   // or not the type is an integer.
williamr@4: 
williamr@4:   void assign(size_type __n, const_reference __val) { _M_fill_assign(__n, __val); }
williamr@4: 
williamr@4:   void _M_fill_assign(size_type __n, const_reference __val);
williamr@4: 
williamr@4: #if defined (_STLP_MEMBER_TEMPLATES)
williamr@4:   template <class _InputIterator>
williamr@4:   void assign(_InputIterator __first, _InputIterator __last) {
williamr@4:     typedef typename _IsIntegral<_InputIterator>::_Ret _Integral;
williamr@4:     _M_assign_dispatch(__first, __last, _Integral());
williamr@4:   }
williamr@4: 
williamr@4:   template <class _Integer>
williamr@4:   void _M_assign_dispatch(_Integer __n, _Integer __val,
williamr@4:                           const __true_type& /*_IsIntegral*/) {
williamr@4:     _M_fill_assign(__n, __val);
williamr@4:   }
williamr@4: 
williamr@4:   template <class _InputIterator>
williamr@4:   void _M_assign_dispatch(_InputIterator __first2, _InputIterator __last2,
williamr@4:                           const __false_type& /*_IsIntegral*/) {
williamr@4: #else
williamr@4:   void assign(const value_type *__first2, const value_type *__last2) {
williamr@4:     iterator __first1 = begin();
williamr@4:     iterator __last1 = end();
williamr@4:     for ( ; __first1 != __last1 && __first2 != __last2; ++__first1, ++__first2)
williamr@4:       *__first1 = *__first2;
williamr@4:     if (__first2 == __last2)
williamr@4:       erase(__first1, __last1);
williamr@4:     else
williamr@4:       insert(__last1, __first2, __last2);
williamr@4:   }
williamr@4:   void assign(const_iterator __first2, const_iterator __last2) {
williamr@4: #endif /* _STLP_MEMBER_TEMPLATES */
williamr@4:     iterator __first1 = begin();
williamr@4:     iterator __last1 = end();
williamr@4:     for ( ; __first1 != __last1 && __first2 != __last2; ++__first1, ++__first2)
williamr@4:       *__first1 = *__first2;
williamr@4:     if (__first2 == __last2)
williamr@4:       erase(__first1, __last1);
williamr@4:     else
williamr@4:       insert(__last1, __first2, __last2);
williamr@4:   }
williamr@4: 
williamr@4: public:
williamr@4:   void splice(iterator __pos, _Self& __x) {
williamr@4:     if (!__x.empty()) {
williamr@4:       if (this->get_allocator() == __x.get_allocator()) {
williamr@4:         _STLP_PRIV _List_global_inst::_Transfer(__pos._M_node, __x.begin()._M_node, __x.end()._M_node);
williamr@4:       }
williamr@4:       else {
williamr@4:         insert(__pos, __x.begin(), __x.end());
williamr@4:         __x.clear();
williamr@4:       }
williamr@4:     }
williamr@4:   }
williamr@4:   void splice(iterator __pos, _Self& __x, iterator __i) {
williamr@4:     iterator __j = __i;
williamr@4:     ++__j;
williamr@4:     if (__pos == __i || __pos == __j) return;
williamr@4:     if (this->get_allocator() == __x.get_allocator()) {
williamr@4:       _STLP_PRIV _List_global_inst::_Transfer(__pos._M_node, __i._M_node, __j._M_node);
williamr@4:     }
williamr@4:     else {
williamr@4:       insert(__pos, *__i);
williamr@4:       __x.erase(__i);
williamr@4:     }
williamr@4:   }
williamr@4:   void splice(iterator __pos, _Self& __x, iterator __first, iterator __last) {
williamr@4:     if (__first != __last) {
williamr@4:       if (this->get_allocator() == __x.get_allocator()) {
williamr@4:         _STLP_PRIV _List_global_inst::_Transfer(__pos._M_node, __first._M_node, __last._M_node);
williamr@4:       }
williamr@4:       else {
williamr@4:         insert(__pos, __first, __last);
williamr@4:         __x.erase(__first, __last);
williamr@4:       }
williamr@4:     }
williamr@4:   }
williamr@4: 
williamr@4:   void remove(const_reference __val) {
williamr@4:     iterator __first = begin();
williamr@4:     iterator __last = end();
williamr@4:     while (__first != __last) {
williamr@4:       iterator __next = __first;
williamr@4:       ++__next;
williamr@4:       if (__val == *__first) erase(__first);
williamr@4:       __first = __next;
williamr@4:     }
williamr@4:   }
williamr@4: 
williamr@4:   void unique()
williamr@4:   { _STLP_PRIV _S_unique(*this, equal_to<value_type>()); }
williamr@4: 
williamr@4:   void merge(_Self& __x)
williamr@4:   { _STLP_PRIV _S_merge(*this, __x, less<value_type>()); }
williamr@4: 
williamr@4:   void reverse() {
williamr@4:     _Node_base* __p = &this->_M_node._M_data;
williamr@4:     _Node_base* __tmp = __p;
williamr@4:     do {
williamr@4:       _STLP_STD::swap(__tmp->_M_next, __tmp->_M_prev);
williamr@4:       __tmp = __tmp->_M_prev;     // Old next node is now prev.
williamr@4:     } while (__tmp != __p);
williamr@4:   }
williamr@4: 
williamr@4:   void sort()
williamr@4:   { _STLP_PRIV _S_sort(*this, less<value_type>()); }
williamr@4: 
williamr@4: #if defined (_STLP_MEMBER_TEMPLATES)
williamr@4:   template <class _Predicate>
williamr@4:   void remove_if(_Predicate __pred)
williamr@4:   { _STLP_PRIV _S_remove_if(*this, __pred); }
williamr@4:   template <class _BinaryPredicate>
williamr@4:   void unique(_BinaryPredicate __binary_pred)
williamr@4:   { _STLP_PRIV _S_unique(*this, __binary_pred); }
williamr@4: 
williamr@4:   template <class _StrictWeakOrdering>
williamr@4:   void merge(_Self& __x,
williamr@4:              _StrictWeakOrdering __comp) {
williamr@4:     _STLP_PRIV _S_merge(*this, __x, __comp);
williamr@4:   }
williamr@4: 
williamr@4:   template <class _StrictWeakOrdering>
williamr@4:   void sort(_StrictWeakOrdering __comp)
williamr@4:   { _STLP_PRIV _S_sort(*this, __comp); }
williamr@4: #endif /* _STLP_MEMBER_TEMPLATES */
williamr@4: };
williamr@4: 
williamr@4: #if defined (list)
williamr@4: #  undef list
williamr@4: _STLP_MOVE_TO_STD_NAMESPACE
williamr@4: #endif
williamr@4: 
williamr@4: _STLP_END_NAMESPACE
williamr@4: 
williamr@4: #if !defined (_STLP_LINK_TIME_INSTANTIATION)
williamr@4: #  include <stl/_list.c>
williamr@4: #endif
williamr@4: 
williamr@4: #if defined (_STLP_USE_PTR_SPECIALIZATIONS)
williamr@4: #  include <stl/pointers/_list.h>
williamr@4: #endif
williamr@4: 
williamr@4: #if defined (_STLP_DEBUG)
williamr@4: #  include <stl/debug/_list.h>
williamr@4: #endif
williamr@4: 
williamr@4: _STLP_BEGIN_NAMESPACE
williamr@4: 
williamr@4: template <class _Tp, class _Alloc>
williamr@4: _STLP_INLINE_LOOP bool  _STLP_CALL
williamr@4: operator==(const list<_Tp,_Alloc>& __x, const list<_Tp,_Alloc>& __y) {
williamr@4:   typedef typename list<_Tp,_Alloc>::const_iterator const_iterator;
williamr@4:   const_iterator __end1 = __x.end();
williamr@4:   const_iterator __end2 = __y.end();
williamr@4: 
williamr@4:   const_iterator __i1 = __x.begin();
williamr@4:   const_iterator __i2 = __y.begin();
williamr@4:   while (__i1 != __end1 && __i2 != __end2 && *__i1 == *__i2) {
williamr@4:     ++__i1;
williamr@4:     ++__i2;
williamr@4:   }
williamr@4:   return __i1 == __end1 && __i2 == __end2;
williamr@4: }
williamr@4: 
williamr@4: #define _STLP_EQUAL_OPERATOR_SPECIALIZED
williamr@4: #define _STLP_TEMPLATE_HEADER    template <class _Tp, class _Alloc>
williamr@4: #define _STLP_TEMPLATE_CONTAINER list<_Tp, _Alloc>
williamr@4: #include <stl/_relops_cont.h>
williamr@4: #undef _STLP_TEMPLATE_CONTAINER
williamr@4: #undef _STLP_TEMPLATE_HEADER
williamr@4: #undef _STLP_EQUAL_OPERATOR_SPECIALIZED
williamr@4: 
williamr@4: #if defined (_STLP_CLASS_PARTIAL_SPECIALIZATION)
williamr@4: template <class _Tp, class _Alloc>
williamr@4: struct __move_traits<list<_Tp, _Alloc> > {
williamr@4:   typedef __stlp_movable implemented;
williamr@4:   typedef typename __move_traits<_Alloc>::complete complete;
williamr@4: };
williamr@4: #endif /* _STLP_CLASS_PARTIAL_SPECIALIZATION */
williamr@4: 
williamr@4: _STLP_END_NAMESPACE
williamr@4: 
williamr@4: #endif /* _STLP_INTERNAL_LIST_IMPL_H */
williamr@4: 
williamr@4: // Local Variables:
williamr@4: // mode:C++
williamr@4: // End: