Update benchmarks with results for new PCollections data structures.

[BomBardyGamer]

This is a great benchmark, and is very useful in showing the relative performance of persistent data structures when isolated from external factors. However, I noticed that the benchmarks are missing a PCollections equivalent for the linked set/map and the ordered set/map. I believe this is because the benchmark was made before these data structures were added to PCollections, so I wonder if it would be worth adding some benchmarks for these new data structures and getting some new results.

Specifically, the new structures are:

• Linked Set: OrderedPSet - doesn't seem to have a linked implementation, but the documentation specifies that the implementations are equivalent, and it's the entry order we're after here
• Linked Map: OrderedPMap - doesn't seem to have a linked implementation, but the documentation specifies that the implementations are equivalent, and it's the entry order we're after here
• Sorted Set: TreePSet
• Sorted Map: TreePMap

I'd be up to re-run the new benchmarks and provide you with some new results.

[JohnnyJayJay]

Thanks for the heads up! Yeah, that should be added. I'll see when I have time to do it.