1#if !defined(BOOST_PROTO_DONT_USE_PREPROCESSED_FILES)
2
3 #include <boost/proto/detail/preprocessed/basic_expr.hpp>
4
5#elif !defined(BOOST_PP_IS_ITERATING)
6
7 /// INTERNAL ONLY
8 ///
9 #define BOOST_PROTO_CHILD(Z, N, DATA) \
10 typedef BOOST_PP_CAT(Arg, N) BOOST_PP_CAT(proto_child, N); \
11 BOOST_PP_CAT(proto_child, N) BOOST_PP_CAT(child, N); \
12 /**< INTERNAL ONLY */
13
14 /// INTERNAL ONLY
15 ///
16 #define BOOST_PROTO_VOID(Z, N, DATA) \
17 typedef void BOOST_PP_CAT(proto_child, N); \
18 /**< INTERNAL ONLY */
19
20 #if defined(__WAVE__) && defined(BOOST_PROTO_CREATE_PREPROCESSED_FILES)
21 #pragma wave option(preserve: 2, line: 0, output: "preprocessed/basic_expr.hpp")
22 #endif
23
24 ///////////////////////////////////////////////////////////////////////////////
25 /// \file basic_expr.hpp
26 /// Contains definition of basic_expr\<\> class template.
27 //
28 // Copyright 2008 Eric Niebler. Distributed under the Boost
29 // Software License, Version 1.0. (See accompanying file
30 // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
31
32 #if defined(__WAVE__) && defined(BOOST_PROTO_CREATE_PREPROCESSED_FILES)
33 #pragma wave option(preserve: 1)
34 #endif
35
36 // The expr<> specializations are actually defined here.
37 #define BOOST_PROTO_DEFINE_TERMINAL
38 #define BOOST_PP_ITERATION_PARAMS_1 (3, (0, 0, <boost/proto/detail/basic_expr.hpp>))
39 #include BOOST_PP_ITERATE()
40
41 #undef BOOST_PROTO_DEFINE_TERMINAL
42 #define BOOST_PP_ITERATION_PARAMS_1 (3, (1, BOOST_PROTO_MAX_ARITY, <boost/proto/detail/basic_expr.hpp>))
43 #include BOOST_PP_ITERATE()
44
45 #if defined(__WAVE__) && defined(BOOST_PROTO_CREATE_PREPROCESSED_FILES)
46 #pragma wave option(output: null)
47 #endif
48
49 #undef BOOST_PROTO_CHILD
50 #undef BOOST_PROTO_VOID
51
52#else
53
54 #define ARG_COUNT BOOST_PP_MAX(1, BOOST_PP_ITERATION())
55
56 /// \brief Simplified representation of a node in an expression tree.
57 ///
58 /// \c proto::basic_expr\<\> is a node in an expression template tree. It
59 /// is a container for its child sub-trees. It also serves as
60 /// the terminal nodes of the tree.
61 ///
62 /// \c Tag is type that represents the operation encoded by
63 /// this expression. It is typically one of the structs
64 /// in the \c boost::proto::tag namespace, but it doesn't
65 /// have to be.
66 ///
67 /// \c Args is a type list representing the type of the children
68 /// of this expression. It is an instantiation of one
69 /// of \c proto::list1\<\>, \c proto::list2\<\>, etc. The
70 /// child types must all themselves be either \c expr\<\>
71 /// or <tt>proto::expr\<\>&</tt>. If \c Args is an
72 /// instantiation of \c proto::term\<\> then this
73 /// \c expr\<\> type represents a terminal expression;
74 /// the parameter to the \c proto::term\<\> template
75 /// represents the terminal's value type.
76 ///
77 /// \c Arity is an integral constant representing the number of child
78 /// nodes this node contains. If \c Arity is 0, then this
79 /// node is a terminal.
80 ///
81 /// \c proto::basic_expr\<\> is a valid Fusion random-access sequence, where
82 /// the elements of the sequence are the child expressions.
83 #ifdef BOOST_PROTO_DEFINE_TERMINAL
84 template<typename Tag, typename Arg0>
85 struct basic_expr<Tag, term<Arg0>, 0>
86 #else
87 template<typename Tag BOOST_PP_ENUM_TRAILING_PARAMS(ARG_COUNT, typename Arg)>
88 struct basic_expr<Tag, BOOST_PP_CAT(list, BOOST_PP_ITERATION())<BOOST_PP_ENUM_PARAMS(ARG_COUNT, Arg)>, BOOST_PP_ITERATION() >
89 #endif
90 {
91 typedef Tag proto_tag;
92 static const long proto_arity_c = BOOST_PP_ITERATION();
93 typedef mpl::long_<BOOST_PP_ITERATION() > proto_arity;
94 typedef basic_expr proto_base_expr;
95 #ifdef BOOST_PROTO_DEFINE_TERMINAL
96 typedef term<Arg0> proto_args;
97 #else
98 typedef BOOST_PP_CAT(list, BOOST_PP_ITERATION())<BOOST_PP_ENUM_PARAMS(ARG_COUNT, Arg)> proto_args;
99 #endif
100 typedef basic_expr proto_grammar;
101 typedef basic_default_domain proto_domain;
102 typedef default_generator proto_generator;
103 typedef proto::tag::proto_expr<Tag, proto_domain> fusion_tag;
104 typedef basic_expr proto_derived_expr;
105 typedef void proto_is_expr_; /**< INTERNAL ONLY */
106
107 BOOST_PP_REPEAT(ARG_COUNT, BOOST_PROTO_CHILD, ~)
108 BOOST_PP_REPEAT_FROM_TO(ARG_COUNT, BOOST_PROTO_MAX_ARITY, BOOST_PROTO_VOID, ~)
109
110 /// \return *this
111 ///
112 BOOST_FORCEINLINE
113 basic_expr const &proto_base() const
114 {
115 return *this;
116 }
117
118 /// \overload
119 ///
120 BOOST_FORCEINLINE
121 basic_expr &proto_base()
122 {
123 return *this;
124 }
125
126 #ifdef BOOST_PROTO_DEFINE_TERMINAL
127 /// \return A new \c expr\<\> object initialized with the specified
128 /// arguments.
129 ///
130 template<typename A0>
131 BOOST_FORCEINLINE
132 static basic_expr const make(A0 &a0)
133 {
134 return detail::make_terminal(a0, static_cast<basic_expr *>(0), static_cast<proto_args *>(0));
135 }
136
137 /// \overload
138 ///
139 template<typename A0>
140 BOOST_FORCEINLINE
141 static basic_expr const make(A0 const &a0)
142 {
143 return detail::make_terminal(a0, static_cast<basic_expr *>(0), static_cast<proto_args *>(0));
144 }
145 #else
146 /// \return A new \c expr\<\> object initialized with the specified
147 /// arguments.
148 ///
149 template<BOOST_PP_ENUM_PARAMS(ARG_COUNT, typename A)>
150 BOOST_FORCEINLINE
151 static basic_expr const make(BOOST_PP_ENUM_BINARY_PARAMS(ARG_COUNT, A, const &a))
152 {
153 basic_expr that = {BOOST_PP_ENUM_PARAMS(ARG_COUNT, a)};
154 return that;
155 }
156 #endif
157
158 #if 1 == BOOST_PP_ITERATION()
159 /// If \c Tag is \c boost::proto::tag::address_of and \c proto_child0 is
160 /// <tt>T&</tt>, then \c address_of_hack_type_ is <tt>T*</tt>.
161 /// Otherwise, it is some undefined type.
162 typedef typename detail::address_of_hack<Tag, proto_child0>::type address_of_hack_type_;
163
164 /// \return The address of <tt>this->child0</tt> if \c Tag is
165 /// \c boost::proto::tag::address_of. Otherwise, this function will
166 /// fail to compile.
167 ///
168 /// \attention Proto overloads <tt>operator&</tt>, which means that
169 /// proto-ified objects cannot have their addresses taken, unless we use
170 /// the following hack to make \c &x implicitly convertible to \c X*.
171 BOOST_FORCEINLINE
172 operator address_of_hack_type_() const
173 {
174 return boost::addressof(this->child0);
175 }
176 #else
177 /// INTERNAL ONLY
178 ///
179 typedef detail::not_a_valid_type address_of_hack_type_;
180 #endif
181 };
182
183#undef ARG_COUNT
184
185#endif
186