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
rnd_index_ops.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\rnd_index_ops.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_RND_INDEX_OPS_HPP #define BOOST_MULTI_INDEX_DETAIL_RND_INDEX_OPS_HPP #if defined(_MSC_VER)&&(_MSC_VER>=1200) #pragma once #endif #include
/* keep it first to prevent nasty warns in MSVC */ #include
#include
#include
namespace boost{ namespace multi_index{ namespace detail{ /* Common code for random_access_index memfuns having templatized and * non-templatized versions. */ template
Node* random_access_index_remove( random_access_index_ptr_array
& ptrs,Predicate pred BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(Node)) { typedef typename Node::value_type value_type; typedef typename Node::impl_ptr_pointer impl_ptr_pointer; impl_ptr_pointer first=ptrs.begin(), res=first, last=ptrs.end(); for(;first!=last;++first){ if(!pred( const_cast
(Node::from_impl(*first)->value()))){ if(first!=res){ std::swap(*first,*res); (*first)->up()=first; (*res)->up()=res; } ++res; } } return Node::from_impl(*res); } template
Node* random_access_index_unique( random_access_index_ptr_array
& ptrs,BinaryPredicate binary_pred BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(Node)) { typedef typename Node::value_type value_type; typedef typename Node::impl_ptr_pointer impl_ptr_pointer; impl_ptr_pointer first=ptrs.begin(), res=first, last=ptrs.end(); if(first!=last){ for(;++first!=last;){ if(!binary_pred( const_cast
(Node::from_impl(*res)->value()), const_cast
(Node::from_impl(*first)->value()))){ ++res; if(first!=res){ std::swap(*first,*res); (*first)->up()=first; (*res)->up()=res; } } } ++res; } return Node::from_impl(*res); } template
void random_access_index_inplace_merge( const Allocator& al, random_access_index_ptr_array
& ptrs, BOOST_DEDUCED_TYPENAME Node::impl_ptr_pointer first1,Compare comp BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(Node)) { typedef typename Node::value_type value_type; typedef typename Node::impl_pointer impl_pointer; typedef typename Node::impl_ptr_pointer impl_ptr_pointer; auto_space
spc(al,ptrs.size()); impl_ptr_pointer first0=ptrs.begin(), last0=first1, last1=ptrs.end(), out=spc.data(); while(first0!=last0&&first1!=last1){ if(comp( const_cast
(Node::from_impl(*first1)->value()), const_cast
(Node::from_impl(*first0)->value()))){ *out++=*first1++; } else{ *out++=*first0++; } } std::copy(&*first0,&*last0,&*out); std::copy(&*first1,&*last1,&*out); first1=ptrs.begin(); out=spc.data(); while(first1!=last1){ *first1=*out++; (*first1)->up()=first1; ++first1; } } /* sorting */ /* auxiliary stuff */ template
struct random_access_index_sort_compare: std::binary_function< typename Node::impl_pointer, typename Node::impl_pointer,bool> { random_access_index_sort_compare(Compare comp_=Compare()):comp(comp_){} bool operator()( typename Node::impl_pointer x,typename Node::impl_pointer y)const { typedef typename Node::value_type value_type; return comp( const_cast
(Node::from_impl(x)->value()), const_cast
(Node::from_impl(y)->value())); } private: Compare comp; }; template
void random_access_index_sort( const Allocator& al, random_access_index_ptr_array
& ptrs, Compare comp BOOST_APPEND_EXPLICIT_TEMPLATE_TYPE(Node)) { /* The implementation is extremely simple: an auxiliary * array of pointers is sorted using stdlib facilities and * then used to rearrange the index. This is suboptimal * in space and time, but has some advantages over other * possible approaches: * - Use std::stable_sort() directly on ptrs using some * special iterator in charge of maintaining pointers * and up() pointers in sync: we cannot guarantee * preservation of the container invariants in the face of * exceptions, if, for instance, std::stable_sort throws * when ptrs transitorily contains duplicate elements. * - Rewrite the internal algorithms of std::stable_sort * adapted for this case: besides being a fair amount of * work, making a stable sort compatible with Boost.MultiIndex * invariants (basically, no duplicates or missing elements * even if an exception is thrown) is complicated, error-prone * and possibly won't perform much better than the * solution adopted. */ typedef typename Node::value_type value_type; typedef typename Node::impl_pointer impl_pointer; typedef typename Node::impl_ptr_pointer impl_ptr_pointer; typedef random_access_index_sort_compare< Node,Compare> ptr_compare; impl_ptr_pointer first=ptrs.begin(); impl_ptr_pointer last=ptrs.end(); auto_space< impl_pointer, Allocator> spc(al,ptrs.size()); impl_ptr_pointer buf=spc.data(); std::copy(&*first,&*last,&*buf); std::stable_sort(&*buf,&*buf+ptrs.size(),ptr_compare(comp)); while(first!=last){ *first=*buf++; (*first)->up()=first; ++first; } } } /* namespace multi_index::detail */ } /* namespace multi_index */ } /* namespace boost */ #endif
rnd_index_ops.hpp
Dirección de la página
Dirección del archivo
Anterior
34/44
Siguiente
Descargar
( 6 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.