### Question:
IntDoubleMap implements IHasSize { public double remove (final int key) { if (key == FREE_KEY) { if (!m_bHasFreeKey) return NO_VALUE; m_bHasFreeKey = false; final double ret = m_dFreeValue; m_dFreeValue = NO_VALUE; --m_nSize; return ret; } final int idx = _getReadIndex (key); if (idx == -1) return NO_VALUE; final double res = m_aValues[idx]; m_aValues[idx] = NO_VALUE; _shiftKeys (idx); --m_nSize; return res; } IntDoubleMap();  IntDoubleMap(final int nSize);  IntDoubleMap(final int nSize, final float fFillFactor); double get(final int key); double get(final int key, final double fDefault); double computeIfAbsent(final int key, @Nonnull final IKeyToValueFunction aProvider); double put(final int key, final double value); double remove(final int key); @Nonnegative int size(); boolean isEmpty(); void forEach(@Nonnull final IConsumer aConsumer); static final double NO_VALUE; }### Answer:
@Test public void testRemove () { for (final float ff : FILL_FACTORS) _testRemoveHelper (ff); }