2012-04-01 13:15:09 +00:00
|
|
|
|
#ifndef SPROUT_CSTRING_STRNCMP_HPP
|
|
|
|
|
#define SPROUT_CSTRING_STRNCMP_HPP
|
|
|
|
|
|
|
|
|
|
#include <cstddef>
|
2013-01-12 16:16:48 +00:00
|
|
|
|
#include <type_traits>
|
2012-04-01 13:15:09 +00:00
|
|
|
|
#include <sprout/config.hpp>
|
2012-12-21 16:02:49 +00:00
|
|
|
|
#include <sprout/iterator/ptr_index_iterator.hpp>
|
2013-01-12 16:16:48 +00:00
|
|
|
|
#include <sprout/type_traits/is_char_type.hpp>
|
2012-12-21 16:02:49 +00:00
|
|
|
|
#include <sprout/algorithm/tristate_lexicographical_compare.hpp>
|
2012-04-01 13:15:09 +00:00
|
|
|
|
|
|
|
|
|
namespace sprout {
|
|
|
|
|
// 7.21.4.4 strncmp <20><EFBFBD>
|
2013-01-12 16:16:48 +00:00
|
|
|
|
//
|
|
|
|
|
// recursion depth:
|
|
|
|
|
// O(log(N1+N2))
|
|
|
|
|
//
|
2012-10-05 15:58:56 +00:00
|
|
|
|
inline SPROUT_CONSTEXPR int
|
|
|
|
|
strncmp(char const* s1, char const* s2, std::size_t n) {
|
2012-12-21 16:02:49 +00:00
|
|
|
|
return sprout::tristate_lexicographical_compare(
|
2013-02-26 08:03:30 +00:00
|
|
|
|
sprout::ptr_index(s1), sprout::ptr_index(s1, n), '\0',
|
|
|
|
|
sprout::ptr_index(s2), sprout::ptr_index(s2, n), '\0'
|
2012-12-21 16:02:49 +00:00
|
|
|
|
);
|
2012-04-01 13:15:09 +00:00
|
|
|
|
}
|
2013-01-12 16:16:48 +00:00
|
|
|
|
|
|
|
|
|
template<typename Elem>
|
|
|
|
|
inline SPROUT_CONSTEXPR typename std::enable_if<
|
|
|
|
|
sprout::is_char_type<Elem>::value,
|
|
|
|
|
int
|
|
|
|
|
>::type
|
|
|
|
|
strncmp(Elem* s1, Elem* s2, std::size_t n) {
|
|
|
|
|
typedef typename std::decay<Elem>::type type;
|
|
|
|
|
return sprout::tristate_lexicographical_compare(
|
2013-02-26 08:03:30 +00:00
|
|
|
|
sprout::ptr_index(s1), sprout::ptr_index(s1, n), type(),
|
|
|
|
|
sprout::ptr_index(s2), sprout::ptr_index(s2, n), type()
|
2013-01-12 16:16:48 +00:00
|
|
|
|
);
|
|
|
|
|
}
|
2012-04-01 13:15:09 +00:00
|
|
|
|
} // namespace sprout
|
|
|
|
|
|
|
|
|
|
#endif // #ifndef SPROUT_CSTRING_STRNCMP_HPP
|