_slist.c File Reference

#include <stl/_slist.h>
#include <stl/_carray.h>
#include <stl/_range_errors.h>

Include dependency graph for _slist.c:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Macros
#define	_STLP_SLIST_C

Functions
template<class _Tp , class _Alloc , class _BinaryPredicate >
_STLP_MOVE_TO_PRIV_NAMESPACE void	_Slist_unique (slist< _Tp, _Alloc > &__that, _BinaryPredicate __pred)
template<class _Tp , class _Alloc , class _StrictWeakOrdering >
void	_Slist_merge (slist< _Tp, _Alloc > &__that, slist< _Tp, _Alloc > &__x, _StrictWeakOrdering __comp)
template<class _Tp , class _Alloc , class _StrictWeakOrdering >
void	_Slist_sort (slist< _Tp, _Alloc > &__that, _StrictWeakOrdering __comp)

Macro Definition Documentation

_STLP_SLIST_C

#define _STLP_SLIST_C

Definition at line 20 of file _slist.c.

Function Documentation

_Slist_merge()

template<class _Tp , class _Alloc , class _StrictWeakOrdering >

void _Slist_merge	(	slist< _Tp, _Alloc > &	__that,
		slist< _Tp, _Alloc > &	__x,
		_StrictWeakOrdering	__comp
	)

Definition at line 148 of file _slist.c.

                                              {
  typedef _Slist_node<_Tp> _Node;
  typedef _STLP_PRIV _Slist_node_base _Node_base;
  if (__that.get_allocator() == __x.get_allocator()) {
    typename slist<_Tp, _Alloc>::iterator __ite(__that.before_begin());
    while (__ite._M_node->_M_next && !__x.empty()) {
      if (__comp(__x.front(), __STATIC_CAST(_Node*, __ite._M_node->_M_next)->_M_data)) {
        _STLP_VERBOSE_ASSERT(!__comp(__STATIC_CAST(_Node*, __ite._M_node->_M_next)->_M_data, __x.front()),
                             _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
        __that.splice_after(__ite, __x, __x.before_begin());
      }
      ++__ite;
    }
    if (!__x.empty()) {
      __that.splice_after(__ite, __x);
    }
  }
  else {
    typename slist<_Tp, _Alloc>::iterator __i1(__that.before_begin()), __i2(__x.begin());
    while (__i1._M_node->_M_next && __i2._M_node) {
      if (__comp(__STATIC_CAST(_Node*, __i1._M_node->_M_next)->_M_data, *__i2)) {
        _STLP_VERBOSE_ASSERT(!__comp(*__i2, __STATIC_CAST(_Node*, __i1._M_node->_M_next)->_M_data),
                             _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
        ++__i1;
      }
      else {
        __i1 = __that.insert_after(__i1, *(__i2++));
      }
    }
    __that.insert_after(__i1, __i2, __x.end());
    __x.clear();
  }
}

Referenced by _Slist_sort(), and slist< value_type, _All >::merge().

_Slist_sort()

template<class _Tp , class _Alloc , class _StrictWeakOrdering >

void _Slist_sort	(	slist< _Tp, _Alloc > &	__that,
		_StrictWeakOrdering	__comp
	)

Definition at line 184 of file _slist.c.

                                                                         {
  if (!__that.begin()._M_node || !__that.begin()._M_node->_M_next)
    return;

  slist<_Tp, _Alloc> __carry(__that.get_allocator());
  const int NB = 64;
  _STLP_PRIV _CArray<slist<_Tp, _Alloc>, NB> __counter(__carry);
  int __fill = 0;
  while (!__that.empty()) {
    __carry.splice_after(__carry.before_begin(), __that, __that.before_begin());
    int __i = 0;
    while (__i < __fill && !__counter[__i].empty()) {
      _STLP_PRIV _Slist_merge(__counter[__i], __carry, __comp);
      __carry.swap(__counter[__i]);
      ++__i;
    }
    __carry.swap(__counter[__i]);
    if (__i == __fill) {
      ++__fill;
      if (__fill >= NB) {
        //Looks like the slist has too many elements to be sorted with this algorithm:
        __stl_throw_overflow_error("slist::sort");
      }
    }
  }

  for (int __i = 1; __i < __fill; ++__i)
    _STLP_PRIV _Slist_merge(__counter[__i], __counter[__i - 1], __comp);
  __that.swap(__counter[__fill-1]);
}

Referenced by slist< value_type, _All >::sort().

_Slist_unique()

template<class _Tp , class _Alloc , class _BinaryPredicate >

_STLP_MOVE_TO_PRIV_NAMESPACE void _Slist_unique	(	slist< _Tp, _Alloc > &	__that,
		_BinaryPredicate	__pred
	)

Definition at line 134 of file _slist.c.

                                                                        {
  typedef _Slist_node<_Tp> _Node;
  typename slist<_Tp, _Alloc>::iterator __ite(__that.begin());
  if (__ite != __that.end()) {
    while (__ite._M_node->_M_next) {
      if (__pred(*__ite, __STATIC_CAST(_Node*, __ite._M_node->_M_next)->_M_data))
        __that.erase_after(__ite);
      else
        ++__ite;
    }
  }
}

Referenced by slist< value_type, _All >::unique().