File: issorteduntil.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 (26 lines) | stat: -rw-r--r-- 954 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
23
24
25
26
    hi(is_sorted_until)
    itemization(
        it() Header file: tt(<algorithm>)
        it() Function prototypes:
        itemization(
            itt(ForwardIterator is_sorted_until([ExecPol,] 
                ForwardIterator first, ForwardIterator last);)
            itt(ForwardIterator is_sorted_until([ExecPol,] 
                ForwardIterator first, ForwardIterator last, 
                BinaryPredicate pred);)
        )
        it() Description:
        itemization(
            it() The first prototype: returns an iterator to the end of range,
starting at tt(first) whose elements are sorted using the elements'
tt(operator<) comparison operator.
            it() The second prototype: returns an iterator to the end of
range, starting at tt(first) whose elements using the binary predicate
tt(pred).
        )
        The functions return at least tt(first + 1).
        it() Example:
        verbinclude(-a examples/issorted.cc)
    )