File: sort.yo

package info (click to toggle)
c%2B%2B-annotations 10.6.0-1
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 10,536 kB
  • ctags: 3,247
  • sloc: cpp: 19,157; makefile: 1,521; ansic: 165; sh: 128; perl: 90
file content (24 lines) | stat: -rw-r--r-- 977 bytes parent folder | download | duplicates (4)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
hi(sort)
    itemization(
        it() Header file: tt(<algorithm>)
        it() Function prototypes:
        itemization(
            itt(void sort(RandomAccessIterator first,
                RandomAccessIterator last);)
            itt(void sort(RandomAccessIterator first,
                RandomAccessIterator last, Compare comp);)
        )
        it() Description:
        itemization(
           it() The first prototype: the elements in the range rangett(first,
last) are sorted in ascending order using ti(operator<) of the data type to
which the iterators point.
            it() The second prototype: the elements in the range
rangett(first, last) are sorted in ascending order using the tt(comp)
function object to compare the elements. The binary predicate tt(comp)
should return tt(true) if its first argument should be placed earlier in the
sorted sequence than its second argument.
        )
        it() Example:
        verbinclude(-a examples/sort.cc)
    )