x
Yes
No
Do you want to visit DriveHQ English website?
Inicio
Características
Precios
Prueba gratuita
Software cliente
Acerca de nosotros
Servidor de archivos
|
Solución de copias de seguridad
|
Servidor FTP
|
Servidor de correo electrónico
|
Alojamiento web
|
Software cliente
Servidor de archivos
Solución de copia de seguridad
Servidor FTP
Servidor de correo electrónico
Alojamiento web
Software cliente
result.hpp - Hosted on DriveHQ Cloud IT Platform
Arriba
Subir
Descargar
Compartir
Publicar
Nueva carpeta
Nuevo archivo
Copiar
Cortar
Eliminar
Pegar
Clasificación
Actualizar
Ruta de la carpeta: \\game3dprogramming\materials\GameFactory\GameFactoryDemo\references\boost_1_35_0\boost\python\detail\result.hpp
Girar
Efecto
Propiedad
Historial
#if !defined(BOOST_PP_IS_ITERATING) // Copyright David Abrahams 2002. // 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 RESULT_DWA2002521_HPP # define RESULT_DWA2002521_HPP # include
# include
# include
# include
# include
# include
# include
# include
# include
namespace boost { namespace python { namespace detail { // Defines a family of overloaded function which, given x, a function // pointer, member [function] pointer, or an AdaptableFunction object, // returns a pointer to type
*, where R is the result type of // invoking the result of bind(x). // // In order to work around bugs in deficient compilers, if x might be // an AdaptableFunction object, you must pass OL as a second argument // to get this to work portably. # define BOOST_PP_ITERATION_PARAMS_1 \ (4, (0, BOOST_PYTHON_MAX_ARITY,
, BOOST_PYTHON_FUNCTION_POINTER)) # include BOOST_PP_ITERATE() # define BOOST_PP_ITERATION_PARAMS_1 \ (4, (0, BOOST_PYTHON_CV_COUNT - 1,
, BOOST_PYTHON_POINTER_TO_MEMBER)) # include BOOST_PP_ITERATE() template
boost::type
* result(R (T::*), int = 0) { return 0; } # if (defined(BOOST_MSVC) && _MSC_FULL_VER <= 13102140) \ || (defined(__GNUC__) && __GNUC__ < 3) \ || (defined(__MWERKS__) && __MWERKS__ < 0x3000) // This code actually works on all implementations, but why use it when we don't have to? template
struct get_result_type { typedef boost::type
type; }; struct void_type { typedef void type; }; template
struct result_result { typedef typename mpl::if_c< is_class
::value , get_result_type
, void_type >::type t1; typedef typename t1::type* type; }; template
typename result_result
::type result(X const&, short) { return 0; } # else // Simpler code for more-capable compilers template
boost::type
* result(X const&, short = 0) { return 0; } # endif }}} // namespace boost::python::detail # endif // RESULT_DWA2002521_HPP /* --------------- function pointers --------------- */ #elif BOOST_PP_ITERATION_DEPTH() == 1 && BOOST_PP_ITERATION_FLAGS() == BOOST_PYTHON_FUNCTION_POINTER # if !(BOOST_WORKAROUND(__MWERKS__, > 0x3100) \ && BOOST_WORKAROUND(__MWERKS__, BOOST_TESTED_AT(0x3201))) # line BOOST_PP_LINE(__LINE__, result.hpp(function pointers)) # endif # define N BOOST_PP_ITERATION() template
boost::type
* result(R (*)(BOOST_PP_ENUM_PARAMS_Z(1, N, A)), int = 0) { return 0; } # undef N /* --------------- pointers-to-members --------------- */ #elif BOOST_PP_ITERATION_DEPTH() == 1 && BOOST_PP_ITERATION_FLAGS() == BOOST_PYTHON_POINTER_TO_MEMBER // Outer over cv-qualifiers # define BOOST_PP_ITERATION_PARAMS_2 (3, (0, BOOST_PYTHON_MAX_ARITY,
)) # include BOOST_PP_ITERATE() #elif BOOST_PP_ITERATION_DEPTH() == 2 # if !(BOOST_WORKAROUND(__MWERKS__, > 0x3100) \ && BOOST_WORKAROUND(__MWERKS__, BOOST_TESTED_AT(0x3201))) # line BOOST_PP_LINE(__LINE__, result.hpp(pointers-to-members)) # endif // Inner over arities # define N BOOST_PP_ITERATION() # define Q BOOST_PYTHON_CV_QUALIFIER(BOOST_PP_RELATIVE_ITERATION(1)) template
boost::type
* result(R (T::*)(BOOST_PP_ENUM_PARAMS_Z(1, N, A)) Q, int = 0) { return 0; } # undef N # undef Q #endif
result.hpp
Dirección de la página
Dirección del archivo
Anterior
46/65
Siguiente
Descargar
( 4 KB )
Comments
Total ratings:
0
Average rating:
No clasificado
of 10
Would you like to comment?
Join now
, or
Logon
if you are already a member.