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
bucket_sort.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\graph\planar_detail\bucket_sort.hpp
Girar
Efecto
Propiedad
Historial
//======================================================================= // Copyright 2007 Aaron Windsor // // 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 __BUCKET_SORT_HPP__ #define __BUCKET_SORT_HPP__ #include
#include
#include
namespace boost { template
struct rank_comparison { rank_comparison(ItemToRankMap arg_itrm) : itrm(arg_itrm) {} template
bool operator() (Item x, Item y) const { return get(itrm, x) < get(itrm, y); } private: ItemToRankMap itrm; }; template
struct property_map_tuple_adaptor : public put_get_helper< typename PropertyMapWrapper::value_type, property_map_tuple_adaptor
> { typedef typename PropertyMapWrapper::reference reference; typedef typename PropertyMapWrapper::value_type value_type; typedef TupleType key_type; typedef readable_property_map_tag category; property_map_tuple_adaptor() {} property_map_tuple_adaptor(PropertyMapWrapper wrapper_map) : m_wrapper_map(wrapper_map) {} inline value_type operator[](const key_type& x) const { return get(m_wrapper_map, get
(x)); } static const int n = N; PropertyMapWrapper m_wrapper_map; }; // This function sorts a sequence of n items by their ranks in linear time, // given that all ranks are in the range [0, range). This sort is stable. template
void bucket_sort(ForwardIterator begin, ForwardIterator end, ItemToRankMap rank, SizeType range = 0) { #ifdef BOOST_GRAPH_PREFER_STD_LIB std::stable_sort(begin, end, rank_comparison
(rank)); #else typedef std::vector < typename boost::property_traits
::key_type > vector_of_values_t; typedef std::vector< vector_of_values_t > vector_of_vectors_t; if (!range) { rank_comparison
cmp(rank); ForwardIterator max_by_rank = std::max_element(begin, end, cmp); if (max_by_rank == end) return; range = get(rank, *max_by_rank) + 1; } vector_of_vectors_t temp_values(range); for(ForwardIterator itr = begin; itr != end; ++itr) { temp_values[get(rank, *itr)].push_back(*itr); } ForwardIterator orig_seq_itr = begin; typename vector_of_vectors_t::iterator itr_end = temp_values.end(); for(typename vector_of_vectors_t::iterator itr = temp_values.begin(); itr != itr_end; ++itr ) { typename vector_of_values_t::iterator jtr_end = itr->end(); for(typename vector_of_values_t::iterator jtr = itr->begin(); jtr != jtr_end; ++jtr ) { *orig_seq_itr = *jtr; ++orig_seq_itr; } } #endif } template
void bucket_sort(ForwardIterator begin, ForwardIterator end, ItemToRankMap rank) { bucket_sort(begin, end, rank, 0); } template
void bucket_sort(ForwardIterator begin, ForwardIterator end ) { bucket_sort(begin, end, identity_property_map()); } } //namespace boost #endif //__BUCKET_SORT_HPP__
bucket_sort.hpp
Dirección de la página
Dirección del archivo
Anterior
3/5
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.