[Haskell-cafe] dear traversable

[wren ng thornton]

wren ng thornton wrote:
> That O(n)+O(n) is much better than the O(n)*2*O(log n) 
> foldrWithKey/insert version. But it's still about the same as the 
> original 2*O(n) map fst/map snd version. With the primitive I mentioned 
> we could reduce the constant factor by about half.

Oops, the foldrWithKey/insert should be O(n) + n*2*O(log n).

-- 
Live well,
~wren