/*============================================================================= Copyright (c) 2001-2010 Joel de Guzman 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_SPIRIT_ANY_NS_MARCH_13_2007_0827AM) #define BOOST_SPIRIT_ANY_NS_MARCH_13_2007_0827AM #if defined(_MSC_VER) #pragma once #endif #include #include #include #include #include #include #include #include namespace boost { namespace spirit { // A non-short circuiting (ns) version of the any algorithm (uses // | instead of ||. namespace detail { template inline bool any_ns(First1 const&, First2 const&, Last const&, F const&, mpl::true_) { return false; } template inline bool any_ns(First1 const& first1, First2 const& first2, Last const& last, F& f, mpl::false_) { return (0 != (f(*first1, *first2) | detail::any_ns( fusion::next(first1) , fusion::next(first2) , last , f , fusion::result_of::equal_to< typename fusion::result_of::next::type, Last>()))); } template inline bool any_ns(First const&, Last const&, F const&, mpl::true_) { return false; } template inline bool any_ns(First const& first, Last const& last, F& f, mpl::false_) { return (0 != (f(*first) | detail::any_ns( fusion::next(first) , last , f , fusion::result_of::equal_to< typename fusion::result_of::next::type, Last>()))); } } template inline bool any_ns(Sequence1 const& seq1, Sequence2& seq2, F f) { return detail::any_ns( fusion::begin(seq1) , fusion::begin(seq2) , fusion::end(seq1) , f , fusion::result_of::equal_to< typename fusion::result_of::begin::type , typename fusion::result_of::end::type>()); } template inline bool any_ns(Sequence const& seq, unused_type, F f) { return detail::any_ns( fusion::begin(seq) , fusion::end(seq) , f , fusion::result_of::equal_to< typename fusion::result_of::begin::type , typename fusion::result_of::end::type>()); } }} #endif