Previous fileTop of DocumentContentsIndex pageNext file
Apache C++ Standard Library Reference Guide

reverse()

Library:  Algorithms


Function

Local Index

No Entries

Summary

An algorithm that reverses the order of elements in a sequence

Synopsis

#include <algorithm>

namespace std {
  template <class BidirectionalIterator>
  void reverse(BidirectionalIterator start,
               BidirectionalIterator finish);
}

Description

The algorithm reverse() reverses the elements in a sequence so that the last element becomes the new first element, and the first element becomes the new last. For each non-negative integer i <= (finish - start)/2, reverse() applies iter_swap() to all pairs of iterators start + I, (finish - I) - 1.

Complexity

reverse() performs exactly (finish - start)/2 swaps.

Example

See Also

reverse_copy(), swap()

Standards Conformance

ISO/IEC 14882:1998 -- International Standard for Information Systems -- Programming Language C++, Section 25.2.9



Previous fileTop of DocumentContentsIndex pageNext file