hpaste.el [1] is an Emacs Lisp library that integrates hpaste [2], the
Haskell pastebin, into Emacs. It provides two functions,
hpaste-paste-region and hpaste-paste-buffer, which send the region or
buffer to the hpaste server as required.
[1]: http://haskell.org/haskellwiki/Hpaste.el
[2]: http://
apfelmus wrote:
> Steffen Mazanek wrote:
>> From my understanding for small k's lazy
>> evaluation already does the trick for the naive quicksort
>> algorithm (quicksort smaller ++ [x] ++ quicksort greater),
>> doesn't it? Is there a search algorithm that makes better
>> use of lazy evaluation out
