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
join.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\algorithm\string\join.hpp
Girar
Efecto
Propiedad
Historial
// Boost string_algo library join.hpp header file ---------------------------// // Copyright Pavol Droba 2002-2006. // // 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/ for updates, documentation, and revision history. #ifndef BOOST_STRING_JOIN_HPP #define BOOST_STRING_JOIN_HPP #include
#include
#include
#include
/*! \file Defines join algorithm. Join algorithm is a counterpart to split algorithms. It joins strings from a 'list' by adding user defined separator. Additionally there is a version that allows simple filtering by providing a predicate. */ namespace boost { namespace algorithm { // join --------------------------------------------------------------// //! Join algorithm /*! This algorithm joins all strings in a 'list' into one long string. Segments are concatenated by given separator. \param Input A container that holds the input strings. It must be a container-of-containers. \param Separator A string that will separate the joined segments. \return Concatenated string. \note This function provides the strong exception-safety guarantee */ template< typename SequenceSequenceT, typename Range1T> inline typename range_value
::type join( const SequenceSequenceT& Input, const Range1T& Separator) { // Define working types typedef typename range_value
::type ResultT; typedef typename range_const_iterator
::type InputIteratorT; // Parse input InputIteratorT itBegin=begin(Input); InputIteratorT itEnd=end(Input); // Construct container to hold the result ResultT Result; // Append first element if(itBegin!=itEnd) { detail::insert(Result, end(Result), *itBegin); ++itBegin; } for(;itBegin!=itEnd; ++itBegin) { // Add separator detail::insert(Result, end(Result), as_literal(Separator)); // Add element detail::insert(Result, end(Result), *itBegin); } return Result; } // join_if ----------------------------------------------------------// //! Conditional join algorithm /*! This algorithm joins all strings in a 'list' into one long string. Segments are concatenated by given separator. Only segments that satisfy the predicate will be added to the result. \param Input A container that holds the input strings. It must be a container-of-containers. \param Separator A string that will separate the joined segments. \param Pred A segment selection predicate \return Concatenated string. \note This function provides the strong exception-safety guarantee */ template< typename SequenceSequenceT, typename Range1T, typename PredicateT> inline typename range_value
::type join_if( const SequenceSequenceT& Input, const Range1T& Separator, PredicateT Pred) { // Define working types typedef typename range_value
::type ResultT; typedef typename range_const_iterator
::type InputIteratorT; // Parse input InputIteratorT itBegin=begin(Input); InputIteratorT itEnd=end(Input); // Construct container to hold the result ResultT Result; // Roll to the first element that will be added while(itBegin!=itEnd && !Pred(*itBegin)) ++itBegin; // Add this element if(itBegin!=itEnd) { detail::insert(Result, end(Result), *itBegin); ++itBegin; } for(;itBegin!=itEnd; ++itBegin) { if(Pred(*itBegin)) { // Add separator detail::insert(Result, end(Result), as_literal(Separator)); // Add element detail::insert(Result, end(Result), *itBegin); } } return Result; } } // namespace algorithm // pull names to the boost namespace using algorithm::join; using algorithm::join_if; } // namespace boost #endif // BOOST_STRING_JOIN_HPP
join.hpp
Dirección de la página
Dirección del archivo
Anterior
14/24
Siguiente
Descargar
( 4 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.