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
copy_map.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\multi_index\detail\copy_map.hpp
Girar
Efecto
Propiedad
Historial
/* Copyright 2003-2007 Joaqu�n M L�pez Mu�oz. * 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/multi_index for library home page. */ #ifndef BOOST_MULTI_INDEX_DETAIL_COPY_MAP_HPP #define BOOST_MULTI_INDEX_DETAIL_COPY_MAP_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include
/* keep it first to prevent nasty warns in MSVC */ #include
#include
#include
#include
#include
#include
#include
namespace boost{ namespace multi_index{ namespace detail{ /* copy_map is used as an auxiliary structure during copy_() operations. * When a container with n nodes is replicated, node_map holds the pairings * between original and copied nodes, and provides a fast way to find a * copied node from an original one. * The semantics of the class are not simple, and no attempt has been made * to enforce it: multi_index_container handles it right. On the other hand, * the const interface, which is the one provided to index implementations, * only allows for: * - Enumeration of pairs of (original,copied) nodes (excluding the headers), * - fast retrieval of copied nodes (including the headers.) */ template
struct copy_map_entry { copy_map_entry(Node* f,Node* s):first(f),second(s){} Node* first; Node* second; bool operator<(const copy_map_entry
& x)const { return std::less
()(first,x.first); } }; template
class copy_map:private noncopyable { public: typedef const copy_map_entry
* const_iterator; copy_map( const Allocator& al,std::size_t size,Node* header_org,Node* header_cpy): al_(al),size_(size),spc(al_,size_),n(0), header_org_(header_org),header_cpy_(header_cpy),released(false) {} ~copy_map() { if(!released){ for(std::size_t i=0;i
second->value()); deallocate((spc.data()+i)->second); } } } const_iterator begin()const{return &*spc.data();} const_iterator end()const{return &*(spc.data()+n);} void clone(Node* node) { (spc.data()+n)->first=node; (spc.data()+n)->second=&*al_.allocate(1); BOOST_TRY{ boost::detail::allocator::construct( &(spc.data()+n)->second->value(),node->value()); } BOOST_CATCH(...){ deallocate((spc.data()+n)->second); BOOST_RETHROW; } BOOST_CATCH_END ++n; if(n==size_)std::sort(&*spc.data(),&*spc.data()+size_); } Node* find(Node* node)const { if(node==header_org_)return header_cpy_; return std::lower_bound( begin(),end(),copy_map_entry
(node,0))->second; } void release() { released=true; } private: typedef typename prevent_eti< Allocator, typename boost::detail::allocator::rebind_to< Allocator,Node>::type >::type allocator_type; typedef typename allocator_type::pointer allocator_pointer; allocator_type al_; std::size_t size_; auto_space
,Allocator> spc; std::size_t n; Node* header_org_; Node* header_cpy_; bool released; void deallocate(Node* node) { al_.deallocate(static_cast
(node),1); } }; } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif
copy_map.hpp
Dirección de la página
Dirección del archivo
Anterior
9/44
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.