/src/contrib/boost/spirit/home/support/algorithm/any_if_ns.hpp

 1/*=============================================================================
 2    Copyright (c) 2001-2010 Hartmut Kaiser
 3    Copyright (c) 2001-2010 Joel de Guzman
 4
 5    Distributed under the Boost Software License, Version 1.0. (See accompanying
 6    file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
 7==============================================================================*/
 8#if !defined(BOOST_SPIRIT_ANY_IF_NS_NOVEMBER_04_2008_0906PM)
 9#define BOOST_SPIRIT_ANY_IF_NS_NOVEMBER_04_2008_0906PM
10
11#if defined(_MSC_VER)
12#pragma once
13#endif
14
15#include <boost/spirit/home/support/algorithm/any_if.hpp>
16#include <boost/spirit/home/support/algorithm/any_ns.hpp>
17
18namespace boost { namespace spirit
19{
20    ///////////////////////////////////////////////////////////////////////////
21    //  This is a special version for a binary fusion::any. The predicate
22    //  is used to decide whether to advance the second iterator or not.
23    //  This is needed for sequences containing components with unused
24    //  attributes. The second iterator is advanced only if the attribute
25    //  of the corresponding component iterator is not unused.
26    //
27    //  This is a non-short circuiting (ns) version of the any_if algorithm.
28    //  see any_if.hpp (uses | instead of ||).
29    ///////////////////////////////////////////////////////////////////////////
30    namespace detail
31    {
32        template <
33            typename Pred, typename First1, typename Last1, typename First2
34          , typename Last2, typename F
35        >
36        inline bool
37        any_if_ns(First1 const&, First2 const&, Last1 const&, Last2 const&
38          , F const&, mpl::true_)
39        {
40            return false;
41        }
42
43        template <
44            typename Pred, typename First1, typename Last1, typename First2
45          , typename Last2, typename F
46        >
47        inline bool
48        any_if_ns(First1 const& first1, First2 const& first2
49          , Last1 const& last1, Last2 const& last2, F& f, mpl::false_)
50        {
51            return (0 != (f(*first1, attribute_value<Pred, First1, Last2>(first2)) |
52                detail::any_if_ns<Pred>(
53                    fusion::next(first1)
54                  , attribute_next<Pred, First1, Last2>(first2)
55                  , last1, last2
56                  , f
57                  , fusion::result_of::equal_to<
58                        typename fusion::result_of::next<First1>::type, Last1>())));
59        }
60    }
61
62    template <typename Pred, typename Sequence1, typename Sequence2, typename F>
63    inline bool
64    any_if_ns(Sequence1 const& seq1, Sequence2& seq2, F f, Pred)
65    {
66        return detail::any_if_ns<Pred>(
67                fusion::begin(seq1), fusion::begin(seq2)
68              , fusion::end(seq1), fusion::end(seq2)
69              , f
70              , fusion::result_of::equal_to<
71                    typename fusion::result_of::begin<Sequence1>::type
72                  , typename fusion::result_of::end<Sequence1>::type>());
73    }
74
75    template <typename Pred, typename Sequence, typename F>
76    inline bool
77    any_if_ns(Sequence const& seq, unused_type const, F f, Pred)
78    {
79        return detail::any_ns(
80                fusion::begin(seq)
81              , fusion::end(seq)
82              , f
83              , fusion::result_of::equal_to<
84                    typename fusion::result_of::begin<Sequence>::type
85                  , typename fusion::result_of::end<Sequence>::type>());
86    }
87
88}}
89
90#endif
91