forked from boostorg/static_string
178 lines
4.0 KiB
C++
178 lines
4.0 KiB
C++
//
|
|
// Copyright (c) 2016-2019 Vinnie Falco (vinnie dot falco at gmail dot com)
|
|
//
|
|
// Distributed under the Boost Software License, Version 1.0. (See accompanying
|
|
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
|
//
|
|
// Official repository: https://github.com/boostorg/fixed_string
|
|
//
|
|
|
|
#ifndef BOOST_FIXED_STRING_DETAIL_FIXED_STRING_HPP
|
|
#define BOOST_FIXED_STRING_DETAIL_FIXED_STRING_HPP
|
|
|
|
#include <boost/fixed_string/config.hpp>
|
|
#include <iterator>
|
|
#include <type_traits>
|
|
|
|
namespace boost {
|
|
namespace fixed_string {
|
|
namespace detail {
|
|
|
|
template<std::size_t, typename, typename>
|
|
class fixed_string;
|
|
|
|
// Because k-ballo said so
|
|
template<class T>
|
|
using is_input_iterator =
|
|
std::integral_constant<bool,
|
|
! std::is_integral<T>::value>;
|
|
|
|
template<typename CharT, typename Traits>
|
|
inline
|
|
int
|
|
lexicographical_compare(
|
|
CharT const* s1, std::size_t n1,
|
|
CharT const* s2, std::size_t n2)
|
|
{
|
|
if(n1 < n2)
|
|
return Traits::compare(
|
|
s1, s2, n1) <= 0 ? -1 : 1;
|
|
if(n1 > n2)
|
|
return Traits::compare(
|
|
s1, s2, n2) >= 0 ? 1 : -1;
|
|
return Traits::compare(s1, s2, n1);
|
|
}
|
|
|
|
template<typename CharT, typename Traits>
|
|
inline
|
|
int
|
|
lexicographical_compare(
|
|
basic_string_view<CharT, Traits> s1,
|
|
CharT const* s2, std::size_t n2)
|
|
{
|
|
return detail::lexicographical_compare<
|
|
CharT, Traits>(s1.data(), s1.size(), s2, n2);
|
|
}
|
|
|
|
template<std::size_t N, typename CharT, typename Traits >
|
|
inline
|
|
int
|
|
lexicographical_compare(
|
|
const fixed_string<N, CharT, Traits>& s1,
|
|
CharT const* s2, std::size_t n2)
|
|
{
|
|
return detail::lexicographical_compare<
|
|
CharT, Traits>(s1.data(), s1.size(), s2, n2);
|
|
}
|
|
|
|
template<typename CharT, typename Traits>
|
|
inline
|
|
int
|
|
lexicographical_compare(
|
|
basic_string_view<CharT, Traits> s1,
|
|
basic_string_view<CharT, Traits> s2)
|
|
{
|
|
return detail::lexicographical_compare<CharT, Traits>(
|
|
s1.data(), s1.size(), s2.data(), s2.size());
|
|
}
|
|
|
|
template<std::size_t N, std::size_t M, typename CharT, typename Traits>
|
|
inline
|
|
int
|
|
lexicographical_compare(
|
|
const fixed_string<N, CharT, Traits>& s1,
|
|
const fixed_string<M, CharT, Traits>& s2)
|
|
{
|
|
return detail::lexicographical_compare<CharT, Traits>(
|
|
s1.data(), s1.size(), s2.data(), s2.size());
|
|
}
|
|
|
|
// Maximum number of characters in the decimal
|
|
// representation of a binary number. This includes
|
|
// the potential minus sign.
|
|
//
|
|
inline
|
|
std::size_t constexpr
|
|
max_digits(std::size_t bytes)
|
|
{
|
|
return static_cast<std::size_t>(
|
|
bytes * 2.41) + 1 + 1;
|
|
}
|
|
|
|
template<typename CharT, class Integer, typename Traits>
|
|
inline
|
|
CharT*
|
|
raw_to_string(
|
|
CharT* buf, Integer x, std::true_type)
|
|
{
|
|
if(x == 0)
|
|
{
|
|
Traits::assign(*--buf, '0');
|
|
return buf;
|
|
}
|
|
if(x < 0)
|
|
{
|
|
x = -x;
|
|
for(;x > 0; x /= 10)
|
|
Traits::assign(*--buf ,
|
|
"0123456789"[x % 10]);
|
|
Traits::assign(*--buf, '-');
|
|
return buf;
|
|
}
|
|
for(;x > 0; x /= 10)
|
|
Traits::assign(*--buf ,
|
|
"0123456789"[x % 10]);
|
|
return buf;
|
|
}
|
|
|
|
template<typename CharT, class Integer, typename Traits>
|
|
inline
|
|
CharT*
|
|
raw_to_string(
|
|
CharT* buf, Integer x, std::false_type)
|
|
{
|
|
if(x == 0)
|
|
{
|
|
*--buf = '0';
|
|
return buf;
|
|
}
|
|
for(;x > 0; x /= 10)
|
|
Traits::assign(*--buf ,
|
|
"0123456789"[x % 10]);
|
|
return buf;
|
|
}
|
|
|
|
template<
|
|
typename CharT,
|
|
class Integer,
|
|
typename Traits = std::char_traits<CharT>>
|
|
inline
|
|
CharT*
|
|
raw_to_string(CharT* last, std::size_t size, Integer i)
|
|
{
|
|
BOOST_FIXED_STRING_ASSERT(size >= max_digits(sizeof(Integer)));
|
|
return raw_to_string<CharT, Integer, Traits>(
|
|
last, i, std::is_signed<Integer>{});
|
|
}
|
|
|
|
template<
|
|
typename Traits,
|
|
typename CharT,
|
|
typename ForwardIt>
|
|
inline
|
|
ForwardIt
|
|
find_not_of(
|
|
ForwardIt first, ForwardIt last, const CharT* str, std::size_t n) noexcept
|
|
{
|
|
for (; first != last; ++first)
|
|
if (!Traits::find(str, n, *first))
|
|
return first;
|
|
return last;
|
|
}
|
|
|
|
} // detail
|
|
} // fixed_string
|
|
} // boost
|
|
|
|
#endif
|