Hash containers with floating point keys should use fixed-point backing store representation [HPPC-124]

[dweiss]

      while (!(Double.doubleToLongBits(existing = keys[slot]) == 0)) {
        if ((Double.doubleToLongBits(key) == Double.doubleToLongBits(existing))) {
          return true;
        }
        slot = (slot + 1) & mask;
      }

these should be peeled nicely by the JVM, but it'd be nice not to generate them.

---

Issue: HPPC-124 (migrated from JIRA), created by Dawid Weiss (@dweiss), updated May 21 2018

[dweiss]

Comment by Dawid Weiss (@dweiss) (migrated from JIRA)

This would allow one-time key normalization from floating point to a fixed representation, then everything would just work on ints or longs (including hashes). longBitsToDouble should be much faster for scanning through the array than the normalizing conversion the other way around.