123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926 |
- // Boost string_algo library replace.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_REPLACE_HPP
- #define BOOST_STRING_REPLACE_HPP
- #include <boost/algorithm/string/config.hpp>
- #include <boost/range/iterator_range_core.hpp>
- #include <boost/range/begin.hpp>
- #include <boost/range/end.hpp>
- #include <boost/range/iterator.hpp>
- #include <boost/range/const_iterator.hpp>
- #include <boost/algorithm/string/find_format.hpp>
- #include <boost/algorithm/string/finder.hpp>
- #include <boost/algorithm/string/formatter.hpp>
- #include <boost/algorithm/string/compare.hpp>
- /*! \file
- Defines various replace algorithms. Each algorithm replaces
- part(s) of the input according to set of searching and replace criteria.
- */
- namespace boost {
- namespace algorithm {
- // replace_range --------------------------------------------------------------------//
- //! Replace range algorithm
- /*!
- Replace the given range in the input string.
- The result is a modified copy of the input. It is returned as a sequence
- or copied to the output iterator.
-
- \param Output An output iterator to which the result will be copied
- \param Input An input string
- \param SearchRange A range in the input to be substituted
- \param Format A substitute string
- \return An output iterator pointing just after the last inserted character or
- a modified copy of the input
- \note The second variant of this function provides the strong exception-safety guarantee
- */
- template<
- typename OutputIteratorT,
- typename Range1T,
- typename Range2T>
- inline OutputIteratorT replace_range_copy(
- OutputIteratorT Output,
- const Range1T& Input,
- const iterator_range<
- BOOST_STRING_TYPENAME
- range_const_iterator<Range1T>::type>& SearchRange,
- const Range2T& Format)
- {
- return ::boost::algorithm::find_format_copy(
- Output,
- Input,
- ::boost::algorithm::range_finder(SearchRange),
- ::boost::algorithm::const_formatter(Format));
- }
- //! Replace range algorithm
- /*!
- \overload
- */
- template<typename SequenceT, typename RangeT>
- inline SequenceT replace_range_copy(
- const SequenceT& Input,
- const iterator_range<
- BOOST_STRING_TYPENAME
- range_const_iterator<SequenceT>::type>& SearchRange,
- const RangeT& Format)
- {
- return ::boost::algorithm::find_format_copy(
- Input,
- ::boost::algorithm::range_finder(SearchRange),
- ::boost::algorithm::const_formatter(Format));
- }
- //! Replace range algorithm
- /*!
- Replace the given range in the input string.
- The input sequence is modified in-place.
- \param Input An input string
- \param SearchRange A range in the input to be substituted
- \param Format A substitute string
- */
- template<typename SequenceT, typename RangeT>
- inline void replace_range(
- SequenceT& Input,
- const iterator_range<
- BOOST_STRING_TYPENAME
- range_iterator<SequenceT>::type>& SearchRange,
- const RangeT& Format)
- {
- ::boost::algorithm::find_format(
- Input,
- ::boost::algorithm::range_finder(SearchRange),
- ::boost::algorithm::const_formatter(Format));
- }
- // replace_first --------------------------------------------------------------------//
- //! Replace first algorithm
- /*!
- Replace the first match of the search substring in the input
- with the format string.
- The result is a modified copy of the input. It is returned as a sequence
- or copied to the output iterator.
-
- \param Output An output iterator to which the result will be copied
- \param Input An input string
- \param Search A substring to be searched for
- \param Format A substitute string
- \return An output iterator pointing just after the last inserted character or
- a modified copy of the input
- \note The second variant of this function provides the strong exception-safety guarantee
- */
- template<
- typename OutputIteratorT,
- typename Range1T,
- typename Range2T,
- typename Range3T>
- inline OutputIteratorT replace_first_copy(
- OutputIteratorT Output,
- const Range1T& Input,
- const Range2T& Search,
- const Range3T& Format)
- {
- return ::boost::algorithm::find_format_copy(
- Output,
- Input,
- ::boost::algorithm::first_finder(Search),
- ::boost::algorithm::const_formatter(Format) );
- }
- //! Replace first algorithm
- /*!
- \overload
- */
- template<typename SequenceT, typename Range1T, typename Range2T>
- inline SequenceT replace_first_copy(
- const SequenceT& Input,
- const Range1T& Search,
- const Range2T& Format )
- {
- return ::boost::algorithm::find_format_copy(
- Input,
- ::boost::algorithm::first_finder(Search),
- ::boost::algorithm::const_formatter(Format) );
- }
- //! Replace first algorithm
- /*!
- replace the first match of the search substring in the input
- with the format string. The input sequence is modified in-place.
- \param Input An input string
- \param Search A substring to be searched for
- \param Format A substitute string
- */
- template<typename SequenceT, typename Range1T, typename Range2T>
- inline void replace_first(
- SequenceT& Input,
- const Range1T& Search,
- const Range2T& Format )
- {
- ::boost::algorithm::find_format(
- Input,
- ::boost::algorithm::first_finder(Search),
- ::boost::algorithm::const_formatter(Format) );
- }
- // replace_first ( case insensitive ) ---------------------------------------------//
- //! Replace first algorithm ( case insensitive )
- /*!
- Replace the first match of the search substring in the input
- with the format string.
- The result is a modified copy of the input. It is returned as a sequence
- or copied to the output iterator.
- Searching is case insensitive.
- \param Output An output iterator to which the result will be copied
- \param Input An input string
- \param Search A substring to be searched for
- \param Format A substitute string
- \param Loc A locale used for case insensitive comparison
- \return An output iterator pointing just after the last inserted character or
- a modified copy of the input
- \note The second variant of this function provides the strong exception-safety guarantee
- */
- template<
- typename OutputIteratorT,
- typename Range1T,
- typename Range2T,
- typename Range3T>
- inline OutputIteratorT ireplace_first_copy(
- OutputIteratorT Output,
- const Range1T& Input,
- const Range2T& Search,
- const Range3T& Format,
- const std::locale& Loc=std::locale() )
- {
- return ::boost::algorithm::find_format_copy(
- Output,
- Input,
- ::boost::algorithm::first_finder(Search, is_iequal(Loc)),
- ::boost::algorithm::const_formatter(Format) );
- }
- //! Replace first algorithm ( case insensitive )
- /*!
- \overload
- */
- template<typename SequenceT, typename Range2T, typename Range1T>
- inline SequenceT ireplace_first_copy(
- const SequenceT& Input,
- const Range2T& Search,
- const Range1T& Format,
- const std::locale& Loc=std::locale() )
- {
- return ::boost::algorithm::find_format_copy(
- Input,
- ::boost::algorithm::first_finder(Search, is_iequal(Loc)),
- ::boost::algorithm::const_formatter(Format) );
- }
- //! Replace first algorithm ( case insensitive )
- /*!
- Replace the first match of the search substring in the input
- with the format string. Input sequence is modified in-place.
- Searching is case insensitive.
- \param Input An input string
- \param Search A substring to be searched for
- \param Format A substitute string
- \param Loc A locale used for case insensitive comparison
- */
- template<typename SequenceT, typename Range1T, typename Range2T>
- inline void ireplace_first(
- SequenceT& Input,
- const Range1T& Search,
- const Range2T& Format,
- const std::locale& Loc=std::locale() )
- {
- ::boost::algorithm::find_format(
- Input,
- ::boost::algorithm::first_finder(Search, is_iequal(Loc)),
- ::boost::algorithm::const_formatter(Format) );
- }
- // replace_last --------------------------------------------------------------------//
- //! Replace last algorithm
- /*!
- Replace the last match of the search string in the input
- with the format string.
- The result is a modified copy of the input. It is returned as a sequence
- or copied to the output iterator.
- \param Output An output iterator to which the result will be copied
- \param Input An input string
- \param Search A substring to be searched for
- \param Format A substitute string
- \return An output iterator pointing just after the last inserted character or
- a modified copy of the input
- \note The second variant of this function provides the strong exception-safety guarantee
- */
- template<
- typename OutputIteratorT,
- typename Range1T,
- typename Range2T,
- typename Range3T>
- inline OutputIteratorT replace_last_copy(
- OutputIteratorT Output,
- const Range1T& Input,
- const Range2T& Search,
- const Range3T& Format )
- {
- return ::boost::algorithm::find_format_copy(
- Output,
- Input,
- ::boost::algorithm::last_finder(Search),
- ::boost::algorithm::const_formatter(Format) );
- }
- //! Replace last algorithm
- /*!
- \overload
- */
- template<typename SequenceT, typename Range1T, typename Range2T>
- inline SequenceT replace_last_copy(
- const SequenceT& Input,
- const Range1T& Search,
- const Range2T& Format )
- {
- return ::boost::algorithm::find_format_copy(
- Input,
- ::boost::algorithm::last_finder(Search),
- ::boost::algorithm::const_formatter(Format) );
- }
- //! Replace last algorithm
- /*!
- Replace the last match of the search string in the input
- with the format string. Input sequence is modified in-place.
- \param Input An input string
- \param Search A substring to be searched for
- \param Format A substitute string
- */
- template<typename SequenceT, typename Range1T, typename Range2T>
- inline void replace_last(
- SequenceT& Input,
- const Range1T& Search,
- const Range2T& Format )
- {
- ::boost::algorithm::find_format(
- Input,
- ::boost::algorithm::last_finder(Search),
- ::boost::algorithm::const_formatter(Format) );
- }
- // replace_last ( case insensitive ) -----------------------------------------------//
- //! Replace last algorithm ( case insensitive )
- /*!
- Replace the last match of the search string in the input
- with the format string.
- The result is a modified copy of the input. It is returned as a sequence
- or copied to the output iterator.
- Searching is case insensitive.
- \param Output An output iterator to which the result will be copied
- \param Input An input string
- \param Search A substring to be searched for
- \param Format A substitute string
- \param Loc A locale used for case insensitive comparison
- \return An output iterator pointing just after the last inserted character or
- a modified copy of the input
- \note The second variant of this function provides the strong exception-safety guarantee
- */
- template<
- typename OutputIteratorT,
- typename Range1T,
- typename Range2T,
- typename Range3T>
- inline OutputIteratorT ireplace_last_copy(
- OutputIteratorT Output,
- const Range1T& Input,
- const Range2T& Search,
- const Range3T& Format,
- const std::locale& Loc=std::locale() )
- {
- return ::boost::algorithm::find_format_copy(
- Output,
- Input,
- ::boost::algorithm::last_finder(Search, is_iequal(Loc)),
- ::boost::algorithm::const_formatter(Format) );
- }
- //! Replace last algorithm ( case insensitive )
- /*!
- \overload
- */
- template<typename SequenceT, typename Range1T, typename Range2T>
- inline SequenceT ireplace_last_copy(
- const SequenceT& Input,
- const Range1T& Search,
- const Range2T& Format,
- const std::locale& Loc=std::locale() )
- {
- return ::boost::algorithm::find_format_copy(
- Input,
- ::boost::algorithm::last_finder(Search, is_iequal(Loc)),
- ::boost::algorithm::const_formatter(Format) );
- }
- //! Replace last algorithm ( case insensitive )
- /*!
- Replace the last match of the search string in the input
- with the format string.The input sequence is modified in-place.
- Searching is case insensitive.
- \param Input An input string
- \param Search A substring to be searched for
- \param Format A substitute string
- \param Loc A locale used for case insensitive comparison
- */
- template<typename SequenceT, typename Range1T, typename Range2T>
- inline void ireplace_last(
- SequenceT& Input,
- const Range1T& Search,
- const Range2T& Format,
- const std::locale& Loc=std::locale() )
- {
- ::boost::algorithm::find_format(
- Input,
- ::boost::algorithm::last_finder(Search, is_iequal(Loc)),
- ::boost::algorithm::const_formatter(Format) );
- }
- // replace_nth --------------------------------------------------------------------//
- //! Replace nth algorithm
- /*!
- Replace an Nth (zero-indexed) match of the search string in the input
- with the format string.
- The result is a modified copy of the input. It is returned as a sequence
- or copied to the output iterator.
- \param Output An output iterator to which the result will be copied
- \param Input An input string
- \param Search A substring to be searched for
- \param Nth An index of the match to be replaced. The index is 0-based.
- For negative N, matches are counted from the end of string.
- \param Format A substitute string
- \return An output iterator pointing just after the last inserted character or
- a modified copy of the input
- \note The second variant of this function provides the strong exception-safety guarantee
- */
- template<
- typename OutputIteratorT,
- typename Range1T,
- typename Range2T,
- typename Range3T>
- inline OutputIteratorT replace_nth_copy(
- OutputIteratorT Output,
- const Range1T& Input,
- const Range2T& Search,
- int Nth,
- const Range3T& Format )
- {
- return ::boost::algorithm::find_format_copy(
- Output,
- Input,
- ::boost::algorithm::nth_finder(Search, Nth),
- ::boost::algorithm::const_formatter(Format) );
- }
- //! Replace nth algorithm
- /*!
- \overload
- */
- template<typename SequenceT, typename Range1T, typename Range2T>
- inline SequenceT replace_nth_copy(
- const SequenceT& Input,
- const Range1T& Search,
- int Nth,
- const Range2T& Format )
- {
- return ::boost::algorithm::find_format_copy(
- Input,
- ::boost::algorithm::nth_finder(Search, Nth),
- ::boost::algorithm::const_formatter(Format) );
- }
- //! Replace nth algorithm
- /*!
- Replace an Nth (zero-indexed) match of the search string in the input
- with the format string. Input sequence is modified in-place.
- \param Input An input string
- \param Search A substring to be searched for
- \param Nth An index of the match to be replaced. The index is 0-based.
- For negative N, matches are counted from the end of string.
- \param Format A substitute string
- */
- template<typename SequenceT, typename Range1T, typename Range2T>
- inline void replace_nth(
- SequenceT& Input,
- const Range1T& Search,
- int Nth,
- const Range2T& Format )
- {
- ::boost::algorithm::find_format(
- Input,
- ::boost::algorithm::nth_finder(Search, Nth),
- ::boost::algorithm::const_formatter(Format) );
- }
- // replace_nth ( case insensitive ) -----------------------------------------------//
-
- //! Replace nth algorithm ( case insensitive )
- /*!
- Replace an Nth (zero-indexed) match of the search string in the input
- with the format string.
- The result is a modified copy of the input. It is returned as a sequence
- or copied to the output iterator.
- Searching is case insensitive.
- \param Output An output iterator to which the result will be copied
- \param Input An input string
- \param Search A substring to be searched for
- \param Nth An index of the match to be replaced. The index is 0-based.
- For negative N, matches are counted from the end of string.
- \param Format A substitute string
- \param Loc A locale used for case insensitive comparison
- \return An output iterator pointing just after the last inserted character or
- a modified copy of the input
- \note The second variant of this function provides the strong exception-safety guarantee
- */
- template<
- typename OutputIteratorT,
- typename Range1T,
- typename Range2T,
- typename Range3T>
- inline OutputIteratorT ireplace_nth_copy(
- OutputIteratorT Output,
- const Range1T& Input,
- const Range2T& Search,
- int Nth,
- const Range3T& Format,
- const std::locale& Loc=std::locale() )
- {
- return ::boost::algorithm::find_format_copy(
- Output,
- Input,
- ::boost::algorithm::nth_finder(Search, Nth, is_iequal(Loc) ),
- ::boost::algorithm::const_formatter(Format) );
- }
- //! Replace nth algorithm ( case insensitive )
- /*!
- \overload
- */
- template<typename SequenceT, typename Range1T, typename Range2T>
- inline SequenceT ireplace_nth_copy(
- const SequenceT& Input,
- const Range1T& Search,
- int Nth,
- const Range2T& Format,
- const std::locale& Loc=std::locale() )
- {
- return ::boost::algorithm::find_format_copy(
- Input,
- ::boost::algorithm::nth_finder(Search, Nth, is_iequal(Loc)),
- ::boost::algorithm::const_formatter(Format) );
- }
- //! Replace nth algorithm ( case insensitive )
- /*!
- Replace an Nth (zero-indexed) match of the search string in the input
- with the format string. Input sequence is modified in-place.
- Searching is case insensitive.
- \param Input An input string
- \param Search A substring to be searched for
- \param Nth An index of the match to be replaced. The index is 0-based.
- For negative N, matches are counted from the end of string.
- \param Format A substitute string
- \param Loc A locale used for case insensitive comparison
- */
- template<typename SequenceT, typename Range1T, typename Range2T>
- inline void ireplace_nth(
- SequenceT& Input,
- const Range1T& Search,
- int Nth,
- const Range2T& Format,
- const std::locale& Loc=std::locale() )
- {
- ::boost::algorithm::find_format(
- Input,
- ::boost::algorithm::nth_finder(Search, Nth, is_iequal(Loc)),
- ::boost::algorithm::const_formatter(Format) );
- }
- // replace_all --------------------------------------------------------------------//
- //! Replace all algorithm
- /*!
- Replace all occurrences of the search string in the input
- with the format string.
- The result is a modified copy of the input. It is returned as a sequence
- or copied to the output iterator.
- \param Output An output iterator to which the result will be copied
- \param Input An input string
- \param Search A substring to be searched for
- \param Format A substitute string
- \return An output iterator pointing just after the last inserted character or
- a modified copy of the input
- \note The second variant of this function provides the strong exception-safety guarantee
- */
- template<
- typename OutputIteratorT,
- typename Range1T,
- typename Range2T,
- typename Range3T>
- inline OutputIteratorT replace_all_copy(
- OutputIteratorT Output,
- const Range1T& Input,
- const Range2T& Search,
- const Range3T& Format )
- {
- return ::boost::algorithm::find_format_all_copy(
- Output,
- Input,
- ::boost::algorithm::first_finder(Search),
- ::boost::algorithm::const_formatter(Format) );
- }
- //! Replace all algorithm
- /*!
- \overload
- */
- template<typename SequenceT, typename Range1T, typename Range2T>
- inline SequenceT replace_all_copy(
- const SequenceT& Input,
- const Range1T& Search,
- const Range2T& Format )
- {
- return ::boost::algorithm::find_format_all_copy(
- Input,
- ::boost::algorithm::first_finder(Search),
- ::boost::algorithm::const_formatter(Format) );
- }
- //! Replace all algorithm
- /*!
- Replace all occurrences of the search string in the input
- with the format string. The input sequence is modified in-place.
- \param Input An input string
- \param Search A substring to be searched for
- \param Format A substitute string
- */
- template<typename SequenceT, typename Range1T, typename Range2T>
- inline void replace_all(
- SequenceT& Input,
- const Range1T& Search,
- const Range2T& Format )
- {
- ::boost::algorithm::find_format_all(
- Input,
- ::boost::algorithm::first_finder(Search),
- ::boost::algorithm::const_formatter(Format) );
- }
-
- // replace_all ( case insensitive ) -----------------------------------------------//
- //! Replace all algorithm ( case insensitive )
- /*!
- Replace all occurrences of the search string in the input
- with the format string.
- The result is a modified copy of the input. It is returned as a sequence
- or copied to the output iterator.
- Searching is case insensitive.
- \param Output An output iterator to which the result will be copied
- \param Input An input string
- \param Search A substring to be searched for
- \param Format A substitute string
- \param Loc A locale used for case insensitive comparison
- \return An output iterator pointing just after the last inserted character or
- a modified copy of the input
- \note The second variant of this function provides the strong exception-safety guarantee
- */
- template<
- typename OutputIteratorT,
- typename Range1T,
- typename Range2T,
- typename Range3T>
- inline OutputIteratorT ireplace_all_copy(
- OutputIteratorT Output,
- const Range1T& Input,
- const Range2T& Search,
- const Range3T& Format,
- const std::locale& Loc=std::locale() )
- {
- return ::boost::algorithm::find_format_all_copy(
- Output,
- Input,
- ::boost::algorithm::first_finder(Search, is_iequal(Loc)),
- ::boost::algorithm::const_formatter(Format) );
- }
- //! Replace all algorithm ( case insensitive )
- /*!
- \overload
- */
- template<typename SequenceT, typename Range1T, typename Range2T>
- inline SequenceT ireplace_all_copy(
- const SequenceT& Input,
- const Range1T& Search,
- const Range2T& Format,
- const std::locale& Loc=std::locale() )
- {
- return ::boost::algorithm::find_format_all_copy(
- Input,
- ::boost::algorithm::first_finder(Search, is_iequal(Loc)),
- ::boost::algorithm::const_formatter(Format) );
- }
- //! Replace all algorithm ( case insensitive )
- /*!
- Replace all occurrences of the search string in the input
- with the format string.The input sequence is modified in-place.
- Searching is case insensitive.
- \param Input An input string
- \param Search A substring to be searched for
- \param Format A substitute string
- \param Loc A locale used for case insensitive comparison
- */
- template<typename SequenceT, typename Range1T, typename Range2T>
- inline void ireplace_all(
- SequenceT& Input,
- const Range1T& Search,
- const Range2T& Format,
- const std::locale& Loc=std::locale() )
- {
- ::boost::algorithm::find_format_all(
- Input,
- ::boost::algorithm::first_finder(Search, is_iequal(Loc)),
- ::boost::algorithm::const_formatter(Format) );
- }
-
- // replace_head --------------------------------------------------------------------//
- //! Replace head algorithm
- /*!
- Replace the head of the input with the given format string.
- The head is a prefix of a string of given size.
- If the sequence is shorter then required, whole string if
- considered to be the head.
- The result is a modified copy of the input. It is returned as a sequence
- or copied to the output iterator.
-
- \param Output An output iterator to which the result will be copied
- \param Input An input string
- \param N Length of the head.
- For N>=0, at most N characters are extracted.
- For N<0, size(Input)-|N| characters are extracted.
- \param Format A substitute string
- \return An output iterator pointing just after the last inserted character or
- a modified copy of the input
- \note The second variant of this function provides the strong exception-safety guarantee
- */
- template<
- typename OutputIteratorT,
- typename Range1T,
- typename Range2T>
- inline OutputIteratorT replace_head_copy(
- OutputIteratorT Output,
- const Range1T& Input,
- int N,
- const Range2T& Format )
- {
- return ::boost::algorithm::find_format_copy(
- Output,
- Input,
- ::boost::algorithm::head_finder(N),
- ::boost::algorithm::const_formatter(Format) );
- }
- //! Replace head algorithm
- /*!
- \overload
- */
- template<typename SequenceT, typename RangeT>
- inline SequenceT replace_head_copy(
- const SequenceT& Input,
- int N,
- const RangeT& Format )
- {
- return ::boost::algorithm::find_format_copy(
- Input,
- ::boost::algorithm::head_finder(N),
- ::boost::algorithm::const_formatter(Format) );
- }
- //! Replace head algorithm
- /*!
- Replace the head of the input with the given format string.
- The head is a prefix of a string of given size.
- If the sequence is shorter then required, the whole string is
- considered to be the head. The input sequence is modified in-place.
- \param Input An input string
- \param N Length of the head.
- For N>=0, at most N characters are extracted.
- For N<0, size(Input)-|N| characters are extracted.
- \param Format A substitute string
- */
- template<typename SequenceT, typename RangeT>
- inline void replace_head(
- SequenceT& Input,
- int N,
- const RangeT& Format )
- {
- ::boost::algorithm::find_format(
- Input,
- ::boost::algorithm::head_finder(N),
- ::boost::algorithm::const_formatter(Format) );
- }
- // replace_tail --------------------------------------------------------------------//
- //! Replace tail algorithm
- /*!
- Replace the tail of the input with the given format string.
- The tail is a suffix of a string of given size.
- If the sequence is shorter then required, whole string is
- considered to be the tail.
- The result is a modified copy of the input. It is returned as a sequence
- or copied to the output iterator.
- \param Output An output iterator to which the result will be copied
- \param Input An input string
- \param N Length of the tail.
- For N>=0, at most N characters are extracted.
- For N<0, size(Input)-|N| characters are extracted.
- \param Format A substitute string
- \return An output iterator pointing just after the last inserted character or
- a modified copy of the input
- \note The second variant of this function provides the strong exception-safety guarantee
- */
- template<
- typename OutputIteratorT,
- typename Range1T,
- typename Range2T>
- inline OutputIteratorT replace_tail_copy(
- OutputIteratorT Output,
- const Range1T& Input,
- int N,
- const Range2T& Format )
- {
- return ::boost::algorithm::find_format_copy(
- Output,
- Input,
- ::boost::algorithm::tail_finder(N),
- ::boost::algorithm::const_formatter(Format) );
- }
- //! Replace tail algorithm
- /*!
- \overload
- */
- template<typename SequenceT, typename RangeT>
- inline SequenceT replace_tail_copy(
- const SequenceT& Input,
- int N,
- const RangeT& Format )
- {
- return ::boost::algorithm::find_format_copy(
- Input,
- ::boost::algorithm::tail_finder(N),
- ::boost::algorithm::const_formatter(Format) );
- }
- //! Replace tail algorithm
- /*!
- Replace the tail of the input with the given format sequence.
- The tail is a suffix of a string of given size.
- If the sequence is shorter then required, the whole string is
- considered to be the tail. The input sequence is modified in-place.
- \param Input An input string
- \param N Length of the tail.
- For N>=0, at most N characters are extracted.
- For N<0, size(Input)-|N| characters are extracted.
- \param Format A substitute string
- */
- template<typename SequenceT, typename RangeT>
- inline void replace_tail(
- SequenceT& Input,
- int N,
- const RangeT& Format )
- {
- ::boost::algorithm::find_format(
- Input,
- ::boost::algorithm::tail_finder(N),
- ::boost::algorithm::const_formatter(Format) );
- }
- } // namespace algorithm
- // pull names to the boost namespace
- using algorithm::replace_range_copy;
- using algorithm::replace_range;
- using algorithm::replace_first_copy;
- using algorithm::replace_first;
- using algorithm::ireplace_first_copy;
- using algorithm::ireplace_first;
- using algorithm::replace_last_copy;
- using algorithm::replace_last;
- using algorithm::ireplace_last_copy;
- using algorithm::ireplace_last;
- using algorithm::replace_nth_copy;
- using algorithm::replace_nth;
- using algorithm::ireplace_nth_copy;
- using algorithm::ireplace_nth;
- using algorithm::replace_all_copy;
- using algorithm::replace_all;
- using algorithm::ireplace_all_copy;
- using algorithm::ireplace_all;
- using algorithm::replace_head_copy;
- using algorithm::replace_head;
- using algorithm::replace_tail_copy;
- using algorithm::replace_tail;
- } // namespace boost
- #endif // BOOST_REPLACE_HPP
|