File: equalrange.yo

package info (click to toggle)
c%2B%2B-annotations 12.2.0-2
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 13,044 kB
  • sloc: cpp: 24,337; makefile: 1,517; ansic: 165; sh: 121; perl: 90
file content (32 lines) | stat: -rw-r--r-- 1,573 bytes parent folder | download | duplicates (5)
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
31
32
    hi(equal_range)
    itemization(
        it() Header file: tt(<algorithm>)
        it() Function prototypes:
        itemization(
            itt(pair<ForwardIterator, ForwardIterator>
            equal_range(ForwardIterator first, ForwardIterator last, Type
const &value);)
            itt(pair<ForwardIterator, ForwardIterator>
            equal_range(ForwardIterator first, ForwardIterator last, Type
const &value, Compare comp);)
        )
        it() Description (see also identically named member functions of,
e.g., the tt(map) (section ref(MAP)) and tt(multimap) (section
ref(MULTIMAP))):
        itemization(
            it() The first prototype: starting from a sorted sequence (where
the tt(operator<) of the data type to which the iterators point was used to
sort the elements in the provided range), a pair of iterators is returned
representing the return value of, respectively, tt(lower_bound) (returning
the first element that is not smaller than the provided reference value, see
section ref(LOWERBOUND)) and tt(upper_bound) (returning the first element
beyond the provided reference value, see section ref(UPPERBOUND)).
            it() The second prototype: starting from a sorted sequence (where
the tt(comp) function object was used to sort the elements in the provided
range), a pair of iterators is returned representing the return values of,
respectively, the functions tt(lower_bound) (section ref(LOWERBOUND)) and
tt(upper_bound) (section ref(UPPERBOUND)).
        )
        it() Example:
        verbinclude(-a examples/equalrange.cc)
    )