David Feuer

I'd like to clarify something: the reason I care about object code size is not that it takes up space on disk or in RAM, but that it takes up...

I can't figure out what LLVM is doing with this code.... I wonder if it actually expands it to yours, suggesting maybe I'm wasting my time. But benchmarking will tell,...

@sjakobi `insert` and `lookup` are well tested. I'll upload my validity checker later. I still don't understand how deletion works in @gereeter's code, so I couldn't get that working. I...

@sjakobi, here's my draft validity tester: ```haskell valid :: (Eq a, Show a) => IntMap a -> Property valid m0@(IntMap m0_) = -- This will catch errors very reliably, but...

Thanks to @gereeter's recent cleanups and explanations, I was finally able to adapt `delete` to the complementy version and get it to pass the tests. Complementy version of `compareMinBound`: ```haskell...

Do you think you could upload whatever you used to run that benchmark so I can play with it?

I find the size of these differences you report rather shocking, especially for deletion hit.

Yes. I think it's likely that we should make this change anyway, to get write-back for appends, but the comment definitely needs to be fixed!

I'm sorry I haven't commented on this; I somehow failed to see it come in. I think this is an intriguing idea. I'm not opposed to it, but I am...

@m-renaud I think this is probably the *best* example we've seen so far of something that might go in a `containers-extra` package. It's obviously useful, and it almost as obviously...