Subject: [boost] [algorithm][minmax_element] implementation question
From: Michael Marcin (mike.marcin_at_[hidden])
Date: 2013-07-03 23:22:40
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++ implementation.
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?
http://llvm.org/svn/llvm-project/libcxx/trunk/include/algorithm
http://www.boost.org/doc/libs/1_54_0/boost/algorithm/minmax_element.hpp