Den 20-06-2011 20:56, Andrew Sutton skrev:
This is of course not a very large foundation on which to make such a decision. Nor is the vote particular clear.
I didn't cast a vote, but I will be /extremely/ unhappy with having a library where this is not addressed:
So /please/ add this to the list of required fixes that must be done before inclusion is possible.
No, I will not add this to the list of requirements. I considered this suggestion very carefully when writing my evaluation and again when preparing the summary and ultimately decided that trying to shoehorn this requirement into the existing framework was not the best approach for providing the feature. Phil's suggestion of implementing heap algorithms on ranges lends itself to a more natural solution to this requirement.
How is this going to work? Do we have example of how my code will look like then? -Thorsten