x
Yes
No
Do you want to visit DriveHQ English website?
首页
产品服务
价格
免费试用
下载客户端
关于我们
云文件服务
|
云备份服务
|
FTP服务
|
企业邮箱服务
|
网站托管
|
客户端软件
云文件服务
云备份服务
FTP服务
企业级邮箱服务
网站托管
客户端软件
expr.hpp - Hosted on DriveHQ Cloud IT Platform
返回上层目录
上传
下载
共享
发布
新建文件夹
新建文件
复制
剪切
删除
粘贴
评论
升级服务
路径: \\game3dprogramming\materials\GameFactory\GameFactoryDemo\references\boost_1_35_0\boost\xpressive\proto\expr.hpp
旋转
特效
属性
历史版本
#ifndef BOOST_PP_IS_ITERATING /////////////////////////////////////////////////////////////////////////////// /// \file expr.hpp /// Contains definition of expr\<\> class template. // // Copyright 2007 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) #ifndef BOOST_PROTO_EXPR_HPP_EAN_04_01_2005 #define BOOST_PROTO_EXPR_HPP_EAN_04_01_2005 #include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#if defined(_MSC_VER) && (_MSC_VER >= 1020) # pragma warning(push) # pragma warning(disable : 4510) // default constructor could not be generated # pragma warning(disable : 4512) // assignment operator could not be generated # pragma warning(disable : 4610) // user defined constructor required #endif namespace boost { namespace proto { /// INTERNAL ONLY /// #define BOOST_PROTO_ARG(z, n, data)\ typedef typename Args::BOOST_PP_CAT(arg, n) BOOST_PP_CAT(proto_arg, n);\ BOOST_PP_CAT(proto_arg, n) BOOST_PP_CAT(arg, n);\ /**/ /// INTERNAL ONLY /// #define BOOST_PROTO_VOID(z, n, data)\ typedef void BOOST_PP_CAT(proto_arg, n);\ /**/ /// INTERNAL ONLY /// #define BOOST_PROTO_AS_OP(z, n, data)\ proto::as_arg(BOOST_PP_CAT(a,n))\ /**/ /// INTERNAL ONLY /// #define BOOST_PROTO_UNREF_ARG_TYPE(z, n, data)\ typename result_of::unref
::const_reference\ /**/ /// INTERNAL ONLY /// #define BOOST_PROTO_UNREF_ARG(z, n, data)\ proto::unref(this->BOOST_PP_CAT(arg, n))\ /**/ namespace detail { template
struct address_of_hack { typedef address_of_hack type; }; template
struct address_of_hack
> { typedef Expr *type; }; template
void checked_copy(X (&x)[N], Y (&y)[N]) { for(std::size_t i = 0; i < N; ++i) { y[i] = x[i]; } } template
struct if_is_array {}; template
struct if_is_array
{ typedef int type; }; } namespace result_of { template
struct funop; #define BOOST_PP_ITERATION_PARAMS_1 (3, (0, BOOST_PP_DEC(BOOST_PROTO_MAX_ARITY),
)) #include BOOST_PP_ITERATE() } namespace exprns_ { #define BOOST_PP_ITERATION_PARAMS_1 (3, (0, BOOST_PROTO_MAX_ARITY,
)) #include BOOST_PP_ITERATE() } #undef BOOST_PROTO_ARG #undef BOOST_PROTO_VOID #undef BOOST_PROTO_AS_OP #undef BOOST_PROTO_UNREF_ARG_TYPE #undef BOOST_PROTO_UNREF_ARG }} #if defined(_MSC_VER) && (_MSC_VER >= 1020) # pragma warning(pop) #endif #endif // BOOST_PROTO_EXPR_HPP_EAN_04_01_2005 #elif BOOST_PP_ITERATION_DEPTH() == 1 #define ARG_COUNT BOOST_PP_MAX(1, BOOST_PP_ITERATION()) #define IS_TERMINAL 0 == BOOST_PP_ITERATION() /// \brief Representation of a node in an expression tree. /// /// \c proto::expr\<\> is a node in an expression template tree. It /// is a container for its children sub-trees. It also serves as /// the terminal nodes of the tree. /// /// \c Tag is type that represents the operation encoded by /// this expression. It is typically one of the structs /// in the \c boost::proto::tag namespace, but it doesn't /// have to be. If the \c Tag type is \c boost::proto::tag::terminal /// then this \c expr\<\> type represents a leaf in the /// expression tree. /// /// \c Args is a type list representing the type of the children /// of this expression. It is an instantiation of one /// of \c proto::args1\<\>, \c proto::args2\<\>, etc. The /// children types must all themselves be either \c expr\<\> /// or \c proto::ref_\
\>, unless the \c Tag /// type is \c boost::proto::tag::terminal, in which case /// \c Args must be \c proto::args1\
, where \c T can be any /// type. template
struct expr
{ typedef Tag proto_tag; typedef mpl::long_
proto_arity; typedef expr proto_base_expr; typedef Args proto_args; typedef default_domain proto_domain; typedef tag::proto_expr fusion_tag; typedef void proto_is_expr_; typedef expr proto_derived_expr; BOOST_PROTO_IDENTITY_TRANSFORM(); BOOST_PP_REPEAT(ARG_COUNT, BOOST_PROTO_ARG, ~) BOOST_PP_REPEAT_FROM_TO(ARG_COUNT, BOOST_PROTO_MAX_ARITY, BOOST_PROTO_VOID, ~) /// \return *this /// expr const &proto_base() const { return *this; } /// \overload /// expr &proto_base() { return *this; } /// \return A new \c expr\<\> object initialized with the specified /// arguments. /// template
static expr make(BOOST_PP_ENUM_BINARY_PARAMS(ARG_COUNT, A, const &a)) { expr that = {BOOST_PP_ENUM_PARAMS(ARG_COUNT, a)}; return that; } #if IS_TERMINAL /// \overload /// template
static expr make(A0 &a0) { expr that = {a0}; return that; } /// \overload /// template
static expr make(A0 (&a0)[N], typename detail::if_is_array
::type = 0) { expr that; detail::checked_copy(a0, that.arg0); return that; } /// \overload /// template
static expr make(A0 const (&a0)[N], typename detail::if_is_array
::type = 0) { expr that; detail::checked_copy(a0, that.arg0); return that; } #endif #if 1 == BOOST_PP_ITERATION() /// If \c Tag is \c boost::proto::tag::address_of and \c proto_arg0 is /// \c proto::ref_\
, then \c address_of_hack_type_ is
T*
. /// Otherwise, it is some undefined type. typedef typename detail::address_of_hack
::type address_of_hack_type_; /// \return The address of
this->arg0
if \c Tag is /// \c boost::proto::tag::address_of. Otherwise, this function will /// fail to compile. /// /// \attention Proto overloads
operator&
, which means that /// proto-ified objects cannot have their addresses taken, unless we use /// the following hack to make \c &x implicitly convertible to \c X*. operator address_of_hack_type_() const { return boost::addressof(this->arg0.expr); } #endif /// Assignment /// /// \param a The rhs. /// \return A new \c expr\<\> node representing an assignment of \c a to \c *this. template
expr
, typename result_of::as_arg
::type> > const operator =(A &a) const { expr
, typename result_of::as_arg
::type> > that = {{*this}, proto::as_arg(a)}; return that; } /// \overload /// template
expr
, typename result_of::as_arg
::type> > const operator =(A const &a) const { expr
, typename result_of::as_arg
::type> > that = {{*this}, proto::as_arg(a)}; return that; } #if IS_TERMINAL /// \overload /// template
expr
, typename result_of::as_arg
::type> > const operator =(A &a) { expr
, typename result_of::as_arg
::type> > that = {{*this}, proto::as_arg(a)}; return that; } /// \overload /// template
expr
, typename result_of::as_arg
::type> > const operator =(A const &a) { expr
, typename result_of::as_arg
::type> > that = {{*this}, proto::as_arg(a)}; return that; } #endif /// Subscript /// /// \param a The rhs. /// \return A new \c expr\<\> node representing \c *this subscripted with \c a. template
expr
, typename result_of::as_arg
::type> > const operator [](A &a) const { expr
, typename result_of::as_arg
::type> > that = {{*this}, proto::as_arg(a)}; return that; } /// \overload /// template
expr
, typename result_of::as_arg
::type> > const operator [](A const &a) const { expr
, typename result_of::as_arg
::type> > that = {{*this}, proto::as_arg(a)}; return that; } #if IS_TERMINAL /// \overload /// template
expr
, typename result_of::as_arg
::type> > const operator [](A &a) { expr
, typename result_of::as_arg
::type> > that = {{*this}, proto::as_arg(a)}; return that; } /// \overload /// template
expr
, typename result_of::as_arg
::type> > const operator [](A const &a) { expr
, typename result_of::as_arg
::type> > that = {{*this}, proto::as_arg(a)}; return that; } #endif /// Encodes the return type of \c expr\<\>::operator(), for use with \c boost::result_of\<\> /// template
struct result { typedef typename result_of::funop
::type type; }; /// Function call /// /// \return A new \c expr\<\> node representing the function invocation of \c (*this)(). expr
> > const operator ()() const { expr
> > that = {{*this}}; return that; } #if IS_TERMINAL /// \overload /// expr
> > const operator ()() { expr
> > that = {{*this}}; return that; } #endif #define BOOST_PP_ITERATION_PARAMS_2 (3, (1, BOOST_PP_DEC(BOOST_PROTO_MAX_ARITY),
)) #include BOOST_PP_ITERATE() }; #undef ARG_COUNT #undef IS_TERMINAL #elif BOOST_PP_ITERATION_DEPTH() == 2 #define N BOOST_PP_ITERATION() /// \overload /// template
typename result_of::BOOST_PP_CAT(funop, N)
::type const operator ()(BOOST_PP_ENUM_BINARY_PARAMS(N, A, const &a)) const { return result_of::BOOST_PP_CAT(funop, N)
::call(*this BOOST_PP_ENUM_TRAILING_PARAMS(N, a)); } #if IS_TERMINAL /// \overload /// template
typename result_of::BOOST_PP_CAT(funop, N)
::type const operator ()(BOOST_PP_ENUM_BINARY_PARAMS(N, A, const &a)) { return result_of::BOOST_PP_CAT(funop, N)
::call(*this BOOST_PP_ENUM_TRAILING_PARAMS(N, a)); } #endif #undef N #endif
expr.hpp
网页地址
文件地址
上一页
7/21
下一页
下载
( 15 KB )
Comments
Total ratings:
0
Average rating:
无评论
of 10
Would you like to comment?
Join now
, or
Logon
if you are already a member.