mirror/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout.git synced 2024-12-23 21:25:49 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

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
Show stats 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

66
sprout/weed/parser/char/char.hpp
View file

@ -4,6 +4,9 @@
#include <iterator>
#include <type_traits>
#include <sprout/config.hpp>
#include <sprout/string.hpp>
#include <sprout/container/begin.hpp>
#include <sprout/container/end.hpp>
#include <sprout/iterator/next.hpp>
#include <sprout/type_traits/identity.hpp>
#include <sprout/weed/unused.hpp>
@ -11,6 +14,10 @@
#include <sprout/weed/parser/parser_base.hpp>
#include <sprout/weed/parser/lit.hpp>
#include <sprout/weed/traits/type/is_char_type.hpp>
#include <sprout/weed/traits/type/is_c_str.hpp>
#include <sprout/weed/traits/type/is_string.hpp>
#include <sprout/weed/detail/find_character_set.hpp>
#include <sprout/weed/detail/c_str_as_string.hpp>
namespace sprout {
namespace weed {
@ -152,6 +159,45 @@ namespace sprout {
}
};
//
// char_set_p
//
template<typename T>
struct char_set_p
: public sprout::weed::parser_base
{
public:
template<typename Context, typename Iterator>
struct attribute
: public sprout::identity<typename std::iterator_traits<Iterator>::value_type>
{};
template<typename Context, typename Iterator>
struct result
: public sprout::identity<sprout::weed::parser_result<Iterator, typename attribute<Context, Iterator>::type> >
{};
private:
T t_;
public:
char_set_p() = default;
explicit SPROUT_CONSTEXPR char_set_p(T const& t)
: t_(t)
{}
template<typename Context, typename Iterator>
SPROUT_CONSTEXPR typename result<Context, Iterator>::type operator()(
Iterator first,
Iterator last,
Context const&
) const
{
typedef typename result<Context, Iterator>::type result_type;
typedef typename attribute<Context, Iterator>::type attribute_type;
return first != last && sprout::weed::detail::find_character_set(sprout::begin(t_), sprout::end(t_), *first) != sprout::end(t_)
? result_type(true, sprout::next(first), *first)
: result_type(false, first, attribute_type())
;
}
};
//
// any_char_p
//
@ -198,6 +244,26 @@ namespace sprout {
operator()(T const& f, T const& l) const {
return sprout::weed::char_range_p<T>(f, l);
}
template<typename T>
SPROUT_CONSTEXPR typename std::enable_if<
sprout::weed::traits::is_c_str<T const>::value,
sprout::weed::char_set_p<
typename sprout::weed::detail::c_str_as_string<T const>::type
>
>::type
operator()(T const& t) const {
return sprout::weed::char_set_p<
typename sprout::weed::detail::c_str_as_string<T const>::type
>(sprout::to_string(t));
}
template<typename T>
SPROUT_CONSTEXPR typename std::enable_if<
sprout::weed::traits::is_string<T>::value,
sprout::weed::char_set_p<T>
>::type
operator()(T const& t) const {
return sprout::weed::char_set_p<T>(t);
}
};
//
// char_

1
sprout/weed/parser/string/string.hpp
View file

@ -16,6 +16,7 @@
#include <sprout/weed/parser/lit.hpp>
#include <sprout/weed/traits/type/is_c_str.hpp>
#include <sprout/weed/traits/type/is_string.hpp>
#include <sprout/weed/detail/c_str_as_string.hpp>
namespace sprout {
namespace weed {