2 #define _UNIQUE_SORT_H 1
6 template<class Container, class LessThan = std::less<typename Container::value_type>, class EqualTo = std::equal_to<typename Container::value_type>>
7 void unique_sort(Container *c, const LessThan < = LessThan(), const EqualTo &eq = EqualTo())
9 sort(c->begin(), c->end(), lt);
10 auto new_end = unique(c->begin(), c->end(), eq);
11 c->erase(new_end, c->end());
14 #endif // !defined(_UNIQUE_SORT_H)