#ifndef SPROUT_CSTRING_STRRCHR_HPP #define SPROUT_CSTRING_STRRCHR_HPP #include #include #include #include #include #include namespace sprout { namespace detail { template inline SPROUT_CONSTEXPR ForwardIterator strrchr_impl_check(sprout::pair const& found, T const& value) { return *found.second == value ? found.second : !value ? found.first : ForwardIterator() ; } template inline SPROUT_CONSTEXPR sprout::pair strrchr_impl_1( sprout::pair const& current, T const& value, typename std::iterator_traits::difference_type n ) { typedef sprout::pair type; return !*current.first ? current : n == 1 ? *current.first == value ? type(sprout::next(current.first), current.first) : type(sprout::next(current.first), current.second) : sprout::detail::strrchr_impl_1( sprout::detail::strrchr_impl_1( current, value, n / 2 ), value, n - n / 2 ) ; } template inline SPROUT_CONSTEXPR sprout::pair strrchr_impl( sprout::pair const& current, T const& value, typename std::iterator_traits::difference_type n ) { typedef sprout::pair type; return !*current.first ? current : sprout::detail::strrchr_impl( sprout::detail::strrchr_impl_1( current, value, n ), value, n * 2 ) ; } template inline SPROUT_CONSTEXPR ForwardIterator strrchr(ForwardIterator first, T const& value) { typedef sprout::pair type; return sprout::detail::strrchr_impl_check( sprout::detail::strrchr_impl(type(first, first), value, 1), value ); } } // namespace detail // 7.21.5.5 strrchr ֐ // // recursion depth: // O(log N) // inline SPROUT_CONSTEXPR char const* strrchr(char const* s, int c) { return sprout::detail::strrchr(s, static_cast(c)); } inline SPROUT_CONSTEXPR char* strrchr(char* s, int c) { return sprout::detail::strrchr(s, static_cast(c)); } template inline SPROUT_CONSTEXPR typename std::enable_if< sprout::is_char_type::value, Elem* >::type strrchr(Elem* s, typename std::decay::type c) { return sprout::detail::strrchr(s, c); } } // namespace sprout #endif // #ifndef SPROUT_CSTRING_STRRCHR_HPP