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