Transform a sequence, or two sequences, into a new sequence

Source code

Declaration

template <class InputIterator, class OutputIterator, class UnaryOperation>
OutputIterator transform(InputIterator first, InputIterator last,
                         OutputIterator result, UnaryOperation op);

template <class InputIterator1, class InputIterator2, class OutputIterator,
          class BinaryOperation>
OutputIterator transform(InputIterator1 first1, InputIterator1 last1,
                         InputIterator2 first2, OutputIterator result,
                         BinaryOperation binary_op);

Description   From the sequence in the range [ first, last) , the first transform  function generates the sequence . The sequence that results is the original sequence with a unary operation (or unary function)  applied to each element of the original sequence.

From the sequence in the range [ first1, last1) , and the sequence in the range beginning at first2 , the second transform  function generates the sequence

. The sequence that results is the two original sequences combined with a binary operation (or binary function) , element by element.

For both functions, the results are placed in a range of size n beginning at the location referenced by result, and the past-the-end iterator  is returned.

Type requirements

• InputIterator, InputIterator1, and InputIterator2 must be at least input iterators .
• OutputIterator must be at least an output iterator .
• UnaryOperation must be a function object type that provides T operator()(T), where T is the dereference type of InputIterator.
• BinaryOperation must be a function object type that provides T1 operator()(T1, T2), where T1 and T2 are the dereference types of InputIterator1 and InputIterator2, respectively.

Group Mutating sequence operations.

Time complexity Linear.

The number of applications of op is the size of the range [ first, last)

and the number of applications of binary_op is the size of of the range [ first1, last1) .

Space complexity Constant.

Mutative? Yes.

Example Select here to view the source code for the example.

Implementation Select here to view source code (Copyright (C) 1994, Hewlett-Packard Company) for this algorithm.