/*
 *
 * Copyright (c) 1996,1997
 * Silicon Graphics Computer Systems, Inc.
 *
 * Copyright (c) 1997
 * Moscow Center for SPARC Technology
 *
 * Copyright (c) 1999 
 * Boris Fomitchev
 *
 * This material is provided "as is", with absolutely no warranty expressed
 * or implied. Any use is at your own risk.
 *
 * Permission to use or copy this software for any purpose is hereby granted 
 * without fee, provided the above notices are retained on all copies.
 * Permission to modify the code and to distribute modified code is granted,
 * provided the above notices are retained, and a notice that the code was
 * modified is included with the above copyright notice.
 *
 */

/* NOTE: This is an internal header file, included by other STL headers.
 *   You should not attempt to use it directly.
 */

#ifndef __SGI_STL_INTERNAL_SLIST_H
#define __SGI_STL_INTERNAL_SLIST_H


# ifndef __SGI_STL_INTERNAL_ALGOBASE_H
#  include <stl_algobase.h>
# endif

# ifndef __SGI_STL_INTERNAL_ALLOC_H
#  include <stl_alloc.h>
# endif

# ifndef __SGI_STL_INTERNAL_ITERATOR_H
#  include <stl_iterator.h>
# endif

# ifndef __SGI_STL_INTERNAL_CONSTRUCT_H
#  include <stl_construct.h>
# endif

# ifndef __SGI_STL_INTERNAL_SLIST_BASE_H
#  include <stl_slist_base.h>
# endif

# if defined ( __STL_USE_ABBREVS )
#  define __slist_iterator         _L__It
# endif

#  define  slist  __WORKAROUND_RENAME(slist)

__STL_BEGIN_NAMESPACE 

#if defined(__sgi) && !defined(__GNUC__) && (_MIPS_SIM != _MIPS_SIM_ABI32)
#pragma set woff 1174
#pragma set woff 1375
#endif

template <class _Tp>
struct _Slist_node : public _Slist_node_base
{
  _Tp _M_data;
  __TRIVIAL_STUFF(_Slist_node)
};

struct _Slist_iterator_base
# if defined ( __STL_DEBUG )
 : public __owned_link 
# endif
{
  typedef size_t               size_type;
  typedef ptrdiff_t            difference_type;
  typedef forward_iterator_tag iterator_category;

  _Slist_node_base* _M_node;

# if defined ( __STL_DEBUG )
  _Slist_iterator_base(const __owned_list* root, _Slist_node_base* __x) : 
     __owned_link(root), _M_node(__x) {}
  _Slist_iterator_base() : __owned_link(0) {}
# else
  _Slist_iterator_base(_Slist_node_base* __x) : _M_node(__x) {}
# endif
  void _M_incr() { 
    __stl_verbose_assert(_M_node != 0, _StlMsg_INVALID_ADVANCE); 
    _M_node = _M_node->_M_next; 
  }
};

inline  bool operator==(const _Slist_iterator_base& __x,
			const _Slist_iterator_base& __y ) { 
  __stl_debug_check(__check_same_owner_or_null(__x, __y));                         
  return __x._M_node == __y._M_node; 
}

inline  bool operator!=(const _Slist_iterator_base& __x,
			const _Slist_iterator_base& __y ) { 
  __stl_debug_check(__check_same_owner_or_null(__x, __y));                         
  return __x._M_node != __y._M_node; 
}

#ifndef __STL_CLASS_PARTIAL_SPECIALIZATION

inline ptrdiff_t* distance_type(const _Slist_iterator_base&) { return 0; }

inline forward_iterator_tag iterator_category(const _Slist_iterator_base&) {
  return forward_iterator_tag();
}

#endif /* __STL_CLASS_PARTIAL_SPECIALIZATION */

template <class _Tp, class _Traits>
struct _Slist_iterator : public _Slist_iterator_base
{
  typedef _Tp value_type;
  typedef typename _Traits::pointer    pointer;
  typedef typename _Traits::reference  reference;
  
  typedef _Slist_iterator<_Tp, _Nonconst_traits<_Tp> > iterator;
  typedef _Slist_iterator<_Tp, _Const_traits<_Tp> >    const_iterator;
  typedef _Slist_iterator<_Tp, _Traits>                       _Self;

  typedef _Slist_node<value_type> _Node;

