|
|
4ec46acdf5
|
Implement min_element and max_element and sever algorithm dependency
|
2019-04-22 18:20:35 -04:00 |
|
|
|
adcb071dc6
|
Replace std::min_element/max_element with boost::first_min_element/first_max_element to accept a range that models ForwardRange but its underlying iterator models only InputIterator; fixes ticket 11528.
|
2015-08-20 20:03:08 +09:00 |
|
|
|
61e02039dd
|
More remove execute attribute from files.
rel. to:
e0e6fefb1e
Signed-off-by: Kohei Takahashi <flast@flast.jp>
|
2014-06-16 20:28:02 +09:00 |
|
|
|
adc4b5db3b
|
Boost.Range brought back some of the const overloads that were over-zealously removed.
[SVN r61495]
|
2010-04-22 22:43:57 +00:00 |
|
|
|
cf63ba0dc9
|
Boost.Range removed redundant overloads, increased compiler support, and made return types consistent.
[SVN r61281]
|
2010-04-14 22:16:11 +00:00 |
|
|
|
debce93f63
|
Boost.Range is modified to conditionally compile concept assertions. This has been configured to disable concept assertions in Boost.Range for known broken compilers.
[SVN r61035]
|
2010-04-04 10:47:21 +00:00 |
|
|
|
22c72c53eb
|
Boost.Range algorithms are now in the boost::range namespace and brought into boost by the appropriate using statement. This allows better interoperation with Boost.Algorithm since errors only occur when the use calls similarly named ambiguous functions. In this event the user can disambiguate by using algorithm::xxx() or range::xxx(). This iteration also updates the concept assert code in the range algorithms.
[SVN r61023]
|
2010-04-03 19:14:13 +00:00 |
|
|
|
b0d1db7c2e
|
Boost.RangeEx merged into Boost.Range
[SVN r60897]
|
2010-03-28 16:08:35 +00:00 |
|
