On May 6, 2014, at 11:30 AM, Florian Weimer <fwei...@redhat.com> wrote:

> On 05/05/2014 03:16 PM, Paul Sandoz wrote:
>> Hi,
>> 
>>   https://bugs.openjdk.java.net/browse/JDK-8042355
>>   
>> http://cr.openjdk.java.net/~psandoz/jdk9/JDK-8042355-sorted-short-circuit/webrev/
>> 
>> This is an optimization to ensure that sorted() in sequential pipelines does 
>> not aggressively push all sorted elements downstream if the pipeline is 
>> known to be short-circuiting.
> 
> Would it be possible to use something like heap sort to avoid sorting the 
> entire input stream if only the first few smallest items are needed?
> 

For ordered streams the sort is required to be stable, and the sorted op does 
not know in advanced at most how many elements are required to be pushed 
downstream (although it might be possible to fix the latter by back-propagating 
more information upstream i am not sure it is worth it).

Paul.

Reply via email to