unique() [1/2]

template<typename _Tp, typename _Alloc>

list< _Tp, _Alloc >::__remove_return_type list::unique

(

)

Remove consecutive duplicate elements.

For each consecutive set of elements with the same value, remove all but the first one. Remaining elements stay in list order. Note that this function only erases the elements, and that if the elements themselves are pointers, the pointed-to memory is not touched in any way. Managing the pointer is the user's responsibility.

Definition at line 362 of file list.tcc.

    {
      iterator __first = begin();
      iterator __last = end();
      if (__first == __last)
      return _GLIBCXX20_ONLY( 0 );
#if !_GLIBCXX_USE_CXX11_ABI
      size_type __removed __attribute__((__unused__)) = 0;
#endif
      list __to_destroy(get_allocator());
      iterator __next = __first;
      while (++__next != __last)
      {
        if (*__first == *__next)
          {
            __to_destroy.splice(__to_destroy.begin(), *this, __next);
#if !_GLIBCXX_USE_CXX11_ABI
            _GLIBCXX20_ONLY( __removed++ );
#endif
          }
        else
          __first = __next;
        __next = __first;
      }
 
#if !_GLIBCXX_USE_CXX11_ABI
      return _GLIBCXX20_ONLY( __removed );
#else
      return _GLIBCXX20_ONLY( __to_destroy.size() );
#endif
    }

References list(), _GLIBCXX20_ONLY, begin(), end(), get_allocator(), size(), and splice().

Here is the call graph for this function: