_list.c File Reference

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

Include dependency graph for _list.c:

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

Go to the source code of this file.

Macros
#define	_STLP_LIST_C

Functions
template<class _Tp , class _Alloc , class _Predicate >
_STLP_MOVE_TO_PRIV_NAMESPACE void	_S_remove_if (list< _Tp, _Alloc > &__that, _Predicate __pred)
template<class _Tp , class _Alloc , class _BinaryPredicate >
void	_S_unique (list< _Tp, _Alloc > &__that, _BinaryPredicate __binary_pred)
template<class _Tp , class _Alloc , class _StrictWeakOrdering >
void	_S_merge (list< _Tp, _Alloc > &__that, list< _Tp, _Alloc > &__x, _StrictWeakOrdering __comp)
template<class _Tp , class _Alloc , class _StrictWeakOrdering >
void	_S_sort (list< _Tp, _Alloc > &__that, _StrictWeakOrdering __comp)

Macro Definition Documentation

_STLP_LIST_C

#define _STLP_LIST_C

Definition at line 27 of file _list.c.

Function Documentation

_S_merge()

template<class _Tp , class _Alloc , class _StrictWeakOrdering >

void _S_merge	(	list< _Tp, _Alloc > &	__that,
		list< _Tp, _Alloc > &	__x,
		_StrictWeakOrdering	__comp
	)

Definition at line 168 of file _list.c.

                                          {
  typedef typename list<_Tp, _Alloc>::iterator _Literator;
  _Literator __first1 = __that.begin();
  _Literator __last1 = __that.end();
  _Literator __first2 = __x.begin();
  _Literator __last2 = __x.end();
  if (__that.get_allocator() == __x.get_allocator()) {
    while (__first1 != __last1 && __first2 != __last2) {
      if (__comp(*__first2, *__first1)) {
        _STLP_VERBOSE_ASSERT(!__comp(*__first1, *__first2), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
        _Literator __next = __first2;
        _List_global_inst::_Transfer(__first1._M_node, __first2._M_node, (++__next)._M_node);
        __first2 = __next;
      }
      else
        ++__first1;
    }
    if (__first2 != __last2)
      _List_global_inst::_Transfer(__last1._M_node, __first2._M_node, __last2._M_node);
  }
  else {
    while (__first1 != __last1 && __first2 != __last2) {
      if (__comp(*__first2, *__first1)) {
        _STLP_VERBOSE_ASSERT(!__comp(*__first1, *__first2), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
        __first1 = __that.insert(__first1, *__first2);
      }
      else
        ++__first1;
    }
    if (__first2 != __last2) {
      __that.insert(__first1, __first2, __last2);
    }
    __x.clear();
  }
}

Referenced by _S_sort(), and list< BookmarkNode >::merge().

_S_remove_if()

template<class _Tp , class _Alloc , class _Predicate >

_STLP_MOVE_TO_PRIV_NAMESPACE void _S_remove_if	(	list< _Tp, _Alloc > &	__that,
		_Predicate	__pred
	)

Definition at line 139 of file _list.c.

                                                                 {
  typedef typename list<_Tp, _Alloc>::iterator _Literator;
  _Literator __first = __that.begin();
  _Literator __last = __that.end();
  while (__first != __last) {
    _Literator __next = __first;
    ++__next;
    if (__pred(*__first)) __that.erase(__first);
    __first = __next;
  }
}

_S_sort()

template<class _Tp , class _Alloc , class _StrictWeakOrdering >

void _S_sort	(	list< _Tp, _Alloc > &	__that,
		_StrictWeakOrdering	__comp
	)

Definition at line 206 of file _list.c.

                                                                    {
  // Do nothing if the list has length 0 or 1.
  if (__that._M_node._M_data._M_next == &__that._M_node._M_data ||
      __that._M_node._M_data._M_next->_M_next == &__that._M_node._M_data)
    return;

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

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

Referenced by list< BookmarkNode >::sort().

_S_unique()

template<class _Tp , class _Alloc , class _BinaryPredicate >

void _S_unique	(	list< _Tp, _Alloc > &	__that,
		_BinaryPredicate	__binary_pred
	)

Definition at line 152 of file _list.c.

                                                                          {
  typedef typename list<_Tp, _Alloc>::iterator _Literator;
  _Literator __first = __that.begin();
  _Literator __last = __that.end();
  if (__first == __last) return;
  _Literator __next = __first;
  while (++__next != __last) {
    if (__binary_pred(*__first, *__next))
      __that.erase(__next);
    else
      __first = __next;
    __next = __first;
  }
}

Referenced by list< BookmarkNode >::unique().