A Comparison of Functional Data Structures on the JVM

by prosperoon 10/8/2018, 3:19:48 PM with 8 comments
  • by wmfivon 10/8/2018, 5:56:27 PM

    For those interested in this type of thing, Li Haoyi created an in depth look at the Scala structures.

    http://www.lihaoyi.com/post/BenchmarkingScalaCollections.htm...

    It includes some interesting commentary as well.

  • by jvicanon 10/8/2018, 6:53:15 PM

    Note that Scala 2.13 (next release) includes a CHAMP hash map implementation, first contributed by the original author and then refined by several Scala contributors, most notably Jason Zaugg (@retronym) and Josh (@joshlemer)

  • by agumonkeyon 10/8/2018, 6:26:41 PM

    reddit thread from a year ago https://www.reddit.com/r/programming/comments/5790ky/benchma...

  • by jphalimion 10/8/2018, 9:44:22 PM

    Thanks for sharing! One quick question: in the methodology section, you mention that the results are from a median value out of repeated runs. While I get that you run JITted code, you also mention that it makes the runs isolated from GC side-effects.

    Just out of curiosity, what did you do to ensure that GC would not interfere with the execution while the tests are running?

  • by _Codemonkeyismon 10/8/2018, 5:42:55 PM

    Pet peeve: I wish people would call them persistent or fork-on-write, but functional at least is better than immutable.

  • by the_arunon 10/8/2018, 9:18:06 PM

    I see you have written interfaces like List & Maps. Probably, we need to use interfaces from Java native, but provide better implementation through bifurcan. This makes it easy for existing applications to switch to bifurcan where they need.

  • by the_arunon 10/8/2018, 5:24:19 PM

    Indeed great work! Is Google's guava collections part of this research?

  • by ertucetinon 10/8/2018, 5:22:26 PM

    Great work!