Subject: Re: [boost] [algorithm][minmax_element] implementation question
From: Paul A. Bristow (pbristow_at_[hidden])
Date: 2013-07-04 05:29:35
> -----Original Message-----
> From: Boost [mailto:boost-bounces_at_[hidden]] On Behalf Of Michael Marcin
> Sent: Thursday, July 04, 2013 4:23 AM
> To: boost_at_[hidden]
> Subject: [boost] [algorithm][minmax_element] implementation question
> I was looking at minmax_elemement to try and understand the algorithm.
> I noticed that the boost implementation looks significantly more complicated than the clang libc++
> Mainly due to the potential_min_result variable that exists in the boost version.
> Is there a reason for this discrepancy? Is there a bug in the clang implementation?
I have a faint recollection of some discussions on the Boost lists of this algorithm when it was
(Was it set as an exercise for the author's students?)
Some googling may revive these discussions.
--- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow_at_[hidden]
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk