Re: [Boost-bugs] [Boost C++ Libraries] #2457: Compatible Sorting Criteria definition

Subject: Re: [Boost-bugs] [Boost C++ Libraries] #2457: Compatible Sorting Criteria definition
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2012-01-13 19:26:12

#2457: Compatible Sorting Criteria definition
---------------------------+------------------------------------------------
  Reporter:  dave          |       Owner:  joaquin     
      Type:  Bugs          |      Status:  closed      
 Milestone:  Boost 1.37.0  |   Component:  multi_index 
   Version:  Boost 1.36.0  |    Severity:  Optimization
Resolution:  invalid       |    Keywords:              
---------------------------+------------------------------------------------

Comment (by dave):

 Replying to [comment:5 joaquin]:
 > I wasn't comparing the standard wording of {{{binary_search}}} again
 !Boost.MultiIndex's wording of {{{lower_bound}}}: please note that the two
 quotes come from to the sandard and resort to partitioning.

 I only see one quote, and I know it uses partitioning because I am
 responsible for that language.  The use of partitioning in the
 specification both simplified and generalized the specification for
 {{{upper_bound}}} and {{{lower_bound}}}, and it generalized the
 specification for {{{binary_search}}}.  Characterizing that as "resorting"
 to partitioning really puts an interesting spin on it.

-- 
Ticket URL: <https://svn.boost.org/trac/boost/ticket/2457#comment:7>
Boost C++ Libraries <http://www.boost.org/>
Boost provides free peer-reviewed portable C++ source libraries.