Thanks for the suggestion! natural-sort looks like what I want - I've just taken a quick look and the algorithm is almost the same if I'm not mistaken.

also thanks MarLinn - it's just that as I wrote I realized I've been implemented "tr" over and over again so there might be a common name for it. I do recognize there's a (***) out there

and hoogling (a, [a]) -> [a] doesn't yield any function of interest., didn't bother to go any further to see the rest of it is just a curried (:).

I'd still prefer "tr" though as for me if you think it as a rewrite rule, it's more readable than having a chain of function composition.

Cheers!

On Sat, Dec 8, 2018 at 6:34 AM Francesco Ariis <fa-ml@ariis.it> wrote:

On Sat, Dec 08, 2018 at 03:09:43PM +0100, Iustin Pop wrote:
> Apologies - given the ".12", I implicitly translated ".2" as ".20". Just
> a slow day :)

No worries, I have bitten by "0.x/0.x0" more times than I am willing to
admit :P
-F
_______________________________________________
Haskell-Cafe mailing list
To (un)subscribe, modify options or view archives go to:
http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe
Only members subscribed via the mailman list are allowed to post.

--

Javran (Fang) Cheng

_______________________________________________
Haskell-Cafe mailing list
To (un)subscribe, modify options or view archives go to:
http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe
Only members subscribed via the mailman list are allowed to post.