bslstp_slist.h

Go to the documentation of this file.

/// @file bslstp_slist.h
///
/// The content of this file has been pre-processed for Doxygen.
///
 
 
// bslstp_slist.h                                                     -*-C++-*-
#ifndef INCLUDED_BSLSTP_SLIST
#define INCLUDED_BSLSTP_SLIST
 
/// @defgroup bslstp_slist bslstp_slist
/// @brief  Provide a singly linked list container.
/// @addtogroup bsl
/// @{
/// @addtogroup bslstp
/// @{
/// @addtogroup bslstp_slist
/// @{
///
/// <h1> Outline </h1>
/// * <a href="#bslstp_slist-purpose"> Purpose</a>
/// * <a href="#bslstp_slist-classes"> Classes </a>
/// * <a href="#bslstp_slist-description"> Description </a>
///   * <a href="#bslstp_slist-usage"> Usage </a>
///
/// # Purpose {#bslstp_slist-purpose}
/// Provide a singly linked list container.
///
/// @deprecated  Do not use directly.
///
/// # Classes {#bslstp_slist-classes}
///
/// -  slist: singly linked list
///
/// @see  bsl_slist
///
/// # Description {#bslstp_slist-description}
/// This component is for internal use only.
///
/// Note that the functions in this component are based on STLPort's
/// implementation, with copyright notice as follows:
/// @code
/// /*
///  * Copyright (c) 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.
///  *
///  */
///
/// // Contents originally from stl/_slist.h
///
/// /*
///  *
///  * 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.
///  *
///  */
/// @endcode
///
/// ## Usage {#bslstp_slist-usage}
///
///
/// This component is for internal use only.
/// @}
/** @} */
/** @} */
 
/** @addtogroup bsl
 * @{
 */
/** @addtogroup bslstp
 * @{
 */
/** @addtogroup bslstp_slist
 * @{
 */
 
#ifdef BDE_OPENSOURCE_PUBLICATION // STP
#error "bslstp_slist is not for publication"
#endif
#include <bslscm_version.h>
 
#include <bslstp_alloc.h>
#include <bslstp_iterator.h>
#include <bslstp_slistbase.h>
#include <bslstp_util.h>
 
#include <bslalg_arrayprimitives.h>
#include <bslalg_scalarprimitives.h>
 
#include <bslma_autodestructor.h>
#include <bslma_constructionutil.h>
#include <bslma_destructionutil.h>
#include <bslma_bslallocator.h>
 
#include <bslmf_isfundamental.h>
#include <bslmf_integralconstant.h>
 
#include <bsls_exceptionutil.h>
#include <bsls_objectbuffer.h>
 
 
#include <bsls_util.h>
 
#include <algorithm>
 
#include <iterator>
 
#include <cstddef>
 
//# undef slist
//# define  slist  __WORKAROUND_DBG_RENAME(slist)
 
//_STLP_BEGIN_NAMESPACE
namespace bsl {
 
template <class _Tp>
struct _Slist_node : public _Slist_node_base
{
  _Tp _M_data;
};
 
struct _Slist_iterator_base {
 
  typedef std::size_t               size_type;
  typedef std::ptrdiff_t            difference_type;
  typedef std::forward_iterator_tag iterator_category;
 
  _Slist_node_base* _M_node;
 
  _Slist_iterator_base(_Slist_node_base* __x) : _M_node(__x) {}
 
  void _M_incr() {
//    _STLP_VERBOSE_ASSERT(_M_node != 0, _StlMsg_INVALID_ADVANCE)
    _M_node = _M_node->_M_next;
  }
  bool operator==(const _Slist_iterator_base& __y ) const {
    return _M_node == __y._M_node;
  }
  bool operator!=(const _Slist_iterator_base& __y ) const {
    return _M_node != __y._M_node;
  }
};
 
 
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 std::forward_iterator_tag    iterator_category;
  typedef std::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 _Slist_iterator<_Tp, _Traits>                       _Self;
 
