File: findend.yo

package info (click to toggle)
c%2B%2B-annotations 11.5.0-1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 11,244 kB
  • sloc: cpp: 21,698; makefile: 1,505; ansic: 165; sh: 121; perl: 90
file content (30 lines) | stat: -rw-r--r-- 1,546 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
25
26
27
28
29
30
    hi(find_end)
    itemization(
        it() Header file: tt(<algorithm>)
        it() Function prototypes:
        itemization(
            itt(ForwardIterator1 find_end(ForwardIterator1 first1,
    ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2))
            itt(ForwardIterator1 find_end(ForwardIterator1 first1,
    ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2,
                                            BinaryPredicate pred))
        )
        it() Description:
        itemization(
            it() The first prototype: the sequence of elements implied by
rangett(first1, last1) is searched for the last occurrence of the sequence of
elements implied by the range rangett(first2, last2). If the sequence
rangett(first2, last2) is not found, tt(last1) is returned, otherwise an
iterator pointing to the first element of the matching sequence is
returned. The tt(operator==) of the underlying data type is used to compare
the elements in the two sequences.
            it() The second prototype: the sequence of elements implied by
rangett(first1, last1) is searched for the last occurrence of the sequence of
elements implied by rangett(first2, last2). If the sequence rangett(first2,
last2) is not found, tt(last1) is returned, otherwise an iterator pointing to
the first element of the matching sequence is returned. The provided binary
predicate is used to compare the elements in the two sequences.
        )
        it() Example:
        verbinclude(-a examples/findend.cc)
    )