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
33
|
itemization(
it() Header file: tt(<algorithm>)
it() Function prototypes:
itemization(
itt(pair<InputIterator1, InputIterator2>
mismatch(InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2);)
itt(pair<InputIterator1, InputIterator2>
mismatch(InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, Compare comp);)
)
it() Description:
itemization(
it() The first prototype: the two sequences of elements starting
at tt(first1) and tt(first2) are compared using the equality operator of the
data type to which the iterators point. Comparison stops if the compared
elements differ (i.e., tt(operator==) returns false) or tt(last1) is
reached. A tt(pair) containing iterators pointing to the final positions is
returned. The second sequence may contain more elements than the first
sequence. The behavior of the algorithm is undefined if the second sequence
contains fewer elements than the first sequence.
it() The second prototype: the two sequences of elements starting
at tt(first1) and tt(first2) are compared using the binary comparison
operation as defined by tt(comp), instead of
tt(operator==). Comparison stops if the tt(comp) function returns tt(false)
or tt(last1) is reached. A tt(pair) containing iterators pointing to the final
positions is returned. The second sequence may contain more elements than the
first sequence. The behavior of the algorithm is undefined if the second
sequence contains fewer elements than the first sequence.
)
it() Example:
verbinclude(-a examples/mismatch.cc)
)
|