  typedef _Slist_node<value_type> _Node;
 
  _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) {}
 
  reference operator*() const { return ((_Node*) _M_node)->_M_data; }
 
  pointer operator -> ( ) const { return & ( operator * ( ) ) ; }
 
  _Self& operator++()
  {
    _M_incr();
    return *this;
  }
  _Self operator++(int)
  {
    _Self __tmp = *this;
    _M_incr();
    return __tmp;
  }
};
 
// 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(__a, _Slist_node_base() ) {
    _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;
    BloombergLP::bslma::DestructionUtil::destroy(
                                         BSLS_UTIL_ADDRESSOF(__next->_M_data));
    _M_head.allocatorRef().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 _STLP_CONVERT_ALLOCATOR((const _M_node_allocator_type&)_M_head, _Tp);
    return _M_head.get_allocator();
  }
  _STLP_alloc_proxy<_Slist_node_base, _Node, _M_node_allocator_type> _M_head;
};
 
template <class _Tp, class _Alloc = bsl::allocator<_Tp> >
class slist : protected _Slist_base<_Tp,_Alloc>
{
private:
  typedef _Slist_base<_Tp,_Alloc> _Base;
  typedef slist<_Tp,_Alloc> _Self;
 
  struct QuickSwap;
  friend struct QuickSwap;
 
  /// Function object to quickly swap two slists with identical
  /// allocators and allocation modes.
  struct QuickSwap {
 
      /// Swap contents of `v1` and `v2`.  Undefined unless
      /// `v1.get_allocator()  == v2.get_allocator()`.
      void operator()(_Self& v1, _Self& v2) const
      {
          // MODIFIED BY ARTHUR
          //_STLP_STD::swap(v1._M_head._M_data, v2._M_head._M_data);
          typedef BloombergLP::bslalg::ScalarPrimitives primitive;
          primitive::swap(v1._M_head._M_data, v2._M_head._M_data);
      }
  };
 
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 std::size_t               size_type;
  typedef std::ptrdiff_t            difference_type;
  typedef std::forward_iterator_tag _Iterator_category;
 
  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 = _Tp()) {
    _Node* __node = this->_M_head.allocatorRef().allocate(1);
    BSLS_TRY {
      typedef BloombergLP::bslma::ConstructionUtil Util;
      Util::construct(BSLS_UTIL_ADDRESSOF(__node->_M_data),
                      this->get_allocator(),
                      __x);
      __node->_M_next = 0;
    }
    BSLS_CATCH(...) {
        this->_M_head.allocatorRef().deallocate(__node, 1);
        BSLS_RETHROW;
    }
    return __node;
  }
 
public:
  allocator_type get_allocator() const { return _Base::get_allocator(); }
 
  explicit slist(const allocator_type& __a = allocator_type()) : _Slist_base<_Tp,_Alloc>(__a) {}
 
  explicit slist(size_type __n, const value_type& __x = _Tp(),
                 const allocator_type& __a =  allocator_type())
      : _Slist_base<_Tp,_Alloc>(__a)
    { _M_insert_after_fill(&this->_M_head._M_data, __n, __x); }
 
 
  // 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 = allocator_type()) :
    _Slist_base<_Tp,_Alloc>(__a)
  { _M_insert_after_range(&this->_M_head._M_data, __first, __last); }
 
  slist(const _Self& __x)
  : _Slist_base<_Tp, _Alloc>(BloombergLP::bslstp::Util::copyContainerAllocator(__x.get_allocator()))
    { insert(begin(), __x.begin(), __x.end()); }
 
  // Copy-construct with alternative allocator.
  slist(const _Self& __x, const allocator_type& __a)
  : _Slist_base<_Tp, _Alloc>(__a)
    { insert(begin(), __x.begin(), __x.end()); }
 
  /*explicit slist(__full_move_source<_Self> src)
          : _Slist_base<_Tp, _Alloc>(_FullMoveSource<_Slist_base<_Tp, _Alloc> >(src.get())) {
  }*/
 
