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
algorithms.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\interprocess\detail\algorithms.hpp
Girar
Efecto
Propiedad
Historial
////////////////////////////////////////////////////////////////////////////// // // (C) Copyright Ion Gaztanaga 2005-2008. // // 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/interprocess for documentation. // ////////////////////////////////////////////////////////////////////////////// #ifndef BOOST_INTERPROCESS_DETAIL_ALGORITHMS_HPP #define BOOST_INTERPROCESS_DETAIL_ALGORITHMS_HPP #if (defined _MSC_VER) && (_MSC_VER >= 1200) # pragma once #endif #include
#include
#include
#include
#include
namespace boost { namespace interprocess { template
struct has_own_construct_from_it { static const bool value = false; }; namespace detail { template
inline void construct_in_place_impl(T* dest, const InpIt &source, detail::true_) { T::construct(dest, *source); } template
inline void construct_in_place_impl(T* dest, const InpIt &source, detail::false_) { new(dest)T(*source); } } //namespace detail { template
inline void construct_in_place(T* dest, InpIt source) { typedef detail::bool_
::value> boolean_t; detail::construct_in_place_impl(dest, source, boolean_t()); } template
inline void construct_in_place(T *dest, default_construct_iterator
) { new(dest)T(); } template
InIt copy_n(InIt first, typename std::iterator_traits
::difference_type length, OutIt dest) { for (; length--; ++dest, ++first) *dest = *first; return first; } template
inline InIt n_uninitialized_copy_n (InIt first, typename std::iterator_traits
::difference_type count, FwdIt dest) { typedef typename std::iterator_traits
::value_type value_type; //Save initial destination position FwdIt dest_init = dest; typename std::iterator_traits
::difference_type new_count = count+1; BOOST_TRY{ //Try to build objects for (; --new_count; ++dest, ++first){ construct_in_place(detail::get_pointer(&*dest), first); } } BOOST_CATCH(...){ //Call destructors new_count = count - new_count; for (; new_count--; ++dest_init){ detail::get_pointer(&*dest_init)->~value_type(); } BOOST_RETHROW } BOOST_CATCH_END return first; } // uninitialized_copy_copy // Copies [first1, last1) into [result, result + (last1 - first1)), and // copies [first2, last2) into // [result + (last1 - first1), result + (last1 - first1) + (last2 - first2)). template
FwdIt uninitialized_copy_copy (InpIt1 first1, InpIt1 last1, InpIt2 first2, InpIt2 last2, FwdIt result) { typedef typename std::iterator_traits
::value_type value_type; FwdIt mid = std::uninitialized_copy(first1, last1, result); BOOST_TRY { return std::uninitialized_copy(first2, last2, mid); } BOOST_CATCH(...){ for(;result != mid; ++result){ result->~value_type(); } BOOST_RETHROW } BOOST_CATCH_END } } //namespace interprocess { } //namespace boost { #include
#endif //#ifndef BOOST_INTERPROCESS_DETAIL_ALGORITHMS_HPP
algorithms.hpp
Dirección de la página
Dirección del archivo
Anterior 1/29
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.