Oops sorry I guess my point wasn't clear.

Why ord based when hashable is faster? Then there's no reason this has to
be in base, it can just be a free function in Data.HashSet. If stability is
a concern then there's a way to easily account for that using HashMap.

  - Clark
On Jul 14, 2013 7:48 AM, "Niklas Hambüchen" <m...@nh2.me> wrote:

> One of my main points is:
> Should we not add such a function (ord-based, same output as nub,
> stable, no sorting) to base?
> As the package counting shows, if we don't offer an alternative, people
> obviously use it, and not to our benefit.
> (Not to say it this way:
> We could make the Haskell world fast with smarter fusion, strictness
> analysis and LLVM backends.
> Or we could stop using quadratic algorithms.)
Haskell-Cafe mailing list

Reply via email to