//  explicit slist(__partial_move_source<_Self> src)
//          : _Slist_base<_Tp, _Alloc>(src.get()) {
//          src.get()._M_head._M_data._M_next = 0;
//  }
 
  _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);
 
  template <class _InputIterator>
  void assign(_InputIterator __first, _InputIterator __last) {
 
    // SIMPLIFIED BY ALISDAIR
    _M_assign_dispatch(__first, __last, (bsl::is_fundamental<_InputIterator> *)0);
  }
 
  template <class _Integer>
  void _M_assign_dispatch(_Integer __n, _Integer __val, bsl::true_type *)
    { _M_fill_assign((size_type) __n, (_Tp) __val); }
 
  template <class _InputIter>
  void
  _M_assign_dispatch(_InputIter __first, _InputIter __last, bsl::false_type *) {
    _Node_base* __prev = &this->_M_head._M_data;
    _Node* __node = (_Node*) this->_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
      this->_M_erase_after(__prev, 0);
  }
 
public:
 
  // 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 iterator((_Node*) &this->_M_head._M_data); }
  const_iterator before_begin() const
    { return const_iterator((_Node*) &this->_M_head._M_data); }
 
  iterator begin() { return iterator((_Node*)this->_M_head._M_data._M_next); }
  const_iterator begin() const
    { return const_iterator((_Node*)this->_M_head._M_data._M_next);}
 
  iterator end() { return iterator(0); }
  const_iterator end() const { return const_iterator(0); }
 
  size_type size() const { return _Sl_global_inst::size(this->_M_head._M_data._M_next); }
 
  size_type max_size() const { return size_type(-1); }
 
  bool empty() const { return this->_M_head._M_data._M_next == 0; }
 
  void swap(_Self& __x) {
    BloombergLP::bslstp::Util::swapContainers(*this, __x, QuickSwap());
  }
 
public:
  reference front() { return ((_Node*) this->_M_head._M_data._M_next)->_M_data; }
  const_reference front() const
    { return ((_Node*) this->_M_head._M_data._M_next)->_M_data; }
  void push_front(const value_type& __x = _Tp())   {
    __slist_make_link(&this->_M_head._M_data, _M_create_node(__x));
  }
 
  void pop_front() {
    _Node* __node = (_Node*) this->_M_head._M_data._M_next;
    this->_M_head._M_data._M_next = __node->_M_next;
    BloombergLP::bslma::DestructionUtil::destroy(
                                         BSLS_UTIL_ADDRESSOF(__node->_M_data));
    this->_M_head.allocatorRef().deallocate(__node, 1);
  }
 
  iterator previous(const_iterator __pos) {
    return iterator((_Node*) _Sl_global_inst::__previous(&this->_M_head._M_data, __pos._M_node));
  }
  const_iterator previous(const_iterator __pos) const {
    return const_iterator((_Node*) _Sl_global_inst::__previous(&this->_M_head._M_data, __pos._M_node));
  }
 
private:
  _Node* _M_insert_after(_Node_base* __pos, const value_type& __x = _Tp()) {
    return (_Node*) (__slist_make_link(__pos, _M_create_node(__x)));
  }
 
 
  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));
  }
 
  // 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) {
    // SIMPLIFIED BY ALISDAIR
    _M_insert_after_range(__pos, __first, __last, (bsl::is_fundamental<_InIter> *) 0);
  }
 
  template <class _Integer>
  void _M_insert_after_range(_Node_base* __pos, _Integer __n, _Integer __x,
                             bsl::true_type *) {
    _M_insert_after_fill(__pos, __n, __x);
  }
 
  template <class _InIter>
  void _M_insert_after_range(_Node_base *__pos,
                             _InIter __first, _InIter __last,
                             bsl::false_type *) {
    while (__first != __last) {
      __pos = __slist_make_link(__pos, _M_create_node(*__first));
      ++__first;
    }
  }
 
 
public:
 
  iterator insert_after(iterator __pos, const value_type& __x = _Tp()) {
    return iterator(_M_insert_after(__pos._M_node, __x));
  }
 
 
  void insert_after(iterator __pos, size_type __n, const value_type& __x) {
    _M_insert_after_fill(__pos._M_node, __n, __x);
  }
 
  // We don't need any dispatching tricks here, because _M_insert_after_range
  // already does them.
  template <class _InIter>
  void insert_after(iterator __pos, _InIter __first, _InIter __last) {
    _M_insert_after_range(__pos._M_node, __first, __last);
  }
 
 
  iterator insert(iterator __pos, const value_type& __x = _Tp()) {
    return iterator(_M_insert_after(
            _Sl_global_inst::__previous(&this->_M_head._M_data, __pos._M_node),
            __x));
  }
 
 
  void insert(iterator __pos, size_type __n, const value_type& __x) {
    _M_insert_after_fill(_Sl_global_inst::__previous(&this->_M_head._M_data, __pos._M_node), __n, __x);
  }
 
  // We don't need any dispatching tricks here, because _M_insert_after_range
  // already does them.
  template <class _InIter>
  void insert(iterator __pos, _InIter __first, _InIter __last) {
    _M_insert_after_range(
            _Sl_global_inst::__previous(&this->_M_head._M_data, __pos._M_node),
            __first, __last);
  }
 
 
 
public:
  iterator erase_after(iterator __pos) {
    return iterator((_Node*) this->_M_erase_after(__pos._M_node));
  }
  iterator erase_after(iterator __before_first, iterator __last) {
    return iterator((_Node*) this->_M_erase_after(__before_first._M_node,
                                                  __last._M_node));
  }
 
  iterator erase(iterator __pos) {
    return iterator((_Node*) this->_M_erase_after(_Sl_global_inst::__previous(
                                                        &this->_M_head._M_data,
                                                        __pos._M_node)));
  }
  iterator erase(iterator __first, iterator __last) {
    return iterator((_Node*) this->_M_erase_after(
      _Sl_global_inst::__previous(&this->_M_head._M_data, __first._M_node), __last._M_node));
  }
 
  void resize(size_type new_size, const value_type& __x = _Tp());
 
  void clear() {
    this->_M_erase_after(&this->_M_head._M_data, 0);
  }
 
public:
  // Moves the range [__before_first + 1, __before_last + 1) to *this,
  //  inserting it immediately after __pos.  This is constant time.
  void splice_after(iterator __pos,
                    iterator __before_first, iterator __before_last)
  {
    if (__before_first != __before_last) {
      _Sl_global_inst::__splice_after(__pos._M_node, __before_first._M_node,
                                      __before_last._M_node);
    }
  }
 
  // Moves the element that follows __prev to *this, inserting it immediately
  //  after __pos.  This is constant time.
  void splice_after(iterator __pos, iterator __prev)
  {
    _Sl_global_inst::__splice_after(__pos._M_node,
                                    __prev._M_node, __prev._M_node->_M_next);
  }
 
  // Removes all of the elements from the list __x to *this, inserting
  // them immediately after __pos.  __x must not be *this.  Complexity:
  // linear in __x.size().
  void splice_after(iterator __pos, _Self& __x)
  {
    _Sl_global_inst::__splice_after(__pos._M_node, &__x._M_head._M_data);
  }
 
  // Linear in distance(begin(), __pos), and linear in __x.size().
  void splice(iterator __pos, _Self& __x) {
    if (__x._M_head._M_data._M_next)
      _Sl_global_inst::__splice_after(_Sl_global_inst::__previous(&this->_M_head._M_data, __pos._M_node),
                           &__x._M_head._M_data, _Sl_global_inst::__previous(&__x._M_head._M_data, 0));
  }
 
  // Linear in distance(begin(), __pos), and in distance(__x.begin(), __i).
  void splice(iterator __pos, _Self& __x, iterator __i) {
    _Sl_global_inst::__splice_after(
            _Sl_global_inst::__previous(&this->_M_head._M_data, __pos._M_node),
            _Sl_global_inst::__previous(&__x._M_head._M_data, __i._M_node),
            __i._M_node);
  }
 
  // Linear in distance(begin(), __pos), in distance(__x.begin(), __first),
  // and in distance(__first, __last).
  void splice(iterator __pos, _Self& __x, iterator __first, iterator __last)
  {
    if (__first != __last)
      _Sl_global_inst::__splice_after(_Sl_global_inst::__previous(&this->_M_head._M_data, __pos._M_node),
            _Sl_global_inst::__previous(&__x._M_head._M_data, __first._M_node),
                 _Sl_global_inst::__previous(__first._M_node, __last._M_node));
  }
 