  //  operator const const_iterator& () const { return *(const const_iterator*)this; } 

# if defined ( __STL_DEBUG )
  _Slist_iterator(const __owned_list* __root, _Node* __x) :
    _Slist_iterator_base(__root, __x) {}
  _Slist_iterator() : _Slist_iterator_base(0,0) {}
  _Slist_iterator(const iterator& __x) : _Slist_iterator_base(__x._Owner(), __x._M_node) {}
# else
  _Slist_iterator(_Node* __x) : _Slist_iterator_base(__x) {}
  _Slist_iterator() : _Slist_iterator_base(0) {}
  _Slist_iterator(const iterator& __x) : _Slist_iterator_base(__x._M_node) {}
# endif

  reference operator*() const { return ((_Node*) _M_node)->_M_data; }

  __STL_DEFINE_ARROW_OPERATOR

  _Self& operator++()
  {
    _M_incr();
    return *this;
  }
  _Self operator++(int)
  {
    _Self __tmp = *this;
    _M_incr();
    return __tmp;
  }
};

#ifndef __STL_CLASS_PARTIAL_SPECIALIZATION

template <class _Tp, class _Traits>
inline _Tp*
value_type(const _Slist_iterator<_Tp, _Traits>&) { return (_Tp*)0; }


#endif /* __STL_CLASS_PARTIAL_SPECIALIZATION */

// Base class that encapsulates details of allocators and simplifies EH

template <class _Tp, class _Alloc> 
struct _Slist_base {
  typedef typename _Alloc_traits<_Tp,_Alloc>::allocator_type allocator_type;
  typedef _Slist_node<_Tp> _Node;

  _Slist_base(const allocator_type& __a) : 
    _M_head(__STL_CONVERT_ALLOCATOR(__a, _Node), _Slist_node_base() ) { 
    __stl_debug_do(_M_iter_list._Safe_init(&_M_head._M_data));
    _M_head._M_data._M_next = 0; 
  }
  ~_Slist_base() { _M_erase_after(&_M_head._M_data, 0); }

protected:
  typedef typename _Alloc_traits<_Node,_Alloc>::allocator_type _M_node_allocator_type;

  _Slist_node_base* _M_erase_after(_Slist_node_base* __pos)
  {
    _Node* __next = (_Node*) (__pos->_M_next);
    _Slist_node_base* __next_next = __next->_M_next;
    __pos->_M_next = __next_next;
    destroy(&__next->_M_data);
    _M_head.deallocate(__next,1);
    return __next_next;
  }
  _Slist_node_base* _M_erase_after(_Slist_node_base*, _Slist_node_base*);

public:
  allocator_type get_allocator() const { 
    return __STL_CONVERT_ALLOCATOR((const _M_node_allocator_type&)_M_head, _Tp); 
  }
  _STL_alloc_proxy<_Slist_node_base, _Node, _M_node_allocator_type> _M_head;
# if defined (__STL_DEBUG)
protected:
    friend class __owned_link;
    mutable __owned_list _M_iter_list;
    void _Invalidate_all() { _M_iter_list._Invalidate_all();}
# endif

};  

template <class _Tp, __STL_DEFAULT_ALLOCATOR_SELECT(_Tp) >
class slist : protected _Slist_base<_Tp,_Alloc>
{
private:
  typedef _Slist_base<_Tp,_Alloc> _Base;
  typedef slist<_Tp,_Alloc> _Self;
public:
  typedef _Tp                value_type;
  typedef value_type*       pointer;
  typedef const value_type* const_pointer;
  typedef value_type&       reference;
  typedef const value_type& const_reference;
  typedef size_t            size_type;
  typedef ptrdiff_t         difference_type;

  typedef _Slist_iterator<_Tp, _Nonconst_traits<_Tp> >  iterator;
  typedef _Slist_iterator<_Tp, _Const_traits<_Tp> >     const_iterator;

  typedef typename _Base::allocator_type allocator_type;


private:
  typedef _Slist_node<_Tp>      _Node;
  typedef _Slist_node_base      _Node_base;
  typedef _Slist_iterator_base  _Iterator_base;

  _Node* _M_create_node(const value_type& __x) {
    _Node* __node = _M_head.allocate(1);
    __STL_TRY {
      construct(&__node->_M_data, __x);
      __node->_M_next = 0;
    }
    __STL_UNWIND(_M_head.deallocate(__node, 1));
    return __node;
  }
  
