| Home | Libraries | People | FAQ | More

## Function replace_tail_copy

boost::algorithm::replace_tail_copy — Replace tail algorithm.

## Synopsis

    template<typename OutputIteratorT, typename Collection1T,
             typename Collection2T>
      OutputIteratorT
      replace_tail_copy(OutputIteratorT Output, const Collection1T & Input,
                        unsigned int N, const Collection2T & Format);
    template<typename SequenceT, typename CollectionT>
      SequenceT replace_tail_copy(const SequenceT & Input, unsigned int N,
                                  const CollectionT & Format);

## Description

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

Format

  A substitute string

Input

  An input string

N

  Length of the tail

Output

  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