Proposal #2629: Data.List: Replace nub; add nubOrd, nubInt, nubWith

[Isaac Dupree]

David Roundy wrote:
> Actually, the asymptotic complexity (measured in terms of list length)
> of nubOrd is identical to the asymptotic complexity of nubAscii,
> nubBool or nubFinite.  They differ by a constant factor of the log(#
> possible data values).

except for infinite possible data values, such as Integer or 
String -- then they don't differ by a constant factor of 
infinity!  (And the constant factor on, say, Int64 and 
higher could be a lot larger than some implementations might 
be able to make it, I'm not sure)

-Isaac