public:
  void reverse() {
    if (this->_M_head._M_data._M_next)
      this->_M_head._M_data._M_next = _Sl_global_inst::__reverse(this->_M_head._M_data._M_next);
  }
 
  void remove(const _Tp& __val);
  void unique();
  void merge(_Self& __x);
  void sort();
 
  template <class _Predicate>
  void remove_if(_Predicate __pred) {
    _Node_base* __cur = &this->_M_head._M_data;
    while (__cur->_M_next) {
      if (__pred(((_Node*) __cur->_M_next)->_M_data))
        this->_M_erase_after(__cur);
      else
        __cur = __cur->_M_next;
    }
  }
 
  template <class _BinaryPredicate>
  void unique(_BinaryPredicate __pred) {
    _Node* __cur = (_Node*) this->_M_head._M_data._M_next;
    if (__cur) {
      while (__cur->_M_next) {
        if (__pred(((_Node*)__cur)->_M_data,
                   ((_Node*)(__cur->_M_next))->_M_data))
          this->_M_erase_after(__cur);
        else
          __cur = (_Node*) __cur->_M_next;
      }
    }
  }
 
  template <class _StrictWeakOrdering>
  void merge(slist<_Tp,_Alloc>& __x,
             _StrictWeakOrdering __comp) {
    _Node_base* __n1 = &this->_M_head._M_data;
    while (__n1->_M_next && __x._M_head._M_data._M_next) {
      if (__comp(((_Node*) __x._M_head._M_data._M_next)->_M_data,
                 ((_Node*)       __n1->_M_next)->_M_data))
        _Sl_global_inst::__splice_after(__n1, &__x._M_head._M_data, __x._M_head._M_data._M_next);
      __n1 = __n1->_M_next;
    }
    if (__x._M_head._M_data._M_next) {
      __n1->_M_next = __x._M_head._M_data._M_next;
      __x._M_head._M_data._M_next = 0;
    }
  }
 
  template <class _StrictWeakOrdering>
  void sort(_StrictWeakOrdering __comp) {
    if (this->_M_head._M_data._M_next && this->_M_head._M_data._M_next->_M_next) {
      _Self __carry(this->get_allocator());
 
      // Create an array of 64 '_Self' objects.  Since we cannot pass
      // constructor arguments to array element constructors, we instead use
      // an array of raw memory objects ('bsls::ObjectBuffer') and initialize
      // them with the desired allocator as a separate step.  After
      // initialization, we ensure that destructors are called by creating an
      // auto-destructor object.
      BloombergLP::bsls::ObjectBuffer<_Self> __counterBuffers[64];
      _Self* __counter = &__counterBuffers[0].object();
      BloombergLP::bslalg::ArrayPrimitives::uninitializedFillN(
                                               __counter, 64, __carry,
                                               this->_M_head.get_allocator());
      BloombergLP::bslma::AutoDestructor<_Self> __counterGuard(__counter, 64);
 
      int __fill = 0;
      while (!empty()) {
        _Sl_global_inst::__splice_after(&__carry._M_head._M_data, &this->_M_head._M_data, this->_M_head._M_data._M_next);
        int __i = 0;
        while (__i < __fill && !__counter[__i].empty()) {
          __counter[__i].merge(__carry, __comp);
          __carry.swap(__counter[__i]);
          ++__i;
        }
        __carry.swap(__counter[__i]);
        if (__i == __fill)
          ++__fill;
      }
 
      for (int __i = 1; __i < __fill; ++__i)
        __counter[__i].merge(__counter[__i-1], __comp);
      this->swap(__counter[__fill-1]);
    }
  }
 
};
 
