williamr@2: /*
williamr@2:  *
williamr@2:  * Copyright (c) 1996,1997
williamr@2:  * Silicon Graphics Computer Systems, Inc.
williamr@2:  *
williamr@2:  * Copyright (c) 1997
williamr@2:  * Moscow Center for SPARC Technology
williamr@2:  *
williamr@2:  * Copyright (c) 1999 
williamr@2:  * Boris Fomitchev
williamr@2:  *
williamr@2:  * This material is provided "as is", with absolutely no warranty expressed
williamr@2:  * or implied. Any use is at your own risk.
williamr@2:  *
williamr@2:  * Permission to use or copy this software for any purpose is hereby granted 
williamr@2:  * without fee, provided the above notices are retained on all copies.
williamr@2:  * Permission to modify the code and to distribute modified code is granted,
williamr@2:  * provided the above notices are retained, and a notice that the code was
williamr@2:  * modified is included with the above copyright notice.
williamr@2:  *
williamr@2:  */
williamr@2: 
williamr@2: /* NOTE: This is an internal header file, included by other STL headers.
williamr@2:  *   You should not attempt to use it directly.
williamr@2:  */
williamr@2: 
williamr@2: #ifndef _STLP_INTERNAL_SLIST_H
williamr@2: #define _STLP_INTERNAL_SLIST_H
williamr@2: 
williamr@2: 
williamr@2: # ifndef _STLP_INTERNAL_ALGOBASE_H
williamr@2: #  include <stl/_algobase.h>
williamr@2: # endif
williamr@2: 
williamr@2: # ifndef _STLP_INTERNAL_ALLOC_H
williamr@2: #  include <stl/_alloc.h>
williamr@2: # endif
williamr@2: 
williamr@2: # ifndef _STLP_INTERNAL_ITERATOR_H
williamr@2: #  include <stl/_iterator.h>
williamr@2: # endif
williamr@2: 
williamr@2: # ifndef _STLP_INTERNAL_CONSTRUCT_H
williamr@2: #  include <stl/_construct.h>
williamr@2: # endif
williamr@2: 
williamr@2: # ifndef _STLP_INTERNAL_SLIST_BASE_H
williamr@2: #  include <stl/_slist_base.h>
williamr@2: # endif
williamr@2: 
williamr@2: # undef slist
williamr@2: # define  slist  __WORKAROUND_DBG_RENAME(slist)
williamr@2: 
williamr@2: _STLP_BEGIN_NAMESPACE 
williamr@2: 
williamr@2: template <class _Tp>
williamr@2: struct _Slist_node : public _Slist_node_base
williamr@2: {
williamr@2:   _Tp _M_data;
williamr@2:   __TRIVIAL_STUFF(_Slist_node)
williamr@2: };
williamr@2: 
williamr@2: struct _Slist_iterator_base {
williamr@2: 
williamr@2:   typedef size_t               size_type;
williamr@2:   typedef ptrdiff_t            difference_type;
williamr@2:   typedef forward_iterator_tag iterator_category;
williamr@2: 
williamr@2:   _Slist_node_base* _M_node;
williamr@2: 
williamr@2:   _Slist_iterator_base(_Slist_node_base* __x) : _M_node(__x) {}
williamr@2: 
williamr@2:   void _M_incr() { 
williamr@2: //    _STLP_VERBOSE_ASSERT(_M_node != 0, _StlMsg_INVALID_ADVANCE)
williamr@2:     _M_node = _M_node->_M_next; 
williamr@2:   }
williamr@2:   bool operator==(const _Slist_iterator_base& __y ) const { 
williamr@2:     return _M_node == __y._M_node; 
williamr@2:   }
williamr@2:   bool operator!=(const _Slist_iterator_base& __y ) const { 
williamr@2:     return _M_node != __y._M_node; 
williamr@2:   }
williamr@2: };
williamr@2: 
williamr@2: # ifdef _STLP_USE_OLD_HP_ITERATOR_QUERIES
williamr@2: inline ptrdiff_t* _STLP_CALL distance_type(const _Slist_iterator_base&) { return 0; }
williamr@2: inline forward_iterator_tag _STLP_CALL iterator_category(const _Slist_iterator_base&) { return forward_iterator_tag(); }
williamr@2: #endif
williamr@2: 
williamr@2: template <class _Tp, class _Traits>
williamr@2: struct _Slist_iterator : public _Slist_iterator_base
williamr@2: {
williamr@2:   typedef _Tp value_type;
williamr@2:   typedef typename _Traits::pointer    pointer;
williamr@2:   typedef typename _Traits::reference  reference;
williamr@2:   typedef forward_iterator_tag iterator_category;
williamr@2:   typedef size_t size_type;
williamr@2:   typedef ptrdiff_t difference_type;
williamr@2:   
williamr@2:   typedef _Slist_iterator<_Tp, _Nonconst_traits<_Tp> > iterator;
williamr@2:   typedef _Slist_iterator<_Tp, _Const_traits<_Tp> >    const_iterator;
williamr@2:   typedef _Slist_iterator<_Tp, _Traits>                       _Self;
williamr@2: 
williamr@2:   typedef _Slist_node<value_type> _Node;
williamr@2: 
williamr@2:   _Slist_iterator(_Node* __x) : _Slist_iterator_base(__x) {}
williamr@2:   _Slist_iterator() : _Slist_iterator_base(0) {}
williamr@2:   _Slist_iterator(const iterator& __x) : _Slist_iterator_base(__x._M_node) {}
williamr@2: 
williamr@2:   reference operator*() const { return ((_Node*) _M_node)->_M_data; }
williamr@2: 
williamr@2:   _STLP_DEFINE_ARROW_OPERATOR
williamr@2: 
williamr@2:   _Self& operator++()
williamr@2:   {
williamr@2:     _M_incr();
williamr@2:     return *this;
williamr@2:   }
williamr@2:   _Self operator++(int)
williamr@2:   {
williamr@2:     _Self __tmp = *this;
williamr@2:     _M_incr();
williamr@2:     return __tmp;
williamr@2:   }
williamr@2: };
williamr@2: 
williamr@2: #ifdef _STLP_USE_OLD_HP_ITERATOR_QUERIES
williamr@2: template <class _Tp, class _Traits>
williamr@2: inline _Tp* _STLP_CALL value_type(const _Slist_iterator<_Tp, _Traits>&) { return (_Tp*)0; }
williamr@2: #endif /* OLD_QUERIES */
williamr@2: 
williamr@2: // Base class that encapsulates details of allocators and simplifies EH
williamr@2: 
williamr@2: template <class _Tp, class _Alloc> 
williamr@2: struct _Slist_base 
williamr@2: {
williamr@2:   _STLP_FORCE_ALLOCATORS(_Tp, _Alloc)
williamr@2:   typedef typename _Alloc_traits<_Tp,_Alloc>::allocator_type allocator_type;
williamr@2:   typedef _Slist_node<_Tp> _Node;
williamr@2: 
williamr@2:   _Slist_base(const allocator_type& __a) : 
williamr@2:     _M_head(_STLP_CONVERT_ALLOCATOR(__a, _Node), _Slist_node_base() ) { 
williamr@2:     _M_head._M_data._M_next = 0; 
williamr@2:   }
williamr@2:   ~_Slist_base() { _M_erase_after(&_M_head._M_data, 0); }
williamr@2: 
williamr@2: protected:
williamr@2:   typedef typename _Alloc_traits<_Node,_Alloc>::allocator_type _M_node_allocator_type;
williamr@2: 
williamr@2:   _Slist_node_base* _M_erase_after(_Slist_node_base* __pos)
williamr@2:   {
williamr@2:     _Node* __next = (_Node*) (__pos->_M_next);
williamr@2:     _Slist_node_base* __next_next = __next->_M_next;
williamr@2:     __pos->_M_next = __next_next;
williamr@2:     _STLP_STD::_Destroy(&__next->_M_data);
williamr@2:     _M_head.deallocate(__next,1);
williamr@2:     return __next_next;
williamr@2:   }
williamr@2:   _Slist_node_base* _M_erase_after(_Slist_node_base*, _Slist_node_base*);
williamr@2: 
williamr@2: public:
williamr@2:   allocator_type get_allocator() const { 
williamr@2:     return _STLP_CONVERT_ALLOCATOR((const _M_node_allocator_type&)_M_head, _Tp); 
williamr@2:   }
williamr@2:   _STLP_alloc_proxy<_Slist_node_base, _Node, _M_node_allocator_type> _M_head;
williamr@2: };  
williamr@2: 
williamr@2: template <class _Tp, _STLP_DEFAULT_ALLOCATOR_SELECT(_Tp) >
williamr@2: class slist : public _Slist_base<_Tp,_Alloc>
williamr@2: {
williamr@2: private:
williamr@2:   typedef _Slist_base<_Tp,_Alloc> _Base;
williamr@2:   typedef slist<_Tp,_Alloc> _Self;
williamr@2: public:
williamr@2:   typedef _Tp                value_type;
williamr@2:   typedef value_type*       pointer;
williamr@2:   typedef const value_type* const_pointer;
williamr@2:   typedef value_type&       reference;
williamr@2:   typedef const value_type& const_reference;
williamr@2:   typedef size_t            size_type;
williamr@2:   typedef ptrdiff_t         difference_type;
williamr@2:   typedef forward_iterator_tag _Iterator_category;
williamr@2: 
williamr@2:   typedef _Slist_iterator<_Tp, _Nonconst_traits<_Tp> >  iterator;
williamr@2:   typedef _Slist_iterator<_Tp, _Const_traits<_Tp> >     const_iterator;
williamr@2: 
williamr@2:   _STLP_FORCE_ALLOCATORS(_Tp, _Alloc)
williamr@2:   typedef typename _Base::allocator_type allocator_type;
williamr@2: 
williamr@2: 
williamr@2: private:
williamr@2:   typedef _Slist_node<_Tp>      _Node;
williamr@2:   typedef _Slist_node_base      _Node_base;
williamr@2:   typedef _Slist_iterator_base  _Iterator_base;
williamr@2: 
williamr@2:   _Node* _M_create_node(const value_type& __x) {
williamr@2:     _Node* __node = this->_M_head.allocate(1);
williamr@2:     _STLP_TRY {
williamr@2:       _Construct(&__node->_M_data, __x);
williamr@2:       __node->_M_next = 0;
williamr@2:     }
williamr@2:     _STLP_UNWIND(this->_M_head.deallocate(__node, 1));
williamr@2:     return __node;
williamr@2:   }
williamr@2:   
williamr@2:   _Node* _M_create_node() {
williamr@2:     _Node* __node = this->_M_head.allocate(1);
williamr@2:     _STLP_TRY {
williamr@2:       _Construct(&__node->_M_data);
williamr@2:       __node->_M_next = 0;
williamr@2:     }
williamr@2:     _STLP_UNWIND(this->_M_head.deallocate(__node, 1));
williamr@2:     return __node;
williamr@2:   }
williamr@2: 
williamr@2: public:
williamr@2:   allocator_type get_allocator() const { return _Base::get_allocator(); }
williamr@2: 
williamr@2:   explicit slist(const allocator_type& __a = allocator_type()) : _Slist_base<_Tp,_Alloc>(__a) {
williamr@2:     _STLP_POP_IF_CHECK
williamr@2:   }
williamr@2: 
williamr@2:   slist(size_type __n, const value_type& __x,
williamr@2:         const allocator_type& __a =  allocator_type()) : _Slist_base<_Tp,_Alloc>(__a)
williamr@2:     { 
williamr@2:       _STLP_PUSH_CLEANUP_ITEM(_Base, this) 
williamr@2:       _M_insert_after_fill(&this->_M_head._M_data, __n, __x); 
williamr@2:       _STLP_POP_CLEANUP_ITEM
williamr@2:     }
williamr@2: 
williamr@2:   explicit slist(size_type __n) : _Slist_base<_Tp,_Alloc>(allocator_type())
williamr@2:     { 
williamr@2: # ifdef _STLP_USE_TRAP_LEAVE
williamr@2:       _STLP_PUSH_CLEANUP_ITEM(_Base, this) 
williamr@2:       _Tp __p;
williamr@2:       _STLP_PUSH_CLEANUP_ITEM(_Tp, &__p) 
williamr@2:       _M_insert_after_fill(&this->_M_head._M_data, __n, __p);
williamr@2:        // unconditional for __p
williamr@2:       CleanupStack::Pop();
williamr@2:       _STLP_POP_CLEANUP_ITEM
williamr@2: # else
williamr@2:       _M_insert_after_fill(&this->_M_head._M_data, __n, value_type()); 
williamr@2: # endif
williamr@2:     }
williamr@2: 
williamr@2: #ifdef _STLP_MEMBER_TEMPLATES
williamr@2:   // We don't need any dispatching tricks here, because _M_insert_after_range
williamr@2:   // already does them.
williamr@2:   template <class _InputIterator>
williamr@2:   slist(_InputIterator __first, _InputIterator __last,
williamr@2:         const allocator_type& __a _STLP_ALLOCATOR_TYPE_DFL) : 
williamr@2:     _Slist_base<_Tp,_Alloc>(__a)
williamr@2:   { 
williamr@2:      _STLP_PUSH_CLEANUP_ITEM(_Base, this) 
williamr@2:      _M_insert_after_range(&this->_M_head._M_data, __first, __last); 
williamr@2:      _STLP_POP_CLEANUP_ITEM
williamr@2:   }
williamr@2: # ifdef _STLP_NEEDS_EXTRA_TEMPLATE_CONSTRUCTORS
williamr@2:   // VC++ needs this crazyness
williamr@2:   template <class _InputIterator>
williamr@2:   slist(_InputIterator __first, _InputIterator __last) :
williamr@2:     _Slist_base<_Tp,_Alloc>(allocator_type())
williamr@2:   { 
williamr@2:     _STLP_PUSH_CLEANUP_ITEM(_Base, this) 
williamr@2:     _M_insert_after_range(&this->_M_head._M_data, __first, __last); 
williamr@2:     _STLP_POP_CLEANUP_ITEM
williamr@2:   }
williamr@2: # endif  
williamr@2: #else /* _STLP_MEMBER_TEMPLATES */
williamr@2:   slist(const_iterator __first, const_iterator __last,
williamr@2:         const allocator_type& __a =  allocator_type() ) :
williamr@2:     _Slist_base<_Tp,_Alloc>(__a)
williamr@2:     { 
williamr@2:       _STLP_PUSH_CLEANUP_ITEM(_Base, this) 
williamr@2:       _M_insert_after_range(&this->_M_head._M_data, __first, __last); 
williamr@2:       _STLP_POP_CLEANUP_ITEM
williamr@2:     }
williamr@2:   slist(const value_type* __first, const value_type* __last,
williamr@2:         const allocator_type& __a =  allocator_type()) : 
williamr@2:     _Slist_base<_Tp,_Alloc>(__a)
williamr@2:     { 
williamr@2:       _STLP_PUSH_CLEANUP_ITEM(_Base, this) 
williamr@2:       _M_insert_after_range(&this->_M_head._M_data, __first, __last); 
williamr@2:       _STLP_POP_CLEANUP_ITEM
williamr@2:     }
williamr@2: #endif /* _STLP_MEMBER_TEMPLATES */
williamr@2: 
williamr@2:   slist(const _Self& __x) : _Slist_base<_Tp,_Alloc>(__x.get_allocator())
williamr@2:   {  
williamr@2:     _STLP_PUSH_CLEANUP_ITEM(_Base, this) 
williamr@2:     _M_insert_after_range(&this->_M_head._M_data, __x.begin(), __x.end()); 
williamr@2:     _STLP_POP_CLEANUP_ITEM
williamr@2:   }
williamr@2: 
williamr@2:   _Self& operator= (const _Self& __x);
williamr@2: 
williamr@2:   ~slist() {}
williamr@2: 
williamr@2: #ifdef _STLP_USE_TRAP_LEAVE
williamr@2: public:
williamr@2:   static void* operator new (size_t __n, TLeave) { return _STLP_StackHelper<bool>::_NewLC(__n); }
williamr@2:   static void* operator new (size_t __n) { return _STLP_StackHelper<bool>::_NewLC(__n); }
williamr@2: #endif
williamr@2: 
williamr@2: public:
williamr@2:   // assign(), a generalized assignment member function.  Two
williamr@2:   // versions: one that takes a count, and one that takes a range.
williamr@2:   // The range version is a member template, so we dispatch on whether
williamr@2:   // or not the type is an integer.
williamr@2: 
williamr@2:   void assign(size_type __n, const _Tp& __val)
williamr@2:     { _M_fill_assign(__n, __val); }
williamr@2: 
williamr@2:   void _M_fill_assign(size_type __n, const _Tp& __val);
williamr@2: 
williamr@2: #ifdef _STLP_MEMBER_TEMPLATES
williamr@2: 
williamr@2:   template <class _InputIterator>
williamr@2:   void assign(_InputIterator __first, _InputIterator __last) {
williamr@2:     typedef typename _Is_integer<_InputIterator>::_Integral _Integral;
williamr@2:     _M_assign_dispatch(__first, __last, _Integral());
williamr@2:   }
williamr@2: 
williamr@2:   template <class _Integer>
williamr@2:   void _M_assign_dispatch(_Integer __n, _Integer __val, const __true_type&)
williamr@2:     { _M_fill_assign((size_type) __n, (_Tp) __val); }
williamr@2: 
williamr@2:   template <class _InputIter>
williamr@2:   void
williamr@2:   _M_assign_dispatch(_InputIter __first, _InputIter __last,
williamr@2: 		     const __false_type&) {
williamr@2:     _Node_base* __prev = &this->_M_head._M_data;
williamr@2:     _Node* __node = (_Node*) this->_M_head._M_data._M_next;
williamr@2:     while (__node != 0 && __first != __last) {
williamr@2:       __node->_M_data = *__first;
williamr@2:       __prev = __node;
williamr@2:       __node = (_Node*) __node->_M_next;
williamr@2:       ++__first;
williamr@2:     }
williamr@2:     if (__first != __last)
williamr@2:       _M_insert_after_range(__prev, __first, __last);
williamr@2:     else
williamr@2:       this->_M_erase_after(__prev, 0);
williamr@2:   }
williamr@2: #endif /* _STLP_MEMBER_TEMPLATES */
williamr@2: 
williamr@2: public:
williamr@2: 
williamr@2:   // Experimental new feature: before_begin() returns a
williamr@2:   // non-dereferenceable iterator that, when incremented, yields
williamr@2:   // begin().  This iterator may be used as the argument to
williamr@2:   // insert_after, erase_after, etc.  Note that even for an empty 
williamr@2:   // slist, before_begin() is not the same iterator as end().  It 
williamr@2:   // is always necessary to increment before_begin() at least once to
williamr@2:   // obtain end().
williamr@2:   iterator before_begin() { return iterator((_Node*) &this->_M_head._M_data); }
williamr@2:   const_iterator before_begin() const
williamr@2:     { return const_iterator((_Node*) &this->_M_head._M_data); }
williamr@2: 
williamr@2:   iterator begin() { return iterator((_Node*)this->_M_head._M_data._M_next); }
williamr@2:   const_iterator begin() const 
williamr@2:     { return const_iterator((_Node*)this->_M_head._M_data._M_next);}
williamr@2: 
williamr@2:   iterator end() { return iterator(0); }
williamr@2:   const_iterator end() const { return const_iterator(0); }
williamr@2: 
williamr@2:   size_type size() const { return _Sl_global_inst::size(this->_M_head._M_data._M_next); }
williamr@2:   
williamr@2:   size_type max_size() const { return size_type(-1); }
williamr@2: 
williamr@2:   bool empty() const { return this->_M_head._M_data._M_next == 0; }
williamr@2: 
williamr@2:   void swap(_Self& __x) { 
williamr@2:     _STLP_STD::swap(this->_M_head, __x._M_head); 
williamr@2:   }
williamr@2: 
williamr@2: public:
williamr@2:   reference front() { return ((_Node*) this->_M_head._M_data._M_next)->_M_data; }
williamr@2:   const_reference front() const 
williamr@2:     { return ((_Node*) this->_M_head._M_data._M_next)->_M_data; }
williamr@2:   void push_front(const value_type& __x)   {
williamr@2:     __slist_make_link(&this->_M_head._M_data, _M_create_node(__x));
williamr@2:   }
williamr@2: 
williamr@2: # ifndef _STLP_NO_ANACHRONISMS
williamr@2:   void push_front() { __slist_make_link(&this->_M_head._M_data, _M_create_node());}
williamr@2: # endif
williamr@2: 
williamr@2:   void pop_front() {
williamr@2:     _Node* __node = (_Node*) this->_M_head._M_data._M_next;
williamr@2:     this->_M_head._M_data._M_next = __node->_M_next;
williamr@2:     _STLP_STD::_Destroy(&__node->_M_data);
williamr@2:     this->_M_head.deallocate(__node, 1);
williamr@2:   }
williamr@2: 
williamr@2:   iterator previous(const_iterator __pos) {
williamr@2:     return iterator((_Node*) _Sl_global_inst::__previous(&this->_M_head._M_data, __pos._M_node));
williamr@2:   }
williamr@2:   const_iterator previous(const_iterator __pos) const {
williamr@2:     return const_iterator((_Node*) _Sl_global_inst::__previous(&this->_M_head._M_data, __pos._M_node));
williamr@2:   }
williamr@2: 
williamr@2: private:
williamr@2:   _Node* _M_insert_after(_Node_base* __pos, const value_type& __x) {
williamr@2:     return (_Node*) (__slist_make_link(__pos, _M_create_node(__x)));
williamr@2:   }
williamr@2: 
williamr@2:   _Node* _M_insert_after(_Node_base* __pos) {
williamr@2:     return (_Node*) (__slist_make_link(__pos, _M_create_node()));
williamr@2:   }
williamr@2: 
williamr@2:   void _M_insert_after_fill(_Node_base* __pos,
williamr@2:                             size_type __n, const value_type& __x) {
williamr@2:     for (size_type __i = 0; __i < __n; ++__i)
williamr@2:       __pos = __slist_make_link(__pos, _M_create_node(__x));
williamr@2:   }
williamr@2: 
williamr@2: #ifdef _STLP_MEMBER_TEMPLATES
williamr@2: 
williamr@2:   // Check whether it's an integral type.  If so, it's not an iterator.
williamr@2:   template <class _InIter>
williamr@2:   void _M_insert_after_range(_Node_base* __pos, 
williamr@2:                              _InIter __first, _InIter __last) {
williamr@2:     typedef typename _Is_integer<_InIter>::_Integral _Integral;
williamr@2:     _M_insert_after_range(__pos, __first, __last, _Integral());
williamr@2:   }
williamr@2: 
williamr@2:   template <class _Integer>
williamr@2:   void _M_insert_after_range(_Node_base* __pos, _Integer __n, _Integer __x,
williamr@2:                              const __true_type&) {
williamr@2:     _M_insert_after_fill(__pos, __n, __x);
williamr@2:   }
williamr@2: 
williamr@2:   template <class _InIter>
williamr@2:   void _M_insert_after_range(_Node_base* __pos,
williamr@2:                              _InIter __first, _InIter __last,
williamr@2:                              const __false_type&) {
williamr@2:     while (__first != __last) {
williamr@2:       __pos = __slist_make_link(__pos, _M_create_node(*__first));
williamr@2:       ++__first;
williamr@2:     }
williamr@2:   }
williamr@2: 
williamr@2: #else /* _STLP_MEMBER_TEMPLATES */
williamr@2: 
williamr@2:   void _M_insert_after_range(_Node_base* __pos,
williamr@2:                              const_iterator __first, const_iterator __last) {
williamr@2:     while (__first != __last) {
williamr@2:       __pos = __slist_make_link(__pos, _M_create_node(*__first));
williamr@2:       ++__first;
williamr@2:     }
williamr@2:   }
williamr@2:   void _M_insert_after_range(_Node_base* __pos,
williamr@2:                              const value_type* __first,
williamr@2:                              const value_type* __last) {
williamr@2:     while (__first != __last) {
williamr@2:       __pos = __slist_make_link(__pos, _M_create_node(*__first));
williamr@2:       ++__first;
williamr@2:     }
williamr@2:   }
williamr@2: 
williamr@2: #endif /* _STLP_MEMBER_TEMPLATES */
williamr@2: 
williamr@2: public:
williamr@2: 
williamr@2:   iterator insert_after(iterator __pos, const value_type& __x) {
williamr@2:     return iterator(_M_insert_after(__pos._M_node, __x));
williamr@2:   }
williamr@2: 
williamr@2:   iterator insert_after(iterator __pos) {
williamr@2:     return insert_after(__pos, value_type());
williamr@2:   }
williamr@2: 
williamr@2:   void insert_after(iterator __pos, size_type __n, const value_type& __x) {
williamr@2:     _M_insert_after_fill(__pos._M_node, __n, __x);
williamr@2:   }
williamr@2: 
williamr@2: #ifdef _STLP_MEMBER_TEMPLATES
williamr@2: 
williamr@2:   // We don't need any dispatching tricks here, because _M_insert_after_range
williamr@2:   // already does them.
williamr@2:   template <class _InIter>
williamr@2:   void insert_after(iterator __pos, _InIter __first, _InIter __last) {
williamr@2:     _M_insert_after_range(__pos._M_node, __first, __last);
williamr@2:   }
williamr@2: 
williamr@2: #else /* _STLP_MEMBER_TEMPLATES */
williamr@2: 
williamr@2:   void insert_after(iterator __pos,
williamr@2:                     const_iterator __first, const_iterator __last) {
williamr@2:     _M_insert_after_range(__pos._M_node, __first, __last);
williamr@2:   }
williamr@2:   void insert_after(iterator __pos,
williamr@2:                     const value_type* __first, const value_type* __last) {
williamr@2:     _M_insert_after_range(__pos._M_node, __first, __last);
williamr@2:   }
williamr@2: 
williamr@2: #endif /* _STLP_MEMBER_TEMPLATES */
williamr@2: 
williamr@2:   iterator insert(iterator __pos, const value_type& __x) {
williamr@2:     return iterator(_M_insert_after(_Sl_global_inst::__previous(&this->_M_head._M_data, __pos._M_node),
williamr@2:                     __x));
williamr@2:   }
williamr@2: 
williamr@2:   iterator insert(iterator __pos) {
williamr@2:     return iterator(_M_insert_after(_Sl_global_inst::__previous(&this->_M_head._M_data, __pos._M_node),
williamr@2:                                     value_type()));
williamr@2:   }
williamr@2: 
williamr@2:   void insert(iterator __pos, size_type __n, const value_type& __x) {
williamr@2:     _M_insert_after_fill(_Sl_global_inst::__previous(&this->_M_head._M_data, __pos._M_node), __n, __x);
williamr@2:   } 
williamr@2:     
williamr@2: #ifdef _STLP_MEMBER_TEMPLATES
williamr@2: 
williamr@2:   // We don't need any dispatching tricks here, because _M_insert_after_range
williamr@2:   // already does them.
williamr@2:   template <class _InIter>
williamr@2:   void insert(iterator __pos, _InIter __first, _InIter __last) {
williamr@2:     _M_insert_after_range(_Sl_global_inst::__previous(&this->_M_head._M_data, __pos._M_node), 
williamr@2:                           __first, __last);
williamr@2:   }
williamr@2: 
williamr@2: #else /* _STLP_MEMBER_TEMPLATES */
williamr@2: 
williamr@2:   void insert(iterator __pos, const_iterator __first, const_iterator __last) {
williamr@2:     _M_insert_after_range(_Sl_global_inst::__previous(&this->_M_head._M_data, __pos._M_node), 
williamr@2:                           __first, __last);
williamr@2:   }
williamr@2:   void insert(iterator __pos, const value_type* __first, 
williamr@2:                               const value_type* __last) {
williamr@2:     _M_insert_after_range(_Sl_global_inst::__previous(&this->_M_head._M_data, __pos._M_node), 
williamr@2:                           __first, __last);
williamr@2:   }
williamr@2: 
williamr@2: #endif /* _STLP_MEMBER_TEMPLATES */
williamr@2: 
williamr@2: 
williamr@2: public:
williamr@2:   iterator erase_after(iterator __pos) {
williamr@2:     return iterator((_Node*) this->_M_erase_after(__pos._M_node));
williamr@2:   }
williamr@2:   iterator erase_after(iterator __before_first, iterator __last) {
williamr@2:     return iterator((_Node*) this->_M_erase_after(__before_first._M_node, 
williamr@2:                                             __last._M_node));
williamr@2:   } 
williamr@2: 
williamr@2:   iterator erase(iterator __pos) {
williamr@2:     return iterator((_Node*) this->_M_erase_after(_Sl_global_inst::__previous(&this->_M_head._M_data, 
williamr@2:                                                     __pos._M_node)));
williamr@2:   }
williamr@2:   iterator erase(iterator __first, iterator __last) {
williamr@2:     return iterator((_Node*) this->_M_erase_after(
williamr@2:       _Sl_global_inst::__previous(&this->_M_head._M_data, __first._M_node), __last._M_node));
williamr@2:   }
williamr@2: 
williamr@2:   void resize(size_type new_size, const _Tp& __x);
williamr@2:   void resize(size_type new_size) { resize(new_size, _Tp()); }
williamr@2:   void clear() {
williamr@2:     this->_M_erase_after(&this->_M_head._M_data, 0); 
williamr@2:   }
williamr@2: 
williamr@2: public:
williamr@2:   // Moves the range [__before_first + 1, __before_last + 1) to *this,
williamr@2:   //  inserting it immediately after __pos.  This is constant time.
williamr@2:   void splice_after(iterator __pos, 
williamr@2:                     iterator __before_first, iterator __before_last)
williamr@2:   {
williamr@2:     if (__before_first != __before_last) {
williamr@2:       _Sl_global_inst::__splice_after(__pos._M_node, __before_first._M_node, 
williamr@2:                            __before_last._M_node);
williamr@2:     }
williamr@2:   }
williamr@2: 
williamr@2:   // Moves the element that follows __prev to *this, inserting it immediately
williamr@2:   //  after __pos.  This is constant time.
williamr@2:   void splice_after(iterator __pos, iterator __prev)
williamr@2:   {
williamr@2:     _Sl_global_inst::__splice_after(__pos._M_node,
williamr@2:                          __prev._M_node, __prev._M_node->_M_next);
williamr@2:   }
williamr@2: 
williamr@2:   // Removes all of the elements from the list __x to *this, inserting
williamr@2:   // them immediately after __pos.  __x must not be *this.  Complexity:
williamr@2:   // linear in __x.size().
williamr@2:   void splice_after(iterator __pos, _Self& __x)
williamr@2:   {
williamr@2:     _Sl_global_inst::__splice_after(__pos._M_node, &__x._M_head._M_data);
williamr@2:   }
williamr@2: 
williamr@2:   // Linear in distance(begin(), __pos), and linear in __x.size().
williamr@2:   void splice(iterator __pos, _Self& __x) {
williamr@2:     if (__x._M_head._M_data._M_next)
williamr@2:       _Sl_global_inst::__splice_after(_Sl_global_inst::__previous(&this->_M_head._M_data, __pos._M_node),
williamr@2:                            &__x._M_head._M_data, _Sl_global_inst::__previous(&__x._M_head._M_data, 0));
williamr@2:   }
williamr@2: 
williamr@2:   // Linear in distance(begin(), __pos), and in distance(__x.begin(), __i).
williamr@2:   void splice(iterator __pos, _Self& __x, iterator __i) {
williamr@2:     _Sl_global_inst::__splice_after(_Sl_global_inst::__previous(&this->_M_head._M_data, __pos._M_node),
williamr@2:                          _Sl_global_inst::__previous(&__x._M_head._M_data, __i._M_node),
williamr@2:                          __i._M_node);
williamr@2:   }
williamr@2: 
williamr@2:   // Linear in distance(begin(), __pos), in distance(__x.begin(), __first),
williamr@2:   // and in distance(__first, __last).
williamr@2:   void splice(iterator __pos, _Self& __x, iterator __first, iterator __last)
williamr@2:   {
williamr@2:     if (__first != __last)
williamr@2:       _Sl_global_inst::__splice_after(_Sl_global_inst::__previous(&this->_M_head._M_data, __pos._M_node),
williamr@2:                            _Sl_global_inst::__previous(&__x._M_head._M_data, __first._M_node),
williamr@2:                            _Sl_global_inst::__previous(__first._M_node, __last._M_node));
williamr@2:   }
williamr@2: 
williamr@2: public:
williamr@2:   void reverse() { 
williamr@2:     if (this->_M_head._M_data._M_next)
williamr@2:       this->_M_head._M_data._M_next = _Sl_global_inst::__reverse(this->_M_head._M_data._M_next);
williamr@2:   }
williamr@2: 
williamr@2:   void remove(const _Tp& __val); 
williamr@2:   void unique(); 
williamr@2:   void merge(_Self& __x);
williamr@2:   void sort();     
williamr@2: 
williamr@2: #ifdef _STLP_MEMBER_TEMPLATES
williamr@2:   template <class _Predicate>
williamr@2:   void remove_if(_Predicate __pred) {
williamr@2:     _Node_base* __cur = &this->_M_head._M_data;
williamr@2:     while (__cur->_M_next) {
williamr@2:       if (__pred(((_Node*) __cur->_M_next)->_M_data))
williamr@2: 	this->_M_erase_after(__cur);
williamr@2:       else
williamr@2: 	__cur = __cur->_M_next;
williamr@2:     }
williamr@2:   }
williamr@2: 
williamr@2:   template <class _BinaryPredicate> 
williamr@2:   void unique(_BinaryPredicate __pred) {
williamr@2:     _Node* __cur = (_Node*) this->_M_head._M_data._M_next;
williamr@2:     if (__cur) {
williamr@2:       while (__cur->_M_next) {
williamr@2: 	if (__pred(((_Node*)__cur)->_M_data, 
williamr@2: 		   ((_Node*)(__cur->_M_next))->_M_data))
williamr@2: 	  this->_M_erase_after(__cur);
williamr@2: 	else
williamr@2: 	  __cur = (_Node*) __cur->_M_next;
williamr@2:       }
williamr@2:     }
williamr@2:   }
williamr@2: 
williamr@2:   template <class _StrictWeakOrdering>
williamr@2:   void merge(slist<_Tp,_Alloc>& __x,
williamr@2: 	     _StrictWeakOrdering __comp) {
williamr@2:     _Node_base* __n1 = &this->_M_head._M_data;
williamr@2:     while (__n1->_M_next && __x._M_head._M_data._M_next) {
williamr@2:       if (__comp(((_Node*) __x._M_head._M_data._M_next)->_M_data,
williamr@2: 		 ((_Node*)       __n1->_M_next)->_M_data))
williamr@2: 	_Sl_global_inst::__splice_after(__n1, &__x._M_head._M_data, __x._M_head._M_data._M_next);
williamr@2:       __n1 = __n1->_M_next;
williamr@2:     }
williamr@2:     if (__x._M_head._M_data._M_next) {
williamr@2:       __n1->_M_next = __x._M_head._M_data._M_next;
williamr@2:       __x._M_head._M_data._M_next = 0;
williamr@2:     }
williamr@2:   }
williamr@2: 
williamr@2:   template <class _StrictWeakOrdering> 
williamr@2:   void sort(_StrictWeakOrdering __comp) {
williamr@2:     if (this->_M_head._M_data._M_next && this->_M_head._M_data._M_next->_M_next) {
williamr@2:       slist __carry;
williamr@2:       slist __counter[64];
williamr@2:       int __fill = 0;
williamr@2:       while (!empty()) {
williamr@2: 	_Sl_global_inst::__splice_after(&__carry._M_head._M_data, &this->_M_head._M_data, this->_M_head._M_data._M_next);
williamr@2: 	int __i = 0;
williamr@2: 	while (__i < __fill && !__counter[__i].empty()) {
williamr@2: 	  __counter[__i].merge(__carry, __comp);
williamr@2: 	  __carry.swap(__counter[__i]);
williamr@2: 	  ++__i;
williamr@2: 	}
williamr@2: 	__carry.swap(__counter[__i]);
williamr@2: 	if (__i == __fill)
williamr@2: 	  ++__fill;
williamr@2:       }
williamr@2:       
williamr@2:       for (int __i = 1; __i < __fill; ++__i)
williamr@2: 	__counter[__i].merge(__counter[__i-1], __comp);
williamr@2:       this->swap(__counter[__fill-1]);
williamr@2:     }
williamr@2:   }
williamr@2: #endif /* _STLP_MEMBER_TEMPLATES */
williamr@2: 
williamr@2: };
williamr@2: 
williamr@2: template <class _Tp, class _Alloc>
williamr@2: inline bool  _STLP_CALL
williamr@2: operator==(const slist<_Tp,_Alloc>& _SL1, const slist<_Tp,_Alloc>& _SL2)
williamr@2: {
williamr@2:   typedef typename slist<_Tp,_Alloc>::const_iterator const_iterator;
williamr@2:   const_iterator __end1 = _SL1.end();
williamr@2:   const_iterator __end2 = _SL2.end();
williamr@2: 
williamr@2:   const_iterator __i1 = _SL1.begin();
williamr@2:   const_iterator __i2 = _SL2.begin();
williamr@2:   while (__i1 != __end1 && __i2 != __end2 && *__i1 == *__i2) {
williamr@2:     ++__i1;
williamr@2:     ++__i2;
williamr@2:    }
williamr@2:   return __i1 == __end1 && __i2 == __end2;
williamr@2: }
williamr@2: 
williamr@2: # define _STLP_EQUAL_OPERATOR_SPECIALIZED
williamr@2: # define _STLP_TEMPLATE_HEADER    template <class _Tp, class _Alloc>
williamr@2: # define _STLP_TEMPLATE_CONTAINER slist<_Tp, _Alloc>
williamr@2: # include <stl/_relops_cont.h>
williamr@2: # undef _STLP_TEMPLATE_CONTAINER
williamr@2: # undef _STLP_TEMPLATE_HEADER
williamr@2: # undef _STLP_EQUAL_OPERATOR_SPECIALIZED
williamr@2: 
williamr@2: _STLP_END_NAMESPACE
williamr@2: 
williamr@2: # if !defined (_STLP_LINK_TIME_INSTANTIATION)
williamr@2: #  include <stl/_slist.c>
williamr@2: # endif
williamr@2: 
williamr@2: #  undef  slist
williamr@2: #  define __slist__ __FULL_NAME(slist)
williamr@2: 
williamr@2: #if defined (_STLP_DEBUG) && !defined (_STLP_INTERNAL_DBG_SLIST_H)
williamr@2: # include <stl/debug/_slist.h>
williamr@2: #endif
williamr@2: 
williamr@2: _STLP_BEGIN_NAMESPACE
williamr@2: // Specialization of insert_iterator so that insertions will be constant
williamr@2: // time rather than linear time.
williamr@2: 
williamr@2: #ifdef _STLP_CLASS_PARTIAL_SPECIALIZATION
williamr@2: 
williamr@2: template <class _Tp, class _Alloc>
williamr@2: class insert_iterator<slist<_Tp, _Alloc> > {
williamr@2: protected:
williamr@2:   typedef slist<_Tp, _Alloc> _Container;
williamr@2:   _Container* container;
williamr@2:   typename _Container::iterator iter;
williamr@2: public:
williamr@2:   typedef _Container          container_type;
williamr@2:   typedef output_iterator_tag iterator_category;
williamr@2:   typedef void                value_type;
williamr@2:   typedef void                difference_type;
williamr@2:   typedef void                pointer;
williamr@2:   typedef void                reference;
williamr@2: 
williamr@2:   insert_iterator(_Container& __x, typename _Container::iterator __i) 
williamr@2:     : container(&__x) {
williamr@2:     if (__i == __x.begin())
williamr@2:       iter = __x.before_begin();
williamr@2:     else
williamr@2:       iter = __x.previous(__i);
williamr@2:   }
williamr@2: 
williamr@2:   insert_iterator<_Container>&
williamr@2:   operator=(const typename _Container::value_type& __val) { 
williamr@2:     iter = container->insert_after(iter, __val);
williamr@2:     return *this;
williamr@2:   }
williamr@2:   insert_iterator<_Container>& operator*() { return *this; }
williamr@2:   insert_iterator<_Container>& operator++() { return *this; }
williamr@2:   insert_iterator<_Container>& operator++(int) { return *this; }
williamr@2: };
williamr@2: 
williamr@2: #endif /* _STLP_CLASS_PARTIAL_SPECIALIZATION */
williamr@2: 
williamr@2: _STLP_END_NAMESPACE
williamr@2: 
williamr@2: 
williamr@2: # if defined ( _STLP_USE_WRAPPER_FOR_ALLOC_PARAM )
williamr@2: # include <stl/wrappers/_slist.h>
williamr@2: # endif
williamr@2: 
williamr@2: #endif /* _STLP_INTERNAL_SLIST_H */
williamr@2: 
williamr@2: // Local Variables:
williamr@2: // mode:C++
williamr@2: // End:
williamr@2: