/*============================================================================= 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 #include #include #include #include #include namespace boost { namespace fusion { namespace detail { template struct segmented_find_fun { template struct apply { typedef typename result_of::find::type iterator_type; typedef typename result_of::equal_to< iterator_type , typename result_of::end::type >::type continue_type; typedef typename mpl::eval_if< continue_type , mpl::identity , result_of::make_segmented_iterator< iterator_type , Context > >::type type; static type call(Sequence& seq, State const&state, Context const& context, segmented_find_fun) { return call_impl(seq, state, context, continue_type()); } static type call_impl(Sequence&, State const&state, Context const&, mpl::true_) { return state; } static type call_impl(Sequence& seq, State const&, Context const& context, mpl::false_) { return fusion::make_segmented_iterator(fusion::find(seq), context); } }; }; template struct result_of_segmented_find { struct filter { typedef typename result_of::segmented_fold_until< Sequence , typename result_of::end::type , segmented_find_fun >::type type; static type call(Sequence& seq) { return fusion::segmented_fold_until( seq , fusion::end(seq) , detail::segmented_find_fun()); } }; typedef typename filter::type type; }; }}} #endif