Home | Libraries | People | FAQ | More |
boost::algorithm::replace_tail_copy — Replace tail algorithm.
template<typename OutputIteratorT, typename Range1T, typename Range2T> OutputIteratorT replace_tail_copy(OutputIteratorT Output, const Range1T & Input, unsigned int N, const Range2T & Format); template<typename SequenceT, typename RangeT> SequenceT replace_tail_copy(const SequenceT & Input, unsigned int N, const RangeT & Format);
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.
Parameters
A substitute string
An input string
Length of the tail
An output iterator to which the result will be copied
Returns:
An output iterator pointing just after the last inserted character or a modified copy of the input
Notes:
The second variant of this function provides the strong exception-safety guarantee
Copyright © 2002-2004 Pavol Droba |