TreePVector is slow

[blackdrag]

From [email protected] on 2009-03-30T02:18:33Z

according to tests.Benchmarks, TreePVector is the only PCollection which consistently
underperforms compared to its corresponding Java API class, ArrayList.

2-3 finger trees might provide a faster implementation, but there might also be some simple
bottleneck in the current code.

Original issue: http://code.google.com/p/pcollections/issues/detail?id=4

[Groostav]

According to this video i found somewhere on the internet,(and when has a man in a google wave t-shirt ever lead you wrong?) 2-3 finger trees are bad and the better datastructure is the Bitmapped Vector Trie with a large branching factor (32 in clojure) is the way to go.

I would really like to see this.

[blackdrag]

yeah, I have that on my hard disc for 6 months already... As soon as I have some free time I will add this