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
item.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\mpl\map\aux_\item.hpp
Girar
Efecto
Propiedad
Historial
#ifndef BOOST_MPL_MAP_AUX_ITEM_HPP_INCLUDED #define BOOST_MPL_MAP_AUX_ITEM_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2003-2004 // Copyright David Abrahams 2003-2004 // // 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) // // See http://www.boost.org/libs/mpl for documentation. // $Source$ // $Date: 2004-12-14 09:05:33 -0500 (Tue, 14 Dec 2004) $ // $Revision: 26498 $ #include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
namespace boost { namespace mpl { #if defined(BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES) template< typename Key, typename T, typename Base > struct m_item : Base { typedef Key key_; typedef pair
item; typedef Base base; typedef typename next< typename Base::size >::type size; typedef typename next< typename Base::order >::type order; #if defined(BOOST_MPL_CFG_NO_DEPENDENT_ARRAY_TYPES) typedef typename aux::weighted_tag
::type order_tag_; #else typedef char (&order_tag_)[BOOST_MPL_AUX_MSVC_VALUE_WKND(order)::value]; #endif BOOST_MPL_AUX_MAP_OVERLOAD( aux::type_wrapper
, VALUE_BY_KEY, m_item, aux::type_wrapper
* ); BOOST_MPL_AUX_MAP_OVERLOAD( aux::type_wrapper
, ITEM_BY_ORDER, m_item, order* ); BOOST_MPL_AUX_MAP_OVERLOAD( order_tag_, ORDER_BY_KEY, m_item, aux::type_wrapper
* ); }; template< typename Key, typename Base > struct m_mask : Base { typedef void_ key_; typedef Base base; typedef typename prior< typename Base::size >::type size; typedef typename x_order_impl
::type key_order_; BOOST_MPL_AUX_MAP_OVERLOAD( aux::type_wrapper
, VALUE_BY_KEY, m_mask, aux::type_wrapper
* ); BOOST_MPL_AUX_MAP_OVERLOAD( aux::type_wrapper
, ITEM_BY_ORDER, m_mask, key_order_* ); }; #else // BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES # if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION) template< long n, typename Key, typename T, typename Base > struct m_item; # else template< long n > struct m_item_impl { template< typename Key, typename T, typename Base > struct result_; }; template< long n, typename Key, typename T, typename Base > struct m_item : m_item_impl
::result_
{ }; # endif template< typename Key, typename T, typename Base > struct m_item_ : Base { typedef Key key_; typedef Base base; typedef m_item_ type; typedef typename next< typename Base::size >::type size; typedef typename next< typename Base::order >::type order; #if defined(BOOST_MPL_CFG_NO_DEPENDENT_ARRAY_TYPES) typedef typename aux::weighted_tag
::type order_tag_; #else typedef char (&order_tag_)[BOOST_MPL_AUX_MSVC_VALUE_WKND(order)::value]; #endif BOOST_MPL_AUX_MAP_OVERLOAD( order_tag_, ORDER_BY_KEY, m_item_, aux::type_wrapper
* ); }; template< typename Key, typename Base > struct m_mask : Base { typedef void_ key_; typedef Base base; typedef typename prior< typename Base::size >::type size; typedef typename x_order_impl
::type key_order_; BOOST_MPL_AUX_MAP_OVERLOAD( aux::no_tag, ORDER_BY_KEY, m_mask, aux::type_wrapper
* ); BOOST_MPL_AUX_MAP_OVERLOAD( aux::yes_tag, IS_MASKED, m_mask, key_order_* ); }; #endif // BOOST_MPL_CFG_TYPEOF_BASED_SEQUENCES }} #endif // BOOST_MPL_MAP_AUX_ITEM_HPP_INCLUDED
item.hpp
Dirección de la página
Dirección del archivo
Anterior
11/18
Siguiente
Descargar
( 3 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.