On 6/22/18 2:15 PM, Steven Schveighoffer wrote:
On 6/22/18 1:41 PM, Stefan Koch wrote:
(I'd suggest a non-recursive mergesort.)

How will that perform in CTFE? I'm concerned about swapping values making it allocate new arrays all over the place.

This kind of sounded like a fun experiment, so I tried it:

https://run.dlang.io/gist/7c23567e0fa2e3b663d0b0695d3c257e

No idea of the performance or capability given hundreds of enum members, but something new to try.

-Steve

Reply via email to