File: setunion.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 (30 lines) | stat: -rw-r--r-- 1,494 bytes parent folder | download | duplicates (3)
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(set_union)
    itemization(
        it() Header file: tt(<algorithm>)
        it() Function prototypes:
        itemization(
            itt(OutputIterator set_union(InputIterator1 first1, InputIterator1
last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result);)
            itt(OutputIterator set_union(InputIterator1 first1, InputIterator1
last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result,
Compare comp);)
        )
        it() Description:
        itemization(
            it() The first prototype: a sorted sequence of the elements that
are present in either the range rangett(first1, last1) or the range
rangett(first2, last2) or in both ranges is returned, starting at tt(result),
and ending at the tt(OutputIterator) returned by the function. The elements in
the two ranges must have been sorted using ti(operator<) of the data type to
which the iterators point. Note that in the final range each element appears
only once.
            it() The second prototype: a sorted sequence of the elements that
are present in either the range rangett(first1, last1) or the range
rangett(first2, last2) or in both ranges is returned, starting at tt(result),
and ending at the tt(OutputIterator) returned by the function. The elements in
the two ranges must have been sorted using tt(comp) function object. Note that
in the final range each element appears only once.
        )
        it() Example:
        verbinclude(-a examples/setunion.cc)
    )