[Haskell-cafe] Improving *> and >> for Data.Sequence

Ross Paterson R.Paterson at city.ac.uk
Wed Nov 19 18:50:04 UTC 2014


On Wed, Nov 19, 2014 at 01:05:13PM -0500, David Feuer wrote:
> Many thanks. I don't *think* it's ever been as bad as O(mn) (I'm pretty
> sure it's no worse than O(m log m log n) and it may well be better),

Oh right, there are m appends, each O(log n).


More information about the Haskell-Cafe mailing list