rexy712/rexylib
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Improve build times by not including functional

Browse Source
This commit is contained in:
rexy712 2022-07-15 16:37:42 -07:00
parent 1d06516181
commit 0ac55f3699
1 changed files with 8 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
include/rexy/detail/algorithm.hpp
View File

@ -22,8 +22,7 @@
#include "../utility.hpp" //swap #include "../utility.hpp" //swap
#include <type_traits> //nothrow_invocable #include <type_traits> //nothrow_invocable
#include <functional> //less, greater #include <utility> //pair, forward
#include <utility> //pair
#include <iterator> //iterator_traits #include <iterator> //iterator_traits
#include <cstddef> //size_t #include <cstddef> //size_t
@ -81,10 +80,15 @@ namespace rexy::detail{
} }
return {max_suffix, period}; return {max_suffix, period};
} }
template<class Iter> template<class Iter>
constexpr std::pair<std::size_t,size_t> critical_factorization(const Iter& nstart, const Iter& nend){ constexpr std::pair<std::size_t,size_t> critical_factorization(const Iter& nstart, const Iter& nend){
auto msuffix = max_suffix(nstart, nend - nstart, std::less{}); auto msuffix = max_suffix(nstart, nend - nstart, []<class T, class U>(T&& left, U&& right) constexpr{
auto msuffix_rev = max_suffix(nstart, nend - nstart, std::greater{}); return std::forward<T>(left) < std::forward<U>(right);
});
auto msuffix_rev = max_suffix(nstart, nend - nstart, []<class T, class U>(T&& left, U&& right) constexpr{
return std::forward<T>(left) > std::forward<U>(right);
});
if(msuffix.first < msuffix_rev.first){ if(msuffix.first < msuffix_rev.first){
return msuffix_rev; return msuffix_rev;
} }