King_DuckZ/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout synced 2025-08-03 12:49:50 +00:00
Code Issues Releases Wiki Activity

add weed parser: char_("character-sets")

Browse source
This commit is contained in:
bolero-MURAKAMI 2013-05-22 06:49:10 +09:00
parent ab096d442c
commit a77fd5ffef
4 changed files with 183 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

5
sprout/weed/detail/c_str_as_string.hpp
View file

@ -5,12 +5,15 @@
#include <sprout/config.hpp>
#include <sprout/string.hpp>
#include <sprout/type_traits/identity.hpp>
#include <sprout/type/void.hpp>
namespace sprout {
namespace weed {
namespace detail {
template<typename T>
struct c_str_as_string;
struct c_str_as_string
: public sprout::identity<sprout::types::void_>
{};
template<typename T>
struct c_str_as_string<T const>
: public sprout::weed::detail::c_str_as_string<T>

112
sprout/weed/detail/find_character_set.hpp Normal file
View file

@ -0,0 +1,112 @@
#ifndef SPROUT_WEED_DETAIL_FIND_CHARACTER_SET_HPP
#define SPROUT_WEED_DETAIL_FIND_CHARACTER_SET_HPP
#include <iterator>
#include <type_traits>
#include <sprout/config.hpp>
#include <sprout/iterator/operation.hpp>
#include <sprout/iterator/type_traits/category.hpp>
#include <sprout/utility/pair/pair.hpp>
namespace sprout {
namespace weed {
namespace detail {
template<typename RandomAccessIterator, typename T>
inline SPROUT_CONSTEXPR RandomAccessIterator
find_character_set_impl_ra(
RandomAccessIterator first, RandomAccessIterator last, T const& value,
typename std::iterator_traits<RandomAccessIterator>::difference_type pivot, RandomAccessIterator found
)
{
return found != first ? found
: pivot == 0 ? (
*first == T('-') ? *sprout::prev(first) <= value && *sprout::next(first) >= value
: *first == value
) ? first : last
: sprout::weed::detail::find_character_set_impl_ra(
sprout::next(first, pivot), last, value,
(sprout::distance(first, last) - pivot) / 2,
sprout::weed::detail::find_character_set_impl_ra(
first, sprout::next(first, pivot), value,
pivot / 2,
first
)
)
;
}
template<typename RandomAccessIterator, typename T>
inline SPROUT_CONSTEXPR typename std::enable_if<
sprout::is_constant_distance_iterator<RandomAccessIterator>::value,
RandomAccessIterator
>::type
find_character_set(
RandomAccessIterator first, RandomAccessIterator last, T const& value,
std::random_access_iterator_tag*
)
{
return first == last ? last
: sprout::weed::detail::find_character_set_impl_ra(first, last, value, sprout::distance(first, last) / 2, first)
;
}
template<typename BidirectionalIterator, typename T>
inline SPROUT_CONSTEXPR sprout::pair<BidirectionalIterator, bool>
find_character_set_impl_1(
sprout::pair<BidirectionalIterator, bool> const& current,
BidirectionalIterator last, T const& value, typename std::iterator_traits<BidirectionalIterator>::difference_type n
)
{
typedef sprout::pair<BidirectionalIterator, bool> type;
return current.second || current.first == last ? current
: n == 1 ? (
*current.first == T('-') ? *sprout::prev(current.first) <= value && *sprout::next(current.first) >= value
: *current.first == value
) ? type(current.first, true) : type(sprout::next(current.first), false)
: sprout::weed::detail::find_character_set_impl_1(
sprout::weed::detail::find_character_set_impl_1(
current,
last, value, n / 2
),
last, value, n - n / 2
)
;
}
template<typename BidirectionalIterator, typename T>
inline SPROUT_CONSTEXPR sprout::pair<BidirectionalIterator, bool>
find_character_set_impl(
sprout::pair<BidirectionalIterator, bool> const& current,
BidirectionalIterator last, T const& value, typename std::iterator_traits<BidirectionalIterator>::difference_type n
)
{
return current.second || current.first == last ? current
: sprout::weed::detail::find_character_set_impl(
sprout::weed::detail::find_character_set_impl_1(
current,
last, value, n
),
last, value, n * 2
)
;
}
template<typename BidirectionalIterator, typename T>
inline SPROUT_CONSTEXPR BidirectionalIterator
find_character_set(
BidirectionalIterator first, BidirectionalIterator last, T const& value,
std::input_iterator_tag*
)
{
typedef sprout::pair<BidirectionalIterator, bool> type;
return sprout::weed::detail::find_character_set_impl(type(first, false), last, value, 1).first;
}
template<typename BidirectionalIterator, typename T>
inline SPROUT_CONSTEXPR BidirectionalIterator
find_character_set(BidirectionalIterator first, BidirectionalIterator last, T const& value) {
typedef typename std::iterator_traits<BidirectionalIterator>::iterator_category* category;
return sprout::weed::detail::find_character_set(first, last, value, category());
}
} // namespace detail
} // namespace weed
} // namespace sprout
#endif // #ifndef SPROUT_WEED_DETAIL_FIND_CHARACTER_SET_HPP