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
vector_map_view.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\bimap\views\vector_map_view.hpp
Girar
Efecto
Propiedad
Historial
// Boost.Bimap // // Copyright (c) 2006-2007 Matias Capeletto // // 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) /// \file views/vector_map_view.hpp /// \brief View of a side of a bimap. #ifndef BOOST_BIMAP_VIEWS_VECTOR_MAP_VIEW_HPP #define BOOST_BIMAP_VIEWS_VECTOR_MAP_VIEW_HPP #if defined(_MSC_VER) && (_MSC_VER>=1200) #pragma once #endif #include
#include
#include
#include
#include
namespace boost { namespace bimaps { namespace views { /// \brief View of a side of a bimap. /** This class uses container_adaptor and iterator_adaptor to wrapped a index of the multi_index bimap core. See also const_map_view. **/ template< class Tag, class BimapType > class vector_map_view : public BOOST_BIMAP_MAP_VIEW_CONTAINER_ADAPTOR( vector_map_adaptor, Tag,BimapType, reverse_iterator_type_by, const_reverse_iterator_type_by ), public ::boost::bimaps::detail:: map_view_base< vector_map_view
,Tag,BimapType > { typedef BOOST_BIMAP_MAP_VIEW_CONTAINER_ADAPTOR( vector_map_adaptor, Tag,BimapType, reverse_iterator_type_by, const_reverse_iterator_type_by ) base_; BOOST_BIMAP_MAP_VIEW_BASE_FRIEND(vector_map_view,Tag,BimapType) typedef BOOST_DEDUCED_TYPENAME ::boost::bimaps::relation::support::data_extractor < Tag, BOOST_DEDUCED_TYPENAME BimapType::relation >::type key_from_base_value; public: typedef BOOST_DEDUCED_TYPENAME base_::value_type::info_type info_type; vector_map_view(BOOST_DEDUCED_TYPENAME base_::base_type & c) : base_(c) {} vector_map_view & operator=(const vector_map_view & v) { this->base() = v.base(); return *this; } BOOST_BIMAP_VIEW_ASSIGN_IMPLEMENTATION(base_) BOOST_BIMAP_VIEW_FRONT_BACK_IMPLEMENTATION(base_) // Lists operations void splice(BOOST_DEDUCED_TYPENAME base_::iterator position, vector_map_view & x) { this->base().splice( this->template functor< BOOST_DEDUCED_TYPENAME base_::iterator_to_base>()(position), x.base() ); } void splice(BOOST_DEDUCED_TYPENAME base_::iterator position, vector_map_view & x, BOOST_DEDUCED_TYPENAME base_::iterator i) { this->base().splice( this->template functor< BOOST_DEDUCED_TYPENAME base_::iterator_to_base>()(position), x.base(), this->template functor< BOOST_DEDUCED_TYPENAME base_::iterator_to_base>()(i) ); } void splice(BOOST_DEDUCED_TYPENAME base_::iterator position, vector_map_view & x, BOOST_DEDUCED_TYPENAME base_::iterator first, BOOST_DEDUCED_TYPENAME base_::iterator last) { this->base().splice( this->template functor< BOOST_DEDUCED_TYPENAME base_::iterator_to_base>()(position), x.base(), this->template functor< BOOST_DEDUCED_TYPENAME base_::iterator_to_base>()(first), this->template functor< BOOST_DEDUCED_TYPENAME base_::iterator_to_base>()(last) ); } void remove(BOOST_DEDUCED_TYPENAME ::boost::call_traits< BOOST_DEDUCED_TYPENAME base_::value_type >::param_type value) { this->base().remove( this->template functor< BOOST_DEDUCED_TYPENAME base_::value_to_base>()(value) ); } template< class Predicate > void remove_if(Predicate pred) { this->base().remove_if( ::boost::bimaps::container_adaptor::detail::unary_check_adaptor < Predicate, BOOST_DEDUCED_TYPENAME base_::base_type::value_type, key_from_base_value >( pred, key_from_base_value() ) ); } void unique() { this->base().unique( ::boost::bimaps::container_adaptor::detail::comparison_adaptor < std::equal_to
, BOOST_DEDUCED_TYPENAME base_::base_type::value_type, key_from_base_value >(std::equal_to
(), key_from_base_value() ) ); } template< class BinaryPredicate > void unique(BinaryPredicate binary_pred) { this->base().unique( ::boost::bimaps::container_adaptor::detail::comparison_adaptor < BinaryPredicate, BOOST_DEDUCED_TYPENAME base_::base_type::value_type, key_from_base_value >( binary_pred, key_from_base_value() ) ); } void merge(vector_map_view & x) { this->base().merge(x.base(), ::boost::bimaps::container_adaptor::detail::comparison_adaptor < std::less
, BOOST_DEDUCED_TYPENAME base_::base_type::value_type, key_from_base_value >( std::less
(), key_from_base_value() ) ); } template< class Compare > void merge(vector_map_view & x, Compare comp) { this->base().merge(x.base(), ::boost::bimaps::container_adaptor::detail::comparison_adaptor < Compare, BOOST_DEDUCED_TYPENAME base_::base_type::value_type, key_from_base_value >( comp, key_from_base_value() ) ); } void sort() { this->base().sort( ::boost::bimaps::container_adaptor::detail::comparison_adaptor < std::less
, BOOST_DEDUCED_TYPENAME base_::base_type::value_type, key_from_base_value >( std::less
(), key_from_base_value() ) ); } template< class Compare > void sort(Compare comp) { this->base().sort( ::boost::bimaps::container_adaptor::detail::comparison_adaptor < Compare, BOOST_DEDUCED_TYPENAME base_::base_type::value_type, key_from_base_value >( comp, key_from_base_value() ) ); } void reverse() { this->base().reverse(); } // Rearrange Operations void relocate(BOOST_DEDUCED_TYPENAME base_::iterator position, BOOST_DEDUCED_TYPENAME base_::iterator i) { this->base().relocate( this->template functor< BOOST_DEDUCED_TYPENAME base_::iterator_to_base>()(position), this->template functor< BOOST_DEDUCED_TYPENAME base_::iterator_to_base>()(i) ); } void relocate(BOOST_DEDUCED_TYPENAME base_::iterator position, BOOST_DEDUCED_TYPENAME base_::iterator first, BOOST_DEDUCED_TYPENAME base_::iterator last) { this->base().relocate( this->template functor< BOOST_DEDUCED_TYPENAME base_::iterator_to_base>()(position), this->template functor< BOOST_DEDUCED_TYPENAME base_::iterator_to_base>()(first), this->template functor< BOOST_DEDUCED_TYPENAME base_::iterator_to_base>()(last) ); } }; } // namespace views /*===========================================================================*/ #define BOOST_BIMAP_MAP_VIEW_EXTRA_TYPEDEF(MAP_VIEW,SIDE,TYPENAME) \ typedef BOOST_DEDUCED_TYPENAME MAP_VIEW::TYPENAME \ BOOST_PP_CAT(SIDE,BOOST_PP_CAT(_,TYPENAME)); /*===========================================================================*/ /*===========================================================================*/ #define BOOST_BIMAP_MAP_VIEW_EXTRA_TYPEDEFS_BODY(MAP_VIEW,SIDE) \ BOOST_BIMAP_MAP_VIEW_EXTRA_TYPEDEF(MAP_VIEW,SIDE,reverse_iterator) \ BOOST_BIMAP_MAP_VIEW_EXTRA_TYPEDEF(MAP_VIEW,SIDE,const_reverse_iterator) \ /*===========================================================================*/ namespace detail { template< class Tag, class BimapType > struct left_map_view_extra_typedefs< ::boost::bimaps::views::vector_map_view
> { private: typedef ::boost::bimaps::views::vector_map_view
map_view_; public : BOOST_BIMAP_MAP_VIEW_EXTRA_TYPEDEFS_BODY(map_view_,left) }; template< class Tag, class BimapType > struct right_map_view_extra_typedefs< ::boost::bimaps::views::vector_map_view
> { private: typedef ::boost::bimaps::views::vector_map_view
map_view_; public : BOOST_BIMAP_MAP_VIEW_EXTRA_TYPEDEFS_BODY(map_view_,right) }; } // namespace detail /*===========================================================================*/ #undef BOOST_BIMAP_MAP_VIEW_EXTRA_TYPEDEF #undef BOOST_BIMAP_MAP_VIEW_EXTRA_TYPEDEFS_BODY /*===========================================================================*/ } // namespace bimaps } // namespace boost #endif // BOOST_BIMAP_VIEWS_VECTOR_MAP_VIEW_HPP
vector_map_view.hpp
Dirección de la página
Dirección del archivo
Anterior
13/14
Siguiente
Descargar
( 9 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.