forked from boostorg/range
updated algorithms.qbk to explicitly mention range_return_value so that this can be searched for.
This commit is contained in:
@ -37,7 +37,9 @@ boost::copy(boost::unique(boost::sort(vec)),
|
||||
std::ostream_iterator<int>(std::cout));
|
||||
``
|
||||
|
||||
Algorithms like `boost::unique` usually return the same range: `[boost::begin(rng), found)`. However, this behaviour may be changed by supplying the algorithms with a template argument:
|
||||
Algorithms like `boost::unique` usually return the range: `[boost::begin(rng), found)`.
|
||||
However, this behaviour may be changed by supplying a `range_return_value`
|
||||
as a template parameter to the algorithm:
|
||||
|
||||
[table
|
||||
[[Expression] [Return]]
|
||||
@ -177,4 +179,4 @@ and there is no need to worry about generating an invalid range. Furthermore, if
|
||||
[include numeric/inner_product.qbk]
|
||||
[include numeric/partial_sum.qbk]
|
||||
[endsect]
|
||||
[endsect]
|
||||
[endsect]
|
||||
|
Reference in New Issue
Block a user