Home/ Questions/Q 7011555
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-27T22:08:33+00:00

I am looking for a robust Map in Java, where the key lookup would

  • 0

I am looking for a robust Map in Java, where the key lookup would take into account that Double has a limited precision (something around 1e-15 or 1e-16). Where could I find such a thing?

EDIT: Following Jon’s advice I think it would make sense to define equivalence. One idea would be to center these at numbers rounded to 15 most relevant decimal digits. Other numbers would be rounded (in any consistent way – the fastest to implement). Would this make sense? What would be the best implementation?

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    IMHO The best approach is to normalise the values before adding or looking up values. e.g. by using rounding.

    BTW: You can use TDoubleObjectHashMap which support custom hash strategies and uses primitive double keys.

    • 0