Hi,
Sorry, I fear I was not clear. I wanted to compare LongOpenHashSet to
LongAVLTreeSet, LongRBTreeSet, and potentially LongOpenCustomHashSet,
where the strategy is to discard the most significant bits (assuming
values are really random).
My uses cases go for potentially hundred of thousands of sets and maps
with 10 to 100 elements each, up to maps with a million of element. To
be even more specific, I first create the set/map, then I look for
elements in it. I never delete.
Regards,
Arthur
> --
> You received this message because you are subscribed to the Google Groups "fastutil" group.
> To unsubscribe from this group and stop receiving emails from it, send an email to
fastutil+u...@googlegroups.com.
> To view this discussion on the web visit
https://groups.google.com/d/msgid/fastutil/71e680ad-1960-423e-9cc5-f3bfb344dcd6n%40googlegroups.com.