On Sunday, 14 October 2018 at 01:31:26 UTC, Jonathan M Davis
wrote:
Unless there's something about the implementation that's tied
to the list itself, I would think that it would make more sense
to make it a generic algorithm, then it will work with any
non-random-access range, and it avoids needing to reimplement
it for similar circumstances. IMHO, it really only makes sense
to tie it to the container if the implementation itself needs
to be for some reason.
- Jonathan M Davis
I'm currently using this...
https://dpaste.dzfl.pl/09ea7fa8c58c
you can delete/insert from anywhere in the list, sort it, and
even produce an array from it...
