Re: [Boost-bugs] [Boost C++ Libraries] #3873: Promote Existing is_sorted Algorithm Detail to First-class Template / Track C++1x N3000 is_sorted{_until}

Subject: Re: [Boost-bugs] [Boost C++ Libraries] #3873: Promote Existing is_sorted Algorithm Detail to First-class Template / Track C++1x N3000 is_sorted{_until}
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2010-03-08 13:09:09


#3873: Promote Existing is_sorted Algorithm Detail to First-class Template / Track
C++1x N3000 is_sorted{_until}
---------------------------------------+------------------------------------
  Reporter: gerickson@… | Owner: johnmaddock
      Type: Feature Requests | Status: closed
 Milestone: To Be Determined | Component: graph
   Version: Boost Development Trunk | Severity: Problem
Resolution: wontfix | Keywords:
---------------------------------------+------------------------------------
Changes (by ne01026@…):

  * component: TR1 => graph

Comment:

 All right. I have done some research and can come up with the following
 conclusions:

  1. The draft algorithm is `std::is_sorted` and not `std::tr1::is_sorted`
 so it does not belong to '''TR1''' indeed.
  1. The Boost implementation has been grafted from HP/SGI STL; it is
 deficient (the draft standard algorithm is more modular) and used by the
 '''graph''' library only. This raises the question whether the
 '''graph''' package is allowed to rely on such undocumented features.
  1. Of course, it is not a '''graph''' feature, so it cannot be provided
 there.

 All in all, a new Algorithm library is needed, or the implementation could
 be added to '''minmax''' because it is close enough. However,
 '''minmax''' cannot be chosen as a target component ''(why?)'' so I bring
 this to '''graph''' attention for the time being.

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

This archive was generated by hypermail 2.1.7 : 2017-02-16 18:50:02 UTC