template <class _Tp, class _Alloc>
inline
bool operator==(const slist<_Tp,_Alloc>& _SL1, const slist<_Tp,_Alloc>& _SL2)
{
  typedef typename slist<_Tp,_Alloc>::const_iterator const_iterator;
  const_iterator __end1 = _SL1.end();
  const_iterator __end2 = _SL2.end();
 
  const_iterator __i1 = _SL1.begin();
  const_iterator __i2 = _SL2.begin();
  while (__i1 != __end1 && __i2 != __end2 && *__i1 == *__i2) {
    ++__i1;
    ++__i2;
   }
  return __i1 == __end1 && __i2 == __end2;
}
 
template <class _Tp, class _Alloc>
inline
bool  operator<(const slist<_Tp, _Alloc>& __x,
                const slist<_Tp, _Alloc>& __y) {
  return std::lexicographical_compare(__x.begin(), __x.end(),
                                      __y.begin(), __y.end());
}
 
template <class _Tp, class _Alloc>
inline
bool operator!=(const slist<_Tp, _Alloc>& __x,
                const slist<_Tp, _Alloc>& __y) {return !(__x == __y);}
 
template <class _Tp, class _Alloc>
inline
bool operator>(const slist<_Tp, _Alloc>& __x,
               const slist<_Tp, _Alloc>& __y)  {return __y < __x;}
 
template <class _Tp, class _Alloc>
inline
bool operator<=(const slist<_Tp, _Alloc>& __x,
                const slist<_Tp, _Alloc>& __y) { return !(__y < __x);}
 
template <class _Tp, class _Alloc>
inline
bool operator>=(const slist<_Tp, _Alloc>& __x,
                const slist<_Tp, _Alloc>& __y) { return !(__x < __y);}
 
//template <class _Tp, class _Alloc>
//struct __partial_move_traits<slist<_Tp, _Alloc> > {
//  typedef __true_type supported;
//};
//
//template <class _Tp, class _Alloc>
//struct __action_on_move<slist<_Tp, _Alloc> > {
//  typedef __true_type swap;
//};
 
//# define _STLP_EQUAL_OPERATOR_SPECIALIZED
//# define _STLP_TEMPLATE_HEADER    template <class _Tp, class _Alloc>
//# define _STLP_TEMPLATE_CONTAINER slist<_Tp, _Alloc>
//# include <bslstp_stl_relops_cont.h>
//# undef _STLP_TEMPLATE_CONTAINER
//# undef _STLP_TEMPLATE_HEADER
//# undef _STLP_EQUAL_OPERATOR_SPECIALIZED
 
}  // close namespace bsl
 
// BEGIN FORMER CONTENTS OF bslstp_stl_slist.c
/*
 *
 * Copyright (c) 1996,1997
 * Silicon Graphics Computer Systems, Inc.
 *
 * 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.
 *
 */
 
// #ifndef INCLUDED_BSLSTP_STL_SLIST
// # include <bslstp_stl_slist.h>
// #endif
 
