diff options
author | Vladimir Byko-Ianko <v.bykoianko@corp.mail.ru> | 2016-05-26 15:45:08 +0300 |
---|---|---|
committer | Vladimir Byko-Ianko <v.bykoianko@corp.mail.ru> | 2016-05-27 14:22:59 +0300 |
commit | de449b38b67dddd6308c6b1875e6818e08851b1a (patch) | |
tree | caa1f6554530a9c1a1d7193ce44970326d790df0 /base/stl_helpers.hpp | |
parent | 4591c38bfb2b976b6df6dfa284e68377b225e53f (diff) |
Review fixes.
Diffstat (limited to 'base/stl_helpers.hpp')
-rw-r--r-- | base/stl_helpers.hpp | 10 |
1 files changed, 6 insertions, 4 deletions
diff --git a/base/stl_helpers.hpp b/base/stl_helpers.hpp index b11f95eec7..0121e12613 100644 --- a/base/stl_helpers.hpp +++ b/base/stl_helpers.hpp @@ -2,8 +2,10 @@ #include "std/algorithm.hpp" #include "std/functional.hpp" +#include "std/utility.hpp" #include "std/vector.hpp" + namespace my { namespace impl @@ -89,11 +91,11 @@ void SortUnique(vector<T> & v) // Sorts according to |comp| and removes duplicate entries according to |pred| from |v|. // Note. If several entries are equal according to |pred| an arbitrary entry of them // is left in |v| after a call of this function. -template <typename T, typename TComp, typename TPred> -void SortUnique(vector<T> & v, TComp && comp, TPred && pred) +template <typename T, typename TLess, typename TEquals> +void SortUnique(vector<T> & v, TLess && less, TEquals && equals) { - sort(v.begin(), v.end(), comp); - v.erase(unique(v.begin(), v.end(), pred), v.end()); + sort(v.begin(), v.end(), forward<TLess>(less)); + v.erase(unique(v.begin(), v.end(), forward<TEquals>(equals)), v.end()); } template <typename T, class TFn> |