std::unique is an STL algorithm to remove duplicates in a sorted container. std::unique does not resize the container.


#include <algorithm>

#include <cassert>

#include <vector>



int main()

{

  //Create a std::vector

  std::vector<int> v;

  v.push_back(1);

  v.push_back(2);

  v.push_back(2);

  v.push_back(3);

  v.push_back(3);

  v.push_back(3);



  assert(v.size() == 6);



  //Unique does not resize the std::vector

  std::vector<int>::iterator new_end

    = std::unique(v.begin(),v.end());



  assert(v.size() == 6);

  assert(v[0] == 1);

  assert(v[1] == 2);

  assert(v[2] == 3);



  //Resize the std::vector

  v.erase(new_end,v.end());



  assert(v.size() == 3);

  assert(v[0] == 1);

  assert(v[1] == 2);

  assert(v[2] == 3);

}

External links

cplusplus.com page about std::unique

Go back to Richel Bilderbeek's C++ page.

Go back to Richel Bilderbeek's homepage.

(C++) std::unique

External links