[Haskell-cafe] Extensible states

[adam vogt]

On Tue, May 5, 2015 at 5:50 AM, Roman Cheplyaka <roma at ro-che.info> wrote:
> And if you care about speed, most (all?) extensible records give you
> O(n) access, so you'd be actually better off with a simple (Hash)Map.
>
> Roman

https://github.com/fumieval/extensible is an example that is log n lookup,
but it's not really clear (to me) that it would be faster for a real
program since you might have small records only, and maybe other operations
are slower.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.haskell.org/pipermail/haskell-cafe/attachments/20150505/3e494c3d/attachment.html>