Chris Martin

I experimented using the typeclass "listlike" with the intention of writing structure agnostic algorithms. https://github.com/xpika/haskell-misc/blob/master/listlike.hs …

The only thing that comes to mind is HashMap in Java that switches between lists and red-black trees for items in every single bucket on the fly. No research there though, only barely readable implementation bc HashMap uses TreeNodes from LinkedHashMap that inherits from HashMap.

Obj-C's NSArray and V8's javascript array do this internally. They swap between a few implementations internally based on how you use the object.

You would need to know the statistics of your operations and statistics on probable ordering and ...

I’ve toyed around with this in a language; don’t think anyone’s done much with the idea. My goal was a little more general: give variables “roles” indicating *how they’re intended to be used* and use that to select a representation, as well as inferring roles from use sites.

It is basically query planning.

“Data structure synthesis”