  _Node* _M_create_node() {
    _Node* __node = _M_head.allocate(1);
    __STL_TRY {
      construct(&__node->_M_data);
      __node->_M_next = 0;
    }
    __STL_UNWIND(_M_head.deallocate(__node, 1));
    return __node;
  }

protected:
#if defined( __STL_HAS_NAMESPACES )
  __STL_USING_BASE_MEMBER _Slist_base<_Tp,_Alloc>::_M_erase_after;
#endif /* __STL_USE_NAMESPACES */

public:
#if defined( __STL_HAS_NAMESPACES )
  __STL_USING_BASE_MEMBER _Slist_base<_Tp,_Alloc>::get_allocator;
  __STL_USING_BASE_MEMBER _Slist_base<_Tp,_Alloc>::_M_head;
#endif
  explicit slist(const allocator_type& __a = __STL_ALLOC_INSTANCE(allocator_type)) : _Slist_base<_Tp,_Alloc>(__a) {}

  slist(size_type __n, const value_type& __x,
        const allocator_type& __a =  __STL_ALLOC_INSTANCE(allocator_type)) : _Slist_base<_Tp,_Alloc>(__a)
    { _M_insert_after_fill(&_M_head._M_data, __n, __x); }

  explicit slist(size_type __n) : _Slist_base<_Tp,_Alloc>(allocator_type())
    { _M_insert_after_fill(&_M_head._M_data, __n, value_type()); }

#ifdef __STL_MEMBER_TEMPLATES
  // We don't need any dispatching tricks here, because _M_insert_after_range
  // already does them.
  template <class _InputIterator>
  slist(_InputIterator __first, _InputIterator __last,
        const allocator_type& __a =  __STL_ALLOC_INSTANCE(allocator_type)) : 
    _Slist_base<_Tp,_Alloc>(__a)
    { _M_insert_after_range(&_M_head._M_data, __first, __last); }

#else /* __STL_MEMBER_TEMPLATES */
  slist(const_iterator __first, const_iterator __last):
    _Slist_base<_Tp,_Alloc>(allocator_type())
    { _M_insert_after_range(&_M_head._M_data, __first, __last); }
  slist(const_iterator __first, const_iterator __last,
        const allocator_type& __a ) :
    _Slist_base<_Tp,_Alloc>(__a)
    { _M_insert_after_range(&_M_head._M_data, __first, __last); }
  slist(const value_type* __first, const value_type* __last,
        const allocator_type& __a =  __STL_ALLOC_INSTANCE(allocator_type)) : 
    _Slist_base<_Tp,_Alloc>(__a)
    { _M_insert_after_range(&_M_head._M_data, __first, __last); }
#endif /* __STL_MEMBER_TEMPLATES */

  slist(const _Self& __x) : _Slist_base<_Tp,_Alloc>(__x.get_allocator())
    { _M_insert_after_range(&_M_head._M_data, __x.begin(), __x.end()); }

  _Self& operator= (const _Self& __x);

  ~slist() {}

public:
  // assign(), a generalized assignment member function.  Two
  // versions: one that takes a count, and one that takes a range.
  // The range version is a member template, so we dispatch on whether
  // or not the type is an integer.

  void assign(size_type __n, const _Tp& __val)
    { _M_fill_assign(__n, __val); }

  void _M_fill_assign(size_type __n, const _Tp& __val);

#ifdef __STL_MEMBER_TEMPLATES

  template <class _InputIterator>
  void assign(_InputIterator __first, _InputIterator __last) {
    typedef typename _Is_integer<_InputIterator>::_Integral _Integral;
    _M_assign_dispatch(__first, __last, _Integral());
  }

  template <class _Integer>
  void _M_assign_dispatch(_Integer __n, _Integer __val, __true_type)
    { _M_fill_assign((size_type) __n, (_Tp) __val); }

  template <class _InputIter>
  void
  _M_assign_dispatch(_InputIter __first, _InputIter __last,
		     __false_type)
# ifndef __STL_INLINE_MEMBER_TEMPLATES
;
# else
 {
    _Node_base* __prev = &_M_head._M_data;
    _Node* __node = (_Node*) _M_head._M_data._M_next;
    while (__node != 0 && __first != __last) {
      __node->_M_data = *__first;
      __prev = __node;
      __node = (_Node*) __node->_M_next;
      ++__first;
    }
    if (__first != __last)
      _M_insert_after_range(__prev, __first, __last);
    else
      _M_erase_after(__prev, 0);
  }
# endif /* __STL_INLINE_MEMBER_TEMPLATES */
#endif /* __STL_MEMBER_TEMPLATES */

public:

# if defined (__STL_DEBUG)
#  define _Make_iterator(__l) iterator(&_M_iter_list, (__l))
#  define _Make_const_iterator(__l) const_iterator(&_M_iter_list, (__l))
  void _Invalidate_iterator(const iterator& __it) {__invalidate_iterator(&_M_iter_list, __it); }
# else
#  define _Make_iterator(__l) iterator((__l))
#  define _Make_const_iterator(__l) const_iterator((__l))
# endif

