forked from boostorg/fusion
make find and find_if algorithms segment-aware, stylistic consistency tweaks
[SVN r73892]
This commit is contained in:
Eric Niebler
@ -9,19 +9,18 @@
|
||||
#if !defined(FUSION_FIND_IF_05052005_1107)
|
||||
#define FUSION_FIND_IF_05052005_1107
|
||||
|
||||
#include <boost/mpl/eval_if.hpp>
|
||||
#include <boost/mpl/or.hpp>
|
||||
#include <boost/mpl/lambda.hpp>
|
||||
#include <boost/mpl/apply.hpp>
|
||||
#include <boost/mpl/eval_if.hpp>
|
||||
#include <boost/mpl/identity.hpp>
|
||||
#include <boost/mpl/lambda.hpp>
|
||||
#include <boost/mpl/or.hpp>
|
||||
#include <boost/fusion/iterator/advance.hpp>
|
||||
#include <boost/fusion/iterator/distance.hpp>
|
||||
#include <boost/fusion/iterator/equal_to.hpp>
|
||||
#include <boost/fusion/iterator/next.hpp>
|
||||
#include <boost/fusion/sequence/intrinsic/begin.hpp>
|
||||
#include <boost/fusion/iterator/advance.hpp>
|
||||
#include <boost/fusion/iterator/distance.hpp>
|
||||
#include <boost/fusion/sequence/intrinsic/end.hpp>
|
||||
#include <boost/fusion/support/category_of.hpp>
|
||||
#include <boost/mpl/eval_if.hpp>
|
||||
#include <boost/mpl/identity.hpp>
|
||||
|
||||
namespace boost { namespace fusion {
|
||||
struct random_access_traversal_tag;
|
||||
@ -222,10 +221,31 @@ namespace detail
|
||||
|
||||
template <typename Iterator>
|
||||
static type
|
||||
call(Iterator const& iter)
|
||||
iter_call(Iterator const& iter)
|
||||
{
|
||||
return choose_call(iter, typename traits::category_of<Iterator>::type());
|
||||
}
|
||||
|
||||
template <typename Sequence>
|
||||
static type
|
||||
call(Sequence& seq)
|
||||
{
|
||||
return iter_call(fusion::begin(seq));
|
||||
}
|
||||
};
|
||||
|
||||
template <typename Sequence, typename Pred>
|
||||
struct result_of_find_if
|
||||
{
|
||||
typedef
|
||||
static_find_if<
|
||||
typename result_of::begin<Sequence>::type
|
||||
, typename result_of::end<Sequence>::type
|
||||
, Pred
|
||||
>
|
||||
filter;
|
||||
|
||||
typedef typename filter::type type;
|
||||
};
|
||||
}}}
|
||||
|
||||
|
||||
106
include/boost/fusion/algorithm/query/detail/segmented_find.hpp
Normal file
106
include/boost/fusion/algorithm/query/detail/segmented_find.hpp
Normal file
@ -0,0 +1,106 @@
|
||||
/*=============================================================================
|
||||
Copyright (c) 2011 Eric Niebler
|
||||
|
||||
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)
|
||||
==============================================================================*/
|
||||
#if !defined(BOOST_FUSION_SEGMENTED_FIND_HPP_INCLUDED)
|
||||
#define BOOST_FUSION_SEGMENTED_FIND_HPP_INCLUDED
|
||||
|
||||
#include <boost/type_traits/remove_const.hpp>
|
||||
#include <boost/fusion/algorithm/query/find_fwd.hpp>
|
||||
#include <boost/fusion/iterator/equal_to.hpp>
|
||||
#include <boost/fusion/sequence/intrinsic/end.hpp>
|
||||
#include <boost/fusion/support/segmented_fold_until.hpp>
|
||||
|
||||
namespace boost { namespace fusion { namespace detail
|
||||
{
|
||||
template <typename T>
|
||||
struct segmented_find_fun
|
||||
{
|
||||
template <typename Sig>
|
||||
struct result;
|
||||
|
||||
template <typename This, typename Sequence, typename State, typename Context>
|
||||
struct result<This(Sequence&, State&, Context&)>
|
||||
{
|
||||
typedef
|
||||
typename result_of::find<Sequence, T>::type
|
||||
iterator_type;
|
||||
|
||||
typedef
|
||||
typename result_of::make_segmented_iterator<
|
||||
iterator_type
|
||||
, typename remove_const<Context>::type
|
||||
>::type
|
||||
segmented_iterator_type;
|
||||
|
||||
typedef
|
||||
typename mpl::if_<
|
||||
result_of::equal_to<
|
||||
iterator_type
|
||||
, typename result_of::end<Sequence>::type
|
||||
>
|
||||
, fusion::result<typename remove_const<State>::type, continue_>, // NOT FOUND
|
||||
fusion::result<segmented_iterator_type, break_> // FOUND
|
||||
>::type
|
||||
type;
|
||||
};
|
||||
|
||||
template <typename Sequence, typename State, typename Context>
|
||||
typename result<segmented_find_fun(Sequence&, State const&, Context const&)>::type
|
||||
operator()(Sequence& seq, State const&state, Context const& context) const
|
||||
{
|
||||
typedef
|
||||
typename result_of::equal_to<
|
||||
typename result_of::find<Sequence, T>::type
|
||||
, typename result_of::end<Sequence>::type
|
||||
>::type
|
||||
not_found;
|
||||
|
||||
return call(seq, state, context, not_found());
|
||||
}
|
||||
|
||||
private:
|
||||
template <typename Sequence, typename State, typename Context>
|
||||
typename result<segmented_find_fun(Sequence&, State const&, Context const&)>::type
|
||||
call(Sequence&, State const&state, Context const&, mpl::true_) const
|
||||
{
|
||||
return state;
|
||||
}
|
||||
|
||||
template <typename Sequence, typename State, typename Context>
|
||||
typename result<segmented_find_fun(Sequence&, State const&, Context const&)>::type
|
||||
call(Sequence& seq, State const&, Context const& context, mpl::false_) const
|
||||
{
|
||||
return fusion::make_segmented_iterator(fusion::find<T>(seq), context);
|
||||
}
|
||||
};
|
||||
|
||||
template <typename Sequence, typename T>
|
||||
struct result_of_segmented_find
|
||||
{
|
||||
struct filter
|
||||
{
|
||||
typedef
|
||||
typename result_of::segmented_fold_until<
|
||||
Sequence
|
||||
, typename result_of::end<Sequence>::type
|
||||
, segmented_find_fun<T>
|
||||
>::type
|
||||
type;
|
||||
|
||||
static type call(Sequence& seq)
|
||||
{
|
||||
return fusion::segmented_fold_until(
|
||||
seq
|
||||
, fusion::end(seq)
|
||||
, detail::segmented_find_fun<T>());
|
||||
}
|
||||
};
|
||||
|
||||
typedef typename filter::type type;
|
||||
};
|
||||
}}}
|
||||
|
||||
#endif
|
||||
@ -0,0 +1,108 @@
|
||||
/*=============================================================================
|
||||
Copyright (c) 2011 Eric Niebler
|
||||
|
||||
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)
|
||||
==============================================================================*/
|
||||
#if !defined(BOOST_FUSION_SEGMENTED_FIND_IF_HPP_INCLUDED)
|
||||
#define BOOST_FUSION_SEGMENTED_FIND_IF_HPP_INCLUDED
|
||||
|
||||
#include <boost/utility/enable_if.hpp>
|
||||
#include <boost/type_traits/is_const.hpp>
|
||||
#include <boost/type_traits/remove_const.hpp>
|
||||
#include <boost/fusion/algorithm/query/find_if_fwd.hpp>
|
||||
#include <boost/fusion/iterator/equal_to.hpp>
|
||||
#include <boost/fusion/sequence/intrinsic/end.hpp>
|
||||
#include <boost/fusion/support/segmented_fold_until.hpp>
|
||||
|
||||
namespace boost { namespace fusion { namespace detail
|
||||
{
|
||||
template <typename Pred>
|
||||
struct segmented_find_if_fun
|
||||
{
|
||||
template <typename Sig>
|
||||
struct result;
|
||||
|
||||
template <typename This, typename Sequence, typename State, typename Context>
|
||||
struct result<This(Sequence&, State&, Context&)>
|
||||
{
|
||||
typedef
|
||||
typename result_of::find_if<Sequence, Pred>::type
|
||||
iterator_type;
|
||||
|
||||
typedef
|
||||
typename result_of::make_segmented_iterator<
|
||||
iterator_type
|
||||
, typename remove_const<Context>::type
|
||||
>::type
|
||||
segmented_iterator_type;
|
||||
|
||||
typedef
|
||||
typename mpl::if_<
|
||||
result_of::equal_to<
|
||||
iterator_type
|
||||
, typename result_of::end<Sequence>::type
|
||||
>
|
||||
, fusion::result<typename remove_const<State>::type, continue_>, // NOT FOUND
|
||||
fusion::result<segmented_iterator_type, break_> // FOUND
|
||||
>::type
|
||||
type;
|
||||
};
|
||||
|
||||
template <typename Sequence, typename State, typename Context>
|
||||
typename result<segmented_find_if_fun(Sequence&, State const&, Context const&)>::type
|
||||
operator()(Sequence& seq, State const& state, Context const& context) const
|
||||
{
|
||||
typedef
|
||||
typename result_of::equal_to<
|
||||
typename result_of::find_if<Sequence, Pred>::type
|
||||
, typename result_of::end<Sequence>::type
|
||||
>::type
|
||||
not_found;
|
||||
|
||||
return call(seq, state, context, not_found());
|
||||
}
|
||||
|
||||
private:
|
||||
template <typename Sequence, typename State, typename Context>
|
||||
typename result<segmented_find_if_fun(Sequence&, State const&, Context const&)>::type
|
||||
call(Sequence&, State const& state, Context const&, mpl::true_) const
|
||||
{
|
||||
return state;
|
||||
}
|
||||
|
||||
template <typename Sequence, typename State, typename Context>
|
||||
typename result<segmented_find_if_fun(Sequence&, State const&, Context const&)>::type
|
||||
call(Sequence& seq, State const&, Context const& context, mpl::false_) const
|
||||
{
|
||||
return fusion::make_segmented_iterator(fusion::find_if<Pred>(seq), context);
|
||||
}
|
||||
};
|
||||
|
||||
template <typename Sequence, typename Pred>
|
||||
struct result_of_segmented_find_if
|
||||
{
|
||||
struct filter
|
||||
{
|
||||
typedef
|
||||
typename result_of::segmented_fold_until<
|
||||
Sequence
|
||||
, typename result_of::end<Sequence>::type
|
||||
, segmented_find_if_fun<Pred>
|
||||
>::type
|
||||
type;
|
||||
|
||||
static type call(Sequence& seq)
|
||||
{
|
||||
return fusion::segmented_fold_until(
|
||||
seq
|
||||
, fusion::end(seq)
|
||||
, segmented_find_if_fun<Pred>());
|
||||
}
|
||||
};
|
||||
|
||||
typedef typename filter::type type;
|
||||
};
|
||||
}}}
|
||||
|
||||
#endif
|
||||
Reference in New Issue
Block a user