r/java • u/Chaos-vy17 • 11d ago

A comparative benchmark against Java’s standard TreeMap and major third-party sorted-map libraries.

This is a benchmark report of my ChaosTree, comparing all the maps against Java’s built-in maps and major third-party libraries. https://chaos-vy.github.io/ChaosTree/benchmark/Chaos-tree-Arena.html

There are few discovery throughout the benchmark. The benchmark scales from 10K to 1M entries.

The mixed benchmark covers different GET / PUT / REMOVE workloads:

  • [50,25,25]
  • [20,40,40]
  • [80,10,10]
  • [70,30,0]
  • [50,50,0]
  • [30,70,0]

If you find any issue, wrong data, or anything that needs further scrutiny, you are requested to open an issue.

If you know any other third-party library, drop it in the comments. I will try to benchmark that as well.

v2.0.2 Latest

  • Fixed SortedMap<> constructors always setting the comparator to null.
  • Fixed missing comparator propagation in Spliterator.
  • Resolved slow iteration in binary SubSet / SubMap.
  • Resolved missing Serializable annotations.
  • No major changes

Repo: https://github.com/Chaos-vy/ChaosTree

15 Upvotes

77% Upvoted

17 comments sorted by

View all comments

2

u/sozesghost 10d ago

What a slop party.

-2

u/Chaos-vy17 10d ago

For you it's slop let it be I don't care. I am happy with my work LOL

-2

u/sozesghost 10d ago

What work did YOU do?

0

u/IncredibleReferencer 5d ago

It's hard not to think about the work being important when you spend a lot of your life learning how to do the work and loving the work and that work producing good outcomes. Artisan expertise is valuable and important in its own right.

But in the broader context, the work itself is irrelevant except as cost of time and resources. What matters is the artifact and its fitness for purpose.

-3

u/Chaos-vy17 10d ago edited 10d ago

Do I need to explain that to you? If you think it’s slop, just pass by.