diff --git a/doc/html/range/reference/algorithms/non_mutating/mismatch.html b/doc/html/range/reference/algorithms/non_mutating/mismatch.html index 114fd0c..ed7efa3 100644 --- a/doc/html/range/reference/algorithms/non_mutating/mismatch.html +++ b/doc/html/range/reference/algorithms/non_mutating/mismatch.html @@ -28,7 +28,7 @@ mismatch
- + Prototype

@@ -106,32 +106,26 @@

- + Description

mismatch finds the first - position where the two ranges rng1 - and rng2 differ. + position where the correseponding elements from the two ranges rng1 and rng2 + are not equal.

Equality is determined by operator== for non-predicate versions of mismatch, and by satisfying pred in the predicate versions.

-

- The versions of mismatch - that return a range_return, - defines found in the - same manner as the returned iterator described above. -

- + Definition

Defined in the header file boost/range/algorithm/mismatch.hpp

- + Requirements

@@ -192,14 +186,14 @@

- + Precondition:

distance(rng2) >= distance(rng1)

- + Complexity

diff --git a/doc/reference/algorithm/mismatch.qbk b/doc/reference/algorithm/mismatch.qbk index f971b2d..562fdb5 100644 --- a/doc/reference/algorithm/mismatch.qbk +++ b/doc/reference/algorithm/mismatch.qbk @@ -75,12 +75,10 @@ mismatch(const SinglePassRange1& rng1, SinglePassRange2& rng2, [heading Description] -`mismatch` finds the first position where the two ranges `rng1` and `rng2` differ. +`mismatch` finds the first position where the correseponding elements from the two ranges `rng1` and `rng2` are not equal. Equality is determined by `operator==` for non-predicate versions of `mismatch`, and by satisfying `pred` in the predicate versions. -The versions of `mismatch` that return a `range_return`, defines `found` in the same manner as the returned iterator described above. - [heading Definition] Defined in the header file `boost/range/algorithm/mismatch.hpp`