/* * * Copyright (c) 1994 * Hewlett-Packard Company * * Permission to use, copy, modify, distribute and sell this software * and its documentation for any purpose is hereby granted without fee, * provided that the above copyright notice appear in all copies and * that both that copyright notice and this permission notice appear * in supporting documentation.  Hewlett-Packard Company makes no * representations about the suitability of this software for any * purpose.  It is provided "as is" without express or implied warranty. * * * Copyright (c) 1996,1997 * Silicon Graphics Computer Systems, Inc. * * Permission to use, copy, modify, distribute and sell this software * and its documentation for any purpose is hereby granted without fee, * provided that the above copyright notice appear in all copies and * that both that copyright notice and this permission notice appear * in supporting documentation.  Silicon Graphics makes no * representations about the suitability of this software for any * purpose.  It is provided "as is" without express or implied warranty. *//* NOTE: This is an internal header file, included by other STL headers. *   You should not attempt to use it directly. */#ifndef __SGI_STL_INTERNAL_LIST_H#define __SGI_STL_INTERNAL_LIST_H__STL_BEGIN_NAMESPACE#if defined(__sgi) && !defined(__GNUC__) && (_MIPS_SIM != _MIPS_SIM_ABI32)#pragma set woff 1174#pragma set woff 1375#endiftemplate <class _Tp>struct _List_node {  typedef void* _Void_pointer;  _Void_pointer _M_next;  _Void_pointer _M_prev;  _Tp _M_data;};template<class _Tp, class _Ref, class _Ptr>struct _List_iterator {  typedef _List_iterator<_Tp,_Tp&,_Tp*>             iterator;  typedef _List_iterator<_Tp,const _Tp&,const _Tp*> const_iterator;  typedef _List_iterator<_Tp,_Ref,_Ptr>             _Self;  typedef bidirectional_iterator_tag iterator_category;  typedef _Tp value_type;  typedef _Ptr pointer;  typedef _Ref reference;  typedef _List_node<_Tp> _Node;  typedef size_t size_type;  typedef ptrdiff_t difference_type;  _Node* _M_node;  _List_iterator(_Node* __x) : _M_node(__x) {}  _List_iterator() {}  _List_iterator(const iterator& __x) : _M_node(__x._M_node) {}  bool operator==(const _Self& __x) const { return _M_node == __x._M_node; }  bool operator!=(const _Self& __x) const { return _M_node != __x._M_node; }  reference operator*() const { return (*_M_node)._M_data; }#ifndef __SGI_STL_NO_ARROW_OPERATOR  pointer operator->() const { return &(operator*()); }#endif /* __SGI_STL_NO_ARROW_OPERATOR */  _Self& operator++() {     _M_node = (_Node*)(_M_node->_M_next);    return *this;  }  _Self operator++(int) {     _Self __tmp = *this;    ++*this;    return __tmp;  }  _Self& operator--() {     _M_node = (_Node*)(_M_node->_M_prev);    return *this;  }  _Self operator--(int) {     _Self __tmp = *this;    --*this;    return __tmp;  }};#ifndef __STL_CLASS_PARTIAL_SPECIALIZATIONtemplate <class _Tp, class _Ref, class _Ptr>inline bidirectional_iterator_tagiterator_category(const _List_iterator<_Tp, _Ref, _Ptr>&){  return bidirectional_iterator_tag();}template <class _Tp, class _Ref, class _Ptr>inline _Tp*value_type(const _List_iterator<_Tp, _Ref, _Ptr>&){  return 0;}template <class _Tp, class _Ref, class _Ptr>inline ptrdiff_t*distance_type(const _List_iterator<_Tp, _Ref, _Ptr>&){  return 0;}#endif /* __STL_CLASS_PARTIAL_SPECIALIZATION */// Base class that encapsulates details of allocators.  Three cases:// an ordinary standard-conforming allocator, a standard-conforming// allocator with no non-static data, and an SGI-style allocator.// This complexity is necessary only because we're worrying about backward// compatibility and because we want to avoid wasting storage on an // allocator instance if it isn't necessary.#ifdef __STL_USE_STD_ALLOCATORS// Base for general standard-conforming allocators.template <class _Tp, class _Allocator, bool _IsStatic>class _List_alloc_base {public:  typedef typename _Alloc_traits<_Tp, _Allocator>::allocator_type          allocator_type;  allocator_type get_allocator() const { return _Node_allocator; }  _List_alloc_base(const allocator_type& __a) : _Node_allocator(__a) {}protected:  _List_node<_Tp>* _M_get_node()   { return _Node_allocator.allocate(1); }  void _M_put_node(_List_node<_Tp>* __p)    { _Node_allocator.deallocate(__p, 1); }protected:  typename _Alloc_traits<_List_node<_Tp>, _Allocator>::allocator_type           _Node_allocator;  _List_node<_Tp>* _M_node;};// Specialization for instanceless allocators.template <class _Tp, class _Allocator>class _List_alloc_base<_Tp, _Allocator, true> {public:  typedef typename _Alloc_traits<_Tp, _Allocator>::allocator_type          allocator_type;  allocator_type get_allocator() const { return allocator_type(); }  _List_alloc_base(const allocator_type&) {}protected:  typedef typename _Alloc_traits<_List_node<_Tp>, _Allocator>::_Alloc_type          _Alloc_type;  _List_node<_Tp>* _M_get_node() { return _Alloc_type::allocate(1); }  void _M_put_node(_List_node<_Tp>* __p) { _Alloc_type::deallocate(__p, 1); }protected:  _List_node<_Tp>* _M_node;};template <class _Tp, class _Alloc>class _List_base   : public _List_alloc_base<_Tp, _Alloc,                            _Alloc_traits<_Tp, _Alloc>::_S_instanceless>{public:  typedef _List_alloc_base<_Tp, _Alloc,                           _Alloc_traits<_Tp, _Alloc>::_S_instanceless>          _Base;   typedef typename _Base::allocator_type allocator_type;  _List_base(const allocator_type& __a) : _Base(__a) {    _M_node = _M_get_node();    _M_node->_M_next = _M_node;    _M_node->_M_prev = _M_node;  }  ~_List_base() {    clear();    _M_put_node(_M_node);  }  void clear();};#else /* __STL_USE_STD_ALLOCATORS */template <class _Tp, class _Alloc>class _List_base {public:  typedef _Alloc allocator_type;  allocator_type get_allocator() const { return allocator_type(); }  _List_base(const allocator_type&) {    _M_node = _M_get_node();    _M_node->_M_next = _M_node;    _M_node->_M_prev = _M_node;  }  ~_List_base() {    clear();    _M_put_node(_M_node);  }  void clear();protected:  typedef simple_alloc<_List_node<_Tp>, _Alloc> _Alloc_type;  _List_node<_Tp>* _M_get_node() { return _Alloc_type::allocate(1); }  void _M_put_node(_List_node<_Tp>* __p) { _Alloc_type::deallocate(__p, 1); } protected:  _List_node<_Tp>* _M_node;};#endif /* __STL_USE_STD_ALLOCATORS */template <class _Tp, class _Alloc>void _List_base<_Tp,_Alloc>::clear() {  _List_node<_Tp>* __cur = (_List_node<_Tp>*) _M_node->_M_next;  while (__cur != _M_node) {    _List_node<_Tp>* __tmp = __cur;    __cur = (_List_node<_Tp>*) __cur->_M_next;    destroy(&__tmp->_M_data);    _M_put_node(__tmp);  }  _M_node->_M_next = _M_node;  _M_node->_M_prev = _M_node;}template <class _Tp, class _Alloc = __STL_DEFAULT_ALLOCATOR(_Tp) >class list : protected _List_base<_Tp, _Alloc> {  typedef _List_base<_Tp, _Alloc> _Base;protected:  typedef void* _Void_pointer;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 _List_node<_Tp> _Node;  typedef size_t size_type;  typedef ptrdiff_t difference_type;  typedef typename _Base::allocator_type allocator_type;  allocator_type get_allocator() const { return _Base::get_allocator(); }public:  typedef _List_iterator<_Tp,_Tp&,_Tp*>             iterator;  typedef _List_iterator<_Tp,const _Tp&,const _Tp*> const_iterator;#ifdef __STL_CLASS_PARTIAL_SPECIALIZATION  typedef reverse_iterator<const_iterator> const_reverse_iterator;  typedef reverse_iterator<iterator>       reverse_iterator;#else /* __STL_CLASS_PARTIAL_SPECIALIZATION */  typedef reverse_bidirectional_iterator<const_iterator,value_type,                                         const_reference,difference_type>          const_reverse_iterator;  typedef reverse_bidirectional_iterator<iterator,value_type,reference,                                         difference_type>          reverse_iterator; #endif /* __STL_CLASS_PARTIAL_SPECIALIZATION */protected:#ifdef __STL_HAS_NAMESPACES  using _Base::_M_node;  using _Base::_M_put_node;  using _Base::_M_get_node;#endif /* __STL_HAS_NAMESPACES */protected:  _Node* _M_create_node(const _Tp& __x)  {    _Node* __p = _M_get_node();    __STL_TRY {      construct(&__p->_M_data, __x);    }    __STL_UNWIND(_M_put_node(__p));    return __p;  }  _Node* _M_create_node()  {    _Node* __p = _M_get_node();    __STL_TRY {      construct(&__p->_M_data);    }    __STL_UNWIND(_M_put_node(__p));    return __p;  }public:  explicit list(const allocator_type& __a = allocator_type()) : _Base(__a) {}  iterator begin()             { return (_Node*)(_M_node->_M_next); }  const_iterator begin() const { return (_Node*)(_M_node->_M_next); }  iterator end()             { return _M_node; }  const_iterator end() const { return _M_node; }  reverse_iterator rbegin()     { return reverse_iterator(end()); }  const_reverse_iterator rbegin() const     { return const_reverse_iterator(end()); }  reverse_iterator rend()    { return reverse_iterator(begin()); }  const_reverse_iterator rend() const    { return const_reverse_iterator(begin()); }  bool empty() const { return _M_node->_M_next == _M_node; }  size_type size() const {    size_type __result = 0;    distance(begin(), end(), __result);    return __result;  }  size_type max_size() const { return size_type(-1); }  reference front() { return *begin(); }  const_reference front() const { return *begin(); }  reference back() { return *(--end()); }  const_reference back() const { return *(--end()); }  void swap(list<_Tp, _Alloc>& __x) { __STD::swap(_M_node, __x._M_node); }  iterator insert(iterator __position, const _Tp& __x) {    _Node* __tmp = _M_create_node(__x);    __tmp->_M_next = __position._M_node;    __tmp->_M_prev = __position._M_node->_M_prev;    ((_Node*) (__position._M_node->_M_prev))->_M_next = __tmp;    __position._M_node->_M_prev = __tmp;    return __tmp;  }  iterator insert(iterator __position) { return insert(__position, _Tp()); }#ifdef __STL_MEMBER_TEMPLATES  // Check whether it's an integral type.  If so, it's not an iterator.  template<class _Integer>  void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x,                          __true_type) {    _M_fill_insert(__pos, (size_type) __n, (_Tp) __x);  }  template <class _InputIterator>  void _M_insert_dispatch(iterator __pos,                          _InputIterator __first, _InputIterator __last,                          __false_type);  template <class _InputIterator>  void insert(iterator __pos, _InputIterator __first, _InputIterator __last) {    typedef typename _Is_integer<_InputIterator>::_Integral _Integral;    _M_insert_dispatch(__pos, __first, __last, _Integral());  }#else /* __STL_MEMBER_TEMPLATES */  void insert(iterator __position, const _Tp* __first, const _Tp* __last);  void insert(iterator __position,              const_iterator __first, const_iterator __last);#endif /* __STL_MEMBER_TEMPLATES */  void insert(iterator __pos, size_type __n, const _Tp& __x)    { _M_fill_insert(__pos, __n, __x); }  void _M_fill_insert(iterator __pos, size_type __n, const _Tp& __x);   void push_front(const _Tp& __x) { insert(begin(), __x); }  void push_front() {insert(begin());}  void push_back(const _Tp& __x) { insert(end(), __x); }  void push_back() {insert(end());}  iterator erase(iterator __position) {    _Node* __next_node = (_Node*) (__position._M_node->_M_next);    _Node* __prev_node = (_Node*) (__position._M_node->_M_prev);    __prev_node->_M_next = __next_node;    __next_node->_M_prev = __prev_node;    destroy(&__position._M_node->_M_data);    _M_put_node(__position._M_node);    return iterator(__next_node);  }  iterator erase(iterator __first, iterator __last);  void clear() { _Base::clear(); }  void resize(size_type __new_size, const _Tp& __x);  void resize(size_type __new_size) { resize(__new_size, _Tp()); }  void pop_front() { erase(begin()); }  void pop_back() {     iterator __tmp = end();    erase(--__tmp);  }  list(size_type __n, const _Tp& __value,       const allocator_type& __a = allocator_type())    : _Base(__a)    { insert(begin(), __n, __value); }  explicit list(size_type __n)    : _Base(allocator_type())    { insert(begin(), __n, _Tp()); }#ifdef __STL_MEMBER_TEMPLATES  // We don't need any dispatching tricks here, because insert does all of  // that anyway.    template <class _InputIterator>  list(_InputIterator __first, _InputIterator __last,       const allocator_type& __a = allocator_type())    : _Base(__a)    { insert(begin(), __first, __last); }#else /* __STL_MEMBER_TEMPLATES */  list(const _Tp* __first, const _Tp* __last,       const allocator_type& __a = allocator_type())    : _Base(__a)    { insert(begin(), __first, __last); }  list(const_iterator __first, const_iterator __last,       const allocator_type& __a = allocator_type())    : _Base(__a)    { insert(begin(), __first, __last); }