Add move semantics to Variant

[libs/core.git] / source / core / algorithm.h

diff --git a/source/core/algorithm.h b/source/core/algorithm.h
index 804db7b9d146905ae77cef973c8feae0233511fb..43bbaeeb2c00ace3199beae6b1af8052cd0bfb51 100644 (file)
--- a/source/core/algorithm.h
+++ b/source/core/algorithm.h
@@ -2,6 +2,7 @@
 #define MSP_CORE_ALGORITHM_H_
 
 #include <algorithm>
+#include <functional>
 
 namespace Msp {
 
@@ -29,6 +30,20 @@ inline typename Container::const_iterator find_if(const Container &cont, Predica
        return std::find_if(cont.begin(), cont.end(), pred);
 }
 
+template<typename T>
+struct ValueMatch
+{
+       const T &value;
+
+       bool operator()(const T &v) { return v==value; }
+};
+
+template<typename Container, typename T>
+inline bool any_equals(Container &cont, const T &value)
+{
+       return std::any_of(cont.begin(), cont.end(), ValueMatch<T>{value});
+}
+
 template<typename Container, typename T>
 inline typename Container::iterator lower_bound(Container &cont, const T &value)
 {
@@ -101,6 +116,82 @@ inline void stable_sort(Container &cont, Predicate pred)
        std::stable_sort(cont.begin(), cont.end(), pred);
 }
 
+template<typename C, typename T>
+struct MemberMatch
+{
+       const T &value;
+       T C::*mem_ptr;
+
+       bool operator()(const C &obj) { return obj.*mem_ptr==value; }
+};
+
+template<typename Container, typename T>
+inline typename Container::iterator find_member(Container &cont, const T &value, T Container::value_type::*mp)
+{
+       return find_if(cont, MemberMatch<typename Container::value_type, T>{ value, mp });
+}
+
+template<typename Container, typename T>
+inline typename Container::const_iterator find_member(const Container &cont, const T &value, T Container::value_type::*mp)
+{
+       return find_if(cont, MemberMatch<typename Container::value_type, T>{ value, mp });
+}
+
+template<typename C, typename T, typename P=std::less<T>>
+struct MemberCompare
+{
+       T C::*mem_ptr;
+       P pred;
+
+       MemberCompare(T C::*p): mem_ptr(p) { }
+
+       bool operator()(const C &obj, const T &v) { return pred(obj.*mem_ptr, v); }
+       bool operator()(const T &v, const C &obj) { return pred(v, obj.*mem_ptr); }
+       bool operator()(const C &obj1, const C &obj2) { return pred(obj1.*mem_ptr, obj2.*mem_ptr); }
+};
+
+template<typename Container, typename T>
+inline typename Container::iterator lower_bound_member(Container &cont, const T &value, T Container::value_type::*mp)
+{
+       return lower_bound(cont, value, MemberCompare<typename Container::value_type, T>(mp));
+}
+
+template<typename Container, typename T>
+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<typename Container::value_type, T>(mp));
+}
+
+template<typename Container, typename T>
+inline typename Container::iterator upper_bound_member(Container &cont, const T &value, T Container::value_type::*mp)
+{
+       return upper_bound(cont, value, MemberCompare<typename Container::value_type, T>(mp));
+}
+
+template<typename Container, typename T>
+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<typename Container::value_type, T>(mp));
+}
+
+template<typename Container, typename T>
+inline void sort_member(Container &cont, T Container::value_type::*mp)
+{
+       sort(cont, MemberCompare<typename Container::value_type, T>(mp));
+}
+
+template<typename Container, typename T>
+inline void stable_sort_member(Container &cont, T Container::value_type::*mp)
+{
+       stable_sort(cont, MemberCompare<typename Container::value_type, T>(mp));
+}
+
+template<typename Container, typename Predicate>
+inline void transform(Container &cont, Predicate pred)
+{
+       transform(cont.begin(), cont.end(), cont.begin(), pred);
+}
+
 } // namespace Msp
 
 #endif