Paul Gearon posted a short rant on Java's verbosity and general clunkiness. The problem is to write a function that takes a string and returns a string containing the distinct characters of that string in sorted order. While Paul does provide a solution in java, he only alludes to the sort of function you might expect to write. So I thought I might have a go at the problem:
Assuming we have a string type, and a sorted-set in our standard library:
(lambda str (reverse-list->string (sorted-set-fold (compose cons flip) '() (string-fold insert (sorted-set) str))))Note: The reverse reduces the complexity from O(n^2 log m) to O(n log m)
3 lines. No mess, no fuss.