namespace bsl {
 
template <class _Tp, class _Alloc>
_Slist_node_base*
_Slist_base<_Tp,_Alloc>::_M_erase_after(_Slist_node_base* __before_first,
                                        _Slist_node_base* __last_node) {
  _Slist_node<_Tp>* __cur = (_Slist_node<_Tp>*) (__before_first->_M_next);
  while (__cur != __last_node) {
    _Slist_node<_Tp>* __tmp = __cur;
    __cur = (_Slist_node<_Tp>*) __cur->_M_next;
    BloombergLP::bslma::DestructionUtil::destroy(
                                          BSLS_UTIL_ADDRESSOF(__tmp->_M_data));
    _M_head.allocatorRef().deallocate(__tmp,1);
  }
  __before_first->_M_next = __last_node;
  return __last_node;
}
 
template <class _Tp, class _Alloc>
slist<_Tp,_Alloc>& slist<_Tp,_Alloc>::operator=(const slist<_Tp,_Alloc>& __x)
{
  if (&__x != this) {
    _Node_base* __p1 = &this->_M_head._M_data;
    _Node* __n1 = (_Node*) this->_M_head._M_data._M_next;
    const _Node* __n2 = (const _Node*) __x._M_head._M_data._M_next;
    while (__n1 && __n2) {
      __n1->_M_data = __n2->_M_data;
      __p1 = __n1;
      __n1 = (_Node*) __n1->_M_next;
      __n2 = (const _Node*) __n2->_M_next;
    }
    if (__n2 == 0)
      this->_M_erase_after(__p1, 0);
    else
      _M_insert_after_range(__p1, const_iterator(const_cast<_Node*>(__n2)),
                            const_iterator(0));
  }
  return *this;
}
 
template <class _Tp, class _Alloc>
void slist<_Tp, _Alloc>::_M_fill_assign(size_type __n, const _Tp& __val) {
  _Node_base* __prev = &this->_M_head._M_data;
  _Node* __node = (_Node*) this->_M_head._M_data._M_next;
  for ( ; __node != 0 && __n > 0 ; --__n) {
    __node->_M_data = __val;
    __prev = __node;
    __node = (_Node*) __node->_M_next;
  }
  if (__n > 0)
    _M_insert_after_fill(__prev, __n, __val);
  else
    this->_M_erase_after(__prev, 0);
}
 
 
template <class _Tp, class _Alloc>
void slist<_Tp,_Alloc>::resize(size_type __len, const _Tp& __x)
{
  _Node_base* __cur = &this->_M_head._M_data;
  while (__cur->_M_next != 0 && __len > 0) {
    --__len;
    __cur = __cur->_M_next;
  }
  if (__cur->_M_next)
    this->_M_erase_after(__cur, 0);
  else
    _M_insert_after_fill(__cur, __len, __x);
}
 
template <class _Tp, class _Alloc>
void slist<_Tp,_Alloc>::remove(const _Tp& __val)
{
  _Node_base* __cur = &this->_M_head._M_data;
  while (__cur && __cur->_M_next) {
    if (((_Node*) __cur->_M_next)->_M_data == __val)
      this->_M_erase_after(__cur);
    else
      __cur = __cur->_M_next;
  }
}
 
template <class _Tp, class _Alloc>
void slist<_Tp,_Alloc>::unique()
{
  _Node_base* __cur = this->_M_head._M_data._M_next;
  if (__cur) {
    while (__cur->_M_next) {
      if (((_Node*)__cur)->_M_data ==
          ((_Node*)(__cur->_M_next))->_M_data)
        this->_M_erase_after(__cur);
      else
        __cur = __cur->_M_next;
    }
  }
}
 
template <class _Tp, class _Alloc>
void slist<_Tp,_Alloc>::merge(slist<_Tp,_Alloc>& __x)
{
  _Node_base* __n1 = &this->_M_head._M_data;
  while (__n1->_M_next && __x._M_head._M_data._M_next) {
    if (((_Node*) __x._M_head._M_data._M_next)->_M_data <
        ((_Node*)       __n1->_M_next)->_M_data)
      _Sl_global_inst::__splice_after(__n1, &__x._M_head._M_data, __x._M_head._M_data._M_next);
    __n1 = __n1->_M_next;
  }
  if (__x._M_head._M_data._M_next) {
    __n1->_M_next = __x._M_head._M_data._M_next;
    __x._M_head._M_data._M_next = 0;
  }
}
 
template <class _Tp, class _Alloc>
void slist<_Tp,_Alloc>::sort()
{
  if (this->_M_head._M_data._M_next && this->_M_head._M_data._M_next->_M_next) {
    _Self __carry(this->get_allocator());
 
    // Create an array of 64 '_Self' objects.  Since we cannot pass
    // constructor arguments to array element constructors, we instead use
    // an array of raw memory objects ('bsls::ObjectBuffer') and initialize
    // them with the desired allocator as a separate step.  After
    // initialization, we ensure that destructors are called by creating an
    // auto-destructor object.
    BloombergLP::bsls::ObjectBuffer<_Self> __counterBuffers[64];
    _Self* __counter = &__counterBuffers[0].object();
    typename _Alloc_traits<_Self, _Alloc>::allocator_type __alloc(
                                                        this->get_allocator());
    BloombergLP::bslalg::ArrayPrimitives::uninitializedFillN(
                                               __counter, 64, __carry,
                                               __alloc);
    BloombergLP::bslma::AutoDestructor<_Self> __counterGuard(__counter, 64);
 
    int __fill = 0;
    while (!empty()) {
      _Sl_global_inst::__splice_after(&__carry._M_head._M_data, &this->_M_head._M_data, this->_M_head._M_data._M_next);
      int __i = 0;
      while (__i < __fill && !__counter[__i].empty()) {
        __counter[__i].merge(__carry);
        __carry.swap(__counter[__i]);
        ++__i;
      }
      __carry.swap(__counter[__i]);
      if (__i == __fill)
        ++__fill;
    }
 
    for (int __i = 1; __i < __fill; ++__i)
      __counter[__i].merge(__counter[__i-1]);
    this->swap(__counter[__fill-1]);
  }
}
 
//# undef slist
//# undef size_type
 
}  // close namespace bsl
 
