speed things up
hi, how about the performance compare with others? any benchmark?
@linsea Here I have created couple with graphs: https://github.com/Albul/benchmarks-java-kotlin
Thanks @Albul that's really useful! Looks like there's lots of room for improvement in TreePVector.
And good to know about the ConsPStack recursion bugs, I'll make sure that's fixed in #75
@hrldcpr thanks. Also measurements in terms of size: https://github.com/Albul/sizeof-objects-java
It seems quite big usage, maybe because of using long key in IntTree<V>
Awesome thanks, that's very interesting and useful data
@Albul fyi the latest release—PCollections v3.1.3—fixes the stack overflow bugs you found, so if it's not too much trouble to re-run your benchmarks with the new version, I'd love to see the results
@BomBardyGamer shared another set of benchmarks, which could also be useful for speeding things up https://github.com/JohnnyJayJay/persistent-data-structures-benchmark