  // Experimental new feature: before_begin() returns a
  // non-dereferenceable iterator that, when incremented, yields
  // begin().  This iterator may be used as the argument to
  // insert_after, erase_after, etc.  Note that even for an empty 
  // slist, before_begin() is not the same iterator as end().  It 
  // is always necessary to increment before_begin() at least once to
  // obtain end().
  iterator before_begin() { return _Make_iterator((_Node*) &_M_head._M_data); }
  const_iterator before_begin() const
    { return _Make_const_iterator((_Node*) &_M_head._M_data); }

  iterator begin() { return _Make_iterator((_Node*)_M_head._M_data._M_next); }
  const_iterator begin() const 
    { return _Make_const_iterator((_Node*)_M_head._M_data._M_next);}

  iterator end() { return _Make_iterator(0); }
  const_iterator end() const { return _Make_const_iterator(0); }

  size_type size() const { return _Sl_global_inst::size(_M_head._M_data._M_next); }
  
  size_type max_size() const { return size_type(-1); }

  bool empty() const { return _M_head._M_data._M_next == 0; }

  void swap(_Self& __x) { 
    __stl_debug_do(_M_iter_list._Swap_owners(__x._M_iter_list));
    __STLPORT_STD::swap(_M_head._M_data._M_next, __x._M_head._M_data._M_next); 
  }

public:
  reference front() { return ((_Node*) _M_head._M_data._M_next)->_M_data; }
  const_reference front() const 
    { return ((_Node*) _M_head._M_data._M_next)->_M_data; }
  void push_front(const value_type& __x)   {
    __slist_make_link(&_M_head._M_data, _M_create_node(__x));
  }
  void push_front() { __slist_make_link(&_M_head._M_data, _M_create_node());}
  void pop_front() {
    _Node* __node = (_Node*) _M_head._M_data._M_next;
    _M_head._M_data._M_next = __node->_M_next;
    destroy(&__node->_M_data);
    _M_head.deallocate(__node, 1);
  }

  iterator previous(const_iterator __pos) {
    return _Make_iterator((_Node*) _Sl_global_inst::__previous(&_M_head._M_data, __pos._M_node));
  }
  const_iterator previous(const_iterator __pos) const {
    return _Make_const_iterator((_Node*) _Sl_global_inst::__previous(&_M_head._M_data, __pos._M_node));
  }

private:
  _Node* _M_insert_after(_Node_base* __pos, const value_type& __x) {
    return (_Node*) (__slist_make_link(__pos, _M_create_node(__x)));
  }

  _Node* _M_insert_after(_Node_base* __pos) {
    return (_Node*) (__slist_make_link(__pos, _M_create_node()));
  }

  void _M_insert_after_fill(_Node_base* __pos,
                            size_type __n, const value_type& __x) {
    for (size_type __i = 0; __i < __n; ++__i)
      __pos = __slist_make_link(__pos, _M_create_node(__x));
  }

#ifdef __STL_MEMBER_TEMPLATES

  // Check whether it's an integral type.  If so, it's not an iterator.
  template <class _InIter>
  void _M_insert_after_range(_Node_base* __pos, 
                             _InIter __first, _InIter __last) {
    typedef typename _Is_integer<_InIter>::_Integral _Integral;
    _M_insert_after_range(__pos, __first, __last, _Integral());
  }

  template <class _Integer>
  void _M_insert_after_range(_Node_base* __pos, _Integer __n, _Integer __x,
                             __true_type) {
    _M_insert_after_fill(__pos, __n, __x);
  }

  template <class _InIter>
  void _M_insert_after_range(_Node_base* __pos,
                             _InIter __first, _InIter __last,
                             __false_type) {
    while (__first != __last) {
      __pos = __slist_make_link(__pos, _M_create_node(*__first));
      ++__first;
    }
  }