// Local Variables:
// mode:C++
// End:
// END FORMER CONTENTS OF bslstp_stl_slist.c
 
//#  undef  slist
//#  define __slist__ __FULL_NAME(slist)
//
//#if defined (_STLP_DEBUG)
//# include <stl/debug/bslstp_stl_slist.h>
//#endif
 
namespace std {
 
// Specialization of insert_iterator so that insertions will be constant
// time rather than linear time.
 
 
template <class _Tp, class _Alloc>
class insert_iterator<bsl::slist<_Tp, _Alloc> > {
protected:
  typedef bsl::slist<_Tp, _Alloc> _Container;
  _Container* container;
  typename _Container::iterator iter;
public:
  typedef _Container          container_type;
  typedef output_iterator_tag iterator_category;
  typedef void                value_type;
  typedef void                difference_type;
  typedef void                pointer;
  typedef void                reference;
 
  insert_iterator(_Container& __x, typename _Container::iterator __i)
    : container(&__x) {
    if (__i == __x.begin())
      iter = __x.before_begin();
    else
      iter = __x.previous(__i);
  }
 
  insert_iterator<_Container>&
  operator=(const typename _Container::value_type& __val) {
    iter = container->insert_after(iter, __val);
    return *this;
  }
  insert_iterator<_Container>& operator*() { return *this; }
  insert_iterator<_Container>& operator++() { return *this; }
  insert_iterator<_Container>& operator++(int) { return *this; }
};
 
 
}  // close namespace std
 
//# if defined ( _STLP_USE_WRAPPER_FOR_ALLOC_PARAM )
//# include <stl/wrappers/bslstp_stl_slist.h>
//# endif
 
//# if (_STLP_OUTERMOST_HEADER_ID == 0x58)
//#  include <bslstp_stl_epilog.h>
//#  undef _STLP_OUTERMOST_HEADER_ID
//# endif
 
#endif /* INCLUDED_BSLSTP_SLIST */
 
// Local Variables:
// mode:C++
// End:
 
/** @} */
/** @} */
/** @} */