ANN: Edison 1.2RC4

[Ross Paterson]

On Thu, Jun 01, 2006 at 11:57:47PM -0400, Jim Apple wrote:
> the source for BinaryRandList at
> http://www.eecs.tufts.edu/~rdocki01/edison/_darcs/current/edison-core/src/Data/Edison/Seq/BinaryRandList.hs
> , I don't think the constant time bounds in the documentation are
> correct for this sequence type.

Indeed not.  If you have a sequence of exactly 2^n elements and then
alternate between tail and cons, each operation will cost O(log n).