From: Mikko Rasa Date: Sat, 10 Apr 2021 18:07:14 +0000 (+0300) Subject: Add utility functions to search and sort containers based on a member X-Git-Url: http://git.tdb.fi/?a=commitdiff_plain;h=6bb431a4fdd6b6437c25890a89627d206a9e52ac;p=libs%2Fcore.git Add utility functions to search and sort containers based on a member --- diff --git a/source/core/algorithm.h b/source/core/algorithm.h index 804db7b..b79114e 100644 --- a/source/core/algorithm.h +++ b/source/core/algorithm.h @@ -101,6 +101,76 @@ inline void stable_sort(Container &cont, Predicate pred) std::stable_sort(cont.begin(), cont.end(), pred); } +template +struct MemberMatch +{ + const T &value; + T C::*mem_ptr; + + MemberMatch(const T &v, T C::*p): value(v), mem_ptr(p) { } + + bool operator()(const C &obj) { return obj.*mem_ptr==value; } +}; + +template +inline typename Container::iterator find_member(Container &cont, const T &value, T Container::value_type::*mp) +{ + return find_if(cont, MemberMatch(value, mp)); +} + +template +inline typename Container::const_iterator find_member(const Container &cont, const T &value, T Container::value_type::*mp) +{ + return find_if(cont, MemberMatch(value, mp)); +} + +template +struct MemberCompare +{ + T C::*mem_ptr; + + MemberCompare(T C::*p): mem_ptr(p) { } + + bool operator()(const C &obj, const T &v) { return obj.*mem_ptr +inline typename Container::iterator lower_bound_member(Container &cont, const T &value, T Container::value_type::*mp) +{ + return lower_bound(cont, value, MemberCompare(mp)); +} + +template +inline typename Container::const_iterator lower_bound_member(const Container &cont, const T &value, T Container::value_type::*mp) +{ + return lower_bound(cont, value, MemberCompare(mp)); +} + +template +inline typename Container::iterator upper_bound_member(Container &cont, const T &value, T Container::value_type::*mp) +{ + return upper_bound(cont, value, MemberCompare(mp)); +} + +template +inline typename Container::const_iterator upper_bound_member(const Container &cont, const T &value, T Container::value_type::*mp) +{ + return upper_bound(cont, value, MemberCompare(mp)); +} + +template +inline void sort_member(Container &cont, T Container::value_type::*mp) +{ + sort(cont, MemberCompare(mp)); +} + +template +inline void stable_sort_member(Container &cont, T Container::value_type::*mp) +{ + stable_sort(cont, MemberCompare(mp)); +} + } // namespace Msp #endif