https://hackage.haskell.org/package/containers-0.6.5.1/docs/...
log(n) slowdown to add in the end
but the cost to add in the middle is cheaper then the trivial array (see insertAt)
log(n) slowdown to add in the end
but the cost to add in the middle is cheaper then the trivial array (see insertAt)
I also mentioned sets, not lists.
But sets are also a mere log(n) away
https://hackage.haskell.org/package/containers-0.6.6/docs/Da...