FM / string

/usr/include/boost/algorithm/string

Name	Size	Mode	Actions
detail/	-	0755	rm
std/	-	0755	rm
case_conv.hpp	6169	0644	edit dl rm
classification.hpp	11642	0644	edit dl rm
compare.hpp	6391	0644	edit dl rm
concept.hpp	2344	0644	edit dl rm
config.hpp	790	0644	edit dl rm
constants.hpp	999	0644	edit dl rm
erase.hpp	31813	0644	edit dl rm
find.hpp	13071	0644	edit dl rm
finder.hpp	9386	0644	edit dl rm
find_format.hpp	10243	0644	edit dl rm
find_iterator.hpp	12209	0644	edit dl rm
formatter.hpp	4223	0644	edit dl rm
iter_find.hpp	7513	0644	edit dl rm
join.hpp	5046	0644	edit dl rm
predicate.hpp	17359	0644	edit dl rm
predicate_facade.hpp	1322	0644	edit dl rm
regex.hpp	24966	0644	edit dl rm
regex_find_format.hpp	3204	0644	edit dl rm
replace.hpp	35947	0644	edit dl rm
sequence_traits.hpp	3892	0644	edit dl rm
split.hpp	6838	0644	edit dl rm
std_containers_traits.hpp	836	0644	edit dl rm
trim.hpp	14189	0644	edit dl rm
trim_all.hpp	8213	0644	edit dl rm
yes_no_type.hpp	999	0644	edit dl rm

Edit: /usr/include/boost/algorithm/string/join.hpp (5046B)

//  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 <boost/algorithm/string/config.hpp>
#include <boost/algorithm/string/detail/sequence.hpp>
#include <boost/range/value_type.hpp>
#include <boost/range/as_literal.hpp>

/*! \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<SequenceSequenceT>::type 
        join(
            const SequenceSequenceT& Input,
            const Range1T& Separator)
        {
            // Define working types
            typedef typename range_value<SequenceSequenceT>::type ResultT;
            typedef typename range_const_iterator<SequenceSequenceT>::type InputIteratorT;

// Parse input
            InputIteratorT itBegin=::boost::begin(Input);
            InputIteratorT itEnd=::boost::end(Input);

// Construct container to hold the result
            ResultT Result;
            
            // Append first element
            if(itBegin!=itEnd)
            {
                detail::insert(Result, ::boost::end(Result), *itBegin);
                ++itBegin;
            }

for(;itBegin!=itEnd; ++itBegin)
            {
                // Add separator
                detail::insert(Result, ::boost::end(Result), ::boost::as_literal(Separator));
                // Add element
                detail::insert(Result, ::boost::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<SequenceSequenceT>::type 
        join_if(
            const SequenceSequenceT& Input,
            const Range1T& Separator,
            PredicateT Pred)
        {
            // Define working types
            typedef typename range_value<SequenceSequenceT>::type ResultT;
            typedef typename range_const_iterator<SequenceSequenceT>::type InputIteratorT;

// Parse input
            InputIteratorT itBegin=::boost::begin(Input);
            InputIteratorT itEnd=::boost::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, ::boost::end(Result), *itBegin);
                ++itBegin;
            }

for(;itBegin!=itEnd; ++itBegin)
            {
                if(Pred(*itBegin))
                {
                    // Add separator
                    detail::insert(Result, ::boost::end(Result), ::boost::as_literal(Separator));
                    // Add element
                    detail::insert(Result, ::boost::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

cmd: