At Tue, 26 Aug 2008 08:38:45 +0100, Adrian Hey wrote: > I was looking at the definitions of nub (and hence nubBy) recently > in connection with a trac ticket and realised that this is O(n^2) > complexity! Ouch! Can we modify Data.List to include the big-O notation for all the functions similar to Data.Set, Data.Map, and bytestring? j.