File: reverse.yo

package info (click to toggle)
c%2B%2B-annotations 13.02.02-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 13,576 kB
  • sloc: cpp: 25,297; makefile: 1,523; ansic: 165; sh: 126; perl: 90; fortran: 27
file content (22 lines) | stat: -rw-r--r-- 811 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
hi(reverse) hi(reverse_copy)
itemization(
    it() Header file:
    tt(<algorithm>)
    it() Function prototype:
    itemization(
        itt(void reverse([ExecPol,] BidirectionalIterator first,
            BidirectionalIterator last);)
        itt(OutputIterator reverse_copy([ExecPol,] BidirectionalIterator first,
            BidirectionalIterator last, OutputIterator dest);)
    )
    it() Description:
    itemization(
        it() The first prototype: the order of the elements in the range
pointed to by rangett(first, last) are reversed.
        it() The second prototype: elements in the range pointed to by
rangett(first, last) are inserted in reversed order into tt(dest), returning
the output iterator following the last insertion.
    )
    it() Example:
    verbinclude(-a examples/reverse.cc)
)