[Issue 6787] Lazy sort in Phobos?

[d-bugmail--- via Digitalmars-d-bugs]

https://issues.dlang.org/show_bug.cgi?id=6787

Iain Buclaw  changed:

   What|Removed |Added

   Priority|P2  |P4

--

[Issue 6787] Lazy sort in Phobos?

[via Digitalmars-d-bugs]

https://issues.dlang.org/show_bug.cgi?id=6787

Andrei Alexandrescu  changed:

   What|Removed |Added

   Keywords||bootcamp

--

[Issue 6787] Lazy sort in Phobos?

[d-bugmail]

http://d.puremagic.com/issues/show_bug.cgi?id=6787


Andrei Alexandrescu and...@metalanguage.com changed:

   What|Removed |Added

 CC||and...@metalanguage.com


--- Comment #1 from Andrei Alexandrescu and...@metalanguage.com 2011-10-07 
15:58:21 PDT ---
The canonical solution uses a heap. Creating a heap is cheap and quickly
amortized over only a few pops. An input range that creates a heap and then
yields one element at a time would be a better idea.

-- 
Configure issuemail: http://d.puremagic.com/issues/userprefs.cgi?tab=email
--- You are receiving this mail because: ---

[Issue 6787] Lazy sort in Phobos?

[d-bugmail]

http://d.puremagic.com/issues/show_bug.cgi?id=6787



--- Comment #2 from bearophile_h...@eml.cc 2011-10-07 16:21:35 PDT ---
(In reply to comment #1)
 The canonical solution uses a heap. Creating a heap is cheap and quickly
 amortized over only a few pops. An input range that creates a heap and then
 yields one element at a time would be a better idea.

If benchmarks show that a range that heapifies the input array is about as
efficient as a tailored lazy sorting solution for about 4 to 10 requested
max/min items, then I am OK with this idea :-)

-- 
Configure issuemail: http://d.puremagic.com/issues/userprefs.cgi?tab=email
--- You are receiving